1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2016 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"
44 /* The type of functions taking a tree, and some additional data, and
46 typedef int (*tree_fn_t
) (tree
, void*);
48 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
49 instantiations have been deferred, either because their definitions
50 were not yet available, or because we were putting off doing the work. */
51 struct GTY ((chain_next ("%h.next"))) pending_template
{
52 struct pending_template
*next
;
53 struct tinst_level
*tinst
;
56 static GTY(()) struct pending_template
*pending_templates
;
57 static GTY(()) struct pending_template
*last_pending_template
;
59 int processing_template_parmlist
;
60 static int template_header_count
;
62 static GTY(()) tree saved_trees
;
63 static vec
<int> inline_parm_levels
;
65 static GTY(()) struct tinst_level
*current_tinst_level
;
67 static GTY(()) tree saved_access_scope
;
69 /* Live only within one (recursive) call to tsubst_expr. We use
70 this to pass the statement expression node from the STMT_EXPR
71 to the EXPR_STMT that is its result. */
72 static tree cur_stmt_expr
;
74 // -------------------------------------------------------------------------- //
75 // Local Specialization Stack
77 // Implementation of the RAII helper for creating new local
79 local_specialization_stack::local_specialization_stack ()
80 : saved (local_specializations
)
82 local_specializations
= new hash_map
<tree
, tree
>;
85 local_specialization_stack::~local_specialization_stack ()
87 delete local_specializations
;
88 local_specializations
= saved
;
91 /* True if we've recursed into fn_type_unification too many times. */
92 static bool excessive_deduction_depth
;
94 struct GTY((for_user
)) spec_entry
101 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
103 static hashval_t
hash (spec_entry
*);
104 static bool equal (spec_entry
*, spec_entry
*);
107 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
109 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
111 /* Contains canonical template parameter types. The vector is indexed by
112 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
113 TREE_LIST, whose TREE_VALUEs contain the canonical template
114 parameters of various types and levels. */
115 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
117 #define UNIFY_ALLOW_NONE 0
118 #define UNIFY_ALLOW_MORE_CV_QUAL 1
119 #define UNIFY_ALLOW_LESS_CV_QUAL 2
120 #define UNIFY_ALLOW_DERIVED 4
121 #define UNIFY_ALLOW_INTEGER 8
122 #define UNIFY_ALLOW_OUTER_LEVEL 16
123 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
124 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
126 enum template_base_result
{
128 tbr_ambiguous_baseclass
,
132 static void push_access_scope (tree
);
133 static void pop_access_scope (tree
);
134 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
135 unification_kind_t
, int,
137 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
138 unification_kind_t
, int, bool, bool);
139 static int unify (tree
, tree
, tree
, tree
, int, bool);
140 static void add_pending_template (tree
);
141 static tree
reopen_tinst_level (struct tinst_level
*);
142 static tree
tsubst_initializer_list (tree
, tree
);
143 static tree
get_partial_spec_bindings (tree
, tree
, tree
, tree
);
144 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
146 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
148 static void tsubst_enum (tree
, tree
, tree
);
149 static tree
add_to_template_args (tree
, tree
);
150 static tree
add_outermost_template_args (tree
, tree
);
151 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
152 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
154 static int type_unification_real (tree
, tree
, tree
, const tree
*,
155 unsigned int, int, unification_kind_t
, int,
156 vec
<deferred_access_check
, va_gc
> **,
158 static void note_template_header (int);
159 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
160 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
161 static tree
convert_template_argument (tree
, tree
, tree
,
162 tsubst_flags_t
, int, tree
);
163 static tree
for_each_template_parm (tree
, tree_fn_t
, void*,
164 hash_set
<tree
> *, bool);
165 static tree
expand_template_argument_pack (tree
);
166 static tree
build_template_parm_index (int, int, int, tree
, tree
);
167 static bool inline_needs_template_parms (tree
, bool);
168 static void push_inline_template_parms_recursive (tree
, int);
169 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
170 static int mark_template_parm (tree
, void *);
171 static int template_parm_this_level_p (tree
, void *);
172 static tree
tsubst_friend_function (tree
, tree
);
173 static tree
tsubst_friend_class (tree
, tree
);
174 static int can_complete_type_without_circularity (tree
);
175 static tree
get_bindings (tree
, tree
, tree
, bool);
176 static int template_decl_level (tree
);
177 static int check_cv_quals_for_unify (int, tree
, tree
);
178 static void template_parm_level_and_index (tree
, int*, int*);
179 static int unify_pack_expansion (tree
, tree
, tree
,
180 tree
, unification_kind_t
, bool, bool);
181 static tree
copy_template_args (tree
);
182 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
183 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
184 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
185 static void regenerate_decl_from_template (tree
, tree
);
186 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
187 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
188 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
189 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
190 static bool check_specialization_scope (void);
191 static tree
process_partial_specialization (tree
);
192 static void set_current_access_from_decl (tree
);
193 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
195 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
196 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
198 static bool template_template_parm_bindings_ok_p (tree
, tree
);
199 static int template_args_equal (tree
, tree
);
200 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
201 static tree
for_each_template_parm_r (tree
*, int *, void *);
202 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
203 static void copy_default_args_to_explicit_spec (tree
);
204 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
205 static bool dependent_template_arg_p (tree
);
206 static bool any_template_arguments_need_structural_equality_p (tree
);
207 static bool dependent_type_p_r (tree
);
208 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
209 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
210 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
211 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
213 static tree
listify (tree
);
214 static tree
listify_autos (tree
, tree
);
215 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
216 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
217 static bool complex_alias_template_p (const_tree tmpl
);
218 static tree
tsubst_attributes (tree
, tree
, tsubst_flags_t
, tree
);
220 /* Make the current scope suitable for access checking when we are
221 processing T. T can be FUNCTION_DECL for instantiated function
222 template, VAR_DECL for static member variable, or TYPE_DECL for
223 alias template (needed by instantiate_decl). */
226 push_access_scope (tree t
)
228 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
229 || TREE_CODE (t
) == TYPE_DECL
);
231 if (DECL_FRIEND_CONTEXT (t
))
232 push_nested_class (DECL_FRIEND_CONTEXT (t
));
233 else if (DECL_CLASS_SCOPE_P (t
))
234 push_nested_class (DECL_CONTEXT (t
));
236 push_to_top_level ();
238 if (TREE_CODE (t
) == FUNCTION_DECL
)
240 saved_access_scope
= tree_cons
241 (NULL_TREE
, current_function_decl
, saved_access_scope
);
242 current_function_decl
= t
;
246 /* Restore the scope set up by push_access_scope. T is the node we
250 pop_access_scope (tree t
)
252 if (TREE_CODE (t
) == FUNCTION_DECL
)
254 current_function_decl
= TREE_VALUE (saved_access_scope
);
255 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
258 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
261 pop_from_top_level ();
264 /* Do any processing required when DECL (a member template
265 declaration) is finished. Returns the TEMPLATE_DECL corresponding
266 to DECL, unless it is a specialization, in which case the DECL
267 itself is returned. */
270 finish_member_template_decl (tree decl
)
272 if (decl
== error_mark_node
)
273 return error_mark_node
;
275 gcc_assert (DECL_P (decl
));
277 if (TREE_CODE (decl
) == TYPE_DECL
)
281 type
= TREE_TYPE (decl
);
282 if (type
== error_mark_node
)
283 return error_mark_node
;
284 if (MAYBE_CLASS_TYPE_P (type
)
285 && CLASSTYPE_TEMPLATE_INFO (type
)
286 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
288 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
289 check_member_template (tmpl
);
294 else if (TREE_CODE (decl
) == FIELD_DECL
)
295 error ("data member %qD cannot be a member template", decl
);
296 else if (DECL_TEMPLATE_INFO (decl
))
298 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
300 check_member_template (DECL_TI_TEMPLATE (decl
));
301 return DECL_TI_TEMPLATE (decl
);
307 error ("invalid member template declaration %qD", decl
);
309 return error_mark_node
;
312 /* Create a template info node. */
315 build_template_info (tree template_decl
, tree template_args
)
317 tree result
= make_node (TEMPLATE_INFO
);
318 TI_TEMPLATE (result
) = template_decl
;
319 TI_ARGS (result
) = template_args
;
323 /* Return the template info node corresponding to T, whatever T is. */
326 get_template_info (const_tree t
)
328 tree tinfo
= NULL_TREE
;
330 if (!t
|| t
== error_mark_node
)
333 if (TREE_CODE (t
) == NAMESPACE_DECL
334 || TREE_CODE (t
) == PARM_DECL
)
337 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
338 tinfo
= DECL_TEMPLATE_INFO (t
);
340 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
343 if (OVERLOAD_TYPE_P (t
))
344 tinfo
= TYPE_TEMPLATE_INFO (t
);
345 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
346 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
351 /* Returns the template nesting level of the indicated class TYPE.
361 A<T>::B<U> has depth two, while A<T> has depth one.
362 Both A<T>::B<int> and A<int>::B<U> have depth one, if
363 they are instantiations, not specializations.
365 This function is guaranteed to return 0 if passed NULL_TREE so
366 that, for example, `template_class_depth (current_class_type)' is
370 template_class_depth (tree type
)
374 for (depth
= 0; type
&& TREE_CODE (type
) != NAMESPACE_DECL
; )
376 tree tinfo
= get_template_info (type
);
378 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
379 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
383 type
= CP_DECL_CONTEXT (type
);
384 else if (LAMBDA_TYPE_P (type
))
385 type
= LAMBDA_TYPE_EXTRA_SCOPE (type
);
387 type
= CP_TYPE_CONTEXT (type
);
393 /* Subroutine of maybe_begin_member_template_processing.
394 Returns true if processing DECL needs us to push template parms. */
397 inline_needs_template_parms (tree decl
, bool nsdmi
)
399 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
402 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
403 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
406 /* Subroutine of maybe_begin_member_template_processing.
407 Push the template parms in PARMS, starting from LEVELS steps into the
408 chain, and ending at the beginning, since template parms are listed
412 push_inline_template_parms_recursive (tree parmlist
, int levels
)
414 tree parms
= TREE_VALUE (parmlist
);
418 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
420 ++processing_template_decl
;
421 current_template_parms
422 = tree_cons (size_int (processing_template_decl
),
423 parms
, current_template_parms
);
424 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
426 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
428 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
430 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
432 if (error_operand_p (parm
))
435 gcc_assert (DECL_P (parm
));
437 switch (TREE_CODE (parm
))
445 /* Push the CONST_DECL. */
446 pushdecl (TEMPLATE_PARM_DECL (DECL_INITIAL (parm
)));
455 /* Restore the template parameter context for a member template, a
456 friend template defined in a class definition, or a non-template
457 member of template class. */
460 maybe_begin_member_template_processing (tree decl
)
464 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
468 tree ctx
= DECL_CONTEXT (decl
);
469 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
470 /* Disregard full specializations (c++/60999). */
471 && uses_template_parms (ctx
)
472 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
475 if (inline_needs_template_parms (decl
, nsdmi
))
477 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
478 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
480 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
483 parms
= TREE_CHAIN (parms
);
486 push_inline_template_parms_recursive (parms
, levels
);
489 /* Remember how many levels of template parameters we pushed so that
490 we can pop them later. */
491 inline_parm_levels
.safe_push (levels
);
494 /* Undo the effects of maybe_begin_member_template_processing. */
497 maybe_end_member_template_processing (void)
502 if (inline_parm_levels
.length () == 0)
505 last
= inline_parm_levels
.pop ();
506 for (i
= 0; i
< last
; ++i
)
508 --processing_template_decl
;
509 current_template_parms
= TREE_CHAIN (current_template_parms
);
514 /* Return a new template argument vector which contains all of ARGS,
515 but has as its innermost set of arguments the EXTRA_ARGS. */
518 add_to_template_args (tree args
, tree extra_args
)
525 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
528 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
529 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
531 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
532 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
534 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
535 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
540 /* Like add_to_template_args, but only the outermost ARGS are added to
541 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
542 (EXTRA_ARGS) levels are added. This function is used to combine
543 the template arguments from a partial instantiation with the
544 template arguments used to attain the full instantiation from the
545 partial instantiation. */
548 add_outermost_template_args (tree args
, tree extra_args
)
552 /* If there are more levels of EXTRA_ARGS than there are ARGS,
553 something very fishy is going on. */
554 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
556 /* If *all* the new arguments will be the EXTRA_ARGS, just return
558 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
561 /* For the moment, we make ARGS look like it contains fewer levels. */
562 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
564 new_args
= add_to_template_args (args
, extra_args
);
566 /* Now, we restore ARGS to its full dimensions. */
567 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
572 /* Return the N levels of innermost template arguments from the ARGS. */
575 get_innermost_template_args (tree args
, int n
)
583 /* If N is 1, just return the innermost set of template arguments. */
585 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
587 /* If we're not removing anything, just return the arguments we were
589 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
590 gcc_assert (extra_levels
>= 0);
591 if (extra_levels
== 0)
594 /* Make a new set of arguments, not containing the outer arguments. */
595 new_args
= make_tree_vec (n
);
596 for (i
= 1; i
<= n
; ++i
)
597 SET_TMPL_ARGS_LEVEL (new_args
, i
,
598 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
603 /* The inverse of get_innermost_template_args: Return all but the innermost
604 EXTRA_LEVELS levels of template arguments from the ARGS. */
607 strip_innermost_template_args (tree args
, int extra_levels
)
610 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
615 /* If N is 1, just return the outermost set of template arguments. */
617 return TMPL_ARGS_LEVEL (args
, 1);
619 /* If we're not removing anything, just return the arguments we were
621 gcc_assert (extra_levels
>= 0);
622 if (extra_levels
== 0)
625 /* Make a new set of arguments, not containing the inner arguments. */
626 new_args
= make_tree_vec (n
);
627 for (i
= 1; i
<= n
; ++i
)
628 SET_TMPL_ARGS_LEVEL (new_args
, i
,
629 TMPL_ARGS_LEVEL (args
, i
));
634 /* We've got a template header coming up; push to a new level for storing
638 begin_template_parm_list (void)
640 /* We use a non-tag-transparent scope here, which causes pushtag to
641 put tags in this scope, rather than in the enclosing class or
642 namespace scope. This is the right thing, since we want
643 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
644 global template class, push_template_decl handles putting the
645 TEMPLATE_DECL into top-level scope. For a nested template class,
648 template <class T> struct S1 {
649 template <class T> struct S2 {};
652 pushtag contains special code to call pushdecl_with_scope on the
653 TEMPLATE_DECL for S2. */
654 begin_scope (sk_template_parms
, NULL
);
655 ++processing_template_decl
;
656 ++processing_template_parmlist
;
657 note_template_header (0);
659 /* Add a dummy parameter level while we process the parameter list. */
660 current_template_parms
661 = tree_cons (size_int (processing_template_decl
),
663 current_template_parms
);
666 /* This routine is called when a specialization is declared. If it is
667 invalid to declare a specialization here, an error is reported and
668 false is returned, otherwise this routine will return true. */
671 check_specialization_scope (void)
673 tree scope
= current_scope ();
677 An explicit specialization shall be declared in the namespace of
678 which the template is a member, or, for member templates, in the
679 namespace of which the enclosing class or enclosing class
680 template is a member. An explicit specialization of a member
681 function, member class or static data member of a class template
682 shall be declared in the namespace of which the class template
684 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
686 error ("explicit specialization in non-namespace scope %qD", scope
);
692 In an explicit specialization declaration for a member of a class
693 template or a member template that appears in namespace scope,
694 the member template and some of its enclosing class templates may
695 remain unspecialized, except that the declaration shall not
696 explicitly specialize a class member template if its enclosing
697 class templates are not explicitly specialized as well. */
698 if (current_template_parms
)
700 error ("enclosing class templates are not explicitly specialized");
707 /* We've just seen template <>. */
710 begin_specialization (void)
712 begin_scope (sk_template_spec
, NULL
);
713 note_template_header (1);
714 return check_specialization_scope ();
717 /* Called at then end of processing a declaration preceded by
721 end_specialization (void)
724 reset_specialization ();
727 /* Any template <>'s that we have seen thus far are not referring to a
728 function specialization. */
731 reset_specialization (void)
733 processing_specialization
= 0;
734 template_header_count
= 0;
737 /* We've just seen a template header. If SPECIALIZATION is nonzero,
738 it was of the form template <>. */
741 note_template_header (int specialization
)
743 processing_specialization
= specialization
;
744 template_header_count
++;
747 /* We're beginning an explicit instantiation. */
750 begin_explicit_instantiation (void)
752 gcc_assert (!processing_explicit_instantiation
);
753 processing_explicit_instantiation
= true;
758 end_explicit_instantiation (void)
760 gcc_assert (processing_explicit_instantiation
);
761 processing_explicit_instantiation
= false;
764 /* An explicit specialization or partial specialization of TMPL is being
765 declared. Check that the namespace in which the specialization is
766 occurring is permissible. Returns false iff it is invalid to
767 specialize TMPL in the current namespace. */
770 check_specialization_namespace (tree tmpl
)
772 tree tpl_ns
= decl_namespace_context (tmpl
);
776 An explicit specialization shall be declared in the namespace of
777 which the template is a member, or, for member templates, in the
778 namespace of which the enclosing class or enclosing class
779 template is a member. An explicit specialization of a member
780 function, member class or static data member of a class template
781 shall be declared in the namespace of which the class template is
783 if (current_scope() != DECL_CONTEXT (tmpl
)
784 && !at_namespace_scope_p ())
786 error ("specialization of %qD must appear at namespace scope", tmpl
);
789 if (is_associated_namespace (current_namespace
, tpl_ns
))
790 /* Same or super-using namespace. */
794 permerror (input_location
,
795 "specialization of %qD in different namespace", tmpl
);
796 permerror (DECL_SOURCE_LOCATION (tmpl
),
797 " from definition of %q#D", tmpl
);
802 /* SPEC is an explicit instantiation. Check that it is valid to
803 perform this explicit instantiation in the current namespace. */
806 check_explicit_instantiation_namespace (tree spec
)
810 /* DR 275: An explicit instantiation shall appear in an enclosing
811 namespace of its template. */
812 ns
= decl_namespace_context (spec
);
813 if (!is_ancestor (current_namespace
, ns
))
814 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
815 "(which does not enclose namespace %qD)",
816 spec
, current_namespace
, ns
);
819 // Returns the type of a template specialization only if that
820 // specialization needs to be defined. Otherwise (e.g., if the type has
821 // already been defined), the function returns NULL_TREE.
823 maybe_new_partial_specialization (tree type
)
825 // An implicit instantiation of an incomplete type implies
826 // the definition of a new class template.
828 // template<typename T>
831 // template<typename T>
834 // Here, S<T*> is an implicit instantiation of S whose type
836 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
839 // It can also be the case that TYPE is a completed specialization.
840 // Continuing the previous example, suppose we also declare:
842 // template<typename T>
843 // requires Integral<T>
846 // Here, S<T*> refers to the specialization S<T*> defined
847 // above. However, we need to differentiate definitions because
848 // we intend to define a new partial specialization. In this case,
849 // we rely on the fact that the constraints are different for
850 // this declaration than that above.
852 // Note that we also get here for injected class names and
853 // late-parsed template definitions. We must ensure that we
854 // do not create new type declarations for those cases.
855 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
857 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
858 tree args
= CLASSTYPE_TI_ARGS (type
);
860 // If there are no template parameters, this cannot be a new
861 // partial template specializtion?
862 if (!current_template_parms
)
865 // The injected-class-name is not a new partial specialization.
866 if (DECL_SELF_REFERENCE_P (TYPE_NAME (type
)))
869 // If the constraints are not the same as those of the primary
870 // then, we can probably create a new specialization.
871 tree type_constr
= current_template_constraints ();
873 if (type
== TREE_TYPE (tmpl
))
875 tree main_constr
= get_constraints (tmpl
);
876 if (equivalent_constraints (type_constr
, main_constr
))
880 // Also, if there's a pre-existing specialization with matching
881 // constraints, then this also isn't new.
882 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
885 tree spec_tmpl
= TREE_VALUE (specs
);
886 tree spec_args
= TREE_PURPOSE (specs
);
887 tree spec_constr
= get_constraints (spec_tmpl
);
888 if (comp_template_args (args
, spec_args
)
889 && equivalent_constraints (type_constr
, spec_constr
))
891 specs
= TREE_CHAIN (specs
);
894 // Create a new type node (and corresponding type decl)
895 // for the newly declared specialization.
896 tree t
= make_class_type (TREE_CODE (type
));
897 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
898 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (type
);
899 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
901 /* We only need a separate type node for storing the definition of this
902 partial specialization; uses of S<T*> are unconstrained, so all are
903 equivalent. So keep TYPE_CANONICAL the same. */
904 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
906 // Build the corresponding type decl.
907 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
908 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
909 DECL_SOURCE_LOCATION (d
) = input_location
;
917 /* The TYPE is being declared. If it is a template type, that means it
918 is a partial specialization. Do appropriate error-checking. */
921 maybe_process_partial_specialization (tree type
)
925 if (type
== error_mark_node
)
926 return error_mark_node
;
928 /* A lambda that appears in specialization context is not itself a
930 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
933 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
935 error ("name of class shadows template template parameter %qD",
937 return error_mark_node
;
940 context
= TYPE_CONTEXT (type
);
942 if (TYPE_ALIAS_P (type
))
944 if (TYPE_TEMPLATE_INFO (type
)
945 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
946 error ("specialization of alias template %qD",
947 TYPE_TI_TEMPLATE (type
));
949 error ("explicit specialization of non-template %qT", type
);
950 return error_mark_node
;
952 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
954 /* This is for ordinary explicit specialization and partial
955 specialization of a template class such as:
957 template <> class C<int>;
961 template <class T> class C<T*>;
963 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
965 if (tree t
= maybe_new_partial_specialization (type
))
967 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
968 && !at_namespace_scope_p ())
969 return error_mark_node
;
970 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
971 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
972 if (processing_template_decl
)
974 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
975 if (decl
== error_mark_node
)
976 return error_mark_node
;
977 return TREE_TYPE (decl
);
980 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
981 error ("specialization of %qT after instantiation", type
);
982 else if (errorcount
&& !processing_specialization
983 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
984 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
985 /* Trying to define a specialization either without a template<> header
986 or in an inappropriate place. We've already given an error, so just
987 bail now so we don't actually define the specialization. */
988 return error_mark_node
;
990 else if (CLASS_TYPE_P (type
)
991 && !CLASSTYPE_USE_TEMPLATE (type
)
992 && CLASSTYPE_TEMPLATE_INFO (type
)
993 && context
&& CLASS_TYPE_P (context
)
994 && CLASSTYPE_TEMPLATE_INFO (context
))
996 /* This is for an explicit specialization of member class
997 template according to [temp.expl.spec/18]:
999 template <> template <class U> class C<int>::D;
1001 The context `C<int>' must be an implicit instantiation.
1002 Otherwise this is just a member class template declared
1005 template <> class C<int> { template <class U> class D; };
1006 template <> template <class U> class C<int>::D;
1008 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1009 while in the second case, `C<int>::D' is a primary template
1010 and `C<T>::D' may not exist. */
1012 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1013 && !COMPLETE_TYPE_P (type
))
1016 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1018 if (current_namespace
1019 != decl_namespace_context (tmpl
))
1021 permerror (input_location
,
1022 "specializing %q#T in different namespace", type
);
1023 permerror (DECL_SOURCE_LOCATION (tmpl
),
1024 " from definition of %q#D", tmpl
);
1027 /* Check for invalid specialization after instantiation:
1029 template <> template <> class C<int>::D<int>;
1030 template <> template <class U> class C<int>::D; */
1032 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1033 t
; t
= TREE_CHAIN (t
))
1035 tree inst
= TREE_VALUE (t
);
1036 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1037 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1039 /* We already have a full specialization of this partial
1040 instantiation, or a full specialization has been
1041 looked up but not instantiated. Reassign it to the
1042 new member specialization template. */
1046 elt
.tmpl
= most_general_template (tmpl
);
1047 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1050 type_specializations
->remove_elt (&elt
);
1053 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1056 = type_specializations
->find_slot (&elt
, INSERT
);
1057 entry
= ggc_alloc
<spec_entry
> ();
1062 /* But if we've had an implicit instantiation, that's a
1063 problem ([temp.expl.spec]/6). */
1064 error ("specialization %qT after instantiation %qT",
1068 /* Mark TYPE as a specialization. And as a result, we only
1069 have one level of template argument for the innermost
1071 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1072 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1073 CLASSTYPE_TI_ARGS (type
)
1074 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1077 else if (processing_specialization
)
1079 /* Someday C++0x may allow for enum template specialization. */
1080 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1081 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1082 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1083 "of %qD not allowed by ISO C++", type
);
1086 error ("explicit specialization of non-template %qT", type
);
1087 return error_mark_node
;
1094 /* Returns nonzero if we can optimize the retrieval of specializations
1095 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1096 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1099 optimize_specialization_lookup_p (tree tmpl
)
1101 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1102 && DECL_CLASS_SCOPE_P (tmpl
)
1103 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1105 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1106 /* The optimized lookup depends on the fact that the
1107 template arguments for the member function template apply
1108 purely to the containing class, which is not true if the
1109 containing class is an explicit or partial
1111 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1112 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1113 && !DECL_CONV_FN_P (tmpl
)
1114 /* It is possible to have a template that is not a member
1115 template and is not a member of a template class:
1117 template <typename T>
1118 struct S { friend A::f(); };
1120 Here, the friend function is a template, but the context does
1121 not have template information. The optimized lookup relies
1122 on having ARGS be the template arguments for both the class
1123 and the function template. */
1124 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1127 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1128 gone through coerce_template_parms by now. */
1131 verify_unstripped_args (tree args
)
1133 ++processing_template_decl
;
1134 if (!any_dependent_template_arguments_p (args
))
1136 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1137 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1139 tree arg
= TREE_VEC_ELT (inner
, i
);
1140 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1142 else if (TYPE_P (arg
))
1143 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1144 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1145 /* Allow typedefs on the type of a non-type argument, since a
1146 parameter can have them. */;
1148 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1151 --processing_template_decl
;
1154 /* Retrieve the specialization (in the sense of [temp.spec] - a
1155 specialization is either an instantiation or an explicit
1156 specialization) of TMPL for the given template ARGS. If there is
1157 no such specialization, return NULL_TREE. The ARGS are a vector of
1158 arguments, or a vector of vectors of arguments, in the case of
1159 templates with more than one level of parameters.
1161 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1162 then we search for a partial specialization matching ARGS. This
1163 parameter is ignored if TMPL is not a class template.
1165 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1166 result is a NONTYPE_ARGUMENT_PACK. */
1169 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1171 if (tmpl
== NULL_TREE
)
1174 if (args
== error_mark_node
)
1177 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1178 || TREE_CODE (tmpl
) == FIELD_DECL
);
1180 /* There should be as many levels of arguments as there are
1181 levels of parameters. */
1182 gcc_assert (TMPL_ARGS_DEPTH (args
)
1183 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1184 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1185 : template_class_depth (DECL_CONTEXT (tmpl
))));
1188 verify_unstripped_args (args
);
1190 if (optimize_specialization_lookup_p (tmpl
))
1192 tree class_template
;
1193 tree class_specialization
;
1194 vec
<tree
, va_gc
> *methods
;
1198 /* The template arguments actually apply to the containing
1199 class. Find the class specialization with those
1201 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1202 class_specialization
1203 = retrieve_specialization (class_template
, args
, 0);
1204 if (!class_specialization
)
1206 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1207 for the specialization. */
1208 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1211 /* Iterate through the methods with the indicated name, looking
1212 for the one that has an instance of TMPL. */
1213 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1214 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1216 tree fn
= OVL_CURRENT (fns
);
1217 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1218 /* using-declarations can add base methods to the method vec,
1219 and we don't want those here. */
1220 && DECL_CONTEXT (fn
) == class_specialization
)
1229 hash_table
<spec_hasher
> *specializations
;
1233 elt
.spec
= NULL_TREE
;
1235 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1236 specializations
= type_specializations
;
1238 specializations
= decl_specializations
;
1241 hash
= spec_hasher::hash (&elt
);
1242 found
= specializations
->find_with_hash (&elt
, hash
);
1250 /* Like retrieve_specialization, but for local declarations. */
1253 retrieve_local_specialization (tree tmpl
)
1255 if (local_specializations
== NULL
)
1258 tree
*slot
= local_specializations
->get (tmpl
);
1259 return slot
? *slot
: NULL_TREE
;
1262 /* Returns nonzero iff DECL is a specialization of TMPL. */
1265 is_specialization_of (tree decl
, tree tmpl
)
1269 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1273 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1279 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1281 for (t
= TREE_TYPE (decl
);
1283 t
= CLASSTYPE_USE_TEMPLATE (t
)
1284 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1285 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1292 /* Returns nonzero iff DECL is a specialization of friend declaration
1293 FRIEND_DECL according to [temp.friend]. */
1296 is_specialization_of_friend (tree decl
, tree friend_decl
)
1298 bool need_template
= true;
1301 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1302 || TREE_CODE (decl
) == TYPE_DECL
);
1304 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1305 of a template class, we want to check if DECL is a specialization
1307 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1308 && DECL_TEMPLATE_INFO (friend_decl
)
1309 && !DECL_USE_TEMPLATE (friend_decl
))
1311 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1312 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1313 need_template
= false;
1315 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1316 && !PRIMARY_TEMPLATE_P (friend_decl
))
1317 need_template
= false;
1319 /* There is nothing to do if this is not a template friend. */
1320 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1323 if (is_specialization_of (decl
, friend_decl
))
1327 A member of a class template may be declared to be a friend of a
1328 non-template class. In this case, the corresponding member of
1329 every specialization of the class template is a friend of the
1330 class granting friendship.
1332 For example, given a template friend declaration
1334 template <class T> friend void A<T>::f();
1336 the member function below is considered a friend
1338 template <> struct A<int> {
1342 For this type of template friend, TEMPLATE_DEPTH below will be
1343 nonzero. To determine if DECL is a friend of FRIEND, we first
1344 check if the enclosing class is a specialization of another. */
1346 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1348 && DECL_CLASS_SCOPE_P (decl
)
1349 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1350 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1352 /* Next, we check the members themselves. In order to handle
1353 a few tricky cases, such as when FRIEND_DECL's are
1355 template <class T> friend void A<T>::g(T t);
1356 template <class T> template <T t> friend void A<T>::h();
1360 void A<int>::g(int);
1361 template <int> void A<int>::h();
1363 we need to figure out ARGS, the template arguments from
1364 the context of DECL. This is required for template substitution
1365 of `T' in the function parameter of `g' and template parameter
1366 of `h' in the above examples. Here ARGS corresponds to `int'. */
1368 tree context
= DECL_CONTEXT (decl
);
1369 tree args
= NULL_TREE
;
1370 int current_depth
= 0;
1372 while (current_depth
< template_depth
)
1374 if (CLASSTYPE_TEMPLATE_INFO (context
))
1376 if (current_depth
== 0)
1377 args
= TYPE_TI_ARGS (context
);
1379 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1382 context
= TYPE_CONTEXT (context
);
1385 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1390 tree friend_args_type
;
1391 tree decl_args_type
;
1393 /* Make sure that both DECL and FRIEND_DECL are templates or
1395 is_template
= DECL_TEMPLATE_INFO (decl
)
1396 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1397 if (need_template
^ is_template
)
1399 else if (is_template
)
1401 /* If both are templates, check template parameter list. */
1403 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1405 if (!comp_template_parms
1406 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1410 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1413 decl_type
= TREE_TYPE (decl
);
1415 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1416 tf_none
, NULL_TREE
);
1417 if (friend_type
== error_mark_node
)
1420 /* Check if return types match. */
1421 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1424 /* Check if function parameter types match, ignoring the
1425 `this' parameter. */
1426 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1427 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1428 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1429 friend_args_type
= TREE_CHAIN (friend_args_type
);
1430 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1431 decl_args_type
= TREE_CHAIN (decl_args_type
);
1433 return compparms (decl_args_type
, friend_args_type
);
1437 /* DECL is a TYPE_DECL */
1439 tree decl_type
= TREE_TYPE (decl
);
1441 /* Make sure that both DECL and FRIEND_DECL are templates or
1444 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1445 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1447 if (need_template
^ is_template
)
1449 else if (is_template
)
1452 /* If both are templates, check the name of the two
1453 TEMPLATE_DECL's first because is_friend didn't. */
1454 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1455 != DECL_NAME (friend_decl
))
1458 /* Now check template parameter list. */
1460 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1462 return comp_template_parms
1463 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1467 return (DECL_NAME (decl
)
1468 == DECL_NAME (friend_decl
));
1474 /* Register the specialization SPEC as a specialization of TMPL with
1475 the indicated ARGS. IS_FRIEND indicates whether the specialization
1476 is actually just a friend declaration. Returns SPEC, or an
1477 equivalent prior declaration, if available.
1479 We also store instantiations of field packs in the hash table, even
1480 though they are not themselves templates, to make lookup easier. */
1483 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1487 spec_entry
**slot
= NULL
;
1490 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1491 || (TREE_CODE (tmpl
) == FIELD_DECL
1492 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1494 if (TREE_CODE (spec
) == FUNCTION_DECL
1495 && uses_template_parms (DECL_TI_ARGS (spec
)))
1496 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1497 register it; we want the corresponding TEMPLATE_DECL instead.
1498 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1499 the more obvious `uses_template_parms (spec)' to avoid problems
1500 with default function arguments. In particular, given
1501 something like this:
1503 template <class T> void f(T t1, T t = T())
1505 the default argument expression is not substituted for in an
1506 instantiation unless and until it is actually needed. */
1509 if (optimize_specialization_lookup_p (tmpl
))
1510 /* We don't put these specializations in the hash table, but we might
1511 want to give an error about a mismatch. */
1512 fn
= retrieve_specialization (tmpl
, args
, 0);
1520 hash
= spec_hasher::hash (&elt
);
1523 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1525 fn
= ((spec_entry
*) *slot
)->spec
;
1530 /* We can sometimes try to re-register a specialization that we've
1531 already got. In particular, regenerate_decl_from_template calls
1532 duplicate_decls which will update the specialization list. But,
1533 we'll still get called again here anyhow. It's more convenient
1534 to simply allow this than to try to prevent it. */
1537 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1539 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1541 if (DECL_ODR_USED (fn
)
1542 || DECL_EXPLICIT_INSTANTIATION (fn
))
1544 error ("specialization of %qD after instantiation",
1546 return error_mark_node
;
1551 /* This situation should occur only if the first
1552 specialization is an implicit instantiation, the
1553 second is an explicit specialization, and the
1554 implicit instantiation has not yet been used. That
1555 situation can occur if we have implicitly
1556 instantiated a member function and then specialized
1559 We can also wind up here if a friend declaration that
1560 looked like an instantiation turns out to be a
1563 template <class T> void foo(T);
1564 class S { friend void foo<>(int) };
1565 template <> void foo(int);
1567 We transform the existing DECL in place so that any
1568 pointers to it become pointers to the updated
1571 If there was a definition for the template, but not
1572 for the specialization, we want this to look as if
1573 there were no definition, and vice versa. */
1574 DECL_INITIAL (fn
) = NULL_TREE
;
1575 duplicate_decls (spec
, fn
, is_friend
);
1576 /* The call to duplicate_decls will have applied
1579 An explicit specialization of a function template
1580 is inline only if it is explicitly declared to be,
1581 and independently of whether its function template
1584 to the primary function; now copy the inline bits to
1585 the various clones. */
1586 FOR_EACH_CLONE (clone
, fn
)
1588 DECL_DECLARED_INLINE_P (clone
)
1589 = DECL_DECLARED_INLINE_P (fn
);
1590 DECL_SOURCE_LOCATION (clone
)
1591 = DECL_SOURCE_LOCATION (fn
);
1592 DECL_DELETED_FN (clone
)
1593 = DECL_DELETED_FN (fn
);
1595 check_specialization_namespace (tmpl
);
1600 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1602 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1603 /* Dup decl failed, but this is a new definition. Set the
1604 line number so any errors match this new
1606 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1612 return duplicate_decls (spec
, fn
, is_friend
);
1614 /* A specialization must be declared in the same namespace as the
1615 template it is specializing. */
1616 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1617 && !check_specialization_namespace (tmpl
))
1618 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1620 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1622 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1623 gcc_assert (tmpl
&& args
&& spec
);
1626 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1627 && PRIMARY_TEMPLATE_P (tmpl
)
1628 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1629 || variable_template_p (tmpl
))
1630 /* If TMPL is a forward declaration of a template function, keep a list
1631 of all specializations in case we need to reassign them to a friend
1632 template later in tsubst_friend_function.
1634 Also keep a list of all variable template instantiations so that
1635 process_partial_specialization can check whether a later partial
1636 specialization would have used it. */
1637 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1638 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1644 /* Returns true iff two spec_entry nodes are equivalent. */
1646 int comparing_specializations
;
1649 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1653 ++comparing_specializations
;
1654 equal
= (e1
->tmpl
== e2
->tmpl
1655 && comp_template_args (e1
->args
, e2
->args
));
1656 if (equal
&& flag_concepts
1657 /* tmpl could be a FIELD_DECL for a capture pack. */
1658 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1659 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1660 && uses_template_parms (e1
->args
))
1662 /* Partial specializations of a variable template can be distinguished by
1664 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1665 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1666 equal
= equivalent_constraints (c1
, c2
);
1668 --comparing_specializations
;
1673 /* Returns a hash for a template TMPL and template arguments ARGS. */
1676 hash_tmpl_and_args (tree tmpl
, tree args
)
1678 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1679 return iterative_hash_template_arg (args
, val
);
1682 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1686 spec_hasher::hash (spec_entry
*e
)
1688 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1691 /* Recursively calculate a hash value for a template argument ARG, for use
1692 in the hash tables of template specializations. */
1695 iterative_hash_template_arg (tree arg
, hashval_t val
)
1697 unsigned HOST_WIDE_INT i
;
1698 enum tree_code code
;
1701 if (arg
== NULL_TREE
)
1702 return iterative_hash_object (arg
, val
);
1707 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1708 /* We can get one of these when re-hashing a previous entry in the middle
1709 of substituting into a pack expansion. Just look through it. */
1710 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1712 code
= TREE_CODE (arg
);
1713 tclass
= TREE_CODE_CLASS (code
);
1715 val
= iterative_hash_object (code
, val
);
1722 case IDENTIFIER_NODE
:
1723 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1727 int i
, len
= TREE_VEC_LENGTH (arg
);
1728 for (i
= 0; i
< len
; ++i
)
1729 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1733 case TYPE_PACK_EXPANSION
:
1734 case EXPR_PACK_EXPANSION
:
1735 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1736 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1738 case TYPE_ARGUMENT_PACK
:
1739 case NONTYPE_ARGUMENT_PACK
:
1740 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1743 for (; arg
; arg
= TREE_CHAIN (arg
))
1744 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1748 for (; arg
; arg
= OVL_NEXT (arg
))
1749 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1755 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1756 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1758 val
= iterative_hash_template_arg (field
, val
);
1759 val
= iterative_hash_template_arg (value
, val
);
1765 if (!DECL_ARTIFICIAL (arg
))
1767 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1768 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1770 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1773 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1776 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1777 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1779 case TEMPLATE_PARM_INDEX
:
1780 val
= iterative_hash_template_arg
1781 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1782 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1783 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1786 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1787 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1788 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1791 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1793 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1797 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1798 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1799 val
= iterative_hash_object (code
, val
);
1800 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1803 /* A lambda can't appear in a template arg, but don't crash on
1805 gcc_assert (seen_error ());
1809 case IMPLICIT_CONV_EXPR
:
1810 case STATIC_CAST_EXPR
:
1811 case REINTERPRET_CAST_EXPR
:
1812 case CONST_CAST_EXPR
:
1813 case DYNAMIC_CAST_EXPR
:
1815 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1816 /* Now hash operands as usual. */
1826 if (alias_template_specialization_p (arg
))
1828 // We want an alias specialization that survived strip_typedefs
1829 // to hash differently from its TYPE_CANONICAL, to avoid hash
1830 // collisions that compare as different in template_args_equal.
1831 // These could be dependent specializations that strip_typedefs
1832 // left alone, or untouched specializations because
1833 // coerce_template_parms returns the unconverted template
1834 // arguments if it sees incomplete argument packs.
1835 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1836 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1838 if (TYPE_CANONICAL (arg
))
1839 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1841 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1842 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1843 /* Otherwise just compare the types during lookup. */
1846 case tcc_declaration
:
1848 return iterative_hash_expr (arg
, val
);
1851 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1853 unsigned n
= cp_tree_operand_length (arg
);
1854 for (i
= 0; i
< n
; ++i
)
1855 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1863 /* Unregister the specialization SPEC as a specialization of TMPL.
1864 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1865 if the SPEC was listed as a specialization of TMPL.
1867 Note that SPEC has been ggc_freed, so we can't look inside it. */
1870 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1875 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1876 elt
.args
= TI_ARGS (tinfo
);
1877 elt
.spec
= NULL_TREE
;
1879 entry
= decl_specializations
->find (&elt
);
1882 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1883 gcc_assert (new_spec
!= NULL_TREE
);
1884 entry
->spec
= new_spec
;
1891 /* Like register_specialization, but for local declarations. We are
1892 registering SPEC, an instantiation of TMPL. */
1895 register_local_specialization (tree spec
, tree tmpl
)
1897 local_specializations
->put (tmpl
, spec
);
1900 /* TYPE is a class type. Returns true if TYPE is an explicitly
1901 specialized class. */
1904 explicit_class_specialization_p (tree type
)
1906 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1908 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1911 /* Print the list of functions at FNS, going through all the overloads
1912 for each element of the list. Alternatively, FNS can not be a
1913 TREE_LIST, in which case it will be printed together with all the
1916 MORE and *STR should respectively be FALSE and NULL when the function
1917 is called from the outside. They are used internally on recursive
1918 calls. print_candidates manages the two parameters and leaves NULL
1919 in *STR when it ends. */
1922 print_candidates_1 (tree fns
, bool more
, const char **str
)
1925 char *spaces
= NULL
;
1927 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1928 if (TREE_CODE (fn
) == TREE_LIST
)
1930 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1931 print_candidates_1 (TREE_VALUE (fn2
),
1932 TREE_CHAIN (fn2
) || more
, str
);
1936 tree cand
= OVL_CURRENT (fn
);
1939 /* Pick the prefix string. */
1940 if (!more
&& !OVL_NEXT (fns
))
1942 inform (DECL_SOURCE_LOCATION (cand
),
1943 "candidate is: %#D", cand
);
1947 *str
= _("candidates are:");
1948 spaces
= get_spaces (*str
);
1950 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1951 *str
= spaces
? spaces
: *str
;
1961 /* Print the list of candidate FNS in an error message. FNS can also
1962 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1965 print_candidates (tree fns
)
1967 const char *str
= NULL
;
1968 print_candidates_1 (fns
, false, &str
);
1969 gcc_assert (str
== NULL
);
1972 /* Get a (possibly) constrained template declaration for the
1973 purpose of ordering candidates. */
1975 get_template_for_ordering (tree list
)
1977 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1978 tree f
= TREE_VALUE (list
);
1979 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1980 return TI_TEMPLATE (ti
);
1984 /* Among candidates having the same signature, return the
1985 most constrained or NULL_TREE if there is no best candidate.
1986 If the signatures of candidates vary (e.g., template
1987 specialization vs. member function), then there can be no
1990 Note that we don't compare constraints on the functions
1991 themselves, but rather those of their templates. */
1993 most_constrained_function (tree candidates
)
1995 // Try to find the best candidate in a first pass.
1996 tree champ
= candidates
;
1997 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
1999 int winner
= more_constrained (get_template_for_ordering (champ
),
2000 get_template_for_ordering (c
));
2002 champ
= c
; // The candidate is more constrained
2003 else if (winner
== 0)
2004 return NULL_TREE
; // Neither is more constrained
2007 // Verify that the champ is better than previous candidates.
2008 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2009 if (!more_constrained (get_template_for_ordering (champ
),
2010 get_template_for_ordering (c
)))
2018 /* Returns the template (one of the functions given by TEMPLATE_ID)
2019 which can be specialized to match the indicated DECL with the
2020 explicit template args given in TEMPLATE_ID. The DECL may be
2021 NULL_TREE if none is available. In that case, the functions in
2022 TEMPLATE_ID are non-members.
2024 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2025 specialization of a member template.
2027 The TEMPLATE_COUNT is the number of references to qualifying
2028 template classes that appeared in the name of the function. See
2029 check_explicit_specialization for a more accurate description.
2031 TSK indicates what kind of template declaration (if any) is being
2032 declared. TSK_TEMPLATE indicates that the declaration given by
2033 DECL, though a FUNCTION_DECL, has template parameters, and is
2034 therefore a template function.
2036 The template args (those explicitly specified and those deduced)
2037 are output in a newly created vector *TARGS_OUT.
2039 If it is impossible to determine the result, an error message is
2040 issued. The error_mark_node is returned to indicate failure. */
2043 determine_specialization (tree template_id
,
2046 int need_member_template
,
2052 tree explicit_targs
;
2053 tree candidates
= NULL_TREE
;
2055 /* A TREE_LIST of templates of which DECL may be a specialization.
2056 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2057 corresponding TREE_PURPOSE is the set of template arguments that,
2058 when used to instantiate the template, would produce a function
2059 with the signature of DECL. */
2060 tree templates
= NULL_TREE
;
2062 cp_binding_level
*b
;
2064 *targs_out
= NULL_TREE
;
2066 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2067 return error_mark_node
;
2069 /* We shouldn't be specializing a member template of an
2070 unspecialized class template; we already gave an error in
2071 check_specialization_scope, now avoid crashing. */
2072 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
2073 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2075 gcc_assert (errorcount
);
2076 return error_mark_node
;
2079 fns
= TREE_OPERAND (template_id
, 0);
2080 explicit_targs
= TREE_OPERAND (template_id
, 1);
2082 if (fns
== error_mark_node
)
2083 return error_mark_node
;
2085 /* Check for baselinks. */
2086 if (BASELINK_P (fns
))
2087 fns
= BASELINK_FUNCTIONS (fns
);
2089 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2091 error ("%qD is not a function template", fns
);
2092 return error_mark_node
;
2094 else if (VAR_P (decl
) && !variable_template_p (fns
))
2096 error ("%qD is not a variable template", fns
);
2097 return error_mark_node
;
2100 /* Count the number of template headers specified for this
2103 for (b
= current_binding_level
;
2104 b
->kind
== sk_template_parms
;
2108 tree orig_fns
= fns
;
2110 if (variable_template_p (fns
))
2112 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2113 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2114 tf_warning_or_error
,
2115 /*req_all*/true, /*use_defarg*/true);
2116 if (targs
!= error_mark_node
)
2117 templates
= tree_cons (targs
, fns
, templates
);
2119 else for (; fns
; fns
= OVL_NEXT (fns
))
2121 tree fn
= OVL_CURRENT (fns
);
2123 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2125 tree decl_arg_types
;
2129 /* In case of explicit specialization, we need to check if
2130 the number of template headers appearing in the specialization
2131 is correct. This is usually done in check_explicit_specialization,
2132 but the check done there cannot be exhaustive when specializing
2133 member functions. Consider the following code:
2135 template <> void A<int>::f(int);
2136 template <> template <> void A<int>::f(int);
2138 Assuming that A<int> is not itself an explicit specialization
2139 already, the first line specializes "f" which is a non-template
2140 member function, whilst the second line specializes "f" which
2141 is a template member function. So both lines are syntactically
2142 correct, and check_explicit_specialization does not reject
2145 Here, we can do better, as we are matching the specialization
2146 against the declarations. We count the number of template
2147 headers, and we check if they match TEMPLATE_COUNT + 1
2148 (TEMPLATE_COUNT is the number of qualifying template classes,
2149 plus there must be another header for the member template
2152 Notice that if header_count is zero, this is not a
2153 specialization but rather a template instantiation, so there
2154 is no check we can perform here. */
2155 if (header_count
&& header_count
!= template_count
+ 1)
2158 /* Check that the number of template arguments at the
2159 innermost level for DECL is the same as for FN. */
2160 if (current_binding_level
->kind
== sk_template_parms
2161 && !current_binding_level
->explicit_spec_p
2162 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2163 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2164 (current_template_parms
))))
2167 /* DECL might be a specialization of FN. */
2168 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2169 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2171 /* For a non-static member function, we need to make sure
2172 that the const qualification is the same. Since
2173 get_bindings does not try to merge the "this" parameter,
2174 we must do the comparison explicitly. */
2175 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2176 && !same_type_p (TREE_VALUE (fn_arg_types
),
2177 TREE_VALUE (decl_arg_types
)))
2180 /* Skip the "this" parameter and, for constructors of
2181 classes with virtual bases, the VTT parameter. A
2182 full specialization of a constructor will have a VTT
2183 parameter, but a template never will. */
2185 = skip_artificial_parms_for (decl
, decl_arg_types
);
2187 = skip_artificial_parms_for (fn
, fn_arg_types
);
2189 /* Function templates cannot be specializations; there are
2190 no partial specializations of functions. Therefore, if
2191 the type of DECL does not match FN, there is no
2194 Note that it should never be the case that we have both
2195 candidates added here, and for regular member functions
2197 if (tsk
== tsk_template
)
2199 if (compparms (fn_arg_types
, decl_arg_types
))
2200 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2204 /* See whether this function might be a specialization of this
2205 template. Suppress access control because we might be trying
2206 to make this specialization a friend, and we have already done
2207 access control for the declaration of the specialization. */
2208 push_deferring_access_checks (dk_no_check
);
2209 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2210 pop_deferring_access_checks ();
2213 /* We cannot deduce template arguments that when used to
2214 specialize TMPL will produce DECL. */
2217 /* Remove, from the set of candidates, all those functions
2218 whose constraints are not satisfied. */
2219 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2222 // Then, try to form the new function type.
2223 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2224 if (insttype
== error_mark_node
)
2227 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2228 if (!compparms (fn_arg_types
, decl_arg_types
))
2231 /* Save this template, and the arguments deduced. */
2232 templates
= tree_cons (targs
, fn
, templates
);
2234 else if (need_member_template
)
2235 /* FN is an ordinary member function, and we need a
2236 specialization of a member template. */
2238 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2239 /* We can get IDENTIFIER_NODEs here in certain erroneous
2242 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2243 /* This is just an ordinary non-member function. Nothing can
2244 be a specialization of that. */
2246 else if (DECL_ARTIFICIAL (fn
))
2247 /* Cannot specialize functions that are created implicitly. */
2251 tree decl_arg_types
;
2253 /* This is an ordinary member function. However, since
2254 we're here, we can assume its enclosing class is a
2255 template class. For example,
2257 template <typename T> struct S { void f(); };
2258 template <> void S<int>::f() {}
2260 Here, S<int>::f is a non-template, but S<int> is a
2261 template class. If FN has the same type as DECL, we
2262 might be in business. */
2264 if (!DECL_TEMPLATE_INFO (fn
))
2265 /* Its enclosing class is an explicit specialization
2266 of a template class. This is not a candidate. */
2269 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2270 TREE_TYPE (TREE_TYPE (fn
))))
2271 /* The return types differ. */
2274 /* Adjust the type of DECL in case FN is a static member. */
2275 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2276 if (DECL_STATIC_FUNCTION_P (fn
)
2277 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2278 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2280 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2284 // If the deduced arguments do not satisfy the constraints,
2285 // this is not a candidate.
2286 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2289 // Add the candidate.
2290 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2294 if (templates
&& TREE_CHAIN (templates
))
2300 It is possible for a specialization with a given function
2301 signature to be instantiated from more than one function
2302 template. In such cases, explicit specification of the
2303 template arguments must be used to uniquely identify the
2304 function template specialization being specialized.
2306 Note that here, there's no suggestion that we're supposed to
2307 determine which of the candidate templates is most
2308 specialized. However, we, also have:
2312 Partial ordering of overloaded function template
2313 declarations is used in the following contexts to select
2314 the function template to which a function template
2315 specialization refers:
2317 -- when an explicit specialization refers to a function
2320 So, we do use the partial ordering rules, at least for now.
2321 This extension can only serve to make invalid programs valid,
2322 so it's safe. And, there is strong anecdotal evidence that
2323 the committee intended the partial ordering rules to apply;
2324 the EDG front end has that behavior, and John Spicer claims
2325 that the committee simply forgot to delete the wording in
2326 [temp.expl.spec]. */
2327 tree tmpl
= most_specialized_instantiation (templates
);
2328 if (tmpl
!= error_mark_node
)
2331 TREE_CHAIN (templates
) = NULL_TREE
;
2335 // Concepts allows multiple declarations of member functions
2336 // with the same signature. Like above, we need to rely on
2337 // on the partial ordering of those candidates to determine which
2339 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2341 if (tree cand
= most_constrained_function (candidates
))
2344 TREE_CHAIN (cand
) = NULL_TREE
;
2348 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2350 error ("template-id %qD for %q+D does not match any template "
2351 "declaration", template_id
, decl
);
2352 if (header_count
&& header_count
!= template_count
+ 1)
2353 inform (input_location
, "saw %d %<template<>%>, need %d for "
2354 "specializing a member function template",
2355 header_count
, template_count
+ 1);
2357 print_candidates (orig_fns
);
2358 return error_mark_node
;
2360 else if ((templates
&& TREE_CHAIN (templates
))
2361 || (candidates
&& TREE_CHAIN (candidates
))
2362 || (templates
&& candidates
))
2364 error ("ambiguous template specialization %qD for %q+D",
2366 candidates
= chainon (candidates
, templates
);
2367 print_candidates (candidates
);
2368 return error_mark_node
;
2371 /* We have one, and exactly one, match. */
2374 tree fn
= TREE_VALUE (candidates
);
2375 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2377 // Propagate the candidate's constraints to the declaration.
2378 set_constraints (decl
, get_constraints (fn
));
2380 /* DECL is a re-declaration or partial instantiation of a template
2382 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2384 /* It was a specialization of an ordinary member function in a
2386 return DECL_TI_TEMPLATE (fn
);
2389 /* It was a specialization of a template. */
2390 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2391 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2393 *targs_out
= copy_node (targs
);
2394 SET_TMPL_ARGS_LEVEL (*targs_out
,
2395 TMPL_ARGS_DEPTH (*targs_out
),
2396 TREE_PURPOSE (templates
));
2399 *targs_out
= TREE_PURPOSE (templates
);
2400 return TREE_VALUE (templates
);
2403 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2404 but with the default argument values filled in from those in the
2408 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2411 tree new_spec_types
;
2416 if (spec_types
== void_list_node
)
2417 return void_list_node
;
2419 /* Substitute into the rest of the list. */
2421 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2422 TREE_CHAIN (tmpl_types
));
2424 /* Add the default argument for this parameter. */
2425 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2426 TREE_VALUE (spec_types
),
2430 /* DECL is an explicit specialization. Replicate default arguments
2431 from the template it specializes. (That way, code like:
2433 template <class T> void f(T = 3);
2434 template <> void f(double);
2437 works, as required.) An alternative approach would be to look up
2438 the correct default arguments at the call-site, but this approach
2439 is consistent with how implicit instantiations are handled. */
2442 copy_default_args_to_explicit_spec (tree decl
)
2447 tree new_spec_types
;
2451 tree object_type
= NULL_TREE
;
2452 tree in_charge
= NULL_TREE
;
2453 tree vtt
= NULL_TREE
;
2455 /* See if there's anything we need to do. */
2456 tmpl
= DECL_TI_TEMPLATE (decl
);
2457 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2458 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2459 if (TREE_PURPOSE (t
))
2464 old_type
= TREE_TYPE (decl
);
2465 spec_types
= TYPE_ARG_TYPES (old_type
);
2467 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2469 /* Remove the this pointer, but remember the object's type for
2471 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2472 spec_types
= TREE_CHAIN (spec_types
);
2473 tmpl_types
= TREE_CHAIN (tmpl_types
);
2475 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2477 /* DECL may contain more parameters than TMPL due to the extra
2478 in-charge parameter in constructors and destructors. */
2479 in_charge
= spec_types
;
2480 spec_types
= TREE_CHAIN (spec_types
);
2482 if (DECL_HAS_VTT_PARM_P (decl
))
2485 spec_types
= TREE_CHAIN (spec_types
);
2489 /* Compute the merged default arguments. */
2491 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2493 /* Compute the new FUNCTION_TYPE. */
2497 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2502 /* Put the in-charge parameter back. */
2503 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2504 TREE_VALUE (in_charge
),
2507 new_type
= build_method_type_directly (object_type
,
2508 TREE_TYPE (old_type
),
2512 new_type
= build_function_type (TREE_TYPE (old_type
),
2514 new_type
= cp_build_type_attribute_variant (new_type
,
2515 TYPE_ATTRIBUTES (old_type
));
2516 new_type
= build_exception_variant (new_type
,
2517 TYPE_RAISES_EXCEPTIONS (old_type
));
2519 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2520 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2522 TREE_TYPE (decl
) = new_type
;
2525 /* Return the number of template headers we expect to see for a definition
2526 or specialization of CTYPE or one of its non-template members. */
2529 num_template_headers_for_class (tree ctype
)
2531 int num_templates
= 0;
2533 while (ctype
&& CLASS_TYPE_P (ctype
))
2535 /* You're supposed to have one `template <...>' for every
2536 template class, but you don't need one for a full
2537 specialization. For example:
2539 template <class T> struct S{};
2540 template <> struct S<int> { void f(); };
2541 void S<int>::f () {}
2543 is correct; there shouldn't be a `template <>' for the
2544 definition of `S<int>::f'. */
2545 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2546 /* If CTYPE does not have template information of any
2547 kind, then it is not a template, nor is it nested
2548 within a template. */
2550 if (explicit_class_specialization_p (ctype
))
2552 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2555 ctype
= TYPE_CONTEXT (ctype
);
2558 return num_templates
;
2561 /* Do a simple sanity check on the template headers that precede the
2562 variable declaration DECL. */
2565 check_template_variable (tree decl
)
2567 tree ctx
= CP_DECL_CONTEXT (decl
);
2568 int wanted
= num_template_headers_for_class (ctx
);
2569 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2570 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2572 if (cxx_dialect
< cxx14
)
2573 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2574 "variable templates only available with "
2575 "-std=c++14 or -std=gnu++14");
2577 // Namespace-scope variable templates should have a template header.
2580 if (template_header_count
> wanted
)
2582 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2583 "too many template headers for %D (should be %d)",
2585 if (warned
&& CLASS_TYPE_P (ctx
)
2586 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2587 inform (DECL_SOURCE_LOCATION (decl
),
2588 "members of an explicitly specialized class are defined "
2589 "without a template header");
2593 /* Check to see if the function just declared, as indicated in
2594 DECLARATOR, and in DECL, is a specialization of a function
2595 template. We may also discover that the declaration is an explicit
2596 instantiation at this point.
2598 Returns DECL, or an equivalent declaration that should be used
2599 instead if all goes well. Issues an error message if something is
2600 amiss. Returns error_mark_node if the error is not easily
2603 FLAGS is a bitmask consisting of the following flags:
2605 2: The function has a definition.
2606 4: The function is a friend.
2608 The TEMPLATE_COUNT is the number of references to qualifying
2609 template classes that appeared in the name of the function. For
2612 template <class T> struct S { void f(); };
2615 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2616 classes are not counted in the TEMPLATE_COUNT, so that in
2618 template <class T> struct S {};
2619 template <> struct S<int> { void f(); }
2620 template <> void S<int>::f();
2622 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2623 invalid; there should be no template <>.)
2625 If the function is a specialization, it is marked as such via
2626 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2627 is set up correctly, and it is added to the list of specializations
2628 for that template. */
2631 check_explicit_specialization (tree declarator
,
2636 int have_def
= flags
& 2;
2637 int is_friend
= flags
& 4;
2638 bool is_concept
= flags
& 8;
2639 int specialization
= 0;
2640 int explicit_instantiation
= 0;
2641 int member_specialization
= 0;
2642 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2643 tree dname
= DECL_NAME (decl
);
2648 if (!processing_specialization
)
2651 tsk
= tsk_excessive_parms
;
2654 tsk
= current_tmpl_spec_kind (template_count
);
2659 if (processing_specialization
&& !VAR_P (decl
))
2662 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2664 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2667 /* This could be something like:
2669 template <class T> void f(T);
2670 class S { friend void f<>(int); } */
2674 /* This case handles bogus declarations like template <>
2675 template <class T> void f<int>(); */
2677 error ("template-id %qD in declaration of primary template",
2684 case tsk_invalid_member_spec
:
2685 /* The error has already been reported in
2686 check_specialization_scope. */
2687 return error_mark_node
;
2689 case tsk_invalid_expl_inst
:
2690 error ("template parameter list used in explicit instantiation");
2696 error ("definition provided for explicit instantiation");
2698 explicit_instantiation
= 1;
2701 case tsk_excessive_parms
:
2702 case tsk_insufficient_parms
:
2703 if (tsk
== tsk_excessive_parms
)
2704 error ("too many template parameter lists in declaration of %qD",
2706 else if (template_header_count
)
2707 error("too few template parameter lists in declaration of %qD", decl
);
2709 error("explicit specialization of %qD must be introduced by "
2710 "%<template <>%>", decl
);
2715 error ("explicit specialization declared %<concept%>");
2717 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2718 /* In cases like template<> constexpr bool v = true;
2719 We'll give an error in check_template_variable. */
2722 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2724 member_specialization
= 1;
2730 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2732 /* This case handles bogus declarations like template <>
2733 template <class T> void f<int>(); */
2735 if (!uses_template_parms (declarator
))
2736 error ("template-id %qD in declaration of primary template",
2738 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2740 /* Partial specialization of variable template. */
2741 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2745 else if (cxx_dialect
< cxx14
)
2746 error ("non-type partial specialization %qD "
2747 "is not allowed", declarator
);
2749 error ("non-class, non-variable partial specialization %qD "
2750 "is not allowed", declarator
);
2755 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2756 /* This is a specialization of a member template, without
2757 specialization the containing class. Something like:
2759 template <class T> struct S {
2760 template <class U> void f (U);
2762 template <> template <class U> void S<int>::f(U) {}
2764 That's a specialization -- but of the entire template. */
2772 if ((specialization
|| member_specialization
)
2773 /* This doesn't apply to variable templates. */
2774 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2775 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2777 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2778 for (; t
; t
= TREE_CHAIN (t
))
2779 if (TREE_PURPOSE (t
))
2781 permerror (input_location
,
2782 "default argument specified in explicit specialization");
2787 if (specialization
|| member_specialization
|| explicit_instantiation
)
2789 tree tmpl
= NULL_TREE
;
2790 tree targs
= NULL_TREE
;
2791 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2793 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2794 if (!was_template_id
)
2798 gcc_assert (identifier_p (declarator
));
2803 /* If there is no class context, the explicit instantiation
2804 must be at namespace scope. */
2805 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2807 /* Find the namespace binding, using the declaration
2809 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2811 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2813 error ("%qD is not a template function", dname
);
2814 fns
= error_mark_node
;
2818 declarator
= lookup_template_function (fns
, NULL_TREE
);
2821 if (declarator
== error_mark_node
)
2822 return error_mark_node
;
2824 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2826 if (!explicit_instantiation
)
2827 /* A specialization in class scope. This is invalid,
2828 but the error will already have been flagged by
2829 check_specialization_scope. */
2830 return error_mark_node
;
2833 /* It's not valid to write an explicit instantiation in
2836 class C { template void f(); }
2838 This case is caught by the parser. However, on
2841 template class C { void f(); };
2843 (which is invalid) we can get here. The error will be
2850 else if (ctype
!= NULL_TREE
2851 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2853 // We'll match variable templates in start_decl.
2857 /* Find the list of functions in ctype that have the same
2858 name as the declared function. */
2859 tree name
= TREE_OPERAND (declarator
, 0);
2860 tree fns
= NULL_TREE
;
2863 if (constructor_name_p (name
, ctype
))
2865 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2867 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2868 : !CLASSTYPE_DESTRUCTORS (ctype
))
2870 /* From [temp.expl.spec]:
2872 If such an explicit specialization for the member
2873 of a class template names an implicitly-declared
2874 special member function (clause _special_), the
2875 program is ill-formed.
2877 Similar language is found in [temp.explicit]. */
2878 error ("specialization of implicitly-declared special member function");
2879 return error_mark_node
;
2882 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2885 if (!DECL_CONV_FN_P (decl
))
2887 idx
= lookup_fnfields_1 (ctype
, name
);
2889 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2893 vec
<tree
, va_gc
> *methods
;
2896 /* For a type-conversion operator, we cannot do a
2897 name-based lookup. We might be looking for `operator
2898 int' which will be a specialization of `operator T'.
2899 So, we find *all* the conversion operators, and then
2900 select from them. */
2903 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2905 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2906 methods
->iterate (idx
, &ovl
);
2909 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2910 /* There are no more conversion functions. */
2913 /* Glue all these conversion functions together
2914 with those we already have. */
2915 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2916 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2920 if (fns
== NULL_TREE
)
2922 error ("no member function %qD declared in %qT", name
, ctype
);
2923 return error_mark_node
;
2926 TREE_OPERAND (declarator
, 0) = fns
;
2929 /* Figure out what exactly is being specialized at this point.
2930 Note that for an explicit instantiation, even one for a
2931 member function, we cannot tell apriori whether the
2932 instantiation is for a member template, or just a member
2933 function of a template class. Even if a member template is
2934 being instantiated, the member template arguments may be
2935 elided if they can be deduced from the rest of the
2937 tmpl
= determine_specialization (declarator
, decl
,
2939 member_specialization
,
2943 if (!tmpl
|| tmpl
== error_mark_node
)
2944 /* We couldn't figure out what this declaration was
2946 return error_mark_node
;
2949 if (!ctype
&& !was_template_id
2950 && (specialization
|| member_specialization
2951 || explicit_instantiation
)
2952 && !is_associated_namespace (CP_DECL_CONTEXT (decl
),
2953 CP_DECL_CONTEXT (tmpl
)))
2954 error ("%qD is not declared in %qD",
2955 tmpl
, current_namespace
);
2957 tree gen_tmpl
= most_general_template (tmpl
);
2959 if (explicit_instantiation
)
2961 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2962 is done by do_decl_instantiation later. */
2964 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2965 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2967 if (arg_depth
> parm_depth
)
2969 /* If TMPL is not the most general template (for
2970 example, if TMPL is a friend template that is
2971 injected into namespace scope), then there will
2972 be too many levels of TARGS. Remove some of them
2977 new_targs
= make_tree_vec (parm_depth
);
2978 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2979 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2980 = TREE_VEC_ELT (targs
, i
);
2984 return instantiate_template (tmpl
, targs
, tf_error
);
2987 /* If we thought that the DECL was a member function, but it
2988 turns out to be specializing a static member function,
2989 make DECL a static member function as well. */
2990 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2991 && DECL_STATIC_FUNCTION_P (tmpl
)
2992 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2993 revert_static_member_fn (decl
);
2995 /* If this is a specialization of a member template of a
2996 template class, we want to return the TEMPLATE_DECL, not
2997 the specialization of it. */
2998 if (tsk
== tsk_template
&& !was_template_id
)
3000 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
3001 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
3002 DECL_INITIAL (result
) = NULL_TREE
;
3006 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3007 DECL_SOURCE_LOCATION (result
)
3008 = DECL_SOURCE_LOCATION (decl
);
3009 /* We want to use the argument list specified in the
3010 definition, not in the original declaration. */
3011 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3012 for (parm
= DECL_ARGUMENTS (result
); parm
;
3013 parm
= DECL_CHAIN (parm
))
3014 DECL_CONTEXT (parm
) = result
;
3016 return register_specialization (tmpl
, gen_tmpl
, targs
,
3020 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3021 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3023 if (was_template_id
)
3024 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3026 /* Inherit default function arguments from the template
3027 DECL is specializing. */
3028 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3029 copy_default_args_to_explicit_spec (decl
);
3031 /* This specialization has the same protection as the
3032 template it specializes. */
3033 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3034 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3036 /* 7.1.1-1 [dcl.stc]
3038 A storage-class-specifier shall not be specified in an
3039 explicit specialization...
3041 The parser rejects these, so unless action is taken here,
3042 explicit function specializations will always appear with
3045 The action recommended by the C++ CWG in response to C++
3046 defect report 605 is to make the storage class and linkage
3047 of the explicit specialization match the templated function:
3049 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3051 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3053 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3054 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3056 /* A concept cannot be specialized. */
3057 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3059 error ("explicit specialization of function concept %qD",
3061 return error_mark_node
;
3064 /* This specialization has the same linkage and visibility as
3065 the function template it specializes. */
3066 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3067 if (! TREE_PUBLIC (decl
))
3069 DECL_INTERFACE_KNOWN (decl
) = 1;
3070 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3072 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3073 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3075 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3076 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3080 /* If DECL is a friend declaration, declared using an
3081 unqualified name, the namespace associated with DECL may
3082 have been set incorrectly. For example, in:
3084 template <typename T> void f(T);
3086 struct S { friend void f<int>(int); }
3089 we will have set the DECL_CONTEXT for the friend
3090 declaration to N, rather than to the global namespace. */
3091 if (DECL_NAMESPACE_SCOPE_P (decl
))
3092 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3094 if (is_friend
&& !have_def
)
3095 /* This is not really a declaration of a specialization.
3096 It's just the name of an instantiation. But, it's not
3097 a request for an instantiation, either. */
3098 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3099 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3100 /* A specialization is not necessarily COMDAT. */
3101 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3102 && DECL_DECLARED_INLINE_P (decl
));
3103 else if (VAR_P (decl
))
3104 DECL_COMDAT (decl
) = false;
3106 /* If this is a full specialization, register it so that we can find
3107 it again. Partial specializations will be registered in
3108 process_partial_specialization. */
3109 if (!processing_template_decl
)
3110 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3113 /* A 'structor should already have clones. */
3114 gcc_assert (decl
== error_mark_node
3115 || variable_template_p (tmpl
)
3116 || !(DECL_CONSTRUCTOR_P (decl
)
3117 || DECL_DESTRUCTOR_P (decl
))
3118 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3125 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3126 parameters. These are represented in the same format used for
3127 DECL_TEMPLATE_PARMS. */
3130 comp_template_parms (const_tree parms1
, const_tree parms2
)
3135 if (parms1
== parms2
)
3138 for (p1
= parms1
, p2
= parms2
;
3139 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3140 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3142 tree t1
= TREE_VALUE (p1
);
3143 tree t2
= TREE_VALUE (p2
);
3146 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3147 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3149 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3152 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3154 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3155 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3157 /* If either of the template parameters are invalid, assume
3158 they match for the sake of error recovery. */
3159 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3162 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3165 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3166 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3167 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3169 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3174 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3175 /* One set of parameters has more parameters lists than the
3182 /* Determine whether PARM is a parameter pack. */
3185 template_parameter_pack_p (const_tree parm
)
3187 /* Determine if we have a non-type template parameter pack. */
3188 if (TREE_CODE (parm
) == PARM_DECL
)
3189 return (DECL_TEMPLATE_PARM_P (parm
)
3190 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3191 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3192 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3194 /* If this is a list of template parameters, we could get a
3195 TYPE_DECL or a TEMPLATE_DECL. */
3196 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3197 parm
= TREE_TYPE (parm
);
3199 /* Otherwise it must be a type template parameter. */
3200 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3201 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3202 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3205 /* Determine if T is a function parameter pack. */
3208 function_parameter_pack_p (const_tree t
)
3210 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3211 return DECL_PACK_P (t
);
3215 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3216 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3219 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3221 if (! primary_func_tmpl_inst
3222 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3223 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3226 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3229 /* Return true iff the function parameter PARAM_DECL was expanded
3230 from the function parameter pack PACK. */
3233 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3235 if (DECL_ARTIFICIAL (param_decl
)
3236 || !function_parameter_pack_p (pack
))
3239 /* The parameter pack and its pack arguments have the same
3241 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3244 /* Determine whether ARGS describes a variadic template args list,
3245 i.e., one that is terminated by a template argument pack. */
3248 template_args_variadic_p (tree args
)
3253 if (args
== NULL_TREE
)
3256 args
= INNERMOST_TEMPLATE_ARGS (args
);
3257 nargs
= TREE_VEC_LENGTH (args
);
3262 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3264 return ARGUMENT_PACK_P (last_parm
);
3267 /* Generate a new name for the parameter pack name NAME (an
3268 IDENTIFIER_NODE) that incorporates its */
3271 make_ith_pack_parameter_name (tree name
, int i
)
3273 /* Munge the name to include the parameter index. */
3274 #define NUMBUF_LEN 128
3275 char numbuf
[NUMBUF_LEN
];
3279 if (name
== NULL_TREE
)
3281 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3282 newname_len
= IDENTIFIER_LENGTH (name
)
3283 + strlen (numbuf
) + 2;
3284 newname
= (char*)alloca (newname_len
);
3285 snprintf (newname
, newname_len
,
3286 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3287 return get_identifier (newname
);
3290 /* Return true if T is a primary function, class or alias template
3294 primary_template_instantiation_p (const_tree t
)
3299 if (TREE_CODE (t
) == FUNCTION_DECL
)
3300 return DECL_LANG_SPECIFIC (t
)
3301 && DECL_TEMPLATE_INSTANTIATION (t
)
3302 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3303 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3304 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3305 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3306 else if (alias_template_specialization_p (t
))
3311 /* Return true if PARM is a template template parameter. */
3314 template_template_parameter_p (const_tree parm
)
3316 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3319 /* Return true iff PARM is a DECL representing a type template
3323 template_type_parameter_p (const_tree parm
)
3326 && (TREE_CODE (parm
) == TYPE_DECL
3327 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3328 && DECL_TEMPLATE_PARM_P (parm
));
3331 /* Return the template parameters of T if T is a
3332 primary template instantiation, NULL otherwise. */
3335 get_primary_template_innermost_parameters (const_tree t
)
3337 tree parms
= NULL
, template_info
= NULL
;
3339 if ((template_info
= get_template_info (t
))
3340 && primary_template_instantiation_p (t
))
3341 parms
= INNERMOST_TEMPLATE_PARMS
3342 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3347 /* Return the template parameters of the LEVELth level from the full list
3348 of template parameters PARMS. */
3351 get_template_parms_at_level (tree parms
, int level
)
3355 || TREE_CODE (parms
) != TREE_LIST
3356 || level
> TMPL_PARMS_DEPTH (parms
))
3359 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3360 if (TMPL_PARMS_DEPTH (p
) == level
)
3366 /* Returns the template arguments of T if T is a template instantiation,
3370 get_template_innermost_arguments (const_tree t
)
3372 tree args
= NULL
, template_info
= NULL
;
3374 if ((template_info
= get_template_info (t
))
3375 && TI_ARGS (template_info
))
3376 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3381 /* Return the argument pack elements of T if T is a template argument pack,
3385 get_template_argument_pack_elems (const_tree t
)
3387 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3388 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3391 return ARGUMENT_PACK_ARGS (t
);
3394 /* Structure used to track the progress of find_parameter_packs_r. */
3395 struct find_parameter_pack_data
3397 /* TREE_LIST that will contain all of the parameter packs found by
3399 tree
* parameter_packs
;
3401 /* Set of AST nodes that have been visited by the traversal. */
3402 hash_set
<tree
> *visited
;
3404 /* True iff we're making a type pack expansion. */
3405 bool type_pack_expansion_p
;
3408 /* Identifies all of the argument packs that occur in a template
3409 argument and appends them to the TREE_LIST inside DATA, which is a
3410 find_parameter_pack_data structure. This is a subroutine of
3411 make_pack_expansion and uses_parameter_packs. */
3413 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3416 struct find_parameter_pack_data
* ppd
=
3417 (struct find_parameter_pack_data
*)data
;
3418 bool parameter_pack_p
= false;
3420 /* Handle type aliases/typedefs. */
3421 if (TYPE_ALIAS_P (t
))
3423 if (TYPE_TEMPLATE_INFO (t
))
3424 cp_walk_tree (&TYPE_TI_ARGS (t
),
3425 &find_parameter_packs_r
,
3431 /* Identify whether this is a parameter pack or not. */
3432 switch (TREE_CODE (t
))
3434 case TEMPLATE_PARM_INDEX
:
3435 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3436 parameter_pack_p
= true;
3439 case TEMPLATE_TYPE_PARM
:
3440 t
= TYPE_MAIN_VARIANT (t
);
3441 case TEMPLATE_TEMPLATE_PARM
:
3442 /* If the placeholder appears in the decl-specifier-seq of a function
3443 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3444 is a pack expansion, the invented template parameter is a template
3446 if (ppd
->type_pack_expansion_p
&& is_auto_or_concept (t
))
3447 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3448 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3449 parameter_pack_p
= true;
3454 if (DECL_PACK_P (t
))
3456 /* We don't want to walk into the type of a PARM_DECL,
3457 because we don't want to see the type parameter pack. */
3459 parameter_pack_p
= true;
3463 /* Look through a lambda capture proxy to the field pack. */
3465 if (DECL_HAS_VALUE_EXPR_P (t
))
3467 tree v
= DECL_VALUE_EXPR (t
);
3469 &find_parameter_packs_r
,
3473 else if (variable_template_specialization_p (t
))
3475 cp_walk_tree (&DECL_TI_ARGS (t
),
3476 find_parameter_packs_r
,
3483 parameter_pack_p
= true;
3486 /* Not a parameter pack. */
3490 if (parameter_pack_p
)
3492 /* Add this parameter pack to the list. */
3493 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3497 cp_walk_tree (&TYPE_CONTEXT (t
),
3498 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3500 /* This switch statement will return immediately if we don't find a
3502 switch (TREE_CODE (t
))
3504 case TEMPLATE_PARM_INDEX
:
3507 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3508 /* Check the template itself. */
3509 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3510 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3511 /* Check the template arguments. */
3512 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3517 case TEMPLATE_TYPE_PARM
:
3518 case TEMPLATE_TEMPLATE_PARM
:
3525 if (TYPE_PTRMEMFUNC_P (t
))
3531 if (TYPE_TEMPLATE_INFO (t
))
3532 cp_walk_tree (&TYPE_TI_ARGS (t
),
3533 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3540 cp_walk_tree (&TREE_TYPE (t
),
3541 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3545 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3550 case TYPE_PACK_EXPANSION
:
3551 case EXPR_PACK_EXPANSION
:
3556 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3561 case IDENTIFIER_NODE
:
3562 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3569 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3570 type_pack_expansion_p to false so that any placeholders
3571 within the expression don't get marked as parameter packs. */
3572 bool type_pack_expansion_p
= ppd
->type_pack_expansion_p
;
3573 ppd
->type_pack_expansion_p
= false;
3574 cp_walk_tree (&DECLTYPE_TYPE_EXPR (t
), &find_parameter_packs_r
,
3576 ppd
->type_pack_expansion_p
= type_pack_expansion_p
;
3588 /* Determines if the expression or type T uses any parameter packs. */
3590 uses_parameter_packs (tree t
)
3592 tree parameter_packs
= NULL_TREE
;
3593 struct find_parameter_pack_data ppd
;
3594 ppd
.parameter_packs
= ¶meter_packs
;
3595 ppd
.visited
= new hash_set
<tree
>;
3596 ppd
.type_pack_expansion_p
= false;
3597 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3599 return parameter_packs
!= NULL_TREE
;
3602 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3603 representation a base-class initializer into a parameter pack
3604 expansion. If all goes well, the resulting node will be an
3605 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3608 make_pack_expansion (tree arg
)
3611 tree parameter_packs
= NULL_TREE
;
3612 bool for_types
= false;
3613 struct find_parameter_pack_data ppd
;
3615 if (!arg
|| arg
== error_mark_node
)
3618 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3620 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3621 class initializer. In this case, the TREE_PURPOSE will be a
3622 _TYPE node (representing the base class expansion we're
3623 initializing) and the TREE_VALUE will be a TREE_LIST
3624 containing the initialization arguments.
3626 The resulting expansion looks somewhat different from most
3627 expansions. Rather than returning just one _EXPANSION, we
3628 return a TREE_LIST whose TREE_PURPOSE is a
3629 TYPE_PACK_EXPANSION containing the bases that will be
3630 initialized. The TREE_VALUE will be identical to the
3631 original TREE_VALUE, which is a list of arguments that will
3632 be passed to each base. We do not introduce any new pack
3633 expansion nodes into the TREE_VALUE (although it is possible
3634 that some already exist), because the TREE_PURPOSE and
3635 TREE_VALUE all need to be expanded together with the same
3636 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3637 resulting TREE_PURPOSE will mention the parameter packs in
3638 both the bases and the arguments to the bases. */
3641 tree parameter_packs
= NULL_TREE
;
3643 /* Determine which parameter packs will be used by the base
3645 ppd
.visited
= new hash_set
<tree
>;
3646 ppd
.parameter_packs
= ¶meter_packs
;
3647 ppd
.type_pack_expansion_p
= true;
3648 gcc_assert (TYPE_P (TREE_PURPOSE (arg
)));
3649 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3652 if (parameter_packs
== NULL_TREE
)
3654 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3656 return error_mark_node
;
3659 if (TREE_VALUE (arg
) != void_type_node
)
3661 /* Collect the sets of parameter packs used in each of the
3662 initialization arguments. */
3663 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3665 /* Determine which parameter packs will be expanded in this
3667 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3674 /* Create the pack expansion type for the base type. */
3675 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3676 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3677 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3679 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3680 they will rarely be compared to anything. */
3681 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3683 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3686 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3689 /* Build the PACK_EXPANSION_* node. */
3691 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3692 : make_node (EXPR_PACK_EXPANSION
);
3693 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3694 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3696 /* Propagate type and const-expression information. */
3697 TREE_TYPE (result
) = TREE_TYPE (arg
);
3698 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3699 /* Mark this read now, since the expansion might be length 0. */
3700 mark_exp_read (arg
);
3703 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3704 they will rarely be compared to anything. */
3705 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3707 /* Determine which parameter packs will be expanded. */
3708 ppd
.parameter_packs
= ¶meter_packs
;
3709 ppd
.visited
= new hash_set
<tree
>;
3710 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
3711 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3714 /* Make sure we found some parameter packs. */
3715 if (parameter_packs
== NULL_TREE
)
3718 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3720 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3721 return error_mark_node
;
3723 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3725 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3730 /* Checks T for any "bare" parameter packs, which have not yet been
3731 expanded, and issues an error if any are found. This operation can
3732 only be done on full expressions or types (e.g., an expression
3733 statement, "if" condition, etc.), because we could have expressions like:
3735 foo(f(g(h(args)))...)
3737 where "args" is a parameter pack. check_for_bare_parameter_packs
3738 should not be called for the subexpressions args, h(args),
3739 g(h(args)), or f(g(h(args))), because we would produce erroneous
3742 Returns TRUE and emits an error if there were bare parameter packs,
3743 returns FALSE otherwise. */
3745 check_for_bare_parameter_packs (tree t
)
3747 tree parameter_packs
= NULL_TREE
;
3748 struct find_parameter_pack_data ppd
;
3750 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3753 if (TREE_CODE (t
) == TYPE_DECL
)
3756 ppd
.parameter_packs
= ¶meter_packs
;
3757 ppd
.visited
= new hash_set
<tree
>;
3758 ppd
.type_pack_expansion_p
= false;
3759 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3762 if (parameter_packs
)
3764 location_t loc
= EXPR_LOC_OR_LOC (t
, input_location
);
3765 error_at (loc
, "parameter packs not expanded with %<...%>:");
3766 while (parameter_packs
)
3768 tree pack
= TREE_VALUE (parameter_packs
);
3769 tree name
= NULL_TREE
;
3771 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3772 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3773 name
= TYPE_NAME (pack
);
3774 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3775 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3777 name
= DECL_NAME (pack
);
3780 inform (loc
, " %qD", name
);
3782 inform (loc
, " <anonymous>");
3784 parameter_packs
= TREE_CHAIN (parameter_packs
);
3793 /* Expand any parameter packs that occur in the template arguments in
3796 expand_template_argument_pack (tree args
)
3798 tree result_args
= NULL_TREE
;
3799 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3800 int num_result_args
= -1;
3801 int non_default_args_count
= -1;
3803 /* First, determine if we need to expand anything, and the number of
3804 slots we'll need. */
3805 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3807 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3808 if (arg
== NULL_TREE
)
3810 if (ARGUMENT_PACK_P (arg
))
3812 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3813 if (num_result_args
< 0)
3814 num_result_args
= in_arg
+ num_packed
;
3816 num_result_args
+= num_packed
;
3820 if (num_result_args
>= 0)
3825 /* If no expansion is necessary, we're done. */
3826 if (num_result_args
< 0)
3829 /* Expand arguments. */
3830 result_args
= make_tree_vec (num_result_args
);
3831 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3832 non_default_args_count
=
3833 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3834 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3836 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3837 if (ARGUMENT_PACK_P (arg
))
3839 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3840 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3841 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3842 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3843 if (non_default_args_count
> 0)
3844 non_default_args_count
+= num_packed
- 1;
3848 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3852 if (non_default_args_count
>= 0)
3853 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3857 /* Checks if DECL shadows a template parameter.
3859 [temp.local]: A template-parameter shall not be redeclared within its
3860 scope (including nested scopes).
3862 Emits an error and returns TRUE if the DECL shadows a parameter,
3863 returns FALSE otherwise. */
3866 check_template_shadow (tree decl
)
3870 /* If we're not in a template, we can't possibly shadow a template
3872 if (!current_template_parms
)
3875 /* Figure out what we're shadowing. */
3876 if (TREE_CODE (decl
) == OVERLOAD
)
3877 decl
= OVL_CURRENT (decl
);
3878 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3880 /* If there's no previous binding for this name, we're not shadowing
3881 anything, let alone a template parameter. */
3885 /* If we're not shadowing a template parameter, we're done. Note
3886 that OLDDECL might be an OVERLOAD (or perhaps even an
3887 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3889 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3892 /* We check for decl != olddecl to avoid bogus errors for using a
3893 name inside a class. We check TPFI to avoid duplicate errors for
3894 inline member templates. */
3896 || (DECL_TEMPLATE_PARM_P (decl
)
3897 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3900 /* Don't complain about the injected class name, as we've already
3901 complained about the class itself. */
3902 if (DECL_SELF_REFERENCE_P (decl
))
3905 if (DECL_TEMPLATE_PARM_P (decl
))
3906 error ("declaration of template parameter %q+D shadows "
3907 "template parameter", decl
);
3909 error ("declaration of %q+#D shadows template parameter", decl
);
3910 inform (DECL_SOURCE_LOCATION (olddecl
),
3911 "template parameter %qD declared here", olddecl
);
3915 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3916 ORIG_LEVEL, DECL, and TYPE. */
3919 build_template_parm_index (int index
,
3925 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3926 TEMPLATE_PARM_IDX (t
) = index
;
3927 TEMPLATE_PARM_LEVEL (t
) = level
;
3928 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3929 TEMPLATE_PARM_DECL (t
) = decl
;
3930 TREE_TYPE (t
) = type
;
3931 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3932 TREE_READONLY (t
) = TREE_READONLY (decl
);
3937 /* Find the canonical type parameter for the given template type
3938 parameter. Returns the canonical type parameter, which may be TYPE
3939 if no such parameter existed. */
3942 canonical_type_parameter (tree type
)
3945 int idx
= TEMPLATE_TYPE_IDX (type
);
3946 if (!canonical_template_parms
)
3947 vec_alloc (canonical_template_parms
, idx
+1);
3949 while (canonical_template_parms
->length () <= (unsigned)idx
)
3950 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3952 list
= (*canonical_template_parms
)[idx
];
3953 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3954 list
= TREE_CHAIN (list
);
3957 return TREE_VALUE (list
);
3960 (*canonical_template_parms
)[idx
]
3961 = tree_cons (NULL_TREE
, type
,
3962 (*canonical_template_parms
)[idx
]);
3967 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3968 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3969 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3970 new one is created. */
3973 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3974 tsubst_flags_t complain
)
3976 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3977 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3978 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3979 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3981 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3984 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3985 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3986 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3987 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3988 DECL_ARTIFICIAL (decl
) = 1;
3989 SET_DECL_TEMPLATE_PARM_P (decl
);
3991 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3992 TEMPLATE_PARM_LEVEL (index
) - levels
,
3993 TEMPLATE_PARM_ORIG_LEVEL (index
),
3995 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3996 TEMPLATE_PARM_PARAMETER_PACK (t
)
3997 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3999 /* Template template parameters need this. */
4000 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4002 DECL_TEMPLATE_RESULT (decl
)
4003 = build_decl (DECL_SOURCE_LOCATION (decl
),
4004 TYPE_DECL
, DECL_NAME (decl
), type
);
4005 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
4006 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
4007 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
4011 return TEMPLATE_PARM_DESCENDANTS (index
);
4014 /* Process information from new template parameter PARM and append it
4015 to the LIST being built. This new parameter is a non-type
4016 parameter iff IS_NON_TYPE is true. This new parameter is a
4017 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4021 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4022 bool is_non_type
, bool is_parameter_pack
)
4027 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4028 tree defval
= TREE_PURPOSE (parm
);
4029 tree constr
= TREE_TYPE (parm
);
4033 tree p
= tree_last (list
);
4035 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4038 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4039 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4041 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4049 parm
= TREE_VALUE (parm
);
4051 SET_DECL_TEMPLATE_PARM_P (parm
);
4053 if (TREE_TYPE (parm
) != error_mark_node
)
4057 The top-level cv-qualifiers on the template-parameter are
4058 ignored when determining its type. */
4059 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4060 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4061 TREE_TYPE (parm
) = error_mark_node
;
4062 else if (uses_parameter_packs (TREE_TYPE (parm
))
4063 && !is_parameter_pack
4064 /* If we're in a nested template parameter list, the template
4065 template parameter could be a parameter pack. */
4066 && processing_template_parmlist
== 1)
4068 /* This template parameter is not a parameter pack, but it
4069 should be. Complain about "bare" parameter packs. */
4070 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4072 /* Recover by calling this a parameter pack. */
4073 is_parameter_pack
= true;
4077 /* A template parameter is not modifiable. */
4078 TREE_CONSTANT (parm
) = 1;
4079 TREE_READONLY (parm
) = 1;
4080 decl
= build_decl (parm_loc
,
4081 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4082 TREE_CONSTANT (decl
) = 1;
4083 TREE_READONLY (decl
) = 1;
4084 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4085 = build_template_parm_index (idx
, processing_template_decl
,
4086 processing_template_decl
,
4087 decl
, TREE_TYPE (parm
));
4089 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4090 = is_parameter_pack
;
4095 parm
= TREE_VALUE (TREE_VALUE (parm
));
4097 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4099 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4100 /* This is for distinguishing between real templates and template
4101 template parameters */
4102 TREE_TYPE (parm
) = t
;
4103 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4108 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4109 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4110 decl
= build_decl (parm_loc
,
4111 TYPE_DECL
, parm
, t
);
4114 TYPE_NAME (t
) = decl
;
4115 TYPE_STUB_DECL (t
) = decl
;
4117 TEMPLATE_TYPE_PARM_INDEX (t
)
4118 = build_template_parm_index (idx
, processing_template_decl
,
4119 processing_template_decl
,
4120 decl
, TREE_TYPE (parm
));
4121 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4122 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4124 DECL_ARTIFICIAL (decl
) = 1;
4125 SET_DECL_TEMPLATE_PARM_P (decl
);
4127 /* Build requirements for the type/template parameter.
4128 This must be done after SET_DECL_TEMPLATE_PARM_P or
4129 process_template_parm could fail. */
4130 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4134 /* Build the parameter node linking the parameter declaration,
4135 its default argument (if any), and its constraints (if any). */
4136 parm
= build_tree_list (defval
, parm
);
4137 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4139 return chainon (list
, parm
);
4142 /* The end of a template parameter list has been reached. Process the
4143 tree list into a parameter vector, converting each parameter into a more
4144 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4148 end_template_parm_list (tree parms
)
4152 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4154 /* Pop the dummy parameter level and add the real one. */
4155 current_template_parms
= TREE_CHAIN (current_template_parms
);
4157 current_template_parms
4158 = tree_cons (size_int (processing_template_decl
),
4159 saved_parmlist
, current_template_parms
);
4161 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4163 next
= TREE_CHAIN (parm
);
4164 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4165 TREE_CHAIN (parm
) = NULL_TREE
;
4168 --processing_template_parmlist
;
4170 return saved_parmlist
;
4173 // Explicitly indicate the end of the template parameter list. We assume
4174 // that the current template parameters have been constructed and/or
4175 // managed explicitly, as when creating new template template parameters
4176 // from a shorthand constraint.
4178 end_template_parm_list ()
4180 --processing_template_parmlist
;
4183 /* end_template_decl is called after a template declaration is seen. */
4186 end_template_decl (void)
4188 reset_specialization ();
4190 if (! processing_template_decl
)
4193 /* This matches the pushlevel in begin_template_parm_list. */
4196 --processing_template_decl
;
4197 current_template_parms
= TREE_CHAIN (current_template_parms
);
4200 /* Takes a TREE_LIST representing a template parameter and convert it
4201 into an argument suitable to be passed to the type substitution
4202 functions. Note that If the TREE_LIST contains an error_mark
4203 node, the returned argument is error_mark_node. */
4206 template_parm_to_arg (tree t
)
4210 || TREE_CODE (t
) != TREE_LIST
)
4213 if (error_operand_p (TREE_VALUE (t
)))
4214 return error_mark_node
;
4218 if (TREE_CODE (t
) == TYPE_DECL
4219 || TREE_CODE (t
) == TEMPLATE_DECL
)
4223 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4225 /* Turn this argument into a TYPE_ARGUMENT_PACK
4226 with a single element, which expands T. */
4227 tree vec
= make_tree_vec (1);
4229 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4231 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4233 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4234 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4239 t
= DECL_INITIAL (t
);
4241 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4243 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4244 with a single element, which expands T. */
4245 tree vec
= make_tree_vec (1);
4246 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4248 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4250 t
= convert_from_reference (t
);
4251 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4253 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4254 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4255 TREE_TYPE (t
) = type
;
4258 t
= convert_from_reference (t
);
4263 /* Given a set of template parameters, return them as a set of template
4264 arguments. The template parameters are represented as a TREE_VEC, in
4265 the form documented in cp-tree.h for template arguments. */
4268 template_parms_to_args (tree parms
)
4271 tree args
= NULL_TREE
;
4272 int length
= TMPL_PARMS_DEPTH (parms
);
4275 /* If there is only one level of template parameters, we do not
4276 create a TREE_VEC of TREE_VECs. Instead, we return a single
4277 TREE_VEC containing the arguments. */
4279 args
= make_tree_vec (length
);
4281 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4283 tree a
= copy_node (TREE_VALUE (header
));
4286 TREE_TYPE (a
) = NULL_TREE
;
4287 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4288 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4291 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4294 TREE_VEC_ELT (args
, --l
) = a
;
4302 /* Within the declaration of a template, return the currently active
4303 template parameters as an argument TREE_VEC. */
4306 current_template_args (void)
4308 return template_parms_to_args (current_template_parms
);
4311 /* Update the declared TYPE by doing any lookups which were thought to be
4312 dependent, but are not now that we know the SCOPE of the declarator. */
4315 maybe_update_decl_type (tree orig_type
, tree scope
)
4317 tree type
= orig_type
;
4319 if (type
== NULL_TREE
)
4322 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4323 type
= TREE_TYPE (type
);
4325 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4326 && dependent_type_p (type
)
4327 /* Don't bother building up the args in this case. */
4328 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4330 /* tsubst in the args corresponding to the template parameters,
4331 including auto if present. Most things will be unchanged, but
4332 make_typename_type and tsubst_qualified_id will resolve
4333 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4334 tree args
= current_template_args ();
4335 tree auto_node
= type_uses_auto (type
);
4339 tree auto_vec
= make_tree_vec (1);
4340 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4341 args
= add_to_template_args (args
, auto_vec
);
4343 pushed
= push_scope (scope
);
4344 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4349 if (type
== error_mark_node
)
4352 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4354 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4357 type
= TYPE_NAME (type
);
4362 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4363 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4364 the new template is a member template. */
4367 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4369 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4370 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4371 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4372 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4373 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4378 struct template_parm_data
4380 /* The level of the template parameters we are currently
4384 /* The index of the specialization argument we are currently
4388 /* An array whose size is the number of template parameters. The
4389 elements are nonzero if the parameter has been used in any one
4390 of the arguments processed so far. */
4393 /* An array whose size is the number of template arguments. The
4394 elements are nonzero if the argument makes use of template
4395 parameters of this level. */
4396 int* arg_uses_template_parms
;
4399 /* Subroutine of push_template_decl used to see if each template
4400 parameter in a partial specialization is used in the explicit
4401 argument list. If T is of the LEVEL given in DATA (which is
4402 treated as a template_parm_data*), then DATA->PARMS is marked
4406 mark_template_parm (tree t
, void* data
)
4410 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4412 template_parm_level_and_index (t
, &level
, &idx
);
4414 if (level
== tpd
->level
)
4416 tpd
->parms
[idx
] = 1;
4417 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4420 /* Return zero so that for_each_template_parm will continue the
4421 traversal of the tree; we want to mark *every* template parm. */
4425 /* Process the partial specialization DECL. */
4428 process_partial_specialization (tree decl
)
4430 tree type
= TREE_TYPE (decl
);
4431 tree tinfo
= get_template_info (decl
);
4432 tree maintmpl
= TI_TEMPLATE (tinfo
);
4433 tree specargs
= TI_ARGS (tinfo
);
4434 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4435 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4438 int nargs
= TREE_VEC_LENGTH (inner_args
);
4441 bool did_error_intro
= false;
4442 struct template_parm_data tpd
;
4443 struct template_parm_data tpd2
;
4445 gcc_assert (current_template_parms
);
4447 /* A concept cannot be specialized. */
4448 if (flag_concepts
&& variable_concept_p (maintmpl
))
4450 error ("specialization of variable concept %q#D", maintmpl
);
4451 return error_mark_node
;
4454 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4455 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4457 /* We check that each of the template parameters given in the
4458 partial specialization is used in the argument list to the
4459 specialization. For example:
4461 template <class T> struct S;
4462 template <class T> struct S<T*>;
4464 The second declaration is OK because `T*' uses the template
4465 parameter T, whereas
4467 template <class T> struct S<int>;
4469 is no good. Even trickier is:
4480 The S2<T> declaration is actually invalid; it is a
4481 full-specialization. Of course,
4484 struct S2<T (*)(U)>;
4486 or some such would have been OK. */
4487 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4488 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4489 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4491 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4492 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4493 for (i
= 0; i
< nargs
; ++i
)
4495 tpd
.current_arg
= i
;
4496 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4497 &mark_template_parm
,
4500 /*include_nondeduced_p=*/false);
4502 for (i
= 0; i
< ntparms
; ++i
)
4503 if (tpd
.parms
[i
] == 0)
4505 /* One of the template parms was not used in a deduced context in the
4507 if (!did_error_intro
)
4509 error ("template parameters not deducible in "
4510 "partial specialization:");
4511 did_error_intro
= true;
4514 inform (input_location
, " %qD",
4515 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4518 if (did_error_intro
)
4519 return error_mark_node
;
4521 /* [temp.class.spec]
4523 The argument list of the specialization shall not be identical to
4524 the implicit argument list of the primary template. */
4526 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4527 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4529 || !strictly_subsumes (current_template_constraints (),
4530 get_constraints (maintmpl
))))
4533 error ("partial specialization %q+D does not specialize "
4534 "any template arguments", decl
);
4536 error ("partial specialization %q+D does not specialize any "
4537 "template arguments and is not more constrained than", decl
);
4538 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4541 /* A partial specialization that replaces multiple parameters of the
4542 primary template with a pack expansion is less specialized for those
4544 if (nargs
< DECL_NTPARMS (maintmpl
))
4546 error ("partial specialization is not more specialized than the "
4547 "primary template because it replaces multiple parameters "
4548 "with a pack expansion");
4549 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4553 /* [temp.class.spec]
4555 A partially specialized non-type argument expression shall not
4556 involve template parameters of the partial specialization except
4557 when the argument expression is a simple identifier.
4559 The type of a template parameter corresponding to a specialized
4560 non-type argument shall not be dependent on a parameter of the
4563 Also, we verify that pack expansions only occur at the
4564 end of the argument list. */
4565 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4567 for (i
= 0; i
< nargs
; ++i
)
4569 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4570 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4571 tree packed_args
= NULL_TREE
;
4574 if (ARGUMENT_PACK_P (arg
))
4576 /* Extract the arguments from the argument pack. We'll be
4577 iterating over these in the following loop. */
4578 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4579 len
= TREE_VEC_LENGTH (packed_args
);
4582 for (j
= 0; j
< len
; j
++)
4585 /* Get the Jth argument in the parameter pack. */
4586 arg
= TREE_VEC_ELT (packed_args
, j
);
4588 if (PACK_EXPANSION_P (arg
))
4590 /* Pack expansions must come at the end of the
4592 if ((packed_args
&& j
< len
- 1)
4593 || (!packed_args
&& i
< nargs
- 1))
4595 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4596 error ("parameter pack argument %qE must be at the "
4597 "end of the template argument list", arg
);
4599 error ("parameter pack argument %qT must be at the "
4600 "end of the template argument list", arg
);
4604 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4605 /* We only care about the pattern. */
4606 arg
= PACK_EXPANSION_PATTERN (arg
);
4608 if (/* These first two lines are the `non-type' bit. */
4610 && TREE_CODE (arg
) != TEMPLATE_DECL
4611 /* This next two lines are the `argument expression is not just a
4612 simple identifier' condition and also the `specialized
4613 non-type argument' bit. */
4614 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4615 && !(REFERENCE_REF_P (arg
)
4616 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4618 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4619 || (packed_args
&& uses_template_parms (arg
)))
4620 error ("template argument %qE involves template parameter(s)",
4624 /* Look at the corresponding template parameter,
4625 marking which template parameters its type depends
4627 tree type
= TREE_TYPE (parm
);
4631 /* We haven't yet initialized TPD2. Do so now. */
4632 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4633 /* The number of parameters here is the number in the
4634 main template, which, as checked in the assertion
4636 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4638 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4641 /* Mark the template parameters. But this time, we're
4642 looking for the template parameters of the main
4643 template, not in the specialization. */
4644 tpd2
.current_arg
= i
;
4645 tpd2
.arg_uses_template_parms
[i
] = 0;
4646 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4647 for_each_template_parm (type
,
4648 &mark_template_parm
,
4651 /*include_nondeduced_p=*/false);
4653 if (tpd2
.arg_uses_template_parms
[i
])
4655 /* The type depended on some template parameters.
4656 If they are fully specialized in the
4657 specialization, that's OK. */
4660 for (j
= 0; j
< nargs
; ++j
)
4661 if (tpd2
.parms
[j
] != 0
4662 && tpd
.arg_uses_template_parms
[j
])
4665 error_n (input_location
, count
,
4666 "type %qT of template argument %qE depends "
4667 "on a template parameter",
4668 "type %qT of template argument %qE depends "
4669 "on template parameters",
4678 /* We should only get here once. */
4679 if (TREE_CODE (decl
) == TYPE_DECL
)
4680 gcc_assert (!COMPLETE_TYPE_P (type
));
4682 // Build the template decl.
4683 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4684 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4685 TREE_TYPE (tmpl
) = type
;
4686 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4687 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4688 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4689 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4692 /* We didn't register this in check_explicit_specialization so we could
4693 wait until the constraints were set. */
4694 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4696 associate_classtype_constraints (type
);
4698 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4699 = tree_cons (specargs
, tmpl
,
4700 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4701 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4703 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4704 inst
= TREE_CHAIN (inst
))
4706 tree instance
= TREE_VALUE (inst
);
4707 if (TYPE_P (instance
)
4708 ? (COMPLETE_TYPE_P (instance
)
4709 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4710 : DECL_TEMPLATE_INSTANTIATION (instance
))
4712 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4713 tree inst_decl
= (DECL_P (instance
)
4714 ? instance
: TYPE_NAME (instance
));
4717 else if (spec
== error_mark_node
)
4718 permerror (input_location
,
4719 "declaration of %qD ambiguates earlier template "
4720 "instantiation for %qD", decl
, inst_decl
);
4721 else if (TREE_VALUE (spec
) == tmpl
)
4722 permerror (input_location
,
4723 "partial specialization of %qD after instantiation "
4724 "of %qD", decl
, inst_decl
);
4731 /* PARM is a template parameter of some form; return the corresponding
4732 TEMPLATE_PARM_INDEX. */
4735 get_template_parm_index (tree parm
)
4737 if (TREE_CODE (parm
) == PARM_DECL
4738 || TREE_CODE (parm
) == CONST_DECL
)
4739 parm
= DECL_INITIAL (parm
);
4740 else if (TREE_CODE (parm
) == TYPE_DECL
4741 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4742 parm
= TREE_TYPE (parm
);
4743 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4744 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4745 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4746 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4747 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4751 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4752 parameter packs used by the template parameter PARM. */
4755 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4757 /* A type parm can't refer to another parm. */
4758 if (TREE_CODE (parm
) == TYPE_DECL
)
4760 else if (TREE_CODE (parm
) == PARM_DECL
)
4762 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4767 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4769 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4770 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4771 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4774 /* PARM is a template parameter pack. Return any parameter packs used in
4775 its type or the type of any of its template parameters. If there are
4776 any such packs, it will be instantiated into a fixed template parameter
4777 list by partial instantiation rather than be fully deduced. */
4780 fixed_parameter_pack_p (tree parm
)
4782 /* This can only be true in a member template. */
4783 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4785 /* This can only be true for a parameter pack. */
4786 if (!template_parameter_pack_p (parm
))
4788 /* A type parm can't refer to another parm. */
4789 if (TREE_CODE (parm
) == TYPE_DECL
)
4792 tree parameter_packs
= NULL_TREE
;
4793 struct find_parameter_pack_data ppd
;
4794 ppd
.parameter_packs
= ¶meter_packs
;
4795 ppd
.visited
= new hash_set
<tree
>;
4796 ppd
.type_pack_expansion_p
= false;
4798 fixed_parameter_pack_p_1 (parm
, &ppd
);
4801 return parameter_packs
;
4804 /* Check that a template declaration's use of default arguments and
4805 parameter packs is not invalid. Here, PARMS are the template
4806 parameters. IS_PRIMARY is true if DECL is the thing declared by
4807 a primary template. IS_PARTIAL is true if DECL is a partial
4810 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4811 declaration (but not a definition); 1 indicates a declaration, 2
4812 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4813 emitted for extraneous default arguments.
4815 Returns TRUE if there were no errors found, FALSE otherwise. */
4818 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4819 bool is_partial
, int is_friend_decl
)
4822 int last_level_to_check
;
4824 bool no_errors
= true;
4828 A default template-argument shall not be specified in a
4829 function template declaration or a function template definition, nor
4830 in the template-parameter-list of the definition of a member of a
4833 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4834 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4835 /* You can't have a function template declaration in a local
4836 scope, nor you can you define a member of a class template in a
4840 if ((TREE_CODE (decl
) == TYPE_DECL
4842 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4843 || (TREE_CODE (decl
) == FUNCTION_DECL
4844 && LAMBDA_FUNCTION_P (decl
)))
4845 /* A lambda doesn't have an explicit declaration; don't complain
4846 about the parms of the enclosing class. */
4849 if (current_class_type
4850 && !TYPE_BEING_DEFINED (current_class_type
)
4851 && DECL_LANG_SPECIFIC (decl
)
4852 && DECL_DECLARES_FUNCTION_P (decl
)
4853 /* If this is either a friend defined in the scope of the class
4854 or a member function. */
4855 && (DECL_FUNCTION_MEMBER_P (decl
)
4856 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4857 : DECL_FRIEND_CONTEXT (decl
)
4858 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4860 /* And, if it was a member function, it really was defined in
4861 the scope of the class. */
4862 && (!DECL_FUNCTION_MEMBER_P (decl
)
4863 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4864 /* We already checked these parameters when the template was
4865 declared, so there's no need to do it again now. This function
4866 was defined in class scope, but we're processing its body now
4867 that the class is complete. */
4870 /* Core issue 226 (C++0x only): the following only applies to class
4873 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4877 If a template-parameter has a default template-argument, all
4878 subsequent template-parameters shall have a default
4879 template-argument supplied. */
4880 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4882 tree inner_parms
= TREE_VALUE (parm_level
);
4883 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4884 int seen_def_arg_p
= 0;
4887 for (i
= 0; i
< ntparms
; ++i
)
4889 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4891 if (parm
== error_mark_node
)
4894 if (TREE_PURPOSE (parm
))
4896 else if (seen_def_arg_p
4897 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4899 error ("no default argument for %qD", TREE_VALUE (parm
));
4900 /* For better subsequent error-recovery, we indicate that
4901 there should have been a default argument. */
4902 TREE_PURPOSE (parm
) = error_mark_node
;
4905 else if (!is_partial
4907 /* Don't complain about an enclosing partial
4909 && parm_level
== parms
4910 && TREE_CODE (decl
) == TYPE_DECL
4912 && template_parameter_pack_p (TREE_VALUE (parm
))
4913 /* A fixed parameter pack will be partially
4914 instantiated into a fixed length list. */
4915 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4917 /* A primary class template can only have one
4918 parameter pack, at the end of the template
4921 error ("parameter pack %q+D must be at the end of the"
4922 " template parameter list", TREE_VALUE (parm
));
4924 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4932 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4936 /* For an ordinary class template, default template arguments are
4937 allowed at the innermost level, e.g.:
4938 template <class T = int>
4940 but, in a partial specialization, they're not allowed even
4941 there, as we have in [temp.class.spec]:
4943 The template parameter list of a specialization shall not
4944 contain default template argument values.
4946 So, for a partial specialization, or for a function template
4947 (in C++98/C++03), we look at all of them. */
4950 /* But, for a primary class template that is not a partial
4951 specialization we look at all template parameters except the
4953 parms
= TREE_CHAIN (parms
);
4955 /* Figure out what error message to issue. */
4956 if (is_friend_decl
== 2)
4957 msg
= G_("default template arguments may not be used in function template "
4958 "friend re-declaration");
4959 else if (is_friend_decl
)
4960 msg
= G_("default template arguments may not be used in function template "
4961 "friend declarations");
4962 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4963 msg
= G_("default template arguments may not be used in function templates "
4964 "without -std=c++11 or -std=gnu++11");
4965 else if (is_partial
)
4966 msg
= G_("default template arguments may not be used in "
4967 "partial specializations");
4968 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4969 msg
= G_("default argument for template parameter for class enclosing %qD");
4971 /* Per [temp.param]/9, "A default template-argument shall not be
4972 specified in the template-parameter-lists of the definition of
4973 a member of a class template that appears outside of the member's
4974 class.", thus if we aren't handling a member of a class template
4975 there is no need to examine the parameters. */
4978 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4979 /* If we're inside a class definition, there's no need to
4980 examine the parameters to the class itself. On the one
4981 hand, they will be checked when the class is defined, and,
4982 on the other, default arguments are valid in things like:
4983 template <class T = double>
4984 struct S { template <class U> void f(U); };
4985 Here the default argument for `S' has no bearing on the
4986 declaration of `f'. */
4987 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4989 /* Check everything. */
4990 last_level_to_check
= 0;
4992 for (parm_level
= parms
;
4993 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4994 parm_level
= TREE_CHAIN (parm_level
))
4996 tree inner_parms
= TREE_VALUE (parm_level
);
5000 ntparms
= TREE_VEC_LENGTH (inner_parms
);
5001 for (i
= 0; i
< ntparms
; ++i
)
5003 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
5006 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5011 if (is_friend_decl
== 2)
5018 /* Clear out the default argument so that we are not
5020 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5024 /* At this point, if we're still interested in issuing messages,
5025 they must apply to classes surrounding the object declared. */
5027 msg
= G_("default argument for template parameter for class "
5034 /* Worker for push_template_decl_real, called via
5035 for_each_template_parm. DATA is really an int, indicating the
5036 level of the parameters we are interested in. If T is a template
5037 parameter of that level, return nonzero. */
5040 template_parm_this_level_p (tree t
, void* data
)
5042 int this_level
= *(int *)data
;
5045 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5046 level
= TEMPLATE_PARM_LEVEL (t
);
5048 level
= TEMPLATE_TYPE_LEVEL (t
);
5049 return level
== this_level
;
5052 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5053 parameters given by current_template_args, or reuses a
5054 previously existing one, if appropriate. Returns the DECL, or an
5055 equivalent one, if it is replaced via a call to duplicate_decls.
5057 If IS_FRIEND is true, DECL is a friend declaration. */
5060 push_template_decl_real (tree decl
, bool is_friend
)
5068 int new_template_p
= 0;
5069 /* True if the template is a member template, in the sense of
5071 bool member_template_p
= false;
5073 if (decl
== error_mark_node
|| !current_template_parms
)
5074 return error_mark_node
;
5076 /* See if this is a partial specialization. */
5077 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5078 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5079 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5081 && DECL_LANG_SPECIFIC (decl
)
5082 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5083 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5085 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5089 /* For a friend, we want the context of the friend function, not
5090 the type of which it is a friend. */
5091 ctx
= CP_DECL_CONTEXT (decl
);
5092 else if (CP_DECL_CONTEXT (decl
)
5093 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5094 /* In the case of a virtual function, we want the class in which
5096 ctx
= CP_DECL_CONTEXT (decl
);
5098 /* Otherwise, if we're currently defining some class, the DECL
5099 is assumed to be a member of the class. */
5100 ctx
= current_scope ();
5102 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5105 if (!DECL_CONTEXT (decl
))
5106 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5108 /* See if this is a primary template. */
5109 if (is_friend
&& ctx
5110 && uses_template_parms_level (ctx
, processing_template_decl
))
5111 /* A friend template that specifies a class context, i.e.
5112 template <typename T> friend void A<T>::f();
5115 else if (TREE_CODE (decl
) == TYPE_DECL
5116 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5119 is_primary
= template_parm_scope_p ();
5123 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5125 if (DECL_CLASS_SCOPE_P (decl
))
5126 member_template_p
= true;
5127 if (TREE_CODE (decl
) == TYPE_DECL
5128 && anon_aggrname_p (DECL_NAME (decl
)))
5130 error ("template class without a name");
5131 return error_mark_node
;
5133 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5135 if (member_template_p
)
5137 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5138 error ("member template %qD may not have virt-specifiers", decl
);
5140 if (DECL_DESTRUCTOR_P (decl
))
5144 A destructor shall not be a member template. */
5145 error ("destructor %qD declared as member template", decl
);
5146 return error_mark_node
;
5148 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5149 && (!prototype_p (TREE_TYPE (decl
))
5150 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5151 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5152 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5153 == void_list_node
)))
5155 /* [basic.stc.dynamic.allocation]
5157 An allocation function can be a function
5158 template. ... Template allocation functions shall
5159 have two or more parameters. */
5160 error ("invalid template declaration of %qD", decl
);
5161 return error_mark_node
;
5164 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5165 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5167 else if (TREE_CODE (decl
) == TYPE_DECL
5168 && TYPE_DECL_ALIAS_P (decl
))
5169 /* alias-declaration */
5170 gcc_assert (!DECL_ARTIFICIAL (decl
));
5171 else if (VAR_P (decl
))
5172 /* C++14 variable template. */;
5175 error ("template declaration of %q#D", decl
);
5176 return error_mark_node
;
5180 /* Check to see that the rules regarding the use of default
5181 arguments are not being violated. */
5182 check_default_tmpl_args (decl
, current_template_parms
,
5183 is_primary
, is_partial
, /*is_friend_decl=*/0);
5185 /* Ensure that there are no parameter packs in the type of this
5186 declaration that have not been expanded. */
5187 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5189 /* Check each of the arguments individually to see if there are
5190 any bare parameter packs. */
5191 tree type
= TREE_TYPE (decl
);
5192 tree arg
= DECL_ARGUMENTS (decl
);
5193 tree argtype
= TYPE_ARG_TYPES (type
);
5195 while (arg
&& argtype
)
5197 if (!DECL_PACK_P (arg
)
5198 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5200 /* This is a PARM_DECL that contains unexpanded parameter
5201 packs. We have already complained about this in the
5202 check_for_bare_parameter_packs call, so just replace
5203 these types with ERROR_MARK_NODE. */
5204 TREE_TYPE (arg
) = error_mark_node
;
5205 TREE_VALUE (argtype
) = error_mark_node
;
5208 arg
= DECL_CHAIN (arg
);
5209 argtype
= TREE_CHAIN (argtype
);
5212 /* Check for bare parameter packs in the return type and the
5213 exception specifiers. */
5214 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5215 /* Errors were already issued, set return type to int
5216 as the frontend doesn't expect error_mark_node as
5218 TREE_TYPE (type
) = integer_type_node
;
5219 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5220 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5222 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5223 && TYPE_DECL_ALIAS_P (decl
))
5224 ? DECL_ORIGINAL_TYPE (decl
)
5225 : TREE_TYPE (decl
)))
5227 TREE_TYPE (decl
) = error_mark_node
;
5228 return error_mark_node
;
5232 return process_partial_specialization (decl
);
5234 args
= current_template_args ();
5237 || TREE_CODE (ctx
) == FUNCTION_DECL
5238 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5239 || (TREE_CODE (decl
) == TYPE_DECL
5240 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5241 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5243 if (DECL_LANG_SPECIFIC (decl
)
5244 && DECL_TEMPLATE_INFO (decl
)
5245 && DECL_TI_TEMPLATE (decl
))
5246 tmpl
= DECL_TI_TEMPLATE (decl
);
5247 /* If DECL is a TYPE_DECL for a class-template, then there won't
5248 be DECL_LANG_SPECIFIC. The information equivalent to
5249 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5250 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5251 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5252 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5254 /* Since a template declaration already existed for this
5255 class-type, we must be redeclaring it here. Make sure
5256 that the redeclaration is valid. */
5257 redeclare_class_template (TREE_TYPE (decl
),
5258 current_template_parms
,
5259 current_template_constraints ());
5260 /* We don't need to create a new TEMPLATE_DECL; just use the
5261 one we already had. */
5262 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5266 tmpl
= build_template_decl (decl
, current_template_parms
,
5270 if (DECL_LANG_SPECIFIC (decl
)
5271 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5273 /* A specialization of a member template of a template
5275 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5276 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5277 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5283 tree a
, t
, current
, parms
;
5285 tree tinfo
= get_template_info (decl
);
5289 error ("template definition of non-template %q#D", decl
);
5290 return error_mark_node
;
5293 tmpl
= TI_TEMPLATE (tinfo
);
5295 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5296 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5297 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5298 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5302 /* The declaration is a specialization of a member
5303 template, declared outside the class. Therefore, the
5304 innermost template arguments will be NULL, so we
5305 replace them with the arguments determined by the
5306 earlier call to check_explicit_specialization. */
5307 args
= DECL_TI_ARGS (decl
);
5310 = build_template_decl (decl
, current_template_parms
,
5312 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5313 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5314 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5315 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5316 DECL_TEMPLATE_INFO (new_tmpl
)
5317 = build_template_info (tmpl
, args
);
5319 register_specialization (new_tmpl
,
5320 most_general_template (tmpl
),
5326 /* Make sure the template headers we got make sense. */
5328 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5329 i
= TMPL_PARMS_DEPTH (parms
);
5330 if (TMPL_ARGS_DEPTH (args
) != i
)
5332 error ("expected %d levels of template parms for %q#D, got %d",
5333 i
, decl
, TMPL_ARGS_DEPTH (args
));
5334 DECL_INTERFACE_KNOWN (decl
) = 1;
5335 return error_mark_node
;
5338 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5340 a
= TMPL_ARGS_LEVEL (args
, i
);
5341 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5343 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5345 if (current
== decl
)
5346 error ("got %d template parameters for %q#D",
5347 TREE_VEC_LENGTH (a
), decl
);
5349 error ("got %d template parameters for %q#T",
5350 TREE_VEC_LENGTH (a
), current
);
5351 error (" but %d required", TREE_VEC_LENGTH (t
));
5352 /* Avoid crash in import_export_decl. */
5353 DECL_INTERFACE_KNOWN (decl
) = 1;
5354 return error_mark_node
;
5357 if (current
== decl
)
5359 else if (current
== NULL_TREE
)
5360 /* Can happen in erroneous input. */
5363 current
= get_containing_scope (current
);
5366 /* Check that the parms are used in the appropriate qualifying scopes
5367 in the declarator. */
5368 if (!comp_template_args
5370 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5373 template arguments to %qD do not match original template %qD",
5374 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5375 if (!uses_template_parms (TI_ARGS (tinfo
)))
5376 inform (input_location
, "use template<> for an explicit specialization");
5377 /* Avoid crash in import_export_decl. */
5378 DECL_INTERFACE_KNOWN (decl
) = 1;
5379 return error_mark_node
;
5383 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5384 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5386 /* Push template declarations for global functions and types. Note
5387 that we do not try to push a global template friend declared in a
5388 template class; such a thing may well depend on the template
5389 parameters of the class. */
5390 if (new_template_p
&& !ctx
5391 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5393 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5394 if (tmpl
== error_mark_node
)
5395 return error_mark_node
;
5397 /* Hide template friend classes that haven't been declared yet. */
5398 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5400 DECL_ANTICIPATED (tmpl
) = 1;
5401 DECL_FRIEND_P (tmpl
) = 1;
5407 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5410 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5411 if (DECL_CONV_FN_P (tmpl
))
5413 int depth
= TMPL_PARMS_DEPTH (parms
);
5415 /* It is a conversion operator. See if the type converted to
5416 depends on innermost template operands. */
5418 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5420 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5423 /* Give template template parms a DECL_CONTEXT of the template
5424 for which they are a parameter. */
5425 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5426 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5428 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5429 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5430 DECL_CONTEXT (parm
) = tmpl
;
5433 if (TREE_CODE (decl
) == TYPE_DECL
5434 && TYPE_DECL_ALIAS_P (decl
)
5435 && complex_alias_template_p (tmpl
))
5436 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5439 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5440 back to its most general template. If TMPL is a specialization,
5441 ARGS may only have the innermost set of arguments. Add the missing
5442 argument levels if necessary. */
5443 if (DECL_TEMPLATE_INFO (tmpl
))
5444 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5446 info
= build_template_info (tmpl
, args
);
5448 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5449 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5452 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5453 retrofit_lang_decl (decl
);
5454 if (DECL_LANG_SPECIFIC (decl
))
5455 DECL_TEMPLATE_INFO (decl
) = info
;
5458 if (flag_implicit_templates
5460 && TREE_PUBLIC (decl
)
5461 && VAR_OR_FUNCTION_DECL_P (decl
))
5462 /* Set DECL_COMDAT on template instantiations; if we force
5463 them to be emitted by explicit instantiation or -frepo,
5464 mark_needed will tell cgraph to do the right thing. */
5465 DECL_COMDAT (decl
) = true;
5467 return DECL_TEMPLATE_RESULT (tmpl
);
5471 push_template_decl (tree decl
)
5473 return push_template_decl_real (decl
, false);
5476 /* FN is an inheriting constructor that inherits from the constructor
5477 template INHERITED; turn FN into a constructor template with a matching
5481 add_inherited_template_parms (tree fn
, tree inherited
)
5484 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5485 inner_parms
= copy_node (inner_parms
);
5487 = tree_cons (size_int (processing_template_decl
+ 1),
5488 inner_parms
, current_template_parms
);
5489 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5490 tree args
= template_parms_to_args (parms
);
5491 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5492 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5493 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5494 DECL_ARTIFICIAL (tmpl
) = true;
5495 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5499 /* Called when a class template TYPE is redeclared with the indicated
5500 template PARMS, e.g.:
5502 template <class T> struct S;
5503 template <class T> struct S {}; */
5506 redeclare_class_template (tree type
, tree parms
, tree cons
)
5512 if (!TYPE_TEMPLATE_INFO (type
))
5514 error ("%qT is not a template type", type
);
5518 tmpl
= TYPE_TI_TEMPLATE (type
);
5519 if (!PRIMARY_TEMPLATE_P (tmpl
))
5520 /* The type is nested in some template class. Nothing to worry
5521 about here; there are no new template parameters for the nested
5527 error ("template specifiers not specified in declaration of %qD",
5532 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5533 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5535 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5537 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5538 "redeclared with %d template parameter",
5539 "redeclared with %d template parameters",
5540 TREE_VEC_LENGTH (parms
));
5541 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5542 "previous declaration %qD used %d template parameter",
5543 "previous declaration %qD used %d template parameters",
5544 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5548 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5555 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5556 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5559 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5560 if (error_operand_p (tmpl_parm
))
5563 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5564 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5565 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5567 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5569 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5570 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5571 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5572 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5573 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5574 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5575 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5576 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5577 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5579 error ("template parameter %q+#D", tmpl_parm
);
5580 error ("redeclared here as %q#D", parm
);
5584 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5586 /* We have in [temp.param]:
5588 A template-parameter may not be given default arguments
5589 by two different declarations in the same scope. */
5590 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5591 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5592 "original definition appeared here");
5596 if (parm_default
!= NULL_TREE
)
5597 /* Update the previous template parameters (which are the ones
5598 that will really count) with the new default value. */
5599 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5600 else if (tmpl_default
!= NULL_TREE
)
5601 /* Update the new parameters, too; they'll be used as the
5602 parameters for any members. */
5603 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5605 /* Give each template template parm in this redeclaration a
5606 DECL_CONTEXT of the template for which they are a parameter. */
5607 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5609 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5610 DECL_CONTEXT (parm
) = tmpl
;
5614 // Cannot redeclare a class template with a different set of constraints.
5615 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5617 error_at (input_location
, "redeclaration %q#D with different "
5618 "constraints", tmpl
);
5619 inform (DECL_SOURCE_LOCATION (tmpl
),
5620 "original declaration appeared here");
5626 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5627 to be used when the caller has already checked
5628 (processing_template_decl
5629 && !instantiation_dependent_expression_p (expr)
5630 && potential_constant_expression (expr))
5631 and cleared processing_template_decl. */
5634 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5636 return tsubst_copy_and_build (expr
,
5639 /*in_decl=*/NULL_TREE
,
5640 /*function_p=*/false,
5641 /*integral_constant_expression_p=*/true);
5644 /* Simplify EXPR if it is a non-dependent expression. Returns the
5645 (possibly simplified) expression. */
5648 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5650 if (expr
== NULL_TREE
)
5653 /* If we're in a template, but EXPR isn't value dependent, simplify
5654 it. We're supposed to treat:
5656 template <typename T> void f(T[1 + 1]);
5657 template <typename T> void f(T[2]);
5659 as two declarations of the same function, for example. */
5660 if (processing_template_decl
5661 && potential_nondependent_constant_expression (expr
))
5663 processing_template_decl_sentinel s
;
5664 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5670 instantiate_non_dependent_expr (tree expr
)
5672 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5675 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
5676 an uninstantiated expression. */
5679 instantiate_non_dependent_or_null (tree expr
)
5681 if (expr
== NULL_TREE
)
5683 if (processing_template_decl
)
5685 if (!potential_nondependent_constant_expression (expr
))
5689 processing_template_decl_sentinel s
;
5690 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
5696 /* True iff T is a specialization of a variable template. */
5699 variable_template_specialization_p (tree t
)
5701 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5703 tree tmpl
= DECL_TI_TEMPLATE (t
);
5704 return variable_template_p (tmpl
);
5707 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5708 template declaration, or a TYPE_DECL for an alias declaration. */
5711 alias_type_or_template_p (tree t
)
5715 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5718 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5719 || DECL_ALIAS_TEMPLATE_P (t
));
5722 /* Return TRUE iff T is a specialization of an alias template. */
5725 alias_template_specialization_p (const_tree t
)
5727 /* It's an alias template specialization if it's an alias and its
5728 TYPE_NAME is a specialization of a primary template. */
5729 if (TYPE_ALIAS_P (t
))
5731 tree name
= TYPE_NAME (t
);
5732 if (DECL_LANG_SPECIFIC (name
))
5733 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5735 tree tmpl
= TI_TEMPLATE (ti
);
5736 return PRIMARY_TEMPLATE_P (tmpl
);
5742 /* An alias template is complex from a SFINAE perspective if a template-id
5743 using that alias can be ill-formed when the expansion is not, as with
5744 the void_t template. We determine this by checking whether the
5745 expansion for the alias template uses all its template parameters. */
5747 struct uses_all_template_parms_data
5754 uses_all_template_parms_r (tree t
, void *data_
)
5756 struct uses_all_template_parms_data
&data
5757 = *(struct uses_all_template_parms_data
*)data_
;
5758 tree idx
= get_template_parm_index (t
);
5760 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5761 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5766 complex_alias_template_p (const_tree tmpl
)
5768 struct uses_all_template_parms_data data
;
5769 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5770 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5771 data
.level
= TMPL_PARMS_DEPTH (parms
);
5772 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5773 data
.seen
= XALLOCAVEC (bool, len
);
5774 for (int i
= 0; i
< len
; ++i
)
5775 data
.seen
[i
] = false;
5777 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5778 for (int i
= 0; i
< len
; ++i
)
5784 /* Return TRUE iff T is a specialization of a complex alias template with
5785 dependent template-arguments. */
5788 dependent_alias_template_spec_p (const_tree t
)
5790 return (alias_template_specialization_p (t
)
5791 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5792 && (any_dependent_template_arguments_p
5793 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5796 /* Return the number of innermost template parameters in TMPL. */
5799 num_innermost_template_parms (tree tmpl
)
5801 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5802 return TREE_VEC_LENGTH (parms
);
5805 /* Return either TMPL or another template that it is equivalent to under DR
5806 1286: An alias that just changes the name of a template is equivalent to
5807 the other template. */
5810 get_underlying_template (tree tmpl
)
5812 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5813 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5815 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5816 if (TYPE_TEMPLATE_INFO (result
))
5818 tree sub
= TYPE_TI_TEMPLATE (result
);
5819 if (PRIMARY_TEMPLATE_P (sub
)
5820 && (num_innermost_template_parms (tmpl
)
5821 == num_innermost_template_parms (sub
)))
5823 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5824 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5825 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5827 /* The alias type is equivalent to the pattern of the
5828 underlying template, so strip the alias. */
5838 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5839 must be a function or a pointer-to-function type, as specified
5840 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5841 and check that the resulting function has external linkage. */
5844 convert_nontype_argument_function (tree type
, tree expr
,
5845 tsubst_flags_t complain
)
5849 linkage_kind linkage
;
5851 fn
= instantiate_type (type
, fns
, tf_none
);
5852 if (fn
== error_mark_node
)
5853 return error_mark_node
;
5856 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5857 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5858 if (BASELINK_P (fn_no_ptr
))
5859 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5861 /* [temp.arg.nontype]/1
5863 A template-argument for a non-type, non-template template-parameter
5866 -- the address of an object or function with external [C++11: or
5867 internal] linkage. */
5869 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5871 if (complain
& tf_error
)
5873 error ("%qE is not a valid template argument for type %qT",
5875 if (TYPE_PTR_P (type
))
5876 error ("it must be the address of a function with "
5877 "external linkage");
5879 error ("it must be the name of a function with "
5880 "external linkage");
5885 linkage
= decl_linkage (fn_no_ptr
);
5886 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5888 if (complain
& tf_error
)
5890 if (cxx_dialect
>= cxx11
)
5891 error ("%qE is not a valid template argument for type %qT "
5892 "because %qD has no linkage",
5893 expr
, type
, fn_no_ptr
);
5895 error ("%qE is not a valid template argument for type %qT "
5896 "because %qD does not have external linkage",
5897 expr
, type
, fn_no_ptr
);
5905 /* Subroutine of convert_nontype_argument.
5906 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5907 Emit an error otherwise. */
5910 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5911 tsubst_flags_t complain
)
5914 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5916 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5918 if (processing_template_decl
5919 && TREE_CODE (expr
) == ADDR_EXPR
5920 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5922 if (complain
& tf_error
)
5924 error ("%qE is not a valid template argument for type %qT",
5926 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5931 /* Returns TRUE iff the address of OP is value-dependent.
5933 14.6.2.4 [temp.dep.temp]:
5934 A non-integral non-type template-argument is dependent if its type is
5935 dependent or it has either of the following forms
5938 and contains a nested-name-specifier which specifies a class-name that
5939 names a dependent type.
5941 We generalize this to just say that the address of a member of a
5942 dependent class is value-dependent; the above doesn't cover the
5943 address of a static data member named with an unqualified-id. */
5946 has_value_dependent_address (tree op
)
5948 /* We could use get_inner_reference here, but there's no need;
5949 this is only relevant for template non-type arguments, which
5950 can only be expressed as &id-expression. */
5953 tree ctx
= CP_DECL_CONTEXT (op
);
5954 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5961 /* The next set of functions are used for providing helpful explanatory
5962 diagnostics for failed overload resolution. Their messages should be
5963 indented by two spaces for consistency with the messages in
5967 unify_success (bool /*explain_p*/)
5973 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5976 inform (input_location
,
5977 " couldn't deduce template parameter %qD", parm
);
5982 unify_invalid (bool /*explain_p*/)
5988 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5991 inform (input_location
,
5992 " types %qT and %qT have incompatible cv-qualifiers",
5998 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
6001 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
6006 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6009 inform (input_location
,
6010 " template parameter %qD is not a parameter pack, but "
6017 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6020 inform (input_location
,
6021 " template argument %qE does not match "
6022 "pointer-to-member constant %qE",
6028 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6031 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6036 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6039 inform (input_location
,
6040 " inconsistent parameter pack deduction with %qT and %qT",
6046 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6051 inform (input_location
,
6052 " deduced conflicting types for parameter %qT (%qT and %qT)",
6053 parm
, first
, second
);
6055 inform (input_location
,
6056 " deduced conflicting values for non-type parameter "
6057 "%qE (%qE and %qE)", parm
, first
, second
);
6063 unify_vla_arg (bool explain_p
, tree arg
)
6066 inform (input_location
,
6067 " variable-sized array type %qT is not "
6068 "a valid template argument",
6074 unify_method_type_error (bool explain_p
, tree arg
)
6077 inform (input_location
,
6078 " member function type %qT is not a valid template argument",
6084 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6089 inform_n (input_location
, wanted
,
6090 " candidate expects at least %d argument, %d provided",
6091 " candidate expects at least %d arguments, %d provided",
6094 inform_n (input_location
, wanted
,
6095 " candidate expects %d argument, %d provided",
6096 " candidate expects %d arguments, %d provided",
6103 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6105 return unify_arity (explain_p
, have
, wanted
);
6109 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6110 bool least_p
= false)
6112 return unify_arity (explain_p
, have
, wanted
, least_p
);
6116 unify_arg_conversion (bool explain_p
, tree to_type
,
6117 tree from_type
, tree arg
)
6120 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6121 " cannot convert %qE (type %qT) to type %qT",
6122 arg
, from_type
, to_type
);
6127 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6128 tree parm
, tree arg
)
6133 case tbr_ambiguous_baseclass
:
6134 inform (input_location
, " %qT is an ambiguous base class of %qT",
6138 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6145 unify_inconsistent_template_template_parameters (bool explain_p
)
6148 inform (input_location
,
6149 " template parameters of a template template argument are "
6150 "inconsistent with other deduced template arguments");
6155 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6158 inform (input_location
,
6159 " can't deduce a template for %qT from non-template type %qT",
6165 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6168 inform (input_location
,
6169 " template argument %qE does not match %qE", arg
, parm
);
6174 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6177 inform (input_location
,
6178 " could not resolve address from overloaded function %qE",
6183 /* Attempt to convert the non-type template parameter EXPR to the
6184 indicated TYPE. If the conversion is successful, return the
6185 converted value. If the conversion is unsuccessful, return
6186 NULL_TREE if we issued an error message, or error_mark_node if we
6187 did not. We issue error messages for out-and-out bad template
6188 parameters, but not simply because the conversion failed, since we
6189 might be just trying to do argument deduction. Both TYPE and EXPR
6190 must be non-dependent.
6192 The conversion follows the special rules described in
6193 [temp.arg.nontype], and it is much more strict than an implicit
6196 This function is called twice for each template argument (see
6197 lookup_template_class for a more accurate description of this
6198 problem). This means that we need to handle expressions which
6199 are not valid in a C++ source, but can be created from the
6200 first call (for instance, casts to perform conversions). These
6201 hacks can go away after we fix the double coercion problem. */
6204 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6208 /* Detect immediately string literals as invalid non-type argument.
6209 This special-case is not needed for correctness (we would easily
6210 catch this later), but only to provide better diagnostic for this
6211 common user mistake. As suggested by DR 100, we do not mention
6212 linkage issues in the diagnostic as this is not the point. */
6213 /* FIXME we're making this OK. */
6214 if (TREE_CODE (expr
) == STRING_CST
)
6216 if (complain
& tf_error
)
6217 error ("%qE is not a valid template argument for type %qT "
6218 "because string literals can never be used in this context",
6223 /* Add the ADDR_EXPR now for the benefit of
6224 value_dependent_expression_p. */
6225 if (TYPE_PTROBV_P (type
)
6226 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6228 expr
= decay_conversion (expr
, complain
);
6229 if (expr
== error_mark_node
)
6230 return error_mark_node
;
6233 /* If we are in a template, EXPR may be non-dependent, but still
6234 have a syntactic, rather than semantic, form. For example, EXPR
6235 might be a SCOPE_REF, rather than the VAR_DECL to which the
6236 SCOPE_REF refers. Preserving the qualifying scope is necessary
6237 so that access checking can be performed when the template is
6238 instantiated -- but here we need the resolved form so that we can
6239 convert the argument. */
6240 bool non_dep
= false;
6241 if (TYPE_REF_OBJ_P (type
)
6242 && has_value_dependent_address (expr
))
6243 /* If we want the address and it's value-dependent, don't fold. */;
6244 else if (processing_template_decl
6245 && potential_nondependent_constant_expression (expr
))
6247 if (error_operand_p (expr
))
6248 return error_mark_node
;
6249 expr_type
= TREE_TYPE (expr
);
6250 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6251 expr
= mark_lvalue_use (expr
);
6253 expr
= mark_rvalue_use (expr
);
6255 /* If the argument is non-dependent, perform any conversions in
6256 non-dependent context as well. */
6257 processing_template_decl_sentinel
s (non_dep
);
6259 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6261 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6262 to a non-type argument of "nullptr". */
6263 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6264 expr
= fold_simple (convert (type
, expr
));
6266 /* In C++11, integral or enumeration non-type template arguments can be
6267 arbitrary constant expressions. Pointer and pointer to
6268 member arguments can be general constant expressions that evaluate
6269 to a null value, but otherwise still need to be of a specific form. */
6270 if (cxx_dialect
>= cxx11
)
6272 if (TREE_CODE (expr
) == PTRMEM_CST
)
6273 /* A PTRMEM_CST is already constant, and a valid template
6274 argument for a parameter of pointer to member type, we just want
6275 to leave it in that form rather than lower it to a
6277 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6278 expr
= maybe_constant_value (expr
);
6279 else if (cxx_dialect
>= cxx1z
)
6281 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6282 expr
= maybe_constant_value (expr
);
6283 else if (REFERENCE_REF_P (expr
))
6285 expr
= TREE_OPERAND (expr
, 0);
6286 expr
= maybe_constant_value (expr
);
6287 expr
= convert_from_reference (expr
);
6290 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6292 tree folded
= maybe_constant_value (expr
);
6293 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6294 : null_member_pointer_value_p (folded
))
6299 /* HACK: Due to double coercion, we can get a
6300 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6301 which is the tree that we built on the first call (see
6302 below when coercing to reference to object or to reference to
6303 function). We just strip everything and get to the arg.
6304 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6306 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6308 tree probe_type
, probe
= expr
;
6309 if (REFERENCE_REF_P (probe
))
6310 probe
= TREE_OPERAND (probe
, 0);
6311 probe_type
= TREE_TYPE (probe
);
6312 if (TREE_CODE (probe
) == NOP_EXPR
)
6314 /* ??? Maybe we could use convert_from_reference here, but we
6315 would need to relax its constraints because the NOP_EXPR
6316 could actually change the type to something more cv-qualified,
6317 and this is not folded by convert_from_reference. */
6318 tree addr
= TREE_OPERAND (probe
, 0);
6319 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6320 && TREE_CODE (addr
) == ADDR_EXPR
6321 && TYPE_PTR_P (TREE_TYPE (addr
))
6322 && (same_type_ignoring_top_level_qualifiers_p
6323 (TREE_TYPE (probe_type
),
6324 TREE_TYPE (TREE_TYPE (addr
)))))
6326 expr
= TREE_OPERAND (addr
, 0);
6327 expr_type
= TREE_TYPE (probe_type
);
6332 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6333 parameter is a pointer to object, through decay and
6334 qualification conversion. Let's strip everything. */
6335 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6339 if (TREE_CODE (probe
) == ADDR_EXPR
6340 && TYPE_PTR_P (TREE_TYPE (probe
)))
6342 /* Skip the ADDR_EXPR only if it is part of the decay for
6343 an array. Otherwise, it is part of the original argument
6344 in the source code. */
6345 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6346 probe
= TREE_OPERAND (probe
, 0);
6348 expr_type
= TREE_TYPE (expr
);
6352 /* [temp.arg.nontype]/5, bullet 1
6354 For a non-type template-parameter of integral or enumeration type,
6355 integral promotions (_conv.prom_) and integral conversions
6356 (_conv.integral_) are applied. */
6357 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6359 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6360 t
= maybe_constant_value (t
);
6361 if (t
!= error_mark_node
)
6364 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6365 return error_mark_node
;
6367 /* Notice that there are constant expressions like '4 % 0' which
6368 do not fold into integer constants. */
6369 if (TREE_CODE (expr
) != INTEGER_CST
)
6371 if (complain
& tf_error
)
6373 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6374 if (processing_template_decl
6375 && !require_potential_constant_expression (expr
))
6377 expr
= cxx_constant_value (expr
);
6378 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6379 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6380 "in template argument for type %qT ", type
);
6381 if (expr
== error_mark_node
)
6383 /* else cxx_constant_value complained but gave us
6384 a real constant, so go ahead. */
6385 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6391 /* Avoid typedef problems. */
6392 if (TREE_TYPE (expr
) != type
)
6393 expr
= fold_convert (type
, expr
);
6395 /* [temp.arg.nontype]/5, bullet 2
6397 For a non-type template-parameter of type pointer to object,
6398 qualification conversions (_conv.qual_) and the array-to-pointer
6399 conversion (_conv.array_) are applied. */
6400 else if (TYPE_PTROBV_P (type
))
6402 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6404 A template-argument for a non-type, non-template template-parameter
6405 shall be one of: [...]
6407 -- the name of a non-type template-parameter;
6408 -- the address of an object or function with external linkage, [...]
6409 expressed as "& id-expression" where the & is optional if the name
6410 refers to a function or array, or if the corresponding
6411 template-parameter is a reference.
6413 Here, we do not care about functions, as they are invalid anyway
6414 for a parameter of type pointer-to-object. */
6416 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6417 /* Non-type template parameters are OK. */
6419 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6420 /* Null pointer values are OK in C++11. */;
6421 else if (TREE_CODE (expr
) != ADDR_EXPR
6422 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6426 if (complain
& tf_error
)
6427 error ("%qD is not a valid template argument "
6428 "because %qD is a variable, not the address of "
6429 "a variable", expr
, expr
);
6432 if (POINTER_TYPE_P (expr_type
))
6434 if (complain
& tf_error
)
6435 error ("%qE is not a valid template argument for %qT "
6436 "because it is not the address of a variable",
6440 /* Other values, like integer constants, might be valid
6441 non-type arguments of some other type. */
6442 return error_mark_node
;
6448 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6449 ? TREE_OPERAND (expr
, 0) : expr
);
6452 if (complain
& tf_error
)
6453 error ("%qE is not a valid template argument of type %qT "
6454 "because %qE is not a variable", expr
, type
, decl
);
6457 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6459 if (complain
& tf_error
)
6460 error ("%qE is not a valid template argument of type %qT "
6461 "because %qD does not have external linkage",
6465 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6467 if (complain
& tf_error
)
6468 error ("%qE is not a valid template argument of type %qT "
6469 "because %qD has no linkage", expr
, type
, decl
);
6474 expr
= decay_conversion (expr
, complain
);
6475 if (expr
== error_mark_node
)
6476 return error_mark_node
;
6478 expr
= perform_qualification_conversions (type
, expr
);
6479 if (expr
== error_mark_node
)
6480 return error_mark_node
;
6482 /* [temp.arg.nontype]/5, bullet 3
6484 For a non-type template-parameter of type reference to object, no
6485 conversions apply. The type referred to by the reference may be more
6486 cv-qualified than the (otherwise identical) type of the
6487 template-argument. The template-parameter is bound directly to the
6488 template-argument, which must be an lvalue. */
6489 else if (TYPE_REF_OBJ_P (type
))
6491 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6493 return error_mark_node
;
6495 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6497 if (complain
& tf_error
)
6498 error ("%qE is not a valid template argument for type %qT "
6499 "because of conflicts in cv-qualification", expr
, type
);
6503 if (!real_lvalue_p (expr
))
6505 if (complain
& tf_error
)
6506 error ("%qE is not a valid template argument for type %qT "
6507 "because it is not an lvalue", expr
, type
);
6511 /* [temp.arg.nontype]/1
6513 A template-argument for a non-type, non-template template-parameter
6514 shall be one of: [...]
6516 -- the address of an object or function with external linkage. */
6517 if (INDIRECT_REF_P (expr
)
6518 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6520 expr
= TREE_OPERAND (expr
, 0);
6523 if (complain
& tf_error
)
6524 error ("%q#D is not a valid template argument for type %qT "
6525 "because a reference variable does not have a constant "
6526 "address", expr
, type
);
6533 if (complain
& tf_error
)
6534 error ("%qE is not a valid template argument for type %qT "
6535 "because it is not an object with linkage",
6540 /* DR 1155 allows internal linkage in C++11 and up. */
6541 linkage_kind linkage
= decl_linkage (expr
);
6542 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6544 if (complain
& tf_error
)
6545 error ("%qE is not a valid template argument for type %qT "
6546 "because object %qD does not have linkage",
6551 expr
= build_nop (type
, build_address (expr
));
6553 /* [temp.arg.nontype]/5, bullet 4
6555 For a non-type template-parameter of type pointer to function, only
6556 the function-to-pointer conversion (_conv.func_) is applied. If the
6557 template-argument represents a set of overloaded functions (or a
6558 pointer to such), the matching function is selected from the set
6560 else if (TYPE_PTRFN_P (type
))
6562 /* If the argument is a template-id, we might not have enough
6563 context information to decay the pointer. */
6564 if (!type_unknown_p (expr_type
))
6566 expr
= decay_conversion (expr
, complain
);
6567 if (expr
== error_mark_node
)
6568 return error_mark_node
;
6571 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6572 /* Null pointer values are OK in C++11. */
6573 return perform_qualification_conversions (type
, expr
);
6575 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6576 if (!expr
|| expr
== error_mark_node
)
6579 /* [temp.arg.nontype]/5, bullet 5
6581 For a non-type template-parameter of type reference to function, no
6582 conversions apply. If the template-argument represents a set of
6583 overloaded functions, the matching function is selected from the set
6585 else if (TYPE_REFFN_P (type
))
6587 if (TREE_CODE (expr
) == ADDR_EXPR
)
6589 if (complain
& tf_error
)
6591 error ("%qE is not a valid template argument for type %qT "
6592 "because it is a pointer", expr
, type
);
6593 inform (input_location
, "try using %qE instead",
6594 TREE_OPERAND (expr
, 0));
6599 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6600 if (!expr
|| expr
== error_mark_node
)
6603 expr
= build_nop (type
, build_address (expr
));
6605 /* [temp.arg.nontype]/5, bullet 6
6607 For a non-type template-parameter of type pointer to member function,
6608 no conversions apply. If the template-argument represents a set of
6609 overloaded member functions, the matching member function is selected
6610 from the set (_over.over_). */
6611 else if (TYPE_PTRMEMFUNC_P (type
))
6613 expr
= instantiate_type (type
, expr
, tf_none
);
6614 if (expr
== error_mark_node
)
6615 return error_mark_node
;
6617 /* [temp.arg.nontype] bullet 1 says the pointer to member
6618 expression must be a pointer-to-member constant. */
6619 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6620 return error_mark_node
;
6622 /* There is no way to disable standard conversions in
6623 resolve_address_of_overloaded_function (called by
6624 instantiate_type). It is possible that the call succeeded by
6625 converting &B::I to &D::I (where B is a base of D), so we need
6626 to reject this conversion here.
6628 Actually, even if there was a way to disable standard conversions,
6629 it would still be better to reject them here so that we can
6630 provide a superior diagnostic. */
6631 if (!same_type_p (TREE_TYPE (expr
), type
))
6633 if (complain
& tf_error
)
6635 error ("%qE is not a valid template argument for type %qT "
6636 "because it is of type %qT", expr
, type
,
6638 /* If we are just one standard conversion off, explain. */
6639 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6640 inform (input_location
,
6641 "standard conversions are not allowed in this context");
6646 /* [temp.arg.nontype]/5, bullet 7
6648 For a non-type template-parameter of type pointer to data member,
6649 qualification conversions (_conv.qual_) are applied. */
6650 else if (TYPE_PTRDATAMEM_P (type
))
6652 /* [temp.arg.nontype] bullet 1 says the pointer to member
6653 expression must be a pointer-to-member constant. */
6654 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6655 return error_mark_node
;
6657 expr
= perform_qualification_conversions (type
, expr
);
6658 if (expr
== error_mark_node
)
6661 else if (NULLPTR_TYPE_P (type
))
6663 if (expr
!= nullptr_node
)
6665 if (complain
& tf_error
)
6666 error ("%qE is not a valid template argument for type %qT "
6667 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6672 /* A template non-type parameter must be one of the above. */
6676 /* Sanity check: did we actually convert the argument to the
6678 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6679 (type
, TREE_TYPE (expr
)));
6680 return convert_from_reference (expr
);
6683 /* Subroutine of coerce_template_template_parms, which returns 1 if
6684 PARM_PARM and ARG_PARM match using the rule for the template
6685 parameters of template template parameters. Both PARM and ARG are
6686 template parameters; the rest of the arguments are the same as for
6687 coerce_template_template_parms.
6690 coerce_template_template_parm (tree parm
,
6692 tsubst_flags_t complain
,
6696 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6697 || parm
== NULL_TREE
|| error_operand_p (parm
))
6700 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6703 switch (TREE_CODE (parm
))
6706 /* We encounter instantiations of templates like
6707 template <template <template <class> class> class TT>
6710 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6711 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6713 if (!coerce_template_template_parms
6714 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6720 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6721 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6722 /* Argument is a parameter pack but parameter is not. */
6727 /* The tsubst call is used to handle cases such as
6729 template <int> class C {};
6730 template <class T, template <T> class TT> class D {};
6733 i.e. the parameter list of TT depends on earlier parameters. */
6734 if (!uses_template_parms (TREE_TYPE (arg
)))
6736 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6737 if (!uses_template_parms (t
)
6738 && !same_type_p (t
, TREE_TYPE (arg
)))
6742 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6743 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6744 /* Argument is a parameter pack but parameter is not. */
6757 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6758 template template parameters. Both PARM_PARMS and ARG_PARMS are
6759 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6762 Consider the example:
6763 template <class T> class A;
6764 template<template <class U> class TT> class B;
6766 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6767 the parameters to A, and OUTER_ARGS contains A. */
6770 coerce_template_template_parms (tree parm_parms
,
6772 tsubst_flags_t complain
,
6776 int nparms
, nargs
, i
;
6780 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6781 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6783 nparms
= TREE_VEC_LENGTH (parm_parms
);
6784 nargs
= TREE_VEC_LENGTH (arg_parms
);
6786 /* Determine whether we have a parameter pack at the end of the
6787 template template parameter's template parameter list. */
6788 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6790 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6792 if (error_operand_p (parm
))
6795 switch (TREE_CODE (parm
))
6799 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6804 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6814 && !(variadic_p
&& nargs
>= nparms
- 1))
6817 /* Check all of the template parameters except the parameter pack at
6818 the end (if any). */
6819 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6821 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6822 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6825 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6826 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6828 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6836 /* Check each of the template parameters in the template
6837 argument against the template parameter pack at the end of
6838 the template template parameter. */
6839 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6842 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6844 for (; i
< nargs
; ++i
)
6846 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6849 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6851 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6860 /* Verifies that the deduced template arguments (in TARGS) for the
6861 template template parameters (in TPARMS) represent valid bindings,
6862 by comparing the template parameter list of each template argument
6863 to the template parameter list of its corresponding template
6864 template parameter, in accordance with DR150. This
6865 routine can only be called after all template arguments have been
6866 deduced. It will return TRUE if all of the template template
6867 parameter bindings are okay, FALSE otherwise. */
6869 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6871 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6874 /* We're dealing with template parms in this process. */
6875 ++processing_template_decl
;
6877 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6879 for (i
= 0; i
< ntparms
; ++i
)
6881 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6882 tree targ
= TREE_VEC_ELT (targs
, i
);
6884 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6886 tree packed_args
= NULL_TREE
;
6889 if (ARGUMENT_PACK_P (targ
))
6891 /* Look inside the argument pack. */
6892 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6893 len
= TREE_VEC_LENGTH (packed_args
);
6896 for (idx
= 0; idx
< len
; ++idx
)
6898 tree targ_parms
= NULL_TREE
;
6901 /* Extract the next argument from the argument
6903 targ
= TREE_VEC_ELT (packed_args
, idx
);
6905 if (PACK_EXPANSION_P (targ
))
6906 /* Look at the pattern of the pack expansion. */
6907 targ
= PACK_EXPANSION_PATTERN (targ
);
6909 /* Extract the template parameters from the template
6911 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6912 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6913 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6914 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6916 /* Verify that we can coerce the template template
6917 parameters from the template argument to the template
6918 parameter. This requires an exact match. */
6920 && !coerce_template_template_parms
6921 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6936 --processing_template_decl
;
6940 /* Since type attributes aren't mangled, we need to strip them from
6941 template type arguments. */
6944 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6946 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6948 bool removed_attributes
= false;
6949 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6950 if (removed_attributes
6951 && (complain
& tf_warning
))
6952 warning (OPT_Wignored_attributes
,
6953 "ignoring attributes on template argument %qT", arg
);
6957 // A template declaration can be substituted for a constrained
6958 // template template parameter only when the argument is more
6959 // constrained than the parameter.
6961 is_compatible_template_arg (tree parm
, tree arg
)
6963 tree parm_cons
= get_constraints (parm
);
6965 /* For now, allow constrained template template arguments
6966 and unconstrained template template parameters. */
6967 if (parm_cons
== NULL_TREE
)
6970 tree arg_cons
= get_constraints (arg
);
6972 // If the template parameter is constrained, we need to rewrite its
6973 // constraints in terms of the ARG's template parameters. This ensures
6974 // that all of the template parameter types will have the same depth.
6976 // Note that this is only valid when coerce_template_template_parm is
6977 // true for the innermost template parameters of PARM and ARG. In other
6978 // words, because coercion is successful, this conversion will be valid.
6981 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6982 parm_cons
= tsubst_constraint_info (parm_cons
,
6983 INNERMOST_TEMPLATE_ARGS (args
),
6984 tf_none
, NULL_TREE
);
6985 if (parm_cons
== error_mark_node
)
6989 return subsumes (parm_cons
, arg_cons
);
6992 // Convert a placeholder argument into a binding to the original
6993 // parameter. The original parameter is saved as the TREE_TYPE of
6996 convert_wildcard_argument (tree parm
, tree arg
)
6998 TREE_TYPE (arg
) = parm
;
7002 /* Convert the indicated template ARG as necessary to match the
7003 indicated template PARM. Returns the converted ARG, or
7004 error_mark_node if the conversion was unsuccessful. Error and
7005 warning messages are issued under control of COMPLAIN. This
7006 conversion is for the Ith parameter in the parameter list. ARGS is
7007 the full set of template arguments deduced so far. */
7010 convert_template_argument (tree parm
,
7013 tsubst_flags_t complain
,
7019 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
7021 if (parm
== error_mark_node
)
7022 return error_mark_node
;
7024 /* Trivially convert placeholders. */
7025 if (TREE_CODE (arg
) == WILDCARD_DECL
)
7026 return convert_wildcard_argument (parm
, arg
);
7028 if (TREE_CODE (arg
) == TREE_LIST
7029 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7031 /* The template argument was the name of some
7032 member function. That's usually
7033 invalid, but static members are OK. In any
7034 case, grab the underlying fields/functions
7035 and issue an error later if required. */
7036 orig_arg
= TREE_VALUE (arg
);
7037 TREE_TYPE (arg
) = unknown_type_node
;
7042 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7043 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7044 || requires_tmpl_type
);
7046 /* When determining whether an argument pack expansion is a template,
7047 look at the pattern. */
7048 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7049 arg
= PACK_EXPANSION_PATTERN (arg
);
7051 /* Deal with an injected-class-name used as a template template arg. */
7052 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7054 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7055 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7057 if (cxx_dialect
>= cxx11
)
7058 /* OK under DR 1004. */;
7059 else if (complain
& tf_warning_or_error
)
7060 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7061 " used as template template argument", TYPE_NAME (arg
));
7062 else if (flag_pedantic_errors
)
7070 ((TREE_CODE (arg
) == TEMPLATE_DECL
7071 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7072 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7073 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7074 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7077 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7078 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7079 arg
= TYPE_STUB_DECL (arg
);
7081 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7083 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7084 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7086 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7088 if (complain
& tf_error
)
7089 error ("invalid use of destructor %qE as a type", orig_arg
);
7090 return error_mark_node
;
7093 permerror (input_location
,
7094 "to refer to a type member of a template parameter, "
7095 "use %<typename %E%>", orig_arg
);
7097 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7098 TREE_OPERAND (arg
, 1),
7104 if (is_type
!= requires_type
)
7108 if (complain
& tf_error
)
7110 error ("type/value mismatch at argument %d in template "
7111 "parameter list for %qD",
7114 inform (input_location
,
7115 " expected a constant of type %qT, got %qT",
7117 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7118 else if (requires_tmpl_type
)
7119 inform (input_location
,
7120 " expected a class template, got %qE", orig_arg
);
7122 inform (input_location
,
7123 " expected a type, got %qE", orig_arg
);
7126 return error_mark_node
;
7128 if (is_tmpl_type
^ requires_tmpl_type
)
7130 if (in_decl
&& (complain
& tf_error
))
7132 error ("type/value mismatch at argument %d in template "
7133 "parameter list for %qD",
7136 inform (input_location
,
7137 " expected a type, got %qT", DECL_NAME (arg
));
7139 inform (input_location
,
7140 " expected a class template, got %qT", orig_arg
);
7142 return error_mark_node
;
7147 if (requires_tmpl_type
)
7149 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7151 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7152 /* The number of argument required is not known yet.
7153 Just accept it for now. */
7154 val
= TREE_TYPE (arg
);
7157 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7160 /* Strip alias templates that are equivalent to another
7162 arg
= get_underlying_template (arg
);
7163 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7165 if (coerce_template_template_parms (parmparm
, argparm
,
7171 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7173 if (val
!= error_mark_node
)
7175 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7176 val
= TREE_TYPE (val
);
7177 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7178 val
= make_pack_expansion (val
);
7183 if (in_decl
&& (complain
& tf_error
))
7185 error ("type/value mismatch at argument %d in "
7186 "template parameter list for %qD",
7188 inform (input_location
,
7189 " expected a template of type %qD, got %qT",
7193 val
= error_mark_node
;
7196 // Check that the constraints are compatible before allowing the
7198 if (val
!= error_mark_node
)
7199 if (!is_compatible_template_arg (parm
, arg
))
7201 if (in_decl
&& (complain
& tf_error
))
7203 error ("constraint mismatch at argument %d in "
7204 "template parameter list for %qD",
7206 inform (input_location
, " expected %qD but got %qD",
7209 val
= error_mark_node
;
7215 /* We only form one instance of each template specialization.
7216 Therefore, if we use a non-canonical variant (i.e., a
7217 typedef), any future messages referring to the type will use
7218 the typedef, which is confusing if those future uses do not
7219 themselves also use the typedef. */
7221 val
= canonicalize_type_argument (val
, complain
);
7225 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7227 if (invalid_nontype_parm_type_p (t
, complain
))
7228 return error_mark_node
;
7230 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7232 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7236 /* Not sure if this is reachable, but it doesn't hurt
7238 error ("type mismatch in nontype parameter pack");
7239 val
= error_mark_node
;
7242 else if (!dependent_template_arg_p (orig_arg
)
7243 && !uses_template_parms (t
))
7244 /* We used to call digest_init here. However, digest_init
7245 will report errors, which we don't want when complain
7246 is zero. More importantly, digest_init will try too
7247 hard to convert things: for example, `0' should not be
7248 converted to pointer type at this point according to
7249 the standard. Accepting this is not merely an
7250 extension, since deciding whether or not these
7251 conversions can occur is part of determining which
7252 function template to call, or whether a given explicit
7253 argument specification is valid. */
7254 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7257 bool removed_attr
= false;
7258 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7261 if (val
== NULL_TREE
)
7262 val
= error_mark_node
;
7263 else if (val
== error_mark_node
&& (complain
& tf_error
))
7264 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7266 if (INDIRECT_REF_P (val
))
7268 /* Reject template arguments that are references to built-in
7269 functions with no library fallbacks. */
7270 const_tree inner
= TREE_OPERAND (val
, 0);
7271 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7272 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7273 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7274 && 0 < TREE_OPERAND_LENGTH (inner
)
7275 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7276 return error_mark_node
;
7279 if (TREE_CODE (val
) == SCOPE_REF
)
7281 /* Strip typedefs from the SCOPE_REF. */
7282 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7283 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7285 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7286 QUALIFIED_NAME_IS_TEMPLATE (val
));
7293 /* Coerces the remaining template arguments in INNER_ARGS (from
7294 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7295 Returns the coerced argument pack. PARM_IDX is the position of this
7296 parameter in the template parameter list. ARGS is the original
7297 template argument list. */
7299 coerce_template_parameter_pack (tree parms
,
7307 tsubst_flags_t complain
)
7309 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7310 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7313 tree packed_parms
= NULL_TREE
;
7315 if (arg_idx
> nargs
)
7318 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7320 /* When the template parameter is a non-type template parameter pack
7321 or template template parameter pack whose type or template
7322 parameters use parameter packs, we know exactly how many arguments
7323 we are looking for. Build a vector of the instantiated decls for
7324 these template parameters in PACKED_PARMS. */
7325 /* We can't use make_pack_expansion here because it would interpret a
7326 _DECL as a use rather than a declaration. */
7327 tree decl
= TREE_VALUE (parm
);
7328 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7329 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7330 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7331 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7333 TREE_VEC_LENGTH (args
)--;
7334 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7335 TREE_VEC_LENGTH (args
)++;
7337 if (packed_parms
== error_mark_node
)
7338 return error_mark_node
;
7340 /* If we're doing a partial instantiation of a member template,
7341 verify that all of the types used for the non-type
7342 template parameter pack are, in fact, valid for non-type
7343 template parameters. */
7345 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7347 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7348 for (j
= 0; j
< len
; ++j
)
7350 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7351 if (invalid_nontype_parm_type_p (t
, complain
))
7352 return error_mark_node
;
7354 /* We don't know how many args we have yet, just
7355 use the unconverted ones for now. */
7359 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7361 /* Check if we have a placeholder pack, which indicates we're
7362 in the context of a introduction list. In that case we want
7363 to match this pack to the single placeholder. */
7364 else if (arg_idx
< nargs
7365 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7366 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7368 nargs
= arg_idx
+ 1;
7369 packed_args
= make_tree_vec (1);
7372 packed_args
= make_tree_vec (nargs
- arg_idx
);
7374 /* Convert the remaining arguments, which will be a part of the
7375 parameter pack "parm". */
7376 for (; arg_idx
< nargs
; ++arg_idx
)
7378 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7379 tree actual_parm
= TREE_VALUE (parm
);
7380 int pack_idx
= arg_idx
- parm_idx
;
7384 /* Once we've packed as many args as we have types, stop. */
7385 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7387 else if (PACK_EXPANSION_P (arg
))
7388 /* We don't know how many args we have yet, just
7389 use the unconverted ones for now. */
7392 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7395 if (arg
== error_mark_node
)
7397 if (complain
& tf_error
)
7398 error ("template argument %d is invalid", arg_idx
+ 1);
7401 arg
= convert_template_argument (actual_parm
,
7402 arg
, new_args
, complain
, parm_idx
,
7404 if (arg
== error_mark_node
)
7406 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7409 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7410 && TREE_VEC_LENGTH (packed_args
) > 0)
7412 if (complain
& tf_error
)
7413 error ("wrong number of template arguments (%d, should be %d)",
7414 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7415 return error_mark_node
;
7418 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7419 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7420 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7423 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7424 TREE_TYPE (argument_pack
)
7425 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7426 TREE_CONSTANT (argument_pack
) = 1;
7429 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7431 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7432 TREE_VEC_LENGTH (packed_args
));
7433 return argument_pack
;
7436 /* Returns the number of pack expansions in the template argument vector
7440 pack_expansion_args_count (tree args
)
7445 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7447 tree elt
= TREE_VEC_ELT (args
, i
);
7448 if (elt
&& PACK_EXPANSION_P (elt
))
7454 /* Convert all template arguments to their appropriate types, and
7455 return a vector containing the innermost resulting template
7456 arguments. If any error occurs, return error_mark_node. Error and
7457 warning messages are issued under control of COMPLAIN.
7459 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7460 for arguments not specified in ARGS. Otherwise, if
7461 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7462 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7463 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7467 coerce_template_parms (tree parms
,
7470 tsubst_flags_t complain
,
7471 bool require_all_args
,
7472 bool use_default_args
)
7474 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7475 tree orig_inner_args
;
7478 tree new_inner_args
;
7479 int saved_unevaluated_operand
;
7480 int saved_inhibit_evaluation_warnings
;
7482 /* When used as a boolean value, indicates whether this is a
7483 variadic template parameter list. Since it's an int, we can also
7484 subtract it from nparms to get the number of non-variadic
7487 int variadic_args_p
= 0;
7488 int post_variadic_parms
= 0;
7490 /* Likewise for parameters with default arguments. */
7493 if (args
== error_mark_node
)
7494 return error_mark_node
;
7496 nparms
= TREE_VEC_LENGTH (parms
);
7498 /* Determine if there are any parameter packs or default arguments. */
7499 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7501 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7503 ++post_variadic_parms
;
7504 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7506 if (TREE_PURPOSE (parm
))
7510 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7511 /* If there are no parameters that follow a parameter pack, we need to
7512 expand any argument packs so that we can deduce a parameter pack from
7513 some non-packed args followed by an argument pack, as in variadic85.C.
7514 If there are such parameters, we need to leave argument packs intact
7515 so the arguments are assigned properly. This can happen when dealing
7516 with a nested class inside a partial specialization of a class
7517 template, as in variadic92.C, or when deducing a template parameter pack
7518 from a sub-declarator, as in variadic114.C. */
7519 if (!post_variadic_parms
)
7520 inner_args
= expand_template_argument_pack (inner_args
);
7522 /* Count any pack expansion args. */
7523 variadic_args_p
= pack_expansion_args_count (inner_args
);
7525 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7526 if ((nargs
> nparms
&& !variadic_p
)
7527 || (nargs
< nparms
- variadic_p
7530 && (!use_default_args
7531 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7532 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7534 if (complain
& tf_error
)
7536 if (variadic_p
|| default_p
)
7538 nparms
-= variadic_p
+ default_p
;
7539 error ("wrong number of template arguments "
7540 "(%d, should be at least %d)", nargs
, nparms
);
7543 error ("wrong number of template arguments "
7544 "(%d, should be %d)", nargs
, nparms
);
7547 inform (DECL_SOURCE_LOCATION (in_decl
),
7548 "provided for %qD", in_decl
);
7551 return error_mark_node
;
7553 /* We can't pass a pack expansion to a non-pack parameter of an alias
7554 template (DR 1430). */
7556 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7557 || concept_template_p (in_decl
))
7559 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7561 if (complain
& tf_error
)
7563 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7565 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7566 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7568 if (PACK_EXPANSION_P (arg
)
7569 && !template_parameter_pack_p (parm
))
7571 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7572 error_at (location_of (arg
),
7573 "pack expansion argument for non-pack parameter "
7574 "%qD of alias template %qD", parm
, in_decl
);
7576 error_at (location_of (arg
),
7577 "pack expansion argument for non-pack parameter "
7578 "%qD of concept %qD", parm
, in_decl
);
7579 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7586 return error_mark_node
;
7589 /* We need to evaluate the template arguments, even though this
7590 template-id may be nested within a "sizeof". */
7591 saved_unevaluated_operand
= cp_unevaluated_operand
;
7592 cp_unevaluated_operand
= 0;
7593 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7594 c_inhibit_evaluation_warnings
= 0;
7595 new_inner_args
= make_tree_vec (nparms
);
7596 new_args
= add_outermost_template_args (args
, new_inner_args
);
7597 int pack_adjust
= 0;
7598 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7603 /* Get the Ith template parameter. */
7604 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7606 if (parm
== error_mark_node
)
7608 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7612 /* Calculate the next argument. */
7613 if (arg_idx
< nargs
)
7614 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7618 if (template_parameter_pack_p (TREE_VALUE (parm
))
7619 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7621 /* Some arguments will be placed in the
7622 template parameter pack PARM. */
7623 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7624 inner_args
, arg_idx
,
7628 if (arg
== NULL_TREE
)
7630 /* We don't know how many args we have yet, just use the
7631 unconverted (and still packed) ones for now. */
7632 new_inner_args
= orig_inner_args
;
7637 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7639 /* Store this argument. */
7640 if (arg
== error_mark_node
)
7643 /* We are done with all of the arguments. */
7648 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7649 arg_idx
+= pack_adjust
;
7656 if (PACK_EXPANSION_P (arg
))
7658 /* "If every valid specialization of a variadic template
7659 requires an empty template parameter pack, the template is
7660 ill-formed, no diagnostic required." So check that the
7661 pattern works with this parameter. */
7662 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7663 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7667 if (conv
== error_mark_node
)
7669 inform (input_location
, "so any instantiation with a "
7670 "non-empty parameter pack would be ill-formed");
7673 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7674 /* Recover from missing typename. */
7675 TREE_VEC_ELT (inner_args
, arg_idx
)
7676 = make_pack_expansion (conv
);
7678 /* We don't know how many args we have yet, just
7679 use the unconverted ones for now. */
7680 new_inner_args
= inner_args
;
7685 else if (require_all_args
)
7687 /* There must be a default arg in this case. */
7688 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7690 /* The position of the first default template argument,
7691 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7693 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7694 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7695 arg_idx
- pack_adjust
);
7700 if (arg
== error_mark_node
)
7702 if (complain
& tf_error
)
7703 error ("template argument %d is invalid", arg_idx
+ 1);
7706 /* This only occurs if there was an error in the template
7707 parameter list itself (which we would already have
7708 reported) that we are trying to recover from, e.g., a class
7709 template with a parameter list such as
7710 template<typename..., typename>. */
7713 arg
= convert_template_argument (TREE_VALUE (parm
),
7714 arg
, new_args
, complain
,
7717 if (arg
== error_mark_node
)
7719 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7721 cp_unevaluated_operand
= saved_unevaluated_operand
;
7722 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7724 if (variadic_p
&& arg_idx
< nargs
)
7726 if (complain
& tf_error
)
7728 error ("wrong number of template arguments "
7729 "(%d, should be %d)", nargs
, arg_idx
);
7731 error ("provided for %q+D", in_decl
);
7733 return error_mark_node
;
7737 return error_mark_node
;
7739 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7740 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7741 TREE_VEC_LENGTH (new_inner_args
));
7743 return new_inner_args
;
7746 /* Convert all template arguments to their appropriate types, and
7747 return a vector containing the innermost resulting template
7748 arguments. If any error occurs, return error_mark_node. Error and
7749 warning messages are not issued.
7751 Note that no function argument deduction is performed, and default
7752 arguments are used to fill in unspecified arguments. */
7754 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7756 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7759 /* Convert all template arguments to their appropriate type, and
7760 instantiate default arguments as needed. This returns a vector
7761 containing the innermost resulting template arguments, or
7762 error_mark_node if unsuccessful. */
7764 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7765 tsubst_flags_t complain
)
7767 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7770 /* Like coerce_template_parms. If PARMS represents all template
7771 parameters levels, this function returns a vector of vectors
7772 representing all the resulting argument levels. Note that in this
7773 case, only the innermost arguments are coerced because the
7774 outermost ones are supposed to have been coerced already.
7776 Otherwise, if PARMS represents only (the innermost) vector of
7777 parameters, this function returns a vector containing just the
7778 innermost resulting arguments. */
7781 coerce_innermost_template_parms (tree parms
,
7784 tsubst_flags_t complain
,
7785 bool require_all_args
,
7786 bool use_default_args
)
7788 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7789 int args_depth
= TMPL_ARGS_DEPTH (args
);
7792 if (parms_depth
> 1)
7794 coerced_args
= make_tree_vec (parms_depth
);
7798 for (level
= parms
, cur_depth
= parms_depth
;
7799 parms_depth
> 0 && level
!= NULL_TREE
;
7800 level
= TREE_CHAIN (level
), --cur_depth
)
7803 if (cur_depth
== args_depth
)
7804 l
= coerce_template_parms (TREE_VALUE (level
),
7805 args
, in_decl
, complain
,
7809 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7811 if (l
== error_mark_node
)
7812 return error_mark_node
;
7814 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7818 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7819 args
, in_decl
, complain
,
7822 return coerced_args
;
7825 /* Returns 1 if template args OT and NT are equivalent. */
7828 template_args_equal (tree ot
, tree nt
)
7832 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7835 if (TREE_CODE (nt
) == TREE_VEC
)
7836 /* For member templates */
7837 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7838 else if (PACK_EXPANSION_P (ot
))
7839 return (PACK_EXPANSION_P (nt
)
7840 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7841 PACK_EXPANSION_PATTERN (nt
))
7842 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7843 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7844 else if (ARGUMENT_PACK_P (ot
))
7849 if (!ARGUMENT_PACK_P (nt
))
7852 opack
= ARGUMENT_PACK_ARGS (ot
);
7853 npack
= ARGUMENT_PACK_ARGS (nt
);
7854 len
= TREE_VEC_LENGTH (opack
);
7855 if (TREE_VEC_LENGTH (npack
) != len
)
7857 for (i
= 0; i
< len
; ++i
)
7858 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7859 TREE_VEC_ELT (npack
, i
)))
7863 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7865 /* We get here probably because we are in the middle of substituting
7866 into the pattern of a pack expansion. In that case the
7867 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7868 interested in. So we want to use the initial pack argument for
7870 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7871 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7872 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7873 return template_args_equal (ot
, nt
);
7875 else if (TYPE_P (nt
))
7879 /* Don't treat an alias template specialization with dependent
7880 arguments as equivalent to its underlying type when used as a
7881 template argument; we need them to be distinct so that we
7882 substitute into the specialization arguments at instantiation
7883 time. And aliases can't be equivalent without being ==, so
7884 we don't need to look any deeper. */
7885 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7888 return same_type_p (ot
, nt
);
7890 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7894 /* Try to treat a template non-type argument that has been converted
7895 to the parameter type as equivalent to one that hasn't yet. */
7896 for (enum tree_code code1
= TREE_CODE (ot
);
7897 CONVERT_EXPR_CODE_P (code1
)
7898 || code1
== NON_LVALUE_EXPR
;
7899 code1
= TREE_CODE (ot
))
7900 ot
= TREE_OPERAND (ot
, 0);
7901 for (enum tree_code code2
= TREE_CODE (nt
);
7902 CONVERT_EXPR_CODE_P (code2
)
7903 || code2
== NON_LVALUE_EXPR
;
7904 code2
= TREE_CODE (nt
))
7905 nt
= TREE_OPERAND (nt
, 0);
7907 return cp_tree_equal (ot
, nt
);
7911 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7912 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7913 NEWARG_PTR with the offending arguments if they are non-NULL. */
7916 comp_template_args (tree oldargs
, tree newargs
,
7917 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7921 if (oldargs
== newargs
)
7924 if (!oldargs
|| !newargs
)
7927 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7930 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7932 tree nt
= TREE_VEC_ELT (newargs
, i
);
7933 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7935 if (! template_args_equal (ot
, nt
))
7937 if (oldarg_ptr
!= NULL
)
7939 if (newarg_ptr
!= NULL
)
7948 add_pending_template (tree d
)
7950 tree ti
= (TYPE_P (d
)
7951 ? CLASSTYPE_TEMPLATE_INFO (d
)
7952 : DECL_TEMPLATE_INFO (d
));
7953 struct pending_template
*pt
;
7956 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7959 /* We are called both from instantiate_decl, where we've already had a
7960 tinst_level pushed, and instantiate_template, where we haven't.
7962 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7965 push_tinst_level (d
);
7967 pt
= ggc_alloc
<pending_template
> ();
7969 pt
->tinst
= current_tinst_level
;
7970 if (last_pending_template
)
7971 last_pending_template
->next
= pt
;
7973 pending_templates
= pt
;
7975 last_pending_template
= pt
;
7977 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7984 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7985 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7986 documentation for TEMPLATE_ID_EXPR. */
7989 lookup_template_function (tree fns
, tree arglist
)
7993 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7994 return error_mark_node
;
7996 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7998 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
8000 error ("%q#D is not a function template", fns
);
8001 return error_mark_node
;
8004 if (BASELINK_P (fns
))
8006 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
8008 BASELINK_FUNCTIONS (fns
),
8013 type
= TREE_TYPE (fns
);
8014 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
8015 type
= unknown_type_node
;
8017 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
8020 /* Within the scope of a template class S<T>, the name S gets bound
8021 (in build_self_reference) to a TYPE_DECL for the class, not a
8022 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
8023 or one of its enclosing classes, and that type is a template,
8024 return the associated TEMPLATE_DECL. Otherwise, the original
8027 Also handle the case when DECL is a TREE_LIST of ambiguous
8028 injected-class-names from different bases. */
8031 maybe_get_template_decl_from_type_decl (tree decl
)
8033 if (decl
== NULL_TREE
)
8036 /* DR 176: A lookup that finds an injected-class-name (10.2
8037 [class.member.lookup]) can result in an ambiguity in certain cases
8038 (for example, if it is found in more than one base class). If all of
8039 the injected-class-names that are found refer to specializations of
8040 the same class template, and if the name is followed by a
8041 template-argument-list, the reference refers to the class template
8042 itself and not a specialization thereof, and is not ambiguous. */
8043 if (TREE_CODE (decl
) == TREE_LIST
)
8045 tree t
, tmpl
= NULL_TREE
;
8046 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8048 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8051 else if (tmpl
!= elt
)
8054 if (tmpl
&& t
== NULL_TREE
)
8060 return (decl
!= NULL_TREE
8061 && DECL_SELF_REFERENCE_P (decl
)
8062 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8063 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8066 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8067 parameters, find the desired type.
8069 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8071 IN_DECL, if non-NULL, is the template declaration we are trying to
8074 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8075 the class we are looking up.
8077 Issue error and warning messages under control of COMPLAIN.
8079 If the template class is really a local class in a template
8080 function, then the FUNCTION_CONTEXT is the function in which it is
8083 ??? Note that this function is currently called *twice* for each
8084 template-id: the first time from the parser, while creating the
8085 incomplete type (finish_template_type), and the second type during the
8086 real instantiation (instantiate_template_class). This is surely something
8087 that we want to avoid. It also causes some problems with argument
8088 coercion (see convert_nontype_argument for more information on this). */
8091 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8092 int entering_scope
, tsubst_flags_t complain
)
8094 tree templ
= NULL_TREE
, parmlist
;
8101 if (identifier_p (d1
))
8103 tree value
= innermost_non_namespace_value (d1
);
8104 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8109 push_decl_namespace (context
);
8110 templ
= lookup_name (d1
);
8111 templ
= maybe_get_template_decl_from_type_decl (templ
);
8113 pop_decl_namespace ();
8116 context
= DECL_CONTEXT (templ
);
8118 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8120 tree type
= TREE_TYPE (d1
);
8122 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8123 an implicit typename for the second A. Deal with it. */
8124 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8125 type
= TREE_TYPE (type
);
8127 if (CLASSTYPE_TEMPLATE_INFO (type
))
8129 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8130 d1
= DECL_NAME (templ
);
8133 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8134 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8136 templ
= TYPE_TI_TEMPLATE (d1
);
8137 d1
= DECL_NAME (templ
);
8139 else if (DECL_TYPE_TEMPLATE_P (d1
))
8142 d1
= DECL_NAME (templ
);
8143 context
= DECL_CONTEXT (templ
);
8145 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8148 d1
= DECL_NAME (templ
);
8151 /* Issue an error message if we didn't find a template. */
8154 if (complain
& tf_error
)
8155 error ("%qT is not a template", d1
);
8156 return error_mark_node
;
8159 if (TREE_CODE (templ
) != TEMPLATE_DECL
8160 /* Make sure it's a user visible template, if it was named by
8162 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8163 && !PRIMARY_TEMPLATE_P (templ
)))
8165 if (complain
& tf_error
)
8167 error ("non-template type %qT used as a template", d1
);
8169 error ("for template declaration %q+D", in_decl
);
8171 return error_mark_node
;
8174 complain
&= ~tf_user
;
8176 /* An alias that just changes the name of a template is equivalent to the
8177 other template, so if any of the arguments are pack expansions, strip
8178 the alias to avoid problems with a pack expansion passed to a non-pack
8179 alias template parameter (DR 1430). */
8180 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8181 templ
= get_underlying_template (templ
);
8183 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8185 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8186 template arguments */
8192 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8194 /* Consider an example where a template template parameter declared as
8196 template <class T, class U = std::allocator<T> > class TT
8198 The template parameter level of T and U are one level larger than
8199 of TT. To proper process the default argument of U, say when an
8200 instantiation `TT<int>' is seen, we need to build the full
8201 arguments containing {int} as the innermost level. Outer levels,
8202 available when not appearing as default template argument, can be
8203 obtained from the arguments of the enclosing template.
8205 Suppose that TT is later substituted with std::vector. The above
8206 instantiation is `TT<int, std::allocator<T> >' with TT at
8207 level 1, and T at level 2, while the template arguments at level 1
8208 becomes {std::vector} and the inner level 2 is {int}. */
8210 outer
= DECL_CONTEXT (templ
);
8212 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8213 else if (current_template_parms
)
8215 /* This is an argument of the current template, so we haven't set
8216 DECL_CONTEXT yet. */
8217 tree relevant_template_parms
;
8219 /* Parameter levels that are greater than the level of the given
8220 template template parm are irrelevant. */
8221 relevant_template_parms
= current_template_parms
;
8222 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8223 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8224 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8226 outer
= template_parms_to_args (relevant_template_parms
);
8230 arglist
= add_to_template_args (outer
, arglist
);
8232 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8234 /*require_all_args=*/true,
8235 /*use_default_args=*/true);
8236 if (arglist2
== error_mark_node
8237 || (!uses_template_parms (arglist2
)
8238 && check_instantiated_args (templ
, arglist2
, complain
)))
8239 return error_mark_node
;
8241 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8246 tree template_type
= TREE_TYPE (templ
);
8249 tree found
= NULL_TREE
;
8252 int is_dependent_type
;
8253 int use_partial_inst_tmpl
= false;
8255 if (template_type
== error_mark_node
)
8256 /* An error occurred while building the template TEMPL, and a
8257 diagnostic has most certainly been emitted for that
8258 already. Let's propagate that error. */
8259 return error_mark_node
;
8261 gen_tmpl
= most_general_template (templ
);
8262 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8263 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8264 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8266 if (arg_depth
== 1 && parm_depth
> 1)
8268 /* We've been given an incomplete set of template arguments.
8271 template <class T> struct S1 {
8272 template <class U> struct S2 {};
8273 template <class U> struct S2<U*> {};
8276 we will be called with an ARGLIST of `U*', but the
8277 TEMPLATE will be `template <class T> template
8278 <class U> struct S1<T>::S2'. We must fill in the missing
8281 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8283 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8286 /* Now we should have enough arguments. */
8287 gcc_assert (parm_depth
== arg_depth
);
8289 /* From here on, we're only interested in the most general
8292 /* Calculate the BOUND_ARGS. These will be the args that are
8293 actually tsubst'd into the definition to create the
8295 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8297 /*require_all_args=*/true,
8298 /*use_default_args=*/true);
8300 if (arglist
== error_mark_node
)
8301 /* We were unable to bind the arguments. */
8302 return error_mark_node
;
8304 /* In the scope of a template class, explicit references to the
8305 template class refer to the type of the template, not any
8306 instantiation of it. For example, in:
8308 template <class T> class C { void f(C<T>); }
8310 the `C<T>' is just the same as `C'. Outside of the
8311 class, however, such a reference is an instantiation. */
8313 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8314 || currently_open_class (template_type
))
8315 /* comp_template_args is expensive, check it last. */
8316 && comp_template_args (TYPE_TI_ARGS (template_type
),
8318 return template_type
;
8320 /* If we already have this specialization, return it. */
8321 elt
.tmpl
= gen_tmpl
;
8323 elt
.spec
= NULL_TREE
;
8324 hash
= spec_hasher::hash (&elt
);
8325 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8330 /* If the the template's constraints are not satisfied,
8331 then we cannot form a valid type.
8333 Note that the check is deferred until after the hash
8334 lookup. This prevents redundant checks on previously
8335 instantiated specializations. */
8336 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8338 if (complain
& tf_error
)
8340 error ("template constraint failure");
8341 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8343 return error_mark_node
;
8346 is_dependent_type
= uses_template_parms (arglist
);
8348 /* If the deduced arguments are invalid, then the binding
8350 if (!is_dependent_type
8351 && check_instantiated_args (gen_tmpl
,
8352 INNERMOST_TEMPLATE_ARGS (arglist
),
8354 return error_mark_node
;
8356 if (!is_dependent_type
8357 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8358 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8359 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8361 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8362 DECL_NAME (gen_tmpl
),
8363 /*tag_scope=*/ts_global
);
8367 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8369 if (context
== error_mark_node
)
8370 return error_mark_node
;
8373 context
= global_namespace
;
8375 /* Create the type. */
8376 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8378 /* The user referred to a specialization of an alias
8379 template represented by GEN_TMPL.
8381 [temp.alias]/2 says:
8383 When a template-id refers to the specialization of an
8384 alias template, it is equivalent to the associated
8385 type obtained by substitution of its
8386 template-arguments for the template-parameters in the
8387 type-id of the alias template. */
8389 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8390 /* Note that the call above (by indirectly calling
8391 register_specialization in tsubst_decl) registers the
8392 TYPE_DECL representing the specialization of the alias
8393 template. So next time someone substitutes ARGLIST for
8394 the template parms into the alias template (GEN_TMPL),
8395 she'll get that TYPE_DECL back. */
8397 if (t
== error_mark_node
)
8400 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8402 if (!is_dependent_type
)
8404 set_current_access_from_decl (TYPE_NAME (template_type
));
8405 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8406 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8407 arglist
, complain
, in_decl
),
8408 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
8409 arglist
, complain
, in_decl
),
8410 SCOPED_ENUM_P (template_type
), NULL
);
8412 if (t
== error_mark_node
)
8417 /* We don't want to call start_enum for this type, since
8418 the values for the enumeration constants may involve
8419 template parameters. And, no one should be interested
8420 in the enumeration constants for such a type. */
8421 t
= cxx_make_type (ENUMERAL_TYPE
);
8422 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8424 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8425 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8426 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8428 else if (CLASS_TYPE_P (template_type
))
8430 t
= make_class_type (TREE_CODE (template_type
));
8431 CLASSTYPE_DECLARED_CLASS (t
)
8432 = CLASSTYPE_DECLARED_CLASS (template_type
);
8433 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8434 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8436 /* A local class. Make sure the decl gets registered properly. */
8437 if (context
== current_function_decl
)
8438 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8440 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8441 /* This instantiation is another name for the primary
8442 template type. Set the TYPE_CANONICAL field
8444 TYPE_CANONICAL (t
) = template_type
;
8445 else if (any_template_arguments_need_structural_equality_p (arglist
))
8446 /* Some of the template arguments require structural
8447 equality testing, so this template class requires
8448 structural equality testing. */
8449 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8454 /* If we called start_enum or pushtag above, this information
8455 will already be set up. */
8458 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8460 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8461 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8462 DECL_SOURCE_LOCATION (type_decl
)
8463 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8466 type_decl
= TYPE_NAME (t
);
8468 if (CLASS_TYPE_P (template_type
))
8470 TREE_PRIVATE (type_decl
)
8471 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8472 TREE_PROTECTED (type_decl
)
8473 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8474 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8476 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8477 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8481 if (OVERLOAD_TYPE_P (t
)
8482 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8484 static const char *tags
[] = {"abi_tag", "may_alias"};
8486 for (unsigned ix
= 0; ix
!= 2; ix
++)
8489 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8493 = tree_cons (TREE_PURPOSE (attributes
),
8494 TREE_VALUE (attributes
),
8495 TYPE_ATTRIBUTES (t
));
8499 /* Let's consider the explicit specialization of a member
8500 of a class template specialization that is implicitly instantiated,
8505 template<class U> struct M {}; //#0
8510 struct S<int>::M<char> //#1
8514 [temp.expl.spec]/4 says this is valid.
8516 In this case, when we write:
8519 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8522 When we encounter #1, we want to store the partial instantiation
8523 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8525 For all cases other than this "explicit specialization of member of a
8526 class template", we just want to store the most general template into
8527 the CLASSTYPE_TI_TEMPLATE of M.
8529 This case of "explicit specialization of member of a class template"
8531 1/ the enclosing class is an instantiation of, and therefore not
8532 the same as, the context of the most general template, and
8533 2/ we aren't looking at the partial instantiation itself, i.e.
8534 the innermost arguments are not the same as the innermost parms of
8535 the most general template.
8537 So it's only when 1/ and 2/ happens that we want to use the partial
8538 instantiation of the member template in lieu of its most general
8541 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8542 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8543 /* the enclosing class must be an instantiation... */
8544 && CLASS_TYPE_P (context
)
8545 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8547 tree partial_inst_args
;
8548 TREE_VEC_LENGTH (arglist
)--;
8549 ++processing_template_decl
;
8551 tsubst (INNERMOST_TEMPLATE_ARGS
8552 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8553 arglist
, complain
, NULL_TREE
);
8554 --processing_template_decl
;
8555 TREE_VEC_LENGTH (arglist
)++;
8556 if (partial_inst_args
== error_mark_node
)
8557 return error_mark_node
;
8558 use_partial_inst_tmpl
=
8559 /*...and we must not be looking at the partial instantiation
8561 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8565 if (!use_partial_inst_tmpl
)
8566 /* This case is easy; there are no member templates involved. */
8570 /* This is a full instantiation of a member template. Find
8571 the partial instantiation of which this is an instance. */
8573 /* Temporarily reduce by one the number of levels in the ARGLIST
8574 so as to avoid comparing the last set of arguments. */
8575 TREE_VEC_LENGTH (arglist
)--;
8576 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8577 TREE_VEC_LENGTH (arglist
)++;
8578 /* FOUND is either a proper class type, or an alias
8579 template specialization. In the later case, it's a
8580 TYPE_DECL, resulting from the substituting of arguments
8581 for parameters in the TYPE_DECL of the alias template
8582 done earlier. So be careful while getting the template
8584 found
= TREE_CODE (found
) == TYPE_DECL
8585 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8586 : CLASSTYPE_TI_TEMPLATE (found
);
8589 // Build template info for the new specialization.
8590 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8593 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8594 entry
= ggc_alloc
<spec_entry
> ();
8598 /* Note this use of the partial instantiation so we can check it
8599 later in maybe_process_partial_specialization. */
8600 DECL_TEMPLATE_INSTANTIATIONS (found
)
8601 = tree_cons (arglist
, t
,
8602 DECL_TEMPLATE_INSTANTIATIONS (found
));
8604 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8605 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8606 /* Now that the type has been registered on the instantiations
8607 list, we set up the enumerators. Because the enumeration
8608 constants may involve the enumeration type itself, we make
8609 sure to register the type first, and then create the
8610 constants. That way, doing tsubst_expr for the enumeration
8611 constants won't result in recursive calls here; we'll find
8612 the instantiation and exit above. */
8613 tsubst_enum (template_type
, t
, arglist
);
8615 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8616 /* If the type makes use of template parameters, the
8617 code that generates debugging information will crash. */
8618 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8620 /* Possibly limit visibility based on template args. */
8621 TREE_PUBLIC (type_decl
) = 1;
8622 determine_visibility (type_decl
);
8624 inherit_targ_abi_tags (t
);
8630 /* Wrapper for lookup_template_class_1. */
8633 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8634 int entering_scope
, tsubst_flags_t complain
)
8637 timevar_push (TV_TEMPLATE_INST
);
8638 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8639 entering_scope
, complain
);
8640 timevar_pop (TV_TEMPLATE_INST
);
8644 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8647 lookup_template_variable (tree templ
, tree arglist
)
8649 /* The type of the expression is NULL_TREE since the template-id could refer
8650 to an explicit or partial specialization. */
8651 tree type
= NULL_TREE
;
8652 if (flag_concepts
&& variable_concept_p (templ
))
8653 /* Except that concepts are always bool. */
8654 type
= boolean_type_node
;
8655 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8658 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8661 finish_template_variable (tree var
, tsubst_flags_t complain
)
8663 tree templ
= TREE_OPERAND (var
, 0);
8664 tree arglist
= TREE_OPERAND (var
, 1);
8666 /* We never want to return a VAR_DECL for a variable concept, since they
8667 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8668 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8669 if (concept_p
&& processing_template_decl
)
8672 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8673 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8675 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8676 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8678 /*use_default*/true);
8680 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8682 if (complain
& tf_error
)
8684 error ("constraints for %qD not satisfied", templ
);
8685 diagnose_constraints (location_of (var
), templ
, arglist
);
8687 return error_mark_node
;
8690 /* If a template-id refers to a specialization of a variable
8691 concept, then the expression is true if and only if the
8692 concept's constraints are satisfied by the given template
8695 NOTE: This is an extension of Concepts Lite TS that
8696 allows constraints to be used in expressions. */
8699 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8700 return evaluate_variable_concept (decl
, arglist
);
8703 return instantiate_template (templ
, arglist
, complain
);
8706 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
8707 TARGS template args, and instantiate it if it's not dependent. */
8710 lookup_and_finish_template_variable (tree templ
, tree targs
,
8711 tsubst_flags_t complain
)
8713 templ
= lookup_template_variable (templ
, targs
);
8714 if (!any_dependent_template_arguments_p (targs
))
8716 templ
= finish_template_variable (templ
, complain
);
8720 return convert_from_reference (templ
);
8728 /* True when we should also visit template parameters that occur in
8729 non-deduced contexts. */
8730 bool include_nondeduced_p
;
8731 hash_set
<tree
> *visited
;
8734 /* Called from for_each_template_parm via walk_tree. */
8737 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8740 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8741 tree_fn_t fn
= pfd
->fn
;
8742 void *data
= pfd
->data
;
8743 tree result
= NULL_TREE
;
8745 #define WALK_SUBTREE(NODE) \
8748 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
8749 pfd->include_nondeduced_p); \
8750 if (result) goto out; \
8755 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
8756 WALK_SUBTREE (TYPE_CONTEXT (t
));
8758 switch (TREE_CODE (t
))
8761 if (TYPE_PTRMEMFUNC_P (t
))
8767 if (!TYPE_TEMPLATE_INFO (t
))
8770 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8774 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
8775 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
8779 /* Since we're not going to walk subtrees, we have to do this
8781 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
8785 /* Check the return type. */
8786 WALK_SUBTREE (TREE_TYPE (t
));
8788 /* Check the parameter types. Since default arguments are not
8789 instantiated until they are needed, the TYPE_ARG_TYPES may
8790 contain expressions that involve template parameters. But,
8791 no-one should be looking at them yet. And, once they're
8792 instantiated, they don't contain template parameters, so
8793 there's no point in looking at them then, either. */
8797 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8798 WALK_SUBTREE (TREE_VALUE (parm
));
8800 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8801 want walk_tree walking into them itself. */
8807 case UNDERLYING_TYPE
:
8808 if (pfd
->include_nondeduced_p
8809 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8811 pfd
->include_nondeduced_p
))
8812 return error_mark_node
;
8817 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
8818 WALK_SUBTREE (DECL_TI_ARGS (t
));
8823 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
8824 WALK_SUBTREE (DECL_INITIAL (t
));
8825 if (DECL_CONTEXT (t
)
8826 && pfd
->include_nondeduced_p
)
8827 WALK_SUBTREE (DECL_CONTEXT (t
));
8830 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8831 /* Record template parameters such as `T' inside `TT<T>'. */
8832 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8835 case TEMPLATE_TEMPLATE_PARM
:
8836 case TEMPLATE_TYPE_PARM
:
8837 case TEMPLATE_PARM_INDEX
:
8838 if (fn
&& (*fn
)(t
, data
))
8845 /* A template template parameter is encountered. */
8846 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8847 WALK_SUBTREE (TREE_TYPE (t
));
8849 /* Already substituted template template parameter */
8854 /* A template-id in a TYPENAME_TYPE might be a deduced context after
8855 partial instantiation. */
8856 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
8860 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8861 && pfd
->include_nondeduced_p
)
8862 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
8867 /* If there's no type, then this thing must be some expression
8868 involving template parameters. */
8869 if (!fn
&& !TREE_TYPE (t
))
8870 return error_mark_node
;
8875 case IMPLICIT_CONV_EXPR
:
8876 case REINTERPRET_CAST_EXPR
:
8877 case CONST_CAST_EXPR
:
8878 case STATIC_CAST_EXPR
:
8879 case DYNAMIC_CAST_EXPR
:
8883 case PSEUDO_DTOR_EXPR
:
8885 return error_mark_node
;
8894 /* We didn't find any template parameters we liked. */
8899 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8900 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8901 call FN with the parameter and the DATA.
8902 If FN returns nonzero, the iteration is terminated, and
8903 for_each_template_parm returns 1. Otherwise, the iteration
8904 continues. If FN never returns a nonzero value, the value
8905 returned by for_each_template_parm is 0. If FN is NULL, it is
8906 considered to be the function which always returns 1.
8908 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8909 parameters that occur in non-deduced contexts. When false, only
8910 visits those template parameters that can be deduced. */
8913 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8914 hash_set
<tree
> *visited
,
8915 bool include_nondeduced_p
)
8917 struct pair_fn_data pfd
;
8923 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8925 /* Walk the tree. (Conceptually, we would like to walk without
8926 duplicates, but for_each_template_parm_r recursively calls
8927 for_each_template_parm, so we would need to reorganize a fair
8928 bit to use walk_tree_without_duplicates, so we keep our own
8931 pfd
.visited
= visited
;
8933 pfd
.visited
= new hash_set
<tree
>;
8934 result
= cp_walk_tree (&t
,
8935 for_each_template_parm_r
,
8949 /* Returns true if T depends on any template parameter. */
8952 uses_template_parms (tree t
)
8958 int saved_processing_template_decl
;
8960 saved_processing_template_decl
= processing_template_decl
;
8961 if (!saved_processing_template_decl
)
8962 processing_template_decl
= 1;
8964 dependent_p
= dependent_type_p (t
);
8965 else if (TREE_CODE (t
) == TREE_VEC
)
8966 dependent_p
= any_dependent_template_arguments_p (t
);
8967 else if (TREE_CODE (t
) == TREE_LIST
)
8968 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8969 || uses_template_parms (TREE_CHAIN (t
)));
8970 else if (TREE_CODE (t
) == TYPE_DECL
)
8971 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8974 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8975 || TREE_CODE (t
) == OVERLOAD
8978 || TREE_CODE (t
) == TRAIT_EXPR
8979 || TREE_CODE (t
) == CONSTRUCTOR
8980 || CONSTANT_CLASS_P (t
))
8981 dependent_p
= (type_dependent_expression_p (t
)
8982 || value_dependent_expression_p (t
));
8985 gcc_assert (t
== error_mark_node
);
8986 dependent_p
= false;
8989 processing_template_decl
= saved_processing_template_decl
;
8994 /* Returns true iff current_function_decl is an incompletely instantiated
8995 template. Useful instead of processing_template_decl because the latter
8996 is set to 0 during instantiate_non_dependent_expr. */
8999 in_template_function (void)
9001 tree fn
= current_function_decl
;
9003 ++processing_template_decl
;
9004 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
9005 && DECL_TEMPLATE_INFO (fn
)
9006 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
9007 --processing_template_decl
;
9011 /* Returns true if T depends on any template parameter with level LEVEL. */
9014 uses_template_parms_level (tree t
, int level
)
9016 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
9017 /*include_nondeduced_p=*/true);
9020 /* Returns TRUE iff INST is an instantiation we don't need to do in an
9021 ill-formed translation unit, i.e. a variable or function that isn't
9022 usable in a constant expression. */
9025 neglectable_inst_p (tree d
)
9028 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
9029 : decl_maybe_constant_var_p (d
)));
9032 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9033 neglectable and instantiated from within an erroneous instantiation. */
9036 limit_bad_template_recursion (tree decl
)
9038 struct tinst_level
*lev
= current_tinst_level
;
9039 int errs
= errorcount
+ sorrycount
;
9040 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9043 for (; lev
; lev
= lev
->next
)
9044 if (neglectable_inst_p (lev
->decl
))
9047 return (lev
&& errs
> lev
->errors
);
9050 static int tinst_depth
;
9051 extern int max_tinst_depth
;
9054 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9056 /* We're starting to instantiate D; record the template instantiation context
9057 for diagnostics and to restore it later. */
9060 push_tinst_level (tree d
)
9062 return push_tinst_level_loc (d
, input_location
);
9065 /* We're starting to instantiate D; record the template instantiation context
9066 at LOC for diagnostics and to restore it later. */
9069 push_tinst_level_loc (tree d
, location_t loc
)
9071 struct tinst_level
*new_level
;
9073 if (tinst_depth
>= max_tinst_depth
)
9075 fatal_error (input_location
,
9076 "template instantiation depth exceeds maximum of %d"
9077 " (use -ftemplate-depth= to increase the maximum)",
9082 /* If the current instantiation caused problems, don't let it instantiate
9083 anything else. Do allow deduction substitution and decls usable in
9084 constant expressions. */
9085 if (limit_bad_template_recursion (d
))
9088 new_level
= ggc_alloc
<tinst_level
> ();
9089 new_level
->decl
= d
;
9090 new_level
->locus
= loc
;
9091 new_level
->errors
= errorcount
+sorrycount
;
9092 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9093 new_level
->next
= current_tinst_level
;
9094 current_tinst_level
= new_level
;
9097 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9098 depth_reached
= tinst_depth
;
9103 /* We're done instantiating this template; return to the instantiation
9107 pop_tinst_level (void)
9109 /* Restore the filename and line number stashed away when we started
9110 this instantiation. */
9111 input_location
= current_tinst_level
->locus
;
9112 current_tinst_level
= current_tinst_level
->next
;
9116 /* We're instantiating a deferred template; restore the template
9117 instantiation context in which the instantiation was requested, which
9118 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9121 reopen_tinst_level (struct tinst_level
*level
)
9123 struct tinst_level
*t
;
9126 for (t
= level
; t
; t
= t
->next
)
9129 current_tinst_level
= level
;
9131 if (current_tinst_level
)
9132 current_tinst_level
->errors
= errorcount
+sorrycount
;
9136 /* Returns the TINST_LEVEL which gives the original instantiation
9139 struct tinst_level
*
9140 outermost_tinst_level (void)
9142 struct tinst_level
*level
= current_tinst_level
;
9145 level
= level
->next
;
9149 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9150 vector of template arguments, as for tsubst.
9152 Returns an appropriate tsubst'd friend declaration. */
9155 tsubst_friend_function (tree decl
, tree args
)
9159 if (TREE_CODE (decl
) == FUNCTION_DECL
9160 && DECL_TEMPLATE_INSTANTIATION (decl
)
9161 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9162 /* This was a friend declared with an explicit template
9163 argument list, e.g.:
9167 to indicate that f was a template instantiation, not a new
9168 function declaration. Now, we have to figure out what
9169 instantiation of what template. */
9171 tree template_id
, arglist
, fns
;
9174 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9176 /* Friend functions are looked up in the containing namespace scope.
9177 We must enter that scope, to avoid finding member functions of the
9178 current class with same name. */
9179 push_nested_namespace (ns
);
9180 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9181 tf_warning_or_error
, NULL_TREE
,
9182 /*integral_constant_expression_p=*/false);
9183 pop_nested_namespace (ns
);
9184 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9185 tf_warning_or_error
, NULL_TREE
);
9186 template_id
= lookup_template_function (fns
, arglist
);
9188 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9189 tmpl
= determine_specialization (template_id
, new_friend
,
9191 /*need_member_template=*/0,
9192 TREE_VEC_LENGTH (args
),
9194 return instantiate_template (tmpl
, new_args
, tf_error
);
9197 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9199 /* The NEW_FRIEND will look like an instantiation, to the
9200 compiler, but is not an instantiation from the point of view of
9201 the language. For example, we might have had:
9203 template <class T> struct S {
9204 template <class U> friend void f(T, U);
9207 Then, in S<int>, template <class U> void f(int, U) is not an
9208 instantiation of anything. */
9209 if (new_friend
== error_mark_node
)
9210 return error_mark_node
;
9212 DECL_USE_TEMPLATE (new_friend
) = 0;
9213 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9215 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9216 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9217 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9220 /* The mangled name for the NEW_FRIEND is incorrect. The function
9221 is not a template instantiation and should not be mangled like
9222 one. Therefore, we forget the mangling here; we'll recompute it
9223 later if we need it. */
9224 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9226 SET_DECL_RTL (new_friend
, NULL
);
9227 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9230 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9233 tree new_friend_template_info
;
9234 tree new_friend_result_template_info
;
9236 int new_friend_is_defn
;
9238 /* We must save some information from NEW_FRIEND before calling
9239 duplicate decls since that function will free NEW_FRIEND if
9241 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9242 new_friend_is_defn
=
9243 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9244 (template_for_substitution (new_friend
)))
9246 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9248 /* This declaration is a `primary' template. */
9249 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9251 new_friend_result_template_info
9252 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9255 new_friend_result_template_info
= NULL_TREE
;
9257 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9258 if (new_friend_is_defn
)
9259 DECL_INITIAL (new_friend
) = error_mark_node
;
9261 /* Inside pushdecl_namespace_level, we will push into the
9262 current namespace. However, the friend function should go
9263 into the namespace of the template. */
9264 ns
= decl_namespace_context (new_friend
);
9265 push_nested_namespace (ns
);
9266 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9267 pop_nested_namespace (ns
);
9269 if (old_decl
== error_mark_node
)
9270 return error_mark_node
;
9272 if (old_decl
!= new_friend
)
9274 /* This new friend declaration matched an existing
9275 declaration. For example, given:
9277 template <class T> void f(T);
9278 template <class U> class C {
9279 template <class T> friend void f(T) {}
9282 the friend declaration actually provides the definition
9283 of `f', once C has been instantiated for some type. So,
9284 old_decl will be the out-of-class template declaration,
9285 while new_friend is the in-class definition.
9287 But, if `f' was called before this point, the
9288 instantiation of `f' will have DECL_TI_ARGS corresponding
9289 to `T' but not to `U', references to which might appear
9290 in the definition of `f'. Previously, the most general
9291 template for an instantiation of `f' was the out-of-class
9292 version; now it is the in-class version. Therefore, we
9293 run through all specialization of `f', adding to their
9294 DECL_TI_ARGS appropriately. In particular, they need a
9295 new set of outer arguments, corresponding to the
9296 arguments for this class instantiation.
9298 The same situation can arise with something like this:
9301 template <class T> class C {
9305 when `C<int>' is instantiated. Now, `f(int)' is defined
9308 if (!new_friend_is_defn
)
9309 /* On the other hand, if the in-class declaration does
9310 *not* provide a definition, then we don't want to alter
9311 existing definitions. We can just leave everything
9316 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9317 tree new_args
= TI_ARGS (new_friend_template_info
);
9319 /* Overwrite whatever template info was there before, if
9320 any, with the new template information pertaining to
9322 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9324 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9326 /* We should have called reregister_specialization in
9328 gcc_assert (retrieve_specialization (new_template
,
9332 /* Instantiate it if the global has already been used. */
9333 if (DECL_ODR_USED (old_decl
))
9334 instantiate_decl (old_decl
, /*defer_ok=*/true,
9335 /*expl_inst_class_mem_p=*/false);
9341 /* Indicate that the old function template is a partial
9343 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9344 = new_friend_result_template_info
;
9346 gcc_assert (new_template
9347 == most_general_template (new_template
));
9348 gcc_assert (new_template
!= old_decl
);
9350 /* Reassign any specializations already in the hash table
9351 to the new more general template, and add the
9352 additional template args. */
9353 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9357 tree spec
= TREE_VALUE (t
);
9360 elt
.tmpl
= old_decl
;
9361 elt
.args
= DECL_TI_ARGS (spec
);
9362 elt
.spec
= NULL_TREE
;
9364 decl_specializations
->remove_elt (&elt
);
9367 = add_outermost_template_args (new_args
,
9368 DECL_TI_ARGS (spec
));
9370 register_specialization
9371 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9374 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9378 /* The information from NEW_FRIEND has been merged into OLD_DECL
9379 by duplicate_decls. */
9380 new_friend
= old_decl
;
9385 tree context
= DECL_CONTEXT (new_friend
);
9389 template <class T> class C {
9390 template <class U> friend void C1<U>::f (); // case 1
9391 friend void C2<T>::f (); // case 2
9393 we only need to make sure CONTEXT is a complete type for
9394 case 2. To distinguish between the two cases, we note that
9395 CONTEXT of case 1 remains dependent type after tsubst while
9396 this isn't true for case 2. */
9397 ++processing_template_decl
;
9398 dependent_p
= dependent_type_p (context
);
9399 --processing_template_decl
;
9402 && !complete_type_or_else (context
, NULL_TREE
))
9403 return error_mark_node
;
9405 if (COMPLETE_TYPE_P (context
))
9407 tree fn
= new_friend
;
9408 /* do_friend adds the TEMPLATE_DECL for any member friend
9409 template even if it isn't a member template, i.e.
9410 template <class T> friend A<T>::f();
9411 Look through it in that case. */
9412 if (TREE_CODE (fn
) == TEMPLATE_DECL
9413 && !PRIMARY_TEMPLATE_P (fn
))
9414 fn
= DECL_TEMPLATE_RESULT (fn
);
9415 /* Check to see that the declaration is really present, and,
9416 possibly obtain an improved declaration. */
9417 fn
= check_classfn (context
, fn
, NULL_TREE
);
9427 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9428 template arguments, as for tsubst.
9430 Returns an appropriate tsubst'd friend type or error_mark_node on
9434 tsubst_friend_class (tree friend_tmpl
, tree args
)
9440 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9442 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9443 return TREE_TYPE (t
);
9446 context
= CP_DECL_CONTEXT (friend_tmpl
);
9448 if (context
!= global_namespace
)
9450 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9451 push_nested_namespace (context
);
9453 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9456 /* Look for a class template declaration. We look for hidden names
9457 because two friend declarations of the same template are the
9458 same. For example, in:
9461 template <typename> friend class F;
9463 template <typename> struct B {
9464 template <typename> friend class F;
9467 both F templates are the same. */
9468 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9469 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9471 /* But, if we don't find one, it might be because we're in a
9472 situation like this:
9480 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9481 for `S<int>', not the TEMPLATE_DECL. */
9482 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9484 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9485 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9488 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9490 /* The friend template has already been declared. Just
9491 check to see that the declarations match, and install any new
9492 default parameters. We must tsubst the default parameters,
9493 of course. We only need the innermost template parameters
9494 because that is all that redeclare_class_template will look
9496 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9497 > TMPL_ARGS_DEPTH (args
))
9500 location_t saved_input_location
;
9501 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9502 args
, tf_warning_or_error
);
9504 saved_input_location
= input_location
;
9505 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9506 tree cons
= get_constraints (tmpl
);
9507 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9508 input_location
= saved_input_location
;
9512 friend_type
= TREE_TYPE (tmpl
);
9516 /* The friend template has not already been declared. In this
9517 case, the instantiation of the template class will cause the
9518 injection of this template into the global scope. */
9519 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9520 if (tmpl
== error_mark_node
)
9521 return error_mark_node
;
9523 /* The new TMPL is not an instantiation of anything, so we
9524 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9525 the new type because that is supposed to be the corresponding
9526 template decl, i.e., TMPL. */
9527 DECL_USE_TEMPLATE (tmpl
) = 0;
9528 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9529 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9530 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9531 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9533 /* Inject this template into the global scope. */
9534 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9537 if (context
!= global_namespace
)
9539 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9540 pop_nested_namespace (context
);
9542 pop_nested_class ();
9548 /* Returns zero if TYPE cannot be completed later due to circularity.
9549 Otherwise returns one. */
9552 can_complete_type_without_circularity (tree type
)
9554 if (type
== NULL_TREE
|| type
== error_mark_node
)
9556 else if (COMPLETE_TYPE_P (type
))
9558 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9559 return can_complete_type_without_circularity (TREE_TYPE (type
));
9560 else if (CLASS_TYPE_P (type
)
9561 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9567 static tree
tsubst_omp_clauses (tree
, enum c_omp_region_type
, tree
,
9568 tsubst_flags_t
, tree
);
9570 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
9571 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
9574 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
9575 tsubst_flags_t complain
, tree in_decl
)
9577 gcc_assert (ATTR_IS_DEPENDENT (t
));
9579 tree val
= TREE_VALUE (t
);
9580 if (val
== NULL_TREE
)
9581 /* Nothing to do. */;
9582 else if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9583 && is_attribute_p ("omp declare simd",
9584 get_attribute_name (t
)))
9586 tree clauses
= TREE_VALUE (val
);
9587 clauses
= tsubst_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
, args
,
9589 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9590 clauses
= finish_omp_clauses (clauses
, C_ORT_OMP_DECLARE_SIMD
);
9591 tree parms
= DECL_ARGUMENTS (*decl_p
);
9593 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9595 val
= build_tree_list (NULL_TREE
, clauses
);
9599 /* If the first attribute argument is an identifier, don't
9600 pass it through tsubst. Attributes like mode, format,
9601 cleanup and several target specific attributes expect it
9603 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
9606 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
9607 /*integral_constant_expression_p=*/false);
9608 if (chain
!= TREE_CHAIN (val
))
9609 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
9611 else if (PACK_EXPANSION_P (val
))
9613 /* An attribute pack expansion. */
9614 tree purp
= TREE_PURPOSE (t
);
9615 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
9616 int len
= TREE_VEC_LENGTH (pack
);
9617 tree list
= NULL_TREE
;
9619 for (int i
= 0; i
< len
; ++i
)
9621 tree elt
= TREE_VEC_ELT (pack
, i
);
9622 *q
= build_tree_list (purp
, elt
);
9623 q
= &TREE_CHAIN (*q
);
9628 val
= tsubst_expr (val
, args
, complain
, in_decl
,
9629 /*integral_constant_expression_p=*/false);
9631 if (val
!= TREE_VALUE (t
))
9632 return build_tree_list (TREE_PURPOSE (t
), val
);
9636 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
9637 unchanged or a new TREE_LIST chain. */
9640 tsubst_attributes (tree attributes
, tree args
,
9641 tsubst_flags_t complain
, tree in_decl
)
9643 tree last_dep
= NULL_TREE
;
9645 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
9646 if (ATTR_IS_DEPENDENT (t
))
9649 attributes
= copy_list (attributes
);
9654 for (tree
*p
= &attributes
; *p
; p
= &TREE_CHAIN (*p
))
9657 if (ATTR_IS_DEPENDENT (t
))
9659 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
9664 p
= &TREE_CHAIN (*p
);
9666 *p
= TREE_CHAIN (t
);
9673 /* Apply any attributes which had to be deferred until instantiation
9674 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9675 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9678 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9679 tree args
, tsubst_flags_t complain
, tree in_decl
)
9681 tree last_dep
= NULL_TREE
;
9685 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9686 if (ATTR_IS_DEPENDENT (t
))
9689 attributes
= copy_list (attributes
);
9693 if (DECL_P (*decl_p
))
9695 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9697 p
= &DECL_ATTRIBUTES (*decl_p
);
9700 p
= &TYPE_ATTRIBUTES (*decl_p
);
9704 tree late_attrs
= NULL_TREE
;
9705 tree
*q
= &late_attrs
;
9707 for (*p
= attributes
; *p
; )
9710 if (ATTR_IS_DEPENDENT (t
))
9712 *p
= TREE_CHAIN (t
);
9713 TREE_CHAIN (t
) = NULL_TREE
;
9714 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
9716 q
= &TREE_CHAIN (*q
);
9720 p
= &TREE_CHAIN (t
);
9723 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9727 /* Perform (or defer) access check for typedefs that were referenced
9728 from within the template TMPL code.
9729 This is a subroutine of instantiate_decl and instantiate_class_template.
9730 TMPL is the template to consider and TARGS is the list of arguments of
9734 perform_typedefs_access_check (tree tmpl
, tree targs
)
9736 location_t saved_location
;
9738 qualified_typedef_usage_t
*iter
;
9741 || (!CLASS_TYPE_P (tmpl
)
9742 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9745 saved_location
= input_location
;
9746 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9748 tree type_decl
= iter
->typedef_decl
;
9749 tree type_scope
= iter
->context
;
9751 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9754 if (uses_template_parms (type_decl
))
9755 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9756 if (uses_template_parms (type_scope
))
9757 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9759 /* Make access check error messages point to the location
9760 of the use of the typedef. */
9761 input_location
= iter
->locus
;
9762 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9763 type_decl
, type_decl
,
9764 tf_warning_or_error
);
9766 input_location
= saved_location
;
9770 instantiate_class_template_1 (tree type
)
9772 tree templ
, args
, pattern
, t
, member
;
9776 unsigned int saved_maximum_field_alignment
;
9779 if (type
== error_mark_node
)
9780 return error_mark_node
;
9782 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9783 || uses_template_parms (type
))
9786 /* Figure out which template is being instantiated. */
9787 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9788 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9790 /* Determine what specialization of the original template to
9792 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9793 if (t
== error_mark_node
)
9795 TYPE_BEING_DEFINED (type
) = 1;
9796 return error_mark_node
;
9800 /* This TYPE is actually an instantiation of a partial
9801 specialization. We replace the innermost set of ARGS with
9802 the arguments appropriate for substitution. For example,
9805 template <class T> struct S {};
9806 template <class T> struct S<T*> {};
9808 and supposing that we are instantiating S<int*>, ARGS will
9809 presently be {int*} -- but we need {int}. */
9810 pattern
= TREE_TYPE (t
);
9811 args
= TREE_PURPOSE (t
);
9815 pattern
= TREE_TYPE (templ
);
9816 args
= CLASSTYPE_TI_ARGS (type
);
9819 /* If the template we're instantiating is incomplete, then clearly
9820 there's nothing we can do. */
9821 if (!COMPLETE_TYPE_P (pattern
))
9824 /* If we've recursively instantiated too many templates, stop. */
9825 if (! push_tinst_level (type
))
9828 /* Now we're really doing the instantiation. Mark the type as in
9829 the process of being defined. */
9830 TYPE_BEING_DEFINED (type
) = 1;
9832 /* We may be in the middle of deferred access check. Disable
9834 push_deferring_access_checks (dk_no_deferred
);
9836 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9837 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9839 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9840 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9841 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9842 fn_context
= error_mark_node
;
9844 push_to_top_level ();
9847 cp_unevaluated_operand
= 0;
9848 c_inhibit_evaluation_warnings
= 0;
9850 /* Use #pragma pack from the template context. */
9851 saved_maximum_field_alignment
= maximum_field_alignment
;
9852 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9854 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9856 /* Set the input location to the most specialized template definition.
9857 This is needed if tsubsting causes an error. */
9858 typedecl
= TYPE_MAIN_DECL (pattern
);
9859 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9860 DECL_SOURCE_LOCATION (typedecl
);
9862 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9863 SET_TYPE_ALIGN (type
, TYPE_ALIGN (pattern
));
9864 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9865 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9866 if (ANON_AGGR_TYPE_P (pattern
))
9867 SET_ANON_AGGR_TYPE_P (type
);
9868 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9870 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9871 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9872 /* Adjust visibility for template arguments. */
9873 determine_visibility (TYPE_MAIN_DECL (type
));
9875 if (CLASS_TYPE_P (type
))
9876 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9878 pbinfo
= TYPE_BINFO (pattern
);
9880 /* We should never instantiate a nested class before its enclosing
9881 class; we need to look up the nested class by name before we can
9882 instantiate it, and that lookup should instantiate the enclosing
9884 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9885 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9887 base_list
= NULL_TREE
;
9888 if (BINFO_N_BASE_BINFOS (pbinfo
))
9894 /* We must enter the scope containing the type, as that is where
9895 the accessibility of types named in dependent bases are
9897 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9899 /* Substitute into each of the bases to determine the actual
9901 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9904 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9905 tree expanded_bases
= NULL_TREE
;
9908 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9911 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9912 args
, tf_error
, NULL_TREE
);
9913 if (expanded_bases
== error_mark_node
)
9916 len
= TREE_VEC_LENGTH (expanded_bases
);
9919 for (idx
= 0; idx
< len
; idx
++)
9922 /* Extract the already-expanded base class. */
9923 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9925 /* Substitute to figure out the base class. */
9926 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9929 if (base
== error_mark_node
)
9932 base_list
= tree_cons (access
, base
, base_list
);
9933 if (BINFO_VIRTUAL_P (pbase_binfo
))
9934 TREE_TYPE (base_list
) = integer_type_node
;
9938 /* The list is now in reverse order; correct that. */
9939 base_list
= nreverse (base_list
);
9942 pop_scope (pushed_scope
);
9944 /* Now call xref_basetypes to set up all the base-class
9946 xref_basetypes (type
, base_list
);
9948 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9949 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9950 args
, tf_error
, NULL_TREE
);
9951 fixup_attribute_variants (type
);
9953 /* Now that our base classes are set up, enter the scope of the
9954 class, so that name lookups into base classes, etc. will work
9955 correctly. This is precisely analogous to what we do in
9956 begin_class_definition when defining an ordinary non-template
9957 class, except we also need to push the enclosing classes. */
9958 push_nested_class (type
);
9960 /* Now members are processed in the order of declaration. */
9961 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9962 member
; member
= TREE_CHAIN (member
))
9964 tree t
= TREE_VALUE (member
);
9966 if (TREE_PURPOSE (member
))
9970 /* Build new CLASSTYPE_NESTED_UTDS. */
9973 bool class_template_p
;
9975 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9976 && TYPE_LANG_SPECIFIC (t
)
9977 && CLASSTYPE_IS_TEMPLATE (t
));
9978 /* If the member is a class template, then -- even after
9979 substitution -- there may be dependent types in the
9980 template argument list for the class. We increment
9981 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9982 that function will assume that no types are dependent
9983 when outside of a template. */
9984 if (class_template_p
)
9985 ++processing_template_decl
;
9986 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9987 if (class_template_p
)
9988 --processing_template_decl
;
9989 if (newtag
== error_mark_node
)
9992 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9994 tree name
= TYPE_IDENTIFIER (t
);
9996 if (class_template_p
)
9997 /* Unfortunately, lookup_template_class sets
9998 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9999 instantiation (i.e., for the type of a member
10000 template class nested within a template class.)
10001 This behavior is required for
10002 maybe_process_partial_specialization to work
10003 correctly, but is not accurate in this case;
10004 the TAG is not an instantiation of anything.
10005 (The corresponding TEMPLATE_DECL is an
10006 instantiation, but the TYPE is not.) */
10007 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
10009 /* Now, we call pushtag to put this NEWTAG into the scope of
10010 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
10011 pushtag calling push_template_decl. We don't have to do
10012 this for enums because it will already have been done in
10015 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
10016 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
10019 else if (DECL_DECLARES_FUNCTION_P (t
))
10021 /* Build new TYPE_METHODS. */
10024 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10025 ++processing_template_decl
;
10026 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
10027 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10028 --processing_template_decl
;
10029 set_current_access_from_decl (r
);
10030 finish_member_declaration (r
);
10031 /* Instantiate members marked with attribute used. */
10032 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10034 if (TREE_CODE (r
) == FUNCTION_DECL
10035 && DECL_OMP_DECLARE_REDUCTION_P (r
))
10036 cp_check_omp_declare_reduction (r
);
10038 else if (DECL_CLASS_TEMPLATE_P (t
)
10039 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
10040 /* A closure type for a lambda in a default argument for a
10041 member template. Ignore it; it will be instantiated with
10042 the default argument. */;
10045 /* Build new TYPE_FIELDS. */
10046 if (TREE_CODE (t
) == STATIC_ASSERT
)
10050 ++c_inhibit_evaluation_warnings
;
10052 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
10053 tf_warning_or_error
, NULL_TREE
,
10054 /*integral_constant_expression_p=*/true);
10055 --c_inhibit_evaluation_warnings
;
10057 finish_static_assert (condition
,
10058 STATIC_ASSERT_MESSAGE (t
),
10059 STATIC_ASSERT_SOURCE_LOCATION (t
),
10060 /*member_p=*/true);
10062 else if (TREE_CODE (t
) != CONST_DECL
)
10065 tree vec
= NULL_TREE
;
10068 /* The file and line for this declaration, to
10069 assist in error message reporting. Since we
10070 called push_tinst_level above, we don't need to
10072 input_location
= DECL_SOURCE_LOCATION (t
);
10074 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10075 ++processing_template_decl
;
10076 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
10077 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10078 --processing_template_decl
;
10080 if (TREE_CODE (r
) == TREE_VEC
)
10082 /* A capture pack became multiple fields. */
10084 len
= TREE_VEC_LENGTH (vec
);
10087 for (int i
= 0; i
< len
; ++i
)
10090 r
= TREE_VEC_ELT (vec
, i
);
10095 [t]he initialization (and any associated
10096 side-effects) of a static data member does
10097 not occur unless the static data member is
10098 itself used in a way that requires the
10099 definition of the static data member to
10102 Therefore, we do not substitute into the
10103 initialized for the static data member here. */
10104 finish_static_data_member_decl
10106 /*init=*/NULL_TREE
,
10107 /*init_const_expr_p=*/false,
10108 /*asmspec_tree=*/NULL_TREE
,
10110 /* Instantiate members marked with attribute used. */
10111 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10114 else if (TREE_CODE (r
) == FIELD_DECL
)
10116 /* Determine whether R has a valid type and can be
10117 completed later. If R is invalid, then its type
10118 is replaced by error_mark_node. */
10119 tree rtype
= TREE_TYPE (r
);
10120 if (can_complete_type_without_circularity (rtype
))
10121 complete_type (rtype
);
10123 if (!complete_or_array_type_p (rtype
))
10125 /* If R's type couldn't be completed and
10126 it isn't a flexible array member (whose
10127 type is incomplete by definition) give
10129 cxx_incomplete_type_error (r
, rtype
);
10130 TREE_TYPE (r
) = error_mark_node
;
10134 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10135 such a thing will already have been added to the field
10136 list by tsubst_enum in finish_member_declaration in the
10137 CLASSTYPE_NESTED_UTDS case above. */
10138 if (!(TREE_CODE (r
) == TYPE_DECL
10139 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10140 && DECL_ARTIFICIAL (r
)))
10142 set_current_access_from_decl (r
);
10143 finish_member_declaration (r
);
10151 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10152 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10154 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10156 tree friend_type
= t
;
10157 bool adjust_processing_template_decl
= false;
10159 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10161 /* template <class T> friend class C; */
10162 friend_type
= tsubst_friend_class (friend_type
, args
);
10163 adjust_processing_template_decl
= true;
10165 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10167 /* template <class T> friend class C::D; */
10168 friend_type
= tsubst (friend_type
, args
,
10169 tf_warning_or_error
, NULL_TREE
);
10170 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10171 friend_type
= TREE_TYPE (friend_type
);
10172 adjust_processing_template_decl
= true;
10174 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10175 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10177 /* This could be either
10181 when dependent_type_p is false or
10183 template <class U> friend class T::C;
10186 /* Bump processing_template_decl in case this is something like
10187 template <class T> friend struct A<T>::B. */
10188 ++processing_template_decl
;
10189 friend_type
= tsubst (friend_type
, args
,
10190 tf_warning_or_error
, NULL_TREE
);
10191 if (dependent_type_p (friend_type
))
10192 adjust_processing_template_decl
= true;
10193 --processing_template_decl
;
10195 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10196 && hidden_name_p (TYPE_NAME (friend_type
)))
10200 where C hasn't been declared yet. Let's lookup name
10201 from namespace scope directly, bypassing any name that
10202 come from dependent base class. */
10203 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10205 /* The call to xref_tag_from_type does injection for friend
10207 push_nested_namespace (ns
);
10209 xref_tag_from_type (friend_type
, NULL_TREE
,
10210 /*tag_scope=*/ts_current
);
10211 pop_nested_namespace (ns
);
10213 else if (uses_template_parms (friend_type
))
10214 /* friend class C<T>; */
10215 friend_type
= tsubst (friend_type
, args
,
10216 tf_warning_or_error
, NULL_TREE
);
10221 where C is already declared or
10223 friend class C<int>;
10225 We don't have to do anything in these cases. */
10227 if (adjust_processing_template_decl
)
10228 /* Trick make_friend_class into realizing that the friend
10229 we're adding is a template, not an ordinary class. It's
10230 important that we use make_friend_class since it will
10231 perform some error-checking and output cross-reference
10233 ++processing_template_decl
;
10235 if (friend_type
!= error_mark_node
)
10236 make_friend_class (type
, friend_type
, /*complain=*/false);
10238 if (adjust_processing_template_decl
)
10239 --processing_template_decl
;
10243 /* Build new DECL_FRIENDLIST. */
10246 /* The file and line for this declaration, to
10247 assist in error message reporting. Since we
10248 called push_tinst_level above, we don't need to
10250 input_location
= DECL_SOURCE_LOCATION (t
);
10252 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10254 ++processing_template_decl
;
10255 push_deferring_access_checks (dk_no_check
);
10258 r
= tsubst_friend_function (t
, args
);
10259 add_friend (type
, r
, /*complain=*/false);
10260 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10262 pop_deferring_access_checks ();
10263 --processing_template_decl
;
10271 /* Restore these before substituting into the lambda capture
10273 cp_unevaluated_operand
= saved_unevaluated_operand
;
10274 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10277 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10279 tree decl
= lambda_function (type
);
10282 if (!DECL_TEMPLATE_INFO (decl
)
10283 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10285 /* Set function_depth to avoid garbage collection. */
10287 instantiate_decl (decl
, false, false);
10291 /* We need to instantiate the capture list from the template
10292 after we've instantiated the closure members, but before we
10293 consider adding the conversion op. Also keep any captures
10294 that may have been added during instantiation of the op(). */
10295 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10297 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10298 args
, tf_warning_or_error
, NULL_TREE
,
10301 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10302 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10304 maybe_add_lambda_conv_op (type
);
10307 gcc_assert (errorcount
);
10310 /* Set the file and line number information to whatever is given for
10311 the class itself. This puts error messages involving generated
10312 implicit functions at a predictable point, and the same point
10313 that would be used for non-template classes. */
10314 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10316 unreverse_member_declarations (type
);
10317 finish_struct_1 (type
);
10318 TYPE_BEING_DEFINED (type
) = 0;
10320 /* We don't instantiate default arguments for member functions. 14.7.1:
10322 The implicit instantiation of a class template specialization causes
10323 the implicit instantiation of the declarations, but not of the
10324 definitions or default arguments, of the class member functions,
10325 member classes, static data members and member templates.... */
10327 /* Some typedefs referenced from within the template code need to be access
10328 checked at template instantiation time, i.e now. These types were
10329 added to the template at parsing time. Let's get those and perform
10330 the access checks then. */
10331 perform_typedefs_access_check (pattern
, args
);
10332 perform_deferred_access_checks (tf_warning_or_error
);
10333 pop_nested_class ();
10334 maximum_field_alignment
= saved_maximum_field_alignment
;
10336 pop_from_top_level ();
10337 pop_deferring_access_checks ();
10338 pop_tinst_level ();
10340 /* The vtable for a template class can be emitted in any translation
10341 unit in which the class is instantiated. When there is no key
10342 method, however, finish_struct_1 will already have added TYPE to
10343 the keyed_classes list. */
10344 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10345 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10350 /* Wrapper for instantiate_class_template_1. */
10353 instantiate_class_template (tree type
)
10356 timevar_push (TV_TEMPLATE_INST
);
10357 ret
= instantiate_class_template_1 (type
);
10358 timevar_pop (TV_TEMPLATE_INST
);
10363 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10369 else if (TYPE_P (t
))
10370 r
= tsubst (t
, args
, complain
, in_decl
);
10373 if (!(complain
& tf_warning
))
10374 ++c_inhibit_evaluation_warnings
;
10375 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10376 /*integral_constant_expression_p=*/true);
10377 if (!(complain
& tf_warning
))
10378 --c_inhibit_evaluation_warnings
;
10383 /* Given a function parameter pack TMPL_PARM and some function parameters
10384 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10385 and set *SPEC_P to point at the next point in the list. */
10388 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10390 /* Collect all of the extra "packed" parameters into an
10394 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10395 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10396 tree spec_parm
= *spec_p
;
10399 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10401 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10404 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10405 parmvec
= make_tree_vec (len
);
10406 parmtypevec
= make_tree_vec (len
);
10407 spec_parm
= *spec_p
;
10408 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10410 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10411 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10414 /* Build the argument packs. */
10415 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10416 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10417 TREE_TYPE (argpack
) = argtypepack
;
10418 *spec_p
= spec_parm
;
10423 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10424 NONTYPE_ARGUMENT_PACK. */
10427 make_fnparm_pack (tree spec_parm
)
10429 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10432 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10433 pack expansion with no extra args, 2 if it has extra args, or 0
10434 if it is not a pack expansion. */
10437 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10439 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10440 if (i
>= TREE_VEC_LENGTH (vec
))
10442 tree elt
= TREE_VEC_ELT (vec
, i
);
10444 /* A decl pack is itself an expansion. */
10445 elt
= TREE_TYPE (elt
);
10446 if (!PACK_EXPANSION_P (elt
))
10448 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10454 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10457 make_argument_pack_select (tree arg_pack
, unsigned index
)
10459 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10461 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10462 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10467 /* This is a subroutine of tsubst_pack_expansion.
10469 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10470 mechanism to store the (non complete list of) arguments of the
10471 substitution and return a non substituted pack expansion, in order
10472 to wait for when we have enough arguments to really perform the
10476 use_pack_expansion_extra_args_p (tree parm_packs
,
10478 bool has_empty_arg
)
10480 /* If one pack has an expansion and another pack has a normal
10481 argument or if one pack has an empty argument and an another
10482 one hasn't then tsubst_pack_expansion cannot perform the
10483 substitution and need to fall back on the
10484 PACK_EXPANSION_EXTRA mechanism. */
10485 if (parm_packs
== NULL_TREE
)
10487 else if (has_empty_arg
)
10490 bool has_expansion_arg
= false;
10491 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10493 bool has_non_expansion_arg
= false;
10494 for (tree parm_pack
= parm_packs
;
10496 parm_pack
= TREE_CHAIN (parm_pack
))
10498 tree arg
= TREE_VALUE (parm_pack
);
10500 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10502 /* We can't substitute a pack expansion with extra args into
10506 has_expansion_arg
= true;
10508 has_non_expansion_arg
= true;
10511 if (has_expansion_arg
&& has_non_expansion_arg
)
10517 /* [temp.variadic]/6 says that:
10519 The instantiation of a pack expansion [...]
10520 produces a list E1,E2, ..., En, where N is the number of elements
10521 in the pack expansion parameters.
10523 This subroutine of tsubst_pack_expansion produces one of these Ei.
10525 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10526 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10527 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10528 INDEX is the index 'i' of the element Ei to produce. ARGS,
10529 COMPLAIN, and IN_DECL are the same parameters as for the
10530 tsubst_pack_expansion function.
10532 The function returns the resulting Ei upon successful completion,
10533 or error_mark_node.
10535 Note that this function possibly modifies the ARGS parameter, so
10536 it's the responsibility of the caller to restore it. */
10539 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10542 tree args
/* This parm gets
10544 tsubst_flags_t complain
,
10548 bool ith_elem_is_expansion
= false;
10550 /* For each parameter pack, change the substitution of the parameter
10551 pack to the ith argument in its argument pack, then expand the
10553 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10555 tree parm
= TREE_PURPOSE (pack
);
10556 tree arg_pack
= TREE_VALUE (pack
);
10557 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10559 ith_elem_is_expansion
|=
10560 argument_pack_element_is_expansion_p (arg_pack
, index
);
10562 /* Select the Ith argument from the pack. */
10563 if (TREE_CODE (parm
) == PARM_DECL
10564 || TREE_CODE (parm
) == FIELD_DECL
)
10568 aps
= make_argument_pack_select (arg_pack
, index
);
10569 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10570 return error_mark_node
;
10571 register_local_specialization (aps
, parm
);
10574 aps
= retrieve_local_specialization (parm
);
10579 template_parm_level_and_index (parm
, &level
, &idx
);
10583 aps
= make_argument_pack_select (arg_pack
, index
);
10584 /* Update the corresponding argument. */
10585 TMPL_ARG (args
, level
, idx
) = aps
;
10588 /* Re-use the ARGUMENT_PACK_SELECT. */
10589 aps
= TMPL_ARG (args
, level
, idx
);
10591 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10594 /* Substitute into the PATTERN with the (possibly altered)
10596 if (pattern
== in_decl
)
10597 /* Expanding a fixed parameter pack from
10598 coerce_template_parameter_pack. */
10599 t
= tsubst_decl (pattern
, args
, complain
);
10600 else if (pattern
== error_mark_node
)
10601 t
= error_mark_node
;
10602 else if (constraint_p (pattern
))
10604 if (processing_template_decl
)
10605 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10607 t
= (constraints_satisfied_p (pattern
, args
)
10608 ? boolean_true_node
: boolean_false_node
);
10610 else if (!TYPE_P (pattern
))
10611 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10612 /*integral_constant_expression_p=*/false);
10614 t
= tsubst (pattern
, args
, complain
, in_decl
);
10616 /* If the Ith argument pack element is a pack expansion, then
10617 the Ith element resulting from the substituting is going to
10618 be a pack expansion as well. */
10619 if (ith_elem_is_expansion
)
10620 t
= make_pack_expansion (t
);
10625 /* When the unexpanded parameter pack in a fold expression expands to an empty
10626 sequence, the value of the expression is as follows; the program is
10627 ill-formed if the operator is not listed in this table.
10634 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10636 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10637 if (!FOLD_EXPR_MODIFY_P (t
))
10640 case TRUTH_ANDIF_EXPR
:
10641 return boolean_true_node
;
10642 case TRUTH_ORIF_EXPR
:
10643 return boolean_false_node
;
10644 case COMPOUND_EXPR
:
10650 if (complain
& tf_error
)
10651 error_at (location_of (t
),
10652 "fold of empty expansion over %O", code
);
10653 return error_mark_node
;
10656 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10657 form an expression that combines the two terms using the
10661 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10663 tree op
= FOLD_EXPR_OP (t
);
10664 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10666 // Handle compound assignment operators.
10667 if (FOLD_EXPR_MODIFY_P (t
))
10668 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10672 case COMPOUND_EXPR
:
10673 return build_x_compound_expr (input_location
, left
, right
, complain
);
10675 return build_m_component_ref (left
, right
, complain
);
10677 return build_x_binary_op (input_location
, code
,
10678 left
, TREE_CODE (left
),
10679 right
, TREE_CODE (right
),
10685 /* Substitute ARGS into the pack of a fold expression T. */
10688 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10690 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10693 /* Substitute ARGS into the pack of a fold expression T. */
10696 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10698 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10701 /* Expand a PACK of arguments into a grouped as left fold.
10702 Given a pack containing elements A0, A1, ..., An and an
10703 operator @, this builds the expression:
10705 ((A0 @ A1) @ A2) ... @ An
10707 Note that PACK must not be empty.
10709 The operator is defined by the original fold expression T. */
10712 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10714 tree left
= TREE_VEC_ELT (pack
, 0);
10715 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10717 tree right
= TREE_VEC_ELT (pack
, i
);
10718 left
= fold_expression (t
, left
, right
, complain
);
10723 /* Substitute into a unary left fold expression. */
10726 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10729 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10730 if (pack
== error_mark_node
)
10731 return error_mark_node
;
10732 if (TREE_VEC_LENGTH (pack
) == 0)
10733 return expand_empty_fold (t
, complain
);
10735 return expand_left_fold (t
, pack
, complain
);
10738 /* Substitute into a binary left fold expression.
10740 Do ths by building a single (non-empty) vector of argumnts and
10741 building the expression from those elements. */
10744 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10747 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10748 if (pack
== error_mark_node
)
10749 return error_mark_node
;
10750 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10751 if (init
== error_mark_node
)
10752 return error_mark_node
;
10754 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10755 TREE_VEC_ELT (vec
, 0) = init
;
10756 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10757 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10759 return expand_left_fold (t
, vec
, complain
);
10762 /* Expand a PACK of arguments into a grouped as right fold.
10763 Given a pack containing elementns A0, A1, ..., and an
10764 operator @, this builds the expression:
10766 A0@ ... (An-2 @ (An-1 @ An))
10768 Note that PACK must not be empty.
10770 The operator is defined by the original fold expression T. */
10773 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10775 // Build the expression.
10776 int n
= TREE_VEC_LENGTH (pack
);
10777 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10778 for (--n
; n
!= 0; --n
)
10780 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10781 right
= fold_expression (t
, left
, right
, complain
);
10786 /* Substitute into a unary right fold expression. */
10789 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10792 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10793 if (pack
== error_mark_node
)
10794 return error_mark_node
;
10795 if (TREE_VEC_LENGTH (pack
) == 0)
10796 return expand_empty_fold (t
, complain
);
10798 return expand_right_fold (t
, pack
, complain
);
10801 /* Substitute into a binary right fold expression.
10803 Do ths by building a single (non-empty) vector of arguments and
10804 building the expression from those elements. */
10807 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10810 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10811 if (pack
== error_mark_node
)
10812 return error_mark_node
;
10813 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10814 if (init
== error_mark_node
)
10815 return error_mark_node
;
10817 int n
= TREE_VEC_LENGTH (pack
);
10818 tree vec
= make_tree_vec (n
+ 1);
10819 for (int i
= 0; i
< n
; ++i
)
10820 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10821 TREE_VEC_ELT (vec
, n
) = init
;
10823 return expand_right_fold (t
, vec
, complain
);
10827 /* Substitute ARGS into T, which is an pack expansion
10828 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10829 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10830 (if only a partial substitution could be performed) or
10831 ERROR_MARK_NODE if there was an error. */
10833 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10837 tree pack
, packs
= NULL_TREE
;
10838 bool unsubstituted_packs
= false;
10841 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10842 bool need_local_specializations
= false;
10845 gcc_assert (PACK_EXPANSION_P (t
));
10846 pattern
= PACK_EXPANSION_PATTERN (t
);
10848 /* Add in any args remembered from an earlier partial instantiation. */
10849 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10851 levels
= TMPL_ARGS_DEPTH (args
);
10853 /* Determine the argument packs that will instantiate the parameter
10854 packs used in the expansion expression. While we're at it,
10855 compute the number of arguments to be expanded and make sure it
10857 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10858 pack
= TREE_CHAIN (pack
))
10860 tree parm_pack
= TREE_VALUE (pack
);
10861 tree arg_pack
= NULL_TREE
;
10862 tree orig_arg
= NULL_TREE
;
10865 if (TREE_CODE (parm_pack
) == BASES
)
10867 if (BASES_DIRECT (parm_pack
))
10868 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10869 args
, complain
, in_decl
, false));
10871 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10872 args
, complain
, in_decl
, false));
10874 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10876 /* We know we have correct local_specializations if this
10877 expansion is at function scope, or if we're dealing with a
10878 local parameter in a requires expression; for the latter,
10879 tsubst_requires_expr set it up appropriately. */
10880 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10881 arg_pack
= retrieve_local_specialization (parm_pack
);
10883 /* We can't rely on local_specializations for a parameter
10884 name used later in a function declaration (such as in a
10885 late-specified return type). Even if it exists, it might
10886 have the wrong value for a recursive call. */
10887 need_local_specializations
= true;
10891 /* This parameter pack was used in an unevaluated context. Just
10892 make a dummy decl, since it's only used for its type. */
10893 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10894 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10895 /* Partial instantiation of the parm_pack, we can't build
10896 up an argument pack yet. */
10897 arg_pack
= NULL_TREE
;
10899 arg_pack
= make_fnparm_pack (arg_pack
);
10902 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10903 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10907 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10909 if (level
<= levels
)
10910 arg_pack
= TMPL_ARG (args
, level
, idx
);
10913 orig_arg
= arg_pack
;
10914 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10915 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10917 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10918 /* This can only happen if we forget to expand an argument
10919 pack somewhere else. Just return an error, silently. */
10921 result
= make_tree_vec (1);
10922 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10929 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10931 /* Don't bother trying to do a partial substitution with
10932 incomplete packs; we'll try again after deduction. */
10933 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10938 else if (len
!= my_len
)
10940 if (!(complain
& tf_error
))
10941 /* Fail quietly. */;
10942 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10943 error ("mismatched argument pack lengths while expanding "
10947 error ("mismatched argument pack lengths while expanding "
10950 return error_mark_node
;
10953 /* Keep track of the parameter packs and their corresponding
10955 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10956 TREE_TYPE (packs
) = orig_arg
;
10960 /* We can't substitute for this parameter pack. We use a flag as
10961 well as the missing_level counter because function parameter
10962 packs don't have a level. */
10963 gcc_assert (processing_template_decl
);
10964 unsubstituted_packs
= true;
10968 /* If the expansion is just T..., return the matching argument pack, unless
10969 we need to call convert_from_reference on all the elements. This is an
10970 important optimization; see c++/68422. */
10971 if (!unsubstituted_packs
10972 && TREE_PURPOSE (packs
) == pattern
)
10974 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10975 /* Types need no adjustment, nor does sizeof..., and if we still have
10976 some pack expansion args we won't do anything yet. */
10977 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10978 || PACK_EXPANSION_SIZEOF_P (t
)
10979 || pack_expansion_args_count (args
))
10981 /* Also optimize expression pack expansions if we can tell that the
10982 elements won't have reference type. */
10983 tree type
= TREE_TYPE (pattern
);
10984 if (type
&& TREE_CODE (type
) != REFERENCE_TYPE
10985 && !PACK_EXPANSION_P (type
)
10986 && !WILDCARD_TYPE_P (type
))
10988 /* Otherwise use the normal path so we get convert_from_reference. */
10991 /* We cannot expand this expansion expression, because we don't have
10992 all of the argument packs we need. */
10993 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10995 /* We got some full packs, but we can't substitute them in until we
10996 have values for all the packs. So remember these until then. */
10998 t
= make_pack_expansion (pattern
);
10999 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
11002 else if (unsubstituted_packs
)
11004 /* There were no real arguments, we're just replacing a parameter
11005 pack with another version of itself. Substitute into the
11006 pattern and return a PACK_EXPANSION_*. The caller will need to
11008 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
11009 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11010 /*integral_constant_expression_p=*/false);
11012 t
= tsubst (pattern
, args
, complain
, in_decl
);
11013 t
= make_pack_expansion (t
);
11017 gcc_assert (len
>= 0);
11019 if (need_local_specializations
)
11021 /* We're in a late-specified return type, so create our own local
11022 specializations map; the current map is either NULL or (in the
11023 case of recursive unification) might have bindings that we don't
11024 want to use or alter. */
11025 saved_local_specializations
= local_specializations
;
11026 local_specializations
= new hash_map
<tree
, tree
>;
11029 /* For each argument in each argument pack, substitute into the
11031 result
= make_tree_vec (len
);
11032 tree elem_args
= copy_template_args (args
);
11033 for (i
= 0; i
< len
; ++i
)
11035 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
11037 elem_args
, complain
,
11039 TREE_VEC_ELT (result
, i
) = t
;
11040 if (t
== error_mark_node
)
11042 result
= error_mark_node
;
11047 /* Update ARGS to restore the substitution from parameter packs to
11048 their argument packs. */
11049 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
11051 tree parm
= TREE_PURPOSE (pack
);
11053 if (TREE_CODE (parm
) == PARM_DECL
11054 || TREE_CODE (parm
) == FIELD_DECL
)
11055 register_local_specialization (TREE_TYPE (pack
), parm
);
11060 if (TREE_VALUE (pack
) == NULL_TREE
)
11063 template_parm_level_and_index (parm
, &level
, &idx
);
11065 /* Update the corresponding argument. */
11066 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
11067 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
11070 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
11074 if (need_local_specializations
)
11076 delete local_specializations
;
11077 local_specializations
= saved_local_specializations
;
11083 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
11084 TMPL. We do this using DECL_PARM_INDEX, which should work even with
11085 parameter packs; all parms generated from a function parameter pack will
11086 have the same DECL_PARM_INDEX. */
11089 get_pattern_parm (tree parm
, tree tmpl
)
11091 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
11094 if (DECL_ARTIFICIAL (parm
))
11096 for (patparm
= DECL_ARGUMENTS (pattern
);
11097 patparm
; patparm
= DECL_CHAIN (patparm
))
11098 if (DECL_ARTIFICIAL (patparm
)
11099 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11104 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11105 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11106 gcc_assert (DECL_PARM_INDEX (patparm
)
11107 == DECL_PARM_INDEX (parm
));
11113 /* Make an argument pack out of the TREE_VEC VEC. */
11116 make_argument_pack (tree vec
)
11119 tree elt
= TREE_VEC_ELT (vec
, 0);
11121 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11124 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11125 TREE_TYPE (pack
) = TREE_TYPE (elt
);
11126 TREE_CONSTANT (pack
) = 1;
11128 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11132 /* Return an exact copy of template args T that can be modified
11136 copy_template_args (tree t
)
11138 if (t
== error_mark_node
)
11141 int len
= TREE_VEC_LENGTH (t
);
11142 tree new_vec
= make_tree_vec (len
);
11144 for (int i
= 0; i
< len
; ++i
)
11146 tree elt
= TREE_VEC_ELT (t
, i
);
11147 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
11148 elt
= copy_template_args (elt
);
11149 TREE_VEC_ELT (new_vec
, i
) = elt
;
11152 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
11153 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
11158 /* Substitute ARGS into the vector or list of template arguments T. */
11161 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11164 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11167 if (t
== error_mark_node
)
11168 return error_mark_node
;
11170 len
= TREE_VEC_LENGTH (t
);
11171 elts
= XALLOCAVEC (tree
, len
);
11173 for (i
= 0; i
< len
; i
++)
11175 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11178 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11179 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11180 else if (PACK_EXPANSION_P (orig_arg
))
11182 /* Substitute into an expansion expression. */
11183 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11185 if (TREE_CODE (new_arg
) == TREE_VEC
)
11186 /* Add to the expanded length adjustment the number of
11187 expanded arguments. We subtract one from this
11188 measurement, because the argument pack expression
11189 itself is already counted as 1 in
11190 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11191 the argument pack is empty. */
11192 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11194 else if (ARGUMENT_PACK_P (orig_arg
))
11196 /* Substitute into each of the arguments. */
11197 new_arg
= TYPE_P (orig_arg
)
11198 ? cxx_make_type (TREE_CODE (orig_arg
))
11199 : make_node (TREE_CODE (orig_arg
));
11201 SET_ARGUMENT_PACK_ARGS (
11203 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11204 args
, complain
, in_decl
));
11206 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11207 new_arg
= error_mark_node
;
11209 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11210 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11211 complain
, in_decl
);
11212 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11214 if (TREE_TYPE (new_arg
) == error_mark_node
)
11215 new_arg
= error_mark_node
;
11219 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11221 if (new_arg
== error_mark_node
)
11222 return error_mark_node
;
11225 if (new_arg
!= orig_arg
)
11232 /* Make space for the expanded arguments coming from template
11234 t
= make_tree_vec (len
+ expanded_len_adjust
);
11235 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11236 arguments for a member template.
11237 In that case each TREE_VEC in ORIG_T represents a level of template
11238 arguments, and ORIG_T won't carry any non defaulted argument count.
11239 It will rather be the nested TREE_VECs that will carry one.
11240 In other words, ORIG_T carries a non defaulted argument count only
11241 if it doesn't contain any nested TREE_VEC. */
11242 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11244 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11245 count
+= expanded_len_adjust
;
11246 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11248 for (i
= 0, out
= 0; i
< len
; i
++)
11250 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11251 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11252 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11256 /* Now expand the template argument pack "in place". */
11257 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11258 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11262 TREE_VEC_ELT (t
, out
) = elts
[i
];
11270 /* Return the result of substituting ARGS into the template parameters
11271 given by PARMS. If there are m levels of ARGS and m + n levels of
11272 PARMS, then the result will contain n levels of PARMS. For
11273 example, if PARMS is `template <class T> template <class U>
11274 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11275 result will be `template <int*, double, class V>'. */
11278 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11280 tree r
= NULL_TREE
;
11283 /* When substituting into a template, we must set
11284 PROCESSING_TEMPLATE_DECL as the template parameters may be
11285 dependent if they are based on one-another, and the dependency
11286 predicates are short-circuit outside of templates. */
11287 ++processing_template_decl
;
11289 for (new_parms
= &r
;
11290 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11291 new_parms
= &(TREE_CHAIN (*new_parms
)),
11292 parms
= TREE_CHAIN (parms
))
11295 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11298 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11302 if (parms
== error_mark_node
)
11305 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11307 if (tuple
== error_mark_node
)
11310 TREE_VEC_ELT (new_vec
, i
) =
11311 tsubst_template_parm (tuple
, args
, complain
);
11315 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11316 - TMPL_ARGS_DEPTH (args
)),
11317 new_vec
, NULL_TREE
);
11320 --processing_template_decl
;
11325 /* Return the result of substituting ARGS into one template parameter
11326 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11327 parameter and which TREE_PURPOSE is the default argument of the
11328 template parameter. */
11331 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11333 tree default_value
, parm_decl
;
11335 if (args
== NULL_TREE
11337 || t
== error_mark_node
)
11340 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11342 default_value
= TREE_PURPOSE (t
);
11343 parm_decl
= TREE_VALUE (t
);
11345 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11346 if (TREE_CODE (parm_decl
) == PARM_DECL
11347 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11348 parm_decl
= error_mark_node
;
11349 default_value
= tsubst_template_arg (default_value
, args
,
11350 complain
, NULL_TREE
);
11352 return build_tree_list (default_value
, parm_decl
);
11355 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11356 type T. If T is not an aggregate or enumeration type, it is
11357 handled as if by tsubst. IN_DECL is as for tsubst. If
11358 ENTERING_SCOPE is nonzero, T is the context for a template which
11359 we are presently tsubst'ing. Return the substituted value. */
11362 tsubst_aggr_type (tree t
,
11364 tsubst_flags_t complain
,
11366 int entering_scope
)
11368 if (t
== NULL_TREE
)
11371 switch (TREE_CODE (t
))
11374 if (TYPE_PTRMEMFUNC_P (t
))
11375 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11377 /* Else fall through. */
11378 case ENUMERAL_TYPE
:
11380 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11385 int saved_unevaluated_operand
;
11386 int saved_inhibit_evaluation_warnings
;
11388 /* In "sizeof(X<I>)" we need to evaluate "I". */
11389 saved_unevaluated_operand
= cp_unevaluated_operand
;
11390 cp_unevaluated_operand
= 0;
11391 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11392 c_inhibit_evaluation_warnings
= 0;
11394 /* First, determine the context for the type we are looking
11396 context
= TYPE_CONTEXT (t
);
11397 if (context
&& TYPE_P (context
))
11399 context
= tsubst_aggr_type (context
, args
, complain
,
11400 in_decl
, /*entering_scope=*/1);
11401 /* If context is a nested class inside a class template,
11402 it may still need to be instantiated (c++/33959). */
11403 context
= complete_type (context
);
11406 /* Then, figure out what arguments are appropriate for the
11407 type we are trying to find. For example, given:
11409 template <class T> struct S;
11410 template <class T, class U> void f(T, U) { S<U> su; }
11412 and supposing that we are instantiating f<int, double>,
11413 then our ARGS will be {int, double}, but, when looking up
11414 S we only want {double}. */
11415 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11416 complain
, in_decl
);
11417 if (argvec
== error_mark_node
)
11418 r
= error_mark_node
;
11421 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11422 entering_scope
, complain
);
11423 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11426 cp_unevaluated_operand
= saved_unevaluated_operand
;
11427 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11432 /* This is not a template type, so there's nothing to do. */
11436 return tsubst (t
, args
, complain
, in_decl
);
11440 /* Substitute into the default argument ARG (a default argument for
11441 FN), which has the indicated TYPE. */
11444 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11446 tree saved_class_ptr
= NULL_TREE
;
11447 tree saved_class_ref
= NULL_TREE
;
11448 int errs
= errorcount
+ sorrycount
;
11450 /* This can happen in invalid code. */
11451 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11454 /* This default argument came from a template. Instantiate the
11455 default argument here, not in tsubst. In the case of
11464 we must be careful to do name lookup in the scope of S<T>,
11465 rather than in the current class. */
11466 push_access_scope (fn
);
11467 /* The "this" pointer is not valid in a default argument. */
11470 saved_class_ptr
= current_class_ptr
;
11471 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11472 saved_class_ref
= current_class_ref
;
11473 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11476 push_deferring_access_checks(dk_no_deferred
);
11477 /* The default argument expression may cause implicitly defined
11478 member functions to be synthesized, which will result in garbage
11479 collection. We must treat this situation as if we were within
11480 the body of function so as to avoid collecting live data on the
11483 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11484 complain
, NULL_TREE
,
11485 /*integral_constant_expression_p=*/false);
11487 pop_deferring_access_checks();
11489 /* Restore the "this" pointer. */
11492 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11493 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11496 if (errorcount
+sorrycount
> errs
11497 && (complain
& tf_warning_or_error
))
11498 inform (input_location
,
11499 " when instantiating default argument for call to %D", fn
);
11501 /* Make sure the default argument is reasonable. */
11502 arg
= check_default_argument (type
, arg
, complain
);
11504 pop_access_scope (fn
);
11509 /* Substitute into all the default arguments for FN. */
11512 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11517 tmpl_args
= DECL_TI_ARGS (fn
);
11519 /* If this function is not yet instantiated, we certainly don't need
11520 its default arguments. */
11521 if (uses_template_parms (tmpl_args
))
11523 /* Don't do this again for clones. */
11524 if (DECL_CLONED_FUNCTION_P (fn
))
11527 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11529 arg
= TREE_CHAIN (arg
))
11530 if (TREE_PURPOSE (arg
))
11531 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11533 TREE_PURPOSE (arg
),
11537 /* Substitute the ARGS into the T, which is a _DECL. Return the
11538 result of the substitution. Issue error and warning messages under
11539 control of COMPLAIN. */
11542 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11544 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11545 location_t saved_loc
;
11546 tree r
= NULL_TREE
;
11548 hashval_t hash
= 0;
11550 /* Set the filename and linenumber to improve error-reporting. */
11551 saved_loc
= input_location
;
11552 input_location
= DECL_SOURCE_LOCATION (t
);
11554 switch (TREE_CODE (t
))
11556 case TEMPLATE_DECL
:
11558 /* We can get here when processing a member function template,
11559 member class template, or template template parameter. */
11560 tree decl
= DECL_TEMPLATE_RESULT (t
);
11565 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11567 /* Template template parameter is treated here. */
11568 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11569 if (new_type
== error_mark_node
)
11570 r
= error_mark_node
;
11571 /* If we get a real template back, return it. This can happen in
11572 the context of most_specialized_partial_spec. */
11573 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11576 /* The new TEMPLATE_DECL was built in
11577 reduce_template_parm_level. */
11578 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11582 /* We might already have an instance of this template.
11583 The ARGS are for the surrounding class type, so the
11584 full args contain the tsubst'd args for the context,
11585 plus the innermost args from the template decl. */
11586 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11587 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11588 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11589 /* Because this is a template, the arguments will still be
11590 dependent, even after substitution. If
11591 PROCESSING_TEMPLATE_DECL is not set, the dependency
11592 predicates will short-circuit. */
11593 ++processing_template_decl
;
11594 full_args
= tsubst_template_args (tmpl_args
, args
,
11595 complain
, in_decl
);
11596 --processing_template_decl
;
11597 if (full_args
== error_mark_node
)
11598 RETURN (error_mark_node
);
11600 /* If this is a default template template argument,
11601 tsubst might not have changed anything. */
11602 if (full_args
== tmpl_args
)
11605 hash
= hash_tmpl_and_args (t
, full_args
);
11606 spec
= retrieve_specialization (t
, full_args
, hash
);
11607 if (spec
!= NULL_TREE
)
11613 /* Make a new template decl. It will be similar to the
11614 original, but will record the current template arguments.
11615 We also create a new function declaration, which is just
11616 like the old one, but points to this new template, rather
11617 than the old one. */
11619 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11620 DECL_CHAIN (r
) = NULL_TREE
;
11622 // Build new template info linking to the original template decl.
11623 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11625 if (TREE_CODE (decl
) == TYPE_DECL
11626 && !TYPE_DECL_ALIAS_P (decl
))
11629 ++processing_template_decl
;
11630 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11631 --processing_template_decl
;
11632 if (new_type
== error_mark_node
)
11633 RETURN (error_mark_node
);
11635 TREE_TYPE (r
) = new_type
;
11636 /* For a partial specialization, we need to keep pointing to
11637 the primary template. */
11638 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11639 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11640 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11641 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11642 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11647 ++processing_template_decl
;
11648 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11649 --processing_template_decl
;
11650 if (new_decl
== error_mark_node
)
11651 RETURN (error_mark_node
);
11653 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11654 DECL_TI_TEMPLATE (new_decl
) = r
;
11655 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11656 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11657 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11660 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11661 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11662 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11664 /* The template parameters for this new template are all the
11665 template parameters for the old template, except the
11666 outermost level of parameters. */
11667 DECL_TEMPLATE_PARMS (r
)
11668 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11671 if (PRIMARY_TEMPLATE_P (t
))
11672 DECL_PRIMARY_TEMPLATE (r
) = r
;
11674 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11675 /* Record this non-type partial instantiation. */
11676 register_specialization (r
, t
,
11677 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11682 case FUNCTION_DECL
:
11685 tree argvec
= NULL_TREE
;
11693 /* Nobody should be tsubst'ing into non-template functions. */
11694 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11696 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11700 /* If T is not dependent, just return it. */
11701 if (!uses_template_parms (DECL_TI_ARGS (t
)))
11704 /* Calculate the most general template of which R is a
11705 specialization, and the complete set of arguments used to
11707 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11708 argvec
= tsubst_template_args (DECL_TI_ARGS
11709 (DECL_TEMPLATE_RESULT
11710 (DECL_TI_TEMPLATE (t
))),
11711 args
, complain
, in_decl
);
11712 if (argvec
== error_mark_node
)
11713 RETURN (error_mark_node
);
11715 /* Check to see if we already have this specialization. */
11716 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11717 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11725 /* We can see more levels of arguments than parameters if
11726 there was a specialization of a member template, like
11729 template <class T> struct S { template <class U> void f(); }
11730 template <> template <class U> void S<int>::f(U);
11732 Here, we'll be substituting into the specialization,
11733 because that's where we can find the code we actually
11734 want to generate, but we'll have enough arguments for
11735 the most general template.
11737 We also deal with the peculiar case:
11739 template <class T> struct S {
11740 template <class U> friend void f();
11742 template <class U> void f() {}
11744 template void f<double>();
11746 Here, the ARGS for the instantiation of will be {int,
11747 double}. But, we only need as many ARGS as there are
11748 levels of template parameters in CODE_PATTERN. We are
11749 careful not to get fooled into reducing the ARGS in
11752 template <class T> struct S { template <class U> void f(U); }
11753 template <class T> template <> void S<T>::f(int) {}
11755 which we can spot because the pattern will be a
11756 specialization in this case. */
11757 args_depth
= TMPL_ARGS_DEPTH (args
);
11759 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11760 if (args_depth
> parms_depth
11761 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11762 args
= get_innermost_template_args (args
, parms_depth
);
11766 /* This special case arises when we have something like this:
11768 template <class T> struct S {
11769 friend void f<int>(int, double);
11772 Here, the DECL_TI_TEMPLATE for the friend declaration
11773 will be an IDENTIFIER_NODE. We are being called from
11774 tsubst_friend_function, and we want only to create a
11775 new decl (R) with appropriate types so that we can call
11776 determine_specialization. */
11777 gen_tmpl
= NULL_TREE
;
11780 if (DECL_CLASS_SCOPE_P (t
))
11782 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11786 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11787 complain
, t
, /*entering_scope=*/1);
11792 ctx
= DECL_CONTEXT (t
);
11794 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11795 if (type
== error_mark_node
)
11796 RETURN (error_mark_node
);
11798 /* If we hit excessive deduction depth, the type is bogus even if
11799 it isn't error_mark_node, so don't build a decl. */
11800 if (excessive_deduction_depth
)
11801 RETURN (error_mark_node
);
11803 /* We do NOT check for matching decls pushed separately at this
11804 point, as they may not represent instantiations of this
11805 template, and in any case are considered separate under the
11808 DECL_USE_TEMPLATE (r
) = 0;
11809 TREE_TYPE (r
) = type
;
11810 /* Clear out the mangled name and RTL for the instantiation. */
11811 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11812 SET_DECL_RTL (r
, NULL
);
11813 /* Leave DECL_INITIAL set on deleted instantiations. */
11814 if (!DECL_DELETED_FN (r
))
11815 DECL_INITIAL (r
) = NULL_TREE
;
11816 DECL_CONTEXT (r
) = ctx
;
11818 /* OpenMP UDRs have the only argument a reference to the declared
11819 type. We want to diagnose if the declared type is a reference,
11820 which is invalid, but as references to references are usually
11821 quietly merged, diagnose it here. */
11822 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11825 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11826 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11827 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11828 error_at (DECL_SOURCE_LOCATION (t
),
11829 "reference type %qT in "
11830 "%<#pragma omp declare reduction%>", argtype
);
11831 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11832 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11836 if (member
&& DECL_CONV_FN_P (r
))
11837 /* Type-conversion operator. Reconstruct the name, in
11838 case it's the name of one of the template's parameters. */
11839 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11841 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11843 DECL_RESULT (r
) = NULL_TREE
;
11845 TREE_STATIC (r
) = 0;
11846 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11847 DECL_EXTERNAL (r
) = 1;
11848 /* If this is an instantiation of a function with internal
11849 linkage, we already know what object file linkage will be
11850 assigned to the instantiation. */
11851 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11852 DECL_DEFER_OUTPUT (r
) = 0;
11853 DECL_CHAIN (r
) = NULL_TREE
;
11854 DECL_PENDING_INLINE_INFO (r
) = 0;
11855 DECL_PENDING_INLINE_P (r
) = 0;
11856 DECL_SAVED_TREE (r
) = NULL_TREE
;
11857 DECL_STRUCT_FUNCTION (r
) = NULL
;
11859 /* We'll re-clone as appropriate in instantiate_template. */
11860 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11862 /* If we aren't complaining now, return on error before we register
11863 the specialization so that we'll complain eventually. */
11864 if ((complain
& tf_error
) == 0
11865 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11866 && !grok_op_properties (r
, /*complain=*/false))
11867 RETURN (error_mark_node
);
11869 /* When instantiating a constrained member, substitute
11870 into the constraints to create a new constraint. */
11871 if (tree ci
= get_constraints (t
))
11874 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11875 set_constraints (r
, ci
);
11878 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11879 this in the special friend case mentioned above where
11880 GEN_TMPL is NULL. */
11883 DECL_TEMPLATE_INFO (r
)
11884 = build_template_info (gen_tmpl
, argvec
);
11885 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11888 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11890 /* We instantiated this while substituting into
11891 the type earlier (template/friend54.C). */
11894 /* We're not supposed to instantiate default arguments
11895 until they are called, for a template. But, for a
11898 template <class T> void f ()
11899 { extern void g(int i = T()); }
11901 we should do the substitution when the template is
11902 instantiated. We handle the member function case in
11903 instantiate_class_template since the default arguments
11904 might refer to other members of the class. */
11906 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11907 && !uses_template_parms (argvec
))
11908 tsubst_default_arguments (r
, complain
);
11911 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11913 /* Copy the list of befriending classes. */
11914 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11916 friends
= &TREE_CHAIN (*friends
))
11918 *friends
= copy_node (*friends
);
11919 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11924 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11926 maybe_retrofit_in_chrg (r
);
11927 if (DECL_CONSTRUCTOR_P (r
))
11928 grok_ctor_properties (ctx
, r
);
11929 if (DECL_INHERITED_CTOR_BASE (r
))
11930 deduce_inheriting_ctor (r
);
11931 /* If this is an instantiation of a member template, clone it.
11932 If it isn't, that'll be handled by
11933 clone_constructors_and_destructors. */
11934 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11935 clone_function_decl (r
, /*update_method_vec_p=*/0);
11937 else if ((complain
& tf_error
) != 0
11938 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11939 && !grok_op_properties (r
, /*complain=*/true))
11940 RETURN (error_mark_node
);
11942 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11943 SET_DECL_FRIEND_CONTEXT (r
,
11944 tsubst (DECL_FRIEND_CONTEXT (t
),
11945 args
, complain
, in_decl
));
11947 /* Possibly limit visibility based on template args. */
11948 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11949 if (DECL_VISIBILITY_SPECIFIED (t
))
11951 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11952 DECL_ATTRIBUTES (r
)
11953 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11955 determine_visibility (r
);
11956 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11957 && !processing_template_decl
)
11958 defaulted_late_check (r
);
11960 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11961 args
, complain
, in_decl
);
11967 tree type
= NULL_TREE
;
11969 tree expanded_types
= NULL_TREE
;
11970 tree prev_r
= NULL_TREE
;
11971 tree first_r
= NULL_TREE
;
11973 if (DECL_PACK_P (t
))
11975 /* If there is a local specialization that isn't a
11976 parameter pack, it means that we're doing a "simple"
11977 substitution from inside tsubst_pack_expansion. Just
11978 return the local specialization (which will be a single
11980 tree spec
= retrieve_local_specialization (t
);
11982 && TREE_CODE (spec
) == PARM_DECL
11983 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11986 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11987 the parameters in this function parameter pack. */
11988 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11989 complain
, in_decl
);
11990 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11992 len
= TREE_VEC_LENGTH (expanded_types
);
11994 /* Zero-length parameter packs are boring. Just substitute
11997 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
12002 /* All we did was update the type. Make a note of that. */
12003 type
= expanded_types
;
12004 expanded_types
= NULL_TREE
;
12008 /* Loop through all of the parameters we'll build. When T is
12009 a function parameter pack, LEN is the number of expanded
12010 types in EXPANDED_TYPES; otherwise, LEN is 1. */
12012 for (i
= 0; i
< len
; ++i
)
12016 if (DECL_TEMPLATE_PARM_P (t
))
12017 SET_DECL_TEMPLATE_PARM_P (r
);
12019 if (expanded_types
)
12020 /* We're on the Ith parameter of the function parameter
12023 /* Get the Ith type. */
12024 type
= TREE_VEC_ELT (expanded_types
, i
);
12026 /* Rename the parameter to include the index. */
12028 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
12031 /* We're dealing with a normal parameter. */
12032 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12034 type
= type_decays_to (type
);
12035 TREE_TYPE (r
) = type
;
12036 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12038 if (DECL_INITIAL (r
))
12040 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
12041 DECL_INITIAL (r
) = TREE_TYPE (r
);
12043 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
12044 complain
, in_decl
);
12047 DECL_CONTEXT (r
) = NULL_TREE
;
12049 if (!DECL_TEMPLATE_PARM_P (r
))
12050 DECL_ARG_TYPE (r
) = type_passed_as (type
);
12052 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12053 args
, complain
, in_decl
);
12055 /* Keep track of the first new parameter we
12056 generate. That's what will be returned to the
12061 /* Build a proper chain of parameters when substituting
12062 into a function parameter pack. */
12064 DECL_CHAIN (prev_r
) = r
;
12067 /* If cp_unevaluated_operand is set, we're just looking for a
12068 single dummy parameter, so don't keep going. */
12069 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
12070 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
12071 complain
, DECL_CHAIN (t
));
12073 /* FIRST_R contains the start of the chain we've built. */
12080 tree type
= NULL_TREE
;
12081 tree vec
= NULL_TREE
;
12082 tree expanded_types
= NULL_TREE
;
12085 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12087 /* This field is a lambda capture pack. Return a TREE_VEC of
12088 the expanded fields to instantiate_class_template_1 and
12089 store them in the specializations hash table as a
12090 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
12091 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
12092 complain
, in_decl
);
12093 if (TREE_CODE (expanded_types
) == TREE_VEC
)
12095 len
= TREE_VEC_LENGTH (expanded_types
);
12096 vec
= make_tree_vec (len
);
12100 /* All we did was update the type. Make a note of that. */
12101 type
= expanded_types
;
12102 expanded_types
= NULL_TREE
;
12106 for (int i
= 0; i
< len
; ++i
)
12109 if (expanded_types
)
12111 type
= TREE_VEC_ELT (expanded_types
, i
);
12113 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
12116 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12118 if (type
== error_mark_node
)
12119 RETURN (error_mark_node
);
12120 TREE_TYPE (r
) = type
;
12121 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12123 if (DECL_C_BIT_FIELD (r
))
12124 /* For bit-fields, DECL_INITIAL gives the number of bits. For
12125 non-bit-fields DECL_INITIAL is a non-static data member
12126 initializer, which gets deferred instantiation. */
12128 = tsubst_expr (DECL_INITIAL (t
), args
,
12130 /*integral_constant_expression_p=*/true);
12131 else if (DECL_INITIAL (t
))
12133 /* Set up DECL_TEMPLATE_INFO so that we can get at the
12134 NSDMI in perform_member_init. Still set DECL_INITIAL
12135 so that we know there is one. */
12136 DECL_INITIAL (r
) = void_node
;
12137 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
12138 retrofit_lang_decl (r
);
12139 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12141 /* We don't have to set DECL_CONTEXT here; it is set by
12142 finish_member_declaration. */
12143 DECL_CHAIN (r
) = NULL_TREE
;
12145 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12146 args
, complain
, in_decl
);
12149 TREE_VEC_ELT (vec
, i
) = r
;
12155 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12156 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12157 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12158 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12159 TREE_TYPE (pack
) = tpack
;
12160 register_specialization (pack
, t
, args
, false, 0);
12166 /* We reach here only for member using decls. We also need to check
12167 uses_template_parms because DECL_DEPENDENT_P is not set for a
12168 using-declaration that designates a member of the current
12169 instantiation (c++/53549). */
12170 if (DECL_DEPENDENT_P (t
)
12171 || uses_template_parms (USING_DECL_SCOPE (t
)))
12173 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12174 complain
, in_decl
);
12175 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12176 r
= do_class_using_decl (inst_scope
, name
);
12178 r
= error_mark_node
;
12181 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12182 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12188 DECL_CHAIN (r
) = NULL_TREE
;
12195 tree argvec
= NULL_TREE
;
12196 tree gen_tmpl
= NULL_TREE
;
12198 tree tmpl
= NULL_TREE
;
12200 tree type
= NULL_TREE
;
12203 if (TREE_TYPE (t
) == error_mark_node
)
12204 RETURN (error_mark_node
);
12206 if (TREE_CODE (t
) == TYPE_DECL
12207 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12209 /* If this is the canonical decl, we don't have to
12210 mess with instantiations, and often we can't (for
12211 typename, template type parms and such). Note that
12212 TYPE_NAME is not correct for the above test if
12213 we've copied the type for a typedef. */
12214 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12215 if (type
== error_mark_node
)
12216 RETURN (error_mark_node
);
12217 r
= TYPE_NAME (type
);
12221 /* Check to see if we already have the specialization we
12224 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12226 /* T is a static data member or namespace-scope entity.
12227 We have to substitute into namespace-scope variables
12228 (not just variable templates) because of cases like:
12230 template <class T> void f() { extern T t; }
12232 where the entity referenced is not known until
12233 instantiation time. */
12235 ctx
= DECL_CONTEXT (t
);
12236 if (DECL_CLASS_SCOPE_P (t
))
12238 ctx
= tsubst_aggr_type (ctx
, args
,
12240 in_decl
, /*entering_scope=*/1);
12241 /* If CTX is unchanged, then T is in fact the
12242 specialization we want. That situation occurs when
12243 referencing a static data member within in its own
12244 class. We can use pointer equality, rather than
12245 same_type_p, because DECL_CONTEXT is always
12247 if (ctx
== DECL_CONTEXT (t
)
12248 /* ... unless T is a member template; in which
12249 case our caller can be willing to create a
12250 specialization of that template represented
12252 && !(DECL_TI_TEMPLATE (t
)
12253 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12259 tmpl
= DECL_TI_TEMPLATE (t
);
12260 gen_tmpl
= most_general_template (tmpl
);
12261 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12262 if (argvec
!= error_mark_node
)
12263 argvec
= (coerce_innermost_template_parms
12264 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12265 argvec
, t
, complain
,
12266 /*all*/true, /*defarg*/true));
12267 if (argvec
== error_mark_node
)
12268 RETURN (error_mark_node
);
12269 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12270 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12275 /* A local variable. */
12277 /* Subsequent calls to pushdecl will fill this in. */
12279 /* Unless this is a reference to a static variable from an
12280 enclosing function, in which case we need to fill it in now. */
12281 if (TREE_STATIC (t
))
12283 tree fn
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12284 if (fn
!= current_function_decl
)
12287 spec
= retrieve_local_specialization (t
);
12289 /* If we already have the specialization we need, there is
12290 nothing more to do. */
12297 /* Create a new node for the specialization we need. */
12299 if (type
== NULL_TREE
)
12301 if (is_typedef_decl (t
))
12302 type
= DECL_ORIGINAL_TYPE (t
);
12304 type
= TREE_TYPE (t
);
12306 && VAR_HAD_UNKNOWN_BOUND (t
)
12307 && type
!= error_mark_node
)
12308 type
= strip_array_domain (type
);
12309 type
= tsubst (type
, args
, complain
, in_decl
);
12313 /* Even if the original location is out of scope, the
12314 newly substituted one is not. */
12315 DECL_DEAD_FOR_LOCAL (r
) = 0;
12316 DECL_INITIALIZED_P (r
) = 0;
12317 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12318 if (type
== error_mark_node
)
12319 RETURN (error_mark_node
);
12320 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12322 /* It may seem that this case cannot occur, since:
12327 declares a function, not a variable. However:
12330 template <typename T> void g() { T t; }
12331 template void g<f>();
12333 is an attempt to declare a variable with function
12335 error ("variable %qD has function type",
12336 /* R is not yet sufficiently initialized, so we
12337 just use its name. */
12339 RETURN (error_mark_node
);
12341 type
= complete_type (type
);
12342 /* Wait until cp_finish_decl to set this again, to handle
12343 circular dependency (template/instantiate6.C). */
12344 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12345 type
= check_var_type (DECL_NAME (r
), type
);
12347 if (DECL_HAS_VALUE_EXPR_P (t
))
12349 tree ve
= DECL_VALUE_EXPR (t
);
12350 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12351 /*constant_expression_p=*/false);
12352 if (REFERENCE_REF_P (ve
))
12354 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12355 ve
= TREE_OPERAND (ve
, 0);
12357 SET_DECL_VALUE_EXPR (r
, ve
);
12359 if (CP_DECL_THREAD_LOCAL_P (r
)
12360 && !processing_template_decl
)
12361 set_decl_tls_model (r
, decl_default_tls_model (r
));
12363 else if (DECL_SELF_REFERENCE_P (t
))
12364 SET_DECL_SELF_REFERENCE_P (r
);
12365 TREE_TYPE (r
) = type
;
12366 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12367 DECL_CONTEXT (r
) = ctx
;
12368 /* Clear out the mangled name and RTL for the instantiation. */
12369 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12370 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12371 SET_DECL_RTL (r
, NULL
);
12372 /* The initializer must not be expanded until it is required;
12373 see [temp.inst]. */
12374 DECL_INITIAL (r
) = NULL_TREE
;
12376 DECL_MODE (r
) = VOIDmode
;
12377 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12378 SET_DECL_RTL (r
, NULL
);
12379 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12382 /* Possibly limit visibility based on template args. */
12383 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12384 if (DECL_VISIBILITY_SPECIFIED (t
))
12386 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12387 DECL_ATTRIBUTES (r
)
12388 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12390 determine_visibility (r
);
12395 /* A static data member declaration is always marked
12396 external when it is declared in-class, even if an
12397 initializer is present. We mimic the non-template
12398 processing here. */
12399 DECL_EXTERNAL (r
) = 1;
12400 if (DECL_NAMESPACE_SCOPE_P (t
))
12401 DECL_NOT_REALLY_EXTERN (r
) = 1;
12403 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12404 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12405 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12409 if (DECL_LANG_SPECIFIC (r
))
12410 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
12411 if (!cp_unevaluated_operand
)
12412 register_local_specialization (r
, t
);
12415 DECL_CHAIN (r
) = NULL_TREE
;
12417 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12419 args
, complain
, in_decl
);
12421 /* Preserve a typedef that names a type. */
12422 if (is_typedef_decl (r
))
12424 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12425 set_underlying_type (r
);
12426 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12427 /* An alias template specialization can be dependent
12428 even if its underlying type is not. */
12429 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12432 layout_decl (r
, 0);
12437 gcc_unreachable ();
12442 /* Restore the file and line information. */
12443 input_location
= saved_loc
;
12448 /* Substitute into the ARG_TYPES of a function type.
12449 If END is a TREE_CHAIN, leave it and any following types
12453 tsubst_arg_types (tree arg_types
,
12456 tsubst_flags_t complain
,
12459 tree remaining_arg_types
;
12460 tree type
= NULL_TREE
;
12462 tree expanded_args
= NULL_TREE
;
12465 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12468 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12469 args
, end
, complain
, in_decl
);
12470 if (remaining_arg_types
== error_mark_node
)
12471 return error_mark_node
;
12473 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12475 /* For a pack expansion, perform substitution on the
12476 entire expression. Later on, we'll handle the arguments
12478 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12479 args
, complain
, in_decl
);
12481 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12482 /* So that we'll spin through the parameters, one by one. */
12483 i
= TREE_VEC_LENGTH (expanded_args
);
12486 /* We only partially substituted into the parameter
12487 pack. Our type is TYPE_PACK_EXPANSION. */
12488 type
= expanded_args
;
12489 expanded_args
= NULL_TREE
;
12497 type
= TREE_VEC_ELT (expanded_args
, i
);
12499 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12501 if (type
== error_mark_node
)
12502 return error_mark_node
;
12503 if (VOID_TYPE_P (type
))
12505 if (complain
& tf_error
)
12507 error ("invalid parameter type %qT", type
);
12509 error ("in declaration %q+D", in_decl
);
12511 return error_mark_node
;
12514 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12515 return error_mark_node
;
12517 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12518 top-level qualifiers as required. */
12519 type
= cv_unqualified (type_decays_to (type
));
12521 /* We do not substitute into default arguments here. The standard
12522 mandates that they be instantiated only when needed, which is
12523 done in build_over_call. */
12524 default_arg
= TREE_PURPOSE (arg_types
);
12526 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12528 /* We've instantiated a template before its default arguments
12529 have been parsed. This can happen for a nested template
12530 class, and is not an error unless we require the default
12531 argument in a call of this function. */
12532 remaining_arg_types
=
12533 tree_cons (default_arg
, type
, remaining_arg_types
);
12534 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12537 remaining_arg_types
=
12538 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12541 return remaining_arg_types
;
12544 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12545 *not* handle the exception-specification for FNTYPE, because the
12546 initial substitution of explicitly provided template parameters
12547 during argument deduction forbids substitution into the
12548 exception-specification:
12552 All references in the function type of the function template to the
12553 corresponding template parameters are replaced by the specified tem-
12554 plate argument values. If a substitution in a template parameter or
12555 in the function type of the function template results in an invalid
12556 type, type deduction fails. [Note: The equivalent substitution in
12557 exception specifications is done only when the function is instanti-
12558 ated, at which point a program is ill-formed if the substitution
12559 results in an invalid type.] */
12562 tsubst_function_type (tree t
,
12564 tsubst_flags_t complain
,
12568 tree arg_types
= NULL_TREE
;
12571 /* The TYPE_CONTEXT is not used for function/method types. */
12572 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12574 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12576 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12578 if (late_return_type_p
)
12580 /* Substitute the argument types. */
12581 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12582 complain
, in_decl
);
12583 if (arg_types
== error_mark_node
)
12584 return error_mark_node
;
12586 tree save_ccp
= current_class_ptr
;
12587 tree save_ccr
= current_class_ref
;
12588 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12589 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12590 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12593 /* DR 1207: 'this' is in scope in the trailing return type. */
12594 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12597 /* Substitute the return type. */
12598 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12602 current_class_ptr
= save_ccp
;
12603 current_class_ref
= save_ccr
;
12607 /* Substitute the return type. */
12608 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12610 if (return_type
== error_mark_node
)
12611 return error_mark_node
;
12612 /* DR 486 clarifies that creation of a function type with an
12613 invalid return type is a deduction failure. */
12614 if (TREE_CODE (return_type
) == ARRAY_TYPE
12615 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12617 if (complain
& tf_error
)
12619 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12620 error ("function returning an array");
12622 error ("function returning a function");
12624 return error_mark_node
;
12627 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12628 return error_mark_node
;
12630 if (!late_return_type_p
)
12632 /* Substitute the argument types. */
12633 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12634 complain
, in_decl
);
12635 if (arg_types
== error_mark_node
)
12636 return error_mark_node
;
12639 /* Construct a new type node and return it. */
12640 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12642 fntype
= build_function_type (return_type
, arg_types
);
12643 fntype
= apply_memfn_quals (fntype
,
12644 type_memfn_quals (t
),
12645 type_memfn_rqual (t
));
12649 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12650 /* Don't pick up extra function qualifiers from the basetype. */
12651 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12652 if (! MAYBE_CLASS_TYPE_P (r
))
12656 Type deduction may fail for any of the following
12659 -- Attempting to create "pointer to member of T" when T
12660 is not a class type. */
12661 if (complain
& tf_error
)
12662 error ("creating pointer to member function of non-class type %qT",
12664 return error_mark_node
;
12667 fntype
= build_method_type_directly (r
, return_type
,
12668 TREE_CHAIN (arg_types
));
12669 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12671 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12673 if (late_return_type_p
)
12674 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12679 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12680 ARGS into that specification, and return the substituted
12681 specification. If there is no specification, return NULL_TREE. */
12684 tsubst_exception_specification (tree fntype
,
12686 tsubst_flags_t complain
,
12693 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12694 new_specs
= NULL_TREE
;
12695 if (specs
&& TREE_PURPOSE (specs
))
12697 /* A noexcept-specifier. */
12698 tree expr
= TREE_PURPOSE (specs
);
12699 if (TREE_CODE (expr
) == INTEGER_CST
)
12703 /* Defer instantiation of noexcept-specifiers to avoid
12704 excessive instantiations (c++/49107). */
12705 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12706 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12708 /* We already partially instantiated this member template,
12709 so combine the new args with the old. */
12710 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12711 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12712 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12713 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12717 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12718 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12722 new_specs
= tsubst_copy_and_build
12723 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12724 /*integral_constant_expression_p=*/true);
12725 new_specs
= build_noexcept_spec (new_specs
, complain
);
12729 if (! TREE_VALUE (specs
))
12736 tree expanded_specs
= NULL_TREE
;
12738 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12740 /* Expand the pack expansion type. */
12741 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12745 if (expanded_specs
== error_mark_node
)
12746 return error_mark_node
;
12747 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12748 len
= TREE_VEC_LENGTH (expanded_specs
);
12751 /* We're substituting into a member template, so
12752 we got a TYPE_PACK_EXPANSION back. Add that
12753 expansion and move on. */
12754 gcc_assert (TREE_CODE (expanded_specs
)
12755 == TYPE_PACK_EXPANSION
);
12756 new_specs
= add_exception_specifier (new_specs
,
12759 specs
= TREE_CHAIN (specs
);
12764 for (i
= 0; i
< len
; ++i
)
12766 if (expanded_specs
)
12767 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12769 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12770 if (spec
== error_mark_node
)
12772 new_specs
= add_exception_specifier (new_specs
, spec
,
12776 specs
= TREE_CHAIN (specs
);
12782 /* Take the tree structure T and replace template parameters used
12783 therein with the argument vector ARGS. IN_DECL is an associated
12784 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12785 Issue error and warning messages under control of COMPLAIN. Note
12786 that we must be relatively non-tolerant of extensions here, in
12787 order to preserve conformance; if we allow substitutions that
12788 should not be allowed, we may allow argument deductions that should
12789 not succeed, and therefore report ambiguous overload situations
12790 where there are none. In theory, we could allow the substitution,
12791 but indicate that it should have failed, and allow our caller to
12792 make sure that the right thing happens, but we don't try to do this
12795 This function is used for dealing with types, decls and the like;
12796 for expressions, use tsubst_expr or tsubst_copy. */
12799 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12801 enum tree_code code
;
12802 tree type
, r
= NULL_TREE
;
12804 if (t
== NULL_TREE
|| t
== error_mark_node
12805 || t
== integer_type_node
12806 || t
== void_type_node
12807 || t
== char_type_node
12808 || t
== unknown_type_node
12809 || TREE_CODE (t
) == NAMESPACE_DECL
12810 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12814 return tsubst_decl (t
, args
, complain
);
12816 if (args
== NULL_TREE
)
12819 code
= TREE_CODE (t
);
12821 if (code
== IDENTIFIER_NODE
)
12822 type
= IDENTIFIER_TYPE_VALUE (t
);
12824 type
= TREE_TYPE (t
);
12826 gcc_assert (type
!= unknown_type_node
);
12828 /* Reuse typedefs. We need to do this to handle dependent attributes,
12829 such as attribute aligned. */
12831 && typedef_variant_p (t
))
12833 tree decl
= TYPE_NAME (t
);
12835 if (alias_template_specialization_p (t
))
12837 /* DECL represents an alias template and we want to
12839 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12840 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12841 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12843 else if (DECL_CLASS_SCOPE_P (decl
)
12844 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12845 && uses_template_parms (DECL_CONTEXT (decl
)))
12847 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12848 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12849 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12851 else if (DECL_FUNCTION_SCOPE_P (decl
)
12852 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12853 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12854 r
= retrieve_local_specialization (decl
);
12856 /* The typedef is from a non-template context. */
12862 r
= cp_build_qualified_type_real
12863 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12864 complain
| tf_ignore_bad_quals
);
12869 /* We don't have an instantiation yet, so drop the typedef. */
12870 int quals
= cp_type_quals (t
);
12871 t
= DECL_ORIGINAL_TYPE (decl
);
12872 t
= cp_build_qualified_type_real (t
, quals
,
12873 complain
| tf_ignore_bad_quals
);
12878 && code
!= TYPENAME_TYPE
12879 && code
!= TEMPLATE_TYPE_PARM
12880 && code
!= IDENTIFIER_NODE
12881 && code
!= FUNCTION_TYPE
12882 && code
!= METHOD_TYPE
)
12883 type
= tsubst (type
, args
, complain
, in_decl
);
12884 if (type
== error_mark_node
)
12885 return error_mark_node
;
12891 case ENUMERAL_TYPE
:
12892 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12893 /*entering_scope=*/0);
12896 case IDENTIFIER_NODE
:
12907 if (t
== integer_type_node
)
12910 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12911 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12915 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12917 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12918 /*integral_constant_expression_p=*/false);
12920 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12922 if (TREE_CODE (max
) == NOP_EXPR
12923 && TREE_SIDE_EFFECTS (omax
)
12924 && !TREE_TYPE (max
))
12925 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12927 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12928 with TREE_SIDE_EFFECTS that indicates this is not an integral
12929 constant expression. */
12930 if (processing_template_decl
12931 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12933 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12934 TREE_SIDE_EFFECTS (max
) = 1;
12937 return compute_array_index_type (NULL_TREE
, max
, complain
);
12940 case TEMPLATE_TYPE_PARM
:
12941 case TEMPLATE_TEMPLATE_PARM
:
12942 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12943 case TEMPLATE_PARM_INDEX
:
12948 tree arg
= NULL_TREE
;
12950 /* Early in template argument deduction substitution, we don't
12951 want to reduce the level of 'auto', or it will be confused
12952 with a normal template parm in subsequent deduction. */
12953 if (is_auto (t
) && (complain
& tf_partial
))
12958 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12959 template_parm_level_and_index (t
, &level
, &idx
);
12961 levels
= TMPL_ARGS_DEPTH (args
);
12962 if (level
<= levels
12963 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12965 arg
= TMPL_ARG (args
, level
, idx
);
12967 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12969 /* See through ARGUMENT_PACK_SELECT arguments. */
12970 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12971 /* If the selected argument is an expansion E, that most
12972 likely means we were called from
12973 gen_elem_of_pack_expansion_instantiation during the
12974 substituting of pack an argument pack (which Ith
12975 element is a pack expansion, where I is
12976 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12977 In this case, the Ith element resulting from this
12978 substituting is going to be a pack expansion, which
12979 pattern is the pattern of E. Let's return the
12981 gen_elem_of_pack_expansion_instantiation will
12982 build the resulting pack expansion from it. */
12983 if (PACK_EXPANSION_P (arg
))
12985 /* Make sure we aren't throwing away arg info. */
12986 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12987 arg
= PACK_EXPANSION_PATTERN (arg
);
12992 if (arg
== error_mark_node
)
12993 return error_mark_node
;
12994 else if (arg
!= NULL_TREE
)
12996 if (ARGUMENT_PACK_P (arg
))
12997 /* If ARG is an argument pack, we don't actually want to
12998 perform a substitution here, because substitutions
12999 for argument packs are only done
13000 element-by-element. We can get to this point when
13001 substituting the type of a non-type template
13002 parameter pack, when that type actually contains
13003 template parameter packs from an outer template, e.g.,
13005 template<typename... Types> struct A {
13006 template<Types... Values> struct B { };
13010 if (code
== TEMPLATE_TYPE_PARM
)
13013 gcc_assert (TYPE_P (arg
));
13015 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
13017 return cp_build_qualified_type_real
13018 (arg
, quals
, complain
| tf_ignore_bad_quals
);
13020 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13022 /* We are processing a type constructed from a
13023 template template parameter. */
13024 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
13025 args
, complain
, in_decl
);
13026 if (argvec
== error_mark_node
)
13027 return error_mark_node
;
13029 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
13030 || TREE_CODE (arg
) == TEMPLATE_DECL
13031 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
13033 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
13034 /* Consider this code:
13036 template <template <class> class Template>
13038 template <class Arg> using Bind = Template<Arg>;
13041 template <template <class> class Template, class Arg>
13042 using Instantiate = Template<Arg>; //#0
13044 template <template <class> class Template,
13047 Instantiate<Internal<Template>::template Bind,
13050 When #1 is parsed, the
13051 BOUND_TEMPLATE_TEMPLATE_PARM representing the
13052 parameter `Template' in #0 matches the
13053 UNBOUND_CLASS_TEMPLATE representing the argument
13054 `Internal<Template>::template Bind'; We then want
13055 to assemble the type `Bind<Argument>' that can't
13056 be fully created right now, because
13057 `Internal<Template>' not being complete, the Bind
13058 template cannot be looked up in that context. So
13059 we need to "store" `Bind<Argument>' for later
13060 when the context of Bind becomes complete. Let's
13061 store that in a TYPENAME_TYPE. */
13062 return make_typename_type (TYPE_CONTEXT (arg
),
13063 build_nt (TEMPLATE_ID_EXPR
,
13064 TYPE_IDENTIFIER (arg
),
13069 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
13070 are resolving nested-types in the signature of a
13071 member function templates. Otherwise ARG is a
13072 TEMPLATE_DECL and is the real template to be
13074 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
13075 arg
= TYPE_NAME (arg
);
13077 r
= lookup_template_class (arg
,
13079 DECL_CONTEXT (arg
),
13080 /*entering_scope=*/0,
13082 return cp_build_qualified_type_real
13083 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
13086 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
13087 return convert_from_reference (unshare_expr (arg
));
13091 /* This can happen during the attempted tsubst'ing in
13092 unify. This means that we don't yet have any information
13093 about the template parameter in question. */
13096 /* If we get here, we must have been looking at a parm for a
13097 more deeply nested template. Make a new version of this
13098 template parameter, but with a lower level. */
13101 case TEMPLATE_TYPE_PARM
:
13102 case TEMPLATE_TEMPLATE_PARM
:
13103 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13104 if (cp_type_quals (t
))
13106 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
13107 r
= cp_build_qualified_type_real
13108 (r
, cp_type_quals (t
),
13109 complain
| (code
== TEMPLATE_TYPE_PARM
13110 ? tf_ignore_bad_quals
: 0));
13112 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
13113 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
13114 && (r
= (TEMPLATE_PARM_DESCENDANTS
13115 (TEMPLATE_TYPE_PARM_INDEX (t
))))
13116 && (r
= TREE_TYPE (r
))
13117 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
13118 /* Break infinite recursion when substituting the constraints
13119 of a constrained placeholder. */;
13123 TEMPLATE_TYPE_PARM_INDEX (r
)
13124 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
13125 r
, levels
, args
, complain
);
13126 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
13127 TYPE_MAIN_VARIANT (r
) = r
;
13128 TYPE_POINTER_TO (r
) = NULL_TREE
;
13129 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
13131 /* Propagate constraints on placeholders. */
13132 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
13133 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
13134 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
13135 = tsubst_constraint (constr
, args
, complain
, in_decl
);
13137 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
13138 /* We have reduced the level of the template
13139 template parameter, but not the levels of its
13140 template parameters, so canonical_type_parameter
13141 will not be able to find the canonical template
13142 template parameter for this level. Thus, we
13143 require structural equality checking to compare
13144 TEMPLATE_TEMPLATE_PARMs. */
13145 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13146 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
13147 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13149 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
13151 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13153 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
13154 complain
, in_decl
);
13155 if (argvec
== error_mark_node
)
13156 return error_mark_node
;
13158 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
13159 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13164 case TEMPLATE_PARM_INDEX
:
13165 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13169 gcc_unreachable ();
13177 tree purpose
, value
, chain
;
13179 if (t
== void_list_node
)
13182 purpose
= TREE_PURPOSE (t
);
13185 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13186 if (purpose
== error_mark_node
)
13187 return error_mark_node
;
13189 value
= TREE_VALUE (t
);
13192 value
= tsubst (value
, args
, complain
, in_decl
);
13193 if (value
== error_mark_node
)
13194 return error_mark_node
;
13196 chain
= TREE_CHAIN (t
);
13197 if (chain
&& chain
!= void_type_node
)
13199 chain
= tsubst (chain
, args
, complain
, in_decl
);
13200 if (chain
== error_mark_node
)
13201 return error_mark_node
;
13203 if (purpose
== TREE_PURPOSE (t
)
13204 && value
== TREE_VALUE (t
)
13205 && chain
== TREE_CHAIN (t
))
13207 return hash_tree_cons (purpose
, value
, chain
);
13211 /* We should never be tsubsting a binfo. */
13212 gcc_unreachable ();
13215 /* A vector of template arguments. */
13216 gcc_assert (!type
);
13217 return tsubst_template_args (t
, args
, complain
, in_decl
);
13220 case REFERENCE_TYPE
:
13222 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13227 Type deduction may fail for any of the following
13230 -- Attempting to create a pointer to reference type.
13231 -- Attempting to create a reference to a reference type or
13232 a reference to void.
13234 Core issue 106 says that creating a reference to a reference
13235 during instantiation is no longer a cause for failure. We
13236 only enforce this check in strict C++98 mode. */
13237 if ((TREE_CODE (type
) == REFERENCE_TYPE
13238 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13239 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13241 static location_t last_loc
;
13243 /* We keep track of the last time we issued this error
13244 message to avoid spewing a ton of messages during a
13245 single bad template instantiation. */
13246 if (complain
& tf_error
13247 && last_loc
!= input_location
)
13249 if (VOID_TYPE_P (type
))
13250 error ("forming reference to void");
13251 else if (code
== POINTER_TYPE
)
13252 error ("forming pointer to reference type %qT", type
);
13254 error ("forming reference to reference type %qT", type
);
13255 last_loc
= input_location
;
13258 return error_mark_node
;
13260 else if (TREE_CODE (type
) == FUNCTION_TYPE
13261 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13262 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13264 if (complain
& tf_error
)
13266 if (code
== POINTER_TYPE
)
13267 error ("forming pointer to qualified function type %qT",
13270 error ("forming reference to qualified function type %qT",
13273 return error_mark_node
;
13275 else if (code
== POINTER_TYPE
)
13277 r
= build_pointer_type (type
);
13278 if (TREE_CODE (type
) == METHOD_TYPE
)
13279 r
= build_ptrmemfunc_type (r
);
13281 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13282 /* In C++0x, during template argument substitution, when there is an
13283 attempt to create a reference to a reference type, reference
13284 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13286 "If a template-argument for a template-parameter T names a type
13287 that is a reference to a type A, an attempt to create the type
13288 'lvalue reference to cv T' creates the type 'lvalue reference to
13289 A,' while an attempt to create the type type rvalue reference to
13290 cv T' creates the type T"
13292 r
= cp_build_reference_type
13294 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13296 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13297 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13299 if (r
!= error_mark_node
)
13300 /* Will this ever be needed for TYPE_..._TO values? */
13307 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13308 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13312 Type deduction may fail for any of the following
13315 -- Attempting to create "pointer to member of T" when T
13316 is not a class type. */
13317 if (complain
& tf_error
)
13318 error ("creating pointer to member of non-class type %qT", r
);
13319 return error_mark_node
;
13321 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13323 if (complain
& tf_error
)
13324 error ("creating pointer to member reference type %qT", type
);
13325 return error_mark_node
;
13327 if (VOID_TYPE_P (type
))
13329 if (complain
& tf_error
)
13330 error ("creating pointer to member of type void");
13331 return error_mark_node
;
13333 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13334 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13336 /* The type of the implicit object parameter gets its
13337 cv-qualifiers from the FUNCTION_TYPE. */
13340 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13341 type_memfn_rqual (type
));
13342 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13343 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13347 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13351 case FUNCTION_TYPE
:
13356 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13357 if (fntype
== error_mark_node
)
13358 return error_mark_node
;
13360 /* Substitute the exception specification. */
13361 specs
= tsubst_exception_specification (t
, args
, complain
,
13362 in_decl
, /*defer_ok*/true);
13363 if (specs
== error_mark_node
)
13364 return error_mark_node
;
13366 fntype
= build_exception_variant (fntype
, specs
);
13371 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13372 if (domain
== error_mark_node
)
13373 return error_mark_node
;
13375 /* As an optimization, we avoid regenerating the array type if
13376 it will obviously be the same as T. */
13377 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13380 /* These checks should match the ones in create_array_type_for_decl.
13384 The deduction may fail for any of the following reasons:
13386 -- Attempting to create an array with an element type that
13387 is void, a function type, or a reference type, or [DR337]
13388 an abstract class type. */
13389 if (VOID_TYPE_P (type
)
13390 || TREE_CODE (type
) == FUNCTION_TYPE
13391 || (TREE_CODE (type
) == ARRAY_TYPE
13392 && TYPE_DOMAIN (type
) == NULL_TREE
)
13393 || TREE_CODE (type
) == REFERENCE_TYPE
)
13395 if (complain
& tf_error
)
13396 error ("creating array of %qT", type
);
13397 return error_mark_node
;
13400 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13401 return error_mark_node
;
13403 r
= build_cplus_array_type (type
, domain
);
13405 if (TYPE_USER_ALIGN (t
))
13407 SET_TYPE_ALIGN (r
, TYPE_ALIGN (t
));
13408 TYPE_USER_ALIGN (r
) = 1;
13414 case TYPENAME_TYPE
:
13416 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13417 in_decl
, /*entering_scope=*/1);
13418 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13419 complain
, in_decl
);
13421 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13422 return error_mark_node
;
13424 if (!MAYBE_CLASS_TYPE_P (ctx
))
13426 if (complain
& tf_error
)
13427 error ("%qT is not a class, struct, or union type", ctx
);
13428 return error_mark_node
;
13430 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13432 /* Normally, make_typename_type does not require that the CTX
13433 have complete type in order to allow things like:
13435 template <class T> struct S { typename S<T>::X Y; };
13437 But, such constructs have already been resolved by this
13438 point, so here CTX really should have complete type, unless
13439 it's a partial instantiation. */
13440 ctx
= complete_type (ctx
);
13441 if (!COMPLETE_TYPE_P (ctx
))
13443 if (complain
& tf_error
)
13444 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13445 return error_mark_node
;
13449 f
= make_typename_type (ctx
, f
, typename_type
,
13450 complain
| tf_keep_type_decl
);
13451 if (f
== error_mark_node
)
13453 if (TREE_CODE (f
) == TYPE_DECL
)
13455 complain
|= tf_ignore_bad_quals
;
13459 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13461 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13463 if (complain
& tf_error
)
13464 error ("%qT resolves to %qT, which is not an enumeration type",
13467 return error_mark_node
;
13469 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13471 if (complain
& tf_error
)
13472 error ("%qT resolves to %qT, which is is not a class type",
13475 return error_mark_node
;
13479 return cp_build_qualified_type_real
13480 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13483 case UNBOUND_CLASS_TEMPLATE
:
13485 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13486 in_decl
, /*entering_scope=*/1);
13487 tree name
= TYPE_IDENTIFIER (t
);
13488 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13490 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13491 return error_mark_node
;
13494 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13495 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13502 ++cp_unevaluated_operand
;
13503 ++c_inhibit_evaluation_warnings
;
13505 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13507 /*integral_constant_expression_p=*/false);
13509 --cp_unevaluated_operand
;
13510 --c_inhibit_evaluation_warnings
;
13512 type
= finish_typeof (type
);
13513 return cp_build_qualified_type_real (type
,
13515 | cp_type_quals (type
),
13519 case DECLTYPE_TYPE
:
13523 ++cp_unevaluated_operand
;
13524 ++c_inhibit_evaluation_warnings
;
13526 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13527 complain
|tf_decltype
, in_decl
,
13528 /*function_p*/false,
13529 /*integral_constant_expression*/false);
13531 --cp_unevaluated_operand
;
13532 --c_inhibit_evaluation_warnings
;
13534 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13535 type
= lambda_capture_field_type (type
,
13536 DECLTYPE_FOR_INIT_CAPTURE (t
));
13537 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13538 type
= lambda_proxy_type (type
);
13541 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13542 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13544 /* In a template ~id could be either a complement expression
13545 or an unqualified-id naming a destructor; if instantiating
13546 it produces an expression, it's not an id-expression or
13549 type
= finish_decltype_type (type
, id
, complain
);
13551 return cp_build_qualified_type_real (type
,
13553 | cp_type_quals (type
),
13554 complain
| tf_ignore_bad_quals
);
13557 case UNDERLYING_TYPE
:
13559 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13560 complain
, in_decl
);
13561 return finish_underlying_type (type
);
13564 case TYPE_ARGUMENT_PACK
:
13565 case NONTYPE_ARGUMENT_PACK
:
13567 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13569 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13573 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13575 /* For template nontype argument packs, also substitute into
13577 if (code
== NONTYPE_ARGUMENT_PACK
)
13578 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13597 /* We should use one of the expression tsubsts for these codes. */
13598 gcc_unreachable ();
13601 sorry ("use of %qs in template", get_tree_code_name (code
));
13602 return error_mark_node
;
13606 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13607 type of the expression on the left-hand side of the "." or "->"
13611 tsubst_baselink (tree baselink
, tree object_type
,
13612 tree args
, tsubst_flags_t complain
, tree in_decl
)
13615 tree qualifying_scope
;
13618 tree template_args
= 0;
13619 bool template_id_p
= false;
13620 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13622 /* A baselink indicates a function from a base class. Both the
13623 BASELINK_ACCESS_BINFO and the base class referenced may
13624 indicate bases of the template class, rather than the
13625 instantiated class. In addition, lookups that were not
13626 ambiguous before may be ambiguous now. Therefore, we perform
13627 the lookup again. */
13628 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13629 qualifying_scope
= tsubst (qualifying_scope
, args
,
13630 complain
, in_decl
);
13631 fns
= BASELINK_FUNCTIONS (baselink
);
13632 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13633 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13635 template_id_p
= true;
13636 template_args
= TREE_OPERAND (fns
, 1);
13637 fns
= TREE_OPERAND (fns
, 0);
13639 template_args
= tsubst_template_args (template_args
, args
,
13640 complain
, in_decl
);
13642 name
= DECL_NAME (get_first_fn (fns
));
13643 if (IDENTIFIER_TYPENAME_P (name
))
13644 name
= mangle_conv_op_name_for_type (optype
);
13645 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13648 if (constructor_name_p (name
, qualifying_scope
))
13650 if (complain
& tf_error
)
13651 error ("cannot call constructor %<%T::%D%> directly",
13652 qualifying_scope
, name
);
13654 return error_mark_node
;
13657 /* If lookup found a single function, mark it as used at this
13658 point. (If it lookup found multiple functions the one selected
13659 later by overload resolution will be marked as used at that
13661 if (BASELINK_P (baselink
))
13662 fns
= BASELINK_FUNCTIONS (baselink
);
13663 if (!template_id_p
&& !really_overloaded_fn (fns
)
13664 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13665 return error_mark_node
;
13667 /* Add back the template arguments, if present. */
13668 if (BASELINK_P (baselink
) && template_id_p
)
13669 BASELINK_FUNCTIONS (baselink
)
13670 = build2 (TEMPLATE_ID_EXPR
,
13672 BASELINK_FUNCTIONS (baselink
),
13674 /* Update the conversion operator type. */
13675 BASELINK_OPTYPE (baselink
) = optype
;
13678 object_type
= current_class_type
;
13681 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13687 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13688 true if the qualified-id will be a postfix-expression in-and-of
13689 itself; false if more of the postfix-expression follows the
13690 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13694 tsubst_qualified_id (tree qualified_id
, tree args
,
13695 tsubst_flags_t complain
, tree in_decl
,
13696 bool done
, bool address_p
)
13702 tree template_args
;
13703 location_t loc
= UNKNOWN_LOCATION
;
13705 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13707 /* Figure out what name to look up. */
13708 name
= TREE_OPERAND (qualified_id
, 1);
13709 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13711 is_template
= true;
13712 loc
= EXPR_LOCATION (name
);
13713 template_args
= TREE_OPERAND (name
, 1);
13715 template_args
= tsubst_template_args (template_args
, args
,
13716 complain
, in_decl
);
13717 name
= TREE_OPERAND (name
, 0);
13721 is_template
= false;
13722 template_args
= NULL_TREE
;
13725 /* Substitute into the qualifying scope. When there are no ARGS, we
13726 are just trying to simplify a non-dependent expression. In that
13727 case the qualifying scope may be dependent, and, in any case,
13728 substituting will not help. */
13729 scope
= TREE_OPERAND (qualified_id
, 0);
13732 scope
= tsubst (scope
, args
, complain
, in_decl
);
13733 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13738 if (dependent_scope_p (scope
))
13741 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13742 tree r
= build_qualified_name (NULL_TREE
, scope
, expr
,
13743 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13744 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (qualified_id
);
13748 if (!BASELINK_P (name
) && !DECL_P (expr
))
13750 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13752 /* A BIT_NOT_EXPR is used to represent a destructor. */
13753 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13755 error ("qualifying type %qT does not match destructor name ~%qT",
13756 scope
, TREE_OPERAND (expr
, 0));
13757 expr
= error_mark_node
;
13760 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13761 /*is_type_p=*/0, false);
13764 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13765 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13766 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13768 if (complain
& tf_error
)
13770 error ("dependent-name %qE is parsed as a non-type, but "
13771 "instantiation yields a type", qualified_id
);
13772 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13774 return error_mark_node
;
13780 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13782 /* Remember that there was a reference to this entity. */
13783 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13784 return error_mark_node
;
13787 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13789 if (complain
& tf_error
)
13790 qualified_name_lookup_error (scope
,
13791 TREE_OPERAND (qualified_id
, 1),
13792 expr
, input_location
);
13793 return error_mark_node
;
13798 if (variable_template_p (expr
))
13799 expr
= lookup_and_finish_template_variable (expr
, template_args
,
13802 expr
= lookup_template_function (expr
, template_args
);
13805 if (expr
== error_mark_node
&& complain
& tf_error
)
13806 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13807 expr
, input_location
);
13808 else if (TYPE_P (scope
))
13810 expr
= (adjust_result_of_qualified_name_lookup
13811 (expr
, scope
, current_nonlambda_class_type ()));
13812 expr
= (finish_qualified_id_expr
13813 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13814 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13815 /*template_arg_p=*/false, complain
));
13818 /* Expressions do not generally have reference type. */
13819 if (TREE_CODE (expr
) != SCOPE_REF
13820 /* However, if we're about to form a pointer-to-member, we just
13821 want the referenced member referenced. */
13822 && TREE_CODE (expr
) != OFFSET_REF
)
13823 expr
= convert_from_reference (expr
);
13825 if (REF_PARENTHESIZED_P (qualified_id
))
13826 expr
= force_paren_expr (expr
);
13831 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13832 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13836 tsubst_init (tree init
, tree decl
, tree args
,
13837 tsubst_flags_t complain
, tree in_decl
)
13842 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13846 /* If we had an initializer but it
13847 instantiated to nothing,
13848 value-initialize the object. This will
13849 only occur when the initializer was a
13850 pack expansion where the parameter packs
13851 used in that expansion were of length
13853 init
= build_value_init (TREE_TYPE (decl
),
13855 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13856 init
= get_target_expr_sfinae (init
, complain
);
13862 /* Like tsubst, but deals with expressions. This function just replaces
13863 template parms; to finish processing the resultant expression, use
13864 tsubst_copy_and_build or tsubst_expr. */
13867 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13869 enum tree_code code
;
13872 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13875 code
= TREE_CODE (t
);
13880 r
= retrieve_local_specialization (t
);
13882 if (r
== NULL_TREE
)
13884 /* We get here for a use of 'this' in an NSDMI as part of a
13885 constructor call or as part of an aggregate initialization. */
13886 if (DECL_NAME (t
) == this_identifier
13887 && ((current_function_decl
13888 && DECL_CONSTRUCTOR_P (current_function_decl
))
13889 || (current_class_ref
13890 && TREE_CODE (current_class_ref
) == PLACEHOLDER_EXPR
)))
13891 return current_class_ptr
;
13893 /* This can happen for a parameter name used later in a function
13894 declaration (such as in a late-specified return type). Just
13895 make a dummy decl, since it's only used for its type. */
13896 gcc_assert (cp_unevaluated_operand
!= 0);
13897 r
= tsubst_decl (t
, args
, complain
);
13898 /* Give it the template pattern as its context; its true context
13899 hasn't been instantiated yet and this is good enough for
13901 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13904 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13905 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13906 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13907 return error_mark_node
;
13915 if (DECL_TEMPLATE_PARM_P (t
))
13916 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13917 /* There is no need to substitute into namespace-scope
13919 if (DECL_NAMESPACE_SCOPE_P (t
))
13921 /* If ARGS is NULL, then T is known to be non-dependent. */
13922 if (args
== NULL_TREE
)
13923 return scalar_constant_value (t
);
13925 /* Unfortunately, we cannot just call lookup_name here.
13928 template <int I> int f() {
13930 struct S { void g() { E e = a; } };
13933 When we instantiate f<7>::S::g(), say, lookup_name is not
13934 clever enough to find f<7>::a. */
13936 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13937 /*entering_scope=*/0);
13939 for (v
= TYPE_VALUES (enum_type
);
13941 v
= TREE_CHAIN (v
))
13942 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13943 return TREE_VALUE (v
);
13945 /* We didn't find the name. That should never happen; if
13946 name-lookup found it during preliminary parsing, we
13947 should find it again here during instantiation. */
13948 gcc_unreachable ();
13953 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13955 /* Check for a local specialization set up by
13956 tsubst_pack_expansion. */
13957 if (tree r
= retrieve_local_specialization (t
))
13959 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13960 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13964 /* When retrieving a capture pack from a generic lambda, remove the
13965 lambda call op's own template argument list from ARGS. Only the
13966 template arguments active for the closure type should be used to
13967 retrieve the pack specialization. */
13968 if (LAMBDA_FUNCTION_P (current_function_decl
)
13969 && (template_class_depth (DECL_CONTEXT (t
))
13970 != TMPL_ARGS_DEPTH (args
)))
13971 args
= strip_innermost_template_args (args
, 1);
13973 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13974 tsubst_decl put in the hash table. */
13975 return retrieve_specialization (t
, args
, 0);
13978 if (DECL_CONTEXT (t
))
13982 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13983 /*entering_scope=*/1);
13984 if (ctx
!= DECL_CONTEXT (t
))
13986 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13989 if (complain
& tf_error
)
13990 error ("using invalid field %qD", t
);
13991 return error_mark_node
;
14000 case FUNCTION_DECL
:
14001 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
14002 r
= tsubst (t
, args
, complain
, in_decl
);
14003 else if (local_variable_p (t
)
14004 && uses_template_parms (DECL_CONTEXT (t
)))
14006 r
= retrieve_local_specialization (t
);
14007 if (r
== NULL_TREE
)
14009 /* First try name lookup to find the instantiation. */
14010 r
= lookup_name (DECL_NAME (t
));
14013 /* Make sure that the one we found is the one we want. */
14014 tree ctx
= DECL_CONTEXT (t
);
14015 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
14016 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
14017 if (ctx
!= DECL_CONTEXT (r
))
14025 /* This can happen for a variable used in a
14026 late-specified return type of a local lambda, or for a
14027 local static or constant. Building a new VAR_DECL
14028 should be OK in all those cases. */
14029 r
= tsubst_decl (t
, args
, complain
);
14030 if (decl_maybe_constant_var_p (r
))
14032 /* We can't call cp_finish_decl, so handle the
14033 initializer by hand. */
14034 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
14035 complain
, in_decl
);
14036 if (!processing_template_decl
)
14037 init
= maybe_constant_init (init
);
14038 if (processing_template_decl
14039 ? potential_constant_expression (init
)
14040 : reduced_constant_expression_p (init
))
14041 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
14042 = TREE_CONSTANT (r
) = true;
14043 DECL_INITIAL (r
) = init
;
14045 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
14046 || decl_constant_var_p (r
)
14047 || errorcount
|| sorrycount
);
14048 if (!processing_template_decl
14049 && !TREE_STATIC (r
))
14050 r
= process_outer_var_ref (r
, complain
);
14052 /* Remember this for subsequent uses. */
14053 if (local_specializations
)
14054 register_local_specialization (r
, t
);
14059 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
14060 return error_mark_node
;
14063 case NAMESPACE_DECL
:
14067 /* An OVERLOAD will always be a non-dependent overload set; an
14068 overload set from function scope will just be represented with an
14069 IDENTIFIER_NODE, and from class scope with a BASELINK. */
14070 gcc_assert (!uses_template_parms (t
));
14074 return tsubst_baselink (t
, current_nonlambda_class_type (),
14075 args
, complain
, in_decl
);
14077 case TEMPLATE_DECL
:
14078 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
14079 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
14080 args
, complain
, in_decl
);
14081 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
14082 return tsubst (t
, args
, complain
, in_decl
);
14083 else if (DECL_CLASS_SCOPE_P (t
)
14084 && uses_template_parms (DECL_CONTEXT (t
)))
14086 /* Template template argument like the following example need
14089 template <template <class> class TT> struct C {};
14090 template <class T> struct D {
14091 template <class U> struct E {};
14096 We are processing the template argument `E' in #1 for
14097 the template instantiation #2. Originally, `E' is a
14098 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
14099 have to substitute this with one having context `D<int>'. */
14101 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
14102 return lookup_field (context
, DECL_NAME(t
), 0, false);
14105 /* Ordinary template template argument. */
14109 case REINTERPRET_CAST_EXPR
:
14110 case CONST_CAST_EXPR
:
14111 case STATIC_CAST_EXPR
:
14112 case DYNAMIC_CAST_EXPR
:
14113 case IMPLICIT_CONV_EXPR
:
14117 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14118 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14119 return build1 (code
, type
, op0
);
14123 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
14124 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
14126 tree expanded
, op
= TREE_OPERAND (t
, 0);
14129 if (SIZEOF_EXPR_TYPE_P (t
))
14130 op
= TREE_TYPE (op
);
14132 ++cp_unevaluated_operand
;
14133 ++c_inhibit_evaluation_warnings
;
14134 /* We only want to compute the number of arguments. */
14135 if (PACK_EXPANSION_P (op
))
14136 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
14138 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
14139 args
, complain
, in_decl
);
14140 --cp_unevaluated_operand
;
14141 --c_inhibit_evaluation_warnings
;
14143 if (TREE_CODE (expanded
) == TREE_VEC
)
14145 len
= TREE_VEC_LENGTH (expanded
);
14146 /* Set TREE_USED for the benefit of -Wunused. */
14147 for (int i
= 0; i
< len
; i
++)
14148 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
14151 if (expanded
== error_mark_node
)
14152 return error_mark_node
;
14153 else if (PACK_EXPANSION_P (expanded
)
14154 || (TREE_CODE (expanded
) == TREE_VEC
14155 && pack_expansion_args_count (expanded
)))
14158 if (PACK_EXPANSION_P (expanded
))
14160 else if (TREE_VEC_LENGTH (expanded
) == 1)
14161 expanded
= TREE_VEC_ELT (expanded
, 0);
14163 expanded
= make_argument_pack (expanded
);
14165 if (TYPE_P (expanded
))
14166 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
14167 complain
& tf_error
);
14169 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
14170 complain
& tf_error
);
14173 return build_int_cst (size_type_node
, len
);
14175 if (SIZEOF_EXPR_TYPE_P (t
))
14177 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
14178 args
, complain
, in_decl
);
14179 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
14180 r
= build1 (SIZEOF_EXPR
,
14181 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
14182 SIZEOF_EXPR_TYPE_P (r
) = 1;
14189 case TRUTH_NOT_EXPR
:
14192 case UNARY_PLUS_EXPR
: /* Unary + */
14194 case AT_ENCODE_EXPR
:
14198 case REALPART_EXPR
:
14199 case IMAGPART_EXPR
:
14202 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14203 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14204 return build1 (code
, type
, op0
);
14207 case COMPONENT_REF
:
14212 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14213 name
= TREE_OPERAND (t
, 1);
14214 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14216 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14217 complain
, in_decl
);
14218 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14220 else if (TREE_CODE (name
) == SCOPE_REF
14221 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14223 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14224 complain
, in_decl
);
14225 name
= TREE_OPERAND (name
, 1);
14226 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14227 complain
, in_decl
);
14228 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14229 name
= build_qualified_name (/*type=*/NULL_TREE
,
14231 /*template_p=*/false);
14233 else if (BASELINK_P (name
))
14234 name
= tsubst_baselink (name
,
14235 non_reference (TREE_TYPE (object
)),
14239 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14240 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14246 case TRUNC_DIV_EXPR
:
14247 case CEIL_DIV_EXPR
:
14248 case FLOOR_DIV_EXPR
:
14249 case ROUND_DIV_EXPR
:
14250 case EXACT_DIV_EXPR
:
14254 case TRUNC_MOD_EXPR
:
14255 case FLOOR_MOD_EXPR
:
14256 case TRUTH_ANDIF_EXPR
:
14257 case TRUTH_ORIF_EXPR
:
14258 case TRUTH_AND_EXPR
:
14259 case TRUTH_OR_EXPR
:
14272 case COMPOUND_EXPR
:
14275 case PREDECREMENT_EXPR
:
14276 case PREINCREMENT_EXPR
:
14277 case POSTDECREMENT_EXPR
:
14278 case POSTINCREMENT_EXPR
:
14280 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14281 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14282 return build_nt (code
, op0
, op1
);
14287 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14288 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14289 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14290 QUALIFIED_NAME_IS_TEMPLATE (t
));
14295 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14296 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14297 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14302 int n
= VL_EXP_OPERAND_LENGTH (t
);
14303 tree result
= build_vl_exp (CALL_EXPR
, n
);
14305 for (i
= 0; i
< n
; i
++)
14306 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14307 complain
, in_decl
);
14313 case PSEUDO_DTOR_EXPR
:
14314 case VEC_PERM_EXPR
:
14316 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14317 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14318 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14319 r
= build_nt (code
, op0
, op1
, op2
);
14320 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14326 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14327 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14328 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14329 r
= build_nt (code
, op0
, op1
, op2
);
14330 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14336 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14337 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14338 r
= build_nt (code
, op0
, op1
);
14339 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14340 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14344 case TEMPLATE_ID_EXPR
:
14346 /* Substituted template arguments */
14347 tree fn
= TREE_OPERAND (t
, 0);
14348 tree targs
= TREE_OPERAND (t
, 1);
14350 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14352 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14354 return lookup_template_function (fn
, targs
);
14359 tree purpose
, value
, chain
;
14361 if (t
== void_list_node
)
14364 purpose
= TREE_PURPOSE (t
);
14366 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14367 value
= TREE_VALUE (t
);
14369 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14370 chain
= TREE_CHAIN (t
);
14371 if (chain
&& chain
!= void_type_node
)
14372 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14373 if (purpose
== TREE_PURPOSE (t
)
14374 && value
== TREE_VALUE (t
)
14375 && chain
== TREE_CHAIN (t
))
14377 return tree_cons (purpose
, value
, chain
);
14382 case ENUMERAL_TYPE
:
14384 case TEMPLATE_TYPE_PARM
:
14385 case TEMPLATE_TEMPLATE_PARM
:
14386 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14387 case TEMPLATE_PARM_INDEX
:
14389 case REFERENCE_TYPE
:
14391 case FUNCTION_TYPE
:
14394 case TYPENAME_TYPE
:
14395 case UNBOUND_CLASS_TEMPLATE
:
14397 case DECLTYPE_TYPE
:
14399 return tsubst (t
, args
, complain
, in_decl
);
14403 /* Fall through. */
14404 case IDENTIFIER_NODE
:
14405 if (IDENTIFIER_TYPENAME_P (t
))
14407 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14408 return mangle_conv_op_name_for_type (new_type
);
14414 /* This is handled by tsubst_copy_and_build. */
14415 gcc_unreachable ();
14419 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14420 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14421 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14424 case CLEANUP_POINT_EXPR
:
14425 /* We shouldn't have built any of these during initial template
14426 generation. Instead, they should be built during instantiation
14427 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14428 gcc_unreachable ();
14432 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14433 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14434 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14435 r
= build2 (code
, type
, op0
, op1
);
14436 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14437 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14438 && !(complain
& tf_error
))
14439 return error_mark_node
;
14443 case EXPR_PACK_EXPANSION
:
14444 error ("invalid use of pack expansion expression");
14445 return error_mark_node
;
14447 case NONTYPE_ARGUMENT_PACK
:
14448 error ("use %<...%> to expand argument pack");
14449 return error_mark_node
;
14452 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14460 /* Instantiate any typedefs in the type. */
14461 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14462 r
= fold_convert (type
, t
);
14463 gcc_assert (TREE_CODE (r
) == code
);
14468 /* These can sometimes show up in a partial instantiation, but never
14469 involve template parms. */
14470 gcc_assert (!uses_template_parms (t
));
14473 case UNARY_LEFT_FOLD_EXPR
:
14474 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14475 case UNARY_RIGHT_FOLD_EXPR
:
14476 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14477 case BINARY_LEFT_FOLD_EXPR
:
14478 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14479 case BINARY_RIGHT_FOLD_EXPR
:
14480 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14483 /* We shouldn't get here, but keep going if !flag_checking. */
14485 gcc_unreachable ();
14490 /* Helper function for tsubst_omp_clauses, used for instantiation of
14491 OMP_CLAUSE_DECL of clauses. */
14494 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14497 if (decl
== NULL_TREE
)
14500 /* Handle an OpenMP array section represented as a TREE_LIST (or
14501 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14502 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14503 TREE_LIST. We can handle it exactly the same as an array section
14504 (purpose, value, and a chain), even though the nomenclature
14505 (low_bound, length, etc) is different. */
14506 if (TREE_CODE (decl
) == TREE_LIST
)
14509 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14510 /*integral_constant_expression_p=*/false);
14511 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14512 /*integral_constant_expression_p=*/false);
14513 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14515 if (TREE_PURPOSE (decl
) == low_bound
14516 && TREE_VALUE (decl
) == length
14517 && TREE_CHAIN (decl
) == chain
)
14519 tree ret
= tree_cons (low_bound
, length
, chain
);
14520 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14521 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14524 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14525 /*integral_constant_expression_p=*/false);
14526 /* Undo convert_from_reference tsubst_expr could have called. */
14528 && REFERENCE_REF_P (ret
)
14529 && !REFERENCE_REF_P (decl
))
14530 ret
= TREE_OPERAND (ret
, 0);
14534 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14537 tsubst_omp_clauses (tree clauses
, enum c_omp_region_type ort
,
14538 tree args
, tsubst_flags_t complain
, tree in_decl
)
14540 tree new_clauses
= NULL_TREE
, nc
, oc
;
14541 tree linear_no_step
= NULL_TREE
;
14543 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14545 nc
= copy_node (oc
);
14546 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14549 switch (OMP_CLAUSE_CODE (nc
))
14551 case OMP_CLAUSE_LASTPRIVATE
:
14552 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14554 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14555 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14556 in_decl
, /*integral_constant_expression_p=*/false);
14557 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14558 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14561 case OMP_CLAUSE_PRIVATE
:
14562 case OMP_CLAUSE_SHARED
:
14563 case OMP_CLAUSE_FIRSTPRIVATE
:
14564 case OMP_CLAUSE_COPYIN
:
14565 case OMP_CLAUSE_COPYPRIVATE
:
14566 case OMP_CLAUSE_UNIFORM
:
14567 case OMP_CLAUSE_DEPEND
:
14568 case OMP_CLAUSE_FROM
:
14569 case OMP_CLAUSE_TO
:
14570 case OMP_CLAUSE_MAP
:
14571 case OMP_CLAUSE_USE_DEVICE_PTR
:
14572 case OMP_CLAUSE_IS_DEVICE_PTR
:
14573 OMP_CLAUSE_DECL (nc
)
14574 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14577 case OMP_CLAUSE_IF
:
14578 case OMP_CLAUSE_NUM_THREADS
:
14579 case OMP_CLAUSE_SCHEDULE
:
14580 case OMP_CLAUSE_COLLAPSE
:
14581 case OMP_CLAUSE_FINAL
:
14582 case OMP_CLAUSE_DEVICE
:
14583 case OMP_CLAUSE_DIST_SCHEDULE
:
14584 case OMP_CLAUSE_NUM_TEAMS
:
14585 case OMP_CLAUSE_THREAD_LIMIT
:
14586 case OMP_CLAUSE_SAFELEN
:
14587 case OMP_CLAUSE_SIMDLEN
:
14588 case OMP_CLAUSE_NUM_TASKS
:
14589 case OMP_CLAUSE_GRAINSIZE
:
14590 case OMP_CLAUSE_PRIORITY
:
14591 case OMP_CLAUSE_ORDERED
:
14592 case OMP_CLAUSE_HINT
:
14593 case OMP_CLAUSE_NUM_GANGS
:
14594 case OMP_CLAUSE_NUM_WORKERS
:
14595 case OMP_CLAUSE_VECTOR_LENGTH
:
14596 case OMP_CLAUSE_WORKER
:
14597 case OMP_CLAUSE_VECTOR
:
14598 case OMP_CLAUSE_ASYNC
:
14599 case OMP_CLAUSE_WAIT
:
14600 OMP_CLAUSE_OPERAND (nc
, 0)
14601 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14602 in_decl
, /*integral_constant_expression_p=*/false);
14604 case OMP_CLAUSE_REDUCTION
:
14605 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14607 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14608 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14610 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14611 complain
, in_decl
);
14612 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14613 = build_qualified_name (NULL_TREE
, scope
,
14614 TREE_OPERAND (placeholder
, 1),
14618 gcc_assert (identifier_p (placeholder
));
14620 OMP_CLAUSE_DECL (nc
)
14621 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14624 case OMP_CLAUSE_GANG
:
14625 case OMP_CLAUSE_ALIGNED
:
14626 OMP_CLAUSE_DECL (nc
)
14627 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14629 OMP_CLAUSE_OPERAND (nc
, 1)
14630 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14631 in_decl
, /*integral_constant_expression_p=*/false);
14633 case OMP_CLAUSE_LINEAR
:
14634 OMP_CLAUSE_DECL (nc
)
14635 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14637 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14639 gcc_assert (!linear_no_step
);
14640 linear_no_step
= nc
;
14642 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
14643 OMP_CLAUSE_LINEAR_STEP (nc
)
14644 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
14645 complain
, in_decl
);
14647 OMP_CLAUSE_LINEAR_STEP (nc
)
14648 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
14650 /*integral_constant_expression_p=*/false);
14652 case OMP_CLAUSE_NOWAIT
:
14653 case OMP_CLAUSE_DEFAULT
:
14654 case OMP_CLAUSE_UNTIED
:
14655 case OMP_CLAUSE_MERGEABLE
:
14656 case OMP_CLAUSE_INBRANCH
:
14657 case OMP_CLAUSE_NOTINBRANCH
:
14658 case OMP_CLAUSE_PROC_BIND
:
14659 case OMP_CLAUSE_FOR
:
14660 case OMP_CLAUSE_PARALLEL
:
14661 case OMP_CLAUSE_SECTIONS
:
14662 case OMP_CLAUSE_TASKGROUP
:
14663 case OMP_CLAUSE_NOGROUP
:
14664 case OMP_CLAUSE_THREADS
:
14665 case OMP_CLAUSE_SIMD
:
14666 case OMP_CLAUSE_DEFAULTMAP
:
14667 case OMP_CLAUSE_INDEPENDENT
:
14668 case OMP_CLAUSE_AUTO
:
14669 case OMP_CLAUSE_SEQ
:
14671 case OMP_CLAUSE_TILE
:
14674 for (lnc
= OMP_CLAUSE_TILE_LIST (nc
),
14675 loc
= OMP_CLAUSE_TILE_LIST (oc
);
14677 loc
= TREE_CHAIN (loc
), lnc
= TREE_CHAIN (lnc
))
14679 TREE_VALUE (lnc
) = tsubst_expr (TREE_VALUE (loc
), args
,
14680 complain
, in_decl
, false);
14685 gcc_unreachable ();
14687 if ((ort
& C_ORT_OMP_DECLARE_SIMD
) == C_ORT_OMP
)
14688 switch (OMP_CLAUSE_CODE (nc
))
14690 case OMP_CLAUSE_SHARED
:
14691 case OMP_CLAUSE_PRIVATE
:
14692 case OMP_CLAUSE_FIRSTPRIVATE
:
14693 case OMP_CLAUSE_LASTPRIVATE
:
14694 case OMP_CLAUSE_COPYPRIVATE
:
14695 case OMP_CLAUSE_LINEAR
:
14696 case OMP_CLAUSE_REDUCTION
:
14697 case OMP_CLAUSE_USE_DEVICE_PTR
:
14698 case OMP_CLAUSE_IS_DEVICE_PTR
:
14699 /* tsubst_expr on SCOPE_REF results in returning
14700 finish_non_static_data_member result. Undo that here. */
14701 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14702 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14703 == IDENTIFIER_NODE
))
14705 tree t
= OMP_CLAUSE_DECL (nc
);
14708 switch (TREE_CODE (v
))
14710 case COMPONENT_REF
:
14714 case POINTER_PLUS_EXPR
:
14715 v
= TREE_OPERAND (v
, 0);
14718 if (DECL_CONTEXT (v
) == current_function_decl
14719 && DECL_ARTIFICIAL (v
)
14720 && DECL_NAME (v
) == this_identifier
)
14721 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14728 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14729 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14730 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14731 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14732 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14734 tree decl
= OMP_CLAUSE_DECL (nc
);
14737 if (!DECL_LANG_SPECIFIC (decl
))
14738 retrofit_lang_decl (decl
);
14739 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14748 new_clauses
= nreverse (new_clauses
);
14749 if (ort
!= C_ORT_OMP_DECLARE_SIMD
)
14751 new_clauses
= finish_omp_clauses (new_clauses
, ort
);
14752 if (linear_no_step
)
14753 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14754 if (nc
== linear_no_step
)
14756 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14760 return new_clauses
;
14763 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14766 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14769 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14771 tree purpose
, value
, chain
;
14776 if (TREE_CODE (t
) != TREE_LIST
)
14777 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14778 /*function_p=*/false,
14779 /*integral_constant_expression_p=*/false);
14781 if (t
== void_list_node
)
14784 purpose
= TREE_PURPOSE (t
);
14786 purpose
= RECUR (purpose
);
14787 value
= TREE_VALUE (t
);
14790 if (TREE_CODE (value
) != LABEL_DECL
)
14791 value
= RECUR (value
);
14794 value
= lookup_label (DECL_NAME (value
));
14795 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14796 TREE_USED (value
) = 1;
14799 chain
= TREE_CHAIN (t
);
14800 if (chain
&& chain
!= void_type_node
)
14801 chain
= RECUR (chain
);
14802 return tree_cons (purpose
, value
, chain
);
14806 /* Used to temporarily communicate the list of #pragma omp parallel
14807 clauses to #pragma omp for instantiation if they are combined
14810 static tree
*omp_parallel_combined_clauses
;
14812 /* Substitute one OMP_FOR iterator. */
14815 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14816 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14817 tree args
, tsubst_flags_t complain
, tree in_decl
,
14818 bool integral_constant_expression_p
)
14820 #define RECUR(NODE) \
14821 tsubst_expr ((NODE), args, complain, in_decl, \
14822 integral_constant_expression_p)
14823 tree decl
, init
, cond
, incr
;
14825 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14826 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14828 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14830 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14831 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14834 decl
= TREE_OPERAND (init
, 0);
14835 init
= TREE_OPERAND (init
, 1);
14836 tree decl_expr
= NULL_TREE
;
14837 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14839 /* We need to jump through some hoops to handle declarations in the
14840 for-init-statement, since we might need to handle auto deduction,
14841 but we need to keep control of initialization. */
14843 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14844 decl
= tsubst_decl (decl
, args
, complain
);
14848 if (TREE_CODE (decl
) == SCOPE_REF
)
14850 decl
= RECUR (decl
);
14851 if (TREE_CODE (decl
) == COMPONENT_REF
)
14855 switch (TREE_CODE (v
))
14857 case COMPONENT_REF
:
14861 case POINTER_PLUS_EXPR
:
14862 v
= TREE_OPERAND (v
, 0);
14865 if (DECL_CONTEXT (v
) == current_function_decl
14866 && DECL_ARTIFICIAL (v
)
14867 && DECL_NAME (v
) == this_identifier
)
14869 decl
= TREE_OPERAND (decl
, 1);
14870 decl
= omp_privatize_field (decl
, false);
14880 decl
= RECUR (decl
);
14882 init
= RECUR (init
);
14884 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14885 if (auto_node
&& init
)
14887 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14889 gcc_assert (!type_dependent_expression_p (decl
));
14891 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14895 /* Declare the variable, but don't let that initialize it. */
14896 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14897 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14899 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14902 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14903 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14904 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14906 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14907 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14908 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14909 NOP_EXPR
, rhs
, complain
);
14912 incr
= RECUR (incr
);
14913 TREE_VEC_ELT (declv
, i
) = decl
;
14914 TREE_VEC_ELT (initv
, i
) = init
;
14915 TREE_VEC_ELT (condv
, i
) = cond
;
14916 TREE_VEC_ELT (incrv
, i
) = incr
;
14922 /* Declare and initialize the variable. */
14930 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14932 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14934 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14935 && OMP_CLAUSE_DECL (*pc
) == decl
)
14937 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14938 && OMP_CLAUSE_DECL (*pc
) == decl
)
14942 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14944 *pc
= OMP_CLAUSE_CHAIN (c
);
14945 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14948 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14949 && OMP_CLAUSE_DECL (*pc
) == decl
)
14951 error ("iteration variable %qD should not be firstprivate",
14953 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14955 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14956 && OMP_CLAUSE_DECL (*pc
) == decl
)
14958 error ("iteration variable %qD should not be reduction",
14960 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14963 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14968 if (*pc
== NULL_TREE
)
14970 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14971 OMP_CLAUSE_DECL (c
) = decl
;
14972 c
= finish_omp_clauses (c
, C_ORT_OMP
);
14975 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14980 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14981 if (COMPARISON_CLASS_P (cond
))
14983 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14984 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14985 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14988 cond
= RECUR (cond
);
14989 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14990 switch (TREE_CODE (incr
))
14992 case PREINCREMENT_EXPR
:
14993 case PREDECREMENT_EXPR
:
14994 case POSTINCREMENT_EXPR
:
14995 case POSTDECREMENT_EXPR
:
14996 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14997 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
15000 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
15001 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
15003 tree rhs
= TREE_OPERAND (incr
, 1);
15004 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15005 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
15006 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
15007 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15008 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
15012 incr
= RECUR (incr
);
15015 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
15016 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
15018 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15019 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15020 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
15021 TREE_TYPE (decl
), lhs
,
15022 RECUR (TREE_OPERAND (incr
, 2))));
15024 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
15025 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
15026 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
15028 tree rhs
= TREE_OPERAND (incr
, 2);
15029 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15030 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
15031 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
15032 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15033 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
15037 incr
= RECUR (incr
);
15040 incr
= RECUR (incr
);
15044 TREE_VEC_ELT (declv
, i
) = decl
;
15045 TREE_VEC_ELT (initv
, i
) = init
;
15046 TREE_VEC_ELT (condv
, i
) = cond
;
15047 TREE_VEC_ELT (incrv
, i
) = incr
;
15051 /* Helper function of tsubst_expr, find OMP_TEAMS inside
15052 of OMP_TARGET's body. */
15055 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
15057 *walk_subtrees
= 0;
15058 switch (TREE_CODE (*tp
))
15063 case STATEMENT_LIST
:
15064 *walk_subtrees
= 1;
15072 /* Like tsubst_copy for expressions, etc. but also does semantic
15076 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
15077 bool integral_constant_expression_p
)
15079 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
15080 #define RECUR(NODE) \
15081 tsubst_expr ((NODE), args, complain, in_decl, \
15082 integral_constant_expression_p)
15088 if (t
== NULL_TREE
|| t
== error_mark_node
)
15091 loc
= input_location
;
15092 if (EXPR_HAS_LOCATION (t
))
15093 input_location
= EXPR_LOCATION (t
);
15094 if (STATEMENT_CODE_P (TREE_CODE (t
)))
15095 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
15097 switch (TREE_CODE (t
))
15099 case STATEMENT_LIST
:
15101 tree_stmt_iterator i
;
15102 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
15103 RECUR (tsi_stmt (i
));
15107 case CTOR_INITIALIZER
:
15108 finish_mem_initializers (tsubst_initializer_list
15109 (TREE_OPERAND (t
, 0), args
));
15113 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
15117 tmp
= RECUR (EXPR_STMT_EXPR (t
));
15118 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
15119 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
15121 finish_expr_stmt (tmp
);
15125 do_using_directive (USING_STMT_NAMESPACE (t
));
15130 tree decl
, pattern_decl
;
15133 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
15134 if (TREE_CODE (decl
) == LABEL_DECL
)
15135 finish_label_decl (DECL_NAME (decl
));
15136 else if (TREE_CODE (decl
) == USING_DECL
)
15138 tree scope
= USING_DECL_SCOPE (decl
);
15139 tree name
= DECL_NAME (decl
);
15141 scope
= tsubst (scope
, args
, complain
, in_decl
);
15142 decl
= lookup_qualified_name (scope
, name
,
15143 /*is_type_p=*/false,
15144 /*complain=*/false);
15145 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
15146 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
15148 do_local_using_decl (decl
, scope
, name
);
15150 else if (DECL_PACK_P (decl
))
15152 /* Don't build up decls for a variadic capture proxy, we'll
15153 instantiate the elements directly as needed. */
15158 init
= DECL_INITIAL (decl
);
15159 decl
= tsubst (decl
, args
, complain
, in_decl
);
15160 if (decl
!= error_mark_node
)
15162 /* By marking the declaration as instantiated, we avoid
15163 trying to instantiate it. Since instantiate_decl can't
15164 handle local variables, and since we've already done
15165 all that needs to be done, that's the right thing to
15168 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15170 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
15171 /* Anonymous aggregates are a special case. */
15172 finish_anon_union (decl
);
15173 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
15175 DECL_CONTEXT (decl
) = current_function_decl
;
15176 if (DECL_NAME (decl
) == this_identifier
)
15178 tree lam
= DECL_CONTEXT (current_function_decl
);
15179 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
15180 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
15182 insert_capture_proxy (decl
);
15184 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
15185 /* We already did a pushtag. */;
15186 else if (TREE_CODE (decl
) == FUNCTION_DECL
15187 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
15188 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
15190 DECL_CONTEXT (decl
) = NULL_TREE
;
15192 DECL_CONTEXT (decl
) = current_function_decl
;
15193 cp_check_omp_declare_reduction (decl
);
15197 int const_init
= false;
15198 maybe_push_decl (decl
);
15200 && DECL_PRETTY_FUNCTION_P (decl
))
15202 /* For __PRETTY_FUNCTION__ we have to adjust the
15204 const char *const name
15205 = cxx_printable_name (current_function_decl
, 2);
15206 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
15209 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
15212 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
15214 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
15223 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15224 RECUR (FOR_INIT_STMT (t
));
15225 finish_for_init_stmt (stmt
);
15226 tmp
= RECUR (FOR_COND (t
));
15227 finish_for_cond (tmp
, stmt
, false);
15228 tmp
= RECUR (FOR_EXPR (t
));
15229 finish_for_expr (tmp
, stmt
);
15230 RECUR (FOR_BODY (t
));
15231 finish_for_stmt (stmt
);
15234 case RANGE_FOR_STMT
:
15237 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15238 decl
= RANGE_FOR_DECL (t
);
15239 decl
= tsubst (decl
, args
, complain
, in_decl
);
15240 maybe_push_decl (decl
);
15241 expr
= RECUR (RANGE_FOR_EXPR (t
));
15242 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
15243 RECUR (RANGE_FOR_BODY (t
));
15244 finish_for_stmt (stmt
);
15249 stmt
= begin_while_stmt ();
15250 tmp
= RECUR (WHILE_COND (t
));
15251 finish_while_stmt_cond (tmp
, stmt
, false);
15252 RECUR (WHILE_BODY (t
));
15253 finish_while_stmt (stmt
);
15257 stmt
= begin_do_stmt ();
15258 RECUR (DO_BODY (t
));
15259 finish_do_body (stmt
);
15260 tmp
= RECUR (DO_COND (t
));
15261 finish_do_stmt (tmp
, stmt
, false);
15265 stmt
= begin_if_stmt ();
15266 tmp
= RECUR (IF_COND (t
));
15267 finish_if_stmt_cond (tmp
, stmt
);
15268 RECUR (THEN_CLAUSE (t
));
15269 finish_then_clause (stmt
);
15271 if (ELSE_CLAUSE (t
))
15273 begin_else_clause (stmt
);
15274 RECUR (ELSE_CLAUSE (t
));
15275 finish_else_clause (stmt
);
15278 finish_if_stmt (stmt
);
15282 if (BIND_EXPR_BODY_BLOCK (t
))
15283 stmt
= begin_function_body ();
15285 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15286 ? BCS_TRY_BLOCK
: 0);
15288 RECUR (BIND_EXPR_BODY (t
));
15290 if (BIND_EXPR_BODY_BLOCK (t
))
15291 finish_function_body (stmt
);
15293 finish_compound_stmt (stmt
);
15297 finish_break_stmt ();
15300 case CONTINUE_STMT
:
15301 finish_continue_stmt ();
15305 stmt
= begin_switch_stmt ();
15306 tmp
= RECUR (SWITCH_STMT_COND (t
));
15307 finish_switch_cond (tmp
, stmt
);
15308 RECUR (SWITCH_STMT_BODY (t
));
15309 finish_switch_stmt (stmt
);
15312 case CASE_LABEL_EXPR
:
15314 tree low
= RECUR (CASE_LOW (t
));
15315 tree high
= RECUR (CASE_HIGH (t
));
15316 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15322 tree decl
= LABEL_EXPR_LABEL (t
);
15325 label
= finish_label_stmt (DECL_NAME (decl
));
15326 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15327 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15332 tmp
= GOTO_DESTINATION (t
);
15333 if (TREE_CODE (tmp
) != LABEL_DECL
)
15334 /* Computed goto's must be tsubst'd into. On the other hand,
15335 non-computed gotos must not be; the identifier in question
15336 will have no binding. */
15339 tmp
= DECL_NAME (tmp
);
15340 finish_goto_stmt (tmp
);
15345 tree string
= RECUR (ASM_STRING (t
));
15346 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15347 complain
, in_decl
);
15348 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15349 complain
, in_decl
);
15350 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15351 complain
, in_decl
);
15352 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15353 complain
, in_decl
);
15354 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15356 tree asm_expr
= tmp
;
15357 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15358 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15359 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15366 stmt
= begin_try_block ();
15367 RECUR (TRY_STMTS (t
));
15368 finish_cleanup_try_block (stmt
);
15369 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15373 tree compound_stmt
= NULL_TREE
;
15375 if (FN_TRY_BLOCK_P (t
))
15376 stmt
= begin_function_try_block (&compound_stmt
);
15378 stmt
= begin_try_block ();
15380 RECUR (TRY_STMTS (t
));
15382 if (FN_TRY_BLOCK_P (t
))
15383 finish_function_try_block (stmt
);
15385 finish_try_block (stmt
);
15387 RECUR (TRY_HANDLERS (t
));
15388 if (FN_TRY_BLOCK_P (t
))
15389 finish_function_handler_sequence (stmt
, compound_stmt
);
15391 finish_handler_sequence (stmt
);
15397 tree decl
= HANDLER_PARMS (t
);
15401 decl
= tsubst (decl
, args
, complain
, in_decl
);
15402 /* Prevent instantiate_decl from trying to instantiate
15403 this variable. We've already done all that needs to be
15405 if (decl
!= error_mark_node
)
15406 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15408 stmt
= begin_handler ();
15409 finish_handler_parms (decl
, stmt
);
15410 RECUR (HANDLER_BODY (t
));
15411 finish_handler (stmt
);
15416 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15417 if (CLASS_TYPE_P (tmp
))
15419 /* Local classes are not independent templates; they are
15420 instantiated along with their containing function. And this
15421 way we don't have to deal with pushing out of one local class
15422 to instantiate a member of another local class. */
15424 /* Closures are handled by the LAMBDA_EXPR. */
15425 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15426 complete_type (tmp
);
15427 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15428 if (!DECL_ARTIFICIAL (fn
))
15429 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15433 case STATIC_ASSERT
:
15437 ++c_inhibit_evaluation_warnings
;
15439 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15442 /*integral_constant_expression_p=*/true);
15443 --c_inhibit_evaluation_warnings
;
15445 finish_static_assert (condition
,
15446 STATIC_ASSERT_MESSAGE (t
),
15447 STATIC_ASSERT_SOURCE_LOCATION (t
),
15448 /*member_p=*/false);
15453 case OACC_PARALLEL
:
15454 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_ACC
, args
, complain
,
15456 stmt
= begin_omp_parallel ();
15457 RECUR (OMP_BODY (t
));
15458 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
15462 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15463 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), C_ORT_OMP
, args
,
15464 complain
, in_decl
);
15465 if (OMP_PARALLEL_COMBINED (t
))
15466 omp_parallel_combined_clauses
= &tmp
;
15467 stmt
= begin_omp_parallel ();
15468 RECUR (OMP_PARALLEL_BODY (t
));
15469 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15470 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15471 = OMP_PARALLEL_COMBINED (t
);
15472 pop_omp_privatization_clauses (r
);
15476 r
= push_omp_privatization_clauses (false);
15477 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), C_ORT_OMP
, args
,
15478 complain
, in_decl
);
15479 stmt
= begin_omp_task ();
15480 RECUR (OMP_TASK_BODY (t
));
15481 finish_omp_task (tmp
, stmt
);
15482 pop_omp_privatization_clauses (r
);
15489 case OMP_DISTRIBUTE
:
15493 tree clauses
, body
, pre_body
;
15494 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15495 tree orig_declv
= NULL_TREE
;
15496 tree incrv
= NULL_TREE
;
15497 enum c_omp_region_type ort
= C_ORT_OMP
;
15500 if (TREE_CODE (t
) == CILK_SIMD
|| TREE_CODE (t
) == CILK_FOR
)
15502 else if (TREE_CODE (t
) == OACC_LOOP
)
15505 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15506 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), ort
, args
, complain
,
15508 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15510 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15511 if (OMP_FOR_ORIG_DECLS (t
))
15512 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15513 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15514 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15515 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15518 stmt
= begin_omp_structured_block ();
15520 pre_body
= push_stmt_list ();
15521 RECUR (OMP_FOR_PRE_BODY (t
));
15522 pre_body
= pop_stmt_list (pre_body
);
15524 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15525 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15526 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15527 incrv
, &clauses
, args
, complain
, in_decl
,
15528 integral_constant_expression_p
);
15529 omp_parallel_combined_clauses
= NULL
;
15531 body
= push_stmt_list ();
15532 RECUR (OMP_FOR_BODY (t
));
15533 body
= pop_stmt_list (body
);
15535 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15536 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15537 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15541 t
= make_node (TREE_CODE (t
));
15542 TREE_TYPE (t
) = void_type_node
;
15543 OMP_FOR_BODY (t
) = body
;
15544 OMP_FOR_PRE_BODY (t
) = pre_body
;
15545 OMP_FOR_CLAUSES (t
) = clauses
;
15546 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15550 add_stmt (finish_omp_structured_block (stmt
));
15551 pop_omp_privatization_clauses (r
);
15556 omp_parallel_combined_clauses
= NULL
;
15561 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15562 && OMP_TEAMS_COMBINED (t
));
15563 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), C_ORT_OMP
, args
, complain
,
15565 stmt
= push_stmt_list ();
15566 RECUR (OMP_BODY (t
));
15567 stmt
= pop_stmt_list (stmt
);
15570 OMP_BODY (t
) = stmt
;
15571 OMP_CLAUSES (t
) = tmp
;
15573 pop_omp_privatization_clauses (r
);
15577 case OMP_TARGET_DATA
:
15579 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), (TREE_CODE (t
) == OACC_DATA
)
15580 ? C_ORT_ACC
: C_ORT_OMP
, args
, complain
,
15582 keep_next_level (true);
15583 stmt
= begin_omp_structured_block ();
15585 RECUR (OMP_BODY (t
));
15586 stmt
= finish_omp_structured_block (stmt
);
15589 OMP_BODY (t
) = stmt
;
15590 OMP_CLAUSES (t
) = tmp
;
15591 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
15593 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
15596 /* For combined target teams, ensure the num_teams and
15597 thread_limit clause expressions are evaluated on the host,
15598 before entering the target construct. */
15600 for (c
= OMP_TEAMS_CLAUSES (teams
);
15601 c
; c
= OMP_CLAUSE_CHAIN (c
))
15602 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
15603 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
15604 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
15606 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
15607 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
15608 if (expr
== error_mark_node
)
15610 tmp
= TARGET_EXPR_SLOT (expr
);
15612 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
15613 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
15614 OMP_CLAUSE_FIRSTPRIVATE
);
15615 OMP_CLAUSE_DECL (tc
) = tmp
;
15616 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
15617 OMP_TARGET_CLAUSES (t
) = tc
;
15626 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), C_ORT_ACC
, args
,
15627 complain
, in_decl
);
15628 OACC_DECLARE_CLAUSES (t
) = tmp
;
15632 case OMP_TARGET_UPDATE
:
15633 case OMP_TARGET_ENTER_DATA
:
15634 case OMP_TARGET_EXIT_DATA
:
15635 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_OMP
, args
,
15636 complain
, in_decl
);
15638 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15642 case OACC_ENTER_DATA
:
15643 case OACC_EXIT_DATA
:
15645 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), C_ORT_ACC
, args
,
15646 complain
, in_decl
);
15648 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15653 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), C_ORT_OMP
, args
,
15654 complain
, in_decl
);
15655 stmt
= push_stmt_list ();
15656 RECUR (OMP_BODY (t
));
15657 stmt
= pop_stmt_list (stmt
);
15660 OMP_BODY (t
) = stmt
;
15661 OMP_ORDERED_CLAUSES (t
) = tmp
;
15667 case OMP_TASKGROUP
:
15668 stmt
= push_stmt_list ();
15669 RECUR (OMP_BODY (t
));
15670 stmt
= pop_stmt_list (stmt
);
15673 OMP_BODY (t
) = stmt
;
15678 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15679 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15681 tree op1
= TREE_OPERAND (t
, 1);
15682 tree rhs1
= NULL_TREE
;
15684 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15686 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15687 op1
= TREE_OPERAND (op1
, 1);
15689 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15690 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15691 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15692 NULL_TREE
, NULL_TREE
, rhs1
,
15693 OMP_ATOMIC_SEQ_CST (t
));
15697 tree op1
= TREE_OPERAND (t
, 1);
15698 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15699 tree rhs1
= NULL_TREE
;
15700 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15701 enum tree_code opcode
= NOP_EXPR
;
15702 if (code
== OMP_ATOMIC_READ
)
15704 v
= RECUR (TREE_OPERAND (op1
, 0));
15705 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15707 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15708 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15710 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15711 v
= RECUR (TREE_OPERAND (op1
, 0));
15712 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15713 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15715 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15716 op11
= TREE_OPERAND (op11
, 1);
15718 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15719 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15720 opcode
= TREE_CODE (op11
);
15721 if (opcode
== MODIFY_EXPR
)
15727 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15728 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15730 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15731 OMP_ATOMIC_SEQ_CST (t
));
15735 case TRANSACTION_EXPR
:
15738 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15739 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15741 if (TRANSACTION_EXPR_IS_STMT (t
))
15743 tree body
= TRANSACTION_EXPR_BODY (t
);
15744 tree noex
= NULL_TREE
;
15745 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15747 noex
= MUST_NOT_THROW_COND (body
);
15748 if (noex
== NULL_TREE
)
15749 noex
= boolean_true_node
;
15750 body
= TREE_OPERAND (body
, 0);
15752 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15754 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15758 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15759 RECUR (TRANSACTION_EXPR_BODY (t
)),
15766 case MUST_NOT_THROW_EXPR
:
15768 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15769 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15770 RETURN (build_must_not_throw_expr (op0
, cond
));
15773 case EXPR_PACK_EXPANSION
:
15774 error ("invalid use of pack expansion expression");
15775 RETURN (error_mark_node
);
15777 case NONTYPE_ARGUMENT_PACK
:
15778 error ("use %<...%> to expand argument pack");
15779 RETURN (error_mark_node
);
15781 case CILK_SPAWN_STMT
:
15782 cfun
->calls_cilk_spawn
= 1;
15783 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15785 case CILK_SYNC_STMT
:
15786 RETURN (build_cilk_sync ());
15788 case COMPOUND_EXPR
:
15789 tmp
= RECUR (TREE_OPERAND (t
, 0));
15790 if (tmp
== NULL_TREE
)
15791 /* If the first operand was a statement, we're done with it. */
15792 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15793 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15794 RECUR (TREE_OPERAND (t
, 1)),
15797 case ANNOTATE_EXPR
:
15798 tmp
= RECUR (TREE_OPERAND (t
, 0));
15799 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15800 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15803 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15805 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15806 /*function_p=*/false,
15807 integral_constant_expression_p
));
15810 RETURN (NULL_TREE
);
15812 input_location
= loc
;
15818 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15819 function. For description of the body see comment above
15820 cp_parser_omp_declare_reduction_exprs. */
15823 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15825 if (t
== NULL_TREE
|| t
== error_mark_node
)
15828 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15830 tree_stmt_iterator tsi
;
15833 memset (stmts
, 0, sizeof stmts
);
15834 for (i
= 0, tsi
= tsi_start (t
);
15835 i
< 7 && !tsi_end_p (tsi
);
15836 i
++, tsi_next (&tsi
))
15837 stmts
[i
] = tsi_stmt (tsi
);
15838 gcc_assert (tsi_end_p (tsi
));
15842 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15843 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15844 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15845 args
, complain
, in_decl
);
15846 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15847 args
, complain
, in_decl
);
15848 DECL_CONTEXT (omp_out
) = current_function_decl
;
15849 DECL_CONTEXT (omp_in
) = current_function_decl
;
15850 keep_next_level (true);
15851 tree block
= begin_omp_structured_block ();
15852 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15853 block
= finish_omp_structured_block (block
);
15854 block
= maybe_cleanup_point_expr_void (block
);
15855 add_decl_expr (omp_out
);
15856 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15857 TREE_NO_WARNING (omp_out
) = 1;
15858 add_decl_expr (omp_in
);
15859 finish_expr_stmt (block
);
15863 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15864 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15865 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15866 args
, complain
, in_decl
);
15867 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15868 args
, complain
, in_decl
);
15869 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15870 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15871 keep_next_level (true);
15872 tree block
= begin_omp_structured_block ();
15873 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15874 block
= finish_omp_structured_block (block
);
15875 block
= maybe_cleanup_point_expr_void (block
);
15876 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15877 add_decl_expr (omp_priv
);
15878 add_decl_expr (omp_orig
);
15879 finish_expr_stmt (block
);
15881 add_decl_expr (omp_orig
);
15885 /* T is a postfix-expression that is not being used in a function
15886 call. Return the substituted version of T. */
15889 tsubst_non_call_postfix_expression (tree t
, tree args
,
15890 tsubst_flags_t complain
,
15893 if (TREE_CODE (t
) == SCOPE_REF
)
15894 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15895 /*done=*/false, /*address_p=*/false);
15897 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15898 /*function_p=*/false,
15899 /*integral_constant_expression_p=*/false);
15904 /* Like tsubst but deals with expressions and performs semantic
15905 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15908 tsubst_copy_and_build (tree t
,
15910 tsubst_flags_t complain
,
15913 bool integral_constant_expression_p
)
15915 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15916 #define RECUR(NODE) \
15917 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15918 /*function_p=*/false, \
15919 integral_constant_expression_p)
15924 if (t
== NULL_TREE
|| t
== error_mark_node
)
15927 loc
= input_location
;
15928 if (EXPR_HAS_LOCATION (t
))
15929 input_location
= EXPR_LOCATION (t
);
15931 /* N3276 decltype magic only applies to calls at the top level or on the
15932 right side of a comma. */
15933 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15934 complain
&= ~tf_decltype
;
15936 switch (TREE_CODE (t
))
15940 /* Fall through. */
15941 case IDENTIFIER_NODE
:
15945 bool non_integral_constant_expression_p
;
15946 const char *error_msg
;
15948 if (IDENTIFIER_TYPENAME_P (t
))
15950 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15951 t
= mangle_conv_op_name_for_type (new_type
);
15954 /* Look up the name. */
15955 decl
= lookup_name (t
);
15957 /* By convention, expressions use ERROR_MARK_NODE to indicate
15958 failure, not NULL_TREE. */
15959 if (decl
== NULL_TREE
)
15960 decl
= error_mark_node
;
15962 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15964 integral_constant_expression_p
,
15965 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15966 &non_integral_constant_expression_p
,
15967 /*template_p=*/false,
15969 /*address_p=*/false,
15970 /*template_arg_p=*/false,
15975 if (!function_p
&& identifier_p (decl
))
15977 if (complain
& tf_error
)
15978 unqualified_name_lookup_error (decl
);
15979 decl
= error_mark_node
;
15984 case TEMPLATE_ID_EXPR
:
15987 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15988 tree targs
= TREE_OPERAND (t
, 1);
15991 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15992 if (targs
== error_mark_node
)
15993 return error_mark_node
;
15995 if (variable_template_p (templ
))
15996 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
15998 if (TREE_CODE (templ
) == COMPONENT_REF
)
16000 object
= TREE_OPERAND (templ
, 0);
16001 templ
= TREE_OPERAND (templ
, 1);
16004 object
= NULL_TREE
;
16005 templ
= lookup_template_function (templ
, targs
);
16008 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
16009 object
, templ
, NULL_TREE
));
16011 RETURN (baselink_for_fns (templ
));
16016 tree r
= RECUR (TREE_OPERAND (t
, 0));
16018 if (REFERENCE_REF_P (t
))
16020 /* A type conversion to reference type will be enclosed in
16021 such an indirect ref, but the substitution of the cast
16022 will have also added such an indirect ref. */
16023 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
16024 r
= convert_from_reference (r
);
16027 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
16028 complain
|decltype_flag
);
16030 if (TREE_CODE (r
) == INDIRECT_REF
)
16031 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16038 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16039 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16040 RETURN (build_nop (type
, op0
));
16043 case IMPLICIT_CONV_EXPR
:
16045 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16046 tree expr
= RECUR (TREE_OPERAND (t
, 0));
16047 int flags
= LOOKUP_IMPLICIT
;
16048 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
16049 flags
= LOOKUP_NORMAL
;
16050 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
16056 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16057 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16058 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
16062 case REINTERPRET_CAST_EXPR
:
16063 case CONST_CAST_EXPR
:
16064 case DYNAMIC_CAST_EXPR
:
16065 case STATIC_CAST_EXPR
:
16068 tree op
, r
= NULL_TREE
;
16070 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16071 if (integral_constant_expression_p
16072 && !cast_valid_in_integral_constant_expression_p (type
))
16074 if (complain
& tf_error
)
16075 error ("a cast to a type other than an integral or "
16076 "enumeration type cannot appear in a constant-expression");
16077 RETURN (error_mark_node
);
16080 op
= RECUR (TREE_OPERAND (t
, 0));
16082 warning_sentinel
s(warn_useless_cast
);
16083 switch (TREE_CODE (t
))
16086 r
= build_functional_cast (type
, op
, complain
);
16088 case REINTERPRET_CAST_EXPR
:
16089 r
= build_reinterpret_cast (type
, op
, complain
);
16091 case CONST_CAST_EXPR
:
16092 r
= build_const_cast (type
, op
, complain
);
16094 case DYNAMIC_CAST_EXPR
:
16095 r
= build_dynamic_cast (type
, op
, complain
);
16097 case STATIC_CAST_EXPR
:
16098 r
= build_static_cast (type
, op
, complain
);
16101 gcc_unreachable ();
16107 case POSTDECREMENT_EXPR
:
16108 case POSTINCREMENT_EXPR
:
16109 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16110 args
, complain
, in_decl
);
16111 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
16112 complain
|decltype_flag
));
16114 case PREDECREMENT_EXPR
:
16115 case PREINCREMENT_EXPR
:
16119 case TRUTH_NOT_EXPR
:
16120 case UNARY_PLUS_EXPR
: /* Unary + */
16121 case REALPART_EXPR
:
16122 case IMAGPART_EXPR
:
16123 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
16124 RECUR (TREE_OPERAND (t
, 0)),
16125 complain
|decltype_flag
));
16127 case FIX_TRUNC_EXPR
:
16128 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
16132 op1
= TREE_OPERAND (t
, 0);
16133 if (TREE_CODE (op1
) == LABEL_DECL
)
16134 RETURN (finish_label_address_expr (DECL_NAME (op1
),
16135 EXPR_LOCATION (op1
)));
16136 if (TREE_CODE (op1
) == SCOPE_REF
)
16137 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
16138 /*done=*/true, /*address_p=*/true);
16140 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
16142 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
16143 complain
|decltype_flag
));
16148 case TRUNC_DIV_EXPR
:
16149 case CEIL_DIV_EXPR
:
16150 case FLOOR_DIV_EXPR
:
16151 case ROUND_DIV_EXPR
:
16152 case EXACT_DIV_EXPR
:
16156 case TRUNC_MOD_EXPR
:
16157 case FLOOR_MOD_EXPR
:
16158 case TRUTH_ANDIF_EXPR
:
16159 case TRUTH_ORIF_EXPR
:
16160 case TRUTH_AND_EXPR
:
16161 case TRUTH_OR_EXPR
:
16177 warning_sentinel
s1(warn_type_limits
);
16178 warning_sentinel
s2(warn_div_by_zero
);
16179 warning_sentinel
s3(warn_logical_op
);
16180 warning_sentinel
s4(warn_tautological_compare
);
16181 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16182 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16183 tree r
= build_x_binary_op
16184 (input_location
, TREE_CODE (t
),
16186 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
16188 : TREE_CODE (TREE_OPERAND (t
, 0))),
16190 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
16192 : TREE_CODE (TREE_OPERAND (t
, 1))),
16194 complain
|decltype_flag
);
16195 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
16196 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16201 case POINTER_PLUS_EXPR
:
16203 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16204 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16205 return fold_build_pointer_plus (op0
, op1
);
16209 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
16210 /*address_p=*/false));
16212 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16213 args
, complain
, in_decl
);
16214 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
16215 RECUR (TREE_OPERAND (t
, 1)),
16216 complain
|decltype_flag
));
16218 case ARRAY_NOTATION_REF
:
16220 tree start_index
, length
, stride
;
16221 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
16222 args
, complain
, in_decl
);
16223 start_index
= RECUR (ARRAY_NOTATION_START (t
));
16224 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
16225 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
16226 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
16227 length
, stride
, TREE_TYPE (op1
)));
16230 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
16231 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
16232 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16239 op1
= TREE_OPERAND (t
, 0);
16240 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
16241 op1
= TREE_TYPE (op1
);
16244 /* When there are no ARGS, we are trying to evaluate a
16245 non-dependent expression from the parser. Trying to do
16246 the substitutions may not work. */
16248 op1
= TREE_TYPE (op1
);
16252 ++cp_unevaluated_operand
;
16253 ++c_inhibit_evaluation_warnings
;
16255 op1
= tsubst (op1
, args
, complain
, in_decl
);
16257 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16258 /*function_p=*/false,
16259 /*integral_constant_expression_p=*/
16261 --cp_unevaluated_operand
;
16262 --c_inhibit_evaluation_warnings
;
16265 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
16266 complain
& tf_error
);
16268 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
16269 complain
& tf_error
);
16270 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
16272 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
16274 if (!processing_template_decl
&& TYPE_P (op1
))
16276 r
= build_min (SIZEOF_EXPR
, size_type_node
,
16277 build1 (NOP_EXPR
, op1
, error_mark_node
));
16278 SIZEOF_EXPR_TYPE_P (r
) = 1;
16281 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
16282 TREE_SIDE_EFFECTS (r
) = 0;
16283 TREE_READONLY (r
) = 1;
16285 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
16290 case AT_ENCODE_EXPR
:
16292 op1
= TREE_OPERAND (t
, 0);
16293 ++cp_unevaluated_operand
;
16294 ++c_inhibit_evaluation_warnings
;
16295 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16296 /*function_p=*/false,
16297 /*integral_constant_expression_p=*/false);
16298 --cp_unevaluated_operand
;
16299 --c_inhibit_evaluation_warnings
;
16300 RETURN (objc_build_encode_expr (op1
));
16303 case NOEXCEPT_EXPR
:
16304 op1
= TREE_OPERAND (t
, 0);
16305 ++cp_unevaluated_operand
;
16306 ++c_inhibit_evaluation_warnings
;
16307 ++cp_noexcept_operand
;
16308 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16309 /*function_p=*/false,
16310 /*integral_constant_expression_p=*/false);
16311 --cp_unevaluated_operand
;
16312 --c_inhibit_evaluation_warnings
;
16313 --cp_noexcept_operand
;
16314 RETURN (finish_noexcept_expr (op1
, complain
));
16318 warning_sentinel
s(warn_div_by_zero
);
16319 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16320 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16321 tree r
= build_x_modify_expr
16322 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16323 complain
|decltype_flag
);
16324 /* TREE_NO_WARNING must be set if either the expression was
16325 parenthesized or it uses an operator such as >>= rather
16326 than plain assignment. In the former case, it was already
16327 set and must be copied. In the latter case,
16328 build_x_modify_expr sets it and it must not be reset
16330 if (TREE_NO_WARNING (t
))
16331 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16337 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16338 args
, complain
, in_decl
);
16339 /* Remember that there was a reference to this entity. */
16341 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16342 RETURN (error_mark_node
);
16343 RETURN (build_x_arrow (input_location
, op1
, complain
));
16347 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16348 tree init
= RECUR (TREE_OPERAND (t
, 3));
16349 vec
<tree
, va_gc
> *placement_vec
;
16350 vec
<tree
, va_gc
> *init_vec
;
16353 if (placement
== NULL_TREE
)
16354 placement_vec
= NULL
;
16357 placement_vec
= make_tree_vector ();
16358 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16359 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16362 /* If there was an initializer in the original tree, but it
16363 instantiated to an empty list, then we should pass a
16364 non-NULL empty vector to tell build_new that it was an
16365 empty initializer() rather than no initializer. This can
16366 only happen when the initializer is a pack expansion whose
16367 parameter packs are of length zero. */
16368 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16372 init_vec
= make_tree_vector ();
16373 if (init
== void_node
)
16374 gcc_assert (init_vec
!= NULL
);
16377 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16378 vec_safe_push (init_vec
, TREE_VALUE (init
));
16382 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16383 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16384 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16385 NEW_EXPR_USE_GLOBAL (t
),
16388 if (placement_vec
!= NULL
)
16389 release_tree_vector (placement_vec
);
16390 if (init_vec
!= NULL
)
16391 release_tree_vector (init_vec
);
16398 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16399 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16400 RETURN (delete_sanity (op0
, op1
,
16401 DELETE_EXPR_USE_VEC (t
),
16402 DELETE_EXPR_USE_GLOBAL (t
),
16406 case COMPOUND_EXPR
:
16408 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16409 complain
& ~tf_decltype
, in_decl
,
16410 /*function_p=*/false,
16411 integral_constant_expression_p
);
16412 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16414 RECUR (TREE_OPERAND (t
, 1)),
16415 complain
|decltype_flag
));
16421 vec
<tree
, va_gc
> *call_args
;
16422 unsigned int nargs
, i
;
16427 function
= CALL_EXPR_FN (t
);
16428 /* When we parsed the expression, we determined whether or
16429 not Koenig lookup should be performed. */
16430 koenig_p
= KOENIG_LOOKUP_P (t
);
16431 if (TREE_CODE (function
) == SCOPE_REF
)
16433 qualified_p
= true;
16434 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16436 /*address_p=*/false);
16438 else if (koenig_p
&& identifier_p (function
))
16440 /* Do nothing; calling tsubst_copy_and_build on an identifier
16441 would incorrectly perform unqualified lookup again.
16443 Note that we can also have an IDENTIFIER_NODE if the earlier
16444 unqualified lookup found a member function; in that case
16445 koenig_p will be false and we do want to do the lookup
16446 again to find the instantiated member function.
16448 FIXME but doing that causes c++/15272, so we need to stop
16449 using IDENTIFIER_NODE in that situation. */
16450 qualified_p
= false;
16454 if (TREE_CODE (function
) == COMPONENT_REF
)
16456 tree op
= TREE_OPERAND (function
, 1);
16458 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16459 || (BASELINK_P (op
)
16460 && BASELINK_QUALIFIED_P (op
)));
16463 qualified_p
= false;
16465 if (TREE_CODE (function
) == ADDR_EXPR
16466 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16467 /* Avoid error about taking the address of a constructor. */
16468 function
= TREE_OPERAND (function
, 0);
16470 function
= tsubst_copy_and_build (function
, args
, complain
,
16473 integral_constant_expression_p
);
16475 if (BASELINK_P (function
))
16476 qualified_p
= true;
16479 nargs
= call_expr_nargs (t
);
16480 call_args
= make_tree_vector ();
16481 for (i
= 0; i
< nargs
; ++i
)
16483 tree arg
= CALL_EXPR_ARG (t
, i
);
16485 if (!PACK_EXPANSION_P (arg
))
16486 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16489 /* Expand the pack expansion and push each entry onto
16491 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16492 if (TREE_CODE (arg
) == TREE_VEC
)
16494 unsigned int len
, j
;
16496 len
= TREE_VEC_LENGTH (arg
);
16497 for (j
= 0; j
< len
; ++j
)
16499 tree value
= TREE_VEC_ELT (arg
, j
);
16500 if (value
!= NULL_TREE
)
16501 value
= convert_from_reference (value
);
16502 vec_safe_push (call_args
, value
);
16507 /* A partial substitution. Add one entry. */
16508 vec_safe_push (call_args
, arg
);
16513 /* We do not perform argument-dependent lookup if normal
16514 lookup finds a non-function, in accordance with the
16515 expected resolution of DR 218. */
16517 && ((is_overloaded_fn (function
)
16518 /* If lookup found a member function, the Koenig lookup is
16519 not appropriate, even if an unqualified-name was used
16520 to denote the function. */
16521 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16522 || identifier_p (function
))
16523 /* Only do this when substitution turns a dependent call
16524 into a non-dependent call. */
16525 && type_dependent_expression_p_push (t
)
16526 && !any_type_dependent_arguments_p (call_args
))
16527 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16529 if (identifier_p (function
)
16530 && !any_type_dependent_arguments_p (call_args
))
16532 if (koenig_p
&& (complain
& tf_warning_or_error
))
16534 /* For backwards compatibility and good diagnostics, try
16535 the unqualified lookup again if we aren't in SFINAE
16537 tree unq
= (tsubst_copy_and_build
16538 (function
, args
, complain
, in_decl
, true,
16539 integral_constant_expression_p
));
16540 if (unq
== error_mark_node
)
16541 RETURN (error_mark_node
);
16543 if (unq
!= function
)
16546 if (INDIRECT_REF_P (fn
))
16547 fn
= TREE_OPERAND (fn
, 0);
16548 if (TREE_CODE (fn
) == COMPONENT_REF
)
16549 fn
= TREE_OPERAND (fn
, 1);
16550 if (is_overloaded_fn (fn
))
16551 fn
= get_first_fn (fn
);
16552 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16553 "%qD was not declared in this scope, "
16554 "and no declarations were found by "
16555 "argument-dependent lookup at the point "
16556 "of instantiation", function
))
16559 /* Can't say anything more. */;
16560 else if (DECL_CLASS_SCOPE_P (fn
))
16562 location_t loc
= EXPR_LOC_OR_LOC (t
,
16565 "declarations in dependent base %qT are "
16566 "not found by unqualified lookup",
16567 DECL_CLASS_CONTEXT (fn
));
16568 if (current_class_ptr
)
16570 "use %<this->%D%> instead", function
);
16573 "use %<%T::%D%> instead",
16574 current_class_name
, function
);
16577 inform (DECL_SOURCE_LOCATION (fn
),
16578 "%qD declared here, later in the "
16579 "translation unit", fn
);
16584 if (identifier_p (function
))
16586 if (complain
& tf_error
)
16587 unqualified_name_lookup_error (function
);
16588 release_tree_vector (call_args
);
16589 RETURN (error_mark_node
);
16593 /* Remember that there was a reference to this entity. */
16594 if (DECL_P (function
)
16595 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16596 RETURN (error_mark_node
);
16598 /* Put back tf_decltype for the actual call. */
16599 complain
|= decltype_flag
;
16601 if (TREE_CODE (function
) == OFFSET_REF
)
16602 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16604 else if (TREE_CODE (function
) == COMPONENT_REF
)
16606 tree instance
= TREE_OPERAND (function
, 0);
16607 tree fn
= TREE_OPERAND (function
, 1);
16609 if (processing_template_decl
16610 && (type_dependent_expression_p (instance
)
16611 || (!BASELINK_P (fn
)
16612 && TREE_CODE (fn
) != FIELD_DECL
)
16613 || type_dependent_expression_p (fn
)
16614 || any_type_dependent_arguments_p (call_args
)))
16615 ret
= build_nt_call_vec (function
, call_args
);
16616 else if (!BASELINK_P (fn
))
16617 ret
= finish_call_expr (function
, &call_args
,
16618 /*disallow_virtual=*/false,
16619 /*koenig_p=*/false,
16622 ret
= (build_new_method_call
16624 &call_args
, NULL_TREE
,
16625 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16630 ret
= finish_call_expr (function
, &call_args
,
16631 /*disallow_virtual=*/qualified_p
,
16635 release_tree_vector (call_args
);
16642 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16643 tree folded_cond
= fold_non_dependent_expr (cond
);
16646 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16648 if (integer_zerop (folded_cond
))
16650 ++c_inhibit_evaluation_warnings
;
16651 exp1
= RECUR (TREE_OPERAND (t
, 1));
16652 --c_inhibit_evaluation_warnings
;
16653 exp2
= RECUR (TREE_OPERAND (t
, 2));
16657 exp1
= RECUR (TREE_OPERAND (t
, 1));
16658 ++c_inhibit_evaluation_warnings
;
16659 exp2
= RECUR (TREE_OPERAND (t
, 2));
16660 --c_inhibit_evaluation_warnings
;
16662 cond
= folded_cond
;
16666 exp1
= RECUR (TREE_OPERAND (t
, 1));
16667 exp2
= RECUR (TREE_OPERAND (t
, 2));
16670 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16671 cond
, exp1
, exp2
, complain
));
16674 case PSEUDO_DTOR_EXPR
:
16676 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16677 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16678 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16679 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16685 tree purpose
, value
, chain
;
16687 if (t
== void_list_node
)
16690 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16691 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16693 /* We have pack expansions, so expand those and
16694 create a new list out of it. */
16695 tree purposevec
= NULL_TREE
;
16696 tree valuevec
= NULL_TREE
;
16700 /* Expand the argument expressions. */
16701 if (TREE_PURPOSE (t
))
16702 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16703 complain
, in_decl
);
16704 if (TREE_VALUE (t
))
16705 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16706 complain
, in_decl
);
16708 /* Build the rest of the list. */
16709 chain
= TREE_CHAIN (t
);
16710 if (chain
&& chain
!= void_type_node
)
16711 chain
= RECUR (chain
);
16713 /* Determine the number of arguments. */
16714 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16716 len
= TREE_VEC_LENGTH (purposevec
);
16717 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16719 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16720 len
= TREE_VEC_LENGTH (valuevec
);
16723 /* Since we only performed a partial substitution into
16724 the argument pack, we only RETURN (a single list
16726 if (purposevec
== TREE_PURPOSE (t
)
16727 && valuevec
== TREE_VALUE (t
)
16728 && chain
== TREE_CHAIN (t
))
16731 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16734 /* Convert the argument vectors into a TREE_LIST */
16738 /* Grab the Ith values. */
16740 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16743 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16746 /* Build the list (backwards). */
16747 chain
= tree_cons (purpose
, value
, chain
);
16753 purpose
= TREE_PURPOSE (t
);
16755 purpose
= RECUR (purpose
);
16756 value
= TREE_VALUE (t
);
16758 value
= RECUR (value
);
16759 chain
= TREE_CHAIN (t
);
16760 if (chain
&& chain
!= void_type_node
)
16761 chain
= RECUR (chain
);
16762 if (purpose
== TREE_PURPOSE (t
)
16763 && value
== TREE_VALUE (t
)
16764 && chain
== TREE_CHAIN (t
))
16766 RETURN (tree_cons (purpose
, value
, chain
));
16769 case COMPONENT_REF
:
16776 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16777 args
, complain
, in_decl
);
16778 /* Remember that there was a reference to this entity. */
16779 if (DECL_P (object
)
16780 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16781 RETURN (error_mark_node
);
16782 object_type
= TREE_TYPE (object
);
16784 member
= TREE_OPERAND (t
, 1);
16785 if (BASELINK_P (member
))
16786 member
= tsubst_baselink (member
,
16787 non_reference (TREE_TYPE (object
)),
16788 args
, complain
, in_decl
);
16790 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16791 if (member
== error_mark_node
)
16792 RETURN (error_mark_node
);
16794 if (type_dependent_expression_p (object
))
16795 /* We can't do much here. */;
16796 else if (!CLASS_TYPE_P (object_type
))
16798 if (scalarish_type_p (object_type
))
16800 tree s
= NULL_TREE
;
16801 tree dtor
= member
;
16803 if (TREE_CODE (dtor
) == SCOPE_REF
)
16805 s
= TREE_OPERAND (dtor
, 0);
16806 dtor
= TREE_OPERAND (dtor
, 1);
16808 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16810 dtor
= TREE_OPERAND (dtor
, 0);
16812 RETURN (finish_pseudo_destructor_expr
16813 (object
, s
, dtor
, input_location
));
16817 else if (TREE_CODE (member
) == SCOPE_REF
16818 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16820 /* Lookup the template functions now that we know what the
16822 tree scope
= TREE_OPERAND (member
, 0);
16823 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16824 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16825 member
= lookup_qualified_name (scope
, tmpl
,
16826 /*is_type_p=*/false,
16827 /*complain=*/false);
16828 if (BASELINK_P (member
))
16830 BASELINK_FUNCTIONS (member
)
16831 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16833 member
= (adjust_result_of_qualified_name_lookup
16834 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16839 qualified_name_lookup_error (scope
, tmpl
, member
,
16841 RETURN (error_mark_node
);
16844 else if (TREE_CODE (member
) == SCOPE_REF
16845 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16846 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16848 if (complain
& tf_error
)
16850 if (TYPE_P (TREE_OPERAND (member
, 0)))
16851 error ("%qT is not a class or namespace",
16852 TREE_OPERAND (member
, 0));
16854 error ("%qD is not a class or namespace",
16855 TREE_OPERAND (member
, 0));
16857 RETURN (error_mark_node
);
16859 else if (TREE_CODE (member
) == FIELD_DECL
)
16861 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16862 if (TREE_CODE (r
) == COMPONENT_REF
)
16863 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16867 r
= finish_class_member_access_expr (object
, member
,
16868 /*template_p=*/false,
16870 if (TREE_CODE (r
) == COMPONENT_REF
)
16871 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16876 RETURN (build_throw
16877 (RECUR (TREE_OPERAND (t
, 0))));
16881 vec
<constructor_elt
, va_gc
> *n
;
16882 constructor_elt
*ce
;
16883 unsigned HOST_WIDE_INT idx
;
16884 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16885 bool process_index_p
;
16887 bool need_copy_p
= false;
16890 if (type
== error_mark_node
)
16891 RETURN (error_mark_node
);
16893 /* digest_init will do the wrong thing if we let it. */
16894 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16897 /* We do not want to process the index of aggregate
16898 initializers as they are identifier nodes which will be
16899 looked up by digest_init. */
16900 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16902 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16903 newlen
= vec_safe_length (n
);
16904 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16906 if (ce
->index
&& process_index_p
16907 /* An identifier index is looked up in the type
16908 being initialized, not the current scope. */
16909 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16910 ce
->index
= RECUR (ce
->index
);
16912 if (PACK_EXPANSION_P (ce
->value
))
16914 /* Substitute into the pack expansion. */
16915 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16918 if (ce
->value
== error_mark_node
16919 || PACK_EXPANSION_P (ce
->value
))
16921 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16922 /* Just move the argument into place. */
16923 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16926 /* Update the length of the final CONSTRUCTOR
16927 arguments vector, and note that we will need to
16929 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16930 need_copy_p
= true;
16934 ce
->value
= RECUR (ce
->value
);
16939 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16941 vec_alloc (n
, newlen
);
16942 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16944 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16946 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16947 for (i
= 0; i
< len
; ++i
)
16948 CONSTRUCTOR_APPEND_ELT (n
, 0,
16949 TREE_VEC_ELT (ce
->value
, i
));
16952 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16956 r
= build_constructor (init_list_type_node
, n
);
16957 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16959 if (TREE_HAS_CONSTRUCTOR (t
))
16960 RETURN (finish_compound_literal (type
, r
, complain
));
16962 TREE_TYPE (r
) = type
;
16968 tree operand_0
= TREE_OPERAND (t
, 0);
16969 if (TYPE_P (operand_0
))
16971 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16972 RETURN (get_typeid (operand_0
, complain
));
16976 operand_0
= RECUR (operand_0
);
16977 RETURN (build_typeid (operand_0
, complain
));
16984 else if (DECL_PACK_P (t
))
16986 /* We don't build decls for an instantiation of a
16987 variadic capture proxy, we instantiate the elements
16989 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16990 return RECUR (DECL_VALUE_EXPR (t
));
16996 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16997 /* ??? We're doing a subset of finish_id_expression here. */
16999 && !processing_template_decl
17000 && !cp_unevaluated_operand
17001 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
17002 && CP_DECL_THREAD_LOCAL_P (r
))
17004 if (tree wrap
= get_tls_wrapper_fn (r
))
17005 /* Replace an evaluated use of the thread_local variable with
17006 a call to its wrapper. */
17007 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
17009 else if (outer_automatic_var_p (r
))
17011 r
= process_outer_var_ref (r
, complain
);
17012 if (is_capture_proxy (r
))
17013 register_local_specialization (r
, t
);
17016 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
17017 /* If the original type was a reference, we'll be wrapped in
17018 the appropriate INDIRECT_REF. */
17019 r
= convert_from_reference (r
);
17025 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17026 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17027 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
17030 case OFFSETOF_EXPR
:
17031 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
17032 EXPR_LOCATION (t
)));
17036 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
17037 complain
, in_decl
);
17039 tree type2
= TRAIT_EXPR_TYPE2 (t
);
17040 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
17041 type2
= RECUR (type2
);
17043 type2
= tsubst (type2
, args
, complain
, in_decl
);
17045 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
17050 tree old_stmt_expr
= cur_stmt_expr
;
17051 tree stmt_expr
= begin_stmt_expr ();
17053 cur_stmt_expr
= stmt_expr
;
17054 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
17055 integral_constant_expression_p
);
17056 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
17057 cur_stmt_expr
= old_stmt_expr
;
17059 /* If the resulting list of expression statement is empty,
17060 fold it further into void_node. */
17061 if (empty_expr_stmt_p (stmt_expr
))
17062 stmt_expr
= void_node
;
17064 RETURN (stmt_expr
);
17069 tree r
= build_lambda_expr ();
17071 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
17072 LAMBDA_EXPR_CLOSURE (r
) = type
;
17073 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
17075 LAMBDA_EXPR_LOCATION (r
)
17076 = LAMBDA_EXPR_LOCATION (t
);
17077 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
17078 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
17079 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
17080 LAMBDA_EXPR_DISCRIMINATOR (r
)
17081 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
17082 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
17084 /* No substitution needed. */;
17085 else if (VAR_OR_FUNCTION_DECL_P (scope
))
17086 /* For a function or variable scope, we want to use tsubst so that we
17087 don't complain about referring to an auto before deduction. */
17088 scope
= tsubst (scope
, args
, complain
, in_decl
);
17089 else if (TREE_CODE (scope
) == PARM_DECL
)
17091 /* Look up the parameter we want directly, as tsubst_copy
17092 doesn't do what we need. */
17093 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
17094 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
17095 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
17096 parm
= DECL_CHAIN (parm
);
17098 /* FIXME Work around the parm not having DECL_CONTEXT set. */
17099 if (DECL_CONTEXT (scope
) == NULL_TREE
)
17100 DECL_CONTEXT (scope
) = fn
;
17102 else if (TREE_CODE (scope
) == FIELD_DECL
)
17103 /* For a field, use tsubst_copy so that we look up the existing field
17104 rather than build a new one. */
17105 scope
= RECUR (scope
);
17107 gcc_unreachable ();
17108 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
17110 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
17111 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
17113 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17114 determine_visibility (TYPE_NAME (type
));
17115 /* Now that we know visibility, instantiate the type so we have a
17116 declaration of the op() for later calls to lambda_function. */
17117 complete_type (type
);
17119 if (tree fn
= lambda_function (type
))
17120 LAMBDA_EXPR_RETURN_TYPE (r
) = TREE_TYPE (TREE_TYPE (fn
));
17122 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
17124 insert_pending_capture_proxies ();
17126 RETURN (build_lambda_object (r
));
17130 /* We can get here for a constant initializer of non-dependent type.
17131 FIXME stop folding in cp_parser_initializer_clause. */
17133 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
17138 case TRANSACTION_EXPR
:
17139 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
17140 integral_constant_expression_p
));
17143 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
17145 case VEC_PERM_EXPR
:
17147 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17148 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17149 tree op2
= RECUR (TREE_OPERAND (t
, 2));
17150 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
17154 case REQUIRES_EXPR
:
17155 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
17158 /* Handle Objective-C++ constructs, if appropriate. */
17161 = objcp_tsubst_copy_and_build (t
, args
, complain
,
17162 in_decl
, /*function_p=*/false);
17166 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
17172 input_location
= loc
;
17176 /* Verify that the instantiated ARGS are valid. For type arguments,
17177 make sure that the type's linkage is ok. For non-type arguments,
17178 make sure they are constants if they are integral or enumerations.
17179 Emit an error under control of COMPLAIN, and return TRUE on error. */
17182 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
17184 if (dependent_template_arg_p (t
))
17186 if (ARGUMENT_PACK_P (t
))
17188 tree vec
= ARGUMENT_PACK_ARGS (t
);
17189 int len
= TREE_VEC_LENGTH (vec
);
17190 bool result
= false;
17193 for (i
= 0; i
< len
; ++i
)
17194 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
17198 else if (TYPE_P (t
))
17200 /* [basic.link]: A name with no linkage (notably, the name
17201 of a class or enumeration declared in a local scope)
17202 shall not be used to declare an entity with linkage.
17203 This implies that names with no linkage cannot be used as
17206 DR 757 relaxes this restriction for C++0x. */
17207 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
17208 : no_linkage_check (t
, /*relaxed_p=*/false));
17212 /* DR 488 makes use of a type with no linkage cause
17213 type deduction to fail. */
17214 if (complain
& tf_error
)
17216 if (TYPE_ANONYMOUS_P (nt
))
17217 error ("%qT is/uses anonymous type", t
);
17219 error ("template argument for %qD uses local type %qT",
17224 /* In order to avoid all sorts of complications, we do not
17225 allow variably-modified types as template arguments. */
17226 else if (variably_modified_type_p (t
, NULL_TREE
))
17228 if (complain
& tf_error
)
17229 error ("%qT is a variably modified type", t
);
17233 /* Class template and alias template arguments should be OK. */
17234 else if (DECL_TYPE_TEMPLATE_P (t
))
17236 /* A non-type argument of integral or enumerated type must be a
17238 else if (TREE_TYPE (t
)
17239 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
17240 && !REFERENCE_REF_P (t
)
17241 && !TREE_CONSTANT (t
))
17243 if (complain
& tf_error
)
17244 error ("integral expression %qE is not constant", t
);
17251 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
17253 int ix
, len
= DECL_NTPARMS (tmpl
);
17254 bool result
= false;
17256 for (ix
= 0; ix
!= len
; ix
++)
17258 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
17261 if (result
&& (complain
& tf_error
))
17262 error (" trying to instantiate %qD", tmpl
);
17266 /* We're out of SFINAE context now, so generate diagnostics for the access
17267 errors we saw earlier when instantiating D from TMPL and ARGS. */
17270 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
17272 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17273 tree type
= TREE_TYPE (pattern
);
17274 location_t loc
= input_location
;
17276 push_access_scope (d
);
17277 push_deferring_access_checks (dk_no_deferred
);
17278 input_location
= DECL_SOURCE_LOCATION (pattern
);
17279 tsubst (type
, args
, tf_warning_or_error
, d
);
17280 input_location
= loc
;
17281 pop_deferring_access_checks ();
17282 pop_access_scope (d
);
17285 /* Instantiate the indicated variable, function, or alias template TMPL with
17286 the template arguments in TARG_PTR. */
17289 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17291 tree targ_ptr
= orig_args
;
17295 bool access_ok
= true;
17297 if (tmpl
== error_mark_node
)
17298 return error_mark_node
;
17300 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
17302 /* If this function is a clone, handle it specially. */
17303 if (DECL_CLONED_FUNCTION_P (tmpl
))
17308 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
17309 DECL_CLONED_FUNCTION. */
17310 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17311 targ_ptr
, complain
);
17312 if (spec
== error_mark_node
)
17313 return error_mark_node
;
17315 /* Look for the clone. */
17316 FOR_EACH_CLONE (clone
, spec
)
17317 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17319 /* We should always have found the clone by now. */
17320 gcc_unreachable ();
17324 if (targ_ptr
== error_mark_node
)
17325 return error_mark_node
;
17327 /* Check to see if we already have this specialization. */
17328 gen_tmpl
= most_general_template (tmpl
);
17329 if (TMPL_ARGS_DEPTH (targ_ptr
)
17330 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
)))
17331 /* targ_ptr only has the innermost template args, so add the outer ones
17332 from tmpl, which could be either a partial instantiation or gen_tmpl (in
17333 the case of a non-dependent call within a template definition). */
17334 targ_ptr
= (add_outermost_template_args
17335 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (tmpl
)),
17338 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17339 but it doesn't seem to be on the hot path. */
17340 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17342 gcc_assert (tmpl
== gen_tmpl
17343 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17345 || fndecl
== NULL_TREE
);
17347 if (spec
!= NULL_TREE
)
17349 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17351 if (complain
& tf_error
)
17352 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17353 return error_mark_node
;
17358 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17360 return error_mark_node
;
17362 /* We are building a FUNCTION_DECL, during which the access of its
17363 parameters and return types have to be checked. However this
17364 FUNCTION_DECL which is the desired context for access checking
17365 is not built yet. We solve this chicken-and-egg problem by
17366 deferring all checks until we have the FUNCTION_DECL. */
17367 push_deferring_access_checks (dk_deferred
);
17369 /* Instantiation of the function happens in the context of the function
17370 template, not the context of the overload resolution we're doing. */
17371 push_to_top_level ();
17372 /* If there are dependent arguments, e.g. because we're doing partial
17373 ordering, make sure processing_template_decl stays set. */
17374 if (uses_template_parms (targ_ptr
))
17375 ++processing_template_decl
;
17376 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17378 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17379 complain
, gen_tmpl
, true);
17380 push_nested_class (ctx
);
17383 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17385 if (VAR_P (pattern
))
17387 /* We need to determine if we're using a partial or explicit
17388 specialization now, because the type of the variable could be
17390 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17391 tree elt
= most_specialized_partial_spec (tid
, complain
);
17392 if (elt
== error_mark_node
)
17393 pattern
= error_mark_node
;
17396 tmpl
= TREE_VALUE (elt
);
17397 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17398 targ_ptr
= TREE_PURPOSE (elt
);
17402 /* Substitute template parameters to obtain the specialization. */
17403 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17404 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17405 pop_nested_class ();
17406 pop_from_top_level ();
17408 if (fndecl
== error_mark_node
)
17410 pop_deferring_access_checks ();
17411 return error_mark_node
;
17414 /* The DECL_TI_TEMPLATE should always be the immediate parent
17415 template, not the most general template. */
17416 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17417 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17419 /* Now we know the specialization, compute access previously
17421 push_access_scope (fndecl
);
17422 if (!perform_deferred_access_checks (complain
))
17424 pop_access_scope (fndecl
);
17425 pop_deferring_access_checks ();
17427 /* If we've just instantiated the main entry point for a function,
17428 instantiate all the alternate entry points as well. We do this
17429 by cloning the instantiation of the main entry point, not by
17430 instantiating the template clones. */
17431 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17432 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17436 if (!(complain
& tf_error
))
17438 /* Remember to reinstantiate when we're out of SFINAE so the user
17439 can see the errors. */
17440 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17442 return error_mark_node
;
17447 /* Wrapper for instantiate_template_1. */
17450 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17453 timevar_push (TV_TEMPLATE_INST
);
17454 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17455 timevar_pop (TV_TEMPLATE_INST
);
17459 /* Instantiate the alias template TMPL with ARGS. Also push a template
17460 instantiation level, which instantiate_template doesn't do because
17461 functions and variables have sufficient context established by the
17465 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17467 struct pending_template
*old_last_pend
= last_pending_template
;
17468 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17469 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17470 return error_mark_node
;
17471 tree tinst
= build_tree_list (tmpl
, args
);
17472 if (!push_tinst_level (tinst
))
17475 return error_mark_node
;
17479 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17480 args
, tmpl
, complain
,
17481 /*require_all_args=*/true,
17482 /*use_default_args=*/true);
17484 tree r
= instantiate_template (tmpl
, args
, complain
);
17485 pop_tinst_level ();
17486 /* We can't free this if a pending_template entry or last_error_tinst_level
17487 is pointing at it. */
17488 if (last_pending_template
== old_last_pend
17489 && last_error_tinst_level
== old_error_tinst
)
17495 /* PARM is a template parameter pack for FN. Returns true iff
17496 PARM is used in a deducible way in the argument list of FN. */
17499 pack_deducible_p (tree parm
, tree fn
)
17501 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17502 for (; t
; t
= TREE_CHAIN (t
))
17504 tree type
= TREE_VALUE (t
);
17506 if (!PACK_EXPANSION_P (type
))
17508 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17509 packs
; packs
= TREE_CHAIN (packs
))
17510 if (template_args_equal (TREE_VALUE (packs
), parm
))
17512 /* The template parameter pack is used in a function parameter
17513 pack. If this is the end of the parameter list, the
17514 template parameter pack is deducible. */
17515 if (TREE_CHAIN (t
) == void_list_node
)
17518 /* Otherwise, not. Well, it could be deduced from
17519 a non-pack parameter, but doing so would end up with
17520 a deduction mismatch, so don't bother. */
17524 /* The template parameter pack isn't used in any function parameter
17525 packs, but it might be used deeper, e.g. tuple<Args...>. */
17529 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17530 NARGS elements of the arguments that are being used when calling
17531 it. TARGS is a vector into which the deduced template arguments
17534 Returns either a FUNCTION_DECL for the matching specialization of FN or
17535 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17536 true, diagnostics will be printed to explain why it failed.
17538 If FN is a conversion operator, or we are trying to produce a specific
17539 specialization, RETURN_TYPE is the return type desired.
17541 The EXPLICIT_TARGS are explicit template arguments provided via a
17544 The parameter STRICT is one of:
17547 We are deducing arguments for a function call, as in
17548 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17549 deducing arguments for a call to the result of a conversion
17550 function template, as in [over.call.object].
17553 We are deducing arguments for a conversion function, as in
17554 [temp.deduct.conv].
17557 We are deducing arguments when doing an explicit instantiation
17558 as in [temp.explicit], when determining an explicit specialization
17559 as in [temp.expl.spec], or when taking the address of a function
17560 template, as in [temp.deduct.funcaddr]. */
17563 fn_type_unification (tree fn
,
17564 tree explicit_targs
,
17567 unsigned int nargs
,
17569 unification_kind_t strict
,
17576 tree decl
= NULL_TREE
;
17577 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17579 static int deduction_depth
;
17580 struct pending_template
*old_last_pend
= last_pending_template
;
17581 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17582 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17584 tree r
= error_mark_node
;
17586 tree full_targs
= targs
;
17587 if (TMPL_ARGS_DEPTH (targs
)
17588 < TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (fn
)))
17589 full_targs
= (add_outermost_template_args
17590 (DECL_TI_ARGS (DECL_TEMPLATE_RESULT (fn
)),
17594 complain
|= tf_decltype
;
17596 /* In C++0x, it's possible to have a function template whose type depends
17597 on itself recursively. This is most obvious with decltype, but can also
17598 occur with enumeration scope (c++/48969). So we need to catch infinite
17599 recursion and reject the substitution at deduction time; this function
17600 will return error_mark_node for any repeated substitution.
17602 This also catches excessive recursion such as when f<N> depends on
17603 f<N-1> across all integers, and returns error_mark_node for all the
17604 substitutions back up to the initial one.
17606 This is, of course, not reentrant. */
17607 if (excessive_deduction_depth
)
17608 return error_mark_node
;
17609 tinst
= build_tree_list (fn
, NULL_TREE
);
17612 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17614 fntype
= TREE_TYPE (fn
);
17615 if (explicit_targs
)
17619 The specified template arguments must match the template
17620 parameters in kind (i.e., type, nontype, template), and there
17621 must not be more arguments than there are parameters;
17622 otherwise type deduction fails.
17624 Nontype arguments must match the types of the corresponding
17625 nontype template parameters, or must be convertible to the
17626 types of the corresponding nontype parameters as specified in
17627 _temp.arg.nontype_, otherwise type deduction fails.
17629 All references in the function type of the function template
17630 to the corresponding template parameters are replaced by the
17631 specified template argument values. If a substitution in a
17632 template parameter or in the function type of the function
17633 template results in an invalid type, type deduction fails. */
17634 int i
, len
= TREE_VEC_LENGTH (tparms
);
17635 location_t loc
= input_location
;
17636 bool incomplete
= false;
17638 if (explicit_targs
== error_mark_node
)
17641 if (TMPL_ARGS_DEPTH (explicit_targs
)
17642 < TMPL_ARGS_DEPTH (full_targs
))
17643 explicit_targs
= add_outermost_template_args (full_targs
,
17646 /* Adjust any explicit template arguments before entering the
17647 substitution context. */
17649 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17651 /*require_all_args=*/false,
17652 /*use_default_args=*/false));
17653 if (explicit_targs
== error_mark_node
)
17656 /* Substitute the explicit args into the function type. This is
17657 necessary so that, for instance, explicitly declared function
17658 arguments can match null pointed constants. If we were given
17659 an incomplete set of explicit args, we must not do semantic
17660 processing during substitution as we could create partial
17662 for (i
= 0; i
< len
; i
++)
17664 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17665 bool parameter_pack
= false;
17666 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17668 /* Dig out the actual parm. */
17669 if (TREE_CODE (parm
) == TYPE_DECL
17670 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17672 parm
= TREE_TYPE (parm
);
17673 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17675 else if (TREE_CODE (parm
) == PARM_DECL
)
17677 parm
= DECL_INITIAL (parm
);
17678 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17681 if (!parameter_pack
&& targ
== NULL_TREE
)
17682 /* No explicit argument for this template parameter. */
17685 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17687 /* Mark the argument pack as "incomplete". We could
17688 still deduce more arguments during unification.
17689 We remove this mark in type_unification_real. */
17692 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17693 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17694 = ARGUMENT_PACK_ARGS (targ
);
17697 /* We have some incomplete argument packs. */
17702 TREE_VALUE (tinst
) = explicit_targs
;
17703 if (!push_tinst_level (tinst
))
17705 excessive_deduction_depth
= true;
17708 processing_template_decl
+= incomplete
;
17709 input_location
= DECL_SOURCE_LOCATION (fn
);
17710 /* Ignore any access checks; we'll see them again in
17711 instantiate_template and they might have the wrong
17712 access path at this point. */
17713 push_deferring_access_checks (dk_deferred
);
17714 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17715 complain
| tf_partial
, NULL_TREE
);
17716 pop_deferring_access_checks ();
17717 input_location
= loc
;
17718 processing_template_decl
-= incomplete
;
17719 pop_tinst_level ();
17721 if (fntype
== error_mark_node
)
17724 /* Place the explicitly specified arguments in TARGS. */
17725 explicit_targs
= INNERMOST_TEMPLATE_ARGS (explicit_targs
);
17726 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17727 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17730 /* Never do unification on the 'this' parameter. */
17731 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17733 if (return_type
&& strict
== DEDUCE_CALL
)
17735 /* We're deducing for a call to the result of a template conversion
17736 function. The parms we really want are in return_type. */
17737 if (POINTER_TYPE_P (return_type
))
17738 return_type
= TREE_TYPE (return_type
);
17739 parms
= TYPE_ARG_TYPES (return_type
);
17741 else if (return_type
)
17745 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17746 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17747 new_args
[0] = return_type
;
17748 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17753 /* We allow incomplete unification without an error message here
17754 because the standard doesn't seem to explicitly prohibit it. Our
17755 callers must be ready to deal with unification failures in any
17758 TREE_VALUE (tinst
) = targs
;
17759 /* If we aren't explaining yet, push tinst context so we can see where
17760 any errors (e.g. from class instantiations triggered by instantiation
17761 of default template arguments) come from. If we are explaining, this
17762 context is redundant. */
17763 if (!explain_p
&& !push_tinst_level (tinst
))
17765 excessive_deduction_depth
= true;
17769 /* type_unification_real will pass back any access checks from default
17770 template argument substitution. */
17771 vec
<deferred_access_check
, va_gc
> *checks
;
17774 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17775 full_targs
, parms
, args
, nargs
, /*subr=*/0,
17776 strict
, flags
, &checks
, explain_p
);
17778 pop_tinst_level ();
17782 /* Now that we have bindings for all of the template arguments,
17783 ensure that the arguments deduced for the template template
17784 parameters have compatible template parameter lists. We cannot
17785 check this property before we have deduced all template
17786 arguments, because the template parameter types of a template
17787 template parameter might depend on prior template parameters
17788 deduced after the template template parameter. The following
17789 ill-formed example illustrates this issue:
17791 template<typename T, template<T> class C> void f(C<5>, T);
17793 template<int N> struct X {};
17796 f(X<5>(), 5l); // error: template argument deduction fails
17799 The template parameter list of 'C' depends on the template type
17800 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17801 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17802 time that we deduce 'C'. */
17803 if (!template_template_parm_bindings_ok_p
17804 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17806 unify_inconsistent_template_template_parameters (explain_p
);
17810 /* All is well so far. Now, check:
17814 When all template arguments have been deduced, all uses of
17815 template parameters in nondeduced contexts are replaced with
17816 the corresponding deduced argument values. If the
17817 substitution results in an invalid type, as described above,
17818 type deduction fails. */
17819 TREE_VALUE (tinst
) = targs
;
17820 if (!push_tinst_level (tinst
))
17822 excessive_deduction_depth
= true;
17826 /* Also collect access checks from the instantiation. */
17827 reopen_deferring_access_checks (checks
);
17829 decl
= instantiate_template (fn
, targs
, complain
);
17831 checks
= get_deferred_access_checks ();
17832 pop_deferring_access_checks ();
17834 pop_tinst_level ();
17836 if (decl
== error_mark_node
)
17839 /* Now perform any access checks encountered during substitution. */
17840 push_access_scope (decl
);
17841 ok
= perform_access_checks (checks
, complain
);
17842 pop_access_scope (decl
);
17846 /* If we're looking for an exact match, check that what we got
17847 is indeed an exact match. It might not be if some template
17848 parameters are used in non-deduced contexts. But don't check
17849 for an exact match if we have dependent template arguments;
17850 in that case we're doing partial ordering, and we already know
17851 that we have two candidates that will provide the actual type. */
17852 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17854 tree substed
= TREE_TYPE (decl
);
17858 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17860 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17861 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17862 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17864 unify_type_mismatch (explain_p
, args
[i
],
17865 TREE_VALUE (sarg
));
17874 if (excessive_deduction_depth
)
17876 if (deduction_depth
== 0)
17877 /* Reset once we're all the way out. */
17878 excessive_deduction_depth
= false;
17881 /* We can't free this if a pending_template entry or last_error_tinst_level
17882 is pointing at it. */
17883 if (last_pending_template
== old_last_pend
17884 && last_error_tinst_level
== old_error_tinst
)
17890 /* Adjust types before performing type deduction, as described in
17891 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17892 sections are symmetric. PARM is the type of a function parameter
17893 or the return type of the conversion function. ARG is the type of
17894 the argument passed to the call, or the type of the value
17895 initialized with the result of the conversion function.
17896 ARG_EXPR is the original argument expression, which may be null. */
17899 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17912 /* Swap PARM and ARG throughout the remainder of this
17913 function; the handling is precisely symmetric since PARM
17914 will initialize ARG rather than vice versa. */
17915 std::swap (parm
, arg
);
17919 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17920 too, but here handle it by stripping the reference from PARM
17921 rather than by adding it to ARG. */
17922 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17923 && TYPE_REF_IS_RVALUE (*parm
)
17924 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17925 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17926 && TREE_CODE (*arg
) == REFERENCE_TYPE
17927 && !TYPE_REF_IS_RVALUE (*arg
))
17928 *parm
= TREE_TYPE (*parm
);
17929 /* Nothing else to do in this case. */
17933 gcc_unreachable ();
17936 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17938 /* [temp.deduct.call]
17940 If P is not a reference type:
17942 --If A is an array type, the pointer type produced by the
17943 array-to-pointer standard conversion (_conv.array_) is
17944 used in place of A for type deduction; otherwise,
17946 --If A is a function type, the pointer type produced by
17947 the function-to-pointer standard conversion
17948 (_conv.func_) is used in place of A for type deduction;
17951 --If A is a cv-qualified type, the top level
17952 cv-qualifiers of A's type are ignored for type
17954 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17955 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17956 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17957 *arg
= build_pointer_type (*arg
);
17959 *arg
= TYPE_MAIN_VARIANT (*arg
);
17962 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17963 of the form T&&, where T is a template parameter, and the argument
17964 is an lvalue, T is deduced as A& */
17965 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17966 && TYPE_REF_IS_RVALUE (*parm
)
17967 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17968 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17969 && (arg_expr
? real_lvalue_p (arg_expr
)
17970 /* try_one_overload doesn't provide an arg_expr, but
17971 functions are always lvalues. */
17972 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17973 *arg
= build_reference_type (*arg
);
17975 /* [temp.deduct.call]
17977 If P is a cv-qualified type, the top level cv-qualifiers
17978 of P's type are ignored for type deduction. If P is a
17979 reference type, the type referred to by P is used for
17981 *parm
= TYPE_MAIN_VARIANT (*parm
);
17982 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17984 *parm
= TREE_TYPE (*parm
);
17985 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17988 /* DR 322. For conversion deduction, remove a reference type on parm
17989 too (which has been swapped into ARG). */
17990 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17991 *arg
= TREE_TYPE (*arg
);
17996 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17997 template which does contain any deducible template parameters; check if
17998 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17999 unify_one_argument. */
18002 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
18003 int flags
, bool explain_p
)
18008 type
= TREE_TYPE (arg
);
18012 if (same_type_p (parm
, type
))
18013 return unify_success (explain_p
);
18015 if (strict
== DEDUCE_CONV
)
18017 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
18018 explain_p
? tf_warning_or_error
: tf_none
))
18019 return unify_success (explain_p
);
18021 else if (strict
!= DEDUCE_EXACT
)
18023 if (can_convert_arg (parm
, type
,
18024 TYPE_P (arg
) ? NULL_TREE
: arg
,
18025 flags
, explain_p
? tf_warning_or_error
: tf_none
))
18026 return unify_success (explain_p
);
18029 if (strict
== DEDUCE_EXACT
)
18030 return unify_type_mismatch (explain_p
, parm
, arg
);
18032 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
18035 static bool uses_deducible_template_parms (tree type
);
18037 /* Returns true iff the expression EXPR is one from which a template
18038 argument can be deduced. In other words, if it's an undecorated
18039 use of a template non-type parameter. */
18042 deducible_expression (tree expr
)
18044 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
18047 /* Returns true iff the array domain DOMAIN uses a template parameter in a
18048 deducible way; that is, if it has a max value of <PARM> - 1. */
18051 deducible_array_bound (tree domain
)
18053 if (domain
== NULL_TREE
)
18056 tree max
= TYPE_MAX_VALUE (domain
);
18057 if (TREE_CODE (max
) != MINUS_EXPR
)
18060 return deducible_expression (TREE_OPERAND (max
, 0));
18063 /* Returns true iff the template arguments ARGS use a template parameter
18064 in a deducible way. */
18067 deducible_template_args (tree args
)
18069 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
18072 tree elt
= TREE_VEC_ELT (args
, i
);
18073 if (ARGUMENT_PACK_P (elt
))
18074 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
18077 if (PACK_EXPANSION_P (elt
))
18078 elt
= PACK_EXPANSION_PATTERN (elt
);
18079 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
18081 else if (TYPE_P (elt
))
18082 deducible
= uses_deducible_template_parms (elt
);
18084 deducible
= deducible_expression (elt
);
18092 /* Returns true iff TYPE contains any deducible references to template
18093 parameters, as per 14.8.2.5. */
18096 uses_deducible_template_parms (tree type
)
18098 if (PACK_EXPANSION_P (type
))
18099 type
= PACK_EXPANSION_PATTERN (type
);
18106 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
18107 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18113 if (POINTER_TYPE_P (type
))
18114 return uses_deducible_template_parms (TREE_TYPE (type
));
18116 /* T[integer-constant ]
18118 if (TREE_CODE (type
) == ARRAY_TYPE
)
18119 return (uses_deducible_template_parms (TREE_TYPE (type
))
18120 || deducible_array_bound (TYPE_DOMAIN (type
)));
18132 if (TYPE_PTRMEM_P (type
))
18133 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
18134 || (uses_deducible_template_parms
18135 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
18137 /* template-name <T> (where template-name refers to a class template)
18138 template-name <i> (where template-name refers to a class template) */
18139 if (CLASS_TYPE_P (type
)
18140 && CLASSTYPE_TEMPLATE_INFO (type
)
18141 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
18142 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
18143 (CLASSTYPE_TI_ARGS (type
)));
18148 if (TREE_CODE (type
) == FUNCTION_TYPE
18149 || TREE_CODE (type
) == METHOD_TYPE
)
18151 if (uses_deducible_template_parms (TREE_TYPE (type
)))
18153 tree parm
= TYPE_ARG_TYPES (type
);
18154 if (TREE_CODE (type
) == METHOD_TYPE
)
18155 parm
= TREE_CHAIN (parm
);
18156 for (; parm
; parm
= TREE_CHAIN (parm
))
18157 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
18164 /* Subroutine of type_unification_real and unify_pack_expansion to
18165 handle unification of a single P/A pair. Parameters are as
18166 for those functions. */
18169 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
18170 int subr
, unification_kind_t strict
,
18173 tree arg_expr
= NULL_TREE
;
18176 if (arg
== error_mark_node
|| parm
== error_mark_node
)
18177 return unify_invalid (explain_p
);
18178 if (arg
== unknown_type_node
)
18179 /* We can't deduce anything from this, but we might get all the
18180 template args from other function args. */
18181 return unify_success (explain_p
);
18183 /* Implicit conversions (Clause 4) will be performed on a function
18184 argument to convert it to the type of the corresponding function
18185 parameter if the parameter type contains no template-parameters that
18186 participate in template argument deduction. */
18187 if (strict
!= DEDUCE_EXACT
18188 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
18189 /* For function parameters with no deducible template parameters,
18190 just return. We'll check non-dependent conversions later. */
18191 return unify_success (explain_p
);
18196 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
18197 | UNIFY_ALLOW_MORE_CV_QUAL
18198 | UNIFY_ALLOW_DERIVED
);
18202 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
18206 arg_strict
= UNIFY_ALLOW_NONE
;
18210 gcc_unreachable ();
18213 /* We only do these transformations if this is the top-level
18214 parameter_type_list in a call or declaration matching; in other
18215 situations (nested function declarators, template argument lists) we
18216 won't be comparing a type to an expression, and we don't do any type
18222 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
18223 if (type_unknown_p (arg
))
18225 /* [temp.deduct.type] A template-argument can be
18226 deduced from a pointer to function or pointer
18227 to member function argument if the set of
18228 overloaded functions does not contain function
18229 templates and at most one of a set of
18230 overloaded functions provides a unique
18233 if (resolve_overloaded_unification
18234 (tparms
, targs
, parm
, arg
, strict
,
18235 arg_strict
, explain_p
))
18236 return unify_success (explain_p
);
18237 return unify_overload_resolution_failure (explain_p
, arg
);
18241 arg
= unlowered_expr_type (arg
);
18242 if (arg
== error_mark_node
)
18243 return unify_invalid (explain_p
);
18247 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
18250 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
18251 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
18252 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18254 /* For deduction from an init-list we need the actual list. */
18255 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
18257 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
18260 /* Most parms like fn_type_unification.
18262 If SUBR is 1, we're being called recursively (to unify the
18263 arguments of a function or method parameter of a function
18266 CHECKS is a pointer to a vector of access checks encountered while
18267 substituting default template arguments. */
18270 type_unification_real (tree tparms
,
18274 unsigned int xnargs
,
18276 unification_kind_t strict
,
18278 vec
<deferred_access_check
, va_gc
> **checks
,
18283 int ntparms
= TREE_VEC_LENGTH (tparms
);
18284 int saw_undeduced
= 0;
18287 unsigned int nargs
;
18290 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
18291 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
18292 gcc_assert (ntparms
> 0);
18294 tree targs
= INNERMOST_TEMPLATE_ARGS (full_targs
);
18296 /* Reset the number of non-defaulted template arguments contained
18298 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
18306 while (parms
&& parms
!= void_list_node
18309 parm
= TREE_VALUE (parms
);
18311 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18312 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
18313 /* For a function parameter pack that occurs at the end of the
18314 parameter-declaration-list, the type A of each remaining
18315 argument of the call is compared with the type P of the
18316 declarator-id of the function parameter pack. */
18319 parms
= TREE_CHAIN (parms
);
18321 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18322 /* For a function parameter pack that does not occur at the
18323 end of the parameter-declaration-list, the type of the
18324 parameter pack is a non-deduced context. */
18330 if (unify_one_argument (tparms
, full_targs
, parm
, arg
, subr
, strict
,
18336 && parms
!= void_list_node
18337 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18339 /* Unify the remaining arguments with the pack expansion type. */
18341 tree parmvec
= make_tree_vec (1);
18343 /* Allocate a TREE_VEC and copy in all of the arguments */
18344 argvec
= make_tree_vec (nargs
- ia
);
18345 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18346 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18348 /* Copy the parameter into parmvec. */
18349 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18350 if (unify_pack_expansion (tparms
, full_targs
, parmvec
, argvec
, strict
,
18351 /*subr=*/subr
, explain_p
))
18354 /* Advance to the end of the list of parameters. */
18355 parms
= TREE_CHAIN (parms
);
18358 /* Fail if we've reached the end of the parm list, and more args
18359 are present, and the parm list isn't variadic. */
18360 if (ia
< nargs
&& parms
== void_list_node
)
18361 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18362 /* Fail if parms are left and they don't have default values and
18363 they aren't all deduced as empty packs (c++/57397). This is
18364 consistent with sufficient_parms_p. */
18365 if (parms
&& parms
!= void_list_node
18366 && TREE_PURPOSE (parms
) == NULL_TREE
)
18368 unsigned int count
= nargs
;
18373 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18376 p
= TREE_CHAIN (p
);
18378 while (p
&& p
!= void_list_node
);
18379 if (count
!= nargs
)
18380 return unify_too_few_arguments (explain_p
, ia
, count
,
18386 tsubst_flags_t complain
= (explain_p
18387 ? tf_warning_or_error
18390 for (i
= 0; i
< ntparms
; i
++)
18392 tree targ
= TREE_VEC_ELT (targs
, i
);
18393 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18395 /* Clear the "incomplete" flags on all argument packs now so that
18396 substituting them into later default arguments works. */
18397 if (targ
&& ARGUMENT_PACK_P (targ
))
18399 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18400 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18403 if (targ
|| tparm
== error_mark_node
)
18405 tparm
= TREE_VALUE (tparm
);
18407 /* If this is an undeduced nontype parameter that depends on
18408 a type parameter, try another pass; its type may have been
18409 deduced from a later argument than the one from which
18410 this parameter can be deduced. */
18411 if (TREE_CODE (tparm
) == PARM_DECL
18412 && uses_template_parms (TREE_TYPE (tparm
))
18413 && saw_undeduced
< 2)
18419 /* Core issue #226 (C++0x) [temp.deduct]:
18421 If a template argument has not been deduced, its
18422 default template argument, if any, is used.
18424 When we are in C++98 mode, TREE_PURPOSE will either
18425 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18426 to explicitly check cxx_dialect here. */
18427 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18428 /* OK, there is a default argument. Wait until after the
18429 conversion check to do substitution. */
18432 /* If the type parameter is a parameter pack, then it will
18433 be deduced to an empty parameter pack. */
18434 if (template_parameter_pack_p (tparm
))
18438 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18440 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18441 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18442 TREE_CONSTANT (arg
) = 1;
18445 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18447 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18449 TREE_VEC_ELT (targs
, i
) = arg
;
18453 return unify_parameter_deduction_failure (explain_p
, tparm
);
18456 /* DR 1391: All parameters have args, now check non-dependent parms for
18458 if (saw_undeduced
< 2)
18459 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18460 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18462 parm
= TREE_VALUE (parms
);
18464 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18465 && (!TREE_CHAIN (parms
)
18466 || TREE_CHAIN (parms
) == void_list_node
))
18467 /* For a function parameter pack that occurs at the end of the
18468 parameter-declaration-list, the type A of each remaining
18469 argument of the call is compared with the type P of the
18470 declarator-id of the function parameter pack. */
18473 parms
= TREE_CHAIN (parms
);
18475 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18476 /* For a function parameter pack that does not occur at the
18477 end of the parameter-declaration-list, the type of the
18478 parameter pack is a non-deduced context. */
18484 if (uses_template_parms (parm
))
18486 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18491 /* Now substitute into the default template arguments. */
18492 for (i
= 0; i
< ntparms
; i
++)
18494 tree targ
= TREE_VEC_ELT (targs
, i
);
18495 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18497 if (targ
|| tparm
== error_mark_node
)
18499 tree parm
= TREE_VALUE (tparm
);
18501 if (TREE_CODE (parm
) == PARM_DECL
18502 && uses_template_parms (TREE_TYPE (parm
))
18503 && saw_undeduced
< 2)
18506 tree arg
= TREE_PURPOSE (tparm
);
18507 reopen_deferring_access_checks (*checks
);
18508 location_t save_loc
= input_location
;
18510 input_location
= DECL_SOURCE_LOCATION (parm
);
18511 arg
= tsubst_template_arg (arg
, full_targs
, complain
, NULL_TREE
);
18512 arg
= convert_template_argument (parm
, arg
, full_targs
, complain
,
18514 input_location
= save_loc
;
18515 *checks
= get_deferred_access_checks ();
18516 pop_deferring_access_checks ();
18517 if (arg
== error_mark_node
)
18521 TREE_VEC_ELT (targs
, i
) = arg
;
18522 /* The position of the first default template argument,
18523 is also the number of non-defaulted arguments in TARGS.
18525 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18526 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18531 if (saw_undeduced
++ == 1)
18535 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18536 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18538 return unify_success (explain_p
);
18541 /* Subroutine of type_unification_real. Args are like the variables
18542 at the call site. ARG is an overloaded function (or template-id);
18543 we try deducing template args from each of the overloads, and if
18544 only one succeeds, we go with that. Modifies TARGS and returns
18545 true on success. */
18548 resolve_overloaded_unification (tree tparms
,
18552 unification_kind_t strict
,
18556 tree tempargs
= copy_node (targs
);
18558 tree goodfn
= NULL_TREE
;
18561 if (TREE_CODE (arg
) == ADDR_EXPR
)
18563 arg
= TREE_OPERAND (arg
, 0);
18569 if (TREE_CODE (arg
) == COMPONENT_REF
)
18570 /* Handle `&x' where `x' is some static or non-static member
18572 arg
= TREE_OPERAND (arg
, 1);
18574 if (TREE_CODE (arg
) == OFFSET_REF
)
18575 arg
= TREE_OPERAND (arg
, 1);
18577 /* Strip baselink information. */
18578 if (BASELINK_P (arg
))
18579 arg
= BASELINK_FUNCTIONS (arg
);
18581 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18583 /* If we got some explicit template args, we need to plug them into
18584 the affected templates before we try to unify, in case the
18585 explicit args will completely resolve the templates in question. */
18588 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18589 arg
= TREE_OPERAND (arg
, 0);
18591 for (; arg
; arg
= OVL_NEXT (arg
))
18593 tree fn
= OVL_CURRENT (arg
);
18594 tree subargs
, elem
;
18596 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18599 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18600 expl_subargs
, NULL_TREE
, tf_none
,
18601 /*require_all_args=*/true,
18602 /*use_default_args=*/true);
18603 if (subargs
!= error_mark_node
18604 && !any_dependent_template_arguments_p (subargs
))
18606 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18607 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18608 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18609 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18618 /* If no templates (or more than one) are fully resolved by the
18619 explicit arguments, this template-id is a non-deduced context; it
18620 could still be OK if we deduce all template arguments for the
18621 enclosing call through other arguments. */
18625 else if (TREE_CODE (arg
) != OVERLOAD
18626 && TREE_CODE (arg
) != FUNCTION_DECL
)
18627 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18628 -- but the deduction does not succeed because the expression is
18629 not just the function on its own. */
18632 for (; arg
; arg
= OVL_NEXT (arg
))
18633 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18634 TREE_TYPE (OVL_CURRENT (arg
)),
18635 strict
, sub_strict
, addr_p
, explain_p
)
18636 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18638 goodfn
= OVL_CURRENT (arg
);
18642 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18643 to function or pointer to member function argument if the set of
18644 overloaded functions does not contain function templates and at most
18645 one of a set of overloaded functions provides a unique match.
18647 So if we found multiple possibilities, we return success but don't
18648 deduce anything. */
18652 int i
= TREE_VEC_LENGTH (targs
);
18654 if (TREE_VEC_ELT (tempargs
, i
))
18656 tree old
= TREE_VEC_ELT (targs
, i
);
18657 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18658 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18659 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18660 /* Don't forget explicit template arguments in a pack. */
18661 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18662 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18663 TREE_VEC_ELT (targs
, i
) = new_
;
18672 /* Core DR 115: In contexts where deduction is done and fails, or in
18673 contexts where deduction is not done, if a template argument list is
18674 specified and it, along with any default template arguments, identifies
18675 a single function template specialization, then the template-id is an
18676 lvalue for the function template specialization. */
18679 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
18681 tree expr
, offset
, baselink
;
18684 if (!type_unknown_p (orig_expr
))
18689 offset
= NULL_TREE
;
18690 baselink
= NULL_TREE
;
18692 if (TREE_CODE (expr
) == ADDR_EXPR
)
18694 expr
= TREE_OPERAND (expr
, 0);
18697 if (TREE_CODE (expr
) == OFFSET_REF
)
18700 expr
= TREE_OPERAND (expr
, 1);
18702 if (BASELINK_P (expr
))
18705 expr
= BASELINK_FUNCTIONS (expr
);
18708 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18711 tree goodfn
= NULL_TREE
;
18713 /* If we got some explicit template args, we need to plug them into
18714 the affected templates before we try to unify, in case the
18715 explicit args will completely resolve the templates in question. */
18717 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18718 tree arg
= TREE_OPERAND (expr
, 0);
18719 tree badfn
= NULL_TREE
;
18720 tree badargs
= NULL_TREE
;
18722 for (; arg
; arg
= OVL_NEXT (arg
))
18724 tree fn
= OVL_CURRENT (arg
);
18725 tree subargs
, elem
;
18727 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18730 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18731 expl_subargs
, NULL_TREE
, tf_none
,
18732 /*require_all_args=*/true,
18733 /*use_default_args=*/true);
18734 if (subargs
!= error_mark_node
18735 && !any_dependent_template_arguments_p (subargs
))
18737 elem
= instantiate_template (fn
, subargs
, tf_none
);
18738 if (elem
== error_mark_node
)
18743 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18752 mark_used (goodfn
);
18755 expr
= build_baselink (BASELINK_BINFO (baselink
),
18756 BASELINK_ACCESS_BINFO (baselink
),
18757 expr
, BASELINK_OPTYPE (baselink
));
18761 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18762 expr
= build_offset_ref (base
, expr
, addr
, complain
);
18765 expr
= cp_build_addr_expr (expr
, complain
);
18768 else if (good
== 0 && badargs
&& (complain
& tf_error
))
18769 /* There were no good options and at least one bad one, so let the
18770 user know what the problem is. */
18771 instantiate_template (badfn
, badargs
, complain
);
18776 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18777 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18778 different overloads deduce different arguments for a given parm.
18779 ADDR_P is true if the expression for which deduction is being
18780 performed was of the form "& fn" rather than simply "fn".
18782 Returns 1 on success. */
18785 try_one_overload (tree tparms
,
18790 unification_kind_t strict
,
18799 if (arg
== error_mark_node
)
18802 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18803 to function or pointer to member function argument if the set of
18804 overloaded functions does not contain function templates and at most
18805 one of a set of overloaded functions provides a unique match.
18807 So if this is a template, just return success. */
18809 if (uses_template_parms (arg
))
18812 if (TREE_CODE (arg
) == METHOD_TYPE
)
18813 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18815 arg
= build_pointer_type (arg
);
18817 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18819 /* We don't copy orig_targs for this because if we have already deduced
18820 some template args from previous args, unify would complain when we
18821 try to deduce a template parameter for the same argument, even though
18822 there isn't really a conflict. */
18823 nargs
= TREE_VEC_LENGTH (targs
);
18824 tempargs
= make_tree_vec (nargs
);
18826 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18829 /* First make sure we didn't deduce anything that conflicts with
18830 explicitly specified args. */
18831 for (i
= nargs
; i
--; )
18833 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18834 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18838 else if (uses_template_parms (elt
))
18839 /* Since we're unifying against ourselves, we will fill in
18840 template args used in the function parm list with our own
18841 template parms. Discard them. */
18842 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18843 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
18845 /* Check that the argument at each index of the deduced argument pack
18846 is equivalent to the corresponding explicitly specified argument.
18847 We may have deduced more arguments than were explicitly specified,
18849 gcc_assert (ARGUMENT_PACK_INCOMPLETE_P (oldelt
));
18850 gcc_assert (ARGUMENT_PACK_ARGS (oldelt
)
18851 == ARGUMENT_PACK_EXPLICIT_ARGS (oldelt
));
18853 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
18854 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
18856 if (TREE_VEC_LENGTH (deduced_pack
)
18857 < TREE_VEC_LENGTH (explicit_pack
))
18860 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
18861 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
18862 TREE_VEC_ELT (deduced_pack
, j
)))
18865 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18869 for (i
= nargs
; i
--; )
18871 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18874 TREE_VEC_ELT (targs
, i
) = elt
;
18880 /* PARM is a template class (perhaps with unbound template
18881 parameters). ARG is a fully instantiated type. If ARG can be
18882 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18883 TARGS are as for unify. */
18886 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18889 tree copy_of_targs
;
18891 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18892 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18893 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18896 /* We need to make a new template argument vector for the call to
18897 unify. If we used TARGS, we'd clutter it up with the result of
18898 the attempted unification, even if this class didn't work out.
18899 We also don't want to commit ourselves to all the unifications
18900 we've already done, since unification is supposed to be done on
18901 an argument-by-argument basis. In other words, consider the
18902 following pathological case:
18904 template <int I, int J, int K>
18907 template <int I, int J>
18908 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18910 template <int I, int J, int K>
18911 void f(S<I, J, K>, S<I, I, I>);
18920 Now, by the time we consider the unification involving `s2', we
18921 already know that we must have `f<0, 0, 0>'. But, even though
18922 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18923 because there are two ways to unify base classes of S<0, 1, 2>
18924 with S<I, I, I>. If we kept the already deduced knowledge, we
18925 would reject the possibility I=1. */
18926 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18928 /* If unification failed, we're done. */
18929 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18930 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18936 /* Given a template type PARM and a class type ARG, find the unique
18937 base type in ARG that is an instance of PARM. We do not examine
18938 ARG itself; only its base-classes. If there is not exactly one
18939 appropriate base class, return NULL_TREE. PARM may be the type of
18940 a partial specialization, as well as a plain template type. Used
18943 static enum template_base_result
18944 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18945 bool explain_p
, tree
*result
)
18947 tree rval
= NULL_TREE
;
18950 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18952 binfo
= TYPE_BINFO (complete_type (arg
));
18955 /* The type could not be completed. */
18956 *result
= NULL_TREE
;
18957 return tbr_incomplete_type
;
18960 /* Walk in inheritance graph order. The search order is not
18961 important, and this avoids multiple walks of virtual bases. */
18962 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18964 tree r
= try_class_unification (tparms
, targs
, parm
,
18965 BINFO_TYPE (binfo
), explain_p
);
18969 /* If there is more than one satisfactory baseclass, then:
18973 If they yield more than one possible deduced A, the type
18977 if (rval
&& !same_type_p (r
, rval
))
18979 *result
= NULL_TREE
;
18980 return tbr_ambiguous_baseclass
;
18988 return tbr_success
;
18991 /* Returns the level of DECL, which declares a template parameter. */
18994 template_decl_level (tree decl
)
18996 switch (TREE_CODE (decl
))
18999 case TEMPLATE_DECL
:
19000 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
19003 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
19006 gcc_unreachable ();
19011 /* Decide whether ARG can be unified with PARM, considering only the
19012 cv-qualifiers of each type, given STRICT as documented for unify.
19013 Returns nonzero iff the unification is OK on that basis. */
19016 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
19018 int arg_quals
= cp_type_quals (arg
);
19019 int parm_quals
= cp_type_quals (parm
);
19021 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19022 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
19024 /* Although a CVR qualifier is ignored when being applied to a
19025 substituted template parameter ([8.3.2]/1 for example), that
19026 does not allow us to unify "const T" with "int&" because both
19027 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
19028 It is ok when we're allowing additional CV qualifiers
19029 at the outer level [14.8.2.1]/3,1st bullet. */
19030 if ((TREE_CODE (arg
) == REFERENCE_TYPE
19031 || TREE_CODE (arg
) == FUNCTION_TYPE
19032 || TREE_CODE (arg
) == METHOD_TYPE
)
19033 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
19036 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
19037 && (parm_quals
& TYPE_QUAL_RESTRICT
))
19041 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
19042 && (arg_quals
& parm_quals
) != parm_quals
)
19045 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
19046 && (parm_quals
& arg_quals
) != arg_quals
)
19052 /* Determines the LEVEL and INDEX for the template parameter PARM. */
19054 template_parm_level_and_index (tree parm
, int* level
, int* index
)
19056 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19057 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19058 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19060 *index
= TEMPLATE_TYPE_IDX (parm
);
19061 *level
= TEMPLATE_TYPE_LEVEL (parm
);
19065 *index
= TEMPLATE_PARM_IDX (parm
);
19066 *level
= TEMPLATE_PARM_LEVEL (parm
);
19070 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
19072 if (unify (TP, TA, P, A, S, EP)) \
19076 /* Unifies the remaining arguments in PACKED_ARGS with the pack
19077 expansion at the end of PACKED_PARMS. Returns 0 if the type
19078 deduction succeeds, 1 otherwise. STRICT is the same as in
19079 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
19080 call argument list. We'll need to adjust the arguments to make them
19081 types. SUBR tells us if this is from a recursive call to
19082 type_unification_real, or for comparing two template argument
19086 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
19087 tree packed_args
, unification_kind_t strict
,
19088 bool subr
, bool explain_p
)
19091 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
19092 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
19093 tree pack
, packs
= NULL_TREE
;
19094 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
19096 packed_args
= expand_template_argument_pack (packed_args
);
19098 int len
= TREE_VEC_LENGTH (packed_args
);
19100 /* Determine the parameter packs we will be deducing from the
19101 pattern, and record their current deductions. */
19102 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
19103 pack
; pack
= TREE_CHAIN (pack
))
19105 tree parm_pack
= TREE_VALUE (pack
);
19108 /* Determine the index and level of this parameter pack. */
19109 template_parm_level_and_index (parm_pack
, &level
, &idx
);
19111 /* Keep track of the parameter packs and their corresponding
19113 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
19114 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
19117 /* Loop through all of the arguments that have not yet been
19118 unified and unify each with the pattern. */
19119 for (i
= start
; i
< len
; i
++)
19122 bool any_explicit
= false;
19123 tree arg
= TREE_VEC_ELT (packed_args
, i
);
19125 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
19126 or the element of its argument pack at the current index if
19127 this argument was explicitly specified. */
19128 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19132 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19135 if (TREE_VALUE (pack
)
19136 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
19137 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
19139 any_explicit
= true;
19140 arg
= TREE_VEC_ELT (pargs
, i
- start
);
19142 TMPL_ARG (targs
, level
, idx
) = arg
;
19145 /* If we had explicit template arguments, substitute them into the
19146 pattern before deduction. */
19149 /* Some arguments might still be unspecified or dependent. */
19151 ++processing_template_decl
;
19152 dependent
= any_dependent_template_arguments_p (targs
);
19154 --processing_template_decl
;
19155 parm
= tsubst (pattern
, targs
,
19156 explain_p
? tf_warning_or_error
: tf_none
,
19159 --processing_template_decl
;
19160 if (parm
== error_mark_node
)
19166 /* Unify the pattern with the current argument. */
19167 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
19171 /* For each parameter pack, collect the deduced value. */
19172 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19175 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19177 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
19178 TMPL_ARG (targs
, level
, idx
);
19182 /* Verify that the results of unification with the parameter packs
19183 produce results consistent with what we've seen before, and make
19184 the deduced argument packs available. */
19185 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19187 tree old_pack
= TREE_VALUE (pack
);
19188 tree new_args
= TREE_TYPE (pack
);
19189 int i
, len
= TREE_VEC_LENGTH (new_args
);
19191 bool nondeduced_p
= false;
19193 /* By default keep the original deduced argument pack.
19194 If necessary, more specific code is going to update the
19195 resulting deduced argument later down in this function. */
19196 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19197 TMPL_ARG (targs
, level
, idx
) = old_pack
;
19199 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
19200 actually deduce anything. */
19201 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
19202 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
19203 nondeduced_p
= true;
19207 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
19209 /* If we had fewer function args than explicit template args,
19210 just use the explicits. */
19211 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19212 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
19213 if (len
< explicit_len
)
19214 new_args
= explicit_args
;
19220 /* Build the deduced *_ARGUMENT_PACK. */
19221 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
19223 result
= make_node (NONTYPE_ARGUMENT_PACK
);
19224 TREE_TYPE (result
) =
19225 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
19226 TREE_CONSTANT (result
) = 1;
19229 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
19231 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
19233 /* Note the deduced argument packs for this parameter
19235 TMPL_ARG (targs
, level
, idx
) = result
;
19237 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
19238 && (ARGUMENT_PACK_ARGS (old_pack
)
19239 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
19241 /* We only had the explicitly-provided arguments before, but
19242 now we have a complete set of arguments. */
19243 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19245 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
19246 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
19247 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
19251 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
19252 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
19254 if (!comp_template_args (old_args
, new_args
,
19255 &bad_old_arg
, &bad_new_arg
))
19256 /* Inconsistent unification of this parameter pack. */
19257 return unify_parameter_pack_inconsistent (explain_p
,
19263 return unify_success (explain_p
);
19266 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
19267 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
19268 parameters and return value are as for unify. */
19271 unify_array_domain (tree tparms
, tree targs
,
19272 tree parm_dom
, tree arg_dom
,
19280 /* Our representation of array types uses "N - 1" as the
19281 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
19282 not an integer constant. We cannot unify arbitrarily
19283 complex expressions, so we eliminate the MINUS_EXPRs
19285 parm_max
= TYPE_MAX_VALUE (parm_dom
);
19286 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
19289 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
19290 parm_max
= TREE_OPERAND (parm_max
, 0);
19292 arg_max
= TYPE_MAX_VALUE (arg_dom
);
19293 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
19296 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
19297 trying to unify the type of a variable with the type
19298 of a template parameter. For example:
19300 template <unsigned int N>
19301 void f (char (&) [N]);
19308 Here, the type of the ARG will be "int [g(i)]", and
19309 may be a SAVE_EXPR, etc. */
19310 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
19311 return unify_vla_arg (explain_p
, arg_dom
);
19312 arg_max
= TREE_OPERAND (arg_max
, 0);
19315 /* If only one of the bounds used a MINUS_EXPR, compensate
19316 by adding one to the other bound. */
19317 if (parm_cst
&& !arg_cst
)
19318 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19322 else if (arg_cst
&& !parm_cst
)
19323 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19328 return unify (tparms
, targs
, parm_max
, arg_max
,
19329 UNIFY_ALLOW_INTEGER
, explain_p
);
19332 /* Deduce the value of template parameters. TPARMS is the (innermost)
19333 set of template parameters to a template. TARGS is the bindings
19334 for those template parameters, as determined thus far; TARGS may
19335 include template arguments for outer levels of template parameters
19336 as well. PARM is a parameter to a template function, or a
19337 subcomponent of that parameter; ARG is the corresponding argument.
19338 This function attempts to match PARM with ARG in a manner
19339 consistent with the existing assignments in TARGS. If more values
19340 are deduced, then TARGS is updated.
19342 Returns 0 if the type deduction succeeds, 1 otherwise. The
19343 parameter STRICT is a bitwise or of the following flags:
19346 Require an exact match between PARM and ARG.
19347 UNIFY_ALLOW_MORE_CV_QUAL:
19348 Allow the deduced ARG to be more cv-qualified (by qualification
19349 conversion) than ARG.
19350 UNIFY_ALLOW_LESS_CV_QUAL:
19351 Allow the deduced ARG to be less cv-qualified than ARG.
19352 UNIFY_ALLOW_DERIVED:
19353 Allow the deduced ARG to be a template base class of ARG,
19354 or a pointer to a template base class of the type pointed to by
19356 UNIFY_ALLOW_INTEGER:
19357 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19358 case for more information.
19359 UNIFY_ALLOW_OUTER_LEVEL:
19360 This is the outermost level of a deduction. Used to determine validity
19361 of qualification conversions. A valid qualification conversion must
19362 have const qualified pointers leading up to the inner type which
19363 requires additional CV quals, except at the outer level, where const
19364 is not required [conv.qual]. It would be normal to set this flag in
19365 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19366 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19367 This is the outermost level of a deduction, and PARM can be more CV
19368 qualified at this point.
19369 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19370 This is the outermost level of a deduction, and PARM can be less CV
19371 qualified at this point. */
19374 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19380 int strict_in
= strict
;
19382 /* I don't think this will do the right thing with respect to types.
19383 But the only case I've seen it in so far has been array bounds, where
19384 signedness is the only information lost, and I think that will be
19386 while (TREE_CODE (parm
) == NOP_EXPR
)
19387 parm
= TREE_OPERAND (parm
, 0);
19389 if (arg
== error_mark_node
)
19390 return unify_invalid (explain_p
);
19391 if (arg
== unknown_type_node
19392 || arg
== init_list_type_node
)
19393 /* We can't deduce anything from this, but we might get all the
19394 template args from other function args. */
19395 return unify_success (explain_p
);
19397 /* If PARM uses template parameters, then we can't bail out here,
19398 even if ARG == PARM, since we won't record unifications for the
19399 template parameters. We might need them if we're trying to
19400 figure out which of two things is more specialized. */
19401 if (arg
== parm
&& !uses_template_parms (parm
))
19402 return unify_success (explain_p
);
19404 /* Handle init lists early, so the rest of the function can assume
19405 we're dealing with a type. */
19406 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19410 tree orig_parm
= parm
;
19412 /* Replace T with std::initializer_list<T> for deduction. */
19413 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19414 && flag_deduce_init_list
)
19415 parm
= listify (parm
);
19417 if (!is_std_init_list (parm
)
19418 && TREE_CODE (parm
) != ARRAY_TYPE
)
19419 /* We can only deduce from an initializer list argument if the
19420 parameter is std::initializer_list or an array; otherwise this
19421 is a non-deduced context. */
19422 return unify_success (explain_p
);
19424 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19425 elttype
= TREE_TYPE (parm
);
19428 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19429 /* Deduction is defined in terms of a single type, so just punt
19430 on the (bizarre) std::initializer_list<T...>. */
19431 if (PACK_EXPANSION_P (elttype
))
19432 return unify_success (explain_p
);
19435 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19437 int elt_strict
= strict
;
19439 if (elt
== error_mark_node
)
19440 return unify_invalid (explain_p
);
19442 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19444 tree type
= TREE_TYPE (elt
);
19445 if (type
== error_mark_node
)
19446 return unify_invalid (explain_p
);
19447 /* It should only be possible to get here for a call. */
19448 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19449 elt_strict
|= maybe_adjust_types_for_deduction
19450 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19454 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19458 if (TREE_CODE (parm
) == ARRAY_TYPE
19459 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19461 /* Also deduce from the length of the initializer list. */
19462 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19463 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19464 if (idx
== error_mark_node
)
19465 return unify_invalid (explain_p
);
19466 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19470 /* If the std::initializer_list<T> deduction worked, replace the
19471 deduced A with std::initializer_list<A>. */
19472 if (orig_parm
!= parm
)
19474 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19475 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19476 targ
= listify (targ
);
19477 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19479 return unify_success (explain_p
);
19482 /* Immediately reject some pairs that won't unify because of
19483 cv-qualification mismatches. */
19484 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19486 /* It is the elements of the array which hold the cv quals of an array
19487 type, and the elements might be template type parms. We'll check
19488 when we recurse. */
19489 && TREE_CODE (arg
) != ARRAY_TYPE
19490 /* We check the cv-qualifiers when unifying with template type
19491 parameters below. We want to allow ARG `const T' to unify with
19492 PARM `T' for example, when computing which of two templates
19493 is more specialized, for example. */
19494 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19495 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19496 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19498 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19499 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19500 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19501 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19502 strict
&= ~UNIFY_ALLOW_DERIVED
;
19503 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19504 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19506 switch (TREE_CODE (parm
))
19508 case TYPENAME_TYPE
:
19510 case UNBOUND_CLASS_TEMPLATE
:
19511 /* In a type which contains a nested-name-specifier, template
19512 argument values cannot be deduced for template parameters used
19513 within the nested-name-specifier. */
19514 return unify_success (explain_p
);
19516 case TEMPLATE_TYPE_PARM
:
19517 case TEMPLATE_TEMPLATE_PARM
:
19518 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19519 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19520 if (error_operand_p (tparm
))
19521 return unify_invalid (explain_p
);
19523 if (TEMPLATE_TYPE_LEVEL (parm
)
19524 != template_decl_level (tparm
))
19525 /* The PARM is not one we're trying to unify. Just check
19526 to see if it matches ARG. */
19528 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19529 && (is_auto (parm
) ? is_auto (arg
)
19530 : same_type_p (parm
, arg
)))
19531 return unify_success (explain_p
);
19533 return unify_type_mismatch (explain_p
, parm
, arg
);
19535 idx
= TEMPLATE_TYPE_IDX (parm
);
19536 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19537 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19538 if (error_operand_p (tparm
))
19539 return unify_invalid (explain_p
);
19541 /* Check for mixed types and values. */
19542 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19543 && TREE_CODE (tparm
) != TYPE_DECL
)
19544 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19545 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19546 gcc_unreachable ();
19548 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19550 /* ARG must be constructed from a template class or a template
19551 template parameter. */
19552 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19553 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19554 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19556 tree parmvec
= TYPE_TI_ARGS (parm
);
19557 /* An alias template name is never deduced. */
19558 if (TYPE_ALIAS_P (arg
))
19559 arg
= strip_typedefs (arg
);
19560 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19561 tree full_argvec
= add_to_template_args (targs
, argvec
);
19563 = DECL_INNERMOST_TEMPLATE_PARMS
19564 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19566 int parm_variadic_p
= 0;
19568 /* The resolution to DR150 makes clear that default
19569 arguments for an N-argument may not be used to bind T
19570 to a template template parameter with fewer than N
19571 parameters. It is not safe to permit the binding of
19572 default arguments as an extension, as that may change
19573 the meaning of a conforming program. Consider:
19575 struct Dense { static const unsigned int dim = 1; };
19577 template <template <typename> class View,
19579 void operator+(float, View<Block> const&);
19581 template <typename Block,
19582 unsigned int Dim = Block::dim>
19583 struct Lvalue_proxy { operator float() const; };
19587 Lvalue_proxy<Dense> p;
19592 Here, if Lvalue_proxy is permitted to bind to View, then
19593 the global operator+ will be used; if they are not, the
19594 Lvalue_proxy will be converted to float. */
19595 if (coerce_template_parms (parm_parms
,
19597 TYPE_TI_TEMPLATE (parm
),
19599 ? tf_warning_or_error
19601 /*require_all_args=*/true,
19602 /*use_default_args=*/false)
19603 == error_mark_node
)
19606 /* Deduce arguments T, i from TT<T> or TT<i>.
19607 We check each element of PARMVEC and ARGVEC individually
19608 rather than the whole TREE_VEC since they can have
19609 different number of elements. */
19611 parmvec
= expand_template_argument_pack (parmvec
);
19612 argvec
= expand_template_argument_pack (argvec
);
19614 len
= TREE_VEC_LENGTH (parmvec
);
19616 /* Check if the parameters end in a pack, making them
19619 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19620 parm_variadic_p
= 1;
19622 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19623 /* If the template argument list of P contains a pack
19624 expansion that is not the last template argument, the
19625 entire template argument list is a non-deduced
19627 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19628 return unify_success (explain_p
);
19630 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19631 return unify_too_few_arguments (explain_p
,
19632 TREE_VEC_LENGTH (argvec
), len
);
19634 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19636 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19637 TREE_VEC_ELT (parmvec
, i
),
19638 TREE_VEC_ELT (argvec
, i
),
19639 UNIFY_ALLOW_NONE
, explain_p
);
19642 if (parm_variadic_p
19643 && unify_pack_expansion (tparms
, targs
,
19646 /*subr=*/true, explain_p
))
19649 arg
= TYPE_TI_TEMPLATE (arg
);
19651 /* Fall through to deduce template name. */
19654 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19655 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19657 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19659 /* Simple cases: Value already set, does match or doesn't. */
19660 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19661 return unify_success (explain_p
);
19663 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19667 /* If PARM is `const T' and ARG is only `int', we don't have
19668 a match unless we are allowing additional qualification.
19669 If ARG is `const int' and PARM is just `T' that's OK;
19670 that binds `const int' to `T'. */
19671 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19673 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19675 /* Consider the case where ARG is `const volatile int' and
19676 PARM is `const T'. Then, T should be `volatile int'. */
19677 arg
= cp_build_qualified_type_real
19678 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19679 if (arg
== error_mark_node
)
19680 return unify_invalid (explain_p
);
19682 /* Simple cases: Value already set, does match or doesn't. */
19683 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19684 return unify_success (explain_p
);
19686 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19688 /* Make sure that ARG is not a variable-sized array. (Note
19689 that were talking about variable-sized arrays (like
19690 `int[n]'), rather than arrays of unknown size (like
19691 `int[]').) We'll get very confused by such a type since
19692 the bound of the array is not constant, and therefore
19693 not mangleable. Besides, such types are not allowed in
19694 ISO C++, so we can do as we please here. We do allow
19695 them for 'auto' deduction, since that isn't ABI-exposed. */
19696 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19697 return unify_vla_arg (explain_p
, arg
);
19699 /* Strip typedefs as in convert_template_argument. */
19700 arg
= canonicalize_type_argument (arg
, tf_none
);
19703 /* If ARG is a parameter pack or an expansion, we cannot unify
19704 against it unless PARM is also a parameter pack. */
19705 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19706 && !template_parameter_pack_p (parm
))
19707 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19709 /* If the argument deduction results is a METHOD_TYPE,
19710 then there is a problem.
19711 METHOD_TYPE doesn't map to any real C++ type the result of
19712 the deduction can not be of that type. */
19713 if (TREE_CODE (arg
) == METHOD_TYPE
)
19714 return unify_method_type_error (explain_p
, arg
);
19716 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19717 return unify_success (explain_p
);
19719 case TEMPLATE_PARM_INDEX
:
19720 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19721 if (error_operand_p (tparm
))
19722 return unify_invalid (explain_p
);
19724 if (TEMPLATE_PARM_LEVEL (parm
)
19725 != template_decl_level (tparm
))
19727 /* The PARM is not one we're trying to unify. Just check
19728 to see if it matches ARG. */
19729 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19730 && cp_tree_equal (parm
, arg
));
19732 unify_expression_unequal (explain_p
, parm
, arg
);
19736 idx
= TEMPLATE_PARM_IDX (parm
);
19737 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19741 int x
= !cp_tree_equal (targ
, arg
);
19743 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19747 /* [temp.deduct.type] If, in the declaration of a function template
19748 with a non-type template-parameter, the non-type
19749 template-parameter is used in an expression in the function
19750 parameter-list and, if the corresponding template-argument is
19751 deduced, the template-argument type shall match the type of the
19752 template-parameter exactly, except that a template-argument
19753 deduced from an array bound may be of any integral type.
19754 The non-type parameter might use already deduced type parameters. */
19755 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19756 if (!TREE_TYPE (arg
))
19757 /* Template-parameter dependent expression. Just accept it for now.
19758 It will later be processed in convert_template_argument. */
19760 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19762 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19763 && CP_INTEGRAL_TYPE_P (tparm
))
19764 /* Convert the ARG to the type of PARM; the deduced non-type
19765 template argument must exactly match the types of the
19766 corresponding parameter. */
19767 arg
= fold (build_nop (tparm
, arg
));
19768 else if (uses_template_parms (tparm
))
19769 /* We haven't deduced the type of this parameter yet. Try again
19771 return unify_success (explain_p
);
19773 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19775 /* If ARG is a parameter pack or an expansion, we cannot unify
19776 against it unless PARM is also a parameter pack. */
19777 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19778 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19779 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19782 bool removed_attr
= false;
19783 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19785 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19786 return unify_success (explain_p
);
19790 /* A pointer-to-member constant can be unified only with
19791 another constant. */
19792 if (TREE_CODE (arg
) != PTRMEM_CST
)
19793 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19795 /* Just unify the class member. It would be useless (and possibly
19796 wrong, depending on the strict flags) to unify also
19797 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19798 arg refer to the same variable, even if through different
19799 classes. For instance:
19801 struct A { int x; };
19804 Unification of &A::x and &B::x must succeed. */
19805 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19806 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19811 if (!TYPE_PTR_P (arg
))
19812 return unify_type_mismatch (explain_p
, parm
, arg
);
19814 /* [temp.deduct.call]
19816 A can be another pointer or pointer to member type that can
19817 be converted to the deduced A via a qualification
19818 conversion (_conv.qual_).
19820 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19821 This will allow for additional cv-qualification of the
19822 pointed-to types if appropriate. */
19824 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19825 /* The derived-to-base conversion only persists through one
19826 level of pointers. */
19827 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19829 return unify (tparms
, targs
, TREE_TYPE (parm
),
19830 TREE_TYPE (arg
), strict
, explain_p
);
19833 case REFERENCE_TYPE
:
19834 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19835 return unify_type_mismatch (explain_p
, parm
, arg
);
19836 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19837 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19840 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19841 return unify_type_mismatch (explain_p
, parm
, arg
);
19842 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19843 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19844 return unify_type_mismatch (explain_p
, parm
, arg
);
19845 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19846 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19847 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19848 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19849 TYPE_DOMAIN (arg
), explain_p
);
19850 return unify_success (explain_p
);
19857 case ENUMERAL_TYPE
:
19860 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19861 return unify_type_mismatch (explain_p
, parm
, arg
);
19863 /* We have already checked cv-qualification at the top of the
19865 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19866 return unify_type_mismatch (explain_p
, parm
, arg
);
19868 /* As far as unification is concerned, this wins. Later checks
19869 will invalidate it if necessary. */
19870 return unify_success (explain_p
);
19872 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19873 /* Type INTEGER_CST can come from ordinary constant template args. */
19875 while (TREE_CODE (arg
) == NOP_EXPR
)
19876 arg
= TREE_OPERAND (arg
, 0);
19878 if (TREE_CODE (arg
) != INTEGER_CST
)
19879 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19880 return (tree_int_cst_equal (parm
, arg
)
19881 ? unify_success (explain_p
)
19882 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19886 int i
, len
, argslen
;
19887 int parm_variadic_p
= 0;
19889 if (TREE_CODE (arg
) != TREE_VEC
)
19890 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19892 len
= TREE_VEC_LENGTH (parm
);
19893 argslen
= TREE_VEC_LENGTH (arg
);
19895 /* Check for pack expansions in the parameters. */
19896 for (i
= 0; i
< len
; ++i
)
19898 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19901 /* We can unify against something with a trailing
19903 parm_variadic_p
= 1;
19905 /* [temp.deduct.type]/9: If the template argument list of
19906 P contains a pack expansion that is not the last
19907 template argument, the entire template argument list
19908 is a non-deduced context. */
19909 return unify_success (explain_p
);
19913 /* If we don't have enough arguments to satisfy the parameters
19914 (not counting the pack expression at the end), or we have
19915 too many arguments for a parameter list that doesn't end in
19916 a pack expression, we can't unify. */
19917 if (parm_variadic_p
19918 ? argslen
< len
- parm_variadic_p
19920 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19922 /* Unify all of the parameters that precede the (optional)
19923 pack expression. */
19924 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19926 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19927 TREE_VEC_ELT (parm
, i
),
19928 TREE_VEC_ELT (arg
, i
),
19929 UNIFY_ALLOW_NONE
, explain_p
);
19931 if (parm_variadic_p
)
19932 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19934 /*subr=*/true, explain_p
);
19935 return unify_success (explain_p
);
19940 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19941 return unify_type_mismatch (explain_p
, parm
, arg
);
19943 if (TYPE_PTRMEMFUNC_P (parm
))
19945 if (!TYPE_PTRMEMFUNC_P (arg
))
19946 return unify_type_mismatch (explain_p
, parm
, arg
);
19948 return unify (tparms
, targs
,
19949 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19950 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19951 strict
, explain_p
);
19953 else if (TYPE_PTRMEMFUNC_P (arg
))
19954 return unify_type_mismatch (explain_p
, parm
, arg
);
19956 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19958 tree t
= NULL_TREE
;
19960 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19962 /* First, we try to unify the PARM and ARG directly. */
19963 t
= try_class_unification (tparms
, targs
,
19964 parm
, arg
, explain_p
);
19968 /* Fallback to the special case allowed in
19969 [temp.deduct.call]:
19971 If P is a class, and P has the form
19972 template-id, then A can be a derived class of
19973 the deduced A. Likewise, if P is a pointer to
19974 a class of the form template-id, A can be a
19975 pointer to a derived class pointed to by the
19977 enum template_base_result r
;
19978 r
= get_template_base (tparms
, targs
, parm
, arg
,
19983 /* Don't give the derived diagnostic if we're
19984 already dealing with the same template. */
19986 = (CLASSTYPE_TEMPLATE_INFO (arg
)
19987 && (CLASSTYPE_TI_TEMPLATE (parm
)
19988 == CLASSTYPE_TI_TEMPLATE (arg
)));
19989 return unify_no_common_base (explain_p
&& !same_template
,
19994 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19995 && (CLASSTYPE_TI_TEMPLATE (parm
)
19996 == CLASSTYPE_TI_TEMPLATE (arg
)))
19997 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19998 Then, we should unify `int' and `U'. */
20001 /* There's no chance of unification succeeding. */
20002 return unify_type_mismatch (explain_p
, parm
, arg
);
20004 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
20005 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
20007 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
20008 return unify_type_mismatch (explain_p
, parm
, arg
);
20009 return unify_success (explain_p
);
20012 case FUNCTION_TYPE
:
20014 unsigned int nargs
;
20019 if (TREE_CODE (arg
) != TREE_CODE (parm
))
20020 return unify_type_mismatch (explain_p
, parm
, arg
);
20022 /* CV qualifications for methods can never be deduced, they must
20023 match exactly. We need to check them explicitly here,
20024 because type_unification_real treats them as any other
20025 cv-qualified parameter. */
20026 if (TREE_CODE (parm
) == METHOD_TYPE
20027 && (!check_cv_quals_for_unify
20029 class_of_this_parm (arg
),
20030 class_of_this_parm (parm
))))
20031 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
20033 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
20034 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
20036 nargs
= list_length (TYPE_ARG_TYPES (arg
));
20037 args
= XALLOCAVEC (tree
, nargs
);
20038 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
20039 a
!= NULL_TREE
&& a
!= void_list_node
;
20040 a
= TREE_CHAIN (a
), ++i
)
20041 args
[i
] = TREE_VALUE (a
);
20044 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
20045 args
, nargs
, 1, DEDUCE_EXACT
,
20046 LOOKUP_NORMAL
, NULL
, explain_p
);
20050 /* Unify a pointer to member with a pointer to member function, which
20051 deduces the type of the member as a function type. */
20052 if (TYPE_PTRMEMFUNC_P (arg
))
20054 /* Check top-level cv qualifiers */
20055 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
20056 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
20058 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
20059 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
20060 UNIFY_ALLOW_NONE
, explain_p
);
20062 /* Determine the type of the function we are unifying against. */
20063 tree fntype
= static_fn_type (arg
);
20065 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
20068 if (TREE_CODE (arg
) != OFFSET_TYPE
)
20069 return unify_type_mismatch (explain_p
, parm
, arg
);
20070 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
20071 TYPE_OFFSET_BASETYPE (arg
),
20072 UNIFY_ALLOW_NONE
, explain_p
);
20073 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
20074 strict
, explain_p
);
20077 if (DECL_TEMPLATE_PARM_P (parm
))
20078 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
20079 if (arg
!= scalar_constant_value (parm
))
20080 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20081 return unify_success (explain_p
);
20084 case TEMPLATE_DECL
:
20085 /* Matched cases are handled by the ARG == PARM test above. */
20086 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20089 /* We might get a variable as a non-type template argument in parm if the
20090 corresponding parameter is type-dependent. Make any necessary
20091 adjustments based on whether arg is a reference. */
20092 if (CONSTANT_CLASS_P (arg
))
20093 parm
= fold_non_dependent_expr (parm
);
20094 else if (REFERENCE_REF_P (arg
))
20096 tree sub
= TREE_OPERAND (arg
, 0);
20098 if (TREE_CODE (sub
) == ADDR_EXPR
)
20099 arg
= TREE_OPERAND (sub
, 0);
20101 /* Now use the normal expression code to check whether they match. */
20104 case TYPE_ARGUMENT_PACK
:
20105 case NONTYPE_ARGUMENT_PACK
:
20106 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
20107 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
20110 case DECLTYPE_TYPE
:
20111 case UNDERLYING_TYPE
:
20112 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
20113 or UNDERLYING_TYPE nodes. */
20114 return unify_success (explain_p
);
20117 /* Unification fails if we hit an error node. */
20118 return unify_invalid (explain_p
);
20121 if (REFERENCE_REF_P (parm
))
20123 if (REFERENCE_REF_P (arg
))
20124 arg
= TREE_OPERAND (arg
, 0);
20125 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
20126 strict
, explain_p
);
20131 /* An unresolved overload is a nondeduced context. */
20132 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
20133 return unify_success (explain_p
);
20134 gcc_assert (EXPR_P (parm
));
20136 /* We must be looking at an expression. This can happen with
20140 void foo(S<I>, S<I + 2>);
20142 This is a "nondeduced context":
20146 The nondeduced contexts are:
20148 --A type that is a template-id in which one or more of
20149 the template-arguments is an expression that references
20150 a template-parameter.
20152 In these cases, we assume deduction succeeded, but don't
20153 actually infer any unifications. */
20155 if (!uses_template_parms (parm
)
20156 && !template_args_equal (parm
, arg
))
20157 return unify_expression_unequal (explain_p
, parm
, arg
);
20159 return unify_success (explain_p
);
20162 #undef RECUR_AND_CHECK_FAILURE
20164 /* Note that DECL can be defined in this translation unit, if
20168 mark_definable (tree decl
)
20171 DECL_NOT_REALLY_EXTERN (decl
) = 1;
20172 FOR_EACH_CLONE (clone
, decl
)
20173 DECL_NOT_REALLY_EXTERN (clone
) = 1;
20176 /* Called if RESULT is explicitly instantiated, or is a member of an
20177 explicitly instantiated class. */
20180 mark_decl_instantiated (tree result
, int extern_p
)
20182 SET_DECL_EXPLICIT_INSTANTIATION (result
);
20184 /* If this entity has already been written out, it's too late to
20185 make any modifications. */
20186 if (TREE_ASM_WRITTEN (result
))
20189 /* For anonymous namespace we don't need to do anything. */
20190 if (decl_anon_ns_mem_p (result
))
20192 gcc_assert (!TREE_PUBLIC (result
));
20196 if (TREE_CODE (result
) != FUNCTION_DECL
)
20197 /* The TREE_PUBLIC flag for function declarations will have been
20198 set correctly by tsubst. */
20199 TREE_PUBLIC (result
) = 1;
20201 /* This might have been set by an earlier implicit instantiation. */
20202 DECL_COMDAT (result
) = 0;
20205 DECL_NOT_REALLY_EXTERN (result
) = 0;
20208 mark_definable (result
);
20209 mark_needed (result
);
20210 /* Always make artificials weak. */
20211 if (DECL_ARTIFICIAL (result
) && flag_weak
)
20212 comdat_linkage (result
);
20213 /* For WIN32 we also want to put explicit instantiations in
20214 linkonce sections. */
20215 else if (TREE_PUBLIC (result
))
20216 maybe_make_one_only (result
);
20219 /* If EXTERN_P, then this function will not be emitted -- unless
20220 followed by an explicit instantiation, at which point its linkage
20221 will be adjusted. If !EXTERN_P, then this function will be
20222 emitted here. In neither circumstance do we want
20223 import_export_decl to adjust the linkage. */
20224 DECL_INTERFACE_KNOWN (result
) = 1;
20227 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
20228 important template arguments. If any are missing, we check whether
20229 they're important by using error_mark_node for substituting into any
20230 args that were used for partial ordering (the ones between ARGS and END)
20231 and seeing if it bubbles up. */
20234 check_undeduced_parms (tree targs
, tree args
, tree end
)
20236 bool found
= false;
20238 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
20239 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
20242 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
20246 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
20247 if (substed
== error_mark_node
)
20253 /* Given two function templates PAT1 and PAT2, return:
20255 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
20256 -1 if PAT2 is more specialized than PAT1.
20257 0 if neither is more specialized.
20259 LEN indicates the number of parameters we should consider
20260 (defaulted parameters should not be considered).
20262 The 1998 std underspecified function template partial ordering, and
20263 DR214 addresses the issue. We take pairs of arguments, one from
20264 each of the templates, and deduce them against each other. One of
20265 the templates will be more specialized if all the *other*
20266 template's arguments deduce against its arguments and at least one
20267 of its arguments *does* *not* deduce against the other template's
20268 corresponding argument. Deduction is done as for class templates.
20269 The arguments used in deduction have reference and top level cv
20270 qualifiers removed. Iff both arguments were originally reference
20271 types *and* deduction succeeds in both directions, an lvalue reference
20272 wins against an rvalue reference and otherwise the template
20273 with the more cv-qualified argument wins for that pairing (if
20274 neither is more cv-qualified, they both are equal). Unlike regular
20275 deduction, after all the arguments have been deduced in this way,
20276 we do *not* verify the deduced template argument values can be
20277 substituted into non-deduced contexts.
20279 The logic can be a bit confusing here, because we look at deduce1 and
20280 targs1 to see if pat2 is at least as specialized, and vice versa; if we
20281 can find template arguments for pat1 to make arg1 look like arg2, that
20282 means that arg2 is at least as specialized as arg1. */
20285 more_specialized_fn (tree pat1
, tree pat2
, int len
)
20287 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
20288 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
20289 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
20290 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
20291 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
20292 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
20293 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
20294 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
20295 tree origs1
, origs2
;
20296 bool lose1
= false;
20297 bool lose2
= false;
20299 /* Remove the this parameter from non-static member functions. If
20300 one is a non-static member function and the other is not a static
20301 member function, remove the first parameter from that function
20302 also. This situation occurs for operator functions where we
20303 locate both a member function (with this pointer) and non-member
20304 operator (with explicit first operand). */
20305 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
20307 len
--; /* LEN is the number of significant arguments for DECL1 */
20308 args1
= TREE_CHAIN (args1
);
20309 if (!DECL_STATIC_FUNCTION_P (decl2
))
20310 args2
= TREE_CHAIN (args2
);
20312 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
20314 args2
= TREE_CHAIN (args2
);
20315 if (!DECL_STATIC_FUNCTION_P (decl1
))
20318 args1
= TREE_CHAIN (args1
);
20322 /* If only one is a conversion operator, they are unordered. */
20323 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
20326 /* Consider the return type for a conversion function */
20327 if (DECL_CONV_FN_P (decl1
))
20329 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
20330 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
20334 processing_template_decl
++;
20340 /* Stop when an ellipsis is seen. */
20341 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
20343 tree arg1
= TREE_VALUE (args1
);
20344 tree arg2
= TREE_VALUE (args2
);
20345 int deduce1
, deduce2
;
20351 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20352 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20354 /* When both arguments are pack expansions, we need only
20355 unify the patterns themselves. */
20356 arg1
= PACK_EXPANSION_PATTERN (arg1
);
20357 arg2
= PACK_EXPANSION_PATTERN (arg2
);
20359 /* This is the last comparison we need to do. */
20363 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
20365 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
20366 arg1
= TREE_TYPE (arg1
);
20367 quals1
= cp_type_quals (arg1
);
20370 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20372 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20373 arg2
= TREE_TYPE (arg2
);
20374 quals2
= cp_type_quals (arg2
);
20377 arg1
= TYPE_MAIN_VARIANT (arg1
);
20378 arg2
= TYPE_MAIN_VARIANT (arg2
);
20380 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20382 int i
, len2
= remaining_arguments (args2
);
20383 tree parmvec
= make_tree_vec (1);
20384 tree argvec
= make_tree_vec (len2
);
20387 /* Setup the parameter vector, which contains only ARG1. */
20388 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20390 /* Setup the argument vector, which contains the remaining
20392 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20393 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20395 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20396 argvec
, DEDUCE_EXACT
,
20397 /*subr=*/true, /*explain_p=*/false)
20400 /* We cannot deduce in the other direction, because ARG1 is
20401 a pack expansion but ARG2 is not. */
20404 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20406 int i
, len1
= remaining_arguments (args1
);
20407 tree parmvec
= make_tree_vec (1);
20408 tree argvec
= make_tree_vec (len1
);
20411 /* Setup the parameter vector, which contains only ARG1. */
20412 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20414 /* Setup the argument vector, which contains the remaining
20416 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20417 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20419 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20420 argvec
, DEDUCE_EXACT
,
20421 /*subr=*/true, /*explain_p=*/false)
20424 /* We cannot deduce in the other direction, because ARG2 is
20425 a pack expansion but ARG1 is not.*/
20431 /* The normal case, where neither argument is a pack
20433 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20434 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20436 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20437 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20441 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20442 arg2, then arg2 is not as specialized as arg1. */
20448 /* "If, for a given type, deduction succeeds in both directions
20449 (i.e., the types are identical after the transformations above)
20450 and both P and A were reference types (before being replaced with
20451 the type referred to above):
20452 - if the type from the argument template was an lvalue reference and
20453 the type from the parameter template was not, the argument type is
20454 considered to be more specialized than the other; otherwise,
20455 - if the type from the argument template is more cv-qualified
20456 than the type from the parameter template (as described above),
20457 the argument type is considered to be more specialized than the other;
20459 - neither type is more specialized than the other." */
20461 if (deduce1
&& deduce2
)
20463 if (ref1
&& ref2
&& ref1
!= ref2
)
20470 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20472 if ((quals1
& quals2
) == quals2
)
20474 if ((quals1
& quals2
) == quals1
)
20479 if (lose1
&& lose2
)
20480 /* We've failed to deduce something in either direction.
20481 These must be unordered. */
20484 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20485 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20486 /* We have already processed all of the arguments in our
20487 handing of the pack expansion type. */
20490 args1
= TREE_CHAIN (args1
);
20491 args2
= TREE_CHAIN (args2
);
20494 /* "In most cases, all template parameters must have values in order for
20495 deduction to succeed, but for partial ordering purposes a template
20496 parameter may remain without a value provided it is not used in the
20497 types being used for partial ordering."
20499 Thus, if we are missing any of the targs1 we need to substitute into
20500 origs1, then pat2 is not as specialized as pat1. This can happen when
20501 there is a nondeduced context. */
20502 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20504 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20507 processing_template_decl
--;
20509 /* If both deductions succeed, the partial ordering selects the more
20510 constrained template. */
20511 if (!lose1
&& !lose2
)
20513 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20514 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20515 lose1
= !subsumes_constraints (c1
, c2
);
20516 lose2
= !subsumes_constraints (c2
, c1
);
20519 /* All things being equal, if the next argument is a pack expansion
20520 for one function but not for the other, prefer the
20521 non-variadic function. FIXME this is bogus; see c++/41958. */
20523 && args1
&& TREE_VALUE (args1
)
20524 && args2
&& TREE_VALUE (args2
))
20526 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20527 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20530 if (lose1
== lose2
)
20538 /* Determine which of two partial specializations of TMPL is more
20541 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20542 to the first partial specialization. The TREE_PURPOSE is the
20543 innermost set of template parameters for the partial
20544 specialization. PAT2 is similar, but for the second template.
20546 Return 1 if the first partial specialization is more specialized;
20547 -1 if the second is more specialized; 0 if neither is more
20550 See [temp.class.order] for information about determining which of
20551 two templates is more specialized. */
20554 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20558 bool any_deductions
= false;
20560 tree tmpl1
= TREE_VALUE (pat1
);
20561 tree tmpl2
= TREE_VALUE (pat2
);
20562 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20563 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20564 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20565 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20567 /* Just like what happens for functions, if we are ordering between
20568 different template specializations, we may encounter dependent
20569 types in the arguments, and we need our dependency check functions
20570 to behave correctly. */
20571 ++processing_template_decl
;
20572 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20576 any_deductions
= true;
20579 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20583 any_deductions
= true;
20585 --processing_template_decl
;
20587 /* If both deductions succeed, the partial ordering selects the more
20588 constrained template. */
20589 if (!winner
&& any_deductions
)
20590 return more_constrained (tmpl1
, tmpl2
);
20592 /* In the case of a tie where at least one of the templates
20593 has a parameter pack at the end, the template with the most
20594 non-packed parameters wins. */
20597 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20598 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20600 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20601 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20602 int len1
= TREE_VEC_LENGTH (args1
);
20603 int len2
= TREE_VEC_LENGTH (args2
);
20605 /* We don't count the pack expansion at the end. */
20606 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20608 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20613 else if (len1
< len2
)
20620 /* Return the template arguments that will produce the function signature
20621 DECL from the function template FN, with the explicit template
20622 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20623 also match. Return NULL_TREE if no satisfactory arguments could be
20627 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20629 int ntparms
= DECL_NTPARMS (fn
);
20630 tree targs
= make_tree_vec (ntparms
);
20631 tree decl_type
= TREE_TYPE (decl
);
20632 tree decl_arg_types
;
20634 unsigned int nargs
, ix
;
20637 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20639 /* Never do unification on the 'this' parameter. */
20640 decl_arg_types
= skip_artificial_parms_for (decl
,
20641 TYPE_ARG_TYPES (decl_type
));
20643 nargs
= list_length (decl_arg_types
);
20644 args
= XALLOCAVEC (tree
, nargs
);
20645 for (arg
= decl_arg_types
, ix
= 0;
20646 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20647 arg
= TREE_CHAIN (arg
), ++ix
)
20648 args
[ix
] = TREE_VALUE (arg
);
20650 if (fn_type_unification (fn
, explicit_args
, targs
,
20652 (check_rettype
|| DECL_CONV_FN_P (fn
)
20653 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20654 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20656 == error_mark_node
)
20662 /* Return the innermost template arguments that, when applied to a partial
20663 specialization of TMPL whose innermost template parameters are
20664 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20667 For example, suppose we have:
20669 template <class T, class U> struct S {};
20670 template <class T> struct S<T*, int> {};
20672 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20673 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20674 int}. The resulting vector will be {double}, indicating that `T'
20675 is bound to `double'. */
20678 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20680 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20682 tree innermost_deduced_args
;
20684 innermost_deduced_args
= make_tree_vec (ntparms
);
20685 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20687 deduced_args
= copy_node (args
);
20688 SET_TMPL_ARGS_LEVEL (deduced_args
,
20689 TMPL_ARGS_DEPTH (deduced_args
),
20690 innermost_deduced_args
);
20693 deduced_args
= innermost_deduced_args
;
20695 if (unify (tparms
, deduced_args
,
20696 INNERMOST_TEMPLATE_ARGS (spec_args
),
20697 INNERMOST_TEMPLATE_ARGS (args
),
20698 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20701 for (i
= 0; i
< ntparms
; ++i
)
20702 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20705 /* Verify that nondeduced template arguments agree with the type
20706 obtained from argument deduction.
20710 struct A { typedef int X; };
20711 template <class T, class U> struct C {};
20712 template <class T> struct C<T, typename T::X> {};
20714 Then with the instantiation `C<A, int>', we can deduce that
20715 `T' is `A' but unify () does not check whether `typename T::X'
20717 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20718 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20720 tf_none
, false, false);
20721 if (spec_args
== error_mark_node
20722 /* We only need to check the innermost arguments; the other
20723 arguments will always agree. */
20724 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20725 INNERMOST_TEMPLATE_ARGS (args
)))
20728 /* Now that we have bindings for all of the template arguments,
20729 ensure that the arguments deduced for the template template
20730 parameters have compatible template parameter lists. See the use
20731 of template_template_parm_bindings_ok_p in fn_type_unification
20732 for more information. */
20733 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20736 return deduced_args
;
20739 // Compare two function templates T1 and T2 by deducing bindings
20740 // from one against the other. If both deductions succeed, compare
20741 // constraints to see which is more constrained.
20743 more_specialized_inst (tree t1
, tree t2
)
20748 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20754 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20760 // If both deductions succeed, then one may be more constrained.
20761 if (count
== 2 && fate
== 0)
20762 fate
= more_constrained (t1
, t2
);
20767 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20768 Return the TREE_LIST node with the most specialized template, if
20769 any. If there is no most specialized template, the error_mark_node
20772 Note that this function does not look at, or modify, the
20773 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20774 returned is one of the elements of INSTANTIATIONS, callers may
20775 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20776 and retrieve it from the value returned. */
20779 most_specialized_instantiation (tree templates
)
20783 ++processing_template_decl
;
20786 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20788 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20793 /* Equally specialized, move to next function. If there
20794 is no next function, nothing's most specialized. */
20795 fn
= TREE_CHAIN (fn
);
20803 /* Now verify that champ is better than everything earlier in the
20804 instantiation list. */
20805 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20806 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20813 processing_template_decl
--;
20816 return error_mark_node
;
20821 /* If DECL is a specialization of some template, return the most
20822 general such template. Otherwise, returns NULL_TREE.
20824 For example, given:
20826 template <class T> struct S { template <class U> void f(U); };
20828 if TMPL is `template <class U> void S<int>::f(U)' this will return
20829 the full template. This function will not trace past partial
20830 specializations, however. For example, given in addition:
20832 template <class T> struct S<T*> { template <class U> void f(U); };
20834 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20835 `template <class T> template <class U> S<T*>::f(U)'. */
20838 most_general_template (tree decl
)
20840 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20842 if (tree tinfo
= get_template_info (decl
))
20843 decl
= TI_TEMPLATE (tinfo
);
20844 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20845 template friend, or a FIELD_DECL for a capture pack. */
20846 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20850 /* Look for more and more general templates. */
20851 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20853 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20854 (See cp-tree.h for details.) */
20855 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20858 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20859 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20860 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20863 /* Stop if we run into an explicitly specialized class template. */
20864 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20865 && DECL_CONTEXT (decl
)
20866 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20869 decl
= DECL_TI_TEMPLATE (decl
);
20875 /* True iff the TEMPLATE_DECL tmpl is a partial specialization. */
20878 partial_specialization_p (tree tmpl
)
20880 /* Any specialization has DECL_TEMPLATE_SPECIALIZATION. */
20881 if (!DECL_TEMPLATE_SPECIALIZATION (tmpl
))
20883 tree t
= DECL_TI_TEMPLATE (tmpl
);
20884 /* A specialization that fully specializes one of the containing classes is
20885 not a partial specialization. */
20886 return (list_length (DECL_TEMPLATE_PARMS (tmpl
))
20887 == list_length (DECL_TEMPLATE_PARMS (t
)));
20890 /* If TMPL is a partial specialization, return the arguments for its primary
20894 impartial_args (tree tmpl
, tree args
)
20896 if (!partial_specialization_p (tmpl
))
20899 /* If TMPL is a partial specialization, we need to substitute to get
20900 the args for the primary template. */
20901 return tsubst_template_args (DECL_TI_ARGS (tmpl
), args
,
20902 tf_warning_or_error
, tmpl
);
20905 /* Return the most specialized of the template partial specializations
20906 which can produce TARGET, a specialization of some class or variable
20907 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20908 a TEMPLATE_DECL node corresponding to the partial specialization, while
20909 the TREE_PURPOSE is the set of template arguments that must be
20910 substituted into the template pattern in order to generate TARGET.
20912 If the choice of partial specialization is ambiguous, a diagnostic
20913 is issued, and the error_mark_node is returned. If there are no
20914 partial specializations matching TARGET, then NULL_TREE is
20915 returned, indicating that the primary template should be used. */
20918 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20920 tree list
= NULL_TREE
;
20925 tree outer_args
= NULL_TREE
;
20928 if (TYPE_P (target
))
20930 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20931 tmpl
= TI_TEMPLATE (tinfo
);
20932 args
= TI_ARGS (tinfo
);
20934 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20936 tmpl
= TREE_OPERAND (target
, 0);
20937 args
= TREE_OPERAND (target
, 1);
20939 else if (VAR_P (target
))
20941 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20942 tmpl
= TI_TEMPLATE (tinfo
);
20943 args
= TI_ARGS (tinfo
);
20946 gcc_unreachable ();
20948 tree main_tmpl
= most_general_template (tmpl
);
20950 /* For determining which partial specialization to use, only the
20951 innermost args are interesting. */
20952 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20954 outer_args
= strip_innermost_template_args (args
, 1);
20955 args
= INNERMOST_TEMPLATE_ARGS (args
);
20958 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20960 tree partial_spec_args
;
20962 tree spec_tmpl
= TREE_VALUE (t
);
20964 partial_spec_args
= TREE_PURPOSE (t
);
20966 ++processing_template_decl
;
20970 /* Discard the outer levels of args, and then substitute in the
20971 template args from the enclosing class. */
20972 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20973 partial_spec_args
= tsubst_template_args
20974 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20976 /* And the same for the partial specialization TEMPLATE_DECL. */
20977 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20980 partial_spec_args
=
20981 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20984 /*require_all_args=*/true,
20985 /*use_default_args=*/true);
20987 --processing_template_decl
;
20989 if (partial_spec_args
== error_mark_node
)
20990 return error_mark_node
;
20991 if (spec_tmpl
== error_mark_node
)
20992 return error_mark_node
;
20994 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20995 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
21001 spec_args
= add_to_template_args (outer_args
, spec_args
);
21003 /* Keep the candidate only if the constraints are satisfied,
21004 or if we're not compiling with concepts. */
21006 || constraints_satisfied_p (spec_tmpl
, spec_args
))
21008 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
21009 TREE_TYPE (list
) = TREE_TYPE (t
);
21017 ambiguous_p
= false;
21020 t
= TREE_CHAIN (t
);
21021 for (; t
; t
= TREE_CHAIN (t
))
21023 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
21030 t
= TREE_CHAIN (t
);
21033 ambiguous_p
= true;
21042 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
21044 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
21047 ambiguous_p
= true;
21055 char *spaces
= NULL
;
21056 if (!(complain
& tf_error
))
21057 return error_mark_node
;
21058 if (TYPE_P (target
))
21059 error ("ambiguous template instantiation for %q#T", target
);
21061 error ("ambiguous template instantiation for %q#D", target
);
21062 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
21063 for (t
= list
; t
; t
= TREE_CHAIN (t
))
21065 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
21066 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
21067 "%s %#S", spaces
? spaces
: str
, subst
);
21068 spaces
= spaces
? spaces
: get_spaces (str
);
21071 return error_mark_node
;
21077 /* Explicitly instantiate DECL. */
21080 do_decl_instantiation (tree decl
, tree storage
)
21082 tree result
= NULL_TREE
;
21085 if (!decl
|| decl
== error_mark_node
)
21086 /* An error occurred, for which grokdeclarator has already issued
21087 an appropriate message. */
21089 else if (! DECL_LANG_SPECIFIC (decl
))
21091 error ("explicit instantiation of non-template %q#D", decl
);
21095 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
21096 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
21098 if (VAR_P (decl
) && !var_templ
)
21100 /* There is an asymmetry here in the way VAR_DECLs and
21101 FUNCTION_DECLs are handled by grokdeclarator. In the case of
21102 the latter, the DECL we get back will be marked as a
21103 template instantiation, and the appropriate
21104 DECL_TEMPLATE_INFO will be set up. This does not happen for
21105 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
21106 should handle VAR_DECLs as it currently handles
21108 if (!DECL_CLASS_SCOPE_P (decl
))
21110 error ("%qD is not a static data member of a class template", decl
);
21113 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
21114 if (!result
|| !VAR_P (result
))
21116 error ("no matching template for %qD found", decl
);
21119 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
21121 error ("type %qT for explicit instantiation %qD does not match "
21122 "declared type %qT", TREE_TYPE (result
), decl
,
21127 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
21129 error ("explicit instantiation of %q#D", decl
);
21135 /* Check for various error cases. Note that if the explicit
21136 instantiation is valid the RESULT will currently be marked as an
21137 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
21138 until we get here. */
21140 if (DECL_TEMPLATE_SPECIALIZATION (result
))
21142 /* DR 259 [temp.spec].
21144 Both an explicit instantiation and a declaration of an explicit
21145 specialization shall not appear in a program unless the explicit
21146 instantiation follows a declaration of the explicit specialization.
21148 For a given set of template parameters, if an explicit
21149 instantiation of a template appears after a declaration of an
21150 explicit specialization for that template, the explicit
21151 instantiation has no effect. */
21154 else if (DECL_EXPLICIT_INSTANTIATION (result
))
21158 No program shall explicitly instantiate any template more
21161 We check DECL_NOT_REALLY_EXTERN so as not to complain when
21162 the first instantiation was `extern' and the second is not,
21163 and EXTERN_P for the opposite case. */
21164 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
21165 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
21166 /* If an "extern" explicit instantiation follows an ordinary
21167 explicit instantiation, the template is instantiated. */
21171 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
21173 error ("no matching template for %qD found", result
);
21176 else if (!DECL_TEMPLATE_INFO (result
))
21178 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
21182 if (storage
== NULL_TREE
)
21184 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21186 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
21187 pedwarn (input_location
, OPT_Wpedantic
,
21188 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
21193 error ("storage class %qD applied to template instantiation", storage
);
21195 check_explicit_instantiation_namespace (result
);
21196 mark_decl_instantiated (result
, extern_p
);
21198 instantiate_decl (result
, /*defer_ok=*/1,
21199 /*expl_inst_class_mem_p=*/false);
21203 mark_class_instantiated (tree t
, int extern_p
)
21205 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
21206 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
21207 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
21208 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
21211 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
21212 rest_of_type_compilation (t
, 1);
21216 /* Called from do_type_instantiation through binding_table_foreach to
21217 do recursive instantiation for the type bound in ENTRY. */
21219 bt_instantiate_type_proc (binding_entry entry
, void *data
)
21221 tree storage
= *(tree
*) data
;
21223 if (MAYBE_CLASS_TYPE_P (entry
->type
)
21224 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
21225 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
21228 /* Called from do_type_instantiation to instantiate a member
21229 (a member function or a static member variable) of an
21230 explicitly instantiated class template. */
21232 instantiate_class_member (tree decl
, int extern_p
)
21234 mark_decl_instantiated (decl
, extern_p
);
21236 instantiate_decl (decl
, /*defer_ok=*/1,
21237 /*expl_inst_class_mem_p=*/true);
21240 /* Perform an explicit instantiation of template class T. STORAGE, if
21241 non-null, is the RID for extern, inline or static. COMPLAIN is
21242 nonzero if this is called from the parser, zero if called recursively,
21243 since the standard is unclear (as detailed below). */
21246 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
21251 int previous_instantiation_extern_p
= 0;
21253 if (TREE_CODE (t
) == TYPE_DECL
)
21256 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
21259 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
21261 error ("explicit instantiation of non-class template %qD", tmpl
);
21263 error ("explicit instantiation of non-template type %qT", t
);
21269 if (!COMPLETE_TYPE_P (t
))
21271 if (complain
& tf_error
)
21272 error ("explicit instantiation of %q#T before definition of template",
21277 if (storage
!= NULL_TREE
)
21279 if (!in_system_header_at (input_location
))
21281 if (storage
== ridpointers
[(int) RID_EXTERN
])
21283 if (cxx_dialect
== cxx98
)
21284 pedwarn (input_location
, OPT_Wpedantic
,
21285 "ISO C++ 1998 forbids the use of %<extern%> on "
21286 "explicit instantiations");
21289 pedwarn (input_location
, OPT_Wpedantic
,
21290 "ISO C++ forbids the use of %qE"
21291 " on explicit instantiations", storage
);
21294 if (storage
== ridpointers
[(int) RID_INLINE
])
21296 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21298 else if (storage
== ridpointers
[(int) RID_STATIC
])
21302 error ("storage class %qD applied to template instantiation",
21308 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
21310 /* DR 259 [temp.spec].
21312 Both an explicit instantiation and a declaration of an explicit
21313 specialization shall not appear in a program unless the explicit
21314 instantiation follows a declaration of the explicit specialization.
21316 For a given set of template parameters, if an explicit
21317 instantiation of a template appears after a declaration of an
21318 explicit specialization for that template, the explicit
21319 instantiation has no effect. */
21322 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
21326 No program shall explicitly instantiate any template more
21329 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
21330 instantiation was `extern'. If EXTERN_P then the second is.
21331 These cases are OK. */
21332 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
21334 if (!previous_instantiation_extern_p
&& !extern_p
21335 && (complain
& tf_error
))
21336 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
21338 /* If we've already instantiated the template, just return now. */
21339 if (!CLASSTYPE_INTERFACE_ONLY (t
))
21343 check_explicit_instantiation_namespace (TYPE_NAME (t
));
21344 mark_class_instantiated (t
, extern_p
);
21352 /* In contrast to implicit instantiation, where only the
21353 declarations, and not the definitions, of members are
21354 instantiated, we have here:
21358 The explicit instantiation of a class template specialization
21359 implies the instantiation of all of its members not
21360 previously explicitly specialized in the translation unit
21361 containing the explicit instantiation.
21363 Of course, we can't instantiate member template classes, since
21364 we don't have any arguments for them. Note that the standard
21365 is unclear on whether the instantiation of the members are
21366 *explicit* instantiations or not. However, the most natural
21367 interpretation is that it should be an explicit instantiation. */
21370 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21371 if (TREE_CODE (tmp
) == FUNCTION_DECL
21372 && DECL_TEMPLATE_INSTANTIATION (tmp
))
21373 instantiate_class_member (tmp
, extern_p
);
21375 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21376 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
21377 instantiate_class_member (tmp
, extern_p
);
21379 if (CLASSTYPE_NESTED_UTDS (t
))
21380 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
21381 bt_instantiate_type_proc
, &storage
);
21385 /* Given a function DECL, which is a specialization of TMPL, modify
21386 DECL to be a re-instantiation of TMPL with the same template
21387 arguments. TMPL should be the template into which tsubst'ing
21388 should occur for DECL, not the most general template.
21390 One reason for doing this is a scenario like this:
21393 void f(const T&, int i);
21395 void g() { f(3, 7); }
21398 void f(const T& t, const int i) { }
21400 Note that when the template is first instantiated, with
21401 instantiate_template, the resulting DECL will have no name for the
21402 first parameter, and the wrong type for the second. So, when we go
21403 to instantiate the DECL, we regenerate it. */
21406 regenerate_decl_from_template (tree decl
, tree tmpl
)
21408 /* The arguments used to instantiate DECL, from the most general
21413 args
= DECL_TI_ARGS (decl
);
21414 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21416 /* Make sure that we can see identifiers, and compute access
21418 push_access_scope (decl
);
21420 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21428 args_depth
= TMPL_ARGS_DEPTH (args
);
21429 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21430 if (args_depth
> parms_depth
)
21431 args
= get_innermost_template_args (args
, parms_depth
);
21433 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21434 args
, tf_error
, NULL_TREE
,
21435 /*defer_ok*/false);
21436 if (specs
&& specs
!= error_mark_node
)
21437 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21440 /* Merge parameter declarations. */
21441 decl_parm
= skip_artificial_parms_for (decl
,
21442 DECL_ARGUMENTS (decl
));
21444 = skip_artificial_parms_for (code_pattern
,
21445 DECL_ARGUMENTS (code_pattern
));
21446 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21451 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21452 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21453 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21455 parm_type
= type_decays_to (parm_type
);
21456 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21457 TREE_TYPE (decl_parm
) = parm_type
;
21458 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21459 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21461 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21462 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21464 decl_parm
= DECL_CHAIN (decl_parm
);
21465 pattern_parm
= DECL_CHAIN (pattern_parm
);
21467 /* Merge any parameters that match with the function parameter
21469 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21472 tree expanded_types
;
21473 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21474 the parameters in this function parameter pack. */
21475 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21476 args
, tf_error
, NULL_TREE
);
21477 len
= TREE_VEC_LENGTH (expanded_types
);
21478 for (i
= 0; i
< len
; i
++)
21483 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21484 /* Rename the parameter to include the index. */
21485 DECL_NAME (decl_parm
) =
21486 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21487 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21488 parm_type
= type_decays_to (parm_type
);
21489 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21490 TREE_TYPE (decl_parm
) = parm_type
;
21491 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21492 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21494 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21495 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21497 decl_parm
= DECL_CHAIN (decl_parm
);
21500 /* Merge additional specifiers from the CODE_PATTERN. */
21501 if (DECL_DECLARED_INLINE_P (code_pattern
)
21502 && !DECL_DECLARED_INLINE_P (decl
))
21503 DECL_DECLARED_INLINE_P (decl
) = 1;
21505 else if (VAR_P (decl
))
21507 DECL_INITIAL (decl
) =
21508 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21509 tf_error
, DECL_TI_TEMPLATE (decl
),
21510 /*integral_constant_expression_p=*/false);
21511 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21512 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21513 tf_error
, DECL_TI_TEMPLATE (decl
));
21516 gcc_unreachable ();
21518 pop_access_scope (decl
);
21521 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21522 substituted to get DECL. */
21525 template_for_substitution (tree decl
)
21527 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21529 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21530 for the instantiation. This is not always the most general
21531 template. Consider, for example:
21534 struct S { template <class U> void f();
21535 template <> void f<int>(); };
21537 and an instantiation of S<double>::f<int>. We want TD to be the
21538 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21539 while (/* An instantiation cannot have a definition, so we need a
21540 more general template. */
21541 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21542 /* We must also deal with friend templates. Given:
21544 template <class T> struct S {
21545 template <class U> friend void f() {};
21548 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21549 so far as the language is concerned, but that's still
21550 where we get the pattern for the instantiation from. On
21551 other hand, if the definition comes outside the class, say:
21553 template <class T> struct S {
21554 template <class U> friend void f();
21556 template <class U> friend void f() {}
21558 we don't need to look any further. That's what the check for
21559 DECL_INITIAL is for. */
21560 || (TREE_CODE (decl
) == FUNCTION_DECL
21561 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21562 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21564 /* The present template, TD, should not be a definition. If it
21565 were a definition, we should be using it! Note that we
21566 cannot restructure the loop to just keep going until we find
21567 a template with a definition, since that might go too far if
21568 a specialization was declared, but not defined. */
21570 /* Fetch the more general template. */
21571 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21577 /* Returns true if we need to instantiate this template instance even if we
21578 know we aren't going to emit it. */
21581 always_instantiate_p (tree decl
)
21583 /* We always instantiate inline functions so that we can inline them. An
21584 explicit instantiation declaration prohibits implicit instantiation of
21585 non-inline functions. With high levels of optimization, we would
21586 normally inline non-inline functions -- but we're not allowed to do
21587 that for "extern template" functions. Therefore, we check
21588 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21589 return ((TREE_CODE (decl
) == FUNCTION_DECL
21590 && (DECL_DECLARED_INLINE_P (decl
)
21591 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21592 /* And we need to instantiate static data members so that
21593 their initializers are available in integral constant
21596 && decl_maybe_constant_var_p (decl
)));
21599 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21600 instantiate it now, modifying TREE_TYPE (fn). */
21603 maybe_instantiate_noexcept (tree fn
)
21605 tree fntype
, spec
, noex
, clone
;
21607 /* Don't instantiate a noexcept-specification from template context. */
21608 if (processing_template_decl
)
21611 if (DECL_CLONED_FUNCTION_P (fn
))
21612 fn
= DECL_CLONED_FUNCTION (fn
);
21613 fntype
= TREE_TYPE (fn
);
21614 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21616 if (!spec
|| !TREE_PURPOSE (spec
))
21619 noex
= TREE_PURPOSE (spec
);
21621 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21623 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21624 spec
= get_defaulted_eh_spec (fn
);
21625 else if (push_tinst_level (fn
))
21627 push_access_scope (fn
);
21628 push_deferring_access_checks (dk_no_deferred
);
21629 input_location
= DECL_SOURCE_LOCATION (fn
);
21630 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21631 DEFERRED_NOEXCEPT_ARGS (noex
),
21632 tf_warning_or_error
, fn
,
21633 /*function_p=*/false,
21634 /*integral_constant_expression_p=*/true);
21635 pop_deferring_access_checks ();
21636 pop_access_scope (fn
);
21637 pop_tinst_level ();
21638 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21639 if (spec
== error_mark_node
)
21640 spec
= noexcept_false_spec
;
21643 spec
= noexcept_false_spec
;
21645 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21648 FOR_EACH_CLONE (clone
, fn
)
21650 if (TREE_TYPE (clone
) == fntype
)
21651 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21653 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21657 /* Produce the definition of D, a _DECL generated from a template. If
21658 DEFER_OK is nonzero, then we don't have to actually do the
21659 instantiation now; we just have to do it sometime. Normally it is
21660 an error if this is an explicit instantiation but D is undefined.
21661 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21662 explicitly instantiated class template. */
21665 instantiate_decl (tree d
, int defer_ok
,
21666 bool expl_inst_class_mem_p
)
21668 tree tmpl
= DECL_TI_TEMPLATE (d
);
21675 bool pattern_defined
;
21676 location_t saved_loc
= input_location
;
21677 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21678 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21682 bool nested
= false;
21684 /* This function should only be used to instantiate templates for
21685 functions and static member variables. */
21686 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21688 /* A concept is never instantiated. */
21689 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21691 /* Variables are never deferred; if instantiation is required, they
21692 are instantiated right away. That allows for better code in the
21693 case that an expression refers to the value of the variable --
21694 if the variable has a constant value the referring expression can
21695 take advantage of that fact. */
21697 || DECL_DECLARED_CONSTEXPR_P (d
))
21700 /* Don't instantiate cloned functions. Instead, instantiate the
21701 functions they cloned. */
21702 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21703 d
= DECL_CLONED_FUNCTION (d
);
21705 if (DECL_TEMPLATE_INSTANTIATED (d
)
21706 || (TREE_CODE (d
) == FUNCTION_DECL
21707 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21708 || DECL_TEMPLATE_SPECIALIZATION (d
))
21709 /* D has already been instantiated or explicitly specialized, so
21710 there's nothing for us to do here.
21712 It might seem reasonable to check whether or not D is an explicit
21713 instantiation, and, if so, stop here. But when an explicit
21714 instantiation is deferred until the end of the compilation,
21715 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21716 the instantiation. */
21719 /* Check to see whether we know that this template will be
21720 instantiated in some other file, as with "extern template"
21722 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21724 /* In general, we do not instantiate such templates. */
21725 if (external_p
&& !always_instantiate_p (d
))
21728 gen_tmpl
= most_general_template (tmpl
);
21729 gen_args
= impartial_args (tmpl
, DECL_TI_ARGS (d
));
21731 if (tmpl
!= gen_tmpl
)
21732 /* We should already have the extra args. */
21733 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21734 == TMPL_ARGS_DEPTH (gen_args
));
21735 /* And what's in the hash table should match D. */
21736 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21737 || spec
== NULL_TREE
);
21739 /* This needs to happen before any tsubsting. */
21740 if (! push_tinst_level (d
))
21743 timevar_push (TV_TEMPLATE_INST
);
21745 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21746 for the instantiation. */
21747 td
= template_for_substitution (d
);
21748 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21750 /* We should never be trying to instantiate a member of a class
21751 template or partial specialization. */
21752 gcc_assert (d
!= code_pattern
);
21754 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21755 || DECL_TEMPLATE_SPECIALIZATION (td
))
21756 /* In the case of a friend template whose definition is provided
21757 outside the class, we may have too many arguments. Drop the
21758 ones we don't need. The same is true for specializations. */
21759 args
= get_innermost_template_args
21760 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21764 if (TREE_CODE (d
) == FUNCTION_DECL
)
21766 deleted_p
= DECL_DELETED_FN (code_pattern
);
21767 pattern_defined
= ((DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21768 && DECL_INITIAL (code_pattern
) != error_mark_node
)
21769 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21775 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21778 /* We may be in the middle of deferred access check. Disable it now. */
21779 push_deferring_access_checks (dk_no_deferred
);
21781 /* Unless an explicit instantiation directive has already determined
21782 the linkage of D, remember that a definition is available for
21784 if (pattern_defined
21785 && !DECL_INTERFACE_KNOWN (d
)
21786 && !DECL_NOT_REALLY_EXTERN (d
))
21787 mark_definable (d
);
21789 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21790 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21791 input_location
= DECL_SOURCE_LOCATION (d
);
21793 /* If D is a member of an explicitly instantiated class template,
21794 and no definition is available, treat it like an implicit
21796 if (!pattern_defined
&& expl_inst_class_mem_p
21797 && DECL_EXPLICIT_INSTANTIATION (d
))
21799 /* Leave linkage flags alone on instantiations with anonymous
21801 if (TREE_PUBLIC (d
))
21803 DECL_NOT_REALLY_EXTERN (d
) = 0;
21804 DECL_INTERFACE_KNOWN (d
) = 0;
21806 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21809 /* Defer all other templates, unless we have been explicitly
21810 forbidden from doing so. */
21811 if (/* If there is no definition, we cannot instantiate the
21814 /* If it's OK to postpone instantiation, do so. */
21816 /* If this is a static data member that will be defined
21817 elsewhere, we don't want to instantiate the entire data
21818 member, but we do want to instantiate the initializer so that
21819 we can substitute that elsewhere. */
21820 || (external_p
&& VAR_P (d
))
21821 /* Handle here a deleted function too, avoid generating
21822 its body (c++/61080). */
21825 /* The definition of the static data member is now required so
21826 we must substitute the initializer. */
21828 && !DECL_INITIAL (d
)
21829 && DECL_INITIAL (code_pattern
))
21833 bool const_init
= false;
21834 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21836 ns
= decl_namespace_context (d
);
21837 push_nested_namespace (ns
);
21839 push_nested_class (DECL_CONTEXT (d
));
21840 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21842 tf_warning_or_error
, NULL_TREE
,
21843 /*integral_constant_expression_p=*/false);
21844 /* If instantiating the initializer involved instantiating this
21845 again, don't call cp_finish_decl twice. */
21846 if (!DECL_INITIAL (d
))
21848 /* Make sure the initializer is still constant, in case of
21849 circular dependency (template/instantiate6.C). */
21851 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21852 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21853 /*asmspec_tree=*/NULL_TREE
,
21854 LOOKUP_ONLYCONVERTING
);
21857 pop_nested_class ();
21858 pop_nested_namespace (ns
);
21861 /* We restore the source position here because it's used by
21862 add_pending_template. */
21863 input_location
= saved_loc
;
21865 if (at_eof
&& !pattern_defined
21866 && DECL_EXPLICIT_INSTANTIATION (d
)
21867 && DECL_NOT_REALLY_EXTERN (d
))
21870 The definition of a non-exported function template, a
21871 non-exported member function template, or a non-exported
21872 member function or static data member of a class template
21873 shall be present in every translation unit in which it is
21874 explicitly instantiated. */
21875 permerror (input_location
, "explicit instantiation of %qD "
21876 "but no definition available", d
);
21878 /* If we're in unevaluated context, we just wanted to get the
21879 constant value; this isn't an odr use, so don't queue
21880 a full instantiation. */
21881 if (cp_unevaluated_operand
!= 0)
21883 /* ??? Historically, we have instantiated inline functions, even
21884 when marked as "extern template". */
21885 if (!(external_p
&& VAR_P (d
)))
21886 add_pending_template (d
);
21889 /* Tell the repository that D is available in this translation unit
21890 -- and see if it is supposed to be instantiated here. */
21891 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21893 /* In a PCH file, despite the fact that the repository hasn't
21894 requested instantiation in the PCH it is still possible that
21895 an instantiation will be required in a file that includes the
21898 add_pending_template (d
);
21899 /* Instantiate inline functions so that the inliner can do its
21900 job, even though we'll not be emitting a copy of this
21902 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21906 fn_context
= decl_function_context (d
);
21907 nested
= (current_function_decl
!= NULL_TREE
);
21908 vec
<tree
> omp_privatization_save
;
21910 save_omp_privatization_clauses (omp_privatization_save
);
21913 push_to_top_level ();
21917 push_function_context ();
21918 cp_unevaluated_operand
= 0;
21919 c_inhibit_evaluation_warnings
= 0;
21922 /* Mark D as instantiated so that recursive calls to
21923 instantiate_decl do not try to instantiate it again. */
21924 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21926 /* Regenerate the declaration in case the template has been modified
21927 by a subsequent redeclaration. */
21928 regenerate_decl_from_template (d
, td
);
21930 /* We already set the file and line above. Reset them now in case
21931 they changed as a result of calling regenerate_decl_from_template. */
21932 input_location
= DECL_SOURCE_LOCATION (d
);
21937 bool const_init
= false;
21939 /* Clear out DECL_RTL; whatever was there before may not be right
21940 since we've reset the type of the declaration. */
21941 SET_DECL_RTL (d
, NULL
);
21942 DECL_IN_AGGR_P (d
) = 0;
21944 /* The initializer is placed in DECL_INITIAL by
21945 regenerate_decl_from_template so we don't need to
21946 push/pop_access_scope again here. Pull it out so that
21947 cp_finish_decl can process it. */
21948 init
= DECL_INITIAL (d
);
21949 DECL_INITIAL (d
) = NULL_TREE
;
21950 DECL_INITIALIZED_P (d
) = 0;
21952 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21953 initializer. That function will defer actual emission until
21954 we have a chance to determine linkage. */
21955 DECL_EXTERNAL (d
) = 0;
21957 /* Enter the scope of D so that access-checking works correctly. */
21958 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21960 push_nested_class (DECL_CONTEXT (d
));
21962 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21963 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21966 pop_nested_class ();
21968 if (variable_template_p (gen_tmpl
))
21969 note_variable_template_instantiation (d
);
21971 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21972 synthesize_method (d
);
21973 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21975 hash_map
<tree
, tree
> *saved_local_specializations
;
21979 tree block
= NULL_TREE
;
21981 /* Save away the current list, in case we are instantiating one
21982 template from within the body of another. */
21983 saved_local_specializations
= local_specializations
;
21985 /* Set up the list of local specializations. */
21986 local_specializations
= new hash_map
<tree
, tree
>;
21988 /* Set up context. */
21989 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21990 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21991 block
= push_stmt_list ();
21993 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21995 /* Some typedefs referenced from within the template code need to be
21996 access checked at template instantiation time, i.e now. These
21997 types were added to the template at parsing time. Let's get those
21998 and perform the access checks then. */
21999 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
22002 /* Create substitution entries for the parameters. */
22003 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
22004 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
22005 spec_parm
= DECL_ARGUMENTS (d
);
22006 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
22008 register_local_specialization (spec_parm
, tmpl_parm
);
22009 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
22010 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
22012 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
22014 if (!DECL_PACK_P (tmpl_parm
))
22016 register_local_specialization (spec_parm
, tmpl_parm
);
22017 spec_parm
= DECL_CHAIN (spec_parm
);
22021 /* Register the (value) argument pack as a specialization of
22022 TMPL_PARM, then move on. */
22023 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
22024 register_local_specialization (argpack
, tmpl_parm
);
22027 gcc_assert (!spec_parm
);
22029 /* Substitute into the body of the function. */
22030 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
22031 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
22032 tf_warning_or_error
, tmpl
);
22035 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
22036 tf_warning_or_error
, tmpl
,
22037 /*integral_constant_expression_p=*/false);
22039 /* Set the current input_location to the end of the function
22040 so that finish_function knows where we are. */
22042 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
22044 /* Remember if we saw an infinite loop in the template. */
22045 current_function_infinite_loop
22046 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
22049 /* We don't need the local specializations any more. */
22050 delete local_specializations
;
22051 local_specializations
= saved_local_specializations
;
22053 /* Finish the function. */
22054 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
22055 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
22056 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
22059 d
= finish_function (0);
22060 expand_or_defer_fn (d
);
22063 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
22064 cp_check_omp_declare_reduction (d
);
22067 /* We're not deferring instantiation any more. */
22068 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
22071 pop_from_top_level ();
22073 pop_function_context ();
22076 input_location
= saved_loc
;
22077 cp_unevaluated_operand
= saved_unevaluated_operand
;
22078 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
22079 pop_deferring_access_checks ();
22080 pop_tinst_level ();
22082 restore_omp_privatization_clauses (omp_privatization_save
);
22084 timevar_pop (TV_TEMPLATE_INST
);
22089 /* Run through the list of templates that we wish we could
22090 instantiate, and instantiate any we can. RETRIES is the
22091 number of times we retry pending template instantiation. */
22094 instantiate_pending_templates (int retries
)
22097 location_t saved_loc
= input_location
;
22099 /* Instantiating templates may trigger vtable generation. This in turn
22100 may require further template instantiations. We place a limit here
22101 to avoid infinite loop. */
22102 if (pending_templates
&& retries
>= max_tinst_depth
)
22104 tree decl
= pending_templates
->tinst
->decl
;
22106 fatal_error (input_location
,
22107 "template instantiation depth exceeds maximum of %d"
22108 " instantiating %q+D, possibly from virtual table generation"
22109 " (use -ftemplate-depth= to increase the maximum)",
22110 max_tinst_depth
, decl
);
22111 if (TREE_CODE (decl
) == FUNCTION_DECL
)
22112 /* Pretend that we defined it. */
22113 DECL_INITIAL (decl
) = error_mark_node
;
22119 struct pending_template
**t
= &pending_templates
;
22120 struct pending_template
*last
= NULL
;
22124 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
22125 bool complete
= false;
22127 if (TYPE_P (instantiation
))
22131 if (!COMPLETE_TYPE_P (instantiation
))
22133 instantiate_class_template (instantiation
);
22134 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
22135 for (fn
= TYPE_METHODS (instantiation
);
22137 fn
= TREE_CHAIN (fn
))
22138 if (! DECL_ARTIFICIAL (fn
))
22139 instantiate_decl (fn
,
22141 /*expl_inst_class_mem_p=*/false);
22142 if (COMPLETE_TYPE_P (instantiation
))
22146 complete
= COMPLETE_TYPE_P (instantiation
);
22150 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
22151 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
22154 = instantiate_decl (instantiation
,
22156 /*expl_inst_class_mem_p=*/false);
22157 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
22161 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
22162 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
22166 /* If INSTANTIATION has been instantiated, then we don't
22167 need to consider it again in the future. */
22175 current_tinst_level
= NULL
;
22177 last_pending_template
= last
;
22179 while (reconsider
);
22181 input_location
= saved_loc
;
22184 /* Substitute ARGVEC into T, which is a list of initializers for
22185 either base class or a non-static data member. The TREE_PURPOSEs
22186 are DECLs, and the TREE_VALUEs are the initializer values. Used by
22187 instantiate_decl. */
22190 tsubst_initializer_list (tree t
, tree argvec
)
22192 tree inits
= NULL_TREE
;
22194 for (; t
; t
= TREE_CHAIN (t
))
22198 tree expanded_bases
= NULL_TREE
;
22199 tree expanded_arguments
= NULL_TREE
;
22202 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
22207 /* Expand the base class expansion type into separate base
22209 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
22210 tf_warning_or_error
,
22212 if (expanded_bases
== error_mark_node
)
22215 /* We'll be building separate TREE_LISTs of arguments for
22217 len
= TREE_VEC_LENGTH (expanded_bases
);
22218 expanded_arguments
= make_tree_vec (len
);
22219 for (i
= 0; i
< len
; i
++)
22220 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
22222 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
22223 expand each argument in the TREE_VALUE of t. */
22224 expr
= make_node (EXPR_PACK_EXPANSION
);
22225 PACK_EXPANSION_LOCAL_P (expr
) = true;
22226 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
22227 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
22229 if (TREE_VALUE (t
) == void_type_node
)
22230 /* VOID_TYPE_NODE is used to indicate
22231 value-initialization. */
22233 for (i
= 0; i
< len
; i
++)
22234 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
22238 /* Substitute parameter packs into each argument in the
22240 in_base_initializer
= 1;
22241 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
22243 tree expanded_exprs
;
22245 /* Expand the argument. */
22246 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
22248 = tsubst_pack_expansion (expr
, argvec
,
22249 tf_warning_or_error
,
22251 if (expanded_exprs
== error_mark_node
)
22254 /* Prepend each of the expanded expressions to the
22255 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
22256 for (i
= 0; i
< len
; i
++)
22258 TREE_VEC_ELT (expanded_arguments
, i
) =
22259 tree_cons (NULL_TREE
,
22260 TREE_VEC_ELT (expanded_exprs
, i
),
22261 TREE_VEC_ELT (expanded_arguments
, i
));
22264 in_base_initializer
= 0;
22266 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
22267 since we built them backwards. */
22268 for (i
= 0; i
< len
; i
++)
22270 TREE_VEC_ELT (expanded_arguments
, i
) =
22271 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
22276 for (i
= 0; i
< len
; ++i
)
22278 if (expanded_bases
)
22280 decl
= TREE_VEC_ELT (expanded_bases
, i
);
22281 decl
= expand_member_init (decl
);
22282 init
= TREE_VEC_ELT (expanded_arguments
, i
);
22287 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
22288 tf_warning_or_error
, NULL_TREE
);
22290 decl
= expand_member_init (decl
);
22291 if (decl
&& !DECL_P (decl
))
22292 in_base_initializer
= 1;
22294 init
= TREE_VALUE (t
);
22296 if (init
!= void_type_node
)
22297 init
= tsubst_expr (init
, argvec
,
22298 tf_warning_or_error
, NULL_TREE
,
22299 /*integral_constant_expression_p=*/false);
22300 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
22301 /* If we had an initializer but it instantiated to nothing,
22302 value-initialize the object. This will only occur when
22303 the initializer was a pack expansion where the parameter
22304 packs used in that expansion were of length zero. */
22305 init
= void_type_node
;
22306 in_base_initializer
= 0;
22311 init
= build_tree_list (decl
, init
);
22312 TREE_CHAIN (init
) = inits
;
22320 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
22323 set_current_access_from_decl (tree decl
)
22325 if (TREE_PRIVATE (decl
))
22326 current_access_specifier
= access_private_node
;
22327 else if (TREE_PROTECTED (decl
))
22328 current_access_specifier
= access_protected_node
;
22330 current_access_specifier
= access_public_node
;
22333 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
22334 is the instantiation (which should have been created with
22335 start_enum) and ARGS are the template arguments to use. */
22338 tsubst_enum (tree tag
, tree newtag
, tree args
)
22342 if (SCOPED_ENUM_P (newtag
))
22343 begin_scope (sk_scoped_enum
, newtag
);
22345 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
22350 decl
= TREE_VALUE (e
);
22351 /* Note that in a template enum, the TREE_VALUE is the
22352 CONST_DECL, not the corresponding INTEGER_CST. */
22353 value
= tsubst_expr (DECL_INITIAL (decl
),
22354 args
, tf_warning_or_error
, NULL_TREE
,
22355 /*integral_constant_expression_p=*/true);
22357 /* Give this enumeration constant the correct access. */
22358 set_current_access_from_decl (decl
);
22360 /* Actually build the enumerator itself. Here we're assuming that
22361 enumerators can't have dependent attributes. */
22362 build_enumerator (DECL_NAME (decl
), value
, newtag
,
22363 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
22366 if (SCOPED_ENUM_P (newtag
))
22369 finish_enum_value_list (newtag
);
22370 finish_enum (newtag
);
22372 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
22373 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
22376 /* DECL is a FUNCTION_DECL that is a template specialization. Return
22377 its type -- but without substituting the innermost set of template
22378 arguments. So, innermost set of template parameters will appear in
22382 get_mostly_instantiated_function_type (tree decl
)
22384 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
22385 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
22388 /* Return truthvalue if we're processing a template different from
22389 the last one involved in diagnostics. */
22391 problematic_instantiation_changed (void)
22393 return current_tinst_level
!= last_error_tinst_level
;
22396 /* Remember current template involved in diagnostics. */
22398 record_last_problematic_instantiation (void)
22400 last_error_tinst_level
= current_tinst_level
;
22403 struct tinst_level
*
22404 current_instantiation (void)
22406 return current_tinst_level
;
22409 /* Return TRUE if current_function_decl is being instantiated, false
22413 instantiating_current_function_p (void)
22415 return (current_instantiation ()
22416 && current_instantiation ()->decl
== current_function_decl
);
22419 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22420 type. Return zero for ok, nonzero for disallowed. Issue error and
22421 warning messages under control of COMPLAIN. */
22424 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22426 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22428 else if (POINTER_TYPE_P (type
))
22430 else if (TYPE_PTRMEM_P (type
))
22432 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22434 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22436 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22438 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22440 /* A bound template template parm could later be instantiated to have a valid
22441 nontype parm type via an alias template. */
22442 else if (cxx_dialect
>= cxx11
22443 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22446 if (complain
& tf_error
)
22448 if (type
== error_mark_node
)
22449 inform (input_location
, "invalid template non-type parameter");
22451 error ("%q#T is not a valid type for a template non-type parameter",
22457 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22458 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22461 dependent_type_p_r (tree type
)
22467 A type is dependent if it is:
22469 -- a template parameter. Template template parameters are types
22470 for us (since TYPE_P holds true for them) so we handle
22472 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22473 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22475 /* -- a qualified-id with a nested-name-specifier which contains a
22476 class-name that names a dependent type or whose unqualified-id
22477 names a dependent type. */
22478 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22481 /* An alias template specialization can be dependent even if the
22482 resulting type is not. */
22483 if (dependent_alias_template_spec_p (type
))
22486 /* -- a cv-qualified type where the cv-unqualified type is
22488 No code is necessary for this bullet; the code below handles
22489 cv-qualified types, and we don't want to strip aliases with
22490 TYPE_MAIN_VARIANT because of DR 1558. */
22491 /* -- a compound type constructed from any dependent type. */
22492 if (TYPE_PTRMEM_P (type
))
22493 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22494 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22496 else if (TYPE_PTR_P (type
)
22497 || TREE_CODE (type
) == REFERENCE_TYPE
)
22498 return dependent_type_p (TREE_TYPE (type
));
22499 else if (TREE_CODE (type
) == FUNCTION_TYPE
22500 || TREE_CODE (type
) == METHOD_TYPE
)
22504 if (dependent_type_p (TREE_TYPE (type
)))
22506 for (arg_type
= TYPE_ARG_TYPES (type
);
22508 arg_type
= TREE_CHAIN (arg_type
))
22509 if (dependent_type_p (TREE_VALUE (arg_type
)))
22513 /* -- an array type constructed from any dependent type or whose
22514 size is specified by a constant expression that is
22517 We checked for type- and value-dependence of the bounds in
22518 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22519 if (TREE_CODE (type
) == ARRAY_TYPE
)
22521 if (TYPE_DOMAIN (type
)
22522 && dependent_type_p (TYPE_DOMAIN (type
)))
22524 return dependent_type_p (TREE_TYPE (type
));
22527 /* -- a template-id in which either the template name is a template
22529 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22531 /* ... or any of the template arguments is a dependent type or
22532 an expression that is type-dependent or value-dependent. */
22533 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22534 && (any_dependent_template_arguments_p
22535 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22538 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22539 dependent; if the argument of the `typeof' expression is not
22540 type-dependent, then it should already been have resolved. */
22541 if (TREE_CODE (type
) == TYPEOF_TYPE
22542 || TREE_CODE (type
) == DECLTYPE_TYPE
22543 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22546 /* A template argument pack is dependent if any of its packed
22548 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22550 tree args
= ARGUMENT_PACK_ARGS (type
);
22551 int i
, len
= TREE_VEC_LENGTH (args
);
22552 for (i
= 0; i
< len
; ++i
)
22553 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22557 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22558 be template parameters. */
22559 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22562 /* The standard does not specifically mention types that are local
22563 to template functions or local classes, but they should be
22564 considered dependent too. For example:
22566 template <int I> void f() {
22571 The size of `E' cannot be known until the value of `I' has been
22572 determined. Therefore, `E' must be considered dependent. */
22573 scope
= TYPE_CONTEXT (type
);
22574 if (scope
&& TYPE_P (scope
))
22575 return dependent_type_p (scope
);
22576 /* Don't use type_dependent_expression_p here, as it can lead
22577 to infinite recursion trying to determine whether a lambda
22578 nested in a lambda is dependent (c++/47687). */
22579 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22580 && DECL_LANG_SPECIFIC (scope
)
22581 && DECL_TEMPLATE_INFO (scope
)
22582 && (any_dependent_template_arguments_p
22583 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22586 /* Other types are non-dependent. */
22590 /* Returns TRUE if TYPE is dependent, in the sense of
22591 [temp.dep.type]. Note that a NULL type is considered dependent. */
22594 dependent_type_p (tree type
)
22596 /* If there are no template parameters in scope, then there can't be
22597 any dependent types. */
22598 if (!processing_template_decl
)
22600 /* If we are not processing a template, then nobody should be
22601 providing us with a dependent type. */
22603 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22607 /* If the type is NULL, we have not computed a type for the entity
22608 in question; in that case, the type is dependent. */
22612 /* Erroneous types can be considered non-dependent. */
22613 if (type
== error_mark_node
)
22616 /* If we have not already computed the appropriate value for TYPE,
22618 if (!TYPE_DEPENDENT_P_VALID (type
))
22620 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22621 TYPE_DEPENDENT_P_VALID (type
) = 1;
22624 return TYPE_DEPENDENT_P (type
);
22627 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22628 lookup. In other words, a dependent type that is not the current
22632 dependent_scope_p (tree scope
)
22634 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22635 && !currently_open_class (scope
));
22638 /* T is a SCOPE_REF; return whether we need to consider it
22639 instantiation-dependent so that we can check access at instantiation
22640 time even though we know which member it resolves to. */
22643 instantiation_dependent_scope_ref_p (tree t
)
22645 if (DECL_P (TREE_OPERAND (t
, 1))
22646 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22647 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22648 TREE_OPERAND (t
, 1)))
22654 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22655 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22658 /* Note that this predicate is not appropriate for general expressions;
22659 only constant expressions (that satisfy potential_constant_expression)
22660 can be tested for value dependence. */
22663 value_dependent_expression_p (tree expression
)
22665 if (!processing_template_decl
)
22668 /* A name declared with a dependent type. */
22669 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22672 switch (TREE_CODE (expression
))
22675 /* A dependent member function of the current instantiation. */
22676 return dependent_type_p (BINFO_TYPE (BASELINK_BINFO (expression
)));
22678 case FUNCTION_DECL
:
22679 /* A dependent member function of the current instantiation. */
22680 if (DECL_CLASS_SCOPE_P (expression
)
22681 && dependent_type_p (DECL_CONTEXT (expression
)))
22685 case IDENTIFIER_NODE
:
22686 /* A name that has not been looked up -- must be dependent. */
22689 case TEMPLATE_PARM_INDEX
:
22690 /* A non-type template parm. */
22694 /* A non-type template parm. */
22695 if (DECL_TEMPLATE_PARM_P (expression
))
22697 return value_dependent_expression_p (DECL_INITIAL (expression
));
22700 /* A constant with literal type and is initialized
22701 with an expression that is value-dependent.
22703 Note that a non-dependent parenthesized initializer will have
22704 already been replaced with its constant value, so if we see
22705 a TREE_LIST it must be dependent. */
22706 if (DECL_INITIAL (expression
)
22707 && decl_constant_var_p (expression
)
22708 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22709 /* cp_finish_decl doesn't fold reference initializers. */
22710 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22711 || type_dependent_expression_p (DECL_INITIAL (expression
))
22712 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22716 case DYNAMIC_CAST_EXPR
:
22717 case STATIC_CAST_EXPR
:
22718 case CONST_CAST_EXPR
:
22719 case REINTERPRET_CAST_EXPR
:
22721 /* These expressions are value-dependent if the type to which
22722 the cast occurs is dependent or the expression being casted
22723 is value-dependent. */
22725 tree type
= TREE_TYPE (expression
);
22727 if (dependent_type_p (type
))
22730 /* A functional cast has a list of operands. */
22731 expression
= TREE_OPERAND (expression
, 0);
22734 /* If there are no operands, it must be an expression such
22735 as "int()". This should not happen for aggregate types
22736 because it would form non-constant expressions. */
22737 gcc_assert (cxx_dialect
>= cxx11
22738 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22743 if (TREE_CODE (expression
) == TREE_LIST
)
22744 return any_value_dependent_elements_p (expression
);
22746 return value_dependent_expression_p (expression
);
22750 if (SIZEOF_EXPR_TYPE_P (expression
))
22751 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22755 /* A `sizeof' expression is value-dependent if the operand is
22756 type-dependent or is a pack expansion. */
22757 expression
= TREE_OPERAND (expression
, 0);
22758 if (PACK_EXPANSION_P (expression
))
22760 else if (TYPE_P (expression
))
22761 return dependent_type_p (expression
);
22762 return instantiation_dependent_uneval_expression_p (expression
);
22764 case AT_ENCODE_EXPR
:
22765 /* An 'encode' expression is value-dependent if the operand is
22767 expression
= TREE_OPERAND (expression
, 0);
22768 return dependent_type_p (expression
);
22770 case NOEXCEPT_EXPR
:
22771 expression
= TREE_OPERAND (expression
, 0);
22772 return instantiation_dependent_uneval_expression_p (expression
);
22775 /* All instantiation-dependent expressions should also be considered
22776 value-dependent. */
22777 return instantiation_dependent_scope_ref_p (expression
);
22779 case COMPONENT_REF
:
22780 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22781 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22783 case NONTYPE_ARGUMENT_PACK
:
22784 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22785 is value-dependent. */
22787 tree values
= ARGUMENT_PACK_ARGS (expression
);
22788 int i
, len
= TREE_VEC_LENGTH (values
);
22790 for (i
= 0; i
< len
; ++i
)
22791 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22799 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22800 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22801 || (type2
? dependent_type_p (type2
) : false));
22805 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22806 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22809 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22810 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22814 tree op
= TREE_OPERAND (expression
, 0);
22815 return (value_dependent_expression_p (op
)
22816 || has_value_dependent_address (op
));
22819 case REQUIRES_EXPR
:
22820 /* Treat all requires-expressions as value-dependent so
22821 we don't try to fold them. */
22825 return dependent_type_p (TREE_OPERAND (expression
, 0));
22829 if (value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22831 tree fn
= get_callee_fndecl (expression
);
22833 nargs
= call_expr_nargs (expression
);
22834 for (i
= 0; i
< nargs
; ++i
)
22836 tree op
= CALL_EXPR_ARG (expression
, i
);
22837 /* In a call to a constexpr member function, look through the
22838 implicit ADDR_EXPR on the object argument so that it doesn't
22839 cause the call to be considered value-dependent. We also
22840 look through it in potential_constant_expression. */
22841 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22842 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22843 && TREE_CODE (op
) == ADDR_EXPR
)
22844 op
= TREE_OPERAND (op
, 0);
22845 if (value_dependent_expression_p (op
))
22851 case TEMPLATE_ID_EXPR
:
22852 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22854 return type_dependent_expression_p (expression
)
22855 || variable_concept_p (TREE_OPERAND (expression
, 0));
22861 if (dependent_type_p (TREE_TYPE (expression
)))
22863 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22864 if (value_dependent_expression_p (val
))
22870 /* Treat a GNU statement expression as dependent to avoid crashing
22871 under instantiate_non_dependent_expr; it can't be constant. */
22875 /* A constant expression is value-dependent if any subexpression is
22876 value-dependent. */
22877 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22879 case tcc_reference
:
22881 case tcc_comparison
:
22883 case tcc_expression
:
22886 int i
, len
= cp_tree_operand_length (expression
);
22888 for (i
= 0; i
< len
; i
++)
22890 tree t
= TREE_OPERAND (expression
, i
);
22892 /* In some cases, some of the operands may be missing.l
22893 (For example, in the case of PREDECREMENT_EXPR, the
22894 amount to increment by may be missing.) That doesn't
22895 make the expression dependent. */
22896 if (t
&& value_dependent_expression_p (t
))
22907 /* The expression is not value-dependent. */
22911 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22912 [temp.dep.expr]. Note that an expression with no type is
22913 considered dependent. Other parts of the compiler arrange for an
22914 expression with type-dependent subexpressions to have no type, so
22915 this function doesn't have to be fully recursive. */
22918 type_dependent_expression_p (tree expression
)
22920 if (!processing_template_decl
)
22923 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22926 /* An unresolved name is always dependent. */
22927 if (identifier_p (expression
)
22928 || TREE_CODE (expression
) == USING_DECL
22929 || TREE_CODE (expression
) == WILDCARD_DECL
)
22932 /* A fold expression is type-dependent. */
22933 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22934 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22935 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22936 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22939 /* Some expression forms are never type-dependent. */
22940 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22941 || TREE_CODE (expression
) == SIZEOF_EXPR
22942 || TREE_CODE (expression
) == ALIGNOF_EXPR
22943 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22944 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22945 || TREE_CODE (expression
) == TRAIT_EXPR
22946 || TREE_CODE (expression
) == TYPEID_EXPR
22947 || TREE_CODE (expression
) == DELETE_EXPR
22948 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22949 || TREE_CODE (expression
) == THROW_EXPR
22950 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22953 /* The types of these expressions depends only on the type to which
22954 the cast occurs. */
22955 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22956 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22957 || TREE_CODE (expression
) == CONST_CAST_EXPR
22958 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22959 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22960 || TREE_CODE (expression
) == CAST_EXPR
)
22961 return dependent_type_p (TREE_TYPE (expression
));
22963 /* The types of these expressions depends only on the type created
22964 by the expression. */
22965 if (TREE_CODE (expression
) == NEW_EXPR
22966 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22968 /* For NEW_EXPR tree nodes created inside a template, either
22969 the object type itself or a TREE_LIST may appear as the
22971 tree type
= TREE_OPERAND (expression
, 1);
22972 if (TREE_CODE (type
) == TREE_LIST
)
22973 /* This is an array type. We need to check array dimensions
22975 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22976 || value_dependent_expression_p
22977 (TREE_OPERAND (TREE_VALUE (type
), 1));
22979 return dependent_type_p (type
);
22982 if (TREE_CODE (expression
) == SCOPE_REF
)
22984 tree scope
= TREE_OPERAND (expression
, 0);
22985 tree name
= TREE_OPERAND (expression
, 1);
22987 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22988 contains an identifier associated by name lookup with one or more
22989 declarations declared with a dependent type, or...a
22990 nested-name-specifier or qualified-id that names a member of an
22991 unknown specialization. */
22992 return (type_dependent_expression_p (name
)
22993 || dependent_scope_p (scope
));
22996 if (TREE_CODE (expression
) == TEMPLATE_DECL
22997 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
23000 if (TREE_CODE (expression
) == STMT_EXPR
)
23001 expression
= stmt_expr_value_expr (expression
);
23003 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
23008 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
23010 if (type_dependent_expression_p (elt
))
23016 /* A static data member of the current instantiation with incomplete
23017 array type is type-dependent, as the definition and specializations
23018 can have different bounds. */
23019 if (VAR_P (expression
)
23020 && DECL_CLASS_SCOPE_P (expression
)
23021 && dependent_type_p (DECL_CONTEXT (expression
))
23022 && VAR_HAD_UNKNOWN_BOUND (expression
))
23025 /* An array of unknown bound depending on a variadic parameter, eg:
23027 template<typename... Args>
23028 void foo (Args... args)
23030 int arr[] = { args... };
23033 template<int... vals>
23036 int arr[] = { vals... };
23039 If the array has no length and has an initializer, it must be that
23040 we couldn't determine its length in cp_complete_array_type because
23041 it is dependent. */
23042 if (VAR_P (expression
)
23043 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
23044 && !TYPE_DOMAIN (TREE_TYPE (expression
))
23045 && DECL_INITIAL (expression
))
23048 /* A function or variable template-id is type-dependent if it has any
23049 dependent template arguments. Note that we only consider the innermost
23050 template arguments here, since those are the ones that come from the
23051 template-id; the template arguments for the enclosing class do not make it
23052 type-dependent, they only make a member function value-dependent. */
23053 if (VAR_OR_FUNCTION_DECL_P (expression
)
23054 && DECL_LANG_SPECIFIC (expression
)
23055 && DECL_TEMPLATE_INFO (expression
)
23056 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (expression
))
23057 && (any_dependent_template_arguments_p
23058 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
23061 /* Always dependent, on the number of arguments if nothing else. */
23062 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
23065 if (TREE_TYPE (expression
) == unknown_type_node
)
23067 if (TREE_CODE (expression
) == ADDR_EXPR
)
23068 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
23069 if (TREE_CODE (expression
) == COMPONENT_REF
23070 || TREE_CODE (expression
) == OFFSET_REF
)
23072 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
23074 expression
= TREE_OPERAND (expression
, 1);
23075 if (identifier_p (expression
))
23078 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
23079 if (TREE_CODE (expression
) == SCOPE_REF
)
23082 if (BASELINK_P (expression
))
23084 if (BASELINK_OPTYPE (expression
)
23085 && dependent_type_p (BASELINK_OPTYPE (expression
)))
23087 expression
= BASELINK_FUNCTIONS (expression
);
23090 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
23092 if (any_dependent_template_arguments_p
23093 (TREE_OPERAND (expression
, 1)))
23095 expression
= TREE_OPERAND (expression
, 0);
23096 if (identifier_p (expression
))
23100 gcc_assert (TREE_CODE (expression
) == OVERLOAD
23101 || TREE_CODE (expression
) == FUNCTION_DECL
);
23105 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
23107 expression
= OVL_NEXT (expression
);
23112 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
23114 return (dependent_type_p (TREE_TYPE (expression
)));
23117 /* [temp.dep.expr]/5: A class member access expression (5.2.5) is
23118 type-dependent if the expression refers to a member of the current
23119 instantiation and the type of the referenced member is dependent, or the
23120 class member access expression refers to a member of an unknown
23123 This function returns true if the OBJECT in such a class member access
23124 expression is of an unknown specialization. */
23127 type_dependent_object_expression_p (tree object
)
23129 tree scope
= TREE_TYPE (object
);
23130 return (!scope
|| dependent_scope_p (scope
));
23133 /* walk_tree callback function for instantiation_dependent_expression_p,
23134 below. Returns non-zero if a dependent subexpression is found. */
23137 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
23142 /* We don't have to worry about decltype currently because decltype
23143 of an instantiation-dependent expr is a dependent type. This
23144 might change depending on the resolution of DR 1172. */
23145 *walk_subtrees
= false;
23148 enum tree_code code
= TREE_CODE (*tp
);
23151 /* Don't treat an argument list as dependent just because it has no
23157 case TEMPLATE_PARM_INDEX
:
23160 /* Handle expressions with type operands. */
23164 case AT_ENCODE_EXPR
:
23166 tree op
= TREE_OPERAND (*tp
, 0);
23167 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
23168 op
= TREE_TYPE (op
);
23171 if (dependent_type_p (op
))
23175 *walk_subtrees
= false;
23182 case COMPONENT_REF
:
23183 if (identifier_p (TREE_OPERAND (*tp
, 1)))
23184 /* In a template, finish_class_member_access_expr creates a
23185 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
23186 type-dependent, so that we can check access control at
23187 instantiation time (PR 42277). See also Core issue 1273. */
23192 if (instantiation_dependent_scope_ref_p (*tp
))
23197 /* Treat statement-expressions as dependent. */
23201 /* Treat requires-expressions as dependent. */
23202 case REQUIRES_EXPR
:
23206 /* Treat calls to function concepts as dependent. */
23207 if (function_concept_check_p (*tp
))
23211 case TEMPLATE_ID_EXPR
:
23212 /* And variable concepts. */
23213 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
23221 if (type_dependent_expression_p (*tp
))
23227 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
23228 sense defined by the ABI:
23230 "An expression is instantiation-dependent if it is type-dependent
23231 or value-dependent, or it has a subexpression that is type-dependent
23232 or value-dependent."
23234 Except don't actually check value-dependence for unevaluated expressions,
23235 because in sizeof(i) we don't care about the value of i. Checking
23236 type-dependence will in turn check value-dependence of array bounds/template
23237 arguments as needed. */
23240 instantiation_dependent_uneval_expression_p (tree expression
)
23244 if (!processing_template_decl
)
23247 if (expression
== error_mark_node
)
23250 result
= cp_walk_tree_without_duplicates (&expression
,
23251 instantiation_dependent_r
, NULL
);
23252 return result
!= NULL_TREE
;
23255 /* As above, but also check value-dependence of the expression as a whole. */
23258 instantiation_dependent_expression_p (tree expression
)
23260 return (instantiation_dependent_uneval_expression_p (expression
)
23261 || value_dependent_expression_p (expression
));
23264 /* Like type_dependent_expression_p, but it also works while not processing
23265 a template definition, i.e. during substitution or mangling. */
23268 type_dependent_expression_p_push (tree expr
)
23271 ++processing_template_decl
;
23272 b
= type_dependent_expression_p (expr
);
23273 --processing_template_decl
;
23277 /* Returns TRUE if ARGS contains a type-dependent expression. */
23280 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
23285 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
23287 if (type_dependent_expression_p (arg
))
23293 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23294 expressions) contains any type-dependent expressions. */
23297 any_type_dependent_elements_p (const_tree list
)
23299 for (; list
; list
= TREE_CHAIN (list
))
23300 if (type_dependent_expression_p (TREE_VALUE (list
)))
23306 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23307 expressions) contains any value-dependent expressions. */
23310 any_value_dependent_elements_p (const_tree list
)
23312 for (; list
; list
= TREE_CHAIN (list
))
23313 if (value_dependent_expression_p (TREE_VALUE (list
)))
23319 /* Returns TRUE if the ARG (a template argument) is dependent. */
23322 dependent_template_arg_p (tree arg
)
23324 if (!processing_template_decl
)
23327 /* Assume a template argument that was wrongly written by the user
23328 is dependent. This is consistent with what
23329 any_dependent_template_arguments_p [that calls this function]
23331 if (!arg
|| arg
== error_mark_node
)
23334 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
23335 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
23337 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
23339 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
23341 if (DECL_TEMPLATE_PARM_P (arg
))
23343 /* A member template of a dependent class is not necessarily
23344 type-dependent, but it is a dependent template argument because it
23345 will be a member of an unknown specialization to that template. */
23346 tree scope
= CP_DECL_CONTEXT (arg
);
23347 return TYPE_P (scope
) && dependent_type_p (scope
);
23349 else if (ARGUMENT_PACK_P (arg
))
23351 tree args
= ARGUMENT_PACK_ARGS (arg
);
23352 int i
, len
= TREE_VEC_LENGTH (args
);
23353 for (i
= 0; i
< len
; ++i
)
23355 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
23361 else if (TYPE_P (arg
))
23362 return dependent_type_p (arg
);
23364 return (type_dependent_expression_p (arg
)
23365 || value_dependent_expression_p (arg
));
23368 /* Returns true if ARGS (a collection of template arguments) contains
23369 any types that require structural equality testing. */
23372 any_template_arguments_need_structural_equality_p (tree args
)
23379 if (args
== error_mark_node
)
23382 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23384 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23385 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23387 tree arg
= TREE_VEC_ELT (level
, j
);
23388 tree packed_args
= NULL_TREE
;
23391 if (ARGUMENT_PACK_P (arg
))
23393 /* Look inside the argument pack. */
23394 packed_args
= ARGUMENT_PACK_ARGS (arg
);
23395 len
= TREE_VEC_LENGTH (packed_args
);
23398 for (k
= 0; k
< len
; ++k
)
23401 arg
= TREE_VEC_ELT (packed_args
, k
);
23403 if (error_operand_p (arg
))
23405 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
23407 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
23409 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
23410 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
23419 /* Returns true if ARGS (a collection of template arguments) contains
23420 any dependent arguments. */
23423 any_dependent_template_arguments_p (const_tree args
)
23430 if (args
== error_mark_node
)
23433 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23435 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23436 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23437 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23444 /* Returns TRUE if the template TMPL is type-dependent. */
23447 dependent_template_p (tree tmpl
)
23449 if (TREE_CODE (tmpl
) == OVERLOAD
)
23453 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23455 tmpl
= OVL_NEXT (tmpl
);
23460 /* Template template parameters are dependent. */
23461 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23462 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23464 /* So are names that have not been looked up. */
23465 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23470 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23473 dependent_template_id_p (tree tmpl
, tree args
)
23475 return (dependent_template_p (tmpl
)
23476 || any_dependent_template_arguments_p (args
));
23479 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23483 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23487 if (!processing_template_decl
)
23490 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23492 tree decl
= TREE_VEC_ELT (declv
, i
);
23493 tree init
= TREE_VEC_ELT (initv
, i
);
23494 tree cond
= TREE_VEC_ELT (condv
, i
);
23495 tree incr
= TREE_VEC_ELT (incrv
, i
);
23497 if (type_dependent_expression_p (decl
)
23498 || TREE_CODE (decl
) == SCOPE_REF
)
23501 if (init
&& type_dependent_expression_p (init
))
23504 if (type_dependent_expression_p (cond
))
23507 if (COMPARISON_CLASS_P (cond
)
23508 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23509 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23512 if (TREE_CODE (incr
) == MODOP_EXPR
)
23514 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23515 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23518 else if (type_dependent_expression_p (incr
))
23520 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23522 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23524 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23526 tree t
= TREE_OPERAND (incr
, 1);
23527 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23528 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23537 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23538 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23539 no such TYPE can be found. Note that this function peers inside
23540 uninstantiated templates and therefore should be used only in
23541 extremely limited situations. ONLY_CURRENT_P restricts this
23542 peering to the currently open classes hierarchy (which is required
23543 when comparing types). */
23546 resolve_typename_type (tree type
, bool only_current_p
)
23555 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23557 scope
= TYPE_CONTEXT (type
);
23558 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23559 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23560 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23561 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23562 identifier of the TYPENAME_TYPE anymore.
23563 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23564 TYPENAME_TYPE instead, we avoid messing up with a possible
23565 typedef variant case. */
23566 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23568 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23569 it first before we can figure out what NAME refers to. */
23570 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23572 if (TYPENAME_IS_RESOLVING_P (scope
))
23573 /* Given a class template A with a dependent base with nested type C,
23574 typedef typename A::C::C C will land us here, as trying to resolve
23575 the initial A::C leads to the local C typedef, which leads back to
23576 A::C::C. So we break the recursion now. */
23579 scope
= resolve_typename_type (scope
, only_current_p
);
23581 /* If we don't know what SCOPE refers to, then we cannot resolve the
23583 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23585 /* If the SCOPE is a template type parameter, we have no way of
23586 resolving the name. */
23587 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23589 /* If the SCOPE is not the current instantiation, there's no reason
23590 to look inside it. */
23591 if (only_current_p
&& !currently_open_class (scope
))
23593 /* If this is a typedef, we don't want to look inside (c++/11987). */
23594 if (typedef_variant_p (type
))
23596 /* If SCOPE isn't the template itself, it will not have a valid
23597 TYPE_FIELDS list. */
23598 if (CLASS_TYPE_P (scope
)
23599 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23600 /* scope is either the template itself or a compatible instantiation
23601 like X<T>, so look up the name in the original template. */
23602 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23604 /* scope is a partial instantiation, so we can't do the lookup or we
23605 will lose the template arguments. */
23607 /* Enter the SCOPE so that name lookup will be resolved as if we
23608 were in the class definition. In particular, SCOPE will no
23609 longer be considered a dependent type. */
23610 pushed_scope
= push_scope (scope
);
23611 /* Look up the declaration. */
23612 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23613 tf_warning_or_error
);
23615 result
= NULL_TREE
;
23617 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23618 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23621 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23622 && TREE_CODE (decl
) == TYPE_DECL
)
23624 result
= TREE_TYPE (decl
);
23625 if (result
== error_mark_node
)
23626 result
= NULL_TREE
;
23628 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23629 && DECL_CLASS_TEMPLATE_P (decl
))
23633 /* Obtain the template and the arguments. */
23634 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23635 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23636 /* Instantiate the template. */
23637 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23638 /*entering_scope=*/0,
23639 tf_error
| tf_user
);
23640 if (result
== error_mark_node
)
23641 result
= NULL_TREE
;
23644 /* Leave the SCOPE. */
23646 pop_scope (pushed_scope
);
23648 /* If we failed to resolve it, return the original typename. */
23652 /* If lookup found a typename type, resolve that too. */
23653 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23655 /* Ill-formed programs can cause infinite recursion here, so we
23656 must catch that. */
23657 TYPENAME_IS_RESOLVING_P (result
) = 1;
23658 result
= resolve_typename_type (result
, only_current_p
);
23659 TYPENAME_IS_RESOLVING_P (result
) = 0;
23662 /* Qualify the resulting type. */
23663 quals
= cp_type_quals (type
);
23665 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23670 /* EXPR is an expression which is not type-dependent. Return a proxy
23671 for EXPR that can be used to compute the types of larger
23672 expressions containing EXPR. */
23675 build_non_dependent_expr (tree expr
)
23679 /* When checking, try to get a constant value for all non-dependent
23680 expressions in order to expose bugs in *_dependent_expression_p
23681 and constexpr. This can affect code generation, see PR70704, so
23682 only do this for -fchecking=2. */
23683 if (flag_checking
> 1
23684 && cxx_dialect
>= cxx11
23685 /* Don't do this during nsdmi parsing as it can lead to
23686 unexpected recursive instantiations. */
23687 && !parsing_nsdmi ())
23688 fold_non_dependent_expr (expr
);
23690 /* Preserve OVERLOADs; the functions must be available to resolve
23693 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23694 inner_expr
= stmt_expr_value_expr (inner_expr
);
23695 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23696 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23697 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23698 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23699 if (is_overloaded_fn (inner_expr
)
23700 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23702 /* There is no need to return a proxy for a variable. */
23705 /* Preserve string constants; conversions from string constants to
23706 "char *" are allowed, even though normally a "const char *"
23707 cannot be used to initialize a "char *". */
23708 if (TREE_CODE (expr
) == STRING_CST
)
23710 /* Preserve void and arithmetic constants, as an optimization -- there is no
23711 reason to create a new node. */
23712 if (TREE_CODE (expr
) == VOID_CST
23713 || TREE_CODE (expr
) == INTEGER_CST
23714 || TREE_CODE (expr
) == REAL_CST
)
23716 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23717 There is at least one place where we want to know that a
23718 particular expression is a throw-expression: when checking a ?:
23719 expression, there are special rules if the second or third
23720 argument is a throw-expression. */
23721 if (TREE_CODE (expr
) == THROW_EXPR
)
23724 /* Don't wrap an initializer list, we need to be able to look inside. */
23725 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23728 /* Don't wrap a dummy object, we need to be able to test for it. */
23729 if (is_dummy_object (expr
))
23732 if (TREE_CODE (expr
) == COND_EXPR
)
23733 return build3 (COND_EXPR
,
23735 TREE_OPERAND (expr
, 0),
23736 (TREE_OPERAND (expr
, 1)
23737 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23738 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23739 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23740 if (TREE_CODE (expr
) == COMPOUND_EXPR
23741 && !COMPOUND_EXPR_OVERLOADED (expr
))
23742 return build2 (COMPOUND_EXPR
,
23744 TREE_OPERAND (expr
, 0),
23745 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23747 /* If the type is unknown, it can't really be non-dependent */
23748 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23750 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23751 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23754 /* ARGS is a vector of expressions as arguments to a function call.
23755 Replace the arguments with equivalent non-dependent expressions.
23756 This modifies ARGS in place. */
23759 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23764 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23766 tree newarg
= build_non_dependent_expr (arg
);
23768 (*args
)[ix
] = newarg
;
23772 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23773 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23774 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
23777 make_auto_1 (tree name
, bool set_canonical
)
23779 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23780 TYPE_NAME (au
) = build_decl (input_location
,
23781 TYPE_DECL
, name
, au
);
23782 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23783 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23784 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23785 TYPE_NAME (au
), NULL_TREE
);
23787 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23788 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23789 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23795 make_decltype_auto (void)
23797 return make_auto_1 (get_identifier ("decltype(auto)"), true);
23803 return make_auto_1 (get_identifier ("auto"), true);
23806 /* Make a "constrained auto" type-specifier. This is an
23807 auto type with constraints that must be associated after
23808 deduction. The constraint is formed from the given
23809 CONC and its optional sequence of arguments, which are
23810 non-null if written as partial-concept-id. */
23813 make_constrained_auto (tree con
, tree args
)
23815 tree type
= make_auto_1 (get_identifier ("auto"), false);
23817 /* Build the constraint. */
23818 tree tmpl
= DECL_TI_TEMPLATE (con
);
23821 expr
= build_concept_check (tmpl
, type
, args
);
23823 expr
= build_concept_check (build_overload (tmpl
, NULL_TREE
), type
, args
);
23825 tree constr
= make_predicate_constraint (expr
);
23826 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
23828 /* Our canonical type depends on the constraint. */
23829 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
23831 /* Attach the constraint to the type declaration. */
23832 tree decl
= TYPE_NAME (type
);
23836 /* Given type ARG, return std::initializer_list<ARG>. */
23841 tree std_init_list
= namespace_binding
23842 (get_identifier ("initializer_list"), std_node
);
23844 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23846 error ("deducing from brace-enclosed initializer list requires "
23847 "#include <initializer_list>");
23848 return error_mark_node
;
23850 argvec
= make_tree_vec (1);
23851 TREE_VEC_ELT (argvec
, 0) = arg
;
23852 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23853 NULL_TREE
, 0, tf_warning_or_error
);
23856 /* Replace auto in TYPE with std::initializer_list<auto>. */
23859 listify_autos (tree type
, tree auto_node
)
23861 tree init_auto
= listify (auto_node
);
23862 tree argvec
= make_tree_vec (1);
23863 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23864 if (processing_template_decl
)
23865 argvec
= add_to_template_args (current_template_args (), argvec
);
23866 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23869 /* Hash traits for hashing possibly constrained 'auto'
23870 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
23872 struct auto_hash
: default_hash_traits
<tree
>
23874 static inline hashval_t
hash (tree
);
23875 static inline bool equal (tree
, tree
);
23878 /* Hash the 'auto' T. */
23881 auto_hash::hash (tree t
)
23883 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
23884 /* Matching constrained-type-specifiers denote the same template
23885 parameter, so hash the constraint. */
23886 return hash_placeholder_constraint (c
);
23888 /* But unconstrained autos are all separate, so just hash the pointer. */
23889 return iterative_hash_object (t
, 0);
23892 /* Compare two 'auto's. */
23895 auto_hash::equal (tree t1
, tree t2
)
23900 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
23901 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
23903 /* Two unconstrained autos are distinct. */
23907 return equivalent_placeholder_constraints (c1
, c2
);
23910 /* for_each_template_parm callback for extract_autos: if t is a (possibly
23911 constrained) auto, add it to the vector. */
23914 extract_autos_r (tree t
, void *data
)
23916 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
23917 if (is_auto_or_concept (t
))
23919 /* All the autos were built with index 0; fix that up now. */
23920 tree
*p
= hash
.find_slot (t
, INSERT
);
23923 /* If this is a repeated constrained-type-specifier, use the index we
23925 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
23928 /* Otherwise this is new, so use the current count. */
23930 idx
= hash
.elements () - 1;
23932 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
23935 /* Always keep walking. */
23939 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
23940 says they can appear anywhere in the type. */
23943 extract_autos (tree type
)
23945 hash_set
<tree
> visited
;
23946 hash_table
<auto_hash
> hash (2);
23948 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
23950 tree tree_vec
= make_tree_vec (hash
.elements());
23951 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
23952 iter
!= hash
.end(); ++iter
)
23955 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
23956 TREE_VEC_ELT (tree_vec
, i
)
23957 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
23963 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23964 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23967 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23969 return do_auto_deduction (type
, init
, auto_node
,
23970 tf_warning_or_error
,
23974 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23975 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23976 The CONTEXT determines the context in which auto deduction is performed
23977 and is used to control error diagnostics. */
23980 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23981 tsubst_flags_t complain
, auto_deduction_context context
)
23985 if (init
== error_mark_node
)
23986 return error_mark_node
;
23988 if (type_dependent_expression_p (init
))
23989 /* Defining a subset of type-dependent expressions that we can deduce
23990 from ahead of time isn't worth the trouble. */
23993 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23994 with either a new invented type template parameter U or, if the
23995 initializer is a braced-init-list (8.5.4), with
23996 std::initializer_list<U>. */
23997 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23999 if (!DIRECT_LIST_INIT_P (init
))
24000 type
= listify_autos (type
, auto_node
);
24001 else if (CONSTRUCTOR_NELTS (init
) == 1)
24002 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
24005 if (complain
& tf_warning_or_error
)
24007 if (permerror (input_location
, "direct-list-initialization of "
24008 "%<auto%> requires exactly one element"))
24009 inform (input_location
,
24010 "for deduction to %<std::initializer_list%>, use copy-"
24011 "list-initialization (i.e. add %<=%> before the %<{%>)");
24013 type
= listify_autos (type
, auto_node
);
24017 if (type
== error_mark_node
)
24018 return error_mark_node
;
24020 init
= resolve_nondeduced_context (init
, complain
);
24022 if (AUTO_IS_DECLTYPE (auto_node
))
24024 bool id
= (DECL_P (init
)
24025 || ((TREE_CODE (init
) == COMPONENT_REF
24026 || TREE_CODE (init
) == SCOPE_REF
)
24027 && !REF_PARENTHESIZED_P (init
)));
24028 targs
= make_tree_vec (1);
24029 TREE_VEC_ELT (targs
, 0)
24030 = finish_decltype_type (init
, id
, tf_warning_or_error
);
24031 if (type
!= auto_node
)
24033 if (complain
& tf_error
)
24034 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
24035 return error_mark_node
;
24040 tree parms
= build_tree_list (NULL_TREE
, type
);
24044 tparms
= extract_autos (type
);
24047 tparms
= make_tree_vec (1);
24048 TREE_VEC_ELT (tparms
, 0)
24049 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
24052 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
24053 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
24054 DEDUCE_CALL
, LOOKUP_NORMAL
,
24055 NULL
, /*explain_p=*/false);
24058 if (processing_template_decl
)
24059 /* Try again at instantiation time. */
24061 if (type
&& type
!= error_mark_node
24062 && (complain
& tf_error
))
24063 /* If type is error_mark_node a diagnostic must have been
24064 emitted by now. Also, having a mention to '<type error>'
24065 in the diagnostic is not really useful to the user. */
24067 if (cfun
&& auto_node
== current_function_auto_return_pattern
24068 && LAMBDA_FUNCTION_P (current_function_decl
))
24069 error ("unable to deduce lambda return type from %qE", init
);
24071 error ("unable to deduce %qT from %qE", type
, init
);
24072 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
24073 DEDUCE_CALL
, LOOKUP_NORMAL
,
24074 NULL
, /*explain_p=*/true);
24076 return error_mark_node
;
24080 /* Check any placeholder constraints against the deduced type. */
24081 if (flag_concepts
&& !processing_template_decl
)
24082 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
24084 /* Use the deduced type to check the associated constraints. */
24085 if (!constraints_satisfied_p (constr
, targs
))
24087 if (complain
& tf_warning_or_error
)
24091 case adc_unspecified
:
24092 error("placeholder constraints not satisfied");
24094 case adc_variable_type
:
24095 error ("deduced initializer does not satisfy "
24096 "placeholder constraints");
24098 case adc_return_type
:
24099 error ("deduced return type does not satisfy "
24100 "placeholder constraints");
24102 case adc_requirement
:
24103 error ("deduced expression type does not saatisy "
24104 "placeholder constraints");
24107 diagnose_constraints (input_location
, constr
, targs
);
24109 return error_mark_node
;
24113 if (processing_template_decl
)
24114 targs
= add_to_template_args (current_template_args (), targs
);
24115 return tsubst (type
, targs
, complain
, NULL_TREE
);
24118 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
24122 splice_late_return_type (tree type
, tree late_return_type
)
24124 if (is_auto (type
))
24126 if (late_return_type
)
24127 return late_return_type
;
24129 tree idx
= get_template_parm_index (type
);
24130 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
24131 /* In an abbreviated function template we didn't know we were dealing
24132 with a function template when we saw the auto return type, so update
24133 it to have the correct level. */
24134 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
24139 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
24140 'decltype(auto)'. */
24143 is_auto (const_tree type
)
24145 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
24146 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
24147 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
24153 /* for_each_template_parm callback for type_uses_auto. */
24156 is_auto_r (tree tp
, void */
*data*/
)
24158 return is_auto_or_concept (tp
);
24161 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
24162 a use of `auto'. Returns NULL_TREE otherwise. */
24165 type_uses_auto (tree type
)
24167 if (type
== NULL_TREE
)
24169 else if (flag_concepts
)
24171 /* The Concepts TS allows multiple autos in one type-specifier; just
24172 return the first one we find, do_auto_deduction will collect all of
24174 if (uses_template_parms (type
))
24175 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
24176 /*visited*/NULL
, /*nondeduced*/true);
24181 return find_type_usage (type
, is_auto
);
24184 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
24185 'decltype(auto)' or a concept. */
24188 is_auto_or_concept (const_tree type
)
24190 return is_auto (type
); // or concept
24193 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
24194 a concept identifier) iff TYPE contains a use of a generic type. Returns
24195 NULL_TREE otherwise. */
24198 type_uses_auto_or_concept (tree type
)
24200 return find_type_usage (type
, is_auto_or_concept
);
24204 /* For a given template T, return the vector of typedefs referenced
24205 in T for which access check is needed at T instantiation time.
24206 T is either a FUNCTION_DECL or a RECORD_TYPE.
24207 Those typedefs were added to T by the function
24208 append_type_to_template_for_access_check. */
24210 vec
<qualified_typedef_usage_t
, va_gc
> *
24211 get_types_needing_access_check (tree t
)
24214 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
24216 if (!t
|| t
== error_mark_node
)
24219 if (!(ti
= get_template_info (t
)))
24222 if (CLASS_TYPE_P (t
)
24223 || TREE_CODE (t
) == FUNCTION_DECL
)
24225 if (!TI_TEMPLATE (ti
))
24228 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
24234 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
24235 tied to T. That list of typedefs will be access checked at
24236 T instantiation time.
24237 T is either a FUNCTION_DECL or a RECORD_TYPE.
24238 TYPE_DECL is a TYPE_DECL node representing a typedef.
24239 SCOPE is the scope through which TYPE_DECL is accessed.
24240 LOCATION is the location of the usage point of TYPE_DECL.
24242 This function is a subroutine of
24243 append_type_to_template_for_access_check. */
24246 append_type_to_template_for_access_check_1 (tree t
,
24249 location_t location
)
24251 qualified_typedef_usage_t typedef_usage
;
24254 if (!t
|| t
== error_mark_node
)
24257 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
24258 || CLASS_TYPE_P (t
))
24260 && TREE_CODE (type_decl
) == TYPE_DECL
24263 if (!(ti
= get_template_info (t
)))
24266 gcc_assert (TI_TEMPLATE (ti
));
24268 typedef_usage
.typedef_decl
= type_decl
;
24269 typedef_usage
.context
= scope
;
24270 typedef_usage
.locus
= location
;
24272 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
24275 /* Append TYPE_DECL to the template TEMPL.
24276 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
24277 At TEMPL instanciation time, TYPE_DECL will be checked to see
24278 if it can be accessed through SCOPE.
24279 LOCATION is the location of the usage point of TYPE_DECL.
24281 e.g. consider the following code snippet:
24288 template<class U> struct S
24290 C::myint mi; // <-- usage point of the typedef C::myint
24295 At S<char> instantiation time, we need to check the access of C::myint
24296 In other words, we need to check the access of the myint typedef through
24297 the C scope. For that purpose, this function will add the myint typedef
24298 and the scope C through which its being accessed to a list of typedefs
24299 tied to the template S. That list will be walked at template instantiation
24300 time and access check performed on each typedefs it contains.
24301 Note that this particular code snippet should yield an error because
24302 myint is private to C. */
24305 append_type_to_template_for_access_check (tree templ
,
24308 location_t location
)
24310 qualified_typedef_usage_t
*iter
;
24313 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
24315 /* Make sure we don't append the type to the template twice. */
24316 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
24317 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
24320 append_type_to_template_for_access_check_1 (templ
, type_decl
,
24324 /* Convert the generic type parameters in PARM that match the types given in the
24325 range [START_IDX, END_IDX) from the current_template_parms into generic type
24329 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
24331 tree current
= current_template_parms
;
24332 int depth
= TMPL_PARMS_DEPTH (current
);
24333 current
= INNERMOST_TEMPLATE_PARMS (current
);
24334 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
24336 for (int i
= 0; i
< start_idx
; ++i
)
24337 TREE_VEC_ELT (replacement
, i
)
24338 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24340 for (int i
= start_idx
; i
< end_idx
; ++i
)
24342 /* Create a distinct parameter pack type from the current parm and add it
24343 to the replacement args to tsubst below into the generic function
24346 tree o
= TREE_TYPE (TREE_VALUE
24347 (TREE_VEC_ELT (current
, i
)));
24348 tree t
= copy_type (o
);
24349 TEMPLATE_TYPE_PARM_INDEX (t
)
24350 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
24352 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
24353 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
24354 TYPE_MAIN_VARIANT (t
) = t
;
24355 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
24356 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
24357 TREE_VEC_ELT (replacement
, i
) = t
;
24358 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
24361 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
24362 TREE_VEC_ELT (replacement
, i
)
24363 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24365 /* If there are more levels then build up the replacement with the outer
24368 replacement
= add_to_template_args (template_parms_to_args
24369 (TREE_CHAIN (current_template_parms
)),
24372 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
24375 /* Entries in the decl_constraint hash table. */
24376 struct GTY((for_user
)) constr_entry
24382 /* Hashing function and equality for constraint entries. */
24383 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
24385 static hashval_t
hash (constr_entry
*e
)
24387 return (hashval_t
)DECL_UID (e
->decl
);
24390 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
24392 return e1
->decl
== e2
->decl
;
24396 /* A mapping from declarations to constraint information. Note that
24397 both templates and their underlying declarations are mapped to the
24398 same constraint information.
24400 FIXME: This is defined in pt.c because garbage collection
24401 code is not being generated for constraint.cc. */
24403 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
24405 /* Returns true iff cinfo contains a valid set of constraints.
24406 This is the case when the associated requirements have been
24407 successfully decomposed into lists of atomic constraints.
24408 That is, when the saved assumptions are not error_mark_node. */
24411 valid_constraints_p (tree cinfo
)
24413 gcc_assert (cinfo
);
24414 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
24417 /* Returns the template constraints of declaration T. If T is not
24418 constrained, return NULL_TREE. Note that T must be non-null. */
24421 get_constraints (tree t
)
24423 gcc_assert (DECL_P (t
));
24424 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24425 t
= DECL_TEMPLATE_RESULT (t
);
24426 constr_entry elt
= { t
, NULL_TREE
};
24427 constr_entry
* found
= decl_constraints
->find (&elt
);
24434 /* Associate the given constraint information CI with the declaration
24435 T. If T is a template, then the constraints are associated with
24436 its underlying declaration. Don't build associations if CI is
24440 set_constraints (tree t
, tree ci
)
24445 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24446 t
= DECL_TEMPLATE_RESULT (t
);
24447 gcc_assert (!get_constraints (t
));
24448 constr_entry elt
= {t
, ci
};
24449 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
24450 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
24455 /* Remove the associated constraints of the declaration T. */
24458 remove_constraints (tree t
)
24460 gcc_assert (DECL_P (t
));
24461 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24462 t
= DECL_TEMPLATE_RESULT (t
);
24464 constr_entry elt
= {t
, NULL_TREE
};
24465 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
24467 decl_constraints
->clear_slot (slot
);
24470 /* Set up the hash table for constraint association. */
24473 init_constraint_processing (void)
24475 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
24478 /* Set up the hash tables for template instantiations. */
24481 init_template_processing (void)
24483 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24484 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24487 /* Print stats about the template hash tables for -fstats. */
24490 print_template_statistics (void)
24492 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
24493 "%f collisions\n", (long) decl_specializations
->size (),
24494 (long) decl_specializations
->elements (),
24495 decl_specializations
->collisions ());
24496 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
24497 "%f collisions\n", (long) type_specializations
->size (),
24498 (long) type_specializations
->elements (),
24499 type_specializations
->collisions ());
24502 #include "gt-cp-pt.h"