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
{
54 struct pending_template
*next
;
55 struct tinst_level
*tinst
;
58 static GTY(()) struct pending_template
*pending_templates
;
59 static GTY(()) struct pending_template
*last_pending_template
;
61 int processing_template_parmlist
;
62 static int template_header_count
;
64 static GTY(()) tree saved_trees
;
65 static vec
<int> inline_parm_levels
;
67 static GTY(()) struct tinst_level
*current_tinst_level
;
69 static GTY(()) tree saved_access_scope
;
71 /* Live only within one (recursive) call to tsubst_expr. We use
72 this to pass the statement expression node from the STMT_EXPR
73 to the EXPR_STMT that is its result. */
74 static tree cur_stmt_expr
;
76 // -------------------------------------------------------------------------- //
77 // Local Specialization Stack
79 // Implementation of the RAII helper for creating new local
81 local_specialization_stack::local_specialization_stack (lss_policy policy
)
82 : saved (local_specializations
)
84 if (policy
== lss_blank
|| !saved
)
85 local_specializations
= new hash_map
<tree
, tree
>;
87 local_specializations
= new hash_map
<tree
, tree
>(*saved
);
90 local_specialization_stack::~local_specialization_stack ()
92 delete local_specializations
;
93 local_specializations
= saved
;
96 /* True if we've recursed into fn_type_unification too many times. */
97 static bool excessive_deduction_depth
;
99 struct GTY((for_user
)) spec_entry
106 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
108 static hashval_t
hash (spec_entry
*);
109 static bool equal (spec_entry
*, spec_entry
*);
112 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
114 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
116 /* Contains canonical template parameter types. The vector is indexed by
117 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
118 TREE_LIST, whose TREE_VALUEs contain the canonical template
119 parameters of various types and levels. */
120 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
122 #define UNIFY_ALLOW_NONE 0
123 #define UNIFY_ALLOW_MORE_CV_QUAL 1
124 #define UNIFY_ALLOW_LESS_CV_QUAL 2
125 #define UNIFY_ALLOW_DERIVED 4
126 #define UNIFY_ALLOW_INTEGER 8
127 #define UNIFY_ALLOW_OUTER_LEVEL 16
128 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
129 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
131 enum template_base_result
{
133 tbr_ambiguous_baseclass
,
137 static void push_access_scope (tree
);
138 static void pop_access_scope (tree
);
139 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
140 unification_kind_t
, int,
142 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
143 unification_kind_t
, int, bool, bool);
144 static int unify (tree
, tree
, tree
, tree
, int, bool);
145 static void add_pending_template (tree
);
146 static tree
reopen_tinst_level (struct tinst_level
*);
147 static tree
tsubst_initializer_list (tree
, tree
);
148 static tree
get_partial_spec_bindings (tree
, tree
, tree
);
149 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
151 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
153 static void tsubst_enum (tree
, tree
, tree
);
154 static tree
add_to_template_args (tree
, tree
);
155 static tree
add_outermost_template_args (tree
, tree
);
156 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
157 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
159 static int type_unification_real (tree
, tree
, tree
, const tree
*,
160 unsigned int, int, unification_kind_t
, int,
161 vec
<deferred_access_check
, va_gc
> **,
163 static void note_template_header (int);
164 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
165 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
166 static tree
convert_template_argument (tree
, tree
, tree
,
167 tsubst_flags_t
, int, tree
);
168 static tree
for_each_template_parm (tree
, tree_fn_t
, void*,
169 hash_set
<tree
> *, bool, tree_fn_t
= NULL
);
170 static tree
expand_template_argument_pack (tree
);
171 static tree
build_template_parm_index (int, int, int, tree
, tree
);
172 static bool inline_needs_template_parms (tree
, bool);
173 static void push_inline_template_parms_recursive (tree
, int);
174 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
175 static int mark_template_parm (tree
, void *);
176 static int template_parm_this_level_p (tree
, void *);
177 static tree
tsubst_friend_function (tree
, tree
);
178 static tree
tsubst_friend_class (tree
, tree
);
179 static int can_complete_type_without_circularity (tree
);
180 static tree
get_bindings (tree
, tree
, tree
, bool);
181 static int template_decl_level (tree
);
182 static int check_cv_quals_for_unify (int, tree
, tree
);
183 static void template_parm_level_and_index (tree
, int*, int*);
184 static int unify_pack_expansion (tree
, tree
, tree
,
185 tree
, unification_kind_t
, bool, bool);
186 static tree
copy_template_args (tree
);
187 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
188 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
189 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
190 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
191 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
192 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
193 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
194 static bool check_specialization_scope (void);
195 static tree
process_partial_specialization (tree
);
196 static void set_current_access_from_decl (tree
);
197 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
199 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
200 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
202 static bool template_template_parm_bindings_ok_p (tree
, tree
);
203 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
204 static tree
for_each_template_parm_r (tree
*, int *, void *);
205 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
206 static void copy_default_args_to_explicit_spec (tree
);
207 static bool invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
208 static bool dependent_template_arg_p (tree
);
209 static bool any_template_arguments_need_structural_equality_p (tree
);
210 static bool dependent_type_p_r (tree
);
211 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
212 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
213 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
214 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
216 static tree
listify (tree
);
217 static tree
listify_autos (tree
, tree
);
218 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
219 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
220 static bool complex_alias_template_p (const_tree tmpl
);
221 static tree
tsubst_attributes (tree
, tree
, tsubst_flags_t
, tree
);
222 static tree
canonicalize_expr_argument (tree
, tsubst_flags_t
);
223 static tree
make_argument_pack (tree
);
224 static void register_parameter_specializations (tree
, tree
);
225 static tree
enclosing_instantiation_of (tree tctx
);
227 /* Make the current scope suitable for access checking when we are
228 processing T. T can be FUNCTION_DECL for instantiated function
229 template, VAR_DECL for static member variable, or TYPE_DECL for
230 alias template (needed by instantiate_decl). */
233 push_access_scope (tree t
)
235 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
236 || TREE_CODE (t
) == TYPE_DECL
);
238 if (DECL_FRIEND_CONTEXT (t
))
239 push_nested_class (DECL_FRIEND_CONTEXT (t
));
240 else if (DECL_CLASS_SCOPE_P (t
))
241 push_nested_class (DECL_CONTEXT (t
));
243 push_to_top_level ();
245 if (TREE_CODE (t
) == FUNCTION_DECL
)
247 saved_access_scope
= tree_cons
248 (NULL_TREE
, current_function_decl
, saved_access_scope
);
249 current_function_decl
= t
;
253 /* Restore the scope set up by push_access_scope. T is the node we
257 pop_access_scope (tree t
)
259 if (TREE_CODE (t
) == FUNCTION_DECL
)
261 current_function_decl
= TREE_VALUE (saved_access_scope
);
262 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
265 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
268 pop_from_top_level ();
271 /* Do any processing required when DECL (a member template
272 declaration) is finished. Returns the TEMPLATE_DECL corresponding
273 to DECL, unless it is a specialization, in which case the DECL
274 itself is returned. */
277 finish_member_template_decl (tree decl
)
279 if (decl
== error_mark_node
)
280 return error_mark_node
;
282 gcc_assert (DECL_P (decl
));
284 if (TREE_CODE (decl
) == TYPE_DECL
)
288 type
= TREE_TYPE (decl
);
289 if (type
== error_mark_node
)
290 return error_mark_node
;
291 if (MAYBE_CLASS_TYPE_P (type
)
292 && CLASSTYPE_TEMPLATE_INFO (type
)
293 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
295 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
296 check_member_template (tmpl
);
301 else if (TREE_CODE (decl
) == FIELD_DECL
)
302 error ("data member %qD cannot be a member template", decl
);
303 else if (DECL_TEMPLATE_INFO (decl
))
305 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
307 check_member_template (DECL_TI_TEMPLATE (decl
));
308 return DECL_TI_TEMPLATE (decl
);
314 error ("invalid member template declaration %qD", decl
);
316 return error_mark_node
;
319 /* Create a template info node. */
322 build_template_info (tree template_decl
, tree template_args
)
324 tree result
= make_node (TEMPLATE_INFO
);
325 TI_TEMPLATE (result
) = template_decl
;
326 TI_ARGS (result
) = template_args
;
330 /* Return the template info node corresponding to T, whatever T is. */
333 get_template_info (const_tree t
)
335 tree tinfo
= NULL_TREE
;
337 if (!t
|| t
== error_mark_node
)
340 if (TREE_CODE (t
) == NAMESPACE_DECL
341 || TREE_CODE (t
) == PARM_DECL
)
344 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
345 tinfo
= DECL_TEMPLATE_INFO (t
);
347 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
350 if (OVERLOAD_TYPE_P (t
))
351 tinfo
= TYPE_TEMPLATE_INFO (t
);
352 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
353 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
358 /* Returns the template nesting level of the indicated class TYPE.
368 A<T>::B<U> has depth two, while A<T> has depth one.
369 Both A<T>::B<int> and A<int>::B<U> have depth one, if
370 they are instantiations, not specializations.
372 This function is guaranteed to return 0 if passed NULL_TREE so
373 that, for example, `template_class_depth (current_class_type)' is
377 template_class_depth (tree type
)
381 for (depth
= 0; type
&& TREE_CODE (type
) != NAMESPACE_DECL
; )
383 tree tinfo
= get_template_info (type
);
385 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
386 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
390 type
= CP_DECL_CONTEXT (type
);
391 else if (LAMBDA_TYPE_P (type
))
392 type
= LAMBDA_TYPE_EXTRA_SCOPE (type
);
394 type
= CP_TYPE_CONTEXT (type
);
400 /* Subroutine of maybe_begin_member_template_processing.
401 Returns true if processing DECL needs us to push template parms. */
404 inline_needs_template_parms (tree decl
, bool nsdmi
)
406 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
409 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
410 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
413 /* Subroutine of maybe_begin_member_template_processing.
414 Push the template parms in PARMS, starting from LEVELS steps into the
415 chain, and ending at the beginning, since template parms are listed
419 push_inline_template_parms_recursive (tree parmlist
, int levels
)
421 tree parms
= TREE_VALUE (parmlist
);
425 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
427 ++processing_template_decl
;
428 current_template_parms
429 = tree_cons (size_int (processing_template_decl
),
430 parms
, current_template_parms
);
431 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
433 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
435 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
437 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
439 if (error_operand_p (parm
))
442 gcc_assert (DECL_P (parm
));
444 switch (TREE_CODE (parm
))
452 /* Push the CONST_DECL. */
453 pushdecl (TEMPLATE_PARM_DECL (DECL_INITIAL (parm
)));
462 /* Restore the template parameter context for a member template, a
463 friend template defined in a class definition, or a non-template
464 member of template class. */
467 maybe_begin_member_template_processing (tree decl
)
471 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
475 tree ctx
= DECL_CONTEXT (decl
);
476 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
477 /* Disregard full specializations (c++/60999). */
478 && uses_template_parms (ctx
)
479 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
482 if (inline_needs_template_parms (decl
, nsdmi
))
484 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
485 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
487 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
490 parms
= TREE_CHAIN (parms
);
493 push_inline_template_parms_recursive (parms
, levels
);
496 /* Remember how many levels of template parameters we pushed so that
497 we can pop them later. */
498 inline_parm_levels
.safe_push (levels
);
501 /* Undo the effects of maybe_begin_member_template_processing. */
504 maybe_end_member_template_processing (void)
509 if (inline_parm_levels
.length () == 0)
512 last
= inline_parm_levels
.pop ();
513 for (i
= 0; i
< last
; ++i
)
515 --processing_template_decl
;
516 current_template_parms
= TREE_CHAIN (current_template_parms
);
521 /* Return a new template argument vector which contains all of ARGS,
522 but has as its innermost set of arguments the EXTRA_ARGS. */
525 add_to_template_args (tree args
, tree extra_args
)
532 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
535 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
536 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
538 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
539 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
541 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
542 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
547 /* Like add_to_template_args, but only the outermost ARGS are added to
548 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
549 (EXTRA_ARGS) levels are added. This function is used to combine
550 the template arguments from a partial instantiation with the
551 template arguments used to attain the full instantiation from the
552 partial instantiation. */
555 add_outermost_template_args (tree args
, tree extra_args
)
559 /* If there are more levels of EXTRA_ARGS than there are ARGS,
560 something very fishy is going on. */
561 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
563 /* If *all* the new arguments will be the EXTRA_ARGS, just return
565 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
568 /* For the moment, we make ARGS look like it contains fewer levels. */
569 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
571 new_args
= add_to_template_args (args
, extra_args
);
573 /* Now, we restore ARGS to its full dimensions. */
574 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
579 /* Return the N levels of innermost template arguments from the ARGS. */
582 get_innermost_template_args (tree args
, int n
)
590 /* If N is 1, just return the innermost set of template arguments. */
592 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
594 /* If we're not removing anything, just return the arguments we were
596 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
597 gcc_assert (extra_levels
>= 0);
598 if (extra_levels
== 0)
601 /* Make a new set of arguments, not containing the outer arguments. */
602 new_args
= make_tree_vec (n
);
603 for (i
= 1; i
<= n
; ++i
)
604 SET_TMPL_ARGS_LEVEL (new_args
, i
,
605 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
610 /* The inverse of get_innermost_template_args: Return all but the innermost
611 EXTRA_LEVELS levels of template arguments from the ARGS. */
614 strip_innermost_template_args (tree args
, int extra_levels
)
617 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
622 /* If N is 1, just return the outermost set of template arguments. */
624 return TMPL_ARGS_LEVEL (args
, 1);
626 /* If we're not removing anything, just return the arguments we were
628 gcc_assert (extra_levels
>= 0);
629 if (extra_levels
== 0)
632 /* Make a new set of arguments, not containing the inner arguments. */
633 new_args
= make_tree_vec (n
);
634 for (i
= 1; i
<= n
; ++i
)
635 SET_TMPL_ARGS_LEVEL (new_args
, i
,
636 TMPL_ARGS_LEVEL (args
, i
));
641 /* We've got a template header coming up; push to a new level for storing
645 begin_template_parm_list (void)
647 /* We use a non-tag-transparent scope here, which causes pushtag to
648 put tags in this scope, rather than in the enclosing class or
649 namespace scope. This is the right thing, since we want
650 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
651 global template class, push_template_decl handles putting the
652 TEMPLATE_DECL into top-level scope. For a nested template class,
655 template <class T> struct S1 {
656 template <class T> struct S2 {};
659 pushtag contains special code to insert the TEMPLATE_DECL for S2
660 at the right scope. */
661 begin_scope (sk_template_parms
, NULL
);
662 ++processing_template_decl
;
663 ++processing_template_parmlist
;
664 note_template_header (0);
666 /* Add a dummy parameter level while we process the parameter list. */
667 current_template_parms
668 = tree_cons (size_int (processing_template_decl
),
670 current_template_parms
);
673 /* This routine is called when a specialization is declared. If it is
674 invalid to declare a specialization here, an error is reported and
675 false is returned, otherwise this routine will return true. */
678 check_specialization_scope (void)
680 tree scope
= current_scope ();
684 An explicit specialization shall be declared in the namespace of
685 which the template is a member, or, for member templates, in the
686 namespace of which the enclosing class or enclosing class
687 template is a member. An explicit specialization of a member
688 function, member class or static data member of a class template
689 shall be declared in the namespace of which the class template
691 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
693 error ("explicit specialization in non-namespace scope %qD", scope
);
699 In an explicit specialization declaration for a member of a class
700 template or a member template that appears in namespace scope,
701 the member template and some of its enclosing class templates may
702 remain unspecialized, except that the declaration shall not
703 explicitly specialize a class member template if its enclosing
704 class templates are not explicitly specialized as well. */
705 if (current_template_parms
)
707 error ("enclosing class templates are not explicitly specialized");
714 /* We've just seen template <>. */
717 begin_specialization (void)
719 begin_scope (sk_template_spec
, NULL
);
720 note_template_header (1);
721 return check_specialization_scope ();
724 /* Called at then end of processing a declaration preceded by
728 end_specialization (void)
731 reset_specialization ();
734 /* Any template <>'s that we have seen thus far are not referring to a
735 function specialization. */
738 reset_specialization (void)
740 processing_specialization
= 0;
741 template_header_count
= 0;
744 /* We've just seen a template header. If SPECIALIZATION is nonzero,
745 it was of the form template <>. */
748 note_template_header (int specialization
)
750 processing_specialization
= specialization
;
751 template_header_count
++;
754 /* We're beginning an explicit instantiation. */
757 begin_explicit_instantiation (void)
759 gcc_assert (!processing_explicit_instantiation
);
760 processing_explicit_instantiation
= true;
765 end_explicit_instantiation (void)
767 gcc_assert (processing_explicit_instantiation
);
768 processing_explicit_instantiation
= false;
771 /* An explicit specialization or partial specialization of TMPL is being
772 declared. Check that the namespace in which the specialization is
773 occurring is permissible. Returns false iff it is invalid to
774 specialize TMPL in the current namespace. */
777 check_specialization_namespace (tree tmpl
)
779 tree tpl_ns
= decl_namespace_context (tmpl
);
783 An explicit specialization shall be declared in a namespace enclosing the
784 specialized template. An explicit specialization whose declarator-id is
785 not qualified shall be declared in the nearest enclosing namespace of the
786 template, or, if the namespace is inline (7.3.1), any namespace from its
787 enclosing namespace set. */
788 if (current_scope() != DECL_CONTEXT (tmpl
)
789 && !at_namespace_scope_p ())
791 error ("specialization of %qD must appear at namespace scope", tmpl
);
795 if (is_nested_namespace (current_namespace
, tpl_ns
, cxx_dialect
< cxx11
))
796 /* Same or enclosing namespace. */
800 permerror (input_location
,
801 "specialization of %qD in different namespace", tmpl
);
802 inform (DECL_SOURCE_LOCATION (tmpl
),
803 " from definition of %q#D", tmpl
);
808 /* SPEC is an explicit instantiation. Check that it is valid to
809 perform this explicit instantiation in the current namespace. */
812 check_explicit_instantiation_namespace (tree spec
)
816 /* DR 275: An explicit instantiation shall appear in an enclosing
817 namespace of its template. */
818 ns
= decl_namespace_context (spec
);
819 if (!is_nested_namespace (current_namespace
, ns
))
820 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
821 "(which does not enclose namespace %qD)",
822 spec
, current_namespace
, ns
);
825 // Returns the type of a template specialization only if that
826 // specialization needs to be defined. Otherwise (e.g., if the type has
827 // already been defined), the function returns NULL_TREE.
829 maybe_new_partial_specialization (tree type
)
831 // An implicit instantiation of an incomplete type implies
832 // the definition of a new class template.
834 // template<typename T>
837 // template<typename T>
840 // Here, S<T*> is an implicit instantiation of S whose type
842 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
845 // It can also be the case that TYPE is a completed specialization.
846 // Continuing the previous example, suppose we also declare:
848 // template<typename T>
849 // requires Integral<T>
852 // Here, S<T*> refers to the specialization S<T*> defined
853 // above. However, we need to differentiate definitions because
854 // we intend to define a new partial specialization. In this case,
855 // we rely on the fact that the constraints are different for
856 // this declaration than that above.
858 // Note that we also get here for injected class names and
859 // late-parsed template definitions. We must ensure that we
860 // do not create new type declarations for those cases.
861 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
863 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
864 tree args
= CLASSTYPE_TI_ARGS (type
);
866 // If there are no template parameters, this cannot be a new
867 // partial template specializtion?
868 if (!current_template_parms
)
871 // The injected-class-name is not a new partial specialization.
872 if (DECL_SELF_REFERENCE_P (TYPE_NAME (type
)))
875 // If the constraints are not the same as those of the primary
876 // then, we can probably create a new specialization.
877 tree type_constr
= current_template_constraints ();
879 if (type
== TREE_TYPE (tmpl
))
881 tree main_constr
= get_constraints (tmpl
);
882 if (equivalent_constraints (type_constr
, main_constr
))
886 // Also, if there's a pre-existing specialization with matching
887 // constraints, then this also isn't new.
888 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
891 tree spec_tmpl
= TREE_VALUE (specs
);
892 tree spec_args
= TREE_PURPOSE (specs
);
893 tree spec_constr
= get_constraints (spec_tmpl
);
894 if (comp_template_args (args
, spec_args
)
895 && equivalent_constraints (type_constr
, spec_constr
))
897 specs
= TREE_CHAIN (specs
);
900 // Create a new type node (and corresponding type decl)
901 // for the newly declared specialization.
902 tree t
= make_class_type (TREE_CODE (type
));
903 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
904 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
906 /* We only need a separate type node for storing the definition of this
907 partial specialization; uses of S<T*> are unconstrained, so all are
908 equivalent. So keep TYPE_CANONICAL the same. */
909 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
911 // Build the corresponding type decl.
912 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
913 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
914 DECL_SOURCE_LOCATION (d
) = input_location
;
922 /* The TYPE is being declared. If it is a template type, that means it
923 is a partial specialization. Do appropriate error-checking. */
926 maybe_process_partial_specialization (tree type
)
930 if (type
== error_mark_node
)
931 return error_mark_node
;
933 /* A lambda that appears in specialization context is not itself a
935 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
938 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
940 error ("name of class shadows template template parameter %qD",
942 return error_mark_node
;
945 context
= TYPE_CONTEXT (type
);
947 if (TYPE_ALIAS_P (type
))
949 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (type
);
951 if (tinfo
&& DECL_ALIAS_TEMPLATE_P (TI_TEMPLATE (tinfo
)))
952 error ("specialization of alias template %qD",
953 TI_TEMPLATE (tinfo
));
955 error ("explicit specialization of non-template %qT", type
);
956 return error_mark_node
;
958 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
960 /* This is for ordinary explicit specialization and partial
961 specialization of a template class such as:
963 template <> class C<int>;
967 template <class T> class C<T*>;
969 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
971 if (tree t
= maybe_new_partial_specialization (type
))
973 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
974 && !at_namespace_scope_p ())
975 return error_mark_node
;
976 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
977 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
978 if (processing_template_decl
)
980 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
981 if (decl
== error_mark_node
)
982 return error_mark_node
;
983 return TREE_TYPE (decl
);
986 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
987 error ("specialization of %qT after instantiation", type
);
988 else if (errorcount
&& !processing_specialization
989 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
990 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
991 /* Trying to define a specialization either without a template<> header
992 or in an inappropriate place. We've already given an error, so just
993 bail now so we don't actually define the specialization. */
994 return error_mark_node
;
996 else if (CLASS_TYPE_P (type
)
997 && !CLASSTYPE_USE_TEMPLATE (type
)
998 && CLASSTYPE_TEMPLATE_INFO (type
)
999 && context
&& CLASS_TYPE_P (context
)
1000 && CLASSTYPE_TEMPLATE_INFO (context
))
1002 /* This is for an explicit specialization of member class
1003 template according to [temp.expl.spec/18]:
1005 template <> template <class U> class C<int>::D;
1007 The context `C<int>' must be an implicit instantiation.
1008 Otherwise this is just a member class template declared
1011 template <> class C<int> { template <class U> class D; };
1012 template <> template <class U> class C<int>::D;
1014 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1015 while in the second case, `C<int>::D' is a primary template
1016 and `C<T>::D' may not exist. */
1018 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1019 && !COMPLETE_TYPE_P (type
))
1022 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1024 if (current_namespace
1025 != decl_namespace_context (tmpl
))
1027 permerror (input_location
,
1028 "specializing %q#T in different namespace", type
);
1029 permerror (DECL_SOURCE_LOCATION (tmpl
),
1030 " from definition of %q#D", tmpl
);
1033 /* Check for invalid specialization after instantiation:
1035 template <> template <> class C<int>::D<int>;
1036 template <> template <class U> class C<int>::D; */
1038 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1039 t
; t
= TREE_CHAIN (t
))
1041 tree inst
= TREE_VALUE (t
);
1042 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1043 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1045 /* We already have a full specialization of this partial
1046 instantiation, or a full specialization has been
1047 looked up but not instantiated. Reassign it to the
1048 new member specialization template. */
1052 elt
.tmpl
= most_general_template (tmpl
);
1053 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1056 type_specializations
->remove_elt (&elt
);
1059 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1062 = type_specializations
->find_slot (&elt
, INSERT
);
1063 entry
= ggc_alloc
<spec_entry
> ();
1068 /* But if we've had an implicit instantiation, that's a
1069 problem ([temp.expl.spec]/6). */
1070 error ("specialization %qT after instantiation %qT",
1074 /* Mark TYPE as a specialization. And as a result, we only
1075 have one level of template argument for the innermost
1077 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1078 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1079 CLASSTYPE_TI_ARGS (type
)
1080 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1083 else if (processing_specialization
)
1085 /* Someday C++0x may allow for enum template specialization. */
1086 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1087 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1088 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1089 "of %qD not allowed by ISO C++", type
);
1092 error ("explicit specialization of non-template %qT", type
);
1093 return error_mark_node
;
1100 /* Returns nonzero if we can optimize the retrieval of specializations
1101 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1102 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1105 optimize_specialization_lookup_p (tree tmpl
)
1107 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1108 && DECL_CLASS_SCOPE_P (tmpl
)
1109 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1111 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1112 /* The optimized lookup depends on the fact that the
1113 template arguments for the member function template apply
1114 purely to the containing class, which is not true if the
1115 containing class is an explicit or partial
1117 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1118 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1119 && !DECL_CONV_FN_P (tmpl
)
1120 /* It is possible to have a template that is not a member
1121 template and is not a member of a template class:
1123 template <typename T>
1124 struct S { friend A::f(); };
1126 Here, the friend function is a template, but the context does
1127 not have template information. The optimized lookup relies
1128 on having ARGS be the template arguments for both the class
1129 and the function template. */
1130 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1133 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1134 gone through coerce_template_parms by now. */
1137 verify_unstripped_args_1 (tree inner
)
1139 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1141 tree arg
= TREE_VEC_ELT (inner
, i
);
1142 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1144 else if (TYPE_P (arg
))
1145 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1146 else if (ARGUMENT_PACK_P (arg
))
1147 verify_unstripped_args_1 (ARGUMENT_PACK_ARGS (arg
));
1148 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1149 /* Allow typedefs on the type of a non-type argument, since a
1150 parameter can have them. */;
1152 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1157 verify_unstripped_args (tree args
)
1159 ++processing_template_decl
;
1160 if (!any_dependent_template_arguments_p (args
))
1161 verify_unstripped_args_1 (INNERMOST_TEMPLATE_ARGS (args
));
1162 --processing_template_decl
;
1165 /* Retrieve the specialization (in the sense of [temp.spec] - a
1166 specialization is either an instantiation or an explicit
1167 specialization) of TMPL for the given template ARGS. If there is
1168 no such specialization, return NULL_TREE. The ARGS are a vector of
1169 arguments, or a vector of vectors of arguments, in the case of
1170 templates with more than one level of parameters.
1172 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1173 then we search for a partial specialization matching ARGS. This
1174 parameter is ignored if TMPL is not a class template.
1176 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1177 result is a NONTYPE_ARGUMENT_PACK. */
1180 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1182 if (tmpl
== NULL_TREE
)
1185 if (args
== error_mark_node
)
1188 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1189 || TREE_CODE (tmpl
) == FIELD_DECL
);
1191 /* There should be as many levels of arguments as there are
1192 levels of parameters. */
1193 gcc_assert (TMPL_ARGS_DEPTH (args
)
1194 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1195 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1196 : template_class_depth (DECL_CONTEXT (tmpl
))));
1199 verify_unstripped_args (args
);
1201 /* Lambda functions in templates aren't instantiated normally, but through
1202 tsubst_lambda_expr. */
1203 if (lambda_fn_in_template_p (tmpl
))
1206 if (optimize_specialization_lookup_p (tmpl
))
1208 /* The template arguments actually apply to the containing
1209 class. Find the class specialization with those
1211 tree class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1212 tree class_specialization
1213 = retrieve_specialization (class_template
, args
, 0);
1214 if (!class_specialization
)
1217 /* Find the instance of TMPL. */
1218 tree fns
= get_class_binding (class_specialization
, DECL_NAME (tmpl
));
1219 for (ovl_iterator
iter (fns
); iter
; ++iter
)
1222 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1223 /* using-declarations can add base methods to the method vec,
1224 and we don't want those here. */
1225 && DECL_CONTEXT (fn
) == class_specialization
)
1234 hash_table
<spec_hasher
> *specializations
;
1238 elt
.spec
= NULL_TREE
;
1240 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1241 specializations
= type_specializations
;
1243 specializations
= decl_specializations
;
1246 hash
= spec_hasher::hash (&elt
);
1247 found
= specializations
->find_with_hash (&elt
, hash
);
1255 /* Like retrieve_specialization, but for local declarations. */
1258 retrieve_local_specialization (tree tmpl
)
1260 if (local_specializations
== NULL
)
1263 tree
*slot
= local_specializations
->get (tmpl
);
1264 return slot
? *slot
: NULL_TREE
;
1267 /* Returns nonzero iff DECL is a specialization of TMPL. */
1270 is_specialization_of (tree decl
, tree tmpl
)
1274 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1278 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1284 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1286 for (t
= TREE_TYPE (decl
);
1288 t
= CLASSTYPE_USE_TEMPLATE (t
)
1289 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1290 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1297 /* Returns nonzero iff DECL is a specialization of friend declaration
1298 FRIEND_DECL according to [temp.friend]. */
1301 is_specialization_of_friend (tree decl
, tree friend_decl
)
1303 bool need_template
= true;
1306 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1307 || TREE_CODE (decl
) == TYPE_DECL
);
1309 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1310 of a template class, we want to check if DECL is a specialization
1312 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1313 && DECL_TEMPLATE_INFO (friend_decl
)
1314 && !DECL_USE_TEMPLATE (friend_decl
))
1316 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1317 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1318 need_template
= false;
1320 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1321 && !PRIMARY_TEMPLATE_P (friend_decl
))
1322 need_template
= false;
1324 /* There is nothing to do if this is not a template friend. */
1325 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1328 if (is_specialization_of (decl
, friend_decl
))
1332 A member of a class template may be declared to be a friend of a
1333 non-template class. In this case, the corresponding member of
1334 every specialization of the class template is a friend of the
1335 class granting friendship.
1337 For example, given a template friend declaration
1339 template <class T> friend void A<T>::f();
1341 the member function below is considered a friend
1343 template <> struct A<int> {
1347 For this type of template friend, TEMPLATE_DEPTH below will be
1348 nonzero. To determine if DECL is a friend of FRIEND, we first
1349 check if the enclosing class is a specialization of another. */
1351 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1353 && DECL_CLASS_SCOPE_P (decl
)
1354 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1355 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1357 /* Next, we check the members themselves. In order to handle
1358 a few tricky cases, such as when FRIEND_DECL's are
1360 template <class T> friend void A<T>::g(T t);
1361 template <class T> template <T t> friend void A<T>::h();
1365 void A<int>::g(int);
1366 template <int> void A<int>::h();
1368 we need to figure out ARGS, the template arguments from
1369 the context of DECL. This is required for template substitution
1370 of `T' in the function parameter of `g' and template parameter
1371 of `h' in the above examples. Here ARGS corresponds to `int'. */
1373 tree context
= DECL_CONTEXT (decl
);
1374 tree args
= NULL_TREE
;
1375 int current_depth
= 0;
1377 while (current_depth
< template_depth
)
1379 if (CLASSTYPE_TEMPLATE_INFO (context
))
1381 if (current_depth
== 0)
1382 args
= TYPE_TI_ARGS (context
);
1384 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1387 context
= TYPE_CONTEXT (context
);
1390 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1395 tree friend_args_type
;
1396 tree decl_args_type
;
1398 /* Make sure that both DECL and FRIEND_DECL are templates or
1400 is_template
= DECL_TEMPLATE_INFO (decl
)
1401 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1402 if (need_template
^ is_template
)
1404 else if (is_template
)
1406 /* If both are templates, check template parameter list. */
1408 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1410 if (!comp_template_parms
1411 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1415 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1418 decl_type
= TREE_TYPE (decl
);
1420 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1421 tf_none
, NULL_TREE
);
1422 if (friend_type
== error_mark_node
)
1425 /* Check if return types match. */
1426 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1429 /* Check if function parameter types match, ignoring the
1430 `this' parameter. */
1431 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1432 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1433 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1434 friend_args_type
= TREE_CHAIN (friend_args_type
);
1435 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1436 decl_args_type
= TREE_CHAIN (decl_args_type
);
1438 return compparms (decl_args_type
, friend_args_type
);
1442 /* DECL is a TYPE_DECL */
1444 tree decl_type
= TREE_TYPE (decl
);
1446 /* Make sure that both DECL and FRIEND_DECL are templates or
1449 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1450 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1452 if (need_template
^ is_template
)
1454 else if (is_template
)
1457 /* If both are templates, check the name of the two
1458 TEMPLATE_DECL's first because is_friend didn't. */
1459 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1460 != DECL_NAME (friend_decl
))
1463 /* Now check template parameter list. */
1465 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1467 return comp_template_parms
1468 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1472 return (DECL_NAME (decl
)
1473 == DECL_NAME (friend_decl
));
1479 /* Register the specialization SPEC as a specialization of TMPL with
1480 the indicated ARGS. IS_FRIEND indicates whether the specialization
1481 is actually just a friend declaration. ATTRLIST is the list of
1482 attributes that the specialization is declared with or NULL when
1483 it isn't. Returns SPEC, or an equivalent prior declaration, if
1486 We also store instantiations of field packs in the hash table, even
1487 though they are not themselves templates, to make lookup easier. */
1490 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1494 spec_entry
**slot
= NULL
;
1497 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1498 || (TREE_CODE (tmpl
) == FIELD_DECL
1499 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1501 if (TREE_CODE (spec
) == FUNCTION_DECL
1502 && uses_template_parms (DECL_TI_ARGS (spec
)))
1503 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1504 register it; we want the corresponding TEMPLATE_DECL instead.
1505 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1506 the more obvious `uses_template_parms (spec)' to avoid problems
1507 with default function arguments. In particular, given
1508 something like this:
1510 template <class T> void f(T t1, T t = T())
1512 the default argument expression is not substituted for in an
1513 instantiation unless and until it is actually needed. */
1516 if (optimize_specialization_lookup_p (tmpl
))
1517 /* We don't put these specializations in the hash table, but we might
1518 want to give an error about a mismatch. */
1519 fn
= retrieve_specialization (tmpl
, args
, 0);
1527 hash
= spec_hasher::hash (&elt
);
1530 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1532 fn
= ((spec_entry
*) *slot
)->spec
;
1537 /* We can sometimes try to re-register a specialization that we've
1538 already got. In particular, regenerate_decl_from_template calls
1539 duplicate_decls which will update the specialization list. But,
1540 we'll still get called again here anyhow. It's more convenient
1541 to simply allow this than to try to prevent it. */
1544 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1546 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1548 if (DECL_ODR_USED (fn
)
1549 || DECL_EXPLICIT_INSTANTIATION (fn
))
1551 error ("specialization of %qD after instantiation",
1553 return error_mark_node
;
1558 /* This situation should occur only if the first
1559 specialization is an implicit instantiation, the
1560 second is an explicit specialization, and the
1561 implicit instantiation has not yet been used. That
1562 situation can occur if we have implicitly
1563 instantiated a member function and then specialized
1566 We can also wind up here if a friend declaration that
1567 looked like an instantiation turns out to be a
1570 template <class T> void foo(T);
1571 class S { friend void foo<>(int) };
1572 template <> void foo(int);
1574 We transform the existing DECL in place so that any
1575 pointers to it become pointers to the updated
1578 If there was a definition for the template, but not
1579 for the specialization, we want this to look as if
1580 there were no definition, and vice versa. */
1581 DECL_INITIAL (fn
) = NULL_TREE
;
1582 duplicate_decls (spec
, fn
, is_friend
);
1583 /* The call to duplicate_decls will have applied
1586 An explicit specialization of a function template
1587 is inline only if it is explicitly declared to be,
1588 and independently of whether its function template
1591 to the primary function; now copy the inline bits to
1592 the various clones. */
1593 FOR_EACH_CLONE (clone
, fn
)
1595 DECL_DECLARED_INLINE_P (clone
)
1596 = DECL_DECLARED_INLINE_P (fn
);
1597 DECL_SOURCE_LOCATION (clone
)
1598 = DECL_SOURCE_LOCATION (fn
);
1599 DECL_DELETED_FN (clone
)
1600 = DECL_DELETED_FN (fn
);
1602 check_specialization_namespace (tmpl
);
1607 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1609 tree dd
= duplicate_decls (spec
, fn
, is_friend
);
1610 if (dd
== error_mark_node
)
1611 /* We've already complained in duplicate_decls. */
1612 return error_mark_node
;
1614 if (dd
== NULL_TREE
&& DECL_INITIAL (spec
))
1615 /* Dup decl failed, but this is a new definition. Set the
1616 line number so any errors match this new
1618 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1624 return duplicate_decls (spec
, fn
, is_friend
);
1626 /* A specialization must be declared in the same namespace as the
1627 template it is specializing. */
1628 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1629 && !check_specialization_namespace (tmpl
))
1630 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1632 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1634 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1635 gcc_assert (tmpl
&& args
&& spec
);
1638 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1639 && PRIMARY_TEMPLATE_P (tmpl
)
1640 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1641 || variable_template_p (tmpl
))
1642 /* If TMPL is a forward declaration of a template function, keep a list
1643 of all specializations in case we need to reassign them to a friend
1644 template later in tsubst_friend_function.
1646 Also keep a list of all variable template instantiations so that
1647 process_partial_specialization can check whether a later partial
1648 specialization would have used it. */
1649 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1650 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1656 /* Returns true iff two spec_entry nodes are equivalent. */
1658 int comparing_specializations
;
1661 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1665 ++comparing_specializations
;
1666 equal
= (e1
->tmpl
== e2
->tmpl
1667 && comp_template_args (e1
->args
, e2
->args
));
1668 if (equal
&& flag_concepts
1669 /* tmpl could be a FIELD_DECL for a capture pack. */
1670 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1671 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1672 && uses_template_parms (e1
->args
))
1674 /* Partial specializations of a variable template can be distinguished by
1676 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1677 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1678 equal
= equivalent_constraints (c1
, c2
);
1680 --comparing_specializations
;
1685 /* Returns a hash for a template TMPL and template arguments ARGS. */
1688 hash_tmpl_and_args (tree tmpl
, tree args
)
1690 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1691 return iterative_hash_template_arg (args
, val
);
1694 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1698 spec_hasher::hash (spec_entry
*e
)
1700 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1703 /* Recursively calculate a hash value for a template argument ARG, for use
1704 in the hash tables of template specializations. */
1707 iterative_hash_template_arg (tree arg
, hashval_t val
)
1709 unsigned HOST_WIDE_INT i
;
1710 enum tree_code code
;
1713 if (arg
== NULL_TREE
)
1714 return iterative_hash_object (arg
, val
);
1719 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1722 code
= TREE_CODE (arg
);
1723 tclass
= TREE_CODE_CLASS (code
);
1725 val
= iterative_hash_object (code
, val
);
1732 case IDENTIFIER_NODE
:
1733 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1737 int i
, len
= TREE_VEC_LENGTH (arg
);
1738 for (i
= 0; i
< len
; ++i
)
1739 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1743 case TYPE_PACK_EXPANSION
:
1744 case EXPR_PACK_EXPANSION
:
1745 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1746 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1748 case TYPE_ARGUMENT_PACK
:
1749 case NONTYPE_ARGUMENT_PACK
:
1750 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1753 for (; arg
; arg
= TREE_CHAIN (arg
))
1754 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1758 for (lkp_iterator
iter (arg
); iter
; ++iter
)
1759 val
= iterative_hash_template_arg (*iter
, val
);
1765 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1766 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1768 val
= iterative_hash_template_arg (field
, val
);
1769 val
= iterative_hash_template_arg (value
, val
);
1775 if (!DECL_ARTIFICIAL (arg
))
1777 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1778 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1780 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1783 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1786 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1787 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1789 case TEMPLATE_PARM_INDEX
:
1790 val
= iterative_hash_template_arg
1791 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1792 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1793 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1796 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1797 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1798 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1801 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1803 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1807 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1808 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1809 val
= iterative_hash_object (code
, val
);
1810 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1813 /* A lambda can't appear in a template arg, but don't crash on
1815 gcc_assert (seen_error ());
1819 case IMPLICIT_CONV_EXPR
:
1820 case STATIC_CAST_EXPR
:
1821 case REINTERPRET_CAST_EXPR
:
1822 case CONST_CAST_EXPR
:
1823 case DYNAMIC_CAST_EXPR
:
1825 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1826 /* Now hash operands as usual. */
1836 if (alias_template_specialization_p (arg
))
1838 // We want an alias specialization that survived strip_typedefs
1839 // to hash differently from its TYPE_CANONICAL, to avoid hash
1840 // collisions that compare as different in template_args_equal.
1841 // These could be dependent specializations that strip_typedefs
1842 // left alone, or untouched specializations because
1843 // coerce_template_parms returns the unconverted template
1844 // arguments if it sees incomplete argument packs.
1845 tree ti
= TYPE_ALIAS_TEMPLATE_INFO (arg
);
1846 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1848 if (TYPE_CANONICAL (arg
))
1849 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1851 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1852 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1853 /* Otherwise just compare the types during lookup. */
1856 case tcc_declaration
:
1858 return iterative_hash_expr (arg
, val
);
1861 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1863 unsigned n
= cp_tree_operand_length (arg
);
1864 for (i
= 0; i
< n
; ++i
)
1865 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1873 /* Unregister the specialization SPEC as a specialization of TMPL.
1874 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1875 if the SPEC was listed as a specialization of TMPL.
1877 Note that SPEC has been ggc_freed, so we can't look inside it. */
1880 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1885 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1886 elt
.args
= TI_ARGS (tinfo
);
1887 elt
.spec
= NULL_TREE
;
1889 entry
= decl_specializations
->find (&elt
);
1892 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1893 gcc_assert (new_spec
!= NULL_TREE
);
1894 entry
->spec
= new_spec
;
1901 /* Like register_specialization, but for local declarations. We are
1902 registering SPEC, an instantiation of TMPL. */
1905 register_local_specialization (tree spec
, tree tmpl
)
1907 gcc_assert (tmpl
!= spec
);
1908 local_specializations
->put (tmpl
, spec
);
1911 /* TYPE is a class type. Returns true if TYPE is an explicitly
1912 specialized class. */
1915 explicit_class_specialization_p (tree type
)
1917 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1919 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1922 /* Print the list of functions at FNS, going through all the overloads
1923 for each element of the list. Alternatively, FNS can not be a
1924 TREE_LIST, in which case it will be printed together with all the
1927 MORE and *STR should respectively be FALSE and NULL when the function
1928 is called from the outside. They are used internally on recursive
1929 calls. print_candidates manages the two parameters and leaves NULL
1930 in *STR when it ends. */
1933 print_candidates_1 (tree fns
, char **str
, bool more
= false)
1935 if (TREE_CODE (fns
) == TREE_LIST
)
1936 for (; fns
; fns
= TREE_CHAIN (fns
))
1937 print_candidates_1 (TREE_VALUE (fns
), str
, more
|| TREE_CHAIN (fns
));
1939 for (lkp_iterator
iter (fns
); iter
;)
1944 const char *pfx
= *str
;
1948 pfx
= _("candidates are:");
1950 pfx
= _("candidate is:");
1951 *str
= get_spaces (pfx
);
1953 inform (DECL_SOURCE_LOCATION (cand
), "%s %#qD", pfx
, cand
);
1957 /* Print the list of candidate FNS in an error message. FNS can also
1958 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1961 print_candidates (tree fns
)
1964 print_candidates_1 (fns
, &str
);
1968 /* Get a (possibly) constrained template declaration for the
1969 purpose of ordering candidates. */
1971 get_template_for_ordering (tree list
)
1973 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1974 tree f
= TREE_VALUE (list
);
1975 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1976 return TI_TEMPLATE (ti
);
1980 /* Among candidates having the same signature, return the
1981 most constrained or NULL_TREE if there is no best candidate.
1982 If the signatures of candidates vary (e.g., template
1983 specialization vs. member function), then there can be no
1986 Note that we don't compare constraints on the functions
1987 themselves, but rather those of their templates. */
1989 most_constrained_function (tree candidates
)
1991 // Try to find the best candidate in a first pass.
1992 tree champ
= candidates
;
1993 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
1995 int winner
= more_constrained (get_template_for_ordering (champ
),
1996 get_template_for_ordering (c
));
1998 champ
= c
; // The candidate is more constrained
1999 else if (winner
== 0)
2000 return NULL_TREE
; // Neither is more constrained
2003 // Verify that the champ is better than previous candidates.
2004 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2005 if (!more_constrained (get_template_for_ordering (champ
),
2006 get_template_for_ordering (c
)))
2014 /* Returns the template (one of the functions given by TEMPLATE_ID)
2015 which can be specialized to match the indicated DECL with the
2016 explicit template args given in TEMPLATE_ID. The DECL may be
2017 NULL_TREE if none is available. In that case, the functions in
2018 TEMPLATE_ID are non-members.
2020 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2021 specialization of a member template.
2023 The TEMPLATE_COUNT is the number of references to qualifying
2024 template classes that appeared in the name of the function. See
2025 check_explicit_specialization for a more accurate description.
2027 TSK indicates what kind of template declaration (if any) is being
2028 declared. TSK_TEMPLATE indicates that the declaration given by
2029 DECL, though a FUNCTION_DECL, has template parameters, and is
2030 therefore a template function.
2032 The template args (those explicitly specified and those deduced)
2033 are output in a newly created vector *TARGS_OUT.
2035 If it is impossible to determine the result, an error message is
2036 issued. The error_mark_node is returned to indicate failure. */
2039 determine_specialization (tree template_id
,
2042 int need_member_template
,
2048 tree explicit_targs
;
2049 tree candidates
= NULL_TREE
;
2051 /* A TREE_LIST of templates of which DECL may be a specialization.
2052 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2053 corresponding TREE_PURPOSE is the set of template arguments that,
2054 when used to instantiate the template, would produce a function
2055 with the signature of DECL. */
2056 tree templates
= NULL_TREE
;
2058 cp_binding_level
*b
;
2060 *targs_out
= NULL_TREE
;
2062 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2063 return error_mark_node
;
2065 /* We shouldn't be specializing a member template of an
2066 unspecialized class template; we already gave an error in
2067 check_specialization_scope, now avoid crashing. */
2069 && template_count
&& DECL_CLASS_SCOPE_P (decl
)
2070 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2072 gcc_assert (errorcount
);
2073 return error_mark_node
;
2076 fns
= TREE_OPERAND (template_id
, 0);
2077 explicit_targs
= TREE_OPERAND (template_id
, 1);
2079 if (fns
== error_mark_node
)
2080 return error_mark_node
;
2082 /* Check for baselinks. */
2083 if (BASELINK_P (fns
))
2084 fns
= BASELINK_FUNCTIONS (fns
);
2086 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2088 error ("%qD is not a function template", fns
);
2089 return error_mark_node
;
2091 else if (VAR_P (decl
) && !variable_template_p (fns
))
2093 error ("%qD is not a variable template", fns
);
2094 return error_mark_node
;
2097 /* Count the number of template headers specified for this
2100 for (b
= current_binding_level
;
2101 b
->kind
== sk_template_parms
;
2105 tree orig_fns
= fns
;
2107 if (variable_template_p (fns
))
2109 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2110 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2111 tf_warning_or_error
,
2112 /*req_all*/true, /*use_defarg*/true);
2113 if (targs
!= error_mark_node
)
2114 templates
= tree_cons (targs
, fns
, templates
);
2116 else for (lkp_iterator
iter (fns
); iter
; ++iter
)
2120 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2122 tree decl_arg_types
;
2126 /* In case of explicit specialization, we need to check if
2127 the number of template headers appearing in the specialization
2128 is correct. This is usually done in check_explicit_specialization,
2129 but the check done there cannot be exhaustive when specializing
2130 member functions. Consider the following code:
2132 template <> void A<int>::f(int);
2133 template <> template <> void A<int>::f(int);
2135 Assuming that A<int> is not itself an explicit specialization
2136 already, the first line specializes "f" which is a non-template
2137 member function, whilst the second line specializes "f" which
2138 is a template member function. So both lines are syntactically
2139 correct, and check_explicit_specialization does not reject
2142 Here, we can do better, as we are matching the specialization
2143 against the declarations. We count the number of template
2144 headers, and we check if they match TEMPLATE_COUNT + 1
2145 (TEMPLATE_COUNT is the number of qualifying template classes,
2146 plus there must be another header for the member template
2149 Notice that if header_count is zero, this is not a
2150 specialization but rather a template instantiation, so there
2151 is no check we can perform here. */
2152 if (header_count
&& header_count
!= template_count
+ 1)
2155 /* Check that the number of template arguments at the
2156 innermost level for DECL is the same as for FN. */
2157 if (current_binding_level
->kind
== sk_template_parms
2158 && !current_binding_level
->explicit_spec_p
2159 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2160 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2161 (current_template_parms
))))
2164 /* DECL might be a specialization of FN. */
2165 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2166 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2168 /* For a non-static member function, we need to make sure
2169 that the const qualification is the same. Since
2170 get_bindings does not try to merge the "this" parameter,
2171 we must do the comparison explicitly. */
2172 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
2174 if (!same_type_p (TREE_VALUE (fn_arg_types
),
2175 TREE_VALUE (decl_arg_types
)))
2178 /* And the ref-qualification. */
2179 if (type_memfn_rqual (TREE_TYPE (decl
))
2180 != type_memfn_rqual (TREE_TYPE (fn
)))
2184 /* Skip the "this" parameter and, for constructors of
2185 classes with virtual bases, the VTT parameter. A
2186 full specialization of a constructor will have a VTT
2187 parameter, but a template never will. */
2189 = skip_artificial_parms_for (decl
, decl_arg_types
);
2191 = skip_artificial_parms_for (fn
, fn_arg_types
);
2193 /* Function templates cannot be specializations; there are
2194 no partial specializations of functions. Therefore, if
2195 the type of DECL does not match FN, there is no
2198 Note that it should never be the case that we have both
2199 candidates added here, and for regular member functions
2201 if (tsk
== tsk_template
)
2203 if (compparms (fn_arg_types
, decl_arg_types
))
2204 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2208 /* See whether this function might be a specialization of this
2209 template. Suppress access control because we might be trying
2210 to make this specialization a friend, and we have already done
2211 access control for the declaration of the specialization. */
2212 push_deferring_access_checks (dk_no_check
);
2213 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2214 pop_deferring_access_checks ();
2217 /* We cannot deduce template arguments that when used to
2218 specialize TMPL will produce DECL. */
2221 if (uses_template_parms (targs
))
2222 /* We deduced something involving 'auto', which isn't a valid
2223 template argument. */
2226 /* Remove, from the set of candidates, all those functions
2227 whose constraints are not satisfied. */
2228 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2231 // Then, try to form the new function type.
2232 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_fndecl_type
, NULL_TREE
);
2233 if (insttype
== error_mark_node
)
2236 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2237 if (!compparms (fn_arg_types
, decl_arg_types
))
2240 /* Save this template, and the arguments deduced. */
2241 templates
= tree_cons (targs
, fn
, templates
);
2243 else if (need_member_template
)
2244 /* FN is an ordinary member function, and we need a
2245 specialization of a member template. */
2247 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2248 /* We can get IDENTIFIER_NODEs here in certain erroneous
2251 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2252 /* This is just an ordinary non-member function. Nothing can
2253 be a specialization of that. */
2255 else if (DECL_ARTIFICIAL (fn
))
2256 /* Cannot specialize functions that are created implicitly. */
2260 tree decl_arg_types
;
2262 /* This is an ordinary member function. However, since
2263 we're here, we can assume its enclosing class is a
2264 template class. For example,
2266 template <typename T> struct S { void f(); };
2267 template <> void S<int>::f() {}
2269 Here, S<int>::f is a non-template, but S<int> is a
2270 template class. If FN has the same type as DECL, we
2271 might be in business. */
2273 if (!DECL_TEMPLATE_INFO (fn
))
2274 /* Its enclosing class is an explicit specialization
2275 of a template class. This is not a candidate. */
2278 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2279 TREE_TYPE (TREE_TYPE (fn
))))
2280 /* The return types differ. */
2283 /* Adjust the type of DECL in case FN is a static member. */
2284 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2285 if (DECL_STATIC_FUNCTION_P (fn
)
2286 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2287 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2289 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2293 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2294 && (type_memfn_rqual (TREE_TYPE (decl
))
2295 != type_memfn_rqual (TREE_TYPE (fn
))))
2298 // If the deduced arguments do not satisfy the constraints,
2299 // this is not a candidate.
2300 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2303 // Add the candidate.
2304 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2308 if (templates
&& TREE_CHAIN (templates
))
2314 It is possible for a specialization with a given function
2315 signature to be instantiated from more than one function
2316 template. In such cases, explicit specification of the
2317 template arguments must be used to uniquely identify the
2318 function template specialization being specialized.
2320 Note that here, there's no suggestion that we're supposed to
2321 determine which of the candidate templates is most
2322 specialized. However, we, also have:
2326 Partial ordering of overloaded function template
2327 declarations is used in the following contexts to select
2328 the function template to which a function template
2329 specialization refers:
2331 -- when an explicit specialization refers to a function
2334 So, we do use the partial ordering rules, at least for now.
2335 This extension can only serve to make invalid programs valid,
2336 so it's safe. And, there is strong anecdotal evidence that
2337 the committee intended the partial ordering rules to apply;
2338 the EDG front end has that behavior, and John Spicer claims
2339 that the committee simply forgot to delete the wording in
2340 [temp.expl.spec]. */
2341 tree tmpl
= most_specialized_instantiation (templates
);
2342 if (tmpl
!= error_mark_node
)
2345 TREE_CHAIN (templates
) = NULL_TREE
;
2349 // Concepts allows multiple declarations of member functions
2350 // with the same signature. Like above, we need to rely on
2351 // on the partial ordering of those candidates to determine which
2353 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2355 if (tree cand
= most_constrained_function (candidates
))
2358 TREE_CHAIN (cand
) = NULL_TREE
;
2362 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2364 error ("template-id %qD for %q+D does not match any template "
2365 "declaration", template_id
, decl
);
2366 if (header_count
&& header_count
!= template_count
+ 1)
2367 inform (input_location
, "saw %d %<template<>%>, need %d for "
2368 "specializing a member function template",
2369 header_count
, template_count
+ 1);
2371 print_candidates (orig_fns
);
2372 return error_mark_node
;
2374 else if ((templates
&& TREE_CHAIN (templates
))
2375 || (candidates
&& TREE_CHAIN (candidates
))
2376 || (templates
&& candidates
))
2378 error ("ambiguous template specialization %qD for %q+D",
2380 candidates
= chainon (candidates
, templates
);
2381 print_candidates (candidates
);
2382 return error_mark_node
;
2385 /* We have one, and exactly one, match. */
2388 tree fn
= TREE_VALUE (candidates
);
2389 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2391 // Propagate the candidate's constraints to the declaration.
2392 set_constraints (decl
, get_constraints (fn
));
2394 /* DECL is a re-declaration or partial instantiation of a template
2396 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2398 /* It was a specialization of an ordinary member function in a
2400 return DECL_TI_TEMPLATE (fn
);
2403 /* It was a specialization of a template. */
2404 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2405 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2407 *targs_out
= copy_node (targs
);
2408 SET_TMPL_ARGS_LEVEL (*targs_out
,
2409 TMPL_ARGS_DEPTH (*targs_out
),
2410 TREE_PURPOSE (templates
));
2413 *targs_out
= TREE_PURPOSE (templates
);
2414 return TREE_VALUE (templates
);
2417 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2418 but with the default argument values filled in from those in the
2422 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2425 tree new_spec_types
;
2430 if (spec_types
== void_list_node
)
2431 return void_list_node
;
2433 /* Substitute into the rest of the list. */
2435 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2436 TREE_CHAIN (tmpl_types
));
2438 /* Add the default argument for this parameter. */
2439 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2440 TREE_VALUE (spec_types
),
2444 /* DECL is an explicit specialization. Replicate default arguments
2445 from the template it specializes. (That way, code like:
2447 template <class T> void f(T = 3);
2448 template <> void f(double);
2451 works, as required.) An alternative approach would be to look up
2452 the correct default arguments at the call-site, but this approach
2453 is consistent with how implicit instantiations are handled. */
2456 copy_default_args_to_explicit_spec (tree decl
)
2461 tree new_spec_types
;
2465 tree object_type
= NULL_TREE
;
2466 tree in_charge
= NULL_TREE
;
2467 tree vtt
= NULL_TREE
;
2469 /* See if there's anything we need to do. */
2470 tmpl
= DECL_TI_TEMPLATE (decl
);
2471 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2472 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2473 if (TREE_PURPOSE (t
))
2478 old_type
= TREE_TYPE (decl
);
2479 spec_types
= TYPE_ARG_TYPES (old_type
);
2481 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2483 /* Remove the this pointer, but remember the object's type for
2485 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2486 spec_types
= TREE_CHAIN (spec_types
);
2487 tmpl_types
= TREE_CHAIN (tmpl_types
);
2489 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2491 /* DECL may contain more parameters than TMPL due to the extra
2492 in-charge parameter in constructors and destructors. */
2493 in_charge
= spec_types
;
2494 spec_types
= TREE_CHAIN (spec_types
);
2496 if (DECL_HAS_VTT_PARM_P (decl
))
2499 spec_types
= TREE_CHAIN (spec_types
);
2503 /* Compute the merged default arguments. */
2505 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2507 /* Compute the new FUNCTION_TYPE. */
2511 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2516 /* Put the in-charge parameter back. */
2517 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2518 TREE_VALUE (in_charge
),
2521 new_type
= build_method_type_directly (object_type
,
2522 TREE_TYPE (old_type
),
2526 new_type
= build_function_type (TREE_TYPE (old_type
),
2528 new_type
= cp_build_type_attribute_variant (new_type
,
2529 TYPE_ATTRIBUTES (old_type
));
2530 new_type
= build_exception_variant (new_type
,
2531 TYPE_RAISES_EXCEPTIONS (old_type
));
2533 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2534 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2536 TREE_TYPE (decl
) = new_type
;
2539 /* Return the number of template headers we expect to see for a definition
2540 or specialization of CTYPE or one of its non-template members. */
2543 num_template_headers_for_class (tree ctype
)
2545 int num_templates
= 0;
2547 while (ctype
&& CLASS_TYPE_P (ctype
))
2549 /* You're supposed to have one `template <...>' for every
2550 template class, but you don't need one for a full
2551 specialization. For example:
2553 template <class T> struct S{};
2554 template <> struct S<int> { void f(); };
2555 void S<int>::f () {}
2557 is correct; there shouldn't be a `template <>' for the
2558 definition of `S<int>::f'. */
2559 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2560 /* If CTYPE does not have template information of any
2561 kind, then it is not a template, nor is it nested
2562 within a template. */
2564 if (explicit_class_specialization_p (ctype
))
2566 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2569 ctype
= TYPE_CONTEXT (ctype
);
2572 return num_templates
;
2575 /* Do a simple sanity check on the template headers that precede the
2576 variable declaration DECL. */
2579 check_template_variable (tree decl
)
2581 tree ctx
= CP_DECL_CONTEXT (decl
);
2582 int wanted
= num_template_headers_for_class (ctx
);
2583 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2584 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2586 if (cxx_dialect
< cxx14
)
2587 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2588 "variable templates only available with "
2589 "-std=c++14 or -std=gnu++14");
2591 // Namespace-scope variable templates should have a template header.
2594 if (template_header_count
> wanted
)
2596 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2597 "too many template headers for %qD "
2600 if (warned
&& CLASS_TYPE_P (ctx
)
2601 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2602 inform (DECL_SOURCE_LOCATION (decl
),
2603 "members of an explicitly specialized class are defined "
2604 "without a template header");
2608 /* An explicit specialization whose declarator-id or class-head-name is not
2609 qualified shall be declared in the nearest enclosing namespace of the
2610 template, or, if the namespace is inline (7.3.1), any namespace from its
2611 enclosing namespace set.
2613 If the name declared in the explicit instantiation is an unqualified name,
2614 the explicit instantiation shall appear in the namespace where its template
2615 is declared or, if that namespace is inline (7.3.1), any namespace from its
2616 enclosing namespace set. */
2619 check_unqualified_spec_or_inst (tree t
, location_t loc
)
2621 tree tmpl
= most_general_template (t
);
2622 if (DECL_NAMESPACE_SCOPE_P (tmpl
)
2623 && !is_nested_namespace (current_namespace
,
2624 CP_DECL_CONTEXT (tmpl
), true))
2626 if (processing_specialization
)
2627 permerror (loc
, "explicit specialization of %qD outside its "
2628 "namespace must use a nested-name-specifier", tmpl
);
2629 else if (processing_explicit_instantiation
2630 && cxx_dialect
>= cxx11
)
2631 /* This was allowed in C++98, so only pedwarn. */
2632 pedwarn (loc
, OPT_Wpedantic
, "explicit instantiation of %qD "
2633 "outside its namespace must use a nested-name-"
2638 /* Warn for a template specialization SPEC that is missing some of a set
2639 of function or type attributes that the template TEMPL is declared with.
2640 ATTRLIST is a list of additional attributes that SPEC should be taken
2641 to ultimately be declared with. */
2644 warn_spec_missing_attributes (tree tmpl
, tree spec
, tree attrlist
)
2646 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2647 tmpl
= DECL_TEMPLATE_RESULT (tmpl
);
2649 if (TREE_CODE (tmpl
) != FUNCTION_DECL
)
2652 /* Avoid warning if either declaration or its type is deprecated. */
2653 if (TREE_DEPRECATED (tmpl
)
2654 || TREE_DEPRECATED (spec
))
2657 tree tmpl_type
= TREE_TYPE (tmpl
);
2658 tree spec_type
= TREE_TYPE (spec
);
2660 if (TREE_DEPRECATED (tmpl_type
)
2661 || TREE_DEPRECATED (spec_type
)
2662 || TREE_DEPRECATED (TREE_TYPE (tmpl_type
))
2663 || TREE_DEPRECATED (TREE_TYPE (spec_type
)))
2666 tree tmpl_attrs
[] = { DECL_ATTRIBUTES (tmpl
), TYPE_ATTRIBUTES (tmpl_type
) };
2667 tree spec_attrs
[] = { DECL_ATTRIBUTES (spec
), TYPE_ATTRIBUTES (spec_type
) };
2670 spec_attrs
[0] = attrlist
;
2671 else if (!spec_attrs
[1])
2672 spec_attrs
[1] = attrlist
;
2674 /* Avoid warning if the primary has no attributes. */
2675 if (!tmpl_attrs
[0] && !tmpl_attrs
[1])
2678 /* Avoid warning if either declaration contains an attribute on
2679 the white list below. */
2680 const char* const whitelist
[] = {
2684 for (unsigned i
= 0; i
!= 2; ++i
)
2685 for (unsigned j
= 0; j
!= sizeof whitelist
/ sizeof *whitelist
; ++j
)
2686 if (lookup_attribute (whitelist
[j
], tmpl_attrs
[i
])
2687 || lookup_attribute (whitelist
[j
], spec_attrs
[i
]))
2690 /* Avoid warning if the difference between the primary and
2691 the specialization is not in one of the attributes below. */
2692 const char* const blacklist
[] = {
2693 "alloc_align", "alloc_size", "assume_aligned", "format",
2694 "format_arg", "malloc", "nonnull"
2697 /* Put together a list of the black listed attributes that the primary
2698 template is declared with that the specialization is not, in case
2699 it's not apparent from the most recent declaration of the primary. */
2700 unsigned nattrs
= 0;
2703 for (unsigned i
= 0; i
!= sizeof blacklist
/ sizeof *blacklist
; ++i
)
2705 for (unsigned j
= 0; j
!= 2; ++j
)
2707 if (!lookup_attribute (blacklist
[i
], tmpl_attrs
[j
]))
2710 for (unsigned k
= 0; k
!= 1 + !!spec_attrs
[1]; ++k
)
2712 if (lookup_attribute (blacklist
[i
], spec_attrs
[k
]))
2716 pp_string (&str
, ", ");
2717 pp_begin_quote (&str
, pp_show_color (global_dc
->printer
));
2718 pp_string (&str
, blacklist
[i
]);
2719 pp_end_quote (&str
, pp_show_color (global_dc
->printer
));
2728 if (warning_at (DECL_SOURCE_LOCATION (spec
), OPT_Wmissing_attributes
,
2729 "explicit specialization %q#D may be missing attributes",
2731 inform (DECL_SOURCE_LOCATION (tmpl
),
2733 ? G_("missing primary template attributes %s")
2734 : G_("missing primary template attribute %s"),
2735 pp_formatted_text (&str
));
2738 /* Check to see if the function just declared, as indicated in
2739 DECLARATOR, and in DECL, is a specialization of a function
2740 template. We may also discover that the declaration is an explicit
2741 instantiation at this point.
2743 Returns DECL, or an equivalent declaration that should be used
2744 instead if all goes well. Issues an error message if something is
2745 amiss. Returns error_mark_node if the error is not easily
2748 FLAGS is a bitmask consisting of the following flags:
2750 2: The function has a definition.
2751 4: The function is a friend.
2753 The TEMPLATE_COUNT is the number of references to qualifying
2754 template classes that appeared in the name of the function. For
2757 template <class T> struct S { void f(); };
2760 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2761 classes are not counted in the TEMPLATE_COUNT, so that in
2763 template <class T> struct S {};
2764 template <> struct S<int> { void f(); }
2765 template <> void S<int>::f();
2767 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2768 invalid; there should be no template <>.)
2770 If the function is a specialization, it is marked as such via
2771 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2772 is set up correctly, and it is added to the list of specializations
2773 for that template. */
2776 check_explicit_specialization (tree declarator
,
2782 int have_def
= flags
& 2;
2783 int is_friend
= flags
& 4;
2784 bool is_concept
= flags
& 8;
2785 int specialization
= 0;
2786 int explicit_instantiation
= 0;
2787 int member_specialization
= 0;
2788 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2789 tree dname
= DECL_NAME (decl
);
2794 if (!processing_specialization
)
2797 tsk
= tsk_excessive_parms
;
2800 tsk
= current_tmpl_spec_kind (template_count
);
2805 if (processing_specialization
&& !VAR_P (decl
))
2808 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2810 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2813 /* This could be something like:
2815 template <class T> void f(T);
2816 class S { friend void f<>(int); } */
2820 /* This case handles bogus declarations like template <>
2821 template <class T> void f<int>(); */
2823 error ("template-id %qD in declaration of primary template",
2830 case tsk_invalid_member_spec
:
2831 /* The error has already been reported in
2832 check_specialization_scope. */
2833 return error_mark_node
;
2835 case tsk_invalid_expl_inst
:
2836 error ("template parameter list used in explicit instantiation");
2842 error ("definition provided for explicit instantiation");
2844 explicit_instantiation
= 1;
2847 case tsk_excessive_parms
:
2848 case tsk_insufficient_parms
:
2849 if (tsk
== tsk_excessive_parms
)
2850 error ("too many template parameter lists in declaration of %qD",
2852 else if (template_header_count
)
2853 error("too few template parameter lists in declaration of %qD", decl
);
2855 error("explicit specialization of %qD must be introduced by "
2856 "%<template <>%>", decl
);
2861 error ("explicit specialization declared %<concept%>");
2863 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2864 /* In cases like template<> constexpr bool v = true;
2865 We'll give an error in check_template_variable. */
2868 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2870 member_specialization
= 1;
2876 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2878 /* This case handles bogus declarations like template <>
2879 template <class T> void f<int>(); */
2881 if (!uses_template_parms (declarator
))
2882 error ("template-id %qD in declaration of primary template",
2884 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2886 /* Partial specialization of variable template. */
2887 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2891 else if (cxx_dialect
< cxx14
)
2892 error ("non-type partial specialization %qD "
2893 "is not allowed", declarator
);
2895 error ("non-class, non-variable partial specialization %qD "
2896 "is not allowed", declarator
);
2901 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2902 /* This is a specialization of a member template, without
2903 specialization the containing class. Something like:
2905 template <class T> struct S {
2906 template <class U> void f (U);
2908 template <> template <class U> void S<int>::f(U) {}
2910 That's a specialization -- but of the entire template. */
2918 if ((specialization
|| member_specialization
)
2919 /* This doesn't apply to variable templates. */
2920 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2921 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2923 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2924 for (; t
; t
= TREE_CHAIN (t
))
2925 if (TREE_PURPOSE (t
))
2927 permerror (input_location
,
2928 "default argument specified in explicit specialization");
2933 if (specialization
|| member_specialization
|| explicit_instantiation
)
2935 tree tmpl
= NULL_TREE
;
2936 tree targs
= NULL_TREE
;
2937 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2939 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2940 if (!was_template_id
)
2944 gcc_assert (identifier_p (declarator
));
2949 /* If there is no class context, the explicit instantiation
2950 must be at namespace scope. */
2951 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2953 /* Find the namespace binding, using the declaration
2955 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2957 if (fns
== error_mark_node
)
2958 /* If lookup fails, look for a friend declaration so we can
2959 give a better diagnostic. */
2960 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2961 /*type*/false, /*complain*/true,
2964 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2966 error ("%qD is not a template function", dname
);
2967 fns
= error_mark_node
;
2971 declarator
= lookup_template_function (fns
, NULL_TREE
);
2974 if (declarator
== error_mark_node
)
2975 return error_mark_node
;
2977 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2979 if (!explicit_instantiation
)
2980 /* A specialization in class scope. This is invalid,
2981 but the error will already have been flagged by
2982 check_specialization_scope. */
2983 return error_mark_node
;
2986 /* It's not valid to write an explicit instantiation in
2989 class C { template void f(); }
2991 This case is caught by the parser. However, on
2994 template class C { void f(); };
2996 (which is invalid) we can get here. The error will be
3003 else if (ctype
!= NULL_TREE
3004 && (identifier_p (TREE_OPERAND (declarator
, 0))))
3006 // We'll match variable templates in start_decl.
3010 /* Find the list of functions in ctype that have the same
3011 name as the declared function. */
3012 tree name
= TREE_OPERAND (declarator
, 0);
3014 if (constructor_name_p (name
, ctype
))
3016 if (DECL_CONSTRUCTOR_P (decl
)
3017 ? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
3018 : !CLASSTYPE_DESTRUCTOR (ctype
))
3020 /* From [temp.expl.spec]:
3022 If such an explicit specialization for the member
3023 of a class template names an implicitly-declared
3024 special member function (clause _special_), the
3025 program is ill-formed.
3027 Similar language is found in [temp.explicit]. */
3028 error ("specialization of implicitly-declared special member function");
3029 return error_mark_node
;
3032 name
= DECL_NAME (decl
);
3035 /* For a type-conversion operator, We might be looking for
3036 `operator int' which will be a specialization of
3037 `operator T'. Grab all the conversion operators, and
3038 then select from them. */
3039 tree fns
= get_class_binding (ctype
, IDENTIFIER_CONV_OP_P (name
)
3040 ? conv_op_identifier
: name
);
3042 if (fns
== NULL_TREE
)
3044 error ("no member function %qD declared in %qT", name
, ctype
);
3045 return error_mark_node
;
3048 TREE_OPERAND (declarator
, 0) = fns
;
3051 /* Figure out what exactly is being specialized at this point.
3052 Note that for an explicit instantiation, even one for a
3053 member function, we cannot tell a priori whether the
3054 instantiation is for a member template, or just a member
3055 function of a template class. Even if a member template is
3056 being instantiated, the member template arguments may be
3057 elided if they can be deduced from the rest of the
3059 tmpl
= determine_specialization (declarator
, decl
,
3061 member_specialization
,
3065 if (!tmpl
|| tmpl
== error_mark_node
)
3066 /* We couldn't figure out what this declaration was
3068 return error_mark_node
;
3071 if (TREE_CODE (decl
) == FUNCTION_DECL
3072 && DECL_HIDDEN_FRIEND_P (tmpl
))
3074 if (pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
3075 "friend declaration %qD is not visible to "
3076 "explicit specialization", tmpl
))
3077 inform (DECL_SOURCE_LOCATION (tmpl
),
3078 "friend declaration here");
3080 else if (!ctype
&& !is_friend
3081 && CP_DECL_CONTEXT (decl
) == current_namespace
)
3082 check_unqualified_spec_or_inst (tmpl
, DECL_SOURCE_LOCATION (decl
));
3084 tree gen_tmpl
= most_general_template (tmpl
);
3086 if (explicit_instantiation
)
3088 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
3089 is done by do_decl_instantiation later. */
3091 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
3092 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
3094 if (arg_depth
> parm_depth
)
3096 /* If TMPL is not the most general template (for
3097 example, if TMPL is a friend template that is
3098 injected into namespace scope), then there will
3099 be too many levels of TARGS. Remove some of them
3104 new_targs
= make_tree_vec (parm_depth
);
3105 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
3106 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
3107 = TREE_VEC_ELT (targs
, i
);
3111 return instantiate_template (tmpl
, targs
, tf_error
);
3114 /* If we thought that the DECL was a member function, but it
3115 turns out to be specializing a static member function,
3116 make DECL a static member function as well. */
3117 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
3118 && DECL_STATIC_FUNCTION_P (tmpl
)
3119 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
3120 revert_static_member_fn (decl
);
3122 /* If this is a specialization of a member template of a
3123 template class, we want to return the TEMPLATE_DECL, not
3124 the specialization of it. */
3125 if (tsk
== tsk_template
&& !was_template_id
)
3127 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3128 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3129 DECL_INITIAL (result
) = NULL_TREE
;
3133 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3134 DECL_SOURCE_LOCATION (result
)
3135 = DECL_SOURCE_LOCATION (decl
);
3136 /* We want to use the argument list specified in the
3137 definition, not in the original declaration. */
3138 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3139 for (parm
= DECL_ARGUMENTS (result
); parm
;
3140 parm
= DECL_CHAIN (parm
))
3141 DECL_CONTEXT (parm
) = result
;
3143 return register_specialization (tmpl
, gen_tmpl
, targs
,
3147 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3148 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3150 if (was_template_id
)
3151 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3153 /* Inherit default function arguments from the template
3154 DECL is specializing. */
3155 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3156 copy_default_args_to_explicit_spec (decl
);
3158 /* This specialization has the same protection as the
3159 template it specializes. */
3160 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3161 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3163 /* 7.1.1-1 [dcl.stc]
3165 A storage-class-specifier shall not be specified in an
3166 explicit specialization...
3168 The parser rejects these, so unless action is taken here,
3169 explicit function specializations will always appear with
3172 The action recommended by the C++ CWG in response to C++
3173 defect report 605 is to make the storage class and linkage
3174 of the explicit specialization match the templated function:
3176 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3178 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3180 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3181 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3183 /* A concept cannot be specialized. */
3184 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3186 error ("explicit specialization of function concept %qD",
3188 return error_mark_node
;
3191 /* This specialization has the same linkage and visibility as
3192 the function template it specializes. */
3193 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3194 if (! TREE_PUBLIC (decl
))
3196 DECL_INTERFACE_KNOWN (decl
) = 1;
3197 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3199 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3200 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3202 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3203 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3207 /* If DECL is a friend declaration, declared using an
3208 unqualified name, the namespace associated with DECL may
3209 have been set incorrectly. For example, in:
3211 template <typename T> void f(T);
3213 struct S { friend void f<int>(int); }
3216 we will have set the DECL_CONTEXT for the friend
3217 declaration to N, rather than to the global namespace. */
3218 if (DECL_NAMESPACE_SCOPE_P (decl
))
3219 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3221 if (is_friend
&& !have_def
)
3222 /* This is not really a declaration of a specialization.
3223 It's just the name of an instantiation. But, it's not
3224 a request for an instantiation, either. */
3225 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3226 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3227 /* A specialization is not necessarily COMDAT. */
3228 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3229 && DECL_DECLARED_INLINE_P (decl
));
3230 else if (VAR_P (decl
))
3231 DECL_COMDAT (decl
) = false;
3233 /* If this is a full specialization, register it so that we can find
3234 it again. Partial specializations will be registered in
3235 process_partial_specialization. */
3236 if (!processing_template_decl
)
3238 warn_spec_missing_attributes (gen_tmpl
, decl
, attrlist
);
3240 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3245 /* A 'structor should already have clones. */
3246 gcc_assert (decl
== error_mark_node
3247 || variable_template_p (tmpl
)
3248 || !(DECL_CONSTRUCTOR_P (decl
)
3249 || DECL_DESTRUCTOR_P (decl
))
3250 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3257 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3258 parameters. These are represented in the same format used for
3259 DECL_TEMPLATE_PARMS. */
3262 comp_template_parms (const_tree parms1
, const_tree parms2
)
3267 if (parms1
== parms2
)
3270 for (p1
= parms1
, p2
= parms2
;
3271 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3272 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3274 tree t1
= TREE_VALUE (p1
);
3275 tree t2
= TREE_VALUE (p2
);
3278 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3279 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3281 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3284 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3286 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3287 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3289 /* If either of the template parameters are invalid, assume
3290 they match for the sake of error recovery. */
3291 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3294 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3297 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3298 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3299 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3301 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3306 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3307 /* One set of parameters has more parameters lists than the
3314 /* Determine whether PARM is a parameter pack. */
3317 template_parameter_pack_p (const_tree parm
)
3319 /* Determine if we have a non-type template parameter pack. */
3320 if (TREE_CODE (parm
) == PARM_DECL
)
3321 return (DECL_TEMPLATE_PARM_P (parm
)
3322 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3323 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3324 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3326 /* If this is a list of template parameters, we could get a
3327 TYPE_DECL or a TEMPLATE_DECL. */
3328 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3329 parm
= TREE_TYPE (parm
);
3331 /* Otherwise it must be a type template parameter. */
3332 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3333 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3334 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3337 /* Determine if T is a function parameter pack. */
3340 function_parameter_pack_p (const_tree t
)
3342 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3343 return DECL_PACK_P (t
);
3347 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3348 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3351 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3353 if (! primary_func_tmpl_inst
3354 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3355 || ! primary_template_specialization_p (primary_func_tmpl_inst
))
3358 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3361 /* Return true iff the function parameter PARAM_DECL was expanded
3362 from the function parameter pack PACK. */
3365 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3367 if (DECL_ARTIFICIAL (param_decl
)
3368 || !function_parameter_pack_p (pack
))
3371 /* The parameter pack and its pack arguments have the same
3373 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3376 /* Determine whether ARGS describes a variadic template args list,
3377 i.e., one that is terminated by a template argument pack. */
3380 template_args_variadic_p (tree args
)
3385 if (args
== NULL_TREE
)
3388 args
= INNERMOST_TEMPLATE_ARGS (args
);
3389 nargs
= TREE_VEC_LENGTH (args
);
3394 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3396 return ARGUMENT_PACK_P (last_parm
);
3399 /* Generate a new name for the parameter pack name NAME (an
3400 IDENTIFIER_NODE) that incorporates its */
3403 make_ith_pack_parameter_name (tree name
, int i
)
3405 /* Munge the name to include the parameter index. */
3406 #define NUMBUF_LEN 128
3407 char numbuf
[NUMBUF_LEN
];
3411 if (name
== NULL_TREE
)
3413 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3414 newname_len
= IDENTIFIER_LENGTH (name
)
3415 + strlen (numbuf
) + 2;
3416 newname
= (char*)alloca (newname_len
);
3417 snprintf (newname
, newname_len
,
3418 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3419 return get_identifier (newname
);
3422 /* Return true if T is a primary function, class or alias template
3423 specialization, not including the template pattern. */
3426 primary_template_specialization_p (const_tree t
)
3431 if (TREE_CODE (t
) == FUNCTION_DECL
|| VAR_P (t
))
3432 return (DECL_LANG_SPECIFIC (t
)
3433 && DECL_USE_TEMPLATE (t
)
3434 && DECL_TEMPLATE_INFO (t
)
3435 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
)));
3436 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3437 return (CLASSTYPE_TEMPLATE_INFO (t
)
3438 && CLASSTYPE_USE_TEMPLATE (t
)
3439 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)));
3440 else if (alias_template_specialization_p (t
))
3445 /* Return true if PARM is a template template parameter. */
3448 template_template_parameter_p (const_tree parm
)
3450 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3453 /* Return true iff PARM is a DECL representing a type template
3457 template_type_parameter_p (const_tree parm
)
3460 && (TREE_CODE (parm
) == TYPE_DECL
3461 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3462 && DECL_TEMPLATE_PARM_P (parm
));
3465 /* Return the template parameters of T if T is a
3466 primary template instantiation, NULL otherwise. */
3469 get_primary_template_innermost_parameters (const_tree t
)
3471 tree parms
= NULL
, template_info
= NULL
;
3473 if ((template_info
= get_template_info (t
))
3474 && primary_template_specialization_p (t
))
3475 parms
= INNERMOST_TEMPLATE_PARMS
3476 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3481 /* Return the template parameters of the LEVELth level from the full list
3482 of template parameters PARMS. */
3485 get_template_parms_at_level (tree parms
, int level
)
3489 || TREE_CODE (parms
) != TREE_LIST
3490 || level
> TMPL_PARMS_DEPTH (parms
))
3493 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3494 if (TMPL_PARMS_DEPTH (p
) == level
)
3500 /* Returns the template arguments of T if T is a template instantiation,
3504 get_template_innermost_arguments (const_tree t
)
3506 tree args
= NULL
, template_info
= NULL
;
3508 if ((template_info
= get_template_info (t
))
3509 && TI_ARGS (template_info
))
3510 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3515 /* Return the argument pack elements of T if T is a template argument pack,
3519 get_template_argument_pack_elems (const_tree t
)
3521 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3522 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3525 return ARGUMENT_PACK_ARGS (t
);
3528 /* In an ARGUMENT_PACK_SELECT, the actual underlying argument that the
3529 ARGUMENT_PACK_SELECT represents. */
3532 argument_pack_select_arg (tree t
)
3534 tree args
= ARGUMENT_PACK_ARGS (ARGUMENT_PACK_SELECT_FROM_PACK (t
));
3535 tree arg
= TREE_VEC_ELT (args
, ARGUMENT_PACK_SELECT_INDEX (t
));
3537 /* If the selected argument is an expansion E, that most likely means we were
3538 called from gen_elem_of_pack_expansion_instantiation during the
3539 substituting of an argument pack (of which the Ith element is a pack
3540 expansion, where I is ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
3541 In this case, the Ith element resulting from this substituting is going to
3542 be a pack expansion, which pattern is the pattern of E. Let's return the
3543 pattern of E, and gen_elem_of_pack_expansion_instantiation will build the
3544 resulting pack expansion from it. */
3545 if (PACK_EXPANSION_P (arg
))
3547 /* Make sure we aren't throwing away arg info. */
3548 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
3549 arg
= PACK_EXPANSION_PATTERN (arg
);
3556 /* True iff FN is a function representing a built-in variadic parameter
3560 builtin_pack_fn_p (tree fn
)
3563 || TREE_CODE (fn
) != FUNCTION_DECL
3564 || !DECL_IS_BUILTIN (fn
))
3567 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3573 /* True iff CALL is a call to a function representing a built-in variadic
3577 builtin_pack_call_p (tree call
)
3579 if (TREE_CODE (call
) != CALL_EXPR
)
3581 return builtin_pack_fn_p (CALL_EXPR_FN (call
));
3584 /* Return a TREE_VEC for the expansion of __integer_pack(HI). */
3587 expand_integer_pack (tree call
, tree args
, tsubst_flags_t complain
,
3590 tree ohi
= CALL_EXPR_ARG (call
, 0);
3591 tree hi
= tsubst_copy_and_build (ohi
, args
, complain
, in_decl
,
3592 false/*fn*/, true/*int_cst*/);
3594 if (value_dependent_expression_p (hi
))
3598 call
= copy_node (call
);
3599 CALL_EXPR_ARG (call
, 0) = hi
;
3601 tree ex
= make_pack_expansion (call
, complain
);
3602 tree vec
= make_tree_vec (1);
3603 TREE_VEC_ELT (vec
, 0) = ex
;
3608 hi
= cxx_constant_value (hi
);
3609 int len
= valid_constant_size_p (hi
) ? tree_to_shwi (hi
) : -1;
3611 /* Calculate the largest value of len that won't make the size of the vec
3612 overflow an int. The compiler will exceed resource limits long before
3613 this, but it seems a decent place to diagnose. */
3614 int max
= ((INT_MAX
- sizeof (tree_vec
)) / sizeof (tree
)) + 1;
3616 if (len
< 0 || len
> max
)
3618 if ((complain
& tf_error
)
3619 && hi
!= error_mark_node
)
3620 error ("argument to __integer_pack must be between 0 and %d", max
);
3621 return error_mark_node
;
3624 tree vec
= make_tree_vec (len
);
3626 for (int i
= 0; i
< len
; ++i
)
3627 TREE_VEC_ELT (vec
, i
) = size_int (i
);
3633 /* Return a TREE_VEC for the expansion of built-in template parameter pack
3637 expand_builtin_pack_call (tree call
, tree args
, tsubst_flags_t complain
,
3640 if (!builtin_pack_call_p (call
))
3643 tree fn
= CALL_EXPR_FN (call
);
3645 if (id_equal (DECL_NAME (fn
), "__integer_pack"))
3646 return expand_integer_pack (call
, args
, complain
, in_decl
);
3651 /* Structure used to track the progress of find_parameter_packs_r. */
3652 struct find_parameter_pack_data
3654 /* TREE_LIST that will contain all of the parameter packs found by
3656 tree
* parameter_packs
;
3658 /* Set of AST nodes that have been visited by the traversal. */
3659 hash_set
<tree
> *visited
;
3661 /* True iff we're making a type pack expansion. */
3662 bool type_pack_expansion_p
;
3665 /* Identifies all of the argument packs that occur in a template
3666 argument and appends them to the TREE_LIST inside DATA, which is a
3667 find_parameter_pack_data structure. This is a subroutine of
3668 make_pack_expansion and uses_parameter_packs. */
3670 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3673 struct find_parameter_pack_data
* ppd
=
3674 (struct find_parameter_pack_data
*)data
;
3675 bool parameter_pack_p
= false;
3677 /* Handle type aliases/typedefs. */
3678 if (TYPE_ALIAS_P (t
))
3680 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
3681 cp_walk_tree (&TI_ARGS (tinfo
),
3682 &find_parameter_packs_r
,
3688 /* Identify whether this is a parameter pack or not. */
3689 switch (TREE_CODE (t
))
3691 case TEMPLATE_PARM_INDEX
:
3692 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3693 parameter_pack_p
= true;
3696 case TEMPLATE_TYPE_PARM
:
3697 t
= TYPE_MAIN_VARIANT (t
);
3699 case TEMPLATE_TEMPLATE_PARM
:
3700 /* If the placeholder appears in the decl-specifier-seq of a function
3701 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3702 is a pack expansion, the invented template parameter is a template
3704 if (ppd
->type_pack_expansion_p
&& is_auto (t
))
3705 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3706 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3707 parameter_pack_p
= true;
3712 if (DECL_PACK_P (t
))
3714 /* We don't want to walk into the type of a PARM_DECL,
3715 because we don't want to see the type parameter pack. */
3717 parameter_pack_p
= true;
3722 if (DECL_PACK_P (t
))
3724 /* We don't want to walk into the type of a variadic capture proxy,
3725 because we don't want to see the type parameter pack. */
3727 parameter_pack_p
= true;
3729 else if (variable_template_specialization_p (t
))
3731 cp_walk_tree (&DECL_TI_ARGS (t
),
3732 find_parameter_packs_r
,
3739 if (builtin_pack_call_p (t
))
3740 parameter_pack_p
= true;
3744 parameter_pack_p
= true;
3747 /* Not a parameter pack. */
3751 if (parameter_pack_p
)
3753 /* Add this parameter pack to the list. */
3754 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3758 cp_walk_tree (&TYPE_CONTEXT (t
),
3759 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3761 /* This switch statement will return immediately if we don't find a
3763 switch (TREE_CODE (t
))
3765 case TEMPLATE_PARM_INDEX
:
3768 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3769 /* Check the template itself. */
3770 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3771 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3772 /* Check the template arguments. */
3773 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3778 case TEMPLATE_TYPE_PARM
:
3779 case TEMPLATE_TEMPLATE_PARM
:
3786 /* Ignore the declaration of a capture proxy for a parameter pack. */
3787 if (is_capture_proxy (DECL_EXPR_DECL (t
)))
3792 if (TYPE_PTRMEMFUNC_P (t
))
3798 if (TYPE_TEMPLATE_INFO (t
))
3799 cp_walk_tree (&TYPE_TI_ARGS (t
),
3800 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3806 if (!DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
3811 cp_walk_tree (&TREE_TYPE (t
),
3812 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3816 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3821 case TYPE_PACK_EXPANSION
:
3822 case EXPR_PACK_EXPANSION
:
3827 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3832 case IDENTIFIER_NODE
:
3833 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3840 /* Look at explicit captures. */
3841 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
);
3842 cap
; cap
= TREE_CHAIN (cap
))
3843 cp_walk_tree (&TREE_VALUE (cap
), &find_parameter_packs_r
, ppd
,
3845 /* Since we defer implicit capture, look in the body as well. */
3846 tree fn
= lambda_function (t
);
3847 cp_walk_tree (&DECL_SAVED_TREE (fn
), &find_parameter_packs_r
, ppd
,
3855 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3856 type_pack_expansion_p to false so that any placeholders
3857 within the expression don't get marked as parameter packs. */
3858 bool type_pack_expansion_p
= ppd
->type_pack_expansion_p
;
3859 ppd
->type_pack_expansion_p
= false;
3860 cp_walk_tree (&DECLTYPE_TYPE_EXPR (t
), &find_parameter_packs_r
,
3862 ppd
->type_pack_expansion_p
= type_pack_expansion_p
;
3874 /* Determines if the expression or type T uses any parameter packs. */
3876 uses_parameter_packs (tree t
)
3878 tree parameter_packs
= NULL_TREE
;
3879 struct find_parameter_pack_data ppd
;
3880 ppd
.parameter_packs
= ¶meter_packs
;
3881 ppd
.visited
= new hash_set
<tree
>;
3882 ppd
.type_pack_expansion_p
= false;
3883 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3885 return parameter_packs
!= NULL_TREE
;
3888 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3889 representation a base-class initializer into a parameter pack
3890 expansion. If all goes well, the resulting node will be an
3891 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3894 make_pack_expansion (tree arg
, tsubst_flags_t complain
)
3897 tree parameter_packs
= NULL_TREE
;
3898 bool for_types
= false;
3899 struct find_parameter_pack_data ppd
;
3901 if (!arg
|| arg
== error_mark_node
)
3904 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3906 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3907 class initializer. In this case, the TREE_PURPOSE will be a
3908 _TYPE node (representing the base class expansion we're
3909 initializing) and the TREE_VALUE will be a TREE_LIST
3910 containing the initialization arguments.
3912 The resulting expansion looks somewhat different from most
3913 expansions. Rather than returning just one _EXPANSION, we
3914 return a TREE_LIST whose TREE_PURPOSE is a
3915 TYPE_PACK_EXPANSION containing the bases that will be
3916 initialized. The TREE_VALUE will be identical to the
3917 original TREE_VALUE, which is a list of arguments that will
3918 be passed to each base. We do not introduce any new pack
3919 expansion nodes into the TREE_VALUE (although it is possible
3920 that some already exist), because the TREE_PURPOSE and
3921 TREE_VALUE all need to be expanded together with the same
3922 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3923 resulting TREE_PURPOSE will mention the parameter packs in
3924 both the bases and the arguments to the bases. */
3927 tree parameter_packs
= NULL_TREE
;
3929 /* Determine which parameter packs will be used by the base
3931 ppd
.visited
= new hash_set
<tree
>;
3932 ppd
.parameter_packs
= ¶meter_packs
;
3933 ppd
.type_pack_expansion_p
= true;
3934 gcc_assert (TYPE_P (TREE_PURPOSE (arg
)));
3935 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3938 if (parameter_packs
== NULL_TREE
)
3940 if (complain
& tf_error
)
3941 error ("base initializer expansion %qT contains no parameter packs",
3944 return error_mark_node
;
3947 if (TREE_VALUE (arg
) != void_type_node
)
3949 /* Collect the sets of parameter packs used in each of the
3950 initialization arguments. */
3951 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3953 /* Determine which parameter packs will be expanded in this
3955 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3962 /* Create the pack expansion type for the base type. */
3963 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3964 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3965 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3966 PACK_EXPANSION_LOCAL_P (purpose
) = at_function_scope_p ();
3968 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3969 they will rarely be compared to anything. */
3970 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3972 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3975 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3978 /* Build the PACK_EXPANSION_* node. */
3980 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3981 : make_node (EXPR_PACK_EXPANSION
);
3982 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3983 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3985 /* Propagate type and const-expression information. */
3986 TREE_TYPE (result
) = TREE_TYPE (arg
);
3987 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3988 /* Mark this read now, since the expansion might be length 0. */
3989 mark_exp_read (arg
);
3992 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3993 they will rarely be compared to anything. */
3994 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3996 /* Determine which parameter packs will be expanded. */
3997 ppd
.parameter_packs
= ¶meter_packs
;
3998 ppd
.visited
= new hash_set
<tree
>;
3999 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
4000 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4003 /* Make sure we found some parameter packs. */
4004 if (parameter_packs
== NULL_TREE
)
4006 if (complain
& tf_error
)
4009 error ("expansion pattern %qT contains no argument packs", arg
);
4011 error ("expansion pattern %qE contains no argument packs", arg
);
4013 return error_mark_node
;
4015 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
4017 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
4022 /* Checks T for any "bare" parameter packs, which have not yet been
4023 expanded, and issues an error if any are found. This operation can
4024 only be done on full expressions or types (e.g., an expression
4025 statement, "if" condition, etc.), because we could have expressions like:
4027 foo(f(g(h(args)))...)
4029 where "args" is a parameter pack. check_for_bare_parameter_packs
4030 should not be called for the subexpressions args, h(args),
4031 g(h(args)), or f(g(h(args))), because we would produce erroneous
4034 Returns TRUE and emits an error if there were bare parameter packs,
4035 returns FALSE otherwise. */
4037 check_for_bare_parameter_packs (tree t
)
4039 tree parameter_packs
= NULL_TREE
;
4040 struct find_parameter_pack_data ppd
;
4042 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
4045 /* A lambda might use a parameter pack from the containing context. */
4046 if (current_class_type
&& LAMBDA_TYPE_P (current_class_type
)
4047 && CLASSTYPE_TEMPLATE_INFO (current_class_type
))
4050 if (TREE_CODE (t
) == TYPE_DECL
)
4053 ppd
.parameter_packs
= ¶meter_packs
;
4054 ppd
.visited
= new hash_set
<tree
>;
4055 ppd
.type_pack_expansion_p
= false;
4056 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
4059 if (parameter_packs
)
4061 location_t loc
= EXPR_LOC_OR_LOC (t
, input_location
);
4062 error_at (loc
, "parameter packs not expanded with %<...%>:");
4063 while (parameter_packs
)
4065 tree pack
= TREE_VALUE (parameter_packs
);
4066 tree name
= NULL_TREE
;
4068 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
4069 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
4070 name
= TYPE_NAME (pack
);
4071 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
4072 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
4073 else if (TREE_CODE (pack
) == CALL_EXPR
)
4074 name
= DECL_NAME (CALL_EXPR_FN (pack
));
4076 name
= DECL_NAME (pack
);
4079 inform (loc
, " %qD", name
);
4081 inform (loc
, " <anonymous>");
4083 parameter_packs
= TREE_CHAIN (parameter_packs
);
4092 /* Expand any parameter packs that occur in the template arguments in
4095 expand_template_argument_pack (tree args
)
4097 if (args
== error_mark_node
)
4098 return error_mark_node
;
4100 tree result_args
= NULL_TREE
;
4101 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
4102 int num_result_args
= -1;
4103 int non_default_args_count
= -1;
4105 /* First, determine if we need to expand anything, and the number of
4106 slots we'll need. */
4107 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4109 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4110 if (arg
== NULL_TREE
)
4112 if (ARGUMENT_PACK_P (arg
))
4114 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
4115 if (num_result_args
< 0)
4116 num_result_args
= in_arg
+ num_packed
;
4118 num_result_args
+= num_packed
;
4122 if (num_result_args
>= 0)
4127 /* If no expansion is necessary, we're done. */
4128 if (num_result_args
< 0)
4131 /* Expand arguments. */
4132 result_args
= make_tree_vec (num_result_args
);
4133 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
4134 non_default_args_count
=
4135 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
4136 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
4138 tree arg
= TREE_VEC_ELT (args
, in_arg
);
4139 if (ARGUMENT_PACK_P (arg
))
4141 tree packed
= ARGUMENT_PACK_ARGS (arg
);
4142 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
4143 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
4144 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
4145 if (non_default_args_count
> 0)
4146 non_default_args_count
+= num_packed
- 1;
4150 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
4154 if (non_default_args_count
>= 0)
4155 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
4159 /* Checks if DECL shadows a template parameter.
4161 [temp.local]: A template-parameter shall not be redeclared within its
4162 scope (including nested scopes).
4164 Emits an error and returns TRUE if the DECL shadows a parameter,
4165 returns FALSE otherwise. */
4168 check_template_shadow (tree decl
)
4172 /* If we're not in a template, we can't possibly shadow a template
4174 if (!current_template_parms
)
4177 /* Figure out what we're shadowing. */
4178 decl
= OVL_FIRST (decl
);
4179 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
4181 /* If there's no previous binding for this name, we're not shadowing
4182 anything, let alone a template parameter. */
4186 /* If we're not shadowing a template parameter, we're done. Note
4187 that OLDDECL might be an OVERLOAD (or perhaps even an
4188 ERROR_MARK), so we can't just blithely assume it to be a _DECL
4190 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
4193 /* We check for decl != olddecl to avoid bogus errors for using a
4194 name inside a class. We check TPFI to avoid duplicate errors for
4195 inline member templates. */
4197 || (DECL_TEMPLATE_PARM_P (decl
)
4198 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
4201 /* Don't complain about the injected class name, as we've already
4202 complained about the class itself. */
4203 if (DECL_SELF_REFERENCE_P (decl
))
4206 if (DECL_TEMPLATE_PARM_P (decl
))
4207 error ("declaration of template parameter %q+D shadows "
4208 "template parameter", decl
);
4210 error ("declaration of %q+#D shadows template parameter", decl
);
4211 inform (DECL_SOURCE_LOCATION (olddecl
),
4212 "template parameter %qD declared here", olddecl
);
4216 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
4217 ORIG_LEVEL, DECL, and TYPE. */
4220 build_template_parm_index (int index
,
4226 tree t
= make_node (TEMPLATE_PARM_INDEX
);
4227 TEMPLATE_PARM_IDX (t
) = index
;
4228 TEMPLATE_PARM_LEVEL (t
) = level
;
4229 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
4230 TEMPLATE_PARM_DECL (t
) = decl
;
4231 TREE_TYPE (t
) = type
;
4232 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
4233 TREE_READONLY (t
) = TREE_READONLY (decl
);
4238 /* Find the canonical type parameter for the given template type
4239 parameter. Returns the canonical type parameter, which may be TYPE
4240 if no such parameter existed. */
4243 canonical_type_parameter (tree type
)
4246 int idx
= TEMPLATE_TYPE_IDX (type
);
4247 if (!canonical_template_parms
)
4248 vec_alloc (canonical_template_parms
, idx
+ 1);
4250 if (canonical_template_parms
->length () <= (unsigned) idx
)
4251 vec_safe_grow_cleared (canonical_template_parms
, idx
+ 1);
4253 list
= (*canonical_template_parms
)[idx
];
4254 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
4255 list
= TREE_CHAIN (list
);
4258 return TREE_VALUE (list
);
4261 (*canonical_template_parms
)[idx
]
4262 = tree_cons (NULL_TREE
, type
, (*canonical_template_parms
)[idx
]);
4267 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
4268 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
4269 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
4270 new one is created. */
4273 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
4274 tsubst_flags_t complain
)
4276 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
4277 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
4278 != TEMPLATE_PARM_LEVEL (index
) - levels
)
4279 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
4281 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
4284 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
4285 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
4286 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
4287 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
4288 DECL_ARTIFICIAL (decl
) = 1;
4289 SET_DECL_TEMPLATE_PARM_P (decl
);
4291 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
4292 TEMPLATE_PARM_LEVEL (index
) - levels
,
4293 TEMPLATE_PARM_ORIG_LEVEL (index
),
4295 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
4296 TEMPLATE_PARM_PARAMETER_PACK (t
)
4297 = TEMPLATE_PARM_PARAMETER_PACK (index
);
4299 /* Template template parameters need this. */
4300 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4302 DECL_TEMPLATE_RESULT (decl
)
4303 = build_decl (DECL_SOURCE_LOCATION (decl
),
4304 TYPE_DECL
, DECL_NAME (decl
), type
);
4305 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
4306 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
4307 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
4311 return TEMPLATE_PARM_DESCENDANTS (index
);
4314 /* Process information from new template parameter PARM and append it
4315 to the LIST being built. This new parameter is a non-type
4316 parameter iff IS_NON_TYPE is true. This new parameter is a
4317 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4321 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4322 bool is_non_type
, bool is_parameter_pack
)
4327 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4328 tree defval
= TREE_PURPOSE (parm
);
4329 tree constr
= TREE_TYPE (parm
);
4333 tree p
= tree_last (list
);
4335 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4338 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4339 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4341 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4349 parm
= TREE_VALUE (parm
);
4351 SET_DECL_TEMPLATE_PARM_P (parm
);
4353 if (TREE_TYPE (parm
) != error_mark_node
)
4357 The top-level cv-qualifiers on the template-parameter are
4358 ignored when determining its type. */
4359 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4360 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4361 TREE_TYPE (parm
) = error_mark_node
;
4362 else if (uses_parameter_packs (TREE_TYPE (parm
))
4363 && !is_parameter_pack
4364 /* If we're in a nested template parameter list, the template
4365 template parameter could be a parameter pack. */
4366 && processing_template_parmlist
== 1)
4368 /* This template parameter is not a parameter pack, but it
4369 should be. Complain about "bare" parameter packs. */
4370 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4372 /* Recover by calling this a parameter pack. */
4373 is_parameter_pack
= true;
4377 /* A template parameter is not modifiable. */
4378 TREE_CONSTANT (parm
) = 1;
4379 TREE_READONLY (parm
) = 1;
4380 decl
= build_decl (parm_loc
,
4381 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4382 TREE_CONSTANT (decl
) = 1;
4383 TREE_READONLY (decl
) = 1;
4384 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4385 = build_template_parm_index (idx
, processing_template_decl
,
4386 processing_template_decl
,
4387 decl
, TREE_TYPE (parm
));
4389 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4390 = is_parameter_pack
;
4395 parm
= TREE_VALUE (TREE_VALUE (parm
));
4397 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4399 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4400 /* This is for distinguishing between real templates and template
4401 template parameters */
4402 TREE_TYPE (parm
) = t
;
4403 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4408 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4409 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4410 decl
= build_decl (parm_loc
,
4411 TYPE_DECL
, parm
, t
);
4414 TYPE_NAME (t
) = decl
;
4415 TYPE_STUB_DECL (t
) = decl
;
4417 TEMPLATE_TYPE_PARM_INDEX (t
)
4418 = build_template_parm_index (idx
, processing_template_decl
,
4419 processing_template_decl
,
4420 decl
, TREE_TYPE (parm
));
4421 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4422 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4424 DECL_ARTIFICIAL (decl
) = 1;
4425 SET_DECL_TEMPLATE_PARM_P (decl
);
4427 /* Build requirements for the type/template parameter.
4428 This must be done after SET_DECL_TEMPLATE_PARM_P or
4429 process_template_parm could fail. */
4430 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4434 if (defval
&& TREE_CODE (defval
) == OVERLOAD
)
4435 lookup_keep (defval
, true);
4437 /* Build the parameter node linking the parameter declaration,
4438 its default argument (if any), and its constraints (if any). */
4439 parm
= build_tree_list (defval
, parm
);
4440 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4442 return chainon (list
, parm
);
4445 /* The end of a template parameter list has been reached. Process the
4446 tree list into a parameter vector, converting each parameter into a more
4447 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4451 end_template_parm_list (tree parms
)
4455 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4457 /* Pop the dummy parameter level and add the real one. */
4458 current_template_parms
= TREE_CHAIN (current_template_parms
);
4460 current_template_parms
4461 = tree_cons (size_int (processing_template_decl
),
4462 saved_parmlist
, current_template_parms
);
4464 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4466 next
= TREE_CHAIN (parm
);
4467 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4468 TREE_CHAIN (parm
) = NULL_TREE
;
4471 --processing_template_parmlist
;
4473 return saved_parmlist
;
4476 // Explicitly indicate the end of the template parameter list. We assume
4477 // that the current template parameters have been constructed and/or
4478 // managed explicitly, as when creating new template template parameters
4479 // from a shorthand constraint.
4481 end_template_parm_list ()
4483 --processing_template_parmlist
;
4486 /* end_template_decl is called after a template declaration is seen. */
4489 end_template_decl (void)
4491 reset_specialization ();
4493 if (! processing_template_decl
)
4496 /* This matches the pushlevel in begin_template_parm_list. */
4499 --processing_template_decl
;
4500 current_template_parms
= TREE_CHAIN (current_template_parms
);
4503 /* Takes a TREE_LIST representing a template parameter and convert it
4504 into an argument suitable to be passed to the type substitution
4505 functions. Note that If the TREE_LIST contains an error_mark
4506 node, the returned argument is error_mark_node. */
4509 template_parm_to_arg (tree t
)
4513 || TREE_CODE (t
) != TREE_LIST
)
4516 if (error_operand_p (TREE_VALUE (t
)))
4517 return error_mark_node
;
4521 if (TREE_CODE (t
) == TYPE_DECL
4522 || TREE_CODE (t
) == TEMPLATE_DECL
)
4526 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4528 /* Turn this argument into a TYPE_ARGUMENT_PACK
4529 with a single element, which expands T. */
4530 tree vec
= make_tree_vec (1);
4532 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4534 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4536 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4537 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4542 t
= DECL_INITIAL (t
);
4544 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4546 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4547 with a single element, which expands T. */
4548 tree vec
= make_tree_vec (1);
4550 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4552 t
= convert_from_reference (t
);
4553 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4555 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4556 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4559 t
= convert_from_reference (t
);
4564 /* Given a single level of template parameters (a TREE_VEC), return it
4565 as a set of template arguments. */
4568 template_parms_level_to_args (tree parms
)
4570 tree a
= copy_node (parms
);
4571 TREE_TYPE (a
) = NULL_TREE
;
4572 for (int i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4573 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4576 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4581 /* Given a set of template parameters, return them as a set of template
4582 arguments. The template parameters are represented as a TREE_VEC, in
4583 the form documented in cp-tree.h for template arguments. */
4586 template_parms_to_args (tree parms
)
4589 tree args
= NULL_TREE
;
4590 int length
= TMPL_PARMS_DEPTH (parms
);
4593 /* If there is only one level of template parameters, we do not
4594 create a TREE_VEC of TREE_VECs. Instead, we return a single
4595 TREE_VEC containing the arguments. */
4597 args
= make_tree_vec (length
);
4599 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4601 tree a
= template_parms_level_to_args (TREE_VALUE (header
));
4604 TREE_VEC_ELT (args
, --l
) = a
;
4612 /* Within the declaration of a template, return the currently active
4613 template parameters as an argument TREE_VEC. */
4616 current_template_args (void)
4618 return template_parms_to_args (current_template_parms
);
4621 /* Update the declared TYPE by doing any lookups which were thought to be
4622 dependent, but are not now that we know the SCOPE of the declarator. */
4625 maybe_update_decl_type (tree orig_type
, tree scope
)
4627 tree type
= orig_type
;
4629 if (type
== NULL_TREE
)
4632 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4633 type
= TREE_TYPE (type
);
4635 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4636 && dependent_type_p (type
)
4637 /* Don't bother building up the args in this case. */
4638 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4640 /* tsubst in the args corresponding to the template parameters,
4641 including auto if present. Most things will be unchanged, but
4642 make_typename_type and tsubst_qualified_id will resolve
4643 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4644 tree args
= current_template_args ();
4645 tree auto_node
= type_uses_auto (type
);
4649 tree auto_vec
= make_tree_vec (1);
4650 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4651 args
= add_to_template_args (args
, auto_vec
);
4653 pushed
= push_scope (scope
);
4654 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4659 if (type
== error_mark_node
)
4662 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4664 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4667 type
= TYPE_NAME (type
);
4672 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4673 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4674 the new template is a member template. */
4677 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4679 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4680 SET_DECL_LANGUAGE (tmpl
, DECL_LANGUAGE (decl
));
4681 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4682 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4683 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4684 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4689 struct template_parm_data
4691 /* The level of the template parameters we are currently
4695 /* The index of the specialization argument we are currently
4699 /* An array whose size is the number of template parameters. The
4700 elements are nonzero if the parameter has been used in any one
4701 of the arguments processed so far. */
4704 /* An array whose size is the number of template arguments. The
4705 elements are nonzero if the argument makes use of template
4706 parameters of this level. */
4707 int* arg_uses_template_parms
;
4710 /* Subroutine of push_template_decl used to see if each template
4711 parameter in a partial specialization is used in the explicit
4712 argument list. If T is of the LEVEL given in DATA (which is
4713 treated as a template_parm_data*), then DATA->PARMS is marked
4717 mark_template_parm (tree t
, void* data
)
4721 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4723 template_parm_level_and_index (t
, &level
, &idx
);
4725 if (level
== tpd
->level
)
4727 tpd
->parms
[idx
] = 1;
4728 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4731 /* In C++17 the type of a non-type argument is a deduced context. */
4732 if (cxx_dialect
>= cxx17
4733 && TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4734 for_each_template_parm (TREE_TYPE (t
),
4735 &mark_template_parm
,
4738 /*include_nondeduced_p=*/false);
4740 /* Return zero so that for_each_template_parm will continue the
4741 traversal of the tree; we want to mark *every* template parm. */
4745 /* Process the partial specialization DECL. */
4748 process_partial_specialization (tree decl
)
4750 tree type
= TREE_TYPE (decl
);
4751 tree tinfo
= get_template_info (decl
);
4752 tree maintmpl
= TI_TEMPLATE (tinfo
);
4753 tree specargs
= TI_ARGS (tinfo
);
4754 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4755 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4758 int nargs
= TREE_VEC_LENGTH (inner_args
);
4761 bool did_error_intro
= false;
4762 struct template_parm_data tpd
;
4763 struct template_parm_data tpd2
;
4765 gcc_assert (current_template_parms
);
4767 /* A concept cannot be specialized. */
4768 if (flag_concepts
&& variable_concept_p (maintmpl
))
4770 error ("specialization of variable concept %q#D", maintmpl
);
4771 return error_mark_node
;
4774 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4775 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4777 /* We check that each of the template parameters given in the
4778 partial specialization is used in the argument list to the
4779 specialization. For example:
4781 template <class T> struct S;
4782 template <class T> struct S<T*>;
4784 The second declaration is OK because `T*' uses the template
4785 parameter T, whereas
4787 template <class T> struct S<int>;
4789 is no good. Even trickier is:
4800 The S2<T> declaration is actually invalid; it is a
4801 full-specialization. Of course,
4804 struct S2<T (*)(U)>;
4806 or some such would have been OK. */
4807 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4808 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4809 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4811 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4812 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4813 for (i
= 0; i
< nargs
; ++i
)
4815 tpd
.current_arg
= i
;
4816 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4817 &mark_template_parm
,
4820 /*include_nondeduced_p=*/false);
4822 for (i
= 0; i
< ntparms
; ++i
)
4823 if (tpd
.parms
[i
] == 0)
4825 /* One of the template parms was not used in a deduced context in the
4827 if (!did_error_intro
)
4829 error ("template parameters not deducible in "
4830 "partial specialization:");
4831 did_error_intro
= true;
4834 inform (input_location
, " %qD",
4835 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4838 if (did_error_intro
)
4839 return error_mark_node
;
4841 /* [temp.class.spec]
4843 The argument list of the specialization shall not be identical to
4844 the implicit argument list of the primary template. */
4846 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4847 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4849 || !strictly_subsumes (current_template_constraints (),
4850 get_constraints (maintmpl
))))
4853 error ("partial specialization %q+D does not specialize "
4854 "any template arguments; to define the primary template, "
4855 "remove the template argument list", decl
);
4857 error ("partial specialization %q+D does not specialize any "
4858 "template arguments and is not more constrained than "
4859 "the primary template; to define the primary template, "
4860 "remove the template argument list", decl
);
4861 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4864 /* A partial specialization that replaces multiple parameters of the
4865 primary template with a pack expansion is less specialized for those
4867 if (nargs
< DECL_NTPARMS (maintmpl
))
4869 error ("partial specialization is not more specialized than the "
4870 "primary template because it replaces multiple parameters "
4871 "with a pack expansion");
4872 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4873 /* Avoid crash in process_partial_specialization. */
4877 /* If we aren't in a dependent class, we can actually try deduction. */
4878 else if (tpd
.level
== 1
4879 /* FIXME we should be able to handle a partial specialization of a
4880 partial instantiation, but currently we can't (c++/41727). */
4881 && TMPL_ARGS_DEPTH (specargs
) == 1
4882 && !get_partial_spec_bindings (maintmpl
, maintmpl
, specargs
))
4884 if (permerror (input_location
, "partial specialization %qD is not "
4885 "more specialized than", decl
))
4886 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template %qD",
4890 /* [temp.class.spec]
4892 A partially specialized non-type argument expression shall not
4893 involve template parameters of the partial specialization except
4894 when the argument expression is a simple identifier.
4896 The type of a template parameter corresponding to a specialized
4897 non-type argument shall not be dependent on a parameter of the
4900 Also, we verify that pack expansions only occur at the
4901 end of the argument list. */
4902 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4904 for (i
= 0; i
< nargs
; ++i
)
4906 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4907 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4908 tree packed_args
= NULL_TREE
;
4911 if (ARGUMENT_PACK_P (arg
))
4913 /* Extract the arguments from the argument pack. We'll be
4914 iterating over these in the following loop. */
4915 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4916 len
= TREE_VEC_LENGTH (packed_args
);
4919 for (j
= 0; j
< len
; j
++)
4922 /* Get the Jth argument in the parameter pack. */
4923 arg
= TREE_VEC_ELT (packed_args
, j
);
4925 if (PACK_EXPANSION_P (arg
))
4927 /* Pack expansions must come at the end of the
4929 if ((packed_args
&& j
< len
- 1)
4930 || (!packed_args
&& i
< nargs
- 1))
4932 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4933 error ("parameter pack argument %qE must be at the "
4934 "end of the template argument list", arg
);
4936 error ("parameter pack argument %qT must be at the "
4937 "end of the template argument list", arg
);
4941 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4942 /* We only care about the pattern. */
4943 arg
= PACK_EXPANSION_PATTERN (arg
);
4945 if (/* These first two lines are the `non-type' bit. */
4947 && TREE_CODE (arg
) != TEMPLATE_DECL
4948 /* This next two lines are the `argument expression is not just a
4949 simple identifier' condition and also the `specialized
4950 non-type argument' bit. */
4951 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4952 && !(REFERENCE_REF_P (arg
)
4953 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4955 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4956 || (packed_args
&& uses_template_parms (arg
)))
4957 error ("template argument %qE involves template parameter(s)",
4961 /* Look at the corresponding template parameter,
4962 marking which template parameters its type depends
4964 tree type
= TREE_TYPE (parm
);
4968 /* We haven't yet initialized TPD2. Do so now. */
4969 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4970 /* The number of parameters here is the number in the
4971 main template, which, as checked in the assertion
4973 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4975 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4978 /* Mark the template parameters. But this time, we're
4979 looking for the template parameters of the main
4980 template, not in the specialization. */
4981 tpd2
.current_arg
= i
;
4982 tpd2
.arg_uses_template_parms
[i
] = 0;
4983 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4984 for_each_template_parm (type
,
4985 &mark_template_parm
,
4988 /*include_nondeduced_p=*/false);
4990 if (tpd2
.arg_uses_template_parms
[i
])
4992 /* The type depended on some template parameters.
4993 If they are fully specialized in the
4994 specialization, that's OK. */
4997 for (j
= 0; j
< nargs
; ++j
)
4998 if (tpd2
.parms
[j
] != 0
4999 && tpd
.arg_uses_template_parms
[j
])
5002 error_n (input_location
, count
,
5003 "type %qT of template argument %qE depends "
5004 "on a template parameter",
5005 "type %qT of template argument %qE depends "
5006 "on template parameters",
5015 /* We should only get here once. */
5016 if (TREE_CODE (decl
) == TYPE_DECL
)
5017 gcc_assert (!COMPLETE_TYPE_P (type
));
5019 // Build the template decl.
5020 tree tmpl
= build_template_decl (decl
, current_template_parms
,
5021 DECL_MEMBER_TEMPLATE_P (maintmpl
));
5022 TREE_TYPE (tmpl
) = type
;
5023 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5024 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5025 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
5026 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
5028 /* Give template template parms a DECL_CONTEXT of the template
5029 for which they are a parameter. */
5030 for (i
= 0; i
< ntparms
; ++i
)
5032 tree parm
= TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
));
5033 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5034 DECL_CONTEXT (parm
) = tmpl
;
5038 /* We didn't register this in check_explicit_specialization so we could
5039 wait until the constraints were set. */
5040 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
5042 associate_classtype_constraints (type
);
5044 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
5045 = tree_cons (specargs
, tmpl
,
5046 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
5047 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
5049 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
5050 inst
= TREE_CHAIN (inst
))
5052 tree instance
= TREE_VALUE (inst
);
5053 if (TYPE_P (instance
)
5054 ? (COMPLETE_TYPE_P (instance
)
5055 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
5056 : DECL_TEMPLATE_INSTANTIATION (instance
))
5058 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
5059 tree inst_decl
= (DECL_P (instance
)
5060 ? instance
: TYPE_NAME (instance
));
5063 else if (spec
== error_mark_node
)
5064 permerror (input_location
,
5065 "declaration of %qD ambiguates earlier template "
5066 "instantiation for %qD", decl
, inst_decl
);
5067 else if (TREE_VALUE (spec
) == tmpl
)
5068 permerror (input_location
,
5069 "partial specialization of %qD after instantiation "
5070 "of %qD", decl
, inst_decl
);
5077 /* PARM is a template parameter of some form; return the corresponding
5078 TEMPLATE_PARM_INDEX. */
5081 get_template_parm_index (tree parm
)
5083 if (TREE_CODE (parm
) == PARM_DECL
5084 || TREE_CODE (parm
) == CONST_DECL
)
5085 parm
= DECL_INITIAL (parm
);
5086 else if (TREE_CODE (parm
) == TYPE_DECL
5087 || TREE_CODE (parm
) == TEMPLATE_DECL
)
5088 parm
= TREE_TYPE (parm
);
5089 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
5090 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
5091 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
5092 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
5093 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
5097 /* Subroutine of fixed_parameter_pack_p below. Look for any template
5098 parameter packs used by the template parameter PARM. */
5101 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
5103 /* A type parm can't refer to another parm. */
5104 if (TREE_CODE (parm
) == TYPE_DECL
|| parm
== error_mark_node
)
5106 else if (TREE_CODE (parm
) == PARM_DECL
)
5108 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
5113 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
5115 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
5116 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
5117 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
5120 /* PARM is a template parameter pack. Return any parameter packs used in
5121 its type or the type of any of its template parameters. If there are
5122 any such packs, it will be instantiated into a fixed template parameter
5123 list by partial instantiation rather than be fully deduced. */
5126 fixed_parameter_pack_p (tree parm
)
5128 /* This can only be true in a member template. */
5129 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
5131 /* This can only be true for a parameter pack. */
5132 if (!template_parameter_pack_p (parm
))
5134 /* A type parm can't refer to another parm. */
5135 if (TREE_CODE (parm
) == TYPE_DECL
)
5138 tree parameter_packs
= NULL_TREE
;
5139 struct find_parameter_pack_data ppd
;
5140 ppd
.parameter_packs
= ¶meter_packs
;
5141 ppd
.visited
= new hash_set
<tree
>;
5142 ppd
.type_pack_expansion_p
= false;
5144 fixed_parameter_pack_p_1 (parm
, &ppd
);
5147 return parameter_packs
;
5150 /* Check that a template declaration's use of default arguments and
5151 parameter packs is not invalid. Here, PARMS are the template
5152 parameters. IS_PRIMARY is true if DECL is the thing declared by
5153 a primary template. IS_PARTIAL is true if DECL is a partial
5156 IS_FRIEND_DECL is nonzero if DECL is either a non-defining friend
5157 function template declaration or a friend class template
5158 declaration. In the function case, 1 indicates a declaration, 2
5159 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
5160 emitted for extraneous default arguments.
5162 Returns TRUE if there were no errors found, FALSE otherwise. */
5165 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
5166 bool is_partial
, int is_friend_decl
)
5169 int last_level_to_check
;
5171 bool no_errors
= true;
5175 A default template-argument shall not be specified in a
5176 function template declaration or a function template definition, nor
5177 in the template-parameter-list of the definition of a member of a
5180 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
5181 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
5182 /* You can't have a function template declaration in a local
5183 scope, nor you can you define a member of a class template in a
5187 if ((TREE_CODE (decl
) == TYPE_DECL
5189 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5190 || (TREE_CODE (decl
) == FUNCTION_DECL
5191 && LAMBDA_FUNCTION_P (decl
)))
5192 /* A lambda doesn't have an explicit declaration; don't complain
5193 about the parms of the enclosing class. */
5196 if (current_class_type
5197 && !TYPE_BEING_DEFINED (current_class_type
)
5198 && DECL_LANG_SPECIFIC (decl
)
5199 && DECL_DECLARES_FUNCTION_P (decl
)
5200 /* If this is either a friend defined in the scope of the class
5201 or a member function. */
5202 && (DECL_FUNCTION_MEMBER_P (decl
)
5203 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
5204 : DECL_FRIEND_CONTEXT (decl
)
5205 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
5207 /* And, if it was a member function, it really was defined in
5208 the scope of the class. */
5209 && (!DECL_FUNCTION_MEMBER_P (decl
)
5210 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
5211 /* We already checked these parameters when the template was
5212 declared, so there's no need to do it again now. This function
5213 was defined in class scope, but we're processing its body now
5214 that the class is complete. */
5217 /* Core issue 226 (C++0x only): the following only applies to class
5220 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
5224 If a template-parameter has a default template-argument, all
5225 subsequent template-parameters shall have a default
5226 template-argument supplied. */
5227 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
5229 tree inner_parms
= TREE_VALUE (parm_level
);
5230 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
5231 int seen_def_arg_p
= 0;
5234 for (i
= 0; i
< ntparms
; ++i
)
5236 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
5238 if (parm
== error_mark_node
)
5241 if (TREE_PURPOSE (parm
))
5243 else if (seen_def_arg_p
5244 && !template_parameter_pack_p (TREE_VALUE (parm
)))
5246 error ("no default argument for %qD", TREE_VALUE (parm
));
5247 /* For better subsequent error-recovery, we indicate that
5248 there should have been a default argument. */
5249 TREE_PURPOSE (parm
) = error_mark_node
;
5252 else if (!is_partial
5254 /* Don't complain about an enclosing partial
5256 && parm_level
== parms
5257 && TREE_CODE (decl
) == TYPE_DECL
5259 && template_parameter_pack_p (TREE_VALUE (parm
))
5260 /* A fixed parameter pack will be partially
5261 instantiated into a fixed length list. */
5262 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
5264 /* A primary class template can only have one
5265 parameter pack, at the end of the template
5268 error ("parameter pack %q+D must be at the end of the"
5269 " template parameter list", TREE_VALUE (parm
));
5271 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
5279 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
5283 /* For an ordinary class template, default template arguments are
5284 allowed at the innermost level, e.g.:
5285 template <class T = int>
5287 but, in a partial specialization, they're not allowed even
5288 there, as we have in [temp.class.spec]:
5290 The template parameter list of a specialization shall not
5291 contain default template argument values.
5293 So, for a partial specialization, or for a function template
5294 (in C++98/C++03), we look at all of them. */
5297 /* But, for a primary class template that is not a partial
5298 specialization we look at all template parameters except the
5300 parms
= TREE_CHAIN (parms
);
5302 /* Figure out what error message to issue. */
5303 if (is_friend_decl
== 2)
5304 msg
= G_("default template arguments may not be used in function template "
5305 "friend re-declaration");
5306 else if (is_friend_decl
)
5307 msg
= G_("default template arguments may not be used in template "
5308 "friend declarations");
5309 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
5310 msg
= G_("default template arguments may not be used in function templates "
5311 "without -std=c++11 or -std=gnu++11");
5312 else if (is_partial
)
5313 msg
= G_("default template arguments may not be used in "
5314 "partial specializations");
5315 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
5316 msg
= G_("default argument for template parameter for class enclosing %qD");
5318 /* Per [temp.param]/9, "A default template-argument shall not be
5319 specified in the template-parameter-lists of the definition of
5320 a member of a class template that appears outside of the member's
5321 class.", thus if we aren't handling a member of a class template
5322 there is no need to examine the parameters. */
5325 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
5326 /* If we're inside a class definition, there's no need to
5327 examine the parameters to the class itself. On the one
5328 hand, they will be checked when the class is defined, and,
5329 on the other, default arguments are valid in things like:
5330 template <class T = double>
5331 struct S { template <class U> void f(U); };
5332 Here the default argument for `S' has no bearing on the
5333 declaration of `f'. */
5334 last_level_to_check
= template_class_depth (current_class_type
) + 1;
5336 /* Check everything. */
5337 last_level_to_check
= 0;
5339 for (parm_level
= parms
;
5340 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
5341 parm_level
= TREE_CHAIN (parm_level
))
5343 tree inner_parms
= TREE_VALUE (parm_level
);
5347 ntparms
= TREE_VEC_LENGTH (inner_parms
);
5348 for (i
= 0; i
< ntparms
; ++i
)
5350 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
5353 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5358 if (is_friend_decl
== 2)
5365 /* Clear out the default argument so that we are not
5367 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5371 /* At this point, if we're still interested in issuing messages,
5372 they must apply to classes surrounding the object declared. */
5374 msg
= G_("default argument for template parameter for class "
5381 /* Worker for push_template_decl_real, called via
5382 for_each_template_parm. DATA is really an int, indicating the
5383 level of the parameters we are interested in. If T is a template
5384 parameter of that level, return nonzero. */
5387 template_parm_this_level_p (tree t
, void* data
)
5389 int this_level
= *(int *)data
;
5392 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5393 level
= TEMPLATE_PARM_LEVEL (t
);
5395 level
= TEMPLATE_TYPE_LEVEL (t
);
5396 return level
== this_level
;
5399 /* Worker for uses_outer_template_parms, called via for_each_template_parm.
5400 DATA is really an int, indicating the innermost outer level of parameters.
5401 If T is a template parameter of that level or further out, return
5405 template_parm_outer_level (tree t
, void *data
)
5407 int this_level
= *(int *)data
;
5410 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5411 level
= TEMPLATE_PARM_LEVEL (t
);
5413 level
= TEMPLATE_TYPE_LEVEL (t
);
5414 return level
<= this_level
;
5417 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5418 parameters given by current_template_args, or reuses a
5419 previously existing one, if appropriate. Returns the DECL, or an
5420 equivalent one, if it is replaced via a call to duplicate_decls.
5422 If IS_FRIEND is true, DECL is a friend declaration. */
5425 push_template_decl_real (tree decl
, bool is_friend
)
5433 int new_template_p
= 0;
5434 /* True if the template is a member template, in the sense of
5436 bool member_template_p
= false;
5438 if (decl
== error_mark_node
|| !current_template_parms
)
5439 return error_mark_node
;
5441 /* See if this is a partial specialization. */
5442 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5443 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5444 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5446 && DECL_LANG_SPECIFIC (decl
)
5447 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5448 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5450 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5454 /* For a friend, we want the context of the friend, not
5455 the type of which it is a friend. */
5456 ctx
= CP_DECL_CONTEXT (decl
);
5457 else if (CP_DECL_CONTEXT (decl
)
5458 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5459 /* In the case of a virtual function, we want the class in which
5461 ctx
= CP_DECL_CONTEXT (decl
);
5463 /* Otherwise, if we're currently defining some class, the DECL
5464 is assumed to be a member of the class. */
5465 ctx
= current_scope ();
5467 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5470 if (!DECL_CONTEXT (decl
))
5471 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5473 /* See if this is a primary template. */
5474 if (is_friend
&& ctx
5475 && uses_template_parms_level (ctx
, processing_template_decl
))
5476 /* A friend template that specifies a class context, i.e.
5477 template <typename T> friend void A<T>::f();
5480 else if (TREE_CODE (decl
) == TYPE_DECL
5481 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5484 is_primary
= template_parm_scope_p ();
5488 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5490 if (DECL_CLASS_SCOPE_P (decl
))
5491 member_template_p
= true;
5492 if (TREE_CODE (decl
) == TYPE_DECL
5493 && anon_aggrname_p (DECL_NAME (decl
)))
5495 error ("template class without a name");
5496 return error_mark_node
;
5498 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5500 if (member_template_p
)
5502 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5503 error ("member template %qD may not have virt-specifiers", decl
);
5505 if (DECL_DESTRUCTOR_P (decl
))
5509 A destructor shall not be a member template. */
5510 error ("destructor %qD declared as member template", decl
);
5511 return error_mark_node
;
5513 if (IDENTIFIER_NEWDEL_OP_P (DECL_NAME (decl
))
5514 && (!prototype_p (TREE_TYPE (decl
))
5515 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5516 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5517 || (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5518 == void_list_node
)))
5520 /* [basic.stc.dynamic.allocation]
5522 An allocation function can be a function
5523 template. ... Template allocation functions shall
5524 have two or more parameters. */
5525 error ("invalid template declaration of %qD", decl
);
5526 return error_mark_node
;
5529 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5530 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5532 /* Class template, set TEMPLATE_TYPE_PARM_FOR_CLASS. */
5533 tree parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
5534 for (int i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
5536 tree t
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5537 if (TREE_CODE (t
) == TYPE_DECL
)
5539 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
5540 TEMPLATE_TYPE_PARM_FOR_CLASS (t
) = true;
5543 else if (TREE_CODE (decl
) == TYPE_DECL
5544 && TYPE_DECL_ALIAS_P (decl
))
5545 /* alias-declaration */
5546 gcc_assert (!DECL_ARTIFICIAL (decl
));
5547 else if (VAR_P (decl
))
5548 /* C++14 variable template. */;
5551 error ("template declaration of %q#D", decl
);
5552 return error_mark_node
;
5556 /* Check to see that the rules regarding the use of default
5557 arguments are not being violated. We check args for a friend
5558 functions when we know whether it's a definition, introducing
5559 declaration or re-declaration. */
5560 if (!is_friend
|| TREE_CODE (decl
) != FUNCTION_DECL
)
5561 check_default_tmpl_args (decl
, current_template_parms
,
5562 is_primary
, is_partial
, is_friend
);
5564 /* Ensure that there are no parameter packs in the type of this
5565 declaration that have not been expanded. */
5566 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5568 /* Check each of the arguments individually to see if there are
5569 any bare parameter packs. */
5570 tree type
= TREE_TYPE (decl
);
5571 tree arg
= DECL_ARGUMENTS (decl
);
5572 tree argtype
= TYPE_ARG_TYPES (type
);
5574 while (arg
&& argtype
)
5576 if (!DECL_PACK_P (arg
)
5577 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5579 /* This is a PARM_DECL that contains unexpanded parameter
5580 packs. We have already complained about this in the
5581 check_for_bare_parameter_packs call, so just replace
5582 these types with ERROR_MARK_NODE. */
5583 TREE_TYPE (arg
) = error_mark_node
;
5584 TREE_VALUE (argtype
) = error_mark_node
;
5587 arg
= DECL_CHAIN (arg
);
5588 argtype
= TREE_CHAIN (argtype
);
5591 /* Check for bare parameter packs in the return type and the
5592 exception specifiers. */
5593 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5594 /* Errors were already issued, set return type to int
5595 as the frontend doesn't expect error_mark_node as
5597 TREE_TYPE (type
) = integer_type_node
;
5598 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5599 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5601 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5602 && TYPE_DECL_ALIAS_P (decl
))
5603 ? DECL_ORIGINAL_TYPE (decl
)
5604 : TREE_TYPE (decl
)))
5606 TREE_TYPE (decl
) = error_mark_node
;
5607 return error_mark_node
;
5611 return process_partial_specialization (decl
);
5613 args
= current_template_args ();
5616 || TREE_CODE (ctx
) == FUNCTION_DECL
5617 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5618 || (TREE_CODE (decl
) == TYPE_DECL
5619 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5620 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5622 if (DECL_LANG_SPECIFIC (decl
)
5623 && DECL_TEMPLATE_INFO (decl
)
5624 && DECL_TI_TEMPLATE (decl
))
5625 tmpl
= DECL_TI_TEMPLATE (decl
);
5626 /* If DECL is a TYPE_DECL for a class-template, then there won't
5627 be DECL_LANG_SPECIFIC. The information equivalent to
5628 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5629 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5630 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5631 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5633 /* Since a template declaration already existed for this
5634 class-type, we must be redeclaring it here. Make sure
5635 that the redeclaration is valid. */
5636 redeclare_class_template (TREE_TYPE (decl
),
5637 current_template_parms
,
5638 current_template_constraints ());
5639 /* We don't need to create a new TEMPLATE_DECL; just use the
5640 one we already had. */
5641 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5645 tmpl
= build_template_decl (decl
, current_template_parms
,
5649 if (DECL_LANG_SPECIFIC (decl
)
5650 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5652 /* A specialization of a member template of a template
5654 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5655 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5656 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5662 tree a
, t
, current
, parms
;
5664 tree tinfo
= get_template_info (decl
);
5668 error ("template definition of non-template %q#D", decl
);
5669 return error_mark_node
;
5672 tmpl
= TI_TEMPLATE (tinfo
);
5674 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5675 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5676 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5677 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5681 /* The declaration is a specialization of a member
5682 template, declared outside the class. Therefore, the
5683 innermost template arguments will be NULL, so we
5684 replace them with the arguments determined by the
5685 earlier call to check_explicit_specialization. */
5686 args
= DECL_TI_ARGS (decl
);
5689 = build_template_decl (decl
, current_template_parms
,
5691 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5692 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5693 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5694 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5695 DECL_TEMPLATE_INFO (new_tmpl
)
5696 = build_template_info (tmpl
, args
);
5698 register_specialization (new_tmpl
,
5699 most_general_template (tmpl
),
5705 /* Make sure the template headers we got make sense. */
5707 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5708 i
= TMPL_PARMS_DEPTH (parms
);
5709 if (TMPL_ARGS_DEPTH (args
) != i
)
5711 error ("expected %d levels of template parms for %q#D, got %d",
5712 i
, decl
, TMPL_ARGS_DEPTH (args
));
5713 DECL_INTERFACE_KNOWN (decl
) = 1;
5714 return error_mark_node
;
5717 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5719 a
= TMPL_ARGS_LEVEL (args
, i
);
5720 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5722 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5724 if (current
== decl
)
5725 error ("got %d template parameters for %q#D",
5726 TREE_VEC_LENGTH (a
), decl
);
5728 error ("got %d template parameters for %q#T",
5729 TREE_VEC_LENGTH (a
), current
);
5730 error (" but %d required", TREE_VEC_LENGTH (t
));
5731 /* Avoid crash in import_export_decl. */
5732 DECL_INTERFACE_KNOWN (decl
) = 1;
5733 return error_mark_node
;
5736 if (current
== decl
)
5738 else if (current
== NULL_TREE
)
5739 /* Can happen in erroneous input. */
5742 current
= get_containing_scope (current
);
5745 /* Check that the parms are used in the appropriate qualifying scopes
5746 in the declarator. */
5747 if (!comp_template_args
5749 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5751 error ("template arguments to %qD do not match original "
5752 "template %qD", decl
, DECL_TEMPLATE_RESULT (tmpl
));
5753 if (!uses_template_parms (TI_ARGS (tinfo
)))
5754 inform (input_location
, "use %<template<>%> for"
5755 " an explicit specialization");
5756 /* Avoid crash in import_export_decl. */
5757 DECL_INTERFACE_KNOWN (decl
) = 1;
5758 return error_mark_node
;
5762 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5763 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5765 /* Push template declarations for global functions and types. Note
5766 that we do not try to push a global template friend declared in a
5767 template class; such a thing may well depend on the template
5768 parameters of the class. */
5769 if (new_template_p
&& !ctx
5770 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5772 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5773 if (tmpl
== error_mark_node
)
5774 return error_mark_node
;
5776 /* Hide template friend classes that haven't been declared yet. */
5777 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5779 DECL_ANTICIPATED (tmpl
) = 1;
5780 DECL_FRIEND_P (tmpl
) = 1;
5786 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5788 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5790 /* Give template template parms a DECL_CONTEXT of the template
5791 for which they are a parameter. */
5792 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5793 for (int i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5795 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5796 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5797 DECL_CONTEXT (parm
) = tmpl
;
5800 if (TREE_CODE (decl
) == TYPE_DECL
5801 && TYPE_DECL_ALIAS_P (decl
)
5802 && complex_alias_template_p (tmpl
))
5803 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5806 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5807 back to its most general template. If TMPL is a specialization,
5808 ARGS may only have the innermost set of arguments. Add the missing
5809 argument levels if necessary. */
5810 if (DECL_TEMPLATE_INFO (tmpl
))
5811 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5813 info
= build_template_info (tmpl
, args
);
5815 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5816 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5820 retrofit_lang_decl (decl
);
5821 if (DECL_LANG_SPECIFIC (decl
))
5822 DECL_TEMPLATE_INFO (decl
) = info
;
5825 if (flag_implicit_templates
5827 && TREE_PUBLIC (decl
)
5828 && VAR_OR_FUNCTION_DECL_P (decl
))
5829 /* Set DECL_COMDAT on template instantiations; if we force
5830 them to be emitted by explicit instantiation or -frepo,
5831 mark_needed will tell cgraph to do the right thing. */
5832 DECL_COMDAT (decl
) = true;
5834 return DECL_TEMPLATE_RESULT (tmpl
);
5838 push_template_decl (tree decl
)
5840 return push_template_decl_real (decl
, false);
5843 /* FN is an inheriting constructor that inherits from the constructor
5844 template INHERITED; turn FN into a constructor template with a matching
5848 add_inherited_template_parms (tree fn
, tree inherited
)
5851 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5852 inner_parms
= copy_node (inner_parms
);
5854 = tree_cons (size_int (processing_template_decl
+ 1),
5855 inner_parms
, current_template_parms
);
5856 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5857 tree args
= template_parms_to_args (parms
);
5858 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5859 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5860 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5861 DECL_ARTIFICIAL (tmpl
) = true;
5862 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5866 /* Called when a class template TYPE is redeclared with the indicated
5867 template PARMS, e.g.:
5869 template <class T> struct S;
5870 template <class T> struct S {}; */
5873 redeclare_class_template (tree type
, tree parms
, tree cons
)
5879 if (!TYPE_TEMPLATE_INFO (type
))
5881 error ("%qT is not a template type", type
);
5885 tmpl
= TYPE_TI_TEMPLATE (type
);
5886 if (!PRIMARY_TEMPLATE_P (tmpl
))
5887 /* The type is nested in some template class. Nothing to worry
5888 about here; there are no new template parameters for the nested
5894 error ("template specifiers not specified in declaration of %qD",
5899 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5900 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5902 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5904 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5905 "redeclared with %d template parameter",
5906 "redeclared with %d template parameters",
5907 TREE_VEC_LENGTH (parms
));
5908 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5909 "previous declaration %qD used %d template parameter",
5910 "previous declaration %qD used %d template parameters",
5911 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5915 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5922 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5923 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5926 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5927 if (error_operand_p (tmpl_parm
))
5930 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5931 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5932 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5934 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5936 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5937 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5938 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5939 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5940 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5941 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5942 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5943 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5944 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5946 error ("template parameter %q+#D", tmpl_parm
);
5947 error ("redeclared here as %q#D", parm
);
5951 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5953 /* We have in [temp.param]:
5955 A template-parameter may not be given default arguments
5956 by two different declarations in the same scope. */
5957 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5958 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5959 "original definition appeared here");
5963 if (parm_default
!= NULL_TREE
)
5964 /* Update the previous template parameters (which are the ones
5965 that will really count) with the new default value. */
5966 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5967 else if (tmpl_default
!= NULL_TREE
)
5968 /* Update the new parameters, too; they'll be used as the
5969 parameters for any members. */
5970 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5972 /* Give each template template parm in this redeclaration a
5973 DECL_CONTEXT of the template for which they are a parameter. */
5974 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5976 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5977 DECL_CONTEXT (parm
) = tmpl
;
5980 if (TREE_CODE (parm
) == TYPE_DECL
)
5981 TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (parm
)) = true;
5984 // Cannot redeclare a class template with a different set of constraints.
5985 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5987 error_at (input_location
, "redeclaration %q#D with different "
5988 "constraints", tmpl
);
5989 inform (DECL_SOURCE_LOCATION (tmpl
),
5990 "original declaration appeared here");
5996 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5997 to be used when the caller has already checked
5998 (processing_template_decl
5999 && !instantiation_dependent_expression_p (expr)
6000 && potential_constant_expression (expr))
6001 and cleared processing_template_decl. */
6004 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
6006 return tsubst_copy_and_build (expr
,
6009 /*in_decl=*/NULL_TREE
,
6010 /*function_p=*/false,
6011 /*integral_constant_expression_p=*/true);
6014 /* Simplify EXPR if it is a non-dependent expression. Returns the
6015 (possibly simplified) expression. */
6018 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
6020 if (expr
== NULL_TREE
)
6023 /* If we're in a template, but EXPR isn't value dependent, simplify
6024 it. We're supposed to treat:
6026 template <typename T> void f(T[1 + 1]);
6027 template <typename T> void f(T[2]);
6029 as two declarations of the same function, for example. */
6030 if (processing_template_decl
6031 && is_nondependent_constant_expression (expr
))
6033 processing_template_decl_sentinel s
;
6034 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6040 instantiate_non_dependent_expr (tree expr
)
6042 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
6045 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
6046 an uninstantiated expression. */
6049 instantiate_non_dependent_or_null (tree expr
)
6051 if (expr
== NULL_TREE
)
6053 if (processing_template_decl
)
6055 if (!is_nondependent_constant_expression (expr
))
6059 processing_template_decl_sentinel s
;
6060 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
6066 /* True iff T is a specialization of a variable template. */
6069 variable_template_specialization_p (tree t
)
6071 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
6073 tree tmpl
= DECL_TI_TEMPLATE (t
);
6074 return variable_template_p (tmpl
);
6077 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
6078 template declaration, or a TYPE_DECL for an alias declaration. */
6081 alias_type_or_template_p (tree t
)
6085 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
6088 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
6089 || DECL_ALIAS_TEMPLATE_P (t
));
6092 /* Return TRUE iff T is a specialization of an alias template. */
6095 alias_template_specialization_p (const_tree t
)
6097 /* It's an alias template specialization if it's an alias and its
6098 TYPE_NAME is a specialization of a primary template. */
6099 if (TYPE_ALIAS_P (t
))
6100 if (tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
))
6101 return PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
));
6106 /* An alias template is complex from a SFINAE perspective if a template-id
6107 using that alias can be ill-formed when the expansion is not, as with
6108 the void_t template. We determine this by checking whether the
6109 expansion for the alias template uses all its template parameters. */
6111 struct uses_all_template_parms_data
6118 uses_all_template_parms_r (tree t
, void *data_
)
6120 struct uses_all_template_parms_data
&data
6121 = *(struct uses_all_template_parms_data
*)data_
;
6122 tree idx
= get_template_parm_index (t
);
6124 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
6125 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
6130 complex_alias_template_p (const_tree tmpl
)
6132 struct uses_all_template_parms_data data
;
6133 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6134 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
6135 data
.level
= TMPL_PARMS_DEPTH (parms
);
6136 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
6137 data
.seen
= XALLOCAVEC (bool, len
);
6138 for (int i
= 0; i
< len
; ++i
)
6139 data
.seen
[i
] = false;
6141 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
6142 for (int i
= 0; i
< len
; ++i
)
6148 /* Return TRUE iff T is a specialization of a complex alias template with
6149 dependent template-arguments. */
6152 dependent_alias_template_spec_p (const_tree t
)
6154 if (!alias_template_specialization_p (t
))
6157 tree tinfo
= TYPE_ALIAS_TEMPLATE_INFO (t
);
6158 if (!TEMPLATE_DECL_COMPLEX_ALIAS_P (TI_TEMPLATE (tinfo
)))
6161 tree args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
));
6162 if (!any_dependent_template_arguments_p (args
))
6168 /* Return the number of innermost template parameters in TMPL. */
6171 num_innermost_template_parms (tree tmpl
)
6173 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
6174 return TREE_VEC_LENGTH (parms
);
6177 /* Return either TMPL or another template that it is equivalent to under DR
6178 1286: An alias that just changes the name of a template is equivalent to
6179 the other template. */
6182 get_underlying_template (tree tmpl
)
6184 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
6185 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
6187 /* Determine if the alias is equivalent to an underlying template. */
6188 tree orig_type
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
6189 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (orig_type
);
6193 tree underlying
= TI_TEMPLATE (tinfo
);
6194 if (!PRIMARY_TEMPLATE_P (underlying
)
6195 || (num_innermost_template_parms (tmpl
)
6196 != num_innermost_template_parms (underlying
)))
6199 tree alias_args
= INNERMOST_TEMPLATE_ARGS
6200 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
6201 if (!comp_template_args (TI_ARGS (tinfo
), alias_args
))
6204 /* Alias is equivalent. Strip it and repeat. */
6211 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
6212 must be a reference-to-function or a pointer-to-function type, as specified
6213 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
6214 and check that the resulting function has external linkage. */
6217 convert_nontype_argument_function (tree type
, tree expr
,
6218 tsubst_flags_t complain
)
6222 linkage_kind linkage
;
6224 fn
= instantiate_type (type
, fns
, tf_none
);
6225 if (fn
== error_mark_node
)
6226 return error_mark_node
;
6228 if (value_dependent_expression_p (fn
))
6231 fn_no_ptr
= strip_fnptr_conv (fn
);
6232 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
6233 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
6234 if (BASELINK_P (fn_no_ptr
))
6235 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
6237 /* [temp.arg.nontype]/1
6239 A template-argument for a non-type, non-template template-parameter
6242 -- the address of an object or function with external [C++11: or
6243 internal] linkage. */
6245 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
6247 if (complain
& tf_error
)
6249 error ("%qE is not a valid template argument for type %qT",
6251 if (TYPE_PTR_P (type
))
6252 inform (input_location
, "it must be the address of a function "
6253 "with external linkage");
6255 inform (input_location
, "it must be the name of a function with "
6256 "external linkage");
6261 linkage
= decl_linkage (fn_no_ptr
);
6262 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
6264 if (complain
& tf_error
)
6266 if (cxx_dialect
>= cxx11
)
6267 error ("%qE is not a valid template argument for type %qT "
6268 "because %qD has no linkage",
6269 expr
, type
, fn_no_ptr
);
6271 error ("%qE is not a valid template argument for type %qT "
6272 "because %qD does not have external linkage",
6273 expr
, type
, fn_no_ptr
);
6279 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6281 if (REFERENCE_REF_P (fn
))
6282 fn
= TREE_OPERAND (fn
, 0);
6284 fn
= build_address (fn
);
6286 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (fn
)))
6287 fn
= build_nop (type
, fn
);
6292 /* Subroutine of convert_nontype_argument.
6293 Check if EXPR of type TYPE is a valid pointer-to-member constant.
6294 Emit an error otherwise. */
6297 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
6298 tsubst_flags_t complain
)
6300 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6301 tree orig_expr
= expr
;
6303 if (null_ptr_cst_p (expr
))
6305 if (TREE_CODE (expr
) == PTRMEM_CST
6306 && same_type_p (TYPE_PTRMEM_CLASS_TYPE (type
),
6307 PTRMEM_CST_CLASS (expr
)))
6309 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
6311 if (processing_template_decl
6312 && TREE_CODE (expr
) == ADDR_EXPR
6313 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
6315 if (complain
& tf_error
)
6317 error_at (loc
, "%qE is not a valid template argument for type %qT",
6319 if (TREE_CODE (expr
) != PTRMEM_CST
)
6320 inform (loc
, "it must be a pointer-to-member of the form %<&X::Y%>");
6322 inform (loc
, "because it is a member of %qT", PTRMEM_CST_CLASS (expr
));
6327 /* Returns TRUE iff the address of OP is value-dependent.
6329 14.6.2.4 [temp.dep.temp]:
6330 A non-integral non-type template-argument is dependent if its type is
6331 dependent or it has either of the following forms
6334 and contains a nested-name-specifier which specifies a class-name that
6335 names a dependent type.
6337 We generalize this to just say that the address of a member of a
6338 dependent class is value-dependent; the above doesn't cover the
6339 address of a static data member named with an unqualified-id. */
6342 has_value_dependent_address (tree op
)
6344 /* We could use get_inner_reference here, but there's no need;
6345 this is only relevant for template non-type arguments, which
6346 can only be expressed as &id-expression. */
6349 tree ctx
= CP_DECL_CONTEXT (op
);
6350 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
6357 /* The next set of functions are used for providing helpful explanatory
6358 diagnostics for failed overload resolution. Their messages should be
6359 indented by two spaces for consistency with the messages in
6363 unify_success (bool /*explain_p*/)
6368 /* Other failure functions should call this one, to provide a single function
6369 for setting a breakpoint on. */
6372 unify_invalid (bool /*explain_p*/)
6378 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
6381 inform (input_location
,
6382 " couldn't deduce template parameter %qD", parm
);
6383 return unify_invalid (explain_p
);
6387 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
6390 inform (input_location
,
6391 " types %qT and %qT have incompatible cv-qualifiers",
6393 return unify_invalid (explain_p
);
6397 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
6400 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
6401 return unify_invalid (explain_p
);
6405 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6408 inform (input_location
,
6409 " template parameter %qD is not a parameter pack, but "
6412 return unify_invalid (explain_p
);
6416 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6419 inform (input_location
,
6420 " template argument %qE does not match "
6421 "pointer-to-member constant %qE",
6423 return unify_invalid (explain_p
);
6427 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6430 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6431 return unify_invalid (explain_p
);
6435 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6438 inform (input_location
,
6439 " inconsistent parameter pack deduction with %qT and %qT",
6441 return unify_invalid (explain_p
);
6445 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6450 inform (input_location
,
6451 " deduced conflicting types for parameter %qT (%qT and %qT)",
6452 parm
, first
, second
);
6454 inform (input_location
,
6455 " deduced conflicting values for non-type parameter "
6456 "%qE (%qE and %qE)", parm
, first
, second
);
6458 return unify_invalid (explain_p
);
6462 unify_vla_arg (bool explain_p
, tree arg
)
6465 inform (input_location
,
6466 " variable-sized array type %qT is not "
6467 "a valid template argument",
6469 return unify_invalid (explain_p
);
6473 unify_method_type_error (bool explain_p
, tree arg
)
6476 inform (input_location
,
6477 " member function type %qT is not a valid template argument",
6479 return unify_invalid (explain_p
);
6483 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6488 inform_n (input_location
, wanted
,
6489 " candidate expects at least %d argument, %d provided",
6490 " candidate expects at least %d arguments, %d provided",
6493 inform_n (input_location
, wanted
,
6494 " candidate expects %d argument, %d provided",
6495 " candidate expects %d arguments, %d provided",
6498 return unify_invalid (explain_p
);
6502 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6504 return unify_arity (explain_p
, have
, wanted
);
6508 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6509 bool least_p
= false)
6511 return unify_arity (explain_p
, have
, wanted
, least_p
);
6515 unify_arg_conversion (bool explain_p
, tree to_type
,
6516 tree from_type
, tree arg
)
6519 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6520 " cannot convert %qE (type %qT) to type %qT",
6521 arg
, from_type
, to_type
);
6522 return unify_invalid (explain_p
);
6526 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6527 tree parm
, tree arg
)
6532 case tbr_ambiguous_baseclass
:
6533 inform (input_location
, " %qT is an ambiguous base class of %qT",
6537 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6540 return unify_invalid (explain_p
);
6544 unify_inconsistent_template_template_parameters (bool explain_p
)
6547 inform (input_location
,
6548 " template parameters of a template template argument are "
6549 "inconsistent with other deduced template arguments");
6550 return unify_invalid (explain_p
);
6554 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6557 inform (input_location
,
6558 " can't deduce a template for %qT from non-template type %qT",
6560 return unify_invalid (explain_p
);
6564 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6567 inform (input_location
,
6568 " template argument %qE does not match %qE", arg
, parm
);
6569 return unify_invalid (explain_p
);
6572 /* Attempt to convert the non-type template parameter EXPR to the
6573 indicated TYPE. If the conversion is successful, return the
6574 converted value. If the conversion is unsuccessful, return
6575 NULL_TREE if we issued an error message, or error_mark_node if we
6576 did not. We issue error messages for out-and-out bad template
6577 parameters, but not simply because the conversion failed, since we
6578 might be just trying to do argument deduction. Both TYPE and EXPR
6579 must be non-dependent.
6581 The conversion follows the special rules described in
6582 [temp.arg.nontype], and it is much more strict than an implicit
6585 This function is called twice for each template argument (see
6586 lookup_template_class for a more accurate description of this
6587 problem). This means that we need to handle expressions which
6588 are not valid in a C++ source, but can be created from the
6589 first call (for instance, casts to perform conversions). These
6590 hacks can go away after we fix the double coercion problem. */
6593 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6596 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6597 tree orig_expr
= expr
;
6599 /* Detect immediately string literals as invalid non-type argument.
6600 This special-case is not needed for correctness (we would easily
6601 catch this later), but only to provide better diagnostic for this
6602 common user mistake. As suggested by DR 100, we do not mention
6603 linkage issues in the diagnostic as this is not the point. */
6604 /* FIXME we're making this OK. */
6605 if (TREE_CODE (expr
) == STRING_CST
)
6607 if (complain
& tf_error
)
6608 error ("%qE is not a valid template argument for type %qT "
6609 "because string literals can never be used in this context",
6614 /* Add the ADDR_EXPR now for the benefit of
6615 value_dependent_expression_p. */
6616 if (TYPE_PTROBV_P (type
)
6617 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6619 expr
= decay_conversion (expr
, complain
);
6620 if (expr
== error_mark_node
)
6621 return error_mark_node
;
6624 /* If we are in a template, EXPR may be non-dependent, but still
6625 have a syntactic, rather than semantic, form. For example, EXPR
6626 might be a SCOPE_REF, rather than the VAR_DECL to which the
6627 SCOPE_REF refers. Preserving the qualifying scope is necessary
6628 so that access checking can be performed when the template is
6629 instantiated -- but here we need the resolved form so that we can
6630 convert the argument. */
6631 bool non_dep
= false;
6632 if (TYPE_REF_OBJ_P (type
)
6633 && has_value_dependent_address (expr
))
6634 /* If we want the address and it's value-dependent, don't fold. */;
6635 else if (processing_template_decl
6636 && is_nondependent_constant_expression (expr
))
6638 if (error_operand_p (expr
))
6639 return error_mark_node
;
6640 expr_type
= TREE_TYPE (expr
);
6642 /* If the argument is non-dependent, perform any conversions in
6643 non-dependent context as well. */
6644 processing_template_decl_sentinel
s (non_dep
);
6646 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6648 if (value_dependent_expression_p (expr
))
6649 expr
= canonicalize_expr_argument (expr
, complain
);
6651 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6652 to a non-type argument of "nullptr". */
6653 if (NULLPTR_TYPE_P (expr_type
) && TYPE_PTR_OR_PTRMEM_P (type
))
6654 expr
= fold_simple (convert (type
, expr
));
6656 /* In C++11, integral or enumeration non-type template arguments can be
6657 arbitrary constant expressions. Pointer and pointer to
6658 member arguments can be general constant expressions that evaluate
6659 to a null value, but otherwise still need to be of a specific form. */
6660 if (cxx_dialect
>= cxx11
)
6662 if (TREE_CODE (expr
) == PTRMEM_CST
)
6663 /* A PTRMEM_CST is already constant, and a valid template
6664 argument for a parameter of pointer to member type, we just want
6665 to leave it in that form rather than lower it to a
6667 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
6668 || cxx_dialect
>= cxx17
)
6670 /* C++17: A template-argument for a non-type template-parameter shall
6671 be a converted constant expression (8.20) of the type of the
6672 template-parameter. */
6673 expr
= build_converted_constant_expr (type
, expr
, complain
);
6674 if (expr
== error_mark_node
)
6675 return error_mark_node
;
6676 expr
= maybe_constant_value (expr
);
6677 expr
= convert_from_reference (expr
);
6679 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6681 tree folded
= maybe_constant_value (expr
);
6682 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6683 : null_member_pointer_value_p (folded
))
6688 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6689 expr
= mark_lvalue_use (expr
);
6691 expr
= mark_rvalue_use (expr
);
6693 /* HACK: Due to double coercion, we can get a
6694 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6695 which is the tree that we built on the first call (see
6696 below when coercing to reference to object or to reference to
6697 function). We just strip everything and get to the arg.
6698 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6700 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6702 tree probe_type
, probe
= expr
;
6703 if (REFERENCE_REF_P (probe
))
6704 probe
= TREE_OPERAND (probe
, 0);
6705 probe_type
= TREE_TYPE (probe
);
6706 if (TREE_CODE (probe
) == NOP_EXPR
)
6708 /* ??? Maybe we could use convert_from_reference here, but we
6709 would need to relax its constraints because the NOP_EXPR
6710 could actually change the type to something more cv-qualified,
6711 and this is not folded by convert_from_reference. */
6712 tree addr
= TREE_OPERAND (probe
, 0);
6713 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6714 && TREE_CODE (addr
) == ADDR_EXPR
6715 && TYPE_PTR_P (TREE_TYPE (addr
))
6716 && (same_type_ignoring_top_level_qualifiers_p
6717 (TREE_TYPE (probe_type
),
6718 TREE_TYPE (TREE_TYPE (addr
)))))
6720 expr
= TREE_OPERAND (addr
, 0);
6721 expr_type
= TREE_TYPE (probe_type
);
6726 /* [temp.arg.nontype]/5, bullet 1
6728 For a non-type template-parameter of integral or enumeration type,
6729 integral promotions (_conv.prom_) and integral conversions
6730 (_conv.integral_) are applied. */
6731 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6733 if (cxx_dialect
< cxx11
)
6735 tree t
= build_converted_constant_expr (type
, expr
, complain
);
6736 t
= maybe_constant_value (t
);
6737 if (t
!= error_mark_node
)
6741 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6742 return error_mark_node
;
6744 /* Notice that there are constant expressions like '4 % 0' which
6745 do not fold into integer constants. */
6746 if (TREE_CODE (expr
) != INTEGER_CST
6747 && !value_dependent_expression_p (expr
))
6749 if (complain
& tf_error
)
6751 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6752 if (!require_potential_constant_expression (expr
))
6753 expr
= error_mark_node
;
6755 expr
= cxx_constant_value (expr
);
6756 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6757 inform (loc
, "in template argument for type %qT", type
);
6758 if (expr
== error_mark_node
)
6760 /* else cxx_constant_value complained but gave us
6761 a real constant, so go ahead. */
6762 if (TREE_CODE (expr
) != INTEGER_CST
)
6764 /* Some assemble time constant expressions like
6765 (intptr_t)&&lab1 - (intptr_t)&&lab2 or
6766 4 + (intptr_t)&&var satisfy reduced_constant_expression_p
6767 as we can emit them into .rodata initializers of
6768 variables, yet they can't fold into an INTEGER_CST at
6769 compile time. Refuse them here. */
6770 gcc_checking_assert (reduced_constant_expression_p (expr
));
6771 error_at (loc
, "template argument %qE for type %qT not "
6772 "a constant integer", expr
, type
);
6780 /* Avoid typedef problems. */
6781 if (TREE_TYPE (expr
) != type
)
6782 expr
= fold_convert (type
, expr
);
6784 /* [temp.arg.nontype]/5, bullet 2
6786 For a non-type template-parameter of type pointer to object,
6787 qualification conversions (_conv.qual_) and the array-to-pointer
6788 conversion (_conv.array_) are applied. */
6789 else if (TYPE_PTROBV_P (type
))
6791 tree decayed
= expr
;
6793 /* Look through any NOP_EXPRs around an ADDR_EXPR, whether they come from
6794 decay_conversion or an explicit cast. If it's a problematic cast,
6795 we'll complain about it below. */
6796 if (TREE_CODE (expr
) == NOP_EXPR
)
6800 if (TREE_CODE (probe
) == ADDR_EXPR
6801 && TYPE_PTR_P (TREE_TYPE (probe
)))
6804 expr_type
= TREE_TYPE (expr
);
6808 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6810 A template-argument for a non-type, non-template template-parameter
6811 shall be one of: [...]
6813 -- the name of a non-type template-parameter;
6814 -- the address of an object or function with external linkage, [...]
6815 expressed as "& id-expression" where the & is optional if the name
6816 refers to a function or array, or if the corresponding
6817 template-parameter is a reference.
6819 Here, we do not care about functions, as they are invalid anyway
6820 for a parameter of type pointer-to-object. */
6822 if (value_dependent_expression_p (expr
))
6823 /* Non-type template parameters are OK. */
6825 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6826 /* Null pointer values are OK in C++11. */;
6827 else if (TREE_CODE (expr
) != ADDR_EXPR
)
6831 if (complain
& tf_error
)
6832 error ("%qD is not a valid template argument "
6833 "because %qD is a variable, not the address of "
6834 "a variable", orig_expr
, expr
);
6837 if (POINTER_TYPE_P (expr_type
))
6839 if (complain
& tf_error
)
6840 error ("%qE is not a valid template argument for %qT "
6841 "because it is not the address of a variable",
6845 /* Other values, like integer constants, might be valid
6846 non-type arguments of some other type. */
6847 return error_mark_node
;
6851 tree decl
= TREE_OPERAND (expr
, 0);
6855 if (complain
& tf_error
)
6856 error ("%qE is not a valid template argument of type %qT "
6857 "because %qE is not a variable", orig_expr
, type
, decl
);
6860 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6862 if (complain
& tf_error
)
6863 error ("%qE is not a valid template argument of type %qT "
6864 "because %qD does not have external linkage",
6865 orig_expr
, type
, decl
);
6868 else if ((cxx_dialect
>= cxx11
&& cxx_dialect
< cxx17
)
6869 && decl_linkage (decl
) == lk_none
)
6871 if (complain
& tf_error
)
6872 error ("%qE is not a valid template argument of type %qT "
6873 "because %qD has no linkage", orig_expr
, type
, decl
);
6876 /* C++17: For a non-type template-parameter of reference or pointer
6877 type, the value of the constant expression shall not refer to (or
6878 for a pointer type, shall not be the address of):
6879 * a subobject (4.5),
6880 * a temporary object (15.2),
6881 * a string literal (5.13.5),
6882 * the result of a typeid expression (8.2.8), or
6883 * a predefined __func__ variable (11.4.1). */
6884 else if (DECL_ARTIFICIAL (decl
))
6886 if (complain
& tf_error
)
6887 error ("the address of %qD is not a valid template argument",
6891 else if (!same_type_ignoring_top_level_qualifiers_p
6892 (strip_array_types (TREE_TYPE (type
)),
6893 strip_array_types (TREE_TYPE (decl
))))
6895 if (complain
& tf_error
)
6896 error ("the address of the %qT subobject of %qD is not a "
6897 "valid template argument", TREE_TYPE (type
), decl
);
6900 else if (!TREE_STATIC (decl
) && !DECL_EXTERNAL (decl
))
6902 if (complain
& tf_error
)
6903 error ("the address of %qD is not a valid template argument "
6904 "because it does not have static storage duration",
6912 expr
= perform_qualification_conversions (type
, expr
);
6913 if (expr
== error_mark_node
)
6914 return error_mark_node
;
6916 /* [temp.arg.nontype]/5, bullet 3
6918 For a non-type template-parameter of type reference to object, no
6919 conversions apply. The type referred to by the reference may be more
6920 cv-qualified than the (otherwise identical) type of the
6921 template-argument. The template-parameter is bound directly to the
6922 template-argument, which must be an lvalue. */
6923 else if (TYPE_REF_OBJ_P (type
))
6925 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6927 return error_mark_node
;
6929 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6931 if (complain
& tf_error
)
6932 error ("%qE is not a valid template argument for type %qT "
6933 "because of conflicts in cv-qualification", expr
, type
);
6937 if (!lvalue_p (expr
))
6939 if (complain
& tf_error
)
6940 error ("%qE is not a valid template argument for type %qT "
6941 "because it is not an lvalue", expr
, type
);
6945 /* [temp.arg.nontype]/1
6947 A template-argument for a non-type, non-template template-parameter
6948 shall be one of: [...]
6950 -- the address of an object or function with external linkage. */
6951 if (INDIRECT_REF_P (expr
)
6952 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6954 expr
= TREE_OPERAND (expr
, 0);
6957 if (complain
& tf_error
)
6958 error ("%q#D is not a valid template argument for type %qT "
6959 "because a reference variable does not have a constant "
6960 "address", expr
, type
);
6965 if (TYPE_REF_OBJ_P (TREE_TYPE (expr
))
6966 && value_dependent_expression_p (expr
))
6967 /* OK, dependent reference. We don't want to ask whether a DECL is
6968 itself value-dependent, since what we want here is its address. */;
6973 if (complain
& tf_error
)
6974 error ("%qE is not a valid template argument for type %qT "
6975 "because it is not an object with linkage",
6980 /* DR 1155 allows internal linkage in C++11 and up. */
6981 linkage_kind linkage
= decl_linkage (expr
);
6982 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6984 if (complain
& tf_error
)
6985 error ("%qE is not a valid template argument for type %qT "
6986 "because object %qD does not have linkage",
6991 expr
= build_address (expr
);
6994 if (!same_type_p (type
, TREE_TYPE (expr
)))
6995 expr
= build_nop (type
, expr
);
6997 /* [temp.arg.nontype]/5, bullet 4
6999 For a non-type template-parameter of type pointer to function, only
7000 the function-to-pointer conversion (_conv.func_) is applied. If the
7001 template-argument represents a set of overloaded functions (or a
7002 pointer to such), the matching function is selected from the set
7004 else if (TYPE_PTRFN_P (type
))
7006 /* If the argument is a template-id, we might not have enough
7007 context information to decay the pointer. */
7008 if (!type_unknown_p (expr_type
))
7010 expr
= decay_conversion (expr
, complain
);
7011 if (expr
== error_mark_node
)
7012 return error_mark_node
;
7015 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
7016 /* Null pointer values are OK in C++11. */
7017 return perform_qualification_conversions (type
, expr
);
7019 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7020 if (!expr
|| expr
== error_mark_node
)
7023 /* [temp.arg.nontype]/5, bullet 5
7025 For a non-type template-parameter of type reference to function, no
7026 conversions apply. If the template-argument represents a set of
7027 overloaded functions, the matching function is selected from the set
7029 else if (TYPE_REFFN_P (type
))
7031 if (TREE_CODE (expr
) == ADDR_EXPR
)
7033 if (complain
& tf_error
)
7035 error ("%qE is not a valid template argument for type %qT "
7036 "because it is a pointer", expr
, type
);
7037 inform (input_location
, "try using %qE instead",
7038 TREE_OPERAND (expr
, 0));
7043 expr
= convert_nontype_argument_function (type
, expr
, complain
);
7044 if (!expr
|| expr
== error_mark_node
)
7047 /* [temp.arg.nontype]/5, bullet 6
7049 For a non-type template-parameter of type pointer to member function,
7050 no conversions apply. If the template-argument represents a set of
7051 overloaded member functions, the matching member function is selected
7052 from the set (_over.over_). */
7053 else if (TYPE_PTRMEMFUNC_P (type
))
7055 expr
= instantiate_type (type
, expr
, tf_none
);
7056 if (expr
== error_mark_node
)
7057 return error_mark_node
;
7059 /* [temp.arg.nontype] bullet 1 says the pointer to member
7060 expression must be a pointer-to-member constant. */
7061 if (!value_dependent_expression_p (expr
)
7062 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7065 /* Repeated conversion can't deal with a conversion that turns PTRMEM_CST
7066 into a CONSTRUCTOR, so build up a new PTRMEM_CST instead. */
7067 if (fnptr_conv_p (type
, TREE_TYPE (expr
)))
7068 expr
= make_ptrmem_cst (type
, PTRMEM_CST_MEMBER (expr
));
7070 /* [temp.arg.nontype]/5, bullet 7
7072 For a non-type template-parameter of type pointer to data member,
7073 qualification conversions (_conv.qual_) are applied. */
7074 else if (TYPE_PTRDATAMEM_P (type
))
7076 /* [temp.arg.nontype] bullet 1 says the pointer to member
7077 expression must be a pointer-to-member constant. */
7078 if (!value_dependent_expression_p (expr
)
7079 && !check_valid_ptrmem_cst_expr (type
, expr
, complain
))
7082 expr
= perform_qualification_conversions (type
, expr
);
7083 if (expr
== error_mark_node
)
7086 else if (NULLPTR_TYPE_P (type
))
7088 if (!NULLPTR_TYPE_P (TREE_TYPE (expr
)))
7090 if (complain
& tf_error
)
7091 error ("%qE is not a valid template argument for type %qT "
7092 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
7097 /* A template non-type parameter must be one of the above. */
7101 /* Sanity check: did we actually convert the argument to the
7103 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7104 (type
, TREE_TYPE (expr
)));
7105 return convert_from_reference (expr
);
7108 /* Subroutine of coerce_template_template_parms, which returns 1 if
7109 PARM_PARM and ARG_PARM match using the rule for the template
7110 parameters of template template parameters. Both PARM and ARG are
7111 template parameters; the rest of the arguments are the same as for
7112 coerce_template_template_parms.
7115 coerce_template_template_parm (tree parm
,
7117 tsubst_flags_t complain
,
7121 if (arg
== NULL_TREE
|| error_operand_p (arg
)
7122 || parm
== NULL_TREE
|| error_operand_p (parm
))
7125 if (TREE_CODE (arg
) != TREE_CODE (parm
))
7128 switch (TREE_CODE (parm
))
7131 /* We encounter instantiations of templates like
7132 template <template <template <class> class> class TT>
7135 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7136 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7138 if (!coerce_template_template_parms
7139 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
7145 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
7146 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7147 /* Argument is a parameter pack but parameter is not. */
7152 /* The tsubst call is used to handle cases such as
7154 template <int> class C {};
7155 template <class T, template <T> class TT> class D {};
7158 i.e. the parameter list of TT depends on earlier parameters. */
7159 if (!uses_template_parms (TREE_TYPE (arg
)))
7161 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
7162 if (!uses_template_parms (t
)
7163 && !same_type_p (t
, TREE_TYPE (arg
)))
7167 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
7168 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7169 /* Argument is a parameter pack but parameter is not. */
7181 /* Coerce template argument list ARGLIST for use with template
7182 template-parameter TEMPL. */
7185 coerce_template_args_for_ttp (tree templ
, tree arglist
,
7186 tsubst_flags_t complain
)
7188 /* Consider an example where a template template parameter declared as
7190 template <class T, class U = std::allocator<T> > class TT
7192 The template parameter level of T and U are one level larger than
7193 of TT. To proper process the default argument of U, say when an
7194 instantiation `TT<int>' is seen, we need to build the full
7195 arguments containing {int} as the innermost level. Outer levels,
7196 available when not appearing as default template argument, can be
7197 obtained from the arguments of the enclosing template.
7199 Suppose that TT is later substituted with std::vector. The above
7200 instantiation is `TT<int, std::allocator<T> >' with TT at
7201 level 1, and T at level 2, while the template arguments at level 1
7202 becomes {std::vector} and the inner level 2 is {int}. */
7204 tree outer
= DECL_CONTEXT (templ
);
7207 if (DECL_TEMPLATE_SPECIALIZATION (outer
))
7208 /* We want arguments for the partial specialization, not arguments for
7209 the primary template. */
7210 outer
= template_parms_to_args (DECL_TEMPLATE_PARMS (outer
));
7212 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7214 else if (current_template_parms
)
7216 /* This is an argument of the current template, so we haven't set
7217 DECL_CONTEXT yet. */
7218 tree relevant_template_parms
;
7220 /* Parameter levels that are greater than the level of the given
7221 template template parm are irrelevant. */
7222 relevant_template_parms
= current_template_parms
;
7223 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
7224 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
7225 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
7227 outer
= template_parms_to_args (relevant_template_parms
);
7231 arglist
= add_to_template_args (outer
, arglist
);
7233 tree parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7234 return coerce_template_parms (parmlist
, arglist
, templ
,
7236 /*require_all_args=*/true,
7237 /*use_default_args=*/true);
7240 /* A cache of template template parameters with match-all default
7242 static GTY((deletable
)) hash_map
<tree
,tree
> *defaulted_ttp_cache
;
7244 store_defaulted_ttp (tree v
, tree t
)
7246 if (!defaulted_ttp_cache
)
7247 defaulted_ttp_cache
= hash_map
<tree
,tree
>::create_ggc (13);
7248 defaulted_ttp_cache
->put (v
, t
);
7251 lookup_defaulted_ttp (tree v
)
7253 if (defaulted_ttp_cache
)
7254 if (tree
*p
= defaulted_ttp_cache
->get (v
))
7259 /* T is a bound template template-parameter. Copy its arguments into default
7260 arguments of the template template-parameter's template parameters. */
7263 add_defaults_to_ttp (tree otmpl
)
7265 if (tree c
= lookup_defaulted_ttp (otmpl
))
7268 tree ntmpl
= copy_node (otmpl
);
7270 tree ntype
= copy_node (TREE_TYPE (otmpl
));
7271 TYPE_STUB_DECL (ntype
) = TYPE_NAME (ntype
) = ntmpl
;
7272 TYPE_MAIN_VARIANT (ntype
) = ntype
;
7273 TYPE_POINTER_TO (ntype
) = TYPE_REFERENCE_TO (ntype
) = NULL_TREE
;
7274 TYPE_NAME (ntype
) = ntmpl
;
7275 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
7277 tree idx
= TEMPLATE_TYPE_PARM_INDEX (ntype
)
7278 = copy_node (TEMPLATE_TYPE_PARM_INDEX (ntype
));
7279 TEMPLATE_PARM_DECL (idx
) = ntmpl
;
7280 TREE_TYPE (ntmpl
) = TREE_TYPE (idx
) = ntype
;
7282 tree oparms
= DECL_TEMPLATE_PARMS (otmpl
);
7283 tree parms
= DECL_TEMPLATE_PARMS (ntmpl
) = copy_node (oparms
);
7284 TREE_CHAIN (parms
) = TREE_CHAIN (oparms
);
7285 tree vec
= TREE_VALUE (parms
) = copy_node (TREE_VALUE (parms
));
7286 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
7288 tree o
= TREE_VEC_ELT (vec
, i
);
7289 if (!template_parameter_pack_p (TREE_VALUE (o
)))
7291 tree n
= TREE_VEC_ELT (vec
, i
) = copy_node (o
);
7292 TREE_PURPOSE (n
) = any_targ_node
;
7296 store_defaulted_ttp (otmpl
, ntmpl
);
7300 /* ARG is a bound potential template template-argument, and PARGS is a list
7301 of arguments for the corresponding template template-parameter. Adjust
7302 PARGS as appropriate for application to ARG's template, and if ARG is a
7303 BOUND_TEMPLATE_TEMPLATE_PARM, possibly adjust it to add default template
7304 arguments to the template template parameter. */
7307 coerce_ttp_args_for_tta (tree
& arg
, tree pargs
, tsubst_flags_t complain
)
7309 ++processing_template_decl
;
7310 tree arg_tmpl
= TYPE_TI_TEMPLATE (arg
);
7311 if (DECL_TEMPLATE_TEMPLATE_PARM_P (arg_tmpl
))
7313 /* When comparing two template template-parameters in partial ordering,
7314 rewrite the one currently being used as an argument to have default
7315 arguments for all parameters. */
7316 arg_tmpl
= add_defaults_to_ttp (arg_tmpl
);
7317 pargs
= coerce_template_args_for_ttp (arg_tmpl
, pargs
, complain
);
7318 if (pargs
!= error_mark_node
)
7319 arg
= bind_template_template_parm (TREE_TYPE (arg_tmpl
),
7320 TYPE_TI_ARGS (arg
));
7325 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (arg_tmpl
));
7326 pargs
= coerce_template_parms (aparms
, pargs
, arg_tmpl
, complain
,
7327 /*require_all*/true,
7328 /*use_default*/true);
7330 --processing_template_decl
;
7334 /* Subroutine of unify for the case when PARM is a
7335 BOUND_TEMPLATE_TEMPLATE_PARM. */
7338 unify_bound_ttp_args (tree tparms
, tree targs
, tree parm
, tree
& arg
,
7341 tree parmvec
= TYPE_TI_ARGS (parm
);
7342 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
7344 /* The template template parm might be variadic and the argument
7345 not, so flatten both argument lists. */
7346 parmvec
= expand_template_argument_pack (parmvec
);
7347 argvec
= expand_template_argument_pack (argvec
);
7351 /* In keeping with P0522R0, adjust P's template arguments
7352 to apply to A's template; then flatten it again. */
7353 tree nparmvec
= parmvec
;
7354 nparmvec
= coerce_ttp_args_for_tta (arg
, parmvec
, tf_none
);
7355 nparmvec
= expand_template_argument_pack (nparmvec
);
7357 if (unify (tparms
, targs
, nparmvec
, argvec
,
7358 UNIFY_ALLOW_NONE
, explain_p
))
7361 /* If the P0522 adjustment eliminated a pack expansion, deduce
7364 && TREE_VEC_LENGTH (nparmvec
) < TREE_VEC_LENGTH (parmvec
)
7365 && unify_pack_expansion (tparms
, targs
, parmvec
, argvec
,
7366 DEDUCE_EXACT
, /*sub*/true, explain_p
))
7371 /* Deduce arguments T, i from TT<T> or TT<i>.
7372 We check each element of PARMVEC and ARGVEC individually
7373 rather than the whole TREE_VEC since they can have
7374 different number of elements, which is allowed under N2555. */
7376 int len
= TREE_VEC_LENGTH (parmvec
);
7378 /* Check if the parameters end in a pack, making them
7380 int parm_variadic_p
= 0;
7382 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
7383 parm_variadic_p
= 1;
7385 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7386 /* If the template argument list of P contains a pack
7387 expansion that is not the last template argument, the
7388 entire template argument list is a non-deduced
7390 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
7391 return unify_success (explain_p
);
7393 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
7394 return unify_too_few_arguments (explain_p
,
7395 TREE_VEC_LENGTH (argvec
), len
);
7397 for (int i
= 0; i
< len
- parm_variadic_p
; ++i
)
7398 if (unify (tparms
, targs
,
7399 TREE_VEC_ELT (parmvec
, i
),
7400 TREE_VEC_ELT (argvec
, i
),
7401 UNIFY_ALLOW_NONE
, explain_p
))
7405 && unify_pack_expansion (tparms
, targs
,
7408 /*subr=*/true, explain_p
))
7415 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
7416 template template parameters. Both PARM_PARMS and ARG_PARMS are
7417 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
7420 Consider the example:
7421 template <class T> class A;
7422 template<template <class U> class TT> class B;
7424 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
7425 the parameters to A, and OUTER_ARGS contains A. */
7428 coerce_template_template_parms (tree parm_parms
,
7430 tsubst_flags_t complain
,
7434 int nparms
, nargs
, i
;
7438 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
7439 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
7441 nparms
= TREE_VEC_LENGTH (parm_parms
);
7442 nargs
= TREE_VEC_LENGTH (arg_parms
);
7446 /* P0522R0: A template template-parameter P is at least as specialized as
7447 a template template-argument A if, given the following rewrite to two
7448 function templates, the function template corresponding to P is at
7449 least as specialized as the function template corresponding to A
7450 according to the partial ordering rules for function templates
7451 ([temp.func.order]). Given an invented class template X with the
7452 template parameter list of A (including default arguments):
7454 * Each of the two function templates has the same template parameters,
7455 respectively, as P or A.
7457 * Each function template has a single function parameter whose type is
7458 a specialization of X with template arguments corresponding to the
7459 template parameters from the respective function template where, for
7460 each template parameter PP in the template parameter list of the
7461 function template, a corresponding template argument AA is formed. If
7462 PP declares a parameter pack, then AA is the pack expansion
7463 PP... ([temp.variadic]); otherwise, AA is the id-expression PP.
7465 If the rewrite produces an invalid type, then P is not at least as
7466 specialized as A. */
7468 /* So coerce P's args to apply to A's parms, and then deduce between A's
7469 args and the converted args. If that succeeds, A is at least as
7470 specialized as P, so they match.*/
7471 tree pargs
= template_parms_level_to_args (parm_parms
);
7472 ++processing_template_decl
;
7473 pargs
= coerce_template_parms (arg_parms
, pargs
, NULL_TREE
, tf_none
,
7474 /*require_all*/true, /*use_default*/true);
7475 --processing_template_decl
;
7476 if (pargs
!= error_mark_node
)
7478 tree targs
= make_tree_vec (nargs
);
7479 tree aargs
= template_parms_level_to_args (arg_parms
);
7480 if (!unify (arg_parms
, targs
, aargs
, pargs
, UNIFY_ALLOW_NONE
,
7486 /* Determine whether we have a parameter pack at the end of the
7487 template template parameter's template parameter list. */
7488 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
7490 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
7492 if (error_operand_p (parm
))
7495 switch (TREE_CODE (parm
))
7499 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
7504 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
7514 && !(variadic_p
&& nargs
>= nparms
- 1))
7517 /* Check all of the template parameters except the parameter pack at
7518 the end (if any). */
7519 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
7521 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
7522 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7525 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7526 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7528 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7536 /* Check each of the template parameters in the template
7537 argument against the template parameter pack at the end of
7538 the template template parameter. */
7539 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
7542 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
7544 for (; i
< nargs
; ++i
)
7546 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
7549 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
7551 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
7560 /* Verifies that the deduced template arguments (in TARGS) for the
7561 template template parameters (in TPARMS) represent valid bindings,
7562 by comparing the template parameter list of each template argument
7563 to the template parameter list of its corresponding template
7564 template parameter, in accordance with DR150. This
7565 routine can only be called after all template arguments have been
7566 deduced. It will return TRUE if all of the template template
7567 parameter bindings are okay, FALSE otherwise. */
7569 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
7571 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
7574 /* We're dealing with template parms in this process. */
7575 ++processing_template_decl
;
7577 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
7579 for (i
= 0; i
< ntparms
; ++i
)
7581 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
7582 tree targ
= TREE_VEC_ELT (targs
, i
);
7584 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
7586 tree packed_args
= NULL_TREE
;
7589 if (ARGUMENT_PACK_P (targ
))
7591 /* Look inside the argument pack. */
7592 packed_args
= ARGUMENT_PACK_ARGS (targ
);
7593 len
= TREE_VEC_LENGTH (packed_args
);
7596 for (idx
= 0; idx
< len
; ++idx
)
7598 tree targ_parms
= NULL_TREE
;
7601 /* Extract the next argument from the argument
7603 targ
= TREE_VEC_ELT (packed_args
, idx
);
7605 if (PACK_EXPANSION_P (targ
))
7606 /* Look at the pattern of the pack expansion. */
7607 targ
= PACK_EXPANSION_PATTERN (targ
);
7609 /* Extract the template parameters from the template
7611 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
7612 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
7613 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
7614 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
7616 /* Verify that we can coerce the template template
7617 parameters from the template argument to the template
7618 parameter. This requires an exact match. */
7620 && !coerce_template_template_parms
7621 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
7636 --processing_template_decl
;
7640 /* Since type attributes aren't mangled, we need to strip them from
7641 template type arguments. */
7644 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
7646 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
7648 bool removed_attributes
= false;
7649 tree canon
= strip_typedefs (arg
, &removed_attributes
);
7650 if (removed_attributes
7651 && (complain
& tf_warning
))
7652 warning (OPT_Wignored_attributes
,
7653 "ignoring attributes on template argument %qT", arg
);
7657 /* And from inside dependent non-type arguments like sizeof(Type). */
7660 canonicalize_expr_argument (tree arg
, tsubst_flags_t complain
)
7662 if (!arg
|| arg
== error_mark_node
)
7664 bool removed_attributes
= false;
7665 tree canon
= strip_typedefs_expr (arg
, &removed_attributes
);
7666 if (removed_attributes
7667 && (complain
& tf_warning
))
7668 warning (OPT_Wignored_attributes
,
7669 "ignoring attributes in template argument %qE", arg
);
7673 // A template declaration can be substituted for a constrained
7674 // template template parameter only when the argument is more
7675 // constrained than the parameter.
7677 is_compatible_template_arg (tree parm
, tree arg
)
7679 tree parm_cons
= get_constraints (parm
);
7681 /* For now, allow constrained template template arguments
7682 and unconstrained template template parameters. */
7683 if (parm_cons
== NULL_TREE
)
7686 tree arg_cons
= get_constraints (arg
);
7688 // If the template parameter is constrained, we need to rewrite its
7689 // constraints in terms of the ARG's template parameters. This ensures
7690 // that all of the template parameter types will have the same depth.
7692 // Note that this is only valid when coerce_template_template_parm is
7693 // true for the innermost template parameters of PARM and ARG. In other
7694 // words, because coercion is successful, this conversion will be valid.
7697 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
7698 parm_cons
= tsubst_constraint_info (parm_cons
,
7699 INNERMOST_TEMPLATE_ARGS (args
),
7700 tf_none
, NULL_TREE
);
7701 if (parm_cons
== error_mark_node
)
7705 return subsumes (parm_cons
, arg_cons
);
7708 // Convert a placeholder argument into a binding to the original
7709 // parameter. The original parameter is saved as the TREE_TYPE of
7712 convert_wildcard_argument (tree parm
, tree arg
)
7714 TREE_TYPE (arg
) = parm
;
7718 /* We can't fully resolve ARG given as a non-type template argument to TYPE,
7719 because one of them is dependent. But we need to represent the
7720 conversion for the benefit of cp_tree_equal. */
7723 maybe_convert_nontype_argument (tree type
, tree arg
)
7725 /* Auto parms get no conversion. */
7726 if (type_uses_auto (type
))
7728 /* We don't need or want to add this conversion now if we're going to use the
7729 argument for deduction. */
7730 if (value_dependent_expression_p (arg
))
7733 type
= cv_unqualified (type
);
7734 tree argtype
= TREE_TYPE (arg
);
7735 if (same_type_p (type
, argtype
))
7738 arg
= build1 (IMPLICIT_CONV_EXPR
, type
, arg
);
7739 IMPLICIT_CONV_EXPR_NONTYPE_ARG (arg
) = true;
7743 /* Convert the indicated template ARG as necessary to match the
7744 indicated template PARM. Returns the converted ARG, or
7745 error_mark_node if the conversion was unsuccessful. Error and
7746 warning messages are issued under control of COMPLAIN. This
7747 conversion is for the Ith parameter in the parameter list. ARGS is
7748 the full set of template arguments deduced so far. */
7751 convert_template_argument (tree parm
,
7754 tsubst_flags_t complain
,
7760 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
7762 if (parm
== error_mark_node
)
7763 return error_mark_node
;
7765 /* Trivially convert placeholders. */
7766 if (TREE_CODE (arg
) == WILDCARD_DECL
)
7767 return convert_wildcard_argument (parm
, arg
);
7769 if (arg
== any_targ_node
)
7772 if (TREE_CODE (arg
) == TREE_LIST
7773 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7775 /* The template argument was the name of some
7776 member function. That's usually
7777 invalid, but static members are OK. In any
7778 case, grab the underlying fields/functions
7779 and issue an error later if required. */
7780 orig_arg
= TREE_VALUE (arg
);
7781 TREE_TYPE (arg
) = unknown_type_node
;
7786 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7787 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7788 || requires_tmpl_type
);
7790 /* When determining whether an argument pack expansion is a template,
7791 look at the pattern. */
7792 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7793 arg
= PACK_EXPANSION_PATTERN (arg
);
7795 /* Deal with an injected-class-name used as a template template arg. */
7796 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7798 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7799 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7801 if (cxx_dialect
>= cxx11
)
7802 /* OK under DR 1004. */;
7803 else if (complain
& tf_warning_or_error
)
7804 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7805 " used as template template argument", TYPE_NAME (arg
));
7806 else if (flag_pedantic_errors
)
7814 ((TREE_CODE (arg
) == TEMPLATE_DECL
7815 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7816 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7817 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7818 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7821 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7822 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7823 arg
= TYPE_STUB_DECL (arg
);
7825 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7827 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7828 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7830 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7832 if (complain
& tf_error
)
7833 error ("invalid use of destructor %qE as a type", orig_arg
);
7834 return error_mark_node
;
7837 permerror (input_location
,
7838 "to refer to a type member of a template parameter, "
7839 "use %<typename %E%>", orig_arg
);
7841 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7842 TREE_OPERAND (arg
, 1),
7848 if (is_type
!= requires_type
)
7852 if (complain
& tf_error
)
7854 error ("type/value mismatch at argument %d in template "
7855 "parameter list for %qD",
7858 inform (input_location
,
7859 " expected a constant of type %qT, got %qT",
7861 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7862 else if (requires_tmpl_type
)
7863 inform (input_location
,
7864 " expected a class template, got %qE", orig_arg
);
7866 inform (input_location
,
7867 " expected a type, got %qE", orig_arg
);
7870 return error_mark_node
;
7872 if (is_tmpl_type
^ requires_tmpl_type
)
7874 if (in_decl
&& (complain
& tf_error
))
7876 error ("type/value mismatch at argument %d in template "
7877 "parameter list for %qD",
7880 inform (input_location
,
7881 " expected a type, got %qT", DECL_NAME (arg
));
7883 inform (input_location
,
7884 " expected a class template, got %qT", orig_arg
);
7886 return error_mark_node
;
7889 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7890 /* We already did the appropriate conversion when packing args. */
7894 if (requires_tmpl_type
)
7896 if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7897 /* The number of argument required is not known yet.
7898 Just accept it for now. */
7902 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7905 /* Strip alias templates that are equivalent to another
7907 arg
= get_underlying_template (arg
);
7908 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7910 if (coerce_template_template_parms (parmparm
, argparm
,
7916 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7918 if (val
!= error_mark_node
)
7920 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7921 val
= TREE_TYPE (val
);
7922 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7923 val
= make_pack_expansion (val
, complain
);
7928 if (in_decl
&& (complain
& tf_error
))
7930 error ("type/value mismatch at argument %d in "
7931 "template parameter list for %qD",
7933 inform (input_location
,
7934 " expected a template of type %qD, got %qT",
7938 val
= error_mark_node
;
7941 // Check that the constraints are compatible before allowing the
7943 if (val
!= error_mark_node
)
7944 if (!is_compatible_template_arg (parm
, arg
))
7946 if (in_decl
&& (complain
& tf_error
))
7948 error ("constraint mismatch at argument %d in "
7949 "template parameter list for %qD",
7951 inform (input_location
, " expected %qD but got %qD",
7954 val
= error_mark_node
;
7960 /* We only form one instance of each template specialization.
7961 Therefore, if we use a non-canonical variant (i.e., a
7962 typedef), any future messages referring to the type will use
7963 the typedef, which is confusing if those future uses do not
7964 themselves also use the typedef. */
7966 val
= canonicalize_type_argument (val
, complain
);
7970 tree t
= TREE_TYPE (parm
);
7972 if (TEMPLATE_PARM_LEVEL (get_template_parm_index (parm
))
7973 > TMPL_ARGS_DEPTH (args
))
7974 /* We don't have enough levels of args to do any substitution. This
7975 can happen in the context of -fnew-ttp-matching. */;
7976 else if (tree a
= type_uses_auto (t
))
7978 t
= do_auto_deduction (t
, arg
, a
, complain
, adc_unify
, args
);
7979 if (t
== error_mark_node
)
7980 return error_mark_node
;
7983 t
= tsubst (t
, args
, complain
, in_decl
);
7985 if (invalid_nontype_parm_type_p (t
, complain
))
7986 return error_mark_node
;
7988 if (!type_dependent_expression_p (orig_arg
)
7989 && !uses_template_parms (t
))
7990 /* We used to call digest_init here. However, digest_init
7991 will report errors, which we don't want when complain
7992 is zero. More importantly, digest_init will try too
7993 hard to convert things: for example, `0' should not be
7994 converted to pointer type at this point according to
7995 the standard. Accepting this is not merely an
7996 extension, since deciding whether or not these
7997 conversions can occur is part of determining which
7998 function template to call, or whether a given explicit
7999 argument specification is valid. */
8000 val
= convert_nontype_argument (t
, orig_arg
, complain
);
8003 val
= canonicalize_expr_argument (orig_arg
, complain
);
8004 val
= maybe_convert_nontype_argument (t
, val
);
8008 if (val
== NULL_TREE
)
8009 val
= error_mark_node
;
8010 else if (val
== error_mark_node
&& (complain
& tf_error
))
8011 error ("could not convert template argument %qE from %qT to %qT",
8012 orig_arg
, TREE_TYPE (orig_arg
), t
);
8014 if (INDIRECT_REF_P (val
))
8016 /* Reject template arguments that are references to built-in
8017 functions with no library fallbacks. */
8018 const_tree inner
= TREE_OPERAND (val
, 0);
8019 const_tree innertype
= TREE_TYPE (inner
);
8021 && TREE_CODE (innertype
) == REFERENCE_TYPE
8022 && TREE_CODE (TREE_TYPE (innertype
)) == FUNCTION_TYPE
8023 && TREE_OPERAND_LENGTH (inner
) > 0
8024 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
8025 return error_mark_node
;
8028 if (TREE_CODE (val
) == SCOPE_REF
)
8030 /* Strip typedefs from the SCOPE_REF. */
8031 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
8032 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
8034 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
8035 QUALIFIED_NAME_IS_TEMPLATE (val
));
8042 /* Coerces the remaining template arguments in INNER_ARGS (from
8043 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
8044 Returns the coerced argument pack. PARM_IDX is the position of this
8045 parameter in the template parameter list. ARGS is the original
8046 template argument list. */
8048 coerce_template_parameter_pack (tree parms
,
8056 tsubst_flags_t complain
)
8058 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8059 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8062 tree packed_parms
= NULL_TREE
;
8064 if (arg_idx
> nargs
)
8067 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
8069 /* When the template parameter is a non-type template parameter pack
8070 or template template parameter pack whose type or template
8071 parameters use parameter packs, we know exactly how many arguments
8072 we are looking for. Build a vector of the instantiated decls for
8073 these template parameters in PACKED_PARMS. */
8074 /* We can't use make_pack_expansion here because it would interpret a
8075 _DECL as a use rather than a declaration. */
8076 tree decl
= TREE_VALUE (parm
);
8077 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
8078 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
8079 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
8080 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
8082 TREE_VEC_LENGTH (args
)--;
8083 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
8084 TREE_VEC_LENGTH (args
)++;
8086 if (packed_parms
== error_mark_node
)
8087 return error_mark_node
;
8089 /* If we're doing a partial instantiation of a member template,
8090 verify that all of the types used for the non-type
8091 template parameter pack are, in fact, valid for non-type
8092 template parameters. */
8094 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8096 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
8097 for (j
= 0; j
< len
; ++j
)
8099 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
8100 if (invalid_nontype_parm_type_p (t
, complain
))
8101 return error_mark_node
;
8103 /* We don't know how many args we have yet, just
8104 use the unconverted ones for now. */
8108 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
8110 /* Check if we have a placeholder pack, which indicates we're
8111 in the context of a introduction list. In that case we want
8112 to match this pack to the single placeholder. */
8113 else if (arg_idx
< nargs
8114 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
8115 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
8117 nargs
= arg_idx
+ 1;
8118 packed_args
= make_tree_vec (1);
8121 packed_args
= make_tree_vec (nargs
- arg_idx
);
8123 /* Convert the remaining arguments, which will be a part of the
8124 parameter pack "parm". */
8125 int first_pack_arg
= arg_idx
;
8126 for (; arg_idx
< nargs
; ++arg_idx
)
8128 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8129 tree actual_parm
= TREE_VALUE (parm
);
8130 int pack_idx
= arg_idx
- first_pack_arg
;
8134 /* Once we've packed as many args as we have types, stop. */
8135 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
8137 else if (PACK_EXPANSION_P (arg
))
8138 /* We don't know how many args we have yet, just
8139 use the unconverted ones for now. */
8142 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
8145 if (arg
== error_mark_node
)
8147 if (complain
& tf_error
)
8148 error ("template argument %d is invalid", arg_idx
+ 1);
8151 arg
= convert_template_argument (actual_parm
,
8152 arg
, new_args
, complain
, parm_idx
,
8154 if (arg
== error_mark_node
)
8156 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
8159 if (arg_idx
- first_pack_arg
< TREE_VEC_LENGTH (packed_args
)
8160 && TREE_VEC_LENGTH (packed_args
) > 0)
8162 if (complain
& tf_error
)
8163 error ("wrong number of template arguments (%d, should be %d)",
8164 arg_idx
- first_pack_arg
, TREE_VEC_LENGTH (packed_args
));
8165 return error_mark_node
;
8168 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
8169 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
8170 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
8173 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
8174 TREE_CONSTANT (argument_pack
) = 1;
8177 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
8179 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
8180 TREE_VEC_LENGTH (packed_args
));
8181 return argument_pack
;
8184 /* Returns the number of pack expansions in the template argument vector
8188 pack_expansion_args_count (tree args
)
8193 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
8195 tree elt
= TREE_VEC_ELT (args
, i
);
8196 if (elt
&& PACK_EXPANSION_P (elt
))
8202 /* Convert all template arguments to their appropriate types, and
8203 return a vector containing the innermost resulting template
8204 arguments. If any error occurs, return error_mark_node. Error and
8205 warning messages are issued under control of COMPLAIN.
8207 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
8208 for arguments not specified in ARGS. Otherwise, if
8209 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
8210 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
8211 USE_DEFAULT_ARGS is false, then all arguments must be specified in
8215 coerce_template_parms (tree parms
,
8218 tsubst_flags_t complain
,
8219 bool require_all_args
,
8220 bool use_default_args
)
8222 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
8223 tree orig_inner_args
;
8226 tree new_inner_args
;
8227 int saved_unevaluated_operand
;
8228 int saved_inhibit_evaluation_warnings
;
8230 /* When used as a boolean value, indicates whether this is a
8231 variadic template parameter list. Since it's an int, we can also
8232 subtract it from nparms to get the number of non-variadic
8235 int variadic_args_p
= 0;
8236 int post_variadic_parms
= 0;
8238 /* Adjustment to nparms for fixed parameter packs. */
8239 int fixed_pack_adjust
= 0;
8240 int fixed_packs
= 0;
8243 /* Likewise for parameters with default arguments. */
8246 if (args
== error_mark_node
)
8247 return error_mark_node
;
8249 nparms
= TREE_VEC_LENGTH (parms
);
8251 /* Determine if there are any parameter packs or default arguments. */
8252 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
8254 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8256 ++post_variadic_parms
;
8257 if (template_parameter_pack_p (TREE_VALUE (parm
)))
8259 if (TREE_PURPOSE (parm
))
8263 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
8264 /* If there are no parameters that follow a parameter pack, we need to
8265 expand any argument packs so that we can deduce a parameter pack from
8266 some non-packed args followed by an argument pack, as in variadic85.C.
8267 If there are such parameters, we need to leave argument packs intact
8268 so the arguments are assigned properly. This can happen when dealing
8269 with a nested class inside a partial specialization of a class
8270 template, as in variadic92.C, or when deducing a template parameter pack
8271 from a sub-declarator, as in variadic114.C. */
8272 if (!post_variadic_parms
)
8273 inner_args
= expand_template_argument_pack (inner_args
);
8275 /* Count any pack expansion args. */
8276 variadic_args_p
= pack_expansion_args_count (inner_args
);
8278 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8279 if ((nargs
- variadic_args_p
> nparms
&& !variadic_p
)
8280 || (nargs
< nparms
- variadic_p
8283 && (!use_default_args
8284 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
8285 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
8288 if (complain
& tf_error
)
8290 if (variadic_p
|| default_p
)
8292 nparms
-= variadic_p
+ default_p
;
8293 error ("wrong number of template arguments "
8294 "(%d, should be at least %d)", nargs
, nparms
);
8297 error ("wrong number of template arguments "
8298 "(%d, should be %d)", nargs
, nparms
);
8301 inform (DECL_SOURCE_LOCATION (in_decl
),
8302 "provided for %qD", in_decl
);
8305 return error_mark_node
;
8307 /* We can't pass a pack expansion to a non-pack parameter of an alias
8308 template (DR 1430). */
8310 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
8311 || concept_template_p (in_decl
))
8313 && nargs
- variadic_args_p
< nparms
- variadic_p
)
8315 if (complain
& tf_error
)
8317 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
8319 tree arg
= TREE_VEC_ELT (inner_args
, i
);
8320 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
8322 if (PACK_EXPANSION_P (arg
)
8323 && !template_parameter_pack_p (parm
))
8325 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
8326 error_at (location_of (arg
),
8327 "pack expansion argument for non-pack parameter "
8328 "%qD of alias template %qD", parm
, in_decl
);
8330 error_at (location_of (arg
),
8331 "pack expansion argument for non-pack parameter "
8332 "%qD of concept %qD", parm
, in_decl
);
8333 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
8340 return error_mark_node
;
8343 /* We need to evaluate the template arguments, even though this
8344 template-id may be nested within a "sizeof". */
8345 saved_unevaluated_operand
= cp_unevaluated_operand
;
8346 cp_unevaluated_operand
= 0;
8347 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
8348 c_inhibit_evaluation_warnings
= 0;
8349 new_inner_args
= make_tree_vec (nparms
);
8350 new_args
= add_outermost_template_args (args
, new_inner_args
);
8351 int pack_adjust
= 0;
8352 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
8357 /* Get the Ith template parameter. */
8358 parm
= TREE_VEC_ELT (parms
, parm_idx
);
8360 if (parm
== error_mark_node
)
8362 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
8366 /* Calculate the next argument. */
8367 if (arg_idx
< nargs
)
8368 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8372 if (template_parameter_pack_p (TREE_VALUE (parm
))
8373 && !(arg
&& ARGUMENT_PACK_P (arg
)))
8375 /* Some arguments will be placed in the
8376 template parameter pack PARM. */
8377 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
8378 inner_args
, arg_idx
,
8382 if (arg
== NULL_TREE
)
8384 /* We don't know how many args we have yet, just use the
8385 unconverted (and still packed) ones for now. */
8386 new_inner_args
= orig_inner_args
;
8391 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
8393 /* Store this argument. */
8394 if (arg
== error_mark_node
)
8397 /* We are done with all of the arguments. */
8403 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
8404 arg_idx
+= pack_adjust
;
8405 if (fixed_parameter_pack_p (TREE_VALUE (parm
)))
8408 fixed_pack_adjust
+= pack_adjust
;
8416 if (PACK_EXPANSION_P (arg
))
8418 /* "If every valid specialization of a variadic template
8419 requires an empty template parameter pack, the template is
8420 ill-formed, no diagnostic required." So check that the
8421 pattern works with this parameter. */
8422 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
8423 tree conv
= convert_template_argument (TREE_VALUE (parm
),
8427 if (conv
== error_mark_node
)
8429 if (complain
& tf_error
)
8430 inform (input_location
, "so any instantiation with a "
8431 "non-empty parameter pack would be ill-formed");
8434 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
8435 /* Recover from missing typename. */
8436 TREE_VEC_ELT (inner_args
, arg_idx
)
8437 = make_pack_expansion (conv
, complain
);
8439 /* We don't know how many args we have yet, just
8440 use the unconverted ones for now. */
8441 new_inner_args
= inner_args
;
8446 else if (require_all_args
)
8448 /* There must be a default arg in this case. */
8449 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
8451 /* The position of the first default template argument,
8452 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
8454 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8455 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8456 arg_idx
- pack_adjust
);
8461 if (arg
== error_mark_node
)
8463 if (complain
& tf_error
)
8464 error ("template argument %d is invalid", arg_idx
+ 1);
8468 /* This can occur if there was an error in the template
8469 parameter list itself (which we would already have
8470 reported) that we are trying to recover from, e.g., a class
8471 template with a parameter list such as
8472 template<typename..., typename> (cpp0x/variadic150.C). */
8475 /* This can also happen with a fixed parameter pack (71834). */
8476 if (arg_idx
>= nargs
)
8480 arg
= convert_template_argument (TREE_VALUE (parm
),
8481 arg
, new_args
, complain
,
8484 if (arg
== error_mark_node
)
8486 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
8488 cp_unevaluated_operand
= saved_unevaluated_operand
;
8489 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
8491 if (missing
|| arg_idx
< nargs
- variadic_args_p
)
8493 /* If we had fixed parameter packs, we didn't know how many arguments we
8494 actually needed earlier; now we do. */
8495 nparms
+= fixed_pack_adjust
;
8496 variadic_p
-= fixed_packs
;
8500 if (arg_idx
< nargs
)
8502 /* We had some pack expansion arguments that will only work if the packs
8503 are empty, but wait until instantiation time to complain.
8504 See variadic-ttp3.C. */
8505 int len
= nparms
+ (nargs
- arg_idx
);
8506 tree args
= make_tree_vec (len
);
8508 for (; i
< nparms
; ++i
)
8509 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (new_inner_args
, i
);
8510 for (; i
< len
; ++i
, ++arg_idx
)
8511 TREE_VEC_ELT (args
, i
) = TREE_VEC_ELT (inner_args
,
8512 arg_idx
- pack_adjust
);
8513 new_inner_args
= args
;
8518 gcc_assert (!(complain
& tf_error
) || seen_error ());
8519 return error_mark_node
;
8522 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8523 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8524 TREE_VEC_LENGTH (new_inner_args
));
8526 return new_inner_args
;
8529 /* Convert all template arguments to their appropriate types, and
8530 return a vector containing the innermost resulting template
8531 arguments. If any error occurs, return error_mark_node. Error and
8532 warning messages are not issued.
8534 Note that no function argument deduction is performed, and default
8535 arguments are used to fill in unspecified arguments. */
8537 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
8539 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
8542 /* Convert all template arguments to their appropriate type, and
8543 instantiate default arguments as needed. This returns a vector
8544 containing the innermost resulting template arguments, or
8545 error_mark_node if unsuccessful. */
8547 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
8548 tsubst_flags_t complain
)
8550 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
8553 /* Like coerce_template_parms. If PARMS represents all template
8554 parameters levels, this function returns a vector of vectors
8555 representing all the resulting argument levels. Note that in this
8556 case, only the innermost arguments are coerced because the
8557 outermost ones are supposed to have been coerced already.
8559 Otherwise, if PARMS represents only (the innermost) vector of
8560 parameters, this function returns a vector containing just the
8561 innermost resulting arguments. */
8564 coerce_innermost_template_parms (tree parms
,
8567 tsubst_flags_t complain
,
8568 bool require_all_args
,
8569 bool use_default_args
)
8571 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
8572 int args_depth
= TMPL_ARGS_DEPTH (args
);
8575 if (parms_depth
> 1)
8577 coerced_args
= make_tree_vec (parms_depth
);
8581 for (level
= parms
, cur_depth
= parms_depth
;
8582 parms_depth
> 0 && level
!= NULL_TREE
;
8583 level
= TREE_CHAIN (level
), --cur_depth
)
8586 if (cur_depth
== args_depth
)
8587 l
= coerce_template_parms (TREE_VALUE (level
),
8588 args
, in_decl
, complain
,
8592 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
8594 if (l
== error_mark_node
)
8595 return error_mark_node
;
8597 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
8601 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
8602 args
, in_decl
, complain
,
8605 return coerced_args
;
8608 /* Returns 1 if template args OT and NT are equivalent. */
8611 template_args_equal (tree ot
, tree nt
, bool partial_order
/* = false */)
8615 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
8617 if (nt
== any_targ_node
|| ot
== any_targ_node
)
8620 if (TREE_CODE (nt
) == TREE_VEC
)
8621 /* For member templates */
8622 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
8623 else if (PACK_EXPANSION_P (ot
))
8624 return (PACK_EXPANSION_P (nt
)
8625 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
8626 PACK_EXPANSION_PATTERN (nt
))
8627 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
8628 PACK_EXPANSION_EXTRA_ARGS (nt
)));
8629 else if (ARGUMENT_PACK_P (ot
))
8634 if (!ARGUMENT_PACK_P (nt
))
8637 opack
= ARGUMENT_PACK_ARGS (ot
);
8638 npack
= ARGUMENT_PACK_ARGS (nt
);
8639 len
= TREE_VEC_LENGTH (opack
);
8640 if (TREE_VEC_LENGTH (npack
) != len
)
8642 for (i
= 0; i
< len
; ++i
)
8643 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
8644 TREE_VEC_ELT (npack
, i
)))
8648 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
8650 else if (TYPE_P (nt
))
8654 /* Don't treat an alias template specialization with dependent
8655 arguments as equivalent to its underlying type when used as a
8656 template argument; we need them to be distinct so that we
8657 substitute into the specialization arguments at instantiation
8658 time. And aliases can't be equivalent without being ==, so
8659 we don't need to look any deeper.
8661 During partial ordering, however, we need to treat them normally so
8662 that we can order uses of the same alias with different
8663 cv-qualification (79960). */
8665 && (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
)))
8668 return same_type_p (ot
, nt
);
8670 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
8674 /* Try to treat a template non-type argument that has been converted
8675 to the parameter type as equivalent to one that hasn't yet. */
8676 for (enum tree_code code1
= TREE_CODE (ot
);
8677 CONVERT_EXPR_CODE_P (code1
)
8678 || code1
== NON_LVALUE_EXPR
;
8679 code1
= TREE_CODE (ot
))
8680 ot
= TREE_OPERAND (ot
, 0);
8681 for (enum tree_code code2
= TREE_CODE (nt
);
8682 CONVERT_EXPR_CODE_P (code2
)
8683 || code2
== NON_LVALUE_EXPR
;
8684 code2
= TREE_CODE (nt
))
8685 nt
= TREE_OPERAND (nt
, 0);
8687 return cp_tree_equal (ot
, nt
);
8691 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
8692 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
8693 NEWARG_PTR with the offending arguments if they are non-NULL. */
8696 comp_template_args (tree oldargs
, tree newargs
,
8697 tree
*oldarg_ptr
, tree
*newarg_ptr
,
8702 if (oldargs
== newargs
)
8705 if (!oldargs
|| !newargs
)
8708 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
8711 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
8713 tree nt
= TREE_VEC_ELT (newargs
, i
);
8714 tree ot
= TREE_VEC_ELT (oldargs
, i
);
8716 if (! template_args_equal (ot
, nt
, partial_order
))
8718 if (oldarg_ptr
!= NULL
)
8720 if (newarg_ptr
!= NULL
)
8729 comp_template_args_porder (tree oargs
, tree nargs
)
8731 return comp_template_args (oargs
, nargs
, NULL
, NULL
, true);
8735 add_pending_template (tree d
)
8737 tree ti
= (TYPE_P (d
)
8738 ? CLASSTYPE_TEMPLATE_INFO (d
)
8739 : DECL_TEMPLATE_INFO (d
));
8740 struct pending_template
*pt
;
8743 if (TI_PENDING_TEMPLATE_FLAG (ti
))
8746 /* We are called both from instantiate_decl, where we've already had a
8747 tinst_level pushed, and instantiate_template, where we haven't.
8749 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
8752 push_tinst_level (d
);
8754 pt
= ggc_alloc
<pending_template
> ();
8756 pt
->tinst
= current_tinst_level
;
8757 if (last_pending_template
)
8758 last_pending_template
->next
= pt
;
8760 pending_templates
= pt
;
8762 last_pending_template
= pt
;
8764 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
8771 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
8772 ARGLIST. Valid choices for FNS are given in the cp-tree.def
8773 documentation for TEMPLATE_ID_EXPR. */
8776 lookup_template_function (tree fns
, tree arglist
)
8780 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
8781 return error_mark_node
;
8783 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
8785 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
8787 error ("%q#D is not a function template", fns
);
8788 return error_mark_node
;
8791 if (BASELINK_P (fns
))
8793 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
8795 BASELINK_FUNCTIONS (fns
),
8800 type
= TREE_TYPE (fns
);
8801 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
8802 type
= unknown_type_node
;
8804 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
8807 /* Within the scope of a template class S<T>, the name S gets bound
8808 (in build_self_reference) to a TYPE_DECL for the class, not a
8809 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
8810 or one of its enclosing classes, and that type is a template,
8811 return the associated TEMPLATE_DECL. Otherwise, the original
8814 Also handle the case when DECL is a TREE_LIST of ambiguous
8815 injected-class-names from different bases. */
8818 maybe_get_template_decl_from_type_decl (tree decl
)
8820 if (decl
== NULL_TREE
)
8823 /* DR 176: A lookup that finds an injected-class-name (10.2
8824 [class.member.lookup]) can result in an ambiguity in certain cases
8825 (for example, if it is found in more than one base class). If all of
8826 the injected-class-names that are found refer to specializations of
8827 the same class template, and if the name is followed by a
8828 template-argument-list, the reference refers to the class template
8829 itself and not a specialization thereof, and is not ambiguous. */
8830 if (TREE_CODE (decl
) == TREE_LIST
)
8832 tree t
, tmpl
= NULL_TREE
;
8833 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8835 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8838 else if (tmpl
!= elt
)
8841 if (tmpl
&& t
== NULL_TREE
)
8847 return (decl
!= NULL_TREE
8848 && DECL_SELF_REFERENCE_P (decl
)
8849 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8850 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8853 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8854 parameters, find the desired type.
8856 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8858 IN_DECL, if non-NULL, is the template declaration we are trying to
8861 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8862 the class we are looking up.
8864 Issue error and warning messages under control of COMPLAIN.
8866 If the template class is really a local class in a template
8867 function, then the FUNCTION_CONTEXT is the function in which it is
8870 ??? Note that this function is currently called *twice* for each
8871 template-id: the first time from the parser, while creating the
8872 incomplete type (finish_template_type), and the second type during the
8873 real instantiation (instantiate_template_class). This is surely something
8874 that we want to avoid. It also causes some problems with argument
8875 coercion (see convert_nontype_argument for more information on this). */
8878 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8879 int entering_scope
, tsubst_flags_t complain
)
8881 tree templ
= NULL_TREE
, parmlist
;
8888 if (identifier_p (d1
))
8890 tree value
= innermost_non_namespace_value (d1
);
8891 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8896 push_decl_namespace (context
);
8897 templ
= lookup_name (d1
);
8898 templ
= maybe_get_template_decl_from_type_decl (templ
);
8900 pop_decl_namespace ();
8903 context
= DECL_CONTEXT (templ
);
8905 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8907 tree type
= TREE_TYPE (d1
);
8909 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8910 an implicit typename for the second A. Deal with it. */
8911 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8912 type
= TREE_TYPE (type
);
8914 if (CLASSTYPE_TEMPLATE_INFO (type
))
8916 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8917 d1
= DECL_NAME (templ
);
8920 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8921 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8923 templ
= TYPE_TI_TEMPLATE (d1
);
8924 d1
= DECL_NAME (templ
);
8926 else if (DECL_TYPE_TEMPLATE_P (d1
))
8929 d1
= DECL_NAME (templ
);
8930 context
= DECL_CONTEXT (templ
);
8932 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8935 d1
= DECL_NAME (templ
);
8938 /* Issue an error message if we didn't find a template. */
8941 if (complain
& tf_error
)
8942 error ("%qT is not a template", d1
);
8943 return error_mark_node
;
8946 if (TREE_CODE (templ
) != TEMPLATE_DECL
8947 /* Make sure it's a user visible template, if it was named by
8949 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8950 && !PRIMARY_TEMPLATE_P (templ
)))
8952 if (complain
& tf_error
)
8954 error ("non-template type %qT used as a template", d1
);
8956 error ("for template declaration %q+D", in_decl
);
8958 return error_mark_node
;
8961 complain
&= ~tf_user
;
8963 /* An alias that just changes the name of a template is equivalent to the
8964 other template, so if any of the arguments are pack expansions, strip
8965 the alias to avoid problems with a pack expansion passed to a non-pack
8966 alias template parameter (DR 1430). */
8967 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8968 templ
= get_underlying_template (templ
);
8970 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8973 tree arglist2
= coerce_template_args_for_ttp (templ
, arglist
, complain
);
8974 if (arglist2
== error_mark_node
8975 || (!uses_template_parms (arglist2
)
8976 && check_instantiated_args (templ
, arglist2
, complain
)))
8977 return error_mark_node
;
8979 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8984 tree template_type
= TREE_TYPE (templ
);
8987 tree found
= NULL_TREE
;
8990 int is_dependent_type
;
8991 int use_partial_inst_tmpl
= false;
8993 if (template_type
== error_mark_node
)
8994 /* An error occurred while building the template TEMPL, and a
8995 diagnostic has most certainly been emitted for that
8996 already. Let's propagate that error. */
8997 return error_mark_node
;
8999 gen_tmpl
= most_general_template (templ
);
9000 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
9001 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
9002 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9004 if (arg_depth
== 1 && parm_depth
> 1)
9006 /* We've been given an incomplete set of template arguments.
9009 template <class T> struct S1 {
9010 template <class U> struct S2 {};
9011 template <class U> struct S2<U*> {};
9014 we will be called with an ARGLIST of `U*', but the
9015 TEMPLATE will be `template <class T> template
9016 <class U> struct S1<T>::S2'. We must fill in the missing
9018 tree ti
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (templ
));
9019 arglist
= add_outermost_template_args (TI_ARGS (ti
), arglist
);
9020 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
9023 /* Now we should have enough arguments. */
9024 gcc_assert (parm_depth
== arg_depth
);
9026 /* From here on, we're only interested in the most general
9029 /* Calculate the BOUND_ARGS. These will be the args that are
9030 actually tsubst'd into the definition to create the
9032 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
9034 /*require_all_args=*/true,
9035 /*use_default_args=*/true);
9037 if (arglist
== error_mark_node
)
9038 /* We were unable to bind the arguments. */
9039 return error_mark_node
;
9041 /* In the scope of a template class, explicit references to the
9042 template class refer to the type of the template, not any
9043 instantiation of it. For example, in:
9045 template <class T> class C { void f(C<T>); }
9047 the `C<T>' is just the same as `C'. Outside of the
9048 class, however, such a reference is an instantiation. */
9050 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
9051 || currently_open_class (template_type
))
9053 tree tinfo
= TYPE_TEMPLATE_INFO (template_type
);
9055 if (tinfo
&& comp_template_args (TI_ARGS (tinfo
), arglist
))
9056 return template_type
;
9059 /* If we already have this specialization, return it. */
9060 elt
.tmpl
= gen_tmpl
;
9062 elt
.spec
= NULL_TREE
;
9063 hash
= spec_hasher::hash (&elt
);
9064 entry
= type_specializations
->find_with_hash (&elt
, hash
);
9069 /* If the the template's constraints are not satisfied,
9070 then we cannot form a valid type.
9072 Note that the check is deferred until after the hash
9073 lookup. This prevents redundant checks on previously
9074 instantiated specializations. */
9075 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
9077 if (complain
& tf_error
)
9079 error ("template constraint failure");
9080 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
9082 return error_mark_node
;
9085 is_dependent_type
= uses_template_parms (arglist
);
9087 /* If the deduced arguments are invalid, then the binding
9089 if (!is_dependent_type
9090 && check_instantiated_args (gen_tmpl
,
9091 INNERMOST_TEMPLATE_ARGS (arglist
),
9093 return error_mark_node
;
9095 if (!is_dependent_type
9096 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
9097 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
9098 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
9100 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
9101 DECL_NAME (gen_tmpl
),
9102 /*tag_scope=*/ts_global
);
9106 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
9108 if (context
== error_mark_node
)
9109 return error_mark_node
;
9112 context
= global_namespace
;
9114 /* Create the type. */
9115 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9117 /* The user referred to a specialization of an alias
9118 template represented by GEN_TMPL.
9120 [temp.alias]/2 says:
9122 When a template-id refers to the specialization of an
9123 alias template, it is equivalent to the associated
9124 type obtained by substitution of its
9125 template-arguments for the template-parameters in the
9126 type-id of the alias template. */
9128 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
9129 /* Note that the call above (by indirectly calling
9130 register_specialization in tsubst_decl) registers the
9131 TYPE_DECL representing the specialization of the alias
9132 template. So next time someone substitutes ARGLIST for
9133 the template parms into the alias template (GEN_TMPL),
9134 she'll get that TYPE_DECL back. */
9136 if (t
== error_mark_node
)
9139 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
9141 if (!is_dependent_type
)
9143 set_current_access_from_decl (TYPE_NAME (template_type
));
9144 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
9145 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
9146 arglist
, complain
, in_decl
),
9147 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
9148 arglist
, complain
, in_decl
),
9149 SCOPED_ENUM_P (template_type
), NULL
);
9151 if (t
== error_mark_node
)
9156 /* We don't want to call start_enum for this type, since
9157 the values for the enumeration constants may involve
9158 template parameters. And, no one should be interested
9159 in the enumeration constants for such a type. */
9160 t
= cxx_make_type (ENUMERAL_TYPE
);
9161 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
9163 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
9164 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
9165 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
9167 else if (CLASS_TYPE_P (template_type
))
9169 /* Lambda closures are regenerated in tsubst_lambda_expr, not
9170 instantiated here. */
9171 gcc_assert (!LAMBDA_TYPE_P (template_type
));
9173 t
= make_class_type (TREE_CODE (template_type
));
9174 CLASSTYPE_DECLARED_CLASS (t
)
9175 = CLASSTYPE_DECLARED_CLASS (template_type
);
9176 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
9178 /* A local class. Make sure the decl gets registered properly. */
9179 if (context
== current_function_decl
)
9180 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
9182 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
9183 /* This instantiation is another name for the primary
9184 template type. Set the TYPE_CANONICAL field
9186 TYPE_CANONICAL (t
) = template_type
;
9187 else if (any_template_arguments_need_structural_equality_p (arglist
))
9188 /* Some of the template arguments require structural
9189 equality testing, so this template class requires
9190 structural equality testing. */
9191 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9196 /* If we called start_enum or pushtag above, this information
9197 will already be set up. */
9200 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
9202 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
9203 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
9204 DECL_SOURCE_LOCATION (type_decl
)
9205 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
9208 type_decl
= TYPE_NAME (t
);
9210 if (CLASS_TYPE_P (template_type
))
9212 TREE_PRIVATE (type_decl
)
9213 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
9214 TREE_PROTECTED (type_decl
)
9215 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
9216 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
9218 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
9219 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
9223 if (OVERLOAD_TYPE_P (t
)
9224 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9226 static const char *tags
[] = {"abi_tag", "may_alias"};
9228 for (unsigned ix
= 0; ix
!= 2; ix
++)
9231 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
9235 = tree_cons (TREE_PURPOSE (attributes
),
9236 TREE_VALUE (attributes
),
9237 TYPE_ATTRIBUTES (t
));
9241 /* Let's consider the explicit specialization of a member
9242 of a class template specialization that is implicitly instantiated,
9247 template<class U> struct M {}; //#0
9252 struct S<int>::M<char> //#1
9256 [temp.expl.spec]/4 says this is valid.
9258 In this case, when we write:
9261 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
9264 When we encounter #1, we want to store the partial instantiation
9265 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
9267 For all cases other than this "explicit specialization of member of a
9268 class template", we just want to store the most general template into
9269 the CLASSTYPE_TI_TEMPLATE of M.
9271 This case of "explicit specialization of member of a class template"
9273 1/ the enclosing class is an instantiation of, and therefore not
9274 the same as, the context of the most general template, and
9275 2/ we aren't looking at the partial instantiation itself, i.e.
9276 the innermost arguments are not the same as the innermost parms of
9277 the most general template.
9279 So it's only when 1/ and 2/ happens that we want to use the partial
9280 instantiation of the member template in lieu of its most general
9283 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
9284 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
9285 /* the enclosing class must be an instantiation... */
9286 && CLASS_TYPE_P (context
)
9287 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
9289 TREE_VEC_LENGTH (arglist
)--;
9290 ++processing_template_decl
;
9291 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (gen_tmpl
));
9292 tree partial_inst_args
=
9293 tsubst (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
)),
9294 arglist
, complain
, NULL_TREE
);
9295 --processing_template_decl
;
9296 TREE_VEC_LENGTH (arglist
)++;
9297 if (partial_inst_args
== error_mark_node
)
9298 return error_mark_node
;
9299 use_partial_inst_tmpl
=
9300 /*...and we must not be looking at the partial instantiation
9302 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
9306 if (!use_partial_inst_tmpl
)
9307 /* This case is easy; there are no member templates involved. */
9311 /* This is a full instantiation of a member template. Find
9312 the partial instantiation of which this is an instance. */
9314 /* Temporarily reduce by one the number of levels in the ARGLIST
9315 so as to avoid comparing the last set of arguments. */
9316 TREE_VEC_LENGTH (arglist
)--;
9317 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
9318 TREE_VEC_LENGTH (arglist
)++;
9319 /* FOUND is either a proper class type, or an alias
9320 template specialization. In the later case, it's a
9321 TYPE_DECL, resulting from the substituting of arguments
9322 for parameters in the TYPE_DECL of the alias template
9323 done earlier. So be careful while getting the template
9325 found
= (TREE_CODE (found
) == TEMPLATE_DECL
9327 : (TREE_CODE (found
) == TYPE_DECL
9328 ? DECL_TI_TEMPLATE (found
)
9329 : CLASSTYPE_TI_TEMPLATE (found
)));
9332 // Build template info for the new specialization.
9333 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
9336 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
9337 entry
= ggc_alloc
<spec_entry
> ();
9341 /* Note this use of the partial instantiation so we can check it
9342 later in maybe_process_partial_specialization. */
9343 DECL_TEMPLATE_INSTANTIATIONS (found
)
9344 = tree_cons (arglist
, t
,
9345 DECL_TEMPLATE_INSTANTIATIONS (found
));
9347 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
9348 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9349 /* Now that the type has been registered on the instantiations
9350 list, we set up the enumerators. Because the enumeration
9351 constants may involve the enumeration type itself, we make
9352 sure to register the type first, and then create the
9353 constants. That way, doing tsubst_expr for the enumeration
9354 constants won't result in recursive calls here; we'll find
9355 the instantiation and exit above. */
9356 tsubst_enum (template_type
, t
, arglist
);
9358 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
9359 /* If the type makes use of template parameters, the
9360 code that generates debugging information will crash. */
9361 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
9363 /* Possibly limit visibility based on template args. */
9364 TREE_PUBLIC (type_decl
) = 1;
9365 determine_visibility (type_decl
);
9367 inherit_targ_abi_tags (t
);
9373 /* Wrapper for lookup_template_class_1. */
9376 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
9377 int entering_scope
, tsubst_flags_t complain
)
9380 timevar_push (TV_TEMPLATE_INST
);
9381 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
9382 entering_scope
, complain
);
9383 timevar_pop (TV_TEMPLATE_INST
);
9387 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
9390 lookup_template_variable (tree templ
, tree arglist
)
9392 /* The type of the expression is NULL_TREE since the template-id could refer
9393 to an explicit or partial specialization. */
9394 tree type
= NULL_TREE
;
9395 if (flag_concepts
&& variable_concept_p (templ
))
9396 /* Except that concepts are always bool. */
9397 type
= boolean_type_node
;
9398 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
9401 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
9404 finish_template_variable (tree var
, tsubst_flags_t complain
)
9406 tree templ
= TREE_OPERAND (var
, 0);
9407 tree arglist
= TREE_OPERAND (var
, 1);
9409 /* We never want to return a VAR_DECL for a variable concept, since they
9410 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
9411 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
9412 if (concept_p
&& processing_template_decl
)
9415 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
9416 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
9418 templ
= most_general_template (templ
);
9419 tree parms
= DECL_TEMPLATE_PARMS (templ
);
9420 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
9422 /*use_default*/true);
9424 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
9426 if (complain
& tf_error
)
9428 error ("use of invalid variable template %qE", var
);
9429 diagnose_constraints (location_of (var
), templ
, arglist
);
9431 return error_mark_node
;
9434 /* If a template-id refers to a specialization of a variable
9435 concept, then the expression is true if and only if the
9436 concept's constraints are satisfied by the given template
9439 NOTE: This is an extension of Concepts Lite TS that
9440 allows constraints to be used in expressions. */
9443 tree decl
= DECL_TEMPLATE_RESULT (templ
);
9444 return evaluate_variable_concept (decl
, arglist
);
9447 return instantiate_template (templ
, arglist
, complain
);
9450 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
9451 TARGS template args, and instantiate it if it's not dependent. */
9454 lookup_and_finish_template_variable (tree templ
, tree targs
,
9455 tsubst_flags_t complain
)
9457 templ
= lookup_template_variable (templ
, targs
);
9458 if (!any_dependent_template_arguments_p (targs
))
9460 templ
= finish_template_variable (templ
, complain
);
9464 return convert_from_reference (templ
);
9473 /* True when we should also visit template parameters that occur in
9474 non-deduced contexts. */
9475 bool include_nondeduced_p
;
9476 hash_set
<tree
> *visited
;
9479 /* Called from for_each_template_parm via walk_tree. */
9482 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
9485 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
9486 tree_fn_t fn
= pfd
->fn
;
9487 void *data
= pfd
->data
;
9488 tree result
= NULL_TREE
;
9490 #define WALK_SUBTREE(NODE) \
9493 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
9494 pfd->include_nondeduced_p, \
9496 if (result) goto out; \
9500 if (pfd
->any_fn
&& (*pfd
->any_fn
)(t
, data
))
9504 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
9505 WALK_SUBTREE (TYPE_CONTEXT (t
));
9507 switch (TREE_CODE (t
))
9510 if (TYPE_PTRMEMFUNC_P (t
))
9516 if (!TYPE_TEMPLATE_INFO (t
))
9519 WALK_SUBTREE (TYPE_TI_ARGS (t
));
9523 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
9524 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
9528 /* Since we're not going to walk subtrees, we have to do this
9530 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
9534 /* Check the return type. */
9535 WALK_SUBTREE (TREE_TYPE (t
));
9537 /* Check the parameter types. Since default arguments are not
9538 instantiated until they are needed, the TYPE_ARG_TYPES may
9539 contain expressions that involve template parameters. But,
9540 no-one should be looking at them yet. And, once they're
9541 instantiated, they don't contain template parameters, so
9542 there's no point in looking at them then, either. */
9546 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
9547 WALK_SUBTREE (TREE_VALUE (parm
));
9549 /* Since we've already handled the TYPE_ARG_TYPES, we don't
9550 want walk_tree walking into them itself. */
9554 if (flag_noexcept_type
)
9556 tree spec
= TYPE_RAISES_EXCEPTIONS (t
);
9558 WALK_SUBTREE (TREE_PURPOSE (spec
));
9563 case UNDERLYING_TYPE
:
9564 if (pfd
->include_nondeduced_p
9565 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
9567 pfd
->include_nondeduced_p
,
9569 return error_mark_node
;
9574 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
9575 WALK_SUBTREE (DECL_TI_ARGS (t
));
9580 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
9581 WALK_SUBTREE (DECL_INITIAL (t
));
9582 if (DECL_CONTEXT (t
)
9583 && pfd
->include_nondeduced_p
)
9584 WALK_SUBTREE (DECL_CONTEXT (t
));
9587 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9588 /* Record template parameters such as `T' inside `TT<T>'. */
9589 WALK_SUBTREE (TYPE_TI_ARGS (t
));
9592 case TEMPLATE_TEMPLATE_PARM
:
9593 case TEMPLATE_TYPE_PARM
:
9594 case TEMPLATE_PARM_INDEX
:
9595 if (fn
&& (*fn
)(t
, data
))
9602 /* A template template parameter is encountered. */
9603 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9604 WALK_SUBTREE (TREE_TYPE (t
));
9606 /* Already substituted template template parameter */
9611 /* A template-id in a TYPENAME_TYPE might be a deduced context after
9612 partial instantiation. */
9613 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
9617 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
9618 && pfd
->include_nondeduced_p
)
9619 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
9624 /* If there's no type, then this thing must be some expression
9625 involving template parameters. */
9626 if (!fn
&& !TREE_TYPE (t
))
9627 return error_mark_node
;
9632 case IMPLICIT_CONV_EXPR
:
9633 case REINTERPRET_CAST_EXPR
:
9634 case CONST_CAST_EXPR
:
9635 case STATIC_CAST_EXPR
:
9636 case DYNAMIC_CAST_EXPR
:
9640 case PSEUDO_DTOR_EXPR
:
9642 return error_mark_node
;
9651 /* We didn't find any template parameters we liked. */
9656 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
9657 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
9658 call FN with the parameter and the DATA.
9659 If FN returns nonzero, the iteration is terminated, and
9660 for_each_template_parm returns 1. Otherwise, the iteration
9661 continues. If FN never returns a nonzero value, the value
9662 returned by for_each_template_parm is 0. If FN is NULL, it is
9663 considered to be the function which always returns 1.
9665 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
9666 parameters that occur in non-deduced contexts. When false, only
9667 visits those template parameters that can be deduced. */
9670 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
9671 hash_set
<tree
> *visited
,
9672 bool include_nondeduced_p
,
9675 struct pair_fn_data pfd
;
9680 pfd
.any_fn
= any_fn
;
9682 pfd
.include_nondeduced_p
= include_nondeduced_p
;
9684 /* Walk the tree. (Conceptually, we would like to walk without
9685 duplicates, but for_each_template_parm_r recursively calls
9686 for_each_template_parm, so we would need to reorganize a fair
9687 bit to use walk_tree_without_duplicates, so we keep our own
9690 pfd
.visited
= visited
;
9692 pfd
.visited
= new hash_set
<tree
>;
9693 result
= cp_walk_tree (&t
,
9694 for_each_template_parm_r
,
9708 /* Returns true if T depends on any template parameter. */
9711 uses_template_parms (tree t
)
9717 int saved_processing_template_decl
;
9719 saved_processing_template_decl
= processing_template_decl
;
9720 if (!saved_processing_template_decl
)
9721 processing_template_decl
= 1;
9723 dependent_p
= dependent_type_p (t
);
9724 else if (TREE_CODE (t
) == TREE_VEC
)
9725 dependent_p
= any_dependent_template_arguments_p (t
);
9726 else if (TREE_CODE (t
) == TREE_LIST
)
9727 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
9728 || uses_template_parms (TREE_CHAIN (t
)));
9729 else if (TREE_CODE (t
) == TYPE_DECL
)
9730 dependent_p
= dependent_type_p (TREE_TYPE (t
));
9733 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
9734 || TREE_CODE (t
) == OVERLOAD
9737 || TREE_CODE (t
) == TRAIT_EXPR
9738 || TREE_CODE (t
) == CONSTRUCTOR
9739 || CONSTANT_CLASS_P (t
))
9740 dependent_p
= (type_dependent_expression_p (t
)
9741 || value_dependent_expression_p (t
));
9744 gcc_assert (t
== error_mark_node
);
9745 dependent_p
= false;
9748 processing_template_decl
= saved_processing_template_decl
;
9753 /* Returns true iff current_function_decl is an incompletely instantiated
9754 template. Useful instead of processing_template_decl because the latter
9755 is set to 0 during instantiate_non_dependent_expr. */
9758 in_template_function (void)
9760 tree fn
= current_function_decl
;
9762 ++processing_template_decl
;
9763 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
9764 && DECL_TEMPLATE_INFO (fn
)
9765 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
9766 --processing_template_decl
;
9770 /* Returns true if T depends on any template parameter with level LEVEL. */
9773 uses_template_parms_level (tree t
, int level
)
9775 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
9776 /*include_nondeduced_p=*/true);
9779 /* Returns true if the signature of DECL depends on any template parameter from
9780 its enclosing class. */
9783 uses_outer_template_parms (tree decl
)
9785 int depth
= template_class_depth (CP_DECL_CONTEXT (decl
));
9788 if (for_each_template_parm (TREE_TYPE (decl
), template_parm_outer_level
,
9789 &depth
, NULL
, /*include_nondeduced_p=*/true))
9791 if (PRIMARY_TEMPLATE_P (decl
)
9792 && for_each_template_parm (INNERMOST_TEMPLATE_PARMS
9793 (DECL_TEMPLATE_PARMS (decl
)),
9794 template_parm_outer_level
,
9795 &depth
, NULL
, /*include_nondeduced_p=*/true))
9797 tree ci
= get_constraints (decl
);
9799 ci
= CI_ASSOCIATED_CONSTRAINTS (ci
);
9800 if (ci
&& for_each_template_parm (ci
, template_parm_outer_level
,
9801 &depth
, NULL
, /*nondeduced*/true))
9806 /* Returns TRUE iff INST is an instantiation we don't need to do in an
9807 ill-formed translation unit, i.e. a variable or function that isn't
9808 usable in a constant expression. */
9811 neglectable_inst_p (tree d
)
9814 && !undeduced_auto_decl (d
)
9815 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
9816 : decl_maybe_constant_var_p (d
)));
9819 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9820 neglectable and instantiated from within an erroneous instantiation. */
9823 limit_bad_template_recursion (tree decl
)
9825 struct tinst_level
*lev
= current_tinst_level
;
9826 int errs
= errorcount
+ sorrycount
;
9827 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9830 for (; lev
; lev
= lev
->next
)
9831 if (neglectable_inst_p (lev
->decl
))
9834 return (lev
&& errs
> lev
->errors
);
9837 static int tinst_depth
;
9838 extern int max_tinst_depth
;
9841 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9843 /* We're starting to instantiate D; record the template instantiation context
9844 for diagnostics and to restore it later. */
9847 push_tinst_level (tree d
)
9849 return push_tinst_level_loc (d
, input_location
);
9852 /* We're starting to instantiate D; record the template instantiation context
9853 at LOC for diagnostics and to restore it later. */
9856 push_tinst_level_loc (tree d
, location_t loc
)
9858 struct tinst_level
*new_level
;
9860 if (tinst_depth
>= max_tinst_depth
)
9862 /* Tell error.c not to try to instantiate any templates. */
9864 fatal_error (input_location
,
9865 "template instantiation depth exceeds maximum of %d"
9866 " (use -ftemplate-depth= to increase the maximum)",
9871 /* If the current instantiation caused problems, don't let it instantiate
9872 anything else. Do allow deduction substitution and decls usable in
9873 constant expressions. */
9874 if (limit_bad_template_recursion (d
))
9877 /* When not -quiet, dump template instantiations other than functions, since
9878 announce_function will take care of those. */
9880 && TREE_CODE (d
) != TREE_LIST
9881 && TREE_CODE (d
) != FUNCTION_DECL
)
9882 fprintf (stderr
, " %s", decl_as_string (d
, TFF_DECL_SPECIFIERS
));
9884 new_level
= ggc_alloc
<tinst_level
> ();
9885 new_level
->decl
= d
;
9886 new_level
->locus
= loc
;
9887 new_level
->errors
= errorcount
+sorrycount
;
9888 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9889 new_level
->next
= current_tinst_level
;
9890 current_tinst_level
= new_level
;
9893 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9894 depth_reached
= tinst_depth
;
9899 /* We're done instantiating this template; return to the instantiation
9903 pop_tinst_level (void)
9905 /* Restore the filename and line number stashed away when we started
9906 this instantiation. */
9907 input_location
= current_tinst_level
->locus
;
9908 current_tinst_level
= current_tinst_level
->next
;
9912 /* We're instantiating a deferred template; restore the template
9913 instantiation context in which the instantiation was requested, which
9914 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9917 reopen_tinst_level (struct tinst_level
*level
)
9919 struct tinst_level
*t
;
9922 for (t
= level
; t
; t
= t
->next
)
9925 current_tinst_level
= level
;
9927 if (current_tinst_level
)
9928 current_tinst_level
->errors
= errorcount
+sorrycount
;
9932 /* Returns the TINST_LEVEL which gives the original instantiation
9935 struct tinst_level
*
9936 outermost_tinst_level (void)
9938 struct tinst_level
*level
= current_tinst_level
;
9941 level
= level
->next
;
9945 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9946 vector of template arguments, as for tsubst.
9948 Returns an appropriate tsubst'd friend declaration. */
9951 tsubst_friend_function (tree decl
, tree args
)
9955 if (TREE_CODE (decl
) == FUNCTION_DECL
9956 && DECL_TEMPLATE_INSTANTIATION (decl
)
9957 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9958 /* This was a friend declared with an explicit template
9959 argument list, e.g.:
9963 to indicate that f was a template instantiation, not a new
9964 function declaration. Now, we have to figure out what
9965 instantiation of what template. */
9967 tree template_id
, arglist
, fns
;
9970 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9972 /* Friend functions are looked up in the containing namespace scope.
9973 We must enter that scope, to avoid finding member functions of the
9974 current class with same name. */
9975 push_nested_namespace (ns
);
9976 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9977 tf_warning_or_error
, NULL_TREE
,
9978 /*integral_constant_expression_p=*/false);
9979 pop_nested_namespace (ns
);
9980 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9981 tf_warning_or_error
, NULL_TREE
);
9982 template_id
= lookup_template_function (fns
, arglist
);
9984 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9985 tmpl
= determine_specialization (template_id
, new_friend
,
9987 /*need_member_template=*/0,
9988 TREE_VEC_LENGTH (args
),
9990 return instantiate_template (tmpl
, new_args
, tf_error
);
9993 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9995 /* The NEW_FRIEND will look like an instantiation, to the
9996 compiler, but is not an instantiation from the point of view of
9997 the language. For example, we might have had:
9999 template <class T> struct S {
10000 template <class U> friend void f(T, U);
10003 Then, in S<int>, template <class U> void f(int, U) is not an
10004 instantiation of anything. */
10005 if (new_friend
== error_mark_node
)
10006 return error_mark_node
;
10008 DECL_USE_TEMPLATE (new_friend
) = 0;
10009 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
10011 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
10012 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
10013 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
10016 /* The mangled name for the NEW_FRIEND is incorrect. The function
10017 is not a template instantiation and should not be mangled like
10018 one. Therefore, we forget the mangling here; we'll recompute it
10019 later if we need it. */
10020 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
10022 SET_DECL_RTL (new_friend
, NULL
);
10023 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
10026 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
10029 tree new_friend_template_info
;
10030 tree new_friend_result_template_info
;
10032 int new_friend_is_defn
;
10034 /* We must save some information from NEW_FRIEND before calling
10035 duplicate decls since that function will free NEW_FRIEND if
10037 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
10038 new_friend_is_defn
=
10039 (DECL_INITIAL (DECL_TEMPLATE_RESULT
10040 (template_for_substitution (new_friend
)))
10042 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
10044 /* This declaration is a `primary' template. */
10045 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
10047 new_friend_result_template_info
10048 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
10051 new_friend_result_template_info
= NULL_TREE
;
10053 /* Inside pushdecl_namespace_level, we will push into the
10054 current namespace. However, the friend function should go
10055 into the namespace of the template. */
10056 ns
= decl_namespace_context (new_friend
);
10057 push_nested_namespace (ns
);
10058 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
10059 pop_nested_namespace (ns
);
10061 if (old_decl
== error_mark_node
)
10062 return error_mark_node
;
10064 if (old_decl
!= new_friend
)
10066 /* This new friend declaration matched an existing
10067 declaration. For example, given:
10069 template <class T> void f(T);
10070 template <class U> class C {
10071 template <class T> friend void f(T) {}
10074 the friend declaration actually provides the definition
10075 of `f', once C has been instantiated for some type. So,
10076 old_decl will be the out-of-class template declaration,
10077 while new_friend is the in-class definition.
10079 But, if `f' was called before this point, the
10080 instantiation of `f' will have DECL_TI_ARGS corresponding
10081 to `T' but not to `U', references to which might appear
10082 in the definition of `f'. Previously, the most general
10083 template for an instantiation of `f' was the out-of-class
10084 version; now it is the in-class version. Therefore, we
10085 run through all specialization of `f', adding to their
10086 DECL_TI_ARGS appropriately. In particular, they need a
10087 new set of outer arguments, corresponding to the
10088 arguments for this class instantiation.
10090 The same situation can arise with something like this:
10092 friend void f(int);
10093 template <class T> class C {
10094 friend void f(T) {}
10097 when `C<int>' is instantiated. Now, `f(int)' is defined
10100 if (!new_friend_is_defn
)
10101 /* On the other hand, if the in-class declaration does
10102 *not* provide a definition, then we don't want to alter
10103 existing definitions. We can just leave everything
10108 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
10109 tree new_args
= TI_ARGS (new_friend_template_info
);
10111 /* Overwrite whatever template info was there before, if
10112 any, with the new template information pertaining to
10113 the declaration. */
10114 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
10116 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
10118 /* We should have called reregister_specialization in
10119 duplicate_decls. */
10120 gcc_assert (retrieve_specialization (new_template
,
10124 /* Instantiate it if the global has already been used. */
10125 if (DECL_ODR_USED (old_decl
))
10126 instantiate_decl (old_decl
, /*defer_ok=*/true,
10127 /*expl_inst_class_mem_p=*/false);
10133 /* Indicate that the old function template is a partial
10135 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
10136 = new_friend_result_template_info
;
10138 gcc_assert (new_template
10139 == most_general_template (new_template
));
10140 gcc_assert (new_template
!= old_decl
);
10142 /* Reassign any specializations already in the hash table
10143 to the new more general template, and add the
10144 additional template args. */
10145 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
10147 t
= TREE_CHAIN (t
))
10149 tree spec
= TREE_VALUE (t
);
10152 elt
.tmpl
= old_decl
;
10153 elt
.args
= DECL_TI_ARGS (spec
);
10154 elt
.spec
= NULL_TREE
;
10156 decl_specializations
->remove_elt (&elt
);
10158 DECL_TI_ARGS (spec
)
10159 = add_outermost_template_args (new_args
,
10160 DECL_TI_ARGS (spec
));
10162 register_specialization
10163 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
10166 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
10170 /* The information from NEW_FRIEND has been merged into OLD_DECL
10171 by duplicate_decls. */
10172 new_friend
= old_decl
;
10177 tree context
= DECL_CONTEXT (new_friend
);
10181 template <class T> class C {
10182 template <class U> friend void C1<U>::f (); // case 1
10183 friend void C2<T>::f (); // case 2
10185 we only need to make sure CONTEXT is a complete type for
10186 case 2. To distinguish between the two cases, we note that
10187 CONTEXT of case 1 remains dependent type after tsubst while
10188 this isn't true for case 2. */
10189 ++processing_template_decl
;
10190 dependent_p
= dependent_type_p (context
);
10191 --processing_template_decl
;
10194 && !complete_type_or_else (context
, NULL_TREE
))
10195 return error_mark_node
;
10197 if (COMPLETE_TYPE_P (context
))
10199 tree fn
= new_friend
;
10200 /* do_friend adds the TEMPLATE_DECL for any member friend
10201 template even if it isn't a member template, i.e.
10202 template <class T> friend A<T>::f();
10203 Look through it in that case. */
10204 if (TREE_CODE (fn
) == TEMPLATE_DECL
10205 && !PRIMARY_TEMPLATE_P (fn
))
10206 fn
= DECL_TEMPLATE_RESULT (fn
);
10207 /* Check to see that the declaration is really present, and,
10208 possibly obtain an improved declaration. */
10209 fn
= check_classfn (context
, fn
, NULL_TREE
);
10219 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
10220 template arguments, as for tsubst.
10222 Returns an appropriate tsubst'd friend type or error_mark_node on
10226 tsubst_friend_class (tree friend_tmpl
, tree args
)
10230 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
10232 tmpl
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
10233 return TREE_TYPE (tmpl
);
10236 tree context
= CP_DECL_CONTEXT (friend_tmpl
);
10237 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10238 push_nested_namespace (context
);
10240 push_nested_class (context
);
10242 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), /*prefer_type=*/false,
10243 /*non_class=*/false, /*block_p=*/false,
10244 /*namespaces_only=*/false, LOOKUP_HIDDEN
);
10246 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
10248 /* The friend template has already been declared. Just
10249 check to see that the declarations match, and install any new
10250 default parameters. We must tsubst the default parameters,
10251 of course. We only need the innermost template parameters
10252 because that is all that redeclare_class_template will look
10254 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
10255 > TMPL_ARGS_DEPTH (args
))
10257 tree parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
10258 args
, tf_warning_or_error
);
10259 location_t saved_input_location
= input_location
;
10260 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
10261 tree cons
= get_constraints (tmpl
);
10262 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
10263 input_location
= saved_input_location
;
10268 /* The friend template has not already been declared. In this
10269 case, the instantiation of the template class will cause the
10270 injection of this template into the namespace scope. */
10271 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
10273 if (tmpl
!= error_mark_node
)
10275 /* The new TMPL is not an instantiation of anything, so we
10276 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE
10277 for the new type because that is supposed to be the
10278 corresponding template decl, i.e., TMPL. */
10279 DECL_USE_TEMPLATE (tmpl
) = 0;
10280 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
10281 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
10282 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
10283 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
10285 /* It is hidden. */
10286 retrofit_lang_decl (DECL_TEMPLATE_RESULT (tmpl
));
10287 DECL_ANTICIPATED (tmpl
)
10288 = DECL_ANTICIPATED (DECL_TEMPLATE_RESULT (tmpl
)) = true;
10290 /* Inject this template into the enclosing namspace scope. */
10291 tmpl
= pushdecl_namespace_level (tmpl
, true);
10295 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10296 pop_nested_namespace (context
);
10298 pop_nested_class ();
10300 return TREE_TYPE (tmpl
);
10303 /* Returns zero if TYPE cannot be completed later due to circularity.
10304 Otherwise returns one. */
10307 can_complete_type_without_circularity (tree type
)
10309 if (type
== NULL_TREE
|| type
== error_mark_node
)
10311 else if (COMPLETE_TYPE_P (type
))
10313 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10314 return can_complete_type_without_circularity (TREE_TYPE (type
));
10315 else if (CLASS_TYPE_P (type
)
10316 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
10322 static tree
tsubst_omp_clauses (tree
, enum c_omp_region_type
, tree
,
10323 tsubst_flags_t
, tree
);
10325 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
10326 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
10329 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
10330 tsubst_flags_t complain
, tree in_decl
)
10332 gcc_assert (ATTR_IS_DEPENDENT (t
));
10334 tree val
= TREE_VALUE (t
);
10335 if (val
== NULL_TREE
)
10336 /* Nothing to do. */;
10337 else if ((flag_openmp
|| flag_openmp_simd
)
10338 && is_attribute_p ("omp declare simd",
10339 get_attribute_name (t
)))
10341 tree clauses
= TREE_VALUE (val
);
10342 clauses
= tsubst_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
, args
,
10343 complain
, in_decl
);
10344 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
10345 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
10346 tree parms
= DECL_ARGUMENTS (*decl_p
);
10348 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
10350 val
= build_tree_list (NULL_TREE
, clauses
);
10354 /* If the first attribute argument is an identifier, don't
10355 pass it through tsubst. Attributes like mode, format,
10356 cleanup and several target specific attributes expect it
10358 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
10361 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
10362 /*integral_constant_expression_p=*/false);
10363 if (chain
!= TREE_CHAIN (val
))
10364 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
10366 else if (PACK_EXPANSION_P (val
))
10368 /* An attribute pack expansion. */
10369 tree purp
= TREE_PURPOSE (t
);
10370 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
10371 if (pack
== error_mark_node
)
10372 return error_mark_node
;
10373 int len
= TREE_VEC_LENGTH (pack
);
10374 tree list
= NULL_TREE
;
10376 for (int i
= 0; i
< len
; ++i
)
10378 tree elt
= TREE_VEC_ELT (pack
, i
);
10379 *q
= build_tree_list (purp
, elt
);
10380 q
= &TREE_CHAIN (*q
);
10385 val
= tsubst_expr (val
, args
, complain
, in_decl
,
10386 /*integral_constant_expression_p=*/false);
10388 if (val
!= TREE_VALUE (t
))
10389 return build_tree_list (TREE_PURPOSE (t
), val
);
10393 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
10394 unchanged or a new TREE_LIST chain. */
10397 tsubst_attributes (tree attributes
, tree args
,
10398 tsubst_flags_t complain
, tree in_decl
)
10400 tree last_dep
= NULL_TREE
;
10402 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
10403 if (ATTR_IS_DEPENDENT (t
))
10406 attributes
= copy_list (attributes
);
10411 for (tree
*p
= &attributes
; *p
; )
10414 if (ATTR_IS_DEPENDENT (t
))
10416 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
10421 p
= &TREE_CHAIN (*p
);
10422 *p
= TREE_CHAIN (t
);
10426 p
= &TREE_CHAIN (*p
);
10432 /* Apply any attributes which had to be deferred until instantiation
10433 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
10434 ARGS, COMPLAIN, IN_DECL are as tsubst. */
10437 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
10438 tree args
, tsubst_flags_t complain
, tree in_decl
)
10440 tree last_dep
= NULL_TREE
;
10444 if (attributes
== NULL_TREE
)
10447 if (DECL_P (*decl_p
))
10449 if (TREE_TYPE (*decl_p
) == error_mark_node
)
10451 p
= &DECL_ATTRIBUTES (*decl_p
);
10452 /* DECL_ATTRIBUTES comes from copy_node in tsubst_decl, and is identical
10453 to our attributes parameter. */
10454 gcc_assert (*p
== attributes
);
10458 p
= &TYPE_ATTRIBUTES (*decl_p
);
10459 /* TYPE_ATTRIBUTES was set up (with abi_tag and may_alias) in
10460 lookup_template_class_1, and should be preserved. */
10461 gcc_assert (*p
!= attributes
);
10463 p
= &TREE_CHAIN (*p
);
10466 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
10467 if (ATTR_IS_DEPENDENT (t
))
10470 attributes
= copy_list (attributes
);
10477 tree late_attrs
= NULL_TREE
;
10478 tree
*q
= &late_attrs
;
10483 if (ATTR_IS_DEPENDENT (t
))
10485 *p
= TREE_CHAIN (t
);
10486 TREE_CHAIN (t
) = NULL_TREE
;
10487 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
10489 q
= &TREE_CHAIN (*q
);
10492 p
= &TREE_CHAIN (t
);
10495 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
10499 /* Perform (or defer) access check for typedefs that were referenced
10500 from within the template TMPL code.
10501 This is a subroutine of instantiate_decl and instantiate_class_template.
10502 TMPL is the template to consider and TARGS is the list of arguments of
10506 perform_typedefs_access_check (tree tmpl
, tree targs
)
10508 location_t saved_location
;
10510 qualified_typedef_usage_t
*iter
;
10513 || (!CLASS_TYPE_P (tmpl
)
10514 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
10517 saved_location
= input_location
;
10518 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
10520 tree type_decl
= iter
->typedef_decl
;
10521 tree type_scope
= iter
->context
;
10523 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
10526 if (uses_template_parms (type_decl
))
10527 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
10528 if (uses_template_parms (type_scope
))
10529 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
10531 /* Make access check error messages point to the location
10532 of the use of the typedef. */
10533 input_location
= iter
->locus
;
10534 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
10535 type_decl
, type_decl
,
10536 tf_warning_or_error
);
10538 input_location
= saved_location
;
10542 instantiate_class_template_1 (tree type
)
10544 tree templ
, args
, pattern
, t
, member
;
10548 unsigned int saved_maximum_field_alignment
;
10551 if (type
== error_mark_node
)
10552 return error_mark_node
;
10554 if (COMPLETE_OR_OPEN_TYPE_P (type
)
10555 || uses_template_parms (type
))
10558 /* Figure out which template is being instantiated. */
10559 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
10560 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
10562 /* Mark the type as in the process of being defined. */
10563 TYPE_BEING_DEFINED (type
) = 1;
10565 /* Determine what specialization of the original template to
10567 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
10568 if (t
== error_mark_node
)
10569 return error_mark_node
;
10572 /* This TYPE is actually an instantiation of a partial
10573 specialization. We replace the innermost set of ARGS with
10574 the arguments appropriate for substitution. For example,
10577 template <class T> struct S {};
10578 template <class T> struct S<T*> {};
10580 and supposing that we are instantiating S<int*>, ARGS will
10581 presently be {int*} -- but we need {int}. */
10582 pattern
= TREE_TYPE (t
);
10583 args
= TREE_PURPOSE (t
);
10587 pattern
= TREE_TYPE (templ
);
10588 args
= CLASSTYPE_TI_ARGS (type
);
10591 /* If the template we're instantiating is incomplete, then clearly
10592 there's nothing we can do. */
10593 if (!COMPLETE_TYPE_P (pattern
))
10595 /* We can try again later. */
10596 TYPE_BEING_DEFINED (type
) = 0;
10600 /* If we've recursively instantiated too many templates, stop. */
10601 if (! push_tinst_level (type
))
10604 /* We may be in the middle of deferred access check. Disable
10606 push_deferring_access_checks (dk_no_deferred
);
10608 int saved_unevaluated_operand
= cp_unevaluated_operand
;
10609 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10611 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
10612 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
10613 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
10614 fn_context
= error_mark_node
;
10616 push_to_top_level ();
10619 cp_unevaluated_operand
= 0;
10620 c_inhibit_evaluation_warnings
= 0;
10622 /* Use #pragma pack from the template context. */
10623 saved_maximum_field_alignment
= maximum_field_alignment
;
10624 maximum_field_alignment
= TYPE_PRECISION (pattern
);
10626 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
10628 /* Set the input location to the most specialized template definition.
10629 This is needed if tsubsting causes an error. */
10630 typedecl
= TYPE_MAIN_DECL (pattern
);
10631 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
10632 DECL_SOURCE_LOCATION (typedecl
);
10634 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
10635 SET_TYPE_ALIGN (type
, TYPE_ALIGN (pattern
));
10636 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
10637 CLASSTYPE_NON_AGGREGATE (type
) = CLASSTYPE_NON_AGGREGATE (pattern
);
10638 if (ANON_AGGR_TYPE_P (pattern
))
10639 SET_ANON_AGGR_TYPE_P (type
);
10640 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
10642 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
10643 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
10644 /* Adjust visibility for template arguments. */
10645 determine_visibility (TYPE_MAIN_DECL (type
));
10647 if (CLASS_TYPE_P (type
))
10648 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
10650 pbinfo
= TYPE_BINFO (pattern
);
10652 /* We should never instantiate a nested class before its enclosing
10653 class; we need to look up the nested class by name before we can
10654 instantiate it, and that lookup should instantiate the enclosing
10656 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
10657 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
10659 base_list
= NULL_TREE
;
10660 if (BINFO_N_BASE_BINFOS (pbinfo
))
10666 /* We must enter the scope containing the type, as that is where
10667 the accessibility of types named in dependent bases are
10669 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
10671 /* Substitute into each of the bases to determine the actual
10673 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
10676 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
10677 tree expanded_bases
= NULL_TREE
;
10680 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
10683 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
10684 args
, tf_error
, NULL_TREE
);
10685 if (expanded_bases
== error_mark_node
)
10688 len
= TREE_VEC_LENGTH (expanded_bases
);
10691 for (idx
= 0; idx
< len
; idx
++)
10693 if (expanded_bases
)
10694 /* Extract the already-expanded base class. */
10695 base
= TREE_VEC_ELT (expanded_bases
, idx
);
10697 /* Substitute to figure out the base class. */
10698 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
10701 if (base
== error_mark_node
)
10704 base_list
= tree_cons (access
, base
, base_list
);
10705 if (BINFO_VIRTUAL_P (pbase_binfo
))
10706 TREE_TYPE (base_list
) = integer_type_node
;
10710 /* The list is now in reverse order; correct that. */
10711 base_list
= nreverse (base_list
);
10714 pop_scope (pushed_scope
);
10716 /* Now call xref_basetypes to set up all the base-class
10718 xref_basetypes (type
, base_list
);
10720 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
10721 (int) ATTR_FLAG_TYPE_IN_PLACE
,
10722 args
, tf_error
, NULL_TREE
);
10723 fixup_attribute_variants (type
);
10725 /* Now that our base classes are set up, enter the scope of the
10726 class, so that name lookups into base classes, etc. will work
10727 correctly. This is precisely analogous to what we do in
10728 begin_class_definition when defining an ordinary non-template
10729 class, except we also need to push the enclosing classes. */
10730 push_nested_class (type
);
10732 /* Now members are processed in the order of declaration. */
10733 for (member
= CLASSTYPE_DECL_LIST (pattern
);
10734 member
; member
= TREE_CHAIN (member
))
10736 tree t
= TREE_VALUE (member
);
10738 if (TREE_PURPOSE (member
))
10742 if (LAMBDA_TYPE_P (t
))
10743 /* A closure type for a lambda in an NSDMI or default argument.
10744 Ignore it; it will be regenerated when needed. */
10747 /* Build new CLASSTYPE_NESTED_UTDS. */
10750 bool class_template_p
;
10752 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
10753 && TYPE_LANG_SPECIFIC (t
)
10754 && CLASSTYPE_IS_TEMPLATE (t
));
10755 /* If the member is a class template, then -- even after
10756 substitution -- there may be dependent types in the
10757 template argument list for the class. We increment
10758 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
10759 that function will assume that no types are dependent
10760 when outside of a template. */
10761 if (class_template_p
)
10762 ++processing_template_decl
;
10763 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
10764 if (class_template_p
)
10765 --processing_template_decl
;
10766 if (newtag
== error_mark_node
)
10769 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
10771 tree name
= TYPE_IDENTIFIER (t
);
10773 if (class_template_p
)
10774 /* Unfortunately, lookup_template_class sets
10775 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
10776 instantiation (i.e., for the type of a member
10777 template class nested within a template class.)
10778 This behavior is required for
10779 maybe_process_partial_specialization to work
10780 correctly, but is not accurate in this case;
10781 the TAG is not an instantiation of anything.
10782 (The corresponding TEMPLATE_DECL is an
10783 instantiation, but the TYPE is not.) */
10784 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
10786 /* Now, we call pushtag to put this NEWTAG into the scope of
10787 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
10788 pushtag calling push_template_decl. We don't have to do
10789 this for enums because it will already have been done in
10792 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
10793 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
10796 else if (DECL_DECLARES_FUNCTION_P (t
))
10800 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10801 ++processing_template_decl
;
10802 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
10803 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10804 --processing_template_decl
;
10805 set_current_access_from_decl (r
);
10806 finish_member_declaration (r
);
10807 /* Instantiate members marked with attribute used. */
10808 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10810 if (TREE_CODE (r
) == FUNCTION_DECL
10811 && DECL_OMP_DECLARE_REDUCTION_P (r
))
10812 cp_check_omp_declare_reduction (r
);
10814 else if ((DECL_CLASS_TEMPLATE_P (t
) || DECL_IMPLICIT_TYPEDEF_P (t
))
10815 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
10816 /* A closure type for a lambda in an NSDMI or default argument.
10817 Ignore it; it will be regenerated when needed. */;
10820 /* Build new TYPE_FIELDS. */
10821 if (TREE_CODE (t
) == STATIC_ASSERT
)
10825 ++c_inhibit_evaluation_warnings
;
10827 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
10828 tf_warning_or_error
, NULL_TREE
,
10829 /*integral_constant_expression_p=*/true);
10830 --c_inhibit_evaluation_warnings
;
10832 finish_static_assert (condition
,
10833 STATIC_ASSERT_MESSAGE (t
),
10834 STATIC_ASSERT_SOURCE_LOCATION (t
),
10835 /*member_p=*/true);
10837 else if (TREE_CODE (t
) != CONST_DECL
)
10840 tree vec
= NULL_TREE
;
10843 /* The file and line for this declaration, to
10844 assist in error message reporting. Since we
10845 called push_tinst_level above, we don't need to
10847 input_location
= DECL_SOURCE_LOCATION (t
);
10849 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10850 ++processing_template_decl
;
10851 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
10852 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10853 --processing_template_decl
;
10855 if (TREE_CODE (r
) == TREE_VEC
)
10857 /* A capture pack became multiple fields. */
10859 len
= TREE_VEC_LENGTH (vec
);
10862 for (int i
= 0; i
< len
; ++i
)
10865 r
= TREE_VEC_ELT (vec
, i
);
10870 [t]he initialization (and any associated
10871 side-effects) of a static data member does
10872 not occur unless the static data member is
10873 itself used in a way that requires the
10874 definition of the static data member to
10877 Therefore, we do not substitute into the
10878 initialized for the static data member here. */
10879 finish_static_data_member_decl
10881 /*init=*/NULL_TREE
,
10882 /*init_const_expr_p=*/false,
10883 /*asmspec_tree=*/NULL_TREE
,
10885 /* Instantiate members marked with attribute used. */
10886 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10889 else if (TREE_CODE (r
) == FIELD_DECL
)
10891 /* Determine whether R has a valid type and can be
10892 completed later. If R is invalid, then its type
10893 is replaced by error_mark_node. */
10894 tree rtype
= TREE_TYPE (r
);
10895 if (can_complete_type_without_circularity (rtype
))
10896 complete_type (rtype
);
10898 if (!complete_or_array_type_p (rtype
))
10900 /* If R's type couldn't be completed and
10901 it isn't a flexible array member (whose
10902 type is incomplete by definition) give
10904 cxx_incomplete_type_error (r
, rtype
);
10905 TREE_TYPE (r
) = error_mark_node
;
10907 else if (TREE_CODE (rtype
) == ARRAY_TYPE
10908 && TYPE_DOMAIN (rtype
) == NULL_TREE
10909 && (TREE_CODE (type
) == UNION_TYPE
10910 || TREE_CODE (type
) == QUAL_UNION_TYPE
))
10912 error ("flexible array member %qD in union", r
);
10913 TREE_TYPE (r
) = error_mark_node
;
10917 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10918 such a thing will already have been added to the field
10919 list by tsubst_enum in finish_member_declaration in the
10920 CLASSTYPE_NESTED_UTDS case above. */
10921 if (!(TREE_CODE (r
) == TYPE_DECL
10922 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10923 && DECL_ARTIFICIAL (r
)))
10925 set_current_access_from_decl (r
);
10926 finish_member_declaration (r
);
10934 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10935 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10937 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10939 tree friend_type
= t
;
10940 bool adjust_processing_template_decl
= false;
10942 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10944 /* template <class T> friend class C; */
10945 friend_type
= tsubst_friend_class (friend_type
, args
);
10946 adjust_processing_template_decl
= true;
10948 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10950 /* template <class T> friend class C::D; */
10951 friend_type
= tsubst (friend_type
, args
,
10952 tf_warning_or_error
, NULL_TREE
);
10953 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10954 friend_type
= TREE_TYPE (friend_type
);
10955 adjust_processing_template_decl
= true;
10957 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10958 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10960 /* This could be either
10964 when dependent_type_p is false or
10966 template <class U> friend class T::C;
10969 /* Bump processing_template_decl in case this is something like
10970 template <class T> friend struct A<T>::B. */
10971 ++processing_template_decl
;
10972 friend_type
= tsubst (friend_type
, args
,
10973 tf_warning_or_error
, NULL_TREE
);
10974 if (dependent_type_p (friend_type
))
10975 adjust_processing_template_decl
= true;
10976 --processing_template_decl
;
10978 else if (TREE_CODE (friend_type
) != BOUND_TEMPLATE_TEMPLATE_PARM
10979 && !CLASSTYPE_USE_TEMPLATE (friend_type
)
10980 && TYPE_HIDDEN_P (friend_type
))
10984 where C hasn't been declared yet. Let's lookup name
10985 from namespace scope directly, bypassing any name that
10986 come from dependent base class. */
10987 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10989 /* The call to xref_tag_from_type does injection for friend
10991 push_nested_namespace (ns
);
10993 xref_tag_from_type (friend_type
, NULL_TREE
,
10994 /*tag_scope=*/ts_current
);
10995 pop_nested_namespace (ns
);
10997 else if (uses_template_parms (friend_type
))
10998 /* friend class C<T>; */
10999 friend_type
= tsubst (friend_type
, args
,
11000 tf_warning_or_error
, NULL_TREE
);
11005 where C is already declared or
11007 friend class C<int>;
11009 We don't have to do anything in these cases. */
11011 if (adjust_processing_template_decl
)
11012 /* Trick make_friend_class into realizing that the friend
11013 we're adding is a template, not an ordinary class. It's
11014 important that we use make_friend_class since it will
11015 perform some error-checking and output cross-reference
11017 ++processing_template_decl
;
11019 if (friend_type
!= error_mark_node
)
11020 make_friend_class (type
, friend_type
, /*complain=*/false);
11022 if (adjust_processing_template_decl
)
11023 --processing_template_decl
;
11027 /* Build new DECL_FRIENDLIST. */
11030 /* The file and line for this declaration, to
11031 assist in error message reporting. Since we
11032 called push_tinst_level above, we don't need to
11034 input_location
= DECL_SOURCE_LOCATION (t
);
11036 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11038 ++processing_template_decl
;
11039 push_deferring_access_checks (dk_no_check
);
11042 r
= tsubst_friend_function (t
, args
);
11043 add_friend (type
, r
, /*complain=*/false);
11044 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11046 pop_deferring_access_checks ();
11047 --processing_template_decl
;
11055 /* Restore these before substituting into the lambda capture
11057 cp_unevaluated_operand
= saved_unevaluated_operand
;
11058 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11061 /* Set the file and line number information to whatever is given for
11062 the class itself. This puts error messages involving generated
11063 implicit functions at a predictable point, and the same point
11064 that would be used for non-template classes. */
11065 input_location
= DECL_SOURCE_LOCATION (typedecl
);
11067 unreverse_member_declarations (type
);
11068 finish_struct_1 (type
);
11069 TYPE_BEING_DEFINED (type
) = 0;
11071 /* We don't instantiate default arguments for member functions. 14.7.1:
11073 The implicit instantiation of a class template specialization causes
11074 the implicit instantiation of the declarations, but not of the
11075 definitions or default arguments, of the class member functions,
11076 member classes, static data members and member templates.... */
11078 /* Some typedefs referenced from within the template code need to be access
11079 checked at template instantiation time, i.e now. These types were
11080 added to the template at parsing time. Let's get those and perform
11081 the access checks then. */
11082 perform_typedefs_access_check (pattern
, args
);
11083 perform_deferred_access_checks (tf_warning_or_error
);
11084 pop_nested_class ();
11085 maximum_field_alignment
= saved_maximum_field_alignment
;
11087 pop_from_top_level ();
11088 pop_deferring_access_checks ();
11089 pop_tinst_level ();
11091 /* The vtable for a template class can be emitted in any translation
11092 unit in which the class is instantiated. When there is no key
11093 method, however, finish_struct_1 will already have added TYPE to
11094 the keyed_classes. */
11095 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
11096 vec_safe_push (keyed_classes
, type
);
11101 /* Wrapper for instantiate_class_template_1. */
11104 instantiate_class_template (tree type
)
11107 timevar_push (TV_TEMPLATE_INST
);
11108 ret
= instantiate_class_template_1 (type
);
11109 timevar_pop (TV_TEMPLATE_INST
);
11114 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11120 else if (TYPE_P (t
))
11121 r
= tsubst (t
, args
, complain
, in_decl
);
11124 if (!(complain
& tf_warning
))
11125 ++c_inhibit_evaluation_warnings
;
11126 r
= tsubst_expr (t
, args
, complain
, in_decl
,
11127 /*integral_constant_expression_p=*/true);
11128 if (!(complain
& tf_warning
))
11129 --c_inhibit_evaluation_warnings
;
11134 /* Given a function parameter pack TMPL_PARM and some function parameters
11135 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
11136 and set *SPEC_P to point at the next point in the list. */
11139 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
11141 /* Collect all of the extra "packed" parameters into an
11144 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
11145 tree spec_parm
= *spec_p
;
11148 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
11150 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
11153 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
11154 parmvec
= make_tree_vec (len
);
11155 spec_parm
= *spec_p
;
11156 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
11158 tree elt
= spec_parm
;
11159 if (DECL_PACK_P (elt
))
11160 elt
= make_pack_expansion (elt
);
11161 TREE_VEC_ELT (parmvec
, i
) = elt
;
11164 /* Build the argument packs. */
11165 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
11166 *spec_p
= spec_parm
;
11171 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
11172 NONTYPE_ARGUMENT_PACK. */
11175 make_fnparm_pack (tree spec_parm
)
11177 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
11180 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
11181 pack expansion with no extra args, 2 if it has extra args, or 0
11182 if it is not a pack expansion. */
11185 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
11187 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
11188 if (i
>= TREE_VEC_LENGTH (vec
))
11190 tree elt
= TREE_VEC_ELT (vec
, i
);
11192 /* A decl pack is itself an expansion. */
11193 elt
= TREE_TYPE (elt
);
11194 if (!PACK_EXPANSION_P (elt
))
11196 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
11202 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
11205 make_argument_pack_select (tree arg_pack
, unsigned index
)
11207 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
11209 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
11210 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
11215 /* This is a subroutine of tsubst_pack_expansion.
11217 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
11218 mechanism to store the (non complete list of) arguments of the
11219 substitution and return a non substituted pack expansion, in order
11220 to wait for when we have enough arguments to really perform the
11224 use_pack_expansion_extra_args_p (tree parm_packs
,
11226 bool has_empty_arg
)
11228 /* If one pack has an expansion and another pack has a normal
11229 argument or if one pack has an empty argument and an another
11230 one hasn't then tsubst_pack_expansion cannot perform the
11231 substitution and need to fall back on the
11232 PACK_EXPANSION_EXTRA mechanism. */
11233 if (parm_packs
== NULL_TREE
)
11235 else if (has_empty_arg
)
11238 bool has_expansion_arg
= false;
11239 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
11241 bool has_non_expansion_arg
= false;
11242 for (tree parm_pack
= parm_packs
;
11244 parm_pack
= TREE_CHAIN (parm_pack
))
11246 tree arg
= TREE_VALUE (parm_pack
);
11248 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
11250 /* We can't substitute a pack expansion with extra args into
11254 has_expansion_arg
= true;
11256 has_non_expansion_arg
= true;
11259 if (has_expansion_arg
&& has_non_expansion_arg
)
11265 /* [temp.variadic]/6 says that:
11267 The instantiation of a pack expansion [...]
11268 produces a list E1,E2, ..., En, where N is the number of elements
11269 in the pack expansion parameters.
11271 This subroutine of tsubst_pack_expansion produces one of these Ei.
11273 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
11274 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
11275 PATTERN, and each TREE_VALUE is its corresponding argument pack.
11276 INDEX is the index 'i' of the element Ei to produce. ARGS,
11277 COMPLAIN, and IN_DECL are the same parameters as for the
11278 tsubst_pack_expansion function.
11280 The function returns the resulting Ei upon successful completion,
11281 or error_mark_node.
11283 Note that this function possibly modifies the ARGS parameter, so
11284 it's the responsibility of the caller to restore it. */
11287 gen_elem_of_pack_expansion_instantiation (tree pattern
,
11290 tree args
/* This parm gets
11292 tsubst_flags_t complain
,
11296 bool ith_elem_is_expansion
= false;
11298 /* For each parameter pack, change the substitution of the parameter
11299 pack to the ith argument in its argument pack, then expand the
11301 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
11303 tree parm
= TREE_PURPOSE (pack
);
11304 tree arg_pack
= TREE_VALUE (pack
);
11305 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
11307 ith_elem_is_expansion
|=
11308 argument_pack_element_is_expansion_p (arg_pack
, index
);
11310 /* Select the Ith argument from the pack. */
11311 if (TREE_CODE (parm
) == PARM_DECL
11313 || TREE_CODE (parm
) == FIELD_DECL
)
11317 aps
= make_argument_pack_select (arg_pack
, index
);
11318 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
11319 return error_mark_node
;
11320 register_local_specialization (aps
, parm
);
11323 aps
= retrieve_local_specialization (parm
);
11328 template_parm_level_and_index (parm
, &level
, &idx
);
11332 aps
= make_argument_pack_select (arg_pack
, index
);
11333 /* Update the corresponding argument. */
11334 TMPL_ARG (args
, level
, idx
) = aps
;
11337 /* Re-use the ARGUMENT_PACK_SELECT. */
11338 aps
= TMPL_ARG (args
, level
, idx
);
11340 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
11343 /* Substitute into the PATTERN with the (possibly altered)
11345 if (pattern
== in_decl
)
11346 /* Expanding a fixed parameter pack from
11347 coerce_template_parameter_pack. */
11348 t
= tsubst_decl (pattern
, args
, complain
);
11349 else if (pattern
== error_mark_node
)
11350 t
= error_mark_node
;
11351 else if (constraint_p (pattern
))
11353 if (processing_template_decl
)
11354 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
11356 t
= (constraints_satisfied_p (pattern
, args
)
11357 ? boolean_true_node
: boolean_false_node
);
11359 else if (!TYPE_P (pattern
))
11360 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11361 /*integral_constant_expression_p=*/false);
11363 t
= tsubst (pattern
, args
, complain
, in_decl
);
11365 /* If the Ith argument pack element is a pack expansion, then
11366 the Ith element resulting from the substituting is going to
11367 be a pack expansion as well. */
11368 if (ith_elem_is_expansion
)
11369 t
= make_pack_expansion (t
, complain
);
11374 /* When the unexpanded parameter pack in a fold expression expands to an empty
11375 sequence, the value of the expression is as follows; the program is
11376 ill-formed if the operator is not listed in this table.
11383 expand_empty_fold (tree t
, tsubst_flags_t complain
)
11385 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
11386 if (!FOLD_EXPR_MODIFY_P (t
))
11389 case TRUTH_ANDIF_EXPR
:
11390 return boolean_true_node
;
11391 case TRUTH_ORIF_EXPR
:
11392 return boolean_false_node
;
11393 case COMPOUND_EXPR
:
11399 if (complain
& tf_error
)
11400 error_at (location_of (t
),
11401 "fold of empty expansion over %O", code
);
11402 return error_mark_node
;
11405 /* Given a fold-expression T and a current LEFT and RIGHT operand,
11406 form an expression that combines the two terms using the
11410 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
11412 tree op
= FOLD_EXPR_OP (t
);
11413 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
11415 // Handle compound assignment operators.
11416 if (FOLD_EXPR_MODIFY_P (t
))
11417 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
11421 case COMPOUND_EXPR
:
11422 return build_x_compound_expr (input_location
, left
, right
, complain
);
11424 return build_m_component_ref (left
, right
, complain
);
11426 return build_x_binary_op (input_location
, code
,
11427 left
, TREE_CODE (left
),
11428 right
, TREE_CODE (right
),
11434 /* Substitute ARGS into the pack of a fold expression T. */
11437 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11439 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
11442 /* Substitute ARGS into the pack of a fold expression T. */
11445 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11447 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
11450 /* Expand a PACK of arguments into a grouped as left fold.
11451 Given a pack containing elements A0, A1, ..., An and an
11452 operator @, this builds the expression:
11454 ((A0 @ A1) @ A2) ... @ An
11456 Note that PACK must not be empty.
11458 The operator is defined by the original fold expression T. */
11461 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
11463 tree left
= TREE_VEC_ELT (pack
, 0);
11464 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
11466 tree right
= TREE_VEC_ELT (pack
, i
);
11467 left
= fold_expression (t
, left
, right
, complain
);
11472 /* Substitute into a unary left fold expression. */
11475 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
11478 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11479 if (pack
== error_mark_node
)
11480 return error_mark_node
;
11481 if (PACK_EXPANSION_P (pack
))
11483 tree r
= copy_node (t
);
11484 FOLD_EXPR_PACK (r
) = pack
;
11487 if (TREE_VEC_LENGTH (pack
) == 0)
11488 return expand_empty_fold (t
, complain
);
11490 return expand_left_fold (t
, pack
, complain
);
11493 /* Substitute into a binary left fold expression.
11495 Do ths by building a single (non-empty) vector of argumnts and
11496 building the expression from those elements. */
11499 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
11502 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11503 if (pack
== error_mark_node
)
11504 return error_mark_node
;
11505 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
11506 if (init
== error_mark_node
)
11507 return error_mark_node
;
11509 if (PACK_EXPANSION_P (pack
))
11511 tree r
= copy_node (t
);
11512 FOLD_EXPR_PACK (r
) = pack
;
11513 FOLD_EXPR_INIT (r
) = init
;
11517 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
11518 TREE_VEC_ELT (vec
, 0) = init
;
11519 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
11520 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
11522 return expand_left_fold (t
, vec
, complain
);
11525 /* Expand a PACK of arguments into a grouped as right fold.
11526 Given a pack containing elementns A0, A1, ..., and an
11527 operator @, this builds the expression:
11529 A0@ ... (An-2 @ (An-1 @ An))
11531 Note that PACK must not be empty.
11533 The operator is defined by the original fold expression T. */
11536 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
11538 // Build the expression.
11539 int n
= TREE_VEC_LENGTH (pack
);
11540 tree right
= TREE_VEC_ELT (pack
, n
- 1);
11541 for (--n
; n
!= 0; --n
)
11543 tree left
= TREE_VEC_ELT (pack
, n
- 1);
11544 right
= fold_expression (t
, left
, right
, complain
);
11549 /* Substitute into a unary right fold expression. */
11552 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
11555 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11556 if (pack
== error_mark_node
)
11557 return error_mark_node
;
11558 if (PACK_EXPANSION_P (pack
))
11560 tree r
= copy_node (t
);
11561 FOLD_EXPR_PACK (r
) = pack
;
11564 if (TREE_VEC_LENGTH (pack
) == 0)
11565 return expand_empty_fold (t
, complain
);
11567 return expand_right_fold (t
, pack
, complain
);
11570 /* Substitute into a binary right fold expression.
11572 Do ths by building a single (non-empty) vector of arguments and
11573 building the expression from those elements. */
11576 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
11579 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11580 if (pack
== error_mark_node
)
11581 return error_mark_node
;
11582 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
11583 if (init
== error_mark_node
)
11584 return error_mark_node
;
11586 if (PACK_EXPANSION_P (pack
))
11588 tree r
= copy_node (t
);
11589 FOLD_EXPR_PACK (r
) = pack
;
11590 FOLD_EXPR_INIT (r
) = init
;
11594 int n
= TREE_VEC_LENGTH (pack
);
11595 tree vec
= make_tree_vec (n
+ 1);
11596 for (int i
= 0; i
< n
; ++i
)
11597 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
11598 TREE_VEC_ELT (vec
, n
) = init
;
11600 return expand_right_fold (t
, vec
, complain
);
11603 /* Walk through the pattern of a pack expansion, adding everything in
11604 local_specializations to a list. */
11608 hash_set
<tree
> internal
;
11610 tsubst_flags_t complain
;
11612 el_data (tsubst_flags_t c
)
11613 : extra (NULL_TREE
), complain (c
) {}
11616 extract_locals_r (tree
*tp
, int */
*walk_subtrees*/
, void *data_
)
11618 el_data
&data
= *reinterpret_cast<el_data
*>(data_
);
11619 tree
*extra
= &data
.extra
;
11620 tsubst_flags_t complain
= data
.complain
;
11622 if (TYPE_P (*tp
) && typedef_variant_p (*tp
))
11623 /* Remember local typedefs (85214). */
11624 tp
= &TYPE_NAME (*tp
);
11626 if (TREE_CODE (*tp
) == DECL_EXPR
)
11627 data
.internal
.add (DECL_EXPR_DECL (*tp
));
11628 else if (tree spec
= retrieve_local_specialization (*tp
))
11630 if (data
.internal
.contains (*tp
))
11631 /* Don't mess with variables declared within the pattern. */
11633 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
11635 /* Maybe pull out the PARM_DECL for a partial instantiation. */
11636 tree args
= ARGUMENT_PACK_ARGS (spec
);
11637 if (TREE_VEC_LENGTH (args
) == 1)
11639 tree elt
= TREE_VEC_ELT (args
, 0);
11640 if (PACK_EXPANSION_P (elt
))
11641 elt
= PACK_EXPANSION_PATTERN (elt
);
11642 if (DECL_PACK_P (elt
))
11645 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
11647 /* Handle lambda capture here, since we aren't doing any
11648 substitution now, and so tsubst_copy won't call
11649 process_outer_var_ref. */
11650 tree args
= ARGUMENT_PACK_ARGS (spec
);
11651 int len
= TREE_VEC_LENGTH (args
);
11652 for (int i
= 0; i
< len
; ++i
)
11654 tree arg
= TREE_VEC_ELT (args
, i
);
11656 if (outer_automatic_var_p (arg
))
11657 carg
= process_outer_var_ref (arg
, complain
);
11660 /* Make a new NONTYPE_ARGUMENT_PACK of the capture
11664 spec
= copy_node (spec
);
11665 args
= copy_node (args
);
11666 SET_ARGUMENT_PACK_ARGS (spec
, args
);
11667 register_local_specialization (spec
, *tp
);
11669 TREE_VEC_ELT (args
, i
) = carg
;
11674 if (outer_automatic_var_p (spec
))
11675 spec
= process_outer_var_ref (spec
, complain
);
11676 *extra
= tree_cons (*tp
, spec
, *extra
);
11681 extract_local_specs (tree pattern
, tsubst_flags_t complain
)
11683 el_data
data (complain
);
11684 cp_walk_tree_without_duplicates (&pattern
, extract_locals_r
, &data
);
11688 /* Extract any uses of local_specializations from PATTERN and add them to ARGS
11689 for use in PACK_EXPANSION_EXTRA_ARGS. */
11692 build_extra_args (tree pattern
, tree args
, tsubst_flags_t complain
)
11695 if (local_specializations
)
11696 if (tree locals
= extract_local_specs (pattern
, complain
))
11697 extra
= tree_cons (NULL_TREE
, extra
, locals
);
11701 /* Apply any local specializations from PACK_EXPANSION_EXTRA_ARGS and add the
11702 normal template args to ARGS. */
11705 add_extra_args (tree extra
, tree args
)
11707 if (extra
&& TREE_CODE (extra
) == TREE_LIST
)
11709 for (tree elt
= TREE_CHAIN (extra
); elt
; elt
= TREE_CHAIN (elt
))
11711 /* The partial instantiation involved local declarations collected in
11712 extract_local_specs; map from the general template to our local
11714 tree gen
= TREE_PURPOSE (elt
);
11715 tree inst
= TREE_VALUE (elt
);
11717 if (tree local
= retrieve_local_specialization (inst
))
11719 /* else inst is already a full instantiation of the pack. */
11720 register_local_specialization (inst
, gen
);
11722 gcc_assert (!TREE_PURPOSE (extra
));
11723 extra
= TREE_VALUE (extra
);
11725 return add_to_template_args (extra
, args
);
11728 /* Substitute ARGS into T, which is an pack expansion
11729 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
11730 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
11731 (if only a partial substitution could be performed) or
11732 ERROR_MARK_NODE if there was an error. */
11734 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
11738 tree pack
, packs
= NULL_TREE
;
11739 bool unsubstituted_packs
= false;
11740 bool unsubstituted_fn_pack
= false;
11743 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
11744 bool need_local_specializations
= false;
11747 gcc_assert (PACK_EXPANSION_P (t
));
11748 pattern
= PACK_EXPANSION_PATTERN (t
);
11750 /* Add in any args remembered from an earlier partial instantiation. */
11751 args
= add_extra_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
11753 levels
= TMPL_ARGS_DEPTH (args
);
11755 /* Determine the argument packs that will instantiate the parameter
11756 packs used in the expansion expression. While we're at it,
11757 compute the number of arguments to be expanded and make sure it
11759 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
11760 pack
= TREE_CHAIN (pack
))
11762 tree parm_pack
= TREE_VALUE (pack
);
11763 tree arg_pack
= NULL_TREE
;
11764 tree orig_arg
= NULL_TREE
;
11767 if (TREE_CODE (parm_pack
) == BASES
)
11769 gcc_assert (parm_pack
== pattern
);
11770 if (BASES_DIRECT (parm_pack
))
11771 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
11776 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
11777 args
, complain
, in_decl
,
11780 else if (builtin_pack_call_p (parm_pack
))
11782 /* ??? Support use in other patterns. */
11783 gcc_assert (parm_pack
== pattern
);
11784 return expand_builtin_pack_call (parm_pack
, args
,
11785 complain
, in_decl
);
11787 else if (TREE_CODE (parm_pack
) == PARM_DECL
)
11789 /* We know we have correct local_specializations if this
11790 expansion is at function scope, or if we're dealing with a
11791 local parameter in a requires expression; for the latter,
11792 tsubst_requires_expr set it up appropriately. */
11793 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
11794 arg_pack
= retrieve_local_specialization (parm_pack
);
11796 /* We can't rely on local_specializations for a parameter
11797 name used later in a function declaration (such as in a
11798 late-specified return type). Even if it exists, it might
11799 have the wrong value for a recursive call. */
11800 need_local_specializations
= true;
11804 /* This parameter pack was used in an unevaluated context. Just
11805 make a dummy decl, since it's only used for its type. */
11806 ++cp_unevaluated_operand
;
11807 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
11808 --cp_unevaluated_operand
;
11809 if (arg_pack
&& DECL_PACK_P (arg_pack
))
11810 /* Partial instantiation of the parm_pack, we can't build
11811 up an argument pack yet. */
11812 arg_pack
= NULL_TREE
;
11814 arg_pack
= make_fnparm_pack (arg_pack
);
11816 else if (argument_pack_element_is_expansion_p (arg_pack
, 0))
11817 /* This argument pack isn't fully instantiated yet. We set this
11818 flag rather than clear arg_pack because we do want to do the
11819 optimization below, and we don't want to substitute directly
11820 into the pattern (as that would expose a NONTYPE_ARGUMENT_PACK
11821 where it isn't expected). */
11822 unsubstituted_fn_pack
= true;
11824 else if (is_normal_capture_proxy (parm_pack
))
11826 arg_pack
= retrieve_local_specialization (parm_pack
);
11827 if (argument_pack_element_is_expansion_p (arg_pack
, 0))
11828 unsubstituted_fn_pack
= true;
11833 template_parm_level_and_index (parm_pack
, &level
, &idx
);
11835 if (level
<= levels
)
11836 arg_pack
= TMPL_ARG (args
, level
, idx
);
11839 orig_arg
= arg_pack
;
11840 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
11841 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
11843 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
11844 /* This can only happen if we forget to expand an argument
11845 pack somewhere else. Just return an error, silently. */
11847 result
= make_tree_vec (1);
11848 TREE_VEC_ELT (result
, 0) = error_mark_node
;
11855 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
11857 /* Don't bother trying to do a partial substitution with
11858 incomplete packs; we'll try again after deduction. */
11859 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
11864 else if (len
!= my_len
11865 && !unsubstituted_fn_pack
)
11867 if (!(complain
& tf_error
))
11868 /* Fail quietly. */;
11869 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
11870 error ("mismatched argument pack lengths while expanding %qT",
11873 error ("mismatched argument pack lengths while expanding %qE",
11875 return error_mark_node
;
11878 /* Keep track of the parameter packs and their corresponding
11880 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
11881 TREE_TYPE (packs
) = orig_arg
;
11885 /* We can't substitute for this parameter pack. We use a flag as
11886 well as the missing_level counter because function parameter
11887 packs don't have a level. */
11888 gcc_assert (processing_template_decl
|| is_auto (parm_pack
));
11889 unsubstituted_packs
= true;
11893 /* If the expansion is just T..., return the matching argument pack, unless
11894 we need to call convert_from_reference on all the elements. This is an
11895 important optimization; see c++/68422. */
11896 if (!unsubstituted_packs
11897 && TREE_PURPOSE (packs
) == pattern
)
11899 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
11901 /* If the argument pack is a single pack expansion, pull it out. */
11902 if (TREE_VEC_LENGTH (args
) == 1
11903 && pack_expansion_args_count (args
))
11904 return TREE_VEC_ELT (args
, 0);
11906 /* Types need no adjustment, nor does sizeof..., and if we still have
11907 some pack expansion args we won't do anything yet. */
11908 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
11909 || PACK_EXPANSION_SIZEOF_P (t
)
11910 || pack_expansion_args_count (args
))
11912 /* Also optimize expression pack expansions if we can tell that the
11913 elements won't have reference type. */
11914 tree type
= TREE_TYPE (pattern
);
11915 if (type
&& TREE_CODE (type
) != REFERENCE_TYPE
11916 && !PACK_EXPANSION_P (type
)
11917 && !WILDCARD_TYPE_P (type
))
11919 /* Otherwise use the normal path so we get convert_from_reference. */
11922 /* We cannot expand this expansion expression, because we don't have
11923 all of the argument packs we need. */
11924 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
11926 /* We got some full packs, but we can't substitute them in until we
11927 have values for all the packs. So remember these until then. */
11929 t
= make_pack_expansion (pattern
, complain
);
11930 PACK_EXPANSION_EXTRA_ARGS (t
)
11931 = build_extra_args (pattern
, args
, complain
);
11934 else if (unsubstituted_packs
)
11936 /* There were no real arguments, we're just replacing a parameter
11937 pack with another version of itself. Substitute into the
11938 pattern and return a PACK_EXPANSION_*. The caller will need to
11940 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
11941 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11942 /*integral_constant_expression_p=*/false);
11944 t
= tsubst (pattern
, args
, complain
, in_decl
);
11945 t
= make_pack_expansion (t
, complain
);
11949 gcc_assert (len
>= 0);
11951 if (need_local_specializations
)
11953 /* We're in a late-specified return type, so create our own local
11954 specializations map; the current map is either NULL or (in the
11955 case of recursive unification) might have bindings that we don't
11956 want to use or alter. */
11957 saved_local_specializations
= local_specializations
;
11958 local_specializations
= new hash_map
<tree
, tree
>;
11961 /* For each argument in each argument pack, substitute into the
11963 result
= make_tree_vec (len
);
11964 tree elem_args
= copy_template_args (args
);
11965 for (i
= 0; i
< len
; ++i
)
11967 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
11969 elem_args
, complain
,
11971 TREE_VEC_ELT (result
, i
) = t
;
11972 if (t
== error_mark_node
)
11974 result
= error_mark_node
;
11979 /* Update ARGS to restore the substitution from parameter packs to
11980 their argument packs. */
11981 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
11983 tree parm
= TREE_PURPOSE (pack
);
11985 if (TREE_CODE (parm
) == PARM_DECL
11987 || TREE_CODE (parm
) == FIELD_DECL
)
11988 register_local_specialization (TREE_TYPE (pack
), parm
);
11993 if (TREE_VALUE (pack
) == NULL_TREE
)
11996 template_parm_level_and_index (parm
, &level
, &idx
);
11998 /* Update the corresponding argument. */
11999 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
12000 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
12003 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
12007 if (need_local_specializations
)
12009 delete local_specializations
;
12010 local_specializations
= saved_local_specializations
;
12013 /* If the dependent pack arguments were such that we end up with only a
12014 single pack expansion again, there's no need to keep it in a TREE_VEC. */
12015 if (len
== 1 && TREE_CODE (result
) == TREE_VEC
12016 && PACK_EXPANSION_P (TREE_VEC_ELT (result
, 0)))
12017 return TREE_VEC_ELT (result
, 0);
12022 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
12023 TMPL. We do this using DECL_PARM_INDEX, which should work even with
12024 parameter packs; all parms generated from a function parameter pack will
12025 have the same DECL_PARM_INDEX. */
12028 get_pattern_parm (tree parm
, tree tmpl
)
12030 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
12033 if (DECL_ARTIFICIAL (parm
))
12035 for (patparm
= DECL_ARGUMENTS (pattern
);
12036 patparm
; patparm
= DECL_CHAIN (patparm
))
12037 if (DECL_ARTIFICIAL (patparm
)
12038 && DECL_NAME (parm
) == DECL_NAME (patparm
))
12043 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
12044 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
12045 gcc_assert (DECL_PARM_INDEX (patparm
)
12046 == DECL_PARM_INDEX (parm
));
12052 /* Make an argument pack out of the TREE_VEC VEC. */
12055 make_argument_pack (tree vec
)
12058 tree elt
= TREE_VEC_ELT (vec
, 0);
12060 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12063 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12064 TREE_CONSTANT (pack
) = 1;
12066 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12070 /* Return an exact copy of template args T that can be modified
12074 copy_template_args (tree t
)
12076 if (t
== error_mark_node
)
12079 int len
= TREE_VEC_LENGTH (t
);
12080 tree new_vec
= make_tree_vec (len
);
12082 for (int i
= 0; i
< len
; ++i
)
12084 tree elt
= TREE_VEC_ELT (t
, i
);
12085 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
12086 elt
= copy_template_args (elt
);
12087 TREE_VEC_ELT (new_vec
, i
) = elt
;
12090 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
12091 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
12096 /* Substitute ARGS into the vector or list of template arguments T. */
12099 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12102 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
12105 if (t
== error_mark_node
)
12106 return error_mark_node
;
12108 len
= TREE_VEC_LENGTH (t
);
12109 elts
= XALLOCAVEC (tree
, len
);
12111 for (i
= 0; i
< len
; i
++)
12113 tree orig_arg
= TREE_VEC_ELT (t
, i
);
12116 if (TREE_CODE (orig_arg
) == TREE_VEC
)
12117 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
12118 else if (PACK_EXPANSION_P (orig_arg
))
12120 /* Substitute into an expansion expression. */
12121 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
12123 if (TREE_CODE (new_arg
) == TREE_VEC
)
12124 /* Add to the expanded length adjustment the number of
12125 expanded arguments. We subtract one from this
12126 measurement, because the argument pack expression
12127 itself is already counted as 1 in
12128 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
12129 the argument pack is empty. */
12130 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
12132 else if (ARGUMENT_PACK_P (orig_arg
))
12134 /* Substitute into each of the arguments. */
12135 new_arg
= TYPE_P (orig_arg
)
12136 ? cxx_make_type (TREE_CODE (orig_arg
))
12137 : make_node (TREE_CODE (orig_arg
));
12139 tree pack_args
= tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
12140 args
, complain
, in_decl
);
12141 if (pack_args
== error_mark_node
)
12142 new_arg
= error_mark_node
;
12144 SET_ARGUMENT_PACK_ARGS (new_arg
, pack_args
);
12146 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
)
12147 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
12150 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
12152 if (new_arg
== error_mark_node
)
12153 return error_mark_node
;
12156 if (new_arg
!= orig_arg
)
12163 /* Make space for the expanded arguments coming from template
12165 t
= make_tree_vec (len
+ expanded_len_adjust
);
12166 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
12167 arguments for a member template.
12168 In that case each TREE_VEC in ORIG_T represents a level of template
12169 arguments, and ORIG_T won't carry any non defaulted argument count.
12170 It will rather be the nested TREE_VECs that will carry one.
12171 In other words, ORIG_T carries a non defaulted argument count only
12172 if it doesn't contain any nested TREE_VEC. */
12173 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
12175 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
12176 count
+= expanded_len_adjust
;
12177 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
12179 for (i
= 0, out
= 0; i
< len
; i
++)
12181 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
12182 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
12183 && TREE_CODE (elts
[i
]) == TREE_VEC
)
12187 /* Now expand the template argument pack "in place". */
12188 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
12189 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
12193 TREE_VEC_ELT (t
, out
) = elts
[i
];
12201 /* Substitute ARGS into one level PARMS of template parameters. */
12204 tsubst_template_parms_level (tree parms
, tree args
, tsubst_flags_t complain
)
12206 if (parms
== error_mark_node
)
12207 return error_mark_node
;
12209 tree new_vec
= make_tree_vec (TREE_VEC_LENGTH (parms
));
12211 for (int i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
12213 tree tuple
= TREE_VEC_ELT (parms
, i
);
12215 if (tuple
== error_mark_node
)
12218 TREE_VEC_ELT (new_vec
, i
) =
12219 tsubst_template_parm (tuple
, args
, complain
);
12225 /* Return the result of substituting ARGS into the template parameters
12226 given by PARMS. If there are m levels of ARGS and m + n levels of
12227 PARMS, then the result will contain n levels of PARMS. For
12228 example, if PARMS is `template <class T> template <class U>
12229 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
12230 result will be `template <int*, double, class V>'. */
12233 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
12235 tree r
= NULL_TREE
;
12238 /* When substituting into a template, we must set
12239 PROCESSING_TEMPLATE_DECL as the template parameters may be
12240 dependent if they are based on one-another, and the dependency
12241 predicates are short-circuit outside of templates. */
12242 ++processing_template_decl
;
12244 for (new_parms
= &r
;
12245 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
12246 new_parms
= &(TREE_CHAIN (*new_parms
)),
12247 parms
= TREE_CHAIN (parms
))
12249 tree new_vec
= tsubst_template_parms_level (TREE_VALUE (parms
),
12252 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
12253 - TMPL_ARGS_DEPTH (args
)),
12254 new_vec
, NULL_TREE
);
12257 --processing_template_decl
;
12262 /* Return the result of substituting ARGS into one template parameter
12263 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
12264 parameter and which TREE_PURPOSE is the default argument of the
12265 template parameter. */
12268 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
12270 tree default_value
, parm_decl
;
12272 if (args
== NULL_TREE
12274 || t
== error_mark_node
)
12277 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
12279 default_value
= TREE_PURPOSE (t
);
12280 parm_decl
= TREE_VALUE (t
);
12282 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
12283 if (TREE_CODE (parm_decl
) == PARM_DECL
12284 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
12285 parm_decl
= error_mark_node
;
12286 default_value
= tsubst_template_arg (default_value
, args
,
12287 complain
, NULL_TREE
);
12289 return build_tree_list (default_value
, parm_decl
);
12292 /* Substitute the ARGS into the indicated aggregate (or enumeration)
12293 type T. If T is not an aggregate or enumeration type, it is
12294 handled as if by tsubst. IN_DECL is as for tsubst. If
12295 ENTERING_SCOPE is nonzero, T is the context for a template which
12296 we are presently tsubst'ing. Return the substituted value. */
12299 tsubst_aggr_type (tree t
,
12301 tsubst_flags_t complain
,
12303 int entering_scope
)
12305 if (t
== NULL_TREE
)
12308 switch (TREE_CODE (t
))
12311 if (TYPE_PTRMEMFUNC_P (t
))
12312 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
12314 /* Fall through. */
12315 case ENUMERAL_TYPE
:
12317 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
12322 int saved_unevaluated_operand
;
12323 int saved_inhibit_evaluation_warnings
;
12325 /* In "sizeof(X<I>)" we need to evaluate "I". */
12326 saved_unevaluated_operand
= cp_unevaluated_operand
;
12327 cp_unevaluated_operand
= 0;
12328 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
12329 c_inhibit_evaluation_warnings
= 0;
12331 /* First, determine the context for the type we are looking
12333 context
= TYPE_CONTEXT (t
);
12334 if (context
&& TYPE_P (context
))
12336 context
= tsubst_aggr_type (context
, args
, complain
,
12337 in_decl
, /*entering_scope=*/1);
12338 /* If context is a nested class inside a class template,
12339 it may still need to be instantiated (c++/33959). */
12340 context
= complete_type (context
);
12343 /* Then, figure out what arguments are appropriate for the
12344 type we are trying to find. For example, given:
12346 template <class T> struct S;
12347 template <class T, class U> void f(T, U) { S<U> su; }
12349 and supposing that we are instantiating f<int, double>,
12350 then our ARGS will be {int, double}, but, when looking up
12351 S we only want {double}. */
12352 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
12353 complain
, in_decl
);
12354 if (argvec
== error_mark_node
)
12355 r
= error_mark_node
;
12358 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
12359 entering_scope
, complain
);
12360 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12363 cp_unevaluated_operand
= saved_unevaluated_operand
;
12364 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
12369 /* This is not a template type, so there's nothing to do. */
12373 return tsubst (t
, args
, complain
, in_decl
);
12377 static GTY((cache
)) tree_cache_map
*defarg_inst
;
12379 /* Substitute into the default argument ARG (a default argument for
12380 FN), which has the indicated TYPE. */
12383 tsubst_default_argument (tree fn
, int parmnum
, tree type
, tree arg
,
12384 tsubst_flags_t complain
)
12386 tree saved_class_ptr
= NULL_TREE
;
12387 tree saved_class_ref
= NULL_TREE
;
12388 int errs
= errorcount
+ sorrycount
;
12390 /* This can happen in invalid code. */
12391 if (TREE_CODE (arg
) == DEFAULT_ARG
)
12394 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
12395 parm
= chain_index (parmnum
, parm
);
12396 tree parmtype
= TREE_TYPE (parm
);
12397 if (DECL_BY_REFERENCE (parm
))
12398 parmtype
= TREE_TYPE (parmtype
);
12399 if (parmtype
== error_mark_node
)
12400 return error_mark_node
;
12402 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, parmtype
));
12405 if (defarg_inst
&& (slot
= defarg_inst
->get (parm
)))
12408 /* This default argument came from a template. Instantiate the
12409 default argument here, not in tsubst. In the case of
12418 we must be careful to do name lookup in the scope of S<T>,
12419 rather than in the current class. */
12420 push_access_scope (fn
);
12421 /* The "this" pointer is not valid in a default argument. */
12424 saved_class_ptr
= current_class_ptr
;
12425 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
12426 saved_class_ref
= current_class_ref
;
12427 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
12430 start_lambda_scope (parm
);
12432 push_deferring_access_checks(dk_no_deferred
);
12433 /* The default argument expression may cause implicitly defined
12434 member functions to be synthesized, which will result in garbage
12435 collection. We must treat this situation as if we were within
12436 the body of function so as to avoid collecting live data on the
12439 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
12440 complain
, NULL_TREE
,
12441 /*integral_constant_expression_p=*/false);
12443 pop_deferring_access_checks();
12445 finish_lambda_scope ();
12447 /* Restore the "this" pointer. */
12450 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
12451 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
12454 if (errorcount
+sorrycount
> errs
12455 && (complain
& tf_warning_or_error
))
12456 inform (input_location
,
12457 " when instantiating default argument for call to %qD", fn
);
12459 /* Make sure the default argument is reasonable. */
12460 arg
= check_default_argument (type
, arg
, complain
);
12462 pop_access_scope (fn
);
12464 if (arg
!= error_mark_node
&& !cp_unevaluated_operand
)
12467 defarg_inst
= tree_cache_map::create_ggc (37);
12468 defarg_inst
->put (parm
, arg
);
12474 /* Substitute into all the default arguments for FN. */
12477 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
12482 tmpl_args
= DECL_TI_ARGS (fn
);
12484 /* If this function is not yet instantiated, we certainly don't need
12485 its default arguments. */
12486 if (uses_template_parms (tmpl_args
))
12488 /* Don't do this again for clones. */
12489 if (DECL_CLONED_FUNCTION_P (fn
))
12493 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
12495 arg
= TREE_CHAIN (arg
), ++i
)
12496 if (TREE_PURPOSE (arg
))
12497 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
, i
,
12499 TREE_PURPOSE (arg
),
12503 /* Subroutine of tsubst_decl for the case when T is a FUNCTION_DECL. */
12506 tsubst_function_decl (tree t
, tree args
, tsubst_flags_t complain
,
12507 tree lambda_fntype
)
12509 tree gen_tmpl
, argvec
;
12510 hashval_t hash
= 0;
12513 /* Nobody should be tsubst'ing into non-template functions. */
12514 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
12516 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
12518 /* If T is not dependent, just return it. */
12519 if (!uses_template_parms (DECL_TI_ARGS (t
)))
12522 /* Calculate the most general template of which R is a
12524 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
12526 /* We're substituting a lambda function under tsubst_lambda_expr but not
12527 directly from it; find the matching function we're already inside.
12528 But don't do this if T is a generic lambda with a single level of
12529 template parms, as in that case we're doing a normal instantiation. */
12530 if (LAMBDA_FUNCTION_P (t
) && !lambda_fntype
12531 && (!generic_lambda_fn_p (t
)
12532 || TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)) > 1))
12533 return enclosing_instantiation_of (t
);
12535 /* Calculate the complete set of arguments used to
12537 argvec
= tsubst_template_args (DECL_TI_ARGS
12538 (DECL_TEMPLATE_RESULT
12539 (DECL_TI_TEMPLATE (t
))),
12540 args
, complain
, in_decl
);
12541 if (argvec
== error_mark_node
)
12542 return error_mark_node
;
12544 /* Check to see if we already have this specialization. */
12545 if (!lambda_fntype
)
12547 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12548 if (tree spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
))
12552 /* We can see more levels of arguments than parameters if
12553 there was a specialization of a member template, like
12556 template <class T> struct S { template <class U> void f(); }
12557 template <> template <class U> void S<int>::f(U);
12559 Here, we'll be substituting into the specialization,
12560 because that's where we can find the code we actually
12561 want to generate, but we'll have enough arguments for
12562 the most general template.
12564 We also deal with the peculiar case:
12566 template <class T> struct S {
12567 template <class U> friend void f();
12569 template <class U> void f() {}
12571 template void f<double>();
12573 Here, the ARGS for the instantiation of will be {int,
12574 double}. But, we only need as many ARGS as there are
12575 levels of template parameters in CODE_PATTERN. We are
12576 careful not to get fooled into reducing the ARGS in
12579 template <class T> struct S { template <class U> void f(U); }
12580 template <class T> template <> void S<T>::f(int) {}
12582 which we can spot because the pattern will be a
12583 specialization in this case. */
12584 int args_depth
= TMPL_ARGS_DEPTH (args
);
12586 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
12588 if (args_depth
> parms_depth
&& !DECL_TEMPLATE_SPECIALIZATION (t
))
12589 args
= get_innermost_template_args (args
, parms_depth
);
12593 /* This special case arises when we have something like this:
12595 template <class T> struct S {
12596 friend void f<int>(int, double);
12599 Here, the DECL_TI_TEMPLATE for the friend declaration
12600 will be an IDENTIFIER_NODE. We are being called from
12601 tsubst_friend_function, and we want only to create a
12602 new decl (R) with appropriate types so that we can call
12603 determine_specialization. */
12604 gen_tmpl
= NULL_TREE
;
12605 argvec
= NULL_TREE
;
12608 tree closure
= (lambda_fntype
? TYPE_METHOD_BASETYPE (lambda_fntype
)
12610 tree ctx
= closure
? closure
: DECL_CONTEXT (t
);
12611 bool member
= ctx
&& TYPE_P (ctx
);
12613 if (member
&& !closure
)
12614 ctx
= tsubst_aggr_type (ctx
, args
,
12615 complain
, t
, /*entering_scope=*/1);
12617 tree type
= (lambda_fntype
? lambda_fntype
12618 : tsubst (TREE_TYPE (t
), args
,
12619 complain
| tf_fndecl_type
, in_decl
));
12620 if (type
== error_mark_node
)
12621 return error_mark_node
;
12623 /* If we hit excessive deduction depth, the type is bogus even if
12624 it isn't error_mark_node, so don't build a decl. */
12625 if (excessive_deduction_depth
)
12626 return error_mark_node
;
12628 /* We do NOT check for matching decls pushed separately at this
12629 point, as they may not represent instantiations of this
12630 template, and in any case are considered separate under the
12632 tree r
= copy_decl (t
);
12633 DECL_USE_TEMPLATE (r
) = 0;
12634 TREE_TYPE (r
) = type
;
12635 /* Clear out the mangled name and RTL for the instantiation. */
12636 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12637 SET_DECL_RTL (r
, NULL
);
12638 /* Leave DECL_INITIAL set on deleted instantiations. */
12639 if (!DECL_DELETED_FN (r
))
12640 DECL_INITIAL (r
) = NULL_TREE
;
12641 DECL_CONTEXT (r
) = ctx
;
12643 /* OpenMP UDRs have the only argument a reference to the declared
12644 type. We want to diagnose if the declared type is a reference,
12645 which is invalid, but as references to references are usually
12646 quietly merged, diagnose it here. */
12647 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
12650 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
12651 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
12652 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
12653 error_at (DECL_SOURCE_LOCATION (t
),
12654 "reference type %qT in "
12655 "%<#pragma omp declare reduction%>", argtype
);
12656 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
12657 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
12661 if (member
&& DECL_CONV_FN_P (r
))
12662 /* Type-conversion operator. Reconstruct the name, in
12663 case it's the name of one of the template's parameters. */
12664 DECL_NAME (r
) = make_conv_op_name (TREE_TYPE (type
));
12666 tree parms
= DECL_ARGUMENTS (t
);
12668 parms
= DECL_CHAIN (parms
);
12669 parms
= tsubst (parms
, args
, complain
, t
);
12670 for (tree parm
= parms
; parm
; parm
= DECL_CHAIN (parm
))
12671 DECL_CONTEXT (parm
) = r
;
12674 tree tparm
= build_this_parm (r
, closure
, type_memfn_quals (type
));
12675 DECL_CHAIN (tparm
) = parms
;
12678 DECL_ARGUMENTS (r
) = parms
;
12679 DECL_RESULT (r
) = NULL_TREE
;
12681 TREE_STATIC (r
) = 0;
12682 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
12683 DECL_EXTERNAL (r
) = 1;
12684 /* If this is an instantiation of a function with internal
12685 linkage, we already know what object file linkage will be
12686 assigned to the instantiation. */
12687 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
12688 DECL_DEFER_OUTPUT (r
) = 0;
12689 DECL_CHAIN (r
) = NULL_TREE
;
12690 DECL_PENDING_INLINE_INFO (r
) = 0;
12691 DECL_PENDING_INLINE_P (r
) = 0;
12692 DECL_SAVED_TREE (r
) = NULL_TREE
;
12693 DECL_STRUCT_FUNCTION (r
) = NULL
;
12695 /* We'll re-clone as appropriate in instantiate_template. */
12696 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
12698 /* If we aren't complaining now, return on error before we register
12699 the specialization so that we'll complain eventually. */
12700 if ((complain
& tf_error
) == 0
12701 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
12702 && !grok_op_properties (r
, /*complain=*/false))
12703 return error_mark_node
;
12705 /* When instantiating a constrained member, substitute
12706 into the constraints to create a new constraint. */
12707 if (tree ci
= get_constraints (t
))
12710 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
12711 set_constraints (r
, ci
);
12714 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
12715 this in the special friend case mentioned above where
12716 GEN_TMPL is NULL. */
12717 if (gen_tmpl
&& !closure
)
12719 DECL_TEMPLATE_INFO (r
)
12720 = build_template_info (gen_tmpl
, argvec
);
12721 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12724 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12726 /* We instantiated this while substituting into
12727 the type earlier (template/friend54.C). */
12730 /* We're not supposed to instantiate default arguments
12731 until they are called, for a template. But, for a
12734 template <class T> void f ()
12735 { extern void g(int i = T()); }
12737 we should do the substitution when the template is
12738 instantiated. We handle the member function case in
12739 instantiate_class_template since the default arguments
12740 might refer to other members of the class. */
12742 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
12743 && !uses_template_parms (argvec
))
12744 tsubst_default_arguments (r
, complain
);
12747 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
12749 /* Copy the list of befriending classes. */
12750 for (tree
*friends
= &DECL_BEFRIENDING_CLASSES (r
);
12752 friends
= &TREE_CHAIN (*friends
))
12754 *friends
= copy_node (*friends
);
12755 TREE_VALUE (*friends
)
12756 = tsubst (TREE_VALUE (*friends
), args
, complain
, in_decl
);
12759 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
12761 maybe_retrofit_in_chrg (r
);
12762 if (DECL_CONSTRUCTOR_P (r
) && !grok_ctor_properties (ctx
, r
))
12763 return error_mark_node
;
12764 /* If this is an instantiation of a member template, clone it.
12765 If it isn't, that'll be handled by
12766 clone_constructors_and_destructors. */
12767 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
12768 clone_function_decl (r
, /*update_methods=*/false);
12770 else if ((complain
& tf_error
) != 0
12771 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
12772 && !grok_op_properties (r
, /*complain=*/true))
12773 return error_mark_node
;
12775 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
12776 SET_DECL_FRIEND_CONTEXT (r
,
12777 tsubst (DECL_FRIEND_CONTEXT (t
),
12778 args
, complain
, in_decl
));
12780 /* Possibly limit visibility based on template args. */
12781 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12782 if (DECL_VISIBILITY_SPECIFIED (t
))
12784 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12785 DECL_ATTRIBUTES (r
)
12786 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12788 determine_visibility (r
);
12789 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
12790 && !processing_template_decl
)
12791 defaulted_late_check (r
);
12793 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12794 args
, complain
, in_decl
);
12798 /* Subroutine of tsubst_decl for the case when T is a TEMPLATE_DECL. */
12801 tsubst_template_decl (tree t
, tree args
, tsubst_flags_t complain
,
12802 tree lambda_fntype
)
12804 /* We can get here when processing a member function template,
12805 member class template, or template template parameter. */
12806 tree decl
= DECL_TEMPLATE_RESULT (t
);
12812 hashval_t hash
= 0;
12814 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12816 /* Template template parameter is treated here. */
12817 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12818 if (new_type
== error_mark_node
)
12819 r
= error_mark_node
;
12820 /* If we get a real template back, return it. This can happen in
12821 the context of most_specialized_partial_spec. */
12822 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
12825 /* The new TEMPLATE_DECL was built in
12826 reduce_template_parm_level. */
12827 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
12831 if (!lambda_fntype
)
12833 /* We might already have an instance of this template.
12834 The ARGS are for the surrounding class type, so the
12835 full args contain the tsubst'd args for the context,
12836 plus the innermost args from the template decl. */
12837 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
12838 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
12839 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
12840 /* Because this is a template, the arguments will still be
12841 dependent, even after substitution. If
12842 PROCESSING_TEMPLATE_DECL is not set, the dependency
12843 predicates will short-circuit. */
12844 ++processing_template_decl
;
12845 full_args
= tsubst_template_args (tmpl_args
, args
,
12846 complain
, in_decl
);
12847 --processing_template_decl
;
12848 if (full_args
== error_mark_node
)
12849 return error_mark_node
;
12851 /* If this is a default template template argument,
12852 tsubst might not have changed anything. */
12853 if (full_args
== tmpl_args
)
12856 hash
= hash_tmpl_and_args (t
, full_args
);
12857 spec
= retrieve_specialization (t
, full_args
, hash
);
12858 if (spec
!= NULL_TREE
)
12862 /* Make a new template decl. It will be similar to the
12863 original, but will record the current template arguments.
12864 We also create a new function declaration, which is just
12865 like the old one, but points to this new template, rather
12866 than the old one. */
12868 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
12869 DECL_CHAIN (r
) = NULL_TREE
;
12871 // Build new template info linking to the original template decl.
12872 if (!lambda_fntype
)
12874 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12875 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12878 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
12880 /* The template parameters for this new template are all the
12881 template parameters for the old template, except the
12882 outermost level of parameters. */
12883 DECL_TEMPLATE_PARMS (r
)
12884 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
12887 if (TREE_CODE (decl
) == TYPE_DECL
12888 && !TYPE_DECL_ALIAS_P (decl
))
12891 ++processing_template_decl
;
12892 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12893 --processing_template_decl
;
12894 if (new_type
== error_mark_node
)
12895 return error_mark_node
;
12897 TREE_TYPE (r
) = new_type
;
12898 /* For a partial specialization, we need to keep pointing to
12899 the primary template. */
12900 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
12901 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
12902 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
12903 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
12904 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
12909 ++processing_template_decl
;
12910 if (TREE_CODE (decl
) == FUNCTION_DECL
)
12911 new_decl
= tsubst_function_decl (decl
, args
, complain
, lambda_fntype
);
12913 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
12914 --processing_template_decl
;
12915 if (new_decl
== error_mark_node
)
12916 return error_mark_node
;
12918 DECL_TEMPLATE_RESULT (r
) = new_decl
;
12919 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
12920 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
12923 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (r
));
12924 DECL_TEMPLATE_INFO (new_decl
) = build_template_info (r
, args
);
12928 DECL_TI_TEMPLATE (new_decl
) = r
;
12929 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
12933 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
12934 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
12936 if (PRIMARY_TEMPLATE_P (t
))
12937 DECL_PRIMARY_TEMPLATE (r
) = r
;
12939 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
)
12941 /* Record this non-type partial instantiation. */
12942 register_specialization (r
, t
,
12943 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
12949 /* True if FN is the op() for a lambda in an uninstantiated template. */
12952 lambda_fn_in_template_p (tree fn
)
12954 if (!fn
|| !LAMBDA_FUNCTION_P (fn
))
12956 tree closure
= DECL_CONTEXT (fn
);
12957 return CLASSTYPE_TEMPLATE_INFO (closure
) != NULL_TREE
;
12960 /* We're instantiating a variable from template function TCTX. Return the
12961 corresponding current enclosing scope. This gets complicated because lambda
12962 functions in templates are regenerated rather than instantiated, but generic
12963 lambda functions are subsequently instantiated. */
12966 enclosing_instantiation_of (tree otctx
)
12969 tree fn
= current_function_decl
;
12970 int lambda_count
= 0;
12972 for (; tctx
&& lambda_fn_in_template_p (tctx
);
12973 tctx
= decl_function_context (tctx
))
12975 for (; fn
; fn
= decl_function_context (fn
))
12978 int flambda_count
= 0;
12979 for (; flambda_count
< lambda_count
&& fn
&& LAMBDA_FUNCTION_P (fn
);
12980 fn
= decl_function_context (fn
))
12982 if ((fn
&& DECL_TEMPLATE_INFO (fn
))
12983 ? most_general_template (fn
) != most_general_template (tctx
)
12986 gcc_assert (DECL_NAME (ofn
) == DECL_NAME (otctx
)
12987 || DECL_CONV_FN_P (ofn
));
12990 gcc_unreachable ();
12993 /* Substitute the ARGS into the T, which is a _DECL. Return the
12994 result of the substitution. Issue error and warning messages under
12995 control of COMPLAIN. */
12998 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
13000 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13001 location_t saved_loc
;
13002 tree r
= NULL_TREE
;
13004 hashval_t hash
= 0;
13006 /* Set the filename and linenumber to improve error-reporting. */
13007 saved_loc
= input_location
;
13008 input_location
= DECL_SOURCE_LOCATION (t
);
13010 switch (TREE_CODE (t
))
13012 case TEMPLATE_DECL
:
13013 r
= tsubst_template_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
13016 case FUNCTION_DECL
:
13017 r
= tsubst_function_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
13022 tree type
= NULL_TREE
;
13024 tree expanded_types
= NULL_TREE
;
13025 tree prev_r
= NULL_TREE
;
13026 tree first_r
= NULL_TREE
;
13028 if (DECL_PACK_P (t
))
13030 /* If there is a local specialization that isn't a
13031 parameter pack, it means that we're doing a "simple"
13032 substitution from inside tsubst_pack_expansion. Just
13033 return the local specialization (which will be a single
13035 tree spec
= retrieve_local_specialization (t
);
13037 && TREE_CODE (spec
) == PARM_DECL
13038 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
13041 /* Expand the TYPE_PACK_EXPANSION that provides the types for
13042 the parameters in this function parameter pack. */
13043 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13044 complain
, in_decl
);
13045 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13047 len
= TREE_VEC_LENGTH (expanded_types
);
13049 /* Zero-length parameter packs are boring. Just substitute
13052 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
13057 /* All we did was update the type. Make a note of that. */
13058 type
= expanded_types
;
13059 expanded_types
= NULL_TREE
;
13063 /* Loop through all of the parameters we'll build. When T is
13064 a function parameter pack, LEN is the number of expanded
13065 types in EXPANDED_TYPES; otherwise, LEN is 1. */
13067 for (i
= 0; i
< len
; ++i
)
13071 if (DECL_TEMPLATE_PARM_P (t
))
13072 SET_DECL_TEMPLATE_PARM_P (r
);
13074 if (expanded_types
)
13075 /* We're on the Ith parameter of the function parameter
13078 /* Get the Ith type. */
13079 type
= TREE_VEC_ELT (expanded_types
, i
);
13081 /* Rename the parameter to include the index. */
13083 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13086 /* We're dealing with a normal parameter. */
13087 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13089 type
= type_decays_to (type
);
13090 TREE_TYPE (r
) = type
;
13091 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13093 if (DECL_INITIAL (r
))
13095 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
13096 DECL_INITIAL (r
) = TREE_TYPE (r
);
13098 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
13099 complain
, in_decl
);
13102 DECL_CONTEXT (r
) = NULL_TREE
;
13104 if (!DECL_TEMPLATE_PARM_P (r
))
13105 DECL_ARG_TYPE (r
) = type_passed_as (type
);
13107 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13108 args
, complain
, in_decl
);
13110 /* Keep track of the first new parameter we
13111 generate. That's what will be returned to the
13116 /* Build a proper chain of parameters when substituting
13117 into a function parameter pack. */
13119 DECL_CHAIN (prev_r
) = r
;
13122 /* If cp_unevaluated_operand is set, we're just looking for a
13123 single dummy parameter, so don't keep going. */
13124 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
13125 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
13126 complain
, DECL_CHAIN (t
));
13128 /* FIRST_R contains the start of the chain we've built. */
13135 tree type
= NULL_TREE
;
13136 tree vec
= NULL_TREE
;
13137 tree expanded_types
= NULL_TREE
;
13140 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13142 /* This field is a lambda capture pack. Return a TREE_VEC of
13143 the expanded fields to instantiate_class_template_1. */
13144 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13145 complain
, in_decl
);
13146 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13148 len
= TREE_VEC_LENGTH (expanded_types
);
13149 vec
= make_tree_vec (len
);
13153 /* All we did was update the type. Make a note of that. */
13154 type
= expanded_types
;
13155 expanded_types
= NULL_TREE
;
13159 for (int i
= 0; i
< len
; ++i
)
13162 if (expanded_types
)
13164 type
= TREE_VEC_ELT (expanded_types
, i
);
13166 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13169 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13171 if (type
== error_mark_node
)
13172 RETURN (error_mark_node
);
13173 TREE_TYPE (r
) = type
;
13174 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13176 if (DECL_C_BIT_FIELD (r
))
13177 /* For bit-fields, DECL_BIT_FIELD_REPRESENTATIVE gives the
13179 DECL_BIT_FIELD_REPRESENTATIVE (r
)
13180 = tsubst_expr (DECL_BIT_FIELD_REPRESENTATIVE (t
), args
,
13182 /*integral_constant_expression_p=*/true);
13183 if (DECL_INITIAL (t
))
13185 /* Set up DECL_TEMPLATE_INFO so that we can get at the
13186 NSDMI in perform_member_init. Still set DECL_INITIAL
13187 so that we know there is one. */
13188 DECL_INITIAL (r
) = void_node
;
13189 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
13190 retrofit_lang_decl (r
);
13191 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
13193 /* We don't have to set DECL_CONTEXT here; it is set by
13194 finish_member_declaration. */
13195 DECL_CHAIN (r
) = NULL_TREE
;
13197 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13198 args
, complain
, in_decl
);
13201 TREE_VEC_ELT (vec
, i
) = r
;
13210 /* We reach here only for member using decls. We also need to check
13211 uses_template_parms because DECL_DEPENDENT_P is not set for a
13212 using-declaration that designates a member of the current
13213 instantiation (c++/53549). */
13214 if (DECL_DEPENDENT_P (t
)
13215 || uses_template_parms (USING_DECL_SCOPE (t
)))
13217 tree scope
= USING_DECL_SCOPE (t
);
13218 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
13219 if (PACK_EXPANSION_P (scope
))
13221 tree vec
= tsubst_pack_expansion (scope
, args
, complain
, in_decl
);
13222 int len
= TREE_VEC_LENGTH (vec
);
13223 r
= make_tree_vec (len
);
13224 for (int i
= 0; i
< len
; ++i
)
13226 tree escope
= TREE_VEC_ELT (vec
, i
);
13227 tree elt
= do_class_using_decl (escope
, name
);
13230 r
= error_mark_node
;
13235 TREE_PROTECTED (elt
) = TREE_PROTECTED (t
);
13236 TREE_PRIVATE (elt
) = TREE_PRIVATE (t
);
13238 TREE_VEC_ELT (r
, i
) = elt
;
13243 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
13244 complain
, in_decl
);
13245 r
= do_class_using_decl (inst_scope
, name
);
13247 r
= error_mark_node
;
13250 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
13251 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
13258 DECL_CHAIN (r
) = NULL_TREE
;
13265 tree argvec
= NULL_TREE
;
13266 tree gen_tmpl
= NULL_TREE
;
13268 tree tmpl
= NULL_TREE
;
13270 tree type
= NULL_TREE
;
13273 if (TREE_TYPE (t
) == error_mark_node
)
13274 RETURN (error_mark_node
);
13276 if (TREE_CODE (t
) == TYPE_DECL
13277 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
13279 /* If this is the canonical decl, we don't have to
13280 mess with instantiations, and often we can't (for
13281 typename, template type parms and such). Note that
13282 TYPE_NAME is not correct for the above test if
13283 we've copied the type for a typedef. */
13284 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13285 if (type
== error_mark_node
)
13286 RETURN (error_mark_node
);
13287 r
= TYPE_NAME (type
);
13291 /* Check to see if we already have the specialization we
13294 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
13296 /* T is a static data member or namespace-scope entity.
13297 We have to substitute into namespace-scope variables
13298 (not just variable templates) because of cases like:
13300 template <class T> void f() { extern T t; }
13302 where the entity referenced is not known until
13303 instantiation time. */
13305 ctx
= DECL_CONTEXT (t
);
13306 if (DECL_CLASS_SCOPE_P (t
))
13308 ctx
= tsubst_aggr_type (ctx
, args
,
13310 in_decl
, /*entering_scope=*/1);
13311 /* If CTX is unchanged, then T is in fact the
13312 specialization we want. That situation occurs when
13313 referencing a static data member within in its own
13314 class. We can use pointer equality, rather than
13315 same_type_p, because DECL_CONTEXT is always
13317 if (ctx
== DECL_CONTEXT (t
)
13318 /* ... unless T is a member template; in which
13319 case our caller can be willing to create a
13320 specialization of that template represented
13322 && !(DECL_TI_TEMPLATE (t
)
13323 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
13329 tmpl
= DECL_TI_TEMPLATE (t
);
13330 gen_tmpl
= most_general_template (tmpl
);
13331 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
13332 if (argvec
!= error_mark_node
)
13333 argvec
= (coerce_innermost_template_parms
13334 (DECL_TEMPLATE_PARMS (gen_tmpl
),
13335 argvec
, t
, complain
,
13336 /*all*/true, /*defarg*/true));
13337 if (argvec
== error_mark_node
)
13338 RETURN (error_mark_node
);
13339 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
13340 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
13345 /* A local variable. */
13347 /* Subsequent calls to pushdecl will fill this in. */
13349 /* Unless this is a reference to a static variable from an
13350 enclosing function, in which case we need to fill it in now. */
13351 if (TREE_STATIC (t
))
13353 tree fn
= enclosing_instantiation_of (DECL_CONTEXT (t
));
13354 if (fn
!= current_function_decl
)
13357 spec
= retrieve_local_specialization (t
);
13359 /* If we already have the specialization we need, there is
13360 nothing more to do. */
13367 /* Create a new node for the specialization we need. */
13369 if (type
== NULL_TREE
)
13371 if (is_typedef_decl (t
))
13372 type
= DECL_ORIGINAL_TYPE (t
);
13374 type
= TREE_TYPE (t
);
13376 && VAR_HAD_UNKNOWN_BOUND (t
)
13377 && type
!= error_mark_node
)
13378 type
= strip_array_domain (type
);
13379 tree sub_args
= args
;
13380 if (tree auto_node
= type_uses_auto (type
))
13382 /* Mask off any template args past the variable's context so we
13383 don't replace the auto with an unrelated argument. */
13384 int nouter
= TEMPLATE_TYPE_LEVEL (auto_node
) - 1;
13385 int extra
= TMPL_ARGS_DEPTH (args
) - nouter
;
13387 /* This should never happen with the new lambda instantiation
13388 model, but keep the handling just in case. */
13389 gcc_assert (!CHECKING_P
),
13390 sub_args
= strip_innermost_template_args (args
, extra
);
13392 type
= tsubst (type
, sub_args
, complain
, in_decl
);
13396 /* Even if the original location is out of scope, the
13397 newly substituted one is not. */
13398 DECL_DEAD_FOR_LOCAL (r
) = 0;
13399 DECL_INITIALIZED_P (r
) = 0;
13400 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
13401 if (type
== error_mark_node
)
13402 RETURN (error_mark_node
);
13403 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13405 /* It may seem that this case cannot occur, since:
13410 declares a function, not a variable. However:
13413 template <typename T> void g() { T t; }
13414 template void g<f>();
13416 is an attempt to declare a variable with function
13418 error ("variable %qD has function type",
13419 /* R is not yet sufficiently initialized, so we
13420 just use its name. */
13422 RETURN (error_mark_node
);
13424 type
= complete_type (type
);
13425 /* Wait until cp_finish_decl to set this again, to handle
13426 circular dependency (template/instantiate6.C). */
13427 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
13428 type
= check_var_type (DECL_NAME (r
), type
);
13430 if (DECL_HAS_VALUE_EXPR_P (t
))
13432 tree ve
= DECL_VALUE_EXPR (t
);
13433 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
13434 /*constant_expression_p=*/false);
13435 if (REFERENCE_REF_P (ve
))
13437 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
13438 ve
= TREE_OPERAND (ve
, 0);
13440 SET_DECL_VALUE_EXPR (r
, ve
);
13442 if (CP_DECL_THREAD_LOCAL_P (r
)
13443 && !processing_template_decl
)
13444 set_decl_tls_model (r
, decl_default_tls_model (r
));
13446 else if (DECL_SELF_REFERENCE_P (t
))
13447 SET_DECL_SELF_REFERENCE_P (r
);
13448 TREE_TYPE (r
) = type
;
13449 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13450 DECL_CONTEXT (r
) = ctx
;
13451 /* Clear out the mangled name and RTL for the instantiation. */
13452 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
13453 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
13454 SET_DECL_RTL (r
, NULL
);
13455 /* The initializer must not be expanded until it is required;
13456 see [temp.inst]. */
13457 DECL_INITIAL (r
) = NULL_TREE
;
13458 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
13461 if (DECL_LANG_SPECIFIC (r
))
13462 SET_DECL_DEPENDENT_INIT_P (r
, false);
13464 SET_DECL_MODE (r
, VOIDmode
);
13466 /* Possibly limit visibility based on template args. */
13467 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
13468 if (DECL_VISIBILITY_SPECIFIED (t
))
13470 DECL_VISIBILITY_SPECIFIED (r
) = 0;
13471 DECL_ATTRIBUTES (r
)
13472 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
13474 determine_visibility (r
);
13479 /* A static data member declaration is always marked
13480 external when it is declared in-class, even if an
13481 initializer is present. We mimic the non-template
13482 processing here. */
13483 DECL_EXTERNAL (r
) = 1;
13484 if (DECL_NAMESPACE_SCOPE_P (t
))
13485 DECL_NOT_REALLY_EXTERN (r
) = 1;
13487 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
13488 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13489 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13493 if (DECL_LANG_SPECIFIC (r
))
13494 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13495 if (!cp_unevaluated_operand
)
13496 register_local_specialization (r
, t
);
13499 DECL_CHAIN (r
) = NULL_TREE
;
13501 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
13503 args
, complain
, in_decl
);
13505 /* Preserve a typedef that names a type. */
13506 if (is_typedef_decl (r
) && type
!= error_mark_node
)
13508 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
13509 set_underlying_type (r
);
13510 if (TYPE_DECL_ALIAS_P (r
))
13511 /* An alias template specialization can be dependent
13512 even if its underlying type is not. */
13513 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
13516 layout_decl (r
, 0);
13521 gcc_unreachable ();
13526 /* Restore the file and line information. */
13527 input_location
= saved_loc
;
13532 /* Substitute into the ARG_TYPES of a function type.
13533 If END is a TREE_CHAIN, leave it and any following types
13537 tsubst_arg_types (tree arg_types
,
13540 tsubst_flags_t complain
,
13543 tree remaining_arg_types
;
13544 tree type
= NULL_TREE
;
13546 tree expanded_args
= NULL_TREE
;
13549 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
13552 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
13553 args
, end
, complain
, in_decl
);
13554 if (remaining_arg_types
== error_mark_node
)
13555 return error_mark_node
;
13557 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
13559 /* For a pack expansion, perform substitution on the
13560 entire expression. Later on, we'll handle the arguments
13562 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
13563 args
, complain
, in_decl
);
13565 if (TREE_CODE (expanded_args
) == TREE_VEC
)
13566 /* So that we'll spin through the parameters, one by one. */
13567 i
= TREE_VEC_LENGTH (expanded_args
);
13570 /* We only partially substituted into the parameter
13571 pack. Our type is TYPE_PACK_EXPANSION. */
13572 type
= expanded_args
;
13573 expanded_args
= NULL_TREE
;
13581 type
= TREE_VEC_ELT (expanded_args
, i
);
13583 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
13585 if (type
== error_mark_node
)
13586 return error_mark_node
;
13587 if (VOID_TYPE_P (type
))
13589 if (complain
& tf_error
)
13591 error ("invalid parameter type %qT", type
);
13593 error ("in declaration %q+D", in_decl
);
13595 return error_mark_node
;
13598 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
13599 return error_mark_node
;
13601 /* Do array-to-pointer, function-to-pointer conversion, and ignore
13602 top-level qualifiers as required. */
13603 type
= cv_unqualified (type_decays_to (type
));
13605 /* We do not substitute into default arguments here. The standard
13606 mandates that they be instantiated only when needed, which is
13607 done in build_over_call. */
13608 default_arg
= TREE_PURPOSE (arg_types
);
13610 /* Except that we do substitute default arguments under tsubst_lambda_expr,
13611 since the new op() won't have any associated template arguments for us
13612 to refer to later. */
13613 if (lambda_fn_in_template_p (in_decl
))
13614 default_arg
= tsubst_copy_and_build (default_arg
, args
, complain
, in_decl
,
13615 false/*fn*/, false/*constexpr*/);
13617 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
13619 /* We've instantiated a template before its default arguments
13620 have been parsed. This can happen for a nested template
13621 class, and is not an error unless we require the default
13622 argument in a call of this function. */
13623 remaining_arg_types
=
13624 tree_cons (default_arg
, type
, remaining_arg_types
);
13625 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
13628 remaining_arg_types
=
13629 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
13632 return remaining_arg_types
;
13635 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
13636 *not* handle the exception-specification for FNTYPE, because the
13637 initial substitution of explicitly provided template parameters
13638 during argument deduction forbids substitution into the
13639 exception-specification:
13643 All references in the function type of the function template to the
13644 corresponding template parameters are replaced by the specified tem-
13645 plate argument values. If a substitution in a template parameter or
13646 in the function type of the function template results in an invalid
13647 type, type deduction fails. [Note: The equivalent substitution in
13648 exception specifications is done only when the function is instanti-
13649 ated, at which point a program is ill-formed if the substitution
13650 results in an invalid type.] */
13653 tsubst_function_type (tree t
,
13655 tsubst_flags_t complain
,
13659 tree arg_types
= NULL_TREE
;
13662 /* The TYPE_CONTEXT is not used for function/method types. */
13663 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
13665 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
13667 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
13669 if (late_return_type_p
)
13671 /* Substitute the argument types. */
13672 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
13673 complain
, in_decl
);
13674 if (arg_types
== error_mark_node
)
13675 return error_mark_node
;
13677 tree save_ccp
= current_class_ptr
;
13678 tree save_ccr
= current_class_ref
;
13679 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
13680 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
13681 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
13684 /* DR 1207: 'this' is in scope in the trailing return type. */
13685 inject_this_parameter (this_type
, cp_type_quals (this_type
));
13688 /* Substitute the return type. */
13689 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13693 current_class_ptr
= save_ccp
;
13694 current_class_ref
= save_ccr
;
13698 /* Substitute the return type. */
13699 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13701 if (return_type
== error_mark_node
)
13702 return error_mark_node
;
13703 /* DR 486 clarifies that creation of a function type with an
13704 invalid return type is a deduction failure. */
13705 if (TREE_CODE (return_type
) == ARRAY_TYPE
13706 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
13708 if (complain
& tf_error
)
13710 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
13711 error ("function returning an array");
13713 error ("function returning a function");
13715 return error_mark_node
;
13718 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
13719 return error_mark_node
;
13721 if (!late_return_type_p
)
13723 /* Substitute the argument types. */
13724 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
13725 complain
, in_decl
);
13726 if (arg_types
== error_mark_node
)
13727 return error_mark_node
;
13730 /* Construct a new type node and return it. */
13731 if (TREE_CODE (t
) == FUNCTION_TYPE
)
13733 fntype
= build_function_type (return_type
, arg_types
);
13734 fntype
= apply_memfn_quals (fntype
,
13735 type_memfn_quals (t
),
13736 type_memfn_rqual (t
));
13740 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
13741 /* Don't pick up extra function qualifiers from the basetype. */
13742 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
13743 if (! MAYBE_CLASS_TYPE_P (r
))
13747 Type deduction may fail for any of the following
13750 -- Attempting to create "pointer to member of T" when T
13751 is not a class type. */
13752 if (complain
& tf_error
)
13753 error ("creating pointer to member function of non-class type %qT",
13755 return error_mark_node
;
13758 fntype
= build_method_type_directly (r
, return_type
,
13759 TREE_CHAIN (arg_types
));
13760 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
13762 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
13764 if (late_return_type_p
)
13765 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
13770 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
13771 ARGS into that specification, and return the substituted
13772 specification. If there is no specification, return NULL_TREE. */
13775 tsubst_exception_specification (tree fntype
,
13777 tsubst_flags_t complain
,
13784 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
13785 new_specs
= NULL_TREE
;
13786 if (specs
&& TREE_PURPOSE (specs
))
13788 /* A noexcept-specifier. */
13789 tree expr
= TREE_PURPOSE (specs
);
13790 if (TREE_CODE (expr
) == INTEGER_CST
)
13794 /* Defer instantiation of noexcept-specifiers to avoid
13795 excessive instantiations (c++/49107). */
13796 new_specs
= make_node (DEFERRED_NOEXCEPT
);
13797 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
13799 /* We already partially instantiated this member template,
13800 so combine the new args with the old. */
13801 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
13802 = DEFERRED_NOEXCEPT_PATTERN (expr
);
13803 DEFERRED_NOEXCEPT_ARGS (new_specs
)
13804 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
13808 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
13809 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
13813 new_specs
= tsubst_copy_and_build
13814 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
13815 /*integral_constant_expression_p=*/true);
13816 new_specs
= build_noexcept_spec (new_specs
, complain
);
13820 if (! TREE_VALUE (specs
))
13827 tree expanded_specs
= NULL_TREE
;
13829 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
13831 /* Expand the pack expansion type. */
13832 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
13836 if (expanded_specs
== error_mark_node
)
13837 return error_mark_node
;
13838 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
13839 len
= TREE_VEC_LENGTH (expanded_specs
);
13842 /* We're substituting into a member template, so
13843 we got a TYPE_PACK_EXPANSION back. Add that
13844 expansion and move on. */
13845 gcc_assert (TREE_CODE (expanded_specs
)
13846 == TYPE_PACK_EXPANSION
);
13847 new_specs
= add_exception_specifier (new_specs
,
13850 specs
= TREE_CHAIN (specs
);
13855 for (i
= 0; i
< len
; ++i
)
13857 if (expanded_specs
)
13858 spec
= TREE_VEC_ELT (expanded_specs
, i
);
13860 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
13861 if (spec
== error_mark_node
)
13863 new_specs
= add_exception_specifier (new_specs
, spec
,
13867 specs
= TREE_CHAIN (specs
);
13873 /* Take the tree structure T and replace template parameters used
13874 therein with the argument vector ARGS. IN_DECL is an associated
13875 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
13876 Issue error and warning messages under control of COMPLAIN. Note
13877 that we must be relatively non-tolerant of extensions here, in
13878 order to preserve conformance; if we allow substitutions that
13879 should not be allowed, we may allow argument deductions that should
13880 not succeed, and therefore report ambiguous overload situations
13881 where there are none. In theory, we could allow the substitution,
13882 but indicate that it should have failed, and allow our caller to
13883 make sure that the right thing happens, but we don't try to do this
13886 This function is used for dealing with types, decls and the like;
13887 for expressions, use tsubst_expr or tsubst_copy. */
13890 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13892 enum tree_code code
;
13893 tree type
, r
= NULL_TREE
;
13895 if (t
== NULL_TREE
|| t
== error_mark_node
13896 || t
== integer_type_node
13897 || t
== void_type_node
13898 || t
== char_type_node
13899 || t
== unknown_type_node
13900 || TREE_CODE (t
) == NAMESPACE_DECL
13901 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
13905 return tsubst_decl (t
, args
, complain
);
13907 if (args
== NULL_TREE
)
13910 code
= TREE_CODE (t
);
13912 if (code
== IDENTIFIER_NODE
)
13913 type
= IDENTIFIER_TYPE_VALUE (t
);
13915 type
= TREE_TYPE (t
);
13917 gcc_assert (type
!= unknown_type_node
);
13919 /* Reuse typedefs. We need to do this to handle dependent attributes,
13920 such as attribute aligned. */
13922 && typedef_variant_p (t
))
13924 tree decl
= TYPE_NAME (t
);
13926 if (alias_template_specialization_p (t
))
13928 /* DECL represents an alias template and we want to
13930 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
13931 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
13932 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
13934 else if (DECL_CLASS_SCOPE_P (decl
)
13935 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
13936 && uses_template_parms (DECL_CONTEXT (decl
)))
13938 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
13939 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
13940 r
= retrieve_specialization (tmpl
, gen_args
, 0);
13942 else if (DECL_FUNCTION_SCOPE_P (decl
)
13943 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
13944 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
13945 r
= retrieve_local_specialization (decl
);
13947 /* The typedef is from a non-template context. */
13953 r
= cp_build_qualified_type_real
13954 (r
, cp_type_quals (t
) | cp_type_quals (r
),
13955 complain
| tf_ignore_bad_quals
);
13960 /* We don't have an instantiation yet, so drop the typedef. */
13961 int quals
= cp_type_quals (t
);
13962 t
= DECL_ORIGINAL_TYPE (decl
);
13963 t
= cp_build_qualified_type_real (t
, quals
,
13964 complain
| tf_ignore_bad_quals
);
13968 bool fndecl_type
= (complain
& tf_fndecl_type
);
13969 complain
&= ~tf_fndecl_type
;
13972 && code
!= TYPENAME_TYPE
13973 && code
!= TEMPLATE_TYPE_PARM
13974 && code
!= TEMPLATE_PARM_INDEX
13975 && code
!= IDENTIFIER_NODE
13976 && code
!= FUNCTION_TYPE
13977 && code
!= METHOD_TYPE
)
13978 type
= tsubst (type
, args
, complain
, in_decl
);
13979 if (type
== error_mark_node
)
13980 return error_mark_node
;
13986 case ENUMERAL_TYPE
:
13987 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
13988 /*entering_scope=*/0);
13991 case IDENTIFIER_NODE
:
14002 if (t
== integer_type_node
)
14005 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
14006 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
14010 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
14012 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
14013 /*integral_constant_expression_p=*/false);
14015 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
14017 if (TREE_CODE (max
) == NOP_EXPR
14018 && TREE_SIDE_EFFECTS (omax
)
14019 && !TREE_TYPE (max
))
14020 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
14022 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
14023 with TREE_SIDE_EFFECTS that indicates this is not an integral
14024 constant expression. */
14025 if (processing_template_decl
14026 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
14028 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
14029 TREE_SIDE_EFFECTS (max
) = 1;
14032 return compute_array_index_type (NULL_TREE
, max
, complain
);
14035 case TEMPLATE_TYPE_PARM
:
14036 case TEMPLATE_TEMPLATE_PARM
:
14037 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14038 case TEMPLATE_PARM_INDEX
:
14043 tree arg
= NULL_TREE
;
14045 /* Early in template argument deduction substitution, we don't
14046 want to reduce the level of 'auto', or it will be confused
14047 with a normal template parm in subsequent deduction. */
14048 if (is_auto (t
) && (complain
& tf_partial
))
14053 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
14054 template_parm_level_and_index (t
, &level
, &idx
);
14056 levels
= TMPL_ARGS_DEPTH (args
);
14057 if (level
<= levels
14058 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
14060 arg
= TMPL_ARG (args
, level
, idx
);
14062 /* See through ARGUMENT_PACK_SELECT arguments. */
14063 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
14064 arg
= argument_pack_select_arg (arg
);
14067 if (arg
== error_mark_node
)
14068 return error_mark_node
;
14069 else if (arg
!= NULL_TREE
)
14071 if (ARGUMENT_PACK_P (arg
))
14072 /* If ARG is an argument pack, we don't actually want to
14073 perform a substitution here, because substitutions
14074 for argument packs are only done
14075 element-by-element. We can get to this point when
14076 substituting the type of a non-type template
14077 parameter pack, when that type actually contains
14078 template parameter packs from an outer template, e.g.,
14080 template<typename... Types> struct A {
14081 template<Types... Values> struct B { };
14085 if (code
== TEMPLATE_TYPE_PARM
)
14088 gcc_assert (TYPE_P (arg
));
14090 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
14092 return cp_build_qualified_type_real
14093 (arg
, quals
, complain
| tf_ignore_bad_quals
);
14095 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
14097 /* We are processing a type constructed from a
14098 template template parameter. */
14099 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
14100 args
, complain
, in_decl
);
14101 if (argvec
== error_mark_node
)
14102 return error_mark_node
;
14104 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
14105 || TREE_CODE (arg
) == TEMPLATE_DECL
14106 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
14108 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
14109 /* Consider this code:
14111 template <template <class> class Template>
14113 template <class Arg> using Bind = Template<Arg>;
14116 template <template <class> class Template, class Arg>
14117 using Instantiate = Template<Arg>; //#0
14119 template <template <class> class Template,
14122 Instantiate<Internal<Template>::template Bind,
14125 When #1 is parsed, the
14126 BOUND_TEMPLATE_TEMPLATE_PARM representing the
14127 parameter `Template' in #0 matches the
14128 UNBOUND_CLASS_TEMPLATE representing the argument
14129 `Internal<Template>::template Bind'; We then want
14130 to assemble the type `Bind<Argument>' that can't
14131 be fully created right now, because
14132 `Internal<Template>' not being complete, the Bind
14133 template cannot be looked up in that context. So
14134 we need to "store" `Bind<Argument>' for later
14135 when the context of Bind becomes complete. Let's
14136 store that in a TYPENAME_TYPE. */
14137 return make_typename_type (TYPE_CONTEXT (arg
),
14138 build_nt (TEMPLATE_ID_EXPR
,
14139 TYPE_IDENTIFIER (arg
),
14144 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
14145 are resolving nested-types in the signature of a
14146 member function templates. Otherwise ARG is a
14147 TEMPLATE_DECL and is the real template to be
14149 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
14150 arg
= TYPE_NAME (arg
);
14152 r
= lookup_template_class (arg
,
14154 DECL_CONTEXT (arg
),
14155 /*entering_scope=*/0,
14157 return cp_build_qualified_type_real
14158 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
14160 else if (code
== TEMPLATE_TEMPLATE_PARM
)
14163 /* TEMPLATE_PARM_INDEX. */
14164 return convert_from_reference (unshare_expr (arg
));
14168 /* This can happen during the attempted tsubst'ing in
14169 unify. This means that we don't yet have any information
14170 about the template parameter in question. */
14173 /* If we get here, we must have been looking at a parm for a
14174 more deeply nested template. Make a new version of this
14175 template parameter, but with a lower level. */
14178 case TEMPLATE_TYPE_PARM
:
14179 case TEMPLATE_TEMPLATE_PARM
:
14180 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14181 if (cp_type_quals (t
))
14183 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
14184 r
= cp_build_qualified_type_real
14185 (r
, cp_type_quals (t
),
14186 complain
| (code
== TEMPLATE_TYPE_PARM
14187 ? tf_ignore_bad_quals
: 0));
14189 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
14190 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
14191 && (r
= (TEMPLATE_PARM_DESCENDANTS
14192 (TEMPLATE_TYPE_PARM_INDEX (t
))))
14193 && (r
= TREE_TYPE (r
))
14194 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
14195 /* Break infinite recursion when substituting the constraints
14196 of a constrained placeholder. */;
14200 TEMPLATE_TYPE_PARM_INDEX (r
)
14201 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
14202 r
, levels
, args
, complain
);
14203 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
14204 TYPE_MAIN_VARIANT (r
) = r
;
14205 TYPE_POINTER_TO (r
) = NULL_TREE
;
14206 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
14208 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
14210 /* Propagate constraints on placeholders. */
14211 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
14212 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
14213 = tsubst_constraint (constr
, args
, complain
, in_decl
);
14214 else if (tree pl
= CLASS_PLACEHOLDER_TEMPLATE (t
))
14216 pl
= tsubst_copy (pl
, args
, complain
, in_decl
);
14217 CLASS_PLACEHOLDER_TEMPLATE (r
) = pl
;
14221 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
14222 /* We have reduced the level of the template
14223 template parameter, but not the levels of its
14224 template parameters, so canonical_type_parameter
14225 will not be able to find the canonical template
14226 template parameter for this level. Thus, we
14227 require structural equality checking to compare
14228 TEMPLATE_TEMPLATE_PARMs. */
14229 SET_TYPE_STRUCTURAL_EQUALITY (r
);
14230 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
14231 SET_TYPE_STRUCTURAL_EQUALITY (r
);
14233 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
14235 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
14237 tree tinfo
= TYPE_TEMPLATE_INFO (t
);
14238 /* We might need to substitute into the types of non-type
14239 template parameters. */
14240 tree tmpl
= tsubst (TI_TEMPLATE (tinfo
), args
,
14241 complain
, in_decl
);
14242 if (tmpl
== error_mark_node
)
14243 return error_mark_node
;
14244 tree argvec
= tsubst (TI_ARGS (tinfo
), args
,
14245 complain
, in_decl
);
14246 if (argvec
== error_mark_node
)
14247 return error_mark_node
;
14249 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
14250 = build_template_info (tmpl
, argvec
);
14255 case TEMPLATE_PARM_INDEX
:
14256 /* OK, now substitute the type of the non-type parameter. We
14257 couldn't do it earlier because it might be an auto parameter,
14258 and we wouldn't need to if we had an argument. */
14259 type
= tsubst (type
, args
, complain
, in_decl
);
14260 if (type
== error_mark_node
)
14261 return error_mark_node
;
14262 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
14266 gcc_unreachable ();
14274 tree purpose
, value
, chain
;
14276 if (t
== void_list_node
)
14279 purpose
= TREE_PURPOSE (t
);
14282 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
14283 if (purpose
== error_mark_node
)
14284 return error_mark_node
;
14286 value
= TREE_VALUE (t
);
14289 value
= tsubst (value
, args
, complain
, in_decl
);
14290 if (value
== error_mark_node
)
14291 return error_mark_node
;
14293 chain
= TREE_CHAIN (t
);
14294 if (chain
&& chain
!= void_type_node
)
14296 chain
= tsubst (chain
, args
, complain
, in_decl
);
14297 if (chain
== error_mark_node
)
14298 return error_mark_node
;
14300 if (purpose
== TREE_PURPOSE (t
)
14301 && value
== TREE_VALUE (t
)
14302 && chain
== TREE_CHAIN (t
))
14304 return hash_tree_cons (purpose
, value
, chain
);
14308 /* We should never be tsubsting a binfo. */
14309 gcc_unreachable ();
14312 /* A vector of template arguments. */
14313 gcc_assert (!type
);
14314 return tsubst_template_args (t
, args
, complain
, in_decl
);
14317 case REFERENCE_TYPE
:
14319 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
14324 Type deduction may fail for any of the following
14327 -- Attempting to create a pointer to reference type.
14328 -- Attempting to create a reference to a reference type or
14329 a reference to void.
14331 Core issue 106 says that creating a reference to a reference
14332 during instantiation is no longer a cause for failure. We
14333 only enforce this check in strict C++98 mode. */
14334 if ((TREE_CODE (type
) == REFERENCE_TYPE
14335 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
14336 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
14338 static location_t last_loc
;
14340 /* We keep track of the last time we issued this error
14341 message to avoid spewing a ton of messages during a
14342 single bad template instantiation. */
14343 if (complain
& tf_error
14344 && last_loc
!= input_location
)
14346 if (VOID_TYPE_P (type
))
14347 error ("forming reference to void");
14348 else if (code
== POINTER_TYPE
)
14349 error ("forming pointer to reference type %qT", type
);
14351 error ("forming reference to reference type %qT", type
);
14352 last_loc
= input_location
;
14355 return error_mark_node
;
14357 else if (TREE_CODE (type
) == FUNCTION_TYPE
14358 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
14359 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
14361 if (complain
& tf_error
)
14363 if (code
== POINTER_TYPE
)
14364 error ("forming pointer to qualified function type %qT",
14367 error ("forming reference to qualified function type %qT",
14370 return error_mark_node
;
14372 else if (code
== POINTER_TYPE
)
14374 r
= build_pointer_type (type
);
14375 if (TREE_CODE (type
) == METHOD_TYPE
)
14376 r
= build_ptrmemfunc_type (r
);
14378 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
14379 /* In C++0x, during template argument substitution, when there is an
14380 attempt to create a reference to a reference type, reference
14381 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
14383 "If a template-argument for a template-parameter T names a type
14384 that is a reference to a type A, an attempt to create the type
14385 'lvalue reference to cv T' creates the type 'lvalue reference to
14386 A,' while an attempt to create the type type rvalue reference to
14387 cv T' creates the type T"
14389 r
= cp_build_reference_type
14391 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
14393 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
14394 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
14396 if (r
!= error_mark_node
)
14397 /* Will this ever be needed for TYPE_..._TO values? */
14404 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
14405 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
14409 Type deduction may fail for any of the following
14412 -- Attempting to create "pointer to member of T" when T
14413 is not a class type. */
14414 if (complain
& tf_error
)
14415 error ("creating pointer to member of non-class type %qT", r
);
14416 return error_mark_node
;
14418 if (TREE_CODE (type
) == REFERENCE_TYPE
)
14420 if (complain
& tf_error
)
14421 error ("creating pointer to member reference type %qT", type
);
14422 return error_mark_node
;
14424 if (VOID_TYPE_P (type
))
14426 if (complain
& tf_error
)
14427 error ("creating pointer to member of type void");
14428 return error_mark_node
;
14430 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
14431 if (TREE_CODE (type
) == FUNCTION_TYPE
)
14433 /* The type of the implicit object parameter gets its
14434 cv-qualifiers from the FUNCTION_TYPE. */
14437 = build_memfn_type (type
, r
, type_memfn_quals (type
),
14438 type_memfn_rqual (type
));
14439 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
14440 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
14444 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
14448 case FUNCTION_TYPE
:
14453 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
14454 if (fntype
== error_mark_node
)
14455 return error_mark_node
;
14457 /* Substitute the exception specification. */
14458 specs
= tsubst_exception_specification (t
, args
, complain
, in_decl
,
14459 /*defer_ok*/fndecl_type
);
14460 if (specs
== error_mark_node
)
14461 return error_mark_node
;
14463 fntype
= build_exception_variant (fntype
, specs
);
14468 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
14469 if (domain
== error_mark_node
)
14470 return error_mark_node
;
14472 /* As an optimization, we avoid regenerating the array type if
14473 it will obviously be the same as T. */
14474 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
14477 /* These checks should match the ones in create_array_type_for_decl.
14481 The deduction may fail for any of the following reasons:
14483 -- Attempting to create an array with an element type that
14484 is void, a function type, or a reference type, or [DR337]
14485 an abstract class type. */
14486 if (VOID_TYPE_P (type
)
14487 || TREE_CODE (type
) == FUNCTION_TYPE
14488 || (TREE_CODE (type
) == ARRAY_TYPE
14489 && TYPE_DOMAIN (type
) == NULL_TREE
)
14490 || TREE_CODE (type
) == REFERENCE_TYPE
)
14492 if (complain
& tf_error
)
14493 error ("creating array of %qT", type
);
14494 return error_mark_node
;
14497 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
14498 return error_mark_node
;
14500 r
= build_cplus_array_type (type
, domain
);
14502 if (TYPE_USER_ALIGN (t
))
14504 SET_TYPE_ALIGN (r
, TYPE_ALIGN (t
));
14505 TYPE_USER_ALIGN (r
) = 1;
14511 case TYPENAME_TYPE
:
14513 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
14514 in_decl
, /*entering_scope=*/1);
14515 if (ctx
== error_mark_node
)
14516 return error_mark_node
;
14518 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
14519 complain
, in_decl
);
14520 if (f
== error_mark_node
)
14521 return error_mark_node
;
14523 if (!MAYBE_CLASS_TYPE_P (ctx
))
14525 if (complain
& tf_error
)
14526 error ("%qT is not a class, struct, or union type", ctx
);
14527 return error_mark_node
;
14529 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
14531 /* Normally, make_typename_type does not require that the CTX
14532 have complete type in order to allow things like:
14534 template <class T> struct S { typename S<T>::X Y; };
14536 But, such constructs have already been resolved by this
14537 point, so here CTX really should have complete type, unless
14538 it's a partial instantiation. */
14539 ctx
= complete_type (ctx
);
14540 if (!COMPLETE_TYPE_P (ctx
))
14542 if (complain
& tf_error
)
14543 cxx_incomplete_type_error (NULL_TREE
, ctx
);
14544 return error_mark_node
;
14548 f
= make_typename_type (ctx
, f
, typename_type
,
14549 complain
| tf_keep_type_decl
);
14550 if (f
== error_mark_node
)
14552 if (TREE_CODE (f
) == TYPE_DECL
)
14554 complain
|= tf_ignore_bad_quals
;
14558 if (TREE_CODE (f
) != TYPENAME_TYPE
)
14560 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
14562 if (complain
& tf_error
)
14563 error ("%qT resolves to %qT, which is not an enumeration type",
14566 return error_mark_node
;
14568 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
14570 if (complain
& tf_error
)
14571 error ("%qT resolves to %qT, which is is not a class type",
14574 return error_mark_node
;
14578 return cp_build_qualified_type_real
14579 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
14582 case UNBOUND_CLASS_TEMPLATE
:
14584 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
14585 in_decl
, /*entering_scope=*/1);
14586 tree name
= TYPE_IDENTIFIER (t
);
14587 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
14589 if (ctx
== error_mark_node
|| name
== error_mark_node
)
14590 return error_mark_node
;
14593 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
14594 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
14601 ++cp_unevaluated_operand
;
14602 ++c_inhibit_evaluation_warnings
;
14604 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
14606 /*integral_constant_expression_p=*/false);
14608 --cp_unevaluated_operand
;
14609 --c_inhibit_evaluation_warnings
;
14611 type
= finish_typeof (type
);
14612 return cp_build_qualified_type_real (type
,
14614 | cp_type_quals (type
),
14618 case DECLTYPE_TYPE
:
14622 ++cp_unevaluated_operand
;
14623 ++c_inhibit_evaluation_warnings
;
14625 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
14626 complain
|tf_decltype
, in_decl
,
14627 /*function_p*/false,
14628 /*integral_constant_expression*/false);
14630 if (DECLTYPE_FOR_INIT_CAPTURE (t
))
14632 if (type
== NULL_TREE
)
14634 if (complain
& tf_error
)
14635 error ("empty initializer in lambda init-capture");
14636 type
= error_mark_node
;
14638 else if (TREE_CODE (type
) == TREE_LIST
)
14639 type
= build_x_compound_expr_from_list (type
, ELK_INIT
, complain
);
14642 --cp_unevaluated_operand
;
14643 --c_inhibit_evaluation_warnings
;
14645 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
14646 type
= lambda_capture_field_type (type
,
14647 DECLTYPE_FOR_INIT_CAPTURE (t
),
14648 DECLTYPE_FOR_REF_CAPTURE (t
));
14649 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
14650 type
= lambda_proxy_type (type
);
14653 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
14654 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
14656 /* In a template ~id could be either a complement expression
14657 or an unqualified-id naming a destructor; if instantiating
14658 it produces an expression, it's not an id-expression or
14661 type
= finish_decltype_type (type
, id
, complain
);
14663 return cp_build_qualified_type_real (type
,
14665 | cp_type_quals (type
),
14666 complain
| tf_ignore_bad_quals
);
14669 case UNDERLYING_TYPE
:
14671 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
14672 complain
, in_decl
);
14673 return finish_underlying_type (type
);
14676 case TYPE_ARGUMENT_PACK
:
14677 case NONTYPE_ARGUMENT_PACK
:
14681 if (code
== NONTYPE_ARGUMENT_PACK
)
14682 r
= make_node (code
);
14684 r
= cxx_make_type (code
);
14686 tree pack_args
= ARGUMENT_PACK_ARGS (t
);
14687 pack_args
= tsubst_template_args (pack_args
, args
, complain
, in_decl
);
14688 SET_ARGUMENT_PACK_ARGS (r
, pack_args
);
14706 /* We should use one of the expression tsubsts for these codes. */
14707 gcc_unreachable ();
14710 sorry ("use of %qs in template", get_tree_code_name (code
));
14711 return error_mark_node
;
14715 /* tsubst a BASELINK. OBJECT_TYPE, if non-NULL, is the type of the
14716 expression on the left-hand side of the "." or "->" operator. We
14717 only do the lookup if we had a dependent BASELINK. Otherwise we
14718 adjust it onto the instantiated heirarchy. */
14721 tsubst_baselink (tree baselink
, tree object_type
,
14722 tree args
, tsubst_flags_t complain
, tree in_decl
)
14724 bool qualified_p
= BASELINK_QUALIFIED_P (baselink
);
14725 tree qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
14726 qualifying_scope
= tsubst (qualifying_scope
, args
, complain
, in_decl
);
14728 tree optype
= BASELINK_OPTYPE (baselink
);
14729 optype
= tsubst (optype
, args
, complain
, in_decl
);
14731 tree template_args
= NULL_TREE
;
14732 bool template_id_p
= false;
14733 tree fns
= BASELINK_FUNCTIONS (baselink
);
14734 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
14736 template_id_p
= true;
14737 template_args
= TREE_OPERAND (fns
, 1);
14738 fns
= TREE_OPERAND (fns
, 0);
14740 template_args
= tsubst_template_args (template_args
, args
,
14741 complain
, in_decl
);
14744 tree binfo_type
= BINFO_TYPE (BASELINK_BINFO (baselink
));
14745 binfo_type
= tsubst (binfo_type
, args
, complain
, in_decl
);
14746 bool dependent_p
= binfo_type
!= BINFO_TYPE (BASELINK_BINFO (baselink
));
14750 tree name
= OVL_NAME (fns
);
14751 if (IDENTIFIER_CONV_OP_P (name
))
14752 name
= make_conv_op_name (optype
);
14754 if (name
== complete_dtor_identifier
)
14755 /* Treat as-if non-dependent below. */
14756 dependent_p
= false;
14758 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
14761 if ((complain
& tf_error
)
14762 && constructor_name_p (name
, qualifying_scope
))
14763 error ("cannot call constructor %<%T::%D%> directly",
14764 qualifying_scope
, name
);
14765 return error_mark_node
;
14768 if (BASELINK_P (baselink
))
14769 fns
= BASELINK_FUNCTIONS (baselink
);
14772 /* We're going to overwrite pieces below, make a duplicate. */
14773 baselink
= copy_node (baselink
);
14775 /* If lookup found a single function, mark it as used at this point.
14776 (If lookup found multiple functions the one selected later by
14777 overload resolution will be marked as used at that point.) */
14778 if (!template_id_p
&& !really_overloaded_fn (fns
))
14780 tree fn
= OVL_FIRST (fns
);
14781 bool ok
= mark_used (fn
, complain
);
14782 if (!ok
&& !(complain
& tf_error
))
14783 return error_mark_node
;
14784 if (ok
&& BASELINK_P (baselink
))
14785 /* We might have instantiated an auto function. */
14786 TREE_TYPE (baselink
) = TREE_TYPE (fn
);
14789 if (BASELINK_P (baselink
))
14791 /* Add back the template arguments, if present. */
14793 BASELINK_FUNCTIONS (baselink
)
14794 = build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fns
, template_args
);
14796 /* Update the conversion operator type. */
14797 BASELINK_OPTYPE (baselink
) = optype
;
14801 object_type
= current_class_type
;
14803 if (qualified_p
|| !dependent_p
)
14805 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
14809 /* We need to call adjust_result_of_qualified_name_lookup in case the
14810 destructor names a base class, but we unset BASELINK_QUALIFIED_P
14811 so that we still get virtual function binding. */
14812 BASELINK_QUALIFIED_P (baselink
) = false;
14818 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
14819 true if the qualified-id will be a postfix-expression in-and-of
14820 itself; false if more of the postfix-expression follows the
14821 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
14825 tsubst_qualified_id (tree qualified_id
, tree args
,
14826 tsubst_flags_t complain
, tree in_decl
,
14827 bool done
, bool address_p
)
14833 tree template_args
;
14834 location_t loc
= UNKNOWN_LOCATION
;
14836 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
14838 /* Figure out what name to look up. */
14839 name
= TREE_OPERAND (qualified_id
, 1);
14840 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
14842 is_template
= true;
14843 loc
= EXPR_LOCATION (name
);
14844 template_args
= TREE_OPERAND (name
, 1);
14846 template_args
= tsubst_template_args (template_args
, args
,
14847 complain
, in_decl
);
14848 if (template_args
== error_mark_node
)
14849 return error_mark_node
;
14850 name
= TREE_OPERAND (name
, 0);
14854 is_template
= false;
14855 template_args
= NULL_TREE
;
14858 /* Substitute into the qualifying scope. When there are no ARGS, we
14859 are just trying to simplify a non-dependent expression. In that
14860 case the qualifying scope may be dependent, and, in any case,
14861 substituting will not help. */
14862 scope
= TREE_OPERAND (qualified_id
, 0);
14865 scope
= tsubst (scope
, args
, complain
, in_decl
);
14866 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
14871 if (dependent_scope_p (scope
))
14874 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
14875 tree r
= build_qualified_name (NULL_TREE
, scope
, expr
,
14876 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
14877 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (qualified_id
);
14881 if (!BASELINK_P (name
) && !DECL_P (expr
))
14883 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
14885 /* A BIT_NOT_EXPR is used to represent a destructor. */
14886 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
14888 error ("qualifying type %qT does not match destructor name ~%qT",
14889 scope
, TREE_OPERAND (expr
, 0));
14890 expr
= error_mark_node
;
14893 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
14894 /*is_type_p=*/0, false);
14897 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
14898 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
14899 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
14901 if (complain
& tf_error
)
14903 error ("dependent-name %qE is parsed as a non-type, but "
14904 "instantiation yields a type", qualified_id
);
14905 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
14907 return error_mark_node
;
14913 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
14915 /* Remember that there was a reference to this entity. */
14916 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
14917 return error_mark_node
;
14920 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
14922 if (complain
& tf_error
)
14923 qualified_name_lookup_error (scope
,
14924 TREE_OPERAND (qualified_id
, 1),
14925 expr
, input_location
);
14926 return error_mark_node
;
14931 /* We may be repeating a check already done during parsing, but
14932 if it was well-formed and passed then, it will pass again
14933 now, and if it didn't, we wouldn't have got here. The case
14934 we want to catch is when we couldn't tell then, and can now,
14935 namely when templ prior to substitution was an
14937 if (flag_concepts
&& check_auto_in_tmpl_args (expr
, template_args
))
14938 return error_mark_node
;
14940 if (variable_template_p (expr
))
14941 expr
= lookup_and_finish_template_variable (expr
, template_args
,
14944 expr
= lookup_template_function (expr
, template_args
);
14947 if (expr
== error_mark_node
&& complain
& tf_error
)
14948 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
14949 expr
, input_location
);
14950 else if (TYPE_P (scope
))
14952 expr
= (adjust_result_of_qualified_name_lookup
14953 (expr
, scope
, current_nonlambda_class_type ()));
14954 expr
= (finish_qualified_id_expr
14955 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
14956 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
14957 /*template_arg_p=*/false, complain
));
14960 /* Expressions do not generally have reference type. */
14961 if (TREE_CODE (expr
) != SCOPE_REF
14962 /* However, if we're about to form a pointer-to-member, we just
14963 want the referenced member referenced. */
14964 && TREE_CODE (expr
) != OFFSET_REF
)
14965 expr
= convert_from_reference (expr
);
14967 if (REF_PARENTHESIZED_P (qualified_id
))
14968 expr
= force_paren_expr (expr
);
14973 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
14974 initializer, DECL is the substituted VAR_DECL. Other arguments are as
14978 tsubst_init (tree init
, tree decl
, tree args
,
14979 tsubst_flags_t complain
, tree in_decl
)
14984 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
14986 if (!init
&& TREE_TYPE (decl
) != error_mark_node
)
14988 /* If we had an initializer but it
14989 instantiated to nothing,
14990 value-initialize the object. This will
14991 only occur when the initializer was a
14992 pack expansion where the parameter packs
14993 used in that expansion were of length
14995 init
= build_value_init (TREE_TYPE (decl
),
14997 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
14998 init
= get_target_expr_sfinae (init
, complain
);
14999 if (TREE_CODE (init
) == TARGET_EXPR
)
15000 TARGET_EXPR_DIRECT_INIT_P (init
) = true;
15006 /* Like tsubst, but deals with expressions. This function just replaces
15007 template parms; to finish processing the resultant expression, use
15008 tsubst_copy_and_build or tsubst_expr. */
15011 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15013 enum tree_code code
;
15016 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
15019 code
= TREE_CODE (t
);
15024 r
= retrieve_local_specialization (t
);
15026 if (r
== NULL_TREE
)
15028 /* We get here for a use of 'this' in an NSDMI. */
15029 if (DECL_NAME (t
) == this_identifier
&& current_class_ptr
)
15030 return current_class_ptr
;
15032 /* This can happen for a parameter name used later in a function
15033 declaration (such as in a late-specified return type). Just
15034 make a dummy decl, since it's only used for its type. */
15035 gcc_assert (cp_unevaluated_operand
!= 0);
15036 r
= tsubst_decl (t
, args
, complain
);
15037 /* Give it the template pattern as its context; its true context
15038 hasn't been instantiated yet and this is good enough for
15040 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
15043 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15044 r
= argument_pack_select_arg (r
);
15045 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
15046 return error_mark_node
;
15054 if (DECL_TEMPLATE_PARM_P (t
))
15055 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
15056 /* There is no need to substitute into namespace-scope
15058 if (DECL_NAMESPACE_SCOPE_P (t
))
15060 /* If ARGS is NULL, then T is known to be non-dependent. */
15061 if (args
== NULL_TREE
)
15062 return scalar_constant_value (t
);
15064 /* Unfortunately, we cannot just call lookup_name here.
15067 template <int I> int f() {
15069 struct S { void g() { E e = a; } };
15072 When we instantiate f<7>::S::g(), say, lookup_name is not
15073 clever enough to find f<7>::a. */
15075 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15076 /*entering_scope=*/0);
15078 for (v
= TYPE_VALUES (enum_type
);
15080 v
= TREE_CHAIN (v
))
15081 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
15082 return TREE_VALUE (v
);
15084 /* We didn't find the name. That should never happen; if
15085 name-lookup found it during preliminary parsing, we
15086 should find it again here during instantiation. */
15087 gcc_unreachable ();
15092 if (DECL_CONTEXT (t
))
15096 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15097 /*entering_scope=*/1);
15098 if (ctx
!= DECL_CONTEXT (t
))
15100 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
15103 if (complain
& tf_error
)
15104 error ("using invalid field %qD", t
);
15105 return error_mark_node
;
15114 case FUNCTION_DECL
:
15115 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
15116 r
= tsubst (t
, args
, complain
, in_decl
);
15117 else if (local_variable_p (t
)
15118 && uses_template_parms (DECL_CONTEXT (t
)))
15120 r
= retrieve_local_specialization (t
);
15121 if (r
== NULL_TREE
)
15123 /* First try name lookup to find the instantiation. */
15124 r
= lookup_name (DECL_NAME (t
));
15125 if (r
&& !is_capture_proxy (r
))
15127 /* Make sure that the one we found is the one we want. */
15128 tree ctx
= enclosing_instantiation_of (DECL_CONTEXT (t
));
15129 if (ctx
!= DECL_CONTEXT (r
))
15137 /* This can happen for a variable used in a
15138 late-specified return type of a local lambda, or for a
15139 local static or constant. Building a new VAR_DECL
15140 should be OK in all those cases. */
15141 r
= tsubst_decl (t
, args
, complain
);
15142 if (local_specializations
)
15143 /* Avoid infinite recursion (79640). */
15144 register_local_specialization (r
, t
);
15145 if (decl_maybe_constant_var_p (r
))
15147 /* We can't call cp_finish_decl, so handle the
15148 initializer by hand. */
15149 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
15150 complain
, in_decl
);
15151 if (!processing_template_decl
)
15152 init
= maybe_constant_init (init
);
15153 if (processing_template_decl
15154 ? potential_constant_expression (init
)
15155 : reduced_constant_expression_p (init
))
15156 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
15157 = TREE_CONSTANT (r
) = true;
15158 DECL_INITIAL (r
) = init
;
15159 if (tree auto_node
= type_uses_auto (TREE_TYPE (r
)))
15161 = do_auto_deduction (TREE_TYPE (r
), init
, auto_node
,
15162 complain
, adc_variable_type
);
15164 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
15165 || decl_constant_var_p (r
)
15166 || errorcount
|| sorrycount
);
15167 if (!processing_template_decl
15168 && !TREE_STATIC (r
))
15169 r
= process_outer_var_ref (r
, complain
);
15171 /* Remember this for subsequent uses. */
15172 if (local_specializations
)
15173 register_local_specialization (r
, t
);
15175 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15176 r
= argument_pack_select_arg (r
);
15180 if (!mark_used (r
, complain
))
15181 return error_mark_node
;
15184 case NAMESPACE_DECL
:
15188 /* An OVERLOAD will always be a non-dependent overload set; an
15189 overload set from function scope will just be represented with an
15190 IDENTIFIER_NODE, and from class scope with a BASELINK. */
15191 gcc_assert (!uses_template_parms (t
));
15192 /* We must have marked any lookups as persistent. */
15193 gcc_assert (!OVL_LOOKUP_P (t
) || OVL_USED_P (t
));
15197 return tsubst_baselink (t
, current_nonlambda_class_type (),
15198 args
, complain
, in_decl
);
15200 case TEMPLATE_DECL
:
15201 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
15202 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
15203 args
, complain
, in_decl
);
15204 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
15205 return tsubst (t
, args
, complain
, in_decl
);
15206 else if (DECL_CLASS_SCOPE_P (t
)
15207 && uses_template_parms (DECL_CONTEXT (t
)))
15209 /* Template template argument like the following example need
15212 template <template <class> class TT> struct C {};
15213 template <class T> struct D {
15214 template <class U> struct E {};
15219 We are processing the template argument `E' in #1 for
15220 the template instantiation #2. Originally, `E' is a
15221 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
15222 have to substitute this with one having context `D<int>'. */
15224 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
15225 if (dependent_scope_p (context
))
15227 /* When rewriting a constructor into a deduction guide, a
15228 non-dependent name can become dependent, so memtmpl<args>
15229 becomes context::template memtmpl<args>. */
15230 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15231 return build_qualified_name (type
, context
, DECL_NAME (t
),
15234 return lookup_field (context
, DECL_NAME(t
), 0, false);
15237 /* Ordinary template template argument. */
15240 case NON_LVALUE_EXPR
:
15241 case VIEW_CONVERT_EXPR
:
15243 /* Handle location wrappers by substituting the wrapped node
15244 first, *then* reusing the resulting type. Doing the type
15245 first ensures that we handle template parameters and
15246 parameter pack expansions. */
15247 gcc_assert (location_wrapper_p (t
));
15248 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15249 return maybe_wrap_with_location (op0
, EXPR_LOCATION (t
));
15253 case REINTERPRET_CAST_EXPR
:
15254 case CONST_CAST_EXPR
:
15255 case STATIC_CAST_EXPR
:
15256 case DYNAMIC_CAST_EXPR
:
15257 case IMPLICIT_CONV_EXPR
:
15261 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15262 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15263 return build1 (code
, type
, op0
);
15267 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
15268 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
15270 tree expanded
, op
= TREE_OPERAND (t
, 0);
15273 if (SIZEOF_EXPR_TYPE_P (t
))
15274 op
= TREE_TYPE (op
);
15276 ++cp_unevaluated_operand
;
15277 ++c_inhibit_evaluation_warnings
;
15278 /* We only want to compute the number of arguments. */
15279 if (PACK_EXPANSION_P (op
))
15280 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
15282 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
15283 args
, complain
, in_decl
);
15284 --cp_unevaluated_operand
;
15285 --c_inhibit_evaluation_warnings
;
15287 if (TREE_CODE (expanded
) == TREE_VEC
)
15289 len
= TREE_VEC_LENGTH (expanded
);
15290 /* Set TREE_USED for the benefit of -Wunused. */
15291 for (int i
= 0; i
< len
; i
++)
15292 if (DECL_P (TREE_VEC_ELT (expanded
, i
)))
15293 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
15296 if (expanded
== error_mark_node
)
15297 return error_mark_node
;
15298 else if (PACK_EXPANSION_P (expanded
)
15299 || (TREE_CODE (expanded
) == TREE_VEC
15300 && pack_expansion_args_count (expanded
)))
15303 if (PACK_EXPANSION_P (expanded
))
15305 else if (TREE_VEC_LENGTH (expanded
) == 1)
15306 expanded
= TREE_VEC_ELT (expanded
, 0);
15308 expanded
= make_argument_pack (expanded
);
15310 if (TYPE_P (expanded
))
15311 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
15312 complain
& tf_error
);
15314 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
15315 complain
& tf_error
);
15318 return build_int_cst (size_type_node
, len
);
15320 if (SIZEOF_EXPR_TYPE_P (t
))
15322 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
15323 args
, complain
, in_decl
);
15324 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
15325 r
= build1 (SIZEOF_EXPR
,
15326 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
15327 SIZEOF_EXPR_TYPE_P (r
) = 1;
15334 case TRUTH_NOT_EXPR
:
15337 case UNARY_PLUS_EXPR
: /* Unary + */
15339 case AT_ENCODE_EXPR
:
15343 case REALPART_EXPR
:
15344 case IMAGPART_EXPR
:
15347 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15348 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15349 return build1 (code
, type
, op0
);
15352 case COMPONENT_REF
:
15357 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15358 name
= TREE_OPERAND (t
, 1);
15359 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
15361 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15362 complain
, in_decl
);
15363 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15365 else if (TREE_CODE (name
) == SCOPE_REF
15366 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
15368 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15369 complain
, in_decl
);
15370 name
= TREE_OPERAND (name
, 1);
15371 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15372 complain
, in_decl
);
15373 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15374 name
= build_qualified_name (/*type=*/NULL_TREE
,
15376 /*template_p=*/false);
15378 else if (BASELINK_P (name
))
15379 name
= tsubst_baselink (name
,
15380 non_reference (TREE_TYPE (object
)),
15384 name
= tsubst_copy (name
, args
, complain
, in_decl
);
15385 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
15391 case TRUNC_DIV_EXPR
:
15392 case CEIL_DIV_EXPR
:
15393 case FLOOR_DIV_EXPR
:
15394 case ROUND_DIV_EXPR
:
15395 case EXACT_DIV_EXPR
:
15399 case TRUNC_MOD_EXPR
:
15400 case FLOOR_MOD_EXPR
:
15401 case TRUTH_ANDIF_EXPR
:
15402 case TRUTH_ORIF_EXPR
:
15403 case TRUTH_AND_EXPR
:
15404 case TRUTH_OR_EXPR
:
15417 case COMPOUND_EXPR
:
15420 case PREDECREMENT_EXPR
:
15421 case PREINCREMENT_EXPR
:
15422 case POSTDECREMENT_EXPR
:
15423 case POSTINCREMENT_EXPR
:
15425 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15426 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15427 return build_nt (code
, op0
, op1
);
15432 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15433 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15434 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
15435 QUALIFIED_NAME_IS_TEMPLATE (t
));
15440 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15441 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15442 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
15447 int n
= VL_EXP_OPERAND_LENGTH (t
);
15448 tree result
= build_vl_exp (CALL_EXPR
, n
);
15450 for (i
= 0; i
< n
; i
++)
15451 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
15452 complain
, in_decl
);
15458 case PSEUDO_DTOR_EXPR
:
15459 case VEC_PERM_EXPR
:
15461 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15462 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15463 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15464 r
= build_nt (code
, op0
, op1
, op2
);
15465 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15471 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15472 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15473 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15474 r
= build_nt (code
, op0
, op1
, op2
);
15475 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
15481 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15482 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15483 r
= build_nt (code
, op0
, op1
);
15484 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
15485 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
15489 case TEMPLATE_ID_EXPR
:
15491 /* Substituted template arguments */
15492 tree fn
= TREE_OPERAND (t
, 0);
15493 tree targs
= TREE_OPERAND (t
, 1);
15495 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
15497 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15499 return lookup_template_function (fn
, targs
);
15504 tree purpose
, value
, chain
;
15506 if (t
== void_list_node
)
15509 purpose
= TREE_PURPOSE (t
);
15511 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
15512 value
= TREE_VALUE (t
);
15514 value
= tsubst_copy (value
, args
, complain
, in_decl
);
15515 chain
= TREE_CHAIN (t
);
15516 if (chain
&& chain
!= void_type_node
)
15517 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
15518 if (purpose
== TREE_PURPOSE (t
)
15519 && value
== TREE_VALUE (t
)
15520 && chain
== TREE_CHAIN (t
))
15522 return tree_cons (purpose
, value
, chain
);
15527 case ENUMERAL_TYPE
:
15529 case TEMPLATE_TYPE_PARM
:
15530 case TEMPLATE_TEMPLATE_PARM
:
15531 case BOUND_TEMPLATE_TEMPLATE_PARM
:
15532 case TEMPLATE_PARM_INDEX
:
15534 case REFERENCE_TYPE
:
15536 case FUNCTION_TYPE
:
15539 case TYPENAME_TYPE
:
15540 case UNBOUND_CLASS_TEMPLATE
:
15542 case DECLTYPE_TYPE
:
15544 return tsubst (t
, args
, complain
, in_decl
);
15548 /* Fall through. */
15549 case IDENTIFIER_NODE
:
15550 if (IDENTIFIER_CONV_OP_P (t
))
15552 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15553 return make_conv_op_name (new_type
);
15559 /* This is handled by tsubst_copy_and_build. */
15560 gcc_unreachable ();
15564 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15565 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15566 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
15569 case CLEANUP_POINT_EXPR
:
15570 /* We shouldn't have built any of these during initial template
15571 generation. Instead, they should be built during instantiation
15572 in response to the saved STMT_IS_FULL_EXPR_P setting. */
15573 gcc_unreachable ();
15577 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15578 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15579 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15580 r
= build2 (code
, type
, op0
, op1
);
15581 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
15582 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
15583 && !(complain
& tf_error
))
15584 return error_mark_node
;
15588 case EXPR_PACK_EXPANSION
:
15589 error ("invalid use of pack expansion expression");
15590 return error_mark_node
;
15592 case NONTYPE_ARGUMENT_PACK
:
15593 error ("use %<...%> to expand argument pack");
15594 return error_mark_node
;
15597 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
15605 /* Instantiate any typedefs in the type. */
15606 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15607 r
= fold_convert (type
, t
);
15608 gcc_assert (TREE_CODE (r
) == code
);
15613 /* These can sometimes show up in a partial instantiation, but never
15614 involve template parms. */
15615 gcc_assert (!uses_template_parms (t
));
15618 case UNARY_LEFT_FOLD_EXPR
:
15619 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
15620 case UNARY_RIGHT_FOLD_EXPR
:
15621 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
15622 case BINARY_LEFT_FOLD_EXPR
:
15623 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
15624 case BINARY_RIGHT_FOLD_EXPR
:
15625 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
15629 case DEBUG_BEGIN_STMT
:
15630 /* ??? There's no point in copying it for now, but maybe some
15631 day it will contain more information, such as a pointer back
15632 to the containing function, inlined copy or so. */
15636 /* We shouldn't get here, but keep going if !flag_checking. */
15638 gcc_unreachable ();
15643 /* Helper function for tsubst_omp_clauses, used for instantiation of
15644 OMP_CLAUSE_DECL of clauses. */
15647 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
15650 if (decl
== NULL_TREE
)
15653 /* Handle an OpenMP array section represented as a TREE_LIST (or
15654 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
15655 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
15656 TREE_LIST. We can handle it exactly the same as an array section
15657 (purpose, value, and a chain), even though the nomenclature
15658 (low_bound, length, etc) is different. */
15659 if (TREE_CODE (decl
) == TREE_LIST
)
15662 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
15663 /*integral_constant_expression_p=*/false);
15664 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
15665 /*integral_constant_expression_p=*/false);
15666 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
15668 if (TREE_PURPOSE (decl
) == low_bound
15669 && TREE_VALUE (decl
) == length
15670 && TREE_CHAIN (decl
) == chain
)
15672 tree ret
= tree_cons (low_bound
, length
, chain
);
15673 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
15674 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
15677 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
15678 /*integral_constant_expression_p=*/false);
15679 /* Undo convert_from_reference tsubst_expr could have called. */
15681 && REFERENCE_REF_P (ret
)
15682 && !REFERENCE_REF_P (decl
))
15683 ret
= TREE_OPERAND (ret
, 0);
15687 /* Like tsubst_copy, but specifically for OpenMP clauses. */
15690 tsubst_omp_clauses (tree clauses
, enum c_omp_region_type ort
,
15691 tree args
, tsubst_flags_t complain
, tree in_decl
)
15693 tree new_clauses
= NULL_TREE
, nc
, oc
;
15694 tree linear_no_step
= NULL_TREE
;
15696 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
15698 nc
= copy_node (oc
);
15699 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
15702 switch (OMP_CLAUSE_CODE (nc
))
15704 case OMP_CLAUSE_LASTPRIVATE
:
15705 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
15707 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
15708 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
15709 in_decl
, /*integral_constant_expression_p=*/false);
15710 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
15711 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
15714 case OMP_CLAUSE_PRIVATE
:
15715 case OMP_CLAUSE_SHARED
:
15716 case OMP_CLAUSE_FIRSTPRIVATE
:
15717 case OMP_CLAUSE_COPYIN
:
15718 case OMP_CLAUSE_COPYPRIVATE
:
15719 case OMP_CLAUSE_UNIFORM
:
15720 case OMP_CLAUSE_DEPEND
:
15721 case OMP_CLAUSE_FROM
:
15722 case OMP_CLAUSE_TO
:
15723 case OMP_CLAUSE_MAP
:
15724 case OMP_CLAUSE_USE_DEVICE_PTR
:
15725 case OMP_CLAUSE_IS_DEVICE_PTR
:
15726 OMP_CLAUSE_DECL (nc
)
15727 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
15730 case OMP_CLAUSE_TILE
:
15731 case OMP_CLAUSE_IF
:
15732 case OMP_CLAUSE_NUM_THREADS
:
15733 case OMP_CLAUSE_SCHEDULE
:
15734 case OMP_CLAUSE_COLLAPSE
:
15735 case OMP_CLAUSE_FINAL
:
15736 case OMP_CLAUSE_DEVICE
:
15737 case OMP_CLAUSE_DIST_SCHEDULE
:
15738 case OMP_CLAUSE_NUM_TEAMS
:
15739 case OMP_CLAUSE_THREAD_LIMIT
:
15740 case OMP_CLAUSE_SAFELEN
:
15741 case OMP_CLAUSE_SIMDLEN
:
15742 case OMP_CLAUSE_NUM_TASKS
:
15743 case OMP_CLAUSE_GRAINSIZE
:
15744 case OMP_CLAUSE_PRIORITY
:
15745 case OMP_CLAUSE_ORDERED
:
15746 case OMP_CLAUSE_HINT
:
15747 case OMP_CLAUSE_NUM_GANGS
:
15748 case OMP_CLAUSE_NUM_WORKERS
:
15749 case OMP_CLAUSE_VECTOR_LENGTH
:
15750 case OMP_CLAUSE_WORKER
:
15751 case OMP_CLAUSE_VECTOR
:
15752 case OMP_CLAUSE_ASYNC
:
15753 case OMP_CLAUSE_WAIT
:
15754 OMP_CLAUSE_OPERAND (nc
, 0)
15755 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
15756 in_decl
, /*integral_constant_expression_p=*/false);
15758 case OMP_CLAUSE_REDUCTION
:
15759 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
15761 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
15762 if (TREE_CODE (placeholder
) == SCOPE_REF
)
15764 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
15765 complain
, in_decl
);
15766 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
15767 = build_qualified_name (NULL_TREE
, scope
,
15768 TREE_OPERAND (placeholder
, 1),
15772 gcc_assert (identifier_p (placeholder
));
15774 OMP_CLAUSE_DECL (nc
)
15775 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
15778 case OMP_CLAUSE_GANG
:
15779 case OMP_CLAUSE_ALIGNED
:
15780 OMP_CLAUSE_DECL (nc
)
15781 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
15783 OMP_CLAUSE_OPERAND (nc
, 1)
15784 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
15785 in_decl
, /*integral_constant_expression_p=*/false);
15787 case OMP_CLAUSE_LINEAR
:
15788 OMP_CLAUSE_DECL (nc
)
15789 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
15791 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
15793 gcc_assert (!linear_no_step
);
15794 linear_no_step
= nc
;
15796 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
15797 OMP_CLAUSE_LINEAR_STEP (nc
)
15798 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
15799 complain
, in_decl
);
15801 OMP_CLAUSE_LINEAR_STEP (nc
)
15802 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
15804 /*integral_constant_expression_p=*/false);
15806 case OMP_CLAUSE_NOWAIT
:
15807 case OMP_CLAUSE_DEFAULT
:
15808 case OMP_CLAUSE_UNTIED
:
15809 case OMP_CLAUSE_MERGEABLE
:
15810 case OMP_CLAUSE_INBRANCH
:
15811 case OMP_CLAUSE_NOTINBRANCH
:
15812 case OMP_CLAUSE_PROC_BIND
:
15813 case OMP_CLAUSE_FOR
:
15814 case OMP_CLAUSE_PARALLEL
:
15815 case OMP_CLAUSE_SECTIONS
:
15816 case OMP_CLAUSE_TASKGROUP
:
15817 case OMP_CLAUSE_NOGROUP
:
15818 case OMP_CLAUSE_THREADS
:
15819 case OMP_CLAUSE_SIMD
:
15820 case OMP_CLAUSE_DEFAULTMAP
:
15821 case OMP_CLAUSE_INDEPENDENT
:
15822 case OMP_CLAUSE_AUTO
:
15823 case OMP_CLAUSE_SEQ
:
15826 gcc_unreachable ();
15828 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
)
15829 switch (OMP_CLAUSE_CODE (nc
))
15831 case OMP_CLAUSE_SHARED
:
15832 case OMP_CLAUSE_PRIVATE
:
15833 case OMP_CLAUSE_FIRSTPRIVATE
:
15834 case OMP_CLAUSE_LASTPRIVATE
:
15835 case OMP_CLAUSE_COPYPRIVATE
:
15836 case OMP_CLAUSE_LINEAR
:
15837 case OMP_CLAUSE_REDUCTION
:
15838 case OMP_CLAUSE_USE_DEVICE_PTR
:
15839 case OMP_CLAUSE_IS_DEVICE_PTR
:
15840 /* tsubst_expr on SCOPE_REF results in returning
15841 finish_non_static_data_member result. Undo that here. */
15842 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
15843 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
15844 == IDENTIFIER_NODE
))
15846 tree t
= OMP_CLAUSE_DECL (nc
);
15849 switch (TREE_CODE (v
))
15851 case COMPONENT_REF
:
15855 case POINTER_PLUS_EXPR
:
15856 v
= TREE_OPERAND (v
, 0);
15859 if (DECL_CONTEXT (v
) == current_function_decl
15860 && DECL_ARTIFICIAL (v
)
15861 && DECL_NAME (v
) == this_identifier
)
15862 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
15869 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
15870 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
15871 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
15872 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
15873 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
15875 tree decl
= OMP_CLAUSE_DECL (nc
);
15878 retrofit_lang_decl (decl
);
15879 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
15888 new_clauses
= nreverse (new_clauses
);
15889 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
15891 new_clauses
= finish_omp_clauses (new_clauses
, ort
);
15892 if (linear_no_step
)
15893 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
15894 if (nc
== linear_no_step
)
15896 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
15900 return new_clauses
;
15903 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
15906 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
15909 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
15911 tree purpose
, value
, chain
;
15916 if (TREE_CODE (t
) != TREE_LIST
)
15917 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15918 /*function_p=*/false,
15919 /*integral_constant_expression_p=*/false);
15921 if (t
== void_list_node
)
15924 purpose
= TREE_PURPOSE (t
);
15926 purpose
= RECUR (purpose
);
15927 value
= TREE_VALUE (t
);
15930 if (TREE_CODE (value
) != LABEL_DECL
)
15931 value
= RECUR (value
);
15934 value
= lookup_label (DECL_NAME (value
));
15935 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
15936 TREE_USED (value
) = 1;
15939 chain
= TREE_CHAIN (t
);
15940 if (chain
&& chain
!= void_type_node
)
15941 chain
= RECUR (chain
);
15942 return tree_cons (purpose
, value
, chain
);
15946 /* Used to temporarily communicate the list of #pragma omp parallel
15947 clauses to #pragma omp for instantiation if they are combined
15950 static tree
*omp_parallel_combined_clauses
;
15952 /* Substitute one OMP_FOR iterator. */
15955 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
15956 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
15957 tree args
, tsubst_flags_t complain
, tree in_decl
,
15958 bool integral_constant_expression_p
)
15960 #define RECUR(NODE) \
15961 tsubst_expr ((NODE), args, complain, in_decl, \
15962 integral_constant_expression_p)
15963 tree decl
, init
, cond
, incr
;
15965 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
15966 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
15968 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
15970 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
15971 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
15974 decl
= TREE_OPERAND (init
, 0);
15975 init
= TREE_OPERAND (init
, 1);
15976 tree decl_expr
= NULL_TREE
;
15977 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
15979 /* We need to jump through some hoops to handle declarations in the
15980 init-statement, since we might need to handle auto deduction,
15981 but we need to keep control of initialization. */
15983 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
15984 decl
= tsubst_decl (decl
, args
, complain
);
15988 if (TREE_CODE (decl
) == SCOPE_REF
)
15990 decl
= RECUR (decl
);
15991 if (TREE_CODE (decl
) == COMPONENT_REF
)
15995 switch (TREE_CODE (v
))
15997 case COMPONENT_REF
:
16001 case POINTER_PLUS_EXPR
:
16002 v
= TREE_OPERAND (v
, 0);
16005 if (DECL_CONTEXT (v
) == current_function_decl
16006 && DECL_ARTIFICIAL (v
)
16007 && DECL_NAME (v
) == this_identifier
)
16009 decl
= TREE_OPERAND (decl
, 1);
16010 decl
= omp_privatize_field (decl
, false);
16020 decl
= RECUR (decl
);
16022 init
= RECUR (init
);
16024 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
16025 if (auto_node
&& init
)
16027 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
, complain
);
16029 gcc_assert (!type_dependent_expression_p (decl
));
16031 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
16035 /* Declare the variable, but don't let that initialize it. */
16036 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
16037 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
16039 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
16042 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
16043 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16044 if (TREE_CODE (incr
) == MODIFY_EXPR
)
16046 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16047 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
16048 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
16049 NOP_EXPR
, rhs
, complain
);
16052 incr
= RECUR (incr
);
16053 TREE_VEC_ELT (declv
, i
) = decl
;
16054 TREE_VEC_ELT (initv
, i
) = init
;
16055 TREE_VEC_ELT (condv
, i
) = cond
;
16056 TREE_VEC_ELT (incrv
, i
) = incr
;
16062 /* Declare and initialize the variable. */
16070 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
16072 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
16074 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
16075 && OMP_CLAUSE_DECL (*pc
) == decl
)
16077 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
16078 && OMP_CLAUSE_DECL (*pc
) == decl
)
16082 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
16084 *pc
= OMP_CLAUSE_CHAIN (c
);
16085 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16088 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
16089 && OMP_CLAUSE_DECL (*pc
) == decl
)
16091 error ("iteration variable %qD should not be firstprivate",
16093 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16095 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
16096 && OMP_CLAUSE_DECL (*pc
) == decl
)
16098 error ("iteration variable %qD should not be reduction",
16100 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16103 pc
= &OMP_CLAUSE_CHAIN (*pc
);
16108 if (*pc
== NULL_TREE
)
16110 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
16111 OMP_CLAUSE_DECL (c
) = decl
;
16112 c
= finish_omp_clauses (c
, C_ORT_OMP
);
16115 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16120 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
16121 if (COMPARISON_CLASS_P (cond
))
16123 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
16124 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
16125 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
16128 cond
= RECUR (cond
);
16129 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16130 switch (TREE_CODE (incr
))
16132 case PREINCREMENT_EXPR
:
16133 case PREDECREMENT_EXPR
:
16134 case POSTINCREMENT_EXPR
:
16135 case POSTDECREMENT_EXPR
:
16136 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
16137 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
16140 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16141 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16143 tree rhs
= TREE_OPERAND (incr
, 1);
16144 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16145 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16146 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16147 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16148 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16152 incr
= RECUR (incr
);
16155 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16156 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16158 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16159 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16160 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
16161 TREE_TYPE (decl
), lhs
,
16162 RECUR (TREE_OPERAND (incr
, 2))));
16164 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
16165 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
16166 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
16168 tree rhs
= TREE_OPERAND (incr
, 2);
16169 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16170 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16171 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16172 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16173 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16177 incr
= RECUR (incr
);
16180 incr
= RECUR (incr
);
16184 TREE_VEC_ELT (declv
, i
) = decl
;
16185 TREE_VEC_ELT (initv
, i
) = init
;
16186 TREE_VEC_ELT (condv
, i
) = cond
;
16187 TREE_VEC_ELT (incrv
, i
) = incr
;
16191 /* Helper function of tsubst_expr, find OMP_TEAMS inside
16192 of OMP_TARGET's body. */
16195 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
16197 *walk_subtrees
= 0;
16198 switch (TREE_CODE (*tp
))
16203 case STATEMENT_LIST
:
16204 *walk_subtrees
= 1;
16212 /* Helper function for tsubst_expr. For decomposition declaration
16213 artificial base DECL, which is tsubsted PATTERN_DECL, tsubst
16214 also the corresponding decls representing the identifiers
16215 of the decomposition declaration. Return DECL if successful
16216 or error_mark_node otherwise, set *FIRST to the first decl
16217 in the list chained through DECL_CHAIN and *CNT to the number
16221 tsubst_decomp_names (tree decl
, tree pattern_decl
, tree args
,
16222 tsubst_flags_t complain
, tree in_decl
, tree
*first
,
16225 tree decl2
, decl3
, prev
= decl
;
16227 gcc_assert (DECL_NAME (decl
) == NULL_TREE
);
16228 for (decl2
= DECL_CHAIN (pattern_decl
);
16231 && DECL_DECOMPOSITION_P (decl2
)
16232 && DECL_NAME (decl2
);
16233 decl2
= DECL_CHAIN (decl2
))
16235 if (TREE_TYPE (decl2
) == error_mark_node
&& *cnt
== 0)
16237 gcc_assert (errorcount
);
16238 return error_mark_node
;
16241 gcc_assert (DECL_DECOMP_BASE (decl2
) == pattern_decl
);
16242 gcc_assert (DECL_HAS_VALUE_EXPR_P (decl2
));
16243 tree v
= DECL_VALUE_EXPR (decl2
);
16244 DECL_HAS_VALUE_EXPR_P (decl2
) = 0;
16245 SET_DECL_VALUE_EXPR (decl2
, NULL_TREE
);
16246 decl3
= tsubst (decl2
, args
, complain
, in_decl
);
16247 SET_DECL_VALUE_EXPR (decl2
, v
);
16248 DECL_HAS_VALUE_EXPR_P (decl2
) = 1;
16250 DECL_TEMPLATE_INSTANTIATED (decl3
) = 1;
16253 gcc_assert (errorcount
);
16254 decl
= error_mark_node
;
16257 maybe_push_decl (decl3
);
16258 if (error_operand_p (decl3
))
16259 decl
= error_mark_node
;
16260 else if (decl
!= error_mark_node
16261 && DECL_CHAIN (decl3
) != prev
16264 gcc_assert (errorcount
);
16265 decl
= error_mark_node
;
16274 /* Like tsubst_copy for expressions, etc. but also does semantic
16278 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
16279 bool integral_constant_expression_p
)
16281 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
16282 #define RECUR(NODE) \
16283 tsubst_expr ((NODE), args, complain, in_decl, \
16284 integral_constant_expression_p)
16290 if (t
== NULL_TREE
|| t
== error_mark_node
)
16293 loc
= input_location
;
16294 if (EXPR_HAS_LOCATION (t
))
16295 input_location
= EXPR_LOCATION (t
);
16296 if (STATEMENT_CODE_P (TREE_CODE (t
)))
16297 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
16299 switch (TREE_CODE (t
))
16301 case STATEMENT_LIST
:
16303 tree_stmt_iterator i
;
16304 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
16305 RECUR (tsi_stmt (i
));
16309 case CTOR_INITIALIZER
:
16310 finish_mem_initializers (tsubst_initializer_list
16311 (TREE_OPERAND (t
, 0), args
));
16315 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
16319 tmp
= RECUR (EXPR_STMT_EXPR (t
));
16320 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
16321 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
16323 finish_expr_stmt (tmp
);
16327 finish_local_using_directive (USING_STMT_NAMESPACE (t
),
16328 /*attribs=*/NULL_TREE
);
16333 tree decl
, pattern_decl
;
16336 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
16337 if (TREE_CODE (decl
) == LABEL_DECL
)
16338 finish_label_decl (DECL_NAME (decl
));
16339 else if (TREE_CODE (decl
) == USING_DECL
)
16341 tree scope
= USING_DECL_SCOPE (decl
);
16342 tree name
= DECL_NAME (decl
);
16344 scope
= tsubst (scope
, args
, complain
, in_decl
);
16345 decl
= lookup_qualified_name (scope
, name
,
16346 /*is_type_p=*/false,
16347 /*complain=*/false);
16348 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
16349 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
16351 finish_local_using_decl (decl
, scope
, name
);
16353 else if (is_capture_proxy (decl
)
16354 && !DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
16356 /* We're in tsubst_lambda_expr, we've already inserted a new
16357 capture proxy, so look it up and register it. */
16359 if (DECL_PACK_P (decl
))
16361 inst
= (retrieve_local_specialization
16362 (DECL_CAPTURED_VARIABLE (decl
)));
16363 gcc_assert (TREE_CODE (inst
) == NONTYPE_ARGUMENT_PACK
);
16367 inst
= lookup_name_real (DECL_NAME (decl
), 0, 0,
16368 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
16369 gcc_assert (inst
!= decl
&& is_capture_proxy (inst
));
16371 register_local_specialization (inst
, decl
);
16374 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
16375 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
16376 /* Don't copy the old closure; we'll create a new one in
16377 tsubst_lambda_expr. */
16381 init
= DECL_INITIAL (decl
);
16382 decl
= tsubst (decl
, args
, complain
, in_decl
);
16383 if (decl
!= error_mark_node
)
16385 /* By marking the declaration as instantiated, we avoid
16386 trying to instantiate it. Since instantiate_decl can't
16387 handle local variables, and since we've already done
16388 all that needs to be done, that's the right thing to
16391 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
16393 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
16394 /* Anonymous aggregates are a special case. */
16395 finish_anon_union (decl
);
16396 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
16398 DECL_CONTEXT (decl
) = current_function_decl
;
16399 if (DECL_NAME (decl
) == this_identifier
)
16401 tree lam
= DECL_CONTEXT (current_function_decl
);
16402 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
16403 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
16405 insert_capture_proxy (decl
);
16407 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
16408 /* We already did a pushtag. */;
16409 else if (TREE_CODE (decl
) == FUNCTION_DECL
16410 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
16411 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
16413 DECL_CONTEXT (decl
) = NULL_TREE
;
16415 DECL_CONTEXT (decl
) = current_function_decl
;
16416 cp_check_omp_declare_reduction (decl
);
16420 int const_init
= false;
16421 maybe_push_decl (decl
);
16423 && DECL_PRETTY_FUNCTION_P (decl
))
16425 /* For __PRETTY_FUNCTION__ we have to adjust the
16427 const char *const name
16428 = cxx_printable_name (current_function_decl
, 2);
16429 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
16432 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
16435 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
16438 && DECL_DECOMPOSITION_P (decl
)
16439 && TREE_TYPE (pattern_decl
) != error_mark_node
)
16444 = tsubst_decomp_names (decl
, pattern_decl
, args
,
16445 complain
, in_decl
, &first
, &cnt
);
16446 if (ndecl
!= error_mark_node
)
16447 cp_maybe_mangle_decomp (ndecl
, first
, cnt
);
16448 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
16449 if (ndecl
!= error_mark_node
)
16450 cp_finish_decomp (ndecl
, first
, cnt
);
16453 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
16462 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
16463 RECUR (FOR_INIT_STMT (t
));
16464 finish_init_stmt (stmt
);
16465 tmp
= RECUR (FOR_COND (t
));
16466 finish_for_cond (tmp
, stmt
, false, 0);
16467 tmp
= RECUR (FOR_EXPR (t
));
16468 finish_for_expr (tmp
, stmt
);
16470 bool prev
= note_iteration_stmt_body_start ();
16471 RECUR (FOR_BODY (t
));
16472 note_iteration_stmt_body_end (prev
);
16474 finish_for_stmt (stmt
);
16477 case RANGE_FOR_STMT
:
16479 /* Construct another range_for, if this is not a final
16480 substitution (for inside inside a generic lambda of a
16481 template). Otherwise convert to a regular for. */
16483 stmt
= (processing_template_decl
16484 ? begin_range_for_stmt (NULL_TREE
, NULL_TREE
)
16485 : begin_for_stmt (NULL_TREE
, NULL_TREE
));
16486 decl
= RANGE_FOR_DECL (t
);
16487 decl
= tsubst (decl
, args
, complain
, in_decl
);
16488 maybe_push_decl (decl
);
16489 expr
= RECUR (RANGE_FOR_EXPR (t
));
16491 tree decomp_first
= NULL_TREE
;
16492 unsigned decomp_cnt
= 0;
16493 if (VAR_P (decl
) && DECL_DECOMPOSITION_P (decl
))
16494 decl
= tsubst_decomp_names (decl
, RANGE_FOR_DECL (t
), args
,
16496 &decomp_first
, &decomp_cnt
);
16498 if (processing_template_decl
)
16500 RANGE_FOR_IVDEP (stmt
) = RANGE_FOR_IVDEP (t
);
16501 RANGE_FOR_UNROLL (stmt
) = RANGE_FOR_UNROLL (t
);
16502 finish_range_for_decl (stmt
, decl
, expr
);
16506 unsigned short unroll
= (RANGE_FOR_UNROLL (t
)
16507 ? tree_to_uhwi (RANGE_FOR_UNROLL (t
)) : 0);
16508 stmt
= cp_convert_range_for (stmt
, decl
, expr
,
16509 decomp_first
, decomp_cnt
,
16510 RANGE_FOR_IVDEP (t
), unroll
);
16513 bool prev
= note_iteration_stmt_body_start ();
16514 RECUR (RANGE_FOR_BODY (t
));
16515 note_iteration_stmt_body_end (prev
);
16516 finish_for_stmt (stmt
);
16521 stmt
= begin_while_stmt ();
16522 tmp
= RECUR (WHILE_COND (t
));
16523 finish_while_stmt_cond (tmp
, stmt
, false, 0);
16525 bool prev
= note_iteration_stmt_body_start ();
16526 RECUR (WHILE_BODY (t
));
16527 note_iteration_stmt_body_end (prev
);
16529 finish_while_stmt (stmt
);
16533 stmt
= begin_do_stmt ();
16535 bool prev
= note_iteration_stmt_body_start ();
16536 RECUR (DO_BODY (t
));
16537 note_iteration_stmt_body_end (prev
);
16539 finish_do_body (stmt
);
16540 tmp
= RECUR (DO_COND (t
));
16541 finish_do_stmt (tmp
, stmt
, false, 0);
16545 stmt
= begin_if_stmt ();
16546 IF_STMT_CONSTEXPR_P (stmt
) = IF_STMT_CONSTEXPR_P (t
);
16547 if (IF_STMT_CONSTEXPR_P (t
))
16548 args
= add_extra_args (IF_STMT_EXTRA_ARGS (t
), args
);
16549 tmp
= RECUR (IF_COND (t
));
16550 tmp
= finish_if_stmt_cond (tmp
, stmt
);
16551 if (IF_STMT_CONSTEXPR_P (t
)
16552 && instantiation_dependent_expression_p (tmp
))
16554 /* We're partially instantiating a generic lambda, but the condition
16555 of the constexpr if is still dependent. Don't substitute into the
16556 branches now, just remember the template arguments. */
16557 do_poplevel (IF_SCOPE (stmt
));
16558 IF_COND (stmt
) = IF_COND (t
);
16559 THEN_CLAUSE (stmt
) = THEN_CLAUSE (t
);
16560 ELSE_CLAUSE (stmt
) = ELSE_CLAUSE (t
);
16561 IF_STMT_EXTRA_ARGS (stmt
) = build_extra_args (t
, args
, complain
);
16565 if (IF_STMT_CONSTEXPR_P (t
) && integer_zerop (tmp
))
16566 /* Don't instantiate the THEN_CLAUSE. */;
16569 bool inhibit
= integer_zerop (fold_non_dependent_expr (tmp
));
16571 ++c_inhibit_evaluation_warnings
;
16572 RECUR (THEN_CLAUSE (t
));
16574 --c_inhibit_evaluation_warnings
;
16576 finish_then_clause (stmt
);
16578 if (IF_STMT_CONSTEXPR_P (t
) && integer_nonzerop (tmp
))
16579 /* Don't instantiate the ELSE_CLAUSE. */;
16580 else if (ELSE_CLAUSE (t
))
16582 bool inhibit
= integer_nonzerop (fold_non_dependent_expr (tmp
));
16583 begin_else_clause (stmt
);
16585 ++c_inhibit_evaluation_warnings
;
16586 RECUR (ELSE_CLAUSE (t
));
16588 --c_inhibit_evaluation_warnings
;
16589 finish_else_clause (stmt
);
16592 finish_if_stmt (stmt
);
16596 if (BIND_EXPR_BODY_BLOCK (t
))
16597 stmt
= begin_function_body ();
16599 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
16600 ? BCS_TRY_BLOCK
: 0);
16602 RECUR (BIND_EXPR_BODY (t
));
16604 if (BIND_EXPR_BODY_BLOCK (t
))
16605 finish_function_body (stmt
);
16607 finish_compound_stmt (stmt
);
16611 finish_break_stmt ();
16614 case CONTINUE_STMT
:
16615 finish_continue_stmt ();
16619 stmt
= begin_switch_stmt ();
16620 tmp
= RECUR (SWITCH_STMT_COND (t
));
16621 finish_switch_cond (tmp
, stmt
);
16622 RECUR (SWITCH_STMT_BODY (t
));
16623 finish_switch_stmt (stmt
);
16626 case CASE_LABEL_EXPR
:
16628 tree low
= RECUR (CASE_LOW (t
));
16629 tree high
= RECUR (CASE_HIGH (t
));
16630 tree l
= finish_case_label (EXPR_LOCATION (t
), low
, high
);
16631 if (l
&& TREE_CODE (l
) == CASE_LABEL_EXPR
)
16632 FALLTHROUGH_LABEL_P (CASE_LABEL (l
))
16633 = FALLTHROUGH_LABEL_P (CASE_LABEL (t
));
16639 tree decl
= LABEL_EXPR_LABEL (t
);
16642 label
= finish_label_stmt (DECL_NAME (decl
));
16643 if (TREE_CODE (label
) == LABEL_DECL
)
16644 FALLTHROUGH_LABEL_P (label
) = FALLTHROUGH_LABEL_P (decl
);
16645 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
16646 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
16651 tmp
= GOTO_DESTINATION (t
);
16652 if (TREE_CODE (tmp
) != LABEL_DECL
)
16653 /* Computed goto's must be tsubst'd into. On the other hand,
16654 non-computed gotos must not be; the identifier in question
16655 will have no binding. */
16658 tmp
= DECL_NAME (tmp
);
16659 finish_goto_stmt (tmp
);
16664 tree string
= RECUR (ASM_STRING (t
));
16665 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
16666 complain
, in_decl
);
16667 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
16668 complain
, in_decl
);
16669 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
16670 complain
, in_decl
);
16671 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
16672 complain
, in_decl
);
16673 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
16675 tree asm_expr
= tmp
;
16676 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
16677 asm_expr
= TREE_OPERAND (asm_expr
, 0);
16678 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
16685 stmt
= begin_try_block ();
16686 RECUR (TRY_STMTS (t
));
16687 finish_cleanup_try_block (stmt
);
16688 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
16692 tree compound_stmt
= NULL_TREE
;
16694 if (FN_TRY_BLOCK_P (t
))
16695 stmt
= begin_function_try_block (&compound_stmt
);
16697 stmt
= begin_try_block ();
16699 RECUR (TRY_STMTS (t
));
16701 if (FN_TRY_BLOCK_P (t
))
16702 finish_function_try_block (stmt
);
16704 finish_try_block (stmt
);
16706 RECUR (TRY_HANDLERS (t
));
16707 if (FN_TRY_BLOCK_P (t
))
16708 finish_function_handler_sequence (stmt
, compound_stmt
);
16710 finish_handler_sequence (stmt
);
16716 tree decl
= HANDLER_PARMS (t
);
16720 decl
= tsubst (decl
, args
, complain
, in_decl
);
16721 /* Prevent instantiate_decl from trying to instantiate
16722 this variable. We've already done all that needs to be
16724 if (decl
!= error_mark_node
)
16725 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
16727 stmt
= begin_handler ();
16728 finish_handler_parms (decl
, stmt
);
16729 RECUR (HANDLER_BODY (t
));
16730 finish_handler (stmt
);
16735 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
16736 if (CLASS_TYPE_P (tmp
))
16738 /* Local classes are not independent templates; they are
16739 instantiated along with their containing function. And this
16740 way we don't have to deal with pushing out of one local class
16741 to instantiate a member of another local class. */
16742 /* Closures are handled by the LAMBDA_EXPR. */
16743 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
16744 complete_type (tmp
);
16745 for (tree fld
= TYPE_FIELDS (tmp
); fld
; fld
= DECL_CHAIN (fld
))
16747 || (TREE_CODE (fld
) == FUNCTION_DECL
16748 && !DECL_ARTIFICIAL (fld
)))
16749 && DECL_TEMPLATE_INSTANTIATION (fld
))
16750 instantiate_decl (fld
, /*defer_ok=*/false,
16751 /*expl_inst_class=*/false);
16755 case STATIC_ASSERT
:
16759 ++c_inhibit_evaluation_warnings
;
16761 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
16764 /*integral_constant_expression_p=*/true);
16765 --c_inhibit_evaluation_warnings
;
16767 finish_static_assert (condition
,
16768 STATIC_ASSERT_MESSAGE (t
),
16769 STATIC_ASSERT_SOURCE_LOCATION (t
),
16770 /*member_p=*/false);
16775 case OACC_PARALLEL
:
16776 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_ACC
, args
, complain
,
16778 stmt
= begin_omp_parallel ();
16779 RECUR (OMP_BODY (t
));
16780 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
16784 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
16785 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), C_ORT_OMP
, args
,
16786 complain
, in_decl
);
16787 if (OMP_PARALLEL_COMBINED (t
))
16788 omp_parallel_combined_clauses
= &tmp
;
16789 stmt
= begin_omp_parallel ();
16790 RECUR (OMP_PARALLEL_BODY (t
));
16791 gcc_assert (omp_parallel_combined_clauses
== NULL
);
16792 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
16793 = OMP_PARALLEL_COMBINED (t
);
16794 pop_omp_privatization_clauses (r
);
16798 r
= push_omp_privatization_clauses (false);
16799 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), C_ORT_OMP
, args
,
16800 complain
, in_decl
);
16801 stmt
= begin_omp_task ();
16802 RECUR (OMP_TASK_BODY (t
));
16803 finish_omp_task (tmp
, stmt
);
16804 pop_omp_privatization_clauses (r
);
16809 case OMP_DISTRIBUTE
:
16813 tree clauses
, body
, pre_body
;
16814 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
16815 tree orig_declv
= NULL_TREE
;
16816 tree incrv
= NULL_TREE
;
16817 enum c_omp_region_type ort
= C_ORT_OMP
;
16820 if (TREE_CODE (t
) == OACC_LOOP
)
16823 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
16824 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), ort
, args
, complain
,
16826 if (OMP_FOR_INIT (t
) != NULL_TREE
)
16828 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
16829 if (OMP_FOR_ORIG_DECLS (t
))
16830 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
16831 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
16832 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
16833 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
16836 stmt
= begin_omp_structured_block ();
16838 pre_body
= push_stmt_list ();
16839 RECUR (OMP_FOR_PRE_BODY (t
));
16840 pre_body
= pop_stmt_list (pre_body
);
16842 if (OMP_FOR_INIT (t
) != NULL_TREE
)
16843 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
16844 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
16845 incrv
, &clauses
, args
, complain
, in_decl
,
16846 integral_constant_expression_p
);
16847 omp_parallel_combined_clauses
= NULL
;
16849 body
= push_stmt_list ();
16850 RECUR (OMP_FOR_BODY (t
));
16851 body
= pop_stmt_list (body
);
16853 if (OMP_FOR_INIT (t
) != NULL_TREE
)
16854 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
16855 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
16859 t
= make_node (TREE_CODE (t
));
16860 TREE_TYPE (t
) = void_type_node
;
16861 OMP_FOR_BODY (t
) = body
;
16862 OMP_FOR_PRE_BODY (t
) = pre_body
;
16863 OMP_FOR_CLAUSES (t
) = clauses
;
16864 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
16868 add_stmt (finish_omp_structured_block (stmt
));
16869 pop_omp_privatization_clauses (r
);
16874 omp_parallel_combined_clauses
= NULL
;
16879 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
16880 && OMP_TEAMS_COMBINED (t
));
16881 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_OMP
, args
, complain
,
16883 stmt
= push_stmt_list ();
16884 RECUR (OMP_BODY (t
));
16885 stmt
= pop_stmt_list (stmt
);
16888 OMP_BODY (t
) = stmt
;
16889 OMP_CLAUSES (t
) = tmp
;
16891 pop_omp_privatization_clauses (r
);
16895 case OMP_TARGET_DATA
:
16897 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), (TREE_CODE (t
) == OACC_DATA
)
16898 ? C_ORT_ACC
: C_ORT_OMP
, args
, complain
,
16900 keep_next_level (true);
16901 stmt
= begin_omp_structured_block ();
16903 RECUR (OMP_BODY (t
));
16904 stmt
= finish_omp_structured_block (stmt
);
16907 OMP_BODY (t
) = stmt
;
16908 OMP_CLAUSES (t
) = tmp
;
16909 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
16911 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
16914 /* For combined target teams, ensure the num_teams and
16915 thread_limit clause expressions are evaluated on the host,
16916 before entering the target construct. */
16918 for (c
= OMP_TEAMS_CLAUSES (teams
);
16919 c
; c
= OMP_CLAUSE_CHAIN (c
))
16920 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
16921 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
16922 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
16924 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
16925 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
16926 if (expr
== error_mark_node
)
16928 tmp
= TARGET_EXPR_SLOT (expr
);
16930 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
16931 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
16932 OMP_CLAUSE_FIRSTPRIVATE
);
16933 OMP_CLAUSE_DECL (tc
) = tmp
;
16934 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
16935 OMP_TARGET_CLAUSES (t
) = tc
;
16944 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), C_ORT_ACC
, args
,
16945 complain
, in_decl
);
16946 OACC_DECLARE_CLAUSES (t
) = tmp
;
16950 case OMP_TARGET_UPDATE
:
16951 case OMP_TARGET_ENTER_DATA
:
16952 case OMP_TARGET_EXIT_DATA
:
16953 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_OMP
, args
,
16954 complain
, in_decl
);
16956 OMP_STANDALONE_CLAUSES (t
) = tmp
;
16960 case OACC_ENTER_DATA
:
16961 case OACC_EXIT_DATA
:
16963 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_ACC
, args
,
16964 complain
, in_decl
);
16966 OMP_STANDALONE_CLAUSES (t
) = tmp
;
16971 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), C_ORT_OMP
, args
,
16972 complain
, in_decl
);
16973 stmt
= push_stmt_list ();
16974 RECUR (OMP_BODY (t
));
16975 stmt
= pop_stmt_list (stmt
);
16978 OMP_BODY (t
) = stmt
;
16979 OMP_ORDERED_CLAUSES (t
) = tmp
;
16985 case OMP_TASKGROUP
:
16986 stmt
= push_stmt_list ();
16987 RECUR (OMP_BODY (t
));
16988 stmt
= pop_stmt_list (stmt
);
16991 OMP_BODY (t
) = stmt
;
16996 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
16997 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
16999 tree op1
= TREE_OPERAND (t
, 1);
17000 tree rhs1
= NULL_TREE
;
17002 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
17004 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
17005 op1
= TREE_OPERAND (op1
, 1);
17007 lhs
= RECUR (TREE_OPERAND (op1
, 0));
17008 rhs
= RECUR (TREE_OPERAND (op1
, 1));
17009 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
17010 NULL_TREE
, NULL_TREE
, rhs1
,
17011 OMP_ATOMIC_SEQ_CST (t
));
17015 tree op1
= TREE_OPERAND (t
, 1);
17016 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
17017 tree rhs1
= NULL_TREE
;
17018 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
17019 enum tree_code opcode
= NOP_EXPR
;
17020 if (code
== OMP_ATOMIC_READ
)
17022 v
= RECUR (TREE_OPERAND (op1
, 0));
17023 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
17025 else if (code
== OMP_ATOMIC_CAPTURE_OLD
17026 || code
== OMP_ATOMIC_CAPTURE_NEW
)
17028 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
17029 v
= RECUR (TREE_OPERAND (op1
, 0));
17030 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
17031 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
17033 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
17034 op11
= TREE_OPERAND (op11
, 1);
17036 lhs
= RECUR (TREE_OPERAND (op11
, 0));
17037 rhs
= RECUR (TREE_OPERAND (op11
, 1));
17038 opcode
= TREE_CODE (op11
);
17039 if (opcode
== MODIFY_EXPR
)
17045 lhs
= RECUR (TREE_OPERAND (op1
, 0));
17046 rhs
= RECUR (TREE_OPERAND (op1
, 1));
17048 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
17049 OMP_ATOMIC_SEQ_CST (t
));
17053 case TRANSACTION_EXPR
:
17056 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
17057 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
17059 if (TRANSACTION_EXPR_IS_STMT (t
))
17061 tree body
= TRANSACTION_EXPR_BODY (t
);
17062 tree noex
= NULL_TREE
;
17063 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
17065 noex
= MUST_NOT_THROW_COND (body
);
17066 if (noex
== NULL_TREE
)
17067 noex
= boolean_true_node
;
17068 body
= TREE_OPERAND (body
, 0);
17070 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
17072 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
17076 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
17077 RECUR (TRANSACTION_EXPR_BODY (t
)),
17084 case MUST_NOT_THROW_EXPR
:
17086 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17087 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
17088 RETURN (build_must_not_throw_expr (op0
, cond
));
17091 case EXPR_PACK_EXPANSION
:
17092 error ("invalid use of pack expansion expression");
17093 RETURN (error_mark_node
);
17095 case NONTYPE_ARGUMENT_PACK
:
17096 error ("use %<...%> to expand argument pack");
17097 RETURN (error_mark_node
);
17099 case COMPOUND_EXPR
:
17100 tmp
= RECUR (TREE_OPERAND (t
, 0));
17101 if (tmp
== NULL_TREE
)
17102 /* If the first operand was a statement, we're done with it. */
17103 RETURN (RECUR (TREE_OPERAND (t
, 1)));
17104 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
17105 RECUR (TREE_OPERAND (t
, 1)),
17108 case ANNOTATE_EXPR
:
17109 tmp
= RECUR (TREE_OPERAND (t
, 0));
17110 RETURN (build3_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
17111 TREE_TYPE (tmp
), tmp
,
17112 RECUR (TREE_OPERAND (t
, 1)),
17113 RECUR (TREE_OPERAND (t
, 2))));
17116 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
17118 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17119 /*function_p=*/false,
17120 integral_constant_expression_p
));
17123 RETURN (NULL_TREE
);
17125 input_location
= loc
;
17131 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
17132 function. For description of the body see comment above
17133 cp_parser_omp_declare_reduction_exprs. */
17136 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17138 if (t
== NULL_TREE
|| t
== error_mark_node
)
17141 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
17143 tree_stmt_iterator tsi
;
17146 memset (stmts
, 0, sizeof stmts
);
17147 for (i
= 0, tsi
= tsi_start (t
);
17148 i
< 7 && !tsi_end_p (tsi
);
17149 i
++, tsi_next (&tsi
))
17150 stmts
[i
] = tsi_stmt (tsi
);
17151 gcc_assert (tsi_end_p (tsi
));
17155 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
17156 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
17157 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
17158 args
, complain
, in_decl
);
17159 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
17160 args
, complain
, in_decl
);
17161 DECL_CONTEXT (omp_out
) = current_function_decl
;
17162 DECL_CONTEXT (omp_in
) = current_function_decl
;
17163 keep_next_level (true);
17164 tree block
= begin_omp_structured_block ();
17165 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
17166 block
= finish_omp_structured_block (block
);
17167 block
= maybe_cleanup_point_expr_void (block
);
17168 add_decl_expr (omp_out
);
17169 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
17170 TREE_NO_WARNING (omp_out
) = 1;
17171 add_decl_expr (omp_in
);
17172 finish_expr_stmt (block
);
17176 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
17177 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
17178 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
17179 args
, complain
, in_decl
);
17180 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
17181 args
, complain
, in_decl
);
17182 DECL_CONTEXT (omp_priv
) = current_function_decl
;
17183 DECL_CONTEXT (omp_orig
) = current_function_decl
;
17184 keep_next_level (true);
17185 tree block
= begin_omp_structured_block ();
17186 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
17187 block
= finish_omp_structured_block (block
);
17188 block
= maybe_cleanup_point_expr_void (block
);
17189 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
17190 add_decl_expr (omp_priv
);
17191 add_decl_expr (omp_orig
);
17192 finish_expr_stmt (block
);
17194 add_decl_expr (omp_orig
);
17198 /* T is a postfix-expression that is not being used in a function
17199 call. Return the substituted version of T. */
17202 tsubst_non_call_postfix_expression (tree t
, tree args
,
17203 tsubst_flags_t complain
,
17206 if (TREE_CODE (t
) == SCOPE_REF
)
17207 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
17208 /*done=*/false, /*address_p=*/false);
17210 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17211 /*function_p=*/false,
17212 /*integral_constant_expression_p=*/false);
17217 /* T is a LAMBDA_EXPR. Generate a new LAMBDA_EXPR for the current
17218 instantiation context. Instantiating a pack expansion containing a lambda
17219 might result in multiple lambdas all based on the same lambda in the
17223 tsubst_lambda_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17225 tree oldfn
= lambda_function (t
);
17228 tree r
= build_lambda_expr ();
17230 LAMBDA_EXPR_LOCATION (r
)
17231 = LAMBDA_EXPR_LOCATION (t
);
17232 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
17233 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
17234 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
17236 if (LAMBDA_EXPR_EXTRA_SCOPE (t
) == NULL_TREE
)
17237 LAMBDA_EXPR_EXTRA_SCOPE (r
) = NULL_TREE
;
17239 record_lambda_scope (r
);
17241 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
17242 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
17244 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
); cap
;
17245 cap
= TREE_CHAIN (cap
))
17247 tree field
= TREE_PURPOSE (cap
);
17248 if (PACK_EXPANSION_P (field
))
17249 field
= PACK_EXPANSION_PATTERN (field
);
17250 field
= tsubst_decl (field
, args
, complain
);
17252 if (field
== error_mark_node
)
17253 return error_mark_node
;
17255 tree init
= TREE_VALUE (cap
);
17256 if (PACK_EXPANSION_P (init
))
17257 init
= tsubst_pack_expansion (init
, args
, complain
, in_decl
);
17259 init
= tsubst_copy_and_build (init
, args
, complain
, in_decl
,
17260 /*fn*/false, /*constexpr*/false);
17262 if (TREE_CODE (field
) == TREE_VEC
)
17264 int len
= TREE_VEC_LENGTH (field
);
17265 gcc_assert (TREE_CODE (init
) == TREE_VEC
17266 && TREE_VEC_LENGTH (init
) == len
);
17267 for (int i
= 0; i
< len
; ++i
)
17268 LAMBDA_EXPR_CAPTURE_LIST (r
)
17269 = tree_cons (TREE_VEC_ELT (field
, i
),
17270 TREE_VEC_ELT (init
, i
),
17271 LAMBDA_EXPR_CAPTURE_LIST (r
));
17275 LAMBDA_EXPR_CAPTURE_LIST (r
)
17276 = tree_cons (field
, init
, LAMBDA_EXPR_CAPTURE_LIST (r
));
17278 if (id_equal (DECL_NAME (field
), "__this"))
17279 LAMBDA_EXPR_THIS_CAPTURE (r
) = field
;
17283 tree type
= begin_lambda_type (r
);
17285 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17286 determine_visibility (TYPE_NAME (type
));
17288 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (r
));
17290 tree oldtmpl
= (generic_lambda_fn_p (oldfn
)
17291 ? DECL_TI_TEMPLATE (oldfn
)
17294 tree fntype
= static_fn_type (oldfn
);
17296 ++processing_template_decl
;
17297 fntype
= tsubst (fntype
, args
, complain
, in_decl
);
17299 --processing_template_decl
;
17301 if (fntype
== error_mark_node
)
17302 r
= error_mark_node
;
17305 /* Fix the type of 'this'. */
17306 fntype
= build_memfn_type (fntype
, type
,
17307 type_memfn_quals (fntype
),
17308 type_memfn_rqual (fntype
));
17312 tmpl
= tsubst_template_decl (oldtmpl
, args
, complain
, fntype
);
17313 fn
= DECL_TEMPLATE_RESULT (tmpl
);
17314 finish_member_declaration (tmpl
);
17319 fn
= tsubst_function_decl (oldfn
, args
, complain
, fntype
);
17320 finish_member_declaration (fn
);
17323 /* Let finish_function set this. */
17324 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
17326 bool nested
= cfun
;
17328 push_function_context ();
17330 /* Still increment function_depth so that we don't GC in the
17331 middle of an expression. */
17334 local_specialization_stack
s (lss_copy
);
17336 tree body
= start_lambda_function (fn
, r
);
17338 register_parameter_specializations (oldfn
, fn
);
17340 tsubst_expr (DECL_SAVED_TREE (oldfn
), args
, complain
, r
,
17341 /*constexpr*/false);
17343 finish_lambda_function (body
);
17346 pop_function_context ();
17350 /* The capture list was built up in reverse order; fix that now. */
17351 LAMBDA_EXPR_CAPTURE_LIST (r
)
17352 = nreverse (LAMBDA_EXPR_CAPTURE_LIST (r
));
17354 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
17356 maybe_add_lambda_conv_op (type
);
17359 finish_struct (type
, /*attr*/NULL_TREE
);
17361 insert_pending_capture_proxies ();
17366 /* Like tsubst but deals with expressions and performs semantic
17367 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
17370 tsubst_copy_and_build (tree t
,
17372 tsubst_flags_t complain
,
17375 bool integral_constant_expression_p
)
17377 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
17378 #define RECUR(NODE) \
17379 tsubst_copy_and_build (NODE, args, complain, in_decl, \
17380 /*function_p=*/false, \
17381 integral_constant_expression_p)
17386 if (t
== NULL_TREE
|| t
== error_mark_node
)
17389 loc
= input_location
;
17390 if (EXPR_HAS_LOCATION (t
))
17391 input_location
= EXPR_LOCATION (t
);
17393 /* N3276 decltype magic only applies to calls at the top level or on the
17394 right side of a comma. */
17395 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
17396 complain
&= ~tf_decltype
;
17398 switch (TREE_CODE (t
))
17402 /* Fall through. */
17403 case IDENTIFIER_NODE
:
17407 bool non_integral_constant_expression_p
;
17408 const char *error_msg
;
17410 if (IDENTIFIER_CONV_OP_P (t
))
17412 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17413 t
= make_conv_op_name (new_type
);
17416 /* Look up the name. */
17417 decl
= lookup_name (t
);
17419 /* By convention, expressions use ERROR_MARK_NODE to indicate
17420 failure, not NULL_TREE. */
17421 if (decl
== NULL_TREE
)
17422 decl
= error_mark_node
;
17424 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
17426 integral_constant_expression_p
,
17427 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
17428 &non_integral_constant_expression_p
,
17429 /*template_p=*/false,
17431 /*address_p=*/false,
17432 /*template_arg_p=*/false,
17437 if (!function_p
&& identifier_p (decl
))
17439 if (complain
& tf_error
)
17440 unqualified_name_lookup_error (decl
);
17441 decl
= error_mark_node
;
17446 case TEMPLATE_ID_EXPR
:
17449 tree templ
= RECUR (TREE_OPERAND (t
, 0));
17450 tree targs
= TREE_OPERAND (t
, 1);
17453 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
17454 if (targs
== error_mark_node
)
17455 RETURN (error_mark_node
);
17457 if (TREE_CODE (templ
) == SCOPE_REF
)
17459 tree name
= TREE_OPERAND (templ
, 1);
17460 tree tid
= lookup_template_function (name
, targs
);
17461 TREE_OPERAND (templ
, 1) = tid
;
17465 if (variable_template_p (templ
))
17466 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
17468 if (TREE_CODE (templ
) == COMPONENT_REF
)
17470 object
= TREE_OPERAND (templ
, 0);
17471 templ
= TREE_OPERAND (templ
, 1);
17474 object
= NULL_TREE
;
17475 templ
= lookup_template_function (templ
, targs
);
17478 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
17479 object
, templ
, NULL_TREE
));
17481 RETURN (baselink_for_fns (templ
));
17486 tree r
= RECUR (TREE_OPERAND (t
, 0));
17488 if (REFERENCE_REF_P (t
))
17490 /* A type conversion to reference type will be enclosed in
17491 such an indirect ref, but the substitution of the cast
17492 will have also added such an indirect ref. */
17493 r
= convert_from_reference (r
);
17496 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
17497 complain
|decltype_flag
);
17499 if (REF_PARENTHESIZED_P (t
))
17500 r
= force_paren_expr (r
);
17507 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17508 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17509 RETURN (build_nop (type
, op0
));
17512 case IMPLICIT_CONV_EXPR
:
17514 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17515 tree expr
= RECUR (TREE_OPERAND (t
, 0));
17516 if (dependent_type_p (type
) || type_dependent_expression_p (expr
))
17518 retval
= copy_node (t
);
17519 TREE_TYPE (retval
) = type
;
17520 TREE_OPERAND (retval
, 0) = expr
;
17523 if (IMPLICIT_CONV_EXPR_NONTYPE_ARG (t
))
17524 /* We'll pass this to convert_nontype_argument again, we don't need
17525 to actually perform any conversion here. */
17527 int flags
= LOOKUP_IMPLICIT
;
17528 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
17529 flags
= LOOKUP_NORMAL
;
17530 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
17536 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17537 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17538 if (op0
== error_mark_node
)
17539 RETURN (error_mark_node
);
17540 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
17544 case REINTERPRET_CAST_EXPR
:
17545 case CONST_CAST_EXPR
:
17546 case DYNAMIC_CAST_EXPR
:
17547 case STATIC_CAST_EXPR
:
17550 tree op
, r
= NULL_TREE
;
17552 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17553 if (integral_constant_expression_p
17554 && !cast_valid_in_integral_constant_expression_p (type
))
17556 if (complain
& tf_error
)
17557 error ("a cast to a type other than an integral or "
17558 "enumeration type cannot appear in a constant-expression");
17559 RETURN (error_mark_node
);
17562 op
= RECUR (TREE_OPERAND (t
, 0));
17564 warning_sentinel
s(warn_useless_cast
);
17565 warning_sentinel
s2(warn_ignored_qualifiers
);
17566 switch (TREE_CODE (t
))
17569 r
= build_functional_cast (type
, op
, complain
);
17571 case REINTERPRET_CAST_EXPR
:
17572 r
= build_reinterpret_cast (type
, op
, complain
);
17574 case CONST_CAST_EXPR
:
17575 r
= build_const_cast (type
, op
, complain
);
17577 case DYNAMIC_CAST_EXPR
:
17578 r
= build_dynamic_cast (type
, op
, complain
);
17580 case STATIC_CAST_EXPR
:
17581 r
= build_static_cast (type
, op
, complain
);
17584 gcc_unreachable ();
17590 case POSTDECREMENT_EXPR
:
17591 case POSTINCREMENT_EXPR
:
17592 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17593 args
, complain
, in_decl
);
17594 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
17595 complain
|decltype_flag
));
17597 case PREDECREMENT_EXPR
:
17598 case PREINCREMENT_EXPR
:
17602 case TRUTH_NOT_EXPR
:
17603 case UNARY_PLUS_EXPR
: /* Unary + */
17604 case REALPART_EXPR
:
17605 case IMAGPART_EXPR
:
17606 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
17607 RECUR (TREE_OPERAND (t
, 0)),
17608 complain
|decltype_flag
));
17610 case FIX_TRUNC_EXPR
:
17611 gcc_unreachable ();
17614 op1
= TREE_OPERAND (t
, 0);
17615 if (TREE_CODE (op1
) == LABEL_DECL
)
17616 RETURN (finish_label_address_expr (DECL_NAME (op1
),
17617 EXPR_LOCATION (op1
)));
17618 if (TREE_CODE (op1
) == SCOPE_REF
)
17619 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
17620 /*done=*/true, /*address_p=*/true);
17622 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
17624 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
17625 complain
|decltype_flag
));
17630 case TRUNC_DIV_EXPR
:
17631 case CEIL_DIV_EXPR
:
17632 case FLOOR_DIV_EXPR
:
17633 case ROUND_DIV_EXPR
:
17634 case EXACT_DIV_EXPR
:
17638 case TRUNC_MOD_EXPR
:
17639 case FLOOR_MOD_EXPR
:
17640 case TRUTH_ANDIF_EXPR
:
17641 case TRUTH_ORIF_EXPR
:
17642 case TRUTH_AND_EXPR
:
17643 case TRUTH_OR_EXPR
:
17659 warning_sentinel
s1(warn_type_limits
);
17660 warning_sentinel
s2(warn_div_by_zero
);
17661 warning_sentinel
s3(warn_logical_op
);
17662 warning_sentinel
s4(warn_tautological_compare
);
17663 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17664 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17665 tree r
= build_x_binary_op
17666 (input_location
, TREE_CODE (t
),
17668 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
17670 : TREE_CODE (TREE_OPERAND (t
, 0))),
17672 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
17674 : TREE_CODE (TREE_OPERAND (t
, 1))),
17676 complain
|decltype_flag
);
17677 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
17678 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
17683 case POINTER_PLUS_EXPR
:
17685 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17686 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17687 RETURN (fold_build_pointer_plus (op0
, op1
));
17691 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
17692 /*address_p=*/false));
17694 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17695 args
, complain
, in_decl
);
17696 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
17697 RECUR (TREE_OPERAND (t
, 1)),
17698 complain
|decltype_flag
));
17701 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
17702 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
17703 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
17710 op1
= TREE_OPERAND (t
, 0);
17711 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
17712 op1
= TREE_TYPE (op1
);
17715 /* When there are no ARGS, we are trying to evaluate a
17716 non-dependent expression from the parser. Trying to do
17717 the substitutions may not work. */
17719 op1
= TREE_TYPE (op1
);
17723 ++cp_unevaluated_operand
;
17724 ++c_inhibit_evaluation_warnings
;
17726 op1
= tsubst (op1
, args
, complain
, in_decl
);
17728 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
17729 /*function_p=*/false,
17730 /*integral_constant_expression_p=*/
17732 --cp_unevaluated_operand
;
17733 --c_inhibit_evaluation_warnings
;
17736 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
17737 complain
& tf_error
);
17739 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
17740 complain
& tf_error
);
17741 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
17743 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
17745 if (!processing_template_decl
&& TYPE_P (op1
))
17747 r
= build_min (SIZEOF_EXPR
, size_type_node
,
17748 build1 (NOP_EXPR
, op1
, error_mark_node
));
17749 SIZEOF_EXPR_TYPE_P (r
) = 1;
17752 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
17753 TREE_SIDE_EFFECTS (r
) = 0;
17754 TREE_READONLY (r
) = 1;
17756 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
17761 case AT_ENCODE_EXPR
:
17763 op1
= TREE_OPERAND (t
, 0);
17764 ++cp_unevaluated_operand
;
17765 ++c_inhibit_evaluation_warnings
;
17766 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
17767 /*function_p=*/false,
17768 /*integral_constant_expression_p=*/false);
17769 --cp_unevaluated_operand
;
17770 --c_inhibit_evaluation_warnings
;
17771 RETURN (objc_build_encode_expr (op1
));
17774 case NOEXCEPT_EXPR
:
17775 op1
= TREE_OPERAND (t
, 0);
17776 ++cp_unevaluated_operand
;
17777 ++c_inhibit_evaluation_warnings
;
17778 ++cp_noexcept_operand
;
17779 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
17780 /*function_p=*/false,
17781 /*integral_constant_expression_p=*/false);
17782 --cp_unevaluated_operand
;
17783 --c_inhibit_evaluation_warnings
;
17784 --cp_noexcept_operand
;
17785 RETURN (finish_noexcept_expr (op1
, complain
));
17789 warning_sentinel
s(warn_div_by_zero
);
17790 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
17791 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
17792 tree r
= build_x_modify_expr
17793 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
17794 complain
|decltype_flag
);
17795 /* TREE_NO_WARNING must be set if either the expression was
17796 parenthesized or it uses an operator such as >>= rather
17797 than plain assignment. In the former case, it was already
17798 set and must be copied. In the latter case,
17799 build_x_modify_expr sets it and it must not be reset
17801 if (TREE_NO_WARNING (t
))
17802 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
17808 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17809 args
, complain
, in_decl
);
17810 /* Remember that there was a reference to this entity. */
17812 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
17813 RETURN (error_mark_node
);
17814 RETURN (build_x_arrow (input_location
, op1
, complain
));
17818 tree placement
= RECUR (TREE_OPERAND (t
, 0));
17819 tree init
= RECUR (TREE_OPERAND (t
, 3));
17820 vec
<tree
, va_gc
> *placement_vec
;
17821 vec
<tree
, va_gc
> *init_vec
;
17824 if (placement
== NULL_TREE
)
17825 placement_vec
= NULL
;
17828 placement_vec
= make_tree_vector ();
17829 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
17830 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
17833 /* If there was an initializer in the original tree, but it
17834 instantiated to an empty list, then we should pass a
17835 non-NULL empty vector to tell build_new that it was an
17836 empty initializer() rather than no initializer. This can
17837 only happen when the initializer is a pack expansion whose
17838 parameter packs are of length zero. */
17839 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
17843 init_vec
= make_tree_vector ();
17844 if (init
== void_node
)
17845 gcc_assert (init_vec
!= NULL
);
17848 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
17849 vec_safe_push (init_vec
, TREE_VALUE (init
));
17853 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
17854 tree op2
= RECUR (TREE_OPERAND (t
, 2));
17855 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
17856 NEW_EXPR_USE_GLOBAL (t
),
17859 if (placement_vec
!= NULL
)
17860 release_tree_vector (placement_vec
);
17861 if (init_vec
!= NULL
)
17862 release_tree_vector (init_vec
);
17869 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17870 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17871 RETURN (delete_sanity (op0
, op1
,
17872 DELETE_EXPR_USE_VEC (t
),
17873 DELETE_EXPR_USE_GLOBAL (t
),
17877 case COMPOUND_EXPR
:
17879 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
17880 complain
& ~tf_decltype
, in_decl
,
17881 /*function_p=*/false,
17882 integral_constant_expression_p
);
17883 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
17885 RECUR (TREE_OPERAND (t
, 1)),
17886 complain
|decltype_flag
));
17892 vec
<tree
, va_gc
> *call_args
;
17893 unsigned int nargs
, i
;
17898 function
= CALL_EXPR_FN (t
);
17899 /* Internal function with no arguments. */
17900 if (function
== NULL_TREE
&& call_expr_nargs (t
) == 0)
17903 /* When we parsed the expression, we determined whether or
17904 not Koenig lookup should be performed. */
17905 koenig_p
= KOENIG_LOOKUP_P (t
);
17906 if (function
== NULL_TREE
)
17909 qualified_p
= false;
17911 else if (TREE_CODE (function
) == SCOPE_REF
)
17913 qualified_p
= true;
17914 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
17916 /*address_p=*/false);
17918 else if (koenig_p
&& identifier_p (function
))
17920 /* Do nothing; calling tsubst_copy_and_build on an identifier
17921 would incorrectly perform unqualified lookup again.
17923 Note that we can also have an IDENTIFIER_NODE if the earlier
17924 unqualified lookup found a member function; in that case
17925 koenig_p will be false and we do want to do the lookup
17926 again to find the instantiated member function.
17928 FIXME but doing that causes c++/15272, so we need to stop
17929 using IDENTIFIER_NODE in that situation. */
17930 qualified_p
= false;
17934 if (TREE_CODE (function
) == COMPONENT_REF
)
17936 tree op
= TREE_OPERAND (function
, 1);
17938 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
17939 || (BASELINK_P (op
)
17940 && BASELINK_QUALIFIED_P (op
)));
17943 qualified_p
= false;
17945 if (TREE_CODE (function
) == ADDR_EXPR
17946 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
17947 /* Avoid error about taking the address of a constructor. */
17948 function
= TREE_OPERAND (function
, 0);
17950 function
= tsubst_copy_and_build (function
, args
, complain
,
17953 integral_constant_expression_p
);
17955 if (BASELINK_P (function
))
17956 qualified_p
= true;
17959 nargs
= call_expr_nargs (t
);
17960 call_args
= make_tree_vector ();
17961 for (i
= 0; i
< nargs
; ++i
)
17963 tree arg
= CALL_EXPR_ARG (t
, i
);
17965 if (!PACK_EXPANSION_P (arg
))
17966 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
17969 /* Expand the pack expansion and push each entry onto
17971 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
17972 if (TREE_CODE (arg
) == TREE_VEC
)
17974 unsigned int len
, j
;
17976 len
= TREE_VEC_LENGTH (arg
);
17977 for (j
= 0; j
< len
; ++j
)
17979 tree value
= TREE_VEC_ELT (arg
, j
);
17980 if (value
!= NULL_TREE
)
17981 value
= convert_from_reference (value
);
17982 vec_safe_push (call_args
, value
);
17987 /* A partial substitution. Add one entry. */
17988 vec_safe_push (call_args
, arg
);
17993 /* We do not perform argument-dependent lookup if normal
17994 lookup finds a non-function, in accordance with the
17995 expected resolution of DR 218. */
17997 && ((is_overloaded_fn (function
)
17998 /* If lookup found a member function, the Koenig lookup is
17999 not appropriate, even if an unqualified-name was used
18000 to denote the function. */
18001 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
18002 || identifier_p (function
))
18003 /* Only do this when substitution turns a dependent call
18004 into a non-dependent call. */
18005 && type_dependent_expression_p_push (t
)
18006 && !any_type_dependent_arguments_p (call_args
))
18007 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
18009 if (function
!= NULL_TREE
18010 && identifier_p (function
)
18011 && !any_type_dependent_arguments_p (call_args
))
18013 if (koenig_p
&& (complain
& tf_warning_or_error
))
18015 /* For backwards compatibility and good diagnostics, try
18016 the unqualified lookup again if we aren't in SFINAE
18018 tree unq
= (tsubst_copy_and_build
18019 (function
, args
, complain
, in_decl
, true,
18020 integral_constant_expression_p
));
18021 if (unq
== error_mark_node
)
18023 release_tree_vector (call_args
);
18024 RETURN (error_mark_node
);
18027 if (unq
!= function
)
18029 /* In a lambda fn, we have to be careful to not
18030 introduce new this captures. Legacy code can't
18031 be using lambdas anyway, so it's ok to be
18033 bool in_lambda
= (current_class_type
18034 && LAMBDA_TYPE_P (current_class_type
));
18035 char const *const msg
18036 = G_("%qD was not declared in this scope, "
18037 "and no declarations were found by "
18038 "argument-dependent lookup at the point "
18039 "of instantiation");
18043 error_at (EXPR_LOC_OR_LOC (t
, input_location
),
18046 diag
= permerror (EXPR_LOC_OR_LOC (t
, input_location
),
18052 if (INDIRECT_REF_P (fn
))
18053 fn
= TREE_OPERAND (fn
, 0);
18054 if (is_overloaded_fn (fn
))
18055 fn
= get_first_fn (fn
);
18058 /* Can't say anything more. */;
18059 else if (DECL_CLASS_SCOPE_P (fn
))
18061 location_t loc
= EXPR_LOC_OR_LOC (t
,
18064 "declarations in dependent base %qT are "
18065 "not found by unqualified lookup",
18066 DECL_CLASS_CONTEXT (fn
));
18067 if (current_class_ptr
)
18069 "use %<this->%D%> instead", function
);
18072 "use %<%T::%D%> instead",
18073 current_class_name
, function
);
18076 inform (DECL_SOURCE_LOCATION (fn
),
18077 "%qD declared here, later in the "
18078 "translation unit", fn
);
18081 release_tree_vector (call_args
);
18082 RETURN (error_mark_node
);
18089 if (identifier_p (function
))
18091 if (complain
& tf_error
)
18092 unqualified_name_lookup_error (function
);
18093 release_tree_vector (call_args
);
18094 RETURN (error_mark_node
);
18098 /* Remember that there was a reference to this entity. */
18099 if (function
!= NULL_TREE
18100 && DECL_P (function
)
18101 && !mark_used (function
, complain
) && !(complain
& tf_error
))
18103 release_tree_vector (call_args
);
18104 RETURN (error_mark_node
);
18107 /* Put back tf_decltype for the actual call. */
18108 complain
|= decltype_flag
;
18110 if (function
== NULL_TREE
)
18111 switch (CALL_EXPR_IFN (t
))
18114 gcc_assert (nargs
== 1);
18115 if (vec_safe_length (call_args
) != 1)
18117 error_at (EXPR_LOC_OR_LOC (t
, input_location
),
18118 "wrong number of arguments to "
18119 "%<__builtin_launder%>");
18120 ret
= error_mark_node
;
18123 ret
= finish_builtin_launder (EXPR_LOC_OR_LOC (t
,
18125 (*call_args
)[0], complain
);
18129 /* Unsupported internal function with arguments. */
18130 gcc_unreachable ();
18132 else if (TREE_CODE (function
) == OFFSET_REF
)
18133 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
18135 else if (TREE_CODE (function
) == COMPONENT_REF
)
18137 tree instance
= TREE_OPERAND (function
, 0);
18138 tree fn
= TREE_OPERAND (function
, 1);
18140 if (processing_template_decl
18141 && (type_dependent_expression_p (instance
)
18142 || (!BASELINK_P (fn
)
18143 && TREE_CODE (fn
) != FIELD_DECL
)
18144 || type_dependent_expression_p (fn
)
18145 || any_type_dependent_arguments_p (call_args
)))
18146 ret
= build_min_nt_call_vec (function
, call_args
);
18147 else if (!BASELINK_P (fn
))
18148 ret
= finish_call_expr (function
, &call_args
,
18149 /*disallow_virtual=*/false,
18150 /*koenig_p=*/false,
18153 ret
= (build_new_method_call
18155 &call_args
, NULL_TREE
,
18156 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
18161 ret
= finish_call_expr (function
, &call_args
,
18162 /*disallow_virtual=*/qualified_p
,
18166 release_tree_vector (call_args
);
18168 if (ret
!= error_mark_node
)
18170 bool op
= CALL_EXPR_OPERATOR_SYNTAX (t
);
18171 bool ord
= CALL_EXPR_ORDERED_ARGS (t
);
18172 bool rev
= CALL_EXPR_REVERSE_ARGS (t
);
18173 bool thk
= CALL_FROM_THUNK_P (t
);
18174 if (op
|| ord
|| rev
|| thk
)
18176 function
= extract_call_expr (ret
);
18177 CALL_EXPR_OPERATOR_SYNTAX (function
) = op
;
18178 CALL_EXPR_ORDERED_ARGS (function
) = ord
;
18179 CALL_EXPR_REVERSE_ARGS (function
) = rev
;
18182 if (TREE_CODE (function
) == CALL_EXPR
)
18183 CALL_FROM_THUNK_P (function
) = true;
18185 AGGR_INIT_FROM_THUNK_P (function
) = true;
18186 /* The thunk location is not interesting. */
18187 SET_EXPR_LOCATION (function
, UNKNOWN_LOCATION
);
18197 tree cond
= RECUR (TREE_OPERAND (t
, 0));
18198 tree folded_cond
= fold_non_dependent_expr (cond
);
18201 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
18203 if (integer_zerop (folded_cond
))
18205 ++c_inhibit_evaluation_warnings
;
18206 exp1
= RECUR (TREE_OPERAND (t
, 1));
18207 --c_inhibit_evaluation_warnings
;
18208 exp2
= RECUR (TREE_OPERAND (t
, 2));
18212 exp1
= RECUR (TREE_OPERAND (t
, 1));
18213 ++c_inhibit_evaluation_warnings
;
18214 exp2
= RECUR (TREE_OPERAND (t
, 2));
18215 --c_inhibit_evaluation_warnings
;
18217 cond
= folded_cond
;
18221 exp1
= RECUR (TREE_OPERAND (t
, 1));
18222 exp2
= RECUR (TREE_OPERAND (t
, 2));
18225 warning_sentinel
s(warn_duplicated_branches
);
18226 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
18227 cond
, exp1
, exp2
, complain
));
18230 case PSEUDO_DTOR_EXPR
:
18232 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18233 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18234 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
18235 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
18241 tree purpose
, value
, chain
;
18243 if (t
== void_list_node
)
18246 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
18247 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
18249 /* We have pack expansions, so expand those and
18250 create a new list out of it. */
18251 tree purposevec
= NULL_TREE
;
18252 tree valuevec
= NULL_TREE
;
18256 /* Expand the argument expressions. */
18257 if (TREE_PURPOSE (t
))
18258 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
18259 complain
, in_decl
);
18260 if (TREE_VALUE (t
))
18261 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
18262 complain
, in_decl
);
18264 /* Build the rest of the list. */
18265 chain
= TREE_CHAIN (t
);
18266 if (chain
&& chain
!= void_type_node
)
18267 chain
= RECUR (chain
);
18269 /* Determine the number of arguments. */
18270 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
18272 len
= TREE_VEC_LENGTH (purposevec
);
18273 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
18275 else if (TREE_CODE (valuevec
) == TREE_VEC
)
18276 len
= TREE_VEC_LENGTH (valuevec
);
18279 /* Since we only performed a partial substitution into
18280 the argument pack, we only RETURN (a single list
18282 if (purposevec
== TREE_PURPOSE (t
)
18283 && valuevec
== TREE_VALUE (t
)
18284 && chain
== TREE_CHAIN (t
))
18287 RETURN (tree_cons (purposevec
, valuevec
, chain
));
18290 /* Convert the argument vectors into a TREE_LIST */
18294 /* Grab the Ith values. */
18296 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
18299 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
18302 /* Build the list (backwards). */
18303 chain
= tree_cons (purpose
, value
, chain
);
18309 purpose
= TREE_PURPOSE (t
);
18311 purpose
= RECUR (purpose
);
18312 value
= TREE_VALUE (t
);
18314 value
= RECUR (value
);
18315 chain
= TREE_CHAIN (t
);
18316 if (chain
&& chain
!= void_type_node
)
18317 chain
= RECUR (chain
);
18318 if (purpose
== TREE_PURPOSE (t
)
18319 && value
== TREE_VALUE (t
)
18320 && chain
== TREE_CHAIN (t
))
18322 RETURN (tree_cons (purpose
, value
, chain
));
18325 case COMPONENT_REF
:
18332 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18333 args
, complain
, in_decl
);
18334 /* Remember that there was a reference to this entity. */
18335 if (DECL_P (object
)
18336 && !mark_used (object
, complain
) && !(complain
& tf_error
))
18337 RETURN (error_mark_node
);
18338 object_type
= TREE_TYPE (object
);
18340 member
= TREE_OPERAND (t
, 1);
18341 if (BASELINK_P (member
))
18342 member
= tsubst_baselink (member
,
18343 non_reference (TREE_TYPE (object
)),
18344 args
, complain
, in_decl
);
18346 member
= tsubst_copy (member
, args
, complain
, in_decl
);
18347 if (member
== error_mark_node
)
18348 RETURN (error_mark_node
);
18350 if (TREE_CODE (member
) == FIELD_DECL
)
18352 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
18353 if (TREE_CODE (r
) == COMPONENT_REF
)
18354 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
18357 else if (type_dependent_expression_p (object
))
18358 /* We can't do much here. */;
18359 else if (!CLASS_TYPE_P (object_type
))
18361 if (scalarish_type_p (object_type
))
18363 tree s
= NULL_TREE
;
18364 tree dtor
= member
;
18366 if (TREE_CODE (dtor
) == SCOPE_REF
)
18368 s
= TREE_OPERAND (dtor
, 0);
18369 dtor
= TREE_OPERAND (dtor
, 1);
18371 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
18373 dtor
= TREE_OPERAND (dtor
, 0);
18375 RETURN (finish_pseudo_destructor_expr
18376 (object
, s
, dtor
, input_location
));
18380 else if (TREE_CODE (member
) == SCOPE_REF
18381 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
18383 /* Lookup the template functions now that we know what the
18385 tree scope
= TREE_OPERAND (member
, 0);
18386 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
18387 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
18388 member
= lookup_qualified_name (scope
, tmpl
,
18389 /*is_type_p=*/false,
18390 /*complain=*/false);
18391 if (BASELINK_P (member
))
18393 BASELINK_FUNCTIONS (member
)
18394 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
18396 member
= (adjust_result_of_qualified_name_lookup
18397 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
18402 qualified_name_lookup_error (scope
, tmpl
, member
,
18404 RETURN (error_mark_node
);
18407 else if (TREE_CODE (member
) == SCOPE_REF
18408 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
18409 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
18411 if (complain
& tf_error
)
18413 if (TYPE_P (TREE_OPERAND (member
, 0)))
18414 error ("%qT is not a class or namespace",
18415 TREE_OPERAND (member
, 0));
18417 error ("%qD is not a class or namespace",
18418 TREE_OPERAND (member
, 0));
18420 RETURN (error_mark_node
);
18423 r
= finish_class_member_access_expr (object
, member
,
18424 /*template_p=*/false,
18426 if (TREE_CODE (r
) == COMPONENT_REF
)
18427 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
18432 RETURN (build_throw
18433 (RECUR (TREE_OPERAND (t
, 0))));
18437 vec
<constructor_elt
, va_gc
> *n
;
18438 constructor_elt
*ce
;
18439 unsigned HOST_WIDE_INT idx
;
18440 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18441 bool process_index_p
;
18443 bool need_copy_p
= false;
18446 if (type
== error_mark_node
)
18447 RETURN (error_mark_node
);
18449 /* We do not want to process the index of aggregate
18450 initializers as they are identifier nodes which will be
18451 looked up by digest_init. */
18452 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
18454 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
18455 newlen
= vec_safe_length (n
);
18456 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
18458 if (ce
->index
&& process_index_p
18459 /* An identifier index is looked up in the type
18460 being initialized, not the current scope. */
18461 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
18462 ce
->index
= RECUR (ce
->index
);
18464 if (PACK_EXPANSION_P (ce
->value
))
18466 /* Substitute into the pack expansion. */
18467 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
18470 if (ce
->value
== error_mark_node
18471 || PACK_EXPANSION_P (ce
->value
))
18473 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
18474 /* Just move the argument into place. */
18475 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
18478 /* Update the length of the final CONSTRUCTOR
18479 arguments vector, and note that we will need to
18481 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
18482 need_copy_p
= true;
18486 ce
->value
= RECUR (ce
->value
);
18491 vec
<constructor_elt
, va_gc
> *old_n
= n
;
18493 vec_alloc (n
, newlen
);
18494 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
18496 if (TREE_CODE (ce
->value
) == TREE_VEC
)
18498 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
18499 for (i
= 0; i
< len
; ++i
)
18500 CONSTRUCTOR_APPEND_ELT (n
, 0,
18501 TREE_VEC_ELT (ce
->value
, i
));
18504 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
18508 r
= build_constructor (init_list_type_node
, n
);
18509 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
18511 if (TREE_HAS_CONSTRUCTOR (t
))
18513 fcl_t cl
= fcl_functional
;
18514 if (CONSTRUCTOR_C99_COMPOUND_LITERAL (t
))
18516 RETURN (finish_compound_literal (type
, r
, complain
, cl
));
18519 TREE_TYPE (r
) = type
;
18525 tree operand_0
= TREE_OPERAND (t
, 0);
18526 if (TYPE_P (operand_0
))
18528 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
18529 RETURN (get_typeid (operand_0
, complain
));
18533 operand_0
= RECUR (operand_0
);
18534 RETURN (build_typeid (operand_0
, complain
));
18545 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
18546 /* ??? We're doing a subset of finish_id_expression here. */
18548 && !processing_template_decl
18549 && !cp_unevaluated_operand
18550 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
18551 && CP_DECL_THREAD_LOCAL_P (r
))
18553 if (tree wrap
= get_tls_wrapper_fn (r
))
18554 /* Replace an evaluated use of the thread_local variable with
18555 a call to its wrapper. */
18556 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
18558 else if (outer_automatic_var_p (r
))
18559 r
= process_outer_var_ref (r
, complain
);
18561 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
18562 /* If the original type was a reference, we'll be wrapped in
18563 the appropriate INDIRECT_REF. */
18564 r
= convert_from_reference (r
);
18570 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18571 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18572 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
18575 case OFFSETOF_EXPR
:
18578 = tsubst_copy_and_build (TREE_OPERAND (t
, 1), args
, complain
,
18579 in_decl
, /*function_p=*/false,
18580 /*integral_constant_expression_p=*/false);
18581 RETURN (finish_offsetof (object_ptr
,
18582 RECUR (TREE_OPERAND (t
, 0)),
18583 EXPR_LOCATION (t
)));
18586 case ADDRESSOF_EXPR
:
18587 RETURN (cp_build_addressof (EXPR_LOCATION (t
),
18588 RECUR (TREE_OPERAND (t
, 0)), complain
));
18592 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
18593 complain
, in_decl
);
18595 tree type2
= TRAIT_EXPR_TYPE2 (t
);
18596 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
18597 type2
= RECUR (type2
);
18599 type2
= tsubst (type2
, args
, complain
, in_decl
);
18601 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
18606 tree old_stmt_expr
= cur_stmt_expr
;
18607 tree stmt_expr
= begin_stmt_expr ();
18609 cur_stmt_expr
= stmt_expr
;
18610 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
18611 integral_constant_expression_p
);
18612 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
18613 cur_stmt_expr
= old_stmt_expr
;
18615 /* If the resulting list of expression statement is empty,
18616 fold it further into void_node. */
18617 if (empty_expr_stmt_p (stmt_expr
))
18618 stmt_expr
= void_node
;
18620 RETURN (stmt_expr
);
18625 tree r
= tsubst_lambda_expr (t
, args
, complain
, in_decl
);
18627 RETURN (build_lambda_object (r
));
18631 /* We can get here for a constant initializer of non-dependent type.
18632 FIXME stop folding in cp_parser_initializer_clause. */
18634 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
18639 case TRANSACTION_EXPR
:
18640 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
18641 integral_constant_expression_p
));
18644 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
18646 case VEC_PERM_EXPR
:
18648 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18649 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18650 tree op2
= RECUR (TREE_OPERAND (t
, 2));
18651 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
18655 case REQUIRES_EXPR
:
18656 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
18658 case NON_LVALUE_EXPR
:
18659 case VIEW_CONVERT_EXPR
:
18660 /* We should only see these for location wrapper nodes, or within
18661 instantiate_non_dependent_expr (when args is NULL_TREE). */
18662 gcc_assert (location_wrapper_p (t
) || args
== NULL_TREE
);
18663 if (location_wrapper_p (t
))
18664 RETURN (maybe_wrap_with_location (RECUR (TREE_OPERAND (t
, 0)),
18665 EXPR_LOCATION (t
)));
18669 /* Handle Objective-C++ constructs, if appropriate. */
18672 = objcp_tsubst_copy_and_build (t
, args
, complain
,
18673 in_decl
, /*function_p=*/false);
18677 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
18683 input_location
= loc
;
18687 /* Verify that the instantiated ARGS are valid. For type arguments,
18688 make sure that the type's linkage is ok. For non-type arguments,
18689 make sure they are constants if they are integral or enumerations.
18690 Emit an error under control of COMPLAIN, and return TRUE on error. */
18693 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
18695 if (dependent_template_arg_p (t
))
18697 if (ARGUMENT_PACK_P (t
))
18699 tree vec
= ARGUMENT_PACK_ARGS (t
);
18700 int len
= TREE_VEC_LENGTH (vec
);
18701 bool result
= false;
18704 for (i
= 0; i
< len
; ++i
)
18705 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
18709 else if (TYPE_P (t
))
18711 /* [basic.link]: A name with no linkage (notably, the name
18712 of a class or enumeration declared in a local scope)
18713 shall not be used to declare an entity with linkage.
18714 This implies that names with no linkage cannot be used as
18717 DR 757 relaxes this restriction for C++0x. */
18718 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
18719 : no_linkage_check (t
, /*relaxed_p=*/false));
18723 /* DR 488 makes use of a type with no linkage cause
18724 type deduction to fail. */
18725 if (complain
& tf_error
)
18727 if (TYPE_UNNAMED_P (nt
))
18728 error ("%qT is/uses unnamed type", t
);
18730 error ("template argument for %qD uses local type %qT",
18735 /* In order to avoid all sorts of complications, we do not
18736 allow variably-modified types as template arguments. */
18737 else if (variably_modified_type_p (t
, NULL_TREE
))
18739 if (complain
& tf_error
)
18740 error ("%qT is a variably modified type", t
);
18744 /* Class template and alias template arguments should be OK. */
18745 else if (DECL_TYPE_TEMPLATE_P (t
))
18747 /* A non-type argument of integral or enumerated type must be a
18749 else if (TREE_TYPE (t
)
18750 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
18751 && !REFERENCE_REF_P (t
)
18752 && !TREE_CONSTANT (t
))
18754 if (complain
& tf_error
)
18755 error ("integral expression %qE is not constant", t
);
18762 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
18764 int ix
, len
= DECL_NTPARMS (tmpl
);
18765 bool result
= false;
18767 for (ix
= 0; ix
!= len
; ix
++)
18769 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
18772 if (result
&& (complain
& tf_error
))
18773 error (" trying to instantiate %qD", tmpl
);
18777 /* We're out of SFINAE context now, so generate diagnostics for the access
18778 errors we saw earlier when instantiating D from TMPL and ARGS. */
18781 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
18783 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
18784 tree type
= TREE_TYPE (pattern
);
18785 location_t loc
= input_location
;
18787 push_access_scope (d
);
18788 push_deferring_access_checks (dk_no_deferred
);
18789 input_location
= DECL_SOURCE_LOCATION (pattern
);
18790 tsubst (type
, args
, tf_warning_or_error
, d
);
18791 input_location
= loc
;
18792 pop_deferring_access_checks ();
18793 pop_access_scope (d
);
18796 /* Instantiate the indicated variable, function, or alias template TMPL with
18797 the template arguments in TARG_PTR. */
18800 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
18802 tree targ_ptr
= orig_args
;
18806 bool access_ok
= true;
18808 if (tmpl
== error_mark_node
)
18809 return error_mark_node
;
18811 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
18813 /* If this function is a clone, handle it specially. */
18814 if (DECL_CLONED_FUNCTION_P (tmpl
))
18819 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
18820 DECL_CLONED_FUNCTION. */
18821 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
18822 targ_ptr
, complain
);
18823 if (spec
== error_mark_node
)
18824 return error_mark_node
;
18826 /* Look for the clone. */
18827 FOR_EACH_CLONE (clone
, spec
)
18828 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
18830 /* We should always have found the clone by now. */
18831 gcc_unreachable ();
18835 if (targ_ptr
== error_mark_node
)
18836 return error_mark_node
;
18838 /* Check to see if we already have this specialization. */
18839 gen_tmpl
= most_general_template (tmpl
);
18840 if (TMPL_ARGS_DEPTH (targ_ptr
)
18841 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)))
18842 /* targ_ptr only has the innermost template args, so add the outer ones
18843 from tmpl, which could be either a partial instantiation or gen_tmpl (in
18844 the case of a non-dependent call within a template definition). */
18845 targ_ptr
= (add_outermost_template_args
18846 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (tmpl
)),
18849 /* It would be nice to avoid hashing here and then again in tsubst_decl,
18850 but it doesn't seem to be on the hot path. */
18851 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
18853 gcc_assert (tmpl
== gen_tmpl
18854 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
18856 || fndecl
== NULL_TREE
);
18858 if (spec
!= NULL_TREE
)
18860 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
18862 if (complain
& tf_error
)
18863 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
18864 return error_mark_node
;
18869 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
18871 return error_mark_node
;
18873 /* We are building a FUNCTION_DECL, during which the access of its
18874 parameters and return types have to be checked. However this
18875 FUNCTION_DECL which is the desired context for access checking
18876 is not built yet. We solve this chicken-and-egg problem by
18877 deferring all checks until we have the FUNCTION_DECL. */
18878 push_deferring_access_checks (dk_deferred
);
18880 /* Instantiation of the function happens in the context of the function
18881 template, not the context of the overload resolution we're doing. */
18882 push_to_top_level ();
18883 /* If there are dependent arguments, e.g. because we're doing partial
18884 ordering, make sure processing_template_decl stays set. */
18885 if (uses_template_parms (targ_ptr
))
18886 ++processing_template_decl
;
18887 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
18889 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
18890 complain
, gen_tmpl
, true);
18891 push_nested_class (ctx
);
18894 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
18896 fndecl
= NULL_TREE
;
18897 if (VAR_P (pattern
))
18899 /* We need to determine if we're using a partial or explicit
18900 specialization now, because the type of the variable could be
18902 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
18903 tree elt
= most_specialized_partial_spec (tid
, complain
);
18904 if (elt
== error_mark_node
)
18905 pattern
= error_mark_node
;
18908 tree partial_tmpl
= TREE_VALUE (elt
);
18909 tree partial_args
= TREE_PURPOSE (elt
);
18910 tree partial_pat
= DECL_TEMPLATE_RESULT (partial_tmpl
);
18911 fndecl
= tsubst (partial_pat
, partial_args
, complain
, gen_tmpl
);
18915 /* Substitute template parameters to obtain the specialization. */
18916 if (fndecl
== NULL_TREE
)
18917 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
18918 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
18919 pop_nested_class ();
18920 pop_from_top_level ();
18922 if (fndecl
== error_mark_node
)
18924 pop_deferring_access_checks ();
18925 return error_mark_node
;
18928 /* The DECL_TI_TEMPLATE should always be the immediate parent
18929 template, not the most general template. */
18930 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
18931 DECL_TI_ARGS (fndecl
) = targ_ptr
;
18933 /* Now we know the specialization, compute access previously
18934 deferred. Do no access control for inheriting constructors,
18935 as we already checked access for the inherited constructor. */
18936 if (!(flag_new_inheriting_ctors
18937 && DECL_INHERITED_CTOR (fndecl
)))
18939 push_access_scope (fndecl
);
18940 if (!perform_deferred_access_checks (complain
))
18942 pop_access_scope (fndecl
);
18944 pop_deferring_access_checks ();
18946 /* If we've just instantiated the main entry point for a function,
18947 instantiate all the alternate entry points as well. We do this
18948 by cloning the instantiation of the main entry point, not by
18949 instantiating the template clones. */
18950 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
18951 clone_function_decl (fndecl
, /*update_methods=*/false);
18955 if (!(complain
& tf_error
))
18957 /* Remember to reinstantiate when we're out of SFINAE so the user
18958 can see the errors. */
18959 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
18961 return error_mark_node
;
18966 /* Wrapper for instantiate_template_1. */
18969 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
18972 timevar_push (TV_TEMPLATE_INST
);
18973 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
18974 timevar_pop (TV_TEMPLATE_INST
);
18978 /* Instantiate the alias template TMPL with ARGS. Also push a template
18979 instantiation level, which instantiate_template doesn't do because
18980 functions and variables have sufficient context established by the
18984 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
18986 struct pending_template
*old_last_pend
= last_pending_template
;
18987 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
18988 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
18989 return error_mark_node
;
18990 tree tinst
= build_tree_list (tmpl
, args
);
18991 if (!push_tinst_level (tinst
))
18994 return error_mark_node
;
18998 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
18999 args
, tmpl
, complain
,
19000 /*require_all_args=*/true,
19001 /*use_default_args=*/true);
19003 tree r
= instantiate_template (tmpl
, args
, complain
);
19004 pop_tinst_level ();
19005 /* We can't free this if a pending_template entry or last_error_tinst_level
19006 is pointing at it. */
19007 if (last_pending_template
== old_last_pend
19008 && last_error_tinst_level
== old_error_tinst
)
19014 /* PARM is a template parameter pack for FN. Returns true iff
19015 PARM is used in a deducible way in the argument list of FN. */
19018 pack_deducible_p (tree parm
, tree fn
)
19020 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
19021 for (; t
; t
= TREE_CHAIN (t
))
19023 tree type
= TREE_VALUE (t
);
19025 if (!PACK_EXPANSION_P (type
))
19027 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
19028 packs
; packs
= TREE_CHAIN (packs
))
19029 if (template_args_equal (TREE_VALUE (packs
), parm
))
19031 /* The template parameter pack is used in a function parameter
19032 pack. If this is the end of the parameter list, the
19033 template parameter pack is deducible. */
19034 if (TREE_CHAIN (t
) == void_list_node
)
19037 /* Otherwise, not. Well, it could be deduced from
19038 a non-pack parameter, but doing so would end up with
19039 a deduction mismatch, so don't bother. */
19043 /* The template parameter pack isn't used in any function parameter
19044 packs, but it might be used deeper, e.g. tuple<Args...>. */
19048 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
19049 NARGS elements of the arguments that are being used when calling
19050 it. TARGS is a vector into which the deduced template arguments
19053 Returns either a FUNCTION_DECL for the matching specialization of FN or
19054 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
19055 true, diagnostics will be printed to explain why it failed.
19057 If FN is a conversion operator, or we are trying to produce a specific
19058 specialization, RETURN_TYPE is the return type desired.
19060 The EXPLICIT_TARGS are explicit template arguments provided via a
19063 The parameter STRICT is one of:
19066 We are deducing arguments for a function call, as in
19067 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
19068 deducing arguments for a call to the result of a conversion
19069 function template, as in [over.call.object].
19072 We are deducing arguments for a conversion function, as in
19073 [temp.deduct.conv].
19076 We are deducing arguments when doing an explicit instantiation
19077 as in [temp.explicit], when determining an explicit specialization
19078 as in [temp.expl.spec], or when taking the address of a function
19079 template, as in [temp.deduct.funcaddr]. */
19082 fn_type_unification (tree fn
,
19083 tree explicit_targs
,
19086 unsigned int nargs
,
19088 unification_kind_t strict
,
19095 tree decl
= NULL_TREE
;
19096 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
19098 static int deduction_depth
;
19099 struct pending_template
*old_last_pend
= last_pending_template
;
19100 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
19103 if (flag_new_inheriting_ctors
)
19104 fn
= strip_inheriting_ctors (fn
);
19106 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
19108 tree r
= error_mark_node
;
19110 tree full_targs
= targs
;
19111 if (TMPL_ARGS_DEPTH (targs
)
19112 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (fn
)))
19113 full_targs
= (add_outermost_template_args
19114 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (fn
)),
19118 complain
|= tf_decltype
;
19120 /* In C++0x, it's possible to have a function template whose type depends
19121 on itself recursively. This is most obvious with decltype, but can also
19122 occur with enumeration scope (c++/48969). So we need to catch infinite
19123 recursion and reject the substitution at deduction time; this function
19124 will return error_mark_node for any repeated substitution.
19126 This also catches excessive recursion such as when f<N> depends on
19127 f<N-1> across all integers, and returns error_mark_node for all the
19128 substitutions back up to the initial one.
19130 This is, of course, not reentrant. */
19131 if (excessive_deduction_depth
)
19132 return error_mark_node
;
19133 tinst
= build_tree_list (fn
, NULL_TREE
);
19136 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
19138 fntype
= TREE_TYPE (fn
);
19139 if (explicit_targs
)
19143 The specified template arguments must match the template
19144 parameters in kind (i.e., type, nontype, template), and there
19145 must not be more arguments than there are parameters;
19146 otherwise type deduction fails.
19148 Nontype arguments must match the types of the corresponding
19149 nontype template parameters, or must be convertible to the
19150 types of the corresponding nontype parameters as specified in
19151 _temp.arg.nontype_, otherwise type deduction fails.
19153 All references in the function type of the function template
19154 to the corresponding template parameters are replaced by the
19155 specified template argument values. If a substitution in a
19156 template parameter or in the function type of the function
19157 template results in an invalid type, type deduction fails. */
19158 int i
, len
= TREE_VEC_LENGTH (tparms
);
19159 location_t loc
= input_location
;
19160 bool incomplete
= false;
19162 if (explicit_targs
== error_mark_node
)
19165 if (TMPL_ARGS_DEPTH (explicit_targs
)
19166 < TMPL_ARGS_DEPTH (full_targs
))
19167 explicit_targs
= add_outermost_template_args (full_targs
,
19170 /* Adjust any explicit template arguments before entering the
19171 substitution context. */
19173 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
19175 /*require_all_args=*/false,
19176 /*use_default_args=*/false));
19177 if (explicit_targs
== error_mark_node
)
19180 /* Substitute the explicit args into the function type. This is
19181 necessary so that, for instance, explicitly declared function
19182 arguments can match null pointed constants. If we were given
19183 an incomplete set of explicit args, we must not do semantic
19184 processing during substitution as we could create partial
19186 for (i
= 0; i
< len
; i
++)
19188 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
19189 bool parameter_pack
= false;
19190 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
19192 /* Dig out the actual parm. */
19193 if (TREE_CODE (parm
) == TYPE_DECL
19194 || TREE_CODE (parm
) == TEMPLATE_DECL
)
19196 parm
= TREE_TYPE (parm
);
19197 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
19199 else if (TREE_CODE (parm
) == PARM_DECL
)
19201 parm
= DECL_INITIAL (parm
);
19202 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
19205 if (!parameter_pack
&& targ
== NULL_TREE
)
19206 /* No explicit argument for this template parameter. */
19209 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
19211 /* Mark the argument pack as "incomplete". We could
19212 still deduce more arguments during unification.
19213 We remove this mark in type_unification_real. */
19216 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
19217 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
19218 = ARGUMENT_PACK_ARGS (targ
);
19221 /* We have some incomplete argument packs. */
19226 TREE_VALUE (tinst
) = explicit_targs
;
19227 if (!push_tinst_level (tinst
))
19229 excessive_deduction_depth
= true;
19232 processing_template_decl
+= incomplete
;
19233 input_location
= DECL_SOURCE_LOCATION (fn
);
19234 /* Ignore any access checks; we'll see them again in
19235 instantiate_template and they might have the wrong
19236 access path at this point. */
19237 push_deferring_access_checks (dk_deferred
);
19238 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
19239 complain
| tf_partial
| tf_fndecl_type
, NULL_TREE
);
19240 pop_deferring_access_checks ();
19241 input_location
= loc
;
19242 processing_template_decl
-= incomplete
;
19243 pop_tinst_level ();
19245 if (fntype
== error_mark_node
)
19248 /* Place the explicitly specified arguments in TARGS. */
19249 explicit_targs
= INNERMOST_TEMPLATE_ARGS (explicit_targs
);
19250 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
19251 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
19254 /* Never do unification on the 'this' parameter. */
19255 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
19257 if (return_type
&& strict
== DEDUCE_CALL
)
19259 /* We're deducing for a call to the result of a template conversion
19260 function. The parms we really want are in return_type. */
19261 if (POINTER_TYPE_P (return_type
))
19262 return_type
= TREE_TYPE (return_type
);
19263 parms
= TYPE_ARG_TYPES (return_type
);
19265 else if (return_type
)
19269 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
19270 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
19271 new_args
[0] = return_type
;
19272 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
19277 /* We allow incomplete unification without an error message here
19278 because the standard doesn't seem to explicitly prohibit it. Our
19279 callers must be ready to deal with unification failures in any
19282 TREE_VALUE (tinst
) = targs
;
19283 /* If we aren't explaining yet, push tinst context so we can see where
19284 any errors (e.g. from class instantiations triggered by instantiation
19285 of default template arguments) come from. If we are explaining, this
19286 context is redundant. */
19287 if (!explain_p
&& !push_tinst_level (tinst
))
19289 excessive_deduction_depth
= true;
19293 /* type_unification_real will pass back any access checks from default
19294 template argument substitution. */
19295 vec
<deferred_access_check
, va_gc
> *checks
;
19298 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
19299 full_targs
, parms
, args
, nargs
, /*subr=*/0,
19300 strict
, flags
, &checks
, explain_p
);
19302 pop_tinst_level ();
19306 /* Now that we have bindings for all of the template arguments,
19307 ensure that the arguments deduced for the template template
19308 parameters have compatible template parameter lists. We cannot
19309 check this property before we have deduced all template
19310 arguments, because the template parameter types of a template
19311 template parameter might depend on prior template parameters
19312 deduced after the template template parameter. The following
19313 ill-formed example illustrates this issue:
19315 template<typename T, template<T> class C> void f(C<5>, T);
19317 template<int N> struct X {};
19320 f(X<5>(), 5l); // error: template argument deduction fails
19323 The template parameter list of 'C' depends on the template type
19324 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
19325 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
19326 time that we deduce 'C'. */
19327 if (!template_template_parm_bindings_ok_p
19328 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
19330 unify_inconsistent_template_template_parameters (explain_p
);
19334 /* All is well so far. Now, check:
19338 When all template arguments have been deduced, all uses of
19339 template parameters in nondeduced contexts are replaced with
19340 the corresponding deduced argument values. If the
19341 substitution results in an invalid type, as described above,
19342 type deduction fails. */
19343 TREE_VALUE (tinst
) = targs
;
19344 if (!push_tinst_level (tinst
))
19346 excessive_deduction_depth
= true;
19350 /* Also collect access checks from the instantiation. */
19351 reopen_deferring_access_checks (checks
);
19353 decl
= instantiate_template (fn
, targs
, complain
);
19355 checks
= get_deferred_access_checks ();
19356 pop_deferring_access_checks ();
19358 pop_tinst_level ();
19360 if (decl
== error_mark_node
)
19363 /* Now perform any access checks encountered during substitution. */
19364 push_access_scope (decl
);
19365 ok
= perform_access_checks (checks
, complain
);
19366 pop_access_scope (decl
);
19370 /* If we're looking for an exact match, check that what we got
19371 is indeed an exact match. It might not be if some template
19372 parameters are used in non-deduced contexts. But don't check
19373 for an exact match if we have dependent template arguments;
19374 in that case we're doing partial ordering, and we already know
19375 that we have two candidates that will provide the actual type. */
19376 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
19378 tree substed
= TREE_TYPE (decl
);
19382 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
19384 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
19385 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
19386 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
19388 unify_type_mismatch (explain_p
, args
[i
],
19389 TREE_VALUE (sarg
));
19394 /* After doing deduction with the inherited constructor, actually return an
19395 instantiation of the inheriting constructor. */
19397 decl
= instantiate_template (orig_fn
, targs
, complain
);
19403 if (excessive_deduction_depth
)
19405 if (deduction_depth
== 0)
19406 /* Reset once we're all the way out. */
19407 excessive_deduction_depth
= false;
19410 /* We can't free this if a pending_template entry or last_error_tinst_level
19411 is pointing at it. */
19412 if (last_pending_template
== old_last_pend
19413 && last_error_tinst_level
== old_error_tinst
)
19419 /* Adjust types before performing type deduction, as described in
19420 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
19421 sections are symmetric. PARM is the type of a function parameter
19422 or the return type of the conversion function. ARG is the type of
19423 the argument passed to the call, or the type of the value
19424 initialized with the result of the conversion function.
19425 ARG_EXPR is the original argument expression, which may be null. */
19428 maybe_adjust_types_for_deduction (unification_kind_t strict
,
19441 /* Swap PARM and ARG throughout the remainder of this
19442 function; the handling is precisely symmetric since PARM
19443 will initialize ARG rather than vice versa. */
19444 std::swap (parm
, arg
);
19448 /* Core issue #873: Do the DR606 thing (see below) for these cases,
19449 too, but here handle it by stripping the reference from PARM
19450 rather than by adding it to ARG. */
19451 if (TREE_CODE (*parm
) == REFERENCE_TYPE
19452 && TYPE_REF_IS_RVALUE (*parm
)
19453 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
19454 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
19455 && TREE_CODE (*arg
) == REFERENCE_TYPE
19456 && !TYPE_REF_IS_RVALUE (*arg
))
19457 *parm
= TREE_TYPE (*parm
);
19458 /* Nothing else to do in this case. */
19462 gcc_unreachable ();
19465 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
19467 /* [temp.deduct.call]
19469 If P is not a reference type:
19471 --If A is an array type, the pointer type produced by the
19472 array-to-pointer standard conversion (_conv.array_) is
19473 used in place of A for type deduction; otherwise,
19475 --If A is a function type, the pointer type produced by
19476 the function-to-pointer standard conversion
19477 (_conv.func_) is used in place of A for type deduction;
19480 --If A is a cv-qualified type, the top level
19481 cv-qualifiers of A's type are ignored for type
19483 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
19484 *arg
= build_pointer_type (TREE_TYPE (*arg
));
19485 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
19486 *arg
= build_pointer_type (*arg
);
19488 *arg
= TYPE_MAIN_VARIANT (*arg
);
19491 /* [14.8.2.1/3 temp.deduct.call], "A forwarding reference is an rvalue
19492 reference to a cv-unqualified template parameter that does not represent a
19493 template parameter of a class template (during class template argument
19494 deduction (13.3.1.8)). If P is a forwarding reference and the argument is
19495 an lvalue, the type "lvalue reference to A" is used in place of A for type
19497 if (TREE_CODE (*parm
) == REFERENCE_TYPE
19498 && TYPE_REF_IS_RVALUE (*parm
)
19499 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
19500 && !TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (*parm
))
19501 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
19502 && (arg_expr
? lvalue_p (arg_expr
)
19503 /* try_one_overload doesn't provide an arg_expr, but
19504 functions are always lvalues. */
19505 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
19506 *arg
= build_reference_type (*arg
);
19508 /* [temp.deduct.call]
19510 If P is a cv-qualified type, the top level cv-qualifiers
19511 of P's type are ignored for type deduction. If P is a
19512 reference type, the type referred to by P is used for
19514 *parm
= TYPE_MAIN_VARIANT (*parm
);
19515 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
19517 *parm
= TREE_TYPE (*parm
);
19518 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19521 /* DR 322. For conversion deduction, remove a reference type on parm
19522 too (which has been swapped into ARG). */
19523 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
19524 *arg
= TREE_TYPE (*arg
);
19529 /* Subroutine of unify_one_argument. PARM is a function parameter of a
19530 template which does contain any deducible template parameters; check if
19531 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
19532 unify_one_argument. */
19535 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
19536 int flags
, bool explain_p
)
19541 type
= TREE_TYPE (arg
);
19545 if (same_type_p (parm
, type
))
19546 return unify_success (explain_p
);
19548 if (strict
== DEDUCE_CONV
)
19550 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
19551 explain_p
? tf_warning_or_error
: tf_none
))
19552 return unify_success (explain_p
);
19554 else if (strict
!= DEDUCE_EXACT
)
19556 if (can_convert_arg (parm
, type
,
19557 TYPE_P (arg
) ? NULL_TREE
: arg
,
19558 flags
, explain_p
? tf_warning_or_error
: tf_none
))
19559 return unify_success (explain_p
);
19562 if (strict
== DEDUCE_EXACT
)
19563 return unify_type_mismatch (explain_p
, parm
, arg
);
19565 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
19568 static bool uses_deducible_template_parms (tree type
);
19570 /* Returns true iff the expression EXPR is one from which a template
19571 argument can be deduced. In other words, if it's an undecorated
19572 use of a template non-type parameter. */
19575 deducible_expression (tree expr
)
19577 /* Strip implicit conversions. */
19578 while (CONVERT_EXPR_P (expr
))
19579 expr
= TREE_OPERAND (expr
, 0);
19580 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
19583 /* Returns true iff the array domain DOMAIN uses a template parameter in a
19584 deducible way; that is, if it has a max value of <PARM> - 1. */
19587 deducible_array_bound (tree domain
)
19589 if (domain
== NULL_TREE
)
19592 tree max
= TYPE_MAX_VALUE (domain
);
19593 if (TREE_CODE (max
) != MINUS_EXPR
)
19596 return deducible_expression (TREE_OPERAND (max
, 0));
19599 /* Returns true iff the template arguments ARGS use a template parameter
19600 in a deducible way. */
19603 deducible_template_args (tree args
)
19605 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
19608 tree elt
= TREE_VEC_ELT (args
, i
);
19609 if (ARGUMENT_PACK_P (elt
))
19610 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
19613 if (PACK_EXPANSION_P (elt
))
19614 elt
= PACK_EXPANSION_PATTERN (elt
);
19615 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
19617 else if (TYPE_P (elt
))
19618 deducible
= uses_deducible_template_parms (elt
);
19620 deducible
= deducible_expression (elt
);
19628 /* Returns true iff TYPE contains any deducible references to template
19629 parameters, as per 14.8.2.5. */
19632 uses_deducible_template_parms (tree type
)
19634 if (PACK_EXPANSION_P (type
))
19635 type
= PACK_EXPANSION_PATTERN (type
);
19642 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
19643 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19649 if (POINTER_TYPE_P (type
))
19650 return uses_deducible_template_parms (TREE_TYPE (type
));
19652 /* T[integer-constant ]
19654 if (TREE_CODE (type
) == ARRAY_TYPE
)
19655 return (uses_deducible_template_parms (TREE_TYPE (type
))
19656 || deducible_array_bound (TYPE_DOMAIN (type
)));
19668 if (TYPE_PTRMEM_P (type
))
19669 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
19670 || (uses_deducible_template_parms
19671 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
19673 /* template-name <T> (where template-name refers to a class template)
19674 template-name <i> (where template-name refers to a class template) */
19675 if (CLASS_TYPE_P (type
)
19676 && CLASSTYPE_TEMPLATE_INFO (type
)
19677 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
19678 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
19679 (CLASSTYPE_TI_ARGS (type
)));
19684 if (TREE_CODE (type
) == FUNCTION_TYPE
19685 || TREE_CODE (type
) == METHOD_TYPE
)
19687 if (uses_deducible_template_parms (TREE_TYPE (type
)))
19689 tree parm
= TYPE_ARG_TYPES (type
);
19690 if (TREE_CODE (type
) == METHOD_TYPE
)
19691 parm
= TREE_CHAIN (parm
);
19692 for (; parm
; parm
= TREE_CHAIN (parm
))
19693 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
19700 /* Subroutine of type_unification_real and unify_pack_expansion to
19701 handle unification of a single P/A pair. Parameters are as
19702 for those functions. */
19705 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
19706 int subr
, unification_kind_t strict
,
19709 tree arg_expr
= NULL_TREE
;
19712 if (arg
== error_mark_node
|| parm
== error_mark_node
)
19713 return unify_invalid (explain_p
);
19714 if (arg
== unknown_type_node
)
19715 /* We can't deduce anything from this, but we might get all the
19716 template args from other function args. */
19717 return unify_success (explain_p
);
19719 /* Implicit conversions (Clause 4) will be performed on a function
19720 argument to convert it to the type of the corresponding function
19721 parameter if the parameter type contains no template-parameters that
19722 participate in template argument deduction. */
19723 if (strict
!= DEDUCE_EXACT
19724 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
19725 /* For function parameters with no deducible template parameters,
19726 just return. We'll check non-dependent conversions later. */
19727 return unify_success (explain_p
);
19732 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
19733 | UNIFY_ALLOW_MORE_CV_QUAL
19734 | UNIFY_ALLOW_DERIVED
);
19738 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
19742 arg_strict
= UNIFY_ALLOW_NONE
;
19746 gcc_unreachable ();
19749 /* We only do these transformations if this is the top-level
19750 parameter_type_list in a call or declaration matching; in other
19751 situations (nested function declarators, template argument lists) we
19752 won't be comparing a type to an expression, and we don't do any type
19758 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
19759 if (type_unknown_p (arg
))
19761 /* [temp.deduct.type] A template-argument can be
19762 deduced from a pointer to function or pointer
19763 to member function argument if the set of
19764 overloaded functions does not contain function
19765 templates and at most one of a set of
19766 overloaded functions provides a unique
19768 resolve_overloaded_unification (tparms
, targs
, parm
,
19770 arg_strict
, explain_p
);
19771 /* If a unique match was not found, this is a
19772 non-deduced context, so we still succeed. */
19773 return unify_success (explain_p
);
19777 arg
= unlowered_expr_type (arg
);
19778 if (arg
== error_mark_node
)
19779 return unify_invalid (explain_p
);
19783 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
19786 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
19787 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
19788 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19790 /* For deduction from an init-list we need the actual list. */
19791 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
19793 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
19796 /* for_each_template_parm callback that always returns 0. */
19799 zero_r (tree
, void *)
19804 /* for_each_template_parm any_fn callback to handle deduction of a template
19805 type argument from the type of an array bound. */
19808 array_deduction_r (tree t
, void *data
)
19810 tree_pair_p d
= (tree_pair_p
)data
;
19811 tree
&tparms
= d
->purpose
;
19812 tree
&targs
= d
->value
;
19814 if (TREE_CODE (t
) == ARRAY_TYPE
)
19815 if (tree dom
= TYPE_DOMAIN (t
))
19816 if (tree max
= TYPE_MAX_VALUE (dom
))
19818 if (TREE_CODE (max
) == MINUS_EXPR
)
19819 max
= TREE_OPERAND (max
, 0);
19820 if (TREE_CODE (max
) == TEMPLATE_PARM_INDEX
)
19821 unify (tparms
, targs
, TREE_TYPE (max
), size_type_node
,
19822 UNIFY_ALLOW_NONE
, /*explain*/false);
19825 /* Keep walking. */
19829 /* Try to deduce any not-yet-deduced template type arguments from the type of
19830 an array bound. This is handled separately from unify because 14.8.2.5 says
19831 "The type of a type parameter is only deduced from an array bound if it is
19832 not otherwise deduced." */
19835 try_array_deduction (tree tparms
, tree targs
, tree parm
)
19837 tree_pair_s data
= { tparms
, targs
};
19838 hash_set
<tree
> visited
;
19839 for_each_template_parm (parm
, zero_r
, &data
, &visited
,
19840 /*nondeduced*/false, array_deduction_r
);
19843 /* Most parms like fn_type_unification.
19845 If SUBR is 1, we're being called recursively (to unify the
19846 arguments of a function or method parameter of a function
19849 CHECKS is a pointer to a vector of access checks encountered while
19850 substituting default template arguments. */
19853 type_unification_real (tree tparms
,
19857 unsigned int xnargs
,
19859 unification_kind_t strict
,
19861 vec
<deferred_access_check
, va_gc
> **checks
,
19866 int ntparms
= TREE_VEC_LENGTH (tparms
);
19867 int saw_undeduced
= 0;
19870 unsigned int nargs
;
19873 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
19874 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
19875 gcc_assert (ntparms
> 0);
19877 tree targs
= INNERMOST_TEMPLATE_ARGS (full_targs
);
19879 /* Reset the number of non-defaulted template arguments contained
19881 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
19889 while (parms
&& parms
!= void_list_node
19892 parm
= TREE_VALUE (parms
);
19894 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
19895 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
19896 /* For a function parameter pack that occurs at the end of the
19897 parameter-declaration-list, the type A of each remaining
19898 argument of the call is compared with the type P of the
19899 declarator-id of the function parameter pack. */
19902 parms
= TREE_CHAIN (parms
);
19904 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
19905 /* For a function parameter pack that does not occur at the
19906 end of the parameter-declaration-list, the type of the
19907 parameter pack is a non-deduced context. */
19913 if (unify_one_argument (tparms
, full_targs
, parm
, arg
, subr
, strict
,
19919 && parms
!= void_list_node
19920 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
19922 /* Unify the remaining arguments with the pack expansion type. */
19924 tree parmvec
= make_tree_vec (1);
19926 /* Allocate a TREE_VEC and copy in all of the arguments */
19927 argvec
= make_tree_vec (nargs
- ia
);
19928 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
19929 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
19931 /* Copy the parameter into parmvec. */
19932 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
19933 if (unify_pack_expansion (tparms
, full_targs
, parmvec
, argvec
, strict
,
19934 /*subr=*/subr
, explain_p
))
19937 /* Advance to the end of the list of parameters. */
19938 parms
= TREE_CHAIN (parms
);
19941 /* Fail if we've reached the end of the parm list, and more args
19942 are present, and the parm list isn't variadic. */
19943 if (ia
< nargs
&& parms
== void_list_node
)
19944 return unify_too_many_arguments (explain_p
, nargs
, ia
);
19945 /* Fail if parms are left and they don't have default values and
19946 they aren't all deduced as empty packs (c++/57397). This is
19947 consistent with sufficient_parms_p. */
19948 if (parms
&& parms
!= void_list_node
19949 && TREE_PURPOSE (parms
) == NULL_TREE
)
19951 unsigned int count
= nargs
;
19956 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
19959 p
= TREE_CHAIN (p
);
19961 while (p
&& p
!= void_list_node
);
19962 if (count
!= nargs
)
19963 return unify_too_few_arguments (explain_p
, ia
, count
,
19969 tsubst_flags_t complain
= (explain_p
19970 ? tf_warning_or_error
19972 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
19974 for (i
= 0; i
< ntparms
; i
++)
19976 tree targ
= TREE_VEC_ELT (targs
, i
);
19977 tree tparm
= TREE_VEC_ELT (tparms
, i
);
19979 /* Clear the "incomplete" flags on all argument packs now so that
19980 substituting them into later default arguments works. */
19981 if (targ
&& ARGUMENT_PACK_P (targ
))
19983 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
19984 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
19987 if (targ
|| tparm
== error_mark_node
)
19989 tparm
= TREE_VALUE (tparm
);
19991 if (TREE_CODE (tparm
) == TYPE_DECL
19992 && !tried_array_deduction
)
19994 try_array_deduction (tparms
, targs
, xparms
);
19995 tried_array_deduction
= true;
19996 if (TREE_VEC_ELT (targs
, i
))
20000 /* If this is an undeduced nontype parameter that depends on
20001 a type parameter, try another pass; its type may have been
20002 deduced from a later argument than the one from which
20003 this parameter can be deduced. */
20004 if (TREE_CODE (tparm
) == PARM_DECL
20005 && uses_template_parms (TREE_TYPE (tparm
))
20006 && saw_undeduced
< 2)
20012 /* Core issue #226 (C++0x) [temp.deduct]:
20014 If a template argument has not been deduced, its
20015 default template argument, if any, is used.
20017 When we are in C++98 mode, TREE_PURPOSE will either
20018 be NULL_TREE or ERROR_MARK_NODE, so we do not need
20019 to explicitly check cxx_dialect here. */
20020 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
20021 /* OK, there is a default argument. Wait until after the
20022 conversion check to do substitution. */
20025 /* If the type parameter is a parameter pack, then it will
20026 be deduced to an empty parameter pack. */
20027 if (template_parameter_pack_p (tparm
))
20031 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
20033 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
20034 TREE_CONSTANT (arg
) = 1;
20037 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
20039 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
20041 TREE_VEC_ELT (targs
, i
) = arg
;
20045 return unify_parameter_deduction_failure (explain_p
, tparm
);
20048 /* DR 1391: All parameters have args, now check non-dependent parms for
20050 if (saw_undeduced
< 2)
20051 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
20052 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
20054 parm
= TREE_VALUE (parms
);
20056 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
20057 && (!TREE_CHAIN (parms
)
20058 || TREE_CHAIN (parms
) == void_list_node
))
20059 /* For a function parameter pack that occurs at the end of the
20060 parameter-declaration-list, the type A of each remaining
20061 argument of the call is compared with the type P of the
20062 declarator-id of the function parameter pack. */
20065 parms
= TREE_CHAIN (parms
);
20067 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
20068 /* For a function parameter pack that does not occur at the
20069 end of the parameter-declaration-list, the type of the
20070 parameter pack is a non-deduced context. */
20076 if (uses_template_parms (parm
))
20078 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
20083 /* Now substitute into the default template arguments. */
20084 for (i
= 0; i
< ntparms
; i
++)
20086 tree targ
= TREE_VEC_ELT (targs
, i
);
20087 tree tparm
= TREE_VEC_ELT (tparms
, i
);
20089 if (targ
|| tparm
== error_mark_node
)
20091 tree parm
= TREE_VALUE (tparm
);
20092 tree arg
= TREE_PURPOSE (tparm
);
20093 reopen_deferring_access_checks (*checks
);
20094 location_t save_loc
= input_location
;
20096 input_location
= DECL_SOURCE_LOCATION (parm
);
20097 if (saw_undeduced
== 1)
20098 ++processing_template_decl
;
20100 if (saw_undeduced
== 1
20101 && TREE_CODE (parm
) == PARM_DECL
20102 && uses_template_parms (TREE_TYPE (parm
)))
20104 /* The type of this non-type parameter depends on undeduced
20105 parameters. Don't try to use its default argument yet,
20106 but do check whether the arguments we already have cause
20107 substitution failure, so that that happens before we try
20108 later default arguments (78489). */
20109 tree type
= tsubst (TREE_TYPE (parm
), full_targs
, complain
,
20111 if (type
== error_mark_node
)
20112 arg
= error_mark_node
;
20118 arg
= tsubst_template_arg (arg
, full_targs
, complain
, NULL_TREE
);
20120 if (!uses_template_parms (arg
))
20121 arg
= convert_template_argument (parm
, arg
, full_targs
,
20122 complain
, i
, NULL_TREE
);
20123 else if (saw_undeduced
== 1)
20126 arg
= error_mark_node
;
20129 if (saw_undeduced
== 1)
20130 --processing_template_decl
;
20131 input_location
= save_loc
;
20132 *checks
= get_deferred_access_checks ();
20133 pop_deferring_access_checks ();
20135 if (arg
== error_mark_node
)
20139 TREE_VEC_ELT (targs
, i
) = arg
;
20140 /* The position of the first default template argument,
20141 is also the number of non-defaulted arguments in TARGS.
20143 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20144 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
20148 if (saw_undeduced
++ == 1)
20152 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20153 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
20155 return unify_success (explain_p
);
20158 /* Subroutine of type_unification_real. Args are like the variables
20159 at the call site. ARG is an overloaded function (or template-id);
20160 we try deducing template args from each of the overloads, and if
20161 only one succeeds, we go with that. Modifies TARGS and returns
20162 true on success. */
20165 resolve_overloaded_unification (tree tparms
,
20169 unification_kind_t strict
,
20173 tree tempargs
= copy_node (targs
);
20175 tree goodfn
= NULL_TREE
;
20178 if (TREE_CODE (arg
) == ADDR_EXPR
)
20180 arg
= TREE_OPERAND (arg
, 0);
20186 if (TREE_CODE (arg
) == COMPONENT_REF
)
20187 /* Handle `&x' where `x' is some static or non-static member
20189 arg
= TREE_OPERAND (arg
, 1);
20191 if (TREE_CODE (arg
) == OFFSET_REF
)
20192 arg
= TREE_OPERAND (arg
, 1);
20194 /* Strip baselink information. */
20195 if (BASELINK_P (arg
))
20196 arg
= BASELINK_FUNCTIONS (arg
);
20198 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
20200 /* If we got some explicit template args, we need to plug them into
20201 the affected templates before we try to unify, in case the
20202 explicit args will completely resolve the templates in question. */
20205 tree expl_subargs
= TREE_OPERAND (arg
, 1);
20206 arg
= TREE_OPERAND (arg
, 0);
20208 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20211 tree subargs
, elem
;
20213 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
20216 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20217 expl_subargs
, NULL_TREE
, tf_none
,
20218 /*require_all_args=*/true,
20219 /*use_default_args=*/true);
20220 if (subargs
!= error_mark_node
20221 && !any_dependent_template_arguments_p (subargs
))
20223 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
20224 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
20225 elem
, strict
, sub_strict
, addr_p
, explain_p
)
20226 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
20235 /* If no templates (or more than one) are fully resolved by the
20236 explicit arguments, this template-id is a non-deduced context; it
20237 could still be OK if we deduce all template arguments for the
20238 enclosing call through other arguments. */
20242 else if (TREE_CODE (arg
) != OVERLOAD
20243 && TREE_CODE (arg
) != FUNCTION_DECL
)
20244 /* If ARG is, for example, "(0, &f)" then its type will be unknown
20245 -- but the deduction does not succeed because the expression is
20246 not just the function on its own. */
20249 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20252 if (try_one_overload (tparms
, targs
, tempargs
, parm
, TREE_TYPE (fn
),
20253 strict
, sub_strict
, addr_p
, explain_p
)
20254 && (!goodfn
|| !decls_match (goodfn
, fn
)))
20261 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20262 to function or pointer to member function argument if the set of
20263 overloaded functions does not contain function templates and at most
20264 one of a set of overloaded functions provides a unique match.
20266 So if we found multiple possibilities, we return success but don't
20267 deduce anything. */
20271 int i
= TREE_VEC_LENGTH (targs
);
20273 if (TREE_VEC_ELT (tempargs
, i
))
20275 tree old
= TREE_VEC_ELT (targs
, i
);
20276 tree new_
= TREE_VEC_ELT (tempargs
, i
);
20277 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
20278 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
20279 /* Don't forget explicit template arguments in a pack. */
20280 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
20281 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
20282 TREE_VEC_ELT (targs
, i
) = new_
;
20291 /* Core DR 115: In contexts where deduction is done and fails, or in
20292 contexts where deduction is not done, if a template argument list is
20293 specified and it, along with any default template arguments, identifies
20294 a single function template specialization, then the template-id is an
20295 lvalue for the function template specialization. */
20298 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
20300 tree expr
, offset
, baselink
;
20303 if (!type_unknown_p (orig_expr
))
20308 offset
= NULL_TREE
;
20309 baselink
= NULL_TREE
;
20311 if (TREE_CODE (expr
) == ADDR_EXPR
)
20313 expr
= TREE_OPERAND (expr
, 0);
20316 if (TREE_CODE (expr
) == OFFSET_REF
)
20319 expr
= TREE_OPERAND (expr
, 1);
20321 if (BASELINK_P (expr
))
20324 expr
= BASELINK_FUNCTIONS (expr
);
20327 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
20330 tree goodfn
= NULL_TREE
;
20332 /* If we got some explicit template args, we need to plug them into
20333 the affected templates before we try to unify, in case the
20334 explicit args will completely resolve the templates in question. */
20336 tree expl_subargs
= TREE_OPERAND (expr
, 1);
20337 tree arg
= TREE_OPERAND (expr
, 0);
20338 tree badfn
= NULL_TREE
;
20339 tree badargs
= NULL_TREE
;
20341 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20344 tree subargs
, elem
;
20346 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
20349 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20350 expl_subargs
, NULL_TREE
, tf_none
,
20351 /*require_all_args=*/true,
20352 /*use_default_args=*/true);
20353 if (subargs
!= error_mark_node
20354 && !any_dependent_template_arguments_p (subargs
))
20356 elem
= instantiate_template (fn
, subargs
, tf_none
);
20357 if (elem
== error_mark_node
)
20362 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
20371 mark_used (goodfn
);
20374 expr
= build_baselink (BASELINK_BINFO (baselink
),
20375 BASELINK_ACCESS_BINFO (baselink
),
20376 expr
, BASELINK_OPTYPE (baselink
));
20380 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
20381 expr
= build_offset_ref (base
, expr
, addr
, complain
);
20384 expr
= cp_build_addr_expr (expr
, complain
);
20387 else if (good
== 0 && badargs
&& (complain
& tf_error
))
20388 /* There were no good options and at least one bad one, so let the
20389 user know what the problem is. */
20390 instantiate_template (badfn
, badargs
, complain
);
20395 /* Subroutine of resolve_overloaded_unification; does deduction for a single
20396 overload. Fills TARGS with any deduced arguments, or error_mark_node if
20397 different overloads deduce different arguments for a given parm.
20398 ADDR_P is true if the expression for which deduction is being
20399 performed was of the form "& fn" rather than simply "fn".
20401 Returns 1 on success. */
20404 try_one_overload (tree tparms
,
20409 unification_kind_t strict
,
20418 if (arg
== error_mark_node
)
20421 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20422 to function or pointer to member function argument if the set of
20423 overloaded functions does not contain function templates and at most
20424 one of a set of overloaded functions provides a unique match.
20426 So if this is a template, just return success. */
20428 if (uses_template_parms (arg
))
20431 if (TREE_CODE (arg
) == METHOD_TYPE
)
20432 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
20434 arg
= build_pointer_type (arg
);
20436 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
20438 /* We don't copy orig_targs for this because if we have already deduced
20439 some template args from previous args, unify would complain when we
20440 try to deduce a template parameter for the same argument, even though
20441 there isn't really a conflict. */
20442 nargs
= TREE_VEC_LENGTH (targs
);
20443 tempargs
= make_tree_vec (nargs
);
20445 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
20448 /* First make sure we didn't deduce anything that conflicts with
20449 explicitly specified args. */
20450 for (i
= nargs
; i
--; )
20452 tree elt
= TREE_VEC_ELT (tempargs
, i
);
20453 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
20457 else if (uses_template_parms (elt
))
20458 /* Since we're unifying against ourselves, we will fill in
20459 template args used in the function parm list with our own
20460 template parms. Discard them. */
20461 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
20462 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
20464 /* Check that the argument at each index of the deduced argument pack
20465 is equivalent to the corresponding explicitly specified argument.
20466 We may have deduced more arguments than were explicitly specified,
20469 /* We used to assert ARGUMENT_PACK_INCOMPLETE_P (oldelt) here, but
20470 that's wrong if we deduce the same argument pack from multiple
20471 function arguments: it's only incomplete the first time. */
20473 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
20474 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
20476 if (TREE_VEC_LENGTH (deduced_pack
)
20477 < TREE_VEC_LENGTH (explicit_pack
))
20480 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
20481 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
20482 TREE_VEC_ELT (deduced_pack
, j
)))
20485 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
20489 for (i
= nargs
; i
--; )
20491 tree elt
= TREE_VEC_ELT (tempargs
, i
);
20494 TREE_VEC_ELT (targs
, i
) = elt
;
20500 /* PARM is a template class (perhaps with unbound template
20501 parameters). ARG is a fully instantiated type. If ARG can be
20502 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
20503 TARGS are as for unify. */
20506 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
20509 tree copy_of_targs
;
20511 if (!CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
20513 else if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20514 /* Matches anything. */;
20515 else if (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
20516 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
)))
20519 /* We need to make a new template argument vector for the call to
20520 unify. If we used TARGS, we'd clutter it up with the result of
20521 the attempted unification, even if this class didn't work out.
20522 We also don't want to commit ourselves to all the unifications
20523 we've already done, since unification is supposed to be done on
20524 an argument-by-argument basis. In other words, consider the
20525 following pathological case:
20527 template <int I, int J, int K>
20530 template <int I, int J>
20531 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
20533 template <int I, int J, int K>
20534 void f(S<I, J, K>, S<I, I, I>);
20543 Now, by the time we consider the unification involving `s2', we
20544 already know that we must have `f<0, 0, 0>'. But, even though
20545 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
20546 because there are two ways to unify base classes of S<0, 1, 2>
20547 with S<I, I, I>. If we kept the already deduced knowledge, we
20548 would reject the possibility I=1. */
20549 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20551 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20553 if (unify_bound_ttp_args (tparms
, copy_of_targs
, parm
, arg
, explain_p
))
20558 /* If unification failed, we're done. */
20559 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
20560 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
20566 /* Given a template type PARM and a class type ARG, find the unique
20567 base type in ARG that is an instance of PARM. We do not examine
20568 ARG itself; only its base-classes. If there is not exactly one
20569 appropriate base class, return NULL_TREE. PARM may be the type of
20570 a partial specialization, as well as a plain template type. Used
20573 static enum template_base_result
20574 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
20575 bool explain_p
, tree
*result
)
20577 tree rval
= NULL_TREE
;
20580 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
20582 binfo
= TYPE_BINFO (complete_type (arg
));
20585 /* The type could not be completed. */
20586 *result
= NULL_TREE
;
20587 return tbr_incomplete_type
;
20590 /* Walk in inheritance graph order. The search order is not
20591 important, and this avoids multiple walks of virtual bases. */
20592 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
20594 tree r
= try_class_unification (tparms
, targs
, parm
,
20595 BINFO_TYPE (binfo
), explain_p
);
20599 /* If there is more than one satisfactory baseclass, then:
20603 If they yield more than one possible deduced A, the type
20607 if (rval
&& !same_type_p (r
, rval
))
20609 *result
= NULL_TREE
;
20610 return tbr_ambiguous_baseclass
;
20618 return tbr_success
;
20621 /* Returns the level of DECL, which declares a template parameter. */
20624 template_decl_level (tree decl
)
20626 switch (TREE_CODE (decl
))
20629 case TEMPLATE_DECL
:
20630 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
20633 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
20636 gcc_unreachable ();
20641 /* Decide whether ARG can be unified with PARM, considering only the
20642 cv-qualifiers of each type, given STRICT as documented for unify.
20643 Returns nonzero iff the unification is OK on that basis. */
20646 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
20648 int arg_quals
= cp_type_quals (arg
);
20649 int parm_quals
= cp_type_quals (parm
);
20651 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
20652 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
20654 /* Although a CVR qualifier is ignored when being applied to a
20655 substituted template parameter ([8.3.2]/1 for example), that
20656 does not allow us to unify "const T" with "int&" because both
20657 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
20658 It is ok when we're allowing additional CV qualifiers
20659 at the outer level [14.8.2.1]/3,1st bullet. */
20660 if ((TREE_CODE (arg
) == REFERENCE_TYPE
20661 || TREE_CODE (arg
) == FUNCTION_TYPE
20662 || TREE_CODE (arg
) == METHOD_TYPE
)
20663 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
20666 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
20667 && (parm_quals
& TYPE_QUAL_RESTRICT
))
20671 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
20672 && (arg_quals
& parm_quals
) != parm_quals
)
20675 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
20676 && (parm_quals
& arg_quals
) != arg_quals
)
20682 /* Determines the LEVEL and INDEX for the template parameter PARM. */
20684 template_parm_level_and_index (tree parm
, int* level
, int* index
)
20686 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
20687 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
20688 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20690 *index
= TEMPLATE_TYPE_IDX (parm
);
20691 *level
= TEMPLATE_TYPE_LEVEL (parm
);
20695 *index
= TEMPLATE_PARM_IDX (parm
);
20696 *level
= TEMPLATE_PARM_LEVEL (parm
);
20700 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
20702 if (unify (TP, TA, P, A, S, EP)) \
20706 /* Unifies the remaining arguments in PACKED_ARGS with the pack
20707 expansion at the end of PACKED_PARMS. Returns 0 if the type
20708 deduction succeeds, 1 otherwise. STRICT is the same as in
20709 fn_type_unification. CALL_ARGS_P is true iff PACKED_ARGS is actually a
20710 function call argument list. We'll need to adjust the arguments to make them
20711 types. SUBR tells us if this is from a recursive call to
20712 type_unification_real, or for comparing two template argument
20716 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
20717 tree packed_args
, unification_kind_t strict
,
20718 bool subr
, bool explain_p
)
20721 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
20722 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
20723 tree pack
, packs
= NULL_TREE
;
20724 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
20726 /* Add in any args remembered from an earlier partial instantiation. */
20727 targs
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (parm
), targs
);
20728 int levels
= TMPL_ARGS_DEPTH (targs
);
20730 packed_args
= expand_template_argument_pack (packed_args
);
20732 int len
= TREE_VEC_LENGTH (packed_args
);
20734 /* Determine the parameter packs we will be deducing from the
20735 pattern, and record their current deductions. */
20736 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
20737 pack
; pack
= TREE_CHAIN (pack
))
20739 tree parm_pack
= TREE_VALUE (pack
);
20742 /* Only template parameter packs can be deduced, not e.g. function
20743 parameter packs or __bases or __integer_pack. */
20744 if (!TEMPLATE_PARM_P (parm_pack
))
20747 /* Determine the index and level of this parameter pack. */
20748 template_parm_level_and_index (parm_pack
, &level
, &idx
);
20749 if (level
< levels
)
20752 /* Keep track of the parameter packs and their corresponding
20754 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
20755 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
20758 /* Loop through all of the arguments that have not yet been
20759 unified and unify each with the pattern. */
20760 for (i
= start
; i
< len
; i
++)
20763 bool any_explicit
= false;
20764 tree arg
= TREE_VEC_ELT (packed_args
, i
);
20766 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
20767 or the element of its argument pack at the current index if
20768 this argument was explicitly specified. */
20769 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
20773 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
20776 if (TREE_VALUE (pack
)
20777 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
20778 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
20780 any_explicit
= true;
20781 arg
= TREE_VEC_ELT (pargs
, i
- start
);
20783 TMPL_ARG (targs
, level
, idx
) = arg
;
20786 /* If we had explicit template arguments, substitute them into the
20787 pattern before deduction. */
20790 /* Some arguments might still be unspecified or dependent. */
20792 ++processing_template_decl
;
20793 dependent
= any_dependent_template_arguments_p (targs
);
20795 --processing_template_decl
;
20796 parm
= tsubst (pattern
, targs
,
20797 explain_p
? tf_warning_or_error
: tf_none
,
20800 --processing_template_decl
;
20801 if (parm
== error_mark_node
)
20807 /* Unify the pattern with the current argument. */
20808 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
20812 /* For each parameter pack, collect the deduced value. */
20813 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
20816 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
20818 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
20819 TMPL_ARG (targs
, level
, idx
);
20823 /* Verify that the results of unification with the parameter packs
20824 produce results consistent with what we've seen before, and make
20825 the deduced argument packs available. */
20826 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
20828 tree old_pack
= TREE_VALUE (pack
);
20829 tree new_args
= TREE_TYPE (pack
);
20830 int i
, len
= TREE_VEC_LENGTH (new_args
);
20832 bool nondeduced_p
= false;
20834 /* By default keep the original deduced argument pack.
20835 If necessary, more specific code is going to update the
20836 resulting deduced argument later down in this function. */
20837 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
20838 TMPL_ARG (targs
, level
, idx
) = old_pack
;
20840 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
20841 actually deduce anything. */
20842 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
20843 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
20844 nondeduced_p
= true;
20848 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
20850 /* If we had fewer function args than explicit template args,
20851 just use the explicits. */
20852 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
20853 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
20854 if (len
< explicit_len
)
20855 new_args
= explicit_args
;
20861 /* Build the deduced *_ARGUMENT_PACK. */
20862 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
20864 result
= make_node (NONTYPE_ARGUMENT_PACK
);
20865 TREE_CONSTANT (result
) = 1;
20868 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
20870 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
20872 /* Note the deduced argument packs for this parameter
20874 TMPL_ARG (targs
, level
, idx
) = result
;
20876 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
20877 && (ARGUMENT_PACK_ARGS (old_pack
)
20878 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
20880 /* We only had the explicitly-provided arguments before, but
20881 now we have a complete set of arguments. */
20882 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
20884 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
20885 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
20886 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
20890 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
20891 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
20893 if (!comp_template_args (old_args
, new_args
,
20894 &bad_old_arg
, &bad_new_arg
))
20895 /* Inconsistent unification of this parameter pack. */
20896 return unify_parameter_pack_inconsistent (explain_p
,
20902 return unify_success (explain_p
);
20905 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
20906 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
20907 parameters and return value are as for unify. */
20910 unify_array_domain (tree tparms
, tree targs
,
20911 tree parm_dom
, tree arg_dom
,
20919 /* Our representation of array types uses "N - 1" as the
20920 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
20921 not an integer constant. We cannot unify arbitrarily
20922 complex expressions, so we eliminate the MINUS_EXPRs
20924 parm_max
= TYPE_MAX_VALUE (parm_dom
);
20925 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
20928 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
20929 parm_max
= TREE_OPERAND (parm_max
, 0);
20931 arg_max
= TYPE_MAX_VALUE (arg_dom
);
20932 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
20935 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
20936 trying to unify the type of a variable with the type
20937 of a template parameter. For example:
20939 template <unsigned int N>
20940 void f (char (&) [N]);
20947 Here, the type of the ARG will be "int [g(i)]", and
20948 may be a SAVE_EXPR, etc. */
20949 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
20950 return unify_vla_arg (explain_p
, arg_dom
);
20951 arg_max
= TREE_OPERAND (arg_max
, 0);
20954 /* If only one of the bounds used a MINUS_EXPR, compensate
20955 by adding one to the other bound. */
20956 if (parm_cst
&& !arg_cst
)
20957 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
20961 else if (arg_cst
&& !parm_cst
)
20962 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
20967 return unify (tparms
, targs
, parm_max
, arg_max
,
20968 UNIFY_ALLOW_INTEGER
, explain_p
);
20971 /* Returns whether T, a P or A in unify, is a type, template or expression. */
20973 enum pa_kind_t
{ pa_type
, pa_tmpl
, pa_expr
};
20978 if (PACK_EXPANSION_P (t
))
20979 t
= PACK_EXPANSION_PATTERN (t
);
20980 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
20981 || TREE_CODE (t
) == UNBOUND_CLASS_TEMPLATE
20982 || DECL_TYPE_TEMPLATE_P (t
))
20984 else if (TYPE_P (t
))
20990 /* Deduce the value of template parameters. TPARMS is the (innermost)
20991 set of template parameters to a template. TARGS is the bindings
20992 for those template parameters, as determined thus far; TARGS may
20993 include template arguments for outer levels of template parameters
20994 as well. PARM is a parameter to a template function, or a
20995 subcomponent of that parameter; ARG is the corresponding argument.
20996 This function attempts to match PARM with ARG in a manner
20997 consistent with the existing assignments in TARGS. If more values
20998 are deduced, then TARGS is updated.
21000 Returns 0 if the type deduction succeeds, 1 otherwise. The
21001 parameter STRICT is a bitwise or of the following flags:
21004 Require an exact match between PARM and ARG.
21005 UNIFY_ALLOW_MORE_CV_QUAL:
21006 Allow the deduced ARG to be more cv-qualified (by qualification
21007 conversion) than ARG.
21008 UNIFY_ALLOW_LESS_CV_QUAL:
21009 Allow the deduced ARG to be less cv-qualified than ARG.
21010 UNIFY_ALLOW_DERIVED:
21011 Allow the deduced ARG to be a template base class of ARG,
21012 or a pointer to a template base class of the type pointed to by
21014 UNIFY_ALLOW_INTEGER:
21015 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
21016 case for more information.
21017 UNIFY_ALLOW_OUTER_LEVEL:
21018 This is the outermost level of a deduction. Used to determine validity
21019 of qualification conversions. A valid qualification conversion must
21020 have const qualified pointers leading up to the inner type which
21021 requires additional CV quals, except at the outer level, where const
21022 is not required [conv.qual]. It would be normal to set this flag in
21023 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
21024 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
21025 This is the outermost level of a deduction, and PARM can be more CV
21026 qualified at this point.
21027 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
21028 This is the outermost level of a deduction, and PARM can be less CV
21029 qualified at this point. */
21032 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
21038 int strict_in
= strict
;
21039 tsubst_flags_t complain
= (explain_p
21040 ? tf_warning_or_error
21043 /* I don't think this will do the right thing with respect to types.
21044 But the only case I've seen it in so far has been array bounds, where
21045 signedness is the only information lost, and I think that will be
21047 while (CONVERT_EXPR_P (parm
))
21048 parm
= TREE_OPERAND (parm
, 0);
21050 if (arg
== error_mark_node
)
21051 return unify_invalid (explain_p
);
21052 if (arg
== unknown_type_node
21053 || arg
== init_list_type_node
)
21054 /* We can't deduce anything from this, but we might get all the
21055 template args from other function args. */
21056 return unify_success (explain_p
);
21058 if (parm
== any_targ_node
|| arg
== any_targ_node
)
21059 return unify_success (explain_p
);
21061 /* If PARM uses template parameters, then we can't bail out here,
21062 even if ARG == PARM, since we won't record unifications for the
21063 template parameters. We might need them if we're trying to
21064 figure out which of two things is more specialized. */
21065 if (arg
== parm
&& !uses_template_parms (parm
))
21066 return unify_success (explain_p
);
21068 /* Handle init lists early, so the rest of the function can assume
21069 we're dealing with a type. */
21070 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
21074 tree orig_parm
= parm
;
21076 /* Replace T with std::initializer_list<T> for deduction. */
21077 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21078 && flag_deduce_init_list
)
21079 parm
= listify (parm
);
21081 if (!is_std_init_list (parm
)
21082 && TREE_CODE (parm
) != ARRAY_TYPE
)
21083 /* We can only deduce from an initializer list argument if the
21084 parameter is std::initializer_list or an array; otherwise this
21085 is a non-deduced context. */
21086 return unify_success (explain_p
);
21088 if (TREE_CODE (parm
) == ARRAY_TYPE
)
21089 elttype
= TREE_TYPE (parm
);
21092 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
21093 /* Deduction is defined in terms of a single type, so just punt
21094 on the (bizarre) std::initializer_list<T...>. */
21095 if (PACK_EXPANSION_P (elttype
))
21096 return unify_success (explain_p
);
21099 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
21101 int elt_strict
= strict
;
21103 if (elt
== error_mark_node
)
21104 return unify_invalid (explain_p
);
21106 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
21108 tree type
= TREE_TYPE (elt
);
21109 if (type
== error_mark_node
)
21110 return unify_invalid (explain_p
);
21111 /* It should only be possible to get here for a call. */
21112 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
21113 elt_strict
|= maybe_adjust_types_for_deduction
21114 (DEDUCE_CALL
, &elttype
, &type
, elt
);
21118 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
21122 if (TREE_CODE (parm
) == ARRAY_TYPE
21123 && deducible_array_bound (TYPE_DOMAIN (parm
)))
21125 /* Also deduce from the length of the initializer list. */
21126 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
21127 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
21128 if (idx
== error_mark_node
)
21129 return unify_invalid (explain_p
);
21130 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
21134 /* If the std::initializer_list<T> deduction worked, replace the
21135 deduced A with std::initializer_list<A>. */
21136 if (orig_parm
!= parm
)
21138 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
21139 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21140 targ
= listify (targ
);
21141 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
21143 return unify_success (explain_p
);
21146 /* If parm and arg aren't the same kind of thing (template, type, or
21147 expression), fail early. */
21148 if (pa_kind (parm
) != pa_kind (arg
))
21149 return unify_invalid (explain_p
);
21151 /* Immediately reject some pairs that won't unify because of
21152 cv-qualification mismatches. */
21153 if (TREE_CODE (arg
) == TREE_CODE (parm
)
21155 /* It is the elements of the array which hold the cv quals of an array
21156 type, and the elements might be template type parms. We'll check
21157 when we recurse. */
21158 && TREE_CODE (arg
) != ARRAY_TYPE
21159 /* We check the cv-qualifiers when unifying with template type
21160 parameters below. We want to allow ARG `const T' to unify with
21161 PARM `T' for example, when computing which of two templates
21162 is more specialized, for example. */
21163 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
21164 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
21165 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21167 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
21168 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
21169 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
21170 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
21171 strict
&= ~UNIFY_ALLOW_DERIVED
;
21172 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
21173 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
21175 switch (TREE_CODE (parm
))
21177 case TYPENAME_TYPE
:
21179 case UNBOUND_CLASS_TEMPLATE
:
21180 /* In a type which contains a nested-name-specifier, template
21181 argument values cannot be deduced for template parameters used
21182 within the nested-name-specifier. */
21183 return unify_success (explain_p
);
21185 case TEMPLATE_TYPE_PARM
:
21186 case TEMPLATE_TEMPLATE_PARM
:
21187 case BOUND_TEMPLATE_TEMPLATE_PARM
:
21188 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
21189 if (error_operand_p (tparm
))
21190 return unify_invalid (explain_p
);
21192 if (TEMPLATE_TYPE_LEVEL (parm
)
21193 != template_decl_level (tparm
))
21194 /* The PARM is not one we're trying to unify. Just check
21195 to see if it matches ARG. */
21197 if (TREE_CODE (arg
) == TREE_CODE (parm
)
21198 && (is_auto (parm
) ? is_auto (arg
)
21199 : same_type_p (parm
, arg
)))
21200 return unify_success (explain_p
);
21202 return unify_type_mismatch (explain_p
, parm
, arg
);
21204 idx
= TEMPLATE_TYPE_IDX (parm
);
21205 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21206 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
21207 if (error_operand_p (tparm
))
21208 return unify_invalid (explain_p
);
21210 /* Check for mixed types and values. */
21211 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21212 && TREE_CODE (tparm
) != TYPE_DECL
)
21213 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21214 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
21215 gcc_unreachable ();
21217 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21219 if ((strict_in
& UNIFY_ALLOW_DERIVED
)
21220 && CLASS_TYPE_P (arg
))
21222 /* First try to match ARG directly. */
21223 tree t
= try_class_unification (tparms
, targs
, parm
, arg
,
21227 /* Otherwise, look for a suitable base of ARG, as below. */
21228 enum template_base_result r
;
21229 r
= get_template_base (tparms
, targs
, parm
, arg
,
21232 return unify_no_common_base (explain_p
, r
, parm
, arg
);
21236 /* ARG must be constructed from a template class or a template
21237 template parameter. */
21238 else if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
21239 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
21240 return unify_template_deduction_failure (explain_p
, parm
, arg
);
21242 /* Deduce arguments T, i from TT<T> or TT<i>. */
21243 if (unify_bound_ttp_args (tparms
, targs
, parm
, arg
, explain_p
))
21246 arg
= TYPE_TI_TEMPLATE (arg
);
21248 /* Fall through to deduce template name. */
21251 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21252 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21254 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
21256 /* Simple cases: Value already set, does match or doesn't. */
21257 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
21258 return unify_success (explain_p
);
21260 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
21264 /* If PARM is `const T' and ARG is only `int', we don't have
21265 a match unless we are allowing additional qualification.
21266 If ARG is `const int' and PARM is just `T' that's OK;
21267 that binds `const int' to `T'. */
21268 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
21270 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21272 /* Consider the case where ARG is `const volatile int' and
21273 PARM is `const T'. Then, T should be `volatile int'. */
21274 arg
= cp_build_qualified_type_real
21275 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
21276 if (arg
== error_mark_node
)
21277 return unify_invalid (explain_p
);
21279 /* Simple cases: Value already set, does match or doesn't. */
21280 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
21281 return unify_success (explain_p
);
21283 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
21285 /* Make sure that ARG is not a variable-sized array. (Note
21286 that were talking about variable-sized arrays (like
21287 `int[n]'), rather than arrays of unknown size (like
21288 `int[]').) We'll get very confused by such a type since
21289 the bound of the array is not constant, and therefore
21290 not mangleable. Besides, such types are not allowed in
21291 ISO C++, so we can do as we please here. We do allow
21292 them for 'auto' deduction, since that isn't ABI-exposed. */
21293 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
21294 return unify_vla_arg (explain_p
, arg
);
21296 /* Strip typedefs as in convert_template_argument. */
21297 arg
= canonicalize_type_argument (arg
, tf_none
);
21300 /* If ARG is a parameter pack or an expansion, we cannot unify
21301 against it unless PARM is also a parameter pack. */
21302 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
21303 && !template_parameter_pack_p (parm
))
21304 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
21306 /* If the argument deduction results is a METHOD_TYPE,
21307 then there is a problem.
21308 METHOD_TYPE doesn't map to any real C++ type the result of
21309 the deduction can not be of that type. */
21310 if (TREE_CODE (arg
) == METHOD_TYPE
)
21311 return unify_method_type_error (explain_p
, arg
);
21313 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
21314 return unify_success (explain_p
);
21316 case TEMPLATE_PARM_INDEX
:
21317 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
21318 if (error_operand_p (tparm
))
21319 return unify_invalid (explain_p
);
21321 if (TEMPLATE_PARM_LEVEL (parm
)
21322 != template_decl_level (tparm
))
21324 /* The PARM is not one we're trying to unify. Just check
21325 to see if it matches ARG. */
21326 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
21327 && cp_tree_equal (parm
, arg
));
21329 unify_expression_unequal (explain_p
, parm
, arg
);
21333 idx
= TEMPLATE_PARM_IDX (parm
);
21334 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21338 if ((strict
& UNIFY_ALLOW_INTEGER
)
21339 && TREE_TYPE (targ
) && TREE_TYPE (arg
)
21340 && CP_INTEGRAL_TYPE_P (TREE_TYPE (targ
)))
21341 /* We're deducing from an array bound, the type doesn't matter. */
21342 arg
= fold_convert (TREE_TYPE (targ
), arg
);
21343 int x
= !cp_tree_equal (targ
, arg
);
21345 unify_inconsistency (explain_p
, parm
, targ
, arg
);
21349 /* [temp.deduct.type] If, in the declaration of a function template
21350 with a non-type template-parameter, the non-type
21351 template-parameter is used in an expression in the function
21352 parameter-list and, if the corresponding template-argument is
21353 deduced, the template-argument type shall match the type of the
21354 template-parameter exactly, except that a template-argument
21355 deduced from an array bound may be of any integral type.
21356 The non-type parameter might use already deduced type parameters. */
21357 tparm
= TREE_TYPE (parm
);
21358 if (TEMPLATE_PARM_LEVEL (parm
) > TMPL_ARGS_DEPTH (targs
))
21359 /* We don't have enough levels of args to do any substitution. This
21360 can happen in the context of -fnew-ttp-matching. */;
21363 ++processing_template_decl
;
21364 tparm
= tsubst (tparm
, targs
, tf_none
, NULL_TREE
);
21365 --processing_template_decl
;
21367 if (tree a
= type_uses_auto (tparm
))
21369 tparm
= do_auto_deduction (tparm
, arg
, a
, complain
, adc_unify
);
21370 if (tparm
== error_mark_node
)
21375 if (!TREE_TYPE (arg
))
21376 /* Template-parameter dependent expression. Just accept it for now.
21377 It will later be processed in convert_template_argument. */
21379 else if (same_type_p (non_reference (TREE_TYPE (arg
)),
21380 non_reference (tparm
)))
21382 else if ((strict
& UNIFY_ALLOW_INTEGER
)
21383 && CP_INTEGRAL_TYPE_P (tparm
))
21384 /* Convert the ARG to the type of PARM; the deduced non-type
21385 template argument must exactly match the types of the
21386 corresponding parameter. */
21387 arg
= fold (build_nop (tparm
, arg
));
21388 else if (uses_template_parms (tparm
))
21390 /* We haven't deduced the type of this parameter yet. */
21391 if (cxx_dialect
>= cxx17
21392 /* We deduce from array bounds in try_array_deduction. */
21393 && !(strict
& UNIFY_ALLOW_INTEGER
))
21395 /* Deduce it from the non-type argument. */
21396 tree atype
= TREE_TYPE (arg
);
21397 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
21399 UNIFY_ALLOW_NONE
, explain_p
);
21402 /* Try again later. */
21403 return unify_success (explain_p
);
21406 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
21408 /* If ARG is a parameter pack or an expansion, we cannot unify
21409 against it unless PARM is also a parameter pack. */
21410 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
21411 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
21412 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
21415 bool removed_attr
= false;
21416 arg
= strip_typedefs_expr (arg
, &removed_attr
);
21418 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
21419 return unify_success (explain_p
);
21423 /* A pointer-to-member constant can be unified only with
21424 another constant. */
21425 if (TREE_CODE (arg
) != PTRMEM_CST
)
21426 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
21428 /* Just unify the class member. It would be useless (and possibly
21429 wrong, depending on the strict flags) to unify also
21430 PTRMEM_CST_CLASS, because we want to be sure that both parm and
21431 arg refer to the same variable, even if through different
21432 classes. For instance:
21434 struct A { int x; };
21437 Unification of &A::x and &B::x must succeed. */
21438 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
21439 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
21444 if (!TYPE_PTR_P (arg
))
21445 return unify_type_mismatch (explain_p
, parm
, arg
);
21447 /* [temp.deduct.call]
21449 A can be another pointer or pointer to member type that can
21450 be converted to the deduced A via a qualification
21451 conversion (_conv.qual_).
21453 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
21454 This will allow for additional cv-qualification of the
21455 pointed-to types if appropriate. */
21457 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
21458 /* The derived-to-base conversion only persists through one
21459 level of pointers. */
21460 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
21462 return unify (tparms
, targs
, TREE_TYPE (parm
),
21463 TREE_TYPE (arg
), strict
, explain_p
);
21466 case REFERENCE_TYPE
:
21467 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
21468 return unify_type_mismatch (explain_p
, parm
, arg
);
21469 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21470 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
21473 if (TREE_CODE (arg
) != ARRAY_TYPE
)
21474 return unify_type_mismatch (explain_p
, parm
, arg
);
21475 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
21476 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
21477 return unify_type_mismatch (explain_p
, parm
, arg
);
21478 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21479 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
21480 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
21481 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
21482 TYPE_DOMAIN (arg
), explain_p
);
21483 return unify_success (explain_p
);
21490 case ENUMERAL_TYPE
:
21493 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21494 return unify_type_mismatch (explain_p
, parm
, arg
);
21496 /* We have already checked cv-qualification at the top of the
21498 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
21499 return unify_type_mismatch (explain_p
, parm
, arg
);
21501 /* As far as unification is concerned, this wins. Later checks
21502 will invalidate it if necessary. */
21503 return unify_success (explain_p
);
21505 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
21506 /* Type INTEGER_CST can come from ordinary constant template args. */
21508 while (CONVERT_EXPR_P (arg
))
21509 arg
= TREE_OPERAND (arg
, 0);
21511 if (TREE_CODE (arg
) != INTEGER_CST
)
21512 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21513 return (tree_int_cst_equal (parm
, arg
)
21514 ? unify_success (explain_p
)
21515 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
21519 int i
, len
, argslen
;
21520 int parm_variadic_p
= 0;
21522 if (TREE_CODE (arg
) != TREE_VEC
)
21523 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21525 len
= TREE_VEC_LENGTH (parm
);
21526 argslen
= TREE_VEC_LENGTH (arg
);
21528 /* Check for pack expansions in the parameters. */
21529 for (i
= 0; i
< len
; ++i
)
21531 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
21534 /* We can unify against something with a trailing
21536 parm_variadic_p
= 1;
21538 /* [temp.deduct.type]/9: If the template argument list of
21539 P contains a pack expansion that is not the last
21540 template argument, the entire template argument list
21541 is a non-deduced context. */
21542 return unify_success (explain_p
);
21546 /* If we don't have enough arguments to satisfy the parameters
21547 (not counting the pack expression at the end), or we have
21548 too many arguments for a parameter list that doesn't end in
21549 a pack expression, we can't unify. */
21550 if (parm_variadic_p
21551 ? argslen
< len
- parm_variadic_p
21553 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
21555 /* Unify all of the parameters that precede the (optional)
21556 pack expression. */
21557 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
21559 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
21560 TREE_VEC_ELT (parm
, i
),
21561 TREE_VEC_ELT (arg
, i
),
21562 UNIFY_ALLOW_NONE
, explain_p
);
21564 if (parm_variadic_p
)
21565 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
21567 /*subr=*/true, explain_p
);
21568 return unify_success (explain_p
);
21573 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21574 return unify_type_mismatch (explain_p
, parm
, arg
);
21576 if (TYPE_PTRMEMFUNC_P (parm
))
21578 if (!TYPE_PTRMEMFUNC_P (arg
))
21579 return unify_type_mismatch (explain_p
, parm
, arg
);
21581 return unify (tparms
, targs
,
21582 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
21583 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
21584 strict
, explain_p
);
21586 else if (TYPE_PTRMEMFUNC_P (arg
))
21587 return unify_type_mismatch (explain_p
, parm
, arg
);
21589 if (CLASSTYPE_TEMPLATE_INFO (parm
))
21591 tree t
= NULL_TREE
;
21593 if (strict_in
& UNIFY_ALLOW_DERIVED
)
21595 /* First, we try to unify the PARM and ARG directly. */
21596 t
= try_class_unification (tparms
, targs
,
21597 parm
, arg
, explain_p
);
21601 /* Fallback to the special case allowed in
21602 [temp.deduct.call]:
21604 If P is a class, and P has the form
21605 template-id, then A can be a derived class of
21606 the deduced A. Likewise, if P is a pointer to
21607 a class of the form template-id, A can be a
21608 pointer to a derived class pointed to by the
21610 enum template_base_result r
;
21611 r
= get_template_base (tparms
, targs
, parm
, arg
,
21616 /* Don't give the derived diagnostic if we're
21617 already dealing with the same template. */
21619 = (CLASSTYPE_TEMPLATE_INFO (arg
)
21620 && (CLASSTYPE_TI_TEMPLATE (parm
)
21621 == CLASSTYPE_TI_TEMPLATE (arg
)));
21622 return unify_no_common_base (explain_p
&& !same_template
,
21627 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
21628 && (CLASSTYPE_TI_TEMPLATE (parm
)
21629 == CLASSTYPE_TI_TEMPLATE (arg
)))
21630 /* Perhaps PARM is something like S<U> and ARG is S<int>.
21631 Then, we should unify `int' and `U'. */
21634 /* There's no chance of unification succeeding. */
21635 return unify_type_mismatch (explain_p
, parm
, arg
);
21637 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
21638 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
21640 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
21641 return unify_type_mismatch (explain_p
, parm
, arg
);
21642 return unify_success (explain_p
);
21645 case FUNCTION_TYPE
:
21647 unsigned int nargs
;
21652 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21653 return unify_type_mismatch (explain_p
, parm
, arg
);
21655 /* CV qualifications for methods can never be deduced, they must
21656 match exactly. We need to check them explicitly here,
21657 because type_unification_real treats them as any other
21658 cv-qualified parameter. */
21659 if (TREE_CODE (parm
) == METHOD_TYPE
21660 && (!check_cv_quals_for_unify
21662 class_of_this_parm (arg
),
21663 class_of_this_parm (parm
))))
21664 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21665 if (TREE_CODE (arg
) == FUNCTION_TYPE
21666 && type_memfn_quals (parm
) != type_memfn_quals (arg
))
21667 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21668 if (type_memfn_rqual (parm
) != type_memfn_rqual (arg
))
21669 return unify_type_mismatch (explain_p
, parm
, arg
);
21671 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
21672 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
21674 nargs
= list_length (TYPE_ARG_TYPES (arg
));
21675 args
= XALLOCAVEC (tree
, nargs
);
21676 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
21677 a
!= NULL_TREE
&& a
!= void_list_node
;
21678 a
= TREE_CHAIN (a
), ++i
)
21679 args
[i
] = TREE_VALUE (a
);
21682 if (type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
21683 args
, nargs
, 1, DEDUCE_EXACT
,
21684 LOOKUP_NORMAL
, NULL
, explain_p
))
21687 if (flag_noexcept_type
)
21689 tree pspec
= TYPE_RAISES_EXCEPTIONS (parm
);
21690 tree aspec
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (arg
));
21691 if (pspec
== NULL_TREE
) pspec
= noexcept_false_spec
;
21692 if (aspec
== NULL_TREE
) aspec
= noexcept_false_spec
;
21693 if (TREE_PURPOSE (pspec
) && TREE_PURPOSE (aspec
)
21694 && uses_template_parms (TREE_PURPOSE (pspec
)))
21695 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_PURPOSE (pspec
),
21696 TREE_PURPOSE (aspec
),
21697 UNIFY_ALLOW_NONE
, explain_p
);
21698 else if (nothrow_spec_p (pspec
) && !nothrow_spec_p (aspec
))
21699 return unify_type_mismatch (explain_p
, parm
, arg
);
21706 /* Unify a pointer to member with a pointer to member function, which
21707 deduces the type of the member as a function type. */
21708 if (TYPE_PTRMEMFUNC_P (arg
))
21710 /* Check top-level cv qualifiers */
21711 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
21712 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21714 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
21715 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
21716 UNIFY_ALLOW_NONE
, explain_p
);
21718 /* Determine the type of the function we are unifying against. */
21719 tree fntype
= static_fn_type (arg
);
21721 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
21724 if (TREE_CODE (arg
) != OFFSET_TYPE
)
21725 return unify_type_mismatch (explain_p
, parm
, arg
);
21726 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
21727 TYPE_OFFSET_BASETYPE (arg
),
21728 UNIFY_ALLOW_NONE
, explain_p
);
21729 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21730 strict
, explain_p
);
21733 if (DECL_TEMPLATE_PARM_P (parm
))
21734 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
21735 if (arg
!= scalar_constant_value (parm
))
21736 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21737 return unify_success (explain_p
);
21740 case TEMPLATE_DECL
:
21741 /* Matched cases are handled by the ARG == PARM test above. */
21742 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21745 /* We might get a variable as a non-type template argument in parm if the
21746 corresponding parameter is type-dependent. Make any necessary
21747 adjustments based on whether arg is a reference. */
21748 if (CONSTANT_CLASS_P (arg
))
21749 parm
= fold_non_dependent_expr (parm
);
21750 else if (REFERENCE_REF_P (arg
))
21752 tree sub
= TREE_OPERAND (arg
, 0);
21754 if (TREE_CODE (sub
) == ADDR_EXPR
)
21755 arg
= TREE_OPERAND (sub
, 0);
21757 /* Now use the normal expression code to check whether they match. */
21760 case TYPE_ARGUMENT_PACK
:
21761 case NONTYPE_ARGUMENT_PACK
:
21762 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
21763 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
21766 case DECLTYPE_TYPE
:
21767 case UNDERLYING_TYPE
:
21768 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
21769 or UNDERLYING_TYPE nodes. */
21770 return unify_success (explain_p
);
21773 /* Unification fails if we hit an error node. */
21774 return unify_invalid (explain_p
);
21777 if (REFERENCE_REF_P (parm
))
21779 bool pexp
= PACK_EXPANSION_P (arg
);
21781 arg
= PACK_EXPANSION_PATTERN (arg
);
21782 if (REFERENCE_REF_P (arg
))
21783 arg
= TREE_OPERAND (arg
, 0);
21785 arg
= make_pack_expansion (arg
, complain
);
21786 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
21787 strict
, explain_p
);
21792 /* An unresolved overload is a nondeduced context. */
21793 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
21794 return unify_success (explain_p
);
21795 gcc_assert (EXPR_P (parm
) || TREE_CODE (parm
) == TRAIT_EXPR
);
21797 /* We must be looking at an expression. This can happen with
21801 void foo(S<I>, S<I + 2>);
21803 This is a "nondeduced context":
21807 The nondeduced contexts are:
21809 --A type that is a template-id in which one or more of
21810 the template-arguments is an expression that references
21811 a template-parameter.
21813 In these cases, we assume deduction succeeded, but don't
21814 actually infer any unifications. */
21816 if (!uses_template_parms (parm
)
21817 && !template_args_equal (parm
, arg
))
21818 return unify_expression_unequal (explain_p
, parm
, arg
);
21820 return unify_success (explain_p
);
21823 #undef RECUR_AND_CHECK_FAILURE
21825 /* Note that DECL can be defined in this translation unit, if
21829 mark_definable (tree decl
)
21832 DECL_NOT_REALLY_EXTERN (decl
) = 1;
21833 FOR_EACH_CLONE (clone
, decl
)
21834 DECL_NOT_REALLY_EXTERN (clone
) = 1;
21837 /* Called if RESULT is explicitly instantiated, or is a member of an
21838 explicitly instantiated class. */
21841 mark_decl_instantiated (tree result
, int extern_p
)
21843 SET_DECL_EXPLICIT_INSTANTIATION (result
);
21845 /* If this entity has already been written out, it's too late to
21846 make any modifications. */
21847 if (TREE_ASM_WRITTEN (result
))
21850 /* For anonymous namespace we don't need to do anything. */
21851 if (decl_anon_ns_mem_p (result
))
21853 gcc_assert (!TREE_PUBLIC (result
));
21857 if (TREE_CODE (result
) != FUNCTION_DECL
)
21858 /* The TREE_PUBLIC flag for function declarations will have been
21859 set correctly by tsubst. */
21860 TREE_PUBLIC (result
) = 1;
21862 /* This might have been set by an earlier implicit instantiation. */
21863 DECL_COMDAT (result
) = 0;
21866 DECL_NOT_REALLY_EXTERN (result
) = 0;
21869 mark_definable (result
);
21870 mark_needed (result
);
21871 /* Always make artificials weak. */
21872 if (DECL_ARTIFICIAL (result
) && flag_weak
)
21873 comdat_linkage (result
);
21874 /* For WIN32 we also want to put explicit instantiations in
21875 linkonce sections. */
21876 else if (TREE_PUBLIC (result
))
21877 maybe_make_one_only (result
);
21880 /* If EXTERN_P, then this function will not be emitted -- unless
21881 followed by an explicit instantiation, at which point its linkage
21882 will be adjusted. If !EXTERN_P, then this function will be
21883 emitted here. In neither circumstance do we want
21884 import_export_decl to adjust the linkage. */
21885 DECL_INTERFACE_KNOWN (result
) = 1;
21888 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
21889 important template arguments. If any are missing, we check whether
21890 they're important by using error_mark_node for substituting into any
21891 args that were used for partial ordering (the ones between ARGS and END)
21892 and seeing if it bubbles up. */
21895 check_undeduced_parms (tree targs
, tree args
, tree end
)
21897 bool found
= false;
21899 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
21900 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
21903 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
21907 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
21908 if (substed
== error_mark_node
)
21914 /* Given two function templates PAT1 and PAT2, return:
21916 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
21917 -1 if PAT2 is more specialized than PAT1.
21918 0 if neither is more specialized.
21920 LEN indicates the number of parameters we should consider
21921 (defaulted parameters should not be considered).
21923 The 1998 std underspecified function template partial ordering, and
21924 DR214 addresses the issue. We take pairs of arguments, one from
21925 each of the templates, and deduce them against each other. One of
21926 the templates will be more specialized if all the *other*
21927 template's arguments deduce against its arguments and at least one
21928 of its arguments *does* *not* deduce against the other template's
21929 corresponding argument. Deduction is done as for class templates.
21930 The arguments used in deduction have reference and top level cv
21931 qualifiers removed. Iff both arguments were originally reference
21932 types *and* deduction succeeds in both directions, an lvalue reference
21933 wins against an rvalue reference and otherwise the template
21934 with the more cv-qualified argument wins for that pairing (if
21935 neither is more cv-qualified, they both are equal). Unlike regular
21936 deduction, after all the arguments have been deduced in this way,
21937 we do *not* verify the deduced template argument values can be
21938 substituted into non-deduced contexts.
21940 The logic can be a bit confusing here, because we look at deduce1 and
21941 targs1 to see if pat2 is at least as specialized, and vice versa; if we
21942 can find template arguments for pat1 to make arg1 look like arg2, that
21943 means that arg2 is at least as specialized as arg1. */
21946 more_specialized_fn (tree pat1
, tree pat2
, int len
)
21948 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
21949 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
21950 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
21951 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
21952 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
21953 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
21954 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
21955 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
21956 tree origs1
, origs2
;
21957 bool lose1
= false;
21958 bool lose2
= false;
21960 /* Remove the this parameter from non-static member functions. If
21961 one is a non-static member function and the other is not a static
21962 member function, remove the first parameter from that function
21963 also. This situation occurs for operator functions where we
21964 locate both a member function (with this pointer) and non-member
21965 operator (with explicit first operand). */
21966 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
21968 len
--; /* LEN is the number of significant arguments for DECL1 */
21969 args1
= TREE_CHAIN (args1
);
21970 if (!DECL_STATIC_FUNCTION_P (decl2
))
21971 args2
= TREE_CHAIN (args2
);
21973 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
21975 args2
= TREE_CHAIN (args2
);
21976 if (!DECL_STATIC_FUNCTION_P (decl1
))
21979 args1
= TREE_CHAIN (args1
);
21983 /* If only one is a conversion operator, they are unordered. */
21984 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
21987 /* Consider the return type for a conversion function */
21988 if (DECL_CONV_FN_P (decl1
))
21990 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
21991 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
21995 processing_template_decl
++;
22001 /* Stop when an ellipsis is seen. */
22002 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
22004 tree arg1
= TREE_VALUE (args1
);
22005 tree arg2
= TREE_VALUE (args2
);
22006 int deduce1
, deduce2
;
22012 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
22013 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22015 /* When both arguments are pack expansions, we need only
22016 unify the patterns themselves. */
22017 arg1
= PACK_EXPANSION_PATTERN (arg1
);
22018 arg2
= PACK_EXPANSION_PATTERN (arg2
);
22020 /* This is the last comparison we need to do. */
22024 /* DR 1847: If a particular P contains no template-parameters that
22025 participate in template argument deduction, that P is not used to
22026 determine the ordering. */
22027 if (!uses_deducible_template_parms (arg1
)
22028 && !uses_deducible_template_parms (arg2
))
22031 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
22033 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
22034 arg1
= TREE_TYPE (arg1
);
22035 quals1
= cp_type_quals (arg1
);
22038 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
22040 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
22041 arg2
= TREE_TYPE (arg2
);
22042 quals2
= cp_type_quals (arg2
);
22045 arg1
= TYPE_MAIN_VARIANT (arg1
);
22046 arg2
= TYPE_MAIN_VARIANT (arg2
);
22048 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
22050 int i
, len2
= remaining_arguments (args2
);
22051 tree parmvec
= make_tree_vec (1);
22052 tree argvec
= make_tree_vec (len2
);
22055 /* Setup the parameter vector, which contains only ARG1. */
22056 TREE_VEC_ELT (parmvec
, 0) = arg1
;
22058 /* Setup the argument vector, which contains the remaining
22060 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
22061 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
22063 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
22064 argvec
, DEDUCE_EXACT
,
22065 /*subr=*/true, /*explain_p=*/false)
22068 /* We cannot deduce in the other direction, because ARG1 is
22069 a pack expansion but ARG2 is not. */
22072 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22074 int i
, len1
= remaining_arguments (args1
);
22075 tree parmvec
= make_tree_vec (1);
22076 tree argvec
= make_tree_vec (len1
);
22079 /* Setup the parameter vector, which contains only ARG1. */
22080 TREE_VEC_ELT (parmvec
, 0) = arg2
;
22082 /* Setup the argument vector, which contains the remaining
22084 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
22085 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
22087 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
22088 argvec
, DEDUCE_EXACT
,
22089 /*subr=*/true, /*explain_p=*/false)
22092 /* We cannot deduce in the other direction, because ARG2 is
22093 a pack expansion but ARG1 is not.*/
22099 /* The normal case, where neither argument is a pack
22101 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
22102 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
22104 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
22105 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
22109 /* If we couldn't deduce arguments for tparms1 to make arg1 match
22110 arg2, then arg2 is not as specialized as arg1. */
22116 /* "If, for a given type, deduction succeeds in both directions
22117 (i.e., the types are identical after the transformations above)
22118 and both P and A were reference types (before being replaced with
22119 the type referred to above):
22120 - if the type from the argument template was an lvalue reference and
22121 the type from the parameter template was not, the argument type is
22122 considered to be more specialized than the other; otherwise,
22123 - if the type from the argument template is more cv-qualified
22124 than the type from the parameter template (as described above),
22125 the argument type is considered to be more specialized than the other;
22127 - neither type is more specialized than the other." */
22129 if (deduce1
&& deduce2
)
22131 if (ref1
&& ref2
&& ref1
!= ref2
)
22138 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
22140 if ((quals1
& quals2
) == quals2
)
22142 if ((quals1
& quals2
) == quals1
)
22147 if (lose1
&& lose2
)
22148 /* We've failed to deduce something in either direction.
22149 These must be unordered. */
22154 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
22155 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22156 /* We have already processed all of the arguments in our
22157 handing of the pack expansion type. */
22160 args1
= TREE_CHAIN (args1
);
22161 args2
= TREE_CHAIN (args2
);
22164 /* "In most cases, all template parameters must have values in order for
22165 deduction to succeed, but for partial ordering purposes a template
22166 parameter may remain without a value provided it is not used in the
22167 types being used for partial ordering."
22169 Thus, if we are missing any of the targs1 we need to substitute into
22170 origs1, then pat2 is not as specialized as pat1. This can happen when
22171 there is a nondeduced context. */
22172 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
22174 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
22177 processing_template_decl
--;
22179 /* If both deductions succeed, the partial ordering selects the more
22180 constrained template. */
22181 if (!lose1
&& !lose2
)
22183 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
22184 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
22185 lose1
= !subsumes_constraints (c1
, c2
);
22186 lose2
= !subsumes_constraints (c2
, c1
);
22189 /* All things being equal, if the next argument is a pack expansion
22190 for one function but not for the other, prefer the
22191 non-variadic function. FIXME this is bogus; see c++/41958. */
22193 && args1
&& TREE_VALUE (args1
)
22194 && args2
&& TREE_VALUE (args2
))
22196 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
22197 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
22200 if (lose1
== lose2
)
22208 /* Determine which of two partial specializations of TMPL is more
22211 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
22212 to the first partial specialization. The TREE_PURPOSE is the
22213 innermost set of template parameters for the partial
22214 specialization. PAT2 is similar, but for the second template.
22216 Return 1 if the first partial specialization is more specialized;
22217 -1 if the second is more specialized; 0 if neither is more
22220 See [temp.class.order] for information about determining which of
22221 two templates is more specialized. */
22224 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
22228 bool any_deductions
= false;
22230 tree tmpl1
= TREE_VALUE (pat1
);
22231 tree tmpl2
= TREE_VALUE (pat2
);
22232 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
22233 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
22235 /* Just like what happens for functions, if we are ordering between
22236 different template specializations, we may encounter dependent
22237 types in the arguments, and we need our dependency check functions
22238 to behave correctly. */
22239 ++processing_template_decl
;
22240 targs
= get_partial_spec_bindings (tmpl
, tmpl1
, specargs2
);
22244 any_deductions
= true;
22247 targs
= get_partial_spec_bindings (tmpl
, tmpl2
, specargs1
);
22251 any_deductions
= true;
22253 --processing_template_decl
;
22255 /* If both deductions succeed, the partial ordering selects the more
22256 constrained template. */
22257 if (!winner
&& any_deductions
)
22258 return more_constrained (tmpl1
, tmpl2
);
22260 /* In the case of a tie where at least one of the templates
22261 has a parameter pack at the end, the template with the most
22262 non-packed parameters wins. */
22265 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
22266 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
22268 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
22269 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
22270 int len1
= TREE_VEC_LENGTH (args1
);
22271 int len2
= TREE_VEC_LENGTH (args2
);
22273 /* We don't count the pack expansion at the end. */
22274 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
22276 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
22281 else if (len1
< len2
)
22288 /* Return the template arguments that will produce the function signature
22289 DECL from the function template FN, with the explicit template
22290 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
22291 also match. Return NULL_TREE if no satisfactory arguments could be
22295 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
22297 int ntparms
= DECL_NTPARMS (fn
);
22298 tree targs
= make_tree_vec (ntparms
);
22299 tree decl_type
= TREE_TYPE (decl
);
22300 tree decl_arg_types
;
22302 unsigned int nargs
, ix
;
22305 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
22307 /* Never do unification on the 'this' parameter. */
22308 decl_arg_types
= skip_artificial_parms_for (decl
,
22309 TYPE_ARG_TYPES (decl_type
));
22311 nargs
= list_length (decl_arg_types
);
22312 args
= XALLOCAVEC (tree
, nargs
);
22313 for (arg
= decl_arg_types
, ix
= 0;
22314 arg
!= NULL_TREE
&& arg
!= void_list_node
;
22315 arg
= TREE_CHAIN (arg
), ++ix
)
22316 args
[ix
] = TREE_VALUE (arg
);
22318 if (fn_type_unification (fn
, explicit_args
, targs
,
22320 (check_rettype
|| DECL_CONV_FN_P (fn
)
22321 ? TREE_TYPE (decl_type
) : NULL_TREE
),
22322 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
22324 == error_mark_node
)
22330 /* Return the innermost template arguments that, when applied to a partial
22331 specialization SPEC_TMPL of TMPL, yield the ARGS.
22333 For example, suppose we have:
22335 template <class T, class U> struct S {};
22336 template <class T> struct S<T*, int> {};
22338 Then, suppose we want to get `S<double*, int>'. SPEC_TMPL will be the
22339 partial specialization and the ARGS will be {double*, int}. The resulting
22340 vector will be {double}, indicating that `T' is bound to `double'. */
22343 get_partial_spec_bindings (tree tmpl
, tree spec_tmpl
, tree args
)
22345 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
22347 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (spec_tmpl
)));
22348 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
22350 tree innermost_deduced_args
;
22352 innermost_deduced_args
= make_tree_vec (ntparms
);
22353 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
22355 deduced_args
= copy_node (args
);
22356 SET_TMPL_ARGS_LEVEL (deduced_args
,
22357 TMPL_ARGS_DEPTH (deduced_args
),
22358 innermost_deduced_args
);
22361 deduced_args
= innermost_deduced_args
;
22363 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
22365 if (unify (tparms
, deduced_args
,
22366 INNERMOST_TEMPLATE_ARGS (spec_args
),
22367 INNERMOST_TEMPLATE_ARGS (args
),
22368 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
22371 for (i
= 0; i
< ntparms
; ++i
)
22372 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
22374 if (!tried_array_deduction
)
22376 try_array_deduction (tparms
, innermost_deduced_args
,
22377 INNERMOST_TEMPLATE_ARGS (spec_args
));
22378 tried_array_deduction
= true;
22379 if (TREE_VEC_ELT (innermost_deduced_args
, i
))
22385 tree tinst
= build_tree_list (spec_tmpl
, deduced_args
);
22386 if (!push_tinst_level (tinst
))
22388 excessive_deduction_depth
= true;
22392 /* Verify that nondeduced template arguments agree with the type
22393 obtained from argument deduction.
22397 struct A { typedef int X; };
22398 template <class T, class U> struct C {};
22399 template <class T> struct C<T, typename T::X> {};
22401 Then with the instantiation `C<A, int>', we can deduce that
22402 `T' is `A' but unify () does not check whether `typename T::X'
22404 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
22406 if (spec_args
!= error_mark_node
)
22407 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
22408 INNERMOST_TEMPLATE_ARGS (spec_args
),
22409 tmpl
, tf_none
, false, false);
22411 pop_tinst_level ();
22413 if (spec_args
== error_mark_node
22414 /* We only need to check the innermost arguments; the other
22415 arguments will always agree. */
22416 || !comp_template_args_porder (INNERMOST_TEMPLATE_ARGS (spec_args
),
22417 INNERMOST_TEMPLATE_ARGS (args
)))
22420 /* Now that we have bindings for all of the template arguments,
22421 ensure that the arguments deduced for the template template
22422 parameters have compatible template parameter lists. See the use
22423 of template_template_parm_bindings_ok_p in fn_type_unification
22424 for more information. */
22425 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
22428 return deduced_args
;
22431 // Compare two function templates T1 and T2 by deducing bindings
22432 // from one against the other. If both deductions succeed, compare
22433 // constraints to see which is more constrained.
22435 more_specialized_inst (tree t1
, tree t2
)
22440 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
22446 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
22452 // If both deductions succeed, then one may be more constrained.
22453 if (count
== 2 && fate
== 0)
22454 fate
= more_constrained (t1
, t2
);
22459 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
22460 Return the TREE_LIST node with the most specialized template, if
22461 any. If there is no most specialized template, the error_mark_node
22464 Note that this function does not look at, or modify, the
22465 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
22466 returned is one of the elements of INSTANTIATIONS, callers may
22467 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
22468 and retrieve it from the value returned. */
22471 most_specialized_instantiation (tree templates
)
22475 ++processing_template_decl
;
22478 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
22480 gcc_assert (TREE_VALUE (champ
) != TREE_VALUE (fn
));
22481 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
22486 /* Equally specialized, move to next function. If there
22487 is no next function, nothing's most specialized. */
22488 fn
= TREE_CHAIN (fn
);
22496 /* Now verify that champ is better than everything earlier in the
22497 instantiation list. */
22498 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
22499 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
22506 processing_template_decl
--;
22509 return error_mark_node
;
22514 /* If DECL is a specialization of some template, return the most
22515 general such template. Otherwise, returns NULL_TREE.
22517 For example, given:
22519 template <class T> struct S { template <class U> void f(U); };
22521 if TMPL is `template <class U> void S<int>::f(U)' this will return
22522 the full template. This function will not trace past partial
22523 specializations, however. For example, given in addition:
22525 template <class T> struct S<T*> { template <class U> void f(U); };
22527 if TMPL is `template <class U> void S<int*>::f(U)' this will return
22528 `template <class T> template <class U> S<T*>::f(U)'. */
22531 most_general_template (tree decl
)
22533 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
22535 if (tree tinfo
= get_template_info (decl
))
22536 decl
= TI_TEMPLATE (tinfo
);
22537 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
22538 template friend, or a FIELD_DECL for a capture pack. */
22539 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
22543 /* Look for more and more general templates. */
22544 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
22546 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
22547 (See cp-tree.h for details.) */
22548 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
22551 if (CLASS_TYPE_P (TREE_TYPE (decl
))
22552 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
22553 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
22556 /* Stop if we run into an explicitly specialized class template. */
22557 if (!DECL_NAMESPACE_SCOPE_P (decl
)
22558 && DECL_CONTEXT (decl
)
22559 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
22562 decl
= DECL_TI_TEMPLATE (decl
);
22568 /* Return the most specialized of the template partial specializations
22569 which can produce TARGET, a specialization of some class or variable
22570 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
22571 a TEMPLATE_DECL node corresponding to the partial specialization, while
22572 the TREE_PURPOSE is the set of template arguments that must be
22573 substituted into the template pattern in order to generate TARGET.
22575 If the choice of partial specialization is ambiguous, a diagnostic
22576 is issued, and the error_mark_node is returned. If there are no
22577 partial specializations matching TARGET, then NULL_TREE is
22578 returned, indicating that the primary template should be used. */
22581 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
22583 tree list
= NULL_TREE
;
22588 tree outer_args
= NULL_TREE
;
22591 if (TYPE_P (target
))
22593 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
22594 tmpl
= TI_TEMPLATE (tinfo
);
22595 args
= TI_ARGS (tinfo
);
22597 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
22599 tmpl
= TREE_OPERAND (target
, 0);
22600 args
= TREE_OPERAND (target
, 1);
22602 else if (VAR_P (target
))
22604 tree tinfo
= DECL_TEMPLATE_INFO (target
);
22605 tmpl
= TI_TEMPLATE (tinfo
);
22606 args
= TI_ARGS (tinfo
);
22609 gcc_unreachable ();
22611 tree main_tmpl
= most_general_template (tmpl
);
22613 /* For determining which partial specialization to use, only the
22614 innermost args are interesting. */
22615 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
22617 outer_args
= strip_innermost_template_args (args
, 1);
22618 args
= INNERMOST_TEMPLATE_ARGS (args
);
22621 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
22624 tree spec_tmpl
= TREE_VALUE (t
);
22628 /* Substitute in the template args from the enclosing class. */
22629 ++processing_template_decl
;
22630 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
22631 --processing_template_decl
;
22634 if (spec_tmpl
== error_mark_node
)
22635 return error_mark_node
;
22637 spec_args
= get_partial_spec_bindings (tmpl
, spec_tmpl
, args
);
22641 spec_args
= add_to_template_args (outer_args
, spec_args
);
22643 /* Keep the candidate only if the constraints are satisfied,
22644 or if we're not compiling with concepts. */
22646 || constraints_satisfied_p (spec_tmpl
, spec_args
))
22648 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
22649 TREE_TYPE (list
) = TREE_TYPE (t
);
22657 ambiguous_p
= false;
22660 t
= TREE_CHAIN (t
);
22661 for (; t
; t
= TREE_CHAIN (t
))
22663 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
22670 t
= TREE_CHAIN (t
);
22673 ambiguous_p
= true;
22682 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
22684 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
22687 ambiguous_p
= true;
22695 char *spaces
= NULL
;
22696 if (!(complain
& tf_error
))
22697 return error_mark_node
;
22698 if (TYPE_P (target
))
22699 error ("ambiguous template instantiation for %q#T", target
);
22701 error ("ambiguous template instantiation for %q#D", target
);
22702 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
22703 for (t
= list
; t
; t
= TREE_CHAIN (t
))
22705 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
22706 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
22707 "%s %#qS", spaces
? spaces
: str
, subst
);
22708 spaces
= spaces
? spaces
: get_spaces (str
);
22711 return error_mark_node
;
22717 /* Explicitly instantiate DECL. */
22720 do_decl_instantiation (tree decl
, tree storage
)
22722 tree result
= NULL_TREE
;
22725 if (!decl
|| decl
== error_mark_node
)
22726 /* An error occurred, for which grokdeclarator has already issued
22727 an appropriate message. */
22729 else if (! DECL_LANG_SPECIFIC (decl
))
22731 error ("explicit instantiation of non-template %q#D", decl
);
22735 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
22736 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
22738 if (VAR_P (decl
) && !var_templ
)
22740 /* There is an asymmetry here in the way VAR_DECLs and
22741 FUNCTION_DECLs are handled by grokdeclarator. In the case of
22742 the latter, the DECL we get back will be marked as a
22743 template instantiation, and the appropriate
22744 DECL_TEMPLATE_INFO will be set up. This does not happen for
22745 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
22746 should handle VAR_DECLs as it currently handles
22748 if (!DECL_CLASS_SCOPE_P (decl
))
22750 error ("%qD is not a static data member of a class template", decl
);
22753 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
22754 if (!result
|| !VAR_P (result
))
22756 error ("no matching template for %qD found", decl
);
22759 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
22761 error ("type %qT for explicit instantiation %qD does not match "
22762 "declared type %qT", TREE_TYPE (result
), decl
,
22767 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
22769 error ("explicit instantiation of %q#D", decl
);
22775 /* Check for various error cases. Note that if the explicit
22776 instantiation is valid the RESULT will currently be marked as an
22777 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
22778 until we get here. */
22780 if (DECL_TEMPLATE_SPECIALIZATION (result
))
22782 /* DR 259 [temp.spec].
22784 Both an explicit instantiation and a declaration of an explicit
22785 specialization shall not appear in a program unless the explicit
22786 instantiation follows a declaration of the explicit specialization.
22788 For a given set of template parameters, if an explicit
22789 instantiation of a template appears after a declaration of an
22790 explicit specialization for that template, the explicit
22791 instantiation has no effect. */
22794 else if (DECL_EXPLICIT_INSTANTIATION (result
))
22798 No program shall explicitly instantiate any template more
22801 We check DECL_NOT_REALLY_EXTERN so as not to complain when
22802 the first instantiation was `extern' and the second is not,
22803 and EXTERN_P for the opposite case. */
22804 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
22805 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
22806 /* If an "extern" explicit instantiation follows an ordinary
22807 explicit instantiation, the template is instantiated. */
22811 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
22813 error ("no matching template for %qD found", result
);
22816 else if (!DECL_TEMPLATE_INFO (result
))
22818 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
22822 if (storage
== NULL_TREE
)
22824 else if (storage
== ridpointers
[(int) RID_EXTERN
])
22826 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
22827 pedwarn (input_location
, OPT_Wpedantic
,
22828 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
22833 error ("storage class %qD applied to template instantiation", storage
);
22835 check_explicit_instantiation_namespace (result
);
22836 mark_decl_instantiated (result
, extern_p
);
22838 instantiate_decl (result
, /*defer_ok=*/true,
22839 /*expl_inst_class_mem_p=*/false);
22843 mark_class_instantiated (tree t
, int extern_p
)
22845 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
22846 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
22847 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
22848 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
22851 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
22852 rest_of_type_compilation (t
, 1);
22856 /* Called from do_type_instantiation through binding_table_foreach to
22857 do recursive instantiation for the type bound in ENTRY. */
22859 bt_instantiate_type_proc (binding_entry entry
, void *data
)
22861 tree storage
= *(tree
*) data
;
22863 if (MAYBE_CLASS_TYPE_P (entry
->type
)
22864 && CLASSTYPE_TEMPLATE_INFO (entry
->type
)
22865 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
22866 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
22869 /* Perform an explicit instantiation of template class T. STORAGE, if
22870 non-null, is the RID for extern, inline or static. COMPLAIN is
22871 nonzero if this is called from the parser, zero if called recursively,
22872 since the standard is unclear (as detailed below). */
22875 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
22880 int previous_instantiation_extern_p
= 0;
22882 if (TREE_CODE (t
) == TYPE_DECL
)
22885 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
22888 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
22890 error ("explicit instantiation of non-class template %qD", tmpl
);
22892 error ("explicit instantiation of non-template type %qT", t
);
22898 if (!COMPLETE_TYPE_P (t
))
22900 if (complain
& tf_error
)
22901 error ("explicit instantiation of %q#T before definition of template",
22906 if (storage
!= NULL_TREE
)
22908 if (!in_system_header_at (input_location
))
22910 if (storage
== ridpointers
[(int) RID_EXTERN
])
22912 if (cxx_dialect
== cxx98
)
22913 pedwarn (input_location
, OPT_Wpedantic
,
22914 "ISO C++ 1998 forbids the use of %<extern%> on "
22915 "explicit instantiations");
22918 pedwarn (input_location
, OPT_Wpedantic
,
22919 "ISO C++ forbids the use of %qE"
22920 " on explicit instantiations", storage
);
22923 if (storage
== ridpointers
[(int) RID_INLINE
])
22925 else if (storage
== ridpointers
[(int) RID_EXTERN
])
22927 else if (storage
== ridpointers
[(int) RID_STATIC
])
22931 error ("storage class %qD applied to template instantiation",
22937 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
22939 /* DR 259 [temp.spec].
22941 Both an explicit instantiation and a declaration of an explicit
22942 specialization shall not appear in a program unless the explicit
22943 instantiation follows a declaration of the explicit specialization.
22945 For a given set of template parameters, if an explicit
22946 instantiation of a template appears after a declaration of an
22947 explicit specialization for that template, the explicit
22948 instantiation has no effect. */
22951 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
22955 No program shall explicitly instantiate any template more
22958 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
22959 instantiation was `extern'. If EXTERN_P then the second is.
22960 These cases are OK. */
22961 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
22963 if (!previous_instantiation_extern_p
&& !extern_p
22964 && (complain
& tf_error
))
22965 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
22967 /* If we've already instantiated the template, just return now. */
22968 if (!CLASSTYPE_INTERFACE_ONLY (t
))
22972 check_explicit_instantiation_namespace (TYPE_NAME (t
));
22973 mark_class_instantiated (t
, extern_p
);
22978 /* In contrast to implicit instantiation, where only the
22979 declarations, and not the definitions, of members are
22980 instantiated, we have here:
22984 The explicit instantiation of a class template specialization
22985 implies the instantiation of all of its members not
22986 previously explicitly specialized in the translation unit
22987 containing the explicit instantiation.
22989 Of course, we can't instantiate member template classes, since we
22990 don't have any arguments for them. Note that the standard is
22991 unclear on whether the instantiation of the members are
22992 *explicit* instantiations or not. However, the most natural
22993 interpretation is that it should be an explicit
22995 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= DECL_CHAIN (fld
))
22997 || (TREE_CODE (fld
) == FUNCTION_DECL
22999 && user_provided_p (fld
)))
23000 && DECL_TEMPLATE_INSTANTIATION (fld
))
23002 mark_decl_instantiated (fld
, extern_p
);
23004 instantiate_decl (fld
, /*defer_ok=*/true,
23005 /*expl_inst_class_mem_p=*/true);
23008 if (CLASSTYPE_NESTED_UTDS (t
))
23009 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
23010 bt_instantiate_type_proc
, &storage
);
23013 /* Given a function DECL, which is a specialization of TMPL, modify
23014 DECL to be a re-instantiation of TMPL with the same template
23015 arguments. TMPL should be the template into which tsubst'ing
23016 should occur for DECL, not the most general template.
23018 One reason for doing this is a scenario like this:
23021 void f(const T&, int i);
23023 void g() { f(3, 7); }
23026 void f(const T& t, const int i) { }
23028 Note that when the template is first instantiated, with
23029 instantiate_template, the resulting DECL will have no name for the
23030 first parameter, and the wrong type for the second. So, when we go
23031 to instantiate the DECL, we regenerate it. */
23034 regenerate_decl_from_template (tree decl
, tree tmpl
, tree args
)
23036 /* The arguments used to instantiate DECL, from the most general
23040 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
23042 /* Make sure that we can see identifiers, and compute access
23044 push_access_scope (decl
);
23046 if (TREE_CODE (decl
) == FUNCTION_DECL
)
23054 args_depth
= TMPL_ARGS_DEPTH (args
);
23055 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
23056 if (args_depth
> parms_depth
)
23057 args
= get_innermost_template_args (args
, parms_depth
);
23059 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
23060 args
, tf_error
, NULL_TREE
,
23061 /*defer_ok*/false);
23062 if (specs
&& specs
!= error_mark_node
)
23063 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
23066 /* Merge parameter declarations. */
23067 decl_parm
= skip_artificial_parms_for (decl
,
23068 DECL_ARGUMENTS (decl
));
23070 = skip_artificial_parms_for (code_pattern
,
23071 DECL_ARGUMENTS (code_pattern
));
23072 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
23077 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
23078 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
23079 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
23081 parm_type
= type_decays_to (parm_type
);
23082 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
23083 TREE_TYPE (decl_parm
) = parm_type
;
23084 attributes
= DECL_ATTRIBUTES (pattern_parm
);
23085 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
23087 DECL_ATTRIBUTES (decl_parm
) = attributes
;
23088 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
23090 decl_parm
= DECL_CHAIN (decl_parm
);
23091 pattern_parm
= DECL_CHAIN (pattern_parm
);
23093 /* Merge any parameters that match with the function parameter
23095 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
23098 tree expanded_types
;
23099 /* Expand the TYPE_PACK_EXPANSION that provides the types for
23100 the parameters in this function parameter pack. */
23101 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
23102 args
, tf_error
, NULL_TREE
);
23103 len
= TREE_VEC_LENGTH (expanded_types
);
23104 for (i
= 0; i
< len
; i
++)
23109 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
23110 /* Rename the parameter to include the index. */
23111 DECL_NAME (decl_parm
) =
23112 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
23113 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
23114 parm_type
= type_decays_to (parm_type
);
23115 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
23116 TREE_TYPE (decl_parm
) = parm_type
;
23117 attributes
= DECL_ATTRIBUTES (pattern_parm
);
23118 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
23120 DECL_ATTRIBUTES (decl_parm
) = attributes
;
23121 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
23123 decl_parm
= DECL_CHAIN (decl_parm
);
23126 /* Merge additional specifiers from the CODE_PATTERN. */
23127 if (DECL_DECLARED_INLINE_P (code_pattern
)
23128 && !DECL_DECLARED_INLINE_P (decl
))
23129 DECL_DECLARED_INLINE_P (decl
) = 1;
23131 else if (VAR_P (decl
))
23133 start_lambda_scope (decl
);
23134 DECL_INITIAL (decl
) =
23135 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
23136 tf_error
, DECL_TI_TEMPLATE (decl
),
23137 /*integral_constant_expression_p=*/false);
23138 finish_lambda_scope ();
23139 if (VAR_HAD_UNKNOWN_BOUND (decl
))
23140 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
23141 tf_error
, DECL_TI_TEMPLATE (decl
));
23144 gcc_unreachable ();
23146 pop_access_scope (decl
);
23149 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
23150 substituted to get DECL. */
23153 template_for_substitution (tree decl
)
23155 tree tmpl
= DECL_TI_TEMPLATE (decl
);
23157 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
23158 for the instantiation. This is not always the most general
23159 template. Consider, for example:
23162 struct S { template <class U> void f();
23163 template <> void f<int>(); };
23165 and an instantiation of S<double>::f<int>. We want TD to be the
23166 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
23167 while (/* An instantiation cannot have a definition, so we need a
23168 more general template. */
23169 DECL_TEMPLATE_INSTANTIATION (tmpl
)
23170 /* We must also deal with friend templates. Given:
23172 template <class T> struct S {
23173 template <class U> friend void f() {};
23176 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
23177 so far as the language is concerned, but that's still
23178 where we get the pattern for the instantiation from. On
23179 other hand, if the definition comes outside the class, say:
23181 template <class T> struct S {
23182 template <class U> friend void f();
23184 template <class U> friend void f() {}
23186 we don't need to look any further. That's what the check for
23187 DECL_INITIAL is for. */
23188 || (TREE_CODE (decl
) == FUNCTION_DECL
23189 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
23190 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
23192 /* The present template, TD, should not be a definition. If it
23193 were a definition, we should be using it! Note that we
23194 cannot restructure the loop to just keep going until we find
23195 a template with a definition, since that might go too far if
23196 a specialization was declared, but not defined. */
23198 /* Fetch the more general template. */
23199 tmpl
= DECL_TI_TEMPLATE (tmpl
);
23205 /* Returns true if we need to instantiate this template instance even if we
23206 know we aren't going to emit it. */
23209 always_instantiate_p (tree decl
)
23211 /* We always instantiate inline functions so that we can inline them. An
23212 explicit instantiation declaration prohibits implicit instantiation of
23213 non-inline functions. With high levels of optimization, we would
23214 normally inline non-inline functions -- but we're not allowed to do
23215 that for "extern template" functions. Therefore, we check
23216 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
23217 return ((TREE_CODE (decl
) == FUNCTION_DECL
23218 && (DECL_DECLARED_INLINE_P (decl
)
23219 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
23220 /* And we need to instantiate static data members so that
23221 their initializers are available in integral constant
23224 && decl_maybe_constant_var_p (decl
)));
23227 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
23228 instantiate it now, modifying TREE_TYPE (fn). Returns false on
23229 error, true otherwise. */
23232 maybe_instantiate_noexcept (tree fn
, tsubst_flags_t complain
)
23234 tree fntype
, spec
, noex
, clone
;
23236 /* Don't instantiate a noexcept-specification from template context. */
23237 if (processing_template_decl
)
23240 if (DECL_CLONED_FUNCTION_P (fn
))
23241 fn
= DECL_CLONED_FUNCTION (fn
);
23242 fntype
= TREE_TYPE (fn
);
23243 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
23245 if (!spec
|| !TREE_PURPOSE (spec
))
23248 noex
= TREE_PURPOSE (spec
);
23250 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
23252 static hash_set
<tree
>* fns
= new hash_set
<tree
>;
23253 bool added
= false;
23254 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
23255 spec
= get_defaulted_eh_spec (fn
, complain
);
23256 else if (!(added
= !fns
->add (fn
)))
23258 /* If hash_set::add returns true, the element was already there. */
23259 location_t loc
= EXPR_LOC_OR_LOC (DEFERRED_NOEXCEPT_PATTERN (noex
),
23260 DECL_SOURCE_LOCATION (fn
));
23262 "exception specification of %qD depends on itself",
23264 spec
= noexcept_false_spec
;
23266 else if (push_tinst_level (fn
))
23268 push_access_scope (fn
);
23269 push_deferring_access_checks (dk_no_deferred
);
23270 input_location
= DECL_SOURCE_LOCATION (fn
);
23271 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
23272 DEFERRED_NOEXCEPT_ARGS (noex
),
23273 tf_warning_or_error
, fn
,
23274 /*function_p=*/false,
23275 /*integral_constant_expression_p=*/true);
23276 pop_deferring_access_checks ();
23277 pop_access_scope (fn
);
23278 pop_tinst_level ();
23279 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
23280 if (spec
== error_mark_node
)
23281 spec
= noexcept_false_spec
;
23284 spec
= noexcept_false_spec
;
23289 if (spec
== error_mark_node
)
23292 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
23295 FOR_EACH_CLONE (clone
, fn
)
23297 if (TREE_TYPE (clone
) == fntype
)
23298 TREE_TYPE (clone
) = TREE_TYPE (fn
);
23300 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
23306 /* We're starting to process the function INST, an instantiation of PATTERN;
23307 add their parameters to local_specializations. */
23310 register_parameter_specializations (tree pattern
, tree inst
)
23312 tree tmpl_parm
= DECL_ARGUMENTS (pattern
);
23313 tree spec_parm
= DECL_ARGUMENTS (inst
);
23314 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (inst
))
23316 register_local_specialization (spec_parm
, tmpl_parm
);
23317 spec_parm
= skip_artificial_parms_for (inst
, spec_parm
);
23318 tmpl_parm
= skip_artificial_parms_for (pattern
, tmpl_parm
);
23320 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
23322 if (!DECL_PACK_P (tmpl_parm
))
23324 register_local_specialization (spec_parm
, tmpl_parm
);
23325 spec_parm
= DECL_CHAIN (spec_parm
);
23329 /* Register the (value) argument pack as a specialization of
23330 TMPL_PARM, then move on. */
23331 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
23332 register_local_specialization (argpack
, tmpl_parm
);
23335 gcc_assert (!spec_parm
);
23338 /* Produce the definition of D, a _DECL generated from a template. If
23339 DEFER_OK is true, then we don't have to actually do the
23340 instantiation now; we just have to do it sometime. Normally it is
23341 an error if this is an explicit instantiation but D is undefined.
23342 EXPL_INST_CLASS_MEM_P is true iff D is a member of an explicitly
23343 instantiated class template. */
23346 instantiate_decl (tree d
, bool defer_ok
, bool expl_inst_class_mem_p
)
23348 tree tmpl
= DECL_TI_TEMPLATE (d
);
23355 bool pattern_defined
;
23356 location_t saved_loc
= input_location
;
23357 int saved_unevaluated_operand
= cp_unevaluated_operand
;
23358 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
23362 /* This function should only be used to instantiate templates for
23363 functions and static member variables. */
23364 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
23366 /* A concept is never instantiated. */
23367 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
23369 /* Variables are never deferred; if instantiation is required, they
23370 are instantiated right away. That allows for better code in the
23371 case that an expression refers to the value of the variable --
23372 if the variable has a constant value the referring expression can
23373 take advantage of that fact. */
23377 /* Don't instantiate cloned functions. Instead, instantiate the
23378 functions they cloned. */
23379 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
23380 d
= DECL_CLONED_FUNCTION (d
);
23382 if (DECL_TEMPLATE_INSTANTIATED (d
)
23383 || (TREE_CODE (d
) == FUNCTION_DECL
23384 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
23385 || DECL_TEMPLATE_SPECIALIZATION (d
))
23386 /* D has already been instantiated or explicitly specialized, so
23387 there's nothing for us to do here.
23389 It might seem reasonable to check whether or not D is an explicit
23390 instantiation, and, if so, stop here. But when an explicit
23391 instantiation is deferred until the end of the compilation,
23392 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
23393 the instantiation. */
23396 /* Check to see whether we know that this template will be
23397 instantiated in some other file, as with "extern template"
23399 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
23401 /* In general, we do not instantiate such templates. */
23402 if (external_p
&& !always_instantiate_p (d
))
23405 gen_tmpl
= most_general_template (tmpl
);
23406 gen_args
= DECL_TI_ARGS (d
);
23408 if (tmpl
!= gen_tmpl
)
23409 /* We should already have the extra args. */
23410 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
23411 == TMPL_ARGS_DEPTH (gen_args
));
23412 /* And what's in the hash table should match D. */
23413 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
23414 || spec
== NULL_TREE
);
23416 /* This needs to happen before any tsubsting. */
23417 if (! push_tinst_level (d
))
23420 timevar_push (TV_TEMPLATE_INST
);
23422 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
23423 for the instantiation. */
23424 td
= template_for_substitution (d
);
23429 /* Look up an explicit specialization, if any. */
23430 tree tid
= lookup_template_variable (gen_tmpl
, gen_args
);
23431 tree elt
= most_specialized_partial_spec (tid
, tf_warning_or_error
);
23432 if (elt
&& elt
!= error_mark_node
)
23434 td
= TREE_VALUE (elt
);
23435 args
= TREE_PURPOSE (elt
);
23439 code_pattern
= DECL_TEMPLATE_RESULT (td
);
23441 /* We should never be trying to instantiate a member of a class
23442 template or partial specialization. */
23443 gcc_assert (d
!= code_pattern
);
23445 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
23446 || DECL_TEMPLATE_SPECIALIZATION (td
))
23447 /* In the case of a friend template whose definition is provided
23448 outside the class, we may have too many arguments. Drop the
23449 ones we don't need. The same is true for specializations. */
23450 args
= get_innermost_template_args
23451 (args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
23453 if (TREE_CODE (d
) == FUNCTION_DECL
)
23455 deleted_p
= DECL_DELETED_FN (code_pattern
);
23456 pattern_defined
= ((DECL_SAVED_TREE (code_pattern
) != NULL_TREE
23457 && DECL_INITIAL (code_pattern
) != error_mark_node
)
23458 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
23464 if (DECL_CLASS_SCOPE_P (code_pattern
))
23465 pattern_defined
= (! DECL_IN_AGGR_P (code_pattern
)
23466 || DECL_INLINE_VAR_P (code_pattern
));
23468 pattern_defined
= ! DECL_EXTERNAL (code_pattern
);
23471 /* We may be in the middle of deferred access check. Disable it now. */
23472 push_deferring_access_checks (dk_no_deferred
);
23474 /* Unless an explicit instantiation directive has already determined
23475 the linkage of D, remember that a definition is available for
23477 if (pattern_defined
23478 && !DECL_INTERFACE_KNOWN (d
)
23479 && !DECL_NOT_REALLY_EXTERN (d
))
23480 mark_definable (d
);
23482 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
23483 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
23484 input_location
= DECL_SOURCE_LOCATION (d
);
23486 /* If D is a member of an explicitly instantiated class template,
23487 and no definition is available, treat it like an implicit
23489 if (!pattern_defined
&& expl_inst_class_mem_p
23490 && DECL_EXPLICIT_INSTANTIATION (d
))
23492 /* Leave linkage flags alone on instantiations with anonymous
23494 if (TREE_PUBLIC (d
))
23496 DECL_NOT_REALLY_EXTERN (d
) = 0;
23497 DECL_INTERFACE_KNOWN (d
) = 0;
23499 SET_DECL_IMPLICIT_INSTANTIATION (d
);
23502 /* Defer all other templates, unless we have been explicitly
23503 forbidden from doing so. */
23504 if (/* If there is no definition, we cannot instantiate the
23507 /* If it's OK to postpone instantiation, do so. */
23509 /* If this is a static data member that will be defined
23510 elsewhere, we don't want to instantiate the entire data
23511 member, but we do want to instantiate the initializer so that
23512 we can substitute that elsewhere. */
23513 || (external_p
&& VAR_P (d
))
23514 /* Handle here a deleted function too, avoid generating
23515 its body (c++/61080). */
23518 /* The definition of the static data member is now required so
23519 we must substitute the initializer. */
23521 && !DECL_INITIAL (d
)
23522 && DECL_INITIAL (code_pattern
))
23526 bool const_init
= false;
23527 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
23529 ns
= decl_namespace_context (d
);
23530 push_nested_namespace (ns
);
23532 push_nested_class (DECL_CONTEXT (d
));
23533 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
23535 tf_warning_or_error
, NULL_TREE
,
23536 /*integral_constant_expression_p=*/false);
23537 /* If instantiating the initializer involved instantiating this
23538 again, don't call cp_finish_decl twice. */
23539 if (!DECL_INITIAL (d
))
23541 /* Make sure the initializer is still constant, in case of
23542 circular dependency (template/instantiate6.C). */
23544 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
23545 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
23546 /*asmspec_tree=*/NULL_TREE
,
23547 LOOKUP_ONLYCONVERTING
);
23550 pop_nested_class ();
23551 pop_nested_namespace (ns
);
23554 /* We restore the source position here because it's used by
23555 add_pending_template. */
23556 input_location
= saved_loc
;
23558 if (at_eof
&& !pattern_defined
23559 && DECL_EXPLICIT_INSTANTIATION (d
)
23560 && DECL_NOT_REALLY_EXTERN (d
))
23563 The definition of a non-exported function template, a
23564 non-exported member function template, or a non-exported
23565 member function or static data member of a class template
23566 shall be present in every translation unit in which it is
23567 explicitly instantiated. */
23568 permerror (input_location
, "explicit instantiation of %qD "
23569 "but no definition available", d
);
23571 /* If we're in unevaluated context, we just wanted to get the
23572 constant value; this isn't an odr use, so don't queue
23573 a full instantiation. */
23574 if (cp_unevaluated_operand
!= 0)
23576 /* ??? Historically, we have instantiated inline functions, even
23577 when marked as "extern template". */
23578 if (!(external_p
&& VAR_P (d
)))
23579 add_pending_template (d
);
23582 /* Tell the repository that D is available in this translation unit
23583 -- and see if it is supposed to be instantiated here. */
23584 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
23586 /* In a PCH file, despite the fact that the repository hasn't
23587 requested instantiation in the PCH it is still possible that
23588 an instantiation will be required in a file that includes the
23591 add_pending_template (d
);
23592 /* Instantiate inline functions so that the inliner can do its
23593 job, even though we'll not be emitting a copy of this
23595 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
23599 bool push_to_top
, nested
;
23601 fn_context
= decl_function_context (d
);
23602 if (LAMBDA_FUNCTION_P (d
))
23603 /* tsubst_lambda_expr resolved any references to enclosing functions. */
23604 fn_context
= NULL_TREE
;
23605 nested
= current_function_decl
!= NULL_TREE
;
23606 push_to_top
= !(nested
&& fn_context
== current_function_decl
);
23608 vec
<tree
> omp_privatization_save
;
23610 save_omp_privatization_clauses (omp_privatization_save
);
23613 push_to_top_level ();
23616 push_function_context ();
23617 cp_unevaluated_operand
= 0;
23618 c_inhibit_evaluation_warnings
= 0;
23621 /* Mark D as instantiated so that recursive calls to
23622 instantiate_decl do not try to instantiate it again. */
23623 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
23625 /* Regenerate the declaration in case the template has been modified
23626 by a subsequent redeclaration. */
23627 regenerate_decl_from_template (d
, td
, args
);
23629 /* We already set the file and line above. Reset them now in case
23630 they changed as a result of calling regenerate_decl_from_template. */
23631 input_location
= DECL_SOURCE_LOCATION (d
);
23636 bool const_init
= false;
23638 /* Clear out DECL_RTL; whatever was there before may not be right
23639 since we've reset the type of the declaration. */
23640 SET_DECL_RTL (d
, NULL
);
23641 DECL_IN_AGGR_P (d
) = 0;
23643 /* The initializer is placed in DECL_INITIAL by
23644 regenerate_decl_from_template so we don't need to
23645 push/pop_access_scope again here. Pull it out so that
23646 cp_finish_decl can process it. */
23647 init
= DECL_INITIAL (d
);
23648 DECL_INITIAL (d
) = NULL_TREE
;
23649 DECL_INITIALIZED_P (d
) = 0;
23651 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
23652 initializer. That function will defer actual emission until
23653 we have a chance to determine linkage. */
23654 DECL_EXTERNAL (d
) = 0;
23656 /* Enter the scope of D so that access-checking works correctly. */
23657 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
23659 push_nested_class (DECL_CONTEXT (d
));
23661 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
23662 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
23665 pop_nested_class ();
23667 if (variable_template_p (gen_tmpl
))
23668 note_variable_template_instantiation (d
);
23670 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
23671 synthesize_method (d
);
23672 else if (TREE_CODE (d
) == FUNCTION_DECL
)
23674 /* Set up the list of local specializations. */
23675 local_specialization_stack
lss (push_to_top
? lss_blank
: lss_copy
);
23676 tree block
= NULL_TREE
;
23678 /* Set up context. */
23679 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
23680 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
23681 block
= push_stmt_list ();
23683 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
23685 /* Some typedefs referenced from within the template code need to be
23686 access checked at template instantiation time, i.e now. These
23687 types were added to the template at parsing time. Let's get those
23688 and perform the access checks then. */
23689 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (td
),
23692 /* Create substitution entries for the parameters. */
23693 register_parameter_specializations (code_pattern
, d
);
23695 /* Substitute into the body of the function. */
23696 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
23697 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
23698 tf_warning_or_error
, tmpl
);
23701 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
23702 tf_warning_or_error
, tmpl
,
23703 /*integral_constant_expression_p=*/false);
23705 /* Set the current input_location to the end of the function
23706 so that finish_function knows where we are. */
23708 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
23710 /* Remember if we saw an infinite loop in the template. */
23711 current_function_infinite_loop
23712 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
23715 /* Finish the function. */
23716 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
23717 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
23718 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
23721 d
= finish_function (/*inline_p=*/false);
23722 expand_or_defer_fn (d
);
23725 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
23726 cp_check_omp_declare_reduction (d
);
23729 /* We're not deferring instantiation any more. */
23730 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
23733 pop_from_top_level ();
23735 pop_function_context ();
23738 restore_omp_privatization_clauses (omp_privatization_save
);
23741 pop_deferring_access_checks ();
23742 timevar_pop (TV_TEMPLATE_INST
);
23743 pop_tinst_level ();
23744 input_location
= saved_loc
;
23745 cp_unevaluated_operand
= saved_unevaluated_operand
;
23746 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
23751 /* Run through the list of templates that we wish we could
23752 instantiate, and instantiate any we can. RETRIES is the
23753 number of times we retry pending template instantiation. */
23756 instantiate_pending_templates (int retries
)
23759 location_t saved_loc
= input_location
;
23761 /* Instantiating templates may trigger vtable generation. This in turn
23762 may require further template instantiations. We place a limit here
23763 to avoid infinite loop. */
23764 if (pending_templates
&& retries
>= max_tinst_depth
)
23766 tree decl
= pending_templates
->tinst
->decl
;
23768 fatal_error (input_location
,
23769 "template instantiation depth exceeds maximum of %d"
23770 " instantiating %q+D, possibly from virtual table generation"
23771 " (use -ftemplate-depth= to increase the maximum)",
23772 max_tinst_depth
, decl
);
23773 if (TREE_CODE (decl
) == FUNCTION_DECL
)
23774 /* Pretend that we defined it. */
23775 DECL_INITIAL (decl
) = error_mark_node
;
23781 struct pending_template
**t
= &pending_templates
;
23782 struct pending_template
*last
= NULL
;
23786 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
23787 bool complete
= false;
23789 if (TYPE_P (instantiation
))
23791 if (!COMPLETE_TYPE_P (instantiation
))
23793 instantiate_class_template (instantiation
);
23794 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
23795 for (tree fld
= TYPE_FIELDS (instantiation
);
23796 fld
; fld
= TREE_CHAIN (fld
))
23798 || (TREE_CODE (fld
) == FUNCTION_DECL
23799 && !DECL_ARTIFICIAL (fld
)))
23800 && DECL_TEMPLATE_INSTANTIATION (fld
))
23801 instantiate_decl (fld
,
23802 /*defer_ok=*/false,
23803 /*expl_inst_class_mem_p=*/false);
23805 if (COMPLETE_TYPE_P (instantiation
))
23809 complete
= COMPLETE_TYPE_P (instantiation
);
23813 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
23814 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
23817 = instantiate_decl (instantiation
,
23818 /*defer_ok=*/false,
23819 /*expl_inst_class_mem_p=*/false);
23820 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
23824 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
23825 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
23829 /* If INSTANTIATION has been instantiated, then we don't
23830 need to consider it again in the future. */
23838 current_tinst_level
= NULL
;
23840 last_pending_template
= last
;
23842 while (reconsider
);
23844 input_location
= saved_loc
;
23847 /* Substitute ARGVEC into T, which is a list of initializers for
23848 either base class or a non-static data member. The TREE_PURPOSEs
23849 are DECLs, and the TREE_VALUEs are the initializer values. Used by
23850 instantiate_decl. */
23853 tsubst_initializer_list (tree t
, tree argvec
)
23855 tree inits
= NULL_TREE
;
23856 tree target_ctor
= error_mark_node
;
23858 for (; t
; t
= TREE_CHAIN (t
))
23862 tree expanded_bases
= NULL_TREE
;
23863 tree expanded_arguments
= NULL_TREE
;
23866 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
23871 /* Expand the base class expansion type into separate base
23873 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
23874 tf_warning_or_error
,
23876 if (expanded_bases
== error_mark_node
)
23879 /* We'll be building separate TREE_LISTs of arguments for
23881 len
= TREE_VEC_LENGTH (expanded_bases
);
23882 expanded_arguments
= make_tree_vec (len
);
23883 for (i
= 0; i
< len
; i
++)
23884 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
23886 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
23887 expand each argument in the TREE_VALUE of t. */
23888 expr
= make_node (EXPR_PACK_EXPANSION
);
23889 PACK_EXPANSION_LOCAL_P (expr
) = true;
23890 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
23891 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
23893 if (TREE_VALUE (t
) == void_type_node
)
23894 /* VOID_TYPE_NODE is used to indicate
23895 value-initialization. */
23897 for (i
= 0; i
< len
; i
++)
23898 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
23902 /* Substitute parameter packs into each argument in the
23904 in_base_initializer
= 1;
23905 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
23907 tree expanded_exprs
;
23909 /* Expand the argument. */
23910 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
23912 = tsubst_pack_expansion (expr
, argvec
,
23913 tf_warning_or_error
,
23915 if (expanded_exprs
== error_mark_node
)
23918 /* Prepend each of the expanded expressions to the
23919 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
23920 for (i
= 0; i
< len
; i
++)
23922 TREE_VEC_ELT (expanded_arguments
, i
) =
23923 tree_cons (NULL_TREE
,
23924 TREE_VEC_ELT (expanded_exprs
, i
),
23925 TREE_VEC_ELT (expanded_arguments
, i
));
23928 in_base_initializer
= 0;
23930 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
23931 since we built them backwards. */
23932 for (i
= 0; i
< len
; i
++)
23934 TREE_VEC_ELT (expanded_arguments
, i
) =
23935 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
23940 for (i
= 0; i
< len
; ++i
)
23942 if (expanded_bases
)
23944 decl
= TREE_VEC_ELT (expanded_bases
, i
);
23945 decl
= expand_member_init (decl
);
23946 init
= TREE_VEC_ELT (expanded_arguments
, i
);
23951 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
23952 tf_warning_or_error
, NULL_TREE
);
23954 decl
= expand_member_init (decl
);
23955 if (decl
&& !DECL_P (decl
))
23956 in_base_initializer
= 1;
23958 init
= TREE_VALUE (t
);
23960 if (init
!= void_type_node
)
23961 init
= tsubst_expr (init
, argvec
,
23962 tf_warning_or_error
, NULL_TREE
,
23963 /*integral_constant_expression_p=*/false);
23964 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
23965 /* If we had an initializer but it instantiated to nothing,
23966 value-initialize the object. This will only occur when
23967 the initializer was a pack expansion where the parameter
23968 packs used in that expansion were of length zero. */
23969 init
= void_type_node
;
23970 in_base_initializer
= 0;
23973 if (target_ctor
!= error_mark_node
23974 && init
!= error_mark_node
)
23976 error ("mem-initializer for %qD follows constructor delegation",
23980 /* Look for a target constructor. */
23981 if (init
!= error_mark_node
23982 && decl
&& CLASS_TYPE_P (decl
)
23983 && same_type_p (decl
, current_class_type
))
23985 maybe_warn_cpp0x (CPP0X_DELEGATING_CTORS
);
23988 error ("constructor delegation follows mem-initializer for %qD",
23989 TREE_PURPOSE (inits
));
23992 target_ctor
= init
;
23997 init
= build_tree_list (decl
, init
);
23998 TREE_CHAIN (init
) = inits
;
24006 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
24009 set_current_access_from_decl (tree decl
)
24011 if (TREE_PRIVATE (decl
))
24012 current_access_specifier
= access_private_node
;
24013 else if (TREE_PROTECTED (decl
))
24014 current_access_specifier
= access_protected_node
;
24016 current_access_specifier
= access_public_node
;
24019 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
24020 is the instantiation (which should have been created with
24021 start_enum) and ARGS are the template arguments to use. */
24024 tsubst_enum (tree tag
, tree newtag
, tree args
)
24028 if (SCOPED_ENUM_P (newtag
))
24029 begin_scope (sk_scoped_enum
, newtag
);
24031 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
24036 decl
= TREE_VALUE (e
);
24037 /* Note that in a template enum, the TREE_VALUE is the
24038 CONST_DECL, not the corresponding INTEGER_CST. */
24039 value
= tsubst_expr (DECL_INITIAL (decl
),
24040 args
, tf_warning_or_error
, NULL_TREE
,
24041 /*integral_constant_expression_p=*/true);
24043 /* Give this enumeration constant the correct access. */
24044 set_current_access_from_decl (decl
);
24046 /* Actually build the enumerator itself. Here we're assuming that
24047 enumerators can't have dependent attributes. */
24048 build_enumerator (DECL_NAME (decl
), value
, newtag
,
24049 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
24052 if (SCOPED_ENUM_P (newtag
))
24055 finish_enum_value_list (newtag
);
24056 finish_enum (newtag
);
24058 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
24059 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
24062 /* DECL is a FUNCTION_DECL that is a template specialization. Return
24063 its type -- but without substituting the innermost set of template
24064 arguments. So, innermost set of template parameters will appear in
24068 get_mostly_instantiated_function_type (tree decl
)
24070 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
24071 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
24074 /* Return truthvalue if we're processing a template different from
24075 the last one involved in diagnostics. */
24077 problematic_instantiation_changed (void)
24079 return current_tinst_level
!= last_error_tinst_level
;
24082 /* Remember current template involved in diagnostics. */
24084 record_last_problematic_instantiation (void)
24086 last_error_tinst_level
= current_tinst_level
;
24089 struct tinst_level
*
24090 current_instantiation (void)
24092 return current_tinst_level
;
24095 /* Return TRUE if current_function_decl is being instantiated, false
24099 instantiating_current_function_p (void)
24101 return (current_instantiation ()
24102 && current_instantiation ()->decl
== current_function_decl
);
24105 /* [temp.param] Check that template non-type parm TYPE is of an allowable
24106 type. Return false for ok, true for disallowed. Issue error and
24107 inform messages under control of COMPLAIN. */
24110 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
24112 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
24114 else if (TYPE_PTR_P (type
))
24116 else if (TREE_CODE (type
) == REFERENCE_TYPE
24117 && !TYPE_REF_IS_RVALUE (type
))
24119 else if (TYPE_PTRMEM_P (type
))
24121 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
24123 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
24125 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
24127 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
24129 /* A bound template template parm could later be instantiated to have a valid
24130 nontype parm type via an alias template. */
24131 else if (cxx_dialect
>= cxx11
24132 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
24135 if (complain
& tf_error
)
24137 if (type
== error_mark_node
)
24138 inform (input_location
, "invalid template non-type parameter");
24140 error ("%q#T is not a valid type for a template non-type parameter",
24146 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
24147 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
24150 dependent_type_p_r (tree type
)
24156 A type is dependent if it is:
24158 -- a template parameter. Template template parameters are types
24159 for us (since TYPE_P holds true for them) so we handle
24161 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
24162 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
24164 /* -- a qualified-id with a nested-name-specifier which contains a
24165 class-name that names a dependent type or whose unqualified-id
24166 names a dependent type. */
24167 if (TREE_CODE (type
) == TYPENAME_TYPE
)
24170 /* An alias template specialization can be dependent even if the
24171 resulting type is not. */
24172 if (dependent_alias_template_spec_p (type
))
24175 /* -- a cv-qualified type where the cv-unqualified type is
24177 No code is necessary for this bullet; the code below handles
24178 cv-qualified types, and we don't want to strip aliases with
24179 TYPE_MAIN_VARIANT because of DR 1558. */
24180 /* -- a compound type constructed from any dependent type. */
24181 if (TYPE_PTRMEM_P (type
))
24182 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
24183 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
24185 else if (TYPE_PTR_P (type
)
24186 || TREE_CODE (type
) == REFERENCE_TYPE
)
24187 return dependent_type_p (TREE_TYPE (type
));
24188 else if (TREE_CODE (type
) == FUNCTION_TYPE
24189 || TREE_CODE (type
) == METHOD_TYPE
)
24193 if (dependent_type_p (TREE_TYPE (type
)))
24195 for (arg_type
= TYPE_ARG_TYPES (type
);
24197 arg_type
= TREE_CHAIN (arg_type
))
24198 if (dependent_type_p (TREE_VALUE (arg_type
)))
24200 if (cxx_dialect
>= cxx17
)
24201 /* A value-dependent noexcept-specifier makes the type dependent. */
24202 if (tree spec
= TYPE_RAISES_EXCEPTIONS (type
))
24203 if (tree noex
= TREE_PURPOSE (spec
))
24204 /* Treat DEFERRED_NOEXCEPT as non-dependent, since it doesn't
24205 affect overload resolution and treating it as dependent breaks
24207 if (TREE_CODE (noex
) != DEFERRED_NOEXCEPT
24208 && value_dependent_expression_p (noex
))
24212 /* -- an array type constructed from any dependent type or whose
24213 size is specified by a constant expression that is
24216 We checked for type- and value-dependence of the bounds in
24217 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
24218 if (TREE_CODE (type
) == ARRAY_TYPE
)
24220 if (TYPE_DOMAIN (type
)
24221 && dependent_type_p (TYPE_DOMAIN (type
)))
24223 return dependent_type_p (TREE_TYPE (type
));
24226 /* -- a template-id in which either the template name is a template
24228 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
24230 /* ... or any of the template arguments is a dependent type or
24231 an expression that is type-dependent or value-dependent. */
24232 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
24233 && (any_dependent_template_arguments_p
24234 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
24237 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
24238 dependent; if the argument of the `typeof' expression is not
24239 type-dependent, then it should already been have resolved. */
24240 if (TREE_CODE (type
) == TYPEOF_TYPE
24241 || TREE_CODE (type
) == DECLTYPE_TYPE
24242 || TREE_CODE (type
) == UNDERLYING_TYPE
)
24245 /* A template argument pack is dependent if any of its packed
24247 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
24249 tree args
= ARGUMENT_PACK_ARGS (type
);
24250 int i
, len
= TREE_VEC_LENGTH (args
);
24251 for (i
= 0; i
< len
; ++i
)
24252 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
24256 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
24257 be template parameters. */
24258 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
24261 if (any_dependent_type_attributes_p (TYPE_ATTRIBUTES (type
)))
24264 /* The standard does not specifically mention types that are local
24265 to template functions or local classes, but they should be
24266 considered dependent too. For example:
24268 template <int I> void f() {
24273 The size of `E' cannot be known until the value of `I' has been
24274 determined. Therefore, `E' must be considered dependent. */
24275 scope
= TYPE_CONTEXT (type
);
24276 if (scope
&& TYPE_P (scope
))
24277 return dependent_type_p (scope
);
24278 /* Don't use type_dependent_expression_p here, as it can lead
24279 to infinite recursion trying to determine whether a lambda
24280 nested in a lambda is dependent (c++/47687). */
24281 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
24282 && DECL_LANG_SPECIFIC (scope
)
24283 && DECL_TEMPLATE_INFO (scope
)
24284 && (any_dependent_template_arguments_p
24285 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
24288 /* Other types are non-dependent. */
24292 /* Returns TRUE if TYPE is dependent, in the sense of
24293 [temp.dep.type]. Note that a NULL type is considered dependent. */
24296 dependent_type_p (tree type
)
24298 /* If there are no template parameters in scope, then there can't be
24299 any dependent types. */
24300 if (!processing_template_decl
)
24302 /* If we are not processing a template, then nobody should be
24303 providing us with a dependent type. */
24305 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
24309 /* If the type is NULL, we have not computed a type for the entity
24310 in question; in that case, the type is dependent. */
24314 /* Erroneous types can be considered non-dependent. */
24315 if (type
== error_mark_node
)
24318 /* Getting here with global_type_node means we improperly called this
24319 function on the TREE_TYPE of an IDENTIFIER_NODE. */
24320 gcc_checking_assert (type
!= global_type_node
);
24322 /* If we have not already computed the appropriate value for TYPE,
24324 if (!TYPE_DEPENDENT_P_VALID (type
))
24326 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
24327 TYPE_DEPENDENT_P_VALID (type
) = 1;
24330 return TYPE_DEPENDENT_P (type
);
24333 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
24334 lookup. In other words, a dependent type that is not the current
24338 dependent_scope_p (tree scope
)
24340 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
24341 && !currently_open_class (scope
));
24344 /* T is a SCOPE_REF. Return whether it represents a non-static member of
24345 an unknown base of 'this' (and is therefore instantiation-dependent). */
24348 unknown_base_ref_p (tree t
)
24350 if (!current_class_ptr
)
24353 tree mem
= TREE_OPERAND (t
, 1);
24354 if (shared_member_p (mem
))
24357 tree cur
= current_nonlambda_class_type ();
24358 if (!any_dependent_bases_p (cur
))
24361 tree ctx
= TREE_OPERAND (t
, 0);
24362 if (DERIVED_FROM_P (ctx
, cur
))
24368 /* T is a SCOPE_REF; return whether we need to consider it
24369 instantiation-dependent so that we can check access at instantiation
24370 time even though we know which member it resolves to. */
24373 instantiation_dependent_scope_ref_p (tree t
)
24375 if (DECL_P (TREE_OPERAND (t
, 1))
24376 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
24377 && !unknown_base_ref_p (t
)
24378 && accessible_in_template_p (TREE_OPERAND (t
, 0),
24379 TREE_OPERAND (t
, 1)))
24385 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
24386 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
24389 /* Note that this predicate is not appropriate for general expressions;
24390 only constant expressions (that satisfy potential_constant_expression)
24391 can be tested for value dependence. */
24394 value_dependent_expression_p (tree expression
)
24396 if (!processing_template_decl
|| expression
== NULL_TREE
)
24399 /* A type-dependent expression is also value-dependent. */
24400 if (type_dependent_expression_p (expression
))
24403 switch (TREE_CODE (expression
))
24406 /* A dependent member function of the current instantiation. */
24407 return dependent_type_p (BINFO_TYPE (BASELINK_BINFO (expression
)));
24409 case FUNCTION_DECL
:
24410 /* A dependent member function of the current instantiation. */
24411 if (DECL_CLASS_SCOPE_P (expression
)
24412 && dependent_type_p (DECL_CONTEXT (expression
)))
24416 case IDENTIFIER_NODE
:
24417 /* A name that has not been looked up -- must be dependent. */
24420 case TEMPLATE_PARM_INDEX
:
24421 /* A non-type template parm. */
24425 /* A non-type template parm. */
24426 if (DECL_TEMPLATE_PARM_P (expression
))
24428 return value_dependent_expression_p (DECL_INITIAL (expression
));
24431 /* A constant with literal type and is initialized
24432 with an expression that is value-dependent. */
24433 if (DECL_DEPENDENT_INIT_P (expression
)
24434 /* FIXME cp_finish_decl doesn't fold reference initializers. */
24435 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
)
24437 if (DECL_HAS_VALUE_EXPR_P (expression
))
24439 tree value_expr
= DECL_VALUE_EXPR (expression
);
24440 if (value_dependent_expression_p (value_expr
))
24445 case DYNAMIC_CAST_EXPR
:
24446 case STATIC_CAST_EXPR
:
24447 case CONST_CAST_EXPR
:
24448 case REINTERPRET_CAST_EXPR
:
24450 case IMPLICIT_CONV_EXPR
:
24451 /* These expressions are value-dependent if the type to which
24452 the cast occurs is dependent or the expression being casted
24453 is value-dependent. */
24455 tree type
= TREE_TYPE (expression
);
24457 if (dependent_type_p (type
))
24460 /* A functional cast has a list of operands. */
24461 expression
= TREE_OPERAND (expression
, 0);
24464 /* If there are no operands, it must be an expression such
24465 as "int()". This should not happen for aggregate types
24466 because it would form non-constant expressions. */
24467 gcc_assert (cxx_dialect
>= cxx11
24468 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
24473 if (TREE_CODE (expression
) == TREE_LIST
)
24474 return any_value_dependent_elements_p (expression
);
24476 return value_dependent_expression_p (expression
);
24480 if (SIZEOF_EXPR_TYPE_P (expression
))
24481 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
24485 /* A `sizeof' expression is value-dependent if the operand is
24486 type-dependent or is a pack expansion. */
24487 expression
= TREE_OPERAND (expression
, 0);
24488 if (PACK_EXPANSION_P (expression
))
24490 else if (TYPE_P (expression
))
24491 return dependent_type_p (expression
);
24492 return instantiation_dependent_uneval_expression_p (expression
);
24494 case AT_ENCODE_EXPR
:
24495 /* An 'encode' expression is value-dependent if the operand is
24497 expression
= TREE_OPERAND (expression
, 0);
24498 return dependent_type_p (expression
);
24500 case NOEXCEPT_EXPR
:
24501 expression
= TREE_OPERAND (expression
, 0);
24502 return instantiation_dependent_uneval_expression_p (expression
);
24505 /* All instantiation-dependent expressions should also be considered
24506 value-dependent. */
24507 return instantiation_dependent_scope_ref_p (expression
);
24509 case COMPONENT_REF
:
24510 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
24511 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
24513 case NONTYPE_ARGUMENT_PACK
:
24514 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
24515 is value-dependent. */
24517 tree values
= ARGUMENT_PACK_ARGS (expression
);
24518 int i
, len
= TREE_VEC_LENGTH (values
);
24520 for (i
= 0; i
< len
; ++i
)
24521 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
24529 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
24531 if (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
)))
24537 if (TREE_CODE (type2
) != TREE_LIST
)
24538 return dependent_type_p (type2
);
24540 for (; type2
; type2
= TREE_CHAIN (type2
))
24541 if (dependent_type_p (TREE_VALUE (type2
)))
24548 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24549 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
24552 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24553 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
24557 tree op
= TREE_OPERAND (expression
, 0);
24558 return (value_dependent_expression_p (op
)
24559 || has_value_dependent_address (op
));
24562 case REQUIRES_EXPR
:
24563 /* Treat all requires-expressions as value-dependent so
24564 we don't try to fold them. */
24568 return dependent_type_p (TREE_OPERAND (expression
, 0));
24572 if (value_dependent_expression_p (CALL_EXPR_FN (expression
)))
24574 tree fn
= get_callee_fndecl (expression
);
24576 nargs
= call_expr_nargs (expression
);
24577 for (i
= 0; i
< nargs
; ++i
)
24579 tree op
= CALL_EXPR_ARG (expression
, i
);
24580 /* In a call to a constexpr member function, look through the
24581 implicit ADDR_EXPR on the object argument so that it doesn't
24582 cause the call to be considered value-dependent. We also
24583 look through it in potential_constant_expression. */
24584 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
24585 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
24586 && TREE_CODE (op
) == ADDR_EXPR
)
24587 op
= TREE_OPERAND (op
, 0);
24588 if (value_dependent_expression_p (op
))
24594 case TEMPLATE_ID_EXPR
:
24595 return variable_concept_p (TREE_OPERAND (expression
, 0));
24601 if (dependent_type_p (TREE_TYPE (expression
)))
24603 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
24604 if (value_dependent_expression_p (val
))
24610 /* Treat a GNU statement expression as dependent to avoid crashing
24611 under instantiate_non_dependent_expr; it can't be constant. */
24615 /* A constant expression is value-dependent if any subexpression is
24616 value-dependent. */
24617 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
24619 case tcc_reference
:
24621 case tcc_comparison
:
24623 case tcc_expression
:
24626 int i
, len
= cp_tree_operand_length (expression
);
24628 for (i
= 0; i
< len
; i
++)
24630 tree t
= TREE_OPERAND (expression
, i
);
24632 /* In some cases, some of the operands may be missing.
24633 (For example, in the case of PREDECREMENT_EXPR, the
24634 amount to increment by may be missing.) That doesn't
24635 make the expression dependent. */
24636 if (t
&& value_dependent_expression_p (t
))
24647 /* The expression is not value-dependent. */
24651 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
24652 [temp.dep.expr]. Note that an expression with no type is
24653 considered dependent. Other parts of the compiler arrange for an
24654 expression with type-dependent subexpressions to have no type, so
24655 this function doesn't have to be fully recursive. */
24658 type_dependent_expression_p (tree expression
)
24660 if (!processing_template_decl
)
24663 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
24666 STRIP_ANY_LOCATION_WRAPPER (expression
);
24668 /* An unresolved name is always dependent. */
24669 if (identifier_p (expression
)
24670 || TREE_CODE (expression
) == USING_DECL
24671 || TREE_CODE (expression
) == WILDCARD_DECL
)
24674 /* A fold expression is type-dependent. */
24675 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
24676 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
24677 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
24678 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
24681 /* Some expression forms are never type-dependent. */
24682 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
24683 || TREE_CODE (expression
) == SIZEOF_EXPR
24684 || TREE_CODE (expression
) == ALIGNOF_EXPR
24685 || TREE_CODE (expression
) == AT_ENCODE_EXPR
24686 || TREE_CODE (expression
) == NOEXCEPT_EXPR
24687 || TREE_CODE (expression
) == TRAIT_EXPR
24688 || TREE_CODE (expression
) == TYPEID_EXPR
24689 || TREE_CODE (expression
) == DELETE_EXPR
24690 || TREE_CODE (expression
) == VEC_DELETE_EXPR
24691 || TREE_CODE (expression
) == THROW_EXPR
24692 || TREE_CODE (expression
) == REQUIRES_EXPR
)
24695 /* The types of these expressions depends only on the type to which
24696 the cast occurs. */
24697 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
24698 || TREE_CODE (expression
) == STATIC_CAST_EXPR
24699 || TREE_CODE (expression
) == CONST_CAST_EXPR
24700 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
24701 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
24702 || TREE_CODE (expression
) == CAST_EXPR
)
24703 return dependent_type_p (TREE_TYPE (expression
));
24705 /* The types of these expressions depends only on the type created
24706 by the expression. */
24707 if (TREE_CODE (expression
) == NEW_EXPR
24708 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
24710 /* For NEW_EXPR tree nodes created inside a template, either
24711 the object type itself or a TREE_LIST may appear as the
24713 tree type
= TREE_OPERAND (expression
, 1);
24714 if (TREE_CODE (type
) == TREE_LIST
)
24715 /* This is an array type. We need to check array dimensions
24717 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
24718 || value_dependent_expression_p
24719 (TREE_OPERAND (TREE_VALUE (type
), 1));
24721 return dependent_type_p (type
);
24724 if (TREE_CODE (expression
) == SCOPE_REF
)
24726 tree scope
= TREE_OPERAND (expression
, 0);
24727 tree name
= TREE_OPERAND (expression
, 1);
24729 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
24730 contains an identifier associated by name lookup with one or more
24731 declarations declared with a dependent type, or...a
24732 nested-name-specifier or qualified-id that names a member of an
24733 unknown specialization. */
24734 return (type_dependent_expression_p (name
)
24735 || dependent_scope_p (scope
));
24738 if (TREE_CODE (expression
) == TEMPLATE_DECL
24739 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
24740 return uses_outer_template_parms (expression
);
24742 if (TREE_CODE (expression
) == STMT_EXPR
)
24743 expression
= stmt_expr_value_expr (expression
);
24745 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
24750 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
24752 if (type_dependent_expression_p (elt
))
24758 /* A static data member of the current instantiation with incomplete
24759 array type is type-dependent, as the definition and specializations
24760 can have different bounds. */
24761 if (VAR_P (expression
)
24762 && DECL_CLASS_SCOPE_P (expression
)
24763 && dependent_type_p (DECL_CONTEXT (expression
))
24764 && VAR_HAD_UNKNOWN_BOUND (expression
))
24767 /* An array of unknown bound depending on a variadic parameter, eg:
24769 template<typename... Args>
24770 void foo (Args... args)
24772 int arr[] = { args... };
24775 template<int... vals>
24778 int arr[] = { vals... };
24781 If the array has no length and has an initializer, it must be that
24782 we couldn't determine its length in cp_complete_array_type because
24783 it is dependent. */
24784 if (VAR_P (expression
)
24785 && TREE_TYPE (expression
) != NULL_TREE
24786 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
24787 && !TYPE_DOMAIN (TREE_TYPE (expression
))
24788 && DECL_INITIAL (expression
))
24791 /* A function or variable template-id is type-dependent if it has any
24792 dependent template arguments. */
24793 if (VAR_OR_FUNCTION_DECL_P (expression
)
24794 && DECL_LANG_SPECIFIC (expression
)
24795 && DECL_TEMPLATE_INFO (expression
))
24797 /* Consider the innermost template arguments, since those are the ones
24798 that come from the template-id; the template arguments for the
24799 enclosing class do not make it type-dependent unless they are used in
24800 the type of the decl. */
24801 if (PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (expression
))
24802 && (any_dependent_template_arguments_p
24803 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
24807 /* Otherwise, if the function decl isn't from a dependent scope, it can't be
24808 type-dependent. Checking this is important for functions with auto return
24809 type, which looks like a dependent type. */
24810 if (TREE_CODE (expression
) == FUNCTION_DECL
24811 && !(DECL_CLASS_SCOPE_P (expression
)
24812 && dependent_type_p (DECL_CONTEXT (expression
)))
24813 && !(DECL_LANG_SPECIFIC (expression
)
24814 && DECL_FRIEND_P (expression
)
24815 && (!DECL_FRIEND_CONTEXT (expression
)
24816 || dependent_type_p (DECL_FRIEND_CONTEXT (expression
))))
24817 && !DECL_LOCAL_FUNCTION_P (expression
))
24819 gcc_assert (!dependent_type_p (TREE_TYPE (expression
))
24820 || undeduced_auto_decl (expression
));
24824 /* Always dependent, on the number of arguments if nothing else. */
24825 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
24828 if (TREE_TYPE (expression
) == unknown_type_node
)
24830 if (TREE_CODE (expression
) == ADDR_EXPR
)
24831 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
24832 if (TREE_CODE (expression
) == COMPONENT_REF
24833 || TREE_CODE (expression
) == OFFSET_REF
)
24835 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24837 expression
= TREE_OPERAND (expression
, 1);
24838 if (identifier_p (expression
))
24841 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
24842 if (TREE_CODE (expression
) == SCOPE_REF
)
24845 if (BASELINK_P (expression
))
24847 if (BASELINK_OPTYPE (expression
)
24848 && dependent_type_p (BASELINK_OPTYPE (expression
)))
24850 expression
= BASELINK_FUNCTIONS (expression
);
24853 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
24855 if (any_dependent_template_arguments_p
24856 (TREE_OPERAND (expression
, 1)))
24858 expression
= TREE_OPERAND (expression
, 0);
24859 if (identifier_p (expression
))
24863 gcc_assert (TREE_CODE (expression
) == OVERLOAD
24864 || TREE_CODE (expression
) == FUNCTION_DECL
);
24866 for (lkp_iterator
iter (expression
); iter
; ++iter
)
24867 if (type_dependent_expression_p (*iter
))
24873 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
24875 /* Dependent type attributes might not have made it from the decl to
24877 if (DECL_P (expression
)
24878 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (expression
)))
24881 return (dependent_type_p (TREE_TYPE (expression
)));
24884 /* [temp.dep.expr]/5: A class member access expression (5.2.5) is
24885 type-dependent if the expression refers to a member of the current
24886 instantiation and the type of the referenced member is dependent, or the
24887 class member access expression refers to a member of an unknown
24890 This function returns true if the OBJECT in such a class member access
24891 expression is of an unknown specialization. */
24894 type_dependent_object_expression_p (tree object
)
24896 /* An IDENTIFIER_NODE can sometimes have a TREE_TYPE, but it's still
24898 if (TREE_CODE (object
) == IDENTIFIER_NODE
)
24900 tree scope
= TREE_TYPE (object
);
24901 return (!scope
|| dependent_scope_p (scope
));
24904 /* walk_tree callback function for instantiation_dependent_expression_p,
24905 below. Returns non-zero if a dependent subexpression is found. */
24908 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
24913 /* We don't have to worry about decltype currently because decltype
24914 of an instantiation-dependent expr is a dependent type. This
24915 might change depending on the resolution of DR 1172. */
24916 *walk_subtrees
= false;
24919 enum tree_code code
= TREE_CODE (*tp
);
24922 /* Don't treat an argument list as dependent just because it has no
24928 case TEMPLATE_PARM_INDEX
:
24931 /* Handle expressions with type operands. */
24935 case AT_ENCODE_EXPR
:
24937 tree op
= TREE_OPERAND (*tp
, 0);
24938 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
24939 op
= TREE_TYPE (op
);
24942 if (dependent_type_p (op
))
24946 *walk_subtrees
= false;
24953 case COMPONENT_REF
:
24954 if (identifier_p (TREE_OPERAND (*tp
, 1)))
24955 /* In a template, finish_class_member_access_expr creates a
24956 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
24957 type-dependent, so that we can check access control at
24958 instantiation time (PR 42277). See also Core issue 1273. */
24963 if (instantiation_dependent_scope_ref_p (*tp
))
24968 /* Treat statement-expressions as dependent. */
24972 /* Treat requires-expressions as dependent. */
24973 case REQUIRES_EXPR
:
24977 /* Treat calls to function concepts as dependent. */
24978 if (function_concept_check_p (*tp
))
24982 case TEMPLATE_ID_EXPR
:
24983 /* And variable concepts. */
24984 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
24992 if (type_dependent_expression_p (*tp
))
24998 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
24999 sense defined by the ABI:
25001 "An expression is instantiation-dependent if it is type-dependent
25002 or value-dependent, or it has a subexpression that is type-dependent
25003 or value-dependent."
25005 Except don't actually check value-dependence for unevaluated expressions,
25006 because in sizeof(i) we don't care about the value of i. Checking
25007 type-dependence will in turn check value-dependence of array bounds/template
25008 arguments as needed. */
25011 instantiation_dependent_uneval_expression_p (tree expression
)
25015 if (!processing_template_decl
)
25018 if (expression
== error_mark_node
)
25021 result
= cp_walk_tree_without_duplicates (&expression
,
25022 instantiation_dependent_r
, NULL
);
25023 return result
!= NULL_TREE
;
25026 /* As above, but also check value-dependence of the expression as a whole. */
25029 instantiation_dependent_expression_p (tree expression
)
25031 return (instantiation_dependent_uneval_expression_p (expression
)
25032 || value_dependent_expression_p (expression
));
25035 /* Like type_dependent_expression_p, but it also works while not processing
25036 a template definition, i.e. during substitution or mangling. */
25039 type_dependent_expression_p_push (tree expr
)
25042 ++processing_template_decl
;
25043 b
= type_dependent_expression_p (expr
);
25044 --processing_template_decl
;
25048 /* Returns TRUE if ARGS contains a type-dependent expression. */
25051 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
25056 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
25058 if (type_dependent_expression_p (arg
))
25064 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
25065 expressions) contains any type-dependent expressions. */
25068 any_type_dependent_elements_p (const_tree list
)
25070 for (; list
; list
= TREE_CHAIN (list
))
25071 if (type_dependent_expression_p (TREE_VALUE (list
)))
25077 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
25078 expressions) contains any value-dependent expressions. */
25081 any_value_dependent_elements_p (const_tree list
)
25083 for (; list
; list
= TREE_CHAIN (list
))
25084 if (value_dependent_expression_p (TREE_VALUE (list
)))
25090 /* Returns TRUE if the ARG (a template argument) is dependent. */
25093 dependent_template_arg_p (tree arg
)
25095 if (!processing_template_decl
)
25098 /* Assume a template argument that was wrongly written by the user
25099 is dependent. This is consistent with what
25100 any_dependent_template_arguments_p [that calls this function]
25102 if (!arg
|| arg
== error_mark_node
)
25105 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
25106 arg
= argument_pack_select_arg (arg
);
25108 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
25110 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
25112 if (DECL_TEMPLATE_PARM_P (arg
))
25114 /* A member template of a dependent class is not necessarily
25115 type-dependent, but it is a dependent template argument because it
25116 will be a member of an unknown specialization to that template. */
25117 tree scope
= CP_DECL_CONTEXT (arg
);
25118 return TYPE_P (scope
) && dependent_type_p (scope
);
25120 else if (ARGUMENT_PACK_P (arg
))
25122 tree args
= ARGUMENT_PACK_ARGS (arg
);
25123 int i
, len
= TREE_VEC_LENGTH (args
);
25124 for (i
= 0; i
< len
; ++i
)
25126 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
25132 else if (TYPE_P (arg
))
25133 return dependent_type_p (arg
);
25135 return (type_dependent_expression_p (arg
)
25136 || value_dependent_expression_p (arg
));
25139 /* Returns true if ARGS (a collection of template arguments) contains
25140 any types that require structural equality testing. */
25143 any_template_arguments_need_structural_equality_p (tree args
)
25150 if (args
== error_mark_node
)
25153 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25155 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25156 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25158 tree arg
= TREE_VEC_ELT (level
, j
);
25159 tree packed_args
= NULL_TREE
;
25162 if (ARGUMENT_PACK_P (arg
))
25164 /* Look inside the argument pack. */
25165 packed_args
= ARGUMENT_PACK_ARGS (arg
);
25166 len
= TREE_VEC_LENGTH (packed_args
);
25169 for (k
= 0; k
< len
; ++k
)
25172 arg
= TREE_VEC_ELT (packed_args
, k
);
25174 if (error_operand_p (arg
))
25176 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
25178 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
25180 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
25181 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
25190 /* Returns true if ARGS (a collection of template arguments) contains
25191 any dependent arguments. */
25194 any_dependent_template_arguments_p (const_tree args
)
25201 if (args
== error_mark_node
)
25204 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25206 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25207 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25208 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
25215 /* Returns true if ARGS contains any errors. */
25218 any_erroneous_template_args_p (const_tree args
)
25223 if (args
== error_mark_node
)
25226 if (args
&& TREE_CODE (args
) != TREE_VEC
)
25228 if (tree ti
= get_template_info (args
))
25229 args
= TI_ARGS (ti
);
25237 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25239 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25240 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25241 if (error_operand_p (TREE_VEC_ELT (level
, j
)))
25248 /* Returns TRUE if the template TMPL is type-dependent. */
25251 dependent_template_p (tree tmpl
)
25253 if (TREE_CODE (tmpl
) == OVERLOAD
)
25255 for (lkp_iterator
iter (tmpl
); iter
; ++iter
)
25256 if (dependent_template_p (*iter
))
25261 /* Template template parameters are dependent. */
25262 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
25263 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
25265 /* So are names that have not been looked up. */
25266 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
25271 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
25274 dependent_template_id_p (tree tmpl
, tree args
)
25276 return (dependent_template_p (tmpl
)
25277 || any_dependent_template_arguments_p (args
));
25280 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
25284 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
25288 if (!processing_template_decl
)
25291 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
25293 tree decl
= TREE_VEC_ELT (declv
, i
);
25294 tree init
= TREE_VEC_ELT (initv
, i
);
25295 tree cond
= TREE_VEC_ELT (condv
, i
);
25296 tree incr
= TREE_VEC_ELT (incrv
, i
);
25298 if (type_dependent_expression_p (decl
)
25299 || TREE_CODE (decl
) == SCOPE_REF
)
25302 if (init
&& type_dependent_expression_p (init
))
25305 if (type_dependent_expression_p (cond
))
25308 if (COMPARISON_CLASS_P (cond
)
25309 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
25310 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
25313 if (TREE_CODE (incr
) == MODOP_EXPR
)
25315 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
25316 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
25319 else if (type_dependent_expression_p (incr
))
25321 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
25323 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
25325 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
25327 tree t
= TREE_OPERAND (incr
, 1);
25328 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
25329 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
25338 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
25339 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
25340 no such TYPE can be found. Note that this function peers inside
25341 uninstantiated templates and therefore should be used only in
25342 extremely limited situations. ONLY_CURRENT_P restricts this
25343 peering to the currently open classes hierarchy (which is required
25344 when comparing types). */
25347 resolve_typename_type (tree type
, bool only_current_p
)
25356 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
25358 scope
= TYPE_CONTEXT (type
);
25359 /* We shouldn't have built a TYPENAME_TYPE with a non-dependent scope. */
25360 gcc_checking_assert (uses_template_parms (scope
));
25362 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
25363 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
25364 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
25365 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
25366 identifier of the TYPENAME_TYPE anymore.
25367 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
25368 TYPENAME_TYPE instead, we avoid messing up with a possible
25369 typedef variant case. */
25370 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
25372 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
25373 it first before we can figure out what NAME refers to. */
25374 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
25376 if (TYPENAME_IS_RESOLVING_P (scope
))
25377 /* Given a class template A with a dependent base with nested type C,
25378 typedef typename A::C::C C will land us here, as trying to resolve
25379 the initial A::C leads to the local C typedef, which leads back to
25380 A::C::C. So we break the recursion now. */
25383 scope
= resolve_typename_type (scope
, only_current_p
);
25385 /* If we don't know what SCOPE refers to, then we cannot resolve the
25387 if (!CLASS_TYPE_P (scope
))
25389 /* If this is a typedef, we don't want to look inside (c++/11987). */
25390 if (typedef_variant_p (type
))
25392 /* If SCOPE isn't the template itself, it will not have a valid
25393 TYPE_FIELDS list. */
25394 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
25395 /* scope is either the template itself or a compatible instantiation
25396 like X<T>, so look up the name in the original template. */
25397 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
25398 /* If scope has no fields, it can't be a current instantiation. Check this
25399 before currently_open_class to avoid infinite recursion (71515). */
25400 if (!TYPE_FIELDS (scope
))
25402 /* If the SCOPE is not the current instantiation, there's no reason
25403 to look inside it. */
25404 if (only_current_p
&& !currently_open_class (scope
))
25406 /* Enter the SCOPE so that name lookup will be resolved as if we
25407 were in the class definition. In particular, SCOPE will no
25408 longer be considered a dependent type. */
25409 pushed_scope
= push_scope (scope
);
25410 /* Look up the declaration. */
25411 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
25412 tf_warning_or_error
);
25414 result
= NULL_TREE
;
25416 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
25417 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
25418 tree fullname
= TYPENAME_TYPE_FULLNAME (type
);
25421 else if (identifier_p (fullname
)
25422 && TREE_CODE (decl
) == TYPE_DECL
)
25424 result
= TREE_TYPE (decl
);
25425 if (result
== error_mark_node
)
25426 result
= NULL_TREE
;
25428 else if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
25429 && DECL_CLASS_TEMPLATE_P (decl
))
25431 /* Obtain the template and the arguments. */
25432 tree tmpl
= TREE_OPERAND (fullname
, 0);
25433 if (TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
25435 /* We get here with a plain identifier because a previous tentative
25436 parse of the nested-name-specifier as part of a ptr-operator saw
25437 ::template X<A>. The use of ::template is necessary in a
25438 ptr-operator, but wrong in a declarator-id.
25440 [temp.names]: In a qualified-id of a declarator-id, the keyword
25441 template shall not appear at the top level. */
25442 pedwarn (EXPR_LOC_OR_LOC (fullname
, input_location
), OPT_Wpedantic
,
25443 "keyword %<template%> not allowed in declarator-id");
25446 tree args
= TREE_OPERAND (fullname
, 1);
25447 /* Instantiate the template. */
25448 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
25449 /*entering_scope=*/true,
25450 tf_error
| tf_user
);
25451 if (result
== error_mark_node
)
25452 result
= NULL_TREE
;
25455 /* Leave the SCOPE. */
25457 pop_scope (pushed_scope
);
25459 /* If we failed to resolve it, return the original typename. */
25463 /* If lookup found a typename type, resolve that too. */
25464 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
25466 /* Ill-formed programs can cause infinite recursion here, so we
25467 must catch that. */
25468 TYPENAME_IS_RESOLVING_P (result
) = 1;
25469 result
= resolve_typename_type (result
, only_current_p
);
25470 TYPENAME_IS_RESOLVING_P (result
) = 0;
25473 /* Qualify the resulting type. */
25474 quals
= cp_type_quals (type
);
25476 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
25481 /* EXPR is an expression which is not type-dependent. Return a proxy
25482 for EXPR that can be used to compute the types of larger
25483 expressions containing EXPR. */
25486 build_non_dependent_expr (tree expr
)
25488 tree orig_expr
= expr
;
25491 /* When checking, try to get a constant value for all non-dependent
25492 expressions in order to expose bugs in *_dependent_expression_p
25493 and constexpr. This can affect code generation, see PR70704, so
25494 only do this for -fchecking=2. */
25495 if (flag_checking
> 1
25496 && cxx_dialect
>= cxx11
25497 /* Don't do this during nsdmi parsing as it can lead to
25498 unexpected recursive instantiations. */
25499 && !parsing_nsdmi ()
25500 /* Don't do this during concept expansion either and for
25501 the same reason. */
25502 && !expanding_concept ())
25503 fold_non_dependent_expr (expr
);
25505 STRIP_ANY_LOCATION_WRAPPER (expr
);
25507 /* Preserve OVERLOADs; the functions must be available to resolve
25510 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
25511 inner_expr
= stmt_expr_value_expr (inner_expr
);
25512 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
25513 inner_expr
= TREE_OPERAND (inner_expr
, 0);
25514 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
25515 inner_expr
= TREE_OPERAND (inner_expr
, 1);
25516 if (is_overloaded_fn (inner_expr
)
25517 || TREE_CODE (inner_expr
) == OFFSET_REF
)
25519 /* There is no need to return a proxy for a variable. */
25522 /* Preserve string constants; conversions from string constants to
25523 "char *" are allowed, even though normally a "const char *"
25524 cannot be used to initialize a "char *". */
25525 if (TREE_CODE (expr
) == STRING_CST
)
25527 /* Preserve void and arithmetic constants, as an optimization -- there is no
25528 reason to create a new node. */
25529 if (TREE_CODE (expr
) == VOID_CST
25530 || TREE_CODE (expr
) == INTEGER_CST
25531 || TREE_CODE (expr
) == REAL_CST
)
25533 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
25534 There is at least one place where we want to know that a
25535 particular expression is a throw-expression: when checking a ?:
25536 expression, there are special rules if the second or third
25537 argument is a throw-expression. */
25538 if (TREE_CODE (expr
) == THROW_EXPR
)
25541 /* Don't wrap an initializer list, we need to be able to look inside. */
25542 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
25545 /* Don't wrap a dummy object, we need to be able to test for it. */
25546 if (is_dummy_object (expr
))
25549 if (TREE_CODE (expr
) == COND_EXPR
)
25550 return build3 (COND_EXPR
,
25552 TREE_OPERAND (expr
, 0),
25553 (TREE_OPERAND (expr
, 1)
25554 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
25555 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
25556 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
25557 if (TREE_CODE (expr
) == COMPOUND_EXPR
25558 && !COMPOUND_EXPR_OVERLOADED (expr
))
25559 return build2 (COMPOUND_EXPR
,
25561 TREE_OPERAND (expr
, 0),
25562 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
25564 /* If the type is unknown, it can't really be non-dependent */
25565 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
25567 /* Otherwise, build a NON_DEPENDENT_EXPR. */
25568 return build1_loc (EXPR_LOCATION (orig_expr
), NON_DEPENDENT_EXPR
,
25569 TREE_TYPE (expr
), expr
);
25572 /* ARGS is a vector of expressions as arguments to a function call.
25573 Replace the arguments with equivalent non-dependent expressions.
25574 This modifies ARGS in place. */
25577 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
25582 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
25584 tree newarg
= build_non_dependent_expr (arg
);
25586 (*args
)[ix
] = newarg
;
25590 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
25591 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
25592 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
25595 make_auto_1 (tree name
, bool set_canonical
)
25597 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
25598 TYPE_NAME (au
) = build_decl (input_location
,
25599 TYPE_DECL
, name
, au
);
25600 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
25601 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
25602 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
25603 TYPE_NAME (au
), NULL_TREE
);
25605 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
25606 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
25607 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
25613 make_decltype_auto (void)
25615 return make_auto_1 (decltype_auto_identifier
, true);
25621 return make_auto_1 (auto_identifier
, true);
25624 /* Return a C++17 deduction placeholder for class template TMPL. */
25627 make_template_placeholder (tree tmpl
)
25629 tree t
= make_auto_1 (DECL_NAME (tmpl
), true);
25630 CLASS_PLACEHOLDER_TEMPLATE (t
) = tmpl
;
25634 /* True iff T is a C++17 class template deduction placeholder. */
25637 template_placeholder_p (tree t
)
25639 return is_auto (t
) && CLASS_PLACEHOLDER_TEMPLATE (t
);
25642 /* Make a "constrained auto" type-specifier. This is an
25643 auto type with constraints that must be associated after
25644 deduction. The constraint is formed from the given
25645 CONC and its optional sequence of arguments, which are
25646 non-null if written as partial-concept-id. */
25649 make_constrained_auto (tree con
, tree args
)
25651 tree type
= make_auto_1 (auto_identifier
, false);
25653 /* Build the constraint. */
25654 tree tmpl
= DECL_TI_TEMPLATE (con
);
25655 tree expr
= VAR_P (con
) ? tmpl
: ovl_make (tmpl
);
25656 expr
= build_concept_check (expr
, type
, args
);
25658 tree constr
= normalize_expression (expr
);
25659 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
25661 /* Our canonical type depends on the constraint. */
25662 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
25664 /* Attach the constraint to the type declaration. */
25665 tree decl
= TYPE_NAME (type
);
25669 /* Given type ARG, return std::initializer_list<ARG>. */
25674 tree std_init_list
= get_namespace_binding (std_node
, init_list_identifier
);
25676 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
25678 gcc_rich_location
richloc (input_location
);
25679 maybe_add_include_fixit (&richloc
, "<initializer_list>");
25680 error_at (&richloc
,
25681 "deducing from brace-enclosed initializer list"
25682 " requires %<#include <initializer_list>%>");
25684 return error_mark_node
;
25686 tree argvec
= make_tree_vec (1);
25687 TREE_VEC_ELT (argvec
, 0) = arg
;
25689 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
25690 NULL_TREE
, 0, tf_warning_or_error
);
25693 /* Replace auto in TYPE with std::initializer_list<auto>. */
25696 listify_autos (tree type
, tree auto_node
)
25698 tree init_auto
= listify (auto_node
);
25699 tree argvec
= make_tree_vec (1);
25700 TREE_VEC_ELT (argvec
, 0) = init_auto
;
25701 if (processing_template_decl
)
25702 argvec
= add_to_template_args (current_template_args (), argvec
);
25703 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
25706 /* Hash traits for hashing possibly constrained 'auto'
25707 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
25709 struct auto_hash
: default_hash_traits
<tree
>
25711 static inline hashval_t
hash (tree
);
25712 static inline bool equal (tree
, tree
);
25715 /* Hash the 'auto' T. */
25718 auto_hash::hash (tree t
)
25720 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
25721 /* Matching constrained-type-specifiers denote the same template
25722 parameter, so hash the constraint. */
25723 return hash_placeholder_constraint (c
);
25725 /* But unconstrained autos are all separate, so just hash the pointer. */
25726 return iterative_hash_object (t
, 0);
25729 /* Compare two 'auto's. */
25732 auto_hash::equal (tree t1
, tree t2
)
25737 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
25738 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
25740 /* Two unconstrained autos are distinct. */
25744 return equivalent_placeholder_constraints (c1
, c2
);
25747 /* for_each_template_parm callback for extract_autos: if t is a (possibly
25748 constrained) auto, add it to the vector. */
25751 extract_autos_r (tree t
, void *data
)
25753 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
25756 /* All the autos were built with index 0; fix that up now. */
25757 tree
*p
= hash
.find_slot (t
, INSERT
);
25760 /* If this is a repeated constrained-type-specifier, use the index we
25762 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
25765 /* Otherwise this is new, so use the current count. */
25767 idx
= hash
.elements () - 1;
25769 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
25772 /* Always keep walking. */
25776 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
25777 says they can appear anywhere in the type. */
25780 extract_autos (tree type
)
25782 hash_set
<tree
> visited
;
25783 hash_table
<auto_hash
> hash (2);
25785 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
25787 tree tree_vec
= make_tree_vec (hash
.elements());
25788 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
25789 iter
!= hash
.end(); ++iter
)
25792 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
25793 TREE_VEC_ELT (tree_vec
, i
)
25794 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
25800 /* The stem for deduction guide names. */
25801 const char *const dguide_base
= "__dguide_";
25803 /* Return the name for a deduction guide for class template TMPL. */
25806 dguide_name (tree tmpl
)
25808 tree type
= (TYPE_P (tmpl
) ? tmpl
: TREE_TYPE (tmpl
));
25809 tree tname
= TYPE_IDENTIFIER (type
);
25810 char *buf
= (char *) alloca (1 + strlen (dguide_base
)
25811 + IDENTIFIER_LENGTH (tname
));
25812 memcpy (buf
, dguide_base
, strlen (dguide_base
));
25813 memcpy (buf
+ strlen (dguide_base
), IDENTIFIER_POINTER (tname
),
25814 IDENTIFIER_LENGTH (tname
) + 1);
25815 tree dname
= get_identifier (buf
);
25816 TREE_TYPE (dname
) = type
;
25820 /* True if NAME is the name of a deduction guide. */
25823 dguide_name_p (tree name
)
25825 return (TREE_CODE (name
) == IDENTIFIER_NODE
25826 && TREE_TYPE (name
)
25827 && !strncmp (IDENTIFIER_POINTER (name
), dguide_base
,
25828 strlen (dguide_base
)));
25831 /* True if FN is a deduction guide. */
25834 deduction_guide_p (const_tree fn
)
25837 if (tree name
= DECL_NAME (fn
))
25838 return dguide_name_p (name
);
25842 /* True if FN is the copy deduction guide, i.e. A(A)->A. */
25845 copy_guide_p (const_tree fn
)
25847 gcc_assert (deduction_guide_p (fn
));
25848 if (!DECL_ARTIFICIAL (fn
))
25850 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (DECL_TI_TEMPLATE (fn
));
25851 return (TREE_CHAIN (parms
) == void_list_node
25852 && same_type_p (TREE_VALUE (parms
), TREE_TYPE (DECL_NAME (fn
))));
25855 /* True if FN is a guide generated from a constructor template. */
25858 template_guide_p (const_tree fn
)
25860 gcc_assert (deduction_guide_p (fn
));
25861 if (!DECL_ARTIFICIAL (fn
))
25863 tree tmpl
= DECL_TI_TEMPLATE (fn
);
25864 if (tree org
= DECL_ABSTRACT_ORIGIN (tmpl
))
25865 return PRIMARY_TEMPLATE_P (org
);
25869 /* OLDDECL is a _DECL for a template parameter. Return a similar parameter at
25870 LEVEL:INDEX, using tsubst_args and complain for substitution into non-type
25871 template parameter types. Note that the handling of template template
25872 parameters relies on current_template_parms being set appropriately for the
25876 rewrite_template_parm (tree olddecl
, unsigned index
, unsigned level
,
25877 tree tsubst_args
, tsubst_flags_t complain
)
25879 if (olddecl
== error_mark_node
)
25880 return error_mark_node
;
25882 tree oldidx
= get_template_parm_index (olddecl
);
25885 if (TREE_CODE (olddecl
) == TYPE_DECL
25886 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
25888 tree oldtype
= TREE_TYPE (olddecl
);
25889 newtype
= cxx_make_type (TREE_CODE (oldtype
));
25890 TYPE_MAIN_VARIANT (newtype
) = newtype
;
25891 if (TREE_CODE (oldtype
) == TEMPLATE_TYPE_PARM
)
25892 TEMPLATE_TYPE_PARM_FOR_CLASS (newtype
)
25893 = TEMPLATE_TYPE_PARM_FOR_CLASS (oldtype
);
25897 newtype
= TREE_TYPE (olddecl
);
25898 if (type_uses_auto (newtype
))
25900 // Substitute once to fix references to other template parameters.
25901 newtype
= tsubst (newtype
, tsubst_args
,
25902 complain
|tf_partial
, NULL_TREE
);
25903 // Now substitute again to reduce the level of the auto.
25904 newtype
= tsubst (newtype
, current_template_args (),
25905 complain
, NULL_TREE
);
25908 newtype
= tsubst (newtype
, tsubst_args
,
25909 complain
, NULL_TREE
);
25913 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TREE_CODE (olddecl
),
25914 DECL_NAME (olddecl
), newtype
);
25915 SET_DECL_TEMPLATE_PARM_P (newdecl
);
25918 if (TREE_CODE (olddecl
) == TYPE_DECL
25919 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
25921 newidx
= TEMPLATE_TYPE_PARM_INDEX (newtype
)
25922 = build_template_parm_index (index
, level
, level
,
25924 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
25925 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
25926 TYPE_STUB_DECL (newtype
) = TYPE_NAME (newtype
) = newdecl
;
25927 TYPE_CANONICAL (newtype
) = canonical_type_parameter (newtype
);
25929 if (TREE_CODE (olddecl
) == TEMPLATE_DECL
)
25931 DECL_TEMPLATE_RESULT (newdecl
)
25932 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TYPE_DECL
,
25933 DECL_NAME (olddecl
), newtype
);
25934 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (newdecl
)) = true;
25935 // First create a copy (ttargs) of tsubst_args with an
25936 // additional level for the template template parameter's own
25937 // template parameters (ttparms).
25938 tree ttparms
= (INNERMOST_TEMPLATE_PARMS
25939 (DECL_TEMPLATE_PARMS (olddecl
)));
25940 const int depth
= TMPL_ARGS_DEPTH (tsubst_args
);
25941 tree ttargs
= make_tree_vec (depth
+ 1);
25942 for (int i
= 0; i
< depth
; ++i
)
25943 TREE_VEC_ELT (ttargs
, i
) = TREE_VEC_ELT (tsubst_args
, i
);
25944 TREE_VEC_ELT (ttargs
, depth
)
25945 = template_parms_level_to_args (ttparms
);
25946 // Substitute ttargs into ttparms to fix references to
25947 // other template parameters.
25948 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
25949 complain
|tf_partial
);
25950 // Now substitute again with args based on tparms, to reduce
25951 // the level of the ttparms.
25952 ttargs
= current_template_args ();
25953 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
25955 // Finally, tack the adjusted parms onto tparms.
25956 ttparms
= tree_cons (size_int (depth
), ttparms
,
25957 current_template_parms
);
25958 DECL_TEMPLATE_PARMS (newdecl
) = ttparms
;
25963 tree oldconst
= TEMPLATE_PARM_DECL (oldidx
);
25965 = build_decl (DECL_SOURCE_LOCATION (oldconst
),
25966 TREE_CODE (oldconst
),
25967 DECL_NAME (oldconst
), newtype
);
25968 TREE_CONSTANT (newconst
) = TREE_CONSTANT (newdecl
)
25969 = TREE_READONLY (newconst
) = TREE_READONLY (newdecl
) = true;
25970 SET_DECL_TEMPLATE_PARM_P (newconst
);
25971 newidx
= build_template_parm_index (index
, level
, level
,
25972 newconst
, newtype
);
25973 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
25974 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
25975 DECL_INITIAL (newdecl
) = DECL_INITIAL (newconst
) = newidx
;
25981 /* Returns a C++17 class deduction guide template based on the constructor
25982 CTOR. As a special case, CTOR can be a RECORD_TYPE for an implicit default
25983 guide, or REFERENCE_TYPE for an implicit copy/move guide. */
25986 build_deduction_guide (tree ctor
, tree outer_args
, tsubst_flags_t complain
)
25988 tree type
, tparms
, targs
, fparms
, fargs
, ci
;
25989 bool memtmpl
= false;
25992 tree fn_tmpl
= NULL_TREE
;
25997 bool copy_p
= TREE_CODE (type
) == REFERENCE_TYPE
;
26000 type
= TREE_TYPE (type
);
26001 fparms
= tree_cons (NULL_TREE
, type
, void_list_node
);
26004 fparms
= void_list_node
;
26006 tree ctmpl
= CLASSTYPE_TI_TEMPLATE (type
);
26007 tparms
= DECL_TEMPLATE_PARMS (ctmpl
);
26008 targs
= CLASSTYPE_TI_ARGS (type
);
26011 loc
= DECL_SOURCE_LOCATION (ctmpl
);
26012 explicit_p
= false;
26016 ++processing_template_decl
;
26020 = (TREE_CODE (ctor
) == TEMPLATE_DECL
? ctor
26021 : DECL_TI_TEMPLATE (ctor
));
26023 fn_tmpl
= tsubst (fn_tmpl
, outer_args
, complain
, ctor
);
26024 ctor
= DECL_TEMPLATE_RESULT (fn_tmpl
);
26026 type
= DECL_CONTEXT (ctor
);
26028 tparms
= DECL_TEMPLATE_PARMS (fn_tmpl
);
26029 /* If type is a member class template, DECL_TI_ARGS (ctor) will have
26030 fully specialized args for the enclosing class. Strip those off, as
26031 the deduction guide won't have those template parameters. */
26032 targs
= get_innermost_template_args (DECL_TI_ARGS (ctor
),
26033 TMPL_PARMS_DEPTH (tparms
));
26034 /* Discard the 'this' parameter. */
26035 fparms
= FUNCTION_ARG_CHAIN (ctor
);
26036 fargs
= TREE_CHAIN (DECL_ARGUMENTS (ctor
));
26037 ci
= get_constraints (ctor
);
26038 loc
= DECL_SOURCE_LOCATION (ctor
);
26039 explicit_p
= DECL_NONCONVERTING_P (ctor
);
26041 if (PRIMARY_TEMPLATE_P (fn_tmpl
))
26045 /* For a member template constructor, we need to flatten the two
26046 template parameter lists into one, and then adjust the function
26047 signature accordingly. This gets...complicated. */
26048 tree save_parms
= current_template_parms
;
26050 /* For a member template we should have two levels of parms/args, one
26051 for the class and one for the constructor. We stripped
26052 specialized args for further enclosing classes above. */
26053 const int depth
= 2;
26054 gcc_assert (TMPL_ARGS_DEPTH (targs
) == depth
);
26056 /* Template args for translating references to the two-level template
26057 parameters into references to the one-level template parameters we
26059 tree tsubst_args
= copy_node (targs
);
26060 TMPL_ARGS_LEVEL (tsubst_args
, depth
)
26061 = copy_node (TMPL_ARGS_LEVEL (tsubst_args
, depth
));
26063 /* Template parms for the constructor template. */
26064 tree ftparms
= TREE_VALUE (tparms
);
26065 unsigned flen
= TREE_VEC_LENGTH (ftparms
);
26066 /* Template parms for the class template. */
26067 tparms
= TREE_CHAIN (tparms
);
26068 tree ctparms
= TREE_VALUE (tparms
);
26069 unsigned clen
= TREE_VEC_LENGTH (ctparms
);
26070 /* Template parms for the deduction guide start as a copy of the
26071 template parms for the class. We set current_template_parms for
26072 lookup_template_class_1. */
26073 current_template_parms
= tparms
= copy_node (tparms
);
26074 tree new_vec
= TREE_VALUE (tparms
) = make_tree_vec (flen
+ clen
);
26075 for (unsigned i
= 0; i
< clen
; ++i
)
26076 TREE_VEC_ELT (new_vec
, i
) = TREE_VEC_ELT (ctparms
, i
);
26078 /* Now we need to rewrite the constructor parms to append them to the
26080 for (unsigned i
= 0; i
< flen
; ++i
)
26082 unsigned index
= i
+ clen
;
26083 unsigned level
= 1;
26084 tree oldelt
= TREE_VEC_ELT (ftparms
, i
);
26085 tree olddecl
= TREE_VALUE (oldelt
);
26086 tree newdecl
= rewrite_template_parm (olddecl
, index
, level
,
26087 tsubst_args
, complain
);
26088 if (newdecl
== error_mark_node
)
26090 tree newdef
= tsubst_template_arg (TREE_PURPOSE (oldelt
),
26091 tsubst_args
, complain
, ctor
);
26092 tree list
= build_tree_list (newdef
, newdecl
);
26093 TEMPLATE_PARM_CONSTRAINTS (list
)
26094 = tsubst_constraint_info (TEMPLATE_PARM_CONSTRAINTS (oldelt
),
26095 tsubst_args
, complain
, ctor
);
26096 TREE_VEC_ELT (new_vec
, index
) = list
;
26097 TMPL_ARG (tsubst_args
, depth
, i
) = template_parm_to_arg (list
);
26100 /* Now we have a final set of template parms to substitute into the
26101 function signature. */
26102 targs
= template_parms_to_args (tparms
);
26103 fparms
= tsubst_arg_types (fparms
, tsubst_args
, NULL_TREE
,
26105 fargs
= tsubst (fargs
, tsubst_args
, complain
, ctor
);
26107 ci
= tsubst_constraint_info (ci
, tsubst_args
, complain
, ctor
);
26109 current_template_parms
= save_parms
;
26112 --processing_template_decl
;
26114 return error_mark_node
;
26119 /* Copy the parms so we can set DECL_PRIMARY_TEMPLATE. */
26120 tparms
= copy_node (tparms
);
26121 INNERMOST_TEMPLATE_PARMS (tparms
)
26122 = copy_node (INNERMOST_TEMPLATE_PARMS (tparms
));
26125 tree fntype
= build_function_type (type
, fparms
);
26126 tree ded_fn
= build_lang_decl_loc (loc
,
26128 dguide_name (type
), fntype
);
26129 DECL_ARGUMENTS (ded_fn
) = fargs
;
26130 DECL_ARTIFICIAL (ded_fn
) = true;
26131 DECL_NONCONVERTING_P (ded_fn
) = explicit_p
;
26132 tree ded_tmpl
= build_template_decl (ded_fn
, tparms
, /*member*/false);
26133 DECL_ARTIFICIAL (ded_tmpl
) = true;
26134 DECL_TEMPLATE_RESULT (ded_tmpl
) = ded_fn
;
26135 TREE_TYPE (ded_tmpl
) = TREE_TYPE (ded_fn
);
26136 DECL_TEMPLATE_INFO (ded_fn
) = build_template_info (ded_tmpl
, targs
);
26137 DECL_PRIMARY_TEMPLATE (ded_tmpl
) = ded_tmpl
;
26139 DECL_ABSTRACT_ORIGIN (ded_tmpl
) = fn_tmpl
;
26141 set_constraints (ded_tmpl
, ci
);
26146 /* Deduce template arguments for the class template placeholder PTYPE for
26147 template TMPL based on the initializer INIT, and return the resulting
26151 do_class_deduction (tree ptype
, tree tmpl
, tree init
, int flags
,
26152 tsubst_flags_t complain
)
26154 if (!DECL_CLASS_TEMPLATE_P (tmpl
))
26156 /* We should have handled this in the caller. */
26157 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
))
26159 if (complain
& tf_error
)
26160 error ("non-class template %qT used without template arguments", tmpl
);
26161 return error_mark_node
;
26164 tree type
= TREE_TYPE (tmpl
);
26166 bool try_list_ctor
= false;
26168 vec
<tree
,va_gc
> *args
;
26169 if (init
== NULL_TREE
26170 || TREE_CODE (init
) == TREE_LIST
)
26171 args
= make_tree_vector_from_list (init
);
26172 else if (BRACE_ENCLOSED_INITIALIZER_P (init
))
26174 try_list_ctor
= TYPE_HAS_LIST_CTOR (type
);
26175 if (try_list_ctor
&& CONSTRUCTOR_NELTS (init
) == 1)
26177 /* As an exception, the first phase in 16.3.1.7 (considering the
26178 initializer list as a single argument) is omitted if the
26179 initializer list consists of a single expression of type cv U,
26180 where U is a specialization of C or a class derived from a
26181 specialization of C. */
26182 tree elt
= CONSTRUCTOR_ELT (init
, 0)->value
;
26183 tree etype
= TREE_TYPE (elt
);
26185 tree tparms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
26186 tree targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
26187 int err
= unify (tparms
, targs
, type
, etype
,
26188 UNIFY_ALLOW_DERIVED
, /*explain*/false);
26190 try_list_ctor
= false;
26193 if (try_list_ctor
|| is_std_init_list (type
))
26194 args
= make_tree_vector_single (init
);
26196 args
= make_tree_vector_from_ctor (init
);
26199 args
= make_tree_vector_single (init
);
26201 tree dname
= dguide_name (tmpl
);
26202 tree cands
= lookup_qualified_name (CP_DECL_CONTEXT (tmpl
), dname
,
26203 /*type*/false, /*complain*/false,
26205 bool elided
= false;
26206 if (cands
== error_mark_node
)
26209 /* Prune explicit deduction guides in copy-initialization context. */
26210 if (flags
& LOOKUP_ONLYCONVERTING
)
26212 for (lkp_iterator
iter (cands
); !elided
&& iter
; ++iter
)
26213 if (DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
26218 /* Found a nonconverting guide, prune the candidates. */
26219 tree pruned
= NULL_TREE
;
26220 for (lkp_iterator
iter (cands
); iter
; ++iter
)
26221 if (!DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
26222 pruned
= lookup_add (*iter
, pruned
);
26228 tree outer_args
= NULL_TREE
;
26229 if (DECL_CLASS_SCOPE_P (tmpl
)
26230 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (tmpl
)))
26232 outer_args
= CLASSTYPE_TI_ARGS (DECL_CONTEXT (tmpl
));
26233 type
= TREE_TYPE (most_general_template (tmpl
));
26236 bool saw_ctor
= false;
26237 // FIXME cache artificial deduction guides
26238 for (ovl_iterator
iter (CLASSTYPE_CONSTRUCTORS (type
)); iter
; ++iter
)
26240 /* Skip inherited constructors. */
26241 if (iter
.using_p ())
26244 tree guide
= build_deduction_guide (*iter
, outer_args
, complain
);
26245 if (guide
== error_mark_node
)
26246 return error_mark_node
;
26247 if ((flags
& LOOKUP_ONLYCONVERTING
)
26248 && DECL_NONCONVERTING_P (STRIP_TEMPLATE (guide
)))
26251 cands
= lookup_add (guide
, cands
);
26256 tree call
= error_mark_node
;
26258 /* If this is list-initialization and the class has a list constructor, first
26259 try deducing from the list as a single argument, as [over.match.list]. */
26260 tree list_cands
= NULL_TREE
;
26261 if (try_list_ctor
&& cands
)
26262 for (lkp_iterator
iter (cands
); iter
; ++iter
)
26265 if (is_list_ctor (dg
))
26266 list_cands
= lookup_add (dg
, list_cands
);
26270 ++cp_unevaluated_operand
;
26271 call
= build_new_function_call (list_cands
, &args
, tf_decltype
);
26272 --cp_unevaluated_operand
;
26274 if (call
== error_mark_node
)
26276 /* That didn't work, now try treating the list as a sequence of
26278 release_tree_vector (args
);
26279 args
= make_tree_vector_from_ctor (init
);
26283 /* Maybe generate an implicit deduction guide. */
26284 if (call
== error_mark_node
&& args
->length () < 2)
26286 tree gtype
= NULL_TREE
;
26288 if (args
->length () == 1)
26289 /* Generate a copy guide. */
26290 gtype
= build_reference_type (type
);
26291 else if (!saw_ctor
)
26292 /* Generate a default guide. */
26297 tree guide
= build_deduction_guide (gtype
, outer_args
, complain
);
26298 if (guide
== error_mark_node
)
26299 return error_mark_node
;
26300 cands
= lookup_add (guide
, cands
);
26304 if (elided
&& !cands
)
26306 error ("cannot deduce template arguments for copy-initialization"
26307 " of %qT, as it has no non-explicit deduction guides or "
26308 "user-declared constructors", type
);
26309 return error_mark_node
;
26311 else if (!cands
&& call
== error_mark_node
)
26313 error ("cannot deduce template arguments of %qT, as it has no viable "
26314 "deduction guides", type
);
26315 return error_mark_node
;
26318 if (call
== error_mark_node
)
26320 ++cp_unevaluated_operand
;
26321 call
= build_new_function_call (cands
, &args
, tf_decltype
);
26322 --cp_unevaluated_operand
;
26325 if (call
== error_mark_node
&& (complain
& tf_warning_or_error
))
26327 error ("class template argument deduction failed:");
26329 ++cp_unevaluated_operand
;
26330 call
= build_new_function_call (cands
, &args
, complain
| tf_decltype
);
26331 --cp_unevaluated_operand
;
26334 inform (input_location
, "explicit deduction guides not considered "
26335 "for copy-initialization");
26338 release_tree_vector (args
);
26340 return cp_build_qualified_type (TREE_TYPE (call
), cp_type_quals (ptype
));
26343 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
26344 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
26345 The CONTEXT determines the context in which auto deduction is performed
26346 and is used to control error diagnostics. FLAGS are the LOOKUP_* flags.
26347 OUTER_TARGS are used during template argument deduction
26348 (context == adc_unify) to properly substitute the result, and is ignored
26351 For partial-concept-ids, extra args may be appended to the list of deduced
26352 template arguments prior to determining constraint satisfaction. */
26355 do_auto_deduction (tree type
, tree init
, tree auto_node
,
26356 tsubst_flags_t complain
, auto_deduction_context context
,
26357 tree outer_targs
, int flags
)
26361 if (init
== error_mark_node
)
26362 return error_mark_node
;
26364 if (init
&& type_dependent_expression_p (init
)
26365 && context
!= adc_unify
)
26366 /* Defining a subset of type-dependent expressions that we can deduce
26367 from ahead of time isn't worth the trouble. */
26370 /* Similarly, we can't deduce from another undeduced decl. */
26371 if (init
&& undeduced_auto_decl (init
))
26374 if (tree tmpl
= CLASS_PLACEHOLDER_TEMPLATE (auto_node
))
26375 /* C++17 class template argument deduction. */
26376 return do_class_deduction (type
, tmpl
, init
, flags
, complain
);
26378 if (init
== NULL_TREE
|| TREE_TYPE (init
) == NULL_TREE
)
26379 /* Nothing we can do with this, even in deduction context. */
26382 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
26383 with either a new invented type template parameter U or, if the
26384 initializer is a braced-init-list (8.5.4), with
26385 std::initializer_list<U>. */
26386 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
26388 if (!DIRECT_LIST_INIT_P (init
))
26389 type
= listify_autos (type
, auto_node
);
26390 else if (CONSTRUCTOR_NELTS (init
) == 1)
26391 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
26394 if (complain
& tf_warning_or_error
)
26396 if (permerror (input_location
, "direct-list-initialization of "
26397 "%<auto%> requires exactly one element"))
26398 inform (input_location
,
26399 "for deduction to %<std::initializer_list%>, use copy-"
26400 "list-initialization (i.e. add %<=%> before the %<{%>)");
26402 type
= listify_autos (type
, auto_node
);
26406 if (type
== error_mark_node
)
26407 return error_mark_node
;
26409 init
= resolve_nondeduced_context (init
, complain
);
26411 if (context
== adc_decomp_type
26412 && auto_node
== type
26413 && init
!= error_mark_node
26414 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
26415 /* [dcl.decomp]/1 - if decomposition declaration has no ref-qualifiers
26416 and initializer has array type, deduce cv-qualified array type. */
26417 return cp_build_qualified_type_real (TREE_TYPE (init
), TYPE_QUALS (type
),
26419 else if (AUTO_IS_DECLTYPE (auto_node
))
26421 bool id
= (DECL_P (init
)
26422 || ((TREE_CODE (init
) == COMPONENT_REF
26423 || TREE_CODE (init
) == SCOPE_REF
)
26424 && !REF_PARENTHESIZED_P (init
)));
26425 targs
= make_tree_vec (1);
26426 TREE_VEC_ELT (targs
, 0)
26427 = finish_decltype_type (init
, id
, tf_warning_or_error
);
26428 if (type
!= auto_node
)
26430 if (complain
& tf_error
)
26431 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
26432 return error_mark_node
;
26437 tree parms
= build_tree_list (NULL_TREE
, type
);
26441 tparms
= extract_autos (type
);
26444 tparms
= make_tree_vec (1);
26445 TREE_VEC_ELT (tparms
, 0)
26446 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
26449 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
26450 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
26451 DEDUCE_CALL
, LOOKUP_NORMAL
,
26452 NULL
, /*explain_p=*/false);
26455 if (processing_template_decl
)
26456 /* Try again at instantiation time. */
26458 if (type
&& type
!= error_mark_node
26459 && (complain
& tf_error
))
26460 /* If type is error_mark_node a diagnostic must have been
26461 emitted by now. Also, having a mention to '<type error>'
26462 in the diagnostic is not really useful to the user. */
26464 if (cfun
&& auto_node
== current_function_auto_return_pattern
26465 && LAMBDA_FUNCTION_P (current_function_decl
))
26466 error ("unable to deduce lambda return type from %qE", init
);
26468 error ("unable to deduce %qT from %qE", type
, init
);
26469 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
26470 DEDUCE_CALL
, LOOKUP_NORMAL
,
26471 NULL
, /*explain_p=*/true);
26473 return error_mark_node
;
26477 /* Check any placeholder constraints against the deduced type. */
26478 if (flag_concepts
&& !processing_template_decl
)
26479 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
26481 /* Use the deduced type to check the associated constraints. If we
26482 have a partial-concept-id, rebuild the argument list so that
26483 we check using the extra arguments. */
26484 gcc_assert (TREE_CODE (constr
) == CHECK_CONSTR
);
26485 tree cargs
= CHECK_CONSTR_ARGS (constr
);
26486 if (TREE_VEC_LENGTH (cargs
) > 1)
26488 cargs
= copy_node (cargs
);
26489 TREE_VEC_ELT (cargs
, 0) = TREE_VEC_ELT (targs
, 0);
26493 if (!constraints_satisfied_p (constr
, cargs
))
26495 if (complain
& tf_warning_or_error
)
26499 case adc_unspecified
:
26501 error("placeholder constraints not satisfied");
26503 case adc_variable_type
:
26504 case adc_decomp_type
:
26505 error ("deduced initializer does not satisfy "
26506 "placeholder constraints");
26508 case adc_return_type
:
26509 error ("deduced return type does not satisfy "
26510 "placeholder constraints");
26512 case adc_requirement
:
26513 error ("deduced expression type does not satisfy "
26514 "placeholder constraints");
26517 diagnose_constraints (input_location
, constr
, targs
);
26519 return error_mark_node
;
26523 if (processing_template_decl
&& context
!= adc_unify
)
26524 outer_targs
= current_template_args ();
26525 targs
= add_to_template_args (outer_targs
, targs
);
26526 return tsubst (type
, targs
, complain
, NULL_TREE
);
26529 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
26533 splice_late_return_type (tree type
, tree late_return_type
)
26535 if (is_auto (type
))
26537 if (late_return_type
)
26538 return late_return_type
;
26540 tree idx
= get_template_parm_index (type
);
26541 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
26542 /* In an abbreviated function template we didn't know we were dealing
26543 with a function template when we saw the auto return type, so update
26544 it to have the correct level. */
26545 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
26550 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
26551 'decltype(auto)' or a deduced class template. */
26554 is_auto (const_tree type
)
26556 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
26557 && (TYPE_IDENTIFIER (type
) == auto_identifier
26558 || TYPE_IDENTIFIER (type
) == decltype_auto_identifier
26559 || CLASS_PLACEHOLDER_TEMPLATE (type
)))
26565 /* for_each_template_parm callback for type_uses_auto. */
26568 is_auto_r (tree tp
, void */
*data*/
)
26570 return is_auto (tp
);
26573 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
26574 a use of `auto'. Returns NULL_TREE otherwise. */
26577 type_uses_auto (tree type
)
26579 if (type
== NULL_TREE
)
26581 else if (flag_concepts
)
26583 /* The Concepts TS allows multiple autos in one type-specifier; just
26584 return the first one we find, do_auto_deduction will collect all of
26586 if (uses_template_parms (type
))
26587 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
26588 /*visited*/NULL
, /*nondeduced*/true);
26593 return find_type_usage (type
, is_auto
);
26596 /* Report ill-formed occurrences of auto types in ARGUMENTS. If
26597 concepts are enabled, auto is acceptable in template arguments, but
26598 only when TEMPL identifies a template class. Return TRUE if any
26599 such errors were reported. */
26602 check_auto_in_tmpl_args (tree tmpl
, tree args
)
26604 /* If there were previous errors, nevermind. */
26605 if (!args
|| TREE_CODE (args
) != TREE_VEC
)
26608 /* If TMPL is an identifier, we're parsing and we can't tell yet
26609 whether TMPL is supposed to be a type, a function or a variable.
26610 We'll only be able to tell during template substitution, so we
26611 expect to be called again then. If concepts are enabled and we
26612 know we have a type, we're ok. */
26614 && (identifier_p (tmpl
)
26616 && (DECL_TYPE_TEMPLATE_P (tmpl
)
26617 || DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)))))
26620 /* Quickly search for any occurrences of auto; usually there won't
26621 be any, and then we'll avoid allocating the vector. */
26622 if (!type_uses_auto (args
))
26625 bool errors
= false;
26627 tree vec
= extract_autos (args
);
26628 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); i
++)
26630 tree xauto
= TREE_VALUE (TREE_VEC_ELT (vec
, i
));
26631 error_at (DECL_SOURCE_LOCATION (xauto
),
26632 "invalid use of %qT in template argument", xauto
);
26639 /* For a given template T, return the vector of typedefs referenced
26640 in T for which access check is needed at T instantiation time.
26641 T is either a FUNCTION_DECL or a RECORD_TYPE.
26642 Those typedefs were added to T by the function
26643 append_type_to_template_for_access_check. */
26645 vec
<qualified_typedef_usage_t
, va_gc
> *
26646 get_types_needing_access_check (tree t
)
26649 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
26651 if (!t
|| t
== error_mark_node
)
26654 if (!(ti
= get_template_info (t
)))
26657 if (CLASS_TYPE_P (t
)
26658 || TREE_CODE (t
) == FUNCTION_DECL
)
26660 if (!TI_TEMPLATE (ti
))
26663 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
26669 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
26670 tied to T. That list of typedefs will be access checked at
26671 T instantiation time.
26672 T is either a FUNCTION_DECL or a RECORD_TYPE.
26673 TYPE_DECL is a TYPE_DECL node representing a typedef.
26674 SCOPE is the scope through which TYPE_DECL is accessed.
26675 LOCATION is the location of the usage point of TYPE_DECL.
26677 This function is a subroutine of
26678 append_type_to_template_for_access_check. */
26681 append_type_to_template_for_access_check_1 (tree t
,
26684 location_t location
)
26686 qualified_typedef_usage_t typedef_usage
;
26689 if (!t
|| t
== error_mark_node
)
26692 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
26693 || CLASS_TYPE_P (t
))
26695 && TREE_CODE (type_decl
) == TYPE_DECL
26698 if (!(ti
= get_template_info (t
)))
26701 gcc_assert (TI_TEMPLATE (ti
));
26703 typedef_usage
.typedef_decl
= type_decl
;
26704 typedef_usage
.context
= scope
;
26705 typedef_usage
.locus
= location
;
26707 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
26710 /* Append TYPE_DECL to the template TEMPL.
26711 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
26712 At TEMPL instanciation time, TYPE_DECL will be checked to see
26713 if it can be accessed through SCOPE.
26714 LOCATION is the location of the usage point of TYPE_DECL.
26716 e.g. consider the following code snippet:
26723 template<class U> struct S
26725 C::myint mi; // <-- usage point of the typedef C::myint
26730 At S<char> instantiation time, we need to check the access of C::myint
26731 In other words, we need to check the access of the myint typedef through
26732 the C scope. For that purpose, this function will add the myint typedef
26733 and the scope C through which its being accessed to a list of typedefs
26734 tied to the template S. That list will be walked at template instantiation
26735 time and access check performed on each typedefs it contains.
26736 Note that this particular code snippet should yield an error because
26737 myint is private to C. */
26740 append_type_to_template_for_access_check (tree templ
,
26743 location_t location
)
26745 qualified_typedef_usage_t
*iter
;
26748 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
26750 /* Make sure we don't append the type to the template twice. */
26751 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
26752 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
26755 append_type_to_template_for_access_check_1 (templ
, type_decl
,
26759 /* Convert the generic type parameters in PARM that match the types given in the
26760 range [START_IDX, END_IDX) from the current_template_parms into generic type
26764 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
26766 tree current
= current_template_parms
;
26767 int depth
= TMPL_PARMS_DEPTH (current
);
26768 current
= INNERMOST_TEMPLATE_PARMS (current
);
26769 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
26771 for (int i
= 0; i
< start_idx
; ++i
)
26772 TREE_VEC_ELT (replacement
, i
)
26773 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
26775 for (int i
= start_idx
; i
< end_idx
; ++i
)
26777 /* Create a distinct parameter pack type from the current parm and add it
26778 to the replacement args to tsubst below into the generic function
26781 tree o
= TREE_TYPE (TREE_VALUE
26782 (TREE_VEC_ELT (current
, i
)));
26783 tree t
= copy_type (o
);
26784 TEMPLATE_TYPE_PARM_INDEX (t
)
26785 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
26787 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
26788 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
26789 TYPE_MAIN_VARIANT (t
) = t
;
26790 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
26791 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
26792 TREE_VEC_ELT (replacement
, i
) = t
;
26793 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
26796 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
26797 TREE_VEC_ELT (replacement
, i
)
26798 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
26800 /* If there are more levels then build up the replacement with the outer
26803 replacement
= add_to_template_args (template_parms_to_args
26804 (TREE_CHAIN (current_template_parms
)),
26807 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
26810 /* Entries in the decl_constraint hash table. */
26811 struct GTY((for_user
)) constr_entry
26817 /* Hashing function and equality for constraint entries. */
26818 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
26820 static hashval_t
hash (constr_entry
*e
)
26822 return (hashval_t
)DECL_UID (e
->decl
);
26825 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
26827 return e1
->decl
== e2
->decl
;
26831 /* A mapping from declarations to constraint information. Note that
26832 both templates and their underlying declarations are mapped to the
26833 same constraint information.
26835 FIXME: This is defined in pt.c because garbage collection
26836 code is not being generated for constraint.cc. */
26838 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
26840 /* Returns the template constraints of declaration T. If T is not
26841 constrained, return NULL_TREE. Note that T must be non-null. */
26844 get_constraints (tree t
)
26846 if (!flag_concepts
)
26849 gcc_assert (DECL_P (t
));
26850 if (TREE_CODE (t
) == TEMPLATE_DECL
)
26851 t
= DECL_TEMPLATE_RESULT (t
);
26852 constr_entry elt
= { t
, NULL_TREE
};
26853 constr_entry
* found
= decl_constraints
->find (&elt
);
26860 /* Associate the given constraint information CI with the declaration
26861 T. If T is a template, then the constraints are associated with
26862 its underlying declaration. Don't build associations if CI is
26866 set_constraints (tree t
, tree ci
)
26870 gcc_assert (t
&& flag_concepts
);
26871 if (TREE_CODE (t
) == TEMPLATE_DECL
)
26872 t
= DECL_TEMPLATE_RESULT (t
);
26873 gcc_assert (!get_constraints (t
));
26874 constr_entry elt
= {t
, ci
};
26875 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
26876 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
26881 /* Remove the associated constraints of the declaration T. */
26884 remove_constraints (tree t
)
26886 gcc_assert (DECL_P (t
));
26887 if (TREE_CODE (t
) == TEMPLATE_DECL
)
26888 t
= DECL_TEMPLATE_RESULT (t
);
26890 constr_entry elt
= {t
, NULL_TREE
};
26891 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
26893 decl_constraints
->clear_slot (slot
);
26896 /* Memoized satisfaction results for declarations. This
26897 maps the pair (constraint_info, arguments) to the result computed
26898 by constraints_satisfied_p. */
26900 struct GTY((for_user
)) constraint_sat_entry
26907 /* Hashing function and equality for constraint entries. */
26909 struct constraint_sat_hasher
: ggc_ptr_hash
<constraint_sat_entry
>
26911 static hashval_t
hash (constraint_sat_entry
*e
)
26913 hashval_t val
= iterative_hash_object(e
->ci
, 0);
26914 return iterative_hash_template_arg (e
->args
, val
);
26917 static bool equal (constraint_sat_entry
*e1
, constraint_sat_entry
*e2
)
26919 return e1
->ci
== e2
->ci
&& comp_template_args (e1
->args
, e2
->args
);
26923 /* Memoized satisfaction results for concept checks. */
26925 struct GTY((for_user
)) concept_spec_entry
26932 /* Hashing function and equality for constraint entries. */
26934 struct concept_spec_hasher
: ggc_ptr_hash
<concept_spec_entry
>
26936 static hashval_t
hash (concept_spec_entry
*e
)
26938 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
26941 static bool equal (concept_spec_entry
*e1
, concept_spec_entry
*e2
)
26943 ++comparing_specializations
;
26944 bool eq
= e1
->tmpl
== e2
->tmpl
&& comp_template_args (e1
->args
, e2
->args
);
26945 --comparing_specializations
;
26950 static GTY (()) hash_table
<constraint_sat_hasher
> *constraint_memos
;
26951 static GTY (()) hash_table
<concept_spec_hasher
> *concept_memos
;
26953 /* Search for a memoized satisfaction result. Returns one of the
26954 truth value nodes if previously memoized, or NULL_TREE otherwise. */
26957 lookup_constraint_satisfaction (tree ci
, tree args
)
26959 constraint_sat_entry elt
= { ci
, args
, NULL_TREE
};
26960 constraint_sat_entry
* found
= constraint_memos
->find (&elt
);
26962 return found
->result
;
26967 /* Memoize the result of a satisfication test. Returns the saved result. */
26970 memoize_constraint_satisfaction (tree ci
, tree args
, tree result
)
26972 constraint_sat_entry elt
= {ci
, args
, result
};
26973 constraint_sat_entry
** slot
= constraint_memos
->find_slot (&elt
, INSERT
);
26974 constraint_sat_entry
* entry
= ggc_alloc
<constraint_sat_entry
> ();
26980 /* Search for a memoized satisfaction result for a concept. */
26983 lookup_concept_satisfaction (tree tmpl
, tree args
)
26985 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
26986 concept_spec_entry
* found
= concept_memos
->find (&elt
);
26988 return found
->result
;
26993 /* Memoize the result of a concept check. Returns the saved result. */
26996 memoize_concept_satisfaction (tree tmpl
, tree args
, tree result
)
26998 concept_spec_entry elt
= {tmpl
, args
, result
};
26999 concept_spec_entry
** slot
= concept_memos
->find_slot (&elt
, INSERT
);
27000 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
27006 static GTY (()) hash_table
<concept_spec_hasher
> *concept_expansions
;
27008 /* Returns a prior concept specialization. This returns the substituted
27009 and normalized constraints defined by the concept. */
27012 get_concept_expansion (tree tmpl
, tree args
)
27014 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
27015 concept_spec_entry
* found
= concept_expansions
->find (&elt
);
27017 return found
->result
;
27022 /* Save a concept expansion for later. */
27025 save_concept_expansion (tree tmpl
, tree args
, tree def
)
27027 concept_spec_entry elt
= {tmpl
, args
, def
};
27028 concept_spec_entry
** slot
= concept_expansions
->find_slot (&elt
, INSERT
);
27029 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
27036 hash_subsumption_args (tree t1
, tree t2
)
27038 gcc_assert (TREE_CODE (t1
) == CHECK_CONSTR
);
27039 gcc_assert (TREE_CODE (t2
) == CHECK_CONSTR
);
27041 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t1
), val
);
27042 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t1
), val
);
27043 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t2
), val
);
27044 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t2
), val
);
27048 /* Compare the constraints of two subsumption entries. The LEFT1 and
27049 LEFT2 arguments comprise the first subsumption pair and the RIGHT1
27050 and RIGHT2 arguments comprise the second. These are all CHECK_CONSTRs. */
27053 comp_subsumption_args (tree left1
, tree left2
, tree right1
, tree right2
)
27055 if (CHECK_CONSTR_CONCEPT (left1
) == CHECK_CONSTR_CONCEPT (right1
))
27056 if (CHECK_CONSTR_CONCEPT (left2
) == CHECK_CONSTR_CONCEPT (right2
))
27057 if (comp_template_args (CHECK_CONSTR_ARGS (left1
),
27058 CHECK_CONSTR_ARGS (right1
)))
27059 return comp_template_args (CHECK_CONSTR_ARGS (left2
),
27060 CHECK_CONSTR_ARGS (right2
));
27064 /* Key/value pair for learning and memoizing subsumption results. This
27065 associates a pair of check constraints (including arguments) with
27066 a boolean value indicating the result. */
27068 struct GTY((for_user
)) subsumption_entry
27075 /* Hashing function and equality for constraint entries. */
27077 struct subsumption_hasher
: ggc_ptr_hash
<subsumption_entry
>
27079 static hashval_t
hash (subsumption_entry
*e
)
27081 return hash_subsumption_args (e
->t1
, e
->t2
);
27084 static bool equal (subsumption_entry
*e1
, subsumption_entry
*e2
)
27086 ++comparing_specializations
;
27087 bool eq
= comp_subsumption_args(e1
->t1
, e1
->t2
, e2
->t1
, e2
->t2
);
27088 --comparing_specializations
;
27093 static GTY (()) hash_table
<subsumption_hasher
> *subsumption_table
;
27095 /* Search for a previously cached subsumption result. */
27098 lookup_subsumption_result (tree t1
, tree t2
)
27100 subsumption_entry elt
= { t1
, t2
, false };
27101 subsumption_entry
* found
= subsumption_table
->find (&elt
);
27103 return &found
->result
;
27108 /* Save a subsumption result. */
27111 save_subsumption_result (tree t1
, tree t2
, bool result
)
27113 subsumption_entry elt
= {t1
, t2
, result
};
27114 subsumption_entry
** slot
= subsumption_table
->find_slot (&elt
, INSERT
);
27115 subsumption_entry
* entry
= ggc_alloc
<subsumption_entry
> ();
27121 /* Set up the hash table for constraint association. */
27124 init_constraint_processing (void)
27126 if (!flag_concepts
)
27129 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
27130 constraint_memos
= hash_table
<constraint_sat_hasher
>::create_ggc(37);
27131 concept_memos
= hash_table
<concept_spec_hasher
>::create_ggc(37);
27132 concept_expansions
= hash_table
<concept_spec_hasher
>::create_ggc(37);
27133 subsumption_table
= hash_table
<subsumption_hasher
>::create_ggc(37);
27136 /* __integer_pack(N) in a pack expansion expands to a sequence of numbers from
27140 declare_integer_pack (void)
27142 tree ipfn
= push_library_fn (get_identifier ("__integer_pack"),
27143 build_function_type_list (integer_type_node
,
27146 NULL_TREE
, ECF_CONST
);
27147 DECL_DECLARED_CONSTEXPR_P (ipfn
) = true;
27148 DECL_BUILT_IN_CLASS (ipfn
) = BUILT_IN_FRONTEND
;
27151 /* Set up the hash tables for template instantiations. */
27154 init_template_processing (void)
27156 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
27157 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
27159 if (cxx_dialect
>= cxx11
)
27160 declare_integer_pack ();
27163 /* Print stats about the template hash tables for -fstats. */
27166 print_template_statistics (void)
27168 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
27169 "%f collisions\n", (long) decl_specializations
->size (),
27170 (long) decl_specializations
->elements (),
27171 decl_specializations
->collisions ());
27172 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
27173 "%f collisions\n", (long) type_specializations
->size (),
27174 (long) type_specializations
->elements (),
27175 type_specializations
->collisions ());
27180 namespace selftest
{
27182 /* Verify that build_non_dependent_expr () works, for various expressions,
27183 and that location wrappers don't affect the results. */
27186 test_build_non_dependent_expr ()
27188 location_t loc
= BUILTINS_LOCATION
;
27190 /* Verify constants, without and with location wrappers. */
27191 tree int_cst
= build_int_cst (integer_type_node
, 42);
27192 ASSERT_EQ (int_cst
, build_non_dependent_expr (int_cst
));
27194 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
27195 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
27196 ASSERT_EQ (wrapped_int_cst
, build_non_dependent_expr (wrapped_int_cst
));
27198 tree string_lit
= build_string (4, "foo");
27199 TREE_TYPE (string_lit
) = char_array_type_node
;
27200 string_lit
= fix_string_type (string_lit
);
27201 ASSERT_EQ (string_lit
, build_non_dependent_expr (string_lit
));
27203 tree wrapped_string_lit
= maybe_wrap_with_location (string_lit
, loc
);
27204 ASSERT_TRUE (location_wrapper_p (wrapped_string_lit
));
27205 ASSERT_EQ (wrapped_string_lit
,
27206 build_non_dependent_expr (wrapped_string_lit
));
27209 /* Verify that type_dependent_expression_p () works correctly, even
27210 in the presence of location wrapper nodes. */
27213 test_type_dependent_expression_p ()
27215 location_t loc
= BUILTINS_LOCATION
;
27217 tree name
= get_identifier ("foo");
27219 /* If no templates are involved, nothing is type-dependent. */
27220 gcc_assert (!processing_template_decl
);
27221 ASSERT_FALSE (type_dependent_expression_p (name
));
27223 ++processing_template_decl
;
27225 /* Within a template, an unresolved name is always type-dependent. */
27226 ASSERT_TRUE (type_dependent_expression_p (name
));
27228 /* Ensure it copes with NULL_TREE and errors. */
27229 ASSERT_FALSE (type_dependent_expression_p (NULL_TREE
));
27230 ASSERT_FALSE (type_dependent_expression_p (error_mark_node
));
27232 /* A USING_DECL in a template should be type-dependent, even if wrapped
27233 with a location wrapper (PR c++/83799). */
27234 tree using_decl
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
27235 TREE_TYPE (using_decl
) = integer_type_node
;
27236 ASSERT_TRUE (type_dependent_expression_p (using_decl
));
27237 tree wrapped_using_decl
= maybe_wrap_with_location (using_decl
, loc
);
27238 ASSERT_TRUE (location_wrapper_p (wrapped_using_decl
));
27239 ASSERT_TRUE (type_dependent_expression_p (wrapped_using_decl
));
27241 --processing_template_decl
;
27244 /* Run all of the selftests within this file. */
27249 test_build_non_dependent_expr ();
27250 test_type_dependent_expression_p ();
27253 } // namespace selftest
27255 #endif /* #if CHECKING_P */
27257 #include "gt-cp-pt.h"