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
)
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 /* Likewise for parameters with default arguments. */
8241 if (args
== error_mark_node
)
8242 return error_mark_node
;
8244 nparms
= TREE_VEC_LENGTH (parms
);
8246 /* Determine if there are any parameter packs or default arguments. */
8247 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
8249 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
8251 ++post_variadic_parms
;
8252 if (template_parameter_pack_p (TREE_VALUE (parm
)))
8254 if (TREE_PURPOSE (parm
))
8258 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
8259 /* If there are no parameters that follow a parameter pack, we need to
8260 expand any argument packs so that we can deduce a parameter pack from
8261 some non-packed args followed by an argument pack, as in variadic85.C.
8262 If there are such parameters, we need to leave argument packs intact
8263 so the arguments are assigned properly. This can happen when dealing
8264 with a nested class inside a partial specialization of a class
8265 template, as in variadic92.C, or when deducing a template parameter pack
8266 from a sub-declarator, as in variadic114.C. */
8267 if (!post_variadic_parms
)
8268 inner_args
= expand_template_argument_pack (inner_args
);
8270 /* Count any pack expansion args. */
8271 variadic_args_p
= pack_expansion_args_count (inner_args
);
8273 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
8274 if ((nargs
- variadic_args_p
> nparms
&& !variadic_p
)
8275 || (nargs
< nparms
- variadic_p
8278 && (!use_default_args
8279 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
8280 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
8282 if (complain
& tf_error
)
8284 if (variadic_p
|| default_p
)
8286 nparms
-= variadic_p
+ default_p
;
8287 error ("wrong number of template arguments "
8288 "(%d, should be at least %d)", nargs
, nparms
);
8291 error ("wrong number of template arguments "
8292 "(%d, should be %d)", nargs
, nparms
);
8295 inform (DECL_SOURCE_LOCATION (in_decl
),
8296 "provided for %qD", in_decl
);
8299 return error_mark_node
;
8301 /* We can't pass a pack expansion to a non-pack parameter of an alias
8302 template (DR 1430). */
8304 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
8305 || concept_template_p (in_decl
))
8307 && nargs
- variadic_args_p
< nparms
- variadic_p
)
8309 if (complain
& tf_error
)
8311 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
8313 tree arg
= TREE_VEC_ELT (inner_args
, i
);
8314 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
8316 if (PACK_EXPANSION_P (arg
)
8317 && !template_parameter_pack_p (parm
))
8319 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
8320 error_at (location_of (arg
),
8321 "pack expansion argument for non-pack parameter "
8322 "%qD of alias template %qD", parm
, in_decl
);
8324 error_at (location_of (arg
),
8325 "pack expansion argument for non-pack parameter "
8326 "%qD of concept %qD", parm
, in_decl
);
8327 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
8334 return error_mark_node
;
8337 /* We need to evaluate the template arguments, even though this
8338 template-id may be nested within a "sizeof". */
8339 saved_unevaluated_operand
= cp_unevaluated_operand
;
8340 cp_unevaluated_operand
= 0;
8341 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
8342 c_inhibit_evaluation_warnings
= 0;
8343 new_inner_args
= make_tree_vec (nparms
);
8344 new_args
= add_outermost_template_args (args
, new_inner_args
);
8345 int pack_adjust
= 0;
8346 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
8351 /* Get the Ith template parameter. */
8352 parm
= TREE_VEC_ELT (parms
, parm_idx
);
8354 if (parm
== error_mark_node
)
8356 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
8360 /* Calculate the next argument. */
8361 if (arg_idx
< nargs
)
8362 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
8366 if (template_parameter_pack_p (TREE_VALUE (parm
))
8367 && !(arg
&& ARGUMENT_PACK_P (arg
)))
8369 /* Some arguments will be placed in the
8370 template parameter pack PARM. */
8371 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
8372 inner_args
, arg_idx
,
8376 if (arg
== NULL_TREE
)
8378 /* We don't know how many args we have yet, just use the
8379 unconverted (and still packed) ones for now. */
8380 new_inner_args
= orig_inner_args
;
8385 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
8387 /* Store this argument. */
8388 if (arg
== error_mark_node
)
8391 /* We are done with all of the arguments. */
8396 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
8397 arg_idx
+= pack_adjust
;
8404 if (PACK_EXPANSION_P (arg
))
8406 /* "If every valid specialization of a variadic template
8407 requires an empty template parameter pack, the template is
8408 ill-formed, no diagnostic required." So check that the
8409 pattern works with this parameter. */
8410 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
8411 tree conv
= convert_template_argument (TREE_VALUE (parm
),
8415 if (conv
== error_mark_node
)
8417 if (complain
& tf_error
)
8418 inform (input_location
, "so any instantiation with a "
8419 "non-empty parameter pack would be ill-formed");
8422 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
8423 /* Recover from missing typename. */
8424 TREE_VEC_ELT (inner_args
, arg_idx
)
8425 = make_pack_expansion (conv
, complain
);
8427 /* We don't know how many args we have yet, just
8428 use the unconverted ones for now. */
8429 new_inner_args
= inner_args
;
8434 else if (require_all_args
)
8436 /* There must be a default arg in this case. */
8437 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
8439 /* The position of the first default template argument,
8440 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
8442 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8443 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8444 arg_idx
- pack_adjust
);
8449 if (arg
== error_mark_node
)
8451 if (complain
& tf_error
)
8452 error ("template argument %d is invalid", arg_idx
+ 1);
8455 /* This only occurs if there was an error in the template
8456 parameter list itself (which we would already have
8457 reported) that we are trying to recover from, e.g., a class
8458 template with a parameter list such as
8459 template<typename..., typename>. */
8462 arg
= convert_template_argument (TREE_VALUE (parm
),
8463 arg
, new_args
, complain
,
8466 if (arg
== error_mark_node
)
8468 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
8470 cp_unevaluated_operand
= saved_unevaluated_operand
;
8471 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
8473 if (variadic_p
&& arg_idx
< nargs
)
8475 if (complain
& tf_error
)
8477 error ("wrong number of template arguments "
8478 "(%d, should be %d)", nargs
, arg_idx
);
8480 error ("provided for %q+D", in_decl
);
8482 return error_mark_node
;
8486 return error_mark_node
;
8488 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
8489 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
8490 TREE_VEC_LENGTH (new_inner_args
));
8492 return new_inner_args
;
8495 /* Convert all template arguments to their appropriate types, and
8496 return a vector containing the innermost resulting template
8497 arguments. If any error occurs, return error_mark_node. Error and
8498 warning messages are not issued.
8500 Note that no function argument deduction is performed, and default
8501 arguments are used to fill in unspecified arguments. */
8503 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
8505 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
8508 /* Convert all template arguments to their appropriate type, and
8509 instantiate default arguments as needed. This returns a vector
8510 containing the innermost resulting template arguments, or
8511 error_mark_node if unsuccessful. */
8513 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
8514 tsubst_flags_t complain
)
8516 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
8519 /* Like coerce_template_parms. If PARMS represents all template
8520 parameters levels, this function returns a vector of vectors
8521 representing all the resulting argument levels. Note that in this
8522 case, only the innermost arguments are coerced because the
8523 outermost ones are supposed to have been coerced already.
8525 Otherwise, if PARMS represents only (the innermost) vector of
8526 parameters, this function returns a vector containing just the
8527 innermost resulting arguments. */
8530 coerce_innermost_template_parms (tree parms
,
8533 tsubst_flags_t complain
,
8534 bool require_all_args
,
8535 bool use_default_args
)
8537 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
8538 int args_depth
= TMPL_ARGS_DEPTH (args
);
8541 if (parms_depth
> 1)
8543 coerced_args
= make_tree_vec (parms_depth
);
8547 for (level
= parms
, cur_depth
= parms_depth
;
8548 parms_depth
> 0 && level
!= NULL_TREE
;
8549 level
= TREE_CHAIN (level
), --cur_depth
)
8552 if (cur_depth
== args_depth
)
8553 l
= coerce_template_parms (TREE_VALUE (level
),
8554 args
, in_decl
, complain
,
8558 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
8560 if (l
== error_mark_node
)
8561 return error_mark_node
;
8563 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
8567 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
8568 args
, in_decl
, complain
,
8571 return coerced_args
;
8574 /* Returns 1 if template args OT and NT are equivalent. */
8577 template_args_equal (tree ot
, tree nt
, bool partial_order
/* = false */)
8581 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
8583 if (nt
== any_targ_node
|| ot
== any_targ_node
)
8586 if (TREE_CODE (nt
) == TREE_VEC
)
8587 /* For member templates */
8588 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
8589 else if (PACK_EXPANSION_P (ot
))
8590 return (PACK_EXPANSION_P (nt
)
8591 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
8592 PACK_EXPANSION_PATTERN (nt
))
8593 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
8594 PACK_EXPANSION_EXTRA_ARGS (nt
)));
8595 else if (ARGUMENT_PACK_P (ot
))
8600 if (!ARGUMENT_PACK_P (nt
))
8603 opack
= ARGUMENT_PACK_ARGS (ot
);
8604 npack
= ARGUMENT_PACK_ARGS (nt
);
8605 len
= TREE_VEC_LENGTH (opack
);
8606 if (TREE_VEC_LENGTH (npack
) != len
)
8608 for (i
= 0; i
< len
; ++i
)
8609 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
8610 TREE_VEC_ELT (npack
, i
)))
8614 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
8616 else if (TYPE_P (nt
))
8620 /* Don't treat an alias template specialization with dependent
8621 arguments as equivalent to its underlying type when used as a
8622 template argument; we need them to be distinct so that we
8623 substitute into the specialization arguments at instantiation
8624 time. And aliases can't be equivalent without being ==, so
8625 we don't need to look any deeper.
8627 During partial ordering, however, we need to treat them normally so
8628 that we can order uses of the same alias with different
8629 cv-qualification (79960). */
8631 && (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
)))
8634 return same_type_p (ot
, nt
);
8636 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
8640 /* Try to treat a template non-type argument that has been converted
8641 to the parameter type as equivalent to one that hasn't yet. */
8642 for (enum tree_code code1
= TREE_CODE (ot
);
8643 CONVERT_EXPR_CODE_P (code1
)
8644 || code1
== NON_LVALUE_EXPR
;
8645 code1
= TREE_CODE (ot
))
8646 ot
= TREE_OPERAND (ot
, 0);
8647 for (enum tree_code code2
= TREE_CODE (nt
);
8648 CONVERT_EXPR_CODE_P (code2
)
8649 || code2
== NON_LVALUE_EXPR
;
8650 code2
= TREE_CODE (nt
))
8651 nt
= TREE_OPERAND (nt
, 0);
8653 return cp_tree_equal (ot
, nt
);
8657 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
8658 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
8659 NEWARG_PTR with the offending arguments if they are non-NULL. */
8662 comp_template_args (tree oldargs
, tree newargs
,
8663 tree
*oldarg_ptr
, tree
*newarg_ptr
,
8668 if (oldargs
== newargs
)
8671 if (!oldargs
|| !newargs
)
8674 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
8677 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
8679 tree nt
= TREE_VEC_ELT (newargs
, i
);
8680 tree ot
= TREE_VEC_ELT (oldargs
, i
);
8682 if (! template_args_equal (ot
, nt
, partial_order
))
8684 if (oldarg_ptr
!= NULL
)
8686 if (newarg_ptr
!= NULL
)
8695 comp_template_args_porder (tree oargs
, tree nargs
)
8697 return comp_template_args (oargs
, nargs
, NULL
, NULL
, true);
8701 add_pending_template (tree d
)
8703 tree ti
= (TYPE_P (d
)
8704 ? CLASSTYPE_TEMPLATE_INFO (d
)
8705 : DECL_TEMPLATE_INFO (d
));
8706 struct pending_template
*pt
;
8709 if (TI_PENDING_TEMPLATE_FLAG (ti
))
8712 /* We are called both from instantiate_decl, where we've already had a
8713 tinst_level pushed, and instantiate_template, where we haven't.
8715 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
8718 push_tinst_level (d
);
8720 pt
= ggc_alloc
<pending_template
> ();
8722 pt
->tinst
= current_tinst_level
;
8723 if (last_pending_template
)
8724 last_pending_template
->next
= pt
;
8726 pending_templates
= pt
;
8728 last_pending_template
= pt
;
8730 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
8737 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
8738 ARGLIST. Valid choices for FNS are given in the cp-tree.def
8739 documentation for TEMPLATE_ID_EXPR. */
8742 lookup_template_function (tree fns
, tree arglist
)
8746 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
8747 return error_mark_node
;
8749 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
8751 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
8753 error ("%q#D is not a function template", fns
);
8754 return error_mark_node
;
8757 if (BASELINK_P (fns
))
8759 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
8761 BASELINK_FUNCTIONS (fns
),
8766 type
= TREE_TYPE (fns
);
8767 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
8768 type
= unknown_type_node
;
8770 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
8773 /* Within the scope of a template class S<T>, the name S gets bound
8774 (in build_self_reference) to a TYPE_DECL for the class, not a
8775 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
8776 or one of its enclosing classes, and that type is a template,
8777 return the associated TEMPLATE_DECL. Otherwise, the original
8780 Also handle the case when DECL is a TREE_LIST of ambiguous
8781 injected-class-names from different bases. */
8784 maybe_get_template_decl_from_type_decl (tree decl
)
8786 if (decl
== NULL_TREE
)
8789 /* DR 176: A lookup that finds an injected-class-name (10.2
8790 [class.member.lookup]) can result in an ambiguity in certain cases
8791 (for example, if it is found in more than one base class). If all of
8792 the injected-class-names that are found refer to specializations of
8793 the same class template, and if the name is followed by a
8794 template-argument-list, the reference refers to the class template
8795 itself and not a specialization thereof, and is not ambiguous. */
8796 if (TREE_CODE (decl
) == TREE_LIST
)
8798 tree t
, tmpl
= NULL_TREE
;
8799 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8801 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8804 else if (tmpl
!= elt
)
8807 if (tmpl
&& t
== NULL_TREE
)
8813 return (decl
!= NULL_TREE
8814 && DECL_SELF_REFERENCE_P (decl
)
8815 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8816 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8819 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8820 parameters, find the desired type.
8822 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8824 IN_DECL, if non-NULL, is the template declaration we are trying to
8827 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8828 the class we are looking up.
8830 Issue error and warning messages under control of COMPLAIN.
8832 If the template class is really a local class in a template
8833 function, then the FUNCTION_CONTEXT is the function in which it is
8836 ??? Note that this function is currently called *twice* for each
8837 template-id: the first time from the parser, while creating the
8838 incomplete type (finish_template_type), and the second type during the
8839 real instantiation (instantiate_template_class). This is surely something
8840 that we want to avoid. It also causes some problems with argument
8841 coercion (see convert_nontype_argument for more information on this). */
8844 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8845 int entering_scope
, tsubst_flags_t complain
)
8847 tree templ
= NULL_TREE
, parmlist
;
8854 if (identifier_p (d1
))
8856 tree value
= innermost_non_namespace_value (d1
);
8857 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8862 push_decl_namespace (context
);
8863 templ
= lookup_name (d1
);
8864 templ
= maybe_get_template_decl_from_type_decl (templ
);
8866 pop_decl_namespace ();
8869 context
= DECL_CONTEXT (templ
);
8871 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8873 tree type
= TREE_TYPE (d1
);
8875 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8876 an implicit typename for the second A. Deal with it. */
8877 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8878 type
= TREE_TYPE (type
);
8880 if (CLASSTYPE_TEMPLATE_INFO (type
))
8882 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8883 d1
= DECL_NAME (templ
);
8886 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8887 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8889 templ
= TYPE_TI_TEMPLATE (d1
);
8890 d1
= DECL_NAME (templ
);
8892 else if (DECL_TYPE_TEMPLATE_P (d1
))
8895 d1
= DECL_NAME (templ
);
8896 context
= DECL_CONTEXT (templ
);
8898 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8901 d1
= DECL_NAME (templ
);
8904 /* Issue an error message if we didn't find a template. */
8907 if (complain
& tf_error
)
8908 error ("%qT is not a template", d1
);
8909 return error_mark_node
;
8912 if (TREE_CODE (templ
) != TEMPLATE_DECL
8913 /* Make sure it's a user visible template, if it was named by
8915 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8916 && !PRIMARY_TEMPLATE_P (templ
)))
8918 if (complain
& tf_error
)
8920 error ("non-template type %qT used as a template", d1
);
8922 error ("for template declaration %q+D", in_decl
);
8924 return error_mark_node
;
8927 complain
&= ~tf_user
;
8929 /* An alias that just changes the name of a template is equivalent to the
8930 other template, so if any of the arguments are pack expansions, strip
8931 the alias to avoid problems with a pack expansion passed to a non-pack
8932 alias template parameter (DR 1430). */
8933 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8934 templ
= get_underlying_template (templ
);
8936 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8939 tree arglist2
= coerce_template_args_for_ttp (templ
, arglist
, complain
);
8940 if (arglist2
== error_mark_node
8941 || (!uses_template_parms (arglist2
)
8942 && check_instantiated_args (templ
, arglist2
, complain
)))
8943 return error_mark_node
;
8945 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8950 tree template_type
= TREE_TYPE (templ
);
8953 tree found
= NULL_TREE
;
8956 int is_dependent_type
;
8957 int use_partial_inst_tmpl
= false;
8959 if (template_type
== error_mark_node
)
8960 /* An error occurred while building the template TEMPL, and a
8961 diagnostic has most certainly been emitted for that
8962 already. Let's propagate that error. */
8963 return error_mark_node
;
8965 gen_tmpl
= most_general_template (templ
);
8966 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8967 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8968 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8970 if (arg_depth
== 1 && parm_depth
> 1)
8972 /* We've been given an incomplete set of template arguments.
8975 template <class T> struct S1 {
8976 template <class U> struct S2 {};
8977 template <class U> struct S2<U*> {};
8980 we will be called with an ARGLIST of `U*', but the
8981 TEMPLATE will be `template <class T> template
8982 <class U> struct S1<T>::S2'. We must fill in the missing
8984 tree ti
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (templ
));
8985 arglist
= add_outermost_template_args (TI_ARGS (ti
), arglist
);
8986 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8989 /* Now we should have enough arguments. */
8990 gcc_assert (parm_depth
== arg_depth
);
8992 /* From here on, we're only interested in the most general
8995 /* Calculate the BOUND_ARGS. These will be the args that are
8996 actually tsubst'd into the definition to create the
8998 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
9000 /*require_all_args=*/true,
9001 /*use_default_args=*/true);
9003 if (arglist
== error_mark_node
)
9004 /* We were unable to bind the arguments. */
9005 return error_mark_node
;
9007 /* In the scope of a template class, explicit references to the
9008 template class refer to the type of the template, not any
9009 instantiation of it. For example, in:
9011 template <class T> class C { void f(C<T>); }
9013 the `C<T>' is just the same as `C'. Outside of the
9014 class, however, such a reference is an instantiation. */
9016 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
9017 || currently_open_class (template_type
))
9019 tree tinfo
= TYPE_TEMPLATE_INFO (template_type
);
9021 if (tinfo
&& comp_template_args (TI_ARGS (tinfo
), arglist
))
9022 return template_type
;
9025 /* If we already have this specialization, return it. */
9026 elt
.tmpl
= gen_tmpl
;
9028 elt
.spec
= NULL_TREE
;
9029 hash
= spec_hasher::hash (&elt
);
9030 entry
= type_specializations
->find_with_hash (&elt
, hash
);
9035 /* If the the template's constraints are not satisfied,
9036 then we cannot form a valid type.
9038 Note that the check is deferred until after the hash
9039 lookup. This prevents redundant checks on previously
9040 instantiated specializations. */
9041 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
9043 if (complain
& tf_error
)
9045 error ("template constraint failure");
9046 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
9048 return error_mark_node
;
9051 is_dependent_type
= uses_template_parms (arglist
);
9053 /* If the deduced arguments are invalid, then the binding
9055 if (!is_dependent_type
9056 && check_instantiated_args (gen_tmpl
,
9057 INNERMOST_TEMPLATE_ARGS (arglist
),
9059 return error_mark_node
;
9061 if (!is_dependent_type
9062 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
9063 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
9064 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
9066 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
9067 DECL_NAME (gen_tmpl
),
9068 /*tag_scope=*/ts_global
);
9072 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
9074 if (context
== error_mark_node
)
9075 return error_mark_node
;
9078 context
= global_namespace
;
9080 /* Create the type. */
9081 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9083 /* The user referred to a specialization of an alias
9084 template represented by GEN_TMPL.
9086 [temp.alias]/2 says:
9088 When a template-id refers to the specialization of an
9089 alias template, it is equivalent to the associated
9090 type obtained by substitution of its
9091 template-arguments for the template-parameters in the
9092 type-id of the alias template. */
9094 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
9095 /* Note that the call above (by indirectly calling
9096 register_specialization in tsubst_decl) registers the
9097 TYPE_DECL representing the specialization of the alias
9098 template. So next time someone substitutes ARGLIST for
9099 the template parms into the alias template (GEN_TMPL),
9100 she'll get that TYPE_DECL back. */
9102 if (t
== error_mark_node
)
9105 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
9107 if (!is_dependent_type
)
9109 set_current_access_from_decl (TYPE_NAME (template_type
));
9110 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
9111 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
9112 arglist
, complain
, in_decl
),
9113 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
9114 arglist
, complain
, in_decl
),
9115 SCOPED_ENUM_P (template_type
), NULL
);
9117 if (t
== error_mark_node
)
9122 /* We don't want to call start_enum for this type, since
9123 the values for the enumeration constants may involve
9124 template parameters. And, no one should be interested
9125 in the enumeration constants for such a type. */
9126 t
= cxx_make_type (ENUMERAL_TYPE
);
9127 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
9129 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
9130 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
9131 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
9133 else if (CLASS_TYPE_P (template_type
))
9135 /* Lambda closures are regenerated in tsubst_lambda_expr, not
9136 instantiated here. */
9137 gcc_assert (!LAMBDA_TYPE_P (template_type
));
9139 t
= make_class_type (TREE_CODE (template_type
));
9140 CLASSTYPE_DECLARED_CLASS (t
)
9141 = CLASSTYPE_DECLARED_CLASS (template_type
);
9142 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
9144 /* A local class. Make sure the decl gets registered properly. */
9145 if (context
== current_function_decl
)
9146 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
9148 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
9149 /* This instantiation is another name for the primary
9150 template type. Set the TYPE_CANONICAL field
9152 TYPE_CANONICAL (t
) = template_type
;
9153 else if (any_template_arguments_need_structural_equality_p (arglist
))
9154 /* Some of the template arguments require structural
9155 equality testing, so this template class requires
9156 structural equality testing. */
9157 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9162 /* If we called start_enum or pushtag above, this information
9163 will already be set up. */
9166 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
9168 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
9169 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
9170 DECL_SOURCE_LOCATION (type_decl
)
9171 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
9174 type_decl
= TYPE_NAME (t
);
9176 if (CLASS_TYPE_P (template_type
))
9178 TREE_PRIVATE (type_decl
)
9179 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
9180 TREE_PROTECTED (type_decl
)
9181 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
9182 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
9184 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
9185 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
9189 if (OVERLOAD_TYPE_P (t
)
9190 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9192 static const char *tags
[] = {"abi_tag", "may_alias"};
9194 for (unsigned ix
= 0; ix
!= 2; ix
++)
9197 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
9201 = tree_cons (TREE_PURPOSE (attributes
),
9202 TREE_VALUE (attributes
),
9203 TYPE_ATTRIBUTES (t
));
9207 /* Let's consider the explicit specialization of a member
9208 of a class template specialization that is implicitly instantiated,
9213 template<class U> struct M {}; //#0
9218 struct S<int>::M<char> //#1
9222 [temp.expl.spec]/4 says this is valid.
9224 In this case, when we write:
9227 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
9230 When we encounter #1, we want to store the partial instantiation
9231 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
9233 For all cases other than this "explicit specialization of member of a
9234 class template", we just want to store the most general template into
9235 the CLASSTYPE_TI_TEMPLATE of M.
9237 This case of "explicit specialization of member of a class template"
9239 1/ the enclosing class is an instantiation of, and therefore not
9240 the same as, the context of the most general template, and
9241 2/ we aren't looking at the partial instantiation itself, i.e.
9242 the innermost arguments are not the same as the innermost parms of
9243 the most general template.
9245 So it's only when 1/ and 2/ happens that we want to use the partial
9246 instantiation of the member template in lieu of its most general
9249 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
9250 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
9251 /* the enclosing class must be an instantiation... */
9252 && CLASS_TYPE_P (context
)
9253 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
9255 TREE_VEC_LENGTH (arglist
)--;
9256 ++processing_template_decl
;
9257 tree tinfo
= TYPE_TEMPLATE_INFO_MAYBE_ALIAS (TREE_TYPE (gen_tmpl
));
9258 tree partial_inst_args
=
9259 tsubst (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
)),
9260 arglist
, complain
, NULL_TREE
);
9261 --processing_template_decl
;
9262 TREE_VEC_LENGTH (arglist
)++;
9263 if (partial_inst_args
== error_mark_node
)
9264 return error_mark_node
;
9265 use_partial_inst_tmpl
=
9266 /*...and we must not be looking at the partial instantiation
9268 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
9272 if (!use_partial_inst_tmpl
)
9273 /* This case is easy; there are no member templates involved. */
9277 /* This is a full instantiation of a member template. Find
9278 the partial instantiation of which this is an instance. */
9280 /* Temporarily reduce by one the number of levels in the ARGLIST
9281 so as to avoid comparing the last set of arguments. */
9282 TREE_VEC_LENGTH (arglist
)--;
9283 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
9284 TREE_VEC_LENGTH (arglist
)++;
9285 /* FOUND is either a proper class type, or an alias
9286 template specialization. In the later case, it's a
9287 TYPE_DECL, resulting from the substituting of arguments
9288 for parameters in the TYPE_DECL of the alias template
9289 done earlier. So be careful while getting the template
9291 found
= (TREE_CODE (found
) == TEMPLATE_DECL
9293 : (TREE_CODE (found
) == TYPE_DECL
9294 ? DECL_TI_TEMPLATE (found
)
9295 : CLASSTYPE_TI_TEMPLATE (found
)));
9298 // Build template info for the new specialization.
9299 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
9302 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
9303 entry
= ggc_alloc
<spec_entry
> ();
9307 /* Note this use of the partial instantiation so we can check it
9308 later in maybe_process_partial_specialization. */
9309 DECL_TEMPLATE_INSTANTIATIONS (found
)
9310 = tree_cons (arglist
, t
,
9311 DECL_TEMPLATE_INSTANTIATIONS (found
));
9313 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
9314 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
9315 /* Now that the type has been registered on the instantiations
9316 list, we set up the enumerators. Because the enumeration
9317 constants may involve the enumeration type itself, we make
9318 sure to register the type first, and then create the
9319 constants. That way, doing tsubst_expr for the enumeration
9320 constants won't result in recursive calls here; we'll find
9321 the instantiation and exit above. */
9322 tsubst_enum (template_type
, t
, arglist
);
9324 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
9325 /* If the type makes use of template parameters, the
9326 code that generates debugging information will crash. */
9327 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
9329 /* Possibly limit visibility based on template args. */
9330 TREE_PUBLIC (type_decl
) = 1;
9331 determine_visibility (type_decl
);
9333 inherit_targ_abi_tags (t
);
9339 /* Wrapper for lookup_template_class_1. */
9342 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
9343 int entering_scope
, tsubst_flags_t complain
)
9346 timevar_push (TV_TEMPLATE_INST
);
9347 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
9348 entering_scope
, complain
);
9349 timevar_pop (TV_TEMPLATE_INST
);
9353 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
9356 lookup_template_variable (tree templ
, tree arglist
)
9358 /* The type of the expression is NULL_TREE since the template-id could refer
9359 to an explicit or partial specialization. */
9360 tree type
= NULL_TREE
;
9361 if (flag_concepts
&& variable_concept_p (templ
))
9362 /* Except that concepts are always bool. */
9363 type
= boolean_type_node
;
9364 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
9367 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
9370 finish_template_variable (tree var
, tsubst_flags_t complain
)
9372 tree templ
= TREE_OPERAND (var
, 0);
9373 tree arglist
= TREE_OPERAND (var
, 1);
9375 /* We never want to return a VAR_DECL for a variable concept, since they
9376 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
9377 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
9378 if (concept_p
&& processing_template_decl
)
9381 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
9382 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
9384 templ
= most_general_template (templ
);
9385 tree parms
= DECL_TEMPLATE_PARMS (templ
);
9386 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
9388 /*use_default*/true);
9390 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
9392 if (complain
& tf_error
)
9394 error ("use of invalid variable template %qE", var
);
9395 diagnose_constraints (location_of (var
), templ
, arglist
);
9397 return error_mark_node
;
9400 /* If a template-id refers to a specialization of a variable
9401 concept, then the expression is true if and only if the
9402 concept's constraints are satisfied by the given template
9405 NOTE: This is an extension of Concepts Lite TS that
9406 allows constraints to be used in expressions. */
9409 tree decl
= DECL_TEMPLATE_RESULT (templ
);
9410 return evaluate_variable_concept (decl
, arglist
);
9413 return instantiate_template (templ
, arglist
, complain
);
9416 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
9417 TARGS template args, and instantiate it if it's not dependent. */
9420 lookup_and_finish_template_variable (tree templ
, tree targs
,
9421 tsubst_flags_t complain
)
9423 templ
= lookup_template_variable (templ
, targs
);
9424 if (!any_dependent_template_arguments_p (targs
))
9426 templ
= finish_template_variable (templ
, complain
);
9430 return convert_from_reference (templ
);
9439 /* True when we should also visit template parameters that occur in
9440 non-deduced contexts. */
9441 bool include_nondeduced_p
;
9442 hash_set
<tree
> *visited
;
9445 /* Called from for_each_template_parm via walk_tree. */
9448 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
9451 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
9452 tree_fn_t fn
= pfd
->fn
;
9453 void *data
= pfd
->data
;
9454 tree result
= NULL_TREE
;
9456 #define WALK_SUBTREE(NODE) \
9459 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
9460 pfd->include_nondeduced_p, \
9462 if (result) goto out; \
9466 if (pfd
->any_fn
&& (*pfd
->any_fn
)(t
, data
))
9470 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
9471 WALK_SUBTREE (TYPE_CONTEXT (t
));
9473 switch (TREE_CODE (t
))
9476 if (TYPE_PTRMEMFUNC_P (t
))
9482 if (!TYPE_TEMPLATE_INFO (t
))
9485 WALK_SUBTREE (TYPE_TI_ARGS (t
));
9489 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
9490 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
9494 /* Since we're not going to walk subtrees, we have to do this
9496 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
9500 /* Check the return type. */
9501 WALK_SUBTREE (TREE_TYPE (t
));
9503 /* Check the parameter types. Since default arguments are not
9504 instantiated until they are needed, the TYPE_ARG_TYPES may
9505 contain expressions that involve template parameters. But,
9506 no-one should be looking at them yet. And, once they're
9507 instantiated, they don't contain template parameters, so
9508 there's no point in looking at them then, either. */
9512 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
9513 WALK_SUBTREE (TREE_VALUE (parm
));
9515 /* Since we've already handled the TYPE_ARG_TYPES, we don't
9516 want walk_tree walking into them itself. */
9520 if (flag_noexcept_type
)
9522 tree spec
= TYPE_RAISES_EXCEPTIONS (t
);
9524 WALK_SUBTREE (TREE_PURPOSE (spec
));
9529 case UNDERLYING_TYPE
:
9530 if (pfd
->include_nondeduced_p
9531 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
9533 pfd
->include_nondeduced_p
,
9535 return error_mark_node
;
9540 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
9541 WALK_SUBTREE (DECL_TI_ARGS (t
));
9546 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
9547 WALK_SUBTREE (DECL_INITIAL (t
));
9548 if (DECL_CONTEXT (t
)
9549 && pfd
->include_nondeduced_p
)
9550 WALK_SUBTREE (DECL_CONTEXT (t
));
9553 case BOUND_TEMPLATE_TEMPLATE_PARM
:
9554 /* Record template parameters such as `T' inside `TT<T>'. */
9555 WALK_SUBTREE (TYPE_TI_ARGS (t
));
9558 case TEMPLATE_TEMPLATE_PARM
:
9559 case TEMPLATE_TYPE_PARM
:
9560 case TEMPLATE_PARM_INDEX
:
9561 if (fn
&& (*fn
)(t
, data
))
9568 /* A template template parameter is encountered. */
9569 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9570 WALK_SUBTREE (TREE_TYPE (t
));
9572 /* Already substituted template template parameter */
9577 /* A template-id in a TYPENAME_TYPE might be a deduced context after
9578 partial instantiation. */
9579 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
9583 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
9584 && pfd
->include_nondeduced_p
)
9585 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
9590 /* If there's no type, then this thing must be some expression
9591 involving template parameters. */
9592 if (!fn
&& !TREE_TYPE (t
))
9593 return error_mark_node
;
9598 case IMPLICIT_CONV_EXPR
:
9599 case REINTERPRET_CAST_EXPR
:
9600 case CONST_CAST_EXPR
:
9601 case STATIC_CAST_EXPR
:
9602 case DYNAMIC_CAST_EXPR
:
9606 case PSEUDO_DTOR_EXPR
:
9608 return error_mark_node
;
9617 /* We didn't find any template parameters we liked. */
9622 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
9623 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
9624 call FN with the parameter and the DATA.
9625 If FN returns nonzero, the iteration is terminated, and
9626 for_each_template_parm returns 1. Otherwise, the iteration
9627 continues. If FN never returns a nonzero value, the value
9628 returned by for_each_template_parm is 0. If FN is NULL, it is
9629 considered to be the function which always returns 1.
9631 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
9632 parameters that occur in non-deduced contexts. When false, only
9633 visits those template parameters that can be deduced. */
9636 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
9637 hash_set
<tree
> *visited
,
9638 bool include_nondeduced_p
,
9641 struct pair_fn_data pfd
;
9646 pfd
.any_fn
= any_fn
;
9648 pfd
.include_nondeduced_p
= include_nondeduced_p
;
9650 /* Walk the tree. (Conceptually, we would like to walk without
9651 duplicates, but for_each_template_parm_r recursively calls
9652 for_each_template_parm, so we would need to reorganize a fair
9653 bit to use walk_tree_without_duplicates, so we keep our own
9656 pfd
.visited
= visited
;
9658 pfd
.visited
= new hash_set
<tree
>;
9659 result
= cp_walk_tree (&t
,
9660 for_each_template_parm_r
,
9674 /* Returns true if T depends on any template parameter. */
9677 uses_template_parms (tree t
)
9683 int saved_processing_template_decl
;
9685 saved_processing_template_decl
= processing_template_decl
;
9686 if (!saved_processing_template_decl
)
9687 processing_template_decl
= 1;
9689 dependent_p
= dependent_type_p (t
);
9690 else if (TREE_CODE (t
) == TREE_VEC
)
9691 dependent_p
= any_dependent_template_arguments_p (t
);
9692 else if (TREE_CODE (t
) == TREE_LIST
)
9693 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
9694 || uses_template_parms (TREE_CHAIN (t
)));
9695 else if (TREE_CODE (t
) == TYPE_DECL
)
9696 dependent_p
= dependent_type_p (TREE_TYPE (t
));
9699 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
9700 || TREE_CODE (t
) == OVERLOAD
9703 || TREE_CODE (t
) == TRAIT_EXPR
9704 || TREE_CODE (t
) == CONSTRUCTOR
9705 || CONSTANT_CLASS_P (t
))
9706 dependent_p
= (type_dependent_expression_p (t
)
9707 || value_dependent_expression_p (t
));
9710 gcc_assert (t
== error_mark_node
);
9711 dependent_p
= false;
9714 processing_template_decl
= saved_processing_template_decl
;
9719 /* Returns true iff current_function_decl is an incompletely instantiated
9720 template. Useful instead of processing_template_decl because the latter
9721 is set to 0 during instantiate_non_dependent_expr. */
9724 in_template_function (void)
9726 tree fn
= current_function_decl
;
9728 ++processing_template_decl
;
9729 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
9730 && DECL_TEMPLATE_INFO (fn
)
9731 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
9732 --processing_template_decl
;
9736 /* Returns true if T depends on any template parameter with level LEVEL. */
9739 uses_template_parms_level (tree t
, int level
)
9741 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
9742 /*include_nondeduced_p=*/true);
9745 /* Returns true if the signature of DECL depends on any template parameter from
9746 its enclosing class. */
9749 uses_outer_template_parms (tree decl
)
9751 int depth
= template_class_depth (CP_DECL_CONTEXT (decl
));
9754 if (for_each_template_parm (TREE_TYPE (decl
), template_parm_outer_level
,
9755 &depth
, NULL
, /*include_nondeduced_p=*/true))
9757 if (PRIMARY_TEMPLATE_P (decl
)
9758 && for_each_template_parm (INNERMOST_TEMPLATE_PARMS
9759 (DECL_TEMPLATE_PARMS (decl
)),
9760 template_parm_outer_level
,
9761 &depth
, NULL
, /*include_nondeduced_p=*/true))
9763 tree ci
= get_constraints (decl
);
9765 ci
= CI_ASSOCIATED_CONSTRAINTS (ci
);
9766 if (ci
&& for_each_template_parm (ci
, template_parm_outer_level
,
9767 &depth
, NULL
, /*nondeduced*/true))
9772 /* Returns TRUE iff INST is an instantiation we don't need to do in an
9773 ill-formed translation unit, i.e. a variable or function that isn't
9774 usable in a constant expression. */
9777 neglectable_inst_p (tree d
)
9780 && !undeduced_auto_decl (d
)
9781 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
9782 : decl_maybe_constant_var_p (d
)));
9785 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9786 neglectable and instantiated from within an erroneous instantiation. */
9789 limit_bad_template_recursion (tree decl
)
9791 struct tinst_level
*lev
= current_tinst_level
;
9792 int errs
= errorcount
+ sorrycount
;
9793 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9796 for (; lev
; lev
= lev
->next
)
9797 if (neglectable_inst_p (lev
->decl
))
9800 return (lev
&& errs
> lev
->errors
);
9803 static int tinst_depth
;
9804 extern int max_tinst_depth
;
9807 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9809 /* We're starting to instantiate D; record the template instantiation context
9810 for diagnostics and to restore it later. */
9813 push_tinst_level (tree d
)
9815 return push_tinst_level_loc (d
, input_location
);
9818 /* We're starting to instantiate D; record the template instantiation context
9819 at LOC for diagnostics and to restore it later. */
9822 push_tinst_level_loc (tree d
, location_t loc
)
9824 struct tinst_level
*new_level
;
9826 if (tinst_depth
>= max_tinst_depth
)
9828 /* Tell error.c not to try to instantiate any templates. */
9830 fatal_error (input_location
,
9831 "template instantiation depth exceeds maximum of %d"
9832 " (use -ftemplate-depth= to increase the maximum)",
9837 /* If the current instantiation caused problems, don't let it instantiate
9838 anything else. Do allow deduction substitution and decls usable in
9839 constant expressions. */
9840 if (limit_bad_template_recursion (d
))
9843 /* When not -quiet, dump template instantiations other than functions, since
9844 announce_function will take care of those. */
9846 && TREE_CODE (d
) != TREE_LIST
9847 && TREE_CODE (d
) != FUNCTION_DECL
)
9848 fprintf (stderr
, " %s", decl_as_string (d
, TFF_DECL_SPECIFIERS
));
9850 new_level
= ggc_alloc
<tinst_level
> ();
9851 new_level
->decl
= d
;
9852 new_level
->locus
= loc
;
9853 new_level
->errors
= errorcount
+sorrycount
;
9854 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9855 new_level
->next
= current_tinst_level
;
9856 current_tinst_level
= new_level
;
9859 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9860 depth_reached
= tinst_depth
;
9865 /* We're done instantiating this template; return to the instantiation
9869 pop_tinst_level (void)
9871 /* Restore the filename and line number stashed away when we started
9872 this instantiation. */
9873 input_location
= current_tinst_level
->locus
;
9874 current_tinst_level
= current_tinst_level
->next
;
9878 /* We're instantiating a deferred template; restore the template
9879 instantiation context in which the instantiation was requested, which
9880 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9883 reopen_tinst_level (struct tinst_level
*level
)
9885 struct tinst_level
*t
;
9888 for (t
= level
; t
; t
= t
->next
)
9891 current_tinst_level
= level
;
9893 if (current_tinst_level
)
9894 current_tinst_level
->errors
= errorcount
+sorrycount
;
9898 /* Returns the TINST_LEVEL which gives the original instantiation
9901 struct tinst_level
*
9902 outermost_tinst_level (void)
9904 struct tinst_level
*level
= current_tinst_level
;
9907 level
= level
->next
;
9911 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9912 vector of template arguments, as for tsubst.
9914 Returns an appropriate tsubst'd friend declaration. */
9917 tsubst_friend_function (tree decl
, tree args
)
9921 if (TREE_CODE (decl
) == FUNCTION_DECL
9922 && DECL_TEMPLATE_INSTANTIATION (decl
)
9923 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9924 /* This was a friend declared with an explicit template
9925 argument list, e.g.:
9929 to indicate that f was a template instantiation, not a new
9930 function declaration. Now, we have to figure out what
9931 instantiation of what template. */
9933 tree template_id
, arglist
, fns
;
9936 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9938 /* Friend functions are looked up in the containing namespace scope.
9939 We must enter that scope, to avoid finding member functions of the
9940 current class with same name. */
9941 push_nested_namespace (ns
);
9942 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9943 tf_warning_or_error
, NULL_TREE
,
9944 /*integral_constant_expression_p=*/false);
9945 pop_nested_namespace (ns
);
9946 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9947 tf_warning_or_error
, NULL_TREE
);
9948 template_id
= lookup_template_function (fns
, arglist
);
9950 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9951 tmpl
= determine_specialization (template_id
, new_friend
,
9953 /*need_member_template=*/0,
9954 TREE_VEC_LENGTH (args
),
9956 return instantiate_template (tmpl
, new_args
, tf_error
);
9959 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9961 /* The NEW_FRIEND will look like an instantiation, to the
9962 compiler, but is not an instantiation from the point of view of
9963 the language. For example, we might have had:
9965 template <class T> struct S {
9966 template <class U> friend void f(T, U);
9969 Then, in S<int>, template <class U> void f(int, U) is not an
9970 instantiation of anything. */
9971 if (new_friend
== error_mark_node
)
9972 return error_mark_node
;
9974 DECL_USE_TEMPLATE (new_friend
) = 0;
9975 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9977 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9978 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9979 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9982 /* The mangled name for the NEW_FRIEND is incorrect. The function
9983 is not a template instantiation and should not be mangled like
9984 one. Therefore, we forget the mangling here; we'll recompute it
9985 later if we need it. */
9986 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9988 SET_DECL_RTL (new_friend
, NULL
);
9989 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9992 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9995 tree new_friend_template_info
;
9996 tree new_friend_result_template_info
;
9998 int new_friend_is_defn
;
10000 /* We must save some information from NEW_FRIEND before calling
10001 duplicate decls since that function will free NEW_FRIEND if
10003 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
10004 new_friend_is_defn
=
10005 (DECL_INITIAL (DECL_TEMPLATE_RESULT
10006 (template_for_substitution (new_friend
)))
10008 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
10010 /* This declaration is a `primary' template. */
10011 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
10013 new_friend_result_template_info
10014 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
10017 new_friend_result_template_info
= NULL_TREE
;
10019 /* Inside pushdecl_namespace_level, we will push into the
10020 current namespace. However, the friend function should go
10021 into the namespace of the template. */
10022 ns
= decl_namespace_context (new_friend
);
10023 push_nested_namespace (ns
);
10024 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
10025 pop_nested_namespace (ns
);
10027 if (old_decl
== error_mark_node
)
10028 return error_mark_node
;
10030 if (old_decl
!= new_friend
)
10032 /* This new friend declaration matched an existing
10033 declaration. For example, given:
10035 template <class T> void f(T);
10036 template <class U> class C {
10037 template <class T> friend void f(T) {}
10040 the friend declaration actually provides the definition
10041 of `f', once C has been instantiated for some type. So,
10042 old_decl will be the out-of-class template declaration,
10043 while new_friend is the in-class definition.
10045 But, if `f' was called before this point, the
10046 instantiation of `f' will have DECL_TI_ARGS corresponding
10047 to `T' but not to `U', references to which might appear
10048 in the definition of `f'. Previously, the most general
10049 template for an instantiation of `f' was the out-of-class
10050 version; now it is the in-class version. Therefore, we
10051 run through all specialization of `f', adding to their
10052 DECL_TI_ARGS appropriately. In particular, they need a
10053 new set of outer arguments, corresponding to the
10054 arguments for this class instantiation.
10056 The same situation can arise with something like this:
10058 friend void f(int);
10059 template <class T> class C {
10060 friend void f(T) {}
10063 when `C<int>' is instantiated. Now, `f(int)' is defined
10066 if (!new_friend_is_defn
)
10067 /* On the other hand, if the in-class declaration does
10068 *not* provide a definition, then we don't want to alter
10069 existing definitions. We can just leave everything
10074 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
10075 tree new_args
= TI_ARGS (new_friend_template_info
);
10077 /* Overwrite whatever template info was there before, if
10078 any, with the new template information pertaining to
10079 the declaration. */
10080 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
10082 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
10084 /* We should have called reregister_specialization in
10085 duplicate_decls. */
10086 gcc_assert (retrieve_specialization (new_template
,
10090 /* Instantiate it if the global has already been used. */
10091 if (DECL_ODR_USED (old_decl
))
10092 instantiate_decl (old_decl
, /*defer_ok=*/true,
10093 /*expl_inst_class_mem_p=*/false);
10099 /* Indicate that the old function template is a partial
10101 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
10102 = new_friend_result_template_info
;
10104 gcc_assert (new_template
10105 == most_general_template (new_template
));
10106 gcc_assert (new_template
!= old_decl
);
10108 /* Reassign any specializations already in the hash table
10109 to the new more general template, and add the
10110 additional template args. */
10111 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
10113 t
= TREE_CHAIN (t
))
10115 tree spec
= TREE_VALUE (t
);
10118 elt
.tmpl
= old_decl
;
10119 elt
.args
= DECL_TI_ARGS (spec
);
10120 elt
.spec
= NULL_TREE
;
10122 decl_specializations
->remove_elt (&elt
);
10124 DECL_TI_ARGS (spec
)
10125 = add_outermost_template_args (new_args
,
10126 DECL_TI_ARGS (spec
));
10128 register_specialization
10129 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
10132 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
10136 /* The information from NEW_FRIEND has been merged into OLD_DECL
10137 by duplicate_decls. */
10138 new_friend
= old_decl
;
10143 tree context
= DECL_CONTEXT (new_friend
);
10147 template <class T> class C {
10148 template <class U> friend void C1<U>::f (); // case 1
10149 friend void C2<T>::f (); // case 2
10151 we only need to make sure CONTEXT is a complete type for
10152 case 2. To distinguish between the two cases, we note that
10153 CONTEXT of case 1 remains dependent type after tsubst while
10154 this isn't true for case 2. */
10155 ++processing_template_decl
;
10156 dependent_p
= dependent_type_p (context
);
10157 --processing_template_decl
;
10160 && !complete_type_or_else (context
, NULL_TREE
))
10161 return error_mark_node
;
10163 if (COMPLETE_TYPE_P (context
))
10165 tree fn
= new_friend
;
10166 /* do_friend adds the TEMPLATE_DECL for any member friend
10167 template even if it isn't a member template, i.e.
10168 template <class T> friend A<T>::f();
10169 Look through it in that case. */
10170 if (TREE_CODE (fn
) == TEMPLATE_DECL
10171 && !PRIMARY_TEMPLATE_P (fn
))
10172 fn
= DECL_TEMPLATE_RESULT (fn
);
10173 /* Check to see that the declaration is really present, and,
10174 possibly obtain an improved declaration. */
10175 fn
= check_classfn (context
, fn
, NULL_TREE
);
10185 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
10186 template arguments, as for tsubst.
10188 Returns an appropriate tsubst'd friend type or error_mark_node on
10192 tsubst_friend_class (tree friend_tmpl
, tree args
)
10196 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
10198 tmpl
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
10199 return TREE_TYPE (tmpl
);
10202 tree context
= CP_DECL_CONTEXT (friend_tmpl
);
10203 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10204 push_nested_namespace (context
);
10206 push_nested_class (context
);
10208 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), /*prefer_type=*/false,
10209 /*non_class=*/false, /*block_p=*/false,
10210 /*namespaces_only=*/false, LOOKUP_HIDDEN
);
10212 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
10214 /* The friend template has already been declared. Just
10215 check to see that the declarations match, and install any new
10216 default parameters. We must tsubst the default parameters,
10217 of course. We only need the innermost template parameters
10218 because that is all that redeclare_class_template will look
10220 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
10221 > TMPL_ARGS_DEPTH (args
))
10223 tree parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
10224 args
, tf_warning_or_error
);
10225 location_t saved_input_location
= input_location
;
10226 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
10227 tree cons
= get_constraints (tmpl
);
10228 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
10229 input_location
= saved_input_location
;
10234 /* The friend template has not already been declared. In this
10235 case, the instantiation of the template class will cause the
10236 injection of this template into the namespace scope. */
10237 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
10239 if (tmpl
!= error_mark_node
)
10241 /* The new TMPL is not an instantiation of anything, so we
10242 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE
10243 for the new type because that is supposed to be the
10244 corresponding template decl, i.e., TMPL. */
10245 DECL_USE_TEMPLATE (tmpl
) = 0;
10246 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
10247 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
10248 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
10249 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
10251 /* It is hidden. */
10252 retrofit_lang_decl (DECL_TEMPLATE_RESULT (tmpl
));
10253 DECL_ANTICIPATED (tmpl
)
10254 = DECL_ANTICIPATED (DECL_TEMPLATE_RESULT (tmpl
)) = true;
10256 /* Inject this template into the enclosing namspace scope. */
10257 tmpl
= pushdecl_namespace_level (tmpl
, true);
10261 if (TREE_CODE (context
) == NAMESPACE_DECL
)
10262 pop_nested_namespace (context
);
10264 pop_nested_class ();
10266 return TREE_TYPE (tmpl
);
10269 /* Returns zero if TYPE cannot be completed later due to circularity.
10270 Otherwise returns one. */
10273 can_complete_type_without_circularity (tree type
)
10275 if (type
== NULL_TREE
|| type
== error_mark_node
)
10277 else if (COMPLETE_TYPE_P (type
))
10279 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10280 return can_complete_type_without_circularity (TREE_TYPE (type
));
10281 else if (CLASS_TYPE_P (type
)
10282 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
10288 static tree
tsubst_omp_clauses (tree
, enum c_omp_region_type
, tree
,
10289 tsubst_flags_t
, tree
);
10291 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
10292 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
10295 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
10296 tsubst_flags_t complain
, tree in_decl
)
10298 gcc_assert (ATTR_IS_DEPENDENT (t
));
10300 tree val
= TREE_VALUE (t
);
10301 if (val
== NULL_TREE
)
10302 /* Nothing to do. */;
10303 else if ((flag_openmp
|| flag_openmp_simd
)
10304 && is_attribute_p ("omp declare simd",
10305 get_attribute_name (t
)))
10307 tree clauses
= TREE_VALUE (val
);
10308 clauses
= tsubst_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
, args
,
10309 complain
, in_decl
);
10310 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
10311 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
10312 tree parms
= DECL_ARGUMENTS (*decl_p
);
10314 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
10316 val
= build_tree_list (NULL_TREE
, clauses
);
10320 /* If the first attribute argument is an identifier, don't
10321 pass it through tsubst. Attributes like mode, format,
10322 cleanup and several target specific attributes expect it
10324 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
10327 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
10328 /*integral_constant_expression_p=*/false);
10329 if (chain
!= TREE_CHAIN (val
))
10330 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
10332 else if (PACK_EXPANSION_P (val
))
10334 /* An attribute pack expansion. */
10335 tree purp
= TREE_PURPOSE (t
);
10336 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
10337 if (pack
== error_mark_node
)
10338 return error_mark_node
;
10339 int len
= TREE_VEC_LENGTH (pack
);
10340 tree list
= NULL_TREE
;
10342 for (int i
= 0; i
< len
; ++i
)
10344 tree elt
= TREE_VEC_ELT (pack
, i
);
10345 *q
= build_tree_list (purp
, elt
);
10346 q
= &TREE_CHAIN (*q
);
10351 val
= tsubst_expr (val
, args
, complain
, in_decl
,
10352 /*integral_constant_expression_p=*/false);
10354 if (val
!= TREE_VALUE (t
))
10355 return build_tree_list (TREE_PURPOSE (t
), val
);
10359 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
10360 unchanged or a new TREE_LIST chain. */
10363 tsubst_attributes (tree attributes
, tree args
,
10364 tsubst_flags_t complain
, tree in_decl
)
10366 tree last_dep
= NULL_TREE
;
10368 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
10369 if (ATTR_IS_DEPENDENT (t
))
10372 attributes
= copy_list (attributes
);
10377 for (tree
*p
= &attributes
; *p
; )
10380 if (ATTR_IS_DEPENDENT (t
))
10382 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
10387 p
= &TREE_CHAIN (*p
);
10388 *p
= TREE_CHAIN (t
);
10392 p
= &TREE_CHAIN (*p
);
10398 /* Apply any attributes which had to be deferred until instantiation
10399 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
10400 ARGS, COMPLAIN, IN_DECL are as tsubst. */
10403 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
10404 tree args
, tsubst_flags_t complain
, tree in_decl
)
10406 tree last_dep
= NULL_TREE
;
10410 if (attributes
== NULL_TREE
)
10413 if (DECL_P (*decl_p
))
10415 if (TREE_TYPE (*decl_p
) == error_mark_node
)
10417 p
= &DECL_ATTRIBUTES (*decl_p
);
10418 /* DECL_ATTRIBUTES comes from copy_node in tsubst_decl, and is identical
10419 to our attributes parameter. */
10420 gcc_assert (*p
== attributes
);
10424 p
= &TYPE_ATTRIBUTES (*decl_p
);
10425 /* TYPE_ATTRIBUTES was set up (with abi_tag and may_alias) in
10426 lookup_template_class_1, and should be preserved. */
10427 gcc_assert (*p
!= attributes
);
10429 p
= &TREE_CHAIN (*p
);
10432 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
10433 if (ATTR_IS_DEPENDENT (t
))
10436 attributes
= copy_list (attributes
);
10443 tree late_attrs
= NULL_TREE
;
10444 tree
*q
= &late_attrs
;
10449 if (ATTR_IS_DEPENDENT (t
))
10451 *p
= TREE_CHAIN (t
);
10452 TREE_CHAIN (t
) = NULL_TREE
;
10453 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
10455 q
= &TREE_CHAIN (*q
);
10458 p
= &TREE_CHAIN (t
);
10461 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
10465 /* Perform (or defer) access check for typedefs that were referenced
10466 from within the template TMPL code.
10467 This is a subroutine of instantiate_decl and instantiate_class_template.
10468 TMPL is the template to consider and TARGS is the list of arguments of
10472 perform_typedefs_access_check (tree tmpl
, tree targs
)
10474 location_t saved_location
;
10476 qualified_typedef_usage_t
*iter
;
10479 || (!CLASS_TYPE_P (tmpl
)
10480 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
10483 saved_location
= input_location
;
10484 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
10486 tree type_decl
= iter
->typedef_decl
;
10487 tree type_scope
= iter
->context
;
10489 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
10492 if (uses_template_parms (type_decl
))
10493 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
10494 if (uses_template_parms (type_scope
))
10495 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
10497 /* Make access check error messages point to the location
10498 of the use of the typedef. */
10499 input_location
= iter
->locus
;
10500 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
10501 type_decl
, type_decl
,
10502 tf_warning_or_error
);
10504 input_location
= saved_location
;
10508 instantiate_class_template_1 (tree type
)
10510 tree templ
, args
, pattern
, t
, member
;
10514 unsigned int saved_maximum_field_alignment
;
10517 if (type
== error_mark_node
)
10518 return error_mark_node
;
10520 if (COMPLETE_OR_OPEN_TYPE_P (type
)
10521 || uses_template_parms (type
))
10524 /* Figure out which template is being instantiated. */
10525 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
10526 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
10528 /* Mark the type as in the process of being defined. */
10529 TYPE_BEING_DEFINED (type
) = 1;
10531 /* Determine what specialization of the original template to
10533 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
10534 if (t
== error_mark_node
)
10535 return error_mark_node
;
10538 /* This TYPE is actually an instantiation of a partial
10539 specialization. We replace the innermost set of ARGS with
10540 the arguments appropriate for substitution. For example,
10543 template <class T> struct S {};
10544 template <class T> struct S<T*> {};
10546 and supposing that we are instantiating S<int*>, ARGS will
10547 presently be {int*} -- but we need {int}. */
10548 pattern
= TREE_TYPE (t
);
10549 args
= TREE_PURPOSE (t
);
10553 pattern
= TREE_TYPE (templ
);
10554 args
= CLASSTYPE_TI_ARGS (type
);
10557 /* If the template we're instantiating is incomplete, then clearly
10558 there's nothing we can do. */
10559 if (!COMPLETE_TYPE_P (pattern
))
10561 /* We can try again later. */
10562 TYPE_BEING_DEFINED (type
) = 0;
10566 /* If we've recursively instantiated too many templates, stop. */
10567 if (! push_tinst_level (type
))
10570 /* We may be in the middle of deferred access check. Disable
10572 push_deferring_access_checks (dk_no_deferred
);
10574 int saved_unevaluated_operand
= cp_unevaluated_operand
;
10575 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10577 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
10578 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
10579 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
10580 fn_context
= error_mark_node
;
10582 push_to_top_level ();
10585 cp_unevaluated_operand
= 0;
10586 c_inhibit_evaluation_warnings
= 0;
10588 /* Use #pragma pack from the template context. */
10589 saved_maximum_field_alignment
= maximum_field_alignment
;
10590 maximum_field_alignment
= TYPE_PRECISION (pattern
);
10592 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
10594 /* Set the input location to the most specialized template definition.
10595 This is needed if tsubsting causes an error. */
10596 typedecl
= TYPE_MAIN_DECL (pattern
);
10597 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
10598 DECL_SOURCE_LOCATION (typedecl
);
10600 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
10601 SET_TYPE_ALIGN (type
, TYPE_ALIGN (pattern
));
10602 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
10603 CLASSTYPE_NON_AGGREGATE (type
) = CLASSTYPE_NON_AGGREGATE (pattern
);
10604 if (ANON_AGGR_TYPE_P (pattern
))
10605 SET_ANON_AGGR_TYPE_P (type
);
10606 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
10608 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
10609 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
10610 /* Adjust visibility for template arguments. */
10611 determine_visibility (TYPE_MAIN_DECL (type
));
10613 if (CLASS_TYPE_P (type
))
10614 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
10616 pbinfo
= TYPE_BINFO (pattern
);
10618 /* We should never instantiate a nested class before its enclosing
10619 class; we need to look up the nested class by name before we can
10620 instantiate it, and that lookup should instantiate the enclosing
10622 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
10623 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
10625 base_list
= NULL_TREE
;
10626 if (BINFO_N_BASE_BINFOS (pbinfo
))
10632 /* We must enter the scope containing the type, as that is where
10633 the accessibility of types named in dependent bases are
10635 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
10637 /* Substitute into each of the bases to determine the actual
10639 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
10642 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
10643 tree expanded_bases
= NULL_TREE
;
10646 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
10649 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
10650 args
, tf_error
, NULL_TREE
);
10651 if (expanded_bases
== error_mark_node
)
10654 len
= TREE_VEC_LENGTH (expanded_bases
);
10657 for (idx
= 0; idx
< len
; idx
++)
10659 if (expanded_bases
)
10660 /* Extract the already-expanded base class. */
10661 base
= TREE_VEC_ELT (expanded_bases
, idx
);
10663 /* Substitute to figure out the base class. */
10664 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
10667 if (base
== error_mark_node
)
10670 base_list
= tree_cons (access
, base
, base_list
);
10671 if (BINFO_VIRTUAL_P (pbase_binfo
))
10672 TREE_TYPE (base_list
) = integer_type_node
;
10676 /* The list is now in reverse order; correct that. */
10677 base_list
= nreverse (base_list
);
10680 pop_scope (pushed_scope
);
10682 /* Now call xref_basetypes to set up all the base-class
10684 xref_basetypes (type
, base_list
);
10686 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
10687 (int) ATTR_FLAG_TYPE_IN_PLACE
,
10688 args
, tf_error
, NULL_TREE
);
10689 fixup_attribute_variants (type
);
10691 /* Now that our base classes are set up, enter the scope of the
10692 class, so that name lookups into base classes, etc. will work
10693 correctly. This is precisely analogous to what we do in
10694 begin_class_definition when defining an ordinary non-template
10695 class, except we also need to push the enclosing classes. */
10696 push_nested_class (type
);
10698 /* Now members are processed in the order of declaration. */
10699 for (member
= CLASSTYPE_DECL_LIST (pattern
);
10700 member
; member
= TREE_CHAIN (member
))
10702 tree t
= TREE_VALUE (member
);
10704 if (TREE_PURPOSE (member
))
10708 if (LAMBDA_TYPE_P (t
))
10709 /* A closure type for a lambda in an NSDMI or default argument.
10710 Ignore it; it will be regenerated when needed. */
10713 /* Build new CLASSTYPE_NESTED_UTDS. */
10716 bool class_template_p
;
10718 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
10719 && TYPE_LANG_SPECIFIC (t
)
10720 && CLASSTYPE_IS_TEMPLATE (t
));
10721 /* If the member is a class template, then -- even after
10722 substitution -- there may be dependent types in the
10723 template argument list for the class. We increment
10724 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
10725 that function will assume that no types are dependent
10726 when outside of a template. */
10727 if (class_template_p
)
10728 ++processing_template_decl
;
10729 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
10730 if (class_template_p
)
10731 --processing_template_decl
;
10732 if (newtag
== error_mark_node
)
10735 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
10737 tree name
= TYPE_IDENTIFIER (t
);
10739 if (class_template_p
)
10740 /* Unfortunately, lookup_template_class sets
10741 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
10742 instantiation (i.e., for the type of a member
10743 template class nested within a template class.)
10744 This behavior is required for
10745 maybe_process_partial_specialization to work
10746 correctly, but is not accurate in this case;
10747 the TAG is not an instantiation of anything.
10748 (The corresponding TEMPLATE_DECL is an
10749 instantiation, but the TYPE is not.) */
10750 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
10752 /* Now, we call pushtag to put this NEWTAG into the scope of
10753 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
10754 pushtag calling push_template_decl. We don't have to do
10755 this for enums because it will already have been done in
10758 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
10759 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
10762 else if (DECL_DECLARES_FUNCTION_P (t
))
10766 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10767 ++processing_template_decl
;
10768 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
10769 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10770 --processing_template_decl
;
10771 set_current_access_from_decl (r
);
10772 finish_member_declaration (r
);
10773 /* Instantiate members marked with attribute used. */
10774 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10776 if (TREE_CODE (r
) == FUNCTION_DECL
10777 && DECL_OMP_DECLARE_REDUCTION_P (r
))
10778 cp_check_omp_declare_reduction (r
);
10780 else if ((DECL_CLASS_TEMPLATE_P (t
) || DECL_IMPLICIT_TYPEDEF_P (t
))
10781 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
10782 /* A closure type for a lambda in an NSDMI or default argument.
10783 Ignore it; it will be regenerated when needed. */;
10786 /* Build new TYPE_FIELDS. */
10787 if (TREE_CODE (t
) == STATIC_ASSERT
)
10791 ++c_inhibit_evaluation_warnings
;
10793 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
10794 tf_warning_or_error
, NULL_TREE
,
10795 /*integral_constant_expression_p=*/true);
10796 --c_inhibit_evaluation_warnings
;
10798 finish_static_assert (condition
,
10799 STATIC_ASSERT_MESSAGE (t
),
10800 STATIC_ASSERT_SOURCE_LOCATION (t
),
10801 /*member_p=*/true);
10803 else if (TREE_CODE (t
) != CONST_DECL
)
10806 tree vec
= NULL_TREE
;
10809 /* The file and line for this declaration, to
10810 assist in error message reporting. Since we
10811 called push_tinst_level above, we don't need to
10813 input_location
= DECL_SOURCE_LOCATION (t
);
10815 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10816 ++processing_template_decl
;
10817 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
10818 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10819 --processing_template_decl
;
10821 if (TREE_CODE (r
) == TREE_VEC
)
10823 /* A capture pack became multiple fields. */
10825 len
= TREE_VEC_LENGTH (vec
);
10828 for (int i
= 0; i
< len
; ++i
)
10831 r
= TREE_VEC_ELT (vec
, i
);
10836 [t]he initialization (and any associated
10837 side-effects) of a static data member does
10838 not occur unless the static data member is
10839 itself used in a way that requires the
10840 definition of the static data member to
10843 Therefore, we do not substitute into the
10844 initialized for the static data member here. */
10845 finish_static_data_member_decl
10847 /*init=*/NULL_TREE
,
10848 /*init_const_expr_p=*/false,
10849 /*asmspec_tree=*/NULL_TREE
,
10851 /* Instantiate members marked with attribute used. */
10852 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10855 else if (TREE_CODE (r
) == FIELD_DECL
)
10857 /* Determine whether R has a valid type and can be
10858 completed later. If R is invalid, then its type
10859 is replaced by error_mark_node. */
10860 tree rtype
= TREE_TYPE (r
);
10861 if (can_complete_type_without_circularity (rtype
))
10862 complete_type (rtype
);
10864 if (!complete_or_array_type_p (rtype
))
10866 /* If R's type couldn't be completed and
10867 it isn't a flexible array member (whose
10868 type is incomplete by definition) give
10870 cxx_incomplete_type_error (r
, rtype
);
10871 TREE_TYPE (r
) = error_mark_node
;
10875 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10876 such a thing will already have been added to the field
10877 list by tsubst_enum in finish_member_declaration in the
10878 CLASSTYPE_NESTED_UTDS case above. */
10879 if (!(TREE_CODE (r
) == TYPE_DECL
10880 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10881 && DECL_ARTIFICIAL (r
)))
10883 set_current_access_from_decl (r
);
10884 finish_member_declaration (r
);
10892 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10893 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10895 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10897 tree friend_type
= t
;
10898 bool adjust_processing_template_decl
= false;
10900 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10902 /* template <class T> friend class C; */
10903 friend_type
= tsubst_friend_class (friend_type
, args
);
10904 adjust_processing_template_decl
= true;
10906 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10908 /* template <class T> friend class C::D; */
10909 friend_type
= tsubst (friend_type
, args
,
10910 tf_warning_or_error
, NULL_TREE
);
10911 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10912 friend_type
= TREE_TYPE (friend_type
);
10913 adjust_processing_template_decl
= true;
10915 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10916 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10918 /* This could be either
10922 when dependent_type_p is false or
10924 template <class U> friend class T::C;
10927 /* Bump processing_template_decl in case this is something like
10928 template <class T> friend struct A<T>::B. */
10929 ++processing_template_decl
;
10930 friend_type
= tsubst (friend_type
, args
,
10931 tf_warning_or_error
, NULL_TREE
);
10932 if (dependent_type_p (friend_type
))
10933 adjust_processing_template_decl
= true;
10934 --processing_template_decl
;
10936 else if (TREE_CODE (friend_type
) != BOUND_TEMPLATE_TEMPLATE_PARM
10937 && !CLASSTYPE_USE_TEMPLATE (friend_type
)
10938 && TYPE_HIDDEN_P (friend_type
))
10942 where C hasn't been declared yet. Let's lookup name
10943 from namespace scope directly, bypassing any name that
10944 come from dependent base class. */
10945 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10947 /* The call to xref_tag_from_type does injection for friend
10949 push_nested_namespace (ns
);
10951 xref_tag_from_type (friend_type
, NULL_TREE
,
10952 /*tag_scope=*/ts_current
);
10953 pop_nested_namespace (ns
);
10955 else if (uses_template_parms (friend_type
))
10956 /* friend class C<T>; */
10957 friend_type
= tsubst (friend_type
, args
,
10958 tf_warning_or_error
, NULL_TREE
);
10963 where C is already declared or
10965 friend class C<int>;
10967 We don't have to do anything in these cases. */
10969 if (adjust_processing_template_decl
)
10970 /* Trick make_friend_class into realizing that the friend
10971 we're adding is a template, not an ordinary class. It's
10972 important that we use make_friend_class since it will
10973 perform some error-checking and output cross-reference
10975 ++processing_template_decl
;
10977 if (friend_type
!= error_mark_node
)
10978 make_friend_class (type
, friend_type
, /*complain=*/false);
10980 if (adjust_processing_template_decl
)
10981 --processing_template_decl
;
10985 /* Build new DECL_FRIENDLIST. */
10988 /* The file and line for this declaration, to
10989 assist in error message reporting. Since we
10990 called push_tinst_level above, we don't need to
10992 input_location
= DECL_SOURCE_LOCATION (t
);
10994 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10996 ++processing_template_decl
;
10997 push_deferring_access_checks (dk_no_check
);
11000 r
= tsubst_friend_function (t
, args
);
11001 add_friend (type
, r
, /*complain=*/false);
11002 if (TREE_CODE (t
) == TEMPLATE_DECL
)
11004 pop_deferring_access_checks ();
11005 --processing_template_decl
;
11013 /* Restore these before substituting into the lambda capture
11015 cp_unevaluated_operand
= saved_unevaluated_operand
;
11016 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11019 /* Set the file and line number information to whatever is given for
11020 the class itself. This puts error messages involving generated
11021 implicit functions at a predictable point, and the same point
11022 that would be used for non-template classes. */
11023 input_location
= DECL_SOURCE_LOCATION (typedecl
);
11025 unreverse_member_declarations (type
);
11026 finish_struct_1 (type
);
11027 TYPE_BEING_DEFINED (type
) = 0;
11029 /* We don't instantiate default arguments for member functions. 14.7.1:
11031 The implicit instantiation of a class template specialization causes
11032 the implicit instantiation of the declarations, but not of the
11033 definitions or default arguments, of the class member functions,
11034 member classes, static data members and member templates.... */
11036 /* Some typedefs referenced from within the template code need to be access
11037 checked at template instantiation time, i.e now. These types were
11038 added to the template at parsing time. Let's get those and perform
11039 the access checks then. */
11040 perform_typedefs_access_check (pattern
, args
);
11041 perform_deferred_access_checks (tf_warning_or_error
);
11042 pop_nested_class ();
11043 maximum_field_alignment
= saved_maximum_field_alignment
;
11045 pop_from_top_level ();
11046 pop_deferring_access_checks ();
11047 pop_tinst_level ();
11049 /* The vtable for a template class can be emitted in any translation
11050 unit in which the class is instantiated. When there is no key
11051 method, however, finish_struct_1 will already have added TYPE to
11052 the keyed_classes. */
11053 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
11054 vec_safe_push (keyed_classes
, type
);
11059 /* Wrapper for instantiate_class_template_1. */
11062 instantiate_class_template (tree type
)
11065 timevar_push (TV_TEMPLATE_INST
);
11066 ret
= instantiate_class_template_1 (type
);
11067 timevar_pop (TV_TEMPLATE_INST
);
11072 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11078 else if (TYPE_P (t
))
11079 r
= tsubst (t
, args
, complain
, in_decl
);
11082 if (!(complain
& tf_warning
))
11083 ++c_inhibit_evaluation_warnings
;
11084 r
= tsubst_expr (t
, args
, complain
, in_decl
,
11085 /*integral_constant_expression_p=*/true);
11086 if (!(complain
& tf_warning
))
11087 --c_inhibit_evaluation_warnings
;
11092 /* Given a function parameter pack TMPL_PARM and some function parameters
11093 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
11094 and set *SPEC_P to point at the next point in the list. */
11097 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
11099 /* Collect all of the extra "packed" parameters into an
11102 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
11103 tree spec_parm
= *spec_p
;
11106 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
11108 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
11111 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
11112 parmvec
= make_tree_vec (len
);
11113 spec_parm
= *spec_p
;
11114 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
11116 tree elt
= spec_parm
;
11117 if (DECL_PACK_P (elt
))
11118 elt
= make_pack_expansion (elt
);
11119 TREE_VEC_ELT (parmvec
, i
) = elt
;
11122 /* Build the argument packs. */
11123 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
11124 *spec_p
= spec_parm
;
11129 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
11130 NONTYPE_ARGUMENT_PACK. */
11133 make_fnparm_pack (tree spec_parm
)
11135 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
11138 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
11139 pack expansion with no extra args, 2 if it has extra args, or 0
11140 if it is not a pack expansion. */
11143 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
11145 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
11146 if (i
>= TREE_VEC_LENGTH (vec
))
11148 tree elt
= TREE_VEC_ELT (vec
, i
);
11150 /* A decl pack is itself an expansion. */
11151 elt
= TREE_TYPE (elt
);
11152 if (!PACK_EXPANSION_P (elt
))
11154 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
11160 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
11163 make_argument_pack_select (tree arg_pack
, unsigned index
)
11165 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
11167 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
11168 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
11173 /* This is a subroutine of tsubst_pack_expansion.
11175 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
11176 mechanism to store the (non complete list of) arguments of the
11177 substitution and return a non substituted pack expansion, in order
11178 to wait for when we have enough arguments to really perform the
11182 use_pack_expansion_extra_args_p (tree parm_packs
,
11184 bool has_empty_arg
)
11186 /* If one pack has an expansion and another pack has a normal
11187 argument or if one pack has an empty argument and an another
11188 one hasn't then tsubst_pack_expansion cannot perform the
11189 substitution and need to fall back on the
11190 PACK_EXPANSION_EXTRA mechanism. */
11191 if (parm_packs
== NULL_TREE
)
11193 else if (has_empty_arg
)
11196 bool has_expansion_arg
= false;
11197 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
11199 bool has_non_expansion_arg
= false;
11200 for (tree parm_pack
= parm_packs
;
11202 parm_pack
= TREE_CHAIN (parm_pack
))
11204 tree arg
= TREE_VALUE (parm_pack
);
11206 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
11208 /* We can't substitute a pack expansion with extra args into
11212 has_expansion_arg
= true;
11214 has_non_expansion_arg
= true;
11217 if (has_expansion_arg
&& has_non_expansion_arg
)
11223 /* [temp.variadic]/6 says that:
11225 The instantiation of a pack expansion [...]
11226 produces a list E1,E2, ..., En, where N is the number of elements
11227 in the pack expansion parameters.
11229 This subroutine of tsubst_pack_expansion produces one of these Ei.
11231 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
11232 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
11233 PATTERN, and each TREE_VALUE is its corresponding argument pack.
11234 INDEX is the index 'i' of the element Ei to produce. ARGS,
11235 COMPLAIN, and IN_DECL are the same parameters as for the
11236 tsubst_pack_expansion function.
11238 The function returns the resulting Ei upon successful completion,
11239 or error_mark_node.
11241 Note that this function possibly modifies the ARGS parameter, so
11242 it's the responsibility of the caller to restore it. */
11245 gen_elem_of_pack_expansion_instantiation (tree pattern
,
11248 tree args
/* This parm gets
11250 tsubst_flags_t complain
,
11254 bool ith_elem_is_expansion
= false;
11256 /* For each parameter pack, change the substitution of the parameter
11257 pack to the ith argument in its argument pack, then expand the
11259 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
11261 tree parm
= TREE_PURPOSE (pack
);
11262 tree arg_pack
= TREE_VALUE (pack
);
11263 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
11265 ith_elem_is_expansion
|=
11266 argument_pack_element_is_expansion_p (arg_pack
, index
);
11268 /* Select the Ith argument from the pack. */
11269 if (TREE_CODE (parm
) == PARM_DECL
11271 || TREE_CODE (parm
) == FIELD_DECL
)
11275 aps
= make_argument_pack_select (arg_pack
, index
);
11276 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
11277 return error_mark_node
;
11278 register_local_specialization (aps
, parm
);
11281 aps
= retrieve_local_specialization (parm
);
11286 template_parm_level_and_index (parm
, &level
, &idx
);
11290 aps
= make_argument_pack_select (arg_pack
, index
);
11291 /* Update the corresponding argument. */
11292 TMPL_ARG (args
, level
, idx
) = aps
;
11295 /* Re-use the ARGUMENT_PACK_SELECT. */
11296 aps
= TMPL_ARG (args
, level
, idx
);
11298 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
11301 /* Substitute into the PATTERN with the (possibly altered)
11303 if (pattern
== in_decl
)
11304 /* Expanding a fixed parameter pack from
11305 coerce_template_parameter_pack. */
11306 t
= tsubst_decl (pattern
, args
, complain
);
11307 else if (pattern
== error_mark_node
)
11308 t
= error_mark_node
;
11309 else if (constraint_p (pattern
))
11311 if (processing_template_decl
)
11312 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
11314 t
= (constraints_satisfied_p (pattern
, args
)
11315 ? boolean_true_node
: boolean_false_node
);
11317 else if (!TYPE_P (pattern
))
11318 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11319 /*integral_constant_expression_p=*/false);
11321 t
= tsubst (pattern
, args
, complain
, in_decl
);
11323 /* If the Ith argument pack element is a pack expansion, then
11324 the Ith element resulting from the substituting is going to
11325 be a pack expansion as well. */
11326 if (ith_elem_is_expansion
)
11327 t
= make_pack_expansion (t
, complain
);
11332 /* When the unexpanded parameter pack in a fold expression expands to an empty
11333 sequence, the value of the expression is as follows; the program is
11334 ill-formed if the operator is not listed in this table.
11341 expand_empty_fold (tree t
, tsubst_flags_t complain
)
11343 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
11344 if (!FOLD_EXPR_MODIFY_P (t
))
11347 case TRUTH_ANDIF_EXPR
:
11348 return boolean_true_node
;
11349 case TRUTH_ORIF_EXPR
:
11350 return boolean_false_node
;
11351 case COMPOUND_EXPR
:
11357 if (complain
& tf_error
)
11358 error_at (location_of (t
),
11359 "fold of empty expansion over %O", code
);
11360 return error_mark_node
;
11363 /* Given a fold-expression T and a current LEFT and RIGHT operand,
11364 form an expression that combines the two terms using the
11368 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
11370 tree op
= FOLD_EXPR_OP (t
);
11371 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
11373 // Handle compound assignment operators.
11374 if (FOLD_EXPR_MODIFY_P (t
))
11375 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
11379 case COMPOUND_EXPR
:
11380 return build_x_compound_expr (input_location
, left
, right
, complain
);
11382 return build_m_component_ref (left
, right
, complain
);
11384 return build_x_binary_op (input_location
, code
,
11385 left
, TREE_CODE (left
),
11386 right
, TREE_CODE (right
),
11392 /* Substitute ARGS into the pack of a fold expression T. */
11395 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11397 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
11400 /* Substitute ARGS into the pack of a fold expression T. */
11403 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11405 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
11408 /* Expand a PACK of arguments into a grouped as left fold.
11409 Given a pack containing elements A0, A1, ..., An and an
11410 operator @, this builds the expression:
11412 ((A0 @ A1) @ A2) ... @ An
11414 Note that PACK must not be empty.
11416 The operator is defined by the original fold expression T. */
11419 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
11421 tree left
= TREE_VEC_ELT (pack
, 0);
11422 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
11424 tree right
= TREE_VEC_ELT (pack
, i
);
11425 left
= fold_expression (t
, left
, right
, complain
);
11430 /* Substitute into a unary left fold expression. */
11433 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
11436 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11437 if (pack
== error_mark_node
)
11438 return error_mark_node
;
11439 if (PACK_EXPANSION_P (pack
))
11441 tree r
= copy_node (t
);
11442 FOLD_EXPR_PACK (r
) = pack
;
11445 if (TREE_VEC_LENGTH (pack
) == 0)
11446 return expand_empty_fold (t
, complain
);
11448 return expand_left_fold (t
, pack
, complain
);
11451 /* Substitute into a binary left fold expression.
11453 Do ths by building a single (non-empty) vector of argumnts and
11454 building the expression from those elements. */
11457 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
11460 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11461 if (pack
== error_mark_node
)
11462 return error_mark_node
;
11463 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
11464 if (init
== error_mark_node
)
11465 return error_mark_node
;
11467 if (PACK_EXPANSION_P (pack
))
11469 tree r
= copy_node (t
);
11470 FOLD_EXPR_PACK (r
) = pack
;
11471 FOLD_EXPR_INIT (r
) = init
;
11475 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
11476 TREE_VEC_ELT (vec
, 0) = init
;
11477 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
11478 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
11480 return expand_left_fold (t
, vec
, complain
);
11483 /* Expand a PACK of arguments into a grouped as right fold.
11484 Given a pack containing elementns A0, A1, ..., and an
11485 operator @, this builds the expression:
11487 A0@ ... (An-2 @ (An-1 @ An))
11489 Note that PACK must not be empty.
11491 The operator is defined by the original fold expression T. */
11494 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
11496 // Build the expression.
11497 int n
= TREE_VEC_LENGTH (pack
);
11498 tree right
= TREE_VEC_ELT (pack
, n
- 1);
11499 for (--n
; n
!= 0; --n
)
11501 tree left
= TREE_VEC_ELT (pack
, n
- 1);
11502 right
= fold_expression (t
, left
, right
, complain
);
11507 /* Substitute into a unary right fold expression. */
11510 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
11513 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11514 if (pack
== error_mark_node
)
11515 return error_mark_node
;
11516 if (PACK_EXPANSION_P (pack
))
11518 tree r
= copy_node (t
);
11519 FOLD_EXPR_PACK (r
) = pack
;
11522 if (TREE_VEC_LENGTH (pack
) == 0)
11523 return expand_empty_fold (t
, complain
);
11525 return expand_right_fold (t
, pack
, complain
);
11528 /* Substitute into a binary right fold expression.
11530 Do ths by building a single (non-empty) vector of arguments and
11531 building the expression from those elements. */
11534 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
11537 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
11538 if (pack
== error_mark_node
)
11539 return error_mark_node
;
11540 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
11541 if (init
== error_mark_node
)
11542 return error_mark_node
;
11544 if (PACK_EXPANSION_P (pack
))
11546 tree r
= copy_node (t
);
11547 FOLD_EXPR_PACK (r
) = pack
;
11548 FOLD_EXPR_INIT (r
) = init
;
11552 int n
= TREE_VEC_LENGTH (pack
);
11553 tree vec
= make_tree_vec (n
+ 1);
11554 for (int i
= 0; i
< n
; ++i
)
11555 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
11556 TREE_VEC_ELT (vec
, n
) = init
;
11558 return expand_right_fold (t
, vec
, complain
);
11561 /* Walk through the pattern of a pack expansion, adding everything in
11562 local_specializations to a list. */
11567 tsubst_flags_t complain
;
11570 extract_locals_r (tree
*tp
, int */
*walk_subtrees*/
, void *data_
)
11572 el_data
&data
= *reinterpret_cast<el_data
*>(data_
);
11573 tree
*extra
= &data
.extra
;
11574 tsubst_flags_t complain
= data
.complain
;
11575 if (tree spec
= retrieve_local_specialization (*tp
))
11577 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
11579 /* Maybe pull out the PARM_DECL for a partial instantiation. */
11580 tree args
= ARGUMENT_PACK_ARGS (spec
);
11581 if (TREE_VEC_LENGTH (args
) == 1)
11583 tree elt
= TREE_VEC_ELT (args
, 0);
11584 if (PACK_EXPANSION_P (elt
))
11585 elt
= PACK_EXPANSION_PATTERN (elt
);
11586 if (DECL_PACK_P (elt
))
11589 if (TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
)
11591 /* Handle lambda capture here, since we aren't doing any
11592 substitution now, and so tsubst_copy won't call
11593 process_outer_var_ref. */
11594 tree args
= ARGUMENT_PACK_ARGS (spec
);
11595 int len
= TREE_VEC_LENGTH (args
);
11596 for (int i
= 0; i
< len
; ++i
)
11598 tree arg
= TREE_VEC_ELT (args
, i
);
11600 if (outer_automatic_var_p (arg
))
11601 carg
= process_outer_var_ref (arg
, complain
);
11604 /* Make a new NONTYPE_ARGUMENT_PACK of the capture
11608 spec
= copy_node (spec
);
11609 args
= copy_node (args
);
11610 SET_ARGUMENT_PACK_ARGS (spec
, args
);
11611 register_local_specialization (spec
, *tp
);
11613 TREE_VEC_ELT (args
, i
) = carg
;
11618 if (outer_automatic_var_p (spec
))
11619 spec
= process_outer_var_ref (spec
, complain
);
11620 *extra
= tree_cons (*tp
, spec
, *extra
);
11625 extract_local_specs (tree pattern
, tsubst_flags_t complain
)
11627 el_data data
= { NULL_TREE
, complain
};
11628 cp_walk_tree_without_duplicates (&pattern
, extract_locals_r
, &data
);
11632 /* Substitute ARGS into T, which is an pack expansion
11633 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
11634 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
11635 (if only a partial substitution could be performed) or
11636 ERROR_MARK_NODE if there was an error. */
11638 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
11642 tree pack
, packs
= NULL_TREE
;
11643 bool unsubstituted_packs
= false;
11644 bool unsubstituted_fn_pack
= false;
11647 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
11648 bool need_local_specializations
= false;
11651 gcc_assert (PACK_EXPANSION_P (t
));
11652 pattern
= PACK_EXPANSION_PATTERN (t
);
11654 /* Add in any args remembered from an earlier partial instantiation. */
11655 tree extra
= PACK_EXPANSION_EXTRA_ARGS (t
);
11656 if (extra
&& TREE_CODE (extra
) == TREE_LIST
)
11658 for (tree elt
= TREE_CHAIN (extra
); elt
; elt
= TREE_CHAIN (elt
))
11660 /* The partial instantiation involved local declarations collected in
11661 extract_local_specs; map from the general template to our local
11663 tree gen
= TREE_PURPOSE (elt
);
11664 tree inst
= TREE_VALUE (elt
);
11666 if (tree local
= retrieve_local_specialization (inst
))
11668 /* else inst is already a full instantiation of the pack. */
11669 register_local_specialization (inst
, gen
);
11671 gcc_assert (!TREE_PURPOSE (extra
));
11672 extra
= TREE_VALUE (extra
);
11674 args
= add_to_template_args (extra
, args
);
11676 levels
= TMPL_ARGS_DEPTH (args
);
11678 /* Determine the argument packs that will instantiate the parameter
11679 packs used in the expansion expression. While we're at it,
11680 compute the number of arguments to be expanded and make sure it
11682 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
11683 pack
= TREE_CHAIN (pack
))
11685 tree parm_pack
= TREE_VALUE (pack
);
11686 tree arg_pack
= NULL_TREE
;
11687 tree orig_arg
= NULL_TREE
;
11690 if (TREE_CODE (parm_pack
) == BASES
)
11692 gcc_assert (parm_pack
== pattern
);
11693 if (BASES_DIRECT (parm_pack
))
11694 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
11695 args
, complain
, in_decl
, false));
11697 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
11698 args
, complain
, in_decl
, false));
11700 else if (builtin_pack_call_p (parm_pack
))
11702 /* ??? Support use in other patterns. */
11703 gcc_assert (parm_pack
== pattern
);
11704 return expand_builtin_pack_call (parm_pack
, args
,
11705 complain
, in_decl
);
11707 else if (TREE_CODE (parm_pack
) == PARM_DECL
)
11709 /* We know we have correct local_specializations if this
11710 expansion is at function scope, or if we're dealing with a
11711 local parameter in a requires expression; for the latter,
11712 tsubst_requires_expr set it up appropriately. */
11713 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
11714 arg_pack
= retrieve_local_specialization (parm_pack
);
11716 /* We can't rely on local_specializations for a parameter
11717 name used later in a function declaration (such as in a
11718 late-specified return type). Even if it exists, it might
11719 have the wrong value for a recursive call. */
11720 need_local_specializations
= true;
11724 /* This parameter pack was used in an unevaluated context. Just
11725 make a dummy decl, since it's only used for its type. */
11726 ++cp_unevaluated_operand
;
11727 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
11728 --cp_unevaluated_operand
;
11729 if (arg_pack
&& DECL_PACK_P (arg_pack
))
11730 /* Partial instantiation of the parm_pack, we can't build
11731 up an argument pack yet. */
11732 arg_pack
= NULL_TREE
;
11734 arg_pack
= make_fnparm_pack (arg_pack
);
11736 else if (argument_pack_element_is_expansion_p (arg_pack
, 0))
11737 /* This argument pack isn't fully instantiated yet. We set this
11738 flag rather than clear arg_pack because we do want to do the
11739 optimization below, and we don't want to substitute directly
11740 into the pattern (as that would expose a NONTYPE_ARGUMENT_PACK
11741 where it isn't expected). */
11742 unsubstituted_fn_pack
= true;
11744 else if (is_normal_capture_proxy (parm_pack
))
11746 arg_pack
= retrieve_local_specialization (parm_pack
);
11747 if (argument_pack_element_is_expansion_p (arg_pack
, 0))
11748 unsubstituted_fn_pack
= true;
11753 template_parm_level_and_index (parm_pack
, &level
, &idx
);
11755 if (level
<= levels
)
11756 arg_pack
= TMPL_ARG (args
, level
, idx
);
11759 orig_arg
= arg_pack
;
11760 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
11761 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
11763 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
11764 /* This can only happen if we forget to expand an argument
11765 pack somewhere else. Just return an error, silently. */
11767 result
= make_tree_vec (1);
11768 TREE_VEC_ELT (result
, 0) = error_mark_node
;
11775 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
11777 /* Don't bother trying to do a partial substitution with
11778 incomplete packs; we'll try again after deduction. */
11779 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
11784 else if (len
!= my_len
11785 && !unsubstituted_fn_pack
)
11787 if (!(complain
& tf_error
))
11788 /* Fail quietly. */;
11789 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
11790 error ("mismatched argument pack lengths while expanding %qT",
11793 error ("mismatched argument pack lengths while expanding %qE",
11795 return error_mark_node
;
11798 /* Keep track of the parameter packs and their corresponding
11800 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
11801 TREE_TYPE (packs
) = orig_arg
;
11805 /* We can't substitute for this parameter pack. We use a flag as
11806 well as the missing_level counter because function parameter
11807 packs don't have a level. */
11808 gcc_assert (processing_template_decl
);
11809 unsubstituted_packs
= true;
11813 /* If the expansion is just T..., return the matching argument pack, unless
11814 we need to call convert_from_reference on all the elements. This is an
11815 important optimization; see c++/68422. */
11816 if (!unsubstituted_packs
11817 && TREE_PURPOSE (packs
) == pattern
)
11819 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
11821 /* If the argument pack is a single pack expansion, pull it out. */
11822 if (TREE_VEC_LENGTH (args
) == 1
11823 && pack_expansion_args_count (args
))
11824 return TREE_VEC_ELT (args
, 0);
11826 /* Types need no adjustment, nor does sizeof..., and if we still have
11827 some pack expansion args we won't do anything yet. */
11828 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
11829 || PACK_EXPANSION_SIZEOF_P (t
)
11830 || pack_expansion_args_count (args
))
11832 /* Also optimize expression pack expansions if we can tell that the
11833 elements won't have reference type. */
11834 tree type
= TREE_TYPE (pattern
);
11835 if (type
&& TREE_CODE (type
) != REFERENCE_TYPE
11836 && !PACK_EXPANSION_P (type
)
11837 && !WILDCARD_TYPE_P (type
))
11839 /* Otherwise use the normal path so we get convert_from_reference. */
11842 /* We cannot expand this expansion expression, because we don't have
11843 all of the argument packs we need. */
11844 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
11846 /* We got some full packs, but we can't substitute them in until we
11847 have values for all the packs. So remember these until then. */
11849 t
= make_pack_expansion (pattern
, complain
);
11851 if (local_specializations
)
11852 if (tree locals
= extract_local_specs (pattern
, complain
))
11853 extra
= tree_cons (NULL_TREE
, extra
, locals
);
11854 PACK_EXPANSION_EXTRA_ARGS (t
) = extra
;
11857 else if (unsubstituted_packs
)
11859 /* There were no real arguments, we're just replacing a parameter
11860 pack with another version of itself. Substitute into the
11861 pattern and return a PACK_EXPANSION_*. The caller will need to
11863 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
11864 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11865 /*integral_constant_expression_p=*/false);
11867 t
= tsubst (pattern
, args
, complain
, in_decl
);
11868 t
= make_pack_expansion (t
, complain
);
11872 gcc_assert (len
>= 0);
11874 if (need_local_specializations
)
11876 /* We're in a late-specified return type, so create our own local
11877 specializations map; the current map is either NULL or (in the
11878 case of recursive unification) might have bindings that we don't
11879 want to use or alter. */
11880 saved_local_specializations
= local_specializations
;
11881 local_specializations
= new hash_map
<tree
, tree
>;
11884 /* For each argument in each argument pack, substitute into the
11886 result
= make_tree_vec (len
);
11887 tree elem_args
= copy_template_args (args
);
11888 for (i
= 0; i
< len
; ++i
)
11890 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
11892 elem_args
, complain
,
11894 TREE_VEC_ELT (result
, i
) = t
;
11895 if (t
== error_mark_node
)
11897 result
= error_mark_node
;
11902 /* Update ARGS to restore the substitution from parameter packs to
11903 their argument packs. */
11904 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
11906 tree parm
= TREE_PURPOSE (pack
);
11908 if (TREE_CODE (parm
) == PARM_DECL
11910 || TREE_CODE (parm
) == FIELD_DECL
)
11911 register_local_specialization (TREE_TYPE (pack
), parm
);
11916 if (TREE_VALUE (pack
) == NULL_TREE
)
11919 template_parm_level_and_index (parm
, &level
, &idx
);
11921 /* Update the corresponding argument. */
11922 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
11923 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
11926 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
11930 if (need_local_specializations
)
11932 delete local_specializations
;
11933 local_specializations
= saved_local_specializations
;
11936 /* If the dependent pack arguments were such that we end up with only a
11937 single pack expansion again, there's no need to keep it in a TREE_VEC. */
11938 if (len
== 1 && TREE_CODE (result
) == TREE_VEC
11939 && PACK_EXPANSION_P (TREE_VEC_ELT (result
, 0)))
11940 return TREE_VEC_ELT (result
, 0);
11945 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
11946 TMPL. We do this using DECL_PARM_INDEX, which should work even with
11947 parameter packs; all parms generated from a function parameter pack will
11948 have the same DECL_PARM_INDEX. */
11951 get_pattern_parm (tree parm
, tree tmpl
)
11953 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
11956 if (DECL_ARTIFICIAL (parm
))
11958 for (patparm
= DECL_ARGUMENTS (pattern
);
11959 patparm
; patparm
= DECL_CHAIN (patparm
))
11960 if (DECL_ARTIFICIAL (patparm
)
11961 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11966 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11967 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11968 gcc_assert (DECL_PARM_INDEX (patparm
)
11969 == DECL_PARM_INDEX (parm
));
11975 /* Make an argument pack out of the TREE_VEC VEC. */
11978 make_argument_pack (tree vec
)
11981 tree elt
= TREE_VEC_ELT (vec
, 0);
11983 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11986 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11987 TREE_CONSTANT (pack
) = 1;
11989 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11993 /* Return an exact copy of template args T that can be modified
11997 copy_template_args (tree t
)
11999 if (t
== error_mark_node
)
12002 int len
= TREE_VEC_LENGTH (t
);
12003 tree new_vec
= make_tree_vec (len
);
12005 for (int i
= 0; i
< len
; ++i
)
12007 tree elt
= TREE_VEC_ELT (t
, i
);
12008 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
12009 elt
= copy_template_args (elt
);
12010 TREE_VEC_ELT (new_vec
, i
) = elt
;
12013 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
12014 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
12019 /* Substitute ARGS into the vector or list of template arguments T. */
12022 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12025 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
12028 if (t
== error_mark_node
)
12029 return error_mark_node
;
12031 len
= TREE_VEC_LENGTH (t
);
12032 elts
= XALLOCAVEC (tree
, len
);
12034 for (i
= 0; i
< len
; i
++)
12036 tree orig_arg
= TREE_VEC_ELT (t
, i
);
12039 if (TREE_CODE (orig_arg
) == TREE_VEC
)
12040 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
12041 else if (PACK_EXPANSION_P (orig_arg
))
12043 /* Substitute into an expansion expression. */
12044 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
12046 if (TREE_CODE (new_arg
) == TREE_VEC
)
12047 /* Add to the expanded length adjustment the number of
12048 expanded arguments. We subtract one from this
12049 measurement, because the argument pack expression
12050 itself is already counted as 1 in
12051 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
12052 the argument pack is empty. */
12053 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
12055 else if (ARGUMENT_PACK_P (orig_arg
))
12057 /* Substitute into each of the arguments. */
12058 new_arg
= TYPE_P (orig_arg
)
12059 ? cxx_make_type (TREE_CODE (orig_arg
))
12060 : make_node (TREE_CODE (orig_arg
));
12062 tree pack_args
= tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
12063 args
, complain
, in_decl
);
12064 if (pack_args
== error_mark_node
)
12065 new_arg
= error_mark_node
;
12067 SET_ARGUMENT_PACK_ARGS (new_arg
, pack_args
);
12069 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
)
12070 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
12073 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
12075 if (new_arg
== error_mark_node
)
12076 return error_mark_node
;
12079 if (new_arg
!= orig_arg
)
12086 /* Make space for the expanded arguments coming from template
12088 t
= make_tree_vec (len
+ expanded_len_adjust
);
12089 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
12090 arguments for a member template.
12091 In that case each TREE_VEC in ORIG_T represents a level of template
12092 arguments, and ORIG_T won't carry any non defaulted argument count.
12093 It will rather be the nested TREE_VECs that will carry one.
12094 In other words, ORIG_T carries a non defaulted argument count only
12095 if it doesn't contain any nested TREE_VEC. */
12096 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
12098 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
12099 count
+= expanded_len_adjust
;
12100 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
12102 for (i
= 0, out
= 0; i
< len
; i
++)
12104 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
12105 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
12106 && TREE_CODE (elts
[i
]) == TREE_VEC
)
12110 /* Now expand the template argument pack "in place". */
12111 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
12112 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
12116 TREE_VEC_ELT (t
, out
) = elts
[i
];
12124 /* Substitute ARGS into one level PARMS of template parameters. */
12127 tsubst_template_parms_level (tree parms
, tree args
, tsubst_flags_t complain
)
12129 if (parms
== error_mark_node
)
12130 return error_mark_node
;
12132 tree new_vec
= make_tree_vec (TREE_VEC_LENGTH (parms
));
12134 for (int i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
12136 tree tuple
= TREE_VEC_ELT (parms
, i
);
12138 if (tuple
== error_mark_node
)
12141 TREE_VEC_ELT (new_vec
, i
) =
12142 tsubst_template_parm (tuple
, args
, complain
);
12148 /* Return the result of substituting ARGS into the template parameters
12149 given by PARMS. If there are m levels of ARGS and m + n levels of
12150 PARMS, then the result will contain n levels of PARMS. For
12151 example, if PARMS is `template <class T> template <class U>
12152 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
12153 result will be `template <int*, double, class V>'. */
12156 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
12158 tree r
= NULL_TREE
;
12161 /* When substituting into a template, we must set
12162 PROCESSING_TEMPLATE_DECL as the template parameters may be
12163 dependent if they are based on one-another, and the dependency
12164 predicates are short-circuit outside of templates. */
12165 ++processing_template_decl
;
12167 for (new_parms
= &r
;
12168 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
12169 new_parms
= &(TREE_CHAIN (*new_parms
)),
12170 parms
= TREE_CHAIN (parms
))
12172 tree new_vec
= tsubst_template_parms_level (TREE_VALUE (parms
),
12175 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
12176 - TMPL_ARGS_DEPTH (args
)),
12177 new_vec
, NULL_TREE
);
12180 --processing_template_decl
;
12185 /* Return the result of substituting ARGS into one template parameter
12186 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
12187 parameter and which TREE_PURPOSE is the default argument of the
12188 template parameter. */
12191 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
12193 tree default_value
, parm_decl
;
12195 if (args
== NULL_TREE
12197 || t
== error_mark_node
)
12200 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
12202 default_value
= TREE_PURPOSE (t
);
12203 parm_decl
= TREE_VALUE (t
);
12205 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
12206 if (TREE_CODE (parm_decl
) == PARM_DECL
12207 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
12208 parm_decl
= error_mark_node
;
12209 default_value
= tsubst_template_arg (default_value
, args
,
12210 complain
, NULL_TREE
);
12212 return build_tree_list (default_value
, parm_decl
);
12215 /* Substitute the ARGS into the indicated aggregate (or enumeration)
12216 type T. If T is not an aggregate or enumeration type, it is
12217 handled as if by tsubst. IN_DECL is as for tsubst. If
12218 ENTERING_SCOPE is nonzero, T is the context for a template which
12219 we are presently tsubst'ing. Return the substituted value. */
12222 tsubst_aggr_type (tree t
,
12224 tsubst_flags_t complain
,
12226 int entering_scope
)
12228 if (t
== NULL_TREE
)
12231 switch (TREE_CODE (t
))
12234 if (TYPE_PTRMEMFUNC_P (t
))
12235 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
12237 /* Fall through. */
12238 case ENUMERAL_TYPE
:
12240 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
12245 int saved_unevaluated_operand
;
12246 int saved_inhibit_evaluation_warnings
;
12248 /* In "sizeof(X<I>)" we need to evaluate "I". */
12249 saved_unevaluated_operand
= cp_unevaluated_operand
;
12250 cp_unevaluated_operand
= 0;
12251 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
12252 c_inhibit_evaluation_warnings
= 0;
12254 /* First, determine the context for the type we are looking
12256 context
= TYPE_CONTEXT (t
);
12257 if (context
&& TYPE_P (context
))
12259 context
= tsubst_aggr_type (context
, args
, complain
,
12260 in_decl
, /*entering_scope=*/1);
12261 /* If context is a nested class inside a class template,
12262 it may still need to be instantiated (c++/33959). */
12263 context
= complete_type (context
);
12266 /* Then, figure out what arguments are appropriate for the
12267 type we are trying to find. For example, given:
12269 template <class T> struct S;
12270 template <class T, class U> void f(T, U) { S<U> su; }
12272 and supposing that we are instantiating f<int, double>,
12273 then our ARGS will be {int, double}, but, when looking up
12274 S we only want {double}. */
12275 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
12276 complain
, in_decl
);
12277 if (argvec
== error_mark_node
)
12278 r
= error_mark_node
;
12281 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
12282 entering_scope
, complain
);
12283 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12286 cp_unevaluated_operand
= saved_unevaluated_operand
;
12287 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
12292 /* This is not a template type, so there's nothing to do. */
12296 return tsubst (t
, args
, complain
, in_decl
);
12300 static GTY((cache
)) tree_cache_map
*defarg_inst
;
12302 /* Substitute into the default argument ARG (a default argument for
12303 FN), which has the indicated TYPE. */
12306 tsubst_default_argument (tree fn
, int parmnum
, tree type
, tree arg
,
12307 tsubst_flags_t complain
)
12309 tree saved_class_ptr
= NULL_TREE
;
12310 tree saved_class_ref
= NULL_TREE
;
12311 int errs
= errorcount
+ sorrycount
;
12313 /* This can happen in invalid code. */
12314 if (TREE_CODE (arg
) == DEFAULT_ARG
)
12317 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
12318 parm
= chain_index (parmnum
, parm
);
12319 tree parmtype
= TREE_TYPE (parm
);
12320 if (DECL_BY_REFERENCE (parm
))
12321 parmtype
= TREE_TYPE (parmtype
);
12322 gcc_assert (same_type_ignoring_top_level_qualifiers_p (type
, parmtype
));
12325 if (defarg_inst
&& (slot
= defarg_inst
->get (parm
)))
12328 /* This default argument came from a template. Instantiate the
12329 default argument here, not in tsubst. In the case of
12338 we must be careful to do name lookup in the scope of S<T>,
12339 rather than in the current class. */
12340 push_access_scope (fn
);
12341 /* The "this" pointer is not valid in a default argument. */
12344 saved_class_ptr
= current_class_ptr
;
12345 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
12346 saved_class_ref
= current_class_ref
;
12347 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
12350 start_lambda_scope (parm
);
12352 push_deferring_access_checks(dk_no_deferred
);
12353 /* The default argument expression may cause implicitly defined
12354 member functions to be synthesized, which will result in garbage
12355 collection. We must treat this situation as if we were within
12356 the body of function so as to avoid collecting live data on the
12359 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
12360 complain
, NULL_TREE
,
12361 /*integral_constant_expression_p=*/false);
12363 pop_deferring_access_checks();
12365 finish_lambda_scope ();
12367 /* Restore the "this" pointer. */
12370 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
12371 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
12374 if (errorcount
+sorrycount
> errs
12375 && (complain
& tf_warning_or_error
))
12376 inform (input_location
,
12377 " when instantiating default argument for call to %qD", fn
);
12379 /* Make sure the default argument is reasonable. */
12380 arg
= check_default_argument (type
, arg
, complain
);
12382 pop_access_scope (fn
);
12384 if (arg
!= error_mark_node
&& !cp_unevaluated_operand
)
12387 defarg_inst
= tree_cache_map::create_ggc (37);
12388 defarg_inst
->put (parm
, arg
);
12394 /* Substitute into all the default arguments for FN. */
12397 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
12402 tmpl_args
= DECL_TI_ARGS (fn
);
12404 /* If this function is not yet instantiated, we certainly don't need
12405 its default arguments. */
12406 if (uses_template_parms (tmpl_args
))
12408 /* Don't do this again for clones. */
12409 if (DECL_CLONED_FUNCTION_P (fn
))
12413 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
12415 arg
= TREE_CHAIN (arg
), ++i
)
12416 if (TREE_PURPOSE (arg
))
12417 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
, i
,
12419 TREE_PURPOSE (arg
),
12423 /* Subroutine of tsubst_decl for the case when T is a FUNCTION_DECL. */
12426 tsubst_function_decl (tree t
, tree args
, tsubst_flags_t complain
,
12427 tree lambda_fntype
)
12429 tree gen_tmpl
, argvec
;
12430 hashval_t hash
= 0;
12433 /* Nobody should be tsubst'ing into non-template functions. */
12434 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
12436 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
12438 /* If T is not dependent, just return it. */
12439 if (!uses_template_parms (DECL_TI_ARGS (t
)))
12442 /* Calculate the most general template of which R is a
12444 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
12446 /* We're substituting a lambda function under tsubst_lambda_expr but not
12447 directly from it; find the matching function we're already inside.
12448 But don't do this if T is a generic lambda with a single level of
12449 template parms, as in that case we're doing a normal instantiation. */
12450 if (LAMBDA_FUNCTION_P (t
) && !lambda_fntype
12451 && (!generic_lambda_fn_p (t
)
12452 || TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)) > 1))
12453 return enclosing_instantiation_of (t
);
12455 /* Calculate the complete set of arguments used to
12457 argvec
= tsubst_template_args (DECL_TI_ARGS
12458 (DECL_TEMPLATE_RESULT
12459 (DECL_TI_TEMPLATE (t
))),
12460 args
, complain
, in_decl
);
12461 if (argvec
== error_mark_node
)
12462 return error_mark_node
;
12464 /* Check to see if we already have this specialization. */
12465 if (!lambda_fntype
)
12467 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12468 if (tree spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
))
12472 /* We can see more levels of arguments than parameters if
12473 there was a specialization of a member template, like
12476 template <class T> struct S { template <class U> void f(); }
12477 template <> template <class U> void S<int>::f(U);
12479 Here, we'll be substituting into the specialization,
12480 because that's where we can find the code we actually
12481 want to generate, but we'll have enough arguments for
12482 the most general template.
12484 We also deal with the peculiar case:
12486 template <class T> struct S {
12487 template <class U> friend void f();
12489 template <class U> void f() {}
12491 template void f<double>();
12493 Here, the ARGS for the instantiation of will be {int,
12494 double}. But, we only need as many ARGS as there are
12495 levels of template parameters in CODE_PATTERN. We are
12496 careful not to get fooled into reducing the ARGS in
12499 template <class T> struct S { template <class U> void f(U); }
12500 template <class T> template <> void S<T>::f(int) {}
12502 which we can spot because the pattern will be a
12503 specialization in this case. */
12504 int args_depth
= TMPL_ARGS_DEPTH (args
);
12506 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
12508 if (args_depth
> parms_depth
&& !DECL_TEMPLATE_SPECIALIZATION (t
))
12509 args
= get_innermost_template_args (args
, parms_depth
);
12513 /* This special case arises when we have something like this:
12515 template <class T> struct S {
12516 friend void f<int>(int, double);
12519 Here, the DECL_TI_TEMPLATE for the friend declaration
12520 will be an IDENTIFIER_NODE. We are being called from
12521 tsubst_friend_function, and we want only to create a
12522 new decl (R) with appropriate types so that we can call
12523 determine_specialization. */
12524 gen_tmpl
= NULL_TREE
;
12525 argvec
= NULL_TREE
;
12528 tree closure
= (lambda_fntype
? TYPE_METHOD_BASETYPE (lambda_fntype
)
12530 tree ctx
= closure
? closure
: DECL_CONTEXT (t
);
12531 bool member
= ctx
&& TYPE_P (ctx
);
12533 if (member
&& !closure
)
12534 ctx
= tsubst_aggr_type (ctx
, args
,
12535 complain
, t
, /*entering_scope=*/1);
12537 tree type
= (lambda_fntype
? lambda_fntype
12538 : tsubst (TREE_TYPE (t
), args
,
12539 complain
| tf_fndecl_type
, in_decl
));
12540 if (type
== error_mark_node
)
12541 return error_mark_node
;
12543 /* If we hit excessive deduction depth, the type is bogus even if
12544 it isn't error_mark_node, so don't build a decl. */
12545 if (excessive_deduction_depth
)
12546 return error_mark_node
;
12548 /* We do NOT check for matching decls pushed separately at this
12549 point, as they may not represent instantiations of this
12550 template, and in any case are considered separate under the
12552 tree r
= copy_decl (t
);
12553 DECL_USE_TEMPLATE (r
) = 0;
12554 TREE_TYPE (r
) = type
;
12555 /* Clear out the mangled name and RTL for the instantiation. */
12556 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12557 SET_DECL_RTL (r
, NULL
);
12558 /* Leave DECL_INITIAL set on deleted instantiations. */
12559 if (!DECL_DELETED_FN (r
))
12560 DECL_INITIAL (r
) = NULL_TREE
;
12561 DECL_CONTEXT (r
) = ctx
;
12563 /* OpenMP UDRs have the only argument a reference to the declared
12564 type. We want to diagnose if the declared type is a reference,
12565 which is invalid, but as references to references are usually
12566 quietly merged, diagnose it here. */
12567 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
12570 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
12571 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
12572 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
12573 error_at (DECL_SOURCE_LOCATION (t
),
12574 "reference type %qT in "
12575 "%<#pragma omp declare reduction%>", argtype
);
12576 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
12577 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
12581 if (member
&& DECL_CONV_FN_P (r
))
12582 /* Type-conversion operator. Reconstruct the name, in
12583 case it's the name of one of the template's parameters. */
12584 DECL_NAME (r
) = make_conv_op_name (TREE_TYPE (type
));
12586 tree parms
= DECL_ARGUMENTS (t
);
12588 parms
= DECL_CHAIN (parms
);
12589 parms
= tsubst (parms
, args
, complain
, t
);
12590 for (tree parm
= parms
; parm
; parm
= DECL_CHAIN (parm
))
12591 DECL_CONTEXT (parm
) = r
;
12594 tree tparm
= build_this_parm (r
, closure
, type_memfn_quals (type
));
12595 DECL_CHAIN (tparm
) = parms
;
12598 DECL_ARGUMENTS (r
) = parms
;
12599 DECL_RESULT (r
) = NULL_TREE
;
12601 TREE_STATIC (r
) = 0;
12602 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
12603 DECL_EXTERNAL (r
) = 1;
12604 /* If this is an instantiation of a function with internal
12605 linkage, we already know what object file linkage will be
12606 assigned to the instantiation. */
12607 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
12608 DECL_DEFER_OUTPUT (r
) = 0;
12609 DECL_CHAIN (r
) = NULL_TREE
;
12610 DECL_PENDING_INLINE_INFO (r
) = 0;
12611 DECL_PENDING_INLINE_P (r
) = 0;
12612 DECL_SAVED_TREE (r
) = NULL_TREE
;
12613 DECL_STRUCT_FUNCTION (r
) = NULL
;
12615 /* We'll re-clone as appropriate in instantiate_template. */
12616 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
12618 /* If we aren't complaining now, return on error before we register
12619 the specialization so that we'll complain eventually. */
12620 if ((complain
& tf_error
) == 0
12621 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
12622 && !grok_op_properties (r
, /*complain=*/false))
12623 return error_mark_node
;
12625 /* When instantiating a constrained member, substitute
12626 into the constraints to create a new constraint. */
12627 if (tree ci
= get_constraints (t
))
12630 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
12631 set_constraints (r
, ci
);
12634 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
12635 this in the special friend case mentioned above where
12636 GEN_TMPL is NULL. */
12637 if (gen_tmpl
&& !closure
)
12639 DECL_TEMPLATE_INFO (r
)
12640 = build_template_info (gen_tmpl
, argvec
);
12641 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12644 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12646 /* We instantiated this while substituting into
12647 the type earlier (template/friend54.C). */
12650 /* We're not supposed to instantiate default arguments
12651 until they are called, for a template. But, for a
12654 template <class T> void f ()
12655 { extern void g(int i = T()); }
12657 we should do the substitution when the template is
12658 instantiated. We handle the member function case in
12659 instantiate_class_template since the default arguments
12660 might refer to other members of the class. */
12662 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
12663 && !uses_template_parms (argvec
))
12664 tsubst_default_arguments (r
, complain
);
12667 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
12669 /* Copy the list of befriending classes. */
12670 for (tree
*friends
= &DECL_BEFRIENDING_CLASSES (r
);
12672 friends
= &TREE_CHAIN (*friends
))
12674 *friends
= copy_node (*friends
);
12675 TREE_VALUE (*friends
)
12676 = tsubst (TREE_VALUE (*friends
), args
, complain
, in_decl
);
12679 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
12681 maybe_retrofit_in_chrg (r
);
12682 if (DECL_CONSTRUCTOR_P (r
) && !grok_ctor_properties (ctx
, r
))
12683 return error_mark_node
;
12684 /* If this is an instantiation of a member template, clone it.
12685 If it isn't, that'll be handled by
12686 clone_constructors_and_destructors. */
12687 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
12688 clone_function_decl (r
, /*update_methods=*/false);
12690 else if ((complain
& tf_error
) != 0
12691 && IDENTIFIER_ANY_OP_P (DECL_NAME (r
))
12692 && !grok_op_properties (r
, /*complain=*/true))
12693 return error_mark_node
;
12695 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
12696 SET_DECL_FRIEND_CONTEXT (r
,
12697 tsubst (DECL_FRIEND_CONTEXT (t
),
12698 args
, complain
, in_decl
));
12700 /* Possibly limit visibility based on template args. */
12701 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12702 if (DECL_VISIBILITY_SPECIFIED (t
))
12704 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12705 DECL_ATTRIBUTES (r
)
12706 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12708 determine_visibility (r
);
12709 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
12710 && !processing_template_decl
)
12711 defaulted_late_check (r
);
12713 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12714 args
, complain
, in_decl
);
12718 /* Subroutine of tsubst_decl for the case when T is a TEMPLATE_DECL. */
12721 tsubst_template_decl (tree t
, tree args
, tsubst_flags_t complain
,
12722 tree lambda_fntype
)
12724 /* We can get here when processing a member function template,
12725 member class template, or template template parameter. */
12726 tree decl
= DECL_TEMPLATE_RESULT (t
);
12732 hashval_t hash
= 0;
12734 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12736 /* Template template parameter is treated here. */
12737 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12738 if (new_type
== error_mark_node
)
12739 r
= error_mark_node
;
12740 /* If we get a real template back, return it. This can happen in
12741 the context of most_specialized_partial_spec. */
12742 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
12745 /* The new TEMPLATE_DECL was built in
12746 reduce_template_parm_level. */
12747 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
12751 if (!lambda_fntype
)
12753 /* We might already have an instance of this template.
12754 The ARGS are for the surrounding class type, so the
12755 full args contain the tsubst'd args for the context,
12756 plus the innermost args from the template decl. */
12757 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
12758 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
12759 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
12760 /* Because this is a template, the arguments will still be
12761 dependent, even after substitution. If
12762 PROCESSING_TEMPLATE_DECL is not set, the dependency
12763 predicates will short-circuit. */
12764 ++processing_template_decl
;
12765 full_args
= tsubst_template_args (tmpl_args
, args
,
12766 complain
, in_decl
);
12767 --processing_template_decl
;
12768 if (full_args
== error_mark_node
)
12769 return error_mark_node
;
12771 /* If this is a default template template argument,
12772 tsubst might not have changed anything. */
12773 if (full_args
== tmpl_args
)
12776 hash
= hash_tmpl_and_args (t
, full_args
);
12777 spec
= retrieve_specialization (t
, full_args
, hash
);
12778 if (spec
!= NULL_TREE
)
12782 /* Make a new template decl. It will be similar to the
12783 original, but will record the current template arguments.
12784 We also create a new function declaration, which is just
12785 like the old one, but points to this new template, rather
12786 than the old one. */
12788 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
12789 DECL_CHAIN (r
) = NULL_TREE
;
12791 // Build new template info linking to the original template decl.
12792 if (!lambda_fntype
)
12794 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12795 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12798 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
12800 /* The template parameters for this new template are all the
12801 template parameters for the old template, except the
12802 outermost level of parameters. */
12803 DECL_TEMPLATE_PARMS (r
)
12804 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
12807 if (TREE_CODE (decl
) == TYPE_DECL
12808 && !TYPE_DECL_ALIAS_P (decl
))
12811 ++processing_template_decl
;
12812 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12813 --processing_template_decl
;
12814 if (new_type
== error_mark_node
)
12815 return error_mark_node
;
12817 TREE_TYPE (r
) = new_type
;
12818 /* For a partial specialization, we need to keep pointing to
12819 the primary template. */
12820 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
12821 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
12822 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
12823 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
12824 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
12829 ++processing_template_decl
;
12830 if (TREE_CODE (decl
) == FUNCTION_DECL
)
12831 new_decl
= tsubst_function_decl (decl
, args
, complain
, lambda_fntype
);
12833 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
12834 --processing_template_decl
;
12835 if (new_decl
== error_mark_node
)
12836 return error_mark_node
;
12838 DECL_TEMPLATE_RESULT (r
) = new_decl
;
12839 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
12840 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
12843 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (r
));
12844 DECL_TEMPLATE_INFO (new_decl
) = build_template_info (r
, args
);
12848 DECL_TI_TEMPLATE (new_decl
) = r
;
12849 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
12853 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
12854 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
12856 if (PRIMARY_TEMPLATE_P (t
))
12857 DECL_PRIMARY_TEMPLATE (r
) = r
;
12859 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
)
12861 /* Record this non-type partial instantiation. */
12862 register_specialization (r
, t
,
12863 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
12869 /* True if FN is the op() for a lambda in an uninstantiated template. */
12872 lambda_fn_in_template_p (tree fn
)
12874 if (!fn
|| !LAMBDA_FUNCTION_P (fn
))
12876 tree closure
= DECL_CONTEXT (fn
);
12877 return CLASSTYPE_TEMPLATE_INFO (closure
) != NULL_TREE
;
12880 /* We're instantiating a variable from template function TCTX. Return the
12881 corresponding current enclosing scope. This gets complicated because lambda
12882 functions in templates are regenerated rather than instantiated, but generic
12883 lambda functions are subsequently instantiated. */
12886 enclosing_instantiation_of (tree otctx
)
12889 tree fn
= current_function_decl
;
12890 int lambda_count
= 0;
12892 for (; tctx
&& lambda_fn_in_template_p (tctx
);
12893 tctx
= decl_function_context (tctx
))
12895 for (; fn
; fn
= decl_function_context (fn
))
12898 int flambda_count
= 0;
12899 for (; flambda_count
< lambda_count
&& fn
&& LAMBDA_FUNCTION_P (fn
);
12900 fn
= decl_function_context (fn
))
12902 if (DECL_TEMPLATE_INFO (fn
)
12903 ? most_general_template (fn
) != most_general_template (tctx
)
12906 gcc_assert (DECL_NAME (ofn
) == DECL_NAME (otctx
)
12907 || DECL_CONV_FN_P (ofn
));
12910 gcc_unreachable ();
12913 /* Substitute the ARGS into the T, which is a _DECL. Return the
12914 result of the substitution. Issue error and warning messages under
12915 control of COMPLAIN. */
12918 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
12920 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
12921 location_t saved_loc
;
12922 tree r
= NULL_TREE
;
12924 hashval_t hash
= 0;
12926 /* Set the filename and linenumber to improve error-reporting. */
12927 saved_loc
= input_location
;
12928 input_location
= DECL_SOURCE_LOCATION (t
);
12930 switch (TREE_CODE (t
))
12932 case TEMPLATE_DECL
:
12933 r
= tsubst_template_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
12936 case FUNCTION_DECL
:
12937 r
= tsubst_function_decl (t
, args
, complain
, /*lambda*/NULL_TREE
);
12942 tree type
= NULL_TREE
;
12944 tree expanded_types
= NULL_TREE
;
12945 tree prev_r
= NULL_TREE
;
12946 tree first_r
= NULL_TREE
;
12948 if (DECL_PACK_P (t
))
12950 /* If there is a local specialization that isn't a
12951 parameter pack, it means that we're doing a "simple"
12952 substitution from inside tsubst_pack_expansion. Just
12953 return the local specialization (which will be a single
12955 tree spec
= retrieve_local_specialization (t
);
12957 && TREE_CODE (spec
) == PARM_DECL
12958 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
12961 /* Expand the TYPE_PACK_EXPANSION that provides the types for
12962 the parameters in this function parameter pack. */
12963 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
12964 complain
, in_decl
);
12965 if (TREE_CODE (expanded_types
) == TREE_VEC
)
12967 len
= TREE_VEC_LENGTH (expanded_types
);
12969 /* Zero-length parameter packs are boring. Just substitute
12972 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
12977 /* All we did was update the type. Make a note of that. */
12978 type
= expanded_types
;
12979 expanded_types
= NULL_TREE
;
12983 /* Loop through all of the parameters we'll build. When T is
12984 a function parameter pack, LEN is the number of expanded
12985 types in EXPANDED_TYPES; otherwise, LEN is 1. */
12987 for (i
= 0; i
< len
; ++i
)
12991 if (DECL_TEMPLATE_PARM_P (t
))
12992 SET_DECL_TEMPLATE_PARM_P (r
);
12994 if (expanded_types
)
12995 /* We're on the Ith parameter of the function parameter
12998 /* Get the Ith type. */
12999 type
= TREE_VEC_ELT (expanded_types
, i
);
13001 /* Rename the parameter to include the index. */
13003 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13006 /* We're dealing with a normal parameter. */
13007 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13009 type
= type_decays_to (type
);
13010 TREE_TYPE (r
) = type
;
13011 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13013 if (DECL_INITIAL (r
))
13015 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
13016 DECL_INITIAL (r
) = TREE_TYPE (r
);
13018 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
13019 complain
, in_decl
);
13022 DECL_CONTEXT (r
) = NULL_TREE
;
13024 if (!DECL_TEMPLATE_PARM_P (r
))
13025 DECL_ARG_TYPE (r
) = type_passed_as (type
);
13027 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13028 args
, complain
, in_decl
);
13030 /* Keep track of the first new parameter we
13031 generate. That's what will be returned to the
13036 /* Build a proper chain of parameters when substituting
13037 into a function parameter pack. */
13039 DECL_CHAIN (prev_r
) = r
;
13042 /* If cp_unevaluated_operand is set, we're just looking for a
13043 single dummy parameter, so don't keep going. */
13044 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
13045 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
13046 complain
, DECL_CHAIN (t
));
13048 /* FIRST_R contains the start of the chain we've built. */
13055 tree type
= NULL_TREE
;
13056 tree vec
= NULL_TREE
;
13057 tree expanded_types
= NULL_TREE
;
13060 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13062 /* This field is a lambda capture pack. Return a TREE_VEC of
13063 the expanded fields to instantiate_class_template_1. */
13064 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
13065 complain
, in_decl
);
13066 if (TREE_CODE (expanded_types
) == TREE_VEC
)
13068 len
= TREE_VEC_LENGTH (expanded_types
);
13069 vec
= make_tree_vec (len
);
13073 /* All we did was update the type. Make a note of that. */
13074 type
= expanded_types
;
13075 expanded_types
= NULL_TREE
;
13079 for (int i
= 0; i
< len
; ++i
)
13082 if (expanded_types
)
13084 type
= TREE_VEC_ELT (expanded_types
, i
);
13086 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
13089 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13091 if (type
== error_mark_node
)
13092 RETURN (error_mark_node
);
13093 TREE_TYPE (r
) = type
;
13094 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13096 if (DECL_C_BIT_FIELD (r
))
13097 /* For bit-fields, DECL_BIT_FIELD_REPRESENTATIVE gives the
13099 DECL_BIT_FIELD_REPRESENTATIVE (r
)
13100 = tsubst_expr (DECL_BIT_FIELD_REPRESENTATIVE (t
), args
,
13102 /*integral_constant_expression_p=*/true);
13103 if (DECL_INITIAL (t
))
13105 /* Set up DECL_TEMPLATE_INFO so that we can get at the
13106 NSDMI in perform_member_init. Still set DECL_INITIAL
13107 so that we know there is one. */
13108 DECL_INITIAL (r
) = void_node
;
13109 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
13110 retrofit_lang_decl (r
);
13111 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
13113 /* We don't have to set DECL_CONTEXT here; it is set by
13114 finish_member_declaration. */
13115 DECL_CHAIN (r
) = NULL_TREE
;
13117 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
13118 args
, complain
, in_decl
);
13121 TREE_VEC_ELT (vec
, i
) = r
;
13130 /* We reach here only for member using decls. We also need to check
13131 uses_template_parms because DECL_DEPENDENT_P is not set for a
13132 using-declaration that designates a member of the current
13133 instantiation (c++/53549). */
13134 if (DECL_DEPENDENT_P (t
)
13135 || uses_template_parms (USING_DECL_SCOPE (t
)))
13137 tree scope
= USING_DECL_SCOPE (t
);
13138 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
13139 if (PACK_EXPANSION_P (scope
))
13141 tree vec
= tsubst_pack_expansion (scope
, args
, complain
, in_decl
);
13142 int len
= TREE_VEC_LENGTH (vec
);
13143 r
= make_tree_vec (len
);
13144 for (int i
= 0; i
< len
; ++i
)
13146 tree escope
= TREE_VEC_ELT (vec
, i
);
13147 tree elt
= do_class_using_decl (escope
, name
);
13150 r
= error_mark_node
;
13155 TREE_PROTECTED (elt
) = TREE_PROTECTED (t
);
13156 TREE_PRIVATE (elt
) = TREE_PRIVATE (t
);
13158 TREE_VEC_ELT (r
, i
) = elt
;
13163 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
13164 complain
, in_decl
);
13165 r
= do_class_using_decl (inst_scope
, name
);
13167 r
= error_mark_node
;
13170 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
13171 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
13178 DECL_CHAIN (r
) = NULL_TREE
;
13185 tree argvec
= NULL_TREE
;
13186 tree gen_tmpl
= NULL_TREE
;
13188 tree tmpl
= NULL_TREE
;
13190 tree type
= NULL_TREE
;
13193 if (TREE_TYPE (t
) == error_mark_node
)
13194 RETURN (error_mark_node
);
13196 if (TREE_CODE (t
) == TYPE_DECL
13197 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
13199 /* If this is the canonical decl, we don't have to
13200 mess with instantiations, and often we can't (for
13201 typename, template type parms and such). Note that
13202 TYPE_NAME is not correct for the above test if
13203 we've copied the type for a typedef. */
13204 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13205 if (type
== error_mark_node
)
13206 RETURN (error_mark_node
);
13207 r
= TYPE_NAME (type
);
13211 /* Check to see if we already have the specialization we
13214 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
13216 /* T is a static data member or namespace-scope entity.
13217 We have to substitute into namespace-scope variables
13218 (not just variable templates) because of cases like:
13220 template <class T> void f() { extern T t; }
13222 where the entity referenced is not known until
13223 instantiation time. */
13225 ctx
= DECL_CONTEXT (t
);
13226 if (DECL_CLASS_SCOPE_P (t
))
13228 ctx
= tsubst_aggr_type (ctx
, args
,
13230 in_decl
, /*entering_scope=*/1);
13231 /* If CTX is unchanged, then T is in fact the
13232 specialization we want. That situation occurs when
13233 referencing a static data member within in its own
13234 class. We can use pointer equality, rather than
13235 same_type_p, because DECL_CONTEXT is always
13237 if (ctx
== DECL_CONTEXT (t
)
13238 /* ... unless T is a member template; in which
13239 case our caller can be willing to create a
13240 specialization of that template represented
13242 && !(DECL_TI_TEMPLATE (t
)
13243 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
13249 tmpl
= DECL_TI_TEMPLATE (t
);
13250 gen_tmpl
= most_general_template (tmpl
);
13251 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
13252 if (argvec
!= error_mark_node
)
13253 argvec
= (coerce_innermost_template_parms
13254 (DECL_TEMPLATE_PARMS (gen_tmpl
),
13255 argvec
, t
, complain
,
13256 /*all*/true, /*defarg*/true));
13257 if (argvec
== error_mark_node
)
13258 RETURN (error_mark_node
);
13259 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
13260 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
13265 /* A local variable. */
13267 /* Subsequent calls to pushdecl will fill this in. */
13269 /* Unless this is a reference to a static variable from an
13270 enclosing function, in which case we need to fill it in now. */
13271 if (TREE_STATIC (t
))
13273 tree fn
= enclosing_instantiation_of (DECL_CONTEXT (t
));
13274 if (fn
!= current_function_decl
)
13277 spec
= retrieve_local_specialization (t
);
13279 /* If we already have the specialization we need, there is
13280 nothing more to do. */
13287 /* Create a new node for the specialization we need. */
13289 if (type
== NULL_TREE
)
13291 if (is_typedef_decl (t
))
13292 type
= DECL_ORIGINAL_TYPE (t
);
13294 type
= TREE_TYPE (t
);
13296 && VAR_HAD_UNKNOWN_BOUND (t
)
13297 && type
!= error_mark_node
)
13298 type
= strip_array_domain (type
);
13299 tree sub_args
= args
;
13300 if (tree auto_node
= type_uses_auto (type
))
13302 /* Mask off any template args past the variable's context so we
13303 don't replace the auto with an unrelated argument. */
13304 int nouter
= TEMPLATE_TYPE_LEVEL (auto_node
) - 1;
13305 int extra
= TMPL_ARGS_DEPTH (args
) - nouter
;
13307 /* This should never happen with the new lambda instantiation
13308 model, but keep the handling just in case. */
13309 gcc_assert (!CHECKING_P
),
13310 sub_args
= strip_innermost_template_args (args
, extra
);
13312 type
= tsubst (type
, sub_args
, complain
, in_decl
);
13316 /* Even if the original location is out of scope, the
13317 newly substituted one is not. */
13318 DECL_DEAD_FOR_LOCAL (r
) = 0;
13319 DECL_INITIALIZED_P (r
) = 0;
13320 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
13321 if (type
== error_mark_node
)
13322 RETURN (error_mark_node
);
13323 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13325 /* It may seem that this case cannot occur, since:
13330 declares a function, not a variable. However:
13333 template <typename T> void g() { T t; }
13334 template void g<f>();
13336 is an attempt to declare a variable with function
13338 error ("variable %qD has function type",
13339 /* R is not yet sufficiently initialized, so we
13340 just use its name. */
13342 RETURN (error_mark_node
);
13344 type
= complete_type (type
);
13345 /* Wait until cp_finish_decl to set this again, to handle
13346 circular dependency (template/instantiate6.C). */
13347 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
13348 type
= check_var_type (DECL_NAME (r
), type
);
13350 if (DECL_HAS_VALUE_EXPR_P (t
))
13352 tree ve
= DECL_VALUE_EXPR (t
);
13353 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
13354 /*constant_expression_p=*/false);
13355 if (REFERENCE_REF_P (ve
))
13357 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
13358 ve
= TREE_OPERAND (ve
, 0);
13360 SET_DECL_VALUE_EXPR (r
, ve
);
13362 if (CP_DECL_THREAD_LOCAL_P (r
)
13363 && !processing_template_decl
)
13364 set_decl_tls_model (r
, decl_default_tls_model (r
));
13366 else if (DECL_SELF_REFERENCE_P (t
))
13367 SET_DECL_SELF_REFERENCE_P (r
);
13368 TREE_TYPE (r
) = type
;
13369 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
13370 DECL_CONTEXT (r
) = ctx
;
13371 /* Clear out the mangled name and RTL for the instantiation. */
13372 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
13373 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
13374 SET_DECL_RTL (r
, NULL
);
13375 /* The initializer must not be expanded until it is required;
13376 see [temp.inst]. */
13377 DECL_INITIAL (r
) = NULL_TREE
;
13378 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
13381 if (DECL_LANG_SPECIFIC (r
))
13382 SET_DECL_DEPENDENT_INIT_P (r
, false);
13384 SET_DECL_MODE (r
, VOIDmode
);
13386 /* Possibly limit visibility based on template args. */
13387 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
13388 if (DECL_VISIBILITY_SPECIFIED (t
))
13390 DECL_VISIBILITY_SPECIFIED (r
) = 0;
13391 DECL_ATTRIBUTES (r
)
13392 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
13394 determine_visibility (r
);
13399 /* A static data member declaration is always marked
13400 external when it is declared in-class, even if an
13401 initializer is present. We mimic the non-template
13402 processing here. */
13403 DECL_EXTERNAL (r
) = 1;
13404 if (DECL_NAMESPACE_SCOPE_P (t
))
13405 DECL_NOT_REALLY_EXTERN (r
) = 1;
13407 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
13408 SET_DECL_IMPLICIT_INSTANTIATION (r
);
13409 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
13413 if (DECL_LANG_SPECIFIC (r
))
13414 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
13415 if (!cp_unevaluated_operand
)
13416 register_local_specialization (r
, t
);
13419 DECL_CHAIN (r
) = NULL_TREE
;
13421 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
13423 args
, complain
, in_decl
);
13425 /* Preserve a typedef that names a type. */
13426 if (is_typedef_decl (r
) && type
!= error_mark_node
)
13428 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
13429 set_underlying_type (r
);
13430 if (TYPE_DECL_ALIAS_P (r
))
13431 /* An alias template specialization can be dependent
13432 even if its underlying type is not. */
13433 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
13436 layout_decl (r
, 0);
13441 gcc_unreachable ();
13446 /* Restore the file and line information. */
13447 input_location
= saved_loc
;
13452 /* Substitute into the ARG_TYPES of a function type.
13453 If END is a TREE_CHAIN, leave it and any following types
13457 tsubst_arg_types (tree arg_types
,
13460 tsubst_flags_t complain
,
13463 tree remaining_arg_types
;
13464 tree type
= NULL_TREE
;
13466 tree expanded_args
= NULL_TREE
;
13469 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
13472 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
13473 args
, end
, complain
, in_decl
);
13474 if (remaining_arg_types
== error_mark_node
)
13475 return error_mark_node
;
13477 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
13479 /* For a pack expansion, perform substitution on the
13480 entire expression. Later on, we'll handle the arguments
13482 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
13483 args
, complain
, in_decl
);
13485 if (TREE_CODE (expanded_args
) == TREE_VEC
)
13486 /* So that we'll spin through the parameters, one by one. */
13487 i
= TREE_VEC_LENGTH (expanded_args
);
13490 /* We only partially substituted into the parameter
13491 pack. Our type is TYPE_PACK_EXPANSION. */
13492 type
= expanded_args
;
13493 expanded_args
= NULL_TREE
;
13501 type
= TREE_VEC_ELT (expanded_args
, i
);
13503 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
13505 if (type
== error_mark_node
)
13506 return error_mark_node
;
13507 if (VOID_TYPE_P (type
))
13509 if (complain
& tf_error
)
13511 error ("invalid parameter type %qT", type
);
13513 error ("in declaration %q+D", in_decl
);
13515 return error_mark_node
;
13518 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
13519 return error_mark_node
;
13521 /* Do array-to-pointer, function-to-pointer conversion, and ignore
13522 top-level qualifiers as required. */
13523 type
= cv_unqualified (type_decays_to (type
));
13525 /* We do not substitute into default arguments here. The standard
13526 mandates that they be instantiated only when needed, which is
13527 done in build_over_call. */
13528 default_arg
= TREE_PURPOSE (arg_types
);
13530 /* Except that we do substitute default arguments under tsubst_lambda_expr,
13531 since the new op() won't have any associated template arguments for us
13532 to refer to later. */
13533 if (lambda_fn_in_template_p (in_decl
))
13534 default_arg
= tsubst_copy_and_build (default_arg
, args
, complain
, in_decl
,
13535 false/*fn*/, false/*constexpr*/);
13537 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
13539 /* We've instantiated a template before its default arguments
13540 have been parsed. This can happen for a nested template
13541 class, and is not an error unless we require the default
13542 argument in a call of this function. */
13543 remaining_arg_types
=
13544 tree_cons (default_arg
, type
, remaining_arg_types
);
13545 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
13548 remaining_arg_types
=
13549 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
13552 return remaining_arg_types
;
13555 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
13556 *not* handle the exception-specification for FNTYPE, because the
13557 initial substitution of explicitly provided template parameters
13558 during argument deduction forbids substitution into the
13559 exception-specification:
13563 All references in the function type of the function template to the
13564 corresponding template parameters are replaced by the specified tem-
13565 plate argument values. If a substitution in a template parameter or
13566 in the function type of the function template results in an invalid
13567 type, type deduction fails. [Note: The equivalent substitution in
13568 exception specifications is done only when the function is instanti-
13569 ated, at which point a program is ill-formed if the substitution
13570 results in an invalid type.] */
13573 tsubst_function_type (tree t
,
13575 tsubst_flags_t complain
,
13579 tree arg_types
= NULL_TREE
;
13582 /* The TYPE_CONTEXT is not used for function/method types. */
13583 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
13585 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
13587 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
13589 if (late_return_type_p
)
13591 /* Substitute the argument types. */
13592 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
13593 complain
, in_decl
);
13594 if (arg_types
== error_mark_node
)
13595 return error_mark_node
;
13597 tree save_ccp
= current_class_ptr
;
13598 tree save_ccr
= current_class_ref
;
13599 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
13600 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
13601 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
13604 /* DR 1207: 'this' is in scope in the trailing return type. */
13605 inject_this_parameter (this_type
, cp_type_quals (this_type
));
13608 /* Substitute the return type. */
13609 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13613 current_class_ptr
= save_ccp
;
13614 current_class_ref
= save_ccr
;
13618 /* Substitute the return type. */
13619 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13621 if (return_type
== error_mark_node
)
13622 return error_mark_node
;
13623 /* DR 486 clarifies that creation of a function type with an
13624 invalid return type is a deduction failure. */
13625 if (TREE_CODE (return_type
) == ARRAY_TYPE
13626 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
13628 if (complain
& tf_error
)
13630 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
13631 error ("function returning an array");
13633 error ("function returning a function");
13635 return error_mark_node
;
13638 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
13639 return error_mark_node
;
13641 if (!late_return_type_p
)
13643 /* Substitute the argument types. */
13644 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
13645 complain
, in_decl
);
13646 if (arg_types
== error_mark_node
)
13647 return error_mark_node
;
13650 /* Construct a new type node and return it. */
13651 if (TREE_CODE (t
) == FUNCTION_TYPE
)
13653 fntype
= build_function_type (return_type
, arg_types
);
13654 fntype
= apply_memfn_quals (fntype
,
13655 type_memfn_quals (t
),
13656 type_memfn_rqual (t
));
13660 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
13661 /* Don't pick up extra function qualifiers from the basetype. */
13662 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
13663 if (! MAYBE_CLASS_TYPE_P (r
))
13667 Type deduction may fail for any of the following
13670 -- Attempting to create "pointer to member of T" when T
13671 is not a class type. */
13672 if (complain
& tf_error
)
13673 error ("creating pointer to member function of non-class type %qT",
13675 return error_mark_node
;
13678 fntype
= build_method_type_directly (r
, return_type
,
13679 TREE_CHAIN (arg_types
));
13680 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
13682 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
13684 if (late_return_type_p
)
13685 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
13690 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
13691 ARGS into that specification, and return the substituted
13692 specification. If there is no specification, return NULL_TREE. */
13695 tsubst_exception_specification (tree fntype
,
13697 tsubst_flags_t complain
,
13704 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
13705 new_specs
= NULL_TREE
;
13706 if (specs
&& TREE_PURPOSE (specs
))
13708 /* A noexcept-specifier. */
13709 tree expr
= TREE_PURPOSE (specs
);
13710 if (TREE_CODE (expr
) == INTEGER_CST
)
13714 /* Defer instantiation of noexcept-specifiers to avoid
13715 excessive instantiations (c++/49107). */
13716 new_specs
= make_node (DEFERRED_NOEXCEPT
);
13717 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
13719 /* We already partially instantiated this member template,
13720 so combine the new args with the old. */
13721 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
13722 = DEFERRED_NOEXCEPT_PATTERN (expr
);
13723 DEFERRED_NOEXCEPT_ARGS (new_specs
)
13724 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
13728 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
13729 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
13733 new_specs
= tsubst_copy_and_build
13734 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
13735 /*integral_constant_expression_p=*/true);
13736 new_specs
= build_noexcept_spec (new_specs
, complain
);
13740 if (! TREE_VALUE (specs
))
13747 tree expanded_specs
= NULL_TREE
;
13749 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
13751 /* Expand the pack expansion type. */
13752 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
13756 if (expanded_specs
== error_mark_node
)
13757 return error_mark_node
;
13758 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
13759 len
= TREE_VEC_LENGTH (expanded_specs
);
13762 /* We're substituting into a member template, so
13763 we got a TYPE_PACK_EXPANSION back. Add that
13764 expansion and move on. */
13765 gcc_assert (TREE_CODE (expanded_specs
)
13766 == TYPE_PACK_EXPANSION
);
13767 new_specs
= add_exception_specifier (new_specs
,
13770 specs
= TREE_CHAIN (specs
);
13775 for (i
= 0; i
< len
; ++i
)
13777 if (expanded_specs
)
13778 spec
= TREE_VEC_ELT (expanded_specs
, i
);
13780 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
13781 if (spec
== error_mark_node
)
13783 new_specs
= add_exception_specifier (new_specs
, spec
,
13787 specs
= TREE_CHAIN (specs
);
13793 /* Take the tree structure T and replace template parameters used
13794 therein with the argument vector ARGS. IN_DECL is an associated
13795 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
13796 Issue error and warning messages under control of COMPLAIN. Note
13797 that we must be relatively non-tolerant of extensions here, in
13798 order to preserve conformance; if we allow substitutions that
13799 should not be allowed, we may allow argument deductions that should
13800 not succeed, and therefore report ambiguous overload situations
13801 where there are none. In theory, we could allow the substitution,
13802 but indicate that it should have failed, and allow our caller to
13803 make sure that the right thing happens, but we don't try to do this
13806 This function is used for dealing with types, decls and the like;
13807 for expressions, use tsubst_expr or tsubst_copy. */
13810 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13812 enum tree_code code
;
13813 tree type
, r
= NULL_TREE
;
13815 if (t
== NULL_TREE
|| t
== error_mark_node
13816 || t
== integer_type_node
13817 || t
== void_type_node
13818 || t
== char_type_node
13819 || t
== unknown_type_node
13820 || TREE_CODE (t
) == NAMESPACE_DECL
13821 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
13825 return tsubst_decl (t
, args
, complain
);
13827 if (args
== NULL_TREE
)
13830 code
= TREE_CODE (t
);
13832 if (code
== IDENTIFIER_NODE
)
13833 type
= IDENTIFIER_TYPE_VALUE (t
);
13835 type
= TREE_TYPE (t
);
13837 gcc_assert (type
!= unknown_type_node
);
13839 /* Reuse typedefs. We need to do this to handle dependent attributes,
13840 such as attribute aligned. */
13842 && typedef_variant_p (t
))
13844 tree decl
= TYPE_NAME (t
);
13846 if (alias_template_specialization_p (t
))
13848 /* DECL represents an alias template and we want to
13850 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
13851 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
13852 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
13854 else if (DECL_CLASS_SCOPE_P (decl
)
13855 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
13856 && uses_template_parms (DECL_CONTEXT (decl
)))
13858 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
13859 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
13860 r
= retrieve_specialization (tmpl
, gen_args
, 0);
13862 else if (DECL_FUNCTION_SCOPE_P (decl
)
13863 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
13864 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
13865 r
= retrieve_local_specialization (decl
);
13867 /* The typedef is from a non-template context. */
13873 r
= cp_build_qualified_type_real
13874 (r
, cp_type_quals (t
) | cp_type_quals (r
),
13875 complain
| tf_ignore_bad_quals
);
13880 /* We don't have an instantiation yet, so drop the typedef. */
13881 int quals
= cp_type_quals (t
);
13882 t
= DECL_ORIGINAL_TYPE (decl
);
13883 t
= cp_build_qualified_type_real (t
, quals
,
13884 complain
| tf_ignore_bad_quals
);
13888 bool fndecl_type
= (complain
& tf_fndecl_type
);
13889 complain
&= ~tf_fndecl_type
;
13892 && code
!= TYPENAME_TYPE
13893 && code
!= TEMPLATE_TYPE_PARM
13894 && code
!= TEMPLATE_PARM_INDEX
13895 && code
!= IDENTIFIER_NODE
13896 && code
!= FUNCTION_TYPE
13897 && code
!= METHOD_TYPE
)
13898 type
= tsubst (type
, args
, complain
, in_decl
);
13899 if (type
== error_mark_node
)
13900 return error_mark_node
;
13906 case ENUMERAL_TYPE
:
13907 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
13908 /*entering_scope=*/0);
13911 case IDENTIFIER_NODE
:
13922 if (t
== integer_type_node
)
13925 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
13926 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
13930 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
13932 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
13933 /*integral_constant_expression_p=*/false);
13935 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
13937 if (TREE_CODE (max
) == NOP_EXPR
13938 && TREE_SIDE_EFFECTS (omax
)
13939 && !TREE_TYPE (max
))
13940 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
13942 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
13943 with TREE_SIDE_EFFECTS that indicates this is not an integral
13944 constant expression. */
13945 if (processing_template_decl
13946 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
13948 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
13949 TREE_SIDE_EFFECTS (max
) = 1;
13952 return compute_array_index_type (NULL_TREE
, max
, complain
);
13955 case TEMPLATE_TYPE_PARM
:
13956 case TEMPLATE_TEMPLATE_PARM
:
13957 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13958 case TEMPLATE_PARM_INDEX
:
13963 tree arg
= NULL_TREE
;
13965 /* Early in template argument deduction substitution, we don't
13966 want to reduce the level of 'auto', or it will be confused
13967 with a normal template parm in subsequent deduction. */
13968 if (is_auto (t
) && (complain
& tf_partial
))
13973 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
13974 template_parm_level_and_index (t
, &level
, &idx
);
13976 levels
= TMPL_ARGS_DEPTH (args
);
13977 if (level
<= levels
13978 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
13980 arg
= TMPL_ARG (args
, level
, idx
);
13982 /* See through ARGUMENT_PACK_SELECT arguments. */
13983 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
13984 arg
= argument_pack_select_arg (arg
);
13987 if (arg
== error_mark_node
)
13988 return error_mark_node
;
13989 else if (arg
!= NULL_TREE
)
13991 if (ARGUMENT_PACK_P (arg
))
13992 /* If ARG is an argument pack, we don't actually want to
13993 perform a substitution here, because substitutions
13994 for argument packs are only done
13995 element-by-element. We can get to this point when
13996 substituting the type of a non-type template
13997 parameter pack, when that type actually contains
13998 template parameter packs from an outer template, e.g.,
14000 template<typename... Types> struct A {
14001 template<Types... Values> struct B { };
14005 if (code
== TEMPLATE_TYPE_PARM
)
14008 gcc_assert (TYPE_P (arg
));
14010 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
14012 return cp_build_qualified_type_real
14013 (arg
, quals
, complain
| tf_ignore_bad_quals
);
14015 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
14017 /* We are processing a type constructed from a
14018 template template parameter. */
14019 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
14020 args
, complain
, in_decl
);
14021 if (argvec
== error_mark_node
)
14022 return error_mark_node
;
14024 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
14025 || TREE_CODE (arg
) == TEMPLATE_DECL
14026 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
14028 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
14029 /* Consider this code:
14031 template <template <class> class Template>
14033 template <class Arg> using Bind = Template<Arg>;
14036 template <template <class> class Template, class Arg>
14037 using Instantiate = Template<Arg>; //#0
14039 template <template <class> class Template,
14042 Instantiate<Internal<Template>::template Bind,
14045 When #1 is parsed, the
14046 BOUND_TEMPLATE_TEMPLATE_PARM representing the
14047 parameter `Template' in #0 matches the
14048 UNBOUND_CLASS_TEMPLATE representing the argument
14049 `Internal<Template>::template Bind'; We then want
14050 to assemble the type `Bind<Argument>' that can't
14051 be fully created right now, because
14052 `Internal<Template>' not being complete, the Bind
14053 template cannot be looked up in that context. So
14054 we need to "store" `Bind<Argument>' for later
14055 when the context of Bind becomes complete. Let's
14056 store that in a TYPENAME_TYPE. */
14057 return make_typename_type (TYPE_CONTEXT (arg
),
14058 build_nt (TEMPLATE_ID_EXPR
,
14059 TYPE_IDENTIFIER (arg
),
14064 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
14065 are resolving nested-types in the signature of a
14066 member function templates. Otherwise ARG is a
14067 TEMPLATE_DECL and is the real template to be
14069 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
14070 arg
= TYPE_NAME (arg
);
14072 r
= lookup_template_class (arg
,
14074 DECL_CONTEXT (arg
),
14075 /*entering_scope=*/0,
14077 return cp_build_qualified_type_real
14078 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
14080 else if (code
== TEMPLATE_TEMPLATE_PARM
)
14083 /* TEMPLATE_PARM_INDEX. */
14084 return convert_from_reference (unshare_expr (arg
));
14088 /* This can happen during the attempted tsubst'ing in
14089 unify. This means that we don't yet have any information
14090 about the template parameter in question. */
14093 /* If we get here, we must have been looking at a parm for a
14094 more deeply nested template. Make a new version of this
14095 template parameter, but with a lower level. */
14098 case TEMPLATE_TYPE_PARM
:
14099 case TEMPLATE_TEMPLATE_PARM
:
14100 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14101 if (cp_type_quals (t
))
14103 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
14104 r
= cp_build_qualified_type_real
14105 (r
, cp_type_quals (t
),
14106 complain
| (code
== TEMPLATE_TYPE_PARM
14107 ? tf_ignore_bad_quals
: 0));
14109 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
14110 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
14111 && (r
= (TEMPLATE_PARM_DESCENDANTS
14112 (TEMPLATE_TYPE_PARM_INDEX (t
))))
14113 && (r
= TREE_TYPE (r
))
14114 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
14115 /* Break infinite recursion when substituting the constraints
14116 of a constrained placeholder. */;
14120 TEMPLATE_TYPE_PARM_INDEX (r
)
14121 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
14122 r
, levels
, args
, complain
);
14123 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
14124 TYPE_MAIN_VARIANT (r
) = r
;
14125 TYPE_POINTER_TO (r
) = NULL_TREE
;
14126 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
14128 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
14130 /* Propagate constraints on placeholders. */
14131 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
14132 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
14133 = tsubst_constraint (constr
, args
, complain
, in_decl
);
14134 else if (tree pl
= CLASS_PLACEHOLDER_TEMPLATE (t
))
14136 pl
= tsubst_copy (pl
, args
, complain
, in_decl
);
14137 CLASS_PLACEHOLDER_TEMPLATE (r
) = pl
;
14141 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
14142 /* We have reduced the level of the template
14143 template parameter, but not the levels of its
14144 template parameters, so canonical_type_parameter
14145 will not be able to find the canonical template
14146 template parameter for this level. Thus, we
14147 require structural equality checking to compare
14148 TEMPLATE_TEMPLATE_PARMs. */
14149 SET_TYPE_STRUCTURAL_EQUALITY (r
);
14150 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
14151 SET_TYPE_STRUCTURAL_EQUALITY (r
);
14153 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
14155 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
14157 tree tinfo
= TYPE_TEMPLATE_INFO (t
);
14158 /* We might need to substitute into the types of non-type
14159 template parameters. */
14160 tree tmpl
= tsubst (TI_TEMPLATE (tinfo
), args
,
14161 complain
, in_decl
);
14162 if (tmpl
== error_mark_node
)
14163 return error_mark_node
;
14164 tree argvec
= tsubst (TI_ARGS (tinfo
), args
,
14165 complain
, in_decl
);
14166 if (argvec
== error_mark_node
)
14167 return error_mark_node
;
14169 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
14170 = build_template_info (tmpl
, argvec
);
14175 case TEMPLATE_PARM_INDEX
:
14176 /* OK, now substitute the type of the non-type parameter. We
14177 couldn't do it earlier because it might be an auto parameter,
14178 and we wouldn't need to if we had an argument. */
14179 type
= tsubst (type
, args
, complain
, in_decl
);
14180 if (type
== error_mark_node
)
14181 return error_mark_node
;
14182 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
14186 gcc_unreachable ();
14194 tree purpose
, value
, chain
;
14196 if (t
== void_list_node
)
14199 purpose
= TREE_PURPOSE (t
);
14202 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
14203 if (purpose
== error_mark_node
)
14204 return error_mark_node
;
14206 value
= TREE_VALUE (t
);
14209 value
= tsubst (value
, args
, complain
, in_decl
);
14210 if (value
== error_mark_node
)
14211 return error_mark_node
;
14213 chain
= TREE_CHAIN (t
);
14214 if (chain
&& chain
!= void_type_node
)
14216 chain
= tsubst (chain
, args
, complain
, in_decl
);
14217 if (chain
== error_mark_node
)
14218 return error_mark_node
;
14220 if (purpose
== TREE_PURPOSE (t
)
14221 && value
== TREE_VALUE (t
)
14222 && chain
== TREE_CHAIN (t
))
14224 return hash_tree_cons (purpose
, value
, chain
);
14228 /* We should never be tsubsting a binfo. */
14229 gcc_unreachable ();
14232 /* A vector of template arguments. */
14233 gcc_assert (!type
);
14234 return tsubst_template_args (t
, args
, complain
, in_decl
);
14237 case REFERENCE_TYPE
:
14239 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
14244 Type deduction may fail for any of the following
14247 -- Attempting to create a pointer to reference type.
14248 -- Attempting to create a reference to a reference type or
14249 a reference to void.
14251 Core issue 106 says that creating a reference to a reference
14252 during instantiation is no longer a cause for failure. We
14253 only enforce this check in strict C++98 mode. */
14254 if ((TREE_CODE (type
) == REFERENCE_TYPE
14255 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
14256 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
14258 static location_t last_loc
;
14260 /* We keep track of the last time we issued this error
14261 message to avoid spewing a ton of messages during a
14262 single bad template instantiation. */
14263 if (complain
& tf_error
14264 && last_loc
!= input_location
)
14266 if (VOID_TYPE_P (type
))
14267 error ("forming reference to void");
14268 else if (code
== POINTER_TYPE
)
14269 error ("forming pointer to reference type %qT", type
);
14271 error ("forming reference to reference type %qT", type
);
14272 last_loc
= input_location
;
14275 return error_mark_node
;
14277 else if (TREE_CODE (type
) == FUNCTION_TYPE
14278 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
14279 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
14281 if (complain
& tf_error
)
14283 if (code
== POINTER_TYPE
)
14284 error ("forming pointer to qualified function type %qT",
14287 error ("forming reference to qualified function type %qT",
14290 return error_mark_node
;
14292 else if (code
== POINTER_TYPE
)
14294 r
= build_pointer_type (type
);
14295 if (TREE_CODE (type
) == METHOD_TYPE
)
14296 r
= build_ptrmemfunc_type (r
);
14298 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
14299 /* In C++0x, during template argument substitution, when there is an
14300 attempt to create a reference to a reference type, reference
14301 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
14303 "If a template-argument for a template-parameter T names a type
14304 that is a reference to a type A, an attempt to create the type
14305 'lvalue reference to cv T' creates the type 'lvalue reference to
14306 A,' while an attempt to create the type type rvalue reference to
14307 cv T' creates the type T"
14309 r
= cp_build_reference_type
14311 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
14313 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
14314 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
14316 if (r
!= error_mark_node
)
14317 /* Will this ever be needed for TYPE_..._TO values? */
14324 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
14325 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
14329 Type deduction may fail for any of the following
14332 -- Attempting to create "pointer to member of T" when T
14333 is not a class type. */
14334 if (complain
& tf_error
)
14335 error ("creating pointer to member of non-class type %qT", r
);
14336 return error_mark_node
;
14338 if (TREE_CODE (type
) == REFERENCE_TYPE
)
14340 if (complain
& tf_error
)
14341 error ("creating pointer to member reference type %qT", type
);
14342 return error_mark_node
;
14344 if (VOID_TYPE_P (type
))
14346 if (complain
& tf_error
)
14347 error ("creating pointer to member of type void");
14348 return error_mark_node
;
14350 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
14351 if (TREE_CODE (type
) == FUNCTION_TYPE
)
14353 /* The type of the implicit object parameter gets its
14354 cv-qualifiers from the FUNCTION_TYPE. */
14357 = build_memfn_type (type
, r
, type_memfn_quals (type
),
14358 type_memfn_rqual (type
));
14359 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
14360 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
14364 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
14368 case FUNCTION_TYPE
:
14373 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
14374 if (fntype
== error_mark_node
)
14375 return error_mark_node
;
14377 /* Substitute the exception specification. */
14378 specs
= tsubst_exception_specification (t
, args
, complain
, in_decl
,
14379 /*defer_ok*/fndecl_type
);
14380 if (specs
== error_mark_node
)
14381 return error_mark_node
;
14383 fntype
= build_exception_variant (fntype
, specs
);
14388 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
14389 if (domain
== error_mark_node
)
14390 return error_mark_node
;
14392 /* As an optimization, we avoid regenerating the array type if
14393 it will obviously be the same as T. */
14394 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
14397 /* These checks should match the ones in create_array_type_for_decl.
14401 The deduction may fail for any of the following reasons:
14403 -- Attempting to create an array with an element type that
14404 is void, a function type, or a reference type, or [DR337]
14405 an abstract class type. */
14406 if (VOID_TYPE_P (type
)
14407 || TREE_CODE (type
) == FUNCTION_TYPE
14408 || (TREE_CODE (type
) == ARRAY_TYPE
14409 && TYPE_DOMAIN (type
) == NULL_TREE
)
14410 || TREE_CODE (type
) == REFERENCE_TYPE
)
14412 if (complain
& tf_error
)
14413 error ("creating array of %qT", type
);
14414 return error_mark_node
;
14417 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
14418 return error_mark_node
;
14420 r
= build_cplus_array_type (type
, domain
);
14422 if (TYPE_USER_ALIGN (t
))
14424 SET_TYPE_ALIGN (r
, TYPE_ALIGN (t
));
14425 TYPE_USER_ALIGN (r
) = 1;
14431 case TYPENAME_TYPE
:
14433 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
14434 in_decl
, /*entering_scope=*/1);
14435 if (ctx
== error_mark_node
)
14436 return error_mark_node
;
14438 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
14439 complain
, in_decl
);
14440 if (f
== error_mark_node
)
14441 return error_mark_node
;
14443 if (!MAYBE_CLASS_TYPE_P (ctx
))
14445 if (complain
& tf_error
)
14446 error ("%qT is not a class, struct, or union type", ctx
);
14447 return error_mark_node
;
14449 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
14451 /* Normally, make_typename_type does not require that the CTX
14452 have complete type in order to allow things like:
14454 template <class T> struct S { typename S<T>::X Y; };
14456 But, such constructs have already been resolved by this
14457 point, so here CTX really should have complete type, unless
14458 it's a partial instantiation. */
14459 ctx
= complete_type (ctx
);
14460 if (!COMPLETE_TYPE_P (ctx
))
14462 if (complain
& tf_error
)
14463 cxx_incomplete_type_error (NULL_TREE
, ctx
);
14464 return error_mark_node
;
14468 f
= make_typename_type (ctx
, f
, typename_type
,
14469 complain
| tf_keep_type_decl
);
14470 if (f
== error_mark_node
)
14472 if (TREE_CODE (f
) == TYPE_DECL
)
14474 complain
|= tf_ignore_bad_quals
;
14478 if (TREE_CODE (f
) != TYPENAME_TYPE
)
14480 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
14482 if (complain
& tf_error
)
14483 error ("%qT resolves to %qT, which is not an enumeration type",
14486 return error_mark_node
;
14488 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
14490 if (complain
& tf_error
)
14491 error ("%qT resolves to %qT, which is is not a class type",
14494 return error_mark_node
;
14498 return cp_build_qualified_type_real
14499 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
14502 case UNBOUND_CLASS_TEMPLATE
:
14504 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
14505 in_decl
, /*entering_scope=*/1);
14506 tree name
= TYPE_IDENTIFIER (t
);
14507 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
14509 if (ctx
== error_mark_node
|| name
== error_mark_node
)
14510 return error_mark_node
;
14513 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
14514 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
14521 ++cp_unevaluated_operand
;
14522 ++c_inhibit_evaluation_warnings
;
14524 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
14526 /*integral_constant_expression_p=*/false);
14528 --cp_unevaluated_operand
;
14529 --c_inhibit_evaluation_warnings
;
14531 type
= finish_typeof (type
);
14532 return cp_build_qualified_type_real (type
,
14534 | cp_type_quals (type
),
14538 case DECLTYPE_TYPE
:
14542 ++cp_unevaluated_operand
;
14543 ++c_inhibit_evaluation_warnings
;
14545 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
14546 complain
|tf_decltype
, in_decl
,
14547 /*function_p*/false,
14548 /*integral_constant_expression*/false);
14550 if (DECLTYPE_FOR_INIT_CAPTURE (t
))
14552 if (type
== NULL_TREE
)
14554 if (complain
& tf_error
)
14555 error ("empty initializer in lambda init-capture");
14556 type
= error_mark_node
;
14558 else if (TREE_CODE (type
) == TREE_LIST
)
14559 type
= build_x_compound_expr_from_list (type
, ELK_INIT
, complain
);
14562 --cp_unevaluated_operand
;
14563 --c_inhibit_evaluation_warnings
;
14565 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
14566 type
= lambda_capture_field_type (type
,
14567 DECLTYPE_FOR_INIT_CAPTURE (t
),
14568 DECLTYPE_FOR_REF_CAPTURE (t
));
14569 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
14570 type
= lambda_proxy_type (type
);
14573 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
14574 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
14576 /* In a template ~id could be either a complement expression
14577 or an unqualified-id naming a destructor; if instantiating
14578 it produces an expression, it's not an id-expression or
14581 type
= finish_decltype_type (type
, id
, complain
);
14583 return cp_build_qualified_type_real (type
,
14585 | cp_type_quals (type
),
14586 complain
| tf_ignore_bad_quals
);
14589 case UNDERLYING_TYPE
:
14591 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
14592 complain
, in_decl
);
14593 return finish_underlying_type (type
);
14596 case TYPE_ARGUMENT_PACK
:
14597 case NONTYPE_ARGUMENT_PACK
:
14601 if (code
== NONTYPE_ARGUMENT_PACK
)
14602 r
= make_node (code
);
14604 r
= cxx_make_type (code
);
14606 tree pack_args
= ARGUMENT_PACK_ARGS (t
);
14607 pack_args
= tsubst_template_args (pack_args
, args
, complain
, in_decl
);
14608 SET_ARGUMENT_PACK_ARGS (r
, pack_args
);
14626 /* We should use one of the expression tsubsts for these codes. */
14627 gcc_unreachable ();
14630 sorry ("use of %qs in template", get_tree_code_name (code
));
14631 return error_mark_node
;
14635 /* tsubst a BASELINK. OBJECT_TYPE, if non-NULL, is the type of the
14636 expression on the left-hand side of the "." or "->" operator. We
14637 only do the lookup if we had a dependent BASELINK. Otherwise we
14638 adjust it onto the instantiated heirarchy. */
14641 tsubst_baselink (tree baselink
, tree object_type
,
14642 tree args
, tsubst_flags_t complain
, tree in_decl
)
14644 bool qualified_p
= BASELINK_QUALIFIED_P (baselink
);
14645 tree qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
14646 qualifying_scope
= tsubst (qualifying_scope
, args
, complain
, in_decl
);
14648 tree optype
= BASELINK_OPTYPE (baselink
);
14649 optype
= tsubst (optype
, args
, complain
, in_decl
);
14651 tree template_args
= NULL_TREE
;
14652 bool template_id_p
= false;
14653 tree fns
= BASELINK_FUNCTIONS (baselink
);
14654 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
14656 template_id_p
= true;
14657 template_args
= TREE_OPERAND (fns
, 1);
14658 fns
= TREE_OPERAND (fns
, 0);
14660 template_args
= tsubst_template_args (template_args
, args
,
14661 complain
, in_decl
);
14664 tree binfo_type
= BINFO_TYPE (BASELINK_BINFO (baselink
));
14665 binfo_type
= tsubst (binfo_type
, args
, complain
, in_decl
);
14666 bool dependent_p
= binfo_type
!= BINFO_TYPE (BASELINK_BINFO (baselink
));
14670 tree name
= OVL_NAME (fns
);
14671 if (IDENTIFIER_CONV_OP_P (name
))
14672 name
= make_conv_op_name (optype
);
14674 if (name
== complete_dtor_identifier
)
14675 /* Treat as-if non-dependent below. */
14676 dependent_p
= false;
14678 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
14681 if ((complain
& tf_error
)
14682 && constructor_name_p (name
, qualifying_scope
))
14683 error ("cannot call constructor %<%T::%D%> directly",
14684 qualifying_scope
, name
);
14685 return error_mark_node
;
14688 if (BASELINK_P (baselink
))
14689 fns
= BASELINK_FUNCTIONS (baselink
);
14692 /* We're going to overwrite pieces below, make a duplicate. */
14693 baselink
= copy_node (baselink
);
14695 /* If lookup found a single function, mark it as used at this point.
14696 (If lookup found multiple functions the one selected later by
14697 overload resolution will be marked as used at that point.) */
14698 if (!template_id_p
&& !really_overloaded_fn (fns
))
14700 tree fn
= OVL_FIRST (fns
);
14701 bool ok
= mark_used (fn
, complain
);
14702 if (!ok
&& !(complain
& tf_error
))
14703 return error_mark_node
;
14704 if (ok
&& BASELINK_P (baselink
))
14705 /* We might have instantiated an auto function. */
14706 TREE_TYPE (baselink
) = TREE_TYPE (fn
);
14709 if (BASELINK_P (baselink
))
14711 /* Add back the template arguments, if present. */
14713 BASELINK_FUNCTIONS (baselink
)
14714 = build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fns
, template_args
);
14716 /* Update the conversion operator type. */
14717 BASELINK_OPTYPE (baselink
) = optype
;
14721 object_type
= current_class_type
;
14723 if (qualified_p
|| !dependent_p
)
14725 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
14729 /* We need to call adjust_result_of_qualified_name_lookup in case the
14730 destructor names a base class, but we unset BASELINK_QUALIFIED_P
14731 so that we still get virtual function binding. */
14732 BASELINK_QUALIFIED_P (baselink
) = false;
14738 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
14739 true if the qualified-id will be a postfix-expression in-and-of
14740 itself; false if more of the postfix-expression follows the
14741 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
14745 tsubst_qualified_id (tree qualified_id
, tree args
,
14746 tsubst_flags_t complain
, tree in_decl
,
14747 bool done
, bool address_p
)
14753 tree template_args
;
14754 location_t loc
= UNKNOWN_LOCATION
;
14756 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
14758 /* Figure out what name to look up. */
14759 name
= TREE_OPERAND (qualified_id
, 1);
14760 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
14762 is_template
= true;
14763 loc
= EXPR_LOCATION (name
);
14764 template_args
= TREE_OPERAND (name
, 1);
14766 template_args
= tsubst_template_args (template_args
, args
,
14767 complain
, in_decl
);
14768 if (template_args
== error_mark_node
)
14769 return error_mark_node
;
14770 name
= TREE_OPERAND (name
, 0);
14774 is_template
= false;
14775 template_args
= NULL_TREE
;
14778 /* Substitute into the qualifying scope. When there are no ARGS, we
14779 are just trying to simplify a non-dependent expression. In that
14780 case the qualifying scope may be dependent, and, in any case,
14781 substituting will not help. */
14782 scope
= TREE_OPERAND (qualified_id
, 0);
14785 scope
= tsubst (scope
, args
, complain
, in_decl
);
14786 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
14791 if (dependent_scope_p (scope
))
14794 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
14795 tree r
= build_qualified_name (NULL_TREE
, scope
, expr
,
14796 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
14797 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (qualified_id
);
14801 if (!BASELINK_P (name
) && !DECL_P (expr
))
14803 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
14805 /* A BIT_NOT_EXPR is used to represent a destructor. */
14806 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
14808 error ("qualifying type %qT does not match destructor name ~%qT",
14809 scope
, TREE_OPERAND (expr
, 0));
14810 expr
= error_mark_node
;
14813 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
14814 /*is_type_p=*/0, false);
14817 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
14818 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
14819 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
14821 if (complain
& tf_error
)
14823 error ("dependent-name %qE is parsed as a non-type, but "
14824 "instantiation yields a type", qualified_id
);
14825 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
14827 return error_mark_node
;
14833 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
14835 /* Remember that there was a reference to this entity. */
14836 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
14837 return error_mark_node
;
14840 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
14842 if (complain
& tf_error
)
14843 qualified_name_lookup_error (scope
,
14844 TREE_OPERAND (qualified_id
, 1),
14845 expr
, input_location
);
14846 return error_mark_node
;
14851 if (variable_template_p (expr
))
14852 expr
= lookup_and_finish_template_variable (expr
, template_args
,
14855 expr
= lookup_template_function (expr
, template_args
);
14858 if (expr
== error_mark_node
&& complain
& tf_error
)
14859 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
14860 expr
, input_location
);
14861 else if (TYPE_P (scope
))
14863 expr
= (adjust_result_of_qualified_name_lookup
14864 (expr
, scope
, current_nonlambda_class_type ()));
14865 expr
= (finish_qualified_id_expr
14866 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
14867 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
14868 /*template_arg_p=*/false, complain
));
14871 /* Expressions do not generally have reference type. */
14872 if (TREE_CODE (expr
) != SCOPE_REF
14873 /* However, if we're about to form a pointer-to-member, we just
14874 want the referenced member referenced. */
14875 && TREE_CODE (expr
) != OFFSET_REF
)
14876 expr
= convert_from_reference (expr
);
14878 if (REF_PARENTHESIZED_P (qualified_id
))
14879 expr
= force_paren_expr (expr
);
14884 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
14885 initializer, DECL is the substituted VAR_DECL. Other arguments are as
14889 tsubst_init (tree init
, tree decl
, tree args
,
14890 tsubst_flags_t complain
, tree in_decl
)
14895 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
14897 if (!init
&& TREE_TYPE (decl
) != error_mark_node
)
14899 /* If we had an initializer but it
14900 instantiated to nothing,
14901 value-initialize the object. This will
14902 only occur when the initializer was a
14903 pack expansion where the parameter packs
14904 used in that expansion were of length
14906 init
= build_value_init (TREE_TYPE (decl
),
14908 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
14909 init
= get_target_expr_sfinae (init
, complain
);
14910 if (TREE_CODE (init
) == TARGET_EXPR
)
14911 TARGET_EXPR_DIRECT_INIT_P (init
) = true;
14917 /* Like tsubst, but deals with expressions. This function just replaces
14918 template parms; to finish processing the resultant expression, use
14919 tsubst_copy_and_build or tsubst_expr. */
14922 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14924 enum tree_code code
;
14927 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
14930 code
= TREE_CODE (t
);
14935 r
= retrieve_local_specialization (t
);
14937 if (r
== NULL_TREE
)
14939 /* We get here for a use of 'this' in an NSDMI. */
14940 if (DECL_NAME (t
) == this_identifier
&& current_class_ptr
)
14941 return current_class_ptr
;
14943 /* This can happen for a parameter name used later in a function
14944 declaration (such as in a late-specified return type). Just
14945 make a dummy decl, since it's only used for its type. */
14946 gcc_assert (cp_unevaluated_operand
!= 0);
14947 r
= tsubst_decl (t
, args
, complain
);
14948 /* Give it the template pattern as its context; its true context
14949 hasn't been instantiated yet and this is good enough for
14951 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
14954 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
14955 r
= argument_pack_select_arg (r
);
14956 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
14957 return error_mark_node
;
14965 if (DECL_TEMPLATE_PARM_P (t
))
14966 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
14967 /* There is no need to substitute into namespace-scope
14969 if (DECL_NAMESPACE_SCOPE_P (t
))
14971 /* If ARGS is NULL, then T is known to be non-dependent. */
14972 if (args
== NULL_TREE
)
14973 return scalar_constant_value (t
);
14975 /* Unfortunately, we cannot just call lookup_name here.
14978 template <int I> int f() {
14980 struct S { void g() { E e = a; } };
14983 When we instantiate f<7>::S::g(), say, lookup_name is not
14984 clever enough to find f<7>::a. */
14986 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
14987 /*entering_scope=*/0);
14989 for (v
= TYPE_VALUES (enum_type
);
14991 v
= TREE_CHAIN (v
))
14992 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
14993 return TREE_VALUE (v
);
14995 /* We didn't find the name. That should never happen; if
14996 name-lookup found it during preliminary parsing, we
14997 should find it again here during instantiation. */
14998 gcc_unreachable ();
15003 if (DECL_CONTEXT (t
))
15007 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
15008 /*entering_scope=*/1);
15009 if (ctx
!= DECL_CONTEXT (t
))
15011 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
15014 if (complain
& tf_error
)
15015 error ("using invalid field %qD", t
);
15016 return error_mark_node
;
15025 case FUNCTION_DECL
:
15026 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
15027 r
= tsubst (t
, args
, complain
, in_decl
);
15028 else if (local_variable_p (t
)
15029 && uses_template_parms (DECL_CONTEXT (t
)))
15031 r
= retrieve_local_specialization (t
);
15032 if (r
== NULL_TREE
)
15034 /* First try name lookup to find the instantiation. */
15035 r
= lookup_name (DECL_NAME (t
));
15036 if (r
&& !is_capture_proxy (r
))
15038 /* Make sure that the one we found is the one we want. */
15039 tree ctx
= enclosing_instantiation_of (DECL_CONTEXT (t
));
15040 if (ctx
!= DECL_CONTEXT (r
))
15048 /* This can happen for a variable used in a
15049 late-specified return type of a local lambda, or for a
15050 local static or constant. Building a new VAR_DECL
15051 should be OK in all those cases. */
15052 r
= tsubst_decl (t
, args
, complain
);
15053 if (local_specializations
)
15054 /* Avoid infinite recursion (79640). */
15055 register_local_specialization (r
, t
);
15056 if (decl_maybe_constant_var_p (r
))
15058 /* We can't call cp_finish_decl, so handle the
15059 initializer by hand. */
15060 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
15061 complain
, in_decl
);
15062 if (!processing_template_decl
)
15063 init
= maybe_constant_init (init
);
15064 if (processing_template_decl
15065 ? potential_constant_expression (init
)
15066 : reduced_constant_expression_p (init
))
15067 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
15068 = TREE_CONSTANT (r
) = true;
15069 DECL_INITIAL (r
) = init
;
15070 if (tree auto_node
= type_uses_auto (TREE_TYPE (r
)))
15072 = do_auto_deduction (TREE_TYPE (r
), init
, auto_node
,
15073 complain
, adc_variable_type
);
15075 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
15076 || decl_constant_var_p (r
)
15077 || errorcount
|| sorrycount
);
15078 if (!processing_template_decl
15079 && !TREE_STATIC (r
))
15080 r
= process_outer_var_ref (r
, complain
);
15082 /* Remember this for subsequent uses. */
15083 if (local_specializations
)
15084 register_local_specialization (r
, t
);
15086 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
15087 r
= argument_pack_select_arg (r
);
15091 if (!mark_used (r
, complain
))
15092 return error_mark_node
;
15095 case NAMESPACE_DECL
:
15099 /* An OVERLOAD will always be a non-dependent overload set; an
15100 overload set from function scope will just be represented with an
15101 IDENTIFIER_NODE, and from class scope with a BASELINK. */
15102 gcc_assert (!uses_template_parms (t
));
15103 /* We must have marked any lookups as persistent. */
15104 gcc_assert (!OVL_LOOKUP_P (t
) || OVL_USED_P (t
));
15108 return tsubst_baselink (t
, current_nonlambda_class_type (),
15109 args
, complain
, in_decl
);
15111 case TEMPLATE_DECL
:
15112 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
15113 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
15114 args
, complain
, in_decl
);
15115 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
15116 return tsubst (t
, args
, complain
, in_decl
);
15117 else if (DECL_CLASS_SCOPE_P (t
)
15118 && uses_template_parms (DECL_CONTEXT (t
)))
15120 /* Template template argument like the following example need
15123 template <template <class> class TT> struct C {};
15124 template <class T> struct D {
15125 template <class U> struct E {};
15130 We are processing the template argument `E' in #1 for
15131 the template instantiation #2. Originally, `E' is a
15132 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
15133 have to substitute this with one having context `D<int>'. */
15135 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
15136 if (dependent_scope_p (context
))
15138 /* When rewriting a constructor into a deduction guide, a
15139 non-dependent name can become dependent, so memtmpl<args>
15140 becomes context::template memtmpl<args>. */
15141 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15142 return build_qualified_name (type
, context
, DECL_NAME (t
),
15145 return lookup_field (context
, DECL_NAME(t
), 0, false);
15148 /* Ordinary template template argument. */
15151 case NON_LVALUE_EXPR
:
15152 case VIEW_CONVERT_EXPR
:
15154 /* Handle location wrappers by substituting the wrapped node
15155 first, *then* reusing the resulting type. Doing the type
15156 first ensures that we handle template parameters and
15157 parameter pack expansions. */
15158 gcc_assert (location_wrapper_p (t
));
15159 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15160 return maybe_wrap_with_location (op0
, EXPR_LOCATION (t
));
15164 case REINTERPRET_CAST_EXPR
:
15165 case CONST_CAST_EXPR
:
15166 case STATIC_CAST_EXPR
:
15167 case DYNAMIC_CAST_EXPR
:
15168 case IMPLICIT_CONV_EXPR
:
15172 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15173 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15174 return build1 (code
, type
, op0
);
15178 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
15179 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
15181 tree expanded
, op
= TREE_OPERAND (t
, 0);
15184 if (SIZEOF_EXPR_TYPE_P (t
))
15185 op
= TREE_TYPE (op
);
15187 ++cp_unevaluated_operand
;
15188 ++c_inhibit_evaluation_warnings
;
15189 /* We only want to compute the number of arguments. */
15190 if (PACK_EXPANSION_P (op
))
15191 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
15193 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
15194 args
, complain
, in_decl
);
15195 --cp_unevaluated_operand
;
15196 --c_inhibit_evaluation_warnings
;
15198 if (TREE_CODE (expanded
) == TREE_VEC
)
15200 len
= TREE_VEC_LENGTH (expanded
);
15201 /* Set TREE_USED for the benefit of -Wunused. */
15202 for (int i
= 0; i
< len
; i
++)
15203 if (DECL_P (TREE_VEC_ELT (expanded
, i
)))
15204 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
15207 if (expanded
== error_mark_node
)
15208 return error_mark_node
;
15209 else if (PACK_EXPANSION_P (expanded
)
15210 || (TREE_CODE (expanded
) == TREE_VEC
15211 && pack_expansion_args_count (expanded
)))
15214 if (PACK_EXPANSION_P (expanded
))
15216 else if (TREE_VEC_LENGTH (expanded
) == 1)
15217 expanded
= TREE_VEC_ELT (expanded
, 0);
15219 expanded
= make_argument_pack (expanded
);
15221 if (TYPE_P (expanded
))
15222 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
15223 complain
& tf_error
);
15225 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
15226 complain
& tf_error
);
15229 return build_int_cst (size_type_node
, len
);
15231 if (SIZEOF_EXPR_TYPE_P (t
))
15233 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
15234 args
, complain
, in_decl
);
15235 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
15236 r
= build1 (SIZEOF_EXPR
,
15237 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
15238 SIZEOF_EXPR_TYPE_P (r
) = 1;
15245 case TRUTH_NOT_EXPR
:
15248 case UNARY_PLUS_EXPR
: /* Unary + */
15250 case AT_ENCODE_EXPR
:
15254 case REALPART_EXPR
:
15255 case IMAGPART_EXPR
:
15258 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15259 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15260 return build1 (code
, type
, op0
);
15263 case COMPONENT_REF
:
15268 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15269 name
= TREE_OPERAND (t
, 1);
15270 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
15272 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15273 complain
, in_decl
);
15274 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15276 else if (TREE_CODE (name
) == SCOPE_REF
15277 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
15279 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15280 complain
, in_decl
);
15281 name
= TREE_OPERAND (name
, 1);
15282 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
15283 complain
, in_decl
);
15284 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
15285 name
= build_qualified_name (/*type=*/NULL_TREE
,
15287 /*template_p=*/false);
15289 else if (BASELINK_P (name
))
15290 name
= tsubst_baselink (name
,
15291 non_reference (TREE_TYPE (object
)),
15295 name
= tsubst_copy (name
, args
, complain
, in_decl
);
15296 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
15302 case TRUNC_DIV_EXPR
:
15303 case CEIL_DIV_EXPR
:
15304 case FLOOR_DIV_EXPR
:
15305 case ROUND_DIV_EXPR
:
15306 case EXACT_DIV_EXPR
:
15310 case TRUNC_MOD_EXPR
:
15311 case FLOOR_MOD_EXPR
:
15312 case TRUTH_ANDIF_EXPR
:
15313 case TRUTH_ORIF_EXPR
:
15314 case TRUTH_AND_EXPR
:
15315 case TRUTH_OR_EXPR
:
15328 case COMPOUND_EXPR
:
15331 case PREDECREMENT_EXPR
:
15332 case PREINCREMENT_EXPR
:
15333 case POSTDECREMENT_EXPR
:
15334 case POSTINCREMENT_EXPR
:
15336 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15337 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15338 return build_nt (code
, op0
, op1
);
15343 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15344 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15345 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
15346 QUALIFIED_NAME_IS_TEMPLATE (t
));
15351 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15352 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15353 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
15358 int n
= VL_EXP_OPERAND_LENGTH (t
);
15359 tree result
= build_vl_exp (CALL_EXPR
, n
);
15361 for (i
= 0; i
< n
; i
++)
15362 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
15363 complain
, in_decl
);
15369 case PSEUDO_DTOR_EXPR
:
15370 case VEC_PERM_EXPR
:
15372 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15373 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15374 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15375 r
= build_nt (code
, op0
, op1
, op2
);
15376 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15382 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15383 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15384 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15385 r
= build_nt (code
, op0
, op1
, op2
);
15386 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
15392 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15393 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15394 r
= build_nt (code
, op0
, op1
);
15395 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
15396 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
15400 case TEMPLATE_ID_EXPR
:
15402 /* Substituted template arguments */
15403 tree fn
= TREE_OPERAND (t
, 0);
15404 tree targs
= TREE_OPERAND (t
, 1);
15406 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
15408 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15410 return lookup_template_function (fn
, targs
);
15415 tree purpose
, value
, chain
;
15417 if (t
== void_list_node
)
15420 purpose
= TREE_PURPOSE (t
);
15422 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
15423 value
= TREE_VALUE (t
);
15425 value
= tsubst_copy (value
, args
, complain
, in_decl
);
15426 chain
= TREE_CHAIN (t
);
15427 if (chain
&& chain
!= void_type_node
)
15428 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
15429 if (purpose
== TREE_PURPOSE (t
)
15430 && value
== TREE_VALUE (t
)
15431 && chain
== TREE_CHAIN (t
))
15433 return tree_cons (purpose
, value
, chain
);
15438 case ENUMERAL_TYPE
:
15440 case TEMPLATE_TYPE_PARM
:
15441 case TEMPLATE_TEMPLATE_PARM
:
15442 case BOUND_TEMPLATE_TEMPLATE_PARM
:
15443 case TEMPLATE_PARM_INDEX
:
15445 case REFERENCE_TYPE
:
15447 case FUNCTION_TYPE
:
15450 case TYPENAME_TYPE
:
15451 case UNBOUND_CLASS_TEMPLATE
:
15453 case DECLTYPE_TYPE
:
15455 return tsubst (t
, args
, complain
, in_decl
);
15459 /* Fall through. */
15460 case IDENTIFIER_NODE
:
15461 if (IDENTIFIER_CONV_OP_P (t
))
15463 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15464 return make_conv_op_name (new_type
);
15470 /* This is handled by tsubst_copy_and_build. */
15471 gcc_unreachable ();
15475 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15476 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15477 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
15480 case CLEANUP_POINT_EXPR
:
15481 /* We shouldn't have built any of these during initial template
15482 generation. Instead, they should be built during instantiation
15483 in response to the saved STMT_IS_FULL_EXPR_P setting. */
15484 gcc_unreachable ();
15488 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15489 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
15490 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15491 r
= build2 (code
, type
, op0
, op1
);
15492 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
15493 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
15494 && !(complain
& tf_error
))
15495 return error_mark_node
;
15499 case EXPR_PACK_EXPANSION
:
15500 error ("invalid use of pack expansion expression");
15501 return error_mark_node
;
15503 case NONTYPE_ARGUMENT_PACK
:
15504 error ("use %<...%> to expand argument pack");
15505 return error_mark_node
;
15508 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
15516 /* Instantiate any typedefs in the type. */
15517 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15518 r
= fold_convert (type
, t
);
15519 gcc_assert (TREE_CODE (r
) == code
);
15524 /* These can sometimes show up in a partial instantiation, but never
15525 involve template parms. */
15526 gcc_assert (!uses_template_parms (t
));
15529 case UNARY_LEFT_FOLD_EXPR
:
15530 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
15531 case UNARY_RIGHT_FOLD_EXPR
:
15532 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
15533 case BINARY_LEFT_FOLD_EXPR
:
15534 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
15535 case BINARY_RIGHT_FOLD_EXPR
:
15536 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
15540 case DEBUG_BEGIN_STMT
:
15541 /* ??? There's no point in copying it for now, but maybe some
15542 day it will contain more information, such as a pointer back
15543 to the containing function, inlined copy or so. */
15547 /* We shouldn't get here, but keep going if !flag_checking. */
15549 gcc_unreachable ();
15554 /* Helper function for tsubst_omp_clauses, used for instantiation of
15555 OMP_CLAUSE_DECL of clauses. */
15558 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
15561 if (decl
== NULL_TREE
)
15564 /* Handle an OpenMP array section represented as a TREE_LIST (or
15565 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
15566 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
15567 TREE_LIST. We can handle it exactly the same as an array section
15568 (purpose, value, and a chain), even though the nomenclature
15569 (low_bound, length, etc) is different. */
15570 if (TREE_CODE (decl
) == TREE_LIST
)
15573 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
15574 /*integral_constant_expression_p=*/false);
15575 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
15576 /*integral_constant_expression_p=*/false);
15577 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
15579 if (TREE_PURPOSE (decl
) == low_bound
15580 && TREE_VALUE (decl
) == length
15581 && TREE_CHAIN (decl
) == chain
)
15583 tree ret
= tree_cons (low_bound
, length
, chain
);
15584 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
15585 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
15588 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
15589 /*integral_constant_expression_p=*/false);
15590 /* Undo convert_from_reference tsubst_expr could have called. */
15592 && REFERENCE_REF_P (ret
)
15593 && !REFERENCE_REF_P (decl
))
15594 ret
= TREE_OPERAND (ret
, 0);
15598 /* Like tsubst_copy, but specifically for OpenMP clauses. */
15601 tsubst_omp_clauses (tree clauses
, enum c_omp_region_type ort
,
15602 tree args
, tsubst_flags_t complain
, tree in_decl
)
15604 tree new_clauses
= NULL_TREE
, nc
, oc
;
15605 tree linear_no_step
= NULL_TREE
;
15607 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
15609 nc
= copy_node (oc
);
15610 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
15613 switch (OMP_CLAUSE_CODE (nc
))
15615 case OMP_CLAUSE_LASTPRIVATE
:
15616 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
15618 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
15619 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
15620 in_decl
, /*integral_constant_expression_p=*/false);
15621 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
15622 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
15625 case OMP_CLAUSE_PRIVATE
:
15626 case OMP_CLAUSE_SHARED
:
15627 case OMP_CLAUSE_FIRSTPRIVATE
:
15628 case OMP_CLAUSE_COPYIN
:
15629 case OMP_CLAUSE_COPYPRIVATE
:
15630 case OMP_CLAUSE_UNIFORM
:
15631 case OMP_CLAUSE_DEPEND
:
15632 case OMP_CLAUSE_FROM
:
15633 case OMP_CLAUSE_TO
:
15634 case OMP_CLAUSE_MAP
:
15635 case OMP_CLAUSE_USE_DEVICE_PTR
:
15636 case OMP_CLAUSE_IS_DEVICE_PTR
:
15637 OMP_CLAUSE_DECL (nc
)
15638 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
15641 case OMP_CLAUSE_TILE
:
15642 case OMP_CLAUSE_IF
:
15643 case OMP_CLAUSE_NUM_THREADS
:
15644 case OMP_CLAUSE_SCHEDULE
:
15645 case OMP_CLAUSE_COLLAPSE
:
15646 case OMP_CLAUSE_FINAL
:
15647 case OMP_CLAUSE_DEVICE
:
15648 case OMP_CLAUSE_DIST_SCHEDULE
:
15649 case OMP_CLAUSE_NUM_TEAMS
:
15650 case OMP_CLAUSE_THREAD_LIMIT
:
15651 case OMP_CLAUSE_SAFELEN
:
15652 case OMP_CLAUSE_SIMDLEN
:
15653 case OMP_CLAUSE_NUM_TASKS
:
15654 case OMP_CLAUSE_GRAINSIZE
:
15655 case OMP_CLAUSE_PRIORITY
:
15656 case OMP_CLAUSE_ORDERED
:
15657 case OMP_CLAUSE_HINT
:
15658 case OMP_CLAUSE_NUM_GANGS
:
15659 case OMP_CLAUSE_NUM_WORKERS
:
15660 case OMP_CLAUSE_VECTOR_LENGTH
:
15661 case OMP_CLAUSE_WORKER
:
15662 case OMP_CLAUSE_VECTOR
:
15663 case OMP_CLAUSE_ASYNC
:
15664 case OMP_CLAUSE_WAIT
:
15665 OMP_CLAUSE_OPERAND (nc
, 0)
15666 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
15667 in_decl
, /*integral_constant_expression_p=*/false);
15669 case OMP_CLAUSE_REDUCTION
:
15670 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
15672 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
15673 if (TREE_CODE (placeholder
) == SCOPE_REF
)
15675 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
15676 complain
, in_decl
);
15677 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
15678 = build_qualified_name (NULL_TREE
, scope
,
15679 TREE_OPERAND (placeholder
, 1),
15683 gcc_assert (identifier_p (placeholder
));
15685 OMP_CLAUSE_DECL (nc
)
15686 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
15689 case OMP_CLAUSE_GANG
:
15690 case OMP_CLAUSE_ALIGNED
:
15691 OMP_CLAUSE_DECL (nc
)
15692 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
15694 OMP_CLAUSE_OPERAND (nc
, 1)
15695 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
15696 in_decl
, /*integral_constant_expression_p=*/false);
15698 case OMP_CLAUSE_LINEAR
:
15699 OMP_CLAUSE_DECL (nc
)
15700 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
15702 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
15704 gcc_assert (!linear_no_step
);
15705 linear_no_step
= nc
;
15707 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
15708 OMP_CLAUSE_LINEAR_STEP (nc
)
15709 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
15710 complain
, in_decl
);
15712 OMP_CLAUSE_LINEAR_STEP (nc
)
15713 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
15715 /*integral_constant_expression_p=*/false);
15717 case OMP_CLAUSE_NOWAIT
:
15718 case OMP_CLAUSE_DEFAULT
:
15719 case OMP_CLAUSE_UNTIED
:
15720 case OMP_CLAUSE_MERGEABLE
:
15721 case OMP_CLAUSE_INBRANCH
:
15722 case OMP_CLAUSE_NOTINBRANCH
:
15723 case OMP_CLAUSE_PROC_BIND
:
15724 case OMP_CLAUSE_FOR
:
15725 case OMP_CLAUSE_PARALLEL
:
15726 case OMP_CLAUSE_SECTIONS
:
15727 case OMP_CLAUSE_TASKGROUP
:
15728 case OMP_CLAUSE_NOGROUP
:
15729 case OMP_CLAUSE_THREADS
:
15730 case OMP_CLAUSE_SIMD
:
15731 case OMP_CLAUSE_DEFAULTMAP
:
15732 case OMP_CLAUSE_INDEPENDENT
:
15733 case OMP_CLAUSE_AUTO
:
15734 case OMP_CLAUSE_SEQ
:
15737 gcc_unreachable ();
15739 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
)
15740 switch (OMP_CLAUSE_CODE (nc
))
15742 case OMP_CLAUSE_SHARED
:
15743 case OMP_CLAUSE_PRIVATE
:
15744 case OMP_CLAUSE_FIRSTPRIVATE
:
15745 case OMP_CLAUSE_LASTPRIVATE
:
15746 case OMP_CLAUSE_COPYPRIVATE
:
15747 case OMP_CLAUSE_LINEAR
:
15748 case OMP_CLAUSE_REDUCTION
:
15749 case OMP_CLAUSE_USE_DEVICE_PTR
:
15750 case OMP_CLAUSE_IS_DEVICE_PTR
:
15751 /* tsubst_expr on SCOPE_REF results in returning
15752 finish_non_static_data_member result. Undo that here. */
15753 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
15754 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
15755 == IDENTIFIER_NODE
))
15757 tree t
= OMP_CLAUSE_DECL (nc
);
15760 switch (TREE_CODE (v
))
15762 case COMPONENT_REF
:
15766 case POINTER_PLUS_EXPR
:
15767 v
= TREE_OPERAND (v
, 0);
15770 if (DECL_CONTEXT (v
) == current_function_decl
15771 && DECL_ARTIFICIAL (v
)
15772 && DECL_NAME (v
) == this_identifier
)
15773 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
15780 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
15781 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
15782 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
15783 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
15784 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
15786 tree decl
= OMP_CLAUSE_DECL (nc
);
15789 retrofit_lang_decl (decl
);
15790 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
15799 new_clauses
= nreverse (new_clauses
);
15800 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
15802 new_clauses
= finish_omp_clauses (new_clauses
, ort
);
15803 if (linear_no_step
)
15804 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
15805 if (nc
== linear_no_step
)
15807 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
15811 return new_clauses
;
15814 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
15817 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
15820 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
15822 tree purpose
, value
, chain
;
15827 if (TREE_CODE (t
) != TREE_LIST
)
15828 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15829 /*function_p=*/false,
15830 /*integral_constant_expression_p=*/false);
15832 if (t
== void_list_node
)
15835 purpose
= TREE_PURPOSE (t
);
15837 purpose
= RECUR (purpose
);
15838 value
= TREE_VALUE (t
);
15841 if (TREE_CODE (value
) != LABEL_DECL
)
15842 value
= RECUR (value
);
15845 value
= lookup_label (DECL_NAME (value
));
15846 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
15847 TREE_USED (value
) = 1;
15850 chain
= TREE_CHAIN (t
);
15851 if (chain
&& chain
!= void_type_node
)
15852 chain
= RECUR (chain
);
15853 return tree_cons (purpose
, value
, chain
);
15857 /* Used to temporarily communicate the list of #pragma omp parallel
15858 clauses to #pragma omp for instantiation if they are combined
15861 static tree
*omp_parallel_combined_clauses
;
15863 /* Substitute one OMP_FOR iterator. */
15866 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
15867 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
15868 tree args
, tsubst_flags_t complain
, tree in_decl
,
15869 bool integral_constant_expression_p
)
15871 #define RECUR(NODE) \
15872 tsubst_expr ((NODE), args, complain, in_decl, \
15873 integral_constant_expression_p)
15874 tree decl
, init
, cond
, incr
;
15876 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
15877 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
15879 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
15881 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
15882 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
15885 decl
= TREE_OPERAND (init
, 0);
15886 init
= TREE_OPERAND (init
, 1);
15887 tree decl_expr
= NULL_TREE
;
15888 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
15890 /* We need to jump through some hoops to handle declarations in the
15891 init-statement, since we might need to handle auto deduction,
15892 but we need to keep control of initialization. */
15894 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
15895 decl
= tsubst_decl (decl
, args
, complain
);
15899 if (TREE_CODE (decl
) == SCOPE_REF
)
15901 decl
= RECUR (decl
);
15902 if (TREE_CODE (decl
) == COMPONENT_REF
)
15906 switch (TREE_CODE (v
))
15908 case COMPONENT_REF
:
15912 case POINTER_PLUS_EXPR
:
15913 v
= TREE_OPERAND (v
, 0);
15916 if (DECL_CONTEXT (v
) == current_function_decl
15917 && DECL_ARTIFICIAL (v
)
15918 && DECL_NAME (v
) == this_identifier
)
15920 decl
= TREE_OPERAND (decl
, 1);
15921 decl
= omp_privatize_field (decl
, false);
15931 decl
= RECUR (decl
);
15933 init
= RECUR (init
);
15935 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
15936 if (auto_node
&& init
)
15938 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
, complain
);
15940 gcc_assert (!type_dependent_expression_p (decl
));
15942 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
15946 /* Declare the variable, but don't let that initialize it. */
15947 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
15948 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
15950 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
15953 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
15954 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
15955 if (TREE_CODE (incr
) == MODIFY_EXPR
)
15957 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15958 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
15959 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
15960 NOP_EXPR
, rhs
, complain
);
15963 incr
= RECUR (incr
);
15964 TREE_VEC_ELT (declv
, i
) = decl
;
15965 TREE_VEC_ELT (initv
, i
) = init
;
15966 TREE_VEC_ELT (condv
, i
) = cond
;
15967 TREE_VEC_ELT (incrv
, i
) = incr
;
15973 /* Declare and initialize the variable. */
15981 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
15983 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
15985 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
15986 && OMP_CLAUSE_DECL (*pc
) == decl
)
15988 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
15989 && OMP_CLAUSE_DECL (*pc
) == decl
)
15993 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
15995 *pc
= OMP_CLAUSE_CHAIN (c
);
15996 OMP_CLAUSE_CHAIN (c
) = *clauses
;
15999 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
16000 && OMP_CLAUSE_DECL (*pc
) == decl
)
16002 error ("iteration variable %qD should not be firstprivate",
16004 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16006 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
16007 && OMP_CLAUSE_DECL (*pc
) == decl
)
16009 error ("iteration variable %qD should not be reduction",
16011 *pc
= OMP_CLAUSE_CHAIN (*pc
);
16014 pc
= &OMP_CLAUSE_CHAIN (*pc
);
16019 if (*pc
== NULL_TREE
)
16021 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
16022 OMP_CLAUSE_DECL (c
) = decl
;
16023 c
= finish_omp_clauses (c
, C_ORT_OMP
);
16026 OMP_CLAUSE_CHAIN (c
) = *clauses
;
16031 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
16032 if (COMPARISON_CLASS_P (cond
))
16034 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
16035 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
16036 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
16039 cond
= RECUR (cond
);
16040 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
16041 switch (TREE_CODE (incr
))
16043 case PREINCREMENT_EXPR
:
16044 case PREDECREMENT_EXPR
:
16045 case POSTINCREMENT_EXPR
:
16046 case POSTDECREMENT_EXPR
:
16047 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
16048 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
16051 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16052 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16054 tree rhs
= TREE_OPERAND (incr
, 1);
16055 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16056 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16057 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16058 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16059 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16063 incr
= RECUR (incr
);
16066 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
16067 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
16069 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16070 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16071 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
16072 TREE_TYPE (decl
), lhs
,
16073 RECUR (TREE_OPERAND (incr
, 2))));
16075 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
16076 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
16077 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
16079 tree rhs
= TREE_OPERAND (incr
, 2);
16080 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
16081 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
16082 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
16083 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
16084 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
16088 incr
= RECUR (incr
);
16091 incr
= RECUR (incr
);
16095 TREE_VEC_ELT (declv
, i
) = decl
;
16096 TREE_VEC_ELT (initv
, i
) = init
;
16097 TREE_VEC_ELT (condv
, i
) = cond
;
16098 TREE_VEC_ELT (incrv
, i
) = incr
;
16102 /* Helper function of tsubst_expr, find OMP_TEAMS inside
16103 of OMP_TARGET's body. */
16106 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
16108 *walk_subtrees
= 0;
16109 switch (TREE_CODE (*tp
))
16114 case STATEMENT_LIST
:
16115 *walk_subtrees
= 1;
16123 /* Helper function for tsubst_expr. For decomposition declaration
16124 artificial base DECL, which is tsubsted PATTERN_DECL, tsubst
16125 also the corresponding decls representing the identifiers
16126 of the decomposition declaration. Return DECL if successful
16127 or error_mark_node otherwise, set *FIRST to the first decl
16128 in the list chained through DECL_CHAIN and *CNT to the number
16132 tsubst_decomp_names (tree decl
, tree pattern_decl
, tree args
,
16133 tsubst_flags_t complain
, tree in_decl
, tree
*first
,
16136 tree decl2
, decl3
, prev
= decl
;
16138 gcc_assert (DECL_NAME (decl
) == NULL_TREE
);
16139 for (decl2
= DECL_CHAIN (pattern_decl
);
16142 && DECL_DECOMPOSITION_P (decl2
)
16143 && DECL_NAME (decl2
);
16144 decl2
= DECL_CHAIN (decl2
))
16146 if (TREE_TYPE (decl2
) == error_mark_node
&& *cnt
== 0)
16148 gcc_assert (errorcount
);
16149 return error_mark_node
;
16152 gcc_assert (DECL_DECOMP_BASE (decl2
) == pattern_decl
);
16153 gcc_assert (DECL_HAS_VALUE_EXPR_P (decl2
));
16154 tree v
= DECL_VALUE_EXPR (decl2
);
16155 DECL_HAS_VALUE_EXPR_P (decl2
) = 0;
16156 SET_DECL_VALUE_EXPR (decl2
, NULL_TREE
);
16157 decl3
= tsubst (decl2
, args
, complain
, in_decl
);
16158 SET_DECL_VALUE_EXPR (decl2
, v
);
16159 DECL_HAS_VALUE_EXPR_P (decl2
) = 1;
16161 DECL_TEMPLATE_INSTANTIATED (decl3
) = 1;
16162 maybe_push_decl (decl3
);
16163 if (error_operand_p (decl3
))
16164 decl
= error_mark_node
;
16165 else if (decl
!= error_mark_node
16166 && DECL_CHAIN (decl3
) != prev
)
16168 gcc_assert (errorcount
);
16169 decl
= error_mark_node
;
16178 /* Like tsubst_copy for expressions, etc. but also does semantic
16182 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
16183 bool integral_constant_expression_p
)
16185 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
16186 #define RECUR(NODE) \
16187 tsubst_expr ((NODE), args, complain, in_decl, \
16188 integral_constant_expression_p)
16194 if (t
== NULL_TREE
|| t
== error_mark_node
)
16197 loc
= input_location
;
16198 if (EXPR_HAS_LOCATION (t
))
16199 input_location
= EXPR_LOCATION (t
);
16200 if (STATEMENT_CODE_P (TREE_CODE (t
)))
16201 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
16203 switch (TREE_CODE (t
))
16205 case STATEMENT_LIST
:
16207 tree_stmt_iterator i
;
16208 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
16209 RECUR (tsi_stmt (i
));
16213 case CTOR_INITIALIZER
:
16214 finish_mem_initializers (tsubst_initializer_list
16215 (TREE_OPERAND (t
, 0), args
));
16219 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
16223 tmp
= RECUR (EXPR_STMT_EXPR (t
));
16224 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
16225 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
16227 finish_expr_stmt (tmp
);
16231 finish_local_using_directive (USING_STMT_NAMESPACE (t
),
16232 /*attribs=*/NULL_TREE
);
16237 tree decl
, pattern_decl
;
16240 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
16241 if (TREE_CODE (decl
) == LABEL_DECL
)
16242 finish_label_decl (DECL_NAME (decl
));
16243 else if (TREE_CODE (decl
) == USING_DECL
)
16245 tree scope
= USING_DECL_SCOPE (decl
);
16246 tree name
= DECL_NAME (decl
);
16248 scope
= tsubst (scope
, args
, complain
, in_decl
);
16249 decl
= lookup_qualified_name (scope
, name
,
16250 /*is_type_p=*/false,
16251 /*complain=*/false);
16252 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
16253 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
16255 finish_local_using_decl (decl
, scope
, name
);
16257 else if (is_capture_proxy (decl
)
16258 && !DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
16260 /* We're in tsubst_lambda_expr, we've already inserted a new
16261 capture proxy, so look it up and register it. */
16263 if (DECL_PACK_P (decl
))
16265 inst
= (retrieve_local_specialization
16266 (DECL_CAPTURED_VARIABLE (decl
)));
16267 gcc_assert (TREE_CODE (inst
) == NONTYPE_ARGUMENT_PACK
);
16271 inst
= lookup_name_real (DECL_NAME (decl
), 0, 0,
16272 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
16273 gcc_assert (inst
!= decl
&& is_capture_proxy (inst
));
16275 register_local_specialization (inst
, decl
);
16278 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
16279 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
16280 /* Don't copy the old closure; we'll create a new one in
16281 tsubst_lambda_expr. */
16285 init
= DECL_INITIAL (decl
);
16286 decl
= tsubst (decl
, args
, complain
, in_decl
);
16287 if (decl
!= error_mark_node
)
16289 /* By marking the declaration as instantiated, we avoid
16290 trying to instantiate it. Since instantiate_decl can't
16291 handle local variables, and since we've already done
16292 all that needs to be done, that's the right thing to
16295 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
16297 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
16298 /* Anonymous aggregates are a special case. */
16299 finish_anon_union (decl
);
16300 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
16302 DECL_CONTEXT (decl
) = current_function_decl
;
16303 if (DECL_NAME (decl
) == this_identifier
)
16305 tree lam
= DECL_CONTEXT (current_function_decl
);
16306 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
16307 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
16309 insert_capture_proxy (decl
);
16311 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
16312 /* We already did a pushtag. */;
16313 else if (TREE_CODE (decl
) == FUNCTION_DECL
16314 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
16315 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
16317 DECL_CONTEXT (decl
) = NULL_TREE
;
16319 DECL_CONTEXT (decl
) = current_function_decl
;
16320 cp_check_omp_declare_reduction (decl
);
16324 int const_init
= false;
16325 maybe_push_decl (decl
);
16327 && DECL_PRETTY_FUNCTION_P (decl
))
16329 /* For __PRETTY_FUNCTION__ we have to adjust the
16331 const char *const name
16332 = cxx_printable_name (current_function_decl
, 2);
16333 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
16336 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
16339 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
16342 && DECL_DECOMPOSITION_P (decl
)
16343 && TREE_TYPE (pattern_decl
) != error_mark_node
)
16348 = tsubst_decomp_names (decl
, pattern_decl
, args
,
16349 complain
, in_decl
, &first
, &cnt
);
16350 if (ndecl
!= error_mark_node
)
16351 cp_maybe_mangle_decomp (ndecl
, first
, cnt
);
16352 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
16353 if (ndecl
!= error_mark_node
)
16354 cp_finish_decomp (ndecl
, first
, cnt
);
16357 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
16366 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
16367 RECUR (FOR_INIT_STMT (t
));
16368 finish_init_stmt (stmt
);
16369 tmp
= RECUR (FOR_COND (t
));
16370 finish_for_cond (tmp
, stmt
, false, 0);
16371 tmp
= RECUR (FOR_EXPR (t
));
16372 finish_for_expr (tmp
, stmt
);
16374 bool prev
= note_iteration_stmt_body_start ();
16375 RECUR (FOR_BODY (t
));
16376 note_iteration_stmt_body_end (prev
);
16378 finish_for_stmt (stmt
);
16381 case RANGE_FOR_STMT
:
16383 /* Construct another range_for, if this is not a final
16384 substitution (for inside inside a generic lambda of a
16385 template). Otherwise convert to a regular for. */
16387 stmt
= (processing_template_decl
16388 ? begin_range_for_stmt (NULL_TREE
, NULL_TREE
)
16389 : begin_for_stmt (NULL_TREE
, NULL_TREE
));
16390 decl
= RANGE_FOR_DECL (t
);
16391 decl
= tsubst (decl
, args
, complain
, in_decl
);
16392 maybe_push_decl (decl
);
16393 expr
= RECUR (RANGE_FOR_EXPR (t
));
16395 tree decomp_first
= NULL_TREE
;
16396 unsigned decomp_cnt
= 0;
16397 if (VAR_P (decl
) && DECL_DECOMPOSITION_P (decl
))
16398 decl
= tsubst_decomp_names (decl
, RANGE_FOR_DECL (t
), args
,
16400 &decomp_first
, &decomp_cnt
);
16402 if (processing_template_decl
)
16404 RANGE_FOR_IVDEP (stmt
) = RANGE_FOR_IVDEP (t
);
16405 RANGE_FOR_UNROLL (stmt
) = RANGE_FOR_UNROLL (t
);
16406 finish_range_for_decl (stmt
, decl
, expr
);
16410 unsigned short unroll
= (RANGE_FOR_UNROLL (t
)
16411 ? tree_to_uhwi (RANGE_FOR_UNROLL (t
)) : 0);
16412 stmt
= cp_convert_range_for (stmt
, decl
, expr
,
16413 decomp_first
, decomp_cnt
,
16414 RANGE_FOR_IVDEP (t
), unroll
);
16417 bool prev
= note_iteration_stmt_body_start ();
16418 RECUR (RANGE_FOR_BODY (t
));
16419 note_iteration_stmt_body_end (prev
);
16420 finish_for_stmt (stmt
);
16425 stmt
= begin_while_stmt ();
16426 tmp
= RECUR (WHILE_COND (t
));
16427 finish_while_stmt_cond (tmp
, stmt
, false, 0);
16429 bool prev
= note_iteration_stmt_body_start ();
16430 RECUR (WHILE_BODY (t
));
16431 note_iteration_stmt_body_end (prev
);
16433 finish_while_stmt (stmt
);
16437 stmt
= begin_do_stmt ();
16439 bool prev
= note_iteration_stmt_body_start ();
16440 RECUR (DO_BODY (t
));
16441 note_iteration_stmt_body_end (prev
);
16443 finish_do_body (stmt
);
16444 tmp
= RECUR (DO_COND (t
));
16445 finish_do_stmt (tmp
, stmt
, false, 0);
16449 stmt
= begin_if_stmt ();
16450 IF_STMT_CONSTEXPR_P (stmt
) = IF_STMT_CONSTEXPR_P (t
);
16451 tmp
= RECUR (IF_COND (t
));
16452 tmp
= finish_if_stmt_cond (tmp
, stmt
);
16453 if (IF_STMT_CONSTEXPR_P (t
) && integer_zerop (tmp
))
16454 /* Don't instantiate the THEN_CLAUSE. */;
16457 bool inhibit
= integer_zerop (fold_non_dependent_expr (tmp
));
16459 ++c_inhibit_evaluation_warnings
;
16460 RECUR (THEN_CLAUSE (t
));
16462 --c_inhibit_evaluation_warnings
;
16464 finish_then_clause (stmt
);
16466 if (IF_STMT_CONSTEXPR_P (t
) && integer_nonzerop (tmp
))
16467 /* Don't instantiate the ELSE_CLAUSE. */;
16468 else if (ELSE_CLAUSE (t
))
16470 bool inhibit
= integer_nonzerop (fold_non_dependent_expr (tmp
));
16471 begin_else_clause (stmt
);
16473 ++c_inhibit_evaluation_warnings
;
16474 RECUR (ELSE_CLAUSE (t
));
16476 --c_inhibit_evaluation_warnings
;
16477 finish_else_clause (stmt
);
16480 finish_if_stmt (stmt
);
16484 if (BIND_EXPR_BODY_BLOCK (t
))
16485 stmt
= begin_function_body ();
16487 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
16488 ? BCS_TRY_BLOCK
: 0);
16490 RECUR (BIND_EXPR_BODY (t
));
16492 if (BIND_EXPR_BODY_BLOCK (t
))
16493 finish_function_body (stmt
);
16495 finish_compound_stmt (stmt
);
16499 finish_break_stmt ();
16502 case CONTINUE_STMT
:
16503 finish_continue_stmt ();
16507 stmt
= begin_switch_stmt ();
16508 tmp
= RECUR (SWITCH_STMT_COND (t
));
16509 finish_switch_cond (tmp
, stmt
);
16510 RECUR (SWITCH_STMT_BODY (t
));
16511 finish_switch_stmt (stmt
);
16514 case CASE_LABEL_EXPR
:
16516 tree low
= RECUR (CASE_LOW (t
));
16517 tree high
= RECUR (CASE_HIGH (t
));
16518 tree l
= finish_case_label (EXPR_LOCATION (t
), low
, high
);
16519 if (l
&& TREE_CODE (l
) == CASE_LABEL_EXPR
)
16520 FALLTHROUGH_LABEL_P (CASE_LABEL (l
))
16521 = FALLTHROUGH_LABEL_P (CASE_LABEL (t
));
16527 tree decl
= LABEL_EXPR_LABEL (t
);
16530 label
= finish_label_stmt (DECL_NAME (decl
));
16531 if (TREE_CODE (label
) == LABEL_DECL
)
16532 FALLTHROUGH_LABEL_P (label
) = FALLTHROUGH_LABEL_P (decl
);
16533 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
16534 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
16539 tmp
= GOTO_DESTINATION (t
);
16540 if (TREE_CODE (tmp
) != LABEL_DECL
)
16541 /* Computed goto's must be tsubst'd into. On the other hand,
16542 non-computed gotos must not be; the identifier in question
16543 will have no binding. */
16546 tmp
= DECL_NAME (tmp
);
16547 finish_goto_stmt (tmp
);
16552 tree string
= RECUR (ASM_STRING (t
));
16553 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
16554 complain
, in_decl
);
16555 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
16556 complain
, in_decl
);
16557 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
16558 complain
, in_decl
);
16559 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
16560 complain
, in_decl
);
16561 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
16563 tree asm_expr
= tmp
;
16564 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
16565 asm_expr
= TREE_OPERAND (asm_expr
, 0);
16566 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
16573 stmt
= begin_try_block ();
16574 RECUR (TRY_STMTS (t
));
16575 finish_cleanup_try_block (stmt
);
16576 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
16580 tree compound_stmt
= NULL_TREE
;
16582 if (FN_TRY_BLOCK_P (t
))
16583 stmt
= begin_function_try_block (&compound_stmt
);
16585 stmt
= begin_try_block ();
16587 RECUR (TRY_STMTS (t
));
16589 if (FN_TRY_BLOCK_P (t
))
16590 finish_function_try_block (stmt
);
16592 finish_try_block (stmt
);
16594 RECUR (TRY_HANDLERS (t
));
16595 if (FN_TRY_BLOCK_P (t
))
16596 finish_function_handler_sequence (stmt
, compound_stmt
);
16598 finish_handler_sequence (stmt
);
16604 tree decl
= HANDLER_PARMS (t
);
16608 decl
= tsubst (decl
, args
, complain
, in_decl
);
16609 /* Prevent instantiate_decl from trying to instantiate
16610 this variable. We've already done all that needs to be
16612 if (decl
!= error_mark_node
)
16613 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
16615 stmt
= begin_handler ();
16616 finish_handler_parms (decl
, stmt
);
16617 RECUR (HANDLER_BODY (t
));
16618 finish_handler (stmt
);
16623 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
16624 if (CLASS_TYPE_P (tmp
))
16626 /* Local classes are not independent templates; they are
16627 instantiated along with their containing function. And this
16628 way we don't have to deal with pushing out of one local class
16629 to instantiate a member of another local class. */
16630 /* Closures are handled by the LAMBDA_EXPR. */
16631 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
16632 complete_type (tmp
);
16633 for (tree fld
= TYPE_FIELDS (tmp
); fld
; fld
= DECL_CHAIN (fld
))
16635 || (TREE_CODE (fld
) == FUNCTION_DECL
16636 && !DECL_ARTIFICIAL (fld
)))
16637 && DECL_TEMPLATE_INSTANTIATION (fld
))
16638 instantiate_decl (fld
, /*defer_ok=*/false,
16639 /*expl_inst_class=*/false);
16643 case STATIC_ASSERT
:
16647 ++c_inhibit_evaluation_warnings
;
16649 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
16652 /*integral_constant_expression_p=*/true);
16653 --c_inhibit_evaluation_warnings
;
16655 finish_static_assert (condition
,
16656 STATIC_ASSERT_MESSAGE (t
),
16657 STATIC_ASSERT_SOURCE_LOCATION (t
),
16658 /*member_p=*/false);
16663 case OACC_PARALLEL
:
16664 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_ACC
, args
, complain
,
16666 stmt
= begin_omp_parallel ();
16667 RECUR (OMP_BODY (t
));
16668 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
16672 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
16673 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), C_ORT_OMP
, args
,
16674 complain
, in_decl
);
16675 if (OMP_PARALLEL_COMBINED (t
))
16676 omp_parallel_combined_clauses
= &tmp
;
16677 stmt
= begin_omp_parallel ();
16678 RECUR (OMP_PARALLEL_BODY (t
));
16679 gcc_assert (omp_parallel_combined_clauses
== NULL
);
16680 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
16681 = OMP_PARALLEL_COMBINED (t
);
16682 pop_omp_privatization_clauses (r
);
16686 r
= push_omp_privatization_clauses (false);
16687 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), C_ORT_OMP
, args
,
16688 complain
, in_decl
);
16689 stmt
= begin_omp_task ();
16690 RECUR (OMP_TASK_BODY (t
));
16691 finish_omp_task (tmp
, stmt
);
16692 pop_omp_privatization_clauses (r
);
16697 case OMP_DISTRIBUTE
:
16701 tree clauses
, body
, pre_body
;
16702 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
16703 tree orig_declv
= NULL_TREE
;
16704 tree incrv
= NULL_TREE
;
16705 enum c_omp_region_type ort
= C_ORT_OMP
;
16708 if (TREE_CODE (t
) == OACC_LOOP
)
16711 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
16712 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), ort
, args
, complain
,
16714 if (OMP_FOR_INIT (t
) != NULL_TREE
)
16716 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
16717 if (OMP_FOR_ORIG_DECLS (t
))
16718 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
16719 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
16720 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
16721 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
16724 stmt
= begin_omp_structured_block ();
16726 pre_body
= push_stmt_list ();
16727 RECUR (OMP_FOR_PRE_BODY (t
));
16728 pre_body
= pop_stmt_list (pre_body
);
16730 if (OMP_FOR_INIT (t
) != NULL_TREE
)
16731 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
16732 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
16733 incrv
, &clauses
, args
, complain
, in_decl
,
16734 integral_constant_expression_p
);
16735 omp_parallel_combined_clauses
= NULL
;
16737 body
= push_stmt_list ();
16738 RECUR (OMP_FOR_BODY (t
));
16739 body
= pop_stmt_list (body
);
16741 if (OMP_FOR_INIT (t
) != NULL_TREE
)
16742 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
16743 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
16747 t
= make_node (TREE_CODE (t
));
16748 TREE_TYPE (t
) = void_type_node
;
16749 OMP_FOR_BODY (t
) = body
;
16750 OMP_FOR_PRE_BODY (t
) = pre_body
;
16751 OMP_FOR_CLAUSES (t
) = clauses
;
16752 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
16756 add_stmt (finish_omp_structured_block (stmt
));
16757 pop_omp_privatization_clauses (r
);
16762 omp_parallel_combined_clauses
= NULL
;
16767 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
16768 && OMP_TEAMS_COMBINED (t
));
16769 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_OMP
, args
, complain
,
16771 stmt
= push_stmt_list ();
16772 RECUR (OMP_BODY (t
));
16773 stmt
= pop_stmt_list (stmt
);
16776 OMP_BODY (t
) = stmt
;
16777 OMP_CLAUSES (t
) = tmp
;
16779 pop_omp_privatization_clauses (r
);
16783 case OMP_TARGET_DATA
:
16785 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), (TREE_CODE (t
) == OACC_DATA
)
16786 ? C_ORT_ACC
: C_ORT_OMP
, args
, complain
,
16788 keep_next_level (true);
16789 stmt
= begin_omp_structured_block ();
16791 RECUR (OMP_BODY (t
));
16792 stmt
= finish_omp_structured_block (stmt
);
16795 OMP_BODY (t
) = stmt
;
16796 OMP_CLAUSES (t
) = tmp
;
16797 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
16799 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
16802 /* For combined target teams, ensure the num_teams and
16803 thread_limit clause expressions are evaluated on the host,
16804 before entering the target construct. */
16806 for (c
= OMP_TEAMS_CLAUSES (teams
);
16807 c
; c
= OMP_CLAUSE_CHAIN (c
))
16808 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
16809 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
16810 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
16812 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
16813 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
16814 if (expr
== error_mark_node
)
16816 tmp
= TARGET_EXPR_SLOT (expr
);
16818 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
16819 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
16820 OMP_CLAUSE_FIRSTPRIVATE
);
16821 OMP_CLAUSE_DECL (tc
) = tmp
;
16822 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
16823 OMP_TARGET_CLAUSES (t
) = tc
;
16832 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), C_ORT_ACC
, args
,
16833 complain
, in_decl
);
16834 OACC_DECLARE_CLAUSES (t
) = tmp
;
16838 case OMP_TARGET_UPDATE
:
16839 case OMP_TARGET_ENTER_DATA
:
16840 case OMP_TARGET_EXIT_DATA
:
16841 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_OMP
, args
,
16842 complain
, in_decl
);
16844 OMP_STANDALONE_CLAUSES (t
) = tmp
;
16848 case OACC_ENTER_DATA
:
16849 case OACC_EXIT_DATA
:
16851 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_ACC
, args
,
16852 complain
, in_decl
);
16854 OMP_STANDALONE_CLAUSES (t
) = tmp
;
16859 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), C_ORT_OMP
, args
,
16860 complain
, in_decl
);
16861 stmt
= push_stmt_list ();
16862 RECUR (OMP_BODY (t
));
16863 stmt
= pop_stmt_list (stmt
);
16866 OMP_BODY (t
) = stmt
;
16867 OMP_ORDERED_CLAUSES (t
) = tmp
;
16873 case OMP_TASKGROUP
:
16874 stmt
= push_stmt_list ();
16875 RECUR (OMP_BODY (t
));
16876 stmt
= pop_stmt_list (stmt
);
16879 OMP_BODY (t
) = stmt
;
16884 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
16885 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
16887 tree op1
= TREE_OPERAND (t
, 1);
16888 tree rhs1
= NULL_TREE
;
16890 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
16892 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
16893 op1
= TREE_OPERAND (op1
, 1);
16895 lhs
= RECUR (TREE_OPERAND (op1
, 0));
16896 rhs
= RECUR (TREE_OPERAND (op1
, 1));
16897 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
16898 NULL_TREE
, NULL_TREE
, rhs1
,
16899 OMP_ATOMIC_SEQ_CST (t
));
16903 tree op1
= TREE_OPERAND (t
, 1);
16904 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
16905 tree rhs1
= NULL_TREE
;
16906 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
16907 enum tree_code opcode
= NOP_EXPR
;
16908 if (code
== OMP_ATOMIC_READ
)
16910 v
= RECUR (TREE_OPERAND (op1
, 0));
16911 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
16913 else if (code
== OMP_ATOMIC_CAPTURE_OLD
16914 || code
== OMP_ATOMIC_CAPTURE_NEW
)
16916 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
16917 v
= RECUR (TREE_OPERAND (op1
, 0));
16918 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
16919 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
16921 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
16922 op11
= TREE_OPERAND (op11
, 1);
16924 lhs
= RECUR (TREE_OPERAND (op11
, 0));
16925 rhs
= RECUR (TREE_OPERAND (op11
, 1));
16926 opcode
= TREE_CODE (op11
);
16927 if (opcode
== MODIFY_EXPR
)
16933 lhs
= RECUR (TREE_OPERAND (op1
, 0));
16934 rhs
= RECUR (TREE_OPERAND (op1
, 1));
16936 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
16937 OMP_ATOMIC_SEQ_CST (t
));
16941 case TRANSACTION_EXPR
:
16944 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
16945 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
16947 if (TRANSACTION_EXPR_IS_STMT (t
))
16949 tree body
= TRANSACTION_EXPR_BODY (t
);
16950 tree noex
= NULL_TREE
;
16951 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
16953 noex
= MUST_NOT_THROW_COND (body
);
16954 if (noex
== NULL_TREE
)
16955 noex
= boolean_true_node
;
16956 body
= TREE_OPERAND (body
, 0);
16958 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
16960 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
16964 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
16965 RECUR (TRANSACTION_EXPR_BODY (t
)),
16972 case MUST_NOT_THROW_EXPR
:
16974 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16975 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
16976 RETURN (build_must_not_throw_expr (op0
, cond
));
16979 case EXPR_PACK_EXPANSION
:
16980 error ("invalid use of pack expansion expression");
16981 RETURN (error_mark_node
);
16983 case NONTYPE_ARGUMENT_PACK
:
16984 error ("use %<...%> to expand argument pack");
16985 RETURN (error_mark_node
);
16987 case COMPOUND_EXPR
:
16988 tmp
= RECUR (TREE_OPERAND (t
, 0));
16989 if (tmp
== NULL_TREE
)
16990 /* If the first operand was a statement, we're done with it. */
16991 RETURN (RECUR (TREE_OPERAND (t
, 1)));
16992 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
16993 RECUR (TREE_OPERAND (t
, 1)),
16996 case ANNOTATE_EXPR
:
16997 tmp
= RECUR (TREE_OPERAND (t
, 0));
16998 RETURN (build3_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
16999 TREE_TYPE (tmp
), tmp
,
17000 RECUR (TREE_OPERAND (t
, 1)),
17001 RECUR (TREE_OPERAND (t
, 2))));
17004 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
17006 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17007 /*function_p=*/false,
17008 integral_constant_expression_p
));
17011 RETURN (NULL_TREE
);
17013 input_location
= loc
;
17019 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
17020 function. For description of the body see comment above
17021 cp_parser_omp_declare_reduction_exprs. */
17024 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17026 if (t
== NULL_TREE
|| t
== error_mark_node
)
17029 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
17031 tree_stmt_iterator tsi
;
17034 memset (stmts
, 0, sizeof stmts
);
17035 for (i
= 0, tsi
= tsi_start (t
);
17036 i
< 7 && !tsi_end_p (tsi
);
17037 i
++, tsi_next (&tsi
))
17038 stmts
[i
] = tsi_stmt (tsi
);
17039 gcc_assert (tsi_end_p (tsi
));
17043 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
17044 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
17045 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
17046 args
, complain
, in_decl
);
17047 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
17048 args
, complain
, in_decl
);
17049 DECL_CONTEXT (omp_out
) = current_function_decl
;
17050 DECL_CONTEXT (omp_in
) = current_function_decl
;
17051 keep_next_level (true);
17052 tree block
= begin_omp_structured_block ();
17053 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
17054 block
= finish_omp_structured_block (block
);
17055 block
= maybe_cleanup_point_expr_void (block
);
17056 add_decl_expr (omp_out
);
17057 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
17058 TREE_NO_WARNING (omp_out
) = 1;
17059 add_decl_expr (omp_in
);
17060 finish_expr_stmt (block
);
17064 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
17065 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
17066 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
17067 args
, complain
, in_decl
);
17068 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
17069 args
, complain
, in_decl
);
17070 DECL_CONTEXT (omp_priv
) = current_function_decl
;
17071 DECL_CONTEXT (omp_orig
) = current_function_decl
;
17072 keep_next_level (true);
17073 tree block
= begin_omp_structured_block ();
17074 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
17075 block
= finish_omp_structured_block (block
);
17076 block
= maybe_cleanup_point_expr_void (block
);
17077 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
17078 add_decl_expr (omp_priv
);
17079 add_decl_expr (omp_orig
);
17080 finish_expr_stmt (block
);
17082 add_decl_expr (omp_orig
);
17086 /* T is a postfix-expression that is not being used in a function
17087 call. Return the substituted version of T. */
17090 tsubst_non_call_postfix_expression (tree t
, tree args
,
17091 tsubst_flags_t complain
,
17094 if (TREE_CODE (t
) == SCOPE_REF
)
17095 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
17096 /*done=*/false, /*address_p=*/false);
17098 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
17099 /*function_p=*/false,
17100 /*integral_constant_expression_p=*/false);
17105 /* T is a LAMBDA_EXPR. Generate a new LAMBDA_EXPR for the current
17106 instantiation context. Instantiating a pack expansion containing a lambda
17107 might result in multiple lambdas all based on the same lambda in the
17111 tsubst_lambda_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
17113 tree oldfn
= lambda_function (t
);
17116 tree r
= build_lambda_expr ();
17118 LAMBDA_EXPR_LOCATION (r
)
17119 = LAMBDA_EXPR_LOCATION (t
);
17120 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
17121 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
17122 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
17124 if (LAMBDA_EXPR_EXTRA_SCOPE (t
) == NULL_TREE
)
17125 LAMBDA_EXPR_EXTRA_SCOPE (r
) = NULL_TREE
;
17127 record_lambda_scope (r
);
17129 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
17130 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
17132 for (tree cap
= LAMBDA_EXPR_CAPTURE_LIST (t
); cap
;
17133 cap
= TREE_CHAIN (cap
))
17135 tree field
= TREE_PURPOSE (cap
);
17136 if (PACK_EXPANSION_P (field
))
17137 field
= PACK_EXPANSION_PATTERN (field
);
17138 field
= tsubst_decl (field
, args
, complain
);
17140 if (field
== error_mark_node
)
17141 return error_mark_node
;
17143 tree init
= TREE_VALUE (cap
);
17144 if (PACK_EXPANSION_P (init
))
17145 init
= tsubst_pack_expansion (init
, args
, complain
, in_decl
);
17147 init
= tsubst_copy_and_build (init
, args
, complain
, in_decl
,
17148 /*fn*/false, /*constexpr*/false);
17150 if (TREE_CODE (field
) == TREE_VEC
)
17152 int len
= TREE_VEC_LENGTH (field
);
17153 gcc_assert (TREE_CODE (init
) == TREE_VEC
17154 && TREE_VEC_LENGTH (init
) == len
);
17155 for (int i
= 0; i
< len
; ++i
)
17156 LAMBDA_EXPR_CAPTURE_LIST (r
)
17157 = tree_cons (TREE_VEC_ELT (field
, i
),
17158 TREE_VEC_ELT (init
, i
),
17159 LAMBDA_EXPR_CAPTURE_LIST (r
));
17163 LAMBDA_EXPR_CAPTURE_LIST (r
)
17164 = tree_cons (field
, init
, LAMBDA_EXPR_CAPTURE_LIST (r
));
17166 if (id_equal (DECL_NAME (field
), "__this"))
17167 LAMBDA_EXPR_THIS_CAPTURE (r
) = field
;
17171 tree type
= begin_lambda_type (r
);
17173 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17174 determine_visibility (TYPE_NAME (type
));
17176 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (r
));
17178 tree oldtmpl
= (generic_lambda_fn_p (oldfn
)
17179 ? DECL_TI_TEMPLATE (oldfn
)
17182 tree fntype
= static_fn_type (oldfn
);
17184 ++processing_template_decl
;
17185 fntype
= tsubst (fntype
, args
, complain
, in_decl
);
17187 --processing_template_decl
;
17189 if (fntype
== error_mark_node
)
17190 r
= error_mark_node
;
17193 /* Fix the type of 'this'. */
17194 fntype
= build_memfn_type (fntype
, type
,
17195 type_memfn_quals (fntype
),
17196 type_memfn_rqual (fntype
));
17200 tmpl
= tsubst_template_decl (oldtmpl
, args
, complain
, fntype
);
17201 fn
= DECL_TEMPLATE_RESULT (tmpl
);
17202 finish_member_declaration (tmpl
);
17207 fn
= tsubst_function_decl (oldfn
, args
, complain
, fntype
);
17208 finish_member_declaration (fn
);
17211 /* Let finish_function set this. */
17212 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
17214 bool nested
= cfun
;
17216 push_function_context ();
17218 /* Still increment function_depth so that we don't GC in the
17219 middle of an expression. */
17222 local_specialization_stack
s (lss_copy
);
17224 tree body
= start_lambda_function (fn
, r
);
17226 register_parameter_specializations (oldfn
, fn
);
17228 tsubst_expr (DECL_SAVED_TREE (oldfn
), args
, complain
, r
,
17229 /*constexpr*/false);
17231 finish_lambda_function (body
);
17234 pop_function_context ();
17238 /* The capture list was built up in reverse order; fix that now. */
17239 LAMBDA_EXPR_CAPTURE_LIST (r
)
17240 = nreverse (LAMBDA_EXPR_CAPTURE_LIST (r
));
17242 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
17244 maybe_add_lambda_conv_op (type
);
17247 finish_struct (type
, /*attr*/NULL_TREE
);
17249 insert_pending_capture_proxies ();
17254 /* Like tsubst but deals with expressions and performs semantic
17255 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
17258 tsubst_copy_and_build (tree t
,
17260 tsubst_flags_t complain
,
17263 bool integral_constant_expression_p
)
17265 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
17266 #define RECUR(NODE) \
17267 tsubst_copy_and_build (NODE, args, complain, in_decl, \
17268 /*function_p=*/false, \
17269 integral_constant_expression_p)
17274 if (t
== NULL_TREE
|| t
== error_mark_node
)
17277 loc
= input_location
;
17278 if (EXPR_HAS_LOCATION (t
))
17279 input_location
= EXPR_LOCATION (t
);
17281 /* N3276 decltype magic only applies to calls at the top level or on the
17282 right side of a comma. */
17283 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
17284 complain
&= ~tf_decltype
;
17286 switch (TREE_CODE (t
))
17290 /* Fall through. */
17291 case IDENTIFIER_NODE
:
17295 bool non_integral_constant_expression_p
;
17296 const char *error_msg
;
17298 if (IDENTIFIER_CONV_OP_P (t
))
17300 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17301 t
= make_conv_op_name (new_type
);
17304 /* Look up the name. */
17305 decl
= lookup_name (t
);
17307 /* By convention, expressions use ERROR_MARK_NODE to indicate
17308 failure, not NULL_TREE. */
17309 if (decl
== NULL_TREE
)
17310 decl
= error_mark_node
;
17312 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
17314 integral_constant_expression_p
,
17315 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
17316 &non_integral_constant_expression_p
,
17317 /*template_p=*/false,
17319 /*address_p=*/false,
17320 /*template_arg_p=*/false,
17325 if (!function_p
&& identifier_p (decl
))
17327 if (complain
& tf_error
)
17328 unqualified_name_lookup_error (decl
);
17329 decl
= error_mark_node
;
17334 case TEMPLATE_ID_EXPR
:
17337 tree templ
= RECUR (TREE_OPERAND (t
, 0));
17338 tree targs
= TREE_OPERAND (t
, 1);
17341 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
17342 if (targs
== error_mark_node
)
17343 RETURN (error_mark_node
);
17345 if (TREE_CODE (templ
) == SCOPE_REF
)
17347 tree name
= TREE_OPERAND (templ
, 1);
17348 tree tid
= lookup_template_function (name
, targs
);
17349 TREE_OPERAND (templ
, 1) = tid
;
17353 if (variable_template_p (templ
))
17354 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
17356 if (TREE_CODE (templ
) == COMPONENT_REF
)
17358 object
= TREE_OPERAND (templ
, 0);
17359 templ
= TREE_OPERAND (templ
, 1);
17362 object
= NULL_TREE
;
17363 templ
= lookup_template_function (templ
, targs
);
17366 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
17367 object
, templ
, NULL_TREE
));
17369 RETURN (baselink_for_fns (templ
));
17374 tree r
= RECUR (TREE_OPERAND (t
, 0));
17376 if (REFERENCE_REF_P (t
))
17378 /* A type conversion to reference type will be enclosed in
17379 such an indirect ref, but the substitution of the cast
17380 will have also added such an indirect ref. */
17381 r
= convert_from_reference (r
);
17384 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
17385 complain
|decltype_flag
);
17387 if (REF_PARENTHESIZED_P (t
))
17388 r
= force_paren_expr (r
);
17395 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17396 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17397 RETURN (build_nop (type
, op0
));
17400 case IMPLICIT_CONV_EXPR
:
17402 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17403 tree expr
= RECUR (TREE_OPERAND (t
, 0));
17404 if (dependent_type_p (type
) || type_dependent_expression_p (expr
))
17406 retval
= copy_node (t
);
17407 TREE_TYPE (retval
) = type
;
17408 TREE_OPERAND (retval
, 0) = expr
;
17411 if (IMPLICIT_CONV_EXPR_NONTYPE_ARG (t
))
17412 /* We'll pass this to convert_nontype_argument again, we don't need
17413 to actually perform any conversion here. */
17415 int flags
= LOOKUP_IMPLICIT
;
17416 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
17417 flags
= LOOKUP_NORMAL
;
17418 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
17424 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17425 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17426 if (op0
== error_mark_node
)
17427 RETURN (error_mark_node
);
17428 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
17432 case REINTERPRET_CAST_EXPR
:
17433 case CONST_CAST_EXPR
:
17434 case DYNAMIC_CAST_EXPR
:
17435 case STATIC_CAST_EXPR
:
17438 tree op
, r
= NULL_TREE
;
17440 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17441 if (integral_constant_expression_p
17442 && !cast_valid_in_integral_constant_expression_p (type
))
17444 if (complain
& tf_error
)
17445 error ("a cast to a type other than an integral or "
17446 "enumeration type cannot appear in a constant-expression");
17447 RETURN (error_mark_node
);
17450 op
= RECUR (TREE_OPERAND (t
, 0));
17452 warning_sentinel
s(warn_useless_cast
);
17453 warning_sentinel
s2(warn_ignored_qualifiers
);
17454 switch (TREE_CODE (t
))
17457 r
= build_functional_cast (type
, op
, complain
);
17459 case REINTERPRET_CAST_EXPR
:
17460 r
= build_reinterpret_cast (type
, op
, complain
);
17462 case CONST_CAST_EXPR
:
17463 r
= build_const_cast (type
, op
, complain
);
17465 case DYNAMIC_CAST_EXPR
:
17466 r
= build_dynamic_cast (type
, op
, complain
);
17468 case STATIC_CAST_EXPR
:
17469 r
= build_static_cast (type
, op
, complain
);
17472 gcc_unreachable ();
17478 case POSTDECREMENT_EXPR
:
17479 case POSTINCREMENT_EXPR
:
17480 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17481 args
, complain
, in_decl
);
17482 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
17483 complain
|decltype_flag
));
17485 case PREDECREMENT_EXPR
:
17486 case PREINCREMENT_EXPR
:
17490 case TRUTH_NOT_EXPR
:
17491 case UNARY_PLUS_EXPR
: /* Unary + */
17492 case REALPART_EXPR
:
17493 case IMAGPART_EXPR
:
17494 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
17495 RECUR (TREE_OPERAND (t
, 0)),
17496 complain
|decltype_flag
));
17498 case FIX_TRUNC_EXPR
:
17499 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
17503 op1
= TREE_OPERAND (t
, 0);
17504 if (TREE_CODE (op1
) == LABEL_DECL
)
17505 RETURN (finish_label_address_expr (DECL_NAME (op1
),
17506 EXPR_LOCATION (op1
)));
17507 if (TREE_CODE (op1
) == SCOPE_REF
)
17508 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
17509 /*done=*/true, /*address_p=*/true);
17511 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
17513 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
17514 complain
|decltype_flag
));
17519 case TRUNC_DIV_EXPR
:
17520 case CEIL_DIV_EXPR
:
17521 case FLOOR_DIV_EXPR
:
17522 case ROUND_DIV_EXPR
:
17523 case EXACT_DIV_EXPR
:
17527 case TRUNC_MOD_EXPR
:
17528 case FLOOR_MOD_EXPR
:
17529 case TRUTH_ANDIF_EXPR
:
17530 case TRUTH_ORIF_EXPR
:
17531 case TRUTH_AND_EXPR
:
17532 case TRUTH_OR_EXPR
:
17548 warning_sentinel
s1(warn_type_limits
);
17549 warning_sentinel
s2(warn_div_by_zero
);
17550 warning_sentinel
s3(warn_logical_op
);
17551 warning_sentinel
s4(warn_tautological_compare
);
17552 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17553 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17554 tree r
= build_x_binary_op
17555 (input_location
, TREE_CODE (t
),
17557 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
17559 : TREE_CODE (TREE_OPERAND (t
, 0))),
17561 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
17563 : TREE_CODE (TREE_OPERAND (t
, 1))),
17565 complain
|decltype_flag
);
17566 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
17567 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
17572 case POINTER_PLUS_EXPR
:
17574 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17575 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17576 RETURN (fold_build_pointer_plus (op0
, op1
));
17580 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
17581 /*address_p=*/false));
17583 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17584 args
, complain
, in_decl
);
17585 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
17586 RECUR (TREE_OPERAND (t
, 1)),
17587 complain
|decltype_flag
));
17590 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
17591 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
17592 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
17599 op1
= TREE_OPERAND (t
, 0);
17600 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
17601 op1
= TREE_TYPE (op1
);
17604 /* When there are no ARGS, we are trying to evaluate a
17605 non-dependent expression from the parser. Trying to do
17606 the substitutions may not work. */
17608 op1
= TREE_TYPE (op1
);
17612 ++cp_unevaluated_operand
;
17613 ++c_inhibit_evaluation_warnings
;
17615 op1
= tsubst (op1
, args
, complain
, in_decl
);
17617 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
17618 /*function_p=*/false,
17619 /*integral_constant_expression_p=*/
17621 --cp_unevaluated_operand
;
17622 --c_inhibit_evaluation_warnings
;
17625 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
17626 complain
& tf_error
);
17628 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
17629 complain
& tf_error
);
17630 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
17632 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
17634 if (!processing_template_decl
&& TYPE_P (op1
))
17636 r
= build_min (SIZEOF_EXPR
, size_type_node
,
17637 build1 (NOP_EXPR
, op1
, error_mark_node
));
17638 SIZEOF_EXPR_TYPE_P (r
) = 1;
17641 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
17642 TREE_SIDE_EFFECTS (r
) = 0;
17643 TREE_READONLY (r
) = 1;
17645 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
17650 case AT_ENCODE_EXPR
:
17652 op1
= TREE_OPERAND (t
, 0);
17653 ++cp_unevaluated_operand
;
17654 ++c_inhibit_evaluation_warnings
;
17655 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
17656 /*function_p=*/false,
17657 /*integral_constant_expression_p=*/false);
17658 --cp_unevaluated_operand
;
17659 --c_inhibit_evaluation_warnings
;
17660 RETURN (objc_build_encode_expr (op1
));
17663 case NOEXCEPT_EXPR
:
17664 op1
= TREE_OPERAND (t
, 0);
17665 ++cp_unevaluated_operand
;
17666 ++c_inhibit_evaluation_warnings
;
17667 ++cp_noexcept_operand
;
17668 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
17669 /*function_p=*/false,
17670 /*integral_constant_expression_p=*/false);
17671 --cp_unevaluated_operand
;
17672 --c_inhibit_evaluation_warnings
;
17673 --cp_noexcept_operand
;
17674 RETURN (finish_noexcept_expr (op1
, complain
));
17678 warning_sentinel
s(warn_div_by_zero
);
17679 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
17680 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
17681 tree r
= build_x_modify_expr
17682 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
17683 complain
|decltype_flag
);
17684 /* TREE_NO_WARNING must be set if either the expression was
17685 parenthesized or it uses an operator such as >>= rather
17686 than plain assignment. In the former case, it was already
17687 set and must be copied. In the latter case,
17688 build_x_modify_expr sets it and it must not be reset
17690 if (TREE_NO_WARNING (t
))
17691 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
17697 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
17698 args
, complain
, in_decl
);
17699 /* Remember that there was a reference to this entity. */
17701 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
17702 RETURN (error_mark_node
);
17703 RETURN (build_x_arrow (input_location
, op1
, complain
));
17707 tree placement
= RECUR (TREE_OPERAND (t
, 0));
17708 tree init
= RECUR (TREE_OPERAND (t
, 3));
17709 vec
<tree
, va_gc
> *placement_vec
;
17710 vec
<tree
, va_gc
> *init_vec
;
17713 if (placement
== NULL_TREE
)
17714 placement_vec
= NULL
;
17717 placement_vec
= make_tree_vector ();
17718 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
17719 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
17722 /* If there was an initializer in the original tree, but it
17723 instantiated to an empty list, then we should pass a
17724 non-NULL empty vector to tell build_new that it was an
17725 empty initializer() rather than no initializer. This can
17726 only happen when the initializer is a pack expansion whose
17727 parameter packs are of length zero. */
17728 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
17732 init_vec
= make_tree_vector ();
17733 if (init
== void_node
)
17734 gcc_assert (init_vec
!= NULL
);
17737 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
17738 vec_safe_push (init_vec
, TREE_VALUE (init
));
17742 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
17743 tree op2
= RECUR (TREE_OPERAND (t
, 2));
17744 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
17745 NEW_EXPR_USE_GLOBAL (t
),
17748 if (placement_vec
!= NULL
)
17749 release_tree_vector (placement_vec
);
17750 if (init_vec
!= NULL
)
17751 release_tree_vector (init_vec
);
17758 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17759 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17760 RETURN (delete_sanity (op0
, op1
,
17761 DELETE_EXPR_USE_VEC (t
),
17762 DELETE_EXPR_USE_GLOBAL (t
),
17766 case COMPOUND_EXPR
:
17768 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
17769 complain
& ~tf_decltype
, in_decl
,
17770 /*function_p=*/false,
17771 integral_constant_expression_p
);
17772 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
17774 RECUR (TREE_OPERAND (t
, 1)),
17775 complain
|decltype_flag
));
17781 vec
<tree
, va_gc
> *call_args
;
17782 unsigned int nargs
, i
;
17787 function
= CALL_EXPR_FN (t
);
17788 /* Internal function with no arguments. */
17789 if (function
== NULL_TREE
&& call_expr_nargs (t
) == 0)
17792 /* When we parsed the expression, we determined whether or
17793 not Koenig lookup should be performed. */
17794 koenig_p
= KOENIG_LOOKUP_P (t
);
17795 if (function
== NULL_TREE
)
17798 qualified_p
= false;
17800 else if (TREE_CODE (function
) == SCOPE_REF
)
17802 qualified_p
= true;
17803 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
17805 /*address_p=*/false);
17807 else if (koenig_p
&& identifier_p (function
))
17809 /* Do nothing; calling tsubst_copy_and_build on an identifier
17810 would incorrectly perform unqualified lookup again.
17812 Note that we can also have an IDENTIFIER_NODE if the earlier
17813 unqualified lookup found a member function; in that case
17814 koenig_p will be false and we do want to do the lookup
17815 again to find the instantiated member function.
17817 FIXME but doing that causes c++/15272, so we need to stop
17818 using IDENTIFIER_NODE in that situation. */
17819 qualified_p
= false;
17823 if (TREE_CODE (function
) == COMPONENT_REF
)
17825 tree op
= TREE_OPERAND (function
, 1);
17827 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
17828 || (BASELINK_P (op
)
17829 && BASELINK_QUALIFIED_P (op
)));
17832 qualified_p
= false;
17834 if (TREE_CODE (function
) == ADDR_EXPR
17835 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
17836 /* Avoid error about taking the address of a constructor. */
17837 function
= TREE_OPERAND (function
, 0);
17839 function
= tsubst_copy_and_build (function
, args
, complain
,
17842 integral_constant_expression_p
);
17844 if (BASELINK_P (function
))
17845 qualified_p
= true;
17848 nargs
= call_expr_nargs (t
);
17849 call_args
= make_tree_vector ();
17850 for (i
= 0; i
< nargs
; ++i
)
17852 tree arg
= CALL_EXPR_ARG (t
, i
);
17854 if (!PACK_EXPANSION_P (arg
))
17855 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
17858 /* Expand the pack expansion and push each entry onto
17860 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
17861 if (TREE_CODE (arg
) == TREE_VEC
)
17863 unsigned int len
, j
;
17865 len
= TREE_VEC_LENGTH (arg
);
17866 for (j
= 0; j
< len
; ++j
)
17868 tree value
= TREE_VEC_ELT (arg
, j
);
17869 if (value
!= NULL_TREE
)
17870 value
= convert_from_reference (value
);
17871 vec_safe_push (call_args
, value
);
17876 /* A partial substitution. Add one entry. */
17877 vec_safe_push (call_args
, arg
);
17882 /* We do not perform argument-dependent lookup if normal
17883 lookup finds a non-function, in accordance with the
17884 expected resolution of DR 218. */
17886 && ((is_overloaded_fn (function
)
17887 /* If lookup found a member function, the Koenig lookup is
17888 not appropriate, even if an unqualified-name was used
17889 to denote the function. */
17890 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
17891 || identifier_p (function
))
17892 /* Only do this when substitution turns a dependent call
17893 into a non-dependent call. */
17894 && type_dependent_expression_p_push (t
)
17895 && !any_type_dependent_arguments_p (call_args
))
17896 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
17898 if (function
!= NULL_TREE
17899 && identifier_p (function
)
17900 && !any_type_dependent_arguments_p (call_args
))
17902 if (koenig_p
&& (complain
& tf_warning_or_error
))
17904 /* For backwards compatibility and good diagnostics, try
17905 the unqualified lookup again if we aren't in SFINAE
17907 tree unq
= (tsubst_copy_and_build
17908 (function
, args
, complain
, in_decl
, true,
17909 integral_constant_expression_p
));
17910 if (unq
== error_mark_node
)
17912 release_tree_vector (call_args
);
17913 RETURN (error_mark_node
);
17916 if (unq
!= function
)
17918 /* In a lambda fn, we have to be careful to not
17919 introduce new this captures. Legacy code can't
17920 be using lambdas anyway, so it's ok to be
17922 bool in_lambda
= (current_class_type
17923 && LAMBDA_TYPE_P (current_class_type
));
17924 char const *const msg
17925 = G_("%qD was not declared in this scope, "
17926 "and no declarations were found by "
17927 "argument-dependent lookup at the point "
17928 "of instantiation");
17932 error_at (EXPR_LOC_OR_LOC (t
, input_location
),
17935 diag
= permerror (EXPR_LOC_OR_LOC (t
, input_location
),
17941 if (INDIRECT_REF_P (fn
))
17942 fn
= TREE_OPERAND (fn
, 0);
17943 if (is_overloaded_fn (fn
))
17944 fn
= get_first_fn (fn
);
17947 /* Can't say anything more. */;
17948 else if (DECL_CLASS_SCOPE_P (fn
))
17950 location_t loc
= EXPR_LOC_OR_LOC (t
,
17953 "declarations in dependent base %qT are "
17954 "not found by unqualified lookup",
17955 DECL_CLASS_CONTEXT (fn
));
17956 if (current_class_ptr
)
17958 "use %<this->%D%> instead", function
);
17961 "use %<%T::%D%> instead",
17962 current_class_name
, function
);
17965 inform (DECL_SOURCE_LOCATION (fn
),
17966 "%qD declared here, later in the "
17967 "translation unit", fn
);
17970 release_tree_vector (call_args
);
17971 RETURN (error_mark_node
);
17978 if (identifier_p (function
))
17980 if (complain
& tf_error
)
17981 unqualified_name_lookup_error (function
);
17982 release_tree_vector (call_args
);
17983 RETURN (error_mark_node
);
17987 /* Remember that there was a reference to this entity. */
17988 if (function
!= NULL_TREE
17989 && DECL_P (function
)
17990 && !mark_used (function
, complain
) && !(complain
& tf_error
))
17992 release_tree_vector (call_args
);
17993 RETURN (error_mark_node
);
17996 /* Put back tf_decltype for the actual call. */
17997 complain
|= decltype_flag
;
17999 if (function
== NULL_TREE
)
18000 switch (CALL_EXPR_IFN (t
))
18003 gcc_assert (nargs
== 1);
18004 if (vec_safe_length (call_args
) != 1)
18006 error_at (EXPR_LOC_OR_LOC (t
, input_location
),
18007 "wrong number of arguments to "
18008 "%<__builtin_launder%>");
18009 ret
= error_mark_node
;
18012 ret
= finish_builtin_launder (EXPR_LOC_OR_LOC (t
,
18014 (*call_args
)[0], complain
);
18018 /* Unsupported internal function with arguments. */
18019 gcc_unreachable ();
18021 else if (TREE_CODE (function
) == OFFSET_REF
)
18022 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
18024 else if (TREE_CODE (function
) == COMPONENT_REF
)
18026 tree instance
= TREE_OPERAND (function
, 0);
18027 tree fn
= TREE_OPERAND (function
, 1);
18029 if (processing_template_decl
18030 && (type_dependent_expression_p (instance
)
18031 || (!BASELINK_P (fn
)
18032 && TREE_CODE (fn
) != FIELD_DECL
)
18033 || type_dependent_expression_p (fn
)
18034 || any_type_dependent_arguments_p (call_args
)))
18035 ret
= build_min_nt_call_vec (function
, call_args
);
18036 else if (!BASELINK_P (fn
))
18037 ret
= finish_call_expr (function
, &call_args
,
18038 /*disallow_virtual=*/false,
18039 /*koenig_p=*/false,
18042 ret
= (build_new_method_call
18044 &call_args
, NULL_TREE
,
18045 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
18050 ret
= finish_call_expr (function
, &call_args
,
18051 /*disallow_virtual=*/qualified_p
,
18055 release_tree_vector (call_args
);
18057 if (ret
!= error_mark_node
)
18059 bool op
= CALL_EXPR_OPERATOR_SYNTAX (t
);
18060 bool ord
= CALL_EXPR_ORDERED_ARGS (t
);
18061 bool rev
= CALL_EXPR_REVERSE_ARGS (t
);
18062 bool thk
= CALL_FROM_THUNK_P (t
);
18063 if (op
|| ord
|| rev
|| thk
)
18065 function
= extract_call_expr (ret
);
18066 CALL_EXPR_OPERATOR_SYNTAX (function
) = op
;
18067 CALL_EXPR_ORDERED_ARGS (function
) = ord
;
18068 CALL_EXPR_REVERSE_ARGS (function
) = rev
;
18071 if (TREE_CODE (function
) == CALL_EXPR
)
18072 CALL_FROM_THUNK_P (function
) = true;
18074 AGGR_INIT_FROM_THUNK_P (function
) = true;
18075 /* The thunk location is not interesting. */
18076 SET_EXPR_LOCATION (function
, UNKNOWN_LOCATION
);
18086 tree cond
= RECUR (TREE_OPERAND (t
, 0));
18087 tree folded_cond
= fold_non_dependent_expr (cond
);
18090 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
18092 if (integer_zerop (folded_cond
))
18094 ++c_inhibit_evaluation_warnings
;
18095 exp1
= RECUR (TREE_OPERAND (t
, 1));
18096 --c_inhibit_evaluation_warnings
;
18097 exp2
= RECUR (TREE_OPERAND (t
, 2));
18101 exp1
= RECUR (TREE_OPERAND (t
, 1));
18102 ++c_inhibit_evaluation_warnings
;
18103 exp2
= RECUR (TREE_OPERAND (t
, 2));
18104 --c_inhibit_evaluation_warnings
;
18106 cond
= folded_cond
;
18110 exp1
= RECUR (TREE_OPERAND (t
, 1));
18111 exp2
= RECUR (TREE_OPERAND (t
, 2));
18114 warning_sentinel
s(warn_duplicated_branches
);
18115 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
18116 cond
, exp1
, exp2
, complain
));
18119 case PSEUDO_DTOR_EXPR
:
18121 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18122 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18123 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
18124 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
18130 tree purpose
, value
, chain
;
18132 if (t
== void_list_node
)
18135 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
18136 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
18138 /* We have pack expansions, so expand those and
18139 create a new list out of it. */
18140 tree purposevec
= NULL_TREE
;
18141 tree valuevec
= NULL_TREE
;
18145 /* Expand the argument expressions. */
18146 if (TREE_PURPOSE (t
))
18147 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
18148 complain
, in_decl
);
18149 if (TREE_VALUE (t
))
18150 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
18151 complain
, in_decl
);
18153 /* Build the rest of the list. */
18154 chain
= TREE_CHAIN (t
);
18155 if (chain
&& chain
!= void_type_node
)
18156 chain
= RECUR (chain
);
18158 /* Determine the number of arguments. */
18159 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
18161 len
= TREE_VEC_LENGTH (purposevec
);
18162 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
18164 else if (TREE_CODE (valuevec
) == TREE_VEC
)
18165 len
= TREE_VEC_LENGTH (valuevec
);
18168 /* Since we only performed a partial substitution into
18169 the argument pack, we only RETURN (a single list
18171 if (purposevec
== TREE_PURPOSE (t
)
18172 && valuevec
== TREE_VALUE (t
)
18173 && chain
== TREE_CHAIN (t
))
18176 RETURN (tree_cons (purposevec
, valuevec
, chain
));
18179 /* Convert the argument vectors into a TREE_LIST */
18183 /* Grab the Ith values. */
18185 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
18188 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
18191 /* Build the list (backwards). */
18192 chain
= tree_cons (purpose
, value
, chain
);
18198 purpose
= TREE_PURPOSE (t
);
18200 purpose
= RECUR (purpose
);
18201 value
= TREE_VALUE (t
);
18203 value
= RECUR (value
);
18204 chain
= TREE_CHAIN (t
);
18205 if (chain
&& chain
!= void_type_node
)
18206 chain
= RECUR (chain
);
18207 if (purpose
== TREE_PURPOSE (t
)
18208 && value
== TREE_VALUE (t
)
18209 && chain
== TREE_CHAIN (t
))
18211 RETURN (tree_cons (purpose
, value
, chain
));
18214 case COMPONENT_REF
:
18221 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
18222 args
, complain
, in_decl
);
18223 /* Remember that there was a reference to this entity. */
18224 if (DECL_P (object
)
18225 && !mark_used (object
, complain
) && !(complain
& tf_error
))
18226 RETURN (error_mark_node
);
18227 object_type
= TREE_TYPE (object
);
18229 member
= TREE_OPERAND (t
, 1);
18230 if (BASELINK_P (member
))
18231 member
= tsubst_baselink (member
,
18232 non_reference (TREE_TYPE (object
)),
18233 args
, complain
, in_decl
);
18235 member
= tsubst_copy (member
, args
, complain
, in_decl
);
18236 if (member
== error_mark_node
)
18237 RETURN (error_mark_node
);
18239 if (TREE_CODE (member
) == FIELD_DECL
)
18241 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
18242 if (TREE_CODE (r
) == COMPONENT_REF
)
18243 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
18246 else if (type_dependent_expression_p (object
))
18247 /* We can't do much here. */;
18248 else if (!CLASS_TYPE_P (object_type
))
18250 if (scalarish_type_p (object_type
))
18252 tree s
= NULL_TREE
;
18253 tree dtor
= member
;
18255 if (TREE_CODE (dtor
) == SCOPE_REF
)
18257 s
= TREE_OPERAND (dtor
, 0);
18258 dtor
= TREE_OPERAND (dtor
, 1);
18260 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
18262 dtor
= TREE_OPERAND (dtor
, 0);
18264 RETURN (finish_pseudo_destructor_expr
18265 (object
, s
, dtor
, input_location
));
18269 else if (TREE_CODE (member
) == SCOPE_REF
18270 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
18272 /* Lookup the template functions now that we know what the
18274 tree scope
= TREE_OPERAND (member
, 0);
18275 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
18276 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
18277 member
= lookup_qualified_name (scope
, tmpl
,
18278 /*is_type_p=*/false,
18279 /*complain=*/false);
18280 if (BASELINK_P (member
))
18282 BASELINK_FUNCTIONS (member
)
18283 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
18285 member
= (adjust_result_of_qualified_name_lookup
18286 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
18291 qualified_name_lookup_error (scope
, tmpl
, member
,
18293 RETURN (error_mark_node
);
18296 else if (TREE_CODE (member
) == SCOPE_REF
18297 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
18298 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
18300 if (complain
& tf_error
)
18302 if (TYPE_P (TREE_OPERAND (member
, 0)))
18303 error ("%qT is not a class or namespace",
18304 TREE_OPERAND (member
, 0));
18306 error ("%qD is not a class or namespace",
18307 TREE_OPERAND (member
, 0));
18309 RETURN (error_mark_node
);
18312 r
= finish_class_member_access_expr (object
, member
,
18313 /*template_p=*/false,
18315 if (TREE_CODE (r
) == COMPONENT_REF
)
18316 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
18321 RETURN (build_throw
18322 (RECUR (TREE_OPERAND (t
, 0))));
18326 vec
<constructor_elt
, va_gc
> *n
;
18327 constructor_elt
*ce
;
18328 unsigned HOST_WIDE_INT idx
;
18329 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18330 bool process_index_p
;
18332 bool need_copy_p
= false;
18335 if (type
== error_mark_node
)
18336 RETURN (error_mark_node
);
18338 /* We do not want to process the index of aggregate
18339 initializers as they are identifier nodes which will be
18340 looked up by digest_init. */
18341 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
18343 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
18344 newlen
= vec_safe_length (n
);
18345 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
18347 if (ce
->index
&& process_index_p
18348 /* An identifier index is looked up in the type
18349 being initialized, not the current scope. */
18350 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
18351 ce
->index
= RECUR (ce
->index
);
18353 if (PACK_EXPANSION_P (ce
->value
))
18355 /* Substitute into the pack expansion. */
18356 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
18359 if (ce
->value
== error_mark_node
18360 || PACK_EXPANSION_P (ce
->value
))
18362 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
18363 /* Just move the argument into place. */
18364 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
18367 /* Update the length of the final CONSTRUCTOR
18368 arguments vector, and note that we will need to
18370 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
18371 need_copy_p
= true;
18375 ce
->value
= RECUR (ce
->value
);
18380 vec
<constructor_elt
, va_gc
> *old_n
= n
;
18382 vec_alloc (n
, newlen
);
18383 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
18385 if (TREE_CODE (ce
->value
) == TREE_VEC
)
18387 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
18388 for (i
= 0; i
< len
; ++i
)
18389 CONSTRUCTOR_APPEND_ELT (n
, 0,
18390 TREE_VEC_ELT (ce
->value
, i
));
18393 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
18397 r
= build_constructor (init_list_type_node
, n
);
18398 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
18400 if (TREE_HAS_CONSTRUCTOR (t
))
18402 fcl_t cl
= fcl_functional
;
18403 if (CONSTRUCTOR_C99_COMPOUND_LITERAL (t
))
18405 RETURN (finish_compound_literal (type
, r
, complain
, cl
));
18408 TREE_TYPE (r
) = type
;
18414 tree operand_0
= TREE_OPERAND (t
, 0);
18415 if (TYPE_P (operand_0
))
18417 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
18418 RETURN (get_typeid (operand_0
, complain
));
18422 operand_0
= RECUR (operand_0
);
18423 RETURN (build_typeid (operand_0
, complain
));
18434 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
18435 /* ??? We're doing a subset of finish_id_expression here. */
18437 && !processing_template_decl
18438 && !cp_unevaluated_operand
18439 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
18440 && CP_DECL_THREAD_LOCAL_P (r
))
18442 if (tree wrap
= get_tls_wrapper_fn (r
))
18443 /* Replace an evaluated use of the thread_local variable with
18444 a call to its wrapper. */
18445 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
18447 else if (outer_automatic_var_p (r
))
18448 r
= process_outer_var_ref (r
, complain
);
18450 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
18451 /* If the original type was a reference, we'll be wrapped in
18452 the appropriate INDIRECT_REF. */
18453 r
= convert_from_reference (r
);
18459 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18460 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
18461 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
18464 case OFFSETOF_EXPR
:
18467 = tsubst_copy_and_build (TREE_OPERAND (t
, 1), args
, complain
,
18468 in_decl
, /*function_p=*/false,
18469 /*integral_constant_expression_p=*/false);
18470 RETURN (finish_offsetof (object_ptr
,
18471 RECUR (TREE_OPERAND (t
, 0)),
18472 EXPR_LOCATION (t
)));
18475 case ADDRESSOF_EXPR
:
18476 RETURN (cp_build_addressof (EXPR_LOCATION (t
),
18477 RECUR (TREE_OPERAND (t
, 0)), complain
));
18481 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
18482 complain
, in_decl
);
18484 tree type2
= TRAIT_EXPR_TYPE2 (t
);
18485 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
18486 type2
= RECUR (type2
);
18488 type2
= tsubst (type2
, args
, complain
, in_decl
);
18490 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
18495 tree old_stmt_expr
= cur_stmt_expr
;
18496 tree stmt_expr
= begin_stmt_expr ();
18498 cur_stmt_expr
= stmt_expr
;
18499 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
18500 integral_constant_expression_p
);
18501 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
18502 cur_stmt_expr
= old_stmt_expr
;
18504 /* If the resulting list of expression statement is empty,
18505 fold it further into void_node. */
18506 if (empty_expr_stmt_p (stmt_expr
))
18507 stmt_expr
= void_node
;
18509 RETURN (stmt_expr
);
18514 tree r
= tsubst_lambda_expr (t
, args
, complain
, in_decl
);
18516 RETURN (build_lambda_object (r
));
18520 /* We can get here for a constant initializer of non-dependent type.
18521 FIXME stop folding in cp_parser_initializer_clause. */
18523 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
18528 case TRANSACTION_EXPR
:
18529 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
18530 integral_constant_expression_p
));
18533 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
18535 case VEC_PERM_EXPR
:
18537 tree op0
= RECUR (TREE_OPERAND (t
, 0));
18538 tree op1
= RECUR (TREE_OPERAND (t
, 1));
18539 tree op2
= RECUR (TREE_OPERAND (t
, 2));
18540 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
18544 case REQUIRES_EXPR
:
18545 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
18547 case NON_LVALUE_EXPR
:
18548 case VIEW_CONVERT_EXPR
:
18549 /* We should only see these for location wrapper nodes, or within
18550 instantiate_non_dependent_expr (when args is NULL_TREE). */
18551 gcc_assert (location_wrapper_p (t
) || args
== NULL_TREE
);
18552 if (location_wrapper_p (t
))
18553 RETURN (maybe_wrap_with_location (RECUR (TREE_OPERAND (t
, 0)),
18554 EXPR_LOCATION (t
)));
18558 /* Handle Objective-C++ constructs, if appropriate. */
18561 = objcp_tsubst_copy_and_build (t
, args
, complain
,
18562 in_decl
, /*function_p=*/false);
18566 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
18572 input_location
= loc
;
18576 /* Verify that the instantiated ARGS are valid. For type arguments,
18577 make sure that the type's linkage is ok. For non-type arguments,
18578 make sure they are constants if they are integral or enumerations.
18579 Emit an error under control of COMPLAIN, and return TRUE on error. */
18582 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
18584 if (dependent_template_arg_p (t
))
18586 if (ARGUMENT_PACK_P (t
))
18588 tree vec
= ARGUMENT_PACK_ARGS (t
);
18589 int len
= TREE_VEC_LENGTH (vec
);
18590 bool result
= false;
18593 for (i
= 0; i
< len
; ++i
)
18594 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
18598 else if (TYPE_P (t
))
18600 /* [basic.link]: A name with no linkage (notably, the name
18601 of a class or enumeration declared in a local scope)
18602 shall not be used to declare an entity with linkage.
18603 This implies that names with no linkage cannot be used as
18606 DR 757 relaxes this restriction for C++0x. */
18607 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
18608 : no_linkage_check (t
, /*relaxed_p=*/false));
18612 /* DR 488 makes use of a type with no linkage cause
18613 type deduction to fail. */
18614 if (complain
& tf_error
)
18616 if (TYPE_UNNAMED_P (nt
))
18617 error ("%qT is/uses unnamed type", t
);
18619 error ("template argument for %qD uses local type %qT",
18624 /* In order to avoid all sorts of complications, we do not
18625 allow variably-modified types as template arguments. */
18626 else if (variably_modified_type_p (t
, NULL_TREE
))
18628 if (complain
& tf_error
)
18629 error ("%qT is a variably modified type", t
);
18633 /* Class template and alias template arguments should be OK. */
18634 else if (DECL_TYPE_TEMPLATE_P (t
))
18636 /* A non-type argument of integral or enumerated type must be a
18638 else if (TREE_TYPE (t
)
18639 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
18640 && !REFERENCE_REF_P (t
)
18641 && !TREE_CONSTANT (t
))
18643 if (complain
& tf_error
)
18644 error ("integral expression %qE is not constant", t
);
18651 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
18653 int ix
, len
= DECL_NTPARMS (tmpl
);
18654 bool result
= false;
18656 for (ix
= 0; ix
!= len
; ix
++)
18658 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
18661 if (result
&& (complain
& tf_error
))
18662 error (" trying to instantiate %qD", tmpl
);
18666 /* We're out of SFINAE context now, so generate diagnostics for the access
18667 errors we saw earlier when instantiating D from TMPL and ARGS. */
18670 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
18672 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
18673 tree type
= TREE_TYPE (pattern
);
18674 location_t loc
= input_location
;
18676 push_access_scope (d
);
18677 push_deferring_access_checks (dk_no_deferred
);
18678 input_location
= DECL_SOURCE_LOCATION (pattern
);
18679 tsubst (type
, args
, tf_warning_or_error
, d
);
18680 input_location
= loc
;
18681 pop_deferring_access_checks ();
18682 pop_access_scope (d
);
18685 /* Instantiate the indicated variable, function, or alias template TMPL with
18686 the template arguments in TARG_PTR. */
18689 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
18691 tree targ_ptr
= orig_args
;
18695 bool access_ok
= true;
18697 if (tmpl
== error_mark_node
)
18698 return error_mark_node
;
18700 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
18702 /* If this function is a clone, handle it specially. */
18703 if (DECL_CLONED_FUNCTION_P (tmpl
))
18708 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
18709 DECL_CLONED_FUNCTION. */
18710 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
18711 targ_ptr
, complain
);
18712 if (spec
== error_mark_node
)
18713 return error_mark_node
;
18715 /* Look for the clone. */
18716 FOR_EACH_CLONE (clone
, spec
)
18717 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
18719 /* We should always have found the clone by now. */
18720 gcc_unreachable ();
18724 if (targ_ptr
== error_mark_node
)
18725 return error_mark_node
;
18727 /* Check to see if we already have this specialization. */
18728 gen_tmpl
= most_general_template (tmpl
);
18729 if (TMPL_ARGS_DEPTH (targ_ptr
)
18730 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)))
18731 /* targ_ptr only has the innermost template args, so add the outer ones
18732 from tmpl, which could be either a partial instantiation or gen_tmpl (in
18733 the case of a non-dependent call within a template definition). */
18734 targ_ptr
= (add_outermost_template_args
18735 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (tmpl
)),
18738 /* It would be nice to avoid hashing here and then again in tsubst_decl,
18739 but it doesn't seem to be on the hot path. */
18740 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
18742 gcc_assert (tmpl
== gen_tmpl
18743 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
18745 || fndecl
== NULL_TREE
);
18747 if (spec
!= NULL_TREE
)
18749 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
18751 if (complain
& tf_error
)
18752 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
18753 return error_mark_node
;
18758 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
18760 return error_mark_node
;
18762 /* We are building a FUNCTION_DECL, during which the access of its
18763 parameters and return types have to be checked. However this
18764 FUNCTION_DECL which is the desired context for access checking
18765 is not built yet. We solve this chicken-and-egg problem by
18766 deferring all checks until we have the FUNCTION_DECL. */
18767 push_deferring_access_checks (dk_deferred
);
18769 /* Instantiation of the function happens in the context of the function
18770 template, not the context of the overload resolution we're doing. */
18771 push_to_top_level ();
18772 /* If there are dependent arguments, e.g. because we're doing partial
18773 ordering, make sure processing_template_decl stays set. */
18774 if (uses_template_parms (targ_ptr
))
18775 ++processing_template_decl
;
18776 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
18778 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
18779 complain
, gen_tmpl
, true);
18780 push_nested_class (ctx
);
18783 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
18785 fndecl
= NULL_TREE
;
18786 if (VAR_P (pattern
))
18788 /* We need to determine if we're using a partial or explicit
18789 specialization now, because the type of the variable could be
18791 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
18792 tree elt
= most_specialized_partial_spec (tid
, complain
);
18793 if (elt
== error_mark_node
)
18794 pattern
= error_mark_node
;
18797 tree partial_tmpl
= TREE_VALUE (elt
);
18798 tree partial_args
= TREE_PURPOSE (elt
);
18799 tree partial_pat
= DECL_TEMPLATE_RESULT (partial_tmpl
);
18800 fndecl
= tsubst (partial_pat
, partial_args
, complain
, gen_tmpl
);
18804 /* Substitute template parameters to obtain the specialization. */
18805 if (fndecl
== NULL_TREE
)
18806 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
18807 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
18808 pop_nested_class ();
18809 pop_from_top_level ();
18811 if (fndecl
== error_mark_node
)
18813 pop_deferring_access_checks ();
18814 return error_mark_node
;
18817 /* The DECL_TI_TEMPLATE should always be the immediate parent
18818 template, not the most general template. */
18819 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
18820 DECL_TI_ARGS (fndecl
) = targ_ptr
;
18822 /* Now we know the specialization, compute access previously
18823 deferred. Do no access control for inheriting constructors,
18824 as we already checked access for the inherited constructor. */
18825 if (!(flag_new_inheriting_ctors
18826 && DECL_INHERITED_CTOR (fndecl
)))
18828 push_access_scope (fndecl
);
18829 if (!perform_deferred_access_checks (complain
))
18831 pop_access_scope (fndecl
);
18833 pop_deferring_access_checks ();
18835 /* If we've just instantiated the main entry point for a function,
18836 instantiate all the alternate entry points as well. We do this
18837 by cloning the instantiation of the main entry point, not by
18838 instantiating the template clones. */
18839 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
18840 clone_function_decl (fndecl
, /*update_methods=*/false);
18844 if (!(complain
& tf_error
))
18846 /* Remember to reinstantiate when we're out of SFINAE so the user
18847 can see the errors. */
18848 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
18850 return error_mark_node
;
18855 /* Wrapper for instantiate_template_1. */
18858 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
18861 timevar_push (TV_TEMPLATE_INST
);
18862 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
18863 timevar_pop (TV_TEMPLATE_INST
);
18867 /* Instantiate the alias template TMPL with ARGS. Also push a template
18868 instantiation level, which instantiate_template doesn't do because
18869 functions and variables have sufficient context established by the
18873 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
18875 struct pending_template
*old_last_pend
= last_pending_template
;
18876 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
18877 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
18878 return error_mark_node
;
18879 tree tinst
= build_tree_list (tmpl
, args
);
18880 if (!push_tinst_level (tinst
))
18883 return error_mark_node
;
18887 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
18888 args
, tmpl
, complain
,
18889 /*require_all_args=*/true,
18890 /*use_default_args=*/true);
18892 tree r
= instantiate_template (tmpl
, args
, complain
);
18893 pop_tinst_level ();
18894 /* We can't free this if a pending_template entry or last_error_tinst_level
18895 is pointing at it. */
18896 if (last_pending_template
== old_last_pend
18897 && last_error_tinst_level
== old_error_tinst
)
18903 /* PARM is a template parameter pack for FN. Returns true iff
18904 PARM is used in a deducible way in the argument list of FN. */
18907 pack_deducible_p (tree parm
, tree fn
)
18909 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
18910 for (; t
; t
= TREE_CHAIN (t
))
18912 tree type
= TREE_VALUE (t
);
18914 if (!PACK_EXPANSION_P (type
))
18916 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
18917 packs
; packs
= TREE_CHAIN (packs
))
18918 if (template_args_equal (TREE_VALUE (packs
), parm
))
18920 /* The template parameter pack is used in a function parameter
18921 pack. If this is the end of the parameter list, the
18922 template parameter pack is deducible. */
18923 if (TREE_CHAIN (t
) == void_list_node
)
18926 /* Otherwise, not. Well, it could be deduced from
18927 a non-pack parameter, but doing so would end up with
18928 a deduction mismatch, so don't bother. */
18932 /* The template parameter pack isn't used in any function parameter
18933 packs, but it might be used deeper, e.g. tuple<Args...>. */
18937 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
18938 NARGS elements of the arguments that are being used when calling
18939 it. TARGS is a vector into which the deduced template arguments
18942 Returns either a FUNCTION_DECL for the matching specialization of FN or
18943 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
18944 true, diagnostics will be printed to explain why it failed.
18946 If FN is a conversion operator, or we are trying to produce a specific
18947 specialization, RETURN_TYPE is the return type desired.
18949 The EXPLICIT_TARGS are explicit template arguments provided via a
18952 The parameter STRICT is one of:
18955 We are deducing arguments for a function call, as in
18956 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
18957 deducing arguments for a call to the result of a conversion
18958 function template, as in [over.call.object].
18961 We are deducing arguments for a conversion function, as in
18962 [temp.deduct.conv].
18965 We are deducing arguments when doing an explicit instantiation
18966 as in [temp.explicit], when determining an explicit specialization
18967 as in [temp.expl.spec], or when taking the address of a function
18968 template, as in [temp.deduct.funcaddr]. */
18971 fn_type_unification (tree fn
,
18972 tree explicit_targs
,
18975 unsigned int nargs
,
18977 unification_kind_t strict
,
18984 tree decl
= NULL_TREE
;
18985 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
18987 static int deduction_depth
;
18988 struct pending_template
*old_last_pend
= last_pending_template
;
18989 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
18992 if (flag_new_inheriting_ctors
)
18993 fn
= strip_inheriting_ctors (fn
);
18995 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
18997 tree r
= error_mark_node
;
18999 tree full_targs
= targs
;
19000 if (TMPL_ARGS_DEPTH (targs
)
19001 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (fn
)))
19002 full_targs
= (add_outermost_template_args
19003 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (fn
)),
19007 complain
|= tf_decltype
;
19009 /* In C++0x, it's possible to have a function template whose type depends
19010 on itself recursively. This is most obvious with decltype, but can also
19011 occur with enumeration scope (c++/48969). So we need to catch infinite
19012 recursion and reject the substitution at deduction time; this function
19013 will return error_mark_node for any repeated substitution.
19015 This also catches excessive recursion such as when f<N> depends on
19016 f<N-1> across all integers, and returns error_mark_node for all the
19017 substitutions back up to the initial one.
19019 This is, of course, not reentrant. */
19020 if (excessive_deduction_depth
)
19021 return error_mark_node
;
19022 tinst
= build_tree_list (fn
, NULL_TREE
);
19025 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
19027 fntype
= TREE_TYPE (fn
);
19028 if (explicit_targs
)
19032 The specified template arguments must match the template
19033 parameters in kind (i.e., type, nontype, template), and there
19034 must not be more arguments than there are parameters;
19035 otherwise type deduction fails.
19037 Nontype arguments must match the types of the corresponding
19038 nontype template parameters, or must be convertible to the
19039 types of the corresponding nontype parameters as specified in
19040 _temp.arg.nontype_, otherwise type deduction fails.
19042 All references in the function type of the function template
19043 to the corresponding template parameters are replaced by the
19044 specified template argument values. If a substitution in a
19045 template parameter or in the function type of the function
19046 template results in an invalid type, type deduction fails. */
19047 int i
, len
= TREE_VEC_LENGTH (tparms
);
19048 location_t loc
= input_location
;
19049 bool incomplete
= false;
19051 if (explicit_targs
== error_mark_node
)
19054 if (TMPL_ARGS_DEPTH (explicit_targs
)
19055 < TMPL_ARGS_DEPTH (full_targs
))
19056 explicit_targs
= add_outermost_template_args (full_targs
,
19059 /* Adjust any explicit template arguments before entering the
19060 substitution context. */
19062 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
19064 /*require_all_args=*/false,
19065 /*use_default_args=*/false));
19066 if (explicit_targs
== error_mark_node
)
19069 /* Substitute the explicit args into the function type. This is
19070 necessary so that, for instance, explicitly declared function
19071 arguments can match null pointed constants. If we were given
19072 an incomplete set of explicit args, we must not do semantic
19073 processing during substitution as we could create partial
19075 for (i
= 0; i
< len
; i
++)
19077 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
19078 bool parameter_pack
= false;
19079 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
19081 /* Dig out the actual parm. */
19082 if (TREE_CODE (parm
) == TYPE_DECL
19083 || TREE_CODE (parm
) == TEMPLATE_DECL
)
19085 parm
= TREE_TYPE (parm
);
19086 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
19088 else if (TREE_CODE (parm
) == PARM_DECL
)
19090 parm
= DECL_INITIAL (parm
);
19091 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
19094 if (!parameter_pack
&& targ
== NULL_TREE
)
19095 /* No explicit argument for this template parameter. */
19098 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
19100 /* Mark the argument pack as "incomplete". We could
19101 still deduce more arguments during unification.
19102 We remove this mark in type_unification_real. */
19105 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
19106 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
19107 = ARGUMENT_PACK_ARGS (targ
);
19110 /* We have some incomplete argument packs. */
19115 TREE_VALUE (tinst
) = explicit_targs
;
19116 if (!push_tinst_level (tinst
))
19118 excessive_deduction_depth
= true;
19121 processing_template_decl
+= incomplete
;
19122 input_location
= DECL_SOURCE_LOCATION (fn
);
19123 /* Ignore any access checks; we'll see them again in
19124 instantiate_template and they might have the wrong
19125 access path at this point. */
19126 push_deferring_access_checks (dk_deferred
);
19127 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
19128 complain
| tf_partial
| tf_fndecl_type
, NULL_TREE
);
19129 pop_deferring_access_checks ();
19130 input_location
= loc
;
19131 processing_template_decl
-= incomplete
;
19132 pop_tinst_level ();
19134 if (fntype
== error_mark_node
)
19137 /* Place the explicitly specified arguments in TARGS. */
19138 explicit_targs
= INNERMOST_TEMPLATE_ARGS (explicit_targs
);
19139 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
19140 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
19143 /* Never do unification on the 'this' parameter. */
19144 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
19146 if (return_type
&& strict
== DEDUCE_CALL
)
19148 /* We're deducing for a call to the result of a template conversion
19149 function. The parms we really want are in return_type. */
19150 if (POINTER_TYPE_P (return_type
))
19151 return_type
= TREE_TYPE (return_type
);
19152 parms
= TYPE_ARG_TYPES (return_type
);
19154 else if (return_type
)
19158 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
19159 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
19160 new_args
[0] = return_type
;
19161 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
19166 /* We allow incomplete unification without an error message here
19167 because the standard doesn't seem to explicitly prohibit it. Our
19168 callers must be ready to deal with unification failures in any
19171 TREE_VALUE (tinst
) = targs
;
19172 /* If we aren't explaining yet, push tinst context so we can see where
19173 any errors (e.g. from class instantiations triggered by instantiation
19174 of default template arguments) come from. If we are explaining, this
19175 context is redundant. */
19176 if (!explain_p
&& !push_tinst_level (tinst
))
19178 excessive_deduction_depth
= true;
19182 /* type_unification_real will pass back any access checks from default
19183 template argument substitution. */
19184 vec
<deferred_access_check
, va_gc
> *checks
;
19187 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
19188 full_targs
, parms
, args
, nargs
, /*subr=*/0,
19189 strict
, flags
, &checks
, explain_p
);
19191 pop_tinst_level ();
19195 /* Now that we have bindings for all of the template arguments,
19196 ensure that the arguments deduced for the template template
19197 parameters have compatible template parameter lists. We cannot
19198 check this property before we have deduced all template
19199 arguments, because the template parameter types of a template
19200 template parameter might depend on prior template parameters
19201 deduced after the template template parameter. The following
19202 ill-formed example illustrates this issue:
19204 template<typename T, template<T> class C> void f(C<5>, T);
19206 template<int N> struct X {};
19209 f(X<5>(), 5l); // error: template argument deduction fails
19212 The template parameter list of 'C' depends on the template type
19213 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
19214 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
19215 time that we deduce 'C'. */
19216 if (!template_template_parm_bindings_ok_p
19217 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
19219 unify_inconsistent_template_template_parameters (explain_p
);
19223 /* All is well so far. Now, check:
19227 When all template arguments have been deduced, all uses of
19228 template parameters in nondeduced contexts are replaced with
19229 the corresponding deduced argument values. If the
19230 substitution results in an invalid type, as described above,
19231 type deduction fails. */
19232 TREE_VALUE (tinst
) = targs
;
19233 if (!push_tinst_level (tinst
))
19235 excessive_deduction_depth
= true;
19239 /* Also collect access checks from the instantiation. */
19240 reopen_deferring_access_checks (checks
);
19242 decl
= instantiate_template (fn
, targs
, complain
);
19244 checks
= get_deferred_access_checks ();
19245 pop_deferring_access_checks ();
19247 pop_tinst_level ();
19249 if (decl
== error_mark_node
)
19252 /* Now perform any access checks encountered during substitution. */
19253 push_access_scope (decl
);
19254 ok
= perform_access_checks (checks
, complain
);
19255 pop_access_scope (decl
);
19259 /* If we're looking for an exact match, check that what we got
19260 is indeed an exact match. It might not be if some template
19261 parameters are used in non-deduced contexts. But don't check
19262 for an exact match if we have dependent template arguments;
19263 in that case we're doing partial ordering, and we already know
19264 that we have two candidates that will provide the actual type. */
19265 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
19267 tree substed
= TREE_TYPE (decl
);
19271 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
19273 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
19274 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
19275 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
19277 unify_type_mismatch (explain_p
, args
[i
],
19278 TREE_VALUE (sarg
));
19283 /* After doing deduction with the inherited constructor, actually return an
19284 instantiation of the inheriting constructor. */
19286 decl
= instantiate_template (orig_fn
, targs
, complain
);
19292 if (excessive_deduction_depth
)
19294 if (deduction_depth
== 0)
19295 /* Reset once we're all the way out. */
19296 excessive_deduction_depth
= false;
19299 /* We can't free this if a pending_template entry or last_error_tinst_level
19300 is pointing at it. */
19301 if (last_pending_template
== old_last_pend
19302 && last_error_tinst_level
== old_error_tinst
)
19308 /* Adjust types before performing type deduction, as described in
19309 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
19310 sections are symmetric. PARM is the type of a function parameter
19311 or the return type of the conversion function. ARG is the type of
19312 the argument passed to the call, or the type of the value
19313 initialized with the result of the conversion function.
19314 ARG_EXPR is the original argument expression, which may be null. */
19317 maybe_adjust_types_for_deduction (unification_kind_t strict
,
19330 /* Swap PARM and ARG throughout the remainder of this
19331 function; the handling is precisely symmetric since PARM
19332 will initialize ARG rather than vice versa. */
19333 std::swap (parm
, arg
);
19337 /* Core issue #873: Do the DR606 thing (see below) for these cases,
19338 too, but here handle it by stripping the reference from PARM
19339 rather than by adding it to ARG. */
19340 if (TREE_CODE (*parm
) == REFERENCE_TYPE
19341 && TYPE_REF_IS_RVALUE (*parm
)
19342 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
19343 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
19344 && TREE_CODE (*arg
) == REFERENCE_TYPE
19345 && !TYPE_REF_IS_RVALUE (*arg
))
19346 *parm
= TREE_TYPE (*parm
);
19347 /* Nothing else to do in this case. */
19351 gcc_unreachable ();
19354 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
19356 /* [temp.deduct.call]
19358 If P is not a reference type:
19360 --If A is an array type, the pointer type produced by the
19361 array-to-pointer standard conversion (_conv.array_) is
19362 used in place of A for type deduction; otherwise,
19364 --If A is a function type, the pointer type produced by
19365 the function-to-pointer standard conversion
19366 (_conv.func_) is used in place of A for type deduction;
19369 --If A is a cv-qualified type, the top level
19370 cv-qualifiers of A's type are ignored for type
19372 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
19373 *arg
= build_pointer_type (TREE_TYPE (*arg
));
19374 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
19375 *arg
= build_pointer_type (*arg
);
19377 *arg
= TYPE_MAIN_VARIANT (*arg
);
19380 /* [14.8.2.1/3 temp.deduct.call], "A forwarding reference is an rvalue
19381 reference to a cv-unqualified template parameter that does not represent a
19382 template parameter of a class template (during class template argument
19383 deduction (13.3.1.8)). If P is a forwarding reference and the argument is
19384 an lvalue, the type "lvalue reference to A" is used in place of A for type
19386 if (TREE_CODE (*parm
) == REFERENCE_TYPE
19387 && TYPE_REF_IS_RVALUE (*parm
)
19388 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
19389 && !TEMPLATE_TYPE_PARM_FOR_CLASS (TREE_TYPE (*parm
))
19390 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
19391 && (arg_expr
? lvalue_p (arg_expr
)
19392 /* try_one_overload doesn't provide an arg_expr, but
19393 functions are always lvalues. */
19394 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
19395 *arg
= build_reference_type (*arg
);
19397 /* [temp.deduct.call]
19399 If P is a cv-qualified type, the top level cv-qualifiers
19400 of P's type are ignored for type deduction. If P is a
19401 reference type, the type referred to by P is used for
19403 *parm
= TYPE_MAIN_VARIANT (*parm
);
19404 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
19406 *parm
= TREE_TYPE (*parm
);
19407 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19410 /* DR 322. For conversion deduction, remove a reference type on parm
19411 too (which has been swapped into ARG). */
19412 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
19413 *arg
= TREE_TYPE (*arg
);
19418 /* Subroutine of unify_one_argument. PARM is a function parameter of a
19419 template which does contain any deducible template parameters; check if
19420 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
19421 unify_one_argument. */
19424 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
19425 int flags
, bool explain_p
)
19430 type
= TREE_TYPE (arg
);
19434 if (same_type_p (parm
, type
))
19435 return unify_success (explain_p
);
19437 if (strict
== DEDUCE_CONV
)
19439 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
19440 explain_p
? tf_warning_or_error
: tf_none
))
19441 return unify_success (explain_p
);
19443 else if (strict
!= DEDUCE_EXACT
)
19445 if (can_convert_arg (parm
, type
,
19446 TYPE_P (arg
) ? NULL_TREE
: arg
,
19447 flags
, explain_p
? tf_warning_or_error
: tf_none
))
19448 return unify_success (explain_p
);
19451 if (strict
== DEDUCE_EXACT
)
19452 return unify_type_mismatch (explain_p
, parm
, arg
);
19454 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
19457 static bool uses_deducible_template_parms (tree type
);
19459 /* Returns true iff the expression EXPR is one from which a template
19460 argument can be deduced. In other words, if it's an undecorated
19461 use of a template non-type parameter. */
19464 deducible_expression (tree expr
)
19466 /* Strip implicit conversions. */
19467 while (CONVERT_EXPR_P (expr
))
19468 expr
= TREE_OPERAND (expr
, 0);
19469 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
19472 /* Returns true iff the array domain DOMAIN uses a template parameter in a
19473 deducible way; that is, if it has a max value of <PARM> - 1. */
19476 deducible_array_bound (tree domain
)
19478 if (domain
== NULL_TREE
)
19481 tree max
= TYPE_MAX_VALUE (domain
);
19482 if (TREE_CODE (max
) != MINUS_EXPR
)
19485 return deducible_expression (TREE_OPERAND (max
, 0));
19488 /* Returns true iff the template arguments ARGS use a template parameter
19489 in a deducible way. */
19492 deducible_template_args (tree args
)
19494 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
19497 tree elt
= TREE_VEC_ELT (args
, i
);
19498 if (ARGUMENT_PACK_P (elt
))
19499 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
19502 if (PACK_EXPANSION_P (elt
))
19503 elt
= PACK_EXPANSION_PATTERN (elt
);
19504 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
19506 else if (TYPE_P (elt
))
19507 deducible
= uses_deducible_template_parms (elt
);
19509 deducible
= deducible_expression (elt
);
19517 /* Returns true iff TYPE contains any deducible references to template
19518 parameters, as per 14.8.2.5. */
19521 uses_deducible_template_parms (tree type
)
19523 if (PACK_EXPANSION_P (type
))
19524 type
= PACK_EXPANSION_PATTERN (type
);
19531 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
19532 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19538 if (POINTER_TYPE_P (type
))
19539 return uses_deducible_template_parms (TREE_TYPE (type
));
19541 /* T[integer-constant ]
19543 if (TREE_CODE (type
) == ARRAY_TYPE
)
19544 return (uses_deducible_template_parms (TREE_TYPE (type
))
19545 || deducible_array_bound (TYPE_DOMAIN (type
)));
19557 if (TYPE_PTRMEM_P (type
))
19558 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
19559 || (uses_deducible_template_parms
19560 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
19562 /* template-name <T> (where template-name refers to a class template)
19563 template-name <i> (where template-name refers to a class template) */
19564 if (CLASS_TYPE_P (type
)
19565 && CLASSTYPE_TEMPLATE_INFO (type
)
19566 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
19567 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
19568 (CLASSTYPE_TI_ARGS (type
)));
19573 if (TREE_CODE (type
) == FUNCTION_TYPE
19574 || TREE_CODE (type
) == METHOD_TYPE
)
19576 if (uses_deducible_template_parms (TREE_TYPE (type
)))
19578 tree parm
= TYPE_ARG_TYPES (type
);
19579 if (TREE_CODE (type
) == METHOD_TYPE
)
19580 parm
= TREE_CHAIN (parm
);
19581 for (; parm
; parm
= TREE_CHAIN (parm
))
19582 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
19589 /* Subroutine of type_unification_real and unify_pack_expansion to
19590 handle unification of a single P/A pair. Parameters are as
19591 for those functions. */
19594 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
19595 int subr
, unification_kind_t strict
,
19598 tree arg_expr
= NULL_TREE
;
19601 if (arg
== error_mark_node
|| parm
== error_mark_node
)
19602 return unify_invalid (explain_p
);
19603 if (arg
== unknown_type_node
)
19604 /* We can't deduce anything from this, but we might get all the
19605 template args from other function args. */
19606 return unify_success (explain_p
);
19608 /* Implicit conversions (Clause 4) will be performed on a function
19609 argument to convert it to the type of the corresponding function
19610 parameter if the parameter type contains no template-parameters that
19611 participate in template argument deduction. */
19612 if (strict
!= DEDUCE_EXACT
19613 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
19614 /* For function parameters with no deducible template parameters,
19615 just return. We'll check non-dependent conversions later. */
19616 return unify_success (explain_p
);
19621 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
19622 | UNIFY_ALLOW_MORE_CV_QUAL
19623 | UNIFY_ALLOW_DERIVED
);
19627 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
19631 arg_strict
= UNIFY_ALLOW_NONE
;
19635 gcc_unreachable ();
19638 /* We only do these transformations if this is the top-level
19639 parameter_type_list in a call or declaration matching; in other
19640 situations (nested function declarators, template argument lists) we
19641 won't be comparing a type to an expression, and we don't do any type
19647 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
19648 if (type_unknown_p (arg
))
19650 /* [temp.deduct.type] A template-argument can be
19651 deduced from a pointer to function or pointer
19652 to member function argument if the set of
19653 overloaded functions does not contain function
19654 templates and at most one of a set of
19655 overloaded functions provides a unique
19657 resolve_overloaded_unification (tparms
, targs
, parm
,
19659 arg_strict
, explain_p
);
19660 /* If a unique match was not found, this is a
19661 non-deduced context, so we still succeed. */
19662 return unify_success (explain_p
);
19666 arg
= unlowered_expr_type (arg
);
19667 if (arg
== error_mark_node
)
19668 return unify_invalid (explain_p
);
19672 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
19675 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
19676 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
19677 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19679 /* For deduction from an init-list we need the actual list. */
19680 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
19682 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
19685 /* for_each_template_parm callback that always returns 0. */
19688 zero_r (tree
, void *)
19693 /* for_each_template_parm any_fn callback to handle deduction of a template
19694 type argument from the type of an array bound. */
19697 array_deduction_r (tree t
, void *data
)
19699 tree_pair_p d
= (tree_pair_p
)data
;
19700 tree
&tparms
= d
->purpose
;
19701 tree
&targs
= d
->value
;
19703 if (TREE_CODE (t
) == ARRAY_TYPE
)
19704 if (tree dom
= TYPE_DOMAIN (t
))
19705 if (tree max
= TYPE_MAX_VALUE (dom
))
19707 if (TREE_CODE (max
) == MINUS_EXPR
)
19708 max
= TREE_OPERAND (max
, 0);
19709 if (TREE_CODE (max
) == TEMPLATE_PARM_INDEX
)
19710 unify (tparms
, targs
, TREE_TYPE (max
), size_type_node
,
19711 UNIFY_ALLOW_NONE
, /*explain*/false);
19714 /* Keep walking. */
19718 /* Try to deduce any not-yet-deduced template type arguments from the type of
19719 an array bound. This is handled separately from unify because 14.8.2.5 says
19720 "The type of a type parameter is only deduced from an array bound if it is
19721 not otherwise deduced." */
19724 try_array_deduction (tree tparms
, tree targs
, tree parm
)
19726 tree_pair_s data
= { tparms
, targs
};
19727 hash_set
<tree
> visited
;
19728 for_each_template_parm (parm
, zero_r
, &data
, &visited
,
19729 /*nondeduced*/false, array_deduction_r
);
19732 /* Most parms like fn_type_unification.
19734 If SUBR is 1, we're being called recursively (to unify the
19735 arguments of a function or method parameter of a function
19738 CHECKS is a pointer to a vector of access checks encountered while
19739 substituting default template arguments. */
19742 type_unification_real (tree tparms
,
19746 unsigned int xnargs
,
19748 unification_kind_t strict
,
19750 vec
<deferred_access_check
, va_gc
> **checks
,
19755 int ntparms
= TREE_VEC_LENGTH (tparms
);
19756 int saw_undeduced
= 0;
19759 unsigned int nargs
;
19762 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
19763 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
19764 gcc_assert (ntparms
> 0);
19766 tree targs
= INNERMOST_TEMPLATE_ARGS (full_targs
);
19768 /* Reset the number of non-defaulted template arguments contained
19770 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
19778 while (parms
&& parms
!= void_list_node
19781 parm
= TREE_VALUE (parms
);
19783 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
19784 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
19785 /* For a function parameter pack that occurs at the end of the
19786 parameter-declaration-list, the type A of each remaining
19787 argument of the call is compared with the type P of the
19788 declarator-id of the function parameter pack. */
19791 parms
= TREE_CHAIN (parms
);
19793 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
19794 /* For a function parameter pack that does not occur at the
19795 end of the parameter-declaration-list, the type of the
19796 parameter pack is a non-deduced context. */
19802 if (unify_one_argument (tparms
, full_targs
, parm
, arg
, subr
, strict
,
19808 && parms
!= void_list_node
19809 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
19811 /* Unify the remaining arguments with the pack expansion type. */
19813 tree parmvec
= make_tree_vec (1);
19815 /* Allocate a TREE_VEC and copy in all of the arguments */
19816 argvec
= make_tree_vec (nargs
- ia
);
19817 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
19818 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
19820 /* Copy the parameter into parmvec. */
19821 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
19822 if (unify_pack_expansion (tparms
, full_targs
, parmvec
, argvec
, strict
,
19823 /*subr=*/subr
, explain_p
))
19826 /* Advance to the end of the list of parameters. */
19827 parms
= TREE_CHAIN (parms
);
19830 /* Fail if we've reached the end of the parm list, and more args
19831 are present, and the parm list isn't variadic. */
19832 if (ia
< nargs
&& parms
== void_list_node
)
19833 return unify_too_many_arguments (explain_p
, nargs
, ia
);
19834 /* Fail if parms are left and they don't have default values and
19835 they aren't all deduced as empty packs (c++/57397). This is
19836 consistent with sufficient_parms_p. */
19837 if (parms
&& parms
!= void_list_node
19838 && TREE_PURPOSE (parms
) == NULL_TREE
)
19840 unsigned int count
= nargs
;
19845 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
19848 p
= TREE_CHAIN (p
);
19850 while (p
&& p
!= void_list_node
);
19851 if (count
!= nargs
)
19852 return unify_too_few_arguments (explain_p
, ia
, count
,
19858 tsubst_flags_t complain
= (explain_p
19859 ? tf_warning_or_error
19861 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
19863 for (i
= 0; i
< ntparms
; i
++)
19865 tree targ
= TREE_VEC_ELT (targs
, i
);
19866 tree tparm
= TREE_VEC_ELT (tparms
, i
);
19868 /* Clear the "incomplete" flags on all argument packs now so that
19869 substituting them into later default arguments works. */
19870 if (targ
&& ARGUMENT_PACK_P (targ
))
19872 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
19873 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
19876 if (targ
|| tparm
== error_mark_node
)
19878 tparm
= TREE_VALUE (tparm
);
19880 if (TREE_CODE (tparm
) == TYPE_DECL
19881 && !tried_array_deduction
)
19883 try_array_deduction (tparms
, targs
, xparms
);
19884 tried_array_deduction
= true;
19885 if (TREE_VEC_ELT (targs
, i
))
19889 /* If this is an undeduced nontype parameter that depends on
19890 a type parameter, try another pass; its type may have been
19891 deduced from a later argument than the one from which
19892 this parameter can be deduced. */
19893 if (TREE_CODE (tparm
) == PARM_DECL
19894 && uses_template_parms (TREE_TYPE (tparm
))
19895 && saw_undeduced
< 2)
19901 /* Core issue #226 (C++0x) [temp.deduct]:
19903 If a template argument has not been deduced, its
19904 default template argument, if any, is used.
19906 When we are in C++98 mode, TREE_PURPOSE will either
19907 be NULL_TREE or ERROR_MARK_NODE, so we do not need
19908 to explicitly check cxx_dialect here. */
19909 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
19910 /* OK, there is a default argument. Wait until after the
19911 conversion check to do substitution. */
19914 /* If the type parameter is a parameter pack, then it will
19915 be deduced to an empty parameter pack. */
19916 if (template_parameter_pack_p (tparm
))
19920 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
19922 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
19923 TREE_CONSTANT (arg
) = 1;
19926 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
19928 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
19930 TREE_VEC_ELT (targs
, i
) = arg
;
19934 return unify_parameter_deduction_failure (explain_p
, tparm
);
19937 /* DR 1391: All parameters have args, now check non-dependent parms for
19939 if (saw_undeduced
< 2)
19940 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
19941 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
19943 parm
= TREE_VALUE (parms
);
19945 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
19946 && (!TREE_CHAIN (parms
)
19947 || TREE_CHAIN (parms
) == void_list_node
))
19948 /* For a function parameter pack that occurs at the end of the
19949 parameter-declaration-list, the type A of each remaining
19950 argument of the call is compared with the type P of the
19951 declarator-id of the function parameter pack. */
19954 parms
= TREE_CHAIN (parms
);
19956 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
19957 /* For a function parameter pack that does not occur at the
19958 end of the parameter-declaration-list, the type of the
19959 parameter pack is a non-deduced context. */
19965 if (uses_template_parms (parm
))
19967 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
19972 /* Now substitute into the default template arguments. */
19973 for (i
= 0; i
< ntparms
; i
++)
19975 tree targ
= TREE_VEC_ELT (targs
, i
);
19976 tree tparm
= TREE_VEC_ELT (tparms
, i
);
19978 if (targ
|| tparm
== error_mark_node
)
19980 tree parm
= TREE_VALUE (tparm
);
19982 tsubst_flags_t fcomplain
= complain
;
19983 if (saw_undeduced
== 1)
19985 /* When saw_undeduced == 1, substitution into parm and arg might
19986 fail or not replace all template parameters, and that's
19988 fcomplain
= tf_none
;
19989 if (TREE_CODE (parm
) == PARM_DECL
19990 && uses_template_parms (TREE_TYPE (parm
)))
19994 tree arg
= TREE_PURPOSE (tparm
);
19995 reopen_deferring_access_checks (*checks
);
19996 location_t save_loc
= input_location
;
19998 input_location
= DECL_SOURCE_LOCATION (parm
);
20000 if (saw_undeduced
== 1)
20001 ++processing_template_decl
;
20002 arg
= tsubst_template_arg (arg
, full_targs
, fcomplain
, NULL_TREE
);
20003 if (saw_undeduced
== 1)
20004 --processing_template_decl
;
20006 if (arg
!= error_mark_node
&& !uses_template_parms (arg
))
20007 arg
= convert_template_argument (parm
, arg
, full_targs
, complain
,
20009 else if (saw_undeduced
== 1)
20012 arg
= error_mark_node
;
20013 input_location
= save_loc
;
20014 *checks
= get_deferred_access_checks ();
20015 pop_deferring_access_checks ();
20016 if (arg
== error_mark_node
)
20020 TREE_VEC_ELT (targs
, i
) = arg
;
20021 /* The position of the first default template argument,
20022 is also the number of non-defaulted arguments in TARGS.
20024 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20025 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
20029 if (saw_undeduced
++ == 1)
20033 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
20034 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
20036 return unify_success (explain_p
);
20039 /* Subroutine of type_unification_real. Args are like the variables
20040 at the call site. ARG is an overloaded function (or template-id);
20041 we try deducing template args from each of the overloads, and if
20042 only one succeeds, we go with that. Modifies TARGS and returns
20043 true on success. */
20046 resolve_overloaded_unification (tree tparms
,
20050 unification_kind_t strict
,
20054 tree tempargs
= copy_node (targs
);
20056 tree goodfn
= NULL_TREE
;
20059 if (TREE_CODE (arg
) == ADDR_EXPR
)
20061 arg
= TREE_OPERAND (arg
, 0);
20067 if (TREE_CODE (arg
) == COMPONENT_REF
)
20068 /* Handle `&x' where `x' is some static or non-static member
20070 arg
= TREE_OPERAND (arg
, 1);
20072 if (TREE_CODE (arg
) == OFFSET_REF
)
20073 arg
= TREE_OPERAND (arg
, 1);
20075 /* Strip baselink information. */
20076 if (BASELINK_P (arg
))
20077 arg
= BASELINK_FUNCTIONS (arg
);
20079 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
20081 /* If we got some explicit template args, we need to plug them into
20082 the affected templates before we try to unify, in case the
20083 explicit args will completely resolve the templates in question. */
20086 tree expl_subargs
= TREE_OPERAND (arg
, 1);
20087 arg
= TREE_OPERAND (arg
, 0);
20089 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20092 tree subargs
, elem
;
20094 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
20097 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20098 expl_subargs
, NULL_TREE
, tf_none
,
20099 /*require_all_args=*/true,
20100 /*use_default_args=*/true);
20101 if (subargs
!= error_mark_node
20102 && !any_dependent_template_arguments_p (subargs
))
20104 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
20105 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
20106 elem
, strict
, sub_strict
, addr_p
, explain_p
)
20107 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
20116 /* If no templates (or more than one) are fully resolved by the
20117 explicit arguments, this template-id is a non-deduced context; it
20118 could still be OK if we deduce all template arguments for the
20119 enclosing call through other arguments. */
20123 else if (TREE_CODE (arg
) != OVERLOAD
20124 && TREE_CODE (arg
) != FUNCTION_DECL
)
20125 /* If ARG is, for example, "(0, &f)" then its type will be unknown
20126 -- but the deduction does not succeed because the expression is
20127 not just the function on its own. */
20130 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20133 if (try_one_overload (tparms
, targs
, tempargs
, parm
, TREE_TYPE (fn
),
20134 strict
, sub_strict
, addr_p
, explain_p
)
20135 && (!goodfn
|| !decls_match (goodfn
, fn
)))
20142 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20143 to function or pointer to member function argument if the set of
20144 overloaded functions does not contain function templates and at most
20145 one of a set of overloaded functions provides a unique match.
20147 So if we found multiple possibilities, we return success but don't
20148 deduce anything. */
20152 int i
= TREE_VEC_LENGTH (targs
);
20154 if (TREE_VEC_ELT (tempargs
, i
))
20156 tree old
= TREE_VEC_ELT (targs
, i
);
20157 tree new_
= TREE_VEC_ELT (tempargs
, i
);
20158 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
20159 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
20160 /* Don't forget explicit template arguments in a pack. */
20161 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
20162 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
20163 TREE_VEC_ELT (targs
, i
) = new_
;
20172 /* Core DR 115: In contexts where deduction is done and fails, or in
20173 contexts where deduction is not done, if a template argument list is
20174 specified and it, along with any default template arguments, identifies
20175 a single function template specialization, then the template-id is an
20176 lvalue for the function template specialization. */
20179 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
20181 tree expr
, offset
, baselink
;
20184 if (!type_unknown_p (orig_expr
))
20189 offset
= NULL_TREE
;
20190 baselink
= NULL_TREE
;
20192 if (TREE_CODE (expr
) == ADDR_EXPR
)
20194 expr
= TREE_OPERAND (expr
, 0);
20197 if (TREE_CODE (expr
) == OFFSET_REF
)
20200 expr
= TREE_OPERAND (expr
, 1);
20202 if (BASELINK_P (expr
))
20205 expr
= BASELINK_FUNCTIONS (expr
);
20208 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
20211 tree goodfn
= NULL_TREE
;
20213 /* If we got some explicit template args, we need to plug them into
20214 the affected templates before we try to unify, in case the
20215 explicit args will completely resolve the templates in question. */
20217 tree expl_subargs
= TREE_OPERAND (expr
, 1);
20218 tree arg
= TREE_OPERAND (expr
, 0);
20219 tree badfn
= NULL_TREE
;
20220 tree badargs
= NULL_TREE
;
20222 for (lkp_iterator
iter (arg
); iter
; ++iter
)
20225 tree subargs
, elem
;
20227 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
20230 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
20231 expl_subargs
, NULL_TREE
, tf_none
,
20232 /*require_all_args=*/true,
20233 /*use_default_args=*/true);
20234 if (subargs
!= error_mark_node
20235 && !any_dependent_template_arguments_p (subargs
))
20237 elem
= instantiate_template (fn
, subargs
, tf_none
);
20238 if (elem
== error_mark_node
)
20243 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
20252 mark_used (goodfn
);
20255 expr
= build_baselink (BASELINK_BINFO (baselink
),
20256 BASELINK_ACCESS_BINFO (baselink
),
20257 expr
, BASELINK_OPTYPE (baselink
));
20261 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
20262 expr
= build_offset_ref (base
, expr
, addr
, complain
);
20265 expr
= cp_build_addr_expr (expr
, complain
);
20268 else if (good
== 0 && badargs
&& (complain
& tf_error
))
20269 /* There were no good options and at least one bad one, so let the
20270 user know what the problem is. */
20271 instantiate_template (badfn
, badargs
, complain
);
20276 /* Subroutine of resolve_overloaded_unification; does deduction for a single
20277 overload. Fills TARGS with any deduced arguments, or error_mark_node if
20278 different overloads deduce different arguments for a given parm.
20279 ADDR_P is true if the expression for which deduction is being
20280 performed was of the form "& fn" rather than simply "fn".
20282 Returns 1 on success. */
20285 try_one_overload (tree tparms
,
20290 unification_kind_t strict
,
20299 if (arg
== error_mark_node
)
20302 /* [temp.deduct.type] A template-argument can be deduced from a pointer
20303 to function or pointer to member function argument if the set of
20304 overloaded functions does not contain function templates and at most
20305 one of a set of overloaded functions provides a unique match.
20307 So if this is a template, just return success. */
20309 if (uses_template_parms (arg
))
20312 if (TREE_CODE (arg
) == METHOD_TYPE
)
20313 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
20315 arg
= build_pointer_type (arg
);
20317 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
20319 /* We don't copy orig_targs for this because if we have already deduced
20320 some template args from previous args, unify would complain when we
20321 try to deduce a template parameter for the same argument, even though
20322 there isn't really a conflict. */
20323 nargs
= TREE_VEC_LENGTH (targs
);
20324 tempargs
= make_tree_vec (nargs
);
20326 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
20329 /* First make sure we didn't deduce anything that conflicts with
20330 explicitly specified args. */
20331 for (i
= nargs
; i
--; )
20333 tree elt
= TREE_VEC_ELT (tempargs
, i
);
20334 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
20338 else if (uses_template_parms (elt
))
20339 /* Since we're unifying against ourselves, we will fill in
20340 template args used in the function parm list with our own
20341 template parms. Discard them. */
20342 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
20343 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
20345 /* Check that the argument at each index of the deduced argument pack
20346 is equivalent to the corresponding explicitly specified argument.
20347 We may have deduced more arguments than were explicitly specified,
20350 /* We used to assert ARGUMENT_PACK_INCOMPLETE_P (oldelt) here, but
20351 that's wrong if we deduce the same argument pack from multiple
20352 function arguments: it's only incomplete the first time. */
20354 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
20355 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
20357 if (TREE_VEC_LENGTH (deduced_pack
)
20358 < TREE_VEC_LENGTH (explicit_pack
))
20361 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
20362 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
20363 TREE_VEC_ELT (deduced_pack
, j
)))
20366 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
20370 for (i
= nargs
; i
--; )
20372 tree elt
= TREE_VEC_ELT (tempargs
, i
);
20375 TREE_VEC_ELT (targs
, i
) = elt
;
20381 /* PARM is a template class (perhaps with unbound template
20382 parameters). ARG is a fully instantiated type. If ARG can be
20383 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
20384 TARGS are as for unify. */
20387 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
20390 tree copy_of_targs
;
20392 if (!CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
20394 else if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20395 /* Matches anything. */;
20396 else if (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
20397 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
)))
20400 /* We need to make a new template argument vector for the call to
20401 unify. If we used TARGS, we'd clutter it up with the result of
20402 the attempted unification, even if this class didn't work out.
20403 We also don't want to commit ourselves to all the unifications
20404 we've already done, since unification is supposed to be done on
20405 an argument-by-argument basis. In other words, consider the
20406 following pathological case:
20408 template <int I, int J, int K>
20411 template <int I, int J>
20412 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
20414 template <int I, int J, int K>
20415 void f(S<I, J, K>, S<I, I, I>);
20424 Now, by the time we consider the unification involving `s2', we
20425 already know that we must have `f<0, 0, 0>'. But, even though
20426 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
20427 because there are two ways to unify base classes of S<0, 1, 2>
20428 with S<I, I, I>. If we kept the already deduced knowledge, we
20429 would reject the possibility I=1. */
20430 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20432 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20434 if (unify_bound_ttp_args (tparms
, copy_of_targs
, parm
, arg
, explain_p
))
20439 /* If unification failed, we're done. */
20440 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
20441 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
20447 /* Given a template type PARM and a class type ARG, find the unique
20448 base type in ARG that is an instance of PARM. We do not examine
20449 ARG itself; only its base-classes. If there is not exactly one
20450 appropriate base class, return NULL_TREE. PARM may be the type of
20451 a partial specialization, as well as a plain template type. Used
20454 static enum template_base_result
20455 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
20456 bool explain_p
, tree
*result
)
20458 tree rval
= NULL_TREE
;
20461 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
20463 binfo
= TYPE_BINFO (complete_type (arg
));
20466 /* The type could not be completed. */
20467 *result
= NULL_TREE
;
20468 return tbr_incomplete_type
;
20471 /* Walk in inheritance graph order. The search order is not
20472 important, and this avoids multiple walks of virtual bases. */
20473 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
20475 tree r
= try_class_unification (tparms
, targs
, parm
,
20476 BINFO_TYPE (binfo
), explain_p
);
20480 /* If there is more than one satisfactory baseclass, then:
20484 If they yield more than one possible deduced A, the type
20488 if (rval
&& !same_type_p (r
, rval
))
20490 *result
= NULL_TREE
;
20491 return tbr_ambiguous_baseclass
;
20499 return tbr_success
;
20502 /* Returns the level of DECL, which declares a template parameter. */
20505 template_decl_level (tree decl
)
20507 switch (TREE_CODE (decl
))
20510 case TEMPLATE_DECL
:
20511 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
20514 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
20517 gcc_unreachable ();
20522 /* Decide whether ARG can be unified with PARM, considering only the
20523 cv-qualifiers of each type, given STRICT as documented for unify.
20524 Returns nonzero iff the unification is OK on that basis. */
20527 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
20529 int arg_quals
= cp_type_quals (arg
);
20530 int parm_quals
= cp_type_quals (parm
);
20532 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
20533 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
20535 /* Although a CVR qualifier is ignored when being applied to a
20536 substituted template parameter ([8.3.2]/1 for example), that
20537 does not allow us to unify "const T" with "int&" because both
20538 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
20539 It is ok when we're allowing additional CV qualifiers
20540 at the outer level [14.8.2.1]/3,1st bullet. */
20541 if ((TREE_CODE (arg
) == REFERENCE_TYPE
20542 || TREE_CODE (arg
) == FUNCTION_TYPE
20543 || TREE_CODE (arg
) == METHOD_TYPE
)
20544 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
20547 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
20548 && (parm_quals
& TYPE_QUAL_RESTRICT
))
20552 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
20553 && (arg_quals
& parm_quals
) != parm_quals
)
20556 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
20557 && (parm_quals
& arg_quals
) != arg_quals
)
20563 /* Determines the LEVEL and INDEX for the template parameter PARM. */
20565 template_parm_level_and_index (tree parm
, int* level
, int* index
)
20567 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
20568 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
20569 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20571 *index
= TEMPLATE_TYPE_IDX (parm
);
20572 *level
= TEMPLATE_TYPE_LEVEL (parm
);
20576 *index
= TEMPLATE_PARM_IDX (parm
);
20577 *level
= TEMPLATE_PARM_LEVEL (parm
);
20581 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
20583 if (unify (TP, TA, P, A, S, EP)) \
20587 /* Unifies the remaining arguments in PACKED_ARGS with the pack
20588 expansion at the end of PACKED_PARMS. Returns 0 if the type
20589 deduction succeeds, 1 otherwise. STRICT is the same as in
20590 fn_type_unification. CALL_ARGS_P is true iff PACKED_ARGS is actually a
20591 function call argument list. We'll need to adjust the arguments to make them
20592 types. SUBR tells us if this is from a recursive call to
20593 type_unification_real, or for comparing two template argument
20597 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
20598 tree packed_args
, unification_kind_t strict
,
20599 bool subr
, bool explain_p
)
20602 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
20603 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
20604 tree pack
, packs
= NULL_TREE
;
20605 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
20607 /* Add in any args remembered from an earlier partial instantiation. */
20608 targs
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (parm
), targs
);
20609 int levels
= TMPL_ARGS_DEPTH (targs
);
20611 packed_args
= expand_template_argument_pack (packed_args
);
20613 int len
= TREE_VEC_LENGTH (packed_args
);
20615 /* Determine the parameter packs we will be deducing from the
20616 pattern, and record their current deductions. */
20617 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
20618 pack
; pack
= TREE_CHAIN (pack
))
20620 tree parm_pack
= TREE_VALUE (pack
);
20623 /* Determine the index and level of this parameter pack. */
20624 template_parm_level_and_index (parm_pack
, &level
, &idx
);
20625 if (level
< levels
)
20628 /* Keep track of the parameter packs and their corresponding
20630 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
20631 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
20634 /* Loop through all of the arguments that have not yet been
20635 unified and unify each with the pattern. */
20636 for (i
= start
; i
< len
; i
++)
20639 bool any_explicit
= false;
20640 tree arg
= TREE_VEC_ELT (packed_args
, i
);
20642 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
20643 or the element of its argument pack at the current index if
20644 this argument was explicitly specified. */
20645 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
20649 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
20652 if (TREE_VALUE (pack
)
20653 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
20654 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
20656 any_explicit
= true;
20657 arg
= TREE_VEC_ELT (pargs
, i
- start
);
20659 TMPL_ARG (targs
, level
, idx
) = arg
;
20662 /* If we had explicit template arguments, substitute them into the
20663 pattern before deduction. */
20666 /* Some arguments might still be unspecified or dependent. */
20668 ++processing_template_decl
;
20669 dependent
= any_dependent_template_arguments_p (targs
);
20671 --processing_template_decl
;
20672 parm
= tsubst (pattern
, targs
,
20673 explain_p
? tf_warning_or_error
: tf_none
,
20676 --processing_template_decl
;
20677 if (parm
== error_mark_node
)
20683 /* Unify the pattern with the current argument. */
20684 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
20688 /* For each parameter pack, collect the deduced value. */
20689 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
20692 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
20694 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
20695 TMPL_ARG (targs
, level
, idx
);
20699 /* Verify that the results of unification with the parameter packs
20700 produce results consistent with what we've seen before, and make
20701 the deduced argument packs available. */
20702 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
20704 tree old_pack
= TREE_VALUE (pack
);
20705 tree new_args
= TREE_TYPE (pack
);
20706 int i
, len
= TREE_VEC_LENGTH (new_args
);
20708 bool nondeduced_p
= false;
20710 /* By default keep the original deduced argument pack.
20711 If necessary, more specific code is going to update the
20712 resulting deduced argument later down in this function. */
20713 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
20714 TMPL_ARG (targs
, level
, idx
) = old_pack
;
20716 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
20717 actually deduce anything. */
20718 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
20719 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
20720 nondeduced_p
= true;
20724 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
20726 /* If we had fewer function args than explicit template args,
20727 just use the explicits. */
20728 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
20729 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
20730 if (len
< explicit_len
)
20731 new_args
= explicit_args
;
20737 /* Build the deduced *_ARGUMENT_PACK. */
20738 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
20740 result
= make_node (NONTYPE_ARGUMENT_PACK
);
20741 TREE_CONSTANT (result
) = 1;
20744 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
20746 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
20748 /* Note the deduced argument packs for this parameter
20750 TMPL_ARG (targs
, level
, idx
) = result
;
20752 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
20753 && (ARGUMENT_PACK_ARGS (old_pack
)
20754 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
20756 /* We only had the explicitly-provided arguments before, but
20757 now we have a complete set of arguments. */
20758 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
20760 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
20761 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
20762 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
20766 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
20767 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
20769 if (!comp_template_args (old_args
, new_args
,
20770 &bad_old_arg
, &bad_new_arg
))
20771 /* Inconsistent unification of this parameter pack. */
20772 return unify_parameter_pack_inconsistent (explain_p
,
20778 return unify_success (explain_p
);
20781 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
20782 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
20783 parameters and return value are as for unify. */
20786 unify_array_domain (tree tparms
, tree targs
,
20787 tree parm_dom
, tree arg_dom
,
20795 /* Our representation of array types uses "N - 1" as the
20796 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
20797 not an integer constant. We cannot unify arbitrarily
20798 complex expressions, so we eliminate the MINUS_EXPRs
20800 parm_max
= TYPE_MAX_VALUE (parm_dom
);
20801 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
20804 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
20805 parm_max
= TREE_OPERAND (parm_max
, 0);
20807 arg_max
= TYPE_MAX_VALUE (arg_dom
);
20808 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
20811 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
20812 trying to unify the type of a variable with the type
20813 of a template parameter. For example:
20815 template <unsigned int N>
20816 void f (char (&) [N]);
20823 Here, the type of the ARG will be "int [g(i)]", and
20824 may be a SAVE_EXPR, etc. */
20825 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
20826 return unify_vla_arg (explain_p
, arg_dom
);
20827 arg_max
= TREE_OPERAND (arg_max
, 0);
20830 /* If only one of the bounds used a MINUS_EXPR, compensate
20831 by adding one to the other bound. */
20832 if (parm_cst
&& !arg_cst
)
20833 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
20837 else if (arg_cst
&& !parm_cst
)
20838 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
20843 return unify (tparms
, targs
, parm_max
, arg_max
,
20844 UNIFY_ALLOW_INTEGER
, explain_p
);
20847 /* Returns whether T, a P or A in unify, is a type, template or expression. */
20849 enum pa_kind_t
{ pa_type
, pa_tmpl
, pa_expr
};
20854 if (PACK_EXPANSION_P (t
))
20855 t
= PACK_EXPANSION_PATTERN (t
);
20856 if (TREE_CODE (t
) == TEMPLATE_TEMPLATE_PARM
20857 || TREE_CODE (t
) == UNBOUND_CLASS_TEMPLATE
20858 || DECL_TYPE_TEMPLATE_P (t
))
20860 else if (TYPE_P (t
))
20866 /* Deduce the value of template parameters. TPARMS is the (innermost)
20867 set of template parameters to a template. TARGS is the bindings
20868 for those template parameters, as determined thus far; TARGS may
20869 include template arguments for outer levels of template parameters
20870 as well. PARM is a parameter to a template function, or a
20871 subcomponent of that parameter; ARG is the corresponding argument.
20872 This function attempts to match PARM with ARG in a manner
20873 consistent with the existing assignments in TARGS. If more values
20874 are deduced, then TARGS is updated.
20876 Returns 0 if the type deduction succeeds, 1 otherwise. The
20877 parameter STRICT is a bitwise or of the following flags:
20880 Require an exact match between PARM and ARG.
20881 UNIFY_ALLOW_MORE_CV_QUAL:
20882 Allow the deduced ARG to be more cv-qualified (by qualification
20883 conversion) than ARG.
20884 UNIFY_ALLOW_LESS_CV_QUAL:
20885 Allow the deduced ARG to be less cv-qualified than ARG.
20886 UNIFY_ALLOW_DERIVED:
20887 Allow the deduced ARG to be a template base class of ARG,
20888 or a pointer to a template base class of the type pointed to by
20890 UNIFY_ALLOW_INTEGER:
20891 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
20892 case for more information.
20893 UNIFY_ALLOW_OUTER_LEVEL:
20894 This is the outermost level of a deduction. Used to determine validity
20895 of qualification conversions. A valid qualification conversion must
20896 have const qualified pointers leading up to the inner type which
20897 requires additional CV quals, except at the outer level, where const
20898 is not required [conv.qual]. It would be normal to set this flag in
20899 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
20900 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
20901 This is the outermost level of a deduction, and PARM can be more CV
20902 qualified at this point.
20903 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
20904 This is the outermost level of a deduction, and PARM can be less CV
20905 qualified at this point. */
20908 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
20914 int strict_in
= strict
;
20915 tsubst_flags_t complain
= (explain_p
20916 ? tf_warning_or_error
20919 /* I don't think this will do the right thing with respect to types.
20920 But the only case I've seen it in so far has been array bounds, where
20921 signedness is the only information lost, and I think that will be
20923 while (CONVERT_EXPR_P (parm
))
20924 parm
= TREE_OPERAND (parm
, 0);
20926 if (arg
== error_mark_node
)
20927 return unify_invalid (explain_p
);
20928 if (arg
== unknown_type_node
20929 || arg
== init_list_type_node
)
20930 /* We can't deduce anything from this, but we might get all the
20931 template args from other function args. */
20932 return unify_success (explain_p
);
20934 if (parm
== any_targ_node
|| arg
== any_targ_node
)
20935 return unify_success (explain_p
);
20937 /* If PARM uses template parameters, then we can't bail out here,
20938 even if ARG == PARM, since we won't record unifications for the
20939 template parameters. We might need them if we're trying to
20940 figure out which of two things is more specialized. */
20941 if (arg
== parm
&& !uses_template_parms (parm
))
20942 return unify_success (explain_p
);
20944 /* Handle init lists early, so the rest of the function can assume
20945 we're dealing with a type. */
20946 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
20950 tree orig_parm
= parm
;
20952 /* Replace T with std::initializer_list<T> for deduction. */
20953 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
20954 && flag_deduce_init_list
)
20955 parm
= listify (parm
);
20957 if (!is_std_init_list (parm
)
20958 && TREE_CODE (parm
) != ARRAY_TYPE
)
20959 /* We can only deduce from an initializer list argument if the
20960 parameter is std::initializer_list or an array; otherwise this
20961 is a non-deduced context. */
20962 return unify_success (explain_p
);
20964 if (TREE_CODE (parm
) == ARRAY_TYPE
)
20965 elttype
= TREE_TYPE (parm
);
20968 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
20969 /* Deduction is defined in terms of a single type, so just punt
20970 on the (bizarre) std::initializer_list<T...>. */
20971 if (PACK_EXPANSION_P (elttype
))
20972 return unify_success (explain_p
);
20975 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
20977 int elt_strict
= strict
;
20979 if (elt
== error_mark_node
)
20980 return unify_invalid (explain_p
);
20982 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
20984 tree type
= TREE_TYPE (elt
);
20985 if (type
== error_mark_node
)
20986 return unify_invalid (explain_p
);
20987 /* It should only be possible to get here for a call. */
20988 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
20989 elt_strict
|= maybe_adjust_types_for_deduction
20990 (DEDUCE_CALL
, &elttype
, &type
, elt
);
20994 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
20998 if (TREE_CODE (parm
) == ARRAY_TYPE
20999 && deducible_array_bound (TYPE_DOMAIN (parm
)))
21001 /* Also deduce from the length of the initializer list. */
21002 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
21003 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
21004 if (idx
== error_mark_node
)
21005 return unify_invalid (explain_p
);
21006 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
21010 /* If the std::initializer_list<T> deduction worked, replace the
21011 deduced A with std::initializer_list<A>. */
21012 if (orig_parm
!= parm
)
21014 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
21015 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21016 targ
= listify (targ
);
21017 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
21019 return unify_success (explain_p
);
21022 /* If parm and arg aren't the same kind of thing (template, type, or
21023 expression), fail early. */
21024 if (pa_kind (parm
) != pa_kind (arg
))
21025 return unify_invalid (explain_p
);
21027 /* Immediately reject some pairs that won't unify because of
21028 cv-qualification mismatches. */
21029 if (TREE_CODE (arg
) == TREE_CODE (parm
)
21031 /* It is the elements of the array which hold the cv quals of an array
21032 type, and the elements might be template type parms. We'll check
21033 when we recurse. */
21034 && TREE_CODE (arg
) != ARRAY_TYPE
21035 /* We check the cv-qualifiers when unifying with template type
21036 parameters below. We want to allow ARG `const T' to unify with
21037 PARM `T' for example, when computing which of two templates
21038 is more specialized, for example. */
21039 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
21040 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
21041 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21043 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
21044 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
21045 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
21046 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
21047 strict
&= ~UNIFY_ALLOW_DERIVED
;
21048 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
21049 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
21051 switch (TREE_CODE (parm
))
21053 case TYPENAME_TYPE
:
21055 case UNBOUND_CLASS_TEMPLATE
:
21056 /* In a type which contains a nested-name-specifier, template
21057 argument values cannot be deduced for template parameters used
21058 within the nested-name-specifier. */
21059 return unify_success (explain_p
);
21061 case TEMPLATE_TYPE_PARM
:
21062 case TEMPLATE_TEMPLATE_PARM
:
21063 case BOUND_TEMPLATE_TEMPLATE_PARM
:
21064 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
21065 if (error_operand_p (tparm
))
21066 return unify_invalid (explain_p
);
21068 if (TEMPLATE_TYPE_LEVEL (parm
)
21069 != template_decl_level (tparm
))
21070 /* The PARM is not one we're trying to unify. Just check
21071 to see if it matches ARG. */
21073 if (TREE_CODE (arg
) == TREE_CODE (parm
)
21074 && (is_auto (parm
) ? is_auto (arg
)
21075 : same_type_p (parm
, arg
)))
21076 return unify_success (explain_p
);
21078 return unify_type_mismatch (explain_p
, parm
, arg
);
21080 idx
= TEMPLATE_TYPE_IDX (parm
);
21081 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21082 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
21083 if (error_operand_p (tparm
))
21084 return unify_invalid (explain_p
);
21086 /* Check for mixed types and values. */
21087 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
21088 && TREE_CODE (tparm
) != TYPE_DECL
)
21089 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21090 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
21091 gcc_unreachable ();
21093 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21095 if ((strict_in
& UNIFY_ALLOW_DERIVED
)
21096 && CLASS_TYPE_P (arg
))
21098 /* First try to match ARG directly. */
21099 tree t
= try_class_unification (tparms
, targs
, parm
, arg
,
21103 /* Otherwise, look for a suitable base of ARG, as below. */
21104 enum template_base_result r
;
21105 r
= get_template_base (tparms
, targs
, parm
, arg
,
21108 return unify_no_common_base (explain_p
, r
, parm
, arg
);
21112 /* ARG must be constructed from a template class or a template
21113 template parameter. */
21114 else if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
21115 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
21116 return unify_template_deduction_failure (explain_p
, parm
, arg
);
21118 /* Deduce arguments T, i from TT<T> or TT<i>. */
21119 if (unify_bound_ttp_args (tparms
, targs
, parm
, arg
, explain_p
))
21122 arg
= TYPE_TI_TEMPLATE (arg
);
21124 /* Fall through to deduce template name. */
21127 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
21128 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21130 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
21132 /* Simple cases: Value already set, does match or doesn't. */
21133 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
21134 return unify_success (explain_p
);
21136 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
21140 /* If PARM is `const T' and ARG is only `int', we don't have
21141 a match unless we are allowing additional qualification.
21142 If ARG is `const int' and PARM is just `T' that's OK;
21143 that binds `const int' to `T'. */
21144 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
21146 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21148 /* Consider the case where ARG is `const volatile int' and
21149 PARM is `const T'. Then, T should be `volatile int'. */
21150 arg
= cp_build_qualified_type_real
21151 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
21152 if (arg
== error_mark_node
)
21153 return unify_invalid (explain_p
);
21155 /* Simple cases: Value already set, does match or doesn't. */
21156 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
21157 return unify_success (explain_p
);
21159 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
21161 /* Make sure that ARG is not a variable-sized array. (Note
21162 that were talking about variable-sized arrays (like
21163 `int[n]'), rather than arrays of unknown size (like
21164 `int[]').) We'll get very confused by such a type since
21165 the bound of the array is not constant, and therefore
21166 not mangleable. Besides, such types are not allowed in
21167 ISO C++, so we can do as we please here. We do allow
21168 them for 'auto' deduction, since that isn't ABI-exposed. */
21169 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
21170 return unify_vla_arg (explain_p
, arg
);
21172 /* Strip typedefs as in convert_template_argument. */
21173 arg
= canonicalize_type_argument (arg
, tf_none
);
21176 /* If ARG is a parameter pack or an expansion, we cannot unify
21177 against it unless PARM is also a parameter pack. */
21178 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
21179 && !template_parameter_pack_p (parm
))
21180 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
21182 /* If the argument deduction results is a METHOD_TYPE,
21183 then there is a problem.
21184 METHOD_TYPE doesn't map to any real C++ type the result of
21185 the deduction can not be of that type. */
21186 if (TREE_CODE (arg
) == METHOD_TYPE
)
21187 return unify_method_type_error (explain_p
, arg
);
21189 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
21190 return unify_success (explain_p
);
21192 case TEMPLATE_PARM_INDEX
:
21193 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
21194 if (error_operand_p (tparm
))
21195 return unify_invalid (explain_p
);
21197 if (TEMPLATE_PARM_LEVEL (parm
)
21198 != template_decl_level (tparm
))
21200 /* The PARM is not one we're trying to unify. Just check
21201 to see if it matches ARG. */
21202 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
21203 && cp_tree_equal (parm
, arg
));
21205 unify_expression_unequal (explain_p
, parm
, arg
);
21209 idx
= TEMPLATE_PARM_IDX (parm
);
21210 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
21214 if ((strict
& UNIFY_ALLOW_INTEGER
)
21215 && TREE_TYPE (targ
) && TREE_TYPE (arg
)
21216 && CP_INTEGRAL_TYPE_P (TREE_TYPE (targ
)))
21217 /* We're deducing from an array bound, the type doesn't matter. */
21218 arg
= fold_convert (TREE_TYPE (targ
), arg
);
21219 int x
= !cp_tree_equal (targ
, arg
);
21221 unify_inconsistency (explain_p
, parm
, targ
, arg
);
21225 /* [temp.deduct.type] If, in the declaration of a function template
21226 with a non-type template-parameter, the non-type
21227 template-parameter is used in an expression in the function
21228 parameter-list and, if the corresponding template-argument is
21229 deduced, the template-argument type shall match the type of the
21230 template-parameter exactly, except that a template-argument
21231 deduced from an array bound may be of any integral type.
21232 The non-type parameter might use already deduced type parameters. */
21233 tparm
= TREE_TYPE (parm
);
21234 if (TEMPLATE_PARM_LEVEL (parm
) > TMPL_ARGS_DEPTH (targs
))
21235 /* We don't have enough levels of args to do any substitution. This
21236 can happen in the context of -fnew-ttp-matching. */;
21239 ++processing_template_decl
;
21240 tparm
= tsubst (tparm
, targs
, tf_none
, NULL_TREE
);
21241 --processing_template_decl
;
21243 if (tree a
= type_uses_auto (tparm
))
21245 tparm
= do_auto_deduction (tparm
, arg
, a
, complain
, adc_unify
);
21246 if (tparm
== error_mark_node
)
21251 if (!TREE_TYPE (arg
))
21252 /* Template-parameter dependent expression. Just accept it for now.
21253 It will later be processed in convert_template_argument. */
21255 else if (same_type_p (non_reference (TREE_TYPE (arg
)),
21256 non_reference (tparm
)))
21258 else if ((strict
& UNIFY_ALLOW_INTEGER
)
21259 && CP_INTEGRAL_TYPE_P (tparm
))
21260 /* Convert the ARG to the type of PARM; the deduced non-type
21261 template argument must exactly match the types of the
21262 corresponding parameter. */
21263 arg
= fold (build_nop (tparm
, arg
));
21264 else if (uses_template_parms (tparm
))
21266 /* We haven't deduced the type of this parameter yet. */
21267 if (cxx_dialect
>= cxx17
21268 /* We deduce from array bounds in try_array_deduction. */
21269 && !(strict
& UNIFY_ALLOW_INTEGER
))
21271 /* Deduce it from the non-type argument. */
21272 tree atype
= TREE_TYPE (arg
);
21273 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
21275 UNIFY_ALLOW_NONE
, explain_p
);
21278 /* Try again later. */
21279 return unify_success (explain_p
);
21282 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
21284 /* If ARG is a parameter pack or an expansion, we cannot unify
21285 against it unless PARM is also a parameter pack. */
21286 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
21287 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
21288 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
21291 bool removed_attr
= false;
21292 arg
= strip_typedefs_expr (arg
, &removed_attr
);
21294 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
21295 return unify_success (explain_p
);
21299 /* A pointer-to-member constant can be unified only with
21300 another constant. */
21301 if (TREE_CODE (arg
) != PTRMEM_CST
)
21302 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
21304 /* Just unify the class member. It would be useless (and possibly
21305 wrong, depending on the strict flags) to unify also
21306 PTRMEM_CST_CLASS, because we want to be sure that both parm and
21307 arg refer to the same variable, even if through different
21308 classes. For instance:
21310 struct A { int x; };
21313 Unification of &A::x and &B::x must succeed. */
21314 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
21315 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
21320 if (!TYPE_PTR_P (arg
))
21321 return unify_type_mismatch (explain_p
, parm
, arg
);
21323 /* [temp.deduct.call]
21325 A can be another pointer or pointer to member type that can
21326 be converted to the deduced A via a qualification
21327 conversion (_conv.qual_).
21329 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
21330 This will allow for additional cv-qualification of the
21331 pointed-to types if appropriate. */
21333 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
21334 /* The derived-to-base conversion only persists through one
21335 level of pointers. */
21336 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
21338 return unify (tparms
, targs
, TREE_TYPE (parm
),
21339 TREE_TYPE (arg
), strict
, explain_p
);
21342 case REFERENCE_TYPE
:
21343 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
21344 return unify_type_mismatch (explain_p
, parm
, arg
);
21345 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21346 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
21349 if (TREE_CODE (arg
) != ARRAY_TYPE
)
21350 return unify_type_mismatch (explain_p
, parm
, arg
);
21351 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
21352 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
21353 return unify_type_mismatch (explain_p
, parm
, arg
);
21354 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21355 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
21356 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
21357 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
21358 TYPE_DOMAIN (arg
), explain_p
);
21359 return unify_success (explain_p
);
21366 case ENUMERAL_TYPE
:
21369 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21370 return unify_type_mismatch (explain_p
, parm
, arg
);
21372 /* We have already checked cv-qualification at the top of the
21374 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
21375 return unify_type_mismatch (explain_p
, parm
, arg
);
21377 /* As far as unification is concerned, this wins. Later checks
21378 will invalidate it if necessary. */
21379 return unify_success (explain_p
);
21381 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
21382 /* Type INTEGER_CST can come from ordinary constant template args. */
21384 while (CONVERT_EXPR_P (arg
))
21385 arg
= TREE_OPERAND (arg
, 0);
21387 if (TREE_CODE (arg
) != INTEGER_CST
)
21388 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21389 return (tree_int_cst_equal (parm
, arg
)
21390 ? unify_success (explain_p
)
21391 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
21395 int i
, len
, argslen
;
21396 int parm_variadic_p
= 0;
21398 if (TREE_CODE (arg
) != TREE_VEC
)
21399 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21401 len
= TREE_VEC_LENGTH (parm
);
21402 argslen
= TREE_VEC_LENGTH (arg
);
21404 /* Check for pack expansions in the parameters. */
21405 for (i
= 0; i
< len
; ++i
)
21407 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
21410 /* We can unify against something with a trailing
21412 parm_variadic_p
= 1;
21414 /* [temp.deduct.type]/9: If the template argument list of
21415 P contains a pack expansion that is not the last
21416 template argument, the entire template argument list
21417 is a non-deduced context. */
21418 return unify_success (explain_p
);
21422 /* If we don't have enough arguments to satisfy the parameters
21423 (not counting the pack expression at the end), or we have
21424 too many arguments for a parameter list that doesn't end in
21425 a pack expression, we can't unify. */
21426 if (parm_variadic_p
21427 ? argslen
< len
- parm_variadic_p
21429 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
21431 /* Unify all of the parameters that precede the (optional)
21432 pack expression. */
21433 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
21435 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
21436 TREE_VEC_ELT (parm
, i
),
21437 TREE_VEC_ELT (arg
, i
),
21438 UNIFY_ALLOW_NONE
, explain_p
);
21440 if (parm_variadic_p
)
21441 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
21443 /*subr=*/true, explain_p
);
21444 return unify_success (explain_p
);
21449 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21450 return unify_type_mismatch (explain_p
, parm
, arg
);
21452 if (TYPE_PTRMEMFUNC_P (parm
))
21454 if (!TYPE_PTRMEMFUNC_P (arg
))
21455 return unify_type_mismatch (explain_p
, parm
, arg
);
21457 return unify (tparms
, targs
,
21458 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
21459 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
21460 strict
, explain_p
);
21462 else if (TYPE_PTRMEMFUNC_P (arg
))
21463 return unify_type_mismatch (explain_p
, parm
, arg
);
21465 if (CLASSTYPE_TEMPLATE_INFO (parm
))
21467 tree t
= NULL_TREE
;
21469 if (strict_in
& UNIFY_ALLOW_DERIVED
)
21471 /* First, we try to unify the PARM and ARG directly. */
21472 t
= try_class_unification (tparms
, targs
,
21473 parm
, arg
, explain_p
);
21477 /* Fallback to the special case allowed in
21478 [temp.deduct.call]:
21480 If P is a class, and P has the form
21481 template-id, then A can be a derived class of
21482 the deduced A. Likewise, if P is a pointer to
21483 a class of the form template-id, A can be a
21484 pointer to a derived class pointed to by the
21486 enum template_base_result r
;
21487 r
= get_template_base (tparms
, targs
, parm
, arg
,
21492 /* Don't give the derived diagnostic if we're
21493 already dealing with the same template. */
21495 = (CLASSTYPE_TEMPLATE_INFO (arg
)
21496 && (CLASSTYPE_TI_TEMPLATE (parm
)
21497 == CLASSTYPE_TI_TEMPLATE (arg
)));
21498 return unify_no_common_base (explain_p
&& !same_template
,
21503 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
21504 && (CLASSTYPE_TI_TEMPLATE (parm
)
21505 == CLASSTYPE_TI_TEMPLATE (arg
)))
21506 /* Perhaps PARM is something like S<U> and ARG is S<int>.
21507 Then, we should unify `int' and `U'. */
21510 /* There's no chance of unification succeeding. */
21511 return unify_type_mismatch (explain_p
, parm
, arg
);
21513 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
21514 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
21516 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
21517 return unify_type_mismatch (explain_p
, parm
, arg
);
21518 return unify_success (explain_p
);
21521 case FUNCTION_TYPE
:
21523 unsigned int nargs
;
21528 if (TREE_CODE (arg
) != TREE_CODE (parm
))
21529 return unify_type_mismatch (explain_p
, parm
, arg
);
21531 /* CV qualifications for methods can never be deduced, they must
21532 match exactly. We need to check them explicitly here,
21533 because type_unification_real treats them as any other
21534 cv-qualified parameter. */
21535 if (TREE_CODE (parm
) == METHOD_TYPE
21536 && (!check_cv_quals_for_unify
21538 class_of_this_parm (arg
),
21539 class_of_this_parm (parm
))))
21540 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21541 if (TREE_CODE (arg
) == FUNCTION_TYPE
21542 && type_memfn_quals (parm
) != type_memfn_quals (arg
))
21543 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21544 if (type_memfn_rqual (parm
) != type_memfn_rqual (arg
))
21545 return unify_type_mismatch (explain_p
, parm
, arg
);
21547 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
21548 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
21550 nargs
= list_length (TYPE_ARG_TYPES (arg
));
21551 args
= XALLOCAVEC (tree
, nargs
);
21552 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
21553 a
!= NULL_TREE
&& a
!= void_list_node
;
21554 a
= TREE_CHAIN (a
), ++i
)
21555 args
[i
] = TREE_VALUE (a
);
21558 if (type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
21559 args
, nargs
, 1, DEDUCE_EXACT
,
21560 LOOKUP_NORMAL
, NULL
, explain_p
))
21563 if (flag_noexcept_type
)
21565 tree pspec
= TYPE_RAISES_EXCEPTIONS (parm
);
21566 tree aspec
= canonical_eh_spec (TYPE_RAISES_EXCEPTIONS (arg
));
21567 if (pspec
== NULL_TREE
) pspec
= noexcept_false_spec
;
21568 if (aspec
== NULL_TREE
) aspec
= noexcept_false_spec
;
21569 if (TREE_PURPOSE (pspec
) && TREE_PURPOSE (aspec
)
21570 && uses_template_parms (TREE_PURPOSE (pspec
)))
21571 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_PURPOSE (pspec
),
21572 TREE_PURPOSE (aspec
),
21573 UNIFY_ALLOW_NONE
, explain_p
);
21574 else if (nothrow_spec_p (pspec
) && !nothrow_spec_p (aspec
))
21575 return unify_type_mismatch (explain_p
, parm
, arg
);
21582 /* Unify a pointer to member with a pointer to member function, which
21583 deduces the type of the member as a function type. */
21584 if (TYPE_PTRMEMFUNC_P (arg
))
21586 /* Check top-level cv qualifiers */
21587 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
21588 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
21590 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
21591 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
21592 UNIFY_ALLOW_NONE
, explain_p
);
21594 /* Determine the type of the function we are unifying against. */
21595 tree fntype
= static_fn_type (arg
);
21597 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
21600 if (TREE_CODE (arg
) != OFFSET_TYPE
)
21601 return unify_type_mismatch (explain_p
, parm
, arg
);
21602 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
21603 TYPE_OFFSET_BASETYPE (arg
),
21604 UNIFY_ALLOW_NONE
, explain_p
);
21605 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
21606 strict
, explain_p
);
21609 if (DECL_TEMPLATE_PARM_P (parm
))
21610 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
21611 if (arg
!= scalar_constant_value (parm
))
21612 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21613 return unify_success (explain_p
);
21616 case TEMPLATE_DECL
:
21617 /* Matched cases are handled by the ARG == PARM test above. */
21618 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
21621 /* We might get a variable as a non-type template argument in parm if the
21622 corresponding parameter is type-dependent. Make any necessary
21623 adjustments based on whether arg is a reference. */
21624 if (CONSTANT_CLASS_P (arg
))
21625 parm
= fold_non_dependent_expr (parm
);
21626 else if (REFERENCE_REF_P (arg
))
21628 tree sub
= TREE_OPERAND (arg
, 0);
21630 if (TREE_CODE (sub
) == ADDR_EXPR
)
21631 arg
= TREE_OPERAND (sub
, 0);
21633 /* Now use the normal expression code to check whether they match. */
21636 case TYPE_ARGUMENT_PACK
:
21637 case NONTYPE_ARGUMENT_PACK
:
21638 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
21639 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
21642 case DECLTYPE_TYPE
:
21643 case UNDERLYING_TYPE
:
21644 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
21645 or UNDERLYING_TYPE nodes. */
21646 return unify_success (explain_p
);
21649 /* Unification fails if we hit an error node. */
21650 return unify_invalid (explain_p
);
21653 if (REFERENCE_REF_P (parm
))
21655 bool pexp
= PACK_EXPANSION_P (arg
);
21657 arg
= PACK_EXPANSION_PATTERN (arg
);
21658 if (REFERENCE_REF_P (arg
))
21659 arg
= TREE_OPERAND (arg
, 0);
21661 arg
= make_pack_expansion (arg
, complain
);
21662 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
21663 strict
, explain_p
);
21668 /* An unresolved overload is a nondeduced context. */
21669 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
21670 return unify_success (explain_p
);
21671 gcc_assert (EXPR_P (parm
) || TREE_CODE (parm
) == TRAIT_EXPR
);
21673 /* We must be looking at an expression. This can happen with
21677 void foo(S<I>, S<I + 2>);
21679 This is a "nondeduced context":
21683 The nondeduced contexts are:
21685 --A type that is a template-id in which one or more of
21686 the template-arguments is an expression that references
21687 a template-parameter.
21689 In these cases, we assume deduction succeeded, but don't
21690 actually infer any unifications. */
21692 if (!uses_template_parms (parm
)
21693 && !template_args_equal (parm
, arg
))
21694 return unify_expression_unequal (explain_p
, parm
, arg
);
21696 return unify_success (explain_p
);
21699 #undef RECUR_AND_CHECK_FAILURE
21701 /* Note that DECL can be defined in this translation unit, if
21705 mark_definable (tree decl
)
21708 DECL_NOT_REALLY_EXTERN (decl
) = 1;
21709 FOR_EACH_CLONE (clone
, decl
)
21710 DECL_NOT_REALLY_EXTERN (clone
) = 1;
21713 /* Called if RESULT is explicitly instantiated, or is a member of an
21714 explicitly instantiated class. */
21717 mark_decl_instantiated (tree result
, int extern_p
)
21719 SET_DECL_EXPLICIT_INSTANTIATION (result
);
21721 /* If this entity has already been written out, it's too late to
21722 make any modifications. */
21723 if (TREE_ASM_WRITTEN (result
))
21726 /* For anonymous namespace we don't need to do anything. */
21727 if (decl_anon_ns_mem_p (result
))
21729 gcc_assert (!TREE_PUBLIC (result
));
21733 if (TREE_CODE (result
) != FUNCTION_DECL
)
21734 /* The TREE_PUBLIC flag for function declarations will have been
21735 set correctly by tsubst. */
21736 TREE_PUBLIC (result
) = 1;
21738 /* This might have been set by an earlier implicit instantiation. */
21739 DECL_COMDAT (result
) = 0;
21742 DECL_NOT_REALLY_EXTERN (result
) = 0;
21745 mark_definable (result
);
21746 mark_needed (result
);
21747 /* Always make artificials weak. */
21748 if (DECL_ARTIFICIAL (result
) && flag_weak
)
21749 comdat_linkage (result
);
21750 /* For WIN32 we also want to put explicit instantiations in
21751 linkonce sections. */
21752 else if (TREE_PUBLIC (result
))
21753 maybe_make_one_only (result
);
21756 /* If EXTERN_P, then this function will not be emitted -- unless
21757 followed by an explicit instantiation, at which point its linkage
21758 will be adjusted. If !EXTERN_P, then this function will be
21759 emitted here. In neither circumstance do we want
21760 import_export_decl to adjust the linkage. */
21761 DECL_INTERFACE_KNOWN (result
) = 1;
21764 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
21765 important template arguments. If any are missing, we check whether
21766 they're important by using error_mark_node for substituting into any
21767 args that were used for partial ordering (the ones between ARGS and END)
21768 and seeing if it bubbles up. */
21771 check_undeduced_parms (tree targs
, tree args
, tree end
)
21773 bool found
= false;
21775 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
21776 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
21779 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
21783 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
21784 if (substed
== error_mark_node
)
21790 /* Given two function templates PAT1 and PAT2, return:
21792 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
21793 -1 if PAT2 is more specialized than PAT1.
21794 0 if neither is more specialized.
21796 LEN indicates the number of parameters we should consider
21797 (defaulted parameters should not be considered).
21799 The 1998 std underspecified function template partial ordering, and
21800 DR214 addresses the issue. We take pairs of arguments, one from
21801 each of the templates, and deduce them against each other. One of
21802 the templates will be more specialized if all the *other*
21803 template's arguments deduce against its arguments and at least one
21804 of its arguments *does* *not* deduce against the other template's
21805 corresponding argument. Deduction is done as for class templates.
21806 The arguments used in deduction have reference and top level cv
21807 qualifiers removed. Iff both arguments were originally reference
21808 types *and* deduction succeeds in both directions, an lvalue reference
21809 wins against an rvalue reference and otherwise the template
21810 with the more cv-qualified argument wins for that pairing (if
21811 neither is more cv-qualified, they both are equal). Unlike regular
21812 deduction, after all the arguments have been deduced in this way,
21813 we do *not* verify the deduced template argument values can be
21814 substituted into non-deduced contexts.
21816 The logic can be a bit confusing here, because we look at deduce1 and
21817 targs1 to see if pat2 is at least as specialized, and vice versa; if we
21818 can find template arguments for pat1 to make arg1 look like arg2, that
21819 means that arg2 is at least as specialized as arg1. */
21822 more_specialized_fn (tree pat1
, tree pat2
, int len
)
21824 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
21825 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
21826 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
21827 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
21828 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
21829 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
21830 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
21831 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
21832 tree origs1
, origs2
;
21833 bool lose1
= false;
21834 bool lose2
= false;
21836 /* Remove the this parameter from non-static member functions. If
21837 one is a non-static member function and the other is not a static
21838 member function, remove the first parameter from that function
21839 also. This situation occurs for operator functions where we
21840 locate both a member function (with this pointer) and non-member
21841 operator (with explicit first operand). */
21842 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
21844 len
--; /* LEN is the number of significant arguments for DECL1 */
21845 args1
= TREE_CHAIN (args1
);
21846 if (!DECL_STATIC_FUNCTION_P (decl2
))
21847 args2
= TREE_CHAIN (args2
);
21849 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
21851 args2
= TREE_CHAIN (args2
);
21852 if (!DECL_STATIC_FUNCTION_P (decl1
))
21855 args1
= TREE_CHAIN (args1
);
21859 /* If only one is a conversion operator, they are unordered. */
21860 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
21863 /* Consider the return type for a conversion function */
21864 if (DECL_CONV_FN_P (decl1
))
21866 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
21867 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
21871 processing_template_decl
++;
21877 /* Stop when an ellipsis is seen. */
21878 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
21880 tree arg1
= TREE_VALUE (args1
);
21881 tree arg2
= TREE_VALUE (args2
);
21882 int deduce1
, deduce2
;
21888 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
21889 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
21891 /* When both arguments are pack expansions, we need only
21892 unify the patterns themselves. */
21893 arg1
= PACK_EXPANSION_PATTERN (arg1
);
21894 arg2
= PACK_EXPANSION_PATTERN (arg2
);
21896 /* This is the last comparison we need to do. */
21900 /* DR 1847: If a particular P contains no template-parameters that
21901 participate in template argument deduction, that P is not used to
21902 determine the ordering. */
21903 if (!uses_deducible_template_parms (arg1
)
21904 && !uses_deducible_template_parms (arg2
))
21907 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
21909 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
21910 arg1
= TREE_TYPE (arg1
);
21911 quals1
= cp_type_quals (arg1
);
21914 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
21916 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
21917 arg2
= TREE_TYPE (arg2
);
21918 quals2
= cp_type_quals (arg2
);
21921 arg1
= TYPE_MAIN_VARIANT (arg1
);
21922 arg2
= TYPE_MAIN_VARIANT (arg2
);
21924 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
21926 int i
, len2
= remaining_arguments (args2
);
21927 tree parmvec
= make_tree_vec (1);
21928 tree argvec
= make_tree_vec (len2
);
21931 /* Setup the parameter vector, which contains only ARG1. */
21932 TREE_VEC_ELT (parmvec
, 0) = arg1
;
21934 /* Setup the argument vector, which contains the remaining
21936 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
21937 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
21939 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
21940 argvec
, DEDUCE_EXACT
,
21941 /*subr=*/true, /*explain_p=*/false)
21944 /* We cannot deduce in the other direction, because ARG1 is
21945 a pack expansion but ARG2 is not. */
21948 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
21950 int i
, len1
= remaining_arguments (args1
);
21951 tree parmvec
= make_tree_vec (1);
21952 tree argvec
= make_tree_vec (len1
);
21955 /* Setup the parameter vector, which contains only ARG1. */
21956 TREE_VEC_ELT (parmvec
, 0) = arg2
;
21958 /* Setup the argument vector, which contains the remaining
21960 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
21961 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
21963 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
21964 argvec
, DEDUCE_EXACT
,
21965 /*subr=*/true, /*explain_p=*/false)
21968 /* We cannot deduce in the other direction, because ARG2 is
21969 a pack expansion but ARG1 is not.*/
21975 /* The normal case, where neither argument is a pack
21977 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
21978 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
21980 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
21981 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
21985 /* If we couldn't deduce arguments for tparms1 to make arg1 match
21986 arg2, then arg2 is not as specialized as arg1. */
21992 /* "If, for a given type, deduction succeeds in both directions
21993 (i.e., the types are identical after the transformations above)
21994 and both P and A were reference types (before being replaced with
21995 the type referred to above):
21996 - if the type from the argument template was an lvalue reference and
21997 the type from the parameter template was not, the argument type is
21998 considered to be more specialized than the other; otherwise,
21999 - if the type from the argument template is more cv-qualified
22000 than the type from the parameter template (as described above),
22001 the argument type is considered to be more specialized than the other;
22003 - neither type is more specialized than the other." */
22005 if (deduce1
&& deduce2
)
22007 if (ref1
&& ref2
&& ref1
!= ref2
)
22014 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
22016 if ((quals1
& quals2
) == quals2
)
22018 if ((quals1
& quals2
) == quals1
)
22023 if (lose1
&& lose2
)
22024 /* We've failed to deduce something in either direction.
22025 These must be unordered. */
22030 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
22031 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
22032 /* We have already processed all of the arguments in our
22033 handing of the pack expansion type. */
22036 args1
= TREE_CHAIN (args1
);
22037 args2
= TREE_CHAIN (args2
);
22040 /* "In most cases, all template parameters must have values in order for
22041 deduction to succeed, but for partial ordering purposes a template
22042 parameter may remain without a value provided it is not used in the
22043 types being used for partial ordering."
22045 Thus, if we are missing any of the targs1 we need to substitute into
22046 origs1, then pat2 is not as specialized as pat1. This can happen when
22047 there is a nondeduced context. */
22048 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
22050 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
22053 processing_template_decl
--;
22055 /* If both deductions succeed, the partial ordering selects the more
22056 constrained template. */
22057 if (!lose1
&& !lose2
)
22059 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
22060 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
22061 lose1
= !subsumes_constraints (c1
, c2
);
22062 lose2
= !subsumes_constraints (c2
, c1
);
22065 /* All things being equal, if the next argument is a pack expansion
22066 for one function but not for the other, prefer the
22067 non-variadic function. FIXME this is bogus; see c++/41958. */
22069 && args1
&& TREE_VALUE (args1
)
22070 && args2
&& TREE_VALUE (args2
))
22072 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
22073 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
22076 if (lose1
== lose2
)
22084 /* Determine which of two partial specializations of TMPL is more
22087 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
22088 to the first partial specialization. The TREE_PURPOSE is the
22089 innermost set of template parameters for the partial
22090 specialization. PAT2 is similar, but for the second template.
22092 Return 1 if the first partial specialization is more specialized;
22093 -1 if the second is more specialized; 0 if neither is more
22096 See [temp.class.order] for information about determining which of
22097 two templates is more specialized. */
22100 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
22104 bool any_deductions
= false;
22106 tree tmpl1
= TREE_VALUE (pat1
);
22107 tree tmpl2
= TREE_VALUE (pat2
);
22108 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
22109 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
22111 /* Just like what happens for functions, if we are ordering between
22112 different template specializations, we may encounter dependent
22113 types in the arguments, and we need our dependency check functions
22114 to behave correctly. */
22115 ++processing_template_decl
;
22116 targs
= get_partial_spec_bindings (tmpl
, tmpl1
, specargs2
);
22120 any_deductions
= true;
22123 targs
= get_partial_spec_bindings (tmpl
, tmpl2
, specargs1
);
22127 any_deductions
= true;
22129 --processing_template_decl
;
22131 /* If both deductions succeed, the partial ordering selects the more
22132 constrained template. */
22133 if (!winner
&& any_deductions
)
22134 return more_constrained (tmpl1
, tmpl2
);
22136 /* In the case of a tie where at least one of the templates
22137 has a parameter pack at the end, the template with the most
22138 non-packed parameters wins. */
22141 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
22142 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
22144 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
22145 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
22146 int len1
= TREE_VEC_LENGTH (args1
);
22147 int len2
= TREE_VEC_LENGTH (args2
);
22149 /* We don't count the pack expansion at the end. */
22150 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
22152 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
22157 else if (len1
< len2
)
22164 /* Return the template arguments that will produce the function signature
22165 DECL from the function template FN, with the explicit template
22166 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
22167 also match. Return NULL_TREE if no satisfactory arguments could be
22171 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
22173 int ntparms
= DECL_NTPARMS (fn
);
22174 tree targs
= make_tree_vec (ntparms
);
22175 tree decl_type
= TREE_TYPE (decl
);
22176 tree decl_arg_types
;
22178 unsigned int nargs
, ix
;
22181 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
22183 /* Never do unification on the 'this' parameter. */
22184 decl_arg_types
= skip_artificial_parms_for (decl
,
22185 TYPE_ARG_TYPES (decl_type
));
22187 nargs
= list_length (decl_arg_types
);
22188 args
= XALLOCAVEC (tree
, nargs
);
22189 for (arg
= decl_arg_types
, ix
= 0;
22190 arg
!= NULL_TREE
&& arg
!= void_list_node
;
22191 arg
= TREE_CHAIN (arg
), ++ix
)
22192 args
[ix
] = TREE_VALUE (arg
);
22194 if (fn_type_unification (fn
, explicit_args
, targs
,
22196 (check_rettype
|| DECL_CONV_FN_P (fn
)
22197 ? TREE_TYPE (decl_type
) : NULL_TREE
),
22198 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
22200 == error_mark_node
)
22206 /* Return the innermost template arguments that, when applied to a partial
22207 specialization SPEC_TMPL of TMPL, yield the ARGS.
22209 For example, suppose we have:
22211 template <class T, class U> struct S {};
22212 template <class T> struct S<T*, int> {};
22214 Then, suppose we want to get `S<double*, int>'. SPEC_TMPL will be the
22215 partial specialization and the ARGS will be {double*, int}. The resulting
22216 vector will be {double}, indicating that `T' is bound to `double'. */
22219 get_partial_spec_bindings (tree tmpl
, tree spec_tmpl
, tree args
)
22221 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
22223 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (spec_tmpl
)));
22224 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
22226 tree innermost_deduced_args
;
22228 innermost_deduced_args
= make_tree_vec (ntparms
);
22229 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
22231 deduced_args
= copy_node (args
);
22232 SET_TMPL_ARGS_LEVEL (deduced_args
,
22233 TMPL_ARGS_DEPTH (deduced_args
),
22234 innermost_deduced_args
);
22237 deduced_args
= innermost_deduced_args
;
22239 bool tried_array_deduction
= (cxx_dialect
< cxx17
);
22241 if (unify (tparms
, deduced_args
,
22242 INNERMOST_TEMPLATE_ARGS (spec_args
),
22243 INNERMOST_TEMPLATE_ARGS (args
),
22244 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
22247 for (i
= 0; i
< ntparms
; ++i
)
22248 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
22250 if (!tried_array_deduction
)
22252 try_array_deduction (tparms
, innermost_deduced_args
,
22253 INNERMOST_TEMPLATE_ARGS (spec_args
));
22254 tried_array_deduction
= true;
22255 if (TREE_VEC_ELT (innermost_deduced_args
, i
))
22261 tree tinst
= build_tree_list (spec_tmpl
, deduced_args
);
22262 if (!push_tinst_level (tinst
))
22264 excessive_deduction_depth
= true;
22268 /* Verify that nondeduced template arguments agree with the type
22269 obtained from argument deduction.
22273 struct A { typedef int X; };
22274 template <class T, class U> struct C {};
22275 template <class T> struct C<T, typename T::X> {};
22277 Then with the instantiation `C<A, int>', we can deduce that
22278 `T' is `A' but unify () does not check whether `typename T::X'
22280 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
22282 if (spec_args
!= error_mark_node
)
22283 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
22284 INNERMOST_TEMPLATE_ARGS (spec_args
),
22285 tmpl
, tf_none
, false, false);
22287 pop_tinst_level ();
22289 if (spec_args
== error_mark_node
22290 /* We only need to check the innermost arguments; the other
22291 arguments will always agree. */
22292 || !comp_template_args_porder (INNERMOST_TEMPLATE_ARGS (spec_args
),
22293 INNERMOST_TEMPLATE_ARGS (args
)))
22296 /* Now that we have bindings for all of the template arguments,
22297 ensure that the arguments deduced for the template template
22298 parameters have compatible template parameter lists. See the use
22299 of template_template_parm_bindings_ok_p in fn_type_unification
22300 for more information. */
22301 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
22304 return deduced_args
;
22307 // Compare two function templates T1 and T2 by deducing bindings
22308 // from one against the other. If both deductions succeed, compare
22309 // constraints to see which is more constrained.
22311 more_specialized_inst (tree t1
, tree t2
)
22316 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
22322 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
22328 // If both deductions succeed, then one may be more constrained.
22329 if (count
== 2 && fate
== 0)
22330 fate
= more_constrained (t1
, t2
);
22335 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
22336 Return the TREE_LIST node with the most specialized template, if
22337 any. If there is no most specialized template, the error_mark_node
22340 Note that this function does not look at, or modify, the
22341 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
22342 returned is one of the elements of INSTANTIATIONS, callers may
22343 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
22344 and retrieve it from the value returned. */
22347 most_specialized_instantiation (tree templates
)
22351 ++processing_template_decl
;
22354 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
22356 gcc_assert (TREE_VALUE (champ
) != TREE_VALUE (fn
));
22357 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
22362 /* Equally specialized, move to next function. If there
22363 is no next function, nothing's most specialized. */
22364 fn
= TREE_CHAIN (fn
);
22372 /* Now verify that champ is better than everything earlier in the
22373 instantiation list. */
22374 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
22375 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
22382 processing_template_decl
--;
22385 return error_mark_node
;
22390 /* If DECL is a specialization of some template, return the most
22391 general such template. Otherwise, returns NULL_TREE.
22393 For example, given:
22395 template <class T> struct S { template <class U> void f(U); };
22397 if TMPL is `template <class U> void S<int>::f(U)' this will return
22398 the full template. This function will not trace past partial
22399 specializations, however. For example, given in addition:
22401 template <class T> struct S<T*> { template <class U> void f(U); };
22403 if TMPL is `template <class U> void S<int*>::f(U)' this will return
22404 `template <class T> template <class U> S<T*>::f(U)'. */
22407 most_general_template (tree decl
)
22409 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
22411 if (tree tinfo
= get_template_info (decl
))
22412 decl
= TI_TEMPLATE (tinfo
);
22413 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
22414 template friend, or a FIELD_DECL for a capture pack. */
22415 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
22419 /* Look for more and more general templates. */
22420 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
22422 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
22423 (See cp-tree.h for details.) */
22424 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
22427 if (CLASS_TYPE_P (TREE_TYPE (decl
))
22428 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
22429 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
22432 /* Stop if we run into an explicitly specialized class template. */
22433 if (!DECL_NAMESPACE_SCOPE_P (decl
)
22434 && DECL_CONTEXT (decl
)
22435 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
22438 decl
= DECL_TI_TEMPLATE (decl
);
22444 /* Return the most specialized of the template partial specializations
22445 which can produce TARGET, a specialization of some class or variable
22446 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
22447 a TEMPLATE_DECL node corresponding to the partial specialization, while
22448 the TREE_PURPOSE is the set of template arguments that must be
22449 substituted into the template pattern in order to generate TARGET.
22451 If the choice of partial specialization is ambiguous, a diagnostic
22452 is issued, and the error_mark_node is returned. If there are no
22453 partial specializations matching TARGET, then NULL_TREE is
22454 returned, indicating that the primary template should be used. */
22457 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
22459 tree list
= NULL_TREE
;
22464 tree outer_args
= NULL_TREE
;
22467 if (TYPE_P (target
))
22469 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
22470 tmpl
= TI_TEMPLATE (tinfo
);
22471 args
= TI_ARGS (tinfo
);
22473 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
22475 tmpl
= TREE_OPERAND (target
, 0);
22476 args
= TREE_OPERAND (target
, 1);
22478 else if (VAR_P (target
))
22480 tree tinfo
= DECL_TEMPLATE_INFO (target
);
22481 tmpl
= TI_TEMPLATE (tinfo
);
22482 args
= TI_ARGS (tinfo
);
22485 gcc_unreachable ();
22487 tree main_tmpl
= most_general_template (tmpl
);
22489 /* For determining which partial specialization to use, only the
22490 innermost args are interesting. */
22491 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
22493 outer_args
= strip_innermost_template_args (args
, 1);
22494 args
= INNERMOST_TEMPLATE_ARGS (args
);
22497 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
22500 tree spec_tmpl
= TREE_VALUE (t
);
22504 /* Substitute in the template args from the enclosing class. */
22505 ++processing_template_decl
;
22506 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
22507 --processing_template_decl
;
22510 if (spec_tmpl
== error_mark_node
)
22511 return error_mark_node
;
22513 spec_args
= get_partial_spec_bindings (tmpl
, spec_tmpl
, args
);
22517 spec_args
= add_to_template_args (outer_args
, spec_args
);
22519 /* Keep the candidate only if the constraints are satisfied,
22520 or if we're not compiling with concepts. */
22522 || constraints_satisfied_p (spec_tmpl
, spec_args
))
22524 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
22525 TREE_TYPE (list
) = TREE_TYPE (t
);
22533 ambiguous_p
= false;
22536 t
= TREE_CHAIN (t
);
22537 for (; t
; t
= TREE_CHAIN (t
))
22539 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
22546 t
= TREE_CHAIN (t
);
22549 ambiguous_p
= true;
22558 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
22560 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
22563 ambiguous_p
= true;
22571 char *spaces
= NULL
;
22572 if (!(complain
& tf_error
))
22573 return error_mark_node
;
22574 if (TYPE_P (target
))
22575 error ("ambiguous template instantiation for %q#T", target
);
22577 error ("ambiguous template instantiation for %q#D", target
);
22578 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
22579 for (t
= list
; t
; t
= TREE_CHAIN (t
))
22581 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
22582 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
22583 "%s %#qS", spaces
? spaces
: str
, subst
);
22584 spaces
= spaces
? spaces
: get_spaces (str
);
22587 return error_mark_node
;
22593 /* Explicitly instantiate DECL. */
22596 do_decl_instantiation (tree decl
, tree storage
)
22598 tree result
= NULL_TREE
;
22601 if (!decl
|| decl
== error_mark_node
)
22602 /* An error occurred, for which grokdeclarator has already issued
22603 an appropriate message. */
22605 else if (! DECL_LANG_SPECIFIC (decl
))
22607 error ("explicit instantiation of non-template %q#D", decl
);
22611 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
22612 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
22614 if (VAR_P (decl
) && !var_templ
)
22616 /* There is an asymmetry here in the way VAR_DECLs and
22617 FUNCTION_DECLs are handled by grokdeclarator. In the case of
22618 the latter, the DECL we get back will be marked as a
22619 template instantiation, and the appropriate
22620 DECL_TEMPLATE_INFO will be set up. This does not happen for
22621 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
22622 should handle VAR_DECLs as it currently handles
22624 if (!DECL_CLASS_SCOPE_P (decl
))
22626 error ("%qD is not a static data member of a class template", decl
);
22629 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
22630 if (!result
|| !VAR_P (result
))
22632 error ("no matching template for %qD found", decl
);
22635 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
22637 error ("type %qT for explicit instantiation %qD does not match "
22638 "declared type %qT", TREE_TYPE (result
), decl
,
22643 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
22645 error ("explicit instantiation of %q#D", decl
);
22651 /* Check for various error cases. Note that if the explicit
22652 instantiation is valid the RESULT will currently be marked as an
22653 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
22654 until we get here. */
22656 if (DECL_TEMPLATE_SPECIALIZATION (result
))
22658 /* DR 259 [temp.spec].
22660 Both an explicit instantiation and a declaration of an explicit
22661 specialization shall not appear in a program unless the explicit
22662 instantiation follows a declaration of the explicit specialization.
22664 For a given set of template parameters, if an explicit
22665 instantiation of a template appears after a declaration of an
22666 explicit specialization for that template, the explicit
22667 instantiation has no effect. */
22670 else if (DECL_EXPLICIT_INSTANTIATION (result
))
22674 No program shall explicitly instantiate any template more
22677 We check DECL_NOT_REALLY_EXTERN so as not to complain when
22678 the first instantiation was `extern' and the second is not,
22679 and EXTERN_P for the opposite case. */
22680 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
22681 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
22682 /* If an "extern" explicit instantiation follows an ordinary
22683 explicit instantiation, the template is instantiated. */
22687 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
22689 error ("no matching template for %qD found", result
);
22692 else if (!DECL_TEMPLATE_INFO (result
))
22694 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
22698 if (storage
== NULL_TREE
)
22700 else if (storage
== ridpointers
[(int) RID_EXTERN
])
22702 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
22703 pedwarn (input_location
, OPT_Wpedantic
,
22704 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
22709 error ("storage class %qD applied to template instantiation", storage
);
22711 check_explicit_instantiation_namespace (result
);
22712 mark_decl_instantiated (result
, extern_p
);
22714 instantiate_decl (result
, /*defer_ok=*/true,
22715 /*expl_inst_class_mem_p=*/false);
22719 mark_class_instantiated (tree t
, int extern_p
)
22721 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
22722 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
22723 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
22724 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
22727 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
22728 rest_of_type_compilation (t
, 1);
22732 /* Called from do_type_instantiation through binding_table_foreach to
22733 do recursive instantiation for the type bound in ENTRY. */
22735 bt_instantiate_type_proc (binding_entry entry
, void *data
)
22737 tree storage
= *(tree
*) data
;
22739 if (MAYBE_CLASS_TYPE_P (entry
->type
)
22740 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
22741 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
22744 /* Perform an explicit instantiation of template class T. STORAGE, if
22745 non-null, is the RID for extern, inline or static. COMPLAIN is
22746 nonzero if this is called from the parser, zero if called recursively,
22747 since the standard is unclear (as detailed below). */
22750 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
22755 int previous_instantiation_extern_p
= 0;
22757 if (TREE_CODE (t
) == TYPE_DECL
)
22760 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
22763 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
22765 error ("explicit instantiation of non-class template %qD", tmpl
);
22767 error ("explicit instantiation of non-template type %qT", t
);
22773 if (!COMPLETE_TYPE_P (t
))
22775 if (complain
& tf_error
)
22776 error ("explicit instantiation of %q#T before definition of template",
22781 if (storage
!= NULL_TREE
)
22783 if (!in_system_header_at (input_location
))
22785 if (storage
== ridpointers
[(int) RID_EXTERN
])
22787 if (cxx_dialect
== cxx98
)
22788 pedwarn (input_location
, OPT_Wpedantic
,
22789 "ISO C++ 1998 forbids the use of %<extern%> on "
22790 "explicit instantiations");
22793 pedwarn (input_location
, OPT_Wpedantic
,
22794 "ISO C++ forbids the use of %qE"
22795 " on explicit instantiations", storage
);
22798 if (storage
== ridpointers
[(int) RID_INLINE
])
22800 else if (storage
== ridpointers
[(int) RID_EXTERN
])
22802 else if (storage
== ridpointers
[(int) RID_STATIC
])
22806 error ("storage class %qD applied to template instantiation",
22812 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
22814 /* DR 259 [temp.spec].
22816 Both an explicit instantiation and a declaration of an explicit
22817 specialization shall not appear in a program unless the explicit
22818 instantiation follows a declaration of the explicit specialization.
22820 For a given set of template parameters, if an explicit
22821 instantiation of a template appears after a declaration of an
22822 explicit specialization for that template, the explicit
22823 instantiation has no effect. */
22826 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
22830 No program shall explicitly instantiate any template more
22833 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
22834 instantiation was `extern'. If EXTERN_P then the second is.
22835 These cases are OK. */
22836 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
22838 if (!previous_instantiation_extern_p
&& !extern_p
22839 && (complain
& tf_error
))
22840 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
22842 /* If we've already instantiated the template, just return now. */
22843 if (!CLASSTYPE_INTERFACE_ONLY (t
))
22847 check_explicit_instantiation_namespace (TYPE_NAME (t
));
22848 mark_class_instantiated (t
, extern_p
);
22853 /* In contrast to implicit instantiation, where only the
22854 declarations, and not the definitions, of members are
22855 instantiated, we have here:
22859 The explicit instantiation of a class template specialization
22860 implies the instantiation of all of its members not
22861 previously explicitly specialized in the translation unit
22862 containing the explicit instantiation.
22864 Of course, we can't instantiate member template classes, since we
22865 don't have any arguments for them. Note that the standard is
22866 unclear on whether the instantiation of the members are
22867 *explicit* instantiations or not. However, the most natural
22868 interpretation is that it should be an explicit
22870 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= DECL_CHAIN (fld
))
22872 || (TREE_CODE (fld
) == FUNCTION_DECL
22874 && user_provided_p (fld
)))
22875 && DECL_TEMPLATE_INSTANTIATION (fld
))
22877 mark_decl_instantiated (fld
, extern_p
);
22879 instantiate_decl (fld
, /*defer_ok=*/true,
22880 /*expl_inst_class_mem_p=*/true);
22883 if (CLASSTYPE_NESTED_UTDS (t
))
22884 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
22885 bt_instantiate_type_proc
, &storage
);
22888 /* Given a function DECL, which is a specialization of TMPL, modify
22889 DECL to be a re-instantiation of TMPL with the same template
22890 arguments. TMPL should be the template into which tsubst'ing
22891 should occur for DECL, not the most general template.
22893 One reason for doing this is a scenario like this:
22896 void f(const T&, int i);
22898 void g() { f(3, 7); }
22901 void f(const T& t, const int i) { }
22903 Note that when the template is first instantiated, with
22904 instantiate_template, the resulting DECL will have no name for the
22905 first parameter, and the wrong type for the second. So, when we go
22906 to instantiate the DECL, we regenerate it. */
22909 regenerate_decl_from_template (tree decl
, tree tmpl
, tree args
)
22911 /* The arguments used to instantiate DECL, from the most general
22915 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
22917 /* Make sure that we can see identifiers, and compute access
22919 push_access_scope (decl
);
22921 if (TREE_CODE (decl
) == FUNCTION_DECL
)
22929 args_depth
= TMPL_ARGS_DEPTH (args
);
22930 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
22931 if (args_depth
> parms_depth
)
22932 args
= get_innermost_template_args (args
, parms_depth
);
22934 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
22935 args
, tf_error
, NULL_TREE
,
22936 /*defer_ok*/false);
22937 if (specs
&& specs
!= error_mark_node
)
22938 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
22941 /* Merge parameter declarations. */
22942 decl_parm
= skip_artificial_parms_for (decl
,
22943 DECL_ARGUMENTS (decl
));
22945 = skip_artificial_parms_for (code_pattern
,
22946 DECL_ARGUMENTS (code_pattern
));
22947 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
22952 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
22953 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
22954 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
22956 parm_type
= type_decays_to (parm_type
);
22957 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
22958 TREE_TYPE (decl_parm
) = parm_type
;
22959 attributes
= DECL_ATTRIBUTES (pattern_parm
);
22960 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
22962 DECL_ATTRIBUTES (decl_parm
) = attributes
;
22963 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
22965 decl_parm
= DECL_CHAIN (decl_parm
);
22966 pattern_parm
= DECL_CHAIN (pattern_parm
);
22968 /* Merge any parameters that match with the function parameter
22970 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
22973 tree expanded_types
;
22974 /* Expand the TYPE_PACK_EXPANSION that provides the types for
22975 the parameters in this function parameter pack. */
22976 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
22977 args
, tf_error
, NULL_TREE
);
22978 len
= TREE_VEC_LENGTH (expanded_types
);
22979 for (i
= 0; i
< len
; i
++)
22984 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
22985 /* Rename the parameter to include the index. */
22986 DECL_NAME (decl_parm
) =
22987 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
22988 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
22989 parm_type
= type_decays_to (parm_type
);
22990 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
22991 TREE_TYPE (decl_parm
) = parm_type
;
22992 attributes
= DECL_ATTRIBUTES (pattern_parm
);
22993 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
22995 DECL_ATTRIBUTES (decl_parm
) = attributes
;
22996 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
22998 decl_parm
= DECL_CHAIN (decl_parm
);
23001 /* Merge additional specifiers from the CODE_PATTERN. */
23002 if (DECL_DECLARED_INLINE_P (code_pattern
)
23003 && !DECL_DECLARED_INLINE_P (decl
))
23004 DECL_DECLARED_INLINE_P (decl
) = 1;
23006 else if (VAR_P (decl
))
23008 start_lambda_scope (decl
);
23009 DECL_INITIAL (decl
) =
23010 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
23011 tf_error
, DECL_TI_TEMPLATE (decl
),
23012 /*integral_constant_expression_p=*/false);
23013 finish_lambda_scope ();
23014 if (VAR_HAD_UNKNOWN_BOUND (decl
))
23015 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
23016 tf_error
, DECL_TI_TEMPLATE (decl
));
23019 gcc_unreachable ();
23021 pop_access_scope (decl
);
23024 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
23025 substituted to get DECL. */
23028 template_for_substitution (tree decl
)
23030 tree tmpl
= DECL_TI_TEMPLATE (decl
);
23032 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
23033 for the instantiation. This is not always the most general
23034 template. Consider, for example:
23037 struct S { template <class U> void f();
23038 template <> void f<int>(); };
23040 and an instantiation of S<double>::f<int>. We want TD to be the
23041 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
23042 while (/* An instantiation cannot have a definition, so we need a
23043 more general template. */
23044 DECL_TEMPLATE_INSTANTIATION (tmpl
)
23045 /* We must also deal with friend templates. Given:
23047 template <class T> struct S {
23048 template <class U> friend void f() {};
23051 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
23052 so far as the language is concerned, but that's still
23053 where we get the pattern for the instantiation from. On
23054 other hand, if the definition comes outside the class, say:
23056 template <class T> struct S {
23057 template <class U> friend void f();
23059 template <class U> friend void f() {}
23061 we don't need to look any further. That's what the check for
23062 DECL_INITIAL is for. */
23063 || (TREE_CODE (decl
) == FUNCTION_DECL
23064 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
23065 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
23067 /* The present template, TD, should not be a definition. If it
23068 were a definition, we should be using it! Note that we
23069 cannot restructure the loop to just keep going until we find
23070 a template with a definition, since that might go too far if
23071 a specialization was declared, but not defined. */
23073 /* Fetch the more general template. */
23074 tmpl
= DECL_TI_TEMPLATE (tmpl
);
23080 /* Returns true if we need to instantiate this template instance even if we
23081 know we aren't going to emit it. */
23084 always_instantiate_p (tree decl
)
23086 /* We always instantiate inline functions so that we can inline them. An
23087 explicit instantiation declaration prohibits implicit instantiation of
23088 non-inline functions. With high levels of optimization, we would
23089 normally inline non-inline functions -- but we're not allowed to do
23090 that for "extern template" functions. Therefore, we check
23091 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
23092 return ((TREE_CODE (decl
) == FUNCTION_DECL
23093 && (DECL_DECLARED_INLINE_P (decl
)
23094 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
23095 /* And we need to instantiate static data members so that
23096 their initializers are available in integral constant
23099 && decl_maybe_constant_var_p (decl
)));
23102 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
23103 instantiate it now, modifying TREE_TYPE (fn). Returns false on
23104 error, true otherwise. */
23107 maybe_instantiate_noexcept (tree fn
, tsubst_flags_t complain
)
23109 tree fntype
, spec
, noex
, clone
;
23111 /* Don't instantiate a noexcept-specification from template context. */
23112 if (processing_template_decl
)
23115 if (DECL_CLONED_FUNCTION_P (fn
))
23116 fn
= DECL_CLONED_FUNCTION (fn
);
23117 fntype
= TREE_TYPE (fn
);
23118 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
23120 if (!spec
|| !TREE_PURPOSE (spec
))
23123 noex
= TREE_PURPOSE (spec
);
23125 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
23127 static hash_set
<tree
>* fns
= new hash_set
<tree
>;
23128 bool added
= false;
23129 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
23130 spec
= get_defaulted_eh_spec (fn
, complain
);
23131 else if (!(added
= !fns
->add (fn
)))
23133 /* If hash_set::add returns true, the element was already there. */
23134 location_t loc
= EXPR_LOC_OR_LOC (DEFERRED_NOEXCEPT_PATTERN (noex
),
23135 DECL_SOURCE_LOCATION (fn
));
23137 "exception specification of %qD depends on itself",
23139 spec
= noexcept_false_spec
;
23141 else if (push_tinst_level (fn
))
23143 push_access_scope (fn
);
23144 push_deferring_access_checks (dk_no_deferred
);
23145 input_location
= DECL_SOURCE_LOCATION (fn
);
23146 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
23147 DEFERRED_NOEXCEPT_ARGS (noex
),
23148 tf_warning_or_error
, fn
,
23149 /*function_p=*/false,
23150 /*integral_constant_expression_p=*/true);
23151 pop_deferring_access_checks ();
23152 pop_access_scope (fn
);
23153 pop_tinst_level ();
23154 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
23155 if (spec
== error_mark_node
)
23156 spec
= noexcept_false_spec
;
23159 spec
= noexcept_false_spec
;
23164 if (spec
== error_mark_node
)
23167 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
23170 FOR_EACH_CLONE (clone
, fn
)
23172 if (TREE_TYPE (clone
) == fntype
)
23173 TREE_TYPE (clone
) = TREE_TYPE (fn
);
23175 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
23181 /* We're starting to process the function INST, an instantiation of PATTERN;
23182 add their parameters to local_specializations. */
23185 register_parameter_specializations (tree pattern
, tree inst
)
23187 tree tmpl_parm
= DECL_ARGUMENTS (pattern
);
23188 tree spec_parm
= DECL_ARGUMENTS (inst
);
23189 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (inst
))
23191 register_local_specialization (spec_parm
, tmpl_parm
);
23192 spec_parm
= skip_artificial_parms_for (inst
, spec_parm
);
23193 tmpl_parm
= skip_artificial_parms_for (pattern
, tmpl_parm
);
23195 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
23197 if (!DECL_PACK_P (tmpl_parm
))
23199 register_local_specialization (spec_parm
, tmpl_parm
);
23200 spec_parm
= DECL_CHAIN (spec_parm
);
23204 /* Register the (value) argument pack as a specialization of
23205 TMPL_PARM, then move on. */
23206 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
23207 register_local_specialization (argpack
, tmpl_parm
);
23210 gcc_assert (!spec_parm
);
23213 /* Produce the definition of D, a _DECL generated from a template. If
23214 DEFER_OK is true, then we don't have to actually do the
23215 instantiation now; we just have to do it sometime. Normally it is
23216 an error if this is an explicit instantiation but D is undefined.
23217 EXPL_INST_CLASS_MEM_P is true iff D is a member of an explicitly
23218 instantiated class template. */
23221 instantiate_decl (tree d
, bool defer_ok
, bool expl_inst_class_mem_p
)
23223 tree tmpl
= DECL_TI_TEMPLATE (d
);
23230 bool pattern_defined
;
23231 location_t saved_loc
= input_location
;
23232 int saved_unevaluated_operand
= cp_unevaluated_operand
;
23233 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
23237 /* This function should only be used to instantiate templates for
23238 functions and static member variables. */
23239 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
23241 /* A concept is never instantiated. */
23242 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
23244 /* Variables are never deferred; if instantiation is required, they
23245 are instantiated right away. That allows for better code in the
23246 case that an expression refers to the value of the variable --
23247 if the variable has a constant value the referring expression can
23248 take advantage of that fact. */
23252 /* Don't instantiate cloned functions. Instead, instantiate the
23253 functions they cloned. */
23254 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
23255 d
= DECL_CLONED_FUNCTION (d
);
23257 if (DECL_TEMPLATE_INSTANTIATED (d
)
23258 || (TREE_CODE (d
) == FUNCTION_DECL
23259 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
23260 || DECL_TEMPLATE_SPECIALIZATION (d
))
23261 /* D has already been instantiated or explicitly specialized, so
23262 there's nothing for us to do here.
23264 It might seem reasonable to check whether or not D is an explicit
23265 instantiation, and, if so, stop here. But when an explicit
23266 instantiation is deferred until the end of the compilation,
23267 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
23268 the instantiation. */
23271 /* Check to see whether we know that this template will be
23272 instantiated in some other file, as with "extern template"
23274 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
23276 /* In general, we do not instantiate such templates. */
23277 if (external_p
&& !always_instantiate_p (d
))
23280 gen_tmpl
= most_general_template (tmpl
);
23281 gen_args
= DECL_TI_ARGS (d
);
23283 if (tmpl
!= gen_tmpl
)
23284 /* We should already have the extra args. */
23285 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
23286 == TMPL_ARGS_DEPTH (gen_args
));
23287 /* And what's in the hash table should match D. */
23288 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
23289 || spec
== NULL_TREE
);
23291 /* This needs to happen before any tsubsting. */
23292 if (! push_tinst_level (d
))
23295 timevar_push (TV_TEMPLATE_INST
);
23297 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
23298 for the instantiation. */
23299 td
= template_for_substitution (d
);
23304 /* Look up an explicit specialization, if any. */
23305 tree tid
= lookup_template_variable (gen_tmpl
, gen_args
);
23306 tree elt
= most_specialized_partial_spec (tid
, tf_warning_or_error
);
23307 if (elt
&& elt
!= error_mark_node
)
23309 td
= TREE_VALUE (elt
);
23310 args
= TREE_PURPOSE (elt
);
23314 code_pattern
= DECL_TEMPLATE_RESULT (td
);
23316 /* We should never be trying to instantiate a member of a class
23317 template or partial specialization. */
23318 gcc_assert (d
!= code_pattern
);
23320 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
23321 || DECL_TEMPLATE_SPECIALIZATION (td
))
23322 /* In the case of a friend template whose definition is provided
23323 outside the class, we may have too many arguments. Drop the
23324 ones we don't need. The same is true for specializations. */
23325 args
= get_innermost_template_args
23326 (args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
23328 if (TREE_CODE (d
) == FUNCTION_DECL
)
23330 deleted_p
= DECL_DELETED_FN (code_pattern
);
23331 pattern_defined
= ((DECL_SAVED_TREE (code_pattern
) != NULL_TREE
23332 && DECL_INITIAL (code_pattern
) != error_mark_node
)
23333 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
23339 if (DECL_CLASS_SCOPE_P (code_pattern
))
23340 pattern_defined
= (! DECL_IN_AGGR_P (code_pattern
)
23341 || DECL_INLINE_VAR_P (code_pattern
));
23343 pattern_defined
= ! DECL_EXTERNAL (code_pattern
);
23346 /* We may be in the middle of deferred access check. Disable it now. */
23347 push_deferring_access_checks (dk_no_deferred
);
23349 /* Unless an explicit instantiation directive has already determined
23350 the linkage of D, remember that a definition is available for
23352 if (pattern_defined
23353 && !DECL_INTERFACE_KNOWN (d
)
23354 && !DECL_NOT_REALLY_EXTERN (d
))
23355 mark_definable (d
);
23357 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
23358 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
23359 input_location
= DECL_SOURCE_LOCATION (d
);
23361 /* If D is a member of an explicitly instantiated class template,
23362 and no definition is available, treat it like an implicit
23364 if (!pattern_defined
&& expl_inst_class_mem_p
23365 && DECL_EXPLICIT_INSTANTIATION (d
))
23367 /* Leave linkage flags alone on instantiations with anonymous
23369 if (TREE_PUBLIC (d
))
23371 DECL_NOT_REALLY_EXTERN (d
) = 0;
23372 DECL_INTERFACE_KNOWN (d
) = 0;
23374 SET_DECL_IMPLICIT_INSTANTIATION (d
);
23377 /* Defer all other templates, unless we have been explicitly
23378 forbidden from doing so. */
23379 if (/* If there is no definition, we cannot instantiate the
23382 /* If it's OK to postpone instantiation, do so. */
23384 /* If this is a static data member that will be defined
23385 elsewhere, we don't want to instantiate the entire data
23386 member, but we do want to instantiate the initializer so that
23387 we can substitute that elsewhere. */
23388 || (external_p
&& VAR_P (d
))
23389 /* Handle here a deleted function too, avoid generating
23390 its body (c++/61080). */
23393 /* The definition of the static data member is now required so
23394 we must substitute the initializer. */
23396 && !DECL_INITIAL (d
)
23397 && DECL_INITIAL (code_pattern
))
23401 bool const_init
= false;
23402 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
23404 ns
= decl_namespace_context (d
);
23405 push_nested_namespace (ns
);
23407 push_nested_class (DECL_CONTEXT (d
));
23408 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
23410 tf_warning_or_error
, NULL_TREE
,
23411 /*integral_constant_expression_p=*/false);
23412 /* If instantiating the initializer involved instantiating this
23413 again, don't call cp_finish_decl twice. */
23414 if (!DECL_INITIAL (d
))
23416 /* Make sure the initializer is still constant, in case of
23417 circular dependency (template/instantiate6.C). */
23419 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
23420 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
23421 /*asmspec_tree=*/NULL_TREE
,
23422 LOOKUP_ONLYCONVERTING
);
23425 pop_nested_class ();
23426 pop_nested_namespace (ns
);
23429 /* We restore the source position here because it's used by
23430 add_pending_template. */
23431 input_location
= saved_loc
;
23433 if (at_eof
&& !pattern_defined
23434 && DECL_EXPLICIT_INSTANTIATION (d
)
23435 && DECL_NOT_REALLY_EXTERN (d
))
23438 The definition of a non-exported function template, a
23439 non-exported member function template, or a non-exported
23440 member function or static data member of a class template
23441 shall be present in every translation unit in which it is
23442 explicitly instantiated. */
23443 permerror (input_location
, "explicit instantiation of %qD "
23444 "but no definition available", d
);
23446 /* If we're in unevaluated context, we just wanted to get the
23447 constant value; this isn't an odr use, so don't queue
23448 a full instantiation. */
23449 if (cp_unevaluated_operand
!= 0)
23451 /* ??? Historically, we have instantiated inline functions, even
23452 when marked as "extern template". */
23453 if (!(external_p
&& VAR_P (d
)))
23454 add_pending_template (d
);
23457 /* Tell the repository that D is available in this translation unit
23458 -- and see if it is supposed to be instantiated here. */
23459 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
23461 /* In a PCH file, despite the fact that the repository hasn't
23462 requested instantiation in the PCH it is still possible that
23463 an instantiation will be required in a file that includes the
23466 add_pending_template (d
);
23467 /* Instantiate inline functions so that the inliner can do its
23468 job, even though we'll not be emitting a copy of this
23470 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
23474 bool push_to_top
, nested
;
23476 fn_context
= decl_function_context (d
);
23477 if (LAMBDA_FUNCTION_P (d
))
23478 /* tsubst_lambda_expr resolved any references to enclosing functions. */
23479 fn_context
= NULL_TREE
;
23480 nested
= current_function_decl
!= NULL_TREE
;
23481 push_to_top
= !(nested
&& fn_context
== current_function_decl
);
23483 vec
<tree
> omp_privatization_save
;
23485 save_omp_privatization_clauses (omp_privatization_save
);
23488 push_to_top_level ();
23491 push_function_context ();
23492 cp_unevaluated_operand
= 0;
23493 c_inhibit_evaluation_warnings
= 0;
23496 /* Mark D as instantiated so that recursive calls to
23497 instantiate_decl do not try to instantiate it again. */
23498 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
23500 /* Regenerate the declaration in case the template has been modified
23501 by a subsequent redeclaration. */
23502 regenerate_decl_from_template (d
, td
, args
);
23504 /* We already set the file and line above. Reset them now in case
23505 they changed as a result of calling regenerate_decl_from_template. */
23506 input_location
= DECL_SOURCE_LOCATION (d
);
23511 bool const_init
= false;
23513 /* Clear out DECL_RTL; whatever was there before may not be right
23514 since we've reset the type of the declaration. */
23515 SET_DECL_RTL (d
, NULL
);
23516 DECL_IN_AGGR_P (d
) = 0;
23518 /* The initializer is placed in DECL_INITIAL by
23519 regenerate_decl_from_template so we don't need to
23520 push/pop_access_scope again here. Pull it out so that
23521 cp_finish_decl can process it. */
23522 init
= DECL_INITIAL (d
);
23523 DECL_INITIAL (d
) = NULL_TREE
;
23524 DECL_INITIALIZED_P (d
) = 0;
23526 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
23527 initializer. That function will defer actual emission until
23528 we have a chance to determine linkage. */
23529 DECL_EXTERNAL (d
) = 0;
23531 /* Enter the scope of D so that access-checking works correctly. */
23532 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
23534 push_nested_class (DECL_CONTEXT (d
));
23536 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
23537 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
23540 pop_nested_class ();
23542 if (variable_template_p (gen_tmpl
))
23543 note_variable_template_instantiation (d
);
23545 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
23546 synthesize_method (d
);
23547 else if (TREE_CODE (d
) == FUNCTION_DECL
)
23549 /* Set up the list of local specializations. */
23550 local_specialization_stack
lss (push_to_top
? lss_blank
: lss_copy
);
23551 tree block
= NULL_TREE
;
23553 /* Set up context. */
23554 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
23555 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
23556 block
= push_stmt_list ();
23558 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
23560 /* Some typedefs referenced from within the template code need to be
23561 access checked at template instantiation time, i.e now. These
23562 types were added to the template at parsing time. Let's get those
23563 and perform the access checks then. */
23564 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (td
),
23567 /* Create substitution entries for the parameters. */
23568 register_parameter_specializations (code_pattern
, d
);
23570 /* Substitute into the body of the function. */
23571 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
23572 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
23573 tf_warning_or_error
, tmpl
);
23576 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
23577 tf_warning_or_error
, tmpl
,
23578 /*integral_constant_expression_p=*/false);
23580 /* Set the current input_location to the end of the function
23581 so that finish_function knows where we are. */
23583 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
23585 /* Remember if we saw an infinite loop in the template. */
23586 current_function_infinite_loop
23587 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
23590 /* Finish the function. */
23591 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
23592 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
23593 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
23596 d
= finish_function (/*inline_p=*/false);
23597 expand_or_defer_fn (d
);
23600 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
23601 cp_check_omp_declare_reduction (d
);
23604 /* We're not deferring instantiation any more. */
23605 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
23608 pop_from_top_level ();
23610 pop_function_context ();
23613 restore_omp_privatization_clauses (omp_privatization_save
);
23616 pop_deferring_access_checks ();
23617 timevar_pop (TV_TEMPLATE_INST
);
23618 pop_tinst_level ();
23619 input_location
= saved_loc
;
23620 cp_unevaluated_operand
= saved_unevaluated_operand
;
23621 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
23626 /* Run through the list of templates that we wish we could
23627 instantiate, and instantiate any we can. RETRIES is the
23628 number of times we retry pending template instantiation. */
23631 instantiate_pending_templates (int retries
)
23634 location_t saved_loc
= input_location
;
23636 /* Instantiating templates may trigger vtable generation. This in turn
23637 may require further template instantiations. We place a limit here
23638 to avoid infinite loop. */
23639 if (pending_templates
&& retries
>= max_tinst_depth
)
23641 tree decl
= pending_templates
->tinst
->decl
;
23643 fatal_error (input_location
,
23644 "template instantiation depth exceeds maximum of %d"
23645 " instantiating %q+D, possibly from virtual table generation"
23646 " (use -ftemplate-depth= to increase the maximum)",
23647 max_tinst_depth
, decl
);
23648 if (TREE_CODE (decl
) == FUNCTION_DECL
)
23649 /* Pretend that we defined it. */
23650 DECL_INITIAL (decl
) = error_mark_node
;
23656 struct pending_template
**t
= &pending_templates
;
23657 struct pending_template
*last
= NULL
;
23661 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
23662 bool complete
= false;
23664 if (TYPE_P (instantiation
))
23666 if (!COMPLETE_TYPE_P (instantiation
))
23668 instantiate_class_template (instantiation
);
23669 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
23670 for (tree fld
= TYPE_FIELDS (instantiation
);
23671 fld
; fld
= TREE_CHAIN (fld
))
23673 || (TREE_CODE (fld
) == FUNCTION_DECL
23674 && !DECL_ARTIFICIAL (fld
)))
23675 && DECL_TEMPLATE_INSTANTIATION (fld
))
23676 instantiate_decl (fld
,
23677 /*defer_ok=*/false,
23678 /*expl_inst_class_mem_p=*/false);
23680 if (COMPLETE_TYPE_P (instantiation
))
23684 complete
= COMPLETE_TYPE_P (instantiation
);
23688 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
23689 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
23692 = instantiate_decl (instantiation
,
23693 /*defer_ok=*/false,
23694 /*expl_inst_class_mem_p=*/false);
23695 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
23699 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
23700 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
23704 /* If INSTANTIATION has been instantiated, then we don't
23705 need to consider it again in the future. */
23713 current_tinst_level
= NULL
;
23715 last_pending_template
= last
;
23717 while (reconsider
);
23719 input_location
= saved_loc
;
23722 /* Substitute ARGVEC into T, which is a list of initializers for
23723 either base class or a non-static data member. The TREE_PURPOSEs
23724 are DECLs, and the TREE_VALUEs are the initializer values. Used by
23725 instantiate_decl. */
23728 tsubst_initializer_list (tree t
, tree argvec
)
23730 tree inits
= NULL_TREE
;
23731 tree target_ctor
= error_mark_node
;
23733 for (; t
; t
= TREE_CHAIN (t
))
23737 tree expanded_bases
= NULL_TREE
;
23738 tree expanded_arguments
= NULL_TREE
;
23741 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
23746 /* Expand the base class expansion type into separate base
23748 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
23749 tf_warning_or_error
,
23751 if (expanded_bases
== error_mark_node
)
23754 /* We'll be building separate TREE_LISTs of arguments for
23756 len
= TREE_VEC_LENGTH (expanded_bases
);
23757 expanded_arguments
= make_tree_vec (len
);
23758 for (i
= 0; i
< len
; i
++)
23759 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
23761 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
23762 expand each argument in the TREE_VALUE of t. */
23763 expr
= make_node (EXPR_PACK_EXPANSION
);
23764 PACK_EXPANSION_LOCAL_P (expr
) = true;
23765 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
23766 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
23768 if (TREE_VALUE (t
) == void_type_node
)
23769 /* VOID_TYPE_NODE is used to indicate
23770 value-initialization. */
23772 for (i
= 0; i
< len
; i
++)
23773 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
23777 /* Substitute parameter packs into each argument in the
23779 in_base_initializer
= 1;
23780 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
23782 tree expanded_exprs
;
23784 /* Expand the argument. */
23785 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
23787 = tsubst_pack_expansion (expr
, argvec
,
23788 tf_warning_or_error
,
23790 if (expanded_exprs
== error_mark_node
)
23793 /* Prepend each of the expanded expressions to the
23794 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
23795 for (i
= 0; i
< len
; i
++)
23797 TREE_VEC_ELT (expanded_arguments
, i
) =
23798 tree_cons (NULL_TREE
,
23799 TREE_VEC_ELT (expanded_exprs
, i
),
23800 TREE_VEC_ELT (expanded_arguments
, i
));
23803 in_base_initializer
= 0;
23805 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
23806 since we built them backwards. */
23807 for (i
= 0; i
< len
; i
++)
23809 TREE_VEC_ELT (expanded_arguments
, i
) =
23810 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
23815 for (i
= 0; i
< len
; ++i
)
23817 if (expanded_bases
)
23819 decl
= TREE_VEC_ELT (expanded_bases
, i
);
23820 decl
= expand_member_init (decl
);
23821 init
= TREE_VEC_ELT (expanded_arguments
, i
);
23826 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
23827 tf_warning_or_error
, NULL_TREE
);
23829 decl
= expand_member_init (decl
);
23830 if (decl
&& !DECL_P (decl
))
23831 in_base_initializer
= 1;
23833 init
= TREE_VALUE (t
);
23835 if (init
!= void_type_node
)
23836 init
= tsubst_expr (init
, argvec
,
23837 tf_warning_or_error
, NULL_TREE
,
23838 /*integral_constant_expression_p=*/false);
23839 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
23840 /* If we had an initializer but it instantiated to nothing,
23841 value-initialize the object. This will only occur when
23842 the initializer was a pack expansion where the parameter
23843 packs used in that expansion were of length zero. */
23844 init
= void_type_node
;
23845 in_base_initializer
= 0;
23848 if (target_ctor
!= error_mark_node
23849 && init
!= error_mark_node
)
23851 error ("mem-initializer for %qD follows constructor delegation",
23855 /* Look for a target constructor. */
23856 if (init
!= error_mark_node
23857 && decl
&& CLASS_TYPE_P (decl
)
23858 && same_type_p (decl
, current_class_type
))
23860 maybe_warn_cpp0x (CPP0X_DELEGATING_CTORS
);
23863 error ("constructor delegation follows mem-initializer for %qD",
23864 TREE_PURPOSE (inits
));
23867 target_ctor
= init
;
23872 init
= build_tree_list (decl
, init
);
23873 TREE_CHAIN (init
) = inits
;
23881 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
23884 set_current_access_from_decl (tree decl
)
23886 if (TREE_PRIVATE (decl
))
23887 current_access_specifier
= access_private_node
;
23888 else if (TREE_PROTECTED (decl
))
23889 current_access_specifier
= access_protected_node
;
23891 current_access_specifier
= access_public_node
;
23894 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
23895 is the instantiation (which should have been created with
23896 start_enum) and ARGS are the template arguments to use. */
23899 tsubst_enum (tree tag
, tree newtag
, tree args
)
23903 if (SCOPED_ENUM_P (newtag
))
23904 begin_scope (sk_scoped_enum
, newtag
);
23906 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
23911 decl
= TREE_VALUE (e
);
23912 /* Note that in a template enum, the TREE_VALUE is the
23913 CONST_DECL, not the corresponding INTEGER_CST. */
23914 value
= tsubst_expr (DECL_INITIAL (decl
),
23915 args
, tf_warning_or_error
, NULL_TREE
,
23916 /*integral_constant_expression_p=*/true);
23918 /* Give this enumeration constant the correct access. */
23919 set_current_access_from_decl (decl
);
23921 /* Actually build the enumerator itself. Here we're assuming that
23922 enumerators can't have dependent attributes. */
23923 build_enumerator (DECL_NAME (decl
), value
, newtag
,
23924 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
23927 if (SCOPED_ENUM_P (newtag
))
23930 finish_enum_value_list (newtag
);
23931 finish_enum (newtag
);
23933 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
23934 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
23937 /* DECL is a FUNCTION_DECL that is a template specialization. Return
23938 its type -- but without substituting the innermost set of template
23939 arguments. So, innermost set of template parameters will appear in
23943 get_mostly_instantiated_function_type (tree decl
)
23945 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
23946 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
23949 /* Return truthvalue if we're processing a template different from
23950 the last one involved in diagnostics. */
23952 problematic_instantiation_changed (void)
23954 return current_tinst_level
!= last_error_tinst_level
;
23957 /* Remember current template involved in diagnostics. */
23959 record_last_problematic_instantiation (void)
23961 last_error_tinst_level
= current_tinst_level
;
23964 struct tinst_level
*
23965 current_instantiation (void)
23967 return current_tinst_level
;
23970 /* Return TRUE if current_function_decl is being instantiated, false
23974 instantiating_current_function_p (void)
23976 return (current_instantiation ()
23977 && current_instantiation ()->decl
== current_function_decl
);
23980 /* [temp.param] Check that template non-type parm TYPE is of an allowable
23981 type. Return false for ok, true for disallowed. Issue error and
23982 inform messages under control of COMPLAIN. */
23985 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
23987 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
23989 else if (TYPE_PTR_P (type
))
23991 else if (TREE_CODE (type
) == REFERENCE_TYPE
23992 && !TYPE_REF_IS_RVALUE (type
))
23994 else if (TYPE_PTRMEM_P (type
))
23996 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
23998 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
24000 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
24002 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
24004 /* A bound template template parm could later be instantiated to have a valid
24005 nontype parm type via an alias template. */
24006 else if (cxx_dialect
>= cxx11
24007 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
24010 if (complain
& tf_error
)
24012 if (type
== error_mark_node
)
24013 inform (input_location
, "invalid template non-type parameter");
24015 error ("%q#T is not a valid type for a template non-type parameter",
24021 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
24022 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
24025 dependent_type_p_r (tree type
)
24031 A type is dependent if it is:
24033 -- a template parameter. Template template parameters are types
24034 for us (since TYPE_P holds true for them) so we handle
24036 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
24037 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
24039 /* -- a qualified-id with a nested-name-specifier which contains a
24040 class-name that names a dependent type or whose unqualified-id
24041 names a dependent type. */
24042 if (TREE_CODE (type
) == TYPENAME_TYPE
)
24045 /* An alias template specialization can be dependent even if the
24046 resulting type is not. */
24047 if (dependent_alias_template_spec_p (type
))
24050 /* -- a cv-qualified type where the cv-unqualified type is
24052 No code is necessary for this bullet; the code below handles
24053 cv-qualified types, and we don't want to strip aliases with
24054 TYPE_MAIN_VARIANT because of DR 1558. */
24055 /* -- a compound type constructed from any dependent type. */
24056 if (TYPE_PTRMEM_P (type
))
24057 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
24058 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
24060 else if (TYPE_PTR_P (type
)
24061 || TREE_CODE (type
) == REFERENCE_TYPE
)
24062 return dependent_type_p (TREE_TYPE (type
));
24063 else if (TREE_CODE (type
) == FUNCTION_TYPE
24064 || TREE_CODE (type
) == METHOD_TYPE
)
24068 if (dependent_type_p (TREE_TYPE (type
)))
24070 for (arg_type
= TYPE_ARG_TYPES (type
);
24072 arg_type
= TREE_CHAIN (arg_type
))
24073 if (dependent_type_p (TREE_VALUE (arg_type
)))
24075 if (cxx_dialect
>= cxx17
)
24076 /* A value-dependent noexcept-specifier makes the type dependent. */
24077 if (tree spec
= TYPE_RAISES_EXCEPTIONS (type
))
24078 if (tree noex
= TREE_PURPOSE (spec
))
24079 /* Treat DEFERRED_NOEXCEPT as non-dependent, since it doesn't
24080 affect overload resolution and treating it as dependent breaks
24082 if (TREE_CODE (noex
) != DEFERRED_NOEXCEPT
24083 && value_dependent_expression_p (noex
))
24087 /* -- an array type constructed from any dependent type or whose
24088 size is specified by a constant expression that is
24091 We checked for type- and value-dependence of the bounds in
24092 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
24093 if (TREE_CODE (type
) == ARRAY_TYPE
)
24095 if (TYPE_DOMAIN (type
)
24096 && dependent_type_p (TYPE_DOMAIN (type
)))
24098 return dependent_type_p (TREE_TYPE (type
));
24101 /* -- a template-id in which either the template name is a template
24103 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
24105 /* ... or any of the template arguments is a dependent type or
24106 an expression that is type-dependent or value-dependent. */
24107 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
24108 && (any_dependent_template_arguments_p
24109 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
24112 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
24113 dependent; if the argument of the `typeof' expression is not
24114 type-dependent, then it should already been have resolved. */
24115 if (TREE_CODE (type
) == TYPEOF_TYPE
24116 || TREE_CODE (type
) == DECLTYPE_TYPE
24117 || TREE_CODE (type
) == UNDERLYING_TYPE
)
24120 /* A template argument pack is dependent if any of its packed
24122 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
24124 tree args
= ARGUMENT_PACK_ARGS (type
);
24125 int i
, len
= TREE_VEC_LENGTH (args
);
24126 for (i
= 0; i
< len
; ++i
)
24127 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
24131 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
24132 be template parameters. */
24133 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
24136 if (any_dependent_type_attributes_p (TYPE_ATTRIBUTES (type
)))
24139 /* The standard does not specifically mention types that are local
24140 to template functions or local classes, but they should be
24141 considered dependent too. For example:
24143 template <int I> void f() {
24148 The size of `E' cannot be known until the value of `I' has been
24149 determined. Therefore, `E' must be considered dependent. */
24150 scope
= TYPE_CONTEXT (type
);
24151 if (scope
&& TYPE_P (scope
))
24152 return dependent_type_p (scope
);
24153 /* Don't use type_dependent_expression_p here, as it can lead
24154 to infinite recursion trying to determine whether a lambda
24155 nested in a lambda is dependent (c++/47687). */
24156 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
24157 && DECL_LANG_SPECIFIC (scope
)
24158 && DECL_TEMPLATE_INFO (scope
)
24159 && (any_dependent_template_arguments_p
24160 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
24163 /* Other types are non-dependent. */
24167 /* Returns TRUE if TYPE is dependent, in the sense of
24168 [temp.dep.type]. Note that a NULL type is considered dependent. */
24171 dependent_type_p (tree type
)
24173 /* If there are no template parameters in scope, then there can't be
24174 any dependent types. */
24175 if (!processing_template_decl
)
24177 /* If we are not processing a template, then nobody should be
24178 providing us with a dependent type. */
24180 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
24184 /* If the type is NULL, we have not computed a type for the entity
24185 in question; in that case, the type is dependent. */
24189 /* Erroneous types can be considered non-dependent. */
24190 if (type
== error_mark_node
)
24193 /* Getting here with global_type_node means we improperly called this
24194 function on the TREE_TYPE of an IDENTIFIER_NODE. */
24195 gcc_checking_assert (type
!= global_type_node
);
24197 /* If we have not already computed the appropriate value for TYPE,
24199 if (!TYPE_DEPENDENT_P_VALID (type
))
24201 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
24202 TYPE_DEPENDENT_P_VALID (type
) = 1;
24205 return TYPE_DEPENDENT_P (type
);
24208 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
24209 lookup. In other words, a dependent type that is not the current
24213 dependent_scope_p (tree scope
)
24215 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
24216 && !currently_open_class (scope
));
24219 /* T is a SCOPE_REF. Return whether it represents a non-static member of
24220 an unknown base of 'this' (and is therefore instantiation-dependent). */
24223 unknown_base_ref_p (tree t
)
24225 if (!current_class_ptr
)
24228 tree mem
= TREE_OPERAND (t
, 1);
24229 if (shared_member_p (mem
))
24232 tree cur
= current_nonlambda_class_type ();
24233 if (!any_dependent_bases_p (cur
))
24236 tree ctx
= TREE_OPERAND (t
, 0);
24237 if (DERIVED_FROM_P (ctx
, cur
))
24243 /* T is a SCOPE_REF; return whether we need to consider it
24244 instantiation-dependent so that we can check access at instantiation
24245 time even though we know which member it resolves to. */
24248 instantiation_dependent_scope_ref_p (tree t
)
24250 if (DECL_P (TREE_OPERAND (t
, 1))
24251 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
24252 && !unknown_base_ref_p (t
)
24253 && accessible_in_template_p (TREE_OPERAND (t
, 0),
24254 TREE_OPERAND (t
, 1)))
24260 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
24261 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
24264 /* Note that this predicate is not appropriate for general expressions;
24265 only constant expressions (that satisfy potential_constant_expression)
24266 can be tested for value dependence. */
24269 value_dependent_expression_p (tree expression
)
24271 if (!processing_template_decl
|| expression
== NULL_TREE
)
24274 /* A type-dependent expression is also value-dependent. */
24275 if (type_dependent_expression_p (expression
))
24278 switch (TREE_CODE (expression
))
24281 /* A dependent member function of the current instantiation. */
24282 return dependent_type_p (BINFO_TYPE (BASELINK_BINFO (expression
)));
24284 case FUNCTION_DECL
:
24285 /* A dependent member function of the current instantiation. */
24286 if (DECL_CLASS_SCOPE_P (expression
)
24287 && dependent_type_p (DECL_CONTEXT (expression
)))
24291 case IDENTIFIER_NODE
:
24292 /* A name that has not been looked up -- must be dependent. */
24295 case TEMPLATE_PARM_INDEX
:
24296 /* A non-type template parm. */
24300 /* A non-type template parm. */
24301 if (DECL_TEMPLATE_PARM_P (expression
))
24303 return value_dependent_expression_p (DECL_INITIAL (expression
));
24306 /* A constant with literal type and is initialized
24307 with an expression that is value-dependent. */
24308 if (DECL_DEPENDENT_INIT_P (expression
)
24309 /* FIXME cp_finish_decl doesn't fold reference initializers. */
24310 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
)
24312 if (DECL_HAS_VALUE_EXPR_P (expression
))
24314 tree value_expr
= DECL_VALUE_EXPR (expression
);
24315 if (value_dependent_expression_p (value_expr
))
24320 case DYNAMIC_CAST_EXPR
:
24321 case STATIC_CAST_EXPR
:
24322 case CONST_CAST_EXPR
:
24323 case REINTERPRET_CAST_EXPR
:
24325 case IMPLICIT_CONV_EXPR
:
24326 /* These expressions are value-dependent if the type to which
24327 the cast occurs is dependent or the expression being casted
24328 is value-dependent. */
24330 tree type
= TREE_TYPE (expression
);
24332 if (dependent_type_p (type
))
24335 /* A functional cast has a list of operands. */
24336 expression
= TREE_OPERAND (expression
, 0);
24339 /* If there are no operands, it must be an expression such
24340 as "int()". This should not happen for aggregate types
24341 because it would form non-constant expressions. */
24342 gcc_assert (cxx_dialect
>= cxx11
24343 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
24348 if (TREE_CODE (expression
) == TREE_LIST
)
24349 return any_value_dependent_elements_p (expression
);
24351 return value_dependent_expression_p (expression
);
24355 if (SIZEOF_EXPR_TYPE_P (expression
))
24356 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
24360 /* A `sizeof' expression is value-dependent if the operand is
24361 type-dependent or is a pack expansion. */
24362 expression
= TREE_OPERAND (expression
, 0);
24363 if (PACK_EXPANSION_P (expression
))
24365 else if (TYPE_P (expression
))
24366 return dependent_type_p (expression
);
24367 return instantiation_dependent_uneval_expression_p (expression
);
24369 case AT_ENCODE_EXPR
:
24370 /* An 'encode' expression is value-dependent if the operand is
24372 expression
= TREE_OPERAND (expression
, 0);
24373 return dependent_type_p (expression
);
24375 case NOEXCEPT_EXPR
:
24376 expression
= TREE_OPERAND (expression
, 0);
24377 return instantiation_dependent_uneval_expression_p (expression
);
24380 /* All instantiation-dependent expressions should also be considered
24381 value-dependent. */
24382 return instantiation_dependent_scope_ref_p (expression
);
24384 case COMPONENT_REF
:
24385 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
24386 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
24388 case NONTYPE_ARGUMENT_PACK
:
24389 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
24390 is value-dependent. */
24392 tree values
= ARGUMENT_PACK_ARGS (expression
);
24393 int i
, len
= TREE_VEC_LENGTH (values
);
24395 for (i
= 0; i
< len
; ++i
)
24396 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
24404 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
24406 if (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
)))
24412 if (TREE_CODE (type2
) != TREE_LIST
)
24413 return dependent_type_p (type2
);
24415 for (; type2
; type2
= TREE_CHAIN (type2
))
24416 if (dependent_type_p (TREE_VALUE (type2
)))
24423 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24424 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
24427 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24428 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
24432 tree op
= TREE_OPERAND (expression
, 0);
24433 return (value_dependent_expression_p (op
)
24434 || has_value_dependent_address (op
));
24437 case REQUIRES_EXPR
:
24438 /* Treat all requires-expressions as value-dependent so
24439 we don't try to fold them. */
24443 return dependent_type_p (TREE_OPERAND (expression
, 0));
24447 if (value_dependent_expression_p (CALL_EXPR_FN (expression
)))
24449 tree fn
= get_callee_fndecl (expression
);
24451 nargs
= call_expr_nargs (expression
);
24452 for (i
= 0; i
< nargs
; ++i
)
24454 tree op
= CALL_EXPR_ARG (expression
, i
);
24455 /* In a call to a constexpr member function, look through the
24456 implicit ADDR_EXPR on the object argument so that it doesn't
24457 cause the call to be considered value-dependent. We also
24458 look through it in potential_constant_expression. */
24459 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
24460 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
24461 && TREE_CODE (op
) == ADDR_EXPR
)
24462 op
= TREE_OPERAND (op
, 0);
24463 if (value_dependent_expression_p (op
))
24469 case TEMPLATE_ID_EXPR
:
24470 return variable_concept_p (TREE_OPERAND (expression
, 0));
24476 if (dependent_type_p (TREE_TYPE (expression
)))
24478 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
24479 if (value_dependent_expression_p (val
))
24485 /* Treat a GNU statement expression as dependent to avoid crashing
24486 under instantiate_non_dependent_expr; it can't be constant. */
24490 /* A constant expression is value-dependent if any subexpression is
24491 value-dependent. */
24492 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
24494 case tcc_reference
:
24496 case tcc_comparison
:
24498 case tcc_expression
:
24501 int i
, len
= cp_tree_operand_length (expression
);
24503 for (i
= 0; i
< len
; i
++)
24505 tree t
= TREE_OPERAND (expression
, i
);
24507 /* In some cases, some of the operands may be missing.
24508 (For example, in the case of PREDECREMENT_EXPR, the
24509 amount to increment by may be missing.) That doesn't
24510 make the expression dependent. */
24511 if (t
&& value_dependent_expression_p (t
))
24522 /* The expression is not value-dependent. */
24526 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
24527 [temp.dep.expr]. Note that an expression with no type is
24528 considered dependent. Other parts of the compiler arrange for an
24529 expression with type-dependent subexpressions to have no type, so
24530 this function doesn't have to be fully recursive. */
24533 type_dependent_expression_p (tree expression
)
24535 if (!processing_template_decl
)
24538 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
24541 STRIP_ANY_LOCATION_WRAPPER (expression
);
24543 /* An unresolved name is always dependent. */
24544 if (identifier_p (expression
)
24545 || TREE_CODE (expression
) == USING_DECL
24546 || TREE_CODE (expression
) == WILDCARD_DECL
)
24549 /* A fold expression is type-dependent. */
24550 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
24551 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
24552 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
24553 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
24556 /* Some expression forms are never type-dependent. */
24557 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
24558 || TREE_CODE (expression
) == SIZEOF_EXPR
24559 || TREE_CODE (expression
) == ALIGNOF_EXPR
24560 || TREE_CODE (expression
) == AT_ENCODE_EXPR
24561 || TREE_CODE (expression
) == NOEXCEPT_EXPR
24562 || TREE_CODE (expression
) == TRAIT_EXPR
24563 || TREE_CODE (expression
) == TYPEID_EXPR
24564 || TREE_CODE (expression
) == DELETE_EXPR
24565 || TREE_CODE (expression
) == VEC_DELETE_EXPR
24566 || TREE_CODE (expression
) == THROW_EXPR
24567 || TREE_CODE (expression
) == REQUIRES_EXPR
)
24570 /* The types of these expressions depends only on the type to which
24571 the cast occurs. */
24572 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
24573 || TREE_CODE (expression
) == STATIC_CAST_EXPR
24574 || TREE_CODE (expression
) == CONST_CAST_EXPR
24575 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
24576 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
24577 || TREE_CODE (expression
) == CAST_EXPR
)
24578 return dependent_type_p (TREE_TYPE (expression
));
24580 /* The types of these expressions depends only on the type created
24581 by the expression. */
24582 if (TREE_CODE (expression
) == NEW_EXPR
24583 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
24585 /* For NEW_EXPR tree nodes created inside a template, either
24586 the object type itself or a TREE_LIST may appear as the
24588 tree type
= TREE_OPERAND (expression
, 1);
24589 if (TREE_CODE (type
) == TREE_LIST
)
24590 /* This is an array type. We need to check array dimensions
24592 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
24593 || value_dependent_expression_p
24594 (TREE_OPERAND (TREE_VALUE (type
), 1));
24596 return dependent_type_p (type
);
24599 if (TREE_CODE (expression
) == SCOPE_REF
)
24601 tree scope
= TREE_OPERAND (expression
, 0);
24602 tree name
= TREE_OPERAND (expression
, 1);
24604 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
24605 contains an identifier associated by name lookup with one or more
24606 declarations declared with a dependent type, or...a
24607 nested-name-specifier or qualified-id that names a member of an
24608 unknown specialization. */
24609 return (type_dependent_expression_p (name
)
24610 || dependent_scope_p (scope
));
24613 if (TREE_CODE (expression
) == TEMPLATE_DECL
24614 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
24615 return uses_outer_template_parms (expression
);
24617 if (TREE_CODE (expression
) == STMT_EXPR
)
24618 expression
= stmt_expr_value_expr (expression
);
24620 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
24625 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
24627 if (type_dependent_expression_p (elt
))
24633 /* A static data member of the current instantiation with incomplete
24634 array type is type-dependent, as the definition and specializations
24635 can have different bounds. */
24636 if (VAR_P (expression
)
24637 && DECL_CLASS_SCOPE_P (expression
)
24638 && dependent_type_p (DECL_CONTEXT (expression
))
24639 && VAR_HAD_UNKNOWN_BOUND (expression
))
24642 /* An array of unknown bound depending on a variadic parameter, eg:
24644 template<typename... Args>
24645 void foo (Args... args)
24647 int arr[] = { args... };
24650 template<int... vals>
24653 int arr[] = { vals... };
24656 If the array has no length and has an initializer, it must be that
24657 we couldn't determine its length in cp_complete_array_type because
24658 it is dependent. */
24659 if (VAR_P (expression
)
24660 && TREE_TYPE (expression
) != NULL_TREE
24661 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
24662 && !TYPE_DOMAIN (TREE_TYPE (expression
))
24663 && DECL_INITIAL (expression
))
24666 /* A function or variable template-id is type-dependent if it has any
24667 dependent template arguments. */
24668 if (VAR_OR_FUNCTION_DECL_P (expression
)
24669 && DECL_LANG_SPECIFIC (expression
)
24670 && DECL_TEMPLATE_INFO (expression
))
24672 /* Consider the innermost template arguments, since those are the ones
24673 that come from the template-id; the template arguments for the
24674 enclosing class do not make it type-dependent unless they are used in
24675 the type of the decl. */
24676 if (PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (expression
))
24677 && (any_dependent_template_arguments_p
24678 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
24682 /* Otherwise, if the function decl isn't from a dependent scope, it can't be
24683 type-dependent. Checking this is important for functions with auto return
24684 type, which looks like a dependent type. */
24685 if (TREE_CODE (expression
) == FUNCTION_DECL
24686 && !(DECL_CLASS_SCOPE_P (expression
)
24687 && dependent_type_p (DECL_CONTEXT (expression
)))
24688 && !(DECL_LANG_SPECIFIC (expression
)
24689 && DECL_FRIEND_P (expression
)
24690 && (!DECL_FRIEND_CONTEXT (expression
)
24691 || dependent_type_p (DECL_FRIEND_CONTEXT (expression
))))
24692 && !DECL_LOCAL_FUNCTION_P (expression
))
24694 gcc_assert (!dependent_type_p (TREE_TYPE (expression
))
24695 || undeduced_auto_decl (expression
));
24699 /* Always dependent, on the number of arguments if nothing else. */
24700 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
24703 if (TREE_TYPE (expression
) == unknown_type_node
)
24705 if (TREE_CODE (expression
) == ADDR_EXPR
)
24706 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
24707 if (TREE_CODE (expression
) == COMPONENT_REF
24708 || TREE_CODE (expression
) == OFFSET_REF
)
24710 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
24712 expression
= TREE_OPERAND (expression
, 1);
24713 if (identifier_p (expression
))
24716 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
24717 if (TREE_CODE (expression
) == SCOPE_REF
)
24720 if (BASELINK_P (expression
))
24722 if (BASELINK_OPTYPE (expression
)
24723 && dependent_type_p (BASELINK_OPTYPE (expression
)))
24725 expression
= BASELINK_FUNCTIONS (expression
);
24728 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
24730 if (any_dependent_template_arguments_p
24731 (TREE_OPERAND (expression
, 1)))
24733 expression
= TREE_OPERAND (expression
, 0);
24734 if (identifier_p (expression
))
24738 gcc_assert (TREE_CODE (expression
) == OVERLOAD
24739 || TREE_CODE (expression
) == FUNCTION_DECL
);
24741 for (lkp_iterator
iter (expression
); iter
; ++iter
)
24742 if (type_dependent_expression_p (*iter
))
24748 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
24750 /* Dependent type attributes might not have made it from the decl to
24752 if (DECL_P (expression
)
24753 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (expression
)))
24756 return (dependent_type_p (TREE_TYPE (expression
)));
24759 /* [temp.dep.expr]/5: A class member access expression (5.2.5) is
24760 type-dependent if the expression refers to a member of the current
24761 instantiation and the type of the referenced member is dependent, or the
24762 class member access expression refers to a member of an unknown
24765 This function returns true if the OBJECT in such a class member access
24766 expression is of an unknown specialization. */
24769 type_dependent_object_expression_p (tree object
)
24771 /* An IDENTIFIER_NODE can sometimes have a TREE_TYPE, but it's still
24773 if (TREE_CODE (object
) == IDENTIFIER_NODE
)
24775 tree scope
= TREE_TYPE (object
);
24776 return (!scope
|| dependent_scope_p (scope
));
24779 /* walk_tree callback function for instantiation_dependent_expression_p,
24780 below. Returns non-zero if a dependent subexpression is found. */
24783 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
24788 /* We don't have to worry about decltype currently because decltype
24789 of an instantiation-dependent expr is a dependent type. This
24790 might change depending on the resolution of DR 1172. */
24791 *walk_subtrees
= false;
24794 enum tree_code code
= TREE_CODE (*tp
);
24797 /* Don't treat an argument list as dependent just because it has no
24803 case TEMPLATE_PARM_INDEX
:
24806 /* Handle expressions with type operands. */
24810 case AT_ENCODE_EXPR
:
24812 tree op
= TREE_OPERAND (*tp
, 0);
24813 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
24814 op
= TREE_TYPE (op
);
24817 if (dependent_type_p (op
))
24821 *walk_subtrees
= false;
24828 case COMPONENT_REF
:
24829 if (identifier_p (TREE_OPERAND (*tp
, 1)))
24830 /* In a template, finish_class_member_access_expr creates a
24831 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
24832 type-dependent, so that we can check access control at
24833 instantiation time (PR 42277). See also Core issue 1273. */
24838 if (instantiation_dependent_scope_ref_p (*tp
))
24843 /* Treat statement-expressions as dependent. */
24847 /* Treat requires-expressions as dependent. */
24848 case REQUIRES_EXPR
:
24852 /* Treat calls to function concepts as dependent. */
24853 if (function_concept_check_p (*tp
))
24857 case TEMPLATE_ID_EXPR
:
24858 /* And variable concepts. */
24859 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
24867 if (type_dependent_expression_p (*tp
))
24873 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
24874 sense defined by the ABI:
24876 "An expression is instantiation-dependent if it is type-dependent
24877 or value-dependent, or it has a subexpression that is type-dependent
24878 or value-dependent."
24880 Except don't actually check value-dependence for unevaluated expressions,
24881 because in sizeof(i) we don't care about the value of i. Checking
24882 type-dependence will in turn check value-dependence of array bounds/template
24883 arguments as needed. */
24886 instantiation_dependent_uneval_expression_p (tree expression
)
24890 if (!processing_template_decl
)
24893 if (expression
== error_mark_node
)
24896 result
= cp_walk_tree_without_duplicates (&expression
,
24897 instantiation_dependent_r
, NULL
);
24898 return result
!= NULL_TREE
;
24901 /* As above, but also check value-dependence of the expression as a whole. */
24904 instantiation_dependent_expression_p (tree expression
)
24906 return (instantiation_dependent_uneval_expression_p (expression
)
24907 || value_dependent_expression_p (expression
));
24910 /* Like type_dependent_expression_p, but it also works while not processing
24911 a template definition, i.e. during substitution or mangling. */
24914 type_dependent_expression_p_push (tree expr
)
24917 ++processing_template_decl
;
24918 b
= type_dependent_expression_p (expr
);
24919 --processing_template_decl
;
24923 /* Returns TRUE if ARGS contains a type-dependent expression. */
24926 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
24931 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
24933 if (type_dependent_expression_p (arg
))
24939 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
24940 expressions) contains any type-dependent expressions. */
24943 any_type_dependent_elements_p (const_tree list
)
24945 for (; list
; list
= TREE_CHAIN (list
))
24946 if (type_dependent_expression_p (TREE_VALUE (list
)))
24952 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
24953 expressions) contains any value-dependent expressions. */
24956 any_value_dependent_elements_p (const_tree list
)
24958 for (; list
; list
= TREE_CHAIN (list
))
24959 if (value_dependent_expression_p (TREE_VALUE (list
)))
24965 /* Returns TRUE if the ARG (a template argument) is dependent. */
24968 dependent_template_arg_p (tree arg
)
24970 if (!processing_template_decl
)
24973 /* Assume a template argument that was wrongly written by the user
24974 is dependent. This is consistent with what
24975 any_dependent_template_arguments_p [that calls this function]
24977 if (!arg
|| arg
== error_mark_node
)
24980 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
24981 arg
= argument_pack_select_arg (arg
);
24983 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
24985 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
24987 if (DECL_TEMPLATE_PARM_P (arg
))
24989 /* A member template of a dependent class is not necessarily
24990 type-dependent, but it is a dependent template argument because it
24991 will be a member of an unknown specialization to that template. */
24992 tree scope
= CP_DECL_CONTEXT (arg
);
24993 return TYPE_P (scope
) && dependent_type_p (scope
);
24995 else if (ARGUMENT_PACK_P (arg
))
24997 tree args
= ARGUMENT_PACK_ARGS (arg
);
24998 int i
, len
= TREE_VEC_LENGTH (args
);
24999 for (i
= 0; i
< len
; ++i
)
25001 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
25007 else if (TYPE_P (arg
))
25008 return dependent_type_p (arg
);
25010 return (type_dependent_expression_p (arg
)
25011 || value_dependent_expression_p (arg
));
25014 /* Returns true if ARGS (a collection of template arguments) contains
25015 any types that require structural equality testing. */
25018 any_template_arguments_need_structural_equality_p (tree args
)
25025 if (args
== error_mark_node
)
25028 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25030 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25031 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25033 tree arg
= TREE_VEC_ELT (level
, j
);
25034 tree packed_args
= NULL_TREE
;
25037 if (ARGUMENT_PACK_P (arg
))
25039 /* Look inside the argument pack. */
25040 packed_args
= ARGUMENT_PACK_ARGS (arg
);
25041 len
= TREE_VEC_LENGTH (packed_args
);
25044 for (k
= 0; k
< len
; ++k
)
25047 arg
= TREE_VEC_ELT (packed_args
, k
);
25049 if (error_operand_p (arg
))
25051 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
25053 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
25055 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
25056 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
25065 /* Returns true if ARGS (a collection of template arguments) contains
25066 any dependent arguments. */
25069 any_dependent_template_arguments_p (const_tree args
)
25076 if (args
== error_mark_node
)
25079 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25081 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25082 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25083 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
25090 /* Returns true if ARGS contains any errors. */
25093 any_erroneous_template_args_p (const_tree args
)
25098 if (args
== error_mark_node
)
25101 if (args
&& TREE_CODE (args
) != TREE_VEC
)
25103 if (tree ti
= get_template_info (args
))
25104 args
= TI_ARGS (ti
);
25112 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
25114 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
25115 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
25116 if (error_operand_p (TREE_VEC_ELT (level
, j
)))
25123 /* Returns TRUE if the template TMPL is type-dependent. */
25126 dependent_template_p (tree tmpl
)
25128 if (TREE_CODE (tmpl
) == OVERLOAD
)
25130 for (lkp_iterator
iter (tmpl
); iter
; ++iter
)
25131 if (dependent_template_p (*iter
))
25136 /* Template template parameters are dependent. */
25137 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
25138 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
25140 /* So are names that have not been looked up. */
25141 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
25146 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
25149 dependent_template_id_p (tree tmpl
, tree args
)
25151 return (dependent_template_p (tmpl
)
25152 || any_dependent_template_arguments_p (args
));
25155 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
25159 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
25163 if (!processing_template_decl
)
25166 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
25168 tree decl
= TREE_VEC_ELT (declv
, i
);
25169 tree init
= TREE_VEC_ELT (initv
, i
);
25170 tree cond
= TREE_VEC_ELT (condv
, i
);
25171 tree incr
= TREE_VEC_ELT (incrv
, i
);
25173 if (type_dependent_expression_p (decl
)
25174 || TREE_CODE (decl
) == SCOPE_REF
)
25177 if (init
&& type_dependent_expression_p (init
))
25180 if (type_dependent_expression_p (cond
))
25183 if (COMPARISON_CLASS_P (cond
)
25184 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
25185 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
25188 if (TREE_CODE (incr
) == MODOP_EXPR
)
25190 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
25191 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
25194 else if (type_dependent_expression_p (incr
))
25196 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
25198 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
25200 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
25202 tree t
= TREE_OPERAND (incr
, 1);
25203 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
25204 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
25213 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
25214 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
25215 no such TYPE can be found. Note that this function peers inside
25216 uninstantiated templates and therefore should be used only in
25217 extremely limited situations. ONLY_CURRENT_P restricts this
25218 peering to the currently open classes hierarchy (which is required
25219 when comparing types). */
25222 resolve_typename_type (tree type
, bool only_current_p
)
25231 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
25233 scope
= TYPE_CONTEXT (type
);
25234 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
25235 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
25236 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
25237 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
25238 identifier of the TYPENAME_TYPE anymore.
25239 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
25240 TYPENAME_TYPE instead, we avoid messing up with a possible
25241 typedef variant case. */
25242 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
25244 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
25245 it first before we can figure out what NAME refers to. */
25246 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
25248 if (TYPENAME_IS_RESOLVING_P (scope
))
25249 /* Given a class template A with a dependent base with nested type C,
25250 typedef typename A::C::C C will land us here, as trying to resolve
25251 the initial A::C leads to the local C typedef, which leads back to
25252 A::C::C. So we break the recursion now. */
25255 scope
= resolve_typename_type (scope
, only_current_p
);
25257 /* If we don't know what SCOPE refers to, then we cannot resolve the
25259 if (!CLASS_TYPE_P (scope
))
25261 /* If this is a typedef, we don't want to look inside (c++/11987). */
25262 if (typedef_variant_p (type
))
25264 /* If SCOPE isn't the template itself, it will not have a valid
25265 TYPE_FIELDS list. */
25266 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
25267 /* scope is either the template itself or a compatible instantiation
25268 like X<T>, so look up the name in the original template. */
25269 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
25270 /* We shouldn't have built a TYPENAME_TYPE with a non-dependent scope. */
25271 gcc_checking_assert (uses_template_parms (scope
));
25272 /* If scope has no fields, it can't be a current instantiation. Check this
25273 before currently_open_class to avoid infinite recursion (71515). */
25274 if (!TYPE_FIELDS (scope
))
25276 /* If the SCOPE is not the current instantiation, there's no reason
25277 to look inside it. */
25278 if (only_current_p
&& !currently_open_class (scope
))
25280 /* Enter the SCOPE so that name lookup will be resolved as if we
25281 were in the class definition. In particular, SCOPE will no
25282 longer be considered a dependent type. */
25283 pushed_scope
= push_scope (scope
);
25284 /* Look up the declaration. */
25285 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
25286 tf_warning_or_error
);
25288 result
= NULL_TREE
;
25290 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
25291 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
25292 tree fullname
= TYPENAME_TYPE_FULLNAME (type
);
25295 else if (identifier_p (fullname
)
25296 && TREE_CODE (decl
) == TYPE_DECL
)
25298 result
= TREE_TYPE (decl
);
25299 if (result
== error_mark_node
)
25300 result
= NULL_TREE
;
25302 else if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
25303 && DECL_CLASS_TEMPLATE_P (decl
))
25305 /* Obtain the template and the arguments. */
25306 tree tmpl
= TREE_OPERAND (fullname
, 0);
25307 if (TREE_CODE (tmpl
) == IDENTIFIER_NODE
)
25309 /* We get here with a plain identifier because a previous tentative
25310 parse of the nested-name-specifier as part of a ptr-operator saw
25311 ::template X<A>. The use of ::template is necessary in a
25312 ptr-operator, but wrong in a declarator-id.
25314 [temp.names]: In a qualified-id of a declarator-id, the keyword
25315 template shall not appear at the top level. */
25316 pedwarn (EXPR_LOC_OR_LOC (fullname
, input_location
), OPT_Wpedantic
,
25317 "keyword %<template%> not allowed in declarator-id");
25320 tree args
= TREE_OPERAND (fullname
, 1);
25321 /* Instantiate the template. */
25322 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
25323 /*entering_scope=*/true,
25324 tf_error
| tf_user
);
25325 if (result
== error_mark_node
)
25326 result
= NULL_TREE
;
25329 /* Leave the SCOPE. */
25331 pop_scope (pushed_scope
);
25333 /* If we failed to resolve it, return the original typename. */
25337 /* If lookup found a typename type, resolve that too. */
25338 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
25340 /* Ill-formed programs can cause infinite recursion here, so we
25341 must catch that. */
25342 TYPENAME_IS_RESOLVING_P (result
) = 1;
25343 result
= resolve_typename_type (result
, only_current_p
);
25344 TYPENAME_IS_RESOLVING_P (result
) = 0;
25347 /* Qualify the resulting type. */
25348 quals
= cp_type_quals (type
);
25350 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
25355 /* EXPR is an expression which is not type-dependent. Return a proxy
25356 for EXPR that can be used to compute the types of larger
25357 expressions containing EXPR. */
25360 build_non_dependent_expr (tree expr
)
25362 tree orig_expr
= expr
;
25365 /* When checking, try to get a constant value for all non-dependent
25366 expressions in order to expose bugs in *_dependent_expression_p
25367 and constexpr. This can affect code generation, see PR70704, so
25368 only do this for -fchecking=2. */
25369 if (flag_checking
> 1
25370 && cxx_dialect
>= cxx11
25371 /* Don't do this during nsdmi parsing as it can lead to
25372 unexpected recursive instantiations. */
25373 && !parsing_nsdmi ()
25374 /* Don't do this during concept expansion either and for
25375 the same reason. */
25376 && !expanding_concept ())
25377 fold_non_dependent_expr (expr
);
25379 STRIP_ANY_LOCATION_WRAPPER (expr
);
25381 /* Preserve OVERLOADs; the functions must be available to resolve
25384 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
25385 inner_expr
= stmt_expr_value_expr (inner_expr
);
25386 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
25387 inner_expr
= TREE_OPERAND (inner_expr
, 0);
25388 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
25389 inner_expr
= TREE_OPERAND (inner_expr
, 1);
25390 if (is_overloaded_fn (inner_expr
)
25391 || TREE_CODE (inner_expr
) == OFFSET_REF
)
25393 /* There is no need to return a proxy for a variable. */
25396 /* Preserve string constants; conversions from string constants to
25397 "char *" are allowed, even though normally a "const char *"
25398 cannot be used to initialize a "char *". */
25399 if (TREE_CODE (expr
) == STRING_CST
)
25401 /* Preserve void and arithmetic constants, as an optimization -- there is no
25402 reason to create a new node. */
25403 if (TREE_CODE (expr
) == VOID_CST
25404 || TREE_CODE (expr
) == INTEGER_CST
25405 || TREE_CODE (expr
) == REAL_CST
)
25407 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
25408 There is at least one place where we want to know that a
25409 particular expression is a throw-expression: when checking a ?:
25410 expression, there are special rules if the second or third
25411 argument is a throw-expression. */
25412 if (TREE_CODE (expr
) == THROW_EXPR
)
25415 /* Don't wrap an initializer list, we need to be able to look inside. */
25416 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
25419 /* Don't wrap a dummy object, we need to be able to test for it. */
25420 if (is_dummy_object (expr
))
25423 if (TREE_CODE (expr
) == COND_EXPR
)
25424 return build3 (COND_EXPR
,
25426 TREE_OPERAND (expr
, 0),
25427 (TREE_OPERAND (expr
, 1)
25428 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
25429 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
25430 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
25431 if (TREE_CODE (expr
) == COMPOUND_EXPR
25432 && !COMPOUND_EXPR_OVERLOADED (expr
))
25433 return build2 (COMPOUND_EXPR
,
25435 TREE_OPERAND (expr
, 0),
25436 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
25438 /* If the type is unknown, it can't really be non-dependent */
25439 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
25441 /* Otherwise, build a NON_DEPENDENT_EXPR. */
25442 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
25445 /* ARGS is a vector of expressions as arguments to a function call.
25446 Replace the arguments with equivalent non-dependent expressions.
25447 This modifies ARGS in place. */
25450 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
25455 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
25457 tree newarg
= build_non_dependent_expr (arg
);
25459 (*args
)[ix
] = newarg
;
25463 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
25464 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
25465 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
25468 make_auto_1 (tree name
, bool set_canonical
)
25470 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
25471 TYPE_NAME (au
) = build_decl (input_location
,
25472 TYPE_DECL
, name
, au
);
25473 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
25474 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
25475 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
25476 TYPE_NAME (au
), NULL_TREE
);
25478 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
25479 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
25480 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
25486 make_decltype_auto (void)
25488 return make_auto_1 (decltype_auto_identifier
, true);
25494 return make_auto_1 (auto_identifier
, true);
25497 /* Return a C++17 deduction placeholder for class template TMPL. */
25500 make_template_placeholder (tree tmpl
)
25502 tree t
= make_auto_1 (DECL_NAME (tmpl
), true);
25503 CLASS_PLACEHOLDER_TEMPLATE (t
) = tmpl
;
25507 /* True iff T is a C++17 class template deduction placeholder. */
25510 template_placeholder_p (tree t
)
25512 return is_auto (t
) && CLASS_PLACEHOLDER_TEMPLATE (t
);
25515 /* Make a "constrained auto" type-specifier. This is an
25516 auto type with constraints that must be associated after
25517 deduction. The constraint is formed from the given
25518 CONC and its optional sequence of arguments, which are
25519 non-null if written as partial-concept-id. */
25522 make_constrained_auto (tree con
, tree args
)
25524 tree type
= make_auto_1 (auto_identifier
, false);
25526 /* Build the constraint. */
25527 tree tmpl
= DECL_TI_TEMPLATE (con
);
25528 tree expr
= VAR_P (con
) ? tmpl
: ovl_make (tmpl
);
25529 expr
= build_concept_check (expr
, type
, args
);
25531 tree constr
= normalize_expression (expr
);
25532 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
25534 /* Our canonical type depends on the constraint. */
25535 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
25537 /* Attach the constraint to the type declaration. */
25538 tree decl
= TYPE_NAME (type
);
25542 /* Given type ARG, return std::initializer_list<ARG>. */
25547 tree std_init_list
= get_namespace_binding (std_node
, init_list_identifier
);
25549 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
25551 gcc_rich_location
richloc (input_location
);
25552 maybe_add_include_fixit (&richloc
, "<initializer_list>");
25553 error_at (&richloc
,
25554 "deducing from brace-enclosed initializer list"
25555 " requires %<#include <initializer_list>%>");
25557 return error_mark_node
;
25559 tree argvec
= make_tree_vec (1);
25560 TREE_VEC_ELT (argvec
, 0) = arg
;
25562 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
25563 NULL_TREE
, 0, tf_warning_or_error
);
25566 /* Replace auto in TYPE with std::initializer_list<auto>. */
25569 listify_autos (tree type
, tree auto_node
)
25571 tree init_auto
= listify (auto_node
);
25572 tree argvec
= make_tree_vec (1);
25573 TREE_VEC_ELT (argvec
, 0) = init_auto
;
25574 if (processing_template_decl
)
25575 argvec
= add_to_template_args (current_template_args (), argvec
);
25576 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
25579 /* Hash traits for hashing possibly constrained 'auto'
25580 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
25582 struct auto_hash
: default_hash_traits
<tree
>
25584 static inline hashval_t
hash (tree
);
25585 static inline bool equal (tree
, tree
);
25588 /* Hash the 'auto' T. */
25591 auto_hash::hash (tree t
)
25593 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
25594 /* Matching constrained-type-specifiers denote the same template
25595 parameter, so hash the constraint. */
25596 return hash_placeholder_constraint (c
);
25598 /* But unconstrained autos are all separate, so just hash the pointer. */
25599 return iterative_hash_object (t
, 0);
25602 /* Compare two 'auto's. */
25605 auto_hash::equal (tree t1
, tree t2
)
25610 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
25611 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
25613 /* Two unconstrained autos are distinct. */
25617 return equivalent_placeholder_constraints (c1
, c2
);
25620 /* for_each_template_parm callback for extract_autos: if t is a (possibly
25621 constrained) auto, add it to the vector. */
25624 extract_autos_r (tree t
, void *data
)
25626 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
25629 /* All the autos were built with index 0; fix that up now. */
25630 tree
*p
= hash
.find_slot (t
, INSERT
);
25633 /* If this is a repeated constrained-type-specifier, use the index we
25635 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
25638 /* Otherwise this is new, so use the current count. */
25640 idx
= hash
.elements () - 1;
25642 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
25645 /* Always keep walking. */
25649 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
25650 says they can appear anywhere in the type. */
25653 extract_autos (tree type
)
25655 hash_set
<tree
> visited
;
25656 hash_table
<auto_hash
> hash (2);
25658 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
25660 tree tree_vec
= make_tree_vec (hash
.elements());
25661 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
25662 iter
!= hash
.end(); ++iter
)
25665 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
25666 TREE_VEC_ELT (tree_vec
, i
)
25667 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
25673 /* The stem for deduction guide names. */
25674 const char *const dguide_base
= "__dguide_";
25676 /* Return the name for a deduction guide for class template TMPL. */
25679 dguide_name (tree tmpl
)
25681 tree type
= (TYPE_P (tmpl
) ? tmpl
: TREE_TYPE (tmpl
));
25682 tree tname
= TYPE_IDENTIFIER (type
);
25683 char *buf
= (char *) alloca (1 + strlen (dguide_base
)
25684 + IDENTIFIER_LENGTH (tname
));
25685 memcpy (buf
, dguide_base
, strlen (dguide_base
));
25686 memcpy (buf
+ strlen (dguide_base
), IDENTIFIER_POINTER (tname
),
25687 IDENTIFIER_LENGTH (tname
) + 1);
25688 tree dname
= get_identifier (buf
);
25689 TREE_TYPE (dname
) = type
;
25693 /* True if NAME is the name of a deduction guide. */
25696 dguide_name_p (tree name
)
25698 return (TREE_CODE (name
) == IDENTIFIER_NODE
25699 && TREE_TYPE (name
)
25700 && !strncmp (IDENTIFIER_POINTER (name
), dguide_base
,
25701 strlen (dguide_base
)));
25704 /* True if FN is a deduction guide. */
25707 deduction_guide_p (const_tree fn
)
25710 if (tree name
= DECL_NAME (fn
))
25711 return dguide_name_p (name
);
25715 /* True if FN is the copy deduction guide, i.e. A(A)->A. */
25718 copy_guide_p (const_tree fn
)
25720 gcc_assert (deduction_guide_p (fn
));
25721 if (!DECL_ARTIFICIAL (fn
))
25723 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (DECL_TI_TEMPLATE (fn
));
25724 return (TREE_CHAIN (parms
) == void_list_node
25725 && same_type_p (TREE_VALUE (parms
), TREE_TYPE (DECL_NAME (fn
))));
25728 /* True if FN is a guide generated from a constructor template. */
25731 template_guide_p (const_tree fn
)
25733 gcc_assert (deduction_guide_p (fn
));
25734 if (!DECL_ARTIFICIAL (fn
))
25736 tree tmpl
= DECL_TI_TEMPLATE (fn
);
25737 if (tree org
= DECL_ABSTRACT_ORIGIN (tmpl
))
25738 return PRIMARY_TEMPLATE_P (org
);
25742 /* OLDDECL is a _DECL for a template parameter. Return a similar parameter at
25743 LEVEL:INDEX, using tsubst_args and complain for substitution into non-type
25744 template parameter types. Note that the handling of template template
25745 parameters relies on current_template_parms being set appropriately for the
25749 rewrite_template_parm (tree olddecl
, unsigned index
, unsigned level
,
25750 tree tsubst_args
, tsubst_flags_t complain
)
25752 tree oldidx
= get_template_parm_index (olddecl
);
25755 if (TREE_CODE (olddecl
) == TYPE_DECL
25756 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
25758 tree oldtype
= TREE_TYPE (olddecl
);
25759 newtype
= cxx_make_type (TREE_CODE (oldtype
));
25760 TYPE_MAIN_VARIANT (newtype
) = newtype
;
25761 if (TREE_CODE (oldtype
) == TEMPLATE_TYPE_PARM
)
25762 TEMPLATE_TYPE_PARM_FOR_CLASS (newtype
)
25763 = TEMPLATE_TYPE_PARM_FOR_CLASS (oldtype
);
25766 newtype
= tsubst (TREE_TYPE (olddecl
), tsubst_args
,
25767 complain
, NULL_TREE
);
25770 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TREE_CODE (olddecl
),
25771 DECL_NAME (olddecl
), newtype
);
25772 SET_DECL_TEMPLATE_PARM_P (newdecl
);
25775 if (TREE_CODE (olddecl
) == TYPE_DECL
25776 || TREE_CODE (olddecl
) == TEMPLATE_DECL
)
25778 newidx
= TEMPLATE_TYPE_PARM_INDEX (newtype
)
25779 = build_template_parm_index (index
, level
, level
,
25781 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
25782 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
25783 TYPE_STUB_DECL (newtype
) = TYPE_NAME (newtype
) = newdecl
;
25784 TYPE_CANONICAL (newtype
) = canonical_type_parameter (newtype
);
25786 if (TREE_CODE (olddecl
) == TEMPLATE_DECL
)
25788 DECL_TEMPLATE_RESULT (newdecl
)
25789 = build_decl (DECL_SOURCE_LOCATION (olddecl
), TYPE_DECL
,
25790 DECL_NAME (olddecl
), newtype
);
25791 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (newdecl
)) = true;
25792 // First create a copy (ttargs) of tsubst_args with an
25793 // additional level for the template template parameter's own
25794 // template parameters (ttparms).
25795 tree ttparms
= (INNERMOST_TEMPLATE_PARMS
25796 (DECL_TEMPLATE_PARMS (olddecl
)));
25797 const int depth
= TMPL_ARGS_DEPTH (tsubst_args
);
25798 tree ttargs
= make_tree_vec (depth
+ 1);
25799 for (int i
= 0; i
< depth
; ++i
)
25800 TREE_VEC_ELT (ttargs
, i
) = TREE_VEC_ELT (tsubst_args
, i
);
25801 TREE_VEC_ELT (ttargs
, depth
)
25802 = template_parms_level_to_args (ttparms
);
25803 // Substitute ttargs into ttparms to fix references to
25804 // other template parameters.
25805 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
25806 complain
|tf_partial
);
25807 // Now substitute again with args based on tparms, to reduce
25808 // the level of the ttparms.
25809 ttargs
= current_template_args ();
25810 ttparms
= tsubst_template_parms_level (ttparms
, ttargs
,
25812 // Finally, tack the adjusted parms onto tparms.
25813 ttparms
= tree_cons (size_int (depth
), ttparms
,
25814 current_template_parms
);
25815 DECL_TEMPLATE_PARMS (newdecl
) = ttparms
;
25820 tree oldconst
= TEMPLATE_PARM_DECL (oldidx
);
25822 = build_decl (DECL_SOURCE_LOCATION (oldconst
),
25823 TREE_CODE (oldconst
),
25824 DECL_NAME (oldconst
), newtype
);
25825 TREE_CONSTANT (newconst
) = TREE_CONSTANT (newdecl
)
25826 = TREE_READONLY (newconst
) = TREE_READONLY (newdecl
) = true;
25827 SET_DECL_TEMPLATE_PARM_P (newconst
);
25828 newidx
= build_template_parm_index (index
, level
, level
,
25829 newconst
, newtype
);
25830 TEMPLATE_PARM_PARAMETER_PACK (newidx
)
25831 = TEMPLATE_PARM_PARAMETER_PACK (oldidx
);
25832 DECL_INITIAL (newdecl
) = DECL_INITIAL (newconst
) = newidx
;
25838 /* Returns a C++17 class deduction guide template based on the constructor
25839 CTOR. As a special case, CTOR can be a RECORD_TYPE for an implicit default
25840 guide, or REFERENCE_TYPE for an implicit copy/move guide. */
25843 build_deduction_guide (tree ctor
, tree outer_args
, tsubst_flags_t complain
)
25845 tree type
, tparms
, targs
, fparms
, fargs
, ci
;
25846 bool memtmpl
= false;
25849 tree fn_tmpl
= NULL_TREE
;
25854 bool copy_p
= TREE_CODE (type
) == REFERENCE_TYPE
;
25857 type
= TREE_TYPE (type
);
25858 fparms
= tree_cons (NULL_TREE
, type
, void_list_node
);
25861 fparms
= void_list_node
;
25863 tree ctmpl
= CLASSTYPE_TI_TEMPLATE (type
);
25864 tparms
= DECL_TEMPLATE_PARMS (ctmpl
);
25865 targs
= CLASSTYPE_TI_ARGS (type
);
25868 loc
= DECL_SOURCE_LOCATION (ctmpl
);
25869 explicit_p
= false;
25873 ++processing_template_decl
;
25876 = (TREE_CODE (ctor
) == TEMPLATE_DECL
? ctor
25877 : DECL_TI_TEMPLATE (ctor
));
25879 fn_tmpl
= tsubst (fn_tmpl
, outer_args
, complain
, ctor
);
25880 ctor
= DECL_TEMPLATE_RESULT (fn_tmpl
);
25882 type
= DECL_CONTEXT (ctor
);
25884 tparms
= DECL_TEMPLATE_PARMS (fn_tmpl
);
25885 /* If type is a member class template, DECL_TI_ARGS (ctor) will have
25886 fully specialized args for the enclosing class. Strip those off, as
25887 the deduction guide won't have those template parameters. */
25888 targs
= get_innermost_template_args (DECL_TI_ARGS (ctor
),
25889 TMPL_PARMS_DEPTH (tparms
));
25890 /* Discard the 'this' parameter. */
25891 fparms
= FUNCTION_ARG_CHAIN (ctor
);
25892 fargs
= TREE_CHAIN (DECL_ARGUMENTS (ctor
));
25893 ci
= get_constraints (ctor
);
25894 loc
= DECL_SOURCE_LOCATION (ctor
);
25895 explicit_p
= DECL_NONCONVERTING_P (ctor
);
25897 if (PRIMARY_TEMPLATE_P (fn_tmpl
))
25901 /* For a member template constructor, we need to flatten the two
25902 template parameter lists into one, and then adjust the function
25903 signature accordingly. This gets...complicated. */
25904 tree save_parms
= current_template_parms
;
25906 /* For a member template we should have two levels of parms/args, one
25907 for the class and one for the constructor. We stripped
25908 specialized args for further enclosing classes above. */
25909 const int depth
= 2;
25910 gcc_assert (TMPL_ARGS_DEPTH (targs
) == depth
);
25912 /* Template args for translating references to the two-level template
25913 parameters into references to the one-level template parameters we
25915 tree tsubst_args
= copy_node (targs
);
25916 TMPL_ARGS_LEVEL (tsubst_args
, depth
)
25917 = copy_node (TMPL_ARGS_LEVEL (tsubst_args
, depth
));
25919 /* Template parms for the constructor template. */
25920 tree ftparms
= TREE_VALUE (tparms
);
25921 unsigned flen
= TREE_VEC_LENGTH (ftparms
);
25922 /* Template parms for the class template. */
25923 tparms
= TREE_CHAIN (tparms
);
25924 tree ctparms
= TREE_VALUE (tparms
);
25925 unsigned clen
= TREE_VEC_LENGTH (ctparms
);
25926 /* Template parms for the deduction guide start as a copy of the
25927 template parms for the class. We set current_template_parms for
25928 lookup_template_class_1. */
25929 current_template_parms
= tparms
= copy_node (tparms
);
25930 tree new_vec
= TREE_VALUE (tparms
) = make_tree_vec (flen
+ clen
);
25931 for (unsigned i
= 0; i
< clen
; ++i
)
25932 TREE_VEC_ELT (new_vec
, i
) = TREE_VEC_ELT (ctparms
, i
);
25934 /* Now we need to rewrite the constructor parms to append them to the
25936 for (unsigned i
= 0; i
< flen
; ++i
)
25938 unsigned index
= i
+ clen
;
25939 unsigned level
= 1;
25940 tree oldelt
= TREE_VEC_ELT (ftparms
, i
);
25941 tree olddecl
= TREE_VALUE (oldelt
);
25942 tree newdecl
= rewrite_template_parm (olddecl
, index
, level
,
25943 tsubst_args
, complain
);
25944 tree newdef
= tsubst_template_arg (TREE_PURPOSE (oldelt
),
25945 tsubst_args
, complain
, ctor
);
25946 tree list
= build_tree_list (newdef
, newdecl
);
25947 TEMPLATE_PARM_CONSTRAINTS (list
)
25948 = tsubst_constraint_info (TEMPLATE_PARM_CONSTRAINTS (oldelt
),
25949 tsubst_args
, complain
, ctor
);
25950 TREE_VEC_ELT (new_vec
, index
) = list
;
25951 TMPL_ARG (tsubst_args
, depth
, i
) = template_parm_to_arg (list
);
25954 /* Now we have a final set of template parms to substitute into the
25955 function signature. */
25956 targs
= template_parms_to_args (tparms
);
25957 fparms
= tsubst_arg_types (fparms
, tsubst_args
, NULL_TREE
,
25959 fargs
= tsubst (fargs
, tsubst_args
, complain
, ctor
);
25961 ci
= tsubst_constraint_info (ci
, tsubst_args
, complain
, ctor
);
25963 current_template_parms
= save_parms
;
25965 --processing_template_decl
;
25970 /* Copy the parms so we can set DECL_PRIMARY_TEMPLATE. */
25971 tparms
= copy_node (tparms
);
25972 INNERMOST_TEMPLATE_PARMS (tparms
)
25973 = copy_node (INNERMOST_TEMPLATE_PARMS (tparms
));
25976 tree fntype
= build_function_type (type
, fparms
);
25977 tree ded_fn
= build_lang_decl_loc (loc
,
25979 dguide_name (type
), fntype
);
25980 DECL_ARGUMENTS (ded_fn
) = fargs
;
25981 DECL_ARTIFICIAL (ded_fn
) = true;
25982 DECL_NONCONVERTING_P (ded_fn
) = explicit_p
;
25983 tree ded_tmpl
= build_template_decl (ded_fn
, tparms
, /*member*/false);
25984 DECL_ARTIFICIAL (ded_tmpl
) = true;
25985 DECL_TEMPLATE_RESULT (ded_tmpl
) = ded_fn
;
25986 TREE_TYPE (ded_tmpl
) = TREE_TYPE (ded_fn
);
25987 DECL_TEMPLATE_INFO (ded_fn
) = build_template_info (ded_tmpl
, targs
);
25988 DECL_PRIMARY_TEMPLATE (ded_tmpl
) = ded_tmpl
;
25990 DECL_ABSTRACT_ORIGIN (ded_tmpl
) = fn_tmpl
;
25992 set_constraints (ded_tmpl
, ci
);
25997 /* Deduce template arguments for the class template placeholder PTYPE for
25998 template TMPL based on the initializer INIT, and return the resulting
26002 do_class_deduction (tree ptype
, tree tmpl
, tree init
, int flags
,
26003 tsubst_flags_t complain
)
26005 if (!DECL_CLASS_TEMPLATE_P (tmpl
))
26007 /* We should have handled this in the caller. */
26008 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
))
26010 if (complain
& tf_error
)
26011 error ("non-class template %qT used without template arguments", tmpl
);
26012 return error_mark_node
;
26015 tree type
= TREE_TYPE (tmpl
);
26017 bool try_list_ctor
= false;
26019 vec
<tree
,va_gc
> *args
;
26020 if (init
== NULL_TREE
26021 || TREE_CODE (init
) == TREE_LIST
)
26022 args
= make_tree_vector_from_list (init
);
26023 else if (BRACE_ENCLOSED_INITIALIZER_P (init
))
26025 try_list_ctor
= TYPE_HAS_LIST_CTOR (type
);
26026 if (try_list_ctor
&& CONSTRUCTOR_NELTS (init
) == 1)
26028 /* As an exception, the first phase in 16.3.1.7 (considering the
26029 initializer list as a single argument) is omitted if the
26030 initializer list consists of a single expression of type cv U,
26031 where U is a specialization of C or a class derived from a
26032 specialization of C. */
26033 tree elt
= CONSTRUCTOR_ELT (init
, 0)->value
;
26034 tree etype
= TREE_TYPE (elt
);
26036 tree tparms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
26037 tree targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
26038 int err
= unify (tparms
, targs
, type
, etype
,
26039 UNIFY_ALLOW_DERIVED
, /*explain*/false);
26041 try_list_ctor
= false;
26044 if (try_list_ctor
|| is_std_init_list (type
))
26045 args
= make_tree_vector_single (init
);
26047 args
= make_tree_vector_from_ctor (init
);
26050 args
= make_tree_vector_single (init
);
26052 tree dname
= dguide_name (tmpl
);
26053 tree cands
= lookup_qualified_name (CP_DECL_CONTEXT (tmpl
), dname
,
26054 /*type*/false, /*complain*/false,
26056 bool elided
= false;
26057 if (cands
== error_mark_node
)
26060 /* Prune explicit deduction guides in copy-initialization context. */
26061 if (flags
& LOOKUP_ONLYCONVERTING
)
26063 for (lkp_iterator
iter (cands
); !elided
&& iter
; ++iter
)
26064 if (DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
26069 /* Found a nonconverting guide, prune the candidates. */
26070 tree pruned
= NULL_TREE
;
26071 for (lkp_iterator
iter (cands
); iter
; ++iter
)
26072 if (!DECL_NONCONVERTING_P (STRIP_TEMPLATE (*iter
)))
26073 pruned
= lookup_add (*iter
, pruned
);
26079 tree outer_args
= NULL_TREE
;
26080 if (DECL_CLASS_SCOPE_P (tmpl
)
26081 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (tmpl
)))
26083 outer_args
= CLASSTYPE_TI_ARGS (DECL_CONTEXT (tmpl
));
26084 type
= TREE_TYPE (most_general_template (tmpl
));
26087 bool saw_ctor
= false;
26088 // FIXME cache artificial deduction guides
26089 for (ovl_iterator
iter (CLASSTYPE_CONSTRUCTORS (type
)); iter
; ++iter
)
26091 tree guide
= build_deduction_guide (*iter
, outer_args
, complain
);
26092 if ((flags
& LOOKUP_ONLYCONVERTING
)
26093 && DECL_NONCONVERTING_P (STRIP_TEMPLATE (guide
)))
26096 cands
= lookup_add (guide
, cands
);
26101 tree call
= error_mark_node
;
26103 /* If this is list-initialization and the class has a list constructor, first
26104 try deducing from the list as a single argument, as [over.match.list]. */
26105 tree list_cands
= NULL_TREE
;
26106 if (try_list_ctor
&& cands
)
26107 for (lkp_iterator
iter (cands
); iter
; ++iter
)
26110 if (is_list_ctor (dg
))
26111 list_cands
= lookup_add (dg
, list_cands
);
26115 ++cp_unevaluated_operand
;
26116 call
= build_new_function_call (list_cands
, &args
, tf_decltype
);
26117 --cp_unevaluated_operand
;
26119 if (call
== error_mark_node
)
26121 /* That didn't work, now try treating the list as a sequence of
26123 release_tree_vector (args
);
26124 args
= make_tree_vector_from_ctor (init
);
26128 /* Maybe generate an implicit deduction guide. */
26129 if (call
== error_mark_node
&& args
->length () < 2)
26131 tree gtype
= NULL_TREE
;
26133 if (args
->length () == 1)
26134 /* Generate a copy guide. */
26135 gtype
= build_reference_type (type
);
26136 else if (!saw_ctor
)
26137 /* Generate a default guide. */
26142 tree guide
= build_deduction_guide (gtype
, outer_args
, complain
);
26143 cands
= lookup_add (guide
, cands
);
26147 if (elided
&& !cands
)
26149 error ("cannot deduce template arguments for copy-initialization"
26150 " of %qT, as it has no non-explicit deduction guides or "
26151 "user-declared constructors", type
);
26152 return error_mark_node
;
26154 else if (!cands
&& call
== error_mark_node
)
26156 error ("cannot deduce template arguments of %qT, as it has no viable "
26157 "deduction guides", type
);
26158 return error_mark_node
;
26161 if (call
== error_mark_node
)
26163 ++cp_unevaluated_operand
;
26164 call
= build_new_function_call (cands
, &args
, tf_decltype
);
26165 --cp_unevaluated_operand
;
26168 if (call
== error_mark_node
&& (complain
& tf_warning_or_error
))
26170 error ("class template argument deduction failed:");
26172 ++cp_unevaluated_operand
;
26173 call
= build_new_function_call (cands
, &args
, complain
| tf_decltype
);
26174 --cp_unevaluated_operand
;
26177 inform (input_location
, "explicit deduction guides not considered "
26178 "for copy-initialization");
26181 release_tree_vector (args
);
26183 return cp_build_qualified_type (TREE_TYPE (call
), cp_type_quals (ptype
));
26186 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
26187 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
26188 The CONTEXT determines the context in which auto deduction is performed
26189 and is used to control error diagnostics. FLAGS are the LOOKUP_* flags.
26190 OUTER_TARGS are used during template argument deduction
26191 (context == adc_unify) to properly substitute the result, and is ignored
26194 For partial-concept-ids, extra args may be appended to the list of deduced
26195 template arguments prior to determining constraint satisfaction. */
26198 do_auto_deduction (tree type
, tree init
, tree auto_node
,
26199 tsubst_flags_t complain
, auto_deduction_context context
,
26200 tree outer_targs
, int flags
)
26204 if (init
== error_mark_node
)
26205 return error_mark_node
;
26207 if (init
&& type_dependent_expression_p (init
)
26208 && context
!= adc_unify
)
26209 /* Defining a subset of type-dependent expressions that we can deduce
26210 from ahead of time isn't worth the trouble. */
26213 /* Similarly, we can't deduce from another undeduced decl. */
26214 if (init
&& undeduced_auto_decl (init
))
26217 if (tree tmpl
= CLASS_PLACEHOLDER_TEMPLATE (auto_node
))
26218 /* C++17 class template argument deduction. */
26219 return do_class_deduction (type
, tmpl
, init
, flags
, complain
);
26221 if (init
== NULL_TREE
|| TREE_TYPE (init
) == NULL_TREE
)
26222 /* Nothing we can do with this, even in deduction context. */
26225 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
26226 with either a new invented type template parameter U or, if the
26227 initializer is a braced-init-list (8.5.4), with
26228 std::initializer_list<U>. */
26229 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
26231 if (!DIRECT_LIST_INIT_P (init
))
26232 type
= listify_autos (type
, auto_node
);
26233 else if (CONSTRUCTOR_NELTS (init
) == 1)
26234 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
26237 if (complain
& tf_warning_or_error
)
26239 if (permerror (input_location
, "direct-list-initialization of "
26240 "%<auto%> requires exactly one element"))
26241 inform (input_location
,
26242 "for deduction to %<std::initializer_list%>, use copy-"
26243 "list-initialization (i.e. add %<=%> before the %<{%>)");
26245 type
= listify_autos (type
, auto_node
);
26249 if (type
== error_mark_node
)
26250 return error_mark_node
;
26252 init
= resolve_nondeduced_context (init
, complain
);
26254 if (context
== adc_decomp_type
26255 && auto_node
== type
26256 && init
!= error_mark_node
26257 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
26258 /* [dcl.decomp]/1 - if decomposition declaration has no ref-qualifiers
26259 and initializer has array type, deduce cv-qualified array type. */
26260 return cp_build_qualified_type_real (TREE_TYPE (init
), TYPE_QUALS (type
),
26262 else if (AUTO_IS_DECLTYPE (auto_node
))
26264 bool id
= (DECL_P (init
)
26265 || ((TREE_CODE (init
) == COMPONENT_REF
26266 || TREE_CODE (init
) == SCOPE_REF
)
26267 && !REF_PARENTHESIZED_P (init
)));
26268 targs
= make_tree_vec (1);
26269 TREE_VEC_ELT (targs
, 0)
26270 = finish_decltype_type (init
, id
, tf_warning_or_error
);
26271 if (type
!= auto_node
)
26273 if (complain
& tf_error
)
26274 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
26275 return error_mark_node
;
26280 tree parms
= build_tree_list (NULL_TREE
, type
);
26284 tparms
= extract_autos (type
);
26287 tparms
= make_tree_vec (1);
26288 TREE_VEC_ELT (tparms
, 0)
26289 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
26292 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
26293 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
26294 DEDUCE_CALL
, LOOKUP_NORMAL
,
26295 NULL
, /*explain_p=*/false);
26298 if (processing_template_decl
)
26299 /* Try again at instantiation time. */
26301 if (type
&& type
!= error_mark_node
26302 && (complain
& tf_error
))
26303 /* If type is error_mark_node a diagnostic must have been
26304 emitted by now. Also, having a mention to '<type error>'
26305 in the diagnostic is not really useful to the user. */
26307 if (cfun
&& auto_node
== current_function_auto_return_pattern
26308 && LAMBDA_FUNCTION_P (current_function_decl
))
26309 error ("unable to deduce lambda return type from %qE", init
);
26311 error ("unable to deduce %qT from %qE", type
, init
);
26312 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
26313 DEDUCE_CALL
, LOOKUP_NORMAL
,
26314 NULL
, /*explain_p=*/true);
26316 return error_mark_node
;
26320 /* Check any placeholder constraints against the deduced type. */
26321 if (flag_concepts
&& !processing_template_decl
)
26322 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
26324 /* Use the deduced type to check the associated constraints. If we
26325 have a partial-concept-id, rebuild the argument list so that
26326 we check using the extra arguments. */
26327 gcc_assert (TREE_CODE (constr
) == CHECK_CONSTR
);
26328 tree cargs
= CHECK_CONSTR_ARGS (constr
);
26329 if (TREE_VEC_LENGTH (cargs
) > 1)
26331 cargs
= copy_node (cargs
);
26332 TREE_VEC_ELT (cargs
, 0) = TREE_VEC_ELT (targs
, 0);
26336 if (!constraints_satisfied_p (constr
, cargs
))
26338 if (complain
& tf_warning_or_error
)
26342 case adc_unspecified
:
26344 error("placeholder constraints not satisfied");
26346 case adc_variable_type
:
26347 case adc_decomp_type
:
26348 error ("deduced initializer does not satisfy "
26349 "placeholder constraints");
26351 case adc_return_type
:
26352 error ("deduced return type does not satisfy "
26353 "placeholder constraints");
26355 case adc_requirement
:
26356 error ("deduced expression type does not satisfy "
26357 "placeholder constraints");
26360 diagnose_constraints (input_location
, constr
, targs
);
26362 return error_mark_node
;
26366 if (processing_template_decl
&& context
!= adc_unify
)
26367 outer_targs
= current_template_args ();
26368 targs
= add_to_template_args (outer_targs
, targs
);
26369 return tsubst (type
, targs
, complain
, NULL_TREE
);
26372 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
26376 splice_late_return_type (tree type
, tree late_return_type
)
26378 if (is_auto (type
))
26380 if (late_return_type
)
26381 return late_return_type
;
26383 tree idx
= get_template_parm_index (type
);
26384 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
26385 /* In an abbreviated function template we didn't know we were dealing
26386 with a function template when we saw the auto return type, so update
26387 it to have the correct level. */
26388 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
26393 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
26394 'decltype(auto)' or a deduced class template. */
26397 is_auto (const_tree type
)
26399 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
26400 && (TYPE_IDENTIFIER (type
) == auto_identifier
26401 || TYPE_IDENTIFIER (type
) == decltype_auto_identifier
26402 || CLASS_PLACEHOLDER_TEMPLATE (type
)))
26408 /* for_each_template_parm callback for type_uses_auto. */
26411 is_auto_r (tree tp
, void */
*data*/
)
26413 return is_auto (tp
);
26416 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
26417 a use of `auto'. Returns NULL_TREE otherwise. */
26420 type_uses_auto (tree type
)
26422 if (type
== NULL_TREE
)
26424 else if (flag_concepts
)
26426 /* The Concepts TS allows multiple autos in one type-specifier; just
26427 return the first one we find, do_auto_deduction will collect all of
26429 if (uses_template_parms (type
))
26430 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
26431 /*visited*/NULL
, /*nondeduced*/true);
26436 return find_type_usage (type
, is_auto
);
26439 /* For a given template T, return the vector of typedefs referenced
26440 in T for which access check is needed at T instantiation time.
26441 T is either a FUNCTION_DECL or a RECORD_TYPE.
26442 Those typedefs were added to T by the function
26443 append_type_to_template_for_access_check. */
26445 vec
<qualified_typedef_usage_t
, va_gc
> *
26446 get_types_needing_access_check (tree t
)
26449 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
26451 if (!t
|| t
== error_mark_node
)
26454 if (!(ti
= get_template_info (t
)))
26457 if (CLASS_TYPE_P (t
)
26458 || TREE_CODE (t
) == FUNCTION_DECL
)
26460 if (!TI_TEMPLATE (ti
))
26463 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
26469 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
26470 tied to T. That list of typedefs will be access checked at
26471 T instantiation time.
26472 T is either a FUNCTION_DECL or a RECORD_TYPE.
26473 TYPE_DECL is a TYPE_DECL node representing a typedef.
26474 SCOPE is the scope through which TYPE_DECL is accessed.
26475 LOCATION is the location of the usage point of TYPE_DECL.
26477 This function is a subroutine of
26478 append_type_to_template_for_access_check. */
26481 append_type_to_template_for_access_check_1 (tree t
,
26484 location_t location
)
26486 qualified_typedef_usage_t typedef_usage
;
26489 if (!t
|| t
== error_mark_node
)
26492 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
26493 || CLASS_TYPE_P (t
))
26495 && TREE_CODE (type_decl
) == TYPE_DECL
26498 if (!(ti
= get_template_info (t
)))
26501 gcc_assert (TI_TEMPLATE (ti
));
26503 typedef_usage
.typedef_decl
= type_decl
;
26504 typedef_usage
.context
= scope
;
26505 typedef_usage
.locus
= location
;
26507 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
26510 /* Append TYPE_DECL to the template TEMPL.
26511 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
26512 At TEMPL instanciation time, TYPE_DECL will be checked to see
26513 if it can be accessed through SCOPE.
26514 LOCATION is the location of the usage point of TYPE_DECL.
26516 e.g. consider the following code snippet:
26523 template<class U> struct S
26525 C::myint mi; // <-- usage point of the typedef C::myint
26530 At S<char> instantiation time, we need to check the access of C::myint
26531 In other words, we need to check the access of the myint typedef through
26532 the C scope. For that purpose, this function will add the myint typedef
26533 and the scope C through which its being accessed to a list of typedefs
26534 tied to the template S. That list will be walked at template instantiation
26535 time and access check performed on each typedefs it contains.
26536 Note that this particular code snippet should yield an error because
26537 myint is private to C. */
26540 append_type_to_template_for_access_check (tree templ
,
26543 location_t location
)
26545 qualified_typedef_usage_t
*iter
;
26548 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
26550 /* Make sure we don't append the type to the template twice. */
26551 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
26552 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
26555 append_type_to_template_for_access_check_1 (templ
, type_decl
,
26559 /* Convert the generic type parameters in PARM that match the types given in the
26560 range [START_IDX, END_IDX) from the current_template_parms into generic type
26564 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
26566 tree current
= current_template_parms
;
26567 int depth
= TMPL_PARMS_DEPTH (current
);
26568 current
= INNERMOST_TEMPLATE_PARMS (current
);
26569 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
26571 for (int i
= 0; i
< start_idx
; ++i
)
26572 TREE_VEC_ELT (replacement
, i
)
26573 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
26575 for (int i
= start_idx
; i
< end_idx
; ++i
)
26577 /* Create a distinct parameter pack type from the current parm and add it
26578 to the replacement args to tsubst below into the generic function
26581 tree o
= TREE_TYPE (TREE_VALUE
26582 (TREE_VEC_ELT (current
, i
)));
26583 tree t
= copy_type (o
);
26584 TEMPLATE_TYPE_PARM_INDEX (t
)
26585 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
26587 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
26588 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
26589 TYPE_MAIN_VARIANT (t
) = t
;
26590 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
26591 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
26592 TREE_VEC_ELT (replacement
, i
) = t
;
26593 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
26596 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
26597 TREE_VEC_ELT (replacement
, i
)
26598 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
26600 /* If there are more levels then build up the replacement with the outer
26603 replacement
= add_to_template_args (template_parms_to_args
26604 (TREE_CHAIN (current_template_parms
)),
26607 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
26610 /* Entries in the decl_constraint hash table. */
26611 struct GTY((for_user
)) constr_entry
26617 /* Hashing function and equality for constraint entries. */
26618 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
26620 static hashval_t
hash (constr_entry
*e
)
26622 return (hashval_t
)DECL_UID (e
->decl
);
26625 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
26627 return e1
->decl
== e2
->decl
;
26631 /* A mapping from declarations to constraint information. Note that
26632 both templates and their underlying declarations are mapped to the
26633 same constraint information.
26635 FIXME: This is defined in pt.c because garbage collection
26636 code is not being generated for constraint.cc. */
26638 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
26640 /* Returns the template constraints of declaration T. If T is not
26641 constrained, return NULL_TREE. Note that T must be non-null. */
26644 get_constraints (tree t
)
26646 if (!flag_concepts
)
26649 gcc_assert (DECL_P (t
));
26650 if (TREE_CODE (t
) == TEMPLATE_DECL
)
26651 t
= DECL_TEMPLATE_RESULT (t
);
26652 constr_entry elt
= { t
, NULL_TREE
};
26653 constr_entry
* found
= decl_constraints
->find (&elt
);
26660 /* Associate the given constraint information CI with the declaration
26661 T. If T is a template, then the constraints are associated with
26662 its underlying declaration. Don't build associations if CI is
26666 set_constraints (tree t
, tree ci
)
26670 gcc_assert (t
&& flag_concepts
);
26671 if (TREE_CODE (t
) == TEMPLATE_DECL
)
26672 t
= DECL_TEMPLATE_RESULT (t
);
26673 gcc_assert (!get_constraints (t
));
26674 constr_entry elt
= {t
, ci
};
26675 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
26676 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
26681 /* Remove the associated constraints of the declaration T. */
26684 remove_constraints (tree t
)
26686 gcc_assert (DECL_P (t
));
26687 if (TREE_CODE (t
) == TEMPLATE_DECL
)
26688 t
= DECL_TEMPLATE_RESULT (t
);
26690 constr_entry elt
= {t
, NULL_TREE
};
26691 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
26693 decl_constraints
->clear_slot (slot
);
26696 /* Memoized satisfaction results for declarations. This
26697 maps the pair (constraint_info, arguments) to the result computed
26698 by constraints_satisfied_p. */
26700 struct GTY((for_user
)) constraint_sat_entry
26707 /* Hashing function and equality for constraint entries. */
26709 struct constraint_sat_hasher
: ggc_ptr_hash
<constraint_sat_entry
>
26711 static hashval_t
hash (constraint_sat_entry
*e
)
26713 hashval_t val
= iterative_hash_object(e
->ci
, 0);
26714 return iterative_hash_template_arg (e
->args
, val
);
26717 static bool equal (constraint_sat_entry
*e1
, constraint_sat_entry
*e2
)
26719 return e1
->ci
== e2
->ci
&& comp_template_args (e1
->args
, e2
->args
);
26723 /* Memoized satisfaction results for concept checks. */
26725 struct GTY((for_user
)) concept_spec_entry
26732 /* Hashing function and equality for constraint entries. */
26734 struct concept_spec_hasher
: ggc_ptr_hash
<concept_spec_entry
>
26736 static hashval_t
hash (concept_spec_entry
*e
)
26738 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
26741 static bool equal (concept_spec_entry
*e1
, concept_spec_entry
*e2
)
26743 ++comparing_specializations
;
26744 bool eq
= e1
->tmpl
== e2
->tmpl
&& comp_template_args (e1
->args
, e2
->args
);
26745 --comparing_specializations
;
26750 static GTY (()) hash_table
<constraint_sat_hasher
> *constraint_memos
;
26751 static GTY (()) hash_table
<concept_spec_hasher
> *concept_memos
;
26753 /* Search for a memoized satisfaction result. Returns one of the
26754 truth value nodes if previously memoized, or NULL_TREE otherwise. */
26757 lookup_constraint_satisfaction (tree ci
, tree args
)
26759 constraint_sat_entry elt
= { ci
, args
, NULL_TREE
};
26760 constraint_sat_entry
* found
= constraint_memos
->find (&elt
);
26762 return found
->result
;
26767 /* Memoize the result of a satisfication test. Returns the saved result. */
26770 memoize_constraint_satisfaction (tree ci
, tree args
, tree result
)
26772 constraint_sat_entry elt
= {ci
, args
, result
};
26773 constraint_sat_entry
** slot
= constraint_memos
->find_slot (&elt
, INSERT
);
26774 constraint_sat_entry
* entry
= ggc_alloc
<constraint_sat_entry
> ();
26780 /* Search for a memoized satisfaction result for a concept. */
26783 lookup_concept_satisfaction (tree tmpl
, tree args
)
26785 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
26786 concept_spec_entry
* found
= concept_memos
->find (&elt
);
26788 return found
->result
;
26793 /* Memoize the result of a concept check. Returns the saved result. */
26796 memoize_concept_satisfaction (tree tmpl
, tree args
, tree result
)
26798 concept_spec_entry elt
= {tmpl
, args
, result
};
26799 concept_spec_entry
** slot
= concept_memos
->find_slot (&elt
, INSERT
);
26800 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
26806 static GTY (()) hash_table
<concept_spec_hasher
> *concept_expansions
;
26808 /* Returns a prior concept specialization. This returns the substituted
26809 and normalized constraints defined by the concept. */
26812 get_concept_expansion (tree tmpl
, tree args
)
26814 concept_spec_entry elt
= { tmpl
, args
, NULL_TREE
};
26815 concept_spec_entry
* found
= concept_expansions
->find (&elt
);
26817 return found
->result
;
26822 /* Save a concept expansion for later. */
26825 save_concept_expansion (tree tmpl
, tree args
, tree def
)
26827 concept_spec_entry elt
= {tmpl
, args
, def
};
26828 concept_spec_entry
** slot
= concept_expansions
->find_slot (&elt
, INSERT
);
26829 concept_spec_entry
* entry
= ggc_alloc
<concept_spec_entry
> ();
26836 hash_subsumption_args (tree t1
, tree t2
)
26838 gcc_assert (TREE_CODE (t1
) == CHECK_CONSTR
);
26839 gcc_assert (TREE_CODE (t2
) == CHECK_CONSTR
);
26841 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t1
), val
);
26842 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t1
), val
);
26843 val
= iterative_hash_object (CHECK_CONSTR_CONCEPT (t2
), val
);
26844 val
= iterative_hash_template_arg (CHECK_CONSTR_ARGS (t2
), val
);
26848 /* Compare the constraints of two subsumption entries. The LEFT1 and
26849 LEFT2 arguments comprise the first subsumption pair and the RIGHT1
26850 and RIGHT2 arguments comprise the second. These are all CHECK_CONSTRs. */
26853 comp_subsumption_args (tree left1
, tree left2
, tree right1
, tree right2
)
26855 if (CHECK_CONSTR_CONCEPT (left1
) == CHECK_CONSTR_CONCEPT (right1
))
26856 if (CHECK_CONSTR_CONCEPT (left2
) == CHECK_CONSTR_CONCEPT (right2
))
26857 if (comp_template_args (CHECK_CONSTR_ARGS (left1
),
26858 CHECK_CONSTR_ARGS (right1
)))
26859 return comp_template_args (CHECK_CONSTR_ARGS (left2
),
26860 CHECK_CONSTR_ARGS (right2
));
26864 /* Key/value pair for learning and memoizing subsumption results. This
26865 associates a pair of check constraints (including arguments) with
26866 a boolean value indicating the result. */
26868 struct GTY((for_user
)) subsumption_entry
26875 /* Hashing function and equality for constraint entries. */
26877 struct subsumption_hasher
: ggc_ptr_hash
<subsumption_entry
>
26879 static hashval_t
hash (subsumption_entry
*e
)
26881 return hash_subsumption_args (e
->t1
, e
->t2
);
26884 static bool equal (subsumption_entry
*e1
, subsumption_entry
*e2
)
26886 ++comparing_specializations
;
26887 bool eq
= comp_subsumption_args(e1
->t1
, e1
->t2
, e2
->t1
, e2
->t2
);
26888 --comparing_specializations
;
26893 static GTY (()) hash_table
<subsumption_hasher
> *subsumption_table
;
26895 /* Search for a previously cached subsumption result. */
26898 lookup_subsumption_result (tree t1
, tree t2
)
26900 subsumption_entry elt
= { t1
, t2
, false };
26901 subsumption_entry
* found
= subsumption_table
->find (&elt
);
26903 return &found
->result
;
26908 /* Save a subsumption result. */
26911 save_subsumption_result (tree t1
, tree t2
, bool result
)
26913 subsumption_entry elt
= {t1
, t2
, result
};
26914 subsumption_entry
** slot
= subsumption_table
->find_slot (&elt
, INSERT
);
26915 subsumption_entry
* entry
= ggc_alloc
<subsumption_entry
> ();
26921 /* Set up the hash table for constraint association. */
26924 init_constraint_processing (void)
26926 if (!flag_concepts
)
26929 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
26930 constraint_memos
= hash_table
<constraint_sat_hasher
>::create_ggc(37);
26931 concept_memos
= hash_table
<concept_spec_hasher
>::create_ggc(37);
26932 concept_expansions
= hash_table
<concept_spec_hasher
>::create_ggc(37);
26933 subsumption_table
= hash_table
<subsumption_hasher
>::create_ggc(37);
26936 /* __integer_pack(N) in a pack expansion expands to a sequence of numbers from
26940 declare_integer_pack (void)
26942 tree ipfn
= push_library_fn (get_identifier ("__integer_pack"),
26943 build_function_type_list (integer_type_node
,
26946 NULL_TREE
, ECF_CONST
);
26947 DECL_DECLARED_CONSTEXPR_P (ipfn
) = true;
26948 DECL_BUILT_IN_CLASS (ipfn
) = BUILT_IN_FRONTEND
;
26951 /* Set up the hash tables for template instantiations. */
26954 init_template_processing (void)
26956 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
26957 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
26959 if (cxx_dialect
>= cxx11
)
26960 declare_integer_pack ();
26963 /* Print stats about the template hash tables for -fstats. */
26966 print_template_statistics (void)
26968 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
26969 "%f collisions\n", (long) decl_specializations
->size (),
26970 (long) decl_specializations
->elements (),
26971 decl_specializations
->collisions ());
26972 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
26973 "%f collisions\n", (long) type_specializations
->size (),
26974 (long) type_specializations
->elements (),
26975 type_specializations
->collisions ());
26980 namespace selftest
{
26982 /* Verify that build_non_dependent_expr () works, for various expressions,
26983 and that location wrappers don't affect the results. */
26986 test_build_non_dependent_expr ()
26988 location_t loc
= BUILTINS_LOCATION
;
26990 /* Verify constants, without and with location wrappers. */
26991 tree int_cst
= build_int_cst (integer_type_node
, 42);
26992 ASSERT_EQ (int_cst
, build_non_dependent_expr (int_cst
));
26994 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
26995 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
26996 ASSERT_EQ (wrapped_int_cst
, build_non_dependent_expr (wrapped_int_cst
));
26998 tree string_lit
= build_string (4, "foo");
26999 TREE_TYPE (string_lit
) = char_array_type_node
;
27000 string_lit
= fix_string_type (string_lit
);
27001 ASSERT_EQ (string_lit
, build_non_dependent_expr (string_lit
));
27003 tree wrapped_string_lit
= maybe_wrap_with_location (string_lit
, loc
);
27004 ASSERT_TRUE (location_wrapper_p (wrapped_string_lit
));
27005 ASSERT_EQ (wrapped_string_lit
,
27006 build_non_dependent_expr (wrapped_string_lit
));
27009 /* Verify that type_dependent_expression_p () works correctly, even
27010 in the presence of location wrapper nodes. */
27013 test_type_dependent_expression_p ()
27015 location_t loc
= BUILTINS_LOCATION
;
27017 tree name
= get_identifier ("foo");
27019 /* If no templates are involved, nothing is type-dependent. */
27020 gcc_assert (!processing_template_decl
);
27021 ASSERT_FALSE (type_dependent_expression_p (name
));
27023 ++processing_template_decl
;
27025 /* Within a template, an unresolved name is always type-dependent. */
27026 ASSERT_TRUE (type_dependent_expression_p (name
));
27028 /* Ensure it copes with NULL_TREE and errors. */
27029 ASSERT_FALSE (type_dependent_expression_p (NULL_TREE
));
27030 ASSERT_FALSE (type_dependent_expression_p (error_mark_node
));
27032 /* A USING_DECL in a template should be type-dependent, even if wrapped
27033 with a location wrapper (PR c++/83799). */
27034 tree using_decl
= build_lang_decl (USING_DECL
, name
, NULL_TREE
);
27035 TREE_TYPE (using_decl
) = integer_type_node
;
27036 ASSERT_TRUE (type_dependent_expression_p (using_decl
));
27037 tree wrapped_using_decl
= maybe_wrap_with_location (using_decl
, loc
);
27038 ASSERT_TRUE (location_wrapper_p (wrapped_using_decl
));
27039 ASSERT_TRUE (type_dependent_expression_p (wrapped_using_decl
));
27041 --processing_template_decl
;
27044 /* Run all of the selftests within this file. */
27049 test_build_non_dependent_expr ();
27050 test_type_dependent_expression_p ();
27053 } // namespace selftest
27055 #endif /* #if CHECKING_P */
27057 #include "gt-cp-pt.h"