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
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
182 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
183 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
184 static void regenerate_decl_from_template (tree
, tree
);
185 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
186 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
187 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
188 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
189 static bool check_specialization_scope (void);
190 static tree
process_partial_specialization (tree
);
191 static void set_current_access_from_decl (tree
);
192 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
194 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
195 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
197 static bool template_template_parm_bindings_ok_p (tree
, tree
);
198 static int template_args_equal (tree
, tree
);
199 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
200 static tree
for_each_template_parm_r (tree
*, int *, void *);
201 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
202 static void copy_default_args_to_explicit_spec (tree
);
203 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
204 static bool dependent_template_arg_p (tree
);
205 static bool any_template_arguments_need_structural_equality_p (tree
);
206 static bool dependent_type_p_r (tree
);
207 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
208 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
209 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
210 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
212 static tree
listify (tree
);
213 static tree
listify_autos (tree
, tree
);
214 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
215 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
216 static bool complex_alias_template_p (const_tree tmpl
);
217 static tree
tsubst_attributes (tree
, tree
, tsubst_flags_t
, tree
);
219 /* Make the current scope suitable for access checking when we are
220 processing T. T can be FUNCTION_DECL for instantiated function
221 template, VAR_DECL for static member variable, or TYPE_DECL for
222 alias template (needed by instantiate_decl). */
225 push_access_scope (tree t
)
227 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
228 || TREE_CODE (t
) == TYPE_DECL
);
230 if (DECL_FRIEND_CONTEXT (t
))
231 push_nested_class (DECL_FRIEND_CONTEXT (t
));
232 else if (DECL_CLASS_SCOPE_P (t
))
233 push_nested_class (DECL_CONTEXT (t
));
235 push_to_top_level ();
237 if (TREE_CODE (t
) == FUNCTION_DECL
)
239 saved_access_scope
= tree_cons
240 (NULL_TREE
, current_function_decl
, saved_access_scope
);
241 current_function_decl
= t
;
245 /* Restore the scope set up by push_access_scope. T is the node we
249 pop_access_scope (tree t
)
251 if (TREE_CODE (t
) == FUNCTION_DECL
)
253 current_function_decl
= TREE_VALUE (saved_access_scope
);
254 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
257 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
260 pop_from_top_level ();
263 /* Do any processing required when DECL (a member template
264 declaration) is finished. Returns the TEMPLATE_DECL corresponding
265 to DECL, unless it is a specialization, in which case the DECL
266 itself is returned. */
269 finish_member_template_decl (tree decl
)
271 if (decl
== error_mark_node
)
272 return error_mark_node
;
274 gcc_assert (DECL_P (decl
));
276 if (TREE_CODE (decl
) == TYPE_DECL
)
280 type
= TREE_TYPE (decl
);
281 if (type
== error_mark_node
)
282 return error_mark_node
;
283 if (MAYBE_CLASS_TYPE_P (type
)
284 && CLASSTYPE_TEMPLATE_INFO (type
)
285 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
287 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
288 check_member_template (tmpl
);
293 else if (TREE_CODE (decl
) == FIELD_DECL
)
294 error ("data member %qD cannot be a member template", decl
);
295 else if (DECL_TEMPLATE_INFO (decl
))
297 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
299 check_member_template (DECL_TI_TEMPLATE (decl
));
300 return DECL_TI_TEMPLATE (decl
);
306 error ("invalid member template declaration %qD", decl
);
308 return error_mark_node
;
311 /* Create a template info node. */
314 build_template_info (tree template_decl
, tree template_args
)
316 tree result
= make_node (TEMPLATE_INFO
);
317 TI_TEMPLATE (result
) = template_decl
;
318 TI_ARGS (result
) = template_args
;
322 /* Return the template info node corresponding to T, whatever T is. */
325 get_template_info (const_tree t
)
327 tree tinfo
= NULL_TREE
;
329 if (!t
|| t
== error_mark_node
)
332 if (TREE_CODE (t
) == NAMESPACE_DECL
)
335 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
336 tinfo
= DECL_TEMPLATE_INFO (t
);
338 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
341 if (OVERLOAD_TYPE_P (t
))
342 tinfo
= TYPE_TEMPLATE_INFO (t
);
343 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
344 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
349 /* Returns the template nesting level of the indicated class TYPE.
359 A<T>::B<U> has depth two, while A<T> has depth one.
360 Both A<T>::B<int> and A<int>::B<U> have depth one, if
361 they are instantiations, not specializations.
363 This function is guaranteed to return 0 if passed NULL_TREE so
364 that, for example, `template_class_depth (current_class_type)' is
368 template_class_depth (tree type
)
373 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
374 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
375 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
377 tree tinfo
= get_template_info (type
);
379 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
380 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
387 /* Subroutine of maybe_begin_member_template_processing.
388 Returns true if processing DECL needs us to push template parms. */
391 inline_needs_template_parms (tree decl
, bool nsdmi
)
393 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
396 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
397 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
400 /* Subroutine of maybe_begin_member_template_processing.
401 Push the template parms in PARMS, starting from LEVELS steps into the
402 chain, and ending at the beginning, since template parms are listed
406 push_inline_template_parms_recursive (tree parmlist
, int levels
)
408 tree parms
= TREE_VALUE (parmlist
);
412 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
414 ++processing_template_decl
;
415 current_template_parms
416 = tree_cons (size_int (processing_template_decl
),
417 parms
, current_template_parms
);
418 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
420 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
422 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
424 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
426 if (error_operand_p (parm
))
429 gcc_assert (DECL_P (parm
));
431 switch (TREE_CODE (parm
))
439 /* Push the CONST_DECL. */
440 pushdecl (TEMPLATE_PARM_DECL (DECL_INITIAL (parm
)));
449 /* Restore the template parameter context for a member template, a
450 friend template defined in a class definition, or a non-template
451 member of template class. */
454 maybe_begin_member_template_processing (tree decl
)
458 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
462 tree ctx
= DECL_CONTEXT (decl
);
463 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
464 /* Disregard full specializations (c++/60999). */
465 && uses_template_parms (ctx
)
466 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
469 if (inline_needs_template_parms (decl
, nsdmi
))
471 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
472 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
474 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
477 parms
= TREE_CHAIN (parms
);
480 push_inline_template_parms_recursive (parms
, levels
);
483 /* Remember how many levels of template parameters we pushed so that
484 we can pop them later. */
485 inline_parm_levels
.safe_push (levels
);
488 /* Undo the effects of maybe_begin_member_template_processing. */
491 maybe_end_member_template_processing (void)
496 if (inline_parm_levels
.length () == 0)
499 last
= inline_parm_levels
.pop ();
500 for (i
= 0; i
< last
; ++i
)
502 --processing_template_decl
;
503 current_template_parms
= TREE_CHAIN (current_template_parms
);
508 /* Return a new template argument vector which contains all of ARGS,
509 but has as its innermost set of arguments the EXTRA_ARGS. */
512 add_to_template_args (tree args
, tree extra_args
)
519 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
522 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
523 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
525 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
526 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
528 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
529 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
534 /* Like add_to_template_args, but only the outermost ARGS are added to
535 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
536 (EXTRA_ARGS) levels are added. This function is used to combine
537 the template arguments from a partial instantiation with the
538 template arguments used to attain the full instantiation from the
539 partial instantiation. */
542 add_outermost_template_args (tree args
, tree extra_args
)
546 /* If there are more levels of EXTRA_ARGS than there are ARGS,
547 something very fishy is going on. */
548 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
550 /* If *all* the new arguments will be the EXTRA_ARGS, just return
552 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
555 /* For the moment, we make ARGS look like it contains fewer levels. */
556 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
558 new_args
= add_to_template_args (args
, extra_args
);
560 /* Now, we restore ARGS to its full dimensions. */
561 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
566 /* Return the N levels of innermost template arguments from the ARGS. */
569 get_innermost_template_args (tree args
, int n
)
577 /* If N is 1, just return the innermost set of template arguments. */
579 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
581 /* If we're not removing anything, just return the arguments we were
583 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
584 gcc_assert (extra_levels
>= 0);
585 if (extra_levels
== 0)
588 /* Make a new set of arguments, not containing the outer arguments. */
589 new_args
= make_tree_vec (n
);
590 for (i
= 1; i
<= n
; ++i
)
591 SET_TMPL_ARGS_LEVEL (new_args
, i
,
592 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
597 /* The inverse of get_innermost_template_args: Return all but the innermost
598 EXTRA_LEVELS levels of template arguments from the ARGS. */
601 strip_innermost_template_args (tree args
, int extra_levels
)
604 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
609 /* If N is 1, just return the outermost set of template arguments. */
611 return TMPL_ARGS_LEVEL (args
, 1);
613 /* If we're not removing anything, just return the arguments we were
615 gcc_assert (extra_levels
>= 0);
616 if (extra_levels
== 0)
619 /* Make a new set of arguments, not containing the inner arguments. */
620 new_args
= make_tree_vec (n
);
621 for (i
= 1; i
<= n
; ++i
)
622 SET_TMPL_ARGS_LEVEL (new_args
, i
,
623 TMPL_ARGS_LEVEL (args
, i
));
628 /* We've got a template header coming up; push to a new level for storing
632 begin_template_parm_list (void)
634 /* We use a non-tag-transparent scope here, which causes pushtag to
635 put tags in this scope, rather than in the enclosing class or
636 namespace scope. This is the right thing, since we want
637 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
638 global template class, push_template_decl handles putting the
639 TEMPLATE_DECL into top-level scope. For a nested template class,
642 template <class T> struct S1 {
643 template <class T> struct S2 {};
646 pushtag contains special code to call pushdecl_with_scope on the
647 TEMPLATE_DECL for S2. */
648 begin_scope (sk_template_parms
, NULL
);
649 ++processing_template_decl
;
650 ++processing_template_parmlist
;
651 note_template_header (0);
653 /* Add a dummy parameter level while we process the parameter list. */
654 current_template_parms
655 = tree_cons (size_int (processing_template_decl
),
657 current_template_parms
);
660 /* This routine is called when a specialization is declared. If it is
661 invalid to declare a specialization here, an error is reported and
662 false is returned, otherwise this routine will return true. */
665 check_specialization_scope (void)
667 tree scope
= current_scope ();
671 An explicit specialization shall be declared in the namespace of
672 which the template is a member, or, for member templates, in the
673 namespace of which the enclosing class or enclosing class
674 template is a member. An explicit specialization of a member
675 function, member class or static data member of a class template
676 shall be declared in the namespace of which the class template
678 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
680 error ("explicit specialization in non-namespace scope %qD", scope
);
686 In an explicit specialization declaration for a member of a class
687 template or a member template that appears in namespace scope,
688 the member template and some of its enclosing class templates may
689 remain unspecialized, except that the declaration shall not
690 explicitly specialize a class member template if its enclosing
691 class templates are not explicitly specialized as well. */
692 if (current_template_parms
)
694 error ("enclosing class templates are not explicitly specialized");
701 /* We've just seen template <>. */
704 begin_specialization (void)
706 begin_scope (sk_template_spec
, NULL
);
707 note_template_header (1);
708 return check_specialization_scope ();
711 /* Called at then end of processing a declaration preceded by
715 end_specialization (void)
718 reset_specialization ();
721 /* Any template <>'s that we have seen thus far are not referring to a
722 function specialization. */
725 reset_specialization (void)
727 processing_specialization
= 0;
728 template_header_count
= 0;
731 /* We've just seen a template header. If SPECIALIZATION is nonzero,
732 it was of the form template <>. */
735 note_template_header (int specialization
)
737 processing_specialization
= specialization
;
738 template_header_count
++;
741 /* We're beginning an explicit instantiation. */
744 begin_explicit_instantiation (void)
746 gcc_assert (!processing_explicit_instantiation
);
747 processing_explicit_instantiation
= true;
752 end_explicit_instantiation (void)
754 gcc_assert (processing_explicit_instantiation
);
755 processing_explicit_instantiation
= false;
758 /* An explicit specialization or partial specialization of TMPL is being
759 declared. Check that the namespace in which the specialization is
760 occurring is permissible. Returns false iff it is invalid to
761 specialize TMPL in the current namespace. */
764 check_specialization_namespace (tree tmpl
)
766 tree tpl_ns
= decl_namespace_context (tmpl
);
770 An explicit specialization shall be declared in the namespace of
771 which the template is a member, or, for member templates, in the
772 namespace of which the enclosing class or enclosing class
773 template is a member. An explicit specialization of a member
774 function, member class or static data member of a class template
775 shall be declared in the namespace of which the class template is
777 if (current_scope() != DECL_CONTEXT (tmpl
)
778 && !at_namespace_scope_p ())
780 error ("specialization of %qD must appear at namespace scope", tmpl
);
783 if (is_associated_namespace (current_namespace
, tpl_ns
))
784 /* Same or super-using namespace. */
788 permerror (input_location
,
789 "specialization of %qD in different namespace", tmpl
);
790 permerror (DECL_SOURCE_LOCATION (tmpl
),
791 " from definition of %q#D", tmpl
);
796 /* SPEC is an explicit instantiation. Check that it is valid to
797 perform this explicit instantiation in the current namespace. */
800 check_explicit_instantiation_namespace (tree spec
)
804 /* DR 275: An explicit instantiation shall appear in an enclosing
805 namespace of its template. */
806 ns
= decl_namespace_context (spec
);
807 if (!is_ancestor (current_namespace
, ns
))
808 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
809 "(which does not enclose namespace %qD)",
810 spec
, current_namespace
, ns
);
813 // Returns the type of a template specialization only if that
814 // specialization needs to be defined. Otherwise (e.g., if the type has
815 // already been defined), the function returns NULL_TREE.
817 maybe_new_partial_specialization (tree type
)
819 // An implicit instantiation of an incomplete type implies
820 // the definition of a new class template.
822 // template<typename T>
825 // template<typename T>
828 // Here, S<T*> is an implicit instantiation of S whose type
830 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
833 // It can also be the case that TYPE is a completed specialization.
834 // Continuing the previous example, suppose we also declare:
836 // template<typename T>
837 // requires Integral<T>
840 // Here, S<T*> refers to the specialization S<T*> defined
841 // above. However, we need to differentiate definitions because
842 // we intend to define a new partial specialization. In this case,
843 // we rely on the fact that the constraints are different for
844 // this declaration than that above.
846 // Note that we also get here for injected class names and
847 // late-parsed template definitions. We must ensure that we
848 // do not create new type declarations for those cases.
849 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
851 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
852 tree args
= CLASSTYPE_TI_ARGS (type
);
854 // If there are no template parameters, this cannot be a new
855 // partial template specializtion?
856 if (!current_template_parms
)
859 // The injected-class-name is not a new partial specialization.
860 if (DECL_SELF_REFERENCE_P (TYPE_NAME (type
)))
863 // If the constraints are not the same as those of the primary
864 // then, we can probably create a new specialization.
865 tree type_constr
= current_template_constraints ();
867 if (type
== TREE_TYPE (tmpl
))
869 tree main_constr
= get_constraints (tmpl
);
870 if (equivalent_constraints (type_constr
, main_constr
))
874 // Also, if there's a pre-existing specialization with matching
875 // constraints, then this also isn't new.
876 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
879 tree spec_tmpl
= TREE_VALUE (specs
);
880 tree spec_args
= TREE_PURPOSE (specs
);
881 tree spec_constr
= get_constraints (spec_tmpl
);
882 if (comp_template_args (args
, spec_args
)
883 && equivalent_constraints (type_constr
, spec_constr
))
885 specs
= TREE_CHAIN (specs
);
888 // Create a new type node (and corresponding type decl)
889 // for the newly declared specialization.
890 tree t
= make_class_type (TREE_CODE (type
));
891 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
892 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (type
);
893 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
895 /* We only need a separate type node for storing the definition of this
896 partial specialization; uses of S<T*> are unconstrained, so all are
897 equivalent. So keep TYPE_CANONICAL the same. */
898 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
900 // Build the corresponding type decl.
901 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
902 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
903 DECL_SOURCE_LOCATION (d
) = input_location
;
911 /* The TYPE is being declared. If it is a template type, that means it
912 is a partial specialization. Do appropriate error-checking. */
915 maybe_process_partial_specialization (tree type
)
919 if (type
== error_mark_node
)
920 return error_mark_node
;
922 /* A lambda that appears in specialization context is not itself a
924 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
927 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
929 error ("name of class shadows template template parameter %qD",
931 return error_mark_node
;
934 context
= TYPE_CONTEXT (type
);
936 if (TYPE_ALIAS_P (type
))
938 if (TYPE_TEMPLATE_INFO (type
)
939 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
940 error ("specialization of alias template %qD",
941 TYPE_TI_TEMPLATE (type
));
943 error ("explicit specialization of non-template %qT", type
);
944 return error_mark_node
;
946 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
948 /* This is for ordinary explicit specialization and partial
949 specialization of a template class such as:
951 template <> class C<int>;
955 template <class T> class C<T*>;
957 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
959 if (tree t
= maybe_new_partial_specialization (type
))
961 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
962 && !at_namespace_scope_p ())
963 return error_mark_node
;
964 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
965 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
966 if (processing_template_decl
)
968 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
969 if (decl
== error_mark_node
)
970 return error_mark_node
;
971 return TREE_TYPE (decl
);
974 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
975 error ("specialization of %qT after instantiation", type
);
976 else if (errorcount
&& !processing_specialization
977 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
978 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
979 /* Trying to define a specialization either without a template<> header
980 or in an inappropriate place. We've already given an error, so just
981 bail now so we don't actually define the specialization. */
982 return error_mark_node
;
984 else if (CLASS_TYPE_P (type
)
985 && !CLASSTYPE_USE_TEMPLATE (type
)
986 && CLASSTYPE_TEMPLATE_INFO (type
)
987 && context
&& CLASS_TYPE_P (context
)
988 && CLASSTYPE_TEMPLATE_INFO (context
))
990 /* This is for an explicit specialization of member class
991 template according to [temp.expl.spec/18]:
993 template <> template <class U> class C<int>::D;
995 The context `C<int>' must be an implicit instantiation.
996 Otherwise this is just a member class template declared
999 template <> class C<int> { template <class U> class D; };
1000 template <> template <class U> class C<int>::D;
1002 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1003 while in the second case, `C<int>::D' is a primary template
1004 and `C<T>::D' may not exist. */
1006 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1007 && !COMPLETE_TYPE_P (type
))
1010 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1012 if (current_namespace
1013 != decl_namespace_context (tmpl
))
1015 permerror (input_location
,
1016 "specializing %q#T in different namespace", type
);
1017 permerror (DECL_SOURCE_LOCATION (tmpl
),
1018 " from definition of %q#D", tmpl
);
1021 /* Check for invalid specialization after instantiation:
1023 template <> template <> class C<int>::D<int>;
1024 template <> template <class U> class C<int>::D; */
1026 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1027 t
; t
= TREE_CHAIN (t
))
1029 tree inst
= TREE_VALUE (t
);
1030 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1031 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1033 /* We already have a full specialization of this partial
1034 instantiation, or a full specialization has been
1035 looked up but not instantiated. Reassign it to the
1036 new member specialization template. */
1040 elt
.tmpl
= most_general_template (tmpl
);
1041 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1044 type_specializations
->remove_elt (&elt
);
1047 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1050 = type_specializations
->find_slot (&elt
, INSERT
);
1051 entry
= ggc_alloc
<spec_entry
> ();
1056 /* But if we've had an implicit instantiation, that's a
1057 problem ([temp.expl.spec]/6). */
1058 error ("specialization %qT after instantiation %qT",
1062 /* Mark TYPE as a specialization. And as a result, we only
1063 have one level of template argument for the innermost
1065 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1066 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1067 CLASSTYPE_TI_ARGS (type
)
1068 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1071 else if (processing_specialization
)
1073 /* Someday C++0x may allow for enum template specialization. */
1074 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1075 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1076 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1077 "of %qD not allowed by ISO C++", type
);
1080 error ("explicit specialization of non-template %qT", type
);
1081 return error_mark_node
;
1088 /* Returns nonzero if we can optimize the retrieval of specializations
1089 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1090 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1093 optimize_specialization_lookup_p (tree tmpl
)
1095 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1096 && DECL_CLASS_SCOPE_P (tmpl
)
1097 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1099 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1100 /* The optimized lookup depends on the fact that the
1101 template arguments for the member function template apply
1102 purely to the containing class, which is not true if the
1103 containing class is an explicit or partial
1105 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1106 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1107 && !DECL_CONV_FN_P (tmpl
)
1108 /* It is possible to have a template that is not a member
1109 template and is not a member of a template class:
1111 template <typename T>
1112 struct S { friend A::f(); };
1114 Here, the friend function is a template, but the context does
1115 not have template information. The optimized lookup relies
1116 on having ARGS be the template arguments for both the class
1117 and the function template. */
1118 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1121 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1122 gone through coerce_template_parms by now. */
1125 verify_unstripped_args (tree args
)
1127 ++processing_template_decl
;
1128 if (!any_dependent_template_arguments_p (args
))
1130 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1131 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1133 tree arg
= TREE_VEC_ELT (inner
, i
);
1134 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1136 else if (TYPE_P (arg
))
1137 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1138 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1139 /* Allow typedefs on the type of a non-type argument, since a
1140 parameter can have them. */;
1142 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1145 --processing_template_decl
;
1148 /* Retrieve the specialization (in the sense of [temp.spec] - a
1149 specialization is either an instantiation or an explicit
1150 specialization) of TMPL for the given template ARGS. If there is
1151 no such specialization, return NULL_TREE. The ARGS are a vector of
1152 arguments, or a vector of vectors of arguments, in the case of
1153 templates with more than one level of parameters.
1155 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1156 then we search for a partial specialization matching ARGS. This
1157 parameter is ignored if TMPL is not a class template.
1159 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1160 result is a NONTYPE_ARGUMENT_PACK. */
1163 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1165 if (tmpl
== NULL_TREE
)
1168 if (args
== error_mark_node
)
1171 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1172 || TREE_CODE (tmpl
) == FIELD_DECL
);
1174 /* There should be as many levels of arguments as there are
1175 levels of parameters. */
1176 gcc_assert (TMPL_ARGS_DEPTH (args
)
1177 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1178 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1179 : template_class_depth (DECL_CONTEXT (tmpl
))));
1182 verify_unstripped_args (args
);
1184 if (optimize_specialization_lookup_p (tmpl
))
1186 tree class_template
;
1187 tree class_specialization
;
1188 vec
<tree
, va_gc
> *methods
;
1192 /* The template arguments actually apply to the containing
1193 class. Find the class specialization with those
1195 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1196 class_specialization
1197 = retrieve_specialization (class_template
, args
, 0);
1198 if (!class_specialization
)
1200 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1201 for the specialization. */
1202 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1205 /* Iterate through the methods with the indicated name, looking
1206 for the one that has an instance of TMPL. */
1207 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1208 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1210 tree fn
= OVL_CURRENT (fns
);
1211 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1212 /* using-declarations can add base methods to the method vec,
1213 and we don't want those here. */
1214 && DECL_CONTEXT (fn
) == class_specialization
)
1223 hash_table
<spec_hasher
> *specializations
;
1227 elt
.spec
= NULL_TREE
;
1229 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1230 specializations
= type_specializations
;
1232 specializations
= decl_specializations
;
1235 hash
= spec_hasher::hash (&elt
);
1236 found
= specializations
->find_with_hash (&elt
, hash
);
1244 /* Like retrieve_specialization, but for local declarations. */
1247 retrieve_local_specialization (tree tmpl
)
1249 if (local_specializations
== NULL
)
1252 tree
*slot
= local_specializations
->get (tmpl
);
1253 return slot
? *slot
: NULL_TREE
;
1256 /* Returns nonzero iff DECL is a specialization of TMPL. */
1259 is_specialization_of (tree decl
, tree tmpl
)
1263 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1267 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1273 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1275 for (t
= TREE_TYPE (decl
);
1277 t
= CLASSTYPE_USE_TEMPLATE (t
)
1278 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1279 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1286 /* Returns nonzero iff DECL is a specialization of friend declaration
1287 FRIEND_DECL according to [temp.friend]. */
1290 is_specialization_of_friend (tree decl
, tree friend_decl
)
1292 bool need_template
= true;
1295 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1296 || TREE_CODE (decl
) == TYPE_DECL
);
1298 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1299 of a template class, we want to check if DECL is a specialization
1301 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1302 && DECL_TEMPLATE_INFO (friend_decl
)
1303 && !DECL_USE_TEMPLATE (friend_decl
))
1305 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1306 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1307 need_template
= false;
1309 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1310 && !PRIMARY_TEMPLATE_P (friend_decl
))
1311 need_template
= false;
1313 /* There is nothing to do if this is not a template friend. */
1314 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1317 if (is_specialization_of (decl
, friend_decl
))
1321 A member of a class template may be declared to be a friend of a
1322 non-template class. In this case, the corresponding member of
1323 every specialization of the class template is a friend of the
1324 class granting friendship.
1326 For example, given a template friend declaration
1328 template <class T> friend void A<T>::f();
1330 the member function below is considered a friend
1332 template <> struct A<int> {
1336 For this type of template friend, TEMPLATE_DEPTH below will be
1337 nonzero. To determine if DECL is a friend of FRIEND, we first
1338 check if the enclosing class is a specialization of another. */
1340 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1342 && DECL_CLASS_SCOPE_P (decl
)
1343 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1344 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1346 /* Next, we check the members themselves. In order to handle
1347 a few tricky cases, such as when FRIEND_DECL's are
1349 template <class T> friend void A<T>::g(T t);
1350 template <class T> template <T t> friend void A<T>::h();
1354 void A<int>::g(int);
1355 template <int> void A<int>::h();
1357 we need to figure out ARGS, the template arguments from
1358 the context of DECL. This is required for template substitution
1359 of `T' in the function parameter of `g' and template parameter
1360 of `h' in the above examples. Here ARGS corresponds to `int'. */
1362 tree context
= DECL_CONTEXT (decl
);
1363 tree args
= NULL_TREE
;
1364 int current_depth
= 0;
1366 while (current_depth
< template_depth
)
1368 if (CLASSTYPE_TEMPLATE_INFO (context
))
1370 if (current_depth
== 0)
1371 args
= TYPE_TI_ARGS (context
);
1373 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1376 context
= TYPE_CONTEXT (context
);
1379 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1384 tree friend_args_type
;
1385 tree decl_args_type
;
1387 /* Make sure that both DECL and FRIEND_DECL are templates or
1389 is_template
= DECL_TEMPLATE_INFO (decl
)
1390 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1391 if (need_template
^ is_template
)
1393 else if (is_template
)
1395 /* If both are templates, check template parameter list. */
1397 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1399 if (!comp_template_parms
1400 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1404 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1407 decl_type
= TREE_TYPE (decl
);
1409 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1410 tf_none
, NULL_TREE
);
1411 if (friend_type
== error_mark_node
)
1414 /* Check if return types match. */
1415 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1418 /* Check if function parameter types match, ignoring the
1419 `this' parameter. */
1420 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1421 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1422 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1423 friend_args_type
= TREE_CHAIN (friend_args_type
);
1424 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1425 decl_args_type
= TREE_CHAIN (decl_args_type
);
1427 return compparms (decl_args_type
, friend_args_type
);
1431 /* DECL is a TYPE_DECL */
1433 tree decl_type
= TREE_TYPE (decl
);
1435 /* Make sure that both DECL and FRIEND_DECL are templates or
1438 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1439 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1441 if (need_template
^ is_template
)
1443 else if (is_template
)
1446 /* If both are templates, check the name of the two
1447 TEMPLATE_DECL's first because is_friend didn't. */
1448 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1449 != DECL_NAME (friend_decl
))
1452 /* Now check template parameter list. */
1454 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1456 return comp_template_parms
1457 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1461 return (DECL_NAME (decl
)
1462 == DECL_NAME (friend_decl
));
1468 /* Register the specialization SPEC as a specialization of TMPL with
1469 the indicated ARGS. IS_FRIEND indicates whether the specialization
1470 is actually just a friend declaration. Returns SPEC, or an
1471 equivalent prior declaration, if available.
1473 We also store instantiations of field packs in the hash table, even
1474 though they are not themselves templates, to make lookup easier. */
1477 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1481 spec_entry
**slot
= NULL
;
1484 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1485 || (TREE_CODE (tmpl
) == FIELD_DECL
1486 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1488 if (TREE_CODE (spec
) == FUNCTION_DECL
1489 && uses_template_parms (DECL_TI_ARGS (spec
)))
1490 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1491 register it; we want the corresponding TEMPLATE_DECL instead.
1492 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1493 the more obvious `uses_template_parms (spec)' to avoid problems
1494 with default function arguments. In particular, given
1495 something like this:
1497 template <class T> void f(T t1, T t = T())
1499 the default argument expression is not substituted for in an
1500 instantiation unless and until it is actually needed. */
1503 if (optimize_specialization_lookup_p (tmpl
))
1504 /* We don't put these specializations in the hash table, but we might
1505 want to give an error about a mismatch. */
1506 fn
= retrieve_specialization (tmpl
, args
, 0);
1514 hash
= spec_hasher::hash (&elt
);
1517 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1519 fn
= ((spec_entry
*) *slot
)->spec
;
1524 /* We can sometimes try to re-register a specialization that we've
1525 already got. In particular, regenerate_decl_from_template calls
1526 duplicate_decls which will update the specialization list. But,
1527 we'll still get called again here anyhow. It's more convenient
1528 to simply allow this than to try to prevent it. */
1531 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1533 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1535 if (DECL_ODR_USED (fn
)
1536 || DECL_EXPLICIT_INSTANTIATION (fn
))
1538 error ("specialization of %qD after instantiation",
1540 return error_mark_node
;
1545 /* This situation should occur only if the first
1546 specialization is an implicit instantiation, the
1547 second is an explicit specialization, and the
1548 implicit instantiation has not yet been used. That
1549 situation can occur if we have implicitly
1550 instantiated a member function and then specialized
1553 We can also wind up here if a friend declaration that
1554 looked like an instantiation turns out to be a
1557 template <class T> void foo(T);
1558 class S { friend void foo<>(int) };
1559 template <> void foo(int);
1561 We transform the existing DECL in place so that any
1562 pointers to it become pointers to the updated
1565 If there was a definition for the template, but not
1566 for the specialization, we want this to look as if
1567 there were no definition, and vice versa. */
1568 DECL_INITIAL (fn
) = NULL_TREE
;
1569 duplicate_decls (spec
, fn
, is_friend
);
1570 /* The call to duplicate_decls will have applied
1573 An explicit specialization of a function template
1574 is inline only if it is explicitly declared to be,
1575 and independently of whether its function template
1578 to the primary function; now copy the inline bits to
1579 the various clones. */
1580 FOR_EACH_CLONE (clone
, fn
)
1582 DECL_DECLARED_INLINE_P (clone
)
1583 = DECL_DECLARED_INLINE_P (fn
);
1584 DECL_SOURCE_LOCATION (clone
)
1585 = DECL_SOURCE_LOCATION (fn
);
1586 DECL_DELETED_FN (clone
)
1587 = DECL_DELETED_FN (fn
);
1589 check_specialization_namespace (tmpl
);
1594 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1596 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1597 /* Dup decl failed, but this is a new definition. Set the
1598 line number so any errors match this new
1600 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1606 return duplicate_decls (spec
, fn
, is_friend
);
1608 /* A specialization must be declared in the same namespace as the
1609 template it is specializing. */
1610 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1611 && !check_specialization_namespace (tmpl
))
1612 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1614 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1616 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1617 gcc_assert (tmpl
&& args
&& spec
);
1620 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1621 && PRIMARY_TEMPLATE_P (tmpl
)
1622 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1623 || variable_template_p (tmpl
))
1624 /* If TMPL is a forward declaration of a template function, keep a list
1625 of all specializations in case we need to reassign them to a friend
1626 template later in tsubst_friend_function.
1628 Also keep a list of all variable template instantiations so that
1629 process_partial_specialization can check whether a later partial
1630 specialization would have used it. */
1631 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1632 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1638 /* Returns true iff two spec_entry nodes are equivalent. */
1640 int comparing_specializations
;
1643 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1647 ++comparing_specializations
;
1648 equal
= (e1
->tmpl
== e2
->tmpl
1649 && comp_template_args (e1
->args
, e2
->args
));
1650 if (equal
&& flag_concepts
1651 /* tmpl could be a FIELD_DECL for a capture pack. */
1652 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1653 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1654 && uses_template_parms (e1
->args
))
1656 /* Partial specializations of a variable template can be distinguished by
1658 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1659 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1660 equal
= equivalent_constraints (c1
, c2
);
1662 --comparing_specializations
;
1667 /* Returns a hash for a template TMPL and template arguments ARGS. */
1670 hash_tmpl_and_args (tree tmpl
, tree args
)
1672 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1673 return iterative_hash_template_arg (args
, val
);
1676 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1680 spec_hasher::hash (spec_entry
*e
)
1682 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1685 /* Recursively calculate a hash value for a template argument ARG, for use
1686 in the hash tables of template specializations. */
1689 iterative_hash_template_arg (tree arg
, hashval_t val
)
1691 unsigned HOST_WIDE_INT i
;
1692 enum tree_code code
;
1695 if (arg
== NULL_TREE
)
1696 return iterative_hash_object (arg
, val
);
1701 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1702 /* We can get one of these when re-hashing a previous entry in the middle
1703 of substituting into a pack expansion. Just look through it. */
1704 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1706 code
= TREE_CODE (arg
);
1707 tclass
= TREE_CODE_CLASS (code
);
1709 val
= iterative_hash_object (code
, val
);
1716 case IDENTIFIER_NODE
:
1717 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1721 int i
, len
= TREE_VEC_LENGTH (arg
);
1722 for (i
= 0; i
< len
; ++i
)
1723 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1727 case TYPE_PACK_EXPANSION
:
1728 case EXPR_PACK_EXPANSION
:
1729 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1730 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1732 case TYPE_ARGUMENT_PACK
:
1733 case NONTYPE_ARGUMENT_PACK
:
1734 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1737 for (; arg
; arg
= TREE_CHAIN (arg
))
1738 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1742 for (; arg
; arg
= OVL_NEXT (arg
))
1743 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1749 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1750 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1752 val
= iterative_hash_template_arg (field
, val
);
1753 val
= iterative_hash_template_arg (value
, val
);
1759 if (!DECL_ARTIFICIAL (arg
))
1761 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1762 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1764 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1767 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1770 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1771 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1773 case TEMPLATE_PARM_INDEX
:
1774 val
= iterative_hash_template_arg
1775 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1776 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1777 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1780 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1781 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1782 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1785 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1787 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1791 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1792 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1793 val
= iterative_hash_object (code
, val
);
1794 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1797 /* A lambda can't appear in a template arg, but don't crash on
1799 gcc_assert (seen_error ());
1803 case IMPLICIT_CONV_EXPR
:
1804 case STATIC_CAST_EXPR
:
1805 case REINTERPRET_CAST_EXPR
:
1806 case CONST_CAST_EXPR
:
1807 case DYNAMIC_CAST_EXPR
:
1809 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1810 /* Now hash operands as usual. */
1820 if (alias_template_specialization_p (arg
))
1822 // We want an alias specialization that survived strip_typedefs
1823 // to hash differently from its TYPE_CANONICAL, to avoid hash
1824 // collisions that compare as different in template_args_equal.
1825 // These could be dependent specializations that strip_typedefs
1826 // left alone, or untouched specializations because
1827 // coerce_template_parms returns the unconverted template
1828 // arguments if it sees incomplete argument packs.
1829 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1830 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1832 if (TYPE_CANONICAL (arg
))
1833 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1835 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1836 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1837 /* Otherwise just compare the types during lookup. */
1840 case tcc_declaration
:
1842 return iterative_hash_expr (arg
, val
);
1845 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1847 unsigned n
= cp_tree_operand_length (arg
);
1848 for (i
= 0; i
< n
; ++i
)
1849 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1857 /* Unregister the specialization SPEC as a specialization of TMPL.
1858 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1859 if the SPEC was listed as a specialization of TMPL.
1861 Note that SPEC has been ggc_freed, so we can't look inside it. */
1864 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1869 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1870 elt
.args
= TI_ARGS (tinfo
);
1871 elt
.spec
= NULL_TREE
;
1873 entry
= decl_specializations
->find (&elt
);
1876 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1877 gcc_assert (new_spec
!= NULL_TREE
);
1878 entry
->spec
= new_spec
;
1885 /* Like register_specialization, but for local declarations. We are
1886 registering SPEC, an instantiation of TMPL. */
1889 register_local_specialization (tree spec
, tree tmpl
)
1891 local_specializations
->put (tmpl
, spec
);
1894 /* TYPE is a class type. Returns true if TYPE is an explicitly
1895 specialized class. */
1898 explicit_class_specialization_p (tree type
)
1900 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1902 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1905 /* Print the list of functions at FNS, going through all the overloads
1906 for each element of the list. Alternatively, FNS can not be a
1907 TREE_LIST, in which case it will be printed together with all the
1910 MORE and *STR should respectively be FALSE and NULL when the function
1911 is called from the outside. They are used internally on recursive
1912 calls. print_candidates manages the two parameters and leaves NULL
1913 in *STR when it ends. */
1916 print_candidates_1 (tree fns
, bool more
, const char **str
)
1919 char *spaces
= NULL
;
1921 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1922 if (TREE_CODE (fn
) == TREE_LIST
)
1924 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1925 print_candidates_1 (TREE_VALUE (fn2
),
1926 TREE_CHAIN (fn2
) || more
, str
);
1930 tree cand
= OVL_CURRENT (fn
);
1933 /* Pick the prefix string. */
1934 if (!more
&& !OVL_NEXT (fns
))
1936 inform (DECL_SOURCE_LOCATION (cand
),
1937 "candidate is: %#D", cand
);
1941 *str
= _("candidates are:");
1942 spaces
= get_spaces (*str
);
1944 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1945 *str
= spaces
? spaces
: *str
;
1955 /* Print the list of candidate FNS in an error message. FNS can also
1956 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1959 print_candidates (tree fns
)
1961 const char *str
= NULL
;
1962 print_candidates_1 (fns
, false, &str
);
1963 gcc_assert (str
== NULL
);
1966 /* Get a (possibly) constrained template declaration for the
1967 purpose of ordering candidates. */
1969 get_template_for_ordering (tree list
)
1971 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1972 tree f
= TREE_VALUE (list
);
1973 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1974 return TI_TEMPLATE (ti
);
1978 /* Among candidates having the same signature, return the
1979 most constrained or NULL_TREE if there is no best candidate.
1980 If the signatures of candidates vary (e.g., template
1981 specialization vs. member function), then there can be no
1984 Note that we don't compare constraints on the functions
1985 themselves, but rather those of their templates. */
1987 most_constrained_function (tree candidates
)
1989 // Try to find the best candidate in a first pass.
1990 tree champ
= candidates
;
1991 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
1993 int winner
= more_constrained (get_template_for_ordering (champ
),
1994 get_template_for_ordering (c
));
1996 champ
= c
; // The candidate is more constrained
1997 else if (winner
== 0)
1998 return NULL_TREE
; // Neither is more constrained
2001 // Verify that the champ is better than previous candidates.
2002 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2003 if (!more_constrained (get_template_for_ordering (champ
),
2004 get_template_for_ordering (c
)))
2012 /* Returns the template (one of the functions given by TEMPLATE_ID)
2013 which can be specialized to match the indicated DECL with the
2014 explicit template args given in TEMPLATE_ID. The DECL may be
2015 NULL_TREE if none is available. In that case, the functions in
2016 TEMPLATE_ID are non-members.
2018 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2019 specialization of a member template.
2021 The TEMPLATE_COUNT is the number of references to qualifying
2022 template classes that appeared in the name of the function. See
2023 check_explicit_specialization for a more accurate description.
2025 TSK indicates what kind of template declaration (if any) is being
2026 declared. TSK_TEMPLATE indicates that the declaration given by
2027 DECL, though a FUNCTION_DECL, has template parameters, and is
2028 therefore a template function.
2030 The template args (those explicitly specified and those deduced)
2031 are output in a newly created vector *TARGS_OUT.
2033 If it is impossible to determine the result, an error message is
2034 issued. The error_mark_node is returned to indicate failure. */
2037 determine_specialization (tree template_id
,
2040 int need_member_template
,
2046 tree explicit_targs
;
2047 tree candidates
= NULL_TREE
;
2049 /* A TREE_LIST of templates of which DECL may be a specialization.
2050 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2051 corresponding TREE_PURPOSE is the set of template arguments that,
2052 when used to instantiate the template, would produce a function
2053 with the signature of DECL. */
2054 tree templates
= NULL_TREE
;
2056 cp_binding_level
*b
;
2058 *targs_out
= NULL_TREE
;
2060 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2061 return error_mark_node
;
2063 /* We shouldn't be specializing a member template of an
2064 unspecialized class template; we already gave an error in
2065 check_specialization_scope, now avoid crashing. */
2066 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
2067 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2069 gcc_assert (errorcount
);
2070 return error_mark_node
;
2073 fns
= TREE_OPERAND (template_id
, 0);
2074 explicit_targs
= TREE_OPERAND (template_id
, 1);
2076 if (fns
== error_mark_node
)
2077 return error_mark_node
;
2079 /* Check for baselinks. */
2080 if (BASELINK_P (fns
))
2081 fns
= BASELINK_FUNCTIONS (fns
);
2083 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2085 error ("%qD is not a function template", fns
);
2086 return error_mark_node
;
2088 else if (VAR_P (decl
) && !variable_template_p (fns
))
2090 error ("%qD is not a variable template", fns
);
2091 return error_mark_node
;
2094 /* Count the number of template headers specified for this
2097 for (b
= current_binding_level
;
2098 b
->kind
== sk_template_parms
;
2102 tree orig_fns
= fns
;
2104 if (variable_template_p (fns
))
2106 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2107 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2108 tf_warning_or_error
,
2109 /*req_all*/true, /*use_defarg*/true);
2110 if (targs
!= error_mark_node
)
2111 templates
= tree_cons (targs
, fns
, templates
);
2113 else for (; fns
; fns
= OVL_NEXT (fns
))
2115 tree fn
= OVL_CURRENT (fns
);
2117 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2119 tree decl_arg_types
;
2123 /* In case of explicit specialization, we need to check if
2124 the number of template headers appearing in the specialization
2125 is correct. This is usually done in check_explicit_specialization,
2126 but the check done there cannot be exhaustive when specializing
2127 member functions. Consider the following code:
2129 template <> void A<int>::f(int);
2130 template <> template <> void A<int>::f(int);
2132 Assuming that A<int> is not itself an explicit specialization
2133 already, the first line specializes "f" which is a non-template
2134 member function, whilst the second line specializes "f" which
2135 is a template member function. So both lines are syntactically
2136 correct, and check_explicit_specialization does not reject
2139 Here, we can do better, as we are matching the specialization
2140 against the declarations. We count the number of template
2141 headers, and we check if they match TEMPLATE_COUNT + 1
2142 (TEMPLATE_COUNT is the number of qualifying template classes,
2143 plus there must be another header for the member template
2146 Notice that if header_count is zero, this is not a
2147 specialization but rather a template instantiation, so there
2148 is no check we can perform here. */
2149 if (header_count
&& header_count
!= template_count
+ 1)
2152 /* Check that the number of template arguments at the
2153 innermost level for DECL is the same as for FN. */
2154 if (current_binding_level
->kind
== sk_template_parms
2155 && !current_binding_level
->explicit_spec_p
2156 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2157 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2158 (current_template_parms
))))
2161 /* DECL might be a specialization of FN. */
2162 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2163 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2165 /* For a non-static member function, we need to make sure
2166 that the const qualification is the same. Since
2167 get_bindings does not try to merge the "this" parameter,
2168 we must do the comparison explicitly. */
2169 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2170 && !same_type_p (TREE_VALUE (fn_arg_types
),
2171 TREE_VALUE (decl_arg_types
)))
2174 /* Skip the "this" parameter and, for constructors of
2175 classes with virtual bases, the VTT parameter. A
2176 full specialization of a constructor will have a VTT
2177 parameter, but a template never will. */
2179 = skip_artificial_parms_for (decl
, decl_arg_types
);
2181 = skip_artificial_parms_for (fn
, fn_arg_types
);
2183 /* Function templates cannot be specializations; there are
2184 no partial specializations of functions. Therefore, if
2185 the type of DECL does not match FN, there is no
2188 Note that it should never be the case that we have both
2189 candidates added here, and for regular member functions
2191 if (tsk
== tsk_template
)
2193 if (compparms (fn_arg_types
, decl_arg_types
))
2194 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2198 /* See whether this function might be a specialization of this
2199 template. Suppress access control because we might be trying
2200 to make this specialization a friend, and we have already done
2201 access control for the declaration of the specialization. */
2202 push_deferring_access_checks (dk_no_check
);
2203 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2204 pop_deferring_access_checks ();
2207 /* We cannot deduce template arguments that when used to
2208 specialize TMPL will produce DECL. */
2211 /* Remove, from the set of candidates, all those functions
2212 whose constraints are not satisfied. */
2213 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2216 // Then, try to form the new function type.
2217 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2218 if (insttype
== error_mark_node
)
2221 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2222 if (!compparms (fn_arg_types
, decl_arg_types
))
2225 /* Save this template, and the arguments deduced. */
2226 templates
= tree_cons (targs
, fn
, templates
);
2228 else if (need_member_template
)
2229 /* FN is an ordinary member function, and we need a
2230 specialization of a member template. */
2232 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2233 /* We can get IDENTIFIER_NODEs here in certain erroneous
2236 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2237 /* This is just an ordinary non-member function. Nothing can
2238 be a specialization of that. */
2240 else if (DECL_ARTIFICIAL (fn
))
2241 /* Cannot specialize functions that are created implicitly. */
2245 tree decl_arg_types
;
2247 /* This is an ordinary member function. However, since
2248 we're here, we can assume its enclosing class is a
2249 template class. For example,
2251 template <typename T> struct S { void f(); };
2252 template <> void S<int>::f() {}
2254 Here, S<int>::f is a non-template, but S<int> is a
2255 template class. If FN has the same type as DECL, we
2256 might be in business. */
2258 if (!DECL_TEMPLATE_INFO (fn
))
2259 /* Its enclosing class is an explicit specialization
2260 of a template class. This is not a candidate. */
2263 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2264 TREE_TYPE (TREE_TYPE (fn
))))
2265 /* The return types differ. */
2268 /* Adjust the type of DECL in case FN is a static member. */
2269 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2270 if (DECL_STATIC_FUNCTION_P (fn
)
2271 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2272 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2274 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2278 // If the deduced arguments do not satisfy the constraints,
2279 // this is not a candidate.
2280 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2283 // Add the candidate.
2284 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2288 if (templates
&& TREE_CHAIN (templates
))
2294 It is possible for a specialization with a given function
2295 signature to be instantiated from more than one function
2296 template. In such cases, explicit specification of the
2297 template arguments must be used to uniquely identify the
2298 function template specialization being specialized.
2300 Note that here, there's no suggestion that we're supposed to
2301 determine which of the candidate templates is most
2302 specialized. However, we, also have:
2306 Partial ordering of overloaded function template
2307 declarations is used in the following contexts to select
2308 the function template to which a function template
2309 specialization refers:
2311 -- when an explicit specialization refers to a function
2314 So, we do use the partial ordering rules, at least for now.
2315 This extension can only serve to make invalid programs valid,
2316 so it's safe. And, there is strong anecdotal evidence that
2317 the committee intended the partial ordering rules to apply;
2318 the EDG front end has that behavior, and John Spicer claims
2319 that the committee simply forgot to delete the wording in
2320 [temp.expl.spec]. */
2321 tree tmpl
= most_specialized_instantiation (templates
);
2322 if (tmpl
!= error_mark_node
)
2325 TREE_CHAIN (templates
) = NULL_TREE
;
2329 // Concepts allows multiple declarations of member functions
2330 // with the same signature. Like above, we need to rely on
2331 // on the partial ordering of those candidates to determine which
2333 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2335 if (tree cand
= most_constrained_function (candidates
))
2338 TREE_CHAIN (cand
) = NULL_TREE
;
2342 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2344 error ("template-id %qD for %q+D does not match any template "
2345 "declaration", template_id
, decl
);
2346 if (header_count
&& header_count
!= template_count
+ 1)
2347 inform (input_location
, "saw %d %<template<>%>, need %d for "
2348 "specializing a member function template",
2349 header_count
, template_count
+ 1);
2351 print_candidates (orig_fns
);
2352 return error_mark_node
;
2354 else if ((templates
&& TREE_CHAIN (templates
))
2355 || (candidates
&& TREE_CHAIN (candidates
))
2356 || (templates
&& candidates
))
2358 error ("ambiguous template specialization %qD for %q+D",
2360 candidates
= chainon (candidates
, templates
);
2361 print_candidates (candidates
);
2362 return error_mark_node
;
2365 /* We have one, and exactly one, match. */
2368 tree fn
= TREE_VALUE (candidates
);
2369 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2371 // Propagate the candidate's constraints to the declaration.
2372 set_constraints (decl
, get_constraints (fn
));
2374 /* DECL is a re-declaration or partial instantiation of a template
2376 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2378 /* It was a specialization of an ordinary member function in a
2380 return DECL_TI_TEMPLATE (fn
);
2383 /* It was a specialization of a template. */
2384 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2385 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2387 *targs_out
= copy_node (targs
);
2388 SET_TMPL_ARGS_LEVEL (*targs_out
,
2389 TMPL_ARGS_DEPTH (*targs_out
),
2390 TREE_PURPOSE (templates
));
2393 *targs_out
= TREE_PURPOSE (templates
);
2394 return TREE_VALUE (templates
);
2397 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2398 but with the default argument values filled in from those in the
2402 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2405 tree new_spec_types
;
2410 if (spec_types
== void_list_node
)
2411 return void_list_node
;
2413 /* Substitute into the rest of the list. */
2415 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2416 TREE_CHAIN (tmpl_types
));
2418 /* Add the default argument for this parameter. */
2419 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2420 TREE_VALUE (spec_types
),
2424 /* DECL is an explicit specialization. Replicate default arguments
2425 from the template it specializes. (That way, code like:
2427 template <class T> void f(T = 3);
2428 template <> void f(double);
2431 works, as required.) An alternative approach would be to look up
2432 the correct default arguments at the call-site, but this approach
2433 is consistent with how implicit instantiations are handled. */
2436 copy_default_args_to_explicit_spec (tree decl
)
2441 tree new_spec_types
;
2445 tree object_type
= NULL_TREE
;
2446 tree in_charge
= NULL_TREE
;
2447 tree vtt
= NULL_TREE
;
2449 /* See if there's anything we need to do. */
2450 tmpl
= DECL_TI_TEMPLATE (decl
);
2451 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2452 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2453 if (TREE_PURPOSE (t
))
2458 old_type
= TREE_TYPE (decl
);
2459 spec_types
= TYPE_ARG_TYPES (old_type
);
2461 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2463 /* Remove the this pointer, but remember the object's type for
2465 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2466 spec_types
= TREE_CHAIN (spec_types
);
2467 tmpl_types
= TREE_CHAIN (tmpl_types
);
2469 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2471 /* DECL may contain more parameters than TMPL due to the extra
2472 in-charge parameter in constructors and destructors. */
2473 in_charge
= spec_types
;
2474 spec_types
= TREE_CHAIN (spec_types
);
2476 if (DECL_HAS_VTT_PARM_P (decl
))
2479 spec_types
= TREE_CHAIN (spec_types
);
2483 /* Compute the merged default arguments. */
2485 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2487 /* Compute the new FUNCTION_TYPE. */
2491 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2496 /* Put the in-charge parameter back. */
2497 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2498 TREE_VALUE (in_charge
),
2501 new_type
= build_method_type_directly (object_type
,
2502 TREE_TYPE (old_type
),
2506 new_type
= build_function_type (TREE_TYPE (old_type
),
2508 new_type
= cp_build_type_attribute_variant (new_type
,
2509 TYPE_ATTRIBUTES (old_type
));
2510 new_type
= build_exception_variant (new_type
,
2511 TYPE_RAISES_EXCEPTIONS (old_type
));
2513 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2514 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2516 TREE_TYPE (decl
) = new_type
;
2519 /* Return the number of template headers we expect to see for a definition
2520 or specialization of CTYPE or one of its non-template members. */
2523 num_template_headers_for_class (tree ctype
)
2525 int num_templates
= 0;
2527 while (ctype
&& CLASS_TYPE_P (ctype
))
2529 /* You're supposed to have one `template <...>' for every
2530 template class, but you don't need one for a full
2531 specialization. For example:
2533 template <class T> struct S{};
2534 template <> struct S<int> { void f(); };
2535 void S<int>::f () {}
2537 is correct; there shouldn't be a `template <>' for the
2538 definition of `S<int>::f'. */
2539 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2540 /* If CTYPE does not have template information of any
2541 kind, then it is not a template, nor is it nested
2542 within a template. */
2544 if (explicit_class_specialization_p (ctype
))
2546 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2549 ctype
= TYPE_CONTEXT (ctype
);
2552 return num_templates
;
2555 /* Do a simple sanity check on the template headers that precede the
2556 variable declaration DECL. */
2559 check_template_variable (tree decl
)
2561 tree ctx
= CP_DECL_CONTEXT (decl
);
2562 int wanted
= num_template_headers_for_class (ctx
);
2563 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2564 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2566 if (cxx_dialect
< cxx14
)
2567 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2568 "variable templates only available with "
2569 "-std=c++14 or -std=gnu++14");
2571 // Namespace-scope variable templates should have a template header.
2574 if (template_header_count
> wanted
)
2576 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2577 "too many template headers for %D (should be %d)",
2579 if (warned
&& CLASS_TYPE_P (ctx
)
2580 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2581 inform (DECL_SOURCE_LOCATION (decl
),
2582 "members of an explicitly specialized class are defined "
2583 "without a template header");
2587 /* Check to see if the function just declared, as indicated in
2588 DECLARATOR, and in DECL, is a specialization of a function
2589 template. We may also discover that the declaration is an explicit
2590 instantiation at this point.
2592 Returns DECL, or an equivalent declaration that should be used
2593 instead if all goes well. Issues an error message if something is
2594 amiss. Returns error_mark_node if the error is not easily
2597 FLAGS is a bitmask consisting of the following flags:
2599 2: The function has a definition.
2600 4: The function is a friend.
2602 The TEMPLATE_COUNT is the number of references to qualifying
2603 template classes that appeared in the name of the function. For
2606 template <class T> struct S { void f(); };
2609 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2610 classes are not counted in the TEMPLATE_COUNT, so that in
2612 template <class T> struct S {};
2613 template <> struct S<int> { void f(); }
2614 template <> void S<int>::f();
2616 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2617 invalid; there should be no template <>.)
2619 If the function is a specialization, it is marked as such via
2620 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2621 is set up correctly, and it is added to the list of specializations
2622 for that template. */
2625 check_explicit_specialization (tree declarator
,
2630 int have_def
= flags
& 2;
2631 int is_friend
= flags
& 4;
2632 bool is_concept
= flags
& 8;
2633 int specialization
= 0;
2634 int explicit_instantiation
= 0;
2635 int member_specialization
= 0;
2636 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2637 tree dname
= DECL_NAME (decl
);
2642 if (!processing_specialization
)
2645 tsk
= tsk_excessive_parms
;
2648 tsk
= current_tmpl_spec_kind (template_count
);
2653 if (processing_specialization
&& !VAR_P (decl
))
2656 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2658 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2661 /* This could be something like:
2663 template <class T> void f(T);
2664 class S { friend void f<>(int); } */
2668 /* This case handles bogus declarations like template <>
2669 template <class T> void f<int>(); */
2671 error ("template-id %qD in declaration of primary template",
2678 case tsk_invalid_member_spec
:
2679 /* The error has already been reported in
2680 check_specialization_scope. */
2681 return error_mark_node
;
2683 case tsk_invalid_expl_inst
:
2684 error ("template parameter list used in explicit instantiation");
2690 error ("definition provided for explicit instantiation");
2692 explicit_instantiation
= 1;
2695 case tsk_excessive_parms
:
2696 case tsk_insufficient_parms
:
2697 if (tsk
== tsk_excessive_parms
)
2698 error ("too many template parameter lists in declaration of %qD",
2700 else if (template_header_count
)
2701 error("too few template parameter lists in declaration of %qD", decl
);
2703 error("explicit specialization of %qD must be introduced by "
2704 "%<template <>%>", decl
);
2709 error ("explicit specialization declared %<concept%>");
2711 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2712 /* In cases like template<> constexpr bool v = true;
2713 We'll give an error in check_template_variable. */
2716 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2718 member_specialization
= 1;
2724 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2726 /* This case handles bogus declarations like template <>
2727 template <class T> void f<int>(); */
2729 if (!uses_template_parms (declarator
))
2730 error ("template-id %qD in declaration of primary template",
2732 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2734 /* Partial specialization of variable template. */
2735 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2739 else if (cxx_dialect
< cxx14
)
2740 error ("non-type partial specialization %qD "
2741 "is not allowed", declarator
);
2743 error ("non-class, non-variable partial specialization %qD "
2744 "is not allowed", declarator
);
2749 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2750 /* This is a specialization of a member template, without
2751 specialization the containing class. Something like:
2753 template <class T> struct S {
2754 template <class U> void f (U);
2756 template <> template <class U> void S<int>::f(U) {}
2758 That's a specialization -- but of the entire template. */
2766 if ((specialization
|| member_specialization
)
2767 /* This doesn't apply to variable templates. */
2768 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2769 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2771 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2772 for (; t
; t
= TREE_CHAIN (t
))
2773 if (TREE_PURPOSE (t
))
2775 permerror (input_location
,
2776 "default argument specified in explicit specialization");
2781 if (specialization
|| member_specialization
|| explicit_instantiation
)
2783 tree tmpl
= NULL_TREE
;
2784 tree targs
= NULL_TREE
;
2785 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2787 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2788 if (!was_template_id
)
2792 gcc_assert (identifier_p (declarator
));
2797 /* If there is no class context, the explicit instantiation
2798 must be at namespace scope. */
2799 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2801 /* Find the namespace binding, using the declaration
2803 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2805 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2807 error ("%qD is not a template function", dname
);
2808 fns
= error_mark_node
;
2812 declarator
= lookup_template_function (fns
, NULL_TREE
);
2815 if (declarator
== error_mark_node
)
2816 return error_mark_node
;
2818 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2820 if (!explicit_instantiation
)
2821 /* A specialization in class scope. This is invalid,
2822 but the error will already have been flagged by
2823 check_specialization_scope. */
2824 return error_mark_node
;
2827 /* It's not valid to write an explicit instantiation in
2830 class C { template void f(); }
2832 This case is caught by the parser. However, on
2835 template class C { void f(); };
2837 (which is invalid) we can get here. The error will be
2844 else if (ctype
!= NULL_TREE
2845 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2847 // We'll match variable templates in start_decl.
2851 /* Find the list of functions in ctype that have the same
2852 name as the declared function. */
2853 tree name
= TREE_OPERAND (declarator
, 0);
2854 tree fns
= NULL_TREE
;
2857 if (constructor_name_p (name
, ctype
))
2859 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2861 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2862 : !CLASSTYPE_DESTRUCTORS (ctype
))
2864 /* From [temp.expl.spec]:
2866 If such an explicit specialization for the member
2867 of a class template names an implicitly-declared
2868 special member function (clause _special_), the
2869 program is ill-formed.
2871 Similar language is found in [temp.explicit]. */
2872 error ("specialization of implicitly-declared special member function");
2873 return error_mark_node
;
2876 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2879 if (!DECL_CONV_FN_P (decl
))
2881 idx
= lookup_fnfields_1 (ctype
, name
);
2883 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2887 vec
<tree
, va_gc
> *methods
;
2890 /* For a type-conversion operator, we cannot do a
2891 name-based lookup. We might be looking for `operator
2892 int' which will be a specialization of `operator T'.
2893 So, we find *all* the conversion operators, and then
2894 select from them. */
2897 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2899 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2900 methods
->iterate (idx
, &ovl
);
2903 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2904 /* There are no more conversion functions. */
2907 /* Glue all these conversion functions together
2908 with those we already have. */
2909 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2910 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2914 if (fns
== NULL_TREE
)
2916 error ("no member function %qD declared in %qT", name
, ctype
);
2917 return error_mark_node
;
2920 TREE_OPERAND (declarator
, 0) = fns
;
2923 /* Figure out what exactly is being specialized at this point.
2924 Note that for an explicit instantiation, even one for a
2925 member function, we cannot tell apriori whether the
2926 instantiation is for a member template, or just a member
2927 function of a template class. Even if a member template is
2928 being instantiated, the member template arguments may be
2929 elided if they can be deduced from the rest of the
2931 tmpl
= determine_specialization (declarator
, decl
,
2933 member_specialization
,
2937 if (!tmpl
|| tmpl
== error_mark_node
)
2938 /* We couldn't figure out what this declaration was
2940 return error_mark_node
;
2943 if (!ctype
&& !was_template_id
2944 && (specialization
|| member_specialization
2945 || explicit_instantiation
)
2946 && !is_associated_namespace (CP_DECL_CONTEXT (decl
),
2947 CP_DECL_CONTEXT (tmpl
)))
2948 error ("%qD is not declared in %qD",
2949 tmpl
, current_namespace
);
2951 tree gen_tmpl
= most_general_template (tmpl
);
2953 if (explicit_instantiation
)
2955 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2956 is done by do_decl_instantiation later. */
2958 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2959 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2961 if (arg_depth
> parm_depth
)
2963 /* If TMPL is not the most general template (for
2964 example, if TMPL is a friend template that is
2965 injected into namespace scope), then there will
2966 be too many levels of TARGS. Remove some of them
2971 new_targs
= make_tree_vec (parm_depth
);
2972 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2973 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2974 = TREE_VEC_ELT (targs
, i
);
2978 return instantiate_template (tmpl
, targs
, tf_error
);
2981 /* If we thought that the DECL was a member function, but it
2982 turns out to be specializing a static member function,
2983 make DECL a static member function as well. */
2984 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2985 && DECL_STATIC_FUNCTION_P (tmpl
)
2986 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2987 revert_static_member_fn (decl
);
2989 /* If this is a specialization of a member template of a
2990 template class, we want to return the TEMPLATE_DECL, not
2991 the specialization of it. */
2992 if (tsk
== tsk_template
&& !was_template_id
)
2994 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2995 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2996 DECL_INITIAL (result
) = NULL_TREE
;
3000 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3001 DECL_SOURCE_LOCATION (result
)
3002 = DECL_SOURCE_LOCATION (decl
);
3003 /* We want to use the argument list specified in the
3004 definition, not in the original declaration. */
3005 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3006 for (parm
= DECL_ARGUMENTS (result
); parm
;
3007 parm
= DECL_CHAIN (parm
))
3008 DECL_CONTEXT (parm
) = result
;
3010 return register_specialization (tmpl
, gen_tmpl
, targs
,
3014 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3015 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3017 if (was_template_id
)
3018 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3020 /* Inherit default function arguments from the template
3021 DECL is specializing. */
3022 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3023 copy_default_args_to_explicit_spec (decl
);
3025 /* This specialization has the same protection as the
3026 template it specializes. */
3027 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3028 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3030 /* 7.1.1-1 [dcl.stc]
3032 A storage-class-specifier shall not be specified in an
3033 explicit specialization...
3035 The parser rejects these, so unless action is taken here,
3036 explicit function specializations will always appear with
3039 The action recommended by the C++ CWG in response to C++
3040 defect report 605 is to make the storage class and linkage
3041 of the explicit specialization match the templated function:
3043 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3045 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3047 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3048 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3050 /* A concept cannot be specialized. */
3051 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3053 error ("explicit specialization of function concept %qD",
3055 return error_mark_node
;
3058 /* This specialization has the same linkage and visibility as
3059 the function template it specializes. */
3060 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3061 if (! TREE_PUBLIC (decl
))
3063 DECL_INTERFACE_KNOWN (decl
) = 1;
3064 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3066 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3067 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3069 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3070 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3074 /* If DECL is a friend declaration, declared using an
3075 unqualified name, the namespace associated with DECL may
3076 have been set incorrectly. For example, in:
3078 template <typename T> void f(T);
3080 struct S { friend void f<int>(int); }
3083 we will have set the DECL_CONTEXT for the friend
3084 declaration to N, rather than to the global namespace. */
3085 if (DECL_NAMESPACE_SCOPE_P (decl
))
3086 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3088 if (is_friend
&& !have_def
)
3089 /* This is not really a declaration of a specialization.
3090 It's just the name of an instantiation. But, it's not
3091 a request for an instantiation, either. */
3092 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3093 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3094 /* A specialization is not necessarily COMDAT. */
3095 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3096 && DECL_DECLARED_INLINE_P (decl
));
3097 else if (VAR_P (decl
))
3098 DECL_COMDAT (decl
) = false;
3100 /* If this is a full specialization, register it so that we can find
3101 it again. Partial specializations will be registered in
3102 process_partial_specialization. */
3103 if (!processing_template_decl
)
3104 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3107 /* A 'structor should already have clones. */
3108 gcc_assert (decl
== error_mark_node
3109 || variable_template_p (tmpl
)
3110 || !(DECL_CONSTRUCTOR_P (decl
)
3111 || DECL_DESTRUCTOR_P (decl
))
3112 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3119 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3120 parameters. These are represented in the same format used for
3121 DECL_TEMPLATE_PARMS. */
3124 comp_template_parms (const_tree parms1
, const_tree parms2
)
3129 if (parms1
== parms2
)
3132 for (p1
= parms1
, p2
= parms2
;
3133 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3134 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3136 tree t1
= TREE_VALUE (p1
);
3137 tree t2
= TREE_VALUE (p2
);
3140 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3141 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3143 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3146 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3148 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3149 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3151 /* If either of the template parameters are invalid, assume
3152 they match for the sake of error recovery. */
3153 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3156 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3159 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3160 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3161 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3163 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3168 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3169 /* One set of parameters has more parameters lists than the
3176 /* Determine whether PARM is a parameter pack. */
3179 template_parameter_pack_p (const_tree parm
)
3181 /* Determine if we have a non-type template parameter pack. */
3182 if (TREE_CODE (parm
) == PARM_DECL
)
3183 return (DECL_TEMPLATE_PARM_P (parm
)
3184 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3185 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3186 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3188 /* If this is a list of template parameters, we could get a
3189 TYPE_DECL or a TEMPLATE_DECL. */
3190 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3191 parm
= TREE_TYPE (parm
);
3193 /* Otherwise it must be a type template parameter. */
3194 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3195 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3196 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3199 /* Determine if T is a function parameter pack. */
3202 function_parameter_pack_p (const_tree t
)
3204 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3205 return DECL_PACK_P (t
);
3209 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3210 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3213 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3215 if (! primary_func_tmpl_inst
3216 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3217 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3220 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3223 /* Return true iff the function parameter PARAM_DECL was expanded
3224 from the function parameter pack PACK. */
3227 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3229 if (DECL_ARTIFICIAL (param_decl
)
3230 || !function_parameter_pack_p (pack
))
3233 /* The parameter pack and its pack arguments have the same
3235 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3238 /* Determine whether ARGS describes a variadic template args list,
3239 i.e., one that is terminated by a template argument pack. */
3242 template_args_variadic_p (tree args
)
3247 if (args
== NULL_TREE
)
3250 args
= INNERMOST_TEMPLATE_ARGS (args
);
3251 nargs
= TREE_VEC_LENGTH (args
);
3256 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3258 return ARGUMENT_PACK_P (last_parm
);
3261 /* Generate a new name for the parameter pack name NAME (an
3262 IDENTIFIER_NODE) that incorporates its */
3265 make_ith_pack_parameter_name (tree name
, int i
)
3267 /* Munge the name to include the parameter index. */
3268 #define NUMBUF_LEN 128
3269 char numbuf
[NUMBUF_LEN
];
3273 if (name
== NULL_TREE
)
3275 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3276 newname_len
= IDENTIFIER_LENGTH (name
)
3277 + strlen (numbuf
) + 2;
3278 newname
= (char*)alloca (newname_len
);
3279 snprintf (newname
, newname_len
,
3280 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3281 return get_identifier (newname
);
3284 /* Return true if T is a primary function, class or alias template
3288 primary_template_instantiation_p (const_tree t
)
3293 if (TREE_CODE (t
) == FUNCTION_DECL
)
3294 return DECL_LANG_SPECIFIC (t
)
3295 && DECL_TEMPLATE_INSTANTIATION (t
)
3296 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3297 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3298 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3299 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3300 else if (alias_template_specialization_p (t
))
3305 /* Return true if PARM is a template template parameter. */
3308 template_template_parameter_p (const_tree parm
)
3310 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3313 /* Return true iff PARM is a DECL representing a type template
3317 template_type_parameter_p (const_tree parm
)
3320 && (TREE_CODE (parm
) == TYPE_DECL
3321 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3322 && DECL_TEMPLATE_PARM_P (parm
));
3325 /* Return the template parameters of T if T is a
3326 primary template instantiation, NULL otherwise. */
3329 get_primary_template_innermost_parameters (const_tree t
)
3331 tree parms
= NULL
, template_info
= NULL
;
3333 if ((template_info
= get_template_info (t
))
3334 && primary_template_instantiation_p (t
))
3335 parms
= INNERMOST_TEMPLATE_PARMS
3336 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3341 /* Return the template parameters of the LEVELth level from the full list
3342 of template parameters PARMS. */
3345 get_template_parms_at_level (tree parms
, int level
)
3349 || TREE_CODE (parms
) != TREE_LIST
3350 || level
> TMPL_PARMS_DEPTH (parms
))
3353 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3354 if (TMPL_PARMS_DEPTH (p
) == level
)
3360 /* Returns the template arguments of T if T is a template instantiation,
3364 get_template_innermost_arguments (const_tree t
)
3366 tree args
= NULL
, template_info
= NULL
;
3368 if ((template_info
= get_template_info (t
))
3369 && TI_ARGS (template_info
))
3370 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3375 /* Return the argument pack elements of T if T is a template argument pack,
3379 get_template_argument_pack_elems (const_tree t
)
3381 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3382 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3385 return ARGUMENT_PACK_ARGS (t
);
3388 /* Structure used to track the progress of find_parameter_packs_r. */
3389 struct find_parameter_pack_data
3391 /* TREE_LIST that will contain all of the parameter packs found by
3393 tree
* parameter_packs
;
3395 /* Set of AST nodes that have been visited by the traversal. */
3396 hash_set
<tree
> *visited
;
3398 /* True iff we're making a type pack expansion. */
3399 bool type_pack_expansion_p
;
3402 /* Identifies all of the argument packs that occur in a template
3403 argument and appends them to the TREE_LIST inside DATA, which is a
3404 find_parameter_pack_data structure. This is a subroutine of
3405 make_pack_expansion and uses_parameter_packs. */
3407 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3410 struct find_parameter_pack_data
* ppd
=
3411 (struct find_parameter_pack_data
*)data
;
3412 bool parameter_pack_p
= false;
3414 /* Handle type aliases/typedefs. */
3415 if (TYPE_ALIAS_P (t
))
3417 if (TYPE_TEMPLATE_INFO (t
))
3418 cp_walk_tree (&TYPE_TI_ARGS (t
),
3419 &find_parameter_packs_r
,
3425 /* Identify whether this is a parameter pack or not. */
3426 switch (TREE_CODE (t
))
3428 case TEMPLATE_PARM_INDEX
:
3429 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3430 parameter_pack_p
= true;
3433 case TEMPLATE_TYPE_PARM
:
3434 t
= TYPE_MAIN_VARIANT (t
);
3435 case TEMPLATE_TEMPLATE_PARM
:
3436 /* If the placeholder appears in the decl-specifier-seq of a function
3437 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3438 is a pack expansion, the invented template parameter is a template
3440 if (ppd
->type_pack_expansion_p
&& is_auto_or_concept (t
))
3441 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3442 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3443 parameter_pack_p
= true;
3448 if (DECL_PACK_P (t
))
3450 /* We don't want to walk into the type of a PARM_DECL,
3451 because we don't want to see the type parameter pack. */
3453 parameter_pack_p
= true;
3457 /* Look through a lambda capture proxy to the field pack. */
3459 if (DECL_HAS_VALUE_EXPR_P (t
))
3461 tree v
= DECL_VALUE_EXPR (t
);
3463 &find_parameter_packs_r
,
3467 else if (variable_template_specialization_p (t
))
3469 cp_walk_tree (&DECL_TI_ARGS (t
),
3470 find_parameter_packs_r
,
3477 parameter_pack_p
= true;
3480 /* Not a parameter pack. */
3484 if (parameter_pack_p
)
3486 /* Add this parameter pack to the list. */
3487 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3491 cp_walk_tree (&TYPE_CONTEXT (t
),
3492 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3494 /* This switch statement will return immediately if we don't find a
3496 switch (TREE_CODE (t
))
3498 case TEMPLATE_PARM_INDEX
:
3501 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3502 /* Check the template itself. */
3503 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3504 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3505 /* Check the template arguments. */
3506 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3511 case TEMPLATE_TYPE_PARM
:
3512 case TEMPLATE_TEMPLATE_PARM
:
3519 if (TYPE_PTRMEMFUNC_P (t
))
3525 if (TYPE_TEMPLATE_INFO (t
))
3526 cp_walk_tree (&TYPE_TI_ARGS (t
),
3527 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3534 cp_walk_tree (&TREE_TYPE (t
),
3535 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3539 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3544 case TYPE_PACK_EXPANSION
:
3545 case EXPR_PACK_EXPANSION
:
3550 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3555 case IDENTIFIER_NODE
:
3556 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3563 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3564 type_pack_expansion_p to false so that any placeholders
3565 within the expression don't get marked as parameter packs. */
3566 bool type_pack_expansion_p
= ppd
->type_pack_expansion_p
;
3567 ppd
->type_pack_expansion_p
= false;
3568 cp_walk_tree (&DECLTYPE_TYPE_EXPR (t
), &find_parameter_packs_r
,
3570 ppd
->type_pack_expansion_p
= type_pack_expansion_p
;
3582 /* Determines if the expression or type T uses any parameter packs. */
3584 uses_parameter_packs (tree t
)
3586 tree parameter_packs
= NULL_TREE
;
3587 struct find_parameter_pack_data ppd
;
3588 ppd
.parameter_packs
= ¶meter_packs
;
3589 ppd
.visited
= new hash_set
<tree
>;
3590 ppd
.type_pack_expansion_p
= false;
3591 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3593 return parameter_packs
!= NULL_TREE
;
3596 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3597 representation a base-class initializer into a parameter pack
3598 expansion. If all goes well, the resulting node will be an
3599 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3602 make_pack_expansion (tree arg
)
3605 tree parameter_packs
= NULL_TREE
;
3606 bool for_types
= false;
3607 struct find_parameter_pack_data ppd
;
3609 if (!arg
|| arg
== error_mark_node
)
3612 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3614 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3615 class initializer. In this case, the TREE_PURPOSE will be a
3616 _TYPE node (representing the base class expansion we're
3617 initializing) and the TREE_VALUE will be a TREE_LIST
3618 containing the initialization arguments.
3620 The resulting expansion looks somewhat different from most
3621 expansions. Rather than returning just one _EXPANSION, we
3622 return a TREE_LIST whose TREE_PURPOSE is a
3623 TYPE_PACK_EXPANSION containing the bases that will be
3624 initialized. The TREE_VALUE will be identical to the
3625 original TREE_VALUE, which is a list of arguments that will
3626 be passed to each base. We do not introduce any new pack
3627 expansion nodes into the TREE_VALUE (although it is possible
3628 that some already exist), because the TREE_PURPOSE and
3629 TREE_VALUE all need to be expanded together with the same
3630 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3631 resulting TREE_PURPOSE will mention the parameter packs in
3632 both the bases and the arguments to the bases. */
3635 tree parameter_packs
= NULL_TREE
;
3637 /* Determine which parameter packs will be used by the base
3639 ppd
.visited
= new hash_set
<tree
>;
3640 ppd
.parameter_packs
= ¶meter_packs
;
3641 ppd
.type_pack_expansion_p
= true;
3642 gcc_assert (TYPE_P (TREE_PURPOSE (arg
)));
3643 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3646 if (parameter_packs
== NULL_TREE
)
3648 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3650 return error_mark_node
;
3653 if (TREE_VALUE (arg
) != void_type_node
)
3655 /* Collect the sets of parameter packs used in each of the
3656 initialization arguments. */
3657 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3659 /* Determine which parameter packs will be expanded in this
3661 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3668 /* Create the pack expansion type for the base type. */
3669 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3670 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3671 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3673 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3674 they will rarely be compared to anything. */
3675 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3677 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3680 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3683 /* Build the PACK_EXPANSION_* node. */
3685 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3686 : make_node (EXPR_PACK_EXPANSION
);
3687 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3688 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3690 /* Propagate type and const-expression information. */
3691 TREE_TYPE (result
) = TREE_TYPE (arg
);
3692 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3695 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3696 they will rarely be compared to anything. */
3697 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3699 /* Determine which parameter packs will be expanded. */
3700 ppd
.parameter_packs
= ¶meter_packs
;
3701 ppd
.visited
= new hash_set
<tree
>;
3702 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
3703 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3706 /* Make sure we found some parameter packs. */
3707 if (parameter_packs
== NULL_TREE
)
3710 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3712 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3713 return error_mark_node
;
3715 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3717 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3722 /* Checks T for any "bare" parameter packs, which have not yet been
3723 expanded, and issues an error if any are found. This operation can
3724 only be done on full expressions or types (e.g., an expression
3725 statement, "if" condition, etc.), because we could have expressions like:
3727 foo(f(g(h(args)))...)
3729 where "args" is a parameter pack. check_for_bare_parameter_packs
3730 should not be called for the subexpressions args, h(args),
3731 g(h(args)), or f(g(h(args))), because we would produce erroneous
3734 Returns TRUE and emits an error if there were bare parameter packs,
3735 returns FALSE otherwise. */
3737 check_for_bare_parameter_packs (tree t
)
3739 tree parameter_packs
= NULL_TREE
;
3740 struct find_parameter_pack_data ppd
;
3742 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3745 if (TREE_CODE (t
) == TYPE_DECL
)
3748 ppd
.parameter_packs
= ¶meter_packs
;
3749 ppd
.visited
= new hash_set
<tree
>;
3750 ppd
.type_pack_expansion_p
= false;
3751 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3754 if (parameter_packs
)
3756 error ("parameter packs not expanded with %<...%>:");
3757 while (parameter_packs
)
3759 tree pack
= TREE_VALUE (parameter_packs
);
3760 tree name
= NULL_TREE
;
3762 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3763 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3764 name
= TYPE_NAME (pack
);
3765 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3766 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3768 name
= DECL_NAME (pack
);
3771 inform (input_location
, " %qD", name
);
3773 inform (input_location
, " <anonymous>");
3775 parameter_packs
= TREE_CHAIN (parameter_packs
);
3784 /* Expand any parameter packs that occur in the template arguments in
3787 expand_template_argument_pack (tree args
)
3789 tree result_args
= NULL_TREE
;
3790 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3791 int num_result_args
= -1;
3792 int non_default_args_count
= -1;
3794 /* First, determine if we need to expand anything, and the number of
3795 slots we'll need. */
3796 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3798 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3799 if (arg
== NULL_TREE
)
3801 if (ARGUMENT_PACK_P (arg
))
3803 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3804 if (num_result_args
< 0)
3805 num_result_args
= in_arg
+ num_packed
;
3807 num_result_args
+= num_packed
;
3811 if (num_result_args
>= 0)
3816 /* If no expansion is necessary, we're done. */
3817 if (num_result_args
< 0)
3820 /* Expand arguments. */
3821 result_args
= make_tree_vec (num_result_args
);
3822 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3823 non_default_args_count
=
3824 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3825 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3827 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3828 if (ARGUMENT_PACK_P (arg
))
3830 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3831 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3832 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3833 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3834 if (non_default_args_count
> 0)
3835 non_default_args_count
+= num_packed
- 1;
3839 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3843 if (non_default_args_count
>= 0)
3844 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3848 /* Checks if DECL shadows a template parameter.
3850 [temp.local]: A template-parameter shall not be redeclared within its
3851 scope (including nested scopes).
3853 Emits an error and returns TRUE if the DECL shadows a parameter,
3854 returns FALSE otherwise. */
3857 check_template_shadow (tree decl
)
3861 /* If we're not in a template, we can't possibly shadow a template
3863 if (!current_template_parms
)
3866 /* Figure out what we're shadowing. */
3867 if (TREE_CODE (decl
) == OVERLOAD
)
3868 decl
= OVL_CURRENT (decl
);
3869 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3871 /* If there's no previous binding for this name, we're not shadowing
3872 anything, let alone a template parameter. */
3876 /* If we're not shadowing a template parameter, we're done. Note
3877 that OLDDECL might be an OVERLOAD (or perhaps even an
3878 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3880 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3883 /* We check for decl != olddecl to avoid bogus errors for using a
3884 name inside a class. We check TPFI to avoid duplicate errors for
3885 inline member templates. */
3887 || (DECL_TEMPLATE_PARM_P (decl
)
3888 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3891 /* Don't complain about the injected class name, as we've already
3892 complained about the class itself. */
3893 if (DECL_SELF_REFERENCE_P (decl
))
3896 if (DECL_TEMPLATE_PARM_P (decl
))
3897 error ("declaration of template parameter %q+D shadows "
3898 "template parameter", decl
);
3900 error ("declaration of %q+#D shadows template parameter", decl
);
3901 inform (DECL_SOURCE_LOCATION (olddecl
),
3902 "template parameter %qD declared here", olddecl
);
3906 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3907 ORIG_LEVEL, DECL, and TYPE. */
3910 build_template_parm_index (int index
,
3916 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3917 TEMPLATE_PARM_IDX (t
) = index
;
3918 TEMPLATE_PARM_LEVEL (t
) = level
;
3919 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3920 TEMPLATE_PARM_DECL (t
) = decl
;
3921 TREE_TYPE (t
) = type
;
3922 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3923 TREE_READONLY (t
) = TREE_READONLY (decl
);
3928 /* Find the canonical type parameter for the given template type
3929 parameter. Returns the canonical type parameter, which may be TYPE
3930 if no such parameter existed. */
3933 canonical_type_parameter (tree type
)
3936 int idx
= TEMPLATE_TYPE_IDX (type
);
3937 if (!canonical_template_parms
)
3938 vec_alloc (canonical_template_parms
, idx
+1);
3940 while (canonical_template_parms
->length () <= (unsigned)idx
)
3941 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3943 list
= (*canonical_template_parms
)[idx
];
3944 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3945 list
= TREE_CHAIN (list
);
3948 return TREE_VALUE (list
);
3951 (*canonical_template_parms
)[idx
]
3952 = tree_cons (NULL_TREE
, type
,
3953 (*canonical_template_parms
)[idx
]);
3958 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3959 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3960 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3961 new one is created. */
3964 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3965 tsubst_flags_t complain
)
3967 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3968 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3969 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3970 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3972 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3975 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3976 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3977 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3978 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3979 DECL_ARTIFICIAL (decl
) = 1;
3980 SET_DECL_TEMPLATE_PARM_P (decl
);
3982 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3983 TEMPLATE_PARM_LEVEL (index
) - levels
,
3984 TEMPLATE_PARM_ORIG_LEVEL (index
),
3986 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3987 TEMPLATE_PARM_PARAMETER_PACK (t
)
3988 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3990 /* Template template parameters need this. */
3991 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3993 DECL_TEMPLATE_RESULT (decl
)
3994 = build_decl (DECL_SOURCE_LOCATION (decl
),
3995 TYPE_DECL
, DECL_NAME (decl
), type
);
3996 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
3997 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3998 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
4002 return TEMPLATE_PARM_DESCENDANTS (index
);
4005 /* Process information from new template parameter PARM and append it
4006 to the LIST being built. This new parameter is a non-type
4007 parameter iff IS_NON_TYPE is true. This new parameter is a
4008 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4012 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4013 bool is_non_type
, bool is_parameter_pack
)
4018 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4019 tree defval
= TREE_PURPOSE (parm
);
4020 tree constr
= TREE_TYPE (parm
);
4024 tree p
= tree_last (list
);
4026 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4029 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4030 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4032 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4040 parm
= TREE_VALUE (parm
);
4042 SET_DECL_TEMPLATE_PARM_P (parm
);
4044 if (TREE_TYPE (parm
) != error_mark_node
)
4048 The top-level cv-qualifiers on the template-parameter are
4049 ignored when determining its type. */
4050 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4051 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4052 TREE_TYPE (parm
) = error_mark_node
;
4053 else if (uses_parameter_packs (TREE_TYPE (parm
))
4054 && !is_parameter_pack
4055 /* If we're in a nested template parameter list, the template
4056 template parameter could be a parameter pack. */
4057 && processing_template_parmlist
== 1)
4059 /* This template parameter is not a parameter pack, but it
4060 should be. Complain about "bare" parameter packs. */
4061 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4063 /* Recover by calling this a parameter pack. */
4064 is_parameter_pack
= true;
4068 /* A template parameter is not modifiable. */
4069 TREE_CONSTANT (parm
) = 1;
4070 TREE_READONLY (parm
) = 1;
4071 decl
= build_decl (parm_loc
,
4072 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4073 TREE_CONSTANT (decl
) = 1;
4074 TREE_READONLY (decl
) = 1;
4075 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4076 = build_template_parm_index (idx
, processing_template_decl
,
4077 processing_template_decl
,
4078 decl
, TREE_TYPE (parm
));
4080 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4081 = is_parameter_pack
;
4086 parm
= TREE_VALUE (TREE_VALUE (parm
));
4088 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4090 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4091 /* This is for distinguishing between real templates and template
4092 template parameters */
4093 TREE_TYPE (parm
) = t
;
4094 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4099 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4100 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4101 decl
= build_decl (parm_loc
,
4102 TYPE_DECL
, parm
, t
);
4105 TYPE_NAME (t
) = decl
;
4106 TYPE_STUB_DECL (t
) = decl
;
4108 TEMPLATE_TYPE_PARM_INDEX (t
)
4109 = build_template_parm_index (idx
, processing_template_decl
,
4110 processing_template_decl
,
4111 decl
, TREE_TYPE (parm
));
4112 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4113 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4115 DECL_ARTIFICIAL (decl
) = 1;
4116 SET_DECL_TEMPLATE_PARM_P (decl
);
4118 /* Build requirements for the type/template parameter.
4119 This must be done after SET_DECL_TEMPLATE_PARM_P or
4120 process_template_parm could fail. */
4121 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4125 /* Build the parameter node linking the parameter declaration,
4126 its default argument (if any), and its constraints (if any). */
4127 parm
= build_tree_list (defval
, parm
);
4128 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4130 return chainon (list
, parm
);
4133 /* The end of a template parameter list has been reached. Process the
4134 tree list into a parameter vector, converting each parameter into a more
4135 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4139 end_template_parm_list (tree parms
)
4143 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4145 /* Pop the dummy parameter level and add the real one. */
4146 current_template_parms
= TREE_CHAIN (current_template_parms
);
4148 current_template_parms
4149 = tree_cons (size_int (processing_template_decl
),
4150 saved_parmlist
, current_template_parms
);
4152 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4154 next
= TREE_CHAIN (parm
);
4155 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4156 TREE_CHAIN (parm
) = NULL_TREE
;
4159 --processing_template_parmlist
;
4161 return saved_parmlist
;
4164 // Explicitly indicate the end of the template parameter list. We assume
4165 // that the current template parameters have been constructed and/or
4166 // managed explicitly, as when creating new template template parameters
4167 // from a shorthand constraint.
4169 end_template_parm_list ()
4171 --processing_template_parmlist
;
4174 /* end_template_decl is called after a template declaration is seen. */
4177 end_template_decl (void)
4179 reset_specialization ();
4181 if (! processing_template_decl
)
4184 /* This matches the pushlevel in begin_template_parm_list. */
4187 --processing_template_decl
;
4188 current_template_parms
= TREE_CHAIN (current_template_parms
);
4191 /* Takes a TREE_LIST representing a template parameter and convert it
4192 into an argument suitable to be passed to the type substitution
4193 functions. Note that If the TREE_LIST contains an error_mark
4194 node, the returned argument is error_mark_node. */
4197 template_parm_to_arg (tree t
)
4201 || TREE_CODE (t
) != TREE_LIST
)
4204 if (error_operand_p (TREE_VALUE (t
)))
4205 return error_mark_node
;
4209 if (TREE_CODE (t
) == TYPE_DECL
4210 || TREE_CODE (t
) == TEMPLATE_DECL
)
4214 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4216 /* Turn this argument into a TYPE_ARGUMENT_PACK
4217 with a single element, which expands T. */
4218 tree vec
= make_tree_vec (1);
4220 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4222 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4224 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4225 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4230 t
= DECL_INITIAL (t
);
4232 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4234 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4235 with a single element, which expands T. */
4236 tree vec
= make_tree_vec (1);
4237 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4239 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4241 t
= convert_from_reference (t
);
4242 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4244 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4245 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4246 TREE_TYPE (t
) = type
;
4249 t
= convert_from_reference (t
);
4254 /* Given a set of template parameters, return them as a set of template
4255 arguments. The template parameters are represented as a TREE_VEC, in
4256 the form documented in cp-tree.h for template arguments. */
4259 template_parms_to_args (tree parms
)
4262 tree args
= NULL_TREE
;
4263 int length
= TMPL_PARMS_DEPTH (parms
);
4266 /* If there is only one level of template parameters, we do not
4267 create a TREE_VEC of TREE_VECs. Instead, we return a single
4268 TREE_VEC containing the arguments. */
4270 args
= make_tree_vec (length
);
4272 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4274 tree a
= copy_node (TREE_VALUE (header
));
4277 TREE_TYPE (a
) = NULL_TREE
;
4278 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4279 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4282 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4285 TREE_VEC_ELT (args
, --l
) = a
;
4293 /* Within the declaration of a template, return the currently active
4294 template parameters as an argument TREE_VEC. */
4297 current_template_args (void)
4299 return template_parms_to_args (current_template_parms
);
4302 /* Update the declared TYPE by doing any lookups which were thought to be
4303 dependent, but are not now that we know the SCOPE of the declarator. */
4306 maybe_update_decl_type (tree orig_type
, tree scope
)
4308 tree type
= orig_type
;
4310 if (type
== NULL_TREE
)
4313 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4314 type
= TREE_TYPE (type
);
4316 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4317 && dependent_type_p (type
)
4318 /* Don't bother building up the args in this case. */
4319 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4321 /* tsubst in the args corresponding to the template parameters,
4322 including auto if present. Most things will be unchanged, but
4323 make_typename_type and tsubst_qualified_id will resolve
4324 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4325 tree args
= current_template_args ();
4326 tree auto_node
= type_uses_auto (type
);
4330 tree auto_vec
= make_tree_vec (1);
4331 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4332 args
= add_to_template_args (args
, auto_vec
);
4334 pushed
= push_scope (scope
);
4335 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4340 if (type
== error_mark_node
)
4343 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4345 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4348 type
= TYPE_NAME (type
);
4353 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4354 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4355 the new template is a member template. */
4358 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4360 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4361 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4362 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4363 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4364 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4369 struct template_parm_data
4371 /* The level of the template parameters we are currently
4375 /* The index of the specialization argument we are currently
4379 /* An array whose size is the number of template parameters. The
4380 elements are nonzero if the parameter has been used in any one
4381 of the arguments processed so far. */
4384 /* An array whose size is the number of template arguments. The
4385 elements are nonzero if the argument makes use of template
4386 parameters of this level. */
4387 int* arg_uses_template_parms
;
4390 /* Subroutine of push_template_decl used to see if each template
4391 parameter in a partial specialization is used in the explicit
4392 argument list. If T is of the LEVEL given in DATA (which is
4393 treated as a template_parm_data*), then DATA->PARMS is marked
4397 mark_template_parm (tree t
, void* data
)
4401 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4403 template_parm_level_and_index (t
, &level
, &idx
);
4405 if (level
== tpd
->level
)
4407 tpd
->parms
[idx
] = 1;
4408 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4411 /* Return zero so that for_each_template_parm will continue the
4412 traversal of the tree; we want to mark *every* template parm. */
4416 /* Process the partial specialization DECL. */
4419 process_partial_specialization (tree decl
)
4421 tree type
= TREE_TYPE (decl
);
4422 tree tinfo
= get_template_info (decl
);
4423 tree maintmpl
= TI_TEMPLATE (tinfo
);
4424 tree specargs
= TI_ARGS (tinfo
);
4425 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4426 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4429 int nargs
= TREE_VEC_LENGTH (inner_args
);
4432 bool did_error_intro
= false;
4433 struct template_parm_data tpd
;
4434 struct template_parm_data tpd2
;
4436 gcc_assert (current_template_parms
);
4438 /* A concept cannot be specialized. */
4439 if (flag_concepts
&& variable_concept_p (maintmpl
))
4441 error ("specialization of variable concept %q#D", maintmpl
);
4442 return error_mark_node
;
4445 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4446 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4448 /* We check that each of the template parameters given in the
4449 partial specialization is used in the argument list to the
4450 specialization. For example:
4452 template <class T> struct S;
4453 template <class T> struct S<T*>;
4455 The second declaration is OK because `T*' uses the template
4456 parameter T, whereas
4458 template <class T> struct S<int>;
4460 is no good. Even trickier is:
4471 The S2<T> declaration is actually invalid; it is a
4472 full-specialization. Of course,
4475 struct S2<T (*)(U)>;
4477 or some such would have been OK. */
4478 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4479 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4480 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4482 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4483 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4484 for (i
= 0; i
< nargs
; ++i
)
4486 tpd
.current_arg
= i
;
4487 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4488 &mark_template_parm
,
4491 /*include_nondeduced_p=*/false);
4493 for (i
= 0; i
< ntparms
; ++i
)
4494 if (tpd
.parms
[i
] == 0)
4496 /* One of the template parms was not used in a deduced context in the
4498 if (!did_error_intro
)
4500 error ("template parameters not deducible in "
4501 "partial specialization:");
4502 did_error_intro
= true;
4505 inform (input_location
, " %qD",
4506 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4509 if (did_error_intro
)
4510 return error_mark_node
;
4512 /* [temp.class.spec]
4514 The argument list of the specialization shall not be identical to
4515 the implicit argument list of the primary template. */
4517 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4518 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4520 || !strictly_subsumes (current_template_constraints (),
4521 get_constraints (maintmpl
))))
4524 error ("partial specialization %q+D does not specialize "
4525 "any template arguments", decl
);
4527 error ("partial specialization %q+D does not specialize any "
4528 "template arguments and is not more constrained than", decl
);
4529 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4532 /* A partial specialization that replaces multiple parameters of the
4533 primary template with a pack expansion is less specialized for those
4535 if (nargs
< DECL_NTPARMS (maintmpl
))
4537 error ("partial specialization is not more specialized than the "
4538 "primary template because it replaces multiple parameters "
4539 "with a pack expansion");
4540 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4544 /* [temp.class.spec]
4546 A partially specialized non-type argument expression shall not
4547 involve template parameters of the partial specialization except
4548 when the argument expression is a simple identifier.
4550 The type of a template parameter corresponding to a specialized
4551 non-type argument shall not be dependent on a parameter of the
4554 Also, we verify that pack expansions only occur at the
4555 end of the argument list. */
4556 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4558 for (i
= 0; i
< nargs
; ++i
)
4560 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4561 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4562 tree packed_args
= NULL_TREE
;
4565 if (ARGUMENT_PACK_P (arg
))
4567 /* Extract the arguments from the argument pack. We'll be
4568 iterating over these in the following loop. */
4569 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4570 len
= TREE_VEC_LENGTH (packed_args
);
4573 for (j
= 0; j
< len
; j
++)
4576 /* Get the Jth argument in the parameter pack. */
4577 arg
= TREE_VEC_ELT (packed_args
, j
);
4579 if (PACK_EXPANSION_P (arg
))
4581 /* Pack expansions must come at the end of the
4583 if ((packed_args
&& j
< len
- 1)
4584 || (!packed_args
&& i
< nargs
- 1))
4586 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4587 error ("parameter pack argument %qE must be at the "
4588 "end of the template argument list", arg
);
4590 error ("parameter pack argument %qT must be at the "
4591 "end of the template argument list", arg
);
4595 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4596 /* We only care about the pattern. */
4597 arg
= PACK_EXPANSION_PATTERN (arg
);
4599 if (/* These first two lines are the `non-type' bit. */
4601 && TREE_CODE (arg
) != TEMPLATE_DECL
4602 /* This next two lines are the `argument expression is not just a
4603 simple identifier' condition and also the `specialized
4604 non-type argument' bit. */
4605 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4606 && !(REFERENCE_REF_P (arg
)
4607 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4609 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4610 || (packed_args
&& uses_template_parms (arg
)))
4611 error ("template argument %qE involves template parameter(s)",
4615 /* Look at the corresponding template parameter,
4616 marking which template parameters its type depends
4618 tree type
= TREE_TYPE (parm
);
4622 /* We haven't yet initialized TPD2. Do so now. */
4623 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4624 /* The number of parameters here is the number in the
4625 main template, which, as checked in the assertion
4627 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4629 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4632 /* Mark the template parameters. But this time, we're
4633 looking for the template parameters of the main
4634 template, not in the specialization. */
4635 tpd2
.current_arg
= i
;
4636 tpd2
.arg_uses_template_parms
[i
] = 0;
4637 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4638 for_each_template_parm (type
,
4639 &mark_template_parm
,
4642 /*include_nondeduced_p=*/false);
4644 if (tpd2
.arg_uses_template_parms
[i
])
4646 /* The type depended on some template parameters.
4647 If they are fully specialized in the
4648 specialization, that's OK. */
4651 for (j
= 0; j
< nargs
; ++j
)
4652 if (tpd2
.parms
[j
] != 0
4653 && tpd
.arg_uses_template_parms
[j
])
4656 error_n (input_location
, count
,
4657 "type %qT of template argument %qE depends "
4658 "on a template parameter",
4659 "type %qT of template argument %qE depends "
4660 "on template parameters",
4669 /* We should only get here once. */
4670 if (TREE_CODE (decl
) == TYPE_DECL
)
4671 gcc_assert (!COMPLETE_TYPE_P (type
));
4673 // Build the template decl.
4674 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4675 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4676 TREE_TYPE (tmpl
) = type
;
4677 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4678 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4679 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4680 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4683 /* We didn't register this in check_explicit_specialization so we could
4684 wait until the constraints were set. */
4685 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4687 associate_classtype_constraints (type
);
4689 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4690 = tree_cons (specargs
, tmpl
,
4691 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4692 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4694 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4695 inst
= TREE_CHAIN (inst
))
4697 tree instance
= TREE_VALUE (inst
);
4698 if (TYPE_P (instance
)
4699 ? (COMPLETE_TYPE_P (instance
)
4700 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4701 : DECL_TEMPLATE_INSTANTIATION (instance
))
4703 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4704 tree inst_decl
= (DECL_P (instance
)
4705 ? instance
: TYPE_NAME (instance
));
4708 else if (spec
== error_mark_node
)
4709 permerror (input_location
,
4710 "declaration of %qD ambiguates earlier template "
4711 "instantiation for %qD", decl
, inst_decl
);
4712 else if (TREE_VALUE (spec
) == tmpl
)
4713 permerror (input_location
,
4714 "partial specialization of %qD after instantiation "
4715 "of %qD", decl
, inst_decl
);
4722 /* PARM is a template parameter of some form; return the corresponding
4723 TEMPLATE_PARM_INDEX. */
4726 get_template_parm_index (tree parm
)
4728 if (TREE_CODE (parm
) == PARM_DECL
4729 || TREE_CODE (parm
) == CONST_DECL
)
4730 parm
= DECL_INITIAL (parm
);
4731 else if (TREE_CODE (parm
) == TYPE_DECL
4732 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4733 parm
= TREE_TYPE (parm
);
4734 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4735 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4736 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4737 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4738 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4742 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4743 parameter packs used by the template parameter PARM. */
4746 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4748 /* A type parm can't refer to another parm. */
4749 if (TREE_CODE (parm
) == TYPE_DECL
)
4751 else if (TREE_CODE (parm
) == PARM_DECL
)
4753 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4758 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4760 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4761 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4762 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4765 /* PARM is a template parameter pack. Return any parameter packs used in
4766 its type or the type of any of its template parameters. If there are
4767 any such packs, it will be instantiated into a fixed template parameter
4768 list by partial instantiation rather than be fully deduced. */
4771 fixed_parameter_pack_p (tree parm
)
4773 /* This can only be true in a member template. */
4774 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4776 /* This can only be true for a parameter pack. */
4777 if (!template_parameter_pack_p (parm
))
4779 /* A type parm can't refer to another parm. */
4780 if (TREE_CODE (parm
) == TYPE_DECL
)
4783 tree parameter_packs
= NULL_TREE
;
4784 struct find_parameter_pack_data ppd
;
4785 ppd
.parameter_packs
= ¶meter_packs
;
4786 ppd
.visited
= new hash_set
<tree
>;
4787 ppd
.type_pack_expansion_p
= false;
4789 fixed_parameter_pack_p_1 (parm
, &ppd
);
4792 return parameter_packs
;
4795 /* Check that a template declaration's use of default arguments and
4796 parameter packs is not invalid. Here, PARMS are the template
4797 parameters. IS_PRIMARY is true if DECL is the thing declared by
4798 a primary template. IS_PARTIAL is true if DECL is a partial
4801 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4802 declaration (but not a definition); 1 indicates a declaration, 2
4803 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4804 emitted for extraneous default arguments.
4806 Returns TRUE if there were no errors found, FALSE otherwise. */
4809 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4810 bool is_partial
, int is_friend_decl
)
4813 int last_level_to_check
;
4815 bool no_errors
= true;
4819 A default template-argument shall not be specified in a
4820 function template declaration or a function template definition, nor
4821 in the template-parameter-list of the definition of a member of a
4824 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4825 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4826 /* You can't have a function template declaration in a local
4827 scope, nor you can you define a member of a class template in a
4831 if ((TREE_CODE (decl
) == TYPE_DECL
4833 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4834 || (TREE_CODE (decl
) == FUNCTION_DECL
4835 && LAMBDA_FUNCTION_P (decl
)))
4836 /* A lambda doesn't have an explicit declaration; don't complain
4837 about the parms of the enclosing class. */
4840 if (current_class_type
4841 && !TYPE_BEING_DEFINED (current_class_type
)
4842 && DECL_LANG_SPECIFIC (decl
)
4843 && DECL_DECLARES_FUNCTION_P (decl
)
4844 /* If this is either a friend defined in the scope of the class
4845 or a member function. */
4846 && (DECL_FUNCTION_MEMBER_P (decl
)
4847 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4848 : DECL_FRIEND_CONTEXT (decl
)
4849 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4851 /* And, if it was a member function, it really was defined in
4852 the scope of the class. */
4853 && (!DECL_FUNCTION_MEMBER_P (decl
)
4854 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4855 /* We already checked these parameters when the template was
4856 declared, so there's no need to do it again now. This function
4857 was defined in class scope, but we're processing its body now
4858 that the class is complete. */
4861 /* Core issue 226 (C++0x only): the following only applies to class
4864 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4868 If a template-parameter has a default template-argument, all
4869 subsequent template-parameters shall have a default
4870 template-argument supplied. */
4871 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4873 tree inner_parms
= TREE_VALUE (parm_level
);
4874 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4875 int seen_def_arg_p
= 0;
4878 for (i
= 0; i
< ntparms
; ++i
)
4880 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4882 if (parm
== error_mark_node
)
4885 if (TREE_PURPOSE (parm
))
4887 else if (seen_def_arg_p
4888 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4890 error ("no default argument for %qD", TREE_VALUE (parm
));
4891 /* For better subsequent error-recovery, we indicate that
4892 there should have been a default argument. */
4893 TREE_PURPOSE (parm
) = error_mark_node
;
4896 else if (!is_partial
4898 /* Don't complain about an enclosing partial
4900 && parm_level
== parms
4901 && TREE_CODE (decl
) == TYPE_DECL
4903 && template_parameter_pack_p (TREE_VALUE (parm
))
4904 /* A fixed parameter pack will be partially
4905 instantiated into a fixed length list. */
4906 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4908 /* A primary class template can only have one
4909 parameter pack, at the end of the template
4912 error ("parameter pack %q+D must be at the end of the"
4913 " template parameter list", TREE_VALUE (parm
));
4915 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4923 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4927 /* For an ordinary class template, default template arguments are
4928 allowed at the innermost level, e.g.:
4929 template <class T = int>
4931 but, in a partial specialization, they're not allowed even
4932 there, as we have in [temp.class.spec]:
4934 The template parameter list of a specialization shall not
4935 contain default template argument values.
4937 So, for a partial specialization, or for a function template
4938 (in C++98/C++03), we look at all of them. */
4941 /* But, for a primary class template that is not a partial
4942 specialization we look at all template parameters except the
4944 parms
= TREE_CHAIN (parms
);
4946 /* Figure out what error message to issue. */
4947 if (is_friend_decl
== 2)
4948 msg
= G_("default template arguments may not be used in function template "
4949 "friend re-declaration");
4950 else if (is_friend_decl
)
4951 msg
= G_("default template arguments may not be used in function template "
4952 "friend declarations");
4953 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4954 msg
= G_("default template arguments may not be used in function templates "
4955 "without -std=c++11 or -std=gnu++11");
4956 else if (is_partial
)
4957 msg
= G_("default template arguments may not be used in "
4958 "partial specializations");
4959 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4960 msg
= G_("default argument for template parameter for class enclosing %qD");
4962 /* Per [temp.param]/9, "A default template-argument shall not be
4963 specified in the template-parameter-lists of the definition of
4964 a member of a class template that appears outside of the member's
4965 class.", thus if we aren't handling a member of a class template
4966 there is no need to examine the parameters. */
4969 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4970 /* If we're inside a class definition, there's no need to
4971 examine the parameters to the class itself. On the one
4972 hand, they will be checked when the class is defined, and,
4973 on the other, default arguments are valid in things like:
4974 template <class T = double>
4975 struct S { template <class U> void f(U); };
4976 Here the default argument for `S' has no bearing on the
4977 declaration of `f'. */
4978 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4980 /* Check everything. */
4981 last_level_to_check
= 0;
4983 for (parm_level
= parms
;
4984 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4985 parm_level
= TREE_CHAIN (parm_level
))
4987 tree inner_parms
= TREE_VALUE (parm_level
);
4991 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4992 for (i
= 0; i
< ntparms
; ++i
)
4994 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4997 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5002 if (is_friend_decl
== 2)
5009 /* Clear out the default argument so that we are not
5011 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5015 /* At this point, if we're still interested in issuing messages,
5016 they must apply to classes surrounding the object declared. */
5018 msg
= G_("default argument for template parameter for class "
5025 /* Worker for push_template_decl_real, called via
5026 for_each_template_parm. DATA is really an int, indicating the
5027 level of the parameters we are interested in. If T is a template
5028 parameter of that level, return nonzero. */
5031 template_parm_this_level_p (tree t
, void* data
)
5033 int this_level
= *(int *)data
;
5036 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5037 level
= TEMPLATE_PARM_LEVEL (t
);
5039 level
= TEMPLATE_TYPE_LEVEL (t
);
5040 return level
== this_level
;
5043 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5044 parameters given by current_template_args, or reuses a
5045 previously existing one, if appropriate. Returns the DECL, or an
5046 equivalent one, if it is replaced via a call to duplicate_decls.
5048 If IS_FRIEND is true, DECL is a friend declaration. */
5051 push_template_decl_real (tree decl
, bool is_friend
)
5059 int new_template_p
= 0;
5060 /* True if the template is a member template, in the sense of
5062 bool member_template_p
= false;
5064 if (decl
== error_mark_node
|| !current_template_parms
)
5065 return error_mark_node
;
5067 /* See if this is a partial specialization. */
5068 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5069 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5070 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5072 && DECL_LANG_SPECIFIC (decl
)
5073 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5074 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5076 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5080 /* For a friend, we want the context of the friend function, not
5081 the type of which it is a friend. */
5082 ctx
= CP_DECL_CONTEXT (decl
);
5083 else if (CP_DECL_CONTEXT (decl
)
5084 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5085 /* In the case of a virtual function, we want the class in which
5087 ctx
= CP_DECL_CONTEXT (decl
);
5089 /* Otherwise, if we're currently defining some class, the DECL
5090 is assumed to be a member of the class. */
5091 ctx
= current_scope ();
5093 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5096 if (!DECL_CONTEXT (decl
))
5097 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5099 /* See if this is a primary template. */
5100 if (is_friend
&& ctx
5101 && uses_template_parms_level (ctx
, processing_template_decl
))
5102 /* A friend template that specifies a class context, i.e.
5103 template <typename T> friend void A<T>::f();
5106 else if (TREE_CODE (decl
) == TYPE_DECL
5107 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5110 is_primary
= template_parm_scope_p ();
5114 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5116 if (DECL_CLASS_SCOPE_P (decl
))
5117 member_template_p
= true;
5118 if (TREE_CODE (decl
) == TYPE_DECL
5119 && anon_aggrname_p (DECL_NAME (decl
)))
5121 error ("template class without a name");
5122 return error_mark_node
;
5124 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5126 if (member_template_p
)
5128 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5129 error ("member template %qD may not have virt-specifiers", decl
);
5131 if (DECL_DESTRUCTOR_P (decl
))
5135 A destructor shall not be a member template. */
5136 error ("destructor %qD declared as member template", decl
);
5137 return error_mark_node
;
5139 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5140 && (!prototype_p (TREE_TYPE (decl
))
5141 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5142 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5143 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5144 == void_list_node
)))
5146 /* [basic.stc.dynamic.allocation]
5148 An allocation function can be a function
5149 template. ... Template allocation functions shall
5150 have two or more parameters. */
5151 error ("invalid template declaration of %qD", decl
);
5152 return error_mark_node
;
5155 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5156 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5158 else if (TREE_CODE (decl
) == TYPE_DECL
5159 && TYPE_DECL_ALIAS_P (decl
))
5160 /* alias-declaration */
5161 gcc_assert (!DECL_ARTIFICIAL (decl
));
5162 else if (VAR_P (decl
))
5163 /* C++14 variable template. */;
5166 error ("template declaration of %q#D", decl
);
5167 return error_mark_node
;
5171 /* Check to see that the rules regarding the use of default
5172 arguments are not being violated. */
5173 check_default_tmpl_args (decl
, current_template_parms
,
5174 is_primary
, is_partial
, /*is_friend_decl=*/0);
5176 /* Ensure that there are no parameter packs in the type of this
5177 declaration that have not been expanded. */
5178 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5180 /* Check each of the arguments individually to see if there are
5181 any bare parameter packs. */
5182 tree type
= TREE_TYPE (decl
);
5183 tree arg
= DECL_ARGUMENTS (decl
);
5184 tree argtype
= TYPE_ARG_TYPES (type
);
5186 while (arg
&& argtype
)
5188 if (!DECL_PACK_P (arg
)
5189 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5191 /* This is a PARM_DECL that contains unexpanded parameter
5192 packs. We have already complained about this in the
5193 check_for_bare_parameter_packs call, so just replace
5194 these types with ERROR_MARK_NODE. */
5195 TREE_TYPE (arg
) = error_mark_node
;
5196 TREE_VALUE (argtype
) = error_mark_node
;
5199 arg
= DECL_CHAIN (arg
);
5200 argtype
= TREE_CHAIN (argtype
);
5203 /* Check for bare parameter packs in the return type and the
5204 exception specifiers. */
5205 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5206 /* Errors were already issued, set return type to int
5207 as the frontend doesn't expect error_mark_node as
5209 TREE_TYPE (type
) = integer_type_node
;
5210 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5211 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5213 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5214 && TYPE_DECL_ALIAS_P (decl
))
5215 ? DECL_ORIGINAL_TYPE (decl
)
5216 : TREE_TYPE (decl
)))
5218 TREE_TYPE (decl
) = error_mark_node
;
5219 return error_mark_node
;
5223 return process_partial_specialization (decl
);
5225 args
= current_template_args ();
5228 || TREE_CODE (ctx
) == FUNCTION_DECL
5229 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5230 || (TREE_CODE (decl
) == TYPE_DECL
5231 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5232 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5234 if (DECL_LANG_SPECIFIC (decl
)
5235 && DECL_TEMPLATE_INFO (decl
)
5236 && DECL_TI_TEMPLATE (decl
))
5237 tmpl
= DECL_TI_TEMPLATE (decl
);
5238 /* If DECL is a TYPE_DECL for a class-template, then there won't
5239 be DECL_LANG_SPECIFIC. The information equivalent to
5240 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5241 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5242 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5243 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5245 /* Since a template declaration already existed for this
5246 class-type, we must be redeclaring it here. Make sure
5247 that the redeclaration is valid. */
5248 redeclare_class_template (TREE_TYPE (decl
),
5249 current_template_parms
,
5250 current_template_constraints ());
5251 /* We don't need to create a new TEMPLATE_DECL; just use the
5252 one we already had. */
5253 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5257 tmpl
= build_template_decl (decl
, current_template_parms
,
5261 if (DECL_LANG_SPECIFIC (decl
)
5262 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5264 /* A specialization of a member template of a template
5266 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5267 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5268 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5274 tree a
, t
, current
, parms
;
5276 tree tinfo
= get_template_info (decl
);
5280 error ("template definition of non-template %q#D", decl
);
5281 return error_mark_node
;
5284 tmpl
= TI_TEMPLATE (tinfo
);
5286 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5287 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5288 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5289 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5293 /* The declaration is a specialization of a member
5294 template, declared outside the class. Therefore, the
5295 innermost template arguments will be NULL, so we
5296 replace them with the arguments determined by the
5297 earlier call to check_explicit_specialization. */
5298 args
= DECL_TI_ARGS (decl
);
5301 = build_template_decl (decl
, current_template_parms
,
5303 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5304 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5305 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5306 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5307 DECL_TEMPLATE_INFO (new_tmpl
)
5308 = build_template_info (tmpl
, args
);
5310 register_specialization (new_tmpl
,
5311 most_general_template (tmpl
),
5317 /* Make sure the template headers we got make sense. */
5319 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5320 i
= TMPL_PARMS_DEPTH (parms
);
5321 if (TMPL_ARGS_DEPTH (args
) != i
)
5323 error ("expected %d levels of template parms for %q#D, got %d",
5324 i
, decl
, TMPL_ARGS_DEPTH (args
));
5325 DECL_INTERFACE_KNOWN (decl
) = 1;
5326 return error_mark_node
;
5329 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5331 a
= TMPL_ARGS_LEVEL (args
, i
);
5332 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5334 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5336 if (current
== decl
)
5337 error ("got %d template parameters for %q#D",
5338 TREE_VEC_LENGTH (a
), decl
);
5340 error ("got %d template parameters for %q#T",
5341 TREE_VEC_LENGTH (a
), current
);
5342 error (" but %d required", TREE_VEC_LENGTH (t
));
5343 /* Avoid crash in import_export_decl. */
5344 DECL_INTERFACE_KNOWN (decl
) = 1;
5345 return error_mark_node
;
5348 if (current
== decl
)
5350 else if (current
== NULL_TREE
)
5351 /* Can happen in erroneous input. */
5354 current
= get_containing_scope (current
);
5357 /* Check that the parms are used in the appropriate qualifying scopes
5358 in the declarator. */
5359 if (!comp_template_args
5361 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5364 template arguments to %qD do not match original template %qD",
5365 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5366 if (!uses_template_parms (TI_ARGS (tinfo
)))
5367 inform (input_location
, "use template<> for an explicit specialization");
5368 /* Avoid crash in import_export_decl. */
5369 DECL_INTERFACE_KNOWN (decl
) = 1;
5370 return error_mark_node
;
5374 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5375 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5377 /* Push template declarations for global functions and types. Note
5378 that we do not try to push a global template friend declared in a
5379 template class; such a thing may well depend on the template
5380 parameters of the class. */
5381 if (new_template_p
&& !ctx
5382 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5384 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5385 if (tmpl
== error_mark_node
)
5386 return error_mark_node
;
5388 /* Hide template friend classes that haven't been declared yet. */
5389 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5391 DECL_ANTICIPATED (tmpl
) = 1;
5392 DECL_FRIEND_P (tmpl
) = 1;
5398 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5401 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5402 if (DECL_CONV_FN_P (tmpl
))
5404 int depth
= TMPL_PARMS_DEPTH (parms
);
5406 /* It is a conversion operator. See if the type converted to
5407 depends on innermost template operands. */
5409 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5411 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5414 /* Give template template parms a DECL_CONTEXT of the template
5415 for which they are a parameter. */
5416 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5417 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5419 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5420 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5421 DECL_CONTEXT (parm
) = tmpl
;
5424 if (TREE_CODE (decl
) == TYPE_DECL
5425 && TYPE_DECL_ALIAS_P (decl
)
5426 && complex_alias_template_p (tmpl
))
5427 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5430 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5431 back to its most general template. If TMPL is a specialization,
5432 ARGS may only have the innermost set of arguments. Add the missing
5433 argument levels if necessary. */
5434 if (DECL_TEMPLATE_INFO (tmpl
))
5435 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5437 info
= build_template_info (tmpl
, args
);
5439 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5440 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5443 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5444 retrofit_lang_decl (decl
);
5445 if (DECL_LANG_SPECIFIC (decl
))
5446 DECL_TEMPLATE_INFO (decl
) = info
;
5449 if (flag_implicit_templates
5451 && TREE_PUBLIC (decl
)
5452 && VAR_OR_FUNCTION_DECL_P (decl
))
5453 /* Set DECL_COMDAT on template instantiations; if we force
5454 them to be emitted by explicit instantiation or -frepo,
5455 mark_needed will tell cgraph to do the right thing. */
5456 DECL_COMDAT (decl
) = true;
5458 return DECL_TEMPLATE_RESULT (tmpl
);
5462 push_template_decl (tree decl
)
5464 return push_template_decl_real (decl
, false);
5467 /* FN is an inheriting constructor that inherits from the constructor
5468 template INHERITED; turn FN into a constructor template with a matching
5472 add_inherited_template_parms (tree fn
, tree inherited
)
5475 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5476 inner_parms
= copy_node (inner_parms
);
5478 = tree_cons (size_int (processing_template_decl
+ 1),
5479 inner_parms
, current_template_parms
);
5480 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5481 tree args
= template_parms_to_args (parms
);
5482 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5483 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5484 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5485 DECL_ARTIFICIAL (tmpl
) = true;
5486 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5490 /* Called when a class template TYPE is redeclared with the indicated
5491 template PARMS, e.g.:
5493 template <class T> struct S;
5494 template <class T> struct S {}; */
5497 redeclare_class_template (tree type
, tree parms
, tree cons
)
5503 if (!TYPE_TEMPLATE_INFO (type
))
5505 error ("%qT is not a template type", type
);
5509 tmpl
= TYPE_TI_TEMPLATE (type
);
5510 if (!PRIMARY_TEMPLATE_P (tmpl
))
5511 /* The type is nested in some template class. Nothing to worry
5512 about here; there are no new template parameters for the nested
5518 error ("template specifiers not specified in declaration of %qD",
5523 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5524 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5526 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5528 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5529 "redeclared with %d template parameter",
5530 "redeclared with %d template parameters",
5531 TREE_VEC_LENGTH (parms
));
5532 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5533 "previous declaration %qD used %d template parameter",
5534 "previous declaration %qD used %d template parameters",
5535 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5539 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5546 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5547 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5550 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5551 if (error_operand_p (tmpl_parm
))
5554 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5555 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5556 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5558 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5560 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5561 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5562 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5563 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5564 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5565 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5566 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5567 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5568 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5570 error ("template parameter %q+#D", tmpl_parm
);
5571 error ("redeclared here as %q#D", parm
);
5575 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5577 /* We have in [temp.param]:
5579 A template-parameter may not be given default arguments
5580 by two different declarations in the same scope. */
5581 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5582 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5583 "original definition appeared here");
5587 if (parm_default
!= NULL_TREE
)
5588 /* Update the previous template parameters (which are the ones
5589 that will really count) with the new default value. */
5590 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5591 else if (tmpl_default
!= NULL_TREE
)
5592 /* Update the new parameters, too; they'll be used as the
5593 parameters for any members. */
5594 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5596 /* Give each template template parm in this redeclaration a
5597 DECL_CONTEXT of the template for which they are a parameter. */
5598 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5600 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5601 DECL_CONTEXT (parm
) = tmpl
;
5605 // Cannot redeclare a class template with a different set of constraints.
5606 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5608 error_at (input_location
, "redeclaration %q#D with different "
5609 "constraints", tmpl
);
5610 inform (DECL_SOURCE_LOCATION (tmpl
),
5611 "original declaration appeared here");
5617 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5618 to be used when the caller has already checked
5619 (processing_template_decl
5620 && !instantiation_dependent_expression_p (expr)
5621 && potential_constant_expression (expr))
5622 and cleared processing_template_decl. */
5625 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5627 return tsubst_copy_and_build (expr
,
5630 /*in_decl=*/NULL_TREE
,
5631 /*function_p=*/false,
5632 /*integral_constant_expression_p=*/true);
5635 /* Simplify EXPR if it is a non-dependent expression. Returns the
5636 (possibly simplified) expression. */
5639 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5641 if (expr
== NULL_TREE
)
5644 /* If we're in a template, but EXPR isn't value dependent, simplify
5645 it. We're supposed to treat:
5647 template <typename T> void f(T[1 + 1]);
5648 template <typename T> void f(T[2]);
5650 as two declarations of the same function, for example. */
5651 if (processing_template_decl
5652 && !instantiation_dependent_expression_p (expr
)
5653 && potential_constant_expression (expr
))
5655 processing_template_decl_sentinel s
;
5656 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5662 instantiate_non_dependent_expr (tree expr
)
5664 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5667 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
5668 an uninstantiated expression. */
5671 instantiate_non_dependent_or_null (tree expr
)
5673 if (expr
== NULL_TREE
)
5675 if (processing_template_decl
)
5677 if (instantiation_dependent_expression_p (expr
)
5678 || !potential_constant_expression (expr
))
5682 processing_template_decl_sentinel s
;
5683 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
5689 /* True iff T is a specialization of a variable template. */
5692 variable_template_specialization_p (tree t
)
5694 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5696 tree tmpl
= DECL_TI_TEMPLATE (t
);
5697 return variable_template_p (tmpl
);
5700 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5701 template declaration, or a TYPE_DECL for an alias declaration. */
5704 alias_type_or_template_p (tree t
)
5708 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5711 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5712 || DECL_ALIAS_TEMPLATE_P (t
));
5715 /* Return TRUE iff T is a specialization of an alias template. */
5718 alias_template_specialization_p (const_tree t
)
5720 /* It's an alias template specialization if it's an alias and its
5721 TYPE_NAME is a specialization of a primary template. */
5722 if (TYPE_ALIAS_P (t
))
5724 tree name
= TYPE_NAME (t
);
5725 if (DECL_LANG_SPECIFIC (name
))
5726 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5728 tree tmpl
= TI_TEMPLATE (ti
);
5729 return PRIMARY_TEMPLATE_P (tmpl
);
5735 /* An alias template is complex from a SFINAE perspective if a template-id
5736 using that alias can be ill-formed when the expansion is not, as with
5737 the void_t template. We determine this by checking whether the
5738 expansion for the alias template uses all its template parameters. */
5740 struct uses_all_template_parms_data
5747 uses_all_template_parms_r (tree t
, void *data_
)
5749 struct uses_all_template_parms_data
&data
5750 = *(struct uses_all_template_parms_data
*)data_
;
5751 tree idx
= get_template_parm_index (t
);
5753 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5754 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5759 complex_alias_template_p (const_tree tmpl
)
5761 struct uses_all_template_parms_data data
;
5762 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5763 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5764 data
.level
= TMPL_PARMS_DEPTH (parms
);
5765 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5766 data
.seen
= XALLOCAVEC (bool, len
);
5767 for (int i
= 0; i
< len
; ++i
)
5768 data
.seen
[i
] = false;
5770 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5771 for (int i
= 0; i
< len
; ++i
)
5777 /* Return TRUE iff T is a specialization of a complex alias template with
5778 dependent template-arguments. */
5781 dependent_alias_template_spec_p (const_tree t
)
5783 return (alias_template_specialization_p (t
)
5784 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5785 && (any_dependent_template_arguments_p
5786 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5789 /* Return the number of innermost template parameters in TMPL. */
5792 num_innermost_template_parms (tree tmpl
)
5794 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5795 return TREE_VEC_LENGTH (parms
);
5798 /* Return either TMPL or another template that it is equivalent to under DR
5799 1286: An alias that just changes the name of a template is equivalent to
5800 the other template. */
5803 get_underlying_template (tree tmpl
)
5805 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5806 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5808 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5809 if (TYPE_TEMPLATE_INFO (result
))
5811 tree sub
= TYPE_TI_TEMPLATE (result
);
5812 if (PRIMARY_TEMPLATE_P (sub
)
5813 && (num_innermost_template_parms (tmpl
)
5814 == num_innermost_template_parms (sub
)))
5816 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5817 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5818 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5820 /* The alias type is equivalent to the pattern of the
5821 underlying template, so strip the alias. */
5831 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5832 must be a function or a pointer-to-function type, as specified
5833 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5834 and check that the resulting function has external linkage. */
5837 convert_nontype_argument_function (tree type
, tree expr
,
5838 tsubst_flags_t complain
)
5842 linkage_kind linkage
;
5844 fn
= instantiate_type (type
, fns
, tf_none
);
5845 if (fn
== error_mark_node
)
5846 return error_mark_node
;
5849 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5850 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5851 if (BASELINK_P (fn_no_ptr
))
5852 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5854 /* [temp.arg.nontype]/1
5856 A template-argument for a non-type, non-template template-parameter
5859 -- the address of an object or function with external [C++11: or
5860 internal] linkage. */
5862 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5864 if (complain
& tf_error
)
5866 error ("%qE is not a valid template argument for type %qT",
5868 if (TYPE_PTR_P (type
))
5869 error ("it must be the address of a function with "
5870 "external linkage");
5872 error ("it must be the name of a function with "
5873 "external linkage");
5878 linkage
= decl_linkage (fn_no_ptr
);
5879 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5881 if (complain
& tf_error
)
5883 if (cxx_dialect
>= cxx11
)
5884 error ("%qE is not a valid template argument for type %qT "
5885 "because %qD has no linkage",
5886 expr
, type
, fn_no_ptr
);
5888 error ("%qE is not a valid template argument for type %qT "
5889 "because %qD does not have external linkage",
5890 expr
, type
, fn_no_ptr
);
5898 /* Subroutine of convert_nontype_argument.
5899 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5900 Emit an error otherwise. */
5903 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5904 tsubst_flags_t complain
)
5907 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5909 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5911 if (processing_template_decl
5912 && TREE_CODE (expr
) == ADDR_EXPR
5913 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5915 if (complain
& tf_error
)
5917 error ("%qE is not a valid template argument for type %qT",
5919 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5924 /* Returns TRUE iff the address of OP is value-dependent.
5926 14.6.2.4 [temp.dep.temp]:
5927 A non-integral non-type template-argument is dependent if its type is
5928 dependent or it has either of the following forms
5931 and contains a nested-name-specifier which specifies a class-name that
5932 names a dependent type.
5934 We generalize this to just say that the address of a member of a
5935 dependent class is value-dependent; the above doesn't cover the
5936 address of a static data member named with an unqualified-id. */
5939 has_value_dependent_address (tree op
)
5941 /* We could use get_inner_reference here, but there's no need;
5942 this is only relevant for template non-type arguments, which
5943 can only be expressed as &id-expression. */
5946 tree ctx
= CP_DECL_CONTEXT (op
);
5947 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5954 /* The next set of functions are used for providing helpful explanatory
5955 diagnostics for failed overload resolution. Their messages should be
5956 indented by two spaces for consistency with the messages in
5960 unify_success (bool /*explain_p*/)
5966 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5969 inform (input_location
,
5970 " couldn't deduce template parameter %qD", parm
);
5975 unify_invalid (bool /*explain_p*/)
5981 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5984 inform (input_location
,
5985 " types %qT and %qT have incompatible cv-qualifiers",
5991 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5994 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5999 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6002 inform (input_location
,
6003 " template parameter %qD is not a parameter pack, but "
6010 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6013 inform (input_location
,
6014 " template argument %qE does not match "
6015 "pointer-to-member constant %qE",
6021 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6024 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6029 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6032 inform (input_location
,
6033 " inconsistent parameter pack deduction with %qT and %qT",
6039 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6044 inform (input_location
,
6045 " deduced conflicting types for parameter %qT (%qT and %qT)",
6046 parm
, first
, second
);
6048 inform (input_location
,
6049 " deduced conflicting values for non-type parameter "
6050 "%qE (%qE and %qE)", parm
, first
, second
);
6056 unify_vla_arg (bool explain_p
, tree arg
)
6059 inform (input_location
,
6060 " variable-sized array type %qT is not "
6061 "a valid template argument",
6067 unify_method_type_error (bool explain_p
, tree arg
)
6070 inform (input_location
,
6071 " member function type %qT is not a valid template argument",
6077 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6082 inform_n (input_location
, wanted
,
6083 " candidate expects at least %d argument, %d provided",
6084 " candidate expects at least %d arguments, %d provided",
6087 inform_n (input_location
, wanted
,
6088 " candidate expects %d argument, %d provided",
6089 " candidate expects %d arguments, %d provided",
6096 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6098 return unify_arity (explain_p
, have
, wanted
);
6102 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6103 bool least_p
= false)
6105 return unify_arity (explain_p
, have
, wanted
, least_p
);
6109 unify_arg_conversion (bool explain_p
, tree to_type
,
6110 tree from_type
, tree arg
)
6113 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6114 " cannot convert %qE (type %qT) to type %qT",
6115 arg
, from_type
, to_type
);
6120 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6121 tree parm
, tree arg
)
6126 case tbr_ambiguous_baseclass
:
6127 inform (input_location
, " %qT is an ambiguous base class of %qT",
6131 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6138 unify_inconsistent_template_template_parameters (bool explain_p
)
6141 inform (input_location
,
6142 " template parameters of a template template argument are "
6143 "inconsistent with other deduced template arguments");
6148 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6151 inform (input_location
,
6152 " can't deduce a template for %qT from non-template type %qT",
6158 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6161 inform (input_location
,
6162 " template argument %qE does not match %qD", arg
, parm
);
6167 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6170 inform (input_location
,
6171 " could not resolve address from overloaded function %qE",
6176 /* Attempt to convert the non-type template parameter EXPR to the
6177 indicated TYPE. If the conversion is successful, return the
6178 converted value. If the conversion is unsuccessful, return
6179 NULL_TREE if we issued an error message, or error_mark_node if we
6180 did not. We issue error messages for out-and-out bad template
6181 parameters, but not simply because the conversion failed, since we
6182 might be just trying to do argument deduction. Both TYPE and EXPR
6183 must be non-dependent.
6185 The conversion follows the special rules described in
6186 [temp.arg.nontype], and it is much more strict than an implicit
6189 This function is called twice for each template argument (see
6190 lookup_template_class for a more accurate description of this
6191 problem). This means that we need to handle expressions which
6192 are not valid in a C++ source, but can be created from the
6193 first call (for instance, casts to perform conversions). These
6194 hacks can go away after we fix the double coercion problem. */
6197 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6201 /* Detect immediately string literals as invalid non-type argument.
6202 This special-case is not needed for correctness (we would easily
6203 catch this later), but only to provide better diagnostic for this
6204 common user mistake. As suggested by DR 100, we do not mention
6205 linkage issues in the diagnostic as this is not the point. */
6206 /* FIXME we're making this OK. */
6207 if (TREE_CODE (expr
) == STRING_CST
)
6209 if (complain
& tf_error
)
6210 error ("%qE is not a valid template argument for type %qT "
6211 "because string literals can never be used in this context",
6216 /* Add the ADDR_EXPR now for the benefit of
6217 value_dependent_expression_p. */
6218 if (TYPE_PTROBV_P (type
)
6219 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6221 expr
= decay_conversion (expr
, complain
);
6222 if (expr
== error_mark_node
)
6223 return error_mark_node
;
6226 /* If we are in a template, EXPR may be non-dependent, but still
6227 have a syntactic, rather than semantic, form. For example, EXPR
6228 might be a SCOPE_REF, rather than the VAR_DECL to which the
6229 SCOPE_REF refers. Preserving the qualifying scope is necessary
6230 so that access checking can be performed when the template is
6231 instantiated -- but here we need the resolved form so that we can
6232 convert the argument. */
6233 bool non_dep
= false;
6234 if (TYPE_REF_OBJ_P (type
)
6235 && has_value_dependent_address (expr
))
6236 /* If we want the address and it's value-dependent, don't fold. */;
6237 else if (!type_unknown_p (expr
)
6238 && processing_template_decl
6239 && !instantiation_dependent_expression_p (expr
)
6240 && potential_constant_expression (expr
))
6242 if (error_operand_p (expr
))
6243 return error_mark_node
;
6244 expr_type
= TREE_TYPE (expr
);
6245 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6246 expr
= mark_lvalue_use (expr
);
6248 expr
= mark_rvalue_use (expr
);
6250 /* If the argument is non-dependent, perform any conversions in
6251 non-dependent context as well. */
6252 processing_template_decl_sentinel
s (non_dep
);
6254 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6256 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6257 to a non-type argument of "nullptr". */
6258 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6259 expr
= fold_simple (convert (type
, expr
));
6261 /* In C++11, integral or enumeration non-type template arguments can be
6262 arbitrary constant expressions. Pointer and pointer to
6263 member arguments can be general constant expressions that evaluate
6264 to a null value, but otherwise still need to be of a specific form. */
6265 if (cxx_dialect
>= cxx11
)
6267 if (TREE_CODE (expr
) == PTRMEM_CST
)
6268 /* A PTRMEM_CST is already constant, and a valid template
6269 argument for a parameter of pointer to member type, we just want
6270 to leave it in that form rather than lower it to a
6272 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6273 expr
= maybe_constant_value (expr
);
6274 else if (cxx_dialect
>= cxx1z
)
6276 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6277 expr
= maybe_constant_value (expr
);
6278 else if (REFERENCE_REF_P (expr
))
6280 expr
= TREE_OPERAND (expr
, 0);
6281 expr
= maybe_constant_value (expr
);
6282 expr
= convert_from_reference (expr
);
6285 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6287 tree folded
= maybe_constant_value (expr
);
6288 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6289 : null_member_pointer_value_p (folded
))
6294 /* HACK: Due to double coercion, we can get a
6295 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6296 which is the tree that we built on the first call (see
6297 below when coercing to reference to object or to reference to
6298 function). We just strip everything and get to the arg.
6299 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6301 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6303 tree probe_type
, probe
= expr
;
6304 if (REFERENCE_REF_P (probe
))
6305 probe
= TREE_OPERAND (probe
, 0);
6306 probe_type
= TREE_TYPE (probe
);
6307 if (TREE_CODE (probe
) == NOP_EXPR
)
6309 /* ??? Maybe we could use convert_from_reference here, but we
6310 would need to relax its constraints because the NOP_EXPR
6311 could actually change the type to something more cv-qualified,
6312 and this is not folded by convert_from_reference. */
6313 tree addr
= TREE_OPERAND (probe
, 0);
6314 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6315 && TREE_CODE (addr
) == ADDR_EXPR
6316 && TYPE_PTR_P (TREE_TYPE (addr
))
6317 && (same_type_ignoring_top_level_qualifiers_p
6318 (TREE_TYPE (probe_type
),
6319 TREE_TYPE (TREE_TYPE (addr
)))))
6321 expr
= TREE_OPERAND (addr
, 0);
6322 expr_type
= TREE_TYPE (probe_type
);
6327 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6328 parameter is a pointer to object, through decay and
6329 qualification conversion. Let's strip everything. */
6330 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6334 if (TREE_CODE (probe
) == ADDR_EXPR
6335 && TYPE_PTR_P (TREE_TYPE (probe
)))
6337 /* Skip the ADDR_EXPR only if it is part of the decay for
6338 an array. Otherwise, it is part of the original argument
6339 in the source code. */
6340 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6341 probe
= TREE_OPERAND (probe
, 0);
6343 expr_type
= TREE_TYPE (expr
);
6347 /* [temp.arg.nontype]/5, bullet 1
6349 For a non-type template-parameter of integral or enumeration type,
6350 integral promotions (_conv.prom_) and integral conversions
6351 (_conv.integral_) are applied. */
6352 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6354 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6355 t
= maybe_constant_value (t
);
6356 if (t
!= error_mark_node
)
6359 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6360 return error_mark_node
;
6362 /* Notice that there are constant expressions like '4 % 0' which
6363 do not fold into integer constants. */
6364 if (TREE_CODE (expr
) != INTEGER_CST
)
6366 if (complain
& tf_error
)
6368 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6369 if (processing_template_decl
6370 && !require_potential_constant_expression (expr
))
6372 expr
= cxx_constant_value (expr
);
6373 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6374 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6375 "in template argument for type %qT ", type
);
6376 if (expr
== error_mark_node
)
6378 /* else cxx_constant_value complained but gave us
6379 a real constant, so go ahead. */
6380 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6386 /* Avoid typedef problems. */
6387 if (TREE_TYPE (expr
) != type
)
6388 expr
= fold_convert (type
, expr
);
6390 /* [temp.arg.nontype]/5, bullet 2
6392 For a non-type template-parameter of type pointer to object,
6393 qualification conversions (_conv.qual_) and the array-to-pointer
6394 conversion (_conv.array_) are applied. */
6395 else if (TYPE_PTROBV_P (type
))
6397 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6399 A template-argument for a non-type, non-template template-parameter
6400 shall be one of: [...]
6402 -- the name of a non-type template-parameter;
6403 -- the address of an object or function with external linkage, [...]
6404 expressed as "& id-expression" where the & is optional if the name
6405 refers to a function or array, or if the corresponding
6406 template-parameter is a reference.
6408 Here, we do not care about functions, as they are invalid anyway
6409 for a parameter of type pointer-to-object. */
6411 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6412 /* Non-type template parameters are OK. */
6414 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6415 /* Null pointer values are OK in C++11. */;
6416 else if (TREE_CODE (expr
) != ADDR_EXPR
6417 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6421 if (complain
& tf_error
)
6422 error ("%qD is not a valid template argument "
6423 "because %qD is a variable, not the address of "
6424 "a variable", expr
, expr
);
6427 if (POINTER_TYPE_P (expr_type
))
6429 if (complain
& tf_error
)
6430 error ("%qE is not a valid template argument for %qT "
6431 "because it is not the address of a variable",
6435 /* Other values, like integer constants, might be valid
6436 non-type arguments of some other type. */
6437 return error_mark_node
;
6443 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6444 ? TREE_OPERAND (expr
, 0) : expr
);
6447 if (complain
& tf_error
)
6448 error ("%qE is not a valid template argument of type %qT "
6449 "because %qE is not a variable", expr
, type
, decl
);
6452 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6454 if (complain
& tf_error
)
6455 error ("%qE is not a valid template argument of type %qT "
6456 "because %qD does not have external linkage",
6460 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6462 if (complain
& tf_error
)
6463 error ("%qE is not a valid template argument of type %qT "
6464 "because %qD has no linkage", expr
, type
, decl
);
6469 expr
= decay_conversion (expr
, complain
);
6470 if (expr
== error_mark_node
)
6471 return error_mark_node
;
6473 expr
= perform_qualification_conversions (type
, expr
);
6474 if (expr
== error_mark_node
)
6475 return error_mark_node
;
6477 /* [temp.arg.nontype]/5, bullet 3
6479 For a non-type template-parameter of type reference to object, no
6480 conversions apply. The type referred to by the reference may be more
6481 cv-qualified than the (otherwise identical) type of the
6482 template-argument. The template-parameter is bound directly to the
6483 template-argument, which must be an lvalue. */
6484 else if (TYPE_REF_OBJ_P (type
))
6486 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6488 return error_mark_node
;
6490 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6492 if (complain
& tf_error
)
6493 error ("%qE is not a valid template argument for type %qT "
6494 "because of conflicts in cv-qualification", expr
, type
);
6498 if (!real_lvalue_p (expr
))
6500 if (complain
& tf_error
)
6501 error ("%qE is not a valid template argument for type %qT "
6502 "because it is not an lvalue", expr
, type
);
6506 /* [temp.arg.nontype]/1
6508 A template-argument for a non-type, non-template template-parameter
6509 shall be one of: [...]
6511 -- the address of an object or function with external linkage. */
6512 if (INDIRECT_REF_P (expr
)
6513 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6515 expr
= TREE_OPERAND (expr
, 0);
6518 if (complain
& tf_error
)
6519 error ("%q#D is not a valid template argument for type %qT "
6520 "because a reference variable does not have a constant "
6521 "address", expr
, type
);
6528 if (complain
& tf_error
)
6529 error ("%qE is not a valid template argument for type %qT "
6530 "because it is not an object with linkage",
6535 /* DR 1155 allows internal linkage in C++11 and up. */
6536 linkage_kind linkage
= decl_linkage (expr
);
6537 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6539 if (complain
& tf_error
)
6540 error ("%qE is not a valid template argument for type %qT "
6541 "because object %qD does not have linkage",
6546 expr
= build_nop (type
, build_address (expr
));
6548 /* [temp.arg.nontype]/5, bullet 4
6550 For a non-type template-parameter of type pointer to function, only
6551 the function-to-pointer conversion (_conv.func_) is applied. If the
6552 template-argument represents a set of overloaded functions (or a
6553 pointer to such), the matching function is selected from the set
6555 else if (TYPE_PTRFN_P (type
))
6557 /* If the argument is a template-id, we might not have enough
6558 context information to decay the pointer. */
6559 if (!type_unknown_p (expr_type
))
6561 expr
= decay_conversion (expr
, complain
);
6562 if (expr
== error_mark_node
)
6563 return error_mark_node
;
6566 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6567 /* Null pointer values are OK in C++11. */
6568 return perform_qualification_conversions (type
, expr
);
6570 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6571 if (!expr
|| expr
== error_mark_node
)
6574 /* [temp.arg.nontype]/5, bullet 5
6576 For a non-type template-parameter of type reference to function, no
6577 conversions apply. If the template-argument represents a set of
6578 overloaded functions, the matching function is selected from the set
6580 else if (TYPE_REFFN_P (type
))
6582 if (TREE_CODE (expr
) == ADDR_EXPR
)
6584 if (complain
& tf_error
)
6586 error ("%qE is not a valid template argument for type %qT "
6587 "because it is a pointer", expr
, type
);
6588 inform (input_location
, "try using %qE instead",
6589 TREE_OPERAND (expr
, 0));
6594 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6595 if (!expr
|| expr
== error_mark_node
)
6598 expr
= build_nop (type
, build_address (expr
));
6600 /* [temp.arg.nontype]/5, bullet 6
6602 For a non-type template-parameter of type pointer to member function,
6603 no conversions apply. If the template-argument represents a set of
6604 overloaded member functions, the matching member function is selected
6605 from the set (_over.over_). */
6606 else if (TYPE_PTRMEMFUNC_P (type
))
6608 expr
= instantiate_type (type
, expr
, tf_none
);
6609 if (expr
== error_mark_node
)
6610 return error_mark_node
;
6612 /* [temp.arg.nontype] bullet 1 says the pointer to member
6613 expression must be a pointer-to-member constant. */
6614 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6615 return error_mark_node
;
6617 /* There is no way to disable standard conversions in
6618 resolve_address_of_overloaded_function (called by
6619 instantiate_type). It is possible that the call succeeded by
6620 converting &B::I to &D::I (where B is a base of D), so we need
6621 to reject this conversion here.
6623 Actually, even if there was a way to disable standard conversions,
6624 it would still be better to reject them here so that we can
6625 provide a superior diagnostic. */
6626 if (!same_type_p (TREE_TYPE (expr
), type
))
6628 if (complain
& tf_error
)
6630 error ("%qE is not a valid template argument for type %qT "
6631 "because it is of type %qT", expr
, type
,
6633 /* If we are just one standard conversion off, explain. */
6634 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6635 inform (input_location
,
6636 "standard conversions are not allowed in this context");
6641 /* [temp.arg.nontype]/5, bullet 7
6643 For a non-type template-parameter of type pointer to data member,
6644 qualification conversions (_conv.qual_) are applied. */
6645 else if (TYPE_PTRDATAMEM_P (type
))
6647 /* [temp.arg.nontype] bullet 1 says the pointer to member
6648 expression must be a pointer-to-member constant. */
6649 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6650 return error_mark_node
;
6652 expr
= perform_qualification_conversions (type
, expr
);
6653 if (expr
== error_mark_node
)
6656 else if (NULLPTR_TYPE_P (type
))
6658 if (expr
!= nullptr_node
)
6660 if (complain
& tf_error
)
6661 error ("%qE is not a valid template argument for type %qT "
6662 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6667 /* A template non-type parameter must be one of the above. */
6671 /* Sanity check: did we actually convert the argument to the
6673 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6674 (type
, TREE_TYPE (expr
)));
6675 return convert_from_reference (expr
);
6678 /* Subroutine of coerce_template_template_parms, which returns 1 if
6679 PARM_PARM and ARG_PARM match using the rule for the template
6680 parameters of template template parameters. Both PARM and ARG are
6681 template parameters; the rest of the arguments are the same as for
6682 coerce_template_template_parms.
6685 coerce_template_template_parm (tree parm
,
6687 tsubst_flags_t complain
,
6691 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6692 || parm
== NULL_TREE
|| error_operand_p (parm
))
6695 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6698 switch (TREE_CODE (parm
))
6701 /* We encounter instantiations of templates like
6702 template <template <template <class> class> class TT>
6705 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6706 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6708 if (!coerce_template_template_parms
6709 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6715 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6716 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6717 /* Argument is a parameter pack but parameter is not. */
6722 /* The tsubst call is used to handle cases such as
6724 template <int> class C {};
6725 template <class T, template <T> class TT> class D {};
6728 i.e. the parameter list of TT depends on earlier parameters. */
6729 if (!uses_template_parms (TREE_TYPE (arg
)))
6731 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6732 if (!uses_template_parms (t
)
6733 && !same_type_p (t
, TREE_TYPE (arg
)))
6737 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6738 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6739 /* Argument is a parameter pack but parameter is not. */
6752 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6753 template template parameters. Both PARM_PARMS and ARG_PARMS are
6754 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6757 Consider the example:
6758 template <class T> class A;
6759 template<template <class U> class TT> class B;
6761 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6762 the parameters to A, and OUTER_ARGS contains A. */
6765 coerce_template_template_parms (tree parm_parms
,
6767 tsubst_flags_t complain
,
6771 int nparms
, nargs
, i
;
6775 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6776 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6778 nparms
= TREE_VEC_LENGTH (parm_parms
);
6779 nargs
= TREE_VEC_LENGTH (arg_parms
);
6781 /* Determine whether we have a parameter pack at the end of the
6782 template template parameter's template parameter list. */
6783 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6785 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6787 if (error_operand_p (parm
))
6790 switch (TREE_CODE (parm
))
6794 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6799 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6809 && !(variadic_p
&& nargs
>= nparms
- 1))
6812 /* Check all of the template parameters except the parameter pack at
6813 the end (if any). */
6814 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6816 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6817 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6820 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6821 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6823 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6831 /* Check each of the template parameters in the template
6832 argument against the template parameter pack at the end of
6833 the template template parameter. */
6834 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6837 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6839 for (; i
< nargs
; ++i
)
6841 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6844 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6846 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6855 /* Verifies that the deduced template arguments (in TARGS) for the
6856 template template parameters (in TPARMS) represent valid bindings,
6857 by comparing the template parameter list of each template argument
6858 to the template parameter list of its corresponding template
6859 template parameter, in accordance with DR150. This
6860 routine can only be called after all template arguments have been
6861 deduced. It will return TRUE if all of the template template
6862 parameter bindings are okay, FALSE otherwise. */
6864 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6866 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6869 /* We're dealing with template parms in this process. */
6870 ++processing_template_decl
;
6872 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6874 for (i
= 0; i
< ntparms
; ++i
)
6876 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6877 tree targ
= TREE_VEC_ELT (targs
, i
);
6879 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6881 tree packed_args
= NULL_TREE
;
6884 if (ARGUMENT_PACK_P (targ
))
6886 /* Look inside the argument pack. */
6887 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6888 len
= TREE_VEC_LENGTH (packed_args
);
6891 for (idx
= 0; idx
< len
; ++idx
)
6893 tree targ_parms
= NULL_TREE
;
6896 /* Extract the next argument from the argument
6898 targ
= TREE_VEC_ELT (packed_args
, idx
);
6900 if (PACK_EXPANSION_P (targ
))
6901 /* Look at the pattern of the pack expansion. */
6902 targ
= PACK_EXPANSION_PATTERN (targ
);
6904 /* Extract the template parameters from the template
6906 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6907 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6908 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6909 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6911 /* Verify that we can coerce the template template
6912 parameters from the template argument to the template
6913 parameter. This requires an exact match. */
6915 && !coerce_template_template_parms
6916 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6931 --processing_template_decl
;
6935 /* Since type attributes aren't mangled, we need to strip them from
6936 template type arguments. */
6939 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6941 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6943 bool removed_attributes
= false;
6944 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6945 if (removed_attributes
6946 && (complain
& tf_warning
))
6947 warning (0, "ignoring attributes on template argument %qT", arg
);
6951 // A template declaration can be substituted for a constrained
6952 // template template parameter only when the argument is more
6953 // constrained than the parameter.
6955 is_compatible_template_arg (tree parm
, tree arg
)
6957 tree parm_cons
= get_constraints (parm
);
6959 /* For now, allow constrained template template arguments
6960 and unconstrained template template parameters. */
6961 if (parm_cons
== NULL_TREE
)
6964 tree arg_cons
= get_constraints (arg
);
6966 // If the template parameter is constrained, we need to rewrite its
6967 // constraints in terms of the ARG's template parameters. This ensures
6968 // that all of the template parameter types will have the same depth.
6970 // Note that this is only valid when coerce_template_template_parm is
6971 // true for the innermost template parameters of PARM and ARG. In other
6972 // words, because coercion is successful, this conversion will be valid.
6975 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6976 parm_cons
= tsubst_constraint_info (parm_cons
,
6977 INNERMOST_TEMPLATE_ARGS (args
),
6978 tf_none
, NULL_TREE
);
6979 if (parm_cons
== error_mark_node
)
6983 return subsumes (parm_cons
, arg_cons
);
6986 // Convert a placeholder argument into a binding to the original
6987 // parameter. The original parameter is saved as the TREE_TYPE of
6990 convert_wildcard_argument (tree parm
, tree arg
)
6992 TREE_TYPE (arg
) = parm
;
6996 /* Convert the indicated template ARG as necessary to match the
6997 indicated template PARM. Returns the converted ARG, or
6998 error_mark_node if the conversion was unsuccessful. Error and
6999 warning messages are issued under control of COMPLAIN. This
7000 conversion is for the Ith parameter in the parameter list. ARGS is
7001 the full set of template arguments deduced so far. */
7004 convert_template_argument (tree parm
,
7007 tsubst_flags_t complain
,
7013 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
7015 if (parm
== error_mark_node
)
7016 return error_mark_node
;
7018 /* Trivially convert placeholders. */
7019 if (TREE_CODE (arg
) == WILDCARD_DECL
)
7020 return convert_wildcard_argument (parm
, arg
);
7022 if (TREE_CODE (arg
) == TREE_LIST
7023 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7025 /* The template argument was the name of some
7026 member function. That's usually
7027 invalid, but static members are OK. In any
7028 case, grab the underlying fields/functions
7029 and issue an error later if required. */
7030 orig_arg
= TREE_VALUE (arg
);
7031 TREE_TYPE (arg
) = unknown_type_node
;
7036 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7037 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7038 || requires_tmpl_type
);
7040 /* When determining whether an argument pack expansion is a template,
7041 look at the pattern. */
7042 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7043 arg
= PACK_EXPANSION_PATTERN (arg
);
7045 /* Deal with an injected-class-name used as a template template arg. */
7046 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7048 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7049 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7051 if (cxx_dialect
>= cxx11
)
7052 /* OK under DR 1004. */;
7053 else if (complain
& tf_warning_or_error
)
7054 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7055 " used as template template argument", TYPE_NAME (arg
));
7056 else if (flag_pedantic_errors
)
7064 ((TREE_CODE (arg
) == TEMPLATE_DECL
7065 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7066 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7067 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7068 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7071 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7072 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7073 arg
= TYPE_STUB_DECL (arg
);
7075 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7077 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7078 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7080 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7082 if (complain
& tf_error
)
7083 error ("invalid use of destructor %qE as a type", orig_arg
);
7084 return error_mark_node
;
7087 permerror (input_location
,
7088 "to refer to a type member of a template parameter, "
7089 "use %<typename %E%>", orig_arg
);
7091 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7092 TREE_OPERAND (arg
, 1),
7098 if (is_type
!= requires_type
)
7102 if (complain
& tf_error
)
7104 error ("type/value mismatch at argument %d in template "
7105 "parameter list for %qD",
7108 inform (input_location
,
7109 " expected a constant of type %qT, got %qT",
7111 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7112 else if (requires_tmpl_type
)
7113 inform (input_location
,
7114 " expected a class template, got %qE", orig_arg
);
7116 inform (input_location
,
7117 " expected a type, got %qE", orig_arg
);
7120 return error_mark_node
;
7122 if (is_tmpl_type
^ requires_tmpl_type
)
7124 if (in_decl
&& (complain
& tf_error
))
7126 error ("type/value mismatch at argument %d in template "
7127 "parameter list for %qD",
7130 inform (input_location
,
7131 " expected a type, got %qT", DECL_NAME (arg
));
7133 inform (input_location
,
7134 " expected a class template, got %qT", orig_arg
);
7136 return error_mark_node
;
7141 if (requires_tmpl_type
)
7143 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7145 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7146 /* The number of argument required is not known yet.
7147 Just accept it for now. */
7148 val
= TREE_TYPE (arg
);
7151 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7154 /* Strip alias templates that are equivalent to another
7156 arg
= get_underlying_template (arg
);
7157 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7159 if (coerce_template_template_parms (parmparm
, argparm
,
7165 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7167 if (val
!= error_mark_node
)
7169 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7170 val
= TREE_TYPE (val
);
7171 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7172 val
= make_pack_expansion (val
);
7177 if (in_decl
&& (complain
& tf_error
))
7179 error ("type/value mismatch at argument %d in "
7180 "template parameter list for %qD",
7182 inform (input_location
,
7183 " expected a template of type %qD, got %qT",
7187 val
= error_mark_node
;
7190 // Check that the constraints are compatible before allowing the
7192 if (val
!= error_mark_node
)
7193 if (!is_compatible_template_arg (parm
, arg
))
7195 if (in_decl
&& (complain
& tf_error
))
7197 error ("constraint mismatch at argument %d in "
7198 "template parameter list for %qD",
7200 inform (input_location
, " expected %qD but got %qD",
7203 val
= error_mark_node
;
7209 /* We only form one instance of each template specialization.
7210 Therefore, if we use a non-canonical variant (i.e., a
7211 typedef), any future messages referring to the type will use
7212 the typedef, which is confusing if those future uses do not
7213 themselves also use the typedef. */
7215 val
= canonicalize_type_argument (val
, complain
);
7219 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7221 if (invalid_nontype_parm_type_p (t
, complain
))
7222 return error_mark_node
;
7224 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7226 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7230 /* Not sure if this is reachable, but it doesn't hurt
7232 error ("type mismatch in nontype parameter pack");
7233 val
= error_mark_node
;
7236 else if (!dependent_template_arg_p (orig_arg
)
7237 && !uses_template_parms (t
))
7238 /* We used to call digest_init here. However, digest_init
7239 will report errors, which we don't want when complain
7240 is zero. More importantly, digest_init will try too
7241 hard to convert things: for example, `0' should not be
7242 converted to pointer type at this point according to
7243 the standard. Accepting this is not merely an
7244 extension, since deciding whether or not these
7245 conversions can occur is part of determining which
7246 function template to call, or whether a given explicit
7247 argument specification is valid. */
7248 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7251 bool removed_attr
= false;
7252 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7255 if (val
== NULL_TREE
)
7256 val
= error_mark_node
;
7257 else if (val
== error_mark_node
&& (complain
& tf_error
))
7258 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7260 if (INDIRECT_REF_P (val
))
7262 /* Reject template arguments that are references to built-in
7263 functions with no library fallbacks. */
7264 const_tree inner
= TREE_OPERAND (val
, 0);
7265 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7266 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7267 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7268 && 0 < TREE_OPERAND_LENGTH (inner
)
7269 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7270 return error_mark_node
;
7273 if (TREE_CODE (val
) == SCOPE_REF
)
7275 /* Strip typedefs from the SCOPE_REF. */
7276 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7277 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7279 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7280 QUALIFIED_NAME_IS_TEMPLATE (val
));
7287 /* Coerces the remaining template arguments in INNER_ARGS (from
7288 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7289 Returns the coerced argument pack. PARM_IDX is the position of this
7290 parameter in the template parameter list. ARGS is the original
7291 template argument list. */
7293 coerce_template_parameter_pack (tree parms
,
7301 tsubst_flags_t complain
)
7303 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7304 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7307 tree packed_parms
= NULL_TREE
;
7309 if (arg_idx
> nargs
)
7312 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7314 /* When the template parameter is a non-type template parameter pack
7315 or template template parameter pack whose type or template
7316 parameters use parameter packs, we know exactly how many arguments
7317 we are looking for. Build a vector of the instantiated decls for
7318 these template parameters in PACKED_PARMS. */
7319 /* We can't use make_pack_expansion here because it would interpret a
7320 _DECL as a use rather than a declaration. */
7321 tree decl
= TREE_VALUE (parm
);
7322 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7323 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7324 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7325 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7327 TREE_VEC_LENGTH (args
)--;
7328 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7329 TREE_VEC_LENGTH (args
)++;
7331 if (packed_parms
== error_mark_node
)
7332 return error_mark_node
;
7334 /* If we're doing a partial instantiation of a member template,
7335 verify that all of the types used for the non-type
7336 template parameter pack are, in fact, valid for non-type
7337 template parameters. */
7339 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7341 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7342 for (j
= 0; j
< len
; ++j
)
7344 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7345 if (invalid_nontype_parm_type_p (t
, complain
))
7346 return error_mark_node
;
7348 /* We don't know how many args we have yet, just
7349 use the unconverted ones for now. */
7353 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7355 /* Check if we have a placeholder pack, which indicates we're
7356 in the context of a introduction list. In that case we want
7357 to match this pack to the single placeholder. */
7358 else if (arg_idx
< nargs
7359 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7360 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7362 nargs
= arg_idx
+ 1;
7363 packed_args
= make_tree_vec (1);
7366 packed_args
= make_tree_vec (nargs
- arg_idx
);
7368 /* Convert the remaining arguments, which will be a part of the
7369 parameter pack "parm". */
7370 for (; arg_idx
< nargs
; ++arg_idx
)
7372 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7373 tree actual_parm
= TREE_VALUE (parm
);
7374 int pack_idx
= arg_idx
- parm_idx
;
7378 /* Once we've packed as many args as we have types, stop. */
7379 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7381 else if (PACK_EXPANSION_P (arg
))
7382 /* We don't know how many args we have yet, just
7383 use the unconverted ones for now. */
7386 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7389 if (arg
== error_mark_node
)
7391 if (complain
& tf_error
)
7392 error ("template argument %d is invalid", arg_idx
+ 1);
7395 arg
= convert_template_argument (actual_parm
,
7396 arg
, new_args
, complain
, parm_idx
,
7398 if (arg
== error_mark_node
)
7400 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7403 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7404 && TREE_VEC_LENGTH (packed_args
) > 0)
7406 if (complain
& tf_error
)
7407 error ("wrong number of template arguments (%d, should be %d)",
7408 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7409 return error_mark_node
;
7412 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7413 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7414 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7417 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7418 TREE_TYPE (argument_pack
)
7419 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7420 TREE_CONSTANT (argument_pack
) = 1;
7423 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7425 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7426 TREE_VEC_LENGTH (packed_args
));
7427 return argument_pack
;
7430 /* Returns the number of pack expansions in the template argument vector
7434 pack_expansion_args_count (tree args
)
7439 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7441 tree elt
= TREE_VEC_ELT (args
, i
);
7442 if (elt
&& PACK_EXPANSION_P (elt
))
7448 /* Convert all template arguments to their appropriate types, and
7449 return a vector containing the innermost resulting template
7450 arguments. If any error occurs, return error_mark_node. Error and
7451 warning messages are issued under control of COMPLAIN.
7453 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7454 for arguments not specified in ARGS. Otherwise, if
7455 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7456 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7457 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7461 coerce_template_parms (tree parms
,
7464 tsubst_flags_t complain
,
7465 bool require_all_args
,
7466 bool use_default_args
)
7468 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7469 tree orig_inner_args
;
7472 tree new_inner_args
;
7473 int saved_unevaluated_operand
;
7474 int saved_inhibit_evaluation_warnings
;
7476 /* When used as a boolean value, indicates whether this is a
7477 variadic template parameter list. Since it's an int, we can also
7478 subtract it from nparms to get the number of non-variadic
7481 int variadic_args_p
= 0;
7482 int post_variadic_parms
= 0;
7484 /* Likewise for parameters with default arguments. */
7487 if (args
== error_mark_node
)
7488 return error_mark_node
;
7490 nparms
= TREE_VEC_LENGTH (parms
);
7492 /* Determine if there are any parameter packs or default arguments. */
7493 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7495 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7497 ++post_variadic_parms
;
7498 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7500 if (TREE_PURPOSE (parm
))
7504 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7505 /* If there are no parameters that follow a parameter pack, we need to
7506 expand any argument packs so that we can deduce a parameter pack from
7507 some non-packed args followed by an argument pack, as in variadic85.C.
7508 If there are such parameters, we need to leave argument packs intact
7509 so the arguments are assigned properly. This can happen when dealing
7510 with a nested class inside a partial specialization of a class
7511 template, as in variadic92.C, or when deducing a template parameter pack
7512 from a sub-declarator, as in variadic114.C. */
7513 if (!post_variadic_parms
)
7514 inner_args
= expand_template_argument_pack (inner_args
);
7516 /* Count any pack expansion args. */
7517 variadic_args_p
= pack_expansion_args_count (inner_args
);
7519 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7520 if ((nargs
> nparms
&& !variadic_p
)
7521 || (nargs
< nparms
- variadic_p
7524 && (!use_default_args
7525 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7526 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7528 if (complain
& tf_error
)
7530 if (variadic_p
|| default_p
)
7532 nparms
-= variadic_p
+ default_p
;
7533 error ("wrong number of template arguments "
7534 "(%d, should be at least %d)", nargs
, nparms
);
7537 error ("wrong number of template arguments "
7538 "(%d, should be %d)", nargs
, nparms
);
7541 inform (DECL_SOURCE_LOCATION (in_decl
),
7542 "provided for %qD", in_decl
);
7545 return error_mark_node
;
7547 /* We can't pass a pack expansion to a non-pack parameter of an alias
7548 template (DR 1430). */
7550 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7551 || concept_template_p (in_decl
))
7553 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7555 if (complain
& tf_error
)
7557 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7559 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7560 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7562 if (PACK_EXPANSION_P (arg
)
7563 && !template_parameter_pack_p (parm
))
7565 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7566 error_at (location_of (arg
),
7567 "pack expansion argument for non-pack parameter "
7568 "%qD of alias template %qD", parm
, in_decl
);
7570 error_at (location_of (arg
),
7571 "pack expansion argument for non-pack parameter "
7572 "%qD of concept %qD", parm
, in_decl
);
7573 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7580 return error_mark_node
;
7583 /* We need to evaluate the template arguments, even though this
7584 template-id may be nested within a "sizeof". */
7585 saved_unevaluated_operand
= cp_unevaluated_operand
;
7586 cp_unevaluated_operand
= 0;
7587 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7588 c_inhibit_evaluation_warnings
= 0;
7589 new_inner_args
= make_tree_vec (nparms
);
7590 new_args
= add_outermost_template_args (args
, new_inner_args
);
7591 int pack_adjust
= 0;
7592 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7597 /* Get the Ith template parameter. */
7598 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7600 if (parm
== error_mark_node
)
7602 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7606 /* Calculate the next argument. */
7607 if (arg_idx
< nargs
)
7608 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7612 if (template_parameter_pack_p (TREE_VALUE (parm
))
7613 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7615 /* Some arguments will be placed in the
7616 template parameter pack PARM. */
7617 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7618 inner_args
, arg_idx
,
7622 if (arg
== NULL_TREE
)
7624 /* We don't know how many args we have yet, just use the
7625 unconverted (and still packed) ones for now. */
7626 new_inner_args
= orig_inner_args
;
7631 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7633 /* Store this argument. */
7634 if (arg
== error_mark_node
)
7637 /* We are done with all of the arguments. */
7642 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7643 arg_idx
+= pack_adjust
;
7650 if (PACK_EXPANSION_P (arg
))
7652 /* "If every valid specialization of a variadic template
7653 requires an empty template parameter pack, the template is
7654 ill-formed, no diagnostic required." So check that the
7655 pattern works with this parameter. */
7656 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7657 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7661 if (conv
== error_mark_node
)
7663 inform (input_location
, "so any instantiation with a "
7664 "non-empty parameter pack would be ill-formed");
7667 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7668 /* Recover from missing typename. */
7669 TREE_VEC_ELT (inner_args
, arg_idx
)
7670 = make_pack_expansion (conv
);
7672 /* We don't know how many args we have yet, just
7673 use the unconverted ones for now. */
7674 new_inner_args
= inner_args
;
7679 else if (require_all_args
)
7681 /* There must be a default arg in this case. */
7682 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7684 /* The position of the first default template argument,
7685 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7687 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7688 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7689 arg_idx
- pack_adjust
);
7694 if (arg
== error_mark_node
)
7696 if (complain
& tf_error
)
7697 error ("template argument %d is invalid", arg_idx
+ 1);
7700 /* This only occurs if there was an error in the template
7701 parameter list itself (which we would already have
7702 reported) that we are trying to recover from, e.g., a class
7703 template with a parameter list such as
7704 template<typename..., typename>. */
7707 arg
= convert_template_argument (TREE_VALUE (parm
),
7708 arg
, new_args
, complain
,
7711 if (arg
== error_mark_node
)
7713 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7715 cp_unevaluated_operand
= saved_unevaluated_operand
;
7716 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7718 if (variadic_p
&& arg_idx
< nargs
)
7720 if (complain
& tf_error
)
7722 error ("wrong number of template arguments "
7723 "(%d, should be %d)", nargs
, arg_idx
);
7725 error ("provided for %q+D", in_decl
);
7727 return error_mark_node
;
7731 return error_mark_node
;
7733 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7734 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7735 TREE_VEC_LENGTH (new_inner_args
));
7737 return new_inner_args
;
7740 /* Convert all template arguments to their appropriate types, and
7741 return a vector containing the innermost resulting template
7742 arguments. If any error occurs, return error_mark_node. Error and
7743 warning messages are not issued.
7745 Note that no function argument deduction is performed, and default
7746 arguments are used to fill in unspecified arguments. */
7748 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7750 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7753 /* Convert all template arguments to their appropriate type, and
7754 instantiate default arguments as needed. This returns a vector
7755 containing the innermost resulting template arguments, or
7756 error_mark_node if unsuccessful. */
7758 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7759 tsubst_flags_t complain
)
7761 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7764 /* Like coerce_template_parms. If PARMS represents all template
7765 parameters levels, this function returns a vector of vectors
7766 representing all the resulting argument levels. Note that in this
7767 case, only the innermost arguments are coerced because the
7768 outermost ones are supposed to have been coerced already.
7770 Otherwise, if PARMS represents only (the innermost) vector of
7771 parameters, this function returns a vector containing just the
7772 innermost resulting arguments. */
7775 coerce_innermost_template_parms (tree parms
,
7778 tsubst_flags_t complain
,
7779 bool require_all_args
,
7780 bool use_default_args
)
7782 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7783 int args_depth
= TMPL_ARGS_DEPTH (args
);
7786 if (parms_depth
> 1)
7788 coerced_args
= make_tree_vec (parms_depth
);
7792 for (level
= parms
, cur_depth
= parms_depth
;
7793 parms_depth
> 0 && level
!= NULL_TREE
;
7794 level
= TREE_CHAIN (level
), --cur_depth
)
7797 if (cur_depth
== args_depth
)
7798 l
= coerce_template_parms (TREE_VALUE (level
),
7799 args
, in_decl
, complain
,
7803 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7805 if (l
== error_mark_node
)
7806 return error_mark_node
;
7808 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7812 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7813 args
, in_decl
, complain
,
7816 return coerced_args
;
7819 /* Returns 1 if template args OT and NT are equivalent. */
7822 template_args_equal (tree ot
, tree nt
)
7826 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7829 if (TREE_CODE (nt
) == TREE_VEC
)
7830 /* For member templates */
7831 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7832 else if (PACK_EXPANSION_P (ot
))
7833 return (PACK_EXPANSION_P (nt
)
7834 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7835 PACK_EXPANSION_PATTERN (nt
))
7836 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7837 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7838 else if (ARGUMENT_PACK_P (ot
))
7843 if (!ARGUMENT_PACK_P (nt
))
7846 opack
= ARGUMENT_PACK_ARGS (ot
);
7847 npack
= ARGUMENT_PACK_ARGS (nt
);
7848 len
= TREE_VEC_LENGTH (opack
);
7849 if (TREE_VEC_LENGTH (npack
) != len
)
7851 for (i
= 0; i
< len
; ++i
)
7852 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7853 TREE_VEC_ELT (npack
, i
)))
7857 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7859 /* We get here probably because we are in the middle of substituting
7860 into the pattern of a pack expansion. In that case the
7861 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7862 interested in. So we want to use the initial pack argument for
7864 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7865 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7866 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7867 return template_args_equal (ot
, nt
);
7869 else if (TYPE_P (nt
))
7873 /* Don't treat an alias template specialization with dependent
7874 arguments as equivalent to its underlying type when used as a
7875 template argument; we need them to be distinct so that we
7876 substitute into the specialization arguments at instantiation
7877 time. And aliases can't be equivalent without being ==, so
7878 we don't need to look any deeper. */
7879 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7882 return same_type_p (ot
, nt
);
7884 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7888 /* Try to treat a template non-type argument that has been converted
7889 to the parameter type as equivalent to one that hasn't yet. */
7890 for (enum tree_code code1
= TREE_CODE (ot
);
7891 CONVERT_EXPR_CODE_P (code1
)
7892 || code1
== NON_LVALUE_EXPR
;
7893 code1
= TREE_CODE (ot
))
7894 ot
= TREE_OPERAND (ot
, 0);
7895 for (enum tree_code code2
= TREE_CODE (nt
);
7896 CONVERT_EXPR_CODE_P (code2
)
7897 || code2
== NON_LVALUE_EXPR
;
7898 code2
= TREE_CODE (nt
))
7899 nt
= TREE_OPERAND (nt
, 0);
7901 return cp_tree_equal (ot
, nt
);
7905 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7906 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7907 NEWARG_PTR with the offending arguments if they are non-NULL. */
7910 comp_template_args (tree oldargs
, tree newargs
,
7911 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7915 if (oldargs
== newargs
)
7918 if (!oldargs
|| !newargs
)
7921 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7924 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7926 tree nt
= TREE_VEC_ELT (newargs
, i
);
7927 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7929 if (! template_args_equal (ot
, nt
))
7931 if (oldarg_ptr
!= NULL
)
7933 if (newarg_ptr
!= NULL
)
7942 add_pending_template (tree d
)
7944 tree ti
= (TYPE_P (d
)
7945 ? CLASSTYPE_TEMPLATE_INFO (d
)
7946 : DECL_TEMPLATE_INFO (d
));
7947 struct pending_template
*pt
;
7950 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7953 /* We are called both from instantiate_decl, where we've already had a
7954 tinst_level pushed, and instantiate_template, where we haven't.
7956 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7959 push_tinst_level (d
);
7961 pt
= ggc_alloc
<pending_template
> ();
7963 pt
->tinst
= current_tinst_level
;
7964 if (last_pending_template
)
7965 last_pending_template
->next
= pt
;
7967 pending_templates
= pt
;
7969 last_pending_template
= pt
;
7971 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7978 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7979 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7980 documentation for TEMPLATE_ID_EXPR. */
7983 lookup_template_function (tree fns
, tree arglist
)
7987 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7988 return error_mark_node
;
7990 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7992 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7994 error ("%q#D is not a function template", fns
);
7995 return error_mark_node
;
7998 if (BASELINK_P (fns
))
8000 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
8002 BASELINK_FUNCTIONS (fns
),
8007 type
= TREE_TYPE (fns
);
8008 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
8009 type
= unknown_type_node
;
8011 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
8014 /* Within the scope of a template class S<T>, the name S gets bound
8015 (in build_self_reference) to a TYPE_DECL for the class, not a
8016 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
8017 or one of its enclosing classes, and that type is a template,
8018 return the associated TEMPLATE_DECL. Otherwise, the original
8021 Also handle the case when DECL is a TREE_LIST of ambiguous
8022 injected-class-names from different bases. */
8025 maybe_get_template_decl_from_type_decl (tree decl
)
8027 if (decl
== NULL_TREE
)
8030 /* DR 176: A lookup that finds an injected-class-name (10.2
8031 [class.member.lookup]) can result in an ambiguity in certain cases
8032 (for example, if it is found in more than one base class). If all of
8033 the injected-class-names that are found refer to specializations of
8034 the same class template, and if the name is followed by a
8035 template-argument-list, the reference refers to the class template
8036 itself and not a specialization thereof, and is not ambiguous. */
8037 if (TREE_CODE (decl
) == TREE_LIST
)
8039 tree t
, tmpl
= NULL_TREE
;
8040 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8042 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8045 else if (tmpl
!= elt
)
8048 if (tmpl
&& t
== NULL_TREE
)
8054 return (decl
!= NULL_TREE
8055 && DECL_SELF_REFERENCE_P (decl
)
8056 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8057 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8060 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8061 parameters, find the desired type.
8063 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8065 IN_DECL, if non-NULL, is the template declaration we are trying to
8068 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8069 the class we are looking up.
8071 Issue error and warning messages under control of COMPLAIN.
8073 If the template class is really a local class in a template
8074 function, then the FUNCTION_CONTEXT is the function in which it is
8077 ??? Note that this function is currently called *twice* for each
8078 template-id: the first time from the parser, while creating the
8079 incomplete type (finish_template_type), and the second type during the
8080 real instantiation (instantiate_template_class). This is surely something
8081 that we want to avoid. It also causes some problems with argument
8082 coercion (see convert_nontype_argument for more information on this). */
8085 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8086 int entering_scope
, tsubst_flags_t complain
)
8088 tree templ
= NULL_TREE
, parmlist
;
8095 if (identifier_p (d1
))
8097 tree value
= innermost_non_namespace_value (d1
);
8098 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8103 push_decl_namespace (context
);
8104 templ
= lookup_name (d1
);
8105 templ
= maybe_get_template_decl_from_type_decl (templ
);
8107 pop_decl_namespace ();
8110 context
= DECL_CONTEXT (templ
);
8112 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8114 tree type
= TREE_TYPE (d1
);
8116 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8117 an implicit typename for the second A. Deal with it. */
8118 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8119 type
= TREE_TYPE (type
);
8121 if (CLASSTYPE_TEMPLATE_INFO (type
))
8123 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8124 d1
= DECL_NAME (templ
);
8127 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8128 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8130 templ
= TYPE_TI_TEMPLATE (d1
);
8131 d1
= DECL_NAME (templ
);
8133 else if (DECL_TYPE_TEMPLATE_P (d1
))
8136 d1
= DECL_NAME (templ
);
8137 context
= DECL_CONTEXT (templ
);
8139 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8142 d1
= DECL_NAME (templ
);
8145 /* Issue an error message if we didn't find a template. */
8148 if (complain
& tf_error
)
8149 error ("%qT is not a template", d1
);
8150 return error_mark_node
;
8153 if (TREE_CODE (templ
) != TEMPLATE_DECL
8154 /* Make sure it's a user visible template, if it was named by
8156 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8157 && !PRIMARY_TEMPLATE_P (templ
)))
8159 if (complain
& tf_error
)
8161 error ("non-template type %qT used as a template", d1
);
8163 error ("for template declaration %q+D", in_decl
);
8165 return error_mark_node
;
8168 complain
&= ~tf_user
;
8170 /* An alias that just changes the name of a template is equivalent to the
8171 other template, so if any of the arguments are pack expansions, strip
8172 the alias to avoid problems with a pack expansion passed to a non-pack
8173 alias template parameter (DR 1430). */
8174 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8175 templ
= get_underlying_template (templ
);
8177 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8179 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8180 template arguments */
8186 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8188 /* Consider an example where a template template parameter declared as
8190 template <class T, class U = std::allocator<T> > class TT
8192 The template parameter level of T and U are one level larger than
8193 of TT. To proper process the default argument of U, say when an
8194 instantiation `TT<int>' is seen, we need to build the full
8195 arguments containing {int} as the innermost level. Outer levels,
8196 available when not appearing as default template argument, can be
8197 obtained from the arguments of the enclosing template.
8199 Suppose that TT is later substituted with std::vector. The above
8200 instantiation is `TT<int, std::allocator<T> >' with TT at
8201 level 1, and T at level 2, while the template arguments at level 1
8202 becomes {std::vector} and the inner level 2 is {int}. */
8204 outer
= DECL_CONTEXT (templ
);
8206 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8207 else if (current_template_parms
)
8209 /* This is an argument of the current template, so we haven't set
8210 DECL_CONTEXT yet. */
8211 tree relevant_template_parms
;
8213 /* Parameter levels that are greater than the level of the given
8214 template template parm are irrelevant. */
8215 relevant_template_parms
= current_template_parms
;
8216 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8217 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8218 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8220 outer
= template_parms_to_args (relevant_template_parms
);
8224 arglist
= add_to_template_args (outer
, arglist
);
8226 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8228 /*require_all_args=*/true,
8229 /*use_default_args=*/true);
8230 if (arglist2
== error_mark_node
8231 || (!uses_template_parms (arglist2
)
8232 && check_instantiated_args (templ
, arglist2
, complain
)))
8233 return error_mark_node
;
8235 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8240 tree template_type
= TREE_TYPE (templ
);
8243 tree found
= NULL_TREE
;
8246 int is_dependent_type
;
8247 int use_partial_inst_tmpl
= false;
8249 if (template_type
== error_mark_node
)
8250 /* An error occurred while building the template TEMPL, and a
8251 diagnostic has most certainly been emitted for that
8252 already. Let's propagate that error. */
8253 return error_mark_node
;
8255 gen_tmpl
= most_general_template (templ
);
8256 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8257 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8258 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8260 if (arg_depth
== 1 && parm_depth
> 1)
8262 /* We've been given an incomplete set of template arguments.
8265 template <class T> struct S1 {
8266 template <class U> struct S2 {};
8267 template <class U> struct S2<U*> {};
8270 we will be called with an ARGLIST of `U*', but the
8271 TEMPLATE will be `template <class T> template
8272 <class U> struct S1<T>::S2'. We must fill in the missing
8275 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8277 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8280 /* Now we should have enough arguments. */
8281 gcc_assert (parm_depth
== arg_depth
);
8283 /* From here on, we're only interested in the most general
8286 /* Calculate the BOUND_ARGS. These will be the args that are
8287 actually tsubst'd into the definition to create the
8289 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8291 /*require_all_args=*/true,
8292 /*use_default_args=*/true);
8294 if (arglist
== error_mark_node
)
8295 /* We were unable to bind the arguments. */
8296 return error_mark_node
;
8298 /* In the scope of a template class, explicit references to the
8299 template class refer to the type of the template, not any
8300 instantiation of it. For example, in:
8302 template <class T> class C { void f(C<T>); }
8304 the `C<T>' is just the same as `C'. Outside of the
8305 class, however, such a reference is an instantiation. */
8307 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8308 || currently_open_class (template_type
))
8309 /* comp_template_args is expensive, check it last. */
8310 && comp_template_args (TYPE_TI_ARGS (template_type
),
8312 return template_type
;
8314 /* If we already have this specialization, return it. */
8315 elt
.tmpl
= gen_tmpl
;
8317 elt
.spec
= NULL_TREE
;
8318 hash
= spec_hasher::hash (&elt
);
8319 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8324 /* If the the template's constraints are not satisfied,
8325 then we cannot form a valid type.
8327 Note that the check is deferred until after the hash
8328 lookup. This prevents redundant checks on previously
8329 instantiated specializations. */
8330 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8332 if (complain
& tf_error
)
8334 error ("template constraint failure");
8335 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8337 return error_mark_node
;
8340 is_dependent_type
= uses_template_parms (arglist
);
8342 /* If the deduced arguments are invalid, then the binding
8344 if (!is_dependent_type
8345 && check_instantiated_args (gen_tmpl
,
8346 INNERMOST_TEMPLATE_ARGS (arglist
),
8348 return error_mark_node
;
8350 if (!is_dependent_type
8351 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8352 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8353 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8355 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8356 DECL_NAME (gen_tmpl
),
8357 /*tag_scope=*/ts_global
);
8361 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8363 if (context
== error_mark_node
)
8364 return error_mark_node
;
8367 context
= global_namespace
;
8369 /* Create the type. */
8370 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8372 /* The user referred to a specialization of an alias
8373 template represented by GEN_TMPL.
8375 [temp.alias]/2 says:
8377 When a template-id refers to the specialization of an
8378 alias template, it is equivalent to the associated
8379 type obtained by substitution of its
8380 template-arguments for the template-parameters in the
8381 type-id of the alias template. */
8383 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8384 /* Note that the call above (by indirectly calling
8385 register_specialization in tsubst_decl) registers the
8386 TYPE_DECL representing the specialization of the alias
8387 template. So next time someone substitutes ARGLIST for
8388 the template parms into the alias template (GEN_TMPL),
8389 she'll get that TYPE_DECL back. */
8391 if (t
== error_mark_node
)
8394 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8396 if (!is_dependent_type
)
8398 set_current_access_from_decl (TYPE_NAME (template_type
));
8399 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8400 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8401 arglist
, complain
, in_decl
),
8402 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
8403 arglist
, complain
, in_decl
),
8404 SCOPED_ENUM_P (template_type
), NULL
);
8406 if (t
== error_mark_node
)
8411 /* We don't want to call start_enum for this type, since
8412 the values for the enumeration constants may involve
8413 template parameters. And, no one should be interested
8414 in the enumeration constants for such a type. */
8415 t
= cxx_make_type (ENUMERAL_TYPE
);
8416 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8418 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8419 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8420 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8422 else if (CLASS_TYPE_P (template_type
))
8424 t
= make_class_type (TREE_CODE (template_type
));
8425 CLASSTYPE_DECLARED_CLASS (t
)
8426 = CLASSTYPE_DECLARED_CLASS (template_type
);
8427 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8428 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8430 /* A local class. Make sure the decl gets registered properly. */
8431 if (context
== current_function_decl
)
8432 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8434 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8435 /* This instantiation is another name for the primary
8436 template type. Set the TYPE_CANONICAL field
8438 TYPE_CANONICAL (t
) = template_type
;
8439 else if (any_template_arguments_need_structural_equality_p (arglist
))
8440 /* Some of the template arguments require structural
8441 equality testing, so this template class requires
8442 structural equality testing. */
8443 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8448 /* If we called start_enum or pushtag above, this information
8449 will already be set up. */
8452 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8454 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8455 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8456 DECL_SOURCE_LOCATION (type_decl
)
8457 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8460 type_decl
= TYPE_NAME (t
);
8462 if (CLASS_TYPE_P (template_type
))
8464 TREE_PRIVATE (type_decl
)
8465 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8466 TREE_PROTECTED (type_decl
)
8467 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8468 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8470 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8471 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8475 if (OVERLOAD_TYPE_P (t
)
8476 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8478 static const char *tags
[] = {"abi_tag", "may_alias"};
8480 for (unsigned ix
= 0; ix
!= 2; ix
++)
8483 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8487 = tree_cons (TREE_PURPOSE (attributes
),
8488 TREE_VALUE (attributes
),
8489 TYPE_ATTRIBUTES (t
));
8493 /* Let's consider the explicit specialization of a member
8494 of a class template specialization that is implicitly instantiated,
8499 template<class U> struct M {}; //#0
8504 struct S<int>::M<char> //#1
8508 [temp.expl.spec]/4 says this is valid.
8510 In this case, when we write:
8513 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8516 When we encounter #1, we want to store the partial instantiation
8517 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8519 For all cases other than this "explicit specialization of member of a
8520 class template", we just want to store the most general template into
8521 the CLASSTYPE_TI_TEMPLATE of M.
8523 This case of "explicit specialization of member of a class template"
8525 1/ the enclosing class is an instantiation of, and therefore not
8526 the same as, the context of the most general template, and
8527 2/ we aren't looking at the partial instantiation itself, i.e.
8528 the innermost arguments are not the same as the innermost parms of
8529 the most general template.
8531 So it's only when 1/ and 2/ happens that we want to use the partial
8532 instantiation of the member template in lieu of its most general
8535 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8536 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8537 /* the enclosing class must be an instantiation... */
8538 && CLASS_TYPE_P (context
)
8539 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8541 tree partial_inst_args
;
8542 TREE_VEC_LENGTH (arglist
)--;
8543 ++processing_template_decl
;
8545 tsubst (INNERMOST_TEMPLATE_ARGS
8546 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8547 arglist
, complain
, NULL_TREE
);
8548 --processing_template_decl
;
8549 TREE_VEC_LENGTH (arglist
)++;
8550 if (partial_inst_args
== error_mark_node
)
8551 return error_mark_node
;
8552 use_partial_inst_tmpl
=
8553 /*...and we must not be looking at the partial instantiation
8555 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8559 if (!use_partial_inst_tmpl
)
8560 /* This case is easy; there are no member templates involved. */
8564 /* This is a full instantiation of a member template. Find
8565 the partial instantiation of which this is an instance. */
8567 /* Temporarily reduce by one the number of levels in the ARGLIST
8568 so as to avoid comparing the last set of arguments. */
8569 TREE_VEC_LENGTH (arglist
)--;
8570 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8571 TREE_VEC_LENGTH (arglist
)++;
8572 /* FOUND is either a proper class type, or an alias
8573 template specialization. In the later case, it's a
8574 TYPE_DECL, resulting from the substituting of arguments
8575 for parameters in the TYPE_DECL of the alias template
8576 done earlier. So be careful while getting the template
8578 found
= TREE_CODE (found
) == TYPE_DECL
8579 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8580 : CLASSTYPE_TI_TEMPLATE (found
);
8583 // Build template info for the new specialization.
8584 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8587 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8588 entry
= ggc_alloc
<spec_entry
> ();
8592 /* Note this use of the partial instantiation so we can check it
8593 later in maybe_process_partial_specialization. */
8594 DECL_TEMPLATE_INSTANTIATIONS (found
)
8595 = tree_cons (arglist
, t
,
8596 DECL_TEMPLATE_INSTANTIATIONS (found
));
8598 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8599 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8600 /* Now that the type has been registered on the instantiations
8601 list, we set up the enumerators. Because the enumeration
8602 constants may involve the enumeration type itself, we make
8603 sure to register the type first, and then create the
8604 constants. That way, doing tsubst_expr for the enumeration
8605 constants won't result in recursive calls here; we'll find
8606 the instantiation and exit above. */
8607 tsubst_enum (template_type
, t
, arglist
);
8609 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8610 /* If the type makes use of template parameters, the
8611 code that generates debugging information will crash. */
8612 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8614 /* Possibly limit visibility based on template args. */
8615 TREE_PUBLIC (type_decl
) = 1;
8616 determine_visibility (type_decl
);
8618 inherit_targ_abi_tags (t
);
8624 /* Wrapper for lookup_template_class_1. */
8627 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8628 int entering_scope
, tsubst_flags_t complain
)
8631 timevar_push (TV_TEMPLATE_INST
);
8632 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8633 entering_scope
, complain
);
8634 timevar_pop (TV_TEMPLATE_INST
);
8638 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8641 lookup_template_variable (tree templ
, tree arglist
)
8643 /* The type of the expression is NULL_TREE since the template-id could refer
8644 to an explicit or partial specialization. */
8645 tree type
= NULL_TREE
;
8646 if (flag_concepts
&& variable_concept_p (templ
))
8647 /* Except that concepts are always bool. */
8648 type
= boolean_type_node
;
8649 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8652 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8655 finish_template_variable (tree var
, tsubst_flags_t complain
)
8657 tree templ
= TREE_OPERAND (var
, 0);
8658 tree arglist
= TREE_OPERAND (var
, 1);
8660 /* We never want to return a VAR_DECL for a variable concept, since they
8661 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8662 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8663 if (concept_p
&& processing_template_decl
)
8666 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8667 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8669 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8670 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8672 /*use_default*/true);
8674 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8676 if (complain
& tf_error
)
8678 error ("constraints for %qD not satisfied", templ
);
8679 diagnose_constraints (location_of (var
), templ
, arglist
);
8681 return error_mark_node
;
8684 /* If a template-id refers to a specialization of a variable
8685 concept, then the expression is true if and only if the
8686 concept's constraints are satisfied by the given template
8689 NOTE: This is an extension of Concepts Lite TS that
8690 allows constraints to be used in expressions. */
8693 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8694 return evaluate_variable_concept (decl
, arglist
);
8697 return instantiate_template (templ
, arglist
, complain
);
8700 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
8701 TARGS template args, and instantiate it if it's not dependent. */
8704 lookup_and_finish_template_variable (tree templ
, tree targs
,
8705 tsubst_flags_t complain
)
8707 templ
= lookup_template_variable (templ
, targs
);
8708 if (!any_dependent_template_arguments_p (targs
))
8710 templ
= finish_template_variable (templ
, complain
);
8714 return convert_from_reference (templ
);
8722 /* True when we should also visit template parameters that occur in
8723 non-deduced contexts. */
8724 bool include_nondeduced_p
;
8725 hash_set
<tree
> *visited
;
8728 /* Called from for_each_template_parm via walk_tree. */
8731 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8734 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8735 tree_fn_t fn
= pfd
->fn
;
8736 void *data
= pfd
->data
;
8737 tree result
= NULL_TREE
;
8739 #define WALK_SUBTREE(NODE) \
8742 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
8743 pfd->include_nondeduced_p); \
8744 if (result) goto out; \
8749 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
8750 WALK_SUBTREE (TYPE_CONTEXT (t
));
8752 switch (TREE_CODE (t
))
8755 if (TYPE_PTRMEMFUNC_P (t
))
8761 if (!TYPE_TEMPLATE_INFO (t
))
8764 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8768 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
8769 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
8773 /* Since we're not going to walk subtrees, we have to do this
8775 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
8779 /* Check the return type. */
8780 WALK_SUBTREE (TREE_TYPE (t
));
8782 /* Check the parameter types. Since default arguments are not
8783 instantiated until they are needed, the TYPE_ARG_TYPES may
8784 contain expressions that involve template parameters. But,
8785 no-one should be looking at them yet. And, once they're
8786 instantiated, they don't contain template parameters, so
8787 there's no point in looking at them then, either. */
8791 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8792 WALK_SUBTREE (TREE_VALUE (parm
));
8794 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8795 want walk_tree walking into them itself. */
8801 case UNDERLYING_TYPE
:
8802 if (pfd
->include_nondeduced_p
8803 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8805 pfd
->include_nondeduced_p
))
8806 return error_mark_node
;
8811 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
8812 WALK_SUBTREE (DECL_TI_ARGS (t
));
8817 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
8818 WALK_SUBTREE (DECL_INITIAL (t
));
8819 if (DECL_CONTEXT (t
)
8820 && pfd
->include_nondeduced_p
)
8821 WALK_SUBTREE (DECL_CONTEXT (t
));
8824 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8825 /* Record template parameters such as `T' inside `TT<T>'. */
8826 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8829 case TEMPLATE_TEMPLATE_PARM
:
8830 case TEMPLATE_TYPE_PARM
:
8831 case TEMPLATE_PARM_INDEX
:
8832 if (fn
&& (*fn
)(t
, data
))
8839 /* A template template parameter is encountered. */
8840 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8841 WALK_SUBTREE (TREE_TYPE (t
));
8843 /* Already substituted template template parameter */
8849 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
8853 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8854 && pfd
->include_nondeduced_p
)
8855 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
8860 /* If there's no type, then this thing must be some expression
8861 involving template parameters. */
8862 if (!fn
&& !TREE_TYPE (t
))
8863 return error_mark_node
;
8868 case IMPLICIT_CONV_EXPR
:
8869 case REINTERPRET_CAST_EXPR
:
8870 case CONST_CAST_EXPR
:
8871 case STATIC_CAST_EXPR
:
8872 case DYNAMIC_CAST_EXPR
:
8876 case PSEUDO_DTOR_EXPR
:
8878 return error_mark_node
;
8887 /* We didn't find any template parameters we liked. */
8892 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8893 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8894 call FN with the parameter and the DATA.
8895 If FN returns nonzero, the iteration is terminated, and
8896 for_each_template_parm returns 1. Otherwise, the iteration
8897 continues. If FN never returns a nonzero value, the value
8898 returned by for_each_template_parm is 0. If FN is NULL, it is
8899 considered to be the function which always returns 1.
8901 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8902 parameters that occur in non-deduced contexts. When false, only
8903 visits those template parameters that can be deduced. */
8906 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8907 hash_set
<tree
> *visited
,
8908 bool include_nondeduced_p
)
8910 struct pair_fn_data pfd
;
8916 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8918 /* Walk the tree. (Conceptually, we would like to walk without
8919 duplicates, but for_each_template_parm_r recursively calls
8920 for_each_template_parm, so we would need to reorganize a fair
8921 bit to use walk_tree_without_duplicates, so we keep our own
8924 pfd
.visited
= visited
;
8926 pfd
.visited
= new hash_set
<tree
>;
8927 result
= cp_walk_tree (&t
,
8928 for_each_template_parm_r
,
8942 /* Returns true if T depends on any template parameter. */
8945 uses_template_parms (tree t
)
8951 int saved_processing_template_decl
;
8953 saved_processing_template_decl
= processing_template_decl
;
8954 if (!saved_processing_template_decl
)
8955 processing_template_decl
= 1;
8957 dependent_p
= dependent_type_p (t
);
8958 else if (TREE_CODE (t
) == TREE_VEC
)
8959 dependent_p
= any_dependent_template_arguments_p (t
);
8960 else if (TREE_CODE (t
) == TREE_LIST
)
8961 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8962 || uses_template_parms (TREE_CHAIN (t
)));
8963 else if (TREE_CODE (t
) == TYPE_DECL
)
8964 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8967 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8968 || TREE_CODE (t
) == OVERLOAD
8971 || TREE_CODE (t
) == TRAIT_EXPR
8972 || TREE_CODE (t
) == CONSTRUCTOR
8973 || CONSTANT_CLASS_P (t
))
8974 dependent_p
= (type_dependent_expression_p (t
)
8975 || value_dependent_expression_p (t
));
8978 gcc_assert (t
== error_mark_node
);
8979 dependent_p
= false;
8982 processing_template_decl
= saved_processing_template_decl
;
8987 /* Returns true iff current_function_decl is an incompletely instantiated
8988 template. Useful instead of processing_template_decl because the latter
8989 is set to 0 during instantiate_non_dependent_expr. */
8992 in_template_function (void)
8994 tree fn
= current_function_decl
;
8996 ++processing_template_decl
;
8997 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8998 && DECL_TEMPLATE_INFO (fn
)
8999 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
9000 --processing_template_decl
;
9004 /* Returns true if T depends on any template parameter with level LEVEL. */
9007 uses_template_parms_level (tree t
, int level
)
9009 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
9010 /*include_nondeduced_p=*/true);
9013 /* Returns TRUE iff INST is an instantiation we don't need to do in an
9014 ill-formed translation unit, i.e. a variable or function that isn't
9015 usable in a constant expression. */
9018 neglectable_inst_p (tree d
)
9021 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
9022 : decl_maybe_constant_var_p (d
)));
9025 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9026 neglectable and instantiated from within an erroneous instantiation. */
9029 limit_bad_template_recursion (tree decl
)
9031 struct tinst_level
*lev
= current_tinst_level
;
9032 int errs
= errorcount
+ sorrycount
;
9033 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9036 for (; lev
; lev
= lev
->next
)
9037 if (neglectable_inst_p (lev
->decl
))
9040 return (lev
&& errs
> lev
->errors
);
9043 static int tinst_depth
;
9044 extern int max_tinst_depth
;
9047 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9049 /* We're starting to instantiate D; record the template instantiation context
9050 for diagnostics and to restore it later. */
9053 push_tinst_level (tree d
)
9055 return push_tinst_level_loc (d
, input_location
);
9058 /* We're starting to instantiate D; record the template instantiation context
9059 at LOC for diagnostics and to restore it later. */
9062 push_tinst_level_loc (tree d
, location_t loc
)
9064 struct tinst_level
*new_level
;
9066 if (tinst_depth
>= max_tinst_depth
)
9068 fatal_error (input_location
,
9069 "template instantiation depth exceeds maximum of %d"
9070 " (use -ftemplate-depth= to increase the maximum)",
9075 /* If the current instantiation caused problems, don't let it instantiate
9076 anything else. Do allow deduction substitution and decls usable in
9077 constant expressions. */
9078 if (limit_bad_template_recursion (d
))
9081 new_level
= ggc_alloc
<tinst_level
> ();
9082 new_level
->decl
= d
;
9083 new_level
->locus
= loc
;
9084 new_level
->errors
= errorcount
+sorrycount
;
9085 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9086 new_level
->next
= current_tinst_level
;
9087 current_tinst_level
= new_level
;
9090 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9091 depth_reached
= tinst_depth
;
9096 /* We're done instantiating this template; return to the instantiation
9100 pop_tinst_level (void)
9102 /* Restore the filename and line number stashed away when we started
9103 this instantiation. */
9104 input_location
= current_tinst_level
->locus
;
9105 current_tinst_level
= current_tinst_level
->next
;
9109 /* We're instantiating a deferred template; restore the template
9110 instantiation context in which the instantiation was requested, which
9111 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9114 reopen_tinst_level (struct tinst_level
*level
)
9116 struct tinst_level
*t
;
9119 for (t
= level
; t
; t
= t
->next
)
9122 current_tinst_level
= level
;
9124 if (current_tinst_level
)
9125 current_tinst_level
->errors
= errorcount
+sorrycount
;
9129 /* Returns the TINST_LEVEL which gives the original instantiation
9132 struct tinst_level
*
9133 outermost_tinst_level (void)
9135 struct tinst_level
*level
= current_tinst_level
;
9138 level
= level
->next
;
9142 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9143 vector of template arguments, as for tsubst.
9145 Returns an appropriate tsubst'd friend declaration. */
9148 tsubst_friend_function (tree decl
, tree args
)
9152 if (TREE_CODE (decl
) == FUNCTION_DECL
9153 && DECL_TEMPLATE_INSTANTIATION (decl
)
9154 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9155 /* This was a friend declared with an explicit template
9156 argument list, e.g.:
9160 to indicate that f was a template instantiation, not a new
9161 function declaration. Now, we have to figure out what
9162 instantiation of what template. */
9164 tree template_id
, arglist
, fns
;
9167 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9169 /* Friend functions are looked up in the containing namespace scope.
9170 We must enter that scope, to avoid finding member functions of the
9171 current class with same name. */
9172 push_nested_namespace (ns
);
9173 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9174 tf_warning_or_error
, NULL_TREE
,
9175 /*integral_constant_expression_p=*/false);
9176 pop_nested_namespace (ns
);
9177 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9178 tf_warning_or_error
, NULL_TREE
);
9179 template_id
= lookup_template_function (fns
, arglist
);
9181 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9182 tmpl
= determine_specialization (template_id
, new_friend
,
9184 /*need_member_template=*/0,
9185 TREE_VEC_LENGTH (args
),
9187 return instantiate_template (tmpl
, new_args
, tf_error
);
9190 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9192 /* The NEW_FRIEND will look like an instantiation, to the
9193 compiler, but is not an instantiation from the point of view of
9194 the language. For example, we might have had:
9196 template <class T> struct S {
9197 template <class U> friend void f(T, U);
9200 Then, in S<int>, template <class U> void f(int, U) is not an
9201 instantiation of anything. */
9202 if (new_friend
== error_mark_node
)
9203 return error_mark_node
;
9205 DECL_USE_TEMPLATE (new_friend
) = 0;
9206 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9208 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9209 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9210 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9213 /* The mangled name for the NEW_FRIEND is incorrect. The function
9214 is not a template instantiation and should not be mangled like
9215 one. Therefore, we forget the mangling here; we'll recompute it
9216 later if we need it. */
9217 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9219 SET_DECL_RTL (new_friend
, NULL
);
9220 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9223 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9226 tree new_friend_template_info
;
9227 tree new_friend_result_template_info
;
9229 int new_friend_is_defn
;
9231 /* We must save some information from NEW_FRIEND before calling
9232 duplicate decls since that function will free NEW_FRIEND if
9234 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9235 new_friend_is_defn
=
9236 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9237 (template_for_substitution (new_friend
)))
9239 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9241 /* This declaration is a `primary' template. */
9242 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9244 new_friend_result_template_info
9245 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9248 new_friend_result_template_info
= NULL_TREE
;
9250 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9251 if (new_friend_is_defn
)
9252 DECL_INITIAL (new_friend
) = error_mark_node
;
9254 /* Inside pushdecl_namespace_level, we will push into the
9255 current namespace. However, the friend function should go
9256 into the namespace of the template. */
9257 ns
= decl_namespace_context (new_friend
);
9258 push_nested_namespace (ns
);
9259 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9260 pop_nested_namespace (ns
);
9262 if (old_decl
== error_mark_node
)
9263 return error_mark_node
;
9265 if (old_decl
!= new_friend
)
9267 /* This new friend declaration matched an existing
9268 declaration. For example, given:
9270 template <class T> void f(T);
9271 template <class U> class C {
9272 template <class T> friend void f(T) {}
9275 the friend declaration actually provides the definition
9276 of `f', once C has been instantiated for some type. So,
9277 old_decl will be the out-of-class template declaration,
9278 while new_friend is the in-class definition.
9280 But, if `f' was called before this point, the
9281 instantiation of `f' will have DECL_TI_ARGS corresponding
9282 to `T' but not to `U', references to which might appear
9283 in the definition of `f'. Previously, the most general
9284 template for an instantiation of `f' was the out-of-class
9285 version; now it is the in-class version. Therefore, we
9286 run through all specialization of `f', adding to their
9287 DECL_TI_ARGS appropriately. In particular, they need a
9288 new set of outer arguments, corresponding to the
9289 arguments for this class instantiation.
9291 The same situation can arise with something like this:
9294 template <class T> class C {
9298 when `C<int>' is instantiated. Now, `f(int)' is defined
9301 if (!new_friend_is_defn
)
9302 /* On the other hand, if the in-class declaration does
9303 *not* provide a definition, then we don't want to alter
9304 existing definitions. We can just leave everything
9309 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9310 tree new_args
= TI_ARGS (new_friend_template_info
);
9312 /* Overwrite whatever template info was there before, if
9313 any, with the new template information pertaining to
9315 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9317 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9319 /* We should have called reregister_specialization in
9321 gcc_assert (retrieve_specialization (new_template
,
9325 /* Instantiate it if the global has already been used. */
9326 if (DECL_ODR_USED (old_decl
))
9327 instantiate_decl (old_decl
, /*defer_ok=*/true,
9328 /*expl_inst_class_mem_p=*/false);
9334 /* Indicate that the old function template is a partial
9336 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9337 = new_friend_result_template_info
;
9339 gcc_assert (new_template
9340 == most_general_template (new_template
));
9341 gcc_assert (new_template
!= old_decl
);
9343 /* Reassign any specializations already in the hash table
9344 to the new more general template, and add the
9345 additional template args. */
9346 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9350 tree spec
= TREE_VALUE (t
);
9353 elt
.tmpl
= old_decl
;
9354 elt
.args
= DECL_TI_ARGS (spec
);
9355 elt
.spec
= NULL_TREE
;
9357 decl_specializations
->remove_elt (&elt
);
9360 = add_outermost_template_args (new_args
,
9361 DECL_TI_ARGS (spec
));
9363 register_specialization
9364 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9367 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9371 /* The information from NEW_FRIEND has been merged into OLD_DECL
9372 by duplicate_decls. */
9373 new_friend
= old_decl
;
9378 tree context
= DECL_CONTEXT (new_friend
);
9382 template <class T> class C {
9383 template <class U> friend void C1<U>::f (); // case 1
9384 friend void C2<T>::f (); // case 2
9386 we only need to make sure CONTEXT is a complete type for
9387 case 2. To distinguish between the two cases, we note that
9388 CONTEXT of case 1 remains dependent type after tsubst while
9389 this isn't true for case 2. */
9390 ++processing_template_decl
;
9391 dependent_p
= dependent_type_p (context
);
9392 --processing_template_decl
;
9395 && !complete_type_or_else (context
, NULL_TREE
))
9396 return error_mark_node
;
9398 if (COMPLETE_TYPE_P (context
))
9400 tree fn
= new_friend
;
9401 /* do_friend adds the TEMPLATE_DECL for any member friend
9402 template even if it isn't a member template, i.e.
9403 template <class T> friend A<T>::f();
9404 Look through it in that case. */
9405 if (TREE_CODE (fn
) == TEMPLATE_DECL
9406 && !PRIMARY_TEMPLATE_P (fn
))
9407 fn
= DECL_TEMPLATE_RESULT (fn
);
9408 /* Check to see that the declaration is really present, and,
9409 possibly obtain an improved declaration. */
9410 fn
= check_classfn (context
, fn
, NULL_TREE
);
9420 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9421 template arguments, as for tsubst.
9423 Returns an appropriate tsubst'd friend type or error_mark_node on
9427 tsubst_friend_class (tree friend_tmpl
, tree args
)
9433 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9435 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9436 return TREE_TYPE (t
);
9439 context
= CP_DECL_CONTEXT (friend_tmpl
);
9441 if (context
!= global_namespace
)
9443 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9444 push_nested_namespace (context
);
9446 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9449 /* Look for a class template declaration. We look for hidden names
9450 because two friend declarations of the same template are the
9451 same. For example, in:
9454 template <typename> friend class F;
9456 template <typename> struct B {
9457 template <typename> friend class F;
9460 both F templates are the same. */
9461 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9462 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9464 /* But, if we don't find one, it might be because we're in a
9465 situation like this:
9473 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9474 for `S<int>', not the TEMPLATE_DECL. */
9475 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9477 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9478 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9481 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9483 /* The friend template has already been declared. Just
9484 check to see that the declarations match, and install any new
9485 default parameters. We must tsubst the default parameters,
9486 of course. We only need the innermost template parameters
9487 because that is all that redeclare_class_template will look
9489 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9490 > TMPL_ARGS_DEPTH (args
))
9493 location_t saved_input_location
;
9494 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9495 args
, tf_warning_or_error
);
9497 saved_input_location
= input_location
;
9498 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9499 tree cons
= get_constraints (tmpl
);
9500 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9501 input_location
= saved_input_location
;
9505 friend_type
= TREE_TYPE (tmpl
);
9509 /* The friend template has not already been declared. In this
9510 case, the instantiation of the template class will cause the
9511 injection of this template into the global scope. */
9512 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9513 if (tmpl
== error_mark_node
)
9514 return error_mark_node
;
9516 /* The new TMPL is not an instantiation of anything, so we
9517 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9518 the new type because that is supposed to be the corresponding
9519 template decl, i.e., TMPL. */
9520 DECL_USE_TEMPLATE (tmpl
) = 0;
9521 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9522 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9523 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9524 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9526 /* Inject this template into the global scope. */
9527 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9530 if (context
!= global_namespace
)
9532 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9533 pop_nested_namespace (context
);
9535 pop_nested_class ();
9541 /* Returns zero if TYPE cannot be completed later due to circularity.
9542 Otherwise returns one. */
9545 can_complete_type_without_circularity (tree type
)
9547 if (type
== NULL_TREE
|| type
== error_mark_node
)
9549 else if (COMPLETE_TYPE_P (type
))
9551 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9552 return can_complete_type_without_circularity (TREE_TYPE (type
));
9553 else if (CLASS_TYPE_P (type
)
9554 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9560 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9562 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
9563 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
9566 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
9567 tsubst_flags_t complain
, tree in_decl
)
9569 gcc_assert (ATTR_IS_DEPENDENT (t
));
9571 tree val
= TREE_VALUE (t
);
9572 if (val
== NULL_TREE
)
9573 /* Nothing to do. */;
9574 else if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9575 && is_attribute_p ("omp declare simd",
9576 get_attribute_name (t
)))
9578 tree clauses
= TREE_VALUE (val
);
9579 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9581 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9582 clauses
= finish_omp_clauses (clauses
, false, true);
9583 tree parms
= DECL_ARGUMENTS (*decl_p
);
9585 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9587 val
= build_tree_list (NULL_TREE
, clauses
);
9591 /* If the first attribute argument is an identifier, don't
9592 pass it through tsubst. Attributes like mode, format,
9593 cleanup and several target specific attributes expect it
9595 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
9598 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
9599 /*integral_constant_expression_p=*/false);
9600 if (chain
!= TREE_CHAIN (val
))
9601 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
9603 else if (PACK_EXPANSION_P (val
))
9605 /* An attribute pack expansion. */
9606 tree purp
= TREE_PURPOSE (t
);
9607 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
9608 int len
= TREE_VEC_LENGTH (pack
);
9609 tree list
= NULL_TREE
;
9611 for (int i
= 0; i
< len
; ++i
)
9613 tree elt
= TREE_VEC_ELT (pack
, i
);
9614 *q
= build_tree_list (purp
, elt
);
9615 q
= &TREE_CHAIN (*q
);
9620 val
= tsubst_expr (val
, args
, complain
, in_decl
,
9621 /*integral_constant_expression_p=*/false);
9623 if (val
!= TREE_VALUE (t
))
9624 return build_tree_list (TREE_PURPOSE (t
), val
);
9628 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
9629 unchanged or a new TREE_LIST chain. */
9632 tsubst_attributes (tree attributes
, tree args
,
9633 tsubst_flags_t complain
, tree in_decl
)
9635 tree last_dep
= NULL_TREE
;
9637 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
9638 if (ATTR_IS_DEPENDENT (t
))
9641 attributes
= copy_list (attributes
);
9646 for (tree
*p
= &attributes
; *p
; p
= &TREE_CHAIN (*p
))
9649 if (ATTR_IS_DEPENDENT (t
))
9651 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
9656 p
= &TREE_CHAIN (*p
);
9658 *p
= TREE_CHAIN (t
);
9665 /* Apply any attributes which had to be deferred until instantiation
9666 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9667 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9670 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9671 tree args
, tsubst_flags_t complain
, tree in_decl
)
9673 tree last_dep
= NULL_TREE
;
9677 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9678 if (ATTR_IS_DEPENDENT (t
))
9681 attributes
= copy_list (attributes
);
9685 if (DECL_P (*decl_p
))
9687 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9689 p
= &DECL_ATTRIBUTES (*decl_p
);
9692 p
= &TYPE_ATTRIBUTES (*decl_p
);
9696 tree late_attrs
= NULL_TREE
;
9697 tree
*q
= &late_attrs
;
9699 for (*p
= attributes
; *p
; )
9702 if (ATTR_IS_DEPENDENT (t
))
9704 *p
= TREE_CHAIN (t
);
9705 TREE_CHAIN (t
) = NULL_TREE
;
9706 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
9708 q
= &TREE_CHAIN (*q
);
9712 p
= &TREE_CHAIN (t
);
9715 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9719 /* Perform (or defer) access check for typedefs that were referenced
9720 from within the template TMPL code.
9721 This is a subroutine of instantiate_decl and instantiate_class_template.
9722 TMPL is the template to consider and TARGS is the list of arguments of
9726 perform_typedefs_access_check (tree tmpl
, tree targs
)
9728 location_t saved_location
;
9730 qualified_typedef_usage_t
*iter
;
9733 || (!CLASS_TYPE_P (tmpl
)
9734 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9737 saved_location
= input_location
;
9738 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9740 tree type_decl
= iter
->typedef_decl
;
9741 tree type_scope
= iter
->context
;
9743 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9746 if (uses_template_parms (type_decl
))
9747 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9748 if (uses_template_parms (type_scope
))
9749 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9751 /* Make access check error messages point to the location
9752 of the use of the typedef. */
9753 input_location
= iter
->locus
;
9754 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9755 type_decl
, type_decl
,
9756 tf_warning_or_error
);
9758 input_location
= saved_location
;
9762 instantiate_class_template_1 (tree type
)
9764 tree templ
, args
, pattern
, t
, member
;
9768 unsigned int saved_maximum_field_alignment
;
9771 if (type
== error_mark_node
)
9772 return error_mark_node
;
9774 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9775 || uses_template_parms (type
))
9778 /* Figure out which template is being instantiated. */
9779 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9780 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9782 /* Determine what specialization of the original template to
9784 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9785 if (t
== error_mark_node
)
9787 TYPE_BEING_DEFINED (type
) = 1;
9788 return error_mark_node
;
9792 /* This TYPE is actually an instantiation of a partial
9793 specialization. We replace the innermost set of ARGS with
9794 the arguments appropriate for substitution. For example,
9797 template <class T> struct S {};
9798 template <class T> struct S<T*> {};
9800 and supposing that we are instantiating S<int*>, ARGS will
9801 presently be {int*} -- but we need {int}. */
9802 pattern
= TREE_TYPE (t
);
9803 args
= TREE_PURPOSE (t
);
9807 pattern
= TREE_TYPE (templ
);
9808 args
= CLASSTYPE_TI_ARGS (type
);
9811 /* If the template we're instantiating is incomplete, then clearly
9812 there's nothing we can do. */
9813 if (!COMPLETE_TYPE_P (pattern
))
9816 /* If we've recursively instantiated too many templates, stop. */
9817 if (! push_tinst_level (type
))
9820 /* Now we're really doing the instantiation. Mark the type as in
9821 the process of being defined. */
9822 TYPE_BEING_DEFINED (type
) = 1;
9824 /* We may be in the middle of deferred access check. Disable
9826 push_deferring_access_checks (dk_no_deferred
);
9828 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9829 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9831 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9832 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9833 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9834 fn_context
= error_mark_node
;
9836 push_to_top_level ();
9839 cp_unevaluated_operand
= 0;
9840 c_inhibit_evaluation_warnings
= 0;
9842 /* Use #pragma pack from the template context. */
9843 saved_maximum_field_alignment
= maximum_field_alignment
;
9844 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9846 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9848 /* Set the input location to the most specialized template definition.
9849 This is needed if tsubsting causes an error. */
9850 typedecl
= TYPE_MAIN_DECL (pattern
);
9851 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9852 DECL_SOURCE_LOCATION (typedecl
);
9854 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9855 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9856 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9857 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9858 if (ANON_AGGR_TYPE_P (pattern
))
9859 SET_ANON_AGGR_TYPE_P (type
);
9860 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9862 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9863 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9864 /* Adjust visibility for template arguments. */
9865 determine_visibility (TYPE_MAIN_DECL (type
));
9867 if (CLASS_TYPE_P (type
))
9868 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9870 pbinfo
= TYPE_BINFO (pattern
);
9872 /* We should never instantiate a nested class before its enclosing
9873 class; we need to look up the nested class by name before we can
9874 instantiate it, and that lookup should instantiate the enclosing
9876 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9877 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9879 base_list
= NULL_TREE
;
9880 if (BINFO_N_BASE_BINFOS (pbinfo
))
9886 /* We must enter the scope containing the type, as that is where
9887 the accessibility of types named in dependent bases are
9889 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9891 /* Substitute into each of the bases to determine the actual
9893 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9896 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9897 tree expanded_bases
= NULL_TREE
;
9900 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9903 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9904 args
, tf_error
, NULL_TREE
);
9905 if (expanded_bases
== error_mark_node
)
9908 len
= TREE_VEC_LENGTH (expanded_bases
);
9911 for (idx
= 0; idx
< len
; idx
++)
9914 /* Extract the already-expanded base class. */
9915 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9917 /* Substitute to figure out the base class. */
9918 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9921 if (base
== error_mark_node
)
9924 base_list
= tree_cons (access
, base
, base_list
);
9925 if (BINFO_VIRTUAL_P (pbase_binfo
))
9926 TREE_TYPE (base_list
) = integer_type_node
;
9930 /* The list is now in reverse order; correct that. */
9931 base_list
= nreverse (base_list
);
9934 pop_scope (pushed_scope
);
9936 /* Now call xref_basetypes to set up all the base-class
9938 xref_basetypes (type
, base_list
);
9940 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9941 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9942 args
, tf_error
, NULL_TREE
);
9943 fixup_attribute_variants (type
);
9945 /* Now that our base classes are set up, enter the scope of the
9946 class, so that name lookups into base classes, etc. will work
9947 correctly. This is precisely analogous to what we do in
9948 begin_class_definition when defining an ordinary non-template
9949 class, except we also need to push the enclosing classes. */
9950 push_nested_class (type
);
9952 /* Now members are processed in the order of declaration. */
9953 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9954 member
; member
= TREE_CHAIN (member
))
9956 tree t
= TREE_VALUE (member
);
9958 if (TREE_PURPOSE (member
))
9962 /* Build new CLASSTYPE_NESTED_UTDS. */
9965 bool class_template_p
;
9967 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9968 && TYPE_LANG_SPECIFIC (t
)
9969 && CLASSTYPE_IS_TEMPLATE (t
));
9970 /* If the member is a class template, then -- even after
9971 substitution -- there may be dependent types in the
9972 template argument list for the class. We increment
9973 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9974 that function will assume that no types are dependent
9975 when outside of a template. */
9976 if (class_template_p
)
9977 ++processing_template_decl
;
9978 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9979 if (class_template_p
)
9980 --processing_template_decl
;
9981 if (newtag
== error_mark_node
)
9984 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9986 tree name
= TYPE_IDENTIFIER (t
);
9988 if (class_template_p
)
9989 /* Unfortunately, lookup_template_class sets
9990 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9991 instantiation (i.e., for the type of a member
9992 template class nested within a template class.)
9993 This behavior is required for
9994 maybe_process_partial_specialization to work
9995 correctly, but is not accurate in this case;
9996 the TAG is not an instantiation of anything.
9997 (The corresponding TEMPLATE_DECL is an
9998 instantiation, but the TYPE is not.) */
9999 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
10001 /* Now, we call pushtag to put this NEWTAG into the scope of
10002 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
10003 pushtag calling push_template_decl. We don't have to do
10004 this for enums because it will already have been done in
10007 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
10008 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
10011 else if (DECL_DECLARES_FUNCTION_P (t
))
10013 /* Build new TYPE_METHODS. */
10016 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10017 ++processing_template_decl
;
10018 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
10019 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10020 --processing_template_decl
;
10021 set_current_access_from_decl (r
);
10022 finish_member_declaration (r
);
10023 /* Instantiate members marked with attribute used. */
10024 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10026 if (TREE_CODE (r
) == FUNCTION_DECL
10027 && DECL_OMP_DECLARE_REDUCTION_P (r
))
10028 cp_check_omp_declare_reduction (r
);
10030 else if (DECL_CLASS_TEMPLATE_P (t
)
10031 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
10032 /* A closure type for a lambda in a default argument for a
10033 member template. Ignore it; it will be instantiated with
10034 the default argument. */;
10037 /* Build new TYPE_FIELDS. */
10038 if (TREE_CODE (t
) == STATIC_ASSERT
)
10042 ++c_inhibit_evaluation_warnings
;
10044 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
10045 tf_warning_or_error
, NULL_TREE
,
10046 /*integral_constant_expression_p=*/true);
10047 --c_inhibit_evaluation_warnings
;
10049 finish_static_assert (condition
,
10050 STATIC_ASSERT_MESSAGE (t
),
10051 STATIC_ASSERT_SOURCE_LOCATION (t
),
10052 /*member_p=*/true);
10054 else if (TREE_CODE (t
) != CONST_DECL
)
10057 tree vec
= NULL_TREE
;
10060 /* The file and line for this declaration, to
10061 assist in error message reporting. Since we
10062 called push_tinst_level above, we don't need to
10064 input_location
= DECL_SOURCE_LOCATION (t
);
10066 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10067 ++processing_template_decl
;
10068 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
10069 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10070 --processing_template_decl
;
10072 if (TREE_CODE (r
) == TREE_VEC
)
10074 /* A capture pack became multiple fields. */
10076 len
= TREE_VEC_LENGTH (vec
);
10079 for (int i
= 0; i
< len
; ++i
)
10082 r
= TREE_VEC_ELT (vec
, i
);
10087 [t]he initialization (and any associated
10088 side-effects) of a static data member does
10089 not occur unless the static data member is
10090 itself used in a way that requires the
10091 definition of the static data member to
10094 Therefore, we do not substitute into the
10095 initialized for the static data member here. */
10096 finish_static_data_member_decl
10098 /*init=*/NULL_TREE
,
10099 /*init_const_expr_p=*/false,
10100 /*asmspec_tree=*/NULL_TREE
,
10102 /* Instantiate members marked with attribute used. */
10103 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10106 else if (TREE_CODE (r
) == FIELD_DECL
)
10108 /* Determine whether R has a valid type and can be
10109 completed later. If R is invalid, then its type
10110 is replaced by error_mark_node. */
10111 tree rtype
= TREE_TYPE (r
);
10112 if (can_complete_type_without_circularity (rtype
))
10113 complete_type (rtype
);
10115 if (TREE_CODE (r
) == FIELD_DECL
10116 && TREE_CODE (rtype
) == ARRAY_TYPE
10117 && COMPLETE_TYPE_P (TREE_TYPE (rtype
))
10118 && !COMPLETE_TYPE_P (rtype
))
10120 /* Flexible array mmembers of elements
10121 of complete type have an incomplete type
10122 and that's okay. */
10124 else if (!COMPLETE_TYPE_P (rtype
))
10126 cxx_incomplete_type_error (r
, rtype
);
10127 TREE_TYPE (r
) = error_mark_node
;
10131 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10132 such a thing will already have been added to the field
10133 list by tsubst_enum in finish_member_declaration in the
10134 CLASSTYPE_NESTED_UTDS case above. */
10135 if (!(TREE_CODE (r
) == TYPE_DECL
10136 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10137 && DECL_ARTIFICIAL (r
)))
10139 set_current_access_from_decl (r
);
10140 finish_member_declaration (r
);
10148 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10149 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10151 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10153 tree friend_type
= t
;
10154 bool adjust_processing_template_decl
= false;
10156 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10158 /* template <class T> friend class C; */
10159 friend_type
= tsubst_friend_class (friend_type
, args
);
10160 adjust_processing_template_decl
= true;
10162 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10164 /* template <class T> friend class C::D; */
10165 friend_type
= tsubst (friend_type
, args
,
10166 tf_warning_or_error
, NULL_TREE
);
10167 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10168 friend_type
= TREE_TYPE (friend_type
);
10169 adjust_processing_template_decl
= true;
10171 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10172 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10174 /* This could be either
10178 when dependent_type_p is false or
10180 template <class U> friend class T::C;
10183 friend_type
= tsubst (friend_type
, args
,
10184 tf_warning_or_error
, NULL_TREE
);
10185 /* Bump processing_template_decl for correct
10186 dependent_type_p calculation. */
10187 ++processing_template_decl
;
10188 if (dependent_type_p (friend_type
))
10189 adjust_processing_template_decl
= true;
10190 --processing_template_decl
;
10192 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10193 && hidden_name_p (TYPE_NAME (friend_type
)))
10197 where C hasn't been declared yet. Let's lookup name
10198 from namespace scope directly, bypassing any name that
10199 come from dependent base class. */
10200 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10202 /* The call to xref_tag_from_type does injection for friend
10204 push_nested_namespace (ns
);
10206 xref_tag_from_type (friend_type
, NULL_TREE
,
10207 /*tag_scope=*/ts_current
);
10208 pop_nested_namespace (ns
);
10210 else if (uses_template_parms (friend_type
))
10211 /* friend class C<T>; */
10212 friend_type
= tsubst (friend_type
, args
,
10213 tf_warning_or_error
, NULL_TREE
);
10218 where C is already declared or
10220 friend class C<int>;
10222 We don't have to do anything in these cases. */
10224 if (adjust_processing_template_decl
)
10225 /* Trick make_friend_class into realizing that the friend
10226 we're adding is a template, not an ordinary class. It's
10227 important that we use make_friend_class since it will
10228 perform some error-checking and output cross-reference
10230 ++processing_template_decl
;
10232 if (friend_type
!= error_mark_node
)
10233 make_friend_class (type
, friend_type
, /*complain=*/false);
10235 if (adjust_processing_template_decl
)
10236 --processing_template_decl
;
10240 /* Build new DECL_FRIENDLIST. */
10243 /* The file and line for this declaration, to
10244 assist in error message reporting. Since we
10245 called push_tinst_level above, we don't need to
10247 input_location
= DECL_SOURCE_LOCATION (t
);
10249 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10251 ++processing_template_decl
;
10252 push_deferring_access_checks (dk_no_check
);
10255 r
= tsubst_friend_function (t
, args
);
10256 add_friend (type
, r
, /*complain=*/false);
10257 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10259 pop_deferring_access_checks ();
10260 --processing_template_decl
;
10268 /* Restore these before substituting into the lambda capture
10270 cp_unevaluated_operand
= saved_unevaluated_operand
;
10271 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10274 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10276 tree decl
= lambda_function (type
);
10279 if (!DECL_TEMPLATE_INFO (decl
)
10280 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10282 /* Set function_depth to avoid garbage collection. */
10284 instantiate_decl (decl
, false, false);
10288 /* We need to instantiate the capture list from the template
10289 after we've instantiated the closure members, but before we
10290 consider adding the conversion op. Also keep any captures
10291 that may have been added during instantiation of the op(). */
10292 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10294 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10295 args
, tf_warning_or_error
, NULL_TREE
,
10298 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10299 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10301 maybe_add_lambda_conv_op (type
);
10304 gcc_assert (errorcount
);
10307 /* Set the file and line number information to whatever is given for
10308 the class itself. This puts error messages involving generated
10309 implicit functions at a predictable point, and the same point
10310 that would be used for non-template classes. */
10311 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10313 unreverse_member_declarations (type
);
10314 finish_struct_1 (type
);
10315 TYPE_BEING_DEFINED (type
) = 0;
10317 /* We don't instantiate default arguments for member functions. 14.7.1:
10319 The implicit instantiation of a class template specialization causes
10320 the implicit instantiation of the declarations, but not of the
10321 definitions or default arguments, of the class member functions,
10322 member classes, static data members and member templates.... */
10324 /* Some typedefs referenced from within the template code need to be access
10325 checked at template instantiation time, i.e now. These types were
10326 added to the template at parsing time. Let's get those and perform
10327 the access checks then. */
10328 perform_typedefs_access_check (pattern
, args
);
10329 perform_deferred_access_checks (tf_warning_or_error
);
10330 pop_nested_class ();
10331 maximum_field_alignment
= saved_maximum_field_alignment
;
10333 pop_from_top_level ();
10334 pop_deferring_access_checks ();
10335 pop_tinst_level ();
10337 /* The vtable for a template class can be emitted in any translation
10338 unit in which the class is instantiated. When there is no key
10339 method, however, finish_struct_1 will already have added TYPE to
10340 the keyed_classes list. */
10341 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10342 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10347 /* Wrapper for instantiate_class_template_1. */
10350 instantiate_class_template (tree type
)
10353 timevar_push (TV_TEMPLATE_INST
);
10354 ret
= instantiate_class_template_1 (type
);
10355 timevar_pop (TV_TEMPLATE_INST
);
10360 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10366 else if (TYPE_P (t
))
10367 r
= tsubst (t
, args
, complain
, in_decl
);
10370 if (!(complain
& tf_warning
))
10371 ++c_inhibit_evaluation_warnings
;
10372 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10373 /*integral_constant_expression_p=*/true);
10374 if (!(complain
& tf_warning
))
10375 --c_inhibit_evaluation_warnings
;
10380 /* Given a function parameter pack TMPL_PARM and some function parameters
10381 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10382 and set *SPEC_P to point at the next point in the list. */
10385 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10387 /* Collect all of the extra "packed" parameters into an
10391 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10392 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10393 tree spec_parm
= *spec_p
;
10396 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10398 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10401 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10402 parmvec
= make_tree_vec (len
);
10403 parmtypevec
= make_tree_vec (len
);
10404 spec_parm
= *spec_p
;
10405 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10407 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10408 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10411 /* Build the argument packs. */
10412 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10413 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10414 TREE_TYPE (argpack
) = argtypepack
;
10415 *spec_p
= spec_parm
;
10420 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10421 NONTYPE_ARGUMENT_PACK. */
10424 make_fnparm_pack (tree spec_parm
)
10426 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10429 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10430 pack expansion with no extra args, 2 if it has extra args, or 0
10431 if it is not a pack expansion. */
10434 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10436 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10437 if (i
>= TREE_VEC_LENGTH (vec
))
10439 tree elt
= TREE_VEC_ELT (vec
, i
);
10441 /* A decl pack is itself an expansion. */
10442 elt
= TREE_TYPE (elt
);
10443 if (!PACK_EXPANSION_P (elt
))
10445 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10451 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10454 make_argument_pack_select (tree arg_pack
, unsigned index
)
10456 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10458 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10459 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10464 /* This is a subroutine of tsubst_pack_expansion.
10466 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10467 mechanism to store the (non complete list of) arguments of the
10468 substitution and return a non substituted pack expansion, in order
10469 to wait for when we have enough arguments to really perform the
10473 use_pack_expansion_extra_args_p (tree parm_packs
,
10475 bool has_empty_arg
)
10477 /* If one pack has an expansion and another pack has a normal
10478 argument or if one pack has an empty argument and an another
10479 one hasn't then tsubst_pack_expansion cannot perform the
10480 substitution and need to fall back on the
10481 PACK_EXPANSION_EXTRA mechanism. */
10482 if (parm_packs
== NULL_TREE
)
10484 else if (has_empty_arg
)
10487 bool has_expansion_arg
= false;
10488 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10490 bool has_non_expansion_arg
= false;
10491 for (tree parm_pack
= parm_packs
;
10493 parm_pack
= TREE_CHAIN (parm_pack
))
10495 tree arg
= TREE_VALUE (parm_pack
);
10497 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10499 /* We can't substitute a pack expansion with extra args into
10503 has_expansion_arg
= true;
10505 has_non_expansion_arg
= true;
10508 if (has_expansion_arg
&& has_non_expansion_arg
)
10514 /* [temp.variadic]/6 says that:
10516 The instantiation of a pack expansion [...]
10517 produces a list E1,E2, ..., En, where N is the number of elements
10518 in the pack expansion parameters.
10520 This subroutine of tsubst_pack_expansion produces one of these Ei.
10522 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10523 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10524 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10525 INDEX is the index 'i' of the element Ei to produce. ARGS,
10526 COMPLAIN, and IN_DECL are the same parameters as for the
10527 tsubst_pack_expansion function.
10529 The function returns the resulting Ei upon successful completion,
10530 or error_mark_node.
10532 Note that this function possibly modifies the ARGS parameter, so
10533 it's the responsibility of the caller to restore it. */
10536 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10539 tree args
/* This parm gets
10541 tsubst_flags_t complain
,
10545 bool ith_elem_is_expansion
= false;
10547 /* For each parameter pack, change the substitution of the parameter
10548 pack to the ith argument in its argument pack, then expand the
10550 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10552 tree parm
= TREE_PURPOSE (pack
);
10553 tree arg_pack
= TREE_VALUE (pack
);
10554 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10556 ith_elem_is_expansion
|=
10557 argument_pack_element_is_expansion_p (arg_pack
, index
);
10559 /* Select the Ith argument from the pack. */
10560 if (TREE_CODE (parm
) == PARM_DECL
10561 || TREE_CODE (parm
) == FIELD_DECL
)
10565 aps
= make_argument_pack_select (arg_pack
, index
);
10566 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10567 return error_mark_node
;
10568 register_local_specialization (aps
, parm
);
10571 aps
= retrieve_local_specialization (parm
);
10576 template_parm_level_and_index (parm
, &level
, &idx
);
10580 aps
= make_argument_pack_select (arg_pack
, index
);
10581 /* Update the corresponding argument. */
10582 TMPL_ARG (args
, level
, idx
) = aps
;
10585 /* Re-use the ARGUMENT_PACK_SELECT. */
10586 aps
= TMPL_ARG (args
, level
, idx
);
10588 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10591 /* Substitute into the PATTERN with the (possibly altered)
10593 if (pattern
== in_decl
)
10594 /* Expanding a fixed parameter pack from
10595 coerce_template_parameter_pack. */
10596 t
= tsubst_decl (pattern
, args
, complain
);
10597 else if (pattern
== error_mark_node
)
10598 t
= error_mark_node
;
10599 else if (constraint_p (pattern
))
10601 if (processing_template_decl
)
10602 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10604 t
= (constraints_satisfied_p (pattern
, args
)
10605 ? boolean_true_node
: boolean_false_node
);
10607 else if (!TYPE_P (pattern
))
10608 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10609 /*integral_constant_expression_p=*/false);
10611 t
= tsubst (pattern
, args
, complain
, in_decl
);
10613 /* If the Ith argument pack element is a pack expansion, then
10614 the Ith element resulting from the substituting is going to
10615 be a pack expansion as well. */
10616 if (ith_elem_is_expansion
)
10617 t
= make_pack_expansion (t
);
10622 /* When the unexpanded parameter pack in a fold expression expands to an empty
10623 sequence, the value of the expression is as follows; the program is
10624 ill-formed if the operator is not listed in this table.
10635 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10637 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10638 if (!FOLD_EXPR_MODIFY_P (t
))
10642 return integer_one_node
;
10644 return integer_zero_node
;
10646 return integer_minus_one_node
;
10648 return integer_zero_node
;
10649 case TRUTH_ANDIF_EXPR
:
10650 return boolean_true_node
;
10651 case TRUTH_ORIF_EXPR
:
10652 return boolean_false_node
;
10653 case COMPOUND_EXPR
:
10659 if (complain
& tf_error
)
10660 error_at (location_of (t
),
10661 "fold of empty expansion over %O", code
);
10662 return error_mark_node
;
10665 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10666 form an expression that combines the two terms using the
10670 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10672 tree op
= FOLD_EXPR_OP (t
);
10673 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10675 // Handle compound assignment operators.
10676 if (FOLD_EXPR_MODIFY_P (t
))
10677 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10681 case COMPOUND_EXPR
:
10682 return build_x_compound_expr (input_location
, left
, right
, complain
);
10684 return build_m_component_ref (left
, right
, complain
);
10686 return build_x_binary_op (input_location
, code
,
10687 left
, TREE_CODE (left
),
10688 right
, TREE_CODE (right
),
10694 /* Substitute ARGS into the pack of a fold expression T. */
10697 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10699 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10702 /* Substitute ARGS into the pack of a fold expression T. */
10705 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10707 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10710 /* Expand a PACK of arguments into a grouped as left fold.
10711 Given a pack containing elements A0, A1, ..., An and an
10712 operator @, this builds the expression:
10714 ((A0 @ A1) @ A2) ... @ An
10716 Note that PACK must not be empty.
10718 The operator is defined by the original fold expression T. */
10721 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10723 tree left
= TREE_VEC_ELT (pack
, 0);
10724 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10726 tree right
= TREE_VEC_ELT (pack
, i
);
10727 left
= fold_expression (t
, left
, right
, complain
);
10732 /* Substitute into a unary left fold expression. */
10735 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10738 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10739 if (pack
== error_mark_node
)
10740 return error_mark_node
;
10741 if (TREE_VEC_LENGTH (pack
) == 0)
10742 return expand_empty_fold (t
, complain
);
10744 return expand_left_fold (t
, pack
, complain
);
10747 /* Substitute into a binary left fold expression.
10749 Do ths by building a single (non-empty) vector of argumnts and
10750 building the expression from those elements. */
10753 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10756 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10757 if (pack
== error_mark_node
)
10758 return error_mark_node
;
10759 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10760 if (init
== error_mark_node
)
10761 return error_mark_node
;
10763 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10764 TREE_VEC_ELT (vec
, 0) = init
;
10765 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10766 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10768 return expand_left_fold (t
, vec
, complain
);
10771 /* Expand a PACK of arguments into a grouped as right fold.
10772 Given a pack containing elementns A0, A1, ..., and an
10773 operator @, this builds the expression:
10775 A0@ ... (An-2 @ (An-1 @ An))
10777 Note that PACK must not be empty.
10779 The operator is defined by the original fold expression T. */
10782 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10784 // Build the expression.
10785 int n
= TREE_VEC_LENGTH (pack
);
10786 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10787 for (--n
; n
!= 0; --n
)
10789 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10790 right
= fold_expression (t
, left
, right
, complain
);
10795 /* Substitute into a unary right fold expression. */
10798 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10801 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10802 if (pack
== error_mark_node
)
10803 return error_mark_node
;
10804 if (TREE_VEC_LENGTH (pack
) == 0)
10805 return expand_empty_fold (t
, complain
);
10807 return expand_right_fold (t
, pack
, complain
);
10810 /* Substitute into a binary right fold expression.
10812 Do ths by building a single (non-empty) vector of arguments and
10813 building the expression from those elements. */
10816 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10819 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10820 if (pack
== error_mark_node
)
10821 return error_mark_node
;
10822 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10823 if (init
== error_mark_node
)
10824 return error_mark_node
;
10826 int n
= TREE_VEC_LENGTH (pack
);
10827 tree vec
= make_tree_vec (n
+ 1);
10828 for (int i
= 0; i
< n
; ++i
)
10829 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10830 TREE_VEC_ELT (vec
, n
) = init
;
10832 return expand_right_fold (t
, vec
, complain
);
10836 /* Substitute ARGS into T, which is an pack expansion
10837 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10838 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10839 (if only a partial substitution could be performed) or
10840 ERROR_MARK_NODE if there was an error. */
10842 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10846 tree pack
, packs
= NULL_TREE
;
10847 bool unsubstituted_packs
= false;
10850 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10851 bool need_local_specializations
= false;
10854 gcc_assert (PACK_EXPANSION_P (t
));
10855 pattern
= PACK_EXPANSION_PATTERN (t
);
10857 /* Add in any args remembered from an earlier partial instantiation. */
10858 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10860 levels
= TMPL_ARGS_DEPTH (args
);
10862 /* Determine the argument packs that will instantiate the parameter
10863 packs used in the expansion expression. While we're at it,
10864 compute the number of arguments to be expanded and make sure it
10866 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10867 pack
= TREE_CHAIN (pack
))
10869 tree parm_pack
= TREE_VALUE (pack
);
10870 tree arg_pack
= NULL_TREE
;
10871 tree orig_arg
= NULL_TREE
;
10874 if (TREE_CODE (parm_pack
) == BASES
)
10876 if (BASES_DIRECT (parm_pack
))
10877 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10878 args
, complain
, in_decl
, false));
10880 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10881 args
, complain
, in_decl
, false));
10883 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10885 /* We know we have correct local_specializations if this
10886 expansion is at function scope, or if we're dealing with a
10887 local parameter in a requires expression; for the latter,
10888 tsubst_requires_expr set it up appropriately. */
10889 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10890 arg_pack
= retrieve_local_specialization (parm_pack
);
10892 /* We can't rely on local_specializations for a parameter
10893 name used later in a function declaration (such as in a
10894 late-specified return type). Even if it exists, it might
10895 have the wrong value for a recursive call. */
10896 need_local_specializations
= true;
10900 /* This parameter pack was used in an unevaluated context. Just
10901 make a dummy decl, since it's only used for its type. */
10902 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10903 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10904 /* Partial instantiation of the parm_pack, we can't build
10905 up an argument pack yet. */
10906 arg_pack
= NULL_TREE
;
10908 arg_pack
= make_fnparm_pack (arg_pack
);
10911 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10912 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10916 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10918 if (level
<= levels
)
10919 arg_pack
= TMPL_ARG (args
, level
, idx
);
10922 orig_arg
= arg_pack
;
10923 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10924 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10926 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10927 /* This can only happen if we forget to expand an argument
10928 pack somewhere else. Just return an error, silently. */
10930 result
= make_tree_vec (1);
10931 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10938 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10940 /* Don't bother trying to do a partial substitution with
10941 incomplete packs; we'll try again after deduction. */
10942 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10947 else if (len
!= my_len
)
10949 if (!(complain
& tf_error
))
10950 /* Fail quietly. */;
10951 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10952 error ("mismatched argument pack lengths while expanding "
10956 error ("mismatched argument pack lengths while expanding "
10959 return error_mark_node
;
10962 /* Keep track of the parameter packs and their corresponding
10964 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10965 TREE_TYPE (packs
) = orig_arg
;
10969 /* We can't substitute for this parameter pack. We use a flag as
10970 well as the missing_level counter because function parameter
10971 packs don't have a level. */
10972 unsubstituted_packs
= true;
10976 /* If the expansion is just T..., return the matching argument pack, unless
10977 we need to call convert_from_reference on all the elements. This is an
10978 important optimization; see c++/68422. */
10979 if (!unsubstituted_packs
10980 && TREE_PURPOSE (packs
) == pattern
)
10982 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10983 /* Types need no adjustment, nor does sizeof..., and if we still have
10984 some pack expansion args we won't do anything yet. */
10985 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10986 || PACK_EXPANSION_SIZEOF_P (t
)
10987 || pack_expansion_args_count (args
))
10989 /* Also optimize expression pack expansions if we can tell that the
10990 elements won't have reference type. */
10991 tree type
= TREE_TYPE (pattern
);
10992 if (type
&& TREE_CODE (type
) != REFERENCE_TYPE
10993 && !PACK_EXPANSION_P (type
)
10994 && !WILDCARD_TYPE_P (type
))
10996 /* Otherwise use the normal path so we get convert_from_reference. */
10999 /* We cannot expand this expansion expression, because we don't have
11000 all of the argument packs we need. */
11001 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
11003 /* We got some full packs, but we can't substitute them in until we
11004 have values for all the packs. So remember these until then. */
11006 t
= make_pack_expansion (pattern
);
11007 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
11010 else if (unsubstituted_packs
)
11012 /* There were no real arguments, we're just replacing a parameter
11013 pack with another version of itself. Substitute into the
11014 pattern and return a PACK_EXPANSION_*. The caller will need to
11016 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
11017 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11018 /*integral_constant_expression_p=*/false);
11020 t
= tsubst (pattern
, args
, complain
, in_decl
);
11021 t
= make_pack_expansion (t
);
11025 gcc_assert (len
>= 0);
11027 if (need_local_specializations
)
11029 /* We're in a late-specified return type, so create our own local
11030 specializations map; the current map is either NULL or (in the
11031 case of recursive unification) might have bindings that we don't
11032 want to use or alter. */
11033 saved_local_specializations
= local_specializations
;
11034 local_specializations
= new hash_map
<tree
, tree
>;
11037 /* For each argument in each argument pack, substitute into the
11039 result
= make_tree_vec (len
);
11040 for (i
= 0; i
< len
; ++i
)
11042 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
11046 TREE_VEC_ELT (result
, i
) = t
;
11047 if (t
== error_mark_node
)
11049 result
= error_mark_node
;
11054 /* Update ARGS to restore the substitution from parameter packs to
11055 their argument packs. */
11056 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
11058 tree parm
= TREE_PURPOSE (pack
);
11060 if (TREE_CODE (parm
) == PARM_DECL
11061 || TREE_CODE (parm
) == FIELD_DECL
)
11062 register_local_specialization (TREE_TYPE (pack
), parm
);
11067 if (TREE_VALUE (pack
) == NULL_TREE
)
11070 template_parm_level_and_index (parm
, &level
, &idx
);
11072 /* Update the corresponding argument. */
11073 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
11074 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
11077 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
11081 if (need_local_specializations
)
11083 delete local_specializations
;
11084 local_specializations
= saved_local_specializations
;
11090 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
11091 TMPL. We do this using DECL_PARM_INDEX, which should work even with
11092 parameter packs; all parms generated from a function parameter pack will
11093 have the same DECL_PARM_INDEX. */
11096 get_pattern_parm (tree parm
, tree tmpl
)
11098 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
11101 if (DECL_ARTIFICIAL (parm
))
11103 for (patparm
= DECL_ARGUMENTS (pattern
);
11104 patparm
; patparm
= DECL_CHAIN (patparm
))
11105 if (DECL_ARTIFICIAL (patparm
)
11106 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11111 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11112 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11113 gcc_assert (DECL_PARM_INDEX (patparm
)
11114 == DECL_PARM_INDEX (parm
));
11120 /* Substitute ARGS into the vector or list of template arguments T. */
11123 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11126 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11129 if (t
== error_mark_node
)
11130 return error_mark_node
;
11132 len
= TREE_VEC_LENGTH (t
);
11133 elts
= XALLOCAVEC (tree
, len
);
11135 for (i
= 0; i
< len
; i
++)
11137 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11140 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11141 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11142 else if (PACK_EXPANSION_P (orig_arg
))
11144 /* Substitute into an expansion expression. */
11145 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11147 if (TREE_CODE (new_arg
) == TREE_VEC
)
11148 /* Add to the expanded length adjustment the number of
11149 expanded arguments. We subtract one from this
11150 measurement, because the argument pack expression
11151 itself is already counted as 1 in
11152 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11153 the argument pack is empty. */
11154 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11156 else if (ARGUMENT_PACK_P (orig_arg
))
11158 /* Substitute into each of the arguments. */
11159 new_arg
= TYPE_P (orig_arg
)
11160 ? cxx_make_type (TREE_CODE (orig_arg
))
11161 : make_node (TREE_CODE (orig_arg
));
11163 SET_ARGUMENT_PACK_ARGS (
11165 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11166 args
, complain
, in_decl
));
11168 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11169 new_arg
= error_mark_node
;
11171 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11172 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11173 complain
, in_decl
);
11174 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11176 if (TREE_TYPE (new_arg
) == error_mark_node
)
11177 new_arg
= error_mark_node
;
11181 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11183 if (new_arg
== error_mark_node
)
11184 return error_mark_node
;
11187 if (new_arg
!= orig_arg
)
11194 /* Make space for the expanded arguments coming from template
11196 t
= make_tree_vec (len
+ expanded_len_adjust
);
11197 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11198 arguments for a member template.
11199 In that case each TREE_VEC in ORIG_T represents a level of template
11200 arguments, and ORIG_T won't carry any non defaulted argument count.
11201 It will rather be the nested TREE_VECs that will carry one.
11202 In other words, ORIG_T carries a non defaulted argument count only
11203 if it doesn't contain any nested TREE_VEC. */
11204 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11206 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11207 count
+= expanded_len_adjust
;
11208 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11210 for (i
= 0, out
= 0; i
< len
; i
++)
11212 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11213 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11214 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11218 /* Now expand the template argument pack "in place". */
11219 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11220 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11224 TREE_VEC_ELT (t
, out
) = elts
[i
];
11232 /* Return the result of substituting ARGS into the template parameters
11233 given by PARMS. If there are m levels of ARGS and m + n levels of
11234 PARMS, then the result will contain n levels of PARMS. For
11235 example, if PARMS is `template <class T> template <class U>
11236 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11237 result will be `template <int*, double, class V>'. */
11240 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11242 tree r
= NULL_TREE
;
11245 /* When substituting into a template, we must set
11246 PROCESSING_TEMPLATE_DECL as the template parameters may be
11247 dependent if they are based on one-another, and the dependency
11248 predicates are short-circuit outside of templates. */
11249 ++processing_template_decl
;
11251 for (new_parms
= &r
;
11252 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11253 new_parms
= &(TREE_CHAIN (*new_parms
)),
11254 parms
= TREE_CHAIN (parms
))
11257 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11260 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11264 if (parms
== error_mark_node
)
11267 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11269 if (tuple
== error_mark_node
)
11272 TREE_VEC_ELT (new_vec
, i
) =
11273 tsubst_template_parm (tuple
, args
, complain
);
11277 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11278 - TMPL_ARGS_DEPTH (args
)),
11279 new_vec
, NULL_TREE
);
11282 --processing_template_decl
;
11287 /* Return the result of substituting ARGS into one template parameter
11288 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11289 parameter and which TREE_PURPOSE is the default argument of the
11290 template parameter. */
11293 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11295 tree default_value
, parm_decl
;
11297 if (args
== NULL_TREE
11299 || t
== error_mark_node
)
11302 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11304 default_value
= TREE_PURPOSE (t
);
11305 parm_decl
= TREE_VALUE (t
);
11307 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11308 if (TREE_CODE (parm_decl
) == PARM_DECL
11309 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11310 parm_decl
= error_mark_node
;
11311 default_value
= tsubst_template_arg (default_value
, args
,
11312 complain
, NULL_TREE
);
11314 return build_tree_list (default_value
, parm_decl
);
11317 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11318 type T. If T is not an aggregate or enumeration type, it is
11319 handled as if by tsubst. IN_DECL is as for tsubst. If
11320 ENTERING_SCOPE is nonzero, T is the context for a template which
11321 we are presently tsubst'ing. Return the substituted value. */
11324 tsubst_aggr_type (tree t
,
11326 tsubst_flags_t complain
,
11328 int entering_scope
)
11330 if (t
== NULL_TREE
)
11333 switch (TREE_CODE (t
))
11336 if (TYPE_PTRMEMFUNC_P (t
))
11337 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11339 /* Else fall through. */
11340 case ENUMERAL_TYPE
:
11342 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11347 int saved_unevaluated_operand
;
11348 int saved_inhibit_evaluation_warnings
;
11350 /* In "sizeof(X<I>)" we need to evaluate "I". */
11351 saved_unevaluated_operand
= cp_unevaluated_operand
;
11352 cp_unevaluated_operand
= 0;
11353 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11354 c_inhibit_evaluation_warnings
= 0;
11356 /* First, determine the context for the type we are looking
11358 context
= TYPE_CONTEXT (t
);
11359 if (context
&& TYPE_P (context
))
11361 context
= tsubst_aggr_type (context
, args
, complain
,
11362 in_decl
, /*entering_scope=*/1);
11363 /* If context is a nested class inside a class template,
11364 it may still need to be instantiated (c++/33959). */
11365 context
= complete_type (context
);
11368 /* Then, figure out what arguments are appropriate for the
11369 type we are trying to find. For example, given:
11371 template <class T> struct S;
11372 template <class T, class U> void f(T, U) { S<U> su; }
11374 and supposing that we are instantiating f<int, double>,
11375 then our ARGS will be {int, double}, but, when looking up
11376 S we only want {double}. */
11377 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11378 complain
, in_decl
);
11379 if (argvec
== error_mark_node
)
11380 r
= error_mark_node
;
11383 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11384 entering_scope
, complain
);
11385 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11388 cp_unevaluated_operand
= saved_unevaluated_operand
;
11389 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11394 /* This is not a template type, so there's nothing to do. */
11398 return tsubst (t
, args
, complain
, in_decl
);
11402 /* Substitute into the default argument ARG (a default argument for
11403 FN), which has the indicated TYPE. */
11406 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11408 tree saved_class_ptr
= NULL_TREE
;
11409 tree saved_class_ref
= NULL_TREE
;
11410 int errs
= errorcount
+ sorrycount
;
11412 /* This can happen in invalid code. */
11413 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11416 /* This default argument came from a template. Instantiate the
11417 default argument here, not in tsubst. In the case of
11426 we must be careful to do name lookup in the scope of S<T>,
11427 rather than in the current class. */
11428 push_access_scope (fn
);
11429 /* The "this" pointer is not valid in a default argument. */
11432 saved_class_ptr
= current_class_ptr
;
11433 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11434 saved_class_ref
= current_class_ref
;
11435 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11438 push_deferring_access_checks(dk_no_deferred
);
11439 /* The default argument expression may cause implicitly defined
11440 member functions to be synthesized, which will result in garbage
11441 collection. We must treat this situation as if we were within
11442 the body of function so as to avoid collecting live data on the
11445 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11446 complain
, NULL_TREE
,
11447 /*integral_constant_expression_p=*/false);
11449 pop_deferring_access_checks();
11451 /* Restore the "this" pointer. */
11454 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11455 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11458 if (errorcount
+sorrycount
> errs
11459 && (complain
& tf_warning_or_error
))
11460 inform (input_location
,
11461 " when instantiating default argument for call to %D", fn
);
11463 /* Make sure the default argument is reasonable. */
11464 arg
= check_default_argument (type
, arg
, complain
);
11466 pop_access_scope (fn
);
11471 /* Substitute into all the default arguments for FN. */
11474 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11479 tmpl_args
= DECL_TI_ARGS (fn
);
11481 /* If this function is not yet instantiated, we certainly don't need
11482 its default arguments. */
11483 if (uses_template_parms (tmpl_args
))
11485 /* Don't do this again for clones. */
11486 if (DECL_CLONED_FUNCTION_P (fn
))
11489 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11491 arg
= TREE_CHAIN (arg
))
11492 if (TREE_PURPOSE (arg
))
11493 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11495 TREE_PURPOSE (arg
),
11499 /* Substitute the ARGS into the T, which is a _DECL. Return the
11500 result of the substitution. Issue error and warning messages under
11501 control of COMPLAIN. */
11504 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11506 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11507 location_t saved_loc
;
11508 tree r
= NULL_TREE
;
11510 hashval_t hash
= 0;
11512 /* Set the filename and linenumber to improve error-reporting. */
11513 saved_loc
= input_location
;
11514 input_location
= DECL_SOURCE_LOCATION (t
);
11516 switch (TREE_CODE (t
))
11518 case TEMPLATE_DECL
:
11520 /* We can get here when processing a member function template,
11521 member class template, or template template parameter. */
11522 tree decl
= DECL_TEMPLATE_RESULT (t
);
11527 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11529 /* Template template parameter is treated here. */
11530 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11531 if (new_type
== error_mark_node
)
11532 r
= error_mark_node
;
11533 /* If we get a real template back, return it. This can happen in
11534 the context of most_specialized_partial_spec. */
11535 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11538 /* The new TEMPLATE_DECL was built in
11539 reduce_template_parm_level. */
11540 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11544 /* We might already have an instance of this template.
11545 The ARGS are for the surrounding class type, so the
11546 full args contain the tsubst'd args for the context,
11547 plus the innermost args from the template decl. */
11548 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11549 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11550 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11551 /* Because this is a template, the arguments will still be
11552 dependent, even after substitution. If
11553 PROCESSING_TEMPLATE_DECL is not set, the dependency
11554 predicates will short-circuit. */
11555 ++processing_template_decl
;
11556 full_args
= tsubst_template_args (tmpl_args
, args
,
11557 complain
, in_decl
);
11558 --processing_template_decl
;
11559 if (full_args
== error_mark_node
)
11560 RETURN (error_mark_node
);
11562 /* If this is a default template template argument,
11563 tsubst might not have changed anything. */
11564 if (full_args
== tmpl_args
)
11567 hash
= hash_tmpl_and_args (t
, full_args
);
11568 spec
= retrieve_specialization (t
, full_args
, hash
);
11569 if (spec
!= NULL_TREE
)
11575 /* Make a new template decl. It will be similar to the
11576 original, but will record the current template arguments.
11577 We also create a new function declaration, which is just
11578 like the old one, but points to this new template, rather
11579 than the old one. */
11581 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11582 DECL_CHAIN (r
) = NULL_TREE
;
11584 // Build new template info linking to the original template decl.
11585 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11587 if (TREE_CODE (decl
) == TYPE_DECL
11588 && !TYPE_DECL_ALIAS_P (decl
))
11591 ++processing_template_decl
;
11592 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11593 --processing_template_decl
;
11594 if (new_type
== error_mark_node
)
11595 RETURN (error_mark_node
);
11597 TREE_TYPE (r
) = new_type
;
11598 /* For a partial specialization, we need to keep pointing to
11599 the primary template. */
11600 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11601 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11602 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11603 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11604 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11609 ++processing_template_decl
;
11610 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11611 --processing_template_decl
;
11612 if (new_decl
== error_mark_node
)
11613 RETURN (error_mark_node
);
11615 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11616 DECL_TI_TEMPLATE (new_decl
) = r
;
11617 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11618 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11619 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11622 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11623 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11624 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11626 /* The template parameters for this new template are all the
11627 template parameters for the old template, except the
11628 outermost level of parameters. */
11629 DECL_TEMPLATE_PARMS (r
)
11630 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11633 if (PRIMARY_TEMPLATE_P (t
))
11634 DECL_PRIMARY_TEMPLATE (r
) = r
;
11636 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11637 /* Record this non-type partial instantiation. */
11638 register_specialization (r
, t
,
11639 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11644 case FUNCTION_DECL
:
11647 tree argvec
= NULL_TREE
;
11655 /* Nobody should be tsubst'ing into non-template functions. */
11656 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11658 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11663 /* If T is not dependent, just return it. We have to
11664 increment PROCESSING_TEMPLATE_DECL because
11665 value_dependent_expression_p assumes that nothing is
11666 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11667 ++processing_template_decl
;
11668 dependent_p
= value_dependent_expression_p (t
);
11669 --processing_template_decl
;
11673 /* Calculate the most general template of which R is a
11674 specialization, and the complete set of arguments used to
11676 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11677 argvec
= tsubst_template_args (DECL_TI_ARGS
11678 (DECL_TEMPLATE_RESULT
11679 (DECL_TI_TEMPLATE (t
))),
11680 args
, complain
, in_decl
);
11681 if (argvec
== error_mark_node
)
11682 RETURN (error_mark_node
);
11684 /* Check to see if we already have this specialization. */
11685 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11686 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11694 /* We can see more levels of arguments than parameters if
11695 there was a specialization of a member template, like
11698 template <class T> struct S { template <class U> void f(); }
11699 template <> template <class U> void S<int>::f(U);
11701 Here, we'll be substituting into the specialization,
11702 because that's where we can find the code we actually
11703 want to generate, but we'll have enough arguments for
11704 the most general template.
11706 We also deal with the peculiar case:
11708 template <class T> struct S {
11709 template <class U> friend void f();
11711 template <class U> void f() {}
11713 template void f<double>();
11715 Here, the ARGS for the instantiation of will be {int,
11716 double}. But, we only need as many ARGS as there are
11717 levels of template parameters in CODE_PATTERN. We are
11718 careful not to get fooled into reducing the ARGS in
11721 template <class T> struct S { template <class U> void f(U); }
11722 template <class T> template <> void S<T>::f(int) {}
11724 which we can spot because the pattern will be a
11725 specialization in this case. */
11726 args_depth
= TMPL_ARGS_DEPTH (args
);
11728 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11729 if (args_depth
> parms_depth
11730 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11731 args
= get_innermost_template_args (args
, parms_depth
);
11735 /* This special case arises when we have something like this:
11737 template <class T> struct S {
11738 friend void f<int>(int, double);
11741 Here, the DECL_TI_TEMPLATE for the friend declaration
11742 will be an IDENTIFIER_NODE. We are being called from
11743 tsubst_friend_function, and we want only to create a
11744 new decl (R) with appropriate types so that we can call
11745 determine_specialization. */
11746 gen_tmpl
= NULL_TREE
;
11749 if (DECL_CLASS_SCOPE_P (t
))
11751 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11755 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11756 complain
, t
, /*entering_scope=*/1);
11761 ctx
= DECL_CONTEXT (t
);
11763 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11764 if (type
== error_mark_node
)
11765 RETURN (error_mark_node
);
11767 /* If we hit excessive deduction depth, the type is bogus even if
11768 it isn't error_mark_node, so don't build a decl. */
11769 if (excessive_deduction_depth
)
11770 RETURN (error_mark_node
);
11772 /* We do NOT check for matching decls pushed separately at this
11773 point, as they may not represent instantiations of this
11774 template, and in any case are considered separate under the
11777 DECL_USE_TEMPLATE (r
) = 0;
11778 TREE_TYPE (r
) = type
;
11779 /* Clear out the mangled name and RTL for the instantiation. */
11780 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11781 SET_DECL_RTL (r
, NULL
);
11782 /* Leave DECL_INITIAL set on deleted instantiations. */
11783 if (!DECL_DELETED_FN (r
))
11784 DECL_INITIAL (r
) = NULL_TREE
;
11785 DECL_CONTEXT (r
) = ctx
;
11787 /* OpenMP UDRs have the only argument a reference to the declared
11788 type. We want to diagnose if the declared type is a reference,
11789 which is invalid, but as references to references are usually
11790 quietly merged, diagnose it here. */
11791 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11794 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11795 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11796 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11797 error_at (DECL_SOURCE_LOCATION (t
),
11798 "reference type %qT in "
11799 "%<#pragma omp declare reduction%>", argtype
);
11800 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11801 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11805 if (member
&& DECL_CONV_FN_P (r
))
11806 /* Type-conversion operator. Reconstruct the name, in
11807 case it's the name of one of the template's parameters. */
11808 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11810 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11812 DECL_RESULT (r
) = NULL_TREE
;
11814 TREE_STATIC (r
) = 0;
11815 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11816 DECL_EXTERNAL (r
) = 1;
11817 /* If this is an instantiation of a function with internal
11818 linkage, we already know what object file linkage will be
11819 assigned to the instantiation. */
11820 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11821 DECL_DEFER_OUTPUT (r
) = 0;
11822 DECL_CHAIN (r
) = NULL_TREE
;
11823 DECL_PENDING_INLINE_INFO (r
) = 0;
11824 DECL_PENDING_INLINE_P (r
) = 0;
11825 DECL_SAVED_TREE (r
) = NULL_TREE
;
11826 DECL_STRUCT_FUNCTION (r
) = NULL
;
11828 /* We'll re-clone as appropriate in instantiate_template. */
11829 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11831 /* If we aren't complaining now, return on error before we register
11832 the specialization so that we'll complain eventually. */
11833 if ((complain
& tf_error
) == 0
11834 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11835 && !grok_op_properties (r
, /*complain=*/false))
11836 RETURN (error_mark_node
);
11838 /* When instantiating a constrained member, substitute
11839 into the constraints to create a new constraint. */
11840 if (tree ci
= get_constraints (t
))
11843 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11844 set_constraints (r
, ci
);
11847 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11848 this in the special friend case mentioned above where
11849 GEN_TMPL is NULL. */
11852 DECL_TEMPLATE_INFO (r
)
11853 = build_template_info (gen_tmpl
, argvec
);
11854 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11857 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11859 /* We instantiated this while substituting into
11860 the type earlier (template/friend54.C). */
11863 /* We're not supposed to instantiate default arguments
11864 until they are called, for a template. But, for a
11867 template <class T> void f ()
11868 { extern void g(int i = T()); }
11870 we should do the substitution when the template is
11871 instantiated. We handle the member function case in
11872 instantiate_class_template since the default arguments
11873 might refer to other members of the class. */
11875 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11876 && !uses_template_parms (argvec
))
11877 tsubst_default_arguments (r
, complain
);
11880 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11882 /* Copy the list of befriending classes. */
11883 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11885 friends
= &TREE_CHAIN (*friends
))
11887 *friends
= copy_node (*friends
);
11888 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11893 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11895 maybe_retrofit_in_chrg (r
);
11896 if (DECL_CONSTRUCTOR_P (r
))
11897 grok_ctor_properties (ctx
, r
);
11898 if (DECL_INHERITED_CTOR_BASE (r
))
11899 deduce_inheriting_ctor (r
);
11900 /* If this is an instantiation of a member template, clone it.
11901 If it isn't, that'll be handled by
11902 clone_constructors_and_destructors. */
11903 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11904 clone_function_decl (r
, /*update_method_vec_p=*/0);
11906 else if ((complain
& tf_error
) != 0
11907 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11908 && !grok_op_properties (r
, /*complain=*/true))
11909 RETURN (error_mark_node
);
11911 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11912 SET_DECL_FRIEND_CONTEXT (r
,
11913 tsubst (DECL_FRIEND_CONTEXT (t
),
11914 args
, complain
, in_decl
));
11916 /* Possibly limit visibility based on template args. */
11917 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11918 if (DECL_VISIBILITY_SPECIFIED (t
))
11920 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11921 DECL_ATTRIBUTES (r
)
11922 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11924 determine_visibility (r
);
11925 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11926 && !processing_template_decl
)
11927 defaulted_late_check (r
);
11929 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11930 args
, complain
, in_decl
);
11936 tree type
= NULL_TREE
;
11938 tree expanded_types
= NULL_TREE
;
11939 tree prev_r
= NULL_TREE
;
11940 tree first_r
= NULL_TREE
;
11942 if (DECL_PACK_P (t
))
11944 /* If there is a local specialization that isn't a
11945 parameter pack, it means that we're doing a "simple"
11946 substitution from inside tsubst_pack_expansion. Just
11947 return the local specialization (which will be a single
11949 tree spec
= retrieve_local_specialization (t
);
11951 && TREE_CODE (spec
) == PARM_DECL
11952 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11955 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11956 the parameters in this function parameter pack. */
11957 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11958 complain
, in_decl
);
11959 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11961 len
= TREE_VEC_LENGTH (expanded_types
);
11963 /* Zero-length parameter packs are boring. Just substitute
11966 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11971 /* All we did was update the type. Make a note of that. */
11972 type
= expanded_types
;
11973 expanded_types
= NULL_TREE
;
11977 /* Loop through all of the parameters we'll build. When T is
11978 a function parameter pack, LEN is the number of expanded
11979 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11981 for (i
= 0; i
< len
; ++i
)
11985 if (DECL_TEMPLATE_PARM_P (t
))
11986 SET_DECL_TEMPLATE_PARM_P (r
);
11988 if (expanded_types
)
11989 /* We're on the Ith parameter of the function parameter
11992 /* Get the Ith type. */
11993 type
= TREE_VEC_ELT (expanded_types
, i
);
11995 /* Rename the parameter to include the index. */
11997 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
12000 /* We're dealing with a normal parameter. */
12001 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12003 type
= type_decays_to (type
);
12004 TREE_TYPE (r
) = type
;
12005 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12007 if (DECL_INITIAL (r
))
12009 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
12010 DECL_INITIAL (r
) = TREE_TYPE (r
);
12012 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
12013 complain
, in_decl
);
12016 DECL_CONTEXT (r
) = NULL_TREE
;
12018 if (!DECL_TEMPLATE_PARM_P (r
))
12019 DECL_ARG_TYPE (r
) = type_passed_as (type
);
12021 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12022 args
, complain
, in_decl
);
12024 /* Keep track of the first new parameter we
12025 generate. That's what will be returned to the
12030 /* Build a proper chain of parameters when substituting
12031 into a function parameter pack. */
12033 DECL_CHAIN (prev_r
) = r
;
12036 /* If cp_unevaluated_operand is set, we're just looking for a
12037 single dummy parameter, so don't keep going. */
12038 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
12039 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
12040 complain
, DECL_CHAIN (t
));
12042 /* FIRST_R contains the start of the chain we've built. */
12049 tree type
= NULL_TREE
;
12050 tree vec
= NULL_TREE
;
12051 tree expanded_types
= NULL_TREE
;
12054 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12056 /* This field is a lambda capture pack. Return a TREE_VEC of
12057 the expanded fields to instantiate_class_template_1 and
12058 store them in the specializations hash table as a
12059 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
12060 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
12061 complain
, in_decl
);
12062 if (TREE_CODE (expanded_types
) == TREE_VEC
)
12064 len
= TREE_VEC_LENGTH (expanded_types
);
12065 vec
= make_tree_vec (len
);
12069 /* All we did was update the type. Make a note of that. */
12070 type
= expanded_types
;
12071 expanded_types
= NULL_TREE
;
12075 for (int i
= 0; i
< len
; ++i
)
12078 if (expanded_types
)
12080 type
= TREE_VEC_ELT (expanded_types
, i
);
12082 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
12085 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12087 if (type
== error_mark_node
)
12088 RETURN (error_mark_node
);
12089 TREE_TYPE (r
) = type
;
12090 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12092 if (DECL_C_BIT_FIELD (r
))
12093 /* For bit-fields, DECL_INITIAL gives the number of bits. For
12094 non-bit-fields DECL_INITIAL is a non-static data member
12095 initializer, which gets deferred instantiation. */
12097 = tsubst_expr (DECL_INITIAL (t
), args
,
12099 /*integral_constant_expression_p=*/true);
12100 else if (DECL_INITIAL (t
))
12102 /* Set up DECL_TEMPLATE_INFO so that we can get at the
12103 NSDMI in perform_member_init. Still set DECL_INITIAL
12104 so that we know there is one. */
12105 DECL_INITIAL (r
) = void_node
;
12106 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
12107 retrofit_lang_decl (r
);
12108 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12110 /* We don't have to set DECL_CONTEXT here; it is set by
12111 finish_member_declaration. */
12112 DECL_CHAIN (r
) = NULL_TREE
;
12114 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12115 args
, complain
, in_decl
);
12118 TREE_VEC_ELT (vec
, i
) = r
;
12124 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12125 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12126 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12127 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12128 TREE_TYPE (pack
) = tpack
;
12129 register_specialization (pack
, t
, args
, false, 0);
12135 /* We reach here only for member using decls. We also need to check
12136 uses_template_parms because DECL_DEPENDENT_P is not set for a
12137 using-declaration that designates a member of the current
12138 instantiation (c++/53549). */
12139 if (DECL_DEPENDENT_P (t
)
12140 || uses_template_parms (USING_DECL_SCOPE (t
)))
12142 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12143 complain
, in_decl
);
12144 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12145 r
= do_class_using_decl (inst_scope
, name
);
12147 r
= error_mark_node
;
12150 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12151 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12157 DECL_CHAIN (r
) = NULL_TREE
;
12164 tree argvec
= NULL_TREE
;
12165 tree gen_tmpl
= NULL_TREE
;
12167 tree tmpl
= NULL_TREE
;
12169 tree type
= NULL_TREE
;
12172 if (TREE_TYPE (t
) == error_mark_node
)
12173 RETURN (error_mark_node
);
12175 if (TREE_CODE (t
) == TYPE_DECL
12176 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12178 /* If this is the canonical decl, we don't have to
12179 mess with instantiations, and often we can't (for
12180 typename, template type parms and such). Note that
12181 TYPE_NAME is not correct for the above test if
12182 we've copied the type for a typedef. */
12183 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12184 if (type
== error_mark_node
)
12185 RETURN (error_mark_node
);
12186 r
= TYPE_NAME (type
);
12190 /* Check to see if we already have the specialization we
12193 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12195 /* T is a static data member or namespace-scope entity.
12196 We have to substitute into namespace-scope variables
12197 (not just variable templates) because of cases like:
12199 template <class T> void f() { extern T t; }
12201 where the entity referenced is not known until
12202 instantiation time. */
12204 ctx
= DECL_CONTEXT (t
);
12205 if (DECL_CLASS_SCOPE_P (t
))
12207 ctx
= tsubst_aggr_type (ctx
, args
,
12209 in_decl
, /*entering_scope=*/1);
12210 /* If CTX is unchanged, then T is in fact the
12211 specialization we want. That situation occurs when
12212 referencing a static data member within in its own
12213 class. We can use pointer equality, rather than
12214 same_type_p, because DECL_CONTEXT is always
12216 if (ctx
== DECL_CONTEXT (t
)
12217 /* ... unless T is a member template; in which
12218 case our caller can be willing to create a
12219 specialization of that template represented
12221 && !(DECL_TI_TEMPLATE (t
)
12222 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12228 tmpl
= DECL_TI_TEMPLATE (t
);
12229 gen_tmpl
= most_general_template (tmpl
);
12230 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12231 if (argvec
!= error_mark_node
)
12232 argvec
= (coerce_innermost_template_parms
12233 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12234 argvec
, t
, complain
,
12235 /*all*/true, /*defarg*/true));
12236 if (argvec
== error_mark_node
)
12237 RETURN (error_mark_node
);
12238 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12239 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12244 /* A local variable. */
12246 /* Subsequent calls to pushdecl will fill this in. */
12248 spec
= retrieve_local_specialization (t
);
12250 /* If we already have the specialization we need, there is
12251 nothing more to do. */
12258 /* Create a new node for the specialization we need. */
12260 if (type
== NULL_TREE
)
12262 if (is_typedef_decl (t
))
12263 type
= DECL_ORIGINAL_TYPE (t
);
12265 type
= TREE_TYPE (t
);
12267 && VAR_HAD_UNKNOWN_BOUND (t
)
12268 && type
!= error_mark_node
)
12269 type
= strip_array_domain (type
);
12270 type
= tsubst (type
, args
, complain
, in_decl
);
12274 /* Even if the original location is out of scope, the
12275 newly substituted one is not. */
12276 DECL_DEAD_FOR_LOCAL (r
) = 0;
12277 DECL_INITIALIZED_P (r
) = 0;
12278 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12279 if (type
== error_mark_node
)
12280 RETURN (error_mark_node
);
12281 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12283 /* It may seem that this case cannot occur, since:
12288 declares a function, not a variable. However:
12291 template <typename T> void g() { T t; }
12292 template void g<f>();
12294 is an attempt to declare a variable with function
12296 error ("variable %qD has function type",
12297 /* R is not yet sufficiently initialized, so we
12298 just use its name. */
12300 RETURN (error_mark_node
);
12302 type
= complete_type (type
);
12303 /* Wait until cp_finish_decl to set this again, to handle
12304 circular dependency (template/instantiate6.C). */
12305 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12306 type
= check_var_type (DECL_NAME (r
), type
);
12308 if (DECL_HAS_VALUE_EXPR_P (t
))
12310 tree ve
= DECL_VALUE_EXPR (t
);
12311 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12312 /*constant_expression_p=*/false);
12313 if (REFERENCE_REF_P (ve
))
12315 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12316 ve
= TREE_OPERAND (ve
, 0);
12318 SET_DECL_VALUE_EXPR (r
, ve
);
12320 if (CP_DECL_THREAD_LOCAL_P (r
)
12321 && !processing_template_decl
)
12322 set_decl_tls_model (r
, decl_default_tls_model (r
));
12324 else if (DECL_SELF_REFERENCE_P (t
))
12325 SET_DECL_SELF_REFERENCE_P (r
);
12326 TREE_TYPE (r
) = type
;
12327 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12328 DECL_CONTEXT (r
) = ctx
;
12329 /* Clear out the mangled name and RTL for the instantiation. */
12330 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12331 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12332 SET_DECL_RTL (r
, NULL
);
12333 /* The initializer must not be expanded until it is required;
12334 see [temp.inst]. */
12335 DECL_INITIAL (r
) = NULL_TREE
;
12336 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12337 SET_DECL_RTL (r
, NULL
);
12338 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12341 /* Possibly limit visibility based on template args. */
12342 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12343 if (DECL_VISIBILITY_SPECIFIED (t
))
12345 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12346 DECL_ATTRIBUTES (r
)
12347 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12349 determine_visibility (r
);
12354 /* A static data member declaration is always marked
12355 external when it is declared in-class, even if an
12356 initializer is present. We mimic the non-template
12357 processing here. */
12358 DECL_EXTERNAL (r
) = 1;
12359 if (DECL_NAMESPACE_SCOPE_P (t
))
12360 DECL_NOT_REALLY_EXTERN (r
) = 1;
12362 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12363 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12364 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12368 if (DECL_LANG_SPECIFIC (r
))
12369 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
12370 if (!cp_unevaluated_operand
)
12371 register_local_specialization (r
, t
);
12374 DECL_CHAIN (r
) = NULL_TREE
;
12376 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12378 args
, complain
, in_decl
);
12380 /* Preserve a typedef that names a type. */
12381 if (is_typedef_decl (r
))
12383 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12384 set_underlying_type (r
);
12385 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12386 /* An alias template specialization can be dependent
12387 even if its underlying type is not. */
12388 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12391 layout_decl (r
, 0);
12396 gcc_unreachable ();
12401 /* Restore the file and line information. */
12402 input_location
= saved_loc
;
12407 /* Substitute into the ARG_TYPES of a function type.
12408 If END is a TREE_CHAIN, leave it and any following types
12412 tsubst_arg_types (tree arg_types
,
12415 tsubst_flags_t complain
,
12418 tree remaining_arg_types
;
12419 tree type
= NULL_TREE
;
12421 tree expanded_args
= NULL_TREE
;
12424 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12427 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12428 args
, end
, complain
, in_decl
);
12429 if (remaining_arg_types
== error_mark_node
)
12430 return error_mark_node
;
12432 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12434 /* For a pack expansion, perform substitution on the
12435 entire expression. Later on, we'll handle the arguments
12437 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12438 args
, complain
, in_decl
);
12440 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12441 /* So that we'll spin through the parameters, one by one. */
12442 i
= TREE_VEC_LENGTH (expanded_args
);
12445 /* We only partially substituted into the parameter
12446 pack. Our type is TYPE_PACK_EXPANSION. */
12447 type
= expanded_args
;
12448 expanded_args
= NULL_TREE
;
12456 type
= TREE_VEC_ELT (expanded_args
, i
);
12458 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12460 if (type
== error_mark_node
)
12461 return error_mark_node
;
12462 if (VOID_TYPE_P (type
))
12464 if (complain
& tf_error
)
12466 error ("invalid parameter type %qT", type
);
12468 error ("in declaration %q+D", in_decl
);
12470 return error_mark_node
;
12473 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12474 return error_mark_node
;
12476 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12477 top-level qualifiers as required. */
12478 type
= cv_unqualified (type_decays_to (type
));
12480 /* We do not substitute into default arguments here. The standard
12481 mandates that they be instantiated only when needed, which is
12482 done in build_over_call. */
12483 default_arg
= TREE_PURPOSE (arg_types
);
12485 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12487 /* We've instantiated a template before its default arguments
12488 have been parsed. This can happen for a nested template
12489 class, and is not an error unless we require the default
12490 argument in a call of this function. */
12491 remaining_arg_types
=
12492 tree_cons (default_arg
, type
, remaining_arg_types
);
12493 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12496 remaining_arg_types
=
12497 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12500 return remaining_arg_types
;
12503 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12504 *not* handle the exception-specification for FNTYPE, because the
12505 initial substitution of explicitly provided template parameters
12506 during argument deduction forbids substitution into the
12507 exception-specification:
12511 All references in the function type of the function template to the
12512 corresponding template parameters are replaced by the specified tem-
12513 plate argument values. If a substitution in a template parameter or
12514 in the function type of the function template results in an invalid
12515 type, type deduction fails. [Note: The equivalent substitution in
12516 exception specifications is done only when the function is instanti-
12517 ated, at which point a program is ill-formed if the substitution
12518 results in an invalid type.] */
12521 tsubst_function_type (tree t
,
12523 tsubst_flags_t complain
,
12527 tree arg_types
= NULL_TREE
;
12530 /* The TYPE_CONTEXT is not used for function/method types. */
12531 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12533 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12535 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12537 if (late_return_type_p
)
12539 /* Substitute the argument types. */
12540 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12541 complain
, in_decl
);
12542 if (arg_types
== error_mark_node
)
12543 return error_mark_node
;
12545 tree save_ccp
= current_class_ptr
;
12546 tree save_ccr
= current_class_ref
;
12547 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12548 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12549 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12552 /* DR 1207: 'this' is in scope in the trailing return type. */
12553 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12556 /* Substitute the return type. */
12557 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12561 current_class_ptr
= save_ccp
;
12562 current_class_ref
= save_ccr
;
12566 /* Substitute the return type. */
12567 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12569 if (return_type
== error_mark_node
)
12570 return error_mark_node
;
12571 /* DR 486 clarifies that creation of a function type with an
12572 invalid return type is a deduction failure. */
12573 if (TREE_CODE (return_type
) == ARRAY_TYPE
12574 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12576 if (complain
& tf_error
)
12578 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12579 error ("function returning an array");
12581 error ("function returning a function");
12583 return error_mark_node
;
12586 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12587 return error_mark_node
;
12589 if (!late_return_type_p
)
12591 /* Substitute the argument types. */
12592 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12593 complain
, in_decl
);
12594 if (arg_types
== error_mark_node
)
12595 return error_mark_node
;
12598 /* Construct a new type node and return it. */
12599 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12601 fntype
= build_function_type (return_type
, arg_types
);
12602 fntype
= apply_memfn_quals (fntype
,
12603 type_memfn_quals (t
),
12604 type_memfn_rqual (t
));
12608 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12609 /* Don't pick up extra function qualifiers from the basetype. */
12610 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12611 if (! MAYBE_CLASS_TYPE_P (r
))
12615 Type deduction may fail for any of the following
12618 -- Attempting to create "pointer to member of T" when T
12619 is not a class type. */
12620 if (complain
& tf_error
)
12621 error ("creating pointer to member function of non-class type %qT",
12623 return error_mark_node
;
12626 fntype
= build_method_type_directly (r
, return_type
,
12627 TREE_CHAIN (arg_types
));
12628 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12630 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12632 if (late_return_type_p
)
12633 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12638 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12639 ARGS into that specification, and return the substituted
12640 specification. If there is no specification, return NULL_TREE. */
12643 tsubst_exception_specification (tree fntype
,
12645 tsubst_flags_t complain
,
12652 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12653 new_specs
= NULL_TREE
;
12654 if (specs
&& TREE_PURPOSE (specs
))
12656 /* A noexcept-specifier. */
12657 tree expr
= TREE_PURPOSE (specs
);
12658 if (TREE_CODE (expr
) == INTEGER_CST
)
12662 /* Defer instantiation of noexcept-specifiers to avoid
12663 excessive instantiations (c++/49107). */
12664 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12665 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12667 /* We already partially instantiated this member template,
12668 so combine the new args with the old. */
12669 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12670 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12671 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12672 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12676 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12677 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12681 new_specs
= tsubst_copy_and_build
12682 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12683 /*integral_constant_expression_p=*/true);
12684 new_specs
= build_noexcept_spec (new_specs
, complain
);
12688 if (! TREE_VALUE (specs
))
12695 tree expanded_specs
= NULL_TREE
;
12697 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12699 /* Expand the pack expansion type. */
12700 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12704 if (expanded_specs
== error_mark_node
)
12705 return error_mark_node
;
12706 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12707 len
= TREE_VEC_LENGTH (expanded_specs
);
12710 /* We're substituting into a member template, so
12711 we got a TYPE_PACK_EXPANSION back. Add that
12712 expansion and move on. */
12713 gcc_assert (TREE_CODE (expanded_specs
)
12714 == TYPE_PACK_EXPANSION
);
12715 new_specs
= add_exception_specifier (new_specs
,
12718 specs
= TREE_CHAIN (specs
);
12723 for (i
= 0; i
< len
; ++i
)
12725 if (expanded_specs
)
12726 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12728 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12729 if (spec
== error_mark_node
)
12731 new_specs
= add_exception_specifier (new_specs
, spec
,
12735 specs
= TREE_CHAIN (specs
);
12741 /* Take the tree structure T and replace template parameters used
12742 therein with the argument vector ARGS. IN_DECL is an associated
12743 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12744 Issue error and warning messages under control of COMPLAIN. Note
12745 that we must be relatively non-tolerant of extensions here, in
12746 order to preserve conformance; if we allow substitutions that
12747 should not be allowed, we may allow argument deductions that should
12748 not succeed, and therefore report ambiguous overload situations
12749 where there are none. In theory, we could allow the substitution,
12750 but indicate that it should have failed, and allow our caller to
12751 make sure that the right thing happens, but we don't try to do this
12754 This function is used for dealing with types, decls and the like;
12755 for expressions, use tsubst_expr or tsubst_copy. */
12758 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12760 enum tree_code code
;
12761 tree type
, r
= NULL_TREE
;
12763 if (t
== NULL_TREE
|| t
== error_mark_node
12764 || t
== integer_type_node
12765 || t
== void_type_node
12766 || t
== char_type_node
12767 || t
== unknown_type_node
12768 || TREE_CODE (t
) == NAMESPACE_DECL
12769 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12773 return tsubst_decl (t
, args
, complain
);
12775 if (args
== NULL_TREE
)
12778 code
= TREE_CODE (t
);
12780 if (code
== IDENTIFIER_NODE
)
12781 type
= IDENTIFIER_TYPE_VALUE (t
);
12783 type
= TREE_TYPE (t
);
12785 gcc_assert (type
!= unknown_type_node
);
12787 /* Reuse typedefs. We need to do this to handle dependent attributes,
12788 such as attribute aligned. */
12790 && typedef_variant_p (t
))
12792 tree decl
= TYPE_NAME (t
);
12794 if (alias_template_specialization_p (t
))
12796 /* DECL represents an alias template and we want to
12798 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12799 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12800 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12802 else if (DECL_CLASS_SCOPE_P (decl
)
12803 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12804 && uses_template_parms (DECL_CONTEXT (decl
)))
12806 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12807 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12808 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12810 else if (DECL_FUNCTION_SCOPE_P (decl
)
12811 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12812 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12813 r
= retrieve_local_specialization (decl
);
12815 /* The typedef is from a non-template context. */
12821 r
= cp_build_qualified_type_real
12822 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12823 complain
| tf_ignore_bad_quals
);
12828 /* We don't have an instantiation yet, so drop the typedef. */
12829 int quals
= cp_type_quals (t
);
12830 t
= DECL_ORIGINAL_TYPE (decl
);
12831 t
= cp_build_qualified_type_real (t
, quals
,
12832 complain
| tf_ignore_bad_quals
);
12837 && code
!= TYPENAME_TYPE
12838 && code
!= TEMPLATE_TYPE_PARM
12839 && code
!= IDENTIFIER_NODE
12840 && code
!= FUNCTION_TYPE
12841 && code
!= METHOD_TYPE
)
12842 type
= tsubst (type
, args
, complain
, in_decl
);
12843 if (type
== error_mark_node
)
12844 return error_mark_node
;
12850 case ENUMERAL_TYPE
:
12851 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12852 /*entering_scope=*/0);
12855 case IDENTIFIER_NODE
:
12866 if (t
== integer_type_node
)
12869 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12870 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12874 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12876 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12877 /*integral_constant_expression_p=*/false);
12879 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12881 if (TREE_CODE (max
) == NOP_EXPR
12882 && TREE_SIDE_EFFECTS (omax
)
12883 && !TREE_TYPE (max
))
12884 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12886 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12887 with TREE_SIDE_EFFECTS that indicates this is not an integral
12888 constant expression. */
12889 if (processing_template_decl
12890 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12892 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12893 TREE_SIDE_EFFECTS (max
) = 1;
12896 return compute_array_index_type (NULL_TREE
, max
, complain
);
12899 case TEMPLATE_TYPE_PARM
:
12900 case TEMPLATE_TEMPLATE_PARM
:
12901 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12902 case TEMPLATE_PARM_INDEX
:
12907 tree arg
= NULL_TREE
;
12909 /* Early in template argument deduction substitution, we don't
12910 want to reduce the level of 'auto', or it will be confused
12911 with a normal template parm in subsequent deduction. */
12912 if (is_auto (t
) && (complain
& tf_partial
))
12917 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12918 template_parm_level_and_index (t
, &level
, &idx
);
12920 levels
= TMPL_ARGS_DEPTH (args
);
12921 if (level
<= levels
12922 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12924 arg
= TMPL_ARG (args
, level
, idx
);
12926 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12928 /* See through ARGUMENT_PACK_SELECT arguments. */
12929 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12930 /* If the selected argument is an expansion E, that most
12931 likely means we were called from
12932 gen_elem_of_pack_expansion_instantiation during the
12933 substituting of pack an argument pack (which Ith
12934 element is a pack expansion, where I is
12935 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12936 In this case, the Ith element resulting from this
12937 substituting is going to be a pack expansion, which
12938 pattern is the pattern of E. Let's return the
12940 gen_elem_of_pack_expansion_instantiation will
12941 build the resulting pack expansion from it. */
12942 if (PACK_EXPANSION_P (arg
))
12944 /* Make sure we aren't throwing away arg info. */
12945 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12946 arg
= PACK_EXPANSION_PATTERN (arg
);
12951 if (arg
== error_mark_node
)
12952 return error_mark_node
;
12953 else if (arg
!= NULL_TREE
)
12955 if (ARGUMENT_PACK_P (arg
))
12956 /* If ARG is an argument pack, we don't actually want to
12957 perform a substitution here, because substitutions
12958 for argument packs are only done
12959 element-by-element. We can get to this point when
12960 substituting the type of a non-type template
12961 parameter pack, when that type actually contains
12962 template parameter packs from an outer template, e.g.,
12964 template<typename... Types> struct A {
12965 template<Types... Values> struct B { };
12969 if (code
== TEMPLATE_TYPE_PARM
)
12972 gcc_assert (TYPE_P (arg
));
12974 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12976 return cp_build_qualified_type_real
12977 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12979 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12981 /* We are processing a type constructed from a
12982 template template parameter. */
12983 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12984 args
, complain
, in_decl
);
12985 if (argvec
== error_mark_node
)
12986 return error_mark_node
;
12988 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12989 || TREE_CODE (arg
) == TEMPLATE_DECL
12990 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12992 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12993 /* Consider this code:
12995 template <template <class> class Template>
12997 template <class Arg> using Bind = Template<Arg>;
13000 template <template <class> class Template, class Arg>
13001 using Instantiate = Template<Arg>; //#0
13003 template <template <class> class Template,
13006 Instantiate<Internal<Template>::template Bind,
13009 When #1 is parsed, the
13010 BOUND_TEMPLATE_TEMPLATE_PARM representing the
13011 parameter `Template' in #0 matches the
13012 UNBOUND_CLASS_TEMPLATE representing the argument
13013 `Internal<Template>::template Bind'; We then want
13014 to assemble the type `Bind<Argument>' that can't
13015 be fully created right now, because
13016 `Internal<Template>' not being complete, the Bind
13017 template cannot be looked up in that context. So
13018 we need to "store" `Bind<Argument>' for later
13019 when the context of Bind becomes complete. Let's
13020 store that in a TYPENAME_TYPE. */
13021 return make_typename_type (TYPE_CONTEXT (arg
),
13022 build_nt (TEMPLATE_ID_EXPR
,
13023 TYPE_IDENTIFIER (arg
),
13028 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
13029 are resolving nested-types in the signature of a
13030 member function templates. Otherwise ARG is a
13031 TEMPLATE_DECL and is the real template to be
13033 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
13034 arg
= TYPE_NAME (arg
);
13036 r
= lookup_template_class (arg
,
13038 DECL_CONTEXT (arg
),
13039 /*entering_scope=*/0,
13041 return cp_build_qualified_type_real
13042 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
13045 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
13046 return convert_from_reference (unshare_expr (arg
));
13050 /* This can happen during the attempted tsubst'ing in
13051 unify. This means that we don't yet have any information
13052 about the template parameter in question. */
13055 /* If we get here, we must have been looking at a parm for a
13056 more deeply nested template. Make a new version of this
13057 template parameter, but with a lower level. */
13060 case TEMPLATE_TYPE_PARM
:
13061 case TEMPLATE_TEMPLATE_PARM
:
13062 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13063 if (cp_type_quals (t
))
13065 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
13066 r
= cp_build_qualified_type_real
13067 (r
, cp_type_quals (t
),
13068 complain
| (code
== TEMPLATE_TYPE_PARM
13069 ? tf_ignore_bad_quals
: 0));
13071 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
13072 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
13073 && (r
= (TEMPLATE_PARM_DESCENDANTS
13074 (TEMPLATE_TYPE_PARM_INDEX (t
))))
13075 && (r
= TREE_TYPE (r
))
13076 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
13077 /* Break infinite recursion when substituting the constraints
13078 of a constrained placeholder. */;
13082 TEMPLATE_TYPE_PARM_INDEX (r
)
13083 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
13084 r
, levels
, args
, complain
);
13085 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
13086 TYPE_MAIN_VARIANT (r
) = r
;
13087 TYPE_POINTER_TO (r
) = NULL_TREE
;
13088 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
13090 /* Propagate constraints on placeholders. */
13091 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
13092 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
13093 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
13094 = tsubst_constraint (constr
, args
, complain
, in_decl
);
13096 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
13097 /* We have reduced the level of the template
13098 template parameter, but not the levels of its
13099 template parameters, so canonical_type_parameter
13100 will not be able to find the canonical template
13101 template parameter for this level. Thus, we
13102 require structural equality checking to compare
13103 TEMPLATE_TEMPLATE_PARMs. */
13104 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13105 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
13106 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13108 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
13110 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13112 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
13113 complain
, in_decl
);
13114 if (argvec
== error_mark_node
)
13115 return error_mark_node
;
13117 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
13118 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13123 case TEMPLATE_PARM_INDEX
:
13124 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13128 gcc_unreachable ();
13136 tree purpose
, value
, chain
;
13138 if (t
== void_list_node
)
13141 purpose
= TREE_PURPOSE (t
);
13144 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13145 if (purpose
== error_mark_node
)
13146 return error_mark_node
;
13148 value
= TREE_VALUE (t
);
13151 value
= tsubst (value
, args
, complain
, in_decl
);
13152 if (value
== error_mark_node
)
13153 return error_mark_node
;
13155 chain
= TREE_CHAIN (t
);
13156 if (chain
&& chain
!= void_type_node
)
13158 chain
= tsubst (chain
, args
, complain
, in_decl
);
13159 if (chain
== error_mark_node
)
13160 return error_mark_node
;
13162 if (purpose
== TREE_PURPOSE (t
)
13163 && value
== TREE_VALUE (t
)
13164 && chain
== TREE_CHAIN (t
))
13166 return hash_tree_cons (purpose
, value
, chain
);
13170 /* We should never be tsubsting a binfo. */
13171 gcc_unreachable ();
13174 /* A vector of template arguments. */
13175 gcc_assert (!type
);
13176 return tsubst_template_args (t
, args
, complain
, in_decl
);
13179 case REFERENCE_TYPE
:
13181 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13186 Type deduction may fail for any of the following
13189 -- Attempting to create a pointer to reference type.
13190 -- Attempting to create a reference to a reference type or
13191 a reference to void.
13193 Core issue 106 says that creating a reference to a reference
13194 during instantiation is no longer a cause for failure. We
13195 only enforce this check in strict C++98 mode. */
13196 if ((TREE_CODE (type
) == REFERENCE_TYPE
13197 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13198 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13200 static location_t last_loc
;
13202 /* We keep track of the last time we issued this error
13203 message to avoid spewing a ton of messages during a
13204 single bad template instantiation. */
13205 if (complain
& tf_error
13206 && last_loc
!= input_location
)
13208 if (VOID_TYPE_P (type
))
13209 error ("forming reference to void");
13210 else if (code
== POINTER_TYPE
)
13211 error ("forming pointer to reference type %qT", type
);
13213 error ("forming reference to reference type %qT", type
);
13214 last_loc
= input_location
;
13217 return error_mark_node
;
13219 else if (TREE_CODE (type
) == FUNCTION_TYPE
13220 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13221 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13223 if (complain
& tf_error
)
13225 if (code
== POINTER_TYPE
)
13226 error ("forming pointer to qualified function type %qT",
13229 error ("forming reference to qualified function type %qT",
13232 return error_mark_node
;
13234 else if (code
== POINTER_TYPE
)
13236 r
= build_pointer_type (type
);
13237 if (TREE_CODE (type
) == METHOD_TYPE
)
13238 r
= build_ptrmemfunc_type (r
);
13240 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13241 /* In C++0x, during template argument substitution, when there is an
13242 attempt to create a reference to a reference type, reference
13243 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13245 "If a template-argument for a template-parameter T names a type
13246 that is a reference to a type A, an attempt to create the type
13247 'lvalue reference to cv T' creates the type 'lvalue reference to
13248 A,' while an attempt to create the type type rvalue reference to
13249 cv T' creates the type T"
13251 r
= cp_build_reference_type
13253 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13255 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13256 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13258 if (r
!= error_mark_node
)
13259 /* Will this ever be needed for TYPE_..._TO values? */
13266 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13267 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13271 Type deduction may fail for any of the following
13274 -- Attempting to create "pointer to member of T" when T
13275 is not a class type. */
13276 if (complain
& tf_error
)
13277 error ("creating pointer to member of non-class type %qT", r
);
13278 return error_mark_node
;
13280 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13282 if (complain
& tf_error
)
13283 error ("creating pointer to member reference type %qT", type
);
13284 return error_mark_node
;
13286 if (VOID_TYPE_P (type
))
13288 if (complain
& tf_error
)
13289 error ("creating pointer to member of type void");
13290 return error_mark_node
;
13292 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13293 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13295 /* The type of the implicit object parameter gets its
13296 cv-qualifiers from the FUNCTION_TYPE. */
13299 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13300 type_memfn_rqual (type
));
13301 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13302 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13306 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13310 case FUNCTION_TYPE
:
13315 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13316 if (fntype
== error_mark_node
)
13317 return error_mark_node
;
13319 /* Substitute the exception specification. */
13320 specs
= tsubst_exception_specification (t
, args
, complain
,
13321 in_decl
, /*defer_ok*/true);
13322 if (specs
== error_mark_node
)
13323 return error_mark_node
;
13325 fntype
= build_exception_variant (fntype
, specs
);
13330 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13331 if (domain
== error_mark_node
)
13332 return error_mark_node
;
13334 /* As an optimization, we avoid regenerating the array type if
13335 it will obviously be the same as T. */
13336 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13339 /* These checks should match the ones in create_array_type_for_decl.
13343 The deduction may fail for any of the following reasons:
13345 -- Attempting to create an array with an element type that
13346 is void, a function type, or a reference type, or [DR337]
13347 an abstract class type. */
13348 if (VOID_TYPE_P (type
)
13349 || TREE_CODE (type
) == FUNCTION_TYPE
13350 || (TREE_CODE (type
) == ARRAY_TYPE
13351 && TYPE_DOMAIN (type
) == NULL_TREE
)
13352 || TREE_CODE (type
) == REFERENCE_TYPE
)
13354 if (complain
& tf_error
)
13355 error ("creating array of %qT", type
);
13356 return error_mark_node
;
13359 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13360 return error_mark_node
;
13362 r
= build_cplus_array_type (type
, domain
);
13364 if (TYPE_USER_ALIGN (t
))
13366 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13367 TYPE_USER_ALIGN (r
) = 1;
13373 case TYPENAME_TYPE
:
13375 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13376 in_decl
, /*entering_scope=*/1);
13377 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13378 complain
, in_decl
);
13380 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13381 return error_mark_node
;
13383 if (!MAYBE_CLASS_TYPE_P (ctx
))
13385 if (complain
& tf_error
)
13386 error ("%qT is not a class, struct, or union type", ctx
);
13387 return error_mark_node
;
13389 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13391 /* Normally, make_typename_type does not require that the CTX
13392 have complete type in order to allow things like:
13394 template <class T> struct S { typename S<T>::X Y; };
13396 But, such constructs have already been resolved by this
13397 point, so here CTX really should have complete type, unless
13398 it's a partial instantiation. */
13399 ctx
= complete_type (ctx
);
13400 if (!COMPLETE_TYPE_P (ctx
))
13402 if (complain
& tf_error
)
13403 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13404 return error_mark_node
;
13408 f
= make_typename_type (ctx
, f
, typename_type
,
13409 complain
| tf_keep_type_decl
);
13410 if (f
== error_mark_node
)
13412 if (TREE_CODE (f
) == TYPE_DECL
)
13414 complain
|= tf_ignore_bad_quals
;
13418 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13420 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13422 if (complain
& tf_error
)
13423 error ("%qT resolves to %qT, which is not an enumeration type",
13426 return error_mark_node
;
13428 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13430 if (complain
& tf_error
)
13431 error ("%qT resolves to %qT, which is is not a class type",
13434 return error_mark_node
;
13438 return cp_build_qualified_type_real
13439 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13442 case UNBOUND_CLASS_TEMPLATE
:
13444 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13445 in_decl
, /*entering_scope=*/1);
13446 tree name
= TYPE_IDENTIFIER (t
);
13447 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13449 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13450 return error_mark_node
;
13453 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13454 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13461 ++cp_unevaluated_operand
;
13462 ++c_inhibit_evaluation_warnings
;
13464 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13466 /*integral_constant_expression_p=*/false);
13468 --cp_unevaluated_operand
;
13469 --c_inhibit_evaluation_warnings
;
13471 type
= finish_typeof (type
);
13472 return cp_build_qualified_type_real (type
,
13474 | cp_type_quals (type
),
13478 case DECLTYPE_TYPE
:
13482 ++cp_unevaluated_operand
;
13483 ++c_inhibit_evaluation_warnings
;
13485 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13486 complain
|tf_decltype
, in_decl
,
13487 /*function_p*/false,
13488 /*integral_constant_expression*/false);
13490 --cp_unevaluated_operand
;
13491 --c_inhibit_evaluation_warnings
;
13493 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13494 type
= lambda_capture_field_type (type
,
13495 DECLTYPE_FOR_INIT_CAPTURE (t
));
13496 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13497 type
= lambda_proxy_type (type
);
13500 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13501 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13503 /* In a template ~id could be either a complement expression
13504 or an unqualified-id naming a destructor; if instantiating
13505 it produces an expression, it's not an id-expression or
13508 type
= finish_decltype_type (type
, id
, complain
);
13510 return cp_build_qualified_type_real (type
,
13512 | cp_type_quals (type
),
13513 complain
| tf_ignore_bad_quals
);
13516 case UNDERLYING_TYPE
:
13518 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13519 complain
, in_decl
);
13520 return finish_underlying_type (type
);
13523 case TYPE_ARGUMENT_PACK
:
13524 case NONTYPE_ARGUMENT_PACK
:
13526 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13528 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13532 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13534 /* For template nontype argument packs, also substitute into
13536 if (code
== NONTYPE_ARGUMENT_PACK
)
13537 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13556 /* We should use one of the expression tsubsts for these codes. */
13557 gcc_unreachable ();
13560 sorry ("use of %qs in template", get_tree_code_name (code
));
13561 return error_mark_node
;
13565 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13566 type of the expression on the left-hand side of the "." or "->"
13570 tsubst_baselink (tree baselink
, tree object_type
,
13571 tree args
, tsubst_flags_t complain
, tree in_decl
)
13574 tree qualifying_scope
;
13577 tree template_args
= 0;
13578 bool template_id_p
= false;
13579 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13581 /* A baselink indicates a function from a base class. Both the
13582 BASELINK_ACCESS_BINFO and the base class referenced may
13583 indicate bases of the template class, rather than the
13584 instantiated class. In addition, lookups that were not
13585 ambiguous before may be ambiguous now. Therefore, we perform
13586 the lookup again. */
13587 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13588 qualifying_scope
= tsubst (qualifying_scope
, args
,
13589 complain
, in_decl
);
13590 fns
= BASELINK_FUNCTIONS (baselink
);
13591 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13592 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13594 template_id_p
= true;
13595 template_args
= TREE_OPERAND (fns
, 1);
13596 fns
= TREE_OPERAND (fns
, 0);
13598 template_args
= tsubst_template_args (template_args
, args
,
13599 complain
, in_decl
);
13601 name
= DECL_NAME (get_first_fn (fns
));
13602 if (IDENTIFIER_TYPENAME_P (name
))
13603 name
= mangle_conv_op_name_for_type (optype
);
13604 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13607 if (constructor_name_p (name
, qualifying_scope
))
13609 if (complain
& tf_error
)
13610 error ("cannot call constructor %<%T::%D%> directly",
13611 qualifying_scope
, name
);
13613 return error_mark_node
;
13616 /* If lookup found a single function, mark it as used at this
13617 point. (If it lookup found multiple functions the one selected
13618 later by overload resolution will be marked as used at that
13620 if (BASELINK_P (baselink
))
13621 fns
= BASELINK_FUNCTIONS (baselink
);
13622 if (!template_id_p
&& !really_overloaded_fn (fns
)
13623 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13624 return error_mark_node
;
13626 /* Add back the template arguments, if present. */
13627 if (BASELINK_P (baselink
) && template_id_p
)
13628 BASELINK_FUNCTIONS (baselink
)
13629 = build_nt (TEMPLATE_ID_EXPR
,
13630 BASELINK_FUNCTIONS (baselink
),
13632 /* Update the conversion operator type. */
13633 BASELINK_OPTYPE (baselink
) = optype
;
13636 object_type
= current_class_type
;
13639 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13645 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13646 true if the qualified-id will be a postfix-expression in-and-of
13647 itself; false if more of the postfix-expression follows the
13648 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13652 tsubst_qualified_id (tree qualified_id
, tree args
,
13653 tsubst_flags_t complain
, tree in_decl
,
13654 bool done
, bool address_p
)
13660 tree template_args
;
13661 location_t loc
= UNKNOWN_LOCATION
;
13663 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13665 /* Figure out what name to look up. */
13666 name
= TREE_OPERAND (qualified_id
, 1);
13667 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13669 is_template
= true;
13670 loc
= EXPR_LOCATION (name
);
13671 template_args
= TREE_OPERAND (name
, 1);
13673 template_args
= tsubst_template_args (template_args
, args
,
13674 complain
, in_decl
);
13675 name
= TREE_OPERAND (name
, 0);
13679 is_template
= false;
13680 template_args
= NULL_TREE
;
13683 /* Substitute into the qualifying scope. When there are no ARGS, we
13684 are just trying to simplify a non-dependent expression. In that
13685 case the qualifying scope may be dependent, and, in any case,
13686 substituting will not help. */
13687 scope
= TREE_OPERAND (qualified_id
, 0);
13690 scope
= tsubst (scope
, args
, complain
, in_decl
);
13691 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13696 if (dependent_scope_p (scope
))
13699 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13700 return build_qualified_name (NULL_TREE
, scope
, expr
,
13701 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13704 if (!BASELINK_P (name
) && !DECL_P (expr
))
13706 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13708 /* A BIT_NOT_EXPR is used to represent a destructor. */
13709 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13711 error ("qualifying type %qT does not match destructor name ~%qT",
13712 scope
, TREE_OPERAND (expr
, 0));
13713 expr
= error_mark_node
;
13716 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13717 /*is_type_p=*/0, false);
13720 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13721 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13722 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13724 if (complain
& tf_error
)
13726 error ("dependent-name %qE is parsed as a non-type, but "
13727 "instantiation yields a type", qualified_id
);
13728 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13730 return error_mark_node
;
13736 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13738 /* Remember that there was a reference to this entity. */
13739 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13740 return error_mark_node
;
13743 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13745 if (complain
& tf_error
)
13746 qualified_name_lookup_error (scope
,
13747 TREE_OPERAND (qualified_id
, 1),
13748 expr
, input_location
);
13749 return error_mark_node
;
13754 if (variable_template_p (expr
))
13755 expr
= lookup_and_finish_template_variable (expr
, template_args
,
13758 expr
= lookup_template_function (expr
, template_args
);
13761 if (expr
== error_mark_node
&& complain
& tf_error
)
13762 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13763 expr
, input_location
);
13764 else if (TYPE_P (scope
))
13766 expr
= (adjust_result_of_qualified_name_lookup
13767 (expr
, scope
, current_nonlambda_class_type ()));
13768 expr
= (finish_qualified_id_expr
13769 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13770 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13771 /*template_arg_p=*/false, complain
));
13774 /* Expressions do not generally have reference type. */
13775 if (TREE_CODE (expr
) != SCOPE_REF
13776 /* However, if we're about to form a pointer-to-member, we just
13777 want the referenced member referenced. */
13778 && TREE_CODE (expr
) != OFFSET_REF
)
13779 expr
= convert_from_reference (expr
);
13784 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13785 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13789 tsubst_init (tree init
, tree decl
, tree args
,
13790 tsubst_flags_t complain
, tree in_decl
)
13795 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13799 /* If we had an initializer but it
13800 instantiated to nothing,
13801 value-initialize the object. This will
13802 only occur when the initializer was a
13803 pack expansion where the parameter packs
13804 used in that expansion were of length
13806 init
= build_value_init (TREE_TYPE (decl
),
13808 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13809 init
= get_target_expr_sfinae (init
, complain
);
13815 /* Like tsubst, but deals with expressions. This function just replaces
13816 template parms; to finish processing the resultant expression, use
13817 tsubst_copy_and_build or tsubst_expr. */
13820 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13822 enum tree_code code
;
13825 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13828 code
= TREE_CODE (t
);
13833 r
= retrieve_local_specialization (t
);
13835 if (r
== NULL_TREE
)
13837 /* We get here for a use of 'this' in an NSDMI. */
13838 if (DECL_NAME (t
) == this_identifier
13839 && current_function_decl
13840 && DECL_CONSTRUCTOR_P (current_function_decl
))
13841 return current_class_ptr
;
13843 /* This can happen for a parameter name used later in a function
13844 declaration (such as in a late-specified return type). Just
13845 make a dummy decl, since it's only used for its type. */
13846 gcc_assert (cp_unevaluated_operand
!= 0);
13847 r
= tsubst_decl (t
, args
, complain
);
13848 /* Give it the template pattern as its context; its true context
13849 hasn't been instantiated yet and this is good enough for
13851 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13854 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13855 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13856 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13857 return error_mark_node
;
13865 if (DECL_TEMPLATE_PARM_P (t
))
13866 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13867 /* There is no need to substitute into namespace-scope
13869 if (DECL_NAMESPACE_SCOPE_P (t
))
13871 /* If ARGS is NULL, then T is known to be non-dependent. */
13872 if (args
== NULL_TREE
)
13873 return scalar_constant_value (t
);
13875 /* Unfortunately, we cannot just call lookup_name here.
13878 template <int I> int f() {
13880 struct S { void g() { E e = a; } };
13883 When we instantiate f<7>::S::g(), say, lookup_name is not
13884 clever enough to find f<7>::a. */
13886 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13887 /*entering_scope=*/0);
13889 for (v
= TYPE_VALUES (enum_type
);
13891 v
= TREE_CHAIN (v
))
13892 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13893 return TREE_VALUE (v
);
13895 /* We didn't find the name. That should never happen; if
13896 name-lookup found it during preliminary parsing, we
13897 should find it again here during instantiation. */
13898 gcc_unreachable ();
13903 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13905 /* Check for a local specialization set up by
13906 tsubst_pack_expansion. */
13907 if (tree r
= retrieve_local_specialization (t
))
13909 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13910 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13914 /* When retrieving a capture pack from a generic lambda, remove the
13915 lambda call op's own template argument list from ARGS. Only the
13916 template arguments active for the closure type should be used to
13917 retrieve the pack specialization. */
13918 if (LAMBDA_FUNCTION_P (current_function_decl
)
13919 && (template_class_depth (DECL_CONTEXT (t
))
13920 != TMPL_ARGS_DEPTH (args
)))
13921 args
= strip_innermost_template_args (args
, 1);
13923 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13924 tsubst_decl put in the hash table. */
13925 return retrieve_specialization (t
, args
, 0);
13928 if (DECL_CONTEXT (t
))
13932 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13933 /*entering_scope=*/1);
13934 if (ctx
!= DECL_CONTEXT (t
))
13936 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13939 if (complain
& tf_error
)
13940 error ("using invalid field %qD", t
);
13941 return error_mark_node
;
13950 case FUNCTION_DECL
:
13951 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13952 r
= tsubst (t
, args
, complain
, in_decl
);
13953 else if (local_variable_p (t
))
13955 r
= retrieve_local_specialization (t
);
13956 if (r
== NULL_TREE
)
13958 /* First try name lookup to find the instantiation. */
13959 r
= lookup_name (DECL_NAME (t
));
13962 /* Make sure that the one we found is the one we want. */
13963 tree ctx
= DECL_CONTEXT (t
);
13964 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
13965 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
13966 if (ctx
!= DECL_CONTEXT (r
))
13974 /* This can happen for a variable used in a
13975 late-specified return type of a local lambda, or for a
13976 local static or constant. Building a new VAR_DECL
13977 should be OK in all those cases. */
13978 r
= tsubst_decl (t
, args
, complain
);
13979 if (decl_maybe_constant_var_p (r
))
13981 /* We can't call cp_finish_decl, so handle the
13982 initializer by hand. */
13983 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13984 complain
, in_decl
);
13985 if (!processing_template_decl
)
13986 init
= maybe_constant_init (init
);
13987 if (processing_template_decl
13988 ? potential_constant_expression (init
)
13989 : reduced_constant_expression_p (init
))
13990 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13991 = TREE_CONSTANT (r
) = true;
13992 DECL_INITIAL (r
) = init
;
13994 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13995 || decl_constant_var_p (r
)
13996 || errorcount
|| sorrycount
);
13997 if (!processing_template_decl
)
13999 if (TREE_STATIC (r
))
14000 rest_of_decl_compilation (r
, toplevel_bindings_p (),
14003 r
= process_outer_var_ref (r
, complain
);
14006 /* Remember this for subsequent uses. */
14007 if (local_specializations
)
14008 register_local_specialization (r
, t
);
14013 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
14014 return error_mark_node
;
14017 case NAMESPACE_DECL
:
14021 /* An OVERLOAD will always be a non-dependent overload set; an
14022 overload set from function scope will just be represented with an
14023 IDENTIFIER_NODE, and from class scope with a BASELINK. */
14024 gcc_assert (!uses_template_parms (t
));
14028 return tsubst_baselink (t
, current_nonlambda_class_type (),
14029 args
, complain
, in_decl
);
14031 case TEMPLATE_DECL
:
14032 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
14033 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
14034 args
, complain
, in_decl
);
14035 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
14036 return tsubst (t
, args
, complain
, in_decl
);
14037 else if (DECL_CLASS_SCOPE_P (t
)
14038 && uses_template_parms (DECL_CONTEXT (t
)))
14040 /* Template template argument like the following example need
14043 template <template <class> class TT> struct C {};
14044 template <class T> struct D {
14045 template <class U> struct E {};
14050 We are processing the template argument `E' in #1 for
14051 the template instantiation #2. Originally, `E' is a
14052 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
14053 have to substitute this with one having context `D<int>'. */
14055 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
14056 return lookup_field (context
, DECL_NAME(t
), 0, false);
14059 /* Ordinary template template argument. */
14063 case REINTERPRET_CAST_EXPR
:
14064 case CONST_CAST_EXPR
:
14065 case STATIC_CAST_EXPR
:
14066 case DYNAMIC_CAST_EXPR
:
14067 case IMPLICIT_CONV_EXPR
:
14071 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14072 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14073 return build1 (code
, type
, op0
);
14077 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14079 tree expanded
, op
= TREE_OPERAND (t
, 0);
14082 if (SIZEOF_EXPR_TYPE_P (t
))
14083 op
= TREE_TYPE (op
);
14085 ++cp_unevaluated_operand
;
14086 ++c_inhibit_evaluation_warnings
;
14087 /* We only want to compute the number of arguments. */
14088 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
14089 --cp_unevaluated_operand
;
14090 --c_inhibit_evaluation_warnings
;
14092 if (TREE_CODE (expanded
) == TREE_VEC
)
14094 len
= TREE_VEC_LENGTH (expanded
);
14095 /* Set TREE_USED for the benefit of -Wunused. */
14096 for (int i
= 0; i
< len
; i
++)
14097 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
14100 if (expanded
== error_mark_node
)
14101 return error_mark_node
;
14102 else if (PACK_EXPANSION_P (expanded
)
14103 || (TREE_CODE (expanded
) == TREE_VEC
14105 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
14107 if (TREE_CODE (expanded
) == TREE_VEC
)
14108 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
14110 PACK_EXPANSION_SIZEOF_P (expanded
) = true;
14112 if (TYPE_P (expanded
))
14113 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
14114 complain
& tf_error
);
14116 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
14117 complain
& tf_error
);
14120 return build_int_cst (size_type_node
, len
);
14122 if (SIZEOF_EXPR_TYPE_P (t
))
14124 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
14125 args
, complain
, in_decl
);
14126 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
14127 r
= build1 (SIZEOF_EXPR
,
14128 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
14129 SIZEOF_EXPR_TYPE_P (r
) = 1;
14136 case TRUTH_NOT_EXPR
:
14139 case UNARY_PLUS_EXPR
: /* Unary + */
14141 case AT_ENCODE_EXPR
:
14145 case REALPART_EXPR
:
14146 case IMAGPART_EXPR
:
14149 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14150 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14151 return build1 (code
, type
, op0
);
14154 case COMPONENT_REF
:
14159 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14160 name
= TREE_OPERAND (t
, 1);
14161 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14163 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14164 complain
, in_decl
);
14165 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14167 else if (TREE_CODE (name
) == SCOPE_REF
14168 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14170 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14171 complain
, in_decl
);
14172 name
= TREE_OPERAND (name
, 1);
14173 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14174 complain
, in_decl
);
14175 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14176 name
= build_qualified_name (/*type=*/NULL_TREE
,
14178 /*template_p=*/false);
14180 else if (BASELINK_P (name
))
14181 name
= tsubst_baselink (name
,
14182 non_reference (TREE_TYPE (object
)),
14186 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14187 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14193 case TRUNC_DIV_EXPR
:
14194 case CEIL_DIV_EXPR
:
14195 case FLOOR_DIV_EXPR
:
14196 case ROUND_DIV_EXPR
:
14197 case EXACT_DIV_EXPR
:
14201 case TRUNC_MOD_EXPR
:
14202 case FLOOR_MOD_EXPR
:
14203 case TRUTH_ANDIF_EXPR
:
14204 case TRUTH_ORIF_EXPR
:
14205 case TRUTH_AND_EXPR
:
14206 case TRUTH_OR_EXPR
:
14219 case COMPOUND_EXPR
:
14222 case PREDECREMENT_EXPR
:
14223 case PREINCREMENT_EXPR
:
14224 case POSTDECREMENT_EXPR
:
14225 case POSTINCREMENT_EXPR
:
14227 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14228 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14229 return build_nt (code
, op0
, op1
);
14234 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14235 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14236 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14237 QUALIFIED_NAME_IS_TEMPLATE (t
));
14242 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14243 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14244 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14249 int n
= VL_EXP_OPERAND_LENGTH (t
);
14250 tree result
= build_vl_exp (CALL_EXPR
, n
);
14252 for (i
= 0; i
< n
; i
++)
14253 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14254 complain
, in_decl
);
14260 case PSEUDO_DTOR_EXPR
:
14261 case VEC_PERM_EXPR
:
14263 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14264 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14265 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14266 r
= build_nt (code
, op0
, op1
, op2
);
14267 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14273 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14274 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14275 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14276 r
= build_nt (code
, op0
, op1
, op2
);
14277 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14283 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14284 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14285 r
= build_nt (code
, op0
, op1
);
14286 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14287 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14291 case TEMPLATE_ID_EXPR
:
14293 /* Substituted template arguments */
14294 tree fn
= TREE_OPERAND (t
, 0);
14295 tree targs
= TREE_OPERAND (t
, 1);
14297 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14299 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14301 return lookup_template_function (fn
, targs
);
14306 tree purpose
, value
, chain
;
14308 if (t
== void_list_node
)
14311 purpose
= TREE_PURPOSE (t
);
14313 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14314 value
= TREE_VALUE (t
);
14316 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14317 chain
= TREE_CHAIN (t
);
14318 if (chain
&& chain
!= void_type_node
)
14319 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14320 if (purpose
== TREE_PURPOSE (t
)
14321 && value
== TREE_VALUE (t
)
14322 && chain
== TREE_CHAIN (t
))
14324 return tree_cons (purpose
, value
, chain
);
14329 case ENUMERAL_TYPE
:
14331 case TEMPLATE_TYPE_PARM
:
14332 case TEMPLATE_TEMPLATE_PARM
:
14333 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14334 case TEMPLATE_PARM_INDEX
:
14336 case REFERENCE_TYPE
:
14338 case FUNCTION_TYPE
:
14341 case TYPENAME_TYPE
:
14342 case UNBOUND_CLASS_TEMPLATE
:
14344 case DECLTYPE_TYPE
:
14346 return tsubst (t
, args
, complain
, in_decl
);
14350 /* Fall through. */
14351 case IDENTIFIER_NODE
:
14352 if (IDENTIFIER_TYPENAME_P (t
))
14354 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14355 return mangle_conv_op_name_for_type (new_type
);
14361 /* This is handled by tsubst_copy_and_build. */
14362 gcc_unreachable ();
14366 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14367 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14368 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14371 case CLEANUP_POINT_EXPR
:
14372 /* We shouldn't have built any of these during initial template
14373 generation. Instead, they should be built during instantiation
14374 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14375 gcc_unreachable ();
14379 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14380 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14381 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14382 r
= build2 (code
, type
, op0
, op1
);
14383 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14384 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14385 && !(complain
& tf_error
))
14386 return error_mark_node
;
14390 case EXPR_PACK_EXPANSION
:
14391 error ("invalid use of pack expansion expression");
14392 return error_mark_node
;
14394 case NONTYPE_ARGUMENT_PACK
:
14395 error ("use %<...%> to expand argument pack");
14396 return error_mark_node
;
14399 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14407 /* Instantiate any typedefs in the type. */
14408 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14409 r
= fold_convert (type
, t
);
14410 gcc_assert (TREE_CODE (r
) == code
);
14415 /* These can sometimes show up in a partial instantiation, but never
14416 involve template parms. */
14417 gcc_assert (!uses_template_parms (t
));
14420 case UNARY_LEFT_FOLD_EXPR
:
14421 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14422 case UNARY_RIGHT_FOLD_EXPR
:
14423 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14424 case BINARY_LEFT_FOLD_EXPR
:
14425 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14426 case BINARY_RIGHT_FOLD_EXPR
:
14427 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14430 /* We shouldn't get here, but keep going if !flag_checking. */
14432 gcc_unreachable ();
14437 /* Helper function for tsubst_omp_clauses, used for instantiation of
14438 OMP_CLAUSE_DECL of clauses. */
14441 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14444 if (decl
== NULL_TREE
)
14447 /* Handle an OpenMP array section represented as a TREE_LIST (or
14448 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14449 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14450 TREE_LIST. We can handle it exactly the same as an array section
14451 (purpose, value, and a chain), even though the nomenclature
14452 (low_bound, length, etc) is different. */
14453 if (TREE_CODE (decl
) == TREE_LIST
)
14456 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14457 /*integral_constant_expression_p=*/false);
14458 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14459 /*integral_constant_expression_p=*/false);
14460 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14462 if (TREE_PURPOSE (decl
) == low_bound
14463 && TREE_VALUE (decl
) == length
14464 && TREE_CHAIN (decl
) == chain
)
14466 tree ret
= tree_cons (low_bound
, length
, chain
);
14467 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14468 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14471 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14472 /*integral_constant_expression_p=*/false);
14473 /* Undo convert_from_reference tsubst_expr could have called. */
14475 && REFERENCE_REF_P (ret
)
14476 && !REFERENCE_REF_P (decl
))
14477 ret
= TREE_OPERAND (ret
, 0);
14481 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14484 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14485 tree args
, tsubst_flags_t complain
, tree in_decl
)
14487 tree new_clauses
= NULL_TREE
, nc
, oc
;
14488 tree linear_no_step
= NULL_TREE
;
14490 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14492 nc
= copy_node (oc
);
14493 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14496 switch (OMP_CLAUSE_CODE (nc
))
14498 case OMP_CLAUSE_LASTPRIVATE
:
14499 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14501 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14502 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14503 in_decl
, /*integral_constant_expression_p=*/false);
14504 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14505 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14508 case OMP_CLAUSE_PRIVATE
:
14509 case OMP_CLAUSE_SHARED
:
14510 case OMP_CLAUSE_FIRSTPRIVATE
:
14511 case OMP_CLAUSE_COPYIN
:
14512 case OMP_CLAUSE_COPYPRIVATE
:
14513 case OMP_CLAUSE_UNIFORM
:
14514 case OMP_CLAUSE_DEPEND
:
14515 case OMP_CLAUSE_FROM
:
14516 case OMP_CLAUSE_TO
:
14517 case OMP_CLAUSE_MAP
:
14518 case OMP_CLAUSE_USE_DEVICE_PTR
:
14519 case OMP_CLAUSE_IS_DEVICE_PTR
:
14520 OMP_CLAUSE_DECL (nc
)
14521 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14524 case OMP_CLAUSE_IF
:
14525 case OMP_CLAUSE_NUM_THREADS
:
14526 case OMP_CLAUSE_SCHEDULE
:
14527 case OMP_CLAUSE_COLLAPSE
:
14528 case OMP_CLAUSE_FINAL
:
14529 case OMP_CLAUSE_DEVICE
:
14530 case OMP_CLAUSE_DIST_SCHEDULE
:
14531 case OMP_CLAUSE_NUM_TEAMS
:
14532 case OMP_CLAUSE_THREAD_LIMIT
:
14533 case OMP_CLAUSE_SAFELEN
:
14534 case OMP_CLAUSE_SIMDLEN
:
14535 case OMP_CLAUSE_NUM_TASKS
:
14536 case OMP_CLAUSE_GRAINSIZE
:
14537 case OMP_CLAUSE_PRIORITY
:
14538 case OMP_CLAUSE_ORDERED
:
14539 case OMP_CLAUSE_HINT
:
14540 case OMP_CLAUSE_NUM_GANGS
:
14541 case OMP_CLAUSE_NUM_WORKERS
:
14542 case OMP_CLAUSE_VECTOR_LENGTH
:
14543 case OMP_CLAUSE_WORKER
:
14544 case OMP_CLAUSE_VECTOR
:
14545 case OMP_CLAUSE_ASYNC
:
14546 case OMP_CLAUSE_WAIT
:
14547 OMP_CLAUSE_OPERAND (nc
, 0)
14548 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14549 in_decl
, /*integral_constant_expression_p=*/false);
14551 case OMP_CLAUSE_REDUCTION
:
14552 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14554 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14555 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14557 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14558 complain
, in_decl
);
14559 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14560 = build_qualified_name (NULL_TREE
, scope
,
14561 TREE_OPERAND (placeholder
, 1),
14565 gcc_assert (identifier_p (placeholder
));
14567 OMP_CLAUSE_DECL (nc
)
14568 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14571 case OMP_CLAUSE_GANG
:
14572 case OMP_CLAUSE_ALIGNED
:
14573 OMP_CLAUSE_DECL (nc
)
14574 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14576 OMP_CLAUSE_OPERAND (nc
, 1)
14577 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14578 in_decl
, /*integral_constant_expression_p=*/false);
14580 case OMP_CLAUSE_LINEAR
:
14581 OMP_CLAUSE_DECL (nc
)
14582 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14584 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14586 gcc_assert (!linear_no_step
);
14587 linear_no_step
= nc
;
14589 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
14590 OMP_CLAUSE_LINEAR_STEP (nc
)
14591 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
14592 complain
, in_decl
);
14594 OMP_CLAUSE_LINEAR_STEP (nc
)
14595 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
14597 /*integral_constant_expression_p=*/false);
14599 case OMP_CLAUSE_NOWAIT
:
14600 case OMP_CLAUSE_DEFAULT
:
14601 case OMP_CLAUSE_UNTIED
:
14602 case OMP_CLAUSE_MERGEABLE
:
14603 case OMP_CLAUSE_INBRANCH
:
14604 case OMP_CLAUSE_NOTINBRANCH
:
14605 case OMP_CLAUSE_PROC_BIND
:
14606 case OMP_CLAUSE_FOR
:
14607 case OMP_CLAUSE_PARALLEL
:
14608 case OMP_CLAUSE_SECTIONS
:
14609 case OMP_CLAUSE_TASKGROUP
:
14610 case OMP_CLAUSE_NOGROUP
:
14611 case OMP_CLAUSE_THREADS
:
14612 case OMP_CLAUSE_SIMD
:
14613 case OMP_CLAUSE_DEFAULTMAP
:
14614 case OMP_CLAUSE_INDEPENDENT
:
14615 case OMP_CLAUSE_AUTO
:
14616 case OMP_CLAUSE_SEQ
:
14618 case OMP_CLAUSE_TILE
:
14621 for (lnc
= OMP_CLAUSE_TILE_LIST (nc
),
14622 loc
= OMP_CLAUSE_TILE_LIST (oc
);
14624 loc
= TREE_CHAIN (loc
), lnc
= TREE_CHAIN (lnc
))
14626 TREE_VALUE (lnc
) = tsubst_expr (TREE_VALUE (loc
), args
,
14627 complain
, in_decl
, false);
14632 gcc_unreachable ();
14635 switch (OMP_CLAUSE_CODE (nc
))
14637 case OMP_CLAUSE_SHARED
:
14638 case OMP_CLAUSE_PRIVATE
:
14639 case OMP_CLAUSE_FIRSTPRIVATE
:
14640 case OMP_CLAUSE_LASTPRIVATE
:
14641 case OMP_CLAUSE_COPYPRIVATE
:
14642 case OMP_CLAUSE_LINEAR
:
14643 case OMP_CLAUSE_REDUCTION
:
14644 case OMP_CLAUSE_USE_DEVICE_PTR
:
14645 case OMP_CLAUSE_IS_DEVICE_PTR
:
14646 /* tsubst_expr on SCOPE_REF results in returning
14647 finish_non_static_data_member result. Undo that here. */
14648 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14649 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14650 == IDENTIFIER_NODE
))
14652 tree t
= OMP_CLAUSE_DECL (nc
);
14655 switch (TREE_CODE (v
))
14657 case COMPONENT_REF
:
14661 case POINTER_PLUS_EXPR
:
14662 v
= TREE_OPERAND (v
, 0);
14665 if (DECL_CONTEXT (v
) == current_function_decl
14666 && DECL_ARTIFICIAL (v
)
14667 && DECL_NAME (v
) == this_identifier
)
14668 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14675 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14676 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14677 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14678 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14679 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14681 tree decl
= OMP_CLAUSE_DECL (nc
);
14684 if (!DECL_LANG_SPECIFIC (decl
))
14685 retrofit_lang_decl (decl
);
14686 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14695 new_clauses
= nreverse (new_clauses
);
14698 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14699 if (linear_no_step
)
14700 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14701 if (nc
== linear_no_step
)
14703 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14707 return new_clauses
;
14710 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14713 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14716 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14718 tree purpose
, value
, chain
;
14723 if (TREE_CODE (t
) != TREE_LIST
)
14724 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14725 /*function_p=*/false,
14726 /*integral_constant_expression_p=*/false);
14728 if (t
== void_list_node
)
14731 purpose
= TREE_PURPOSE (t
);
14733 purpose
= RECUR (purpose
);
14734 value
= TREE_VALUE (t
);
14737 if (TREE_CODE (value
) != LABEL_DECL
)
14738 value
= RECUR (value
);
14741 value
= lookup_label (DECL_NAME (value
));
14742 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14743 TREE_USED (value
) = 1;
14746 chain
= TREE_CHAIN (t
);
14747 if (chain
&& chain
!= void_type_node
)
14748 chain
= RECUR (chain
);
14749 return tree_cons (purpose
, value
, chain
);
14753 /* Used to temporarily communicate the list of #pragma omp parallel
14754 clauses to #pragma omp for instantiation if they are combined
14757 static tree
*omp_parallel_combined_clauses
;
14759 /* Substitute one OMP_FOR iterator. */
14762 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14763 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14764 tree args
, tsubst_flags_t complain
, tree in_decl
,
14765 bool integral_constant_expression_p
)
14767 #define RECUR(NODE) \
14768 tsubst_expr ((NODE), args, complain, in_decl, \
14769 integral_constant_expression_p)
14770 tree decl
, init
, cond
, incr
;
14772 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14773 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14775 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14777 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14778 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14781 decl
= TREE_OPERAND (init
, 0);
14782 init
= TREE_OPERAND (init
, 1);
14783 tree decl_expr
= NULL_TREE
;
14784 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14786 /* We need to jump through some hoops to handle declarations in the
14787 for-init-statement, since we might need to handle auto deduction,
14788 but we need to keep control of initialization. */
14790 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14791 decl
= tsubst_decl (decl
, args
, complain
);
14795 if (TREE_CODE (decl
) == SCOPE_REF
)
14797 decl
= RECUR (decl
);
14798 if (TREE_CODE (decl
) == COMPONENT_REF
)
14802 switch (TREE_CODE (v
))
14804 case COMPONENT_REF
:
14808 case POINTER_PLUS_EXPR
:
14809 v
= TREE_OPERAND (v
, 0);
14812 if (DECL_CONTEXT (v
) == current_function_decl
14813 && DECL_ARTIFICIAL (v
)
14814 && DECL_NAME (v
) == this_identifier
)
14816 decl
= TREE_OPERAND (decl
, 1);
14817 decl
= omp_privatize_field (decl
, false);
14827 decl
= RECUR (decl
);
14829 init
= RECUR (init
);
14831 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14832 if (auto_node
&& init
)
14834 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14836 gcc_assert (!type_dependent_expression_p (decl
));
14838 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14842 /* Declare the variable, but don't let that initialize it. */
14843 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14844 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14846 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14849 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14850 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14851 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14853 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14854 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14855 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14856 NOP_EXPR
, rhs
, complain
);
14859 incr
= RECUR (incr
);
14860 TREE_VEC_ELT (declv
, i
) = decl
;
14861 TREE_VEC_ELT (initv
, i
) = init
;
14862 TREE_VEC_ELT (condv
, i
) = cond
;
14863 TREE_VEC_ELT (incrv
, i
) = incr
;
14869 /* Declare and initialize the variable. */
14877 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14879 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14881 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14882 && OMP_CLAUSE_DECL (*pc
) == decl
)
14884 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14885 && OMP_CLAUSE_DECL (*pc
) == decl
)
14889 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14891 *pc
= OMP_CLAUSE_CHAIN (c
);
14892 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14895 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14896 && OMP_CLAUSE_DECL (*pc
) == decl
)
14898 error ("iteration variable %qD should not be firstprivate",
14900 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14902 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14903 && OMP_CLAUSE_DECL (*pc
) == decl
)
14905 error ("iteration variable %qD should not be reduction",
14907 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14910 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14915 if (*pc
== NULL_TREE
)
14917 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14918 OMP_CLAUSE_DECL (c
) = decl
;
14919 c
= finish_omp_clauses (c
, true);
14922 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14927 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14928 if (COMPARISON_CLASS_P (cond
))
14930 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14931 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14932 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14935 cond
= RECUR (cond
);
14936 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14937 switch (TREE_CODE (incr
))
14939 case PREINCREMENT_EXPR
:
14940 case PREDECREMENT_EXPR
:
14941 case POSTINCREMENT_EXPR
:
14942 case POSTDECREMENT_EXPR
:
14943 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14944 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
14947 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14948 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14950 tree rhs
= TREE_OPERAND (incr
, 1);
14951 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14952 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14953 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14954 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14955 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14959 incr
= RECUR (incr
);
14962 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
14963 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
14965 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14966 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14967 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
14968 TREE_TYPE (decl
), lhs
,
14969 RECUR (TREE_OPERAND (incr
, 2))));
14971 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
14972 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
14973 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
14975 tree rhs
= TREE_OPERAND (incr
, 2);
14976 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14977 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
14978 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
14979 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
14980 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
14984 incr
= RECUR (incr
);
14987 incr
= RECUR (incr
);
14991 TREE_VEC_ELT (declv
, i
) = decl
;
14992 TREE_VEC_ELT (initv
, i
) = init
;
14993 TREE_VEC_ELT (condv
, i
) = cond
;
14994 TREE_VEC_ELT (incrv
, i
) = incr
;
14998 /* Helper function of tsubst_expr, find OMP_TEAMS inside
14999 of OMP_TARGET's body. */
15002 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
15004 *walk_subtrees
= 0;
15005 switch (TREE_CODE (*tp
))
15010 case STATEMENT_LIST
:
15011 *walk_subtrees
= 1;
15019 /* Like tsubst_copy for expressions, etc. but also does semantic
15023 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
15024 bool integral_constant_expression_p
)
15026 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
15027 #define RECUR(NODE) \
15028 tsubst_expr ((NODE), args, complain, in_decl, \
15029 integral_constant_expression_p)
15035 if (t
== NULL_TREE
|| t
== error_mark_node
)
15038 loc
= input_location
;
15039 if (EXPR_HAS_LOCATION (t
))
15040 input_location
= EXPR_LOCATION (t
);
15041 if (STATEMENT_CODE_P (TREE_CODE (t
)))
15042 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
15044 switch (TREE_CODE (t
))
15046 case STATEMENT_LIST
:
15048 tree_stmt_iterator i
;
15049 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
15050 RECUR (tsi_stmt (i
));
15054 case CTOR_INITIALIZER
:
15055 finish_mem_initializers (tsubst_initializer_list
15056 (TREE_OPERAND (t
, 0), args
));
15060 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
15064 tmp
= RECUR (EXPR_STMT_EXPR (t
));
15065 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
15066 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
15068 finish_expr_stmt (tmp
);
15072 do_using_directive (USING_STMT_NAMESPACE (t
));
15077 tree decl
, pattern_decl
;
15080 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
15081 if (TREE_CODE (decl
) == LABEL_DECL
)
15082 finish_label_decl (DECL_NAME (decl
));
15083 else if (TREE_CODE (decl
) == USING_DECL
)
15085 tree scope
= USING_DECL_SCOPE (decl
);
15086 tree name
= DECL_NAME (decl
);
15089 scope
= tsubst (scope
, args
, complain
, in_decl
);
15090 decl
= lookup_qualified_name (scope
, name
,
15091 /*is_type_p=*/false,
15092 /*complain=*/false);
15093 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
15094 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
15096 do_local_using_decl (decl
, scope
, name
);
15098 else if (DECL_PACK_P (decl
))
15100 /* Don't build up decls for a variadic capture proxy, we'll
15101 instantiate the elements directly as needed. */
15106 init
= DECL_INITIAL (decl
);
15107 decl
= tsubst (decl
, args
, complain
, in_decl
);
15108 if (decl
!= error_mark_node
)
15110 /* By marking the declaration as instantiated, we avoid
15111 trying to instantiate it. Since instantiate_decl can't
15112 handle local variables, and since we've already done
15113 all that needs to be done, that's the right thing to
15116 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15118 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
15119 /* Anonymous aggregates are a special case. */
15120 finish_anon_union (decl
);
15121 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
15123 DECL_CONTEXT (decl
) = current_function_decl
;
15124 if (DECL_NAME (decl
) == this_identifier
)
15126 tree lam
= DECL_CONTEXT (current_function_decl
);
15127 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
15128 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
15130 insert_capture_proxy (decl
);
15132 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
15133 /* We already did a pushtag. */;
15134 else if (TREE_CODE (decl
) == FUNCTION_DECL
15135 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
15136 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
15138 DECL_CONTEXT (decl
) = NULL_TREE
;
15140 DECL_CONTEXT (decl
) = current_function_decl
;
15141 cp_check_omp_declare_reduction (decl
);
15145 int const_init
= false;
15146 maybe_push_decl (decl
);
15148 && DECL_PRETTY_FUNCTION_P (decl
))
15150 /* For __PRETTY_FUNCTION__ we have to adjust the
15152 const char *const name
15153 = cxx_printable_name (current_function_decl
, 2);
15154 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
15157 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
15160 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
15162 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
15171 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15172 RECUR (FOR_INIT_STMT (t
));
15173 finish_for_init_stmt (stmt
);
15174 tmp
= RECUR (FOR_COND (t
));
15175 finish_for_cond (tmp
, stmt
, false);
15176 tmp
= RECUR (FOR_EXPR (t
));
15177 finish_for_expr (tmp
, stmt
);
15178 RECUR (FOR_BODY (t
));
15179 finish_for_stmt (stmt
);
15182 case RANGE_FOR_STMT
:
15185 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15186 decl
= RANGE_FOR_DECL (t
);
15187 decl
= tsubst (decl
, args
, complain
, in_decl
);
15188 maybe_push_decl (decl
);
15189 expr
= RECUR (RANGE_FOR_EXPR (t
));
15190 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
15191 RECUR (RANGE_FOR_BODY (t
));
15192 finish_for_stmt (stmt
);
15197 stmt
= begin_while_stmt ();
15198 tmp
= RECUR (WHILE_COND (t
));
15199 finish_while_stmt_cond (tmp
, stmt
, false);
15200 RECUR (WHILE_BODY (t
));
15201 finish_while_stmt (stmt
);
15205 stmt
= begin_do_stmt ();
15206 RECUR (DO_BODY (t
));
15207 finish_do_body (stmt
);
15208 tmp
= RECUR (DO_COND (t
));
15209 finish_do_stmt (tmp
, stmt
, false);
15213 stmt
= begin_if_stmt ();
15214 tmp
= RECUR (IF_COND (t
));
15215 finish_if_stmt_cond (tmp
, stmt
);
15216 RECUR (THEN_CLAUSE (t
));
15217 finish_then_clause (stmt
);
15219 if (ELSE_CLAUSE (t
))
15221 begin_else_clause (stmt
);
15222 RECUR (ELSE_CLAUSE (t
));
15223 finish_else_clause (stmt
);
15226 finish_if_stmt (stmt
);
15230 if (BIND_EXPR_BODY_BLOCK (t
))
15231 stmt
= begin_function_body ();
15233 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15234 ? BCS_TRY_BLOCK
: 0);
15236 RECUR (BIND_EXPR_BODY (t
));
15238 if (BIND_EXPR_BODY_BLOCK (t
))
15239 finish_function_body (stmt
);
15241 finish_compound_stmt (stmt
);
15245 finish_break_stmt ();
15248 case CONTINUE_STMT
:
15249 finish_continue_stmt ();
15253 stmt
= begin_switch_stmt ();
15254 tmp
= RECUR (SWITCH_STMT_COND (t
));
15255 finish_switch_cond (tmp
, stmt
);
15256 RECUR (SWITCH_STMT_BODY (t
));
15257 finish_switch_stmt (stmt
);
15260 case CASE_LABEL_EXPR
:
15262 tree low
= RECUR (CASE_LOW (t
));
15263 tree high
= RECUR (CASE_HIGH (t
));
15264 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15270 tree decl
= LABEL_EXPR_LABEL (t
);
15273 label
= finish_label_stmt (DECL_NAME (decl
));
15274 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15275 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15280 tmp
= GOTO_DESTINATION (t
);
15281 if (TREE_CODE (tmp
) != LABEL_DECL
)
15282 /* Computed goto's must be tsubst'd into. On the other hand,
15283 non-computed gotos must not be; the identifier in question
15284 will have no binding. */
15287 tmp
= DECL_NAME (tmp
);
15288 finish_goto_stmt (tmp
);
15293 tree string
= RECUR (ASM_STRING (t
));
15294 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15295 complain
, in_decl
);
15296 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15297 complain
, in_decl
);
15298 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15299 complain
, in_decl
);
15300 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15301 complain
, in_decl
);
15302 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15304 tree asm_expr
= tmp
;
15305 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15306 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15307 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15314 stmt
= begin_try_block ();
15315 RECUR (TRY_STMTS (t
));
15316 finish_cleanup_try_block (stmt
);
15317 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15321 tree compound_stmt
= NULL_TREE
;
15323 if (FN_TRY_BLOCK_P (t
))
15324 stmt
= begin_function_try_block (&compound_stmt
);
15326 stmt
= begin_try_block ();
15328 RECUR (TRY_STMTS (t
));
15330 if (FN_TRY_BLOCK_P (t
))
15331 finish_function_try_block (stmt
);
15333 finish_try_block (stmt
);
15335 RECUR (TRY_HANDLERS (t
));
15336 if (FN_TRY_BLOCK_P (t
))
15337 finish_function_handler_sequence (stmt
, compound_stmt
);
15339 finish_handler_sequence (stmt
);
15345 tree decl
= HANDLER_PARMS (t
);
15349 decl
= tsubst (decl
, args
, complain
, in_decl
);
15350 /* Prevent instantiate_decl from trying to instantiate
15351 this variable. We've already done all that needs to be
15353 if (decl
!= error_mark_node
)
15354 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15356 stmt
= begin_handler ();
15357 finish_handler_parms (decl
, stmt
);
15358 RECUR (HANDLER_BODY (t
));
15359 finish_handler (stmt
);
15364 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15365 if (CLASS_TYPE_P (tmp
))
15367 /* Local classes are not independent templates; they are
15368 instantiated along with their containing function. And this
15369 way we don't have to deal with pushing out of one local class
15370 to instantiate a member of another local class. */
15372 /* Closures are handled by the LAMBDA_EXPR. */
15373 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15374 complete_type (tmp
);
15375 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15376 if (!DECL_ARTIFICIAL (fn
))
15377 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15381 case STATIC_ASSERT
:
15385 ++c_inhibit_evaluation_warnings
;
15387 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15390 /*integral_constant_expression_p=*/true);
15391 --c_inhibit_evaluation_warnings
;
15393 finish_static_assert (condition
,
15394 STATIC_ASSERT_MESSAGE (t
),
15395 STATIC_ASSERT_SOURCE_LOCATION (t
),
15396 /*member_p=*/false);
15401 case OACC_PARALLEL
:
15402 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, false, args
, complain
,
15404 stmt
= begin_omp_parallel ();
15405 RECUR (OMP_BODY (t
));
15406 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
15410 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15411 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15412 args
, complain
, in_decl
);
15413 if (OMP_PARALLEL_COMBINED (t
))
15414 omp_parallel_combined_clauses
= &tmp
;
15415 stmt
= begin_omp_parallel ();
15416 RECUR (OMP_PARALLEL_BODY (t
));
15417 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15418 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15419 = OMP_PARALLEL_COMBINED (t
);
15420 pop_omp_privatization_clauses (r
);
15424 r
= push_omp_privatization_clauses (false);
15425 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15426 args
, complain
, in_decl
);
15427 stmt
= begin_omp_task ();
15428 RECUR (OMP_TASK_BODY (t
));
15429 finish_omp_task (tmp
, stmt
);
15430 pop_omp_privatization_clauses (r
);
15437 case OMP_DISTRIBUTE
:
15441 tree clauses
, body
, pre_body
;
15442 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15443 tree orig_declv
= NULL_TREE
;
15444 tree incrv
= NULL_TREE
;
15447 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15448 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
15449 TREE_CODE (t
) != OACC_LOOP
,
15450 args
, complain
, in_decl
);
15451 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15453 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15454 if (OMP_FOR_ORIG_DECLS (t
))
15455 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15456 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15457 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15458 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15461 stmt
= begin_omp_structured_block ();
15463 pre_body
= push_stmt_list ();
15464 RECUR (OMP_FOR_PRE_BODY (t
));
15465 pre_body
= pop_stmt_list (pre_body
);
15467 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15468 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15469 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15470 incrv
, &clauses
, args
, complain
, in_decl
,
15471 integral_constant_expression_p
);
15472 omp_parallel_combined_clauses
= NULL
;
15474 body
= push_stmt_list ();
15475 RECUR (OMP_FOR_BODY (t
));
15476 body
= pop_stmt_list (body
);
15478 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15479 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15480 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15484 t
= make_node (TREE_CODE (t
));
15485 TREE_TYPE (t
) = void_type_node
;
15486 OMP_FOR_BODY (t
) = body
;
15487 OMP_FOR_PRE_BODY (t
) = pre_body
;
15488 OMP_FOR_CLAUSES (t
) = clauses
;
15489 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15493 add_stmt (finish_omp_structured_block (stmt
));
15494 pop_omp_privatization_clauses (r
);
15499 omp_parallel_combined_clauses
= NULL
;
15504 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15505 && OMP_TEAMS_COMBINED (t
));
15506 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15507 args
, complain
, in_decl
);
15508 stmt
= push_stmt_list ();
15509 RECUR (OMP_BODY (t
));
15510 stmt
= pop_stmt_list (stmt
);
15513 OMP_BODY (t
) = stmt
;
15514 OMP_CLAUSES (t
) = tmp
;
15516 pop_omp_privatization_clauses (r
);
15520 case OMP_TARGET_DATA
:
15522 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
15523 TREE_CODE (t
) != OACC_DATA
,
15524 args
, complain
, in_decl
);
15525 keep_next_level (true);
15526 stmt
= begin_omp_structured_block ();
15528 RECUR (OMP_BODY (t
));
15529 stmt
= finish_omp_structured_block (stmt
);
15532 OMP_BODY (t
) = stmt
;
15533 OMP_CLAUSES (t
) = tmp
;
15534 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
15536 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
15539 /* For combined target teams, ensure the num_teams and
15540 thread_limit clause expressions are evaluated on the host,
15541 before entering the target construct. */
15543 for (c
= OMP_TEAMS_CLAUSES (teams
);
15544 c
; c
= OMP_CLAUSE_CHAIN (c
))
15545 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
15546 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
15547 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
15549 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
15550 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
15551 if (expr
== error_mark_node
)
15553 tmp
= TARGET_EXPR_SLOT (expr
);
15555 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
15556 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
15557 OMP_CLAUSE_FIRSTPRIVATE
);
15558 OMP_CLAUSE_DECL (tc
) = tmp
;
15559 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
15560 OMP_TARGET_CLAUSES (t
) = tc
;
15569 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), false, false,
15570 args
, complain
, in_decl
);
15571 OACC_DECLARE_CLAUSES (t
) = tmp
;
15575 case OMP_TARGET_UPDATE
:
15576 case OMP_TARGET_ENTER_DATA
:
15577 case OMP_TARGET_EXIT_DATA
:
15578 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15579 args
, complain
, in_decl
);
15581 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15585 case OACC_ENTER_DATA
:
15586 case OACC_EXIT_DATA
:
15588 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, false,
15589 args
, complain
, in_decl
);
15591 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15596 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15597 args
, complain
, in_decl
);
15598 stmt
= push_stmt_list ();
15599 RECUR (OMP_BODY (t
));
15600 stmt
= pop_stmt_list (stmt
);
15603 OMP_BODY (t
) = stmt
;
15604 OMP_ORDERED_CLAUSES (t
) = tmp
;
15610 case OMP_TASKGROUP
:
15611 stmt
= push_stmt_list ();
15612 RECUR (OMP_BODY (t
));
15613 stmt
= pop_stmt_list (stmt
);
15616 OMP_BODY (t
) = stmt
;
15621 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15622 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15624 tree op1
= TREE_OPERAND (t
, 1);
15625 tree rhs1
= NULL_TREE
;
15627 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15629 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15630 op1
= TREE_OPERAND (op1
, 1);
15632 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15633 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15634 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15635 NULL_TREE
, NULL_TREE
, rhs1
,
15636 OMP_ATOMIC_SEQ_CST (t
));
15640 tree op1
= TREE_OPERAND (t
, 1);
15641 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15642 tree rhs1
= NULL_TREE
;
15643 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15644 enum tree_code opcode
= NOP_EXPR
;
15645 if (code
== OMP_ATOMIC_READ
)
15647 v
= RECUR (TREE_OPERAND (op1
, 0));
15648 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15650 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15651 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15653 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15654 v
= RECUR (TREE_OPERAND (op1
, 0));
15655 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15656 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15658 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15659 op11
= TREE_OPERAND (op11
, 1);
15661 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15662 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15663 opcode
= TREE_CODE (op11
);
15664 if (opcode
== MODIFY_EXPR
)
15670 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15671 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15673 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15674 OMP_ATOMIC_SEQ_CST (t
));
15678 case TRANSACTION_EXPR
:
15681 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15682 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15684 if (TRANSACTION_EXPR_IS_STMT (t
))
15686 tree body
= TRANSACTION_EXPR_BODY (t
);
15687 tree noex
= NULL_TREE
;
15688 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15690 noex
= MUST_NOT_THROW_COND (body
);
15691 if (noex
== NULL_TREE
)
15692 noex
= boolean_true_node
;
15693 body
= TREE_OPERAND (body
, 0);
15695 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15697 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15701 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15702 RECUR (TRANSACTION_EXPR_BODY (t
)),
15709 case MUST_NOT_THROW_EXPR
:
15711 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15712 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15713 RETURN (build_must_not_throw_expr (op0
, cond
));
15716 case EXPR_PACK_EXPANSION
:
15717 error ("invalid use of pack expansion expression");
15718 RETURN (error_mark_node
);
15720 case NONTYPE_ARGUMENT_PACK
:
15721 error ("use %<...%> to expand argument pack");
15722 RETURN (error_mark_node
);
15724 case CILK_SPAWN_STMT
:
15725 cfun
->calls_cilk_spawn
= 1;
15726 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15728 case CILK_SYNC_STMT
:
15729 RETURN (build_cilk_sync ());
15731 case COMPOUND_EXPR
:
15732 tmp
= RECUR (TREE_OPERAND (t
, 0));
15733 if (tmp
== NULL_TREE
)
15734 /* If the first operand was a statement, we're done with it. */
15735 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15736 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15737 RECUR (TREE_OPERAND (t
, 1)),
15740 case ANNOTATE_EXPR
:
15741 tmp
= RECUR (TREE_OPERAND (t
, 0));
15742 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15743 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15746 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15748 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15749 /*function_p=*/false,
15750 integral_constant_expression_p
));
15753 RETURN (NULL_TREE
);
15755 input_location
= loc
;
15761 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15762 function. For description of the body see comment above
15763 cp_parser_omp_declare_reduction_exprs. */
15766 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15768 if (t
== NULL_TREE
|| t
== error_mark_node
)
15771 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15773 tree_stmt_iterator tsi
;
15776 memset (stmts
, 0, sizeof stmts
);
15777 for (i
= 0, tsi
= tsi_start (t
);
15778 i
< 7 && !tsi_end_p (tsi
);
15779 i
++, tsi_next (&tsi
))
15780 stmts
[i
] = tsi_stmt (tsi
);
15781 gcc_assert (tsi_end_p (tsi
));
15785 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15786 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15787 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15788 args
, complain
, in_decl
);
15789 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15790 args
, complain
, in_decl
);
15791 DECL_CONTEXT (omp_out
) = current_function_decl
;
15792 DECL_CONTEXT (omp_in
) = current_function_decl
;
15793 keep_next_level (true);
15794 tree block
= begin_omp_structured_block ();
15795 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15796 block
= finish_omp_structured_block (block
);
15797 block
= maybe_cleanup_point_expr_void (block
);
15798 add_decl_expr (omp_out
);
15799 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15800 TREE_NO_WARNING (omp_out
) = 1;
15801 add_decl_expr (omp_in
);
15802 finish_expr_stmt (block
);
15806 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15807 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15808 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15809 args
, complain
, in_decl
);
15810 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15811 args
, complain
, in_decl
);
15812 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15813 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15814 keep_next_level (true);
15815 tree block
= begin_omp_structured_block ();
15816 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15817 block
= finish_omp_structured_block (block
);
15818 block
= maybe_cleanup_point_expr_void (block
);
15819 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15820 add_decl_expr (omp_priv
);
15821 add_decl_expr (omp_orig
);
15822 finish_expr_stmt (block
);
15824 add_decl_expr (omp_orig
);
15828 /* T is a postfix-expression that is not being used in a function
15829 call. Return the substituted version of T. */
15832 tsubst_non_call_postfix_expression (tree t
, tree args
,
15833 tsubst_flags_t complain
,
15836 if (TREE_CODE (t
) == SCOPE_REF
)
15837 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15838 /*done=*/false, /*address_p=*/false);
15840 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15841 /*function_p=*/false,
15842 /*integral_constant_expression_p=*/false);
15847 /* Like tsubst but deals with expressions and performs semantic
15848 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15851 tsubst_copy_and_build (tree t
,
15853 tsubst_flags_t complain
,
15856 bool integral_constant_expression_p
)
15858 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15859 #define RECUR(NODE) \
15860 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15861 /*function_p=*/false, \
15862 integral_constant_expression_p)
15867 if (t
== NULL_TREE
|| t
== error_mark_node
)
15870 loc
= input_location
;
15871 if (EXPR_HAS_LOCATION (t
))
15872 input_location
= EXPR_LOCATION (t
);
15874 /* N3276 decltype magic only applies to calls at the top level or on the
15875 right side of a comma. */
15876 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15877 complain
&= ~tf_decltype
;
15879 switch (TREE_CODE (t
))
15883 /* Fall through. */
15884 case IDENTIFIER_NODE
:
15888 bool non_integral_constant_expression_p
;
15889 const char *error_msg
;
15891 if (IDENTIFIER_TYPENAME_P (t
))
15893 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15894 t
= mangle_conv_op_name_for_type (new_type
);
15897 /* Look up the name. */
15898 decl
= lookup_name (t
);
15900 /* By convention, expressions use ERROR_MARK_NODE to indicate
15901 failure, not NULL_TREE. */
15902 if (decl
== NULL_TREE
)
15903 decl
= error_mark_node
;
15905 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15907 integral_constant_expression_p
,
15908 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15909 &non_integral_constant_expression_p
,
15910 /*template_p=*/false,
15912 /*address_p=*/false,
15913 /*template_arg_p=*/false,
15918 if (!function_p
&& identifier_p (decl
))
15920 if (complain
& tf_error
)
15921 unqualified_name_lookup_error (decl
);
15922 decl
= error_mark_node
;
15927 case TEMPLATE_ID_EXPR
:
15930 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15931 tree targs
= TREE_OPERAND (t
, 1);
15934 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15935 if (targs
== error_mark_node
)
15936 return error_mark_node
;
15938 if (variable_template_p (templ
))
15939 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
15941 if (TREE_CODE (templ
) == COMPONENT_REF
)
15943 object
= TREE_OPERAND (templ
, 0);
15944 templ
= TREE_OPERAND (templ
, 1);
15947 object
= NULL_TREE
;
15948 templ
= lookup_template_function (templ
, targs
);
15951 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
15952 object
, templ
, NULL_TREE
));
15954 RETURN (baselink_for_fns (templ
));
15959 tree r
= RECUR (TREE_OPERAND (t
, 0));
15961 if (REFERENCE_REF_P (t
))
15963 /* A type conversion to reference type will be enclosed in
15964 such an indirect ref, but the substitution of the cast
15965 will have also added such an indirect ref. */
15966 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
15967 r
= convert_from_reference (r
);
15970 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
15971 complain
|decltype_flag
);
15977 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15978 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15979 RETURN (build_nop (type
, op0
));
15982 case IMPLICIT_CONV_EXPR
:
15984 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15985 tree expr
= RECUR (TREE_OPERAND (t
, 0));
15986 int flags
= LOOKUP_IMPLICIT
;
15987 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
15988 flags
= LOOKUP_NORMAL
;
15989 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
15995 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15996 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15997 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
16001 case REINTERPRET_CAST_EXPR
:
16002 case CONST_CAST_EXPR
:
16003 case DYNAMIC_CAST_EXPR
:
16004 case STATIC_CAST_EXPR
:
16007 tree op
, r
= NULL_TREE
;
16009 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16010 if (integral_constant_expression_p
16011 && !cast_valid_in_integral_constant_expression_p (type
))
16013 if (complain
& tf_error
)
16014 error ("a cast to a type other than an integral or "
16015 "enumeration type cannot appear in a constant-expression");
16016 RETURN (error_mark_node
);
16019 op
= RECUR (TREE_OPERAND (t
, 0));
16021 warning_sentinel
s(warn_useless_cast
);
16022 switch (TREE_CODE (t
))
16025 r
= build_functional_cast (type
, op
, complain
);
16027 case REINTERPRET_CAST_EXPR
:
16028 r
= build_reinterpret_cast (type
, op
, complain
);
16030 case CONST_CAST_EXPR
:
16031 r
= build_const_cast (type
, op
, complain
);
16033 case DYNAMIC_CAST_EXPR
:
16034 r
= build_dynamic_cast (type
, op
, complain
);
16036 case STATIC_CAST_EXPR
:
16037 r
= build_static_cast (type
, op
, complain
);
16040 gcc_unreachable ();
16046 case POSTDECREMENT_EXPR
:
16047 case POSTINCREMENT_EXPR
:
16048 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16049 args
, complain
, in_decl
);
16050 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
16051 complain
|decltype_flag
));
16053 case PREDECREMENT_EXPR
:
16054 case PREINCREMENT_EXPR
:
16058 case TRUTH_NOT_EXPR
:
16059 case UNARY_PLUS_EXPR
: /* Unary + */
16060 case REALPART_EXPR
:
16061 case IMAGPART_EXPR
:
16062 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
16063 RECUR (TREE_OPERAND (t
, 0)),
16064 complain
|decltype_flag
));
16066 case FIX_TRUNC_EXPR
:
16067 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
16071 op1
= TREE_OPERAND (t
, 0);
16072 if (TREE_CODE (op1
) == LABEL_DECL
)
16073 RETURN (finish_label_address_expr (DECL_NAME (op1
),
16074 EXPR_LOCATION (op1
)));
16075 if (TREE_CODE (op1
) == SCOPE_REF
)
16076 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
16077 /*done=*/true, /*address_p=*/true);
16079 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
16081 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
16082 complain
|decltype_flag
));
16087 case TRUNC_DIV_EXPR
:
16088 case CEIL_DIV_EXPR
:
16089 case FLOOR_DIV_EXPR
:
16090 case ROUND_DIV_EXPR
:
16091 case EXACT_DIV_EXPR
:
16095 case TRUNC_MOD_EXPR
:
16096 case FLOOR_MOD_EXPR
:
16097 case TRUTH_ANDIF_EXPR
:
16098 case TRUTH_ORIF_EXPR
:
16099 case TRUTH_AND_EXPR
:
16100 case TRUTH_OR_EXPR
:
16116 warning_sentinel
s1(warn_type_limits
);
16117 warning_sentinel
s2(warn_div_by_zero
);
16118 warning_sentinel
s3(warn_logical_op
);
16119 warning_sentinel
s4(warn_tautological_compare
);
16120 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16121 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16122 tree r
= build_x_binary_op
16123 (input_location
, TREE_CODE (t
),
16125 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
16127 : TREE_CODE (TREE_OPERAND (t
, 0))),
16129 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
16131 : TREE_CODE (TREE_OPERAND (t
, 1))),
16133 complain
|decltype_flag
);
16134 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
16135 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16140 case POINTER_PLUS_EXPR
:
16142 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16143 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16144 return fold_build_pointer_plus (op0
, op1
);
16148 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
16149 /*address_p=*/false));
16151 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16152 args
, complain
, in_decl
);
16153 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
16154 RECUR (TREE_OPERAND (t
, 1)),
16155 complain
|decltype_flag
));
16157 case ARRAY_NOTATION_REF
:
16159 tree start_index
, length
, stride
;
16160 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
16161 args
, complain
, in_decl
);
16162 start_index
= RECUR (ARRAY_NOTATION_START (t
));
16163 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
16164 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
16165 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
16166 length
, stride
, TREE_TYPE (op1
)));
16169 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
16170 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16177 op1
= TREE_OPERAND (t
, 0);
16178 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
16179 op1
= TREE_TYPE (op1
);
16182 /* When there are no ARGS, we are trying to evaluate a
16183 non-dependent expression from the parser. Trying to do
16184 the substitutions may not work. */
16186 op1
= TREE_TYPE (op1
);
16190 ++cp_unevaluated_operand
;
16191 ++c_inhibit_evaluation_warnings
;
16193 op1
= tsubst (op1
, args
, complain
, in_decl
);
16195 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16196 /*function_p=*/false,
16197 /*integral_constant_expression_p=*/
16199 --cp_unevaluated_operand
;
16200 --c_inhibit_evaluation_warnings
;
16203 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
16204 complain
& tf_error
);
16206 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
16207 complain
& tf_error
);
16208 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
16210 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
16212 if (!processing_template_decl
&& TYPE_P (op1
))
16214 r
= build_min (SIZEOF_EXPR
, size_type_node
,
16215 build1 (NOP_EXPR
, op1
, error_mark_node
));
16216 SIZEOF_EXPR_TYPE_P (r
) = 1;
16219 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
16220 TREE_SIDE_EFFECTS (r
) = 0;
16221 TREE_READONLY (r
) = 1;
16223 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
16228 case AT_ENCODE_EXPR
:
16230 op1
= TREE_OPERAND (t
, 0);
16231 ++cp_unevaluated_operand
;
16232 ++c_inhibit_evaluation_warnings
;
16233 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16234 /*function_p=*/false,
16235 /*integral_constant_expression_p=*/false);
16236 --cp_unevaluated_operand
;
16237 --c_inhibit_evaluation_warnings
;
16238 RETURN (objc_build_encode_expr (op1
));
16241 case NOEXCEPT_EXPR
:
16242 op1
= TREE_OPERAND (t
, 0);
16243 ++cp_unevaluated_operand
;
16244 ++c_inhibit_evaluation_warnings
;
16245 ++cp_noexcept_operand
;
16246 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16247 /*function_p=*/false,
16248 /*integral_constant_expression_p=*/false);
16249 --cp_unevaluated_operand
;
16250 --c_inhibit_evaluation_warnings
;
16251 --cp_noexcept_operand
;
16252 RETURN (finish_noexcept_expr (op1
, complain
));
16256 warning_sentinel
s(warn_div_by_zero
);
16257 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16258 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16259 tree r
= build_x_modify_expr
16260 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16261 complain
|decltype_flag
);
16262 /* TREE_NO_WARNING must be set if either the expression was
16263 parenthesized or it uses an operator such as >>= rather
16264 than plain assignment. In the former case, it was already
16265 set and must be copied. In the latter case,
16266 build_x_modify_expr sets it and it must not be reset
16268 if (TREE_NO_WARNING (t
))
16269 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16275 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16276 args
, complain
, in_decl
);
16277 /* Remember that there was a reference to this entity. */
16279 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16280 RETURN (error_mark_node
);
16281 RETURN (build_x_arrow (input_location
, op1
, complain
));
16285 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16286 tree init
= RECUR (TREE_OPERAND (t
, 3));
16287 vec
<tree
, va_gc
> *placement_vec
;
16288 vec
<tree
, va_gc
> *init_vec
;
16291 if (placement
== NULL_TREE
)
16292 placement_vec
= NULL
;
16295 placement_vec
= make_tree_vector ();
16296 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16297 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16300 /* If there was an initializer in the original tree, but it
16301 instantiated to an empty list, then we should pass a
16302 non-NULL empty vector to tell build_new that it was an
16303 empty initializer() rather than no initializer. This can
16304 only happen when the initializer is a pack expansion whose
16305 parameter packs are of length zero. */
16306 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16310 init_vec
= make_tree_vector ();
16311 if (init
== void_node
)
16312 gcc_assert (init_vec
!= NULL
);
16315 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16316 vec_safe_push (init_vec
, TREE_VALUE (init
));
16320 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16321 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16322 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16323 NEW_EXPR_USE_GLOBAL (t
),
16326 if (placement_vec
!= NULL
)
16327 release_tree_vector (placement_vec
);
16328 if (init_vec
!= NULL
)
16329 release_tree_vector (init_vec
);
16336 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16337 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16338 RETURN (delete_sanity (op0
, op1
,
16339 DELETE_EXPR_USE_VEC (t
),
16340 DELETE_EXPR_USE_GLOBAL (t
),
16344 case COMPOUND_EXPR
:
16346 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16347 complain
& ~tf_decltype
, in_decl
,
16348 /*function_p=*/false,
16349 integral_constant_expression_p
);
16350 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16352 RECUR (TREE_OPERAND (t
, 1)),
16353 complain
|decltype_flag
));
16359 vec
<tree
, va_gc
> *call_args
;
16360 unsigned int nargs
, i
;
16365 function
= CALL_EXPR_FN (t
);
16366 /* When we parsed the expression, we determined whether or
16367 not Koenig lookup should be performed. */
16368 koenig_p
= KOENIG_LOOKUP_P (t
);
16369 if (TREE_CODE (function
) == SCOPE_REF
)
16371 qualified_p
= true;
16372 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16374 /*address_p=*/false);
16376 else if (koenig_p
&& identifier_p (function
))
16378 /* Do nothing; calling tsubst_copy_and_build on an identifier
16379 would incorrectly perform unqualified lookup again.
16381 Note that we can also have an IDENTIFIER_NODE if the earlier
16382 unqualified lookup found a member function; in that case
16383 koenig_p will be false and we do want to do the lookup
16384 again to find the instantiated member function.
16386 FIXME but doing that causes c++/15272, so we need to stop
16387 using IDENTIFIER_NODE in that situation. */
16388 qualified_p
= false;
16392 if (TREE_CODE (function
) == COMPONENT_REF
)
16394 tree op
= TREE_OPERAND (function
, 1);
16396 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16397 || (BASELINK_P (op
)
16398 && BASELINK_QUALIFIED_P (op
)));
16401 qualified_p
= false;
16403 if (TREE_CODE (function
) == ADDR_EXPR
16404 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16405 /* Avoid error about taking the address of a constructor. */
16406 function
= TREE_OPERAND (function
, 0);
16408 function
= tsubst_copy_and_build (function
, args
, complain
,
16411 integral_constant_expression_p
);
16413 if (BASELINK_P (function
))
16414 qualified_p
= true;
16417 nargs
= call_expr_nargs (t
);
16418 call_args
= make_tree_vector ();
16419 for (i
= 0; i
< nargs
; ++i
)
16421 tree arg
= CALL_EXPR_ARG (t
, i
);
16423 if (!PACK_EXPANSION_P (arg
))
16424 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16427 /* Expand the pack expansion and push each entry onto
16429 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16430 if (TREE_CODE (arg
) == TREE_VEC
)
16432 unsigned int len
, j
;
16434 len
= TREE_VEC_LENGTH (arg
);
16435 for (j
= 0; j
< len
; ++j
)
16437 tree value
= TREE_VEC_ELT (arg
, j
);
16438 if (value
!= NULL_TREE
)
16439 value
= convert_from_reference (value
);
16440 vec_safe_push (call_args
, value
);
16445 /* A partial substitution. Add one entry. */
16446 vec_safe_push (call_args
, arg
);
16451 /* We do not perform argument-dependent lookup if normal
16452 lookup finds a non-function, in accordance with the
16453 expected resolution of DR 218. */
16455 && ((is_overloaded_fn (function
)
16456 /* If lookup found a member function, the Koenig lookup is
16457 not appropriate, even if an unqualified-name was used
16458 to denote the function. */
16459 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16460 || identifier_p (function
))
16461 /* Only do this when substitution turns a dependent call
16462 into a non-dependent call. */
16463 && type_dependent_expression_p_push (t
)
16464 && !any_type_dependent_arguments_p (call_args
))
16465 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16467 if (identifier_p (function
)
16468 && !any_type_dependent_arguments_p (call_args
))
16470 if (koenig_p
&& (complain
& tf_warning_or_error
))
16472 /* For backwards compatibility and good diagnostics, try
16473 the unqualified lookup again if we aren't in SFINAE
16475 tree unq
= (tsubst_copy_and_build
16476 (function
, args
, complain
, in_decl
, true,
16477 integral_constant_expression_p
));
16478 if (unq
== error_mark_node
)
16479 RETURN (error_mark_node
);
16481 if (unq
!= function
)
16484 if (INDIRECT_REF_P (fn
))
16485 fn
= TREE_OPERAND (fn
, 0);
16486 if (TREE_CODE (fn
) == COMPONENT_REF
)
16487 fn
= TREE_OPERAND (fn
, 1);
16488 if (is_overloaded_fn (fn
))
16489 fn
= get_first_fn (fn
);
16490 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16491 "%qD was not declared in this scope, "
16492 "and no declarations were found by "
16493 "argument-dependent lookup at the point "
16494 "of instantiation", function
))
16497 /* Can't say anything more. */;
16498 else if (DECL_CLASS_SCOPE_P (fn
))
16500 location_t loc
= EXPR_LOC_OR_LOC (t
,
16503 "declarations in dependent base %qT are "
16504 "not found by unqualified lookup",
16505 DECL_CLASS_CONTEXT (fn
));
16506 if (current_class_ptr
)
16508 "use %<this->%D%> instead", function
);
16511 "use %<%T::%D%> instead",
16512 current_class_name
, function
);
16515 inform (DECL_SOURCE_LOCATION (fn
),
16516 "%qD declared here, later in the "
16517 "translation unit", fn
);
16522 if (identifier_p (function
))
16524 if (complain
& tf_error
)
16525 unqualified_name_lookup_error (function
);
16526 release_tree_vector (call_args
);
16527 RETURN (error_mark_node
);
16531 /* Remember that there was a reference to this entity. */
16532 if (DECL_P (function
)
16533 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16534 RETURN (error_mark_node
);
16536 /* Put back tf_decltype for the actual call. */
16537 complain
|= decltype_flag
;
16539 if (TREE_CODE (function
) == OFFSET_REF
)
16540 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16542 else if (TREE_CODE (function
) == COMPONENT_REF
)
16544 tree instance
= TREE_OPERAND (function
, 0);
16545 tree fn
= TREE_OPERAND (function
, 1);
16547 if (processing_template_decl
16548 && (type_dependent_expression_p (instance
)
16549 || (!BASELINK_P (fn
)
16550 && TREE_CODE (fn
) != FIELD_DECL
)
16551 || type_dependent_expression_p (fn
)
16552 || any_type_dependent_arguments_p (call_args
)))
16553 ret
= build_nt_call_vec (function
, call_args
);
16554 else if (!BASELINK_P (fn
))
16555 ret
= finish_call_expr (function
, &call_args
,
16556 /*disallow_virtual=*/false,
16557 /*koenig_p=*/false,
16560 ret
= (build_new_method_call
16562 &call_args
, NULL_TREE
,
16563 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16568 ret
= finish_call_expr (function
, &call_args
,
16569 /*disallow_virtual=*/qualified_p
,
16573 release_tree_vector (call_args
);
16580 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16581 tree folded_cond
= fold_non_dependent_expr (cond
);
16584 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16586 if (integer_zerop (folded_cond
))
16588 ++c_inhibit_evaluation_warnings
;
16589 exp1
= RECUR (TREE_OPERAND (t
, 1));
16590 --c_inhibit_evaluation_warnings
;
16591 exp2
= RECUR (TREE_OPERAND (t
, 2));
16595 exp1
= RECUR (TREE_OPERAND (t
, 1));
16596 ++c_inhibit_evaluation_warnings
;
16597 exp2
= RECUR (TREE_OPERAND (t
, 2));
16598 --c_inhibit_evaluation_warnings
;
16600 cond
= folded_cond
;
16604 exp1
= RECUR (TREE_OPERAND (t
, 1));
16605 exp2
= RECUR (TREE_OPERAND (t
, 2));
16608 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16609 cond
, exp1
, exp2
, complain
));
16612 case PSEUDO_DTOR_EXPR
:
16614 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16615 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16616 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16617 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16623 tree purpose
, value
, chain
;
16625 if (t
== void_list_node
)
16628 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16629 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16631 /* We have pack expansions, so expand those and
16632 create a new list out of it. */
16633 tree purposevec
= NULL_TREE
;
16634 tree valuevec
= NULL_TREE
;
16638 /* Expand the argument expressions. */
16639 if (TREE_PURPOSE (t
))
16640 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16641 complain
, in_decl
);
16642 if (TREE_VALUE (t
))
16643 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16644 complain
, in_decl
);
16646 /* Build the rest of the list. */
16647 chain
= TREE_CHAIN (t
);
16648 if (chain
&& chain
!= void_type_node
)
16649 chain
= RECUR (chain
);
16651 /* Determine the number of arguments. */
16652 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16654 len
= TREE_VEC_LENGTH (purposevec
);
16655 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16657 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16658 len
= TREE_VEC_LENGTH (valuevec
);
16661 /* Since we only performed a partial substitution into
16662 the argument pack, we only RETURN (a single list
16664 if (purposevec
== TREE_PURPOSE (t
)
16665 && valuevec
== TREE_VALUE (t
)
16666 && chain
== TREE_CHAIN (t
))
16669 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16672 /* Convert the argument vectors into a TREE_LIST */
16676 /* Grab the Ith values. */
16678 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16681 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16684 /* Build the list (backwards). */
16685 chain
= tree_cons (purpose
, value
, chain
);
16691 purpose
= TREE_PURPOSE (t
);
16693 purpose
= RECUR (purpose
);
16694 value
= TREE_VALUE (t
);
16696 value
= RECUR (value
);
16697 chain
= TREE_CHAIN (t
);
16698 if (chain
&& chain
!= void_type_node
)
16699 chain
= RECUR (chain
);
16700 if (purpose
== TREE_PURPOSE (t
)
16701 && value
== TREE_VALUE (t
)
16702 && chain
== TREE_CHAIN (t
))
16704 RETURN (tree_cons (purpose
, value
, chain
));
16707 case COMPONENT_REF
:
16714 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16715 args
, complain
, in_decl
);
16716 /* Remember that there was a reference to this entity. */
16717 if (DECL_P (object
)
16718 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16719 RETURN (error_mark_node
);
16720 object_type
= TREE_TYPE (object
);
16722 member
= TREE_OPERAND (t
, 1);
16723 if (BASELINK_P (member
))
16724 member
= tsubst_baselink (member
,
16725 non_reference (TREE_TYPE (object
)),
16726 args
, complain
, in_decl
);
16728 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16729 if (member
== error_mark_node
)
16730 RETURN (error_mark_node
);
16732 if (type_dependent_expression_p (object
))
16733 /* We can't do much here. */;
16734 else if (!CLASS_TYPE_P (object_type
))
16736 if (scalarish_type_p (object_type
))
16738 tree s
= NULL_TREE
;
16739 tree dtor
= member
;
16741 if (TREE_CODE (dtor
) == SCOPE_REF
)
16743 s
= TREE_OPERAND (dtor
, 0);
16744 dtor
= TREE_OPERAND (dtor
, 1);
16746 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16748 dtor
= TREE_OPERAND (dtor
, 0);
16750 RETURN (finish_pseudo_destructor_expr
16751 (object
, s
, dtor
, input_location
));
16755 else if (TREE_CODE (member
) == SCOPE_REF
16756 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16758 /* Lookup the template functions now that we know what the
16760 tree scope
= TREE_OPERAND (member
, 0);
16761 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16762 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16763 member
= lookup_qualified_name (scope
, tmpl
,
16764 /*is_type_p=*/false,
16765 /*complain=*/false);
16766 if (BASELINK_P (member
))
16768 BASELINK_FUNCTIONS (member
)
16769 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16771 member
= (adjust_result_of_qualified_name_lookup
16772 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16777 qualified_name_lookup_error (scope
, tmpl
, member
,
16779 RETURN (error_mark_node
);
16782 else if (TREE_CODE (member
) == SCOPE_REF
16783 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16784 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16786 if (complain
& tf_error
)
16788 if (TYPE_P (TREE_OPERAND (member
, 0)))
16789 error ("%qT is not a class or namespace",
16790 TREE_OPERAND (member
, 0));
16792 error ("%qD is not a class or namespace",
16793 TREE_OPERAND (member
, 0));
16795 RETURN (error_mark_node
);
16797 else if (TREE_CODE (member
) == FIELD_DECL
)
16799 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16800 if (TREE_CODE (r
) == COMPONENT_REF
)
16801 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16805 r
= finish_class_member_access_expr (object
, member
,
16806 /*template_p=*/false,
16808 if (TREE_CODE (r
) == COMPONENT_REF
)
16809 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16814 RETURN (build_throw
16815 (RECUR (TREE_OPERAND (t
, 0))));
16819 vec
<constructor_elt
, va_gc
> *n
;
16820 constructor_elt
*ce
;
16821 unsigned HOST_WIDE_INT idx
;
16822 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16823 bool process_index_p
;
16825 bool need_copy_p
= false;
16828 if (type
== error_mark_node
)
16829 RETURN (error_mark_node
);
16831 /* digest_init will do the wrong thing if we let it. */
16832 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16835 /* We do not want to process the index of aggregate
16836 initializers as they are identifier nodes which will be
16837 looked up by digest_init. */
16838 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16840 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16841 newlen
= vec_safe_length (n
);
16842 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16844 if (ce
->index
&& process_index_p
16845 /* An identifier index is looked up in the type
16846 being initialized, not the current scope. */
16847 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16848 ce
->index
= RECUR (ce
->index
);
16850 if (PACK_EXPANSION_P (ce
->value
))
16852 /* Substitute into the pack expansion. */
16853 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16856 if (ce
->value
== error_mark_node
16857 || PACK_EXPANSION_P (ce
->value
))
16859 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16860 /* Just move the argument into place. */
16861 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16864 /* Update the length of the final CONSTRUCTOR
16865 arguments vector, and note that we will need to
16867 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16868 need_copy_p
= true;
16872 ce
->value
= RECUR (ce
->value
);
16877 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16879 vec_alloc (n
, newlen
);
16880 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16882 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16884 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16885 for (i
= 0; i
< len
; ++i
)
16886 CONSTRUCTOR_APPEND_ELT (n
, 0,
16887 TREE_VEC_ELT (ce
->value
, i
));
16890 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16894 r
= build_constructor (init_list_type_node
, n
);
16895 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16897 if (TREE_HAS_CONSTRUCTOR (t
))
16898 RETURN (finish_compound_literal (type
, r
, complain
));
16900 TREE_TYPE (r
) = type
;
16906 tree operand_0
= TREE_OPERAND (t
, 0);
16907 if (TYPE_P (operand_0
))
16909 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16910 RETURN (get_typeid (operand_0
, complain
));
16914 operand_0
= RECUR (operand_0
);
16915 RETURN (build_typeid (operand_0
, complain
));
16922 else if (DECL_PACK_P (t
))
16924 /* We don't build decls for an instantiation of a
16925 variadic capture proxy, we instantiate the elements
16927 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16928 return RECUR (DECL_VALUE_EXPR (t
));
16934 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16935 /* ??? We're doing a subset of finish_id_expression here. */
16937 && !processing_template_decl
16938 && !cp_unevaluated_operand
16939 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16940 && CP_DECL_THREAD_LOCAL_P (r
))
16942 if (tree wrap
= get_tls_wrapper_fn (r
))
16943 /* Replace an evaluated use of the thread_local variable with
16944 a call to its wrapper. */
16945 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
16947 else if (outer_automatic_var_p (r
))
16949 r
= process_outer_var_ref (r
, complain
);
16950 if (is_capture_proxy (r
))
16951 register_local_specialization (r
, t
);
16954 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
16955 /* If the original type was a reference, we'll be wrapped in
16956 the appropriate INDIRECT_REF. */
16957 r
= convert_from_reference (r
);
16963 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16964 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16965 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
16968 case OFFSETOF_EXPR
:
16969 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
16970 EXPR_LOCATION (t
)));
16974 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
16975 complain
, in_decl
);
16977 tree type2
= TRAIT_EXPR_TYPE2 (t
);
16978 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
16979 type2
= RECUR (type2
);
16981 type2
= tsubst (type2
, args
, complain
, in_decl
);
16983 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
16988 tree old_stmt_expr
= cur_stmt_expr
;
16989 tree stmt_expr
= begin_stmt_expr ();
16991 cur_stmt_expr
= stmt_expr
;
16992 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
16993 integral_constant_expression_p
);
16994 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
16995 cur_stmt_expr
= old_stmt_expr
;
16997 /* If the resulting list of expression statement is empty,
16998 fold it further into void_node. */
16999 if (empty_expr_stmt_p (stmt_expr
))
17000 stmt_expr
= void_node
;
17002 RETURN (stmt_expr
);
17007 tree r
= build_lambda_expr ();
17009 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
17010 LAMBDA_EXPR_CLOSURE (r
) = type
;
17011 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
17013 LAMBDA_EXPR_LOCATION (r
)
17014 = LAMBDA_EXPR_LOCATION (t
);
17015 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
17016 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
17017 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
17018 LAMBDA_EXPR_DISCRIMINATOR (r
)
17019 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
17020 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
17022 /* No substitution needed. */;
17023 else if (VAR_OR_FUNCTION_DECL_P (scope
))
17024 /* For a function or variable scope, we want to use tsubst so that we
17025 don't complain about referring to an auto before deduction. */
17026 scope
= tsubst (scope
, args
, complain
, in_decl
);
17027 else if (TREE_CODE (scope
) == PARM_DECL
)
17029 /* Look up the parameter we want directly, as tsubst_copy
17030 doesn't do what we need. */
17031 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
17032 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
17033 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
17034 parm
= DECL_CHAIN (parm
);
17036 /* FIXME Work around the parm not having DECL_CONTEXT set. */
17037 if (DECL_CONTEXT (scope
) == NULL_TREE
)
17038 DECL_CONTEXT (scope
) = fn
;
17040 else if (TREE_CODE (scope
) == FIELD_DECL
)
17041 /* For a field, use tsubst_copy so that we look up the existing field
17042 rather than build a new one. */
17043 scope
= RECUR (scope
);
17045 gcc_unreachable ();
17046 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
17047 LAMBDA_EXPR_RETURN_TYPE (r
)
17048 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
17050 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
17051 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
17053 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17054 determine_visibility (TYPE_NAME (type
));
17055 /* Now that we know visibility, instantiate the type so we have a
17056 declaration of the op() for later calls to lambda_function. */
17057 complete_type (type
);
17059 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
17061 insert_pending_capture_proxies ();
17063 RETURN (build_lambda_object (r
));
17067 /* We can get here for a constant initializer of non-dependent type.
17068 FIXME stop folding in cp_parser_initializer_clause. */
17070 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
17075 case TRANSACTION_EXPR
:
17076 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
17077 integral_constant_expression_p
));
17080 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
17082 case VEC_PERM_EXPR
:
17084 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17085 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17086 tree op2
= RECUR (TREE_OPERAND (t
, 2));
17087 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
17091 case REQUIRES_EXPR
:
17092 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
17095 /* Handle Objective-C++ constructs, if appropriate. */
17098 = objcp_tsubst_copy_and_build (t
, args
, complain
,
17099 in_decl
, /*function_p=*/false);
17103 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
17109 input_location
= loc
;
17113 /* Verify that the instantiated ARGS are valid. For type arguments,
17114 make sure that the type's linkage is ok. For non-type arguments,
17115 make sure they are constants if they are integral or enumerations.
17116 Emit an error under control of COMPLAIN, and return TRUE on error. */
17119 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
17121 if (dependent_template_arg_p (t
))
17123 if (ARGUMENT_PACK_P (t
))
17125 tree vec
= ARGUMENT_PACK_ARGS (t
);
17126 int len
= TREE_VEC_LENGTH (vec
);
17127 bool result
= false;
17130 for (i
= 0; i
< len
; ++i
)
17131 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
17135 else if (TYPE_P (t
))
17137 /* [basic.link]: A name with no linkage (notably, the name
17138 of a class or enumeration declared in a local scope)
17139 shall not be used to declare an entity with linkage.
17140 This implies that names with no linkage cannot be used as
17143 DR 757 relaxes this restriction for C++0x. */
17144 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
17145 : no_linkage_check (t
, /*relaxed_p=*/false));
17149 /* DR 488 makes use of a type with no linkage cause
17150 type deduction to fail. */
17151 if (complain
& tf_error
)
17153 if (TYPE_ANONYMOUS_P (nt
))
17154 error ("%qT is/uses anonymous type", t
);
17156 error ("template argument for %qD uses local type %qT",
17161 /* In order to avoid all sorts of complications, we do not
17162 allow variably-modified types as template arguments. */
17163 else if (variably_modified_type_p (t
, NULL_TREE
))
17165 if (complain
& tf_error
)
17166 error ("%qT is a variably modified type", t
);
17170 /* Class template and alias template arguments should be OK. */
17171 else if (DECL_TYPE_TEMPLATE_P (t
))
17173 /* A non-type argument of integral or enumerated type must be a
17175 else if (TREE_TYPE (t
)
17176 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
17177 && !REFERENCE_REF_P (t
)
17178 && !TREE_CONSTANT (t
))
17180 if (complain
& tf_error
)
17181 error ("integral expression %qE is not constant", t
);
17188 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
17190 int ix
, len
= DECL_NTPARMS (tmpl
);
17191 bool result
= false;
17193 for (ix
= 0; ix
!= len
; ix
++)
17195 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
17198 if (result
&& (complain
& tf_error
))
17199 error (" trying to instantiate %qD", tmpl
);
17203 /* We're out of SFINAE context now, so generate diagnostics for the access
17204 errors we saw earlier when instantiating D from TMPL and ARGS. */
17207 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
17209 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17210 tree type
= TREE_TYPE (pattern
);
17211 location_t loc
= input_location
;
17213 push_access_scope (d
);
17214 push_deferring_access_checks (dk_no_deferred
);
17215 input_location
= DECL_SOURCE_LOCATION (pattern
);
17216 tsubst (type
, args
, tf_warning_or_error
, d
);
17217 input_location
= loc
;
17218 pop_deferring_access_checks ();
17219 pop_access_scope (d
);
17222 /* Instantiate the indicated variable, function, or alias template TMPL with
17223 the template arguments in TARG_PTR. */
17226 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17228 tree targ_ptr
= orig_args
;
17232 bool access_ok
= true;
17234 if (tmpl
== error_mark_node
)
17235 return error_mark_node
;
17237 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
17239 /* If this function is a clone, handle it specially. */
17240 if (DECL_CLONED_FUNCTION_P (tmpl
))
17245 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
17246 DECL_CLONED_FUNCTION. */
17247 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17248 targ_ptr
, complain
);
17249 if (spec
== error_mark_node
)
17250 return error_mark_node
;
17252 /* Look for the clone. */
17253 FOR_EACH_CLONE (clone
, spec
)
17254 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17256 /* We should always have found the clone by now. */
17257 gcc_unreachable ();
17261 if (targ_ptr
== error_mark_node
)
17262 return error_mark_node
;
17264 /* Check to see if we already have this specialization. */
17265 gen_tmpl
= most_general_template (tmpl
);
17266 if (tmpl
!= gen_tmpl
)
17267 /* The TMPL is a partial instantiation. To get a full set of
17268 arguments we must add the arguments used to perform the
17269 partial instantiation. */
17270 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17273 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17274 but it doesn't seem to be on the hot path. */
17275 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17277 gcc_assert (tmpl
== gen_tmpl
17278 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17280 || fndecl
== NULL_TREE
);
17282 if (spec
!= NULL_TREE
)
17284 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17286 if (complain
& tf_error
)
17287 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17288 return error_mark_node
;
17293 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17295 return error_mark_node
;
17297 /* We are building a FUNCTION_DECL, during which the access of its
17298 parameters and return types have to be checked. However this
17299 FUNCTION_DECL which is the desired context for access checking
17300 is not built yet. We solve this chicken-and-egg problem by
17301 deferring all checks until we have the FUNCTION_DECL. */
17302 push_deferring_access_checks (dk_deferred
);
17304 /* Instantiation of the function happens in the context of the function
17305 template, not the context of the overload resolution we're doing. */
17306 push_to_top_level ();
17307 /* If there are dependent arguments, e.g. because we're doing partial
17308 ordering, make sure processing_template_decl stays set. */
17309 if (uses_template_parms (targ_ptr
))
17310 ++processing_template_decl
;
17311 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17313 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17314 complain
, gen_tmpl
, true);
17315 push_nested_class (ctx
);
17318 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17320 if (VAR_P (pattern
))
17322 /* We need to determine if we're using a partial or explicit
17323 specialization now, because the type of the variable could be
17325 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17326 tree elt
= most_specialized_partial_spec (tid
, complain
);
17327 if (elt
== error_mark_node
)
17328 pattern
= error_mark_node
;
17331 tmpl
= TREE_VALUE (elt
);
17332 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17333 targ_ptr
= TREE_PURPOSE (elt
);
17337 /* Substitute template parameters to obtain the specialization. */
17338 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17339 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17340 pop_nested_class ();
17341 pop_from_top_level ();
17343 if (fndecl
== error_mark_node
)
17345 pop_deferring_access_checks ();
17346 return error_mark_node
;
17349 /* The DECL_TI_TEMPLATE should always be the immediate parent
17350 template, not the most general template. */
17351 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17352 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17354 /* Now we know the specialization, compute access previously
17356 push_access_scope (fndecl
);
17357 if (!perform_deferred_access_checks (complain
))
17359 pop_access_scope (fndecl
);
17360 pop_deferring_access_checks ();
17362 /* If we've just instantiated the main entry point for a function,
17363 instantiate all the alternate entry points as well. We do this
17364 by cloning the instantiation of the main entry point, not by
17365 instantiating the template clones. */
17366 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17367 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17371 if (!(complain
& tf_error
))
17373 /* Remember to reinstantiate when we're out of SFINAE so the user
17374 can see the errors. */
17375 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17377 return error_mark_node
;
17382 /* Wrapper for instantiate_template_1. */
17385 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17388 timevar_push (TV_TEMPLATE_INST
);
17389 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17390 timevar_pop (TV_TEMPLATE_INST
);
17394 /* Instantiate the alias template TMPL with ARGS. Also push a template
17395 instantiation level, which instantiate_template doesn't do because
17396 functions and variables have sufficient context established by the
17400 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17402 struct pending_template
*old_last_pend
= last_pending_template
;
17403 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17404 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17405 return error_mark_node
;
17406 tree tinst
= build_tree_list (tmpl
, args
);
17407 if (!push_tinst_level (tinst
))
17410 return error_mark_node
;
17414 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17415 args
, tmpl
, complain
,
17416 /*require_all_args=*/true,
17417 /*use_default_args=*/true);
17419 tree r
= instantiate_template (tmpl
, args
, complain
);
17420 pop_tinst_level ();
17421 /* We can't free this if a pending_template entry or last_error_tinst_level
17422 is pointing at it. */
17423 if (last_pending_template
== old_last_pend
17424 && last_error_tinst_level
== old_error_tinst
)
17430 /* PARM is a template parameter pack for FN. Returns true iff
17431 PARM is used in a deducible way in the argument list of FN. */
17434 pack_deducible_p (tree parm
, tree fn
)
17436 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17437 for (; t
; t
= TREE_CHAIN (t
))
17439 tree type
= TREE_VALUE (t
);
17441 if (!PACK_EXPANSION_P (type
))
17443 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17444 packs
; packs
= TREE_CHAIN (packs
))
17445 if (template_args_equal (TREE_VALUE (packs
), parm
))
17447 /* The template parameter pack is used in a function parameter
17448 pack. If this is the end of the parameter list, the
17449 template parameter pack is deducible. */
17450 if (TREE_CHAIN (t
) == void_list_node
)
17453 /* Otherwise, not. Well, it could be deduced from
17454 a non-pack parameter, but doing so would end up with
17455 a deduction mismatch, so don't bother. */
17459 /* The template parameter pack isn't used in any function parameter
17460 packs, but it might be used deeper, e.g. tuple<Args...>. */
17464 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17465 NARGS elements of the arguments that are being used when calling
17466 it. TARGS is a vector into which the deduced template arguments
17469 Returns either a FUNCTION_DECL for the matching specialization of FN or
17470 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17471 true, diagnostics will be printed to explain why it failed.
17473 If FN is a conversion operator, or we are trying to produce a specific
17474 specialization, RETURN_TYPE is the return type desired.
17476 The EXPLICIT_TARGS are explicit template arguments provided via a
17479 The parameter STRICT is one of:
17482 We are deducing arguments for a function call, as in
17483 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17484 deducing arguments for a call to the result of a conversion
17485 function template, as in [over.call.object].
17488 We are deducing arguments for a conversion function, as in
17489 [temp.deduct.conv].
17492 We are deducing arguments when doing an explicit instantiation
17493 as in [temp.explicit], when determining an explicit specialization
17494 as in [temp.expl.spec], or when taking the address of a function
17495 template, as in [temp.deduct.funcaddr]. */
17498 fn_type_unification (tree fn
,
17499 tree explicit_targs
,
17502 unsigned int nargs
,
17504 unification_kind_t strict
,
17511 tree decl
= NULL_TREE
;
17512 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17514 static int deduction_depth
;
17515 struct pending_template
*old_last_pend
= last_pending_template
;
17516 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17517 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17519 tree r
= error_mark_node
;
17522 complain
|= tf_decltype
;
17524 /* In C++0x, it's possible to have a function template whose type depends
17525 on itself recursively. This is most obvious with decltype, but can also
17526 occur with enumeration scope (c++/48969). So we need to catch infinite
17527 recursion and reject the substitution at deduction time; this function
17528 will return error_mark_node for any repeated substitution.
17530 This also catches excessive recursion such as when f<N> depends on
17531 f<N-1> across all integers, and returns error_mark_node for all the
17532 substitutions back up to the initial one.
17534 This is, of course, not reentrant. */
17535 if (excessive_deduction_depth
)
17536 return error_mark_node
;
17537 tinst
= build_tree_list (fn
, NULL_TREE
);
17540 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17542 fntype
= TREE_TYPE (fn
);
17543 if (explicit_targs
)
17547 The specified template arguments must match the template
17548 parameters in kind (i.e., type, nontype, template), and there
17549 must not be more arguments than there are parameters;
17550 otherwise type deduction fails.
17552 Nontype arguments must match the types of the corresponding
17553 nontype template parameters, or must be convertible to the
17554 types of the corresponding nontype parameters as specified in
17555 _temp.arg.nontype_, otherwise type deduction fails.
17557 All references in the function type of the function template
17558 to the corresponding template parameters are replaced by the
17559 specified template argument values. If a substitution in a
17560 template parameter or in the function type of the function
17561 template results in an invalid type, type deduction fails. */
17562 int i
, len
= TREE_VEC_LENGTH (tparms
);
17563 location_t loc
= input_location
;
17564 bool incomplete
= false;
17566 /* Adjust any explicit template arguments before entering the
17567 substitution context. */
17569 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17571 /*require_all_args=*/false,
17572 /*use_default_args=*/false));
17573 if (explicit_targs
== error_mark_node
)
17576 /* Substitute the explicit args into the function type. This is
17577 necessary so that, for instance, explicitly declared function
17578 arguments can match null pointed constants. If we were given
17579 an incomplete set of explicit args, we must not do semantic
17580 processing during substitution as we could create partial
17582 for (i
= 0; i
< len
; i
++)
17584 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17585 bool parameter_pack
= false;
17586 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17588 /* Dig out the actual parm. */
17589 if (TREE_CODE (parm
) == TYPE_DECL
17590 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17592 parm
= TREE_TYPE (parm
);
17593 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17595 else if (TREE_CODE (parm
) == PARM_DECL
)
17597 parm
= DECL_INITIAL (parm
);
17598 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17601 if (!parameter_pack
&& targ
== NULL_TREE
)
17602 /* No explicit argument for this template parameter. */
17605 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17607 /* Mark the argument pack as "incomplete". We could
17608 still deduce more arguments during unification.
17609 We remove this mark in type_unification_real. */
17612 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17613 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17614 = ARGUMENT_PACK_ARGS (targ
);
17617 /* We have some incomplete argument packs. */
17622 TREE_VALUE (tinst
) = explicit_targs
;
17623 if (!push_tinst_level (tinst
))
17625 excessive_deduction_depth
= true;
17628 processing_template_decl
+= incomplete
;
17629 input_location
= DECL_SOURCE_LOCATION (fn
);
17630 /* Ignore any access checks; we'll see them again in
17631 instantiate_template and they might have the wrong
17632 access path at this point. */
17633 push_deferring_access_checks (dk_deferred
);
17634 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17635 complain
| tf_partial
, NULL_TREE
);
17636 pop_deferring_access_checks ();
17637 input_location
= loc
;
17638 processing_template_decl
-= incomplete
;
17639 pop_tinst_level ();
17641 if (fntype
== error_mark_node
)
17644 /* Place the explicitly specified arguments in TARGS. */
17645 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17646 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17649 /* Never do unification on the 'this' parameter. */
17650 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17652 if (return_type
&& strict
== DEDUCE_CALL
)
17654 /* We're deducing for a call to the result of a template conversion
17655 function. The parms we really want are in return_type. */
17656 if (POINTER_TYPE_P (return_type
))
17657 return_type
= TREE_TYPE (return_type
);
17658 parms
= TYPE_ARG_TYPES (return_type
);
17660 else if (return_type
)
17664 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17665 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17666 new_args
[0] = return_type
;
17667 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17672 /* We allow incomplete unification without an error message here
17673 because the standard doesn't seem to explicitly prohibit it. Our
17674 callers must be ready to deal with unification failures in any
17677 TREE_VALUE (tinst
) = targs
;
17678 /* If we aren't explaining yet, push tinst context so we can see where
17679 any errors (e.g. from class instantiations triggered by instantiation
17680 of default template arguments) come from. If we are explaining, this
17681 context is redundant. */
17682 if (!explain_p
&& !push_tinst_level (tinst
))
17684 excessive_deduction_depth
= true;
17688 /* type_unification_real will pass back any access checks from default
17689 template argument substitution. */
17690 vec
<deferred_access_check
, va_gc
> *checks
;
17693 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17694 targs
, parms
, args
, nargs
, /*subr=*/0,
17695 strict
, flags
, &checks
, explain_p
);
17697 pop_tinst_level ();
17701 /* Now that we have bindings for all of the template arguments,
17702 ensure that the arguments deduced for the template template
17703 parameters have compatible template parameter lists. We cannot
17704 check this property before we have deduced all template
17705 arguments, because the template parameter types of a template
17706 template parameter might depend on prior template parameters
17707 deduced after the template template parameter. The following
17708 ill-formed example illustrates this issue:
17710 template<typename T, template<T> class C> void f(C<5>, T);
17712 template<int N> struct X {};
17715 f(X<5>(), 5l); // error: template argument deduction fails
17718 The template parameter list of 'C' depends on the template type
17719 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17720 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17721 time that we deduce 'C'. */
17722 if (!template_template_parm_bindings_ok_p
17723 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17725 unify_inconsistent_template_template_parameters (explain_p
);
17729 /* All is well so far. Now, check:
17733 When all template arguments have been deduced, all uses of
17734 template parameters in nondeduced contexts are replaced with
17735 the corresponding deduced argument values. If the
17736 substitution results in an invalid type, as described above,
17737 type deduction fails. */
17738 TREE_VALUE (tinst
) = targs
;
17739 if (!push_tinst_level (tinst
))
17741 excessive_deduction_depth
= true;
17745 /* Also collect access checks from the instantiation. */
17746 reopen_deferring_access_checks (checks
);
17748 decl
= instantiate_template (fn
, targs
, complain
);
17750 checks
= get_deferred_access_checks ();
17751 pop_deferring_access_checks ();
17753 pop_tinst_level ();
17755 if (decl
== error_mark_node
)
17758 /* Now perform any access checks encountered during substitution. */
17759 push_access_scope (decl
);
17760 ok
= perform_access_checks (checks
, complain
);
17761 pop_access_scope (decl
);
17765 /* If we're looking for an exact match, check that what we got
17766 is indeed an exact match. It might not be if some template
17767 parameters are used in non-deduced contexts. But don't check
17768 for an exact match if we have dependent template arguments;
17769 in that case we're doing partial ordering, and we already know
17770 that we have two candidates that will provide the actual type. */
17771 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17773 tree substed
= TREE_TYPE (decl
);
17777 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17779 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17780 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17781 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17783 unify_type_mismatch (explain_p
, args
[i
],
17784 TREE_VALUE (sarg
));
17793 if (excessive_deduction_depth
)
17795 if (deduction_depth
== 0)
17796 /* Reset once we're all the way out. */
17797 excessive_deduction_depth
= false;
17800 /* We can't free this if a pending_template entry or last_error_tinst_level
17801 is pointing at it. */
17802 if (last_pending_template
== old_last_pend
17803 && last_error_tinst_level
== old_error_tinst
)
17809 /* Adjust types before performing type deduction, as described in
17810 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17811 sections are symmetric. PARM is the type of a function parameter
17812 or the return type of the conversion function. ARG is the type of
17813 the argument passed to the call, or the type of the value
17814 initialized with the result of the conversion function.
17815 ARG_EXPR is the original argument expression, which may be null. */
17818 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17831 /* Swap PARM and ARG throughout the remainder of this
17832 function; the handling is precisely symmetric since PARM
17833 will initialize ARG rather than vice versa. */
17834 std::swap (parm
, arg
);
17838 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17839 too, but here handle it by stripping the reference from PARM
17840 rather than by adding it to ARG. */
17841 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17842 && TYPE_REF_IS_RVALUE (*parm
)
17843 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17844 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17845 && TREE_CODE (*arg
) == REFERENCE_TYPE
17846 && !TYPE_REF_IS_RVALUE (*arg
))
17847 *parm
= TREE_TYPE (*parm
);
17848 /* Nothing else to do in this case. */
17852 gcc_unreachable ();
17855 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17857 /* [temp.deduct.call]
17859 If P is not a reference type:
17861 --If A is an array type, the pointer type produced by the
17862 array-to-pointer standard conversion (_conv.array_) is
17863 used in place of A for type deduction; otherwise,
17865 --If A is a function type, the pointer type produced by
17866 the function-to-pointer standard conversion
17867 (_conv.func_) is used in place of A for type deduction;
17870 --If A is a cv-qualified type, the top level
17871 cv-qualifiers of A's type are ignored for type
17873 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17874 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17875 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17876 *arg
= build_pointer_type (*arg
);
17878 *arg
= TYPE_MAIN_VARIANT (*arg
);
17881 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17882 of the form T&&, where T is a template parameter, and the argument
17883 is an lvalue, T is deduced as A& */
17884 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17885 && TYPE_REF_IS_RVALUE (*parm
)
17886 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17887 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17888 && (arg_expr
? real_lvalue_p (arg_expr
)
17889 /* try_one_overload doesn't provide an arg_expr, but
17890 functions are always lvalues. */
17891 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17892 *arg
= build_reference_type (*arg
);
17894 /* [temp.deduct.call]
17896 If P is a cv-qualified type, the top level cv-qualifiers
17897 of P's type are ignored for type deduction. If P is a
17898 reference type, the type referred to by P is used for
17900 *parm
= TYPE_MAIN_VARIANT (*parm
);
17901 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17903 *parm
= TREE_TYPE (*parm
);
17904 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17907 /* DR 322. For conversion deduction, remove a reference type on parm
17908 too (which has been swapped into ARG). */
17909 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17910 *arg
= TREE_TYPE (*arg
);
17915 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17916 template which does contain any deducible template parameters; check if
17917 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17918 unify_one_argument. */
17921 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17922 int flags
, bool explain_p
)
17927 type
= TREE_TYPE (arg
);
17931 if (same_type_p (parm
, type
))
17932 return unify_success (explain_p
);
17934 if (strict
== DEDUCE_CONV
)
17936 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17937 explain_p
? tf_warning_or_error
: tf_none
))
17938 return unify_success (explain_p
);
17940 else if (strict
!= DEDUCE_EXACT
)
17942 if (can_convert_arg (parm
, type
,
17943 TYPE_P (arg
) ? NULL_TREE
: arg
,
17944 flags
, explain_p
? tf_warning_or_error
: tf_none
))
17945 return unify_success (explain_p
);
17948 if (strict
== DEDUCE_EXACT
)
17949 return unify_type_mismatch (explain_p
, parm
, arg
);
17951 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
17954 static bool uses_deducible_template_parms (tree type
);
17956 /* Returns true iff the expression EXPR is one from which a template
17957 argument can be deduced. In other words, if it's an undecorated
17958 use of a template non-type parameter. */
17961 deducible_expression (tree expr
)
17963 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
17966 /* Returns true iff the array domain DOMAIN uses a template parameter in a
17967 deducible way; that is, if it has a max value of <PARM> - 1. */
17970 deducible_array_bound (tree domain
)
17972 if (domain
== NULL_TREE
)
17975 tree max
= TYPE_MAX_VALUE (domain
);
17976 if (TREE_CODE (max
) != MINUS_EXPR
)
17979 return deducible_expression (TREE_OPERAND (max
, 0));
17982 /* Returns true iff the template arguments ARGS use a template parameter
17983 in a deducible way. */
17986 deducible_template_args (tree args
)
17988 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
17991 tree elt
= TREE_VEC_ELT (args
, i
);
17992 if (ARGUMENT_PACK_P (elt
))
17993 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
17996 if (PACK_EXPANSION_P (elt
))
17997 elt
= PACK_EXPANSION_PATTERN (elt
);
17998 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
18000 else if (TYPE_P (elt
))
18001 deducible
= uses_deducible_template_parms (elt
);
18003 deducible
= deducible_expression (elt
);
18011 /* Returns true iff TYPE contains any deducible references to template
18012 parameters, as per 14.8.2.5. */
18015 uses_deducible_template_parms (tree type
)
18017 if (PACK_EXPANSION_P (type
))
18018 type
= PACK_EXPANSION_PATTERN (type
);
18025 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
18026 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18032 if (POINTER_TYPE_P (type
))
18033 return uses_deducible_template_parms (TREE_TYPE (type
));
18035 /* T[integer-constant ]
18037 if (TREE_CODE (type
) == ARRAY_TYPE
)
18038 return (uses_deducible_template_parms (TREE_TYPE (type
))
18039 || deducible_array_bound (TYPE_DOMAIN (type
)));
18051 if (TYPE_PTRMEM_P (type
))
18052 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
18053 || (uses_deducible_template_parms
18054 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
18056 /* template-name <T> (where template-name refers to a class template)
18057 template-name <i> (where template-name refers to a class template) */
18058 if (CLASS_TYPE_P (type
)
18059 && CLASSTYPE_TEMPLATE_INFO (type
)
18060 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
18061 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
18062 (CLASSTYPE_TI_ARGS (type
)));
18067 if (TREE_CODE (type
) == FUNCTION_TYPE
18068 || TREE_CODE (type
) == METHOD_TYPE
)
18070 if (uses_deducible_template_parms (TREE_TYPE (type
)))
18072 tree parm
= TYPE_ARG_TYPES (type
);
18073 if (TREE_CODE (type
) == METHOD_TYPE
)
18074 parm
= TREE_CHAIN (parm
);
18075 for (; parm
; parm
= TREE_CHAIN (parm
))
18076 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
18083 /* Subroutine of type_unification_real and unify_pack_expansion to
18084 handle unification of a single P/A pair. Parameters are as
18085 for those functions. */
18088 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
18089 int subr
, unification_kind_t strict
,
18092 tree arg_expr
= NULL_TREE
;
18095 if (arg
== error_mark_node
|| parm
== error_mark_node
)
18096 return unify_invalid (explain_p
);
18097 if (arg
== unknown_type_node
)
18098 /* We can't deduce anything from this, but we might get all the
18099 template args from other function args. */
18100 return unify_success (explain_p
);
18102 /* Implicit conversions (Clause 4) will be performed on a function
18103 argument to convert it to the type of the corresponding function
18104 parameter if the parameter type contains no template-parameters that
18105 participate in template argument deduction. */
18106 if (strict
!= DEDUCE_EXACT
18107 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
18108 /* For function parameters with no deducible template parameters,
18109 just return. We'll check non-dependent conversions later. */
18110 return unify_success (explain_p
);
18115 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
18116 | UNIFY_ALLOW_MORE_CV_QUAL
18117 | UNIFY_ALLOW_DERIVED
);
18121 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
18125 arg_strict
= UNIFY_ALLOW_NONE
;
18129 gcc_unreachable ();
18132 /* We only do these transformations if this is the top-level
18133 parameter_type_list in a call or declaration matching; in other
18134 situations (nested function declarators, template argument lists) we
18135 won't be comparing a type to an expression, and we don't do any type
18141 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
18142 if (type_unknown_p (arg
))
18144 /* [temp.deduct.type] A template-argument can be
18145 deduced from a pointer to function or pointer
18146 to member function argument if the set of
18147 overloaded functions does not contain function
18148 templates and at most one of a set of
18149 overloaded functions provides a unique
18152 if (resolve_overloaded_unification
18153 (tparms
, targs
, parm
, arg
, strict
,
18154 arg_strict
, explain_p
))
18155 return unify_success (explain_p
);
18156 return unify_overload_resolution_failure (explain_p
, arg
);
18160 arg
= unlowered_expr_type (arg
);
18161 if (arg
== error_mark_node
)
18162 return unify_invalid (explain_p
);
18166 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
18169 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
18170 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
18171 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18173 /* For deduction from an init-list we need the actual list. */
18174 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
18176 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
18179 /* Most parms like fn_type_unification.
18181 If SUBR is 1, we're being called recursively (to unify the
18182 arguments of a function or method parameter of a function
18185 CHECKS is a pointer to a vector of access checks encountered while
18186 substituting default template arguments. */
18189 type_unification_real (tree tparms
,
18193 unsigned int xnargs
,
18195 unification_kind_t strict
,
18197 vec
<deferred_access_check
, va_gc
> **checks
,
18202 int ntparms
= TREE_VEC_LENGTH (tparms
);
18203 int saw_undeduced
= 0;
18206 unsigned int nargs
;
18209 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
18210 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
18211 gcc_assert (ntparms
> 0);
18213 /* Reset the number of non-defaulted template arguments contained
18215 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
18223 while (parms
&& parms
!= void_list_node
18226 parm
= TREE_VALUE (parms
);
18228 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18229 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
18230 /* For a function parameter pack that occurs at the end of the
18231 parameter-declaration-list, the type A of each remaining
18232 argument of the call is compared with the type P of the
18233 declarator-id of the function parameter pack. */
18236 parms
= TREE_CHAIN (parms
);
18238 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18239 /* For a function parameter pack that does not occur at the
18240 end of the parameter-declaration-list, the type of the
18241 parameter pack is a non-deduced context. */
18247 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18253 && parms
!= void_list_node
18254 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18256 /* Unify the remaining arguments with the pack expansion type. */
18258 tree parmvec
= make_tree_vec (1);
18260 /* Allocate a TREE_VEC and copy in all of the arguments */
18261 argvec
= make_tree_vec (nargs
- ia
);
18262 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18263 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18265 /* Copy the parameter into parmvec. */
18266 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18267 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18268 /*subr=*/subr
, explain_p
))
18271 /* Advance to the end of the list of parameters. */
18272 parms
= TREE_CHAIN (parms
);
18275 /* Fail if we've reached the end of the parm list, and more args
18276 are present, and the parm list isn't variadic. */
18277 if (ia
< nargs
&& parms
== void_list_node
)
18278 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18279 /* Fail if parms are left and they don't have default values and
18280 they aren't all deduced as empty packs (c++/57397). This is
18281 consistent with sufficient_parms_p. */
18282 if (parms
&& parms
!= void_list_node
18283 && TREE_PURPOSE (parms
) == NULL_TREE
)
18285 unsigned int count
= nargs
;
18290 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18293 p
= TREE_CHAIN (p
);
18295 while (p
&& p
!= void_list_node
);
18296 if (count
!= nargs
)
18297 return unify_too_few_arguments (explain_p
, ia
, count
,
18303 tsubst_flags_t complain
= (explain_p
18304 ? tf_warning_or_error
18307 for (i
= 0; i
< ntparms
; i
++)
18309 tree targ
= TREE_VEC_ELT (targs
, i
);
18310 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18312 /* Clear the "incomplete" flags on all argument packs now so that
18313 substituting them into later default arguments works. */
18314 if (targ
&& ARGUMENT_PACK_P (targ
))
18316 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18317 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18320 if (targ
|| tparm
== error_mark_node
)
18322 tparm
= TREE_VALUE (tparm
);
18324 /* If this is an undeduced nontype parameter that depends on
18325 a type parameter, try another pass; its type may have been
18326 deduced from a later argument than the one from which
18327 this parameter can be deduced. */
18328 if (TREE_CODE (tparm
) == PARM_DECL
18329 && uses_template_parms (TREE_TYPE (tparm
))
18330 && saw_undeduced
< 2)
18336 /* Core issue #226 (C++0x) [temp.deduct]:
18338 If a template argument has not been deduced, its
18339 default template argument, if any, is used.
18341 When we are in C++98 mode, TREE_PURPOSE will either
18342 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18343 to explicitly check cxx_dialect here. */
18344 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18345 /* OK, there is a default argument. Wait until after the
18346 conversion check to do substitution. */
18349 /* If the type parameter is a parameter pack, then it will
18350 be deduced to an empty parameter pack. */
18351 if (template_parameter_pack_p (tparm
))
18355 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18357 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18358 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18359 TREE_CONSTANT (arg
) = 1;
18362 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18364 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18366 TREE_VEC_ELT (targs
, i
) = arg
;
18370 return unify_parameter_deduction_failure (explain_p
, tparm
);
18373 /* DR 1391: All parameters have args, now check non-dependent parms for
18375 if (saw_undeduced
< 2)
18376 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18377 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18379 parm
= TREE_VALUE (parms
);
18381 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18382 && (!TREE_CHAIN (parms
)
18383 || TREE_CHAIN (parms
) == void_list_node
))
18384 /* For a function parameter pack that occurs at the end of the
18385 parameter-declaration-list, the type A of each remaining
18386 argument of the call is compared with the type P of the
18387 declarator-id of the function parameter pack. */
18390 parms
= TREE_CHAIN (parms
);
18392 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18393 /* For a function parameter pack that does not occur at the
18394 end of the parameter-declaration-list, the type of the
18395 parameter pack is a non-deduced context. */
18401 if (uses_template_parms (parm
))
18403 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18408 /* Now substitute into the default template arguments. */
18409 for (i
= 0; i
< ntparms
; i
++)
18411 tree targ
= TREE_VEC_ELT (targs
, i
);
18412 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18414 if (targ
|| tparm
== error_mark_node
)
18416 tree parm
= TREE_VALUE (tparm
);
18418 if (TREE_CODE (parm
) == PARM_DECL
18419 && uses_template_parms (TREE_TYPE (parm
))
18420 && saw_undeduced
< 2)
18423 tree arg
= TREE_PURPOSE (tparm
);
18424 reopen_deferring_access_checks (*checks
);
18425 location_t save_loc
= input_location
;
18427 input_location
= DECL_SOURCE_LOCATION (parm
);
18428 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18429 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18431 input_location
= save_loc
;
18432 *checks
= get_deferred_access_checks ();
18433 pop_deferring_access_checks ();
18434 if (arg
== error_mark_node
)
18438 TREE_VEC_ELT (targs
, i
) = arg
;
18439 /* The position of the first default template argument,
18440 is also the number of non-defaulted arguments in TARGS.
18442 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18443 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18448 if (saw_undeduced
++ == 1)
18452 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18453 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18455 return unify_success (explain_p
);
18458 /* Subroutine of type_unification_real. Args are like the variables
18459 at the call site. ARG is an overloaded function (or template-id);
18460 we try deducing template args from each of the overloads, and if
18461 only one succeeds, we go with that. Modifies TARGS and returns
18462 true on success. */
18465 resolve_overloaded_unification (tree tparms
,
18469 unification_kind_t strict
,
18473 tree tempargs
= copy_node (targs
);
18475 tree goodfn
= NULL_TREE
;
18478 if (TREE_CODE (arg
) == ADDR_EXPR
)
18480 arg
= TREE_OPERAND (arg
, 0);
18486 if (TREE_CODE (arg
) == COMPONENT_REF
)
18487 /* Handle `&x' where `x' is some static or non-static member
18489 arg
= TREE_OPERAND (arg
, 1);
18491 if (TREE_CODE (arg
) == OFFSET_REF
)
18492 arg
= TREE_OPERAND (arg
, 1);
18494 /* Strip baselink information. */
18495 if (BASELINK_P (arg
))
18496 arg
= BASELINK_FUNCTIONS (arg
);
18498 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18500 /* If we got some explicit template args, we need to plug them into
18501 the affected templates before we try to unify, in case the
18502 explicit args will completely resolve the templates in question. */
18505 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18506 arg
= TREE_OPERAND (arg
, 0);
18508 for (; arg
; arg
= OVL_NEXT (arg
))
18510 tree fn
= OVL_CURRENT (arg
);
18511 tree subargs
, elem
;
18513 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18516 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18517 expl_subargs
, NULL_TREE
, tf_none
,
18518 /*require_all_args=*/true,
18519 /*use_default_args=*/true);
18520 if (subargs
!= error_mark_node
18521 && !any_dependent_template_arguments_p (subargs
))
18523 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18524 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18525 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18526 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18535 /* If no templates (or more than one) are fully resolved by the
18536 explicit arguments, this template-id is a non-deduced context; it
18537 could still be OK if we deduce all template arguments for the
18538 enclosing call through other arguments. */
18542 else if (TREE_CODE (arg
) != OVERLOAD
18543 && TREE_CODE (arg
) != FUNCTION_DECL
)
18544 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18545 -- but the deduction does not succeed because the expression is
18546 not just the function on its own. */
18549 for (; arg
; arg
= OVL_NEXT (arg
))
18550 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18551 TREE_TYPE (OVL_CURRENT (arg
)),
18552 strict
, sub_strict
, addr_p
, explain_p
)
18553 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18555 goodfn
= OVL_CURRENT (arg
);
18559 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18560 to function or pointer to member function argument if the set of
18561 overloaded functions does not contain function templates and at most
18562 one of a set of overloaded functions provides a unique match.
18564 So if we found multiple possibilities, we return success but don't
18565 deduce anything. */
18569 int i
= TREE_VEC_LENGTH (targs
);
18571 if (TREE_VEC_ELT (tempargs
, i
))
18573 tree old
= TREE_VEC_ELT (targs
, i
);
18574 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18575 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18576 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18577 /* Don't forget explicit template arguments in a pack. */
18578 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18579 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18580 TREE_VEC_ELT (targs
, i
) = new_
;
18589 /* Core DR 115: In contexts where deduction is done and fails, or in
18590 contexts where deduction is not done, if a template argument list is
18591 specified and it, along with any default template arguments, identifies
18592 a single function template specialization, then the template-id is an
18593 lvalue for the function template specialization. */
18596 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
18598 tree expr
, offset
, baselink
;
18601 if (!type_unknown_p (orig_expr
))
18606 offset
= NULL_TREE
;
18607 baselink
= NULL_TREE
;
18609 if (TREE_CODE (expr
) == ADDR_EXPR
)
18611 expr
= TREE_OPERAND (expr
, 0);
18614 if (TREE_CODE (expr
) == OFFSET_REF
)
18617 expr
= TREE_OPERAND (expr
, 1);
18619 if (BASELINK_P (expr
))
18622 expr
= BASELINK_FUNCTIONS (expr
);
18625 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18628 tree goodfn
= NULL_TREE
;
18630 /* If we got some explicit template args, we need to plug them into
18631 the affected templates before we try to unify, in case the
18632 explicit args will completely resolve the templates in question. */
18634 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18635 tree arg
= TREE_OPERAND (expr
, 0);
18636 tree badfn
= NULL_TREE
;
18637 tree badargs
= NULL_TREE
;
18639 for (; arg
; arg
= OVL_NEXT (arg
))
18641 tree fn
= OVL_CURRENT (arg
);
18642 tree subargs
, elem
;
18644 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18647 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18648 expl_subargs
, NULL_TREE
, tf_none
,
18649 /*require_all_args=*/true,
18650 /*use_default_args=*/true);
18651 if (subargs
!= error_mark_node
18652 && !any_dependent_template_arguments_p (subargs
))
18654 elem
= instantiate_template (fn
, subargs
, tf_none
);
18655 if (elem
== error_mark_node
)
18660 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18669 mark_used (goodfn
);
18672 expr
= build_baselink (BASELINK_BINFO (baselink
),
18673 BASELINK_ACCESS_BINFO (baselink
),
18674 expr
, BASELINK_OPTYPE (baselink
));
18678 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18679 expr
= build_offset_ref (base
, expr
, addr
, complain
);
18682 expr
= cp_build_addr_expr (expr
, complain
);
18685 else if (good
== 0 && badargs
&& (complain
& tf_error
))
18686 /* There were no good options and at least one bad one, so let the
18687 user know what the problem is. */
18688 instantiate_template (badfn
, badargs
, complain
);
18693 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18694 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18695 different overloads deduce different arguments for a given parm.
18696 ADDR_P is true if the expression for which deduction is being
18697 performed was of the form "& fn" rather than simply "fn".
18699 Returns 1 on success. */
18702 try_one_overload (tree tparms
,
18707 unification_kind_t strict
,
18716 if (arg
== error_mark_node
)
18719 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18720 to function or pointer to member function argument if the set of
18721 overloaded functions does not contain function templates and at most
18722 one of a set of overloaded functions provides a unique match.
18724 So if this is a template, just return success. */
18726 if (uses_template_parms (arg
))
18729 if (TREE_CODE (arg
) == METHOD_TYPE
)
18730 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18732 arg
= build_pointer_type (arg
);
18734 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18736 /* We don't copy orig_targs for this because if we have already deduced
18737 some template args from previous args, unify would complain when we
18738 try to deduce a template parameter for the same argument, even though
18739 there isn't really a conflict. */
18740 nargs
= TREE_VEC_LENGTH (targs
);
18741 tempargs
= make_tree_vec (nargs
);
18743 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18746 /* First make sure we didn't deduce anything that conflicts with
18747 explicitly specified args. */
18748 for (i
= nargs
; i
--; )
18750 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18751 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18755 else if (uses_template_parms (elt
))
18756 /* Since we're unifying against ourselves, we will fill in
18757 template args used in the function parm list with our own
18758 template parms. Discard them. */
18759 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18760 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
18762 /* Check that the argument at each index of the deduced argument pack
18763 is equivalent to the corresponding explicitly specified argument.
18764 We may have deduced more arguments than were explicitly specified,
18766 gcc_assert (ARGUMENT_PACK_INCOMPLETE_P (oldelt
));
18767 gcc_assert (ARGUMENT_PACK_ARGS (oldelt
)
18768 == ARGUMENT_PACK_EXPLICIT_ARGS (oldelt
));
18770 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
18771 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
18773 if (TREE_VEC_LENGTH (deduced_pack
)
18774 < TREE_VEC_LENGTH (explicit_pack
))
18777 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
18778 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
18779 TREE_VEC_ELT (deduced_pack
, j
)))
18782 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18786 for (i
= nargs
; i
--; )
18788 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18791 TREE_VEC_ELT (targs
, i
) = elt
;
18797 /* PARM is a template class (perhaps with unbound template
18798 parameters). ARG is a fully instantiated type. If ARG can be
18799 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18800 TARGS are as for unify. */
18803 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18806 tree copy_of_targs
;
18808 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18809 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18810 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18813 /* We need to make a new template argument vector for the call to
18814 unify. If we used TARGS, we'd clutter it up with the result of
18815 the attempted unification, even if this class didn't work out.
18816 We also don't want to commit ourselves to all the unifications
18817 we've already done, since unification is supposed to be done on
18818 an argument-by-argument basis. In other words, consider the
18819 following pathological case:
18821 template <int I, int J, int K>
18824 template <int I, int J>
18825 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18827 template <int I, int J, int K>
18828 void f(S<I, J, K>, S<I, I, I>);
18837 Now, by the time we consider the unification involving `s2', we
18838 already know that we must have `f<0, 0, 0>'. But, even though
18839 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18840 because there are two ways to unify base classes of S<0, 1, 2>
18841 with S<I, I, I>. If we kept the already deduced knowledge, we
18842 would reject the possibility I=1. */
18843 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18845 /* If unification failed, we're done. */
18846 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18847 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18853 /* Given a template type PARM and a class type ARG, find the unique
18854 base type in ARG that is an instance of PARM. We do not examine
18855 ARG itself; only its base-classes. If there is not exactly one
18856 appropriate base class, return NULL_TREE. PARM may be the type of
18857 a partial specialization, as well as a plain template type. Used
18860 static enum template_base_result
18861 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18862 bool explain_p
, tree
*result
)
18864 tree rval
= NULL_TREE
;
18867 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18869 binfo
= TYPE_BINFO (complete_type (arg
));
18872 /* The type could not be completed. */
18873 *result
= NULL_TREE
;
18874 return tbr_incomplete_type
;
18877 /* Walk in inheritance graph order. The search order is not
18878 important, and this avoids multiple walks of virtual bases. */
18879 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18881 tree r
= try_class_unification (tparms
, targs
, parm
,
18882 BINFO_TYPE (binfo
), explain_p
);
18886 /* If there is more than one satisfactory baseclass, then:
18890 If they yield more than one possible deduced A, the type
18894 if (rval
&& !same_type_p (r
, rval
))
18896 *result
= NULL_TREE
;
18897 return tbr_ambiguous_baseclass
;
18905 return tbr_success
;
18908 /* Returns the level of DECL, which declares a template parameter. */
18911 template_decl_level (tree decl
)
18913 switch (TREE_CODE (decl
))
18916 case TEMPLATE_DECL
:
18917 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18920 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18923 gcc_unreachable ();
18928 /* Decide whether ARG can be unified with PARM, considering only the
18929 cv-qualifiers of each type, given STRICT as documented for unify.
18930 Returns nonzero iff the unification is OK on that basis. */
18933 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18935 int arg_quals
= cp_type_quals (arg
);
18936 int parm_quals
= cp_type_quals (parm
);
18938 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18939 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18941 /* Although a CVR qualifier is ignored when being applied to a
18942 substituted template parameter ([8.3.2]/1 for example), that
18943 does not allow us to unify "const T" with "int&" because both
18944 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
18945 It is ok when we're allowing additional CV qualifiers
18946 at the outer level [14.8.2.1]/3,1st bullet. */
18947 if ((TREE_CODE (arg
) == REFERENCE_TYPE
18948 || TREE_CODE (arg
) == FUNCTION_TYPE
18949 || TREE_CODE (arg
) == METHOD_TYPE
)
18950 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
18953 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
18954 && (parm_quals
& TYPE_QUAL_RESTRICT
))
18958 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
18959 && (arg_quals
& parm_quals
) != parm_quals
)
18962 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
18963 && (parm_quals
& arg_quals
) != arg_quals
)
18969 /* Determines the LEVEL and INDEX for the template parameter PARM. */
18971 template_parm_level_and_index (tree parm
, int* level
, int* index
)
18973 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18974 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18975 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18977 *index
= TEMPLATE_TYPE_IDX (parm
);
18978 *level
= TEMPLATE_TYPE_LEVEL (parm
);
18982 *index
= TEMPLATE_PARM_IDX (parm
);
18983 *level
= TEMPLATE_PARM_LEVEL (parm
);
18987 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
18989 if (unify (TP, TA, P, A, S, EP)) \
18993 /* Unifies the remaining arguments in PACKED_ARGS with the pack
18994 expansion at the end of PACKED_PARMS. Returns 0 if the type
18995 deduction succeeds, 1 otherwise. STRICT is the same as in
18996 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
18997 call argument list. We'll need to adjust the arguments to make them
18998 types. SUBR tells us if this is from a recursive call to
18999 type_unification_real, or for comparing two template argument
19003 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
19004 tree packed_args
, unification_kind_t strict
,
19005 bool subr
, bool explain_p
)
19008 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
19009 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
19010 tree pack
, packs
= NULL_TREE
;
19011 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
19013 packed_args
= expand_template_argument_pack (packed_args
);
19015 int len
= TREE_VEC_LENGTH (packed_args
);
19017 /* Determine the parameter packs we will be deducing from the
19018 pattern, and record their current deductions. */
19019 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
19020 pack
; pack
= TREE_CHAIN (pack
))
19022 tree parm_pack
= TREE_VALUE (pack
);
19025 /* Determine the index and level of this parameter pack. */
19026 template_parm_level_and_index (parm_pack
, &level
, &idx
);
19028 /* Keep track of the parameter packs and their corresponding
19030 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
19031 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
19034 /* Loop through all of the arguments that have not yet been
19035 unified and unify each with the pattern. */
19036 for (i
= start
; i
< len
; i
++)
19039 bool any_explicit
= false;
19040 tree arg
= TREE_VEC_ELT (packed_args
, i
);
19042 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
19043 or the element of its argument pack at the current index if
19044 this argument was explicitly specified. */
19045 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19049 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19052 if (TREE_VALUE (pack
)
19053 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
19054 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
19056 any_explicit
= true;
19057 arg
= TREE_VEC_ELT (pargs
, i
- start
);
19059 TMPL_ARG (targs
, level
, idx
) = arg
;
19062 /* If we had explicit template arguments, substitute them into the
19063 pattern before deduction. */
19066 /* Some arguments might still be unspecified or dependent. */
19068 ++processing_template_decl
;
19069 dependent
= any_dependent_template_arguments_p (targs
);
19071 --processing_template_decl
;
19072 parm
= tsubst (pattern
, targs
,
19073 explain_p
? tf_warning_or_error
: tf_none
,
19076 --processing_template_decl
;
19077 if (parm
== error_mark_node
)
19083 /* Unify the pattern with the current argument. */
19084 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
19088 /* For each parameter pack, collect the deduced value. */
19089 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19092 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19094 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
19095 TMPL_ARG (targs
, level
, idx
);
19099 /* Verify that the results of unification with the parameter packs
19100 produce results consistent with what we've seen before, and make
19101 the deduced argument packs available. */
19102 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19104 tree old_pack
= TREE_VALUE (pack
);
19105 tree new_args
= TREE_TYPE (pack
);
19106 int i
, len
= TREE_VEC_LENGTH (new_args
);
19108 bool nondeduced_p
= false;
19110 /* By default keep the original deduced argument pack.
19111 If necessary, more specific code is going to update the
19112 resulting deduced argument later down in this function. */
19113 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19114 TMPL_ARG (targs
, level
, idx
) = old_pack
;
19116 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
19117 actually deduce anything. */
19118 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
19119 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
19120 nondeduced_p
= true;
19124 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
19126 /* If we had fewer function args than explicit template args,
19127 just use the explicits. */
19128 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19129 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
19130 if (len
< explicit_len
)
19131 new_args
= explicit_args
;
19137 /* Build the deduced *_ARGUMENT_PACK. */
19138 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
19140 result
= make_node (NONTYPE_ARGUMENT_PACK
);
19141 TREE_TYPE (result
) =
19142 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
19143 TREE_CONSTANT (result
) = 1;
19146 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
19148 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
19150 /* Note the deduced argument packs for this parameter
19152 TMPL_ARG (targs
, level
, idx
) = result
;
19154 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
19155 && (ARGUMENT_PACK_ARGS (old_pack
)
19156 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
19158 /* We only had the explicitly-provided arguments before, but
19159 now we have a complete set of arguments. */
19160 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19162 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
19163 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
19164 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
19168 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
19169 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
19171 if (!comp_template_args (old_args
, new_args
,
19172 &bad_old_arg
, &bad_new_arg
))
19173 /* Inconsistent unification of this parameter pack. */
19174 return unify_parameter_pack_inconsistent (explain_p
,
19180 return unify_success (explain_p
);
19183 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
19184 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
19185 parameters and return value are as for unify. */
19188 unify_array_domain (tree tparms
, tree targs
,
19189 tree parm_dom
, tree arg_dom
,
19197 /* Our representation of array types uses "N - 1" as the
19198 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
19199 not an integer constant. We cannot unify arbitrarily
19200 complex expressions, so we eliminate the MINUS_EXPRs
19202 parm_max
= TYPE_MAX_VALUE (parm_dom
);
19203 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
19206 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
19207 parm_max
= TREE_OPERAND (parm_max
, 0);
19209 arg_max
= TYPE_MAX_VALUE (arg_dom
);
19210 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
19213 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
19214 trying to unify the type of a variable with the type
19215 of a template parameter. For example:
19217 template <unsigned int N>
19218 void f (char (&) [N]);
19225 Here, the type of the ARG will be "int [g(i)]", and
19226 may be a SAVE_EXPR, etc. */
19227 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
19228 return unify_vla_arg (explain_p
, arg_dom
);
19229 arg_max
= TREE_OPERAND (arg_max
, 0);
19232 /* If only one of the bounds used a MINUS_EXPR, compensate
19233 by adding one to the other bound. */
19234 if (parm_cst
&& !arg_cst
)
19235 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19239 else if (arg_cst
&& !parm_cst
)
19240 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19245 return unify (tparms
, targs
, parm_max
, arg_max
,
19246 UNIFY_ALLOW_INTEGER
, explain_p
);
19249 /* Deduce the value of template parameters. TPARMS is the (innermost)
19250 set of template parameters to a template. TARGS is the bindings
19251 for those template parameters, as determined thus far; TARGS may
19252 include template arguments for outer levels of template parameters
19253 as well. PARM is a parameter to a template function, or a
19254 subcomponent of that parameter; ARG is the corresponding argument.
19255 This function attempts to match PARM with ARG in a manner
19256 consistent with the existing assignments in TARGS. If more values
19257 are deduced, then TARGS is updated.
19259 Returns 0 if the type deduction succeeds, 1 otherwise. The
19260 parameter STRICT is a bitwise or of the following flags:
19263 Require an exact match between PARM and ARG.
19264 UNIFY_ALLOW_MORE_CV_QUAL:
19265 Allow the deduced ARG to be more cv-qualified (by qualification
19266 conversion) than ARG.
19267 UNIFY_ALLOW_LESS_CV_QUAL:
19268 Allow the deduced ARG to be less cv-qualified than ARG.
19269 UNIFY_ALLOW_DERIVED:
19270 Allow the deduced ARG to be a template base class of ARG,
19271 or a pointer to a template base class of the type pointed to by
19273 UNIFY_ALLOW_INTEGER:
19274 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19275 case for more information.
19276 UNIFY_ALLOW_OUTER_LEVEL:
19277 This is the outermost level of a deduction. Used to determine validity
19278 of qualification conversions. A valid qualification conversion must
19279 have const qualified pointers leading up to the inner type which
19280 requires additional CV quals, except at the outer level, where const
19281 is not required [conv.qual]. It would be normal to set this flag in
19282 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19283 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19284 This is the outermost level of a deduction, and PARM can be more CV
19285 qualified at this point.
19286 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19287 This is the outermost level of a deduction, and PARM can be less CV
19288 qualified at this point. */
19291 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19297 int strict_in
= strict
;
19299 /* I don't think this will do the right thing with respect to types.
19300 But the only case I've seen it in so far has been array bounds, where
19301 signedness is the only information lost, and I think that will be
19303 while (TREE_CODE (parm
) == NOP_EXPR
)
19304 parm
= TREE_OPERAND (parm
, 0);
19306 if (arg
== error_mark_node
)
19307 return unify_invalid (explain_p
);
19308 if (arg
== unknown_type_node
19309 || arg
== init_list_type_node
)
19310 /* We can't deduce anything from this, but we might get all the
19311 template args from other function args. */
19312 return unify_success (explain_p
);
19314 /* If PARM uses template parameters, then we can't bail out here,
19315 even if ARG == PARM, since we won't record unifications for the
19316 template parameters. We might need them if we're trying to
19317 figure out which of two things is more specialized. */
19318 if (arg
== parm
&& !uses_template_parms (parm
))
19319 return unify_success (explain_p
);
19321 /* Handle init lists early, so the rest of the function can assume
19322 we're dealing with a type. */
19323 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19327 tree orig_parm
= parm
;
19329 /* Replace T with std::initializer_list<T> for deduction. */
19330 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19331 && flag_deduce_init_list
)
19332 parm
= listify (parm
);
19334 if (!is_std_init_list (parm
)
19335 && TREE_CODE (parm
) != ARRAY_TYPE
)
19336 /* We can only deduce from an initializer list argument if the
19337 parameter is std::initializer_list or an array; otherwise this
19338 is a non-deduced context. */
19339 return unify_success (explain_p
);
19341 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19342 elttype
= TREE_TYPE (parm
);
19345 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19346 /* Deduction is defined in terms of a single type, so just punt
19347 on the (bizarre) std::initializer_list<T...>. */
19348 if (PACK_EXPANSION_P (elttype
))
19349 return unify_success (explain_p
);
19352 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19354 int elt_strict
= strict
;
19356 if (elt
== error_mark_node
)
19357 return unify_invalid (explain_p
);
19359 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19361 tree type
= TREE_TYPE (elt
);
19362 if (type
== error_mark_node
)
19363 return unify_invalid (explain_p
);
19364 /* It should only be possible to get here for a call. */
19365 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19366 elt_strict
|= maybe_adjust_types_for_deduction
19367 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19371 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19375 if (TREE_CODE (parm
) == ARRAY_TYPE
19376 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19378 /* Also deduce from the length of the initializer list. */
19379 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19380 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19381 if (idx
== error_mark_node
)
19382 return unify_invalid (explain_p
);
19383 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19387 /* If the std::initializer_list<T> deduction worked, replace the
19388 deduced A with std::initializer_list<A>. */
19389 if (orig_parm
!= parm
)
19391 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19392 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19393 targ
= listify (targ
);
19394 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19396 return unify_success (explain_p
);
19399 /* Immediately reject some pairs that won't unify because of
19400 cv-qualification mismatches. */
19401 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19403 /* It is the elements of the array which hold the cv quals of an array
19404 type, and the elements might be template type parms. We'll check
19405 when we recurse. */
19406 && TREE_CODE (arg
) != ARRAY_TYPE
19407 /* We check the cv-qualifiers when unifying with template type
19408 parameters below. We want to allow ARG `const T' to unify with
19409 PARM `T' for example, when computing which of two templates
19410 is more specialized, for example. */
19411 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19412 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19413 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19415 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19416 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19417 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19418 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19419 strict
&= ~UNIFY_ALLOW_DERIVED
;
19420 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19421 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19423 switch (TREE_CODE (parm
))
19425 case TYPENAME_TYPE
:
19427 case UNBOUND_CLASS_TEMPLATE
:
19428 /* In a type which contains a nested-name-specifier, template
19429 argument values cannot be deduced for template parameters used
19430 within the nested-name-specifier. */
19431 return unify_success (explain_p
);
19433 case TEMPLATE_TYPE_PARM
:
19434 case TEMPLATE_TEMPLATE_PARM
:
19435 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19436 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19437 if (error_operand_p (tparm
))
19438 return unify_invalid (explain_p
);
19440 if (TEMPLATE_TYPE_LEVEL (parm
)
19441 != template_decl_level (tparm
))
19442 /* The PARM is not one we're trying to unify. Just check
19443 to see if it matches ARG. */
19445 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19446 && (is_auto (parm
) ? is_auto (arg
)
19447 : same_type_p (parm
, arg
)))
19448 return unify_success (explain_p
);
19450 return unify_type_mismatch (explain_p
, parm
, arg
);
19452 idx
= TEMPLATE_TYPE_IDX (parm
);
19453 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19454 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19455 if (error_operand_p (tparm
))
19456 return unify_invalid (explain_p
);
19458 /* Check for mixed types and values. */
19459 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19460 && TREE_CODE (tparm
) != TYPE_DECL
)
19461 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19462 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19463 gcc_unreachable ();
19465 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19467 /* ARG must be constructed from a template class or a template
19468 template parameter. */
19469 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19470 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19471 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19473 tree parmvec
= TYPE_TI_ARGS (parm
);
19474 /* An alias template name is never deduced. */
19475 if (TYPE_ALIAS_P (arg
))
19476 arg
= strip_typedefs (arg
);
19477 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19478 tree full_argvec
= add_to_template_args (targs
, argvec
);
19480 = DECL_INNERMOST_TEMPLATE_PARMS
19481 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19483 int parm_variadic_p
= 0;
19485 /* The resolution to DR150 makes clear that default
19486 arguments for an N-argument may not be used to bind T
19487 to a template template parameter with fewer than N
19488 parameters. It is not safe to permit the binding of
19489 default arguments as an extension, as that may change
19490 the meaning of a conforming program. Consider:
19492 struct Dense { static const unsigned int dim = 1; };
19494 template <template <typename> class View,
19496 void operator+(float, View<Block> const&);
19498 template <typename Block,
19499 unsigned int Dim = Block::dim>
19500 struct Lvalue_proxy { operator float() const; };
19504 Lvalue_proxy<Dense> p;
19509 Here, if Lvalue_proxy is permitted to bind to View, then
19510 the global operator+ will be used; if they are not, the
19511 Lvalue_proxy will be converted to float. */
19512 if (coerce_template_parms (parm_parms
,
19514 TYPE_TI_TEMPLATE (parm
),
19516 ? tf_warning_or_error
19518 /*require_all_args=*/true,
19519 /*use_default_args=*/false)
19520 == error_mark_node
)
19523 /* Deduce arguments T, i from TT<T> or TT<i>.
19524 We check each element of PARMVEC and ARGVEC individually
19525 rather than the whole TREE_VEC since they can have
19526 different number of elements. */
19528 parmvec
= expand_template_argument_pack (parmvec
);
19529 argvec
= expand_template_argument_pack (argvec
);
19531 len
= TREE_VEC_LENGTH (parmvec
);
19533 /* Check if the parameters end in a pack, making them
19536 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19537 parm_variadic_p
= 1;
19539 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19540 /* If the template argument list of P contains a pack
19541 expansion that is not the last template argument, the
19542 entire template argument list is a non-deduced
19544 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19545 return unify_success (explain_p
);
19547 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19548 return unify_too_few_arguments (explain_p
,
19549 TREE_VEC_LENGTH (argvec
), len
);
19551 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19553 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19554 TREE_VEC_ELT (parmvec
, i
),
19555 TREE_VEC_ELT (argvec
, i
),
19556 UNIFY_ALLOW_NONE
, explain_p
);
19559 if (parm_variadic_p
19560 && unify_pack_expansion (tparms
, targs
,
19563 /*subr=*/true, explain_p
))
19566 arg
= TYPE_TI_TEMPLATE (arg
);
19568 /* Fall through to deduce template name. */
19571 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19572 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19574 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19576 /* Simple cases: Value already set, does match or doesn't. */
19577 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19578 return unify_success (explain_p
);
19580 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19584 /* If PARM is `const T' and ARG is only `int', we don't have
19585 a match unless we are allowing additional qualification.
19586 If ARG is `const int' and PARM is just `T' that's OK;
19587 that binds `const int' to `T'. */
19588 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19590 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19592 /* Consider the case where ARG is `const volatile int' and
19593 PARM is `const T'. Then, T should be `volatile int'. */
19594 arg
= cp_build_qualified_type_real
19595 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19596 if (arg
== error_mark_node
)
19597 return unify_invalid (explain_p
);
19599 /* Simple cases: Value already set, does match or doesn't. */
19600 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19601 return unify_success (explain_p
);
19603 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19605 /* Make sure that ARG is not a variable-sized array. (Note
19606 that were talking about variable-sized arrays (like
19607 `int[n]'), rather than arrays of unknown size (like
19608 `int[]').) We'll get very confused by such a type since
19609 the bound of the array is not constant, and therefore
19610 not mangleable. Besides, such types are not allowed in
19611 ISO C++, so we can do as we please here. We do allow
19612 them for 'auto' deduction, since that isn't ABI-exposed. */
19613 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19614 return unify_vla_arg (explain_p
, arg
);
19616 /* Strip typedefs as in convert_template_argument. */
19617 arg
= canonicalize_type_argument (arg
, tf_none
);
19620 /* If ARG is a parameter pack or an expansion, we cannot unify
19621 against it unless PARM is also a parameter pack. */
19622 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19623 && !template_parameter_pack_p (parm
))
19624 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19626 /* If the argument deduction results is a METHOD_TYPE,
19627 then there is a problem.
19628 METHOD_TYPE doesn't map to any real C++ type the result of
19629 the deduction can not be of that type. */
19630 if (TREE_CODE (arg
) == METHOD_TYPE
)
19631 return unify_method_type_error (explain_p
, arg
);
19633 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19634 return unify_success (explain_p
);
19636 case TEMPLATE_PARM_INDEX
:
19637 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19638 if (error_operand_p (tparm
))
19639 return unify_invalid (explain_p
);
19641 if (TEMPLATE_PARM_LEVEL (parm
)
19642 != template_decl_level (tparm
))
19644 /* The PARM is not one we're trying to unify. Just check
19645 to see if it matches ARG. */
19646 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19647 && cp_tree_equal (parm
, arg
));
19649 unify_expression_unequal (explain_p
, parm
, arg
);
19653 idx
= TEMPLATE_PARM_IDX (parm
);
19654 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19658 int x
= !cp_tree_equal (targ
, arg
);
19660 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19664 /* [temp.deduct.type] If, in the declaration of a function template
19665 with a non-type template-parameter, the non-type
19666 template-parameter is used in an expression in the function
19667 parameter-list and, if the corresponding template-argument is
19668 deduced, the template-argument type shall match the type of the
19669 template-parameter exactly, except that a template-argument
19670 deduced from an array bound may be of any integral type.
19671 The non-type parameter might use already deduced type parameters. */
19672 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19673 if (!TREE_TYPE (arg
))
19674 /* Template-parameter dependent expression. Just accept it for now.
19675 It will later be processed in convert_template_argument. */
19677 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19679 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19680 && CP_INTEGRAL_TYPE_P (tparm
))
19681 /* Convert the ARG to the type of PARM; the deduced non-type
19682 template argument must exactly match the types of the
19683 corresponding parameter. */
19684 arg
= fold (build_nop (tparm
, arg
));
19685 else if (uses_template_parms (tparm
))
19686 /* We haven't deduced the type of this parameter yet. Try again
19688 return unify_success (explain_p
);
19690 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19692 /* If ARG is a parameter pack or an expansion, we cannot unify
19693 against it unless PARM is also a parameter pack. */
19694 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19695 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19696 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19699 bool removed_attr
= false;
19700 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19702 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19703 return unify_success (explain_p
);
19707 /* A pointer-to-member constant can be unified only with
19708 another constant. */
19709 if (TREE_CODE (arg
) != PTRMEM_CST
)
19710 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19712 /* Just unify the class member. It would be useless (and possibly
19713 wrong, depending on the strict flags) to unify also
19714 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19715 arg refer to the same variable, even if through different
19716 classes. For instance:
19718 struct A { int x; };
19721 Unification of &A::x and &B::x must succeed. */
19722 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19723 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19728 if (!TYPE_PTR_P (arg
))
19729 return unify_type_mismatch (explain_p
, parm
, arg
);
19731 /* [temp.deduct.call]
19733 A can be another pointer or pointer to member type that can
19734 be converted to the deduced A via a qualification
19735 conversion (_conv.qual_).
19737 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19738 This will allow for additional cv-qualification of the
19739 pointed-to types if appropriate. */
19741 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19742 /* The derived-to-base conversion only persists through one
19743 level of pointers. */
19744 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19746 return unify (tparms
, targs
, TREE_TYPE (parm
),
19747 TREE_TYPE (arg
), strict
, explain_p
);
19750 case REFERENCE_TYPE
:
19751 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19752 return unify_type_mismatch (explain_p
, parm
, arg
);
19753 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19754 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19757 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19758 return unify_type_mismatch (explain_p
, parm
, arg
);
19759 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19760 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19761 return unify_type_mismatch (explain_p
, parm
, arg
);
19762 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19763 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19764 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19765 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19766 TYPE_DOMAIN (arg
), explain_p
);
19767 return unify_success (explain_p
);
19774 case ENUMERAL_TYPE
:
19777 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19778 return unify_type_mismatch (explain_p
, parm
, arg
);
19780 /* We have already checked cv-qualification at the top of the
19782 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19783 return unify_type_mismatch (explain_p
, parm
, arg
);
19785 /* As far as unification is concerned, this wins. Later checks
19786 will invalidate it if necessary. */
19787 return unify_success (explain_p
);
19789 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19790 /* Type INTEGER_CST can come from ordinary constant template args. */
19792 while (TREE_CODE (arg
) == NOP_EXPR
)
19793 arg
= TREE_OPERAND (arg
, 0);
19795 if (TREE_CODE (arg
) != INTEGER_CST
)
19796 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19797 return (tree_int_cst_equal (parm
, arg
)
19798 ? unify_success (explain_p
)
19799 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19803 int i
, len
, argslen
;
19804 int parm_variadic_p
= 0;
19806 if (TREE_CODE (arg
) != TREE_VEC
)
19807 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19809 len
= TREE_VEC_LENGTH (parm
);
19810 argslen
= TREE_VEC_LENGTH (arg
);
19812 /* Check for pack expansions in the parameters. */
19813 for (i
= 0; i
< len
; ++i
)
19815 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19818 /* We can unify against something with a trailing
19820 parm_variadic_p
= 1;
19822 /* [temp.deduct.type]/9: If the template argument list of
19823 P contains a pack expansion that is not the last
19824 template argument, the entire template argument list
19825 is a non-deduced context. */
19826 return unify_success (explain_p
);
19830 /* If we don't have enough arguments to satisfy the parameters
19831 (not counting the pack expression at the end), or we have
19832 too many arguments for a parameter list that doesn't end in
19833 a pack expression, we can't unify. */
19834 if (parm_variadic_p
19835 ? argslen
< len
- parm_variadic_p
19837 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19839 /* Unify all of the parameters that precede the (optional)
19840 pack expression. */
19841 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19843 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19844 TREE_VEC_ELT (parm
, i
),
19845 TREE_VEC_ELT (arg
, i
),
19846 UNIFY_ALLOW_NONE
, explain_p
);
19848 if (parm_variadic_p
)
19849 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19851 /*subr=*/true, explain_p
);
19852 return unify_success (explain_p
);
19857 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19858 return unify_type_mismatch (explain_p
, parm
, arg
);
19860 if (TYPE_PTRMEMFUNC_P (parm
))
19862 if (!TYPE_PTRMEMFUNC_P (arg
))
19863 return unify_type_mismatch (explain_p
, parm
, arg
);
19865 return unify (tparms
, targs
,
19866 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19867 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19868 strict
, explain_p
);
19870 else if (TYPE_PTRMEMFUNC_P (arg
))
19871 return unify_type_mismatch (explain_p
, parm
, arg
);
19873 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19875 tree t
= NULL_TREE
;
19877 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19879 /* First, we try to unify the PARM and ARG directly. */
19880 t
= try_class_unification (tparms
, targs
,
19881 parm
, arg
, explain_p
);
19885 /* Fallback to the special case allowed in
19886 [temp.deduct.call]:
19888 If P is a class, and P has the form
19889 template-id, then A can be a derived class of
19890 the deduced A. Likewise, if P is a pointer to
19891 a class of the form template-id, A can be a
19892 pointer to a derived class pointed to by the
19894 enum template_base_result r
;
19895 r
= get_template_base (tparms
, targs
, parm
, arg
,
19900 /* Don't give the derived diagnostic if we're
19901 already dealing with the same template. */
19903 = (CLASSTYPE_TEMPLATE_INFO (arg
)
19904 && (CLASSTYPE_TI_TEMPLATE (parm
)
19905 == CLASSTYPE_TI_TEMPLATE (arg
)));
19906 return unify_no_common_base (explain_p
&& !same_template
,
19911 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19912 && (CLASSTYPE_TI_TEMPLATE (parm
)
19913 == CLASSTYPE_TI_TEMPLATE (arg
)))
19914 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19915 Then, we should unify `int' and `U'. */
19918 /* There's no chance of unification succeeding. */
19919 return unify_type_mismatch (explain_p
, parm
, arg
);
19921 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19922 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19924 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19925 return unify_type_mismatch (explain_p
, parm
, arg
);
19926 return unify_success (explain_p
);
19929 case FUNCTION_TYPE
:
19931 unsigned int nargs
;
19936 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19937 return unify_type_mismatch (explain_p
, parm
, arg
);
19939 /* CV qualifications for methods can never be deduced, they must
19940 match exactly. We need to check them explicitly here,
19941 because type_unification_real treats them as any other
19942 cv-qualified parameter. */
19943 if (TREE_CODE (parm
) == METHOD_TYPE
19944 && (!check_cv_quals_for_unify
19946 class_of_this_parm (arg
),
19947 class_of_this_parm (parm
))))
19948 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19950 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
19951 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
19953 nargs
= list_length (TYPE_ARG_TYPES (arg
));
19954 args
= XALLOCAVEC (tree
, nargs
);
19955 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
19956 a
!= NULL_TREE
&& a
!= void_list_node
;
19957 a
= TREE_CHAIN (a
), ++i
)
19958 args
[i
] = TREE_VALUE (a
);
19961 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
19962 args
, nargs
, 1, DEDUCE_EXACT
,
19963 LOOKUP_NORMAL
, NULL
, explain_p
);
19967 /* Unify a pointer to member with a pointer to member function, which
19968 deduces the type of the member as a function type. */
19969 if (TYPE_PTRMEMFUNC_P (arg
))
19971 /* Check top-level cv qualifiers */
19972 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
19973 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19975 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19976 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
19977 UNIFY_ALLOW_NONE
, explain_p
);
19979 /* Determine the type of the function we are unifying against. */
19980 tree fntype
= static_fn_type (arg
);
19982 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
19985 if (TREE_CODE (arg
) != OFFSET_TYPE
)
19986 return unify_type_mismatch (explain_p
, parm
, arg
);
19987 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
19988 TYPE_OFFSET_BASETYPE (arg
),
19989 UNIFY_ALLOW_NONE
, explain_p
);
19990 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19991 strict
, explain_p
);
19994 if (DECL_TEMPLATE_PARM_P (parm
))
19995 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
19996 if (arg
!= scalar_constant_value (parm
))
19997 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19998 return unify_success (explain_p
);
20001 case TEMPLATE_DECL
:
20002 /* Matched cases are handled by the ARG == PARM test above. */
20003 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20006 /* We might get a variable as a non-type template argument in parm if the
20007 corresponding parameter is type-dependent. Make any necessary
20008 adjustments based on whether arg is a reference. */
20009 if (CONSTANT_CLASS_P (arg
))
20010 parm
= fold_non_dependent_expr (parm
);
20011 else if (REFERENCE_REF_P (arg
))
20013 tree sub
= TREE_OPERAND (arg
, 0);
20015 if (TREE_CODE (sub
) == ADDR_EXPR
)
20016 arg
= TREE_OPERAND (sub
, 0);
20018 /* Now use the normal expression code to check whether they match. */
20021 case TYPE_ARGUMENT_PACK
:
20022 case NONTYPE_ARGUMENT_PACK
:
20023 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
20024 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
20027 case DECLTYPE_TYPE
:
20028 case UNDERLYING_TYPE
:
20029 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
20030 or UNDERLYING_TYPE nodes. */
20031 return unify_success (explain_p
);
20034 /* Unification fails if we hit an error node. */
20035 return unify_invalid (explain_p
);
20038 if (REFERENCE_REF_P (parm
))
20040 if (REFERENCE_REF_P (arg
))
20041 arg
= TREE_OPERAND (arg
, 0);
20042 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
20043 strict
, explain_p
);
20048 /* An unresolved overload is a nondeduced context. */
20049 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
20050 return unify_success (explain_p
);
20051 gcc_assert (EXPR_P (parm
));
20053 /* We must be looking at an expression. This can happen with
20057 void foo(S<I>, S<I + 2>);
20059 This is a "nondeduced context":
20063 The nondeduced contexts are:
20065 --A type that is a template-id in which one or more of
20066 the template-arguments is an expression that references
20067 a template-parameter.
20069 In these cases, we assume deduction succeeded, but don't
20070 actually infer any unifications. */
20072 if (!uses_template_parms (parm
)
20073 && !template_args_equal (parm
, arg
))
20074 return unify_expression_unequal (explain_p
, parm
, arg
);
20076 return unify_success (explain_p
);
20079 #undef RECUR_AND_CHECK_FAILURE
20081 /* Note that DECL can be defined in this translation unit, if
20085 mark_definable (tree decl
)
20088 DECL_NOT_REALLY_EXTERN (decl
) = 1;
20089 FOR_EACH_CLONE (clone
, decl
)
20090 DECL_NOT_REALLY_EXTERN (clone
) = 1;
20093 /* Called if RESULT is explicitly instantiated, or is a member of an
20094 explicitly instantiated class. */
20097 mark_decl_instantiated (tree result
, int extern_p
)
20099 SET_DECL_EXPLICIT_INSTANTIATION (result
);
20101 /* If this entity has already been written out, it's too late to
20102 make any modifications. */
20103 if (TREE_ASM_WRITTEN (result
))
20106 /* For anonymous namespace we don't need to do anything. */
20107 if (decl_anon_ns_mem_p (result
))
20109 gcc_assert (!TREE_PUBLIC (result
));
20113 if (TREE_CODE (result
) != FUNCTION_DECL
)
20114 /* The TREE_PUBLIC flag for function declarations will have been
20115 set correctly by tsubst. */
20116 TREE_PUBLIC (result
) = 1;
20118 /* This might have been set by an earlier implicit instantiation. */
20119 DECL_COMDAT (result
) = 0;
20122 DECL_NOT_REALLY_EXTERN (result
) = 0;
20125 mark_definable (result
);
20126 mark_needed (result
);
20127 /* Always make artificials weak. */
20128 if (DECL_ARTIFICIAL (result
) && flag_weak
)
20129 comdat_linkage (result
);
20130 /* For WIN32 we also want to put explicit instantiations in
20131 linkonce sections. */
20132 else if (TREE_PUBLIC (result
))
20133 maybe_make_one_only (result
);
20136 /* If EXTERN_P, then this function will not be emitted -- unless
20137 followed by an explicit instantiation, at which point its linkage
20138 will be adjusted. If !EXTERN_P, then this function will be
20139 emitted here. In neither circumstance do we want
20140 import_export_decl to adjust the linkage. */
20141 DECL_INTERFACE_KNOWN (result
) = 1;
20144 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
20145 important template arguments. If any are missing, we check whether
20146 they're important by using error_mark_node for substituting into any
20147 args that were used for partial ordering (the ones between ARGS and END)
20148 and seeing if it bubbles up. */
20151 check_undeduced_parms (tree targs
, tree args
, tree end
)
20153 bool found
= false;
20155 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
20156 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
20159 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
20163 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
20164 if (substed
== error_mark_node
)
20170 /* Given two function templates PAT1 and PAT2, return:
20172 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
20173 -1 if PAT2 is more specialized than PAT1.
20174 0 if neither is more specialized.
20176 LEN indicates the number of parameters we should consider
20177 (defaulted parameters should not be considered).
20179 The 1998 std underspecified function template partial ordering, and
20180 DR214 addresses the issue. We take pairs of arguments, one from
20181 each of the templates, and deduce them against each other. One of
20182 the templates will be more specialized if all the *other*
20183 template's arguments deduce against its arguments and at least one
20184 of its arguments *does* *not* deduce against the other template's
20185 corresponding argument. Deduction is done as for class templates.
20186 The arguments used in deduction have reference and top level cv
20187 qualifiers removed. Iff both arguments were originally reference
20188 types *and* deduction succeeds in both directions, an lvalue reference
20189 wins against an rvalue reference and otherwise the template
20190 with the more cv-qualified argument wins for that pairing (if
20191 neither is more cv-qualified, they both are equal). Unlike regular
20192 deduction, after all the arguments have been deduced in this way,
20193 we do *not* verify the deduced template argument values can be
20194 substituted into non-deduced contexts.
20196 The logic can be a bit confusing here, because we look at deduce1 and
20197 targs1 to see if pat2 is at least as specialized, and vice versa; if we
20198 can find template arguments for pat1 to make arg1 look like arg2, that
20199 means that arg2 is at least as specialized as arg1. */
20202 more_specialized_fn (tree pat1
, tree pat2
, int len
)
20204 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
20205 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
20206 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
20207 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
20208 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
20209 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
20210 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
20211 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
20212 tree origs1
, origs2
;
20213 bool lose1
= false;
20214 bool lose2
= false;
20216 /* Remove the this parameter from non-static member functions. If
20217 one is a non-static member function and the other is not a static
20218 member function, remove the first parameter from that function
20219 also. This situation occurs for operator functions where we
20220 locate both a member function (with this pointer) and non-member
20221 operator (with explicit first operand). */
20222 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
20224 len
--; /* LEN is the number of significant arguments for DECL1 */
20225 args1
= TREE_CHAIN (args1
);
20226 if (!DECL_STATIC_FUNCTION_P (decl2
))
20227 args2
= TREE_CHAIN (args2
);
20229 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
20231 args2
= TREE_CHAIN (args2
);
20232 if (!DECL_STATIC_FUNCTION_P (decl1
))
20235 args1
= TREE_CHAIN (args1
);
20239 /* If only one is a conversion operator, they are unordered. */
20240 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
20243 /* Consider the return type for a conversion function */
20244 if (DECL_CONV_FN_P (decl1
))
20246 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
20247 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
20251 processing_template_decl
++;
20257 /* Stop when an ellipsis is seen. */
20258 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
20260 tree arg1
= TREE_VALUE (args1
);
20261 tree arg2
= TREE_VALUE (args2
);
20262 int deduce1
, deduce2
;
20268 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20269 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20271 /* When both arguments are pack expansions, we need only
20272 unify the patterns themselves. */
20273 arg1
= PACK_EXPANSION_PATTERN (arg1
);
20274 arg2
= PACK_EXPANSION_PATTERN (arg2
);
20276 /* This is the last comparison we need to do. */
20280 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
20282 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
20283 arg1
= TREE_TYPE (arg1
);
20284 quals1
= cp_type_quals (arg1
);
20287 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20289 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20290 arg2
= TREE_TYPE (arg2
);
20291 quals2
= cp_type_quals (arg2
);
20294 arg1
= TYPE_MAIN_VARIANT (arg1
);
20295 arg2
= TYPE_MAIN_VARIANT (arg2
);
20297 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20299 int i
, len2
= list_length (args2
);
20300 tree parmvec
= make_tree_vec (1);
20301 tree argvec
= make_tree_vec (len2
);
20304 /* Setup the parameter vector, which contains only ARG1. */
20305 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20307 /* Setup the argument vector, which contains the remaining
20309 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20310 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20312 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20313 argvec
, DEDUCE_EXACT
,
20314 /*subr=*/true, /*explain_p=*/false)
20317 /* We cannot deduce in the other direction, because ARG1 is
20318 a pack expansion but ARG2 is not. */
20321 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20323 int i
, len1
= list_length (args1
);
20324 tree parmvec
= make_tree_vec (1);
20325 tree argvec
= make_tree_vec (len1
);
20328 /* Setup the parameter vector, which contains only ARG1. */
20329 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20331 /* Setup the argument vector, which contains the remaining
20333 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20334 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20336 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20337 argvec
, DEDUCE_EXACT
,
20338 /*subr=*/true, /*explain_p=*/false)
20341 /* We cannot deduce in the other direction, because ARG2 is
20342 a pack expansion but ARG1 is not.*/
20348 /* The normal case, where neither argument is a pack
20350 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20351 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20353 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20354 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20358 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20359 arg2, then arg2 is not as specialized as arg1. */
20365 /* "If, for a given type, deduction succeeds in both directions
20366 (i.e., the types are identical after the transformations above)
20367 and both P and A were reference types (before being replaced with
20368 the type referred to above):
20369 - if the type from the argument template was an lvalue reference and
20370 the type from the parameter template was not, the argument type is
20371 considered to be more specialized than the other; otherwise,
20372 - if the type from the argument template is more cv-qualified
20373 than the type from the parameter template (as described above),
20374 the argument type is considered to be more specialized than the other;
20376 - neither type is more specialized than the other." */
20378 if (deduce1
&& deduce2
)
20380 if (ref1
&& ref2
&& ref1
!= ref2
)
20387 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20389 if ((quals1
& quals2
) == quals2
)
20391 if ((quals1
& quals2
) == quals1
)
20396 if (lose1
&& lose2
)
20397 /* We've failed to deduce something in either direction.
20398 These must be unordered. */
20401 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20402 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20403 /* We have already processed all of the arguments in our
20404 handing of the pack expansion type. */
20407 args1
= TREE_CHAIN (args1
);
20408 args2
= TREE_CHAIN (args2
);
20411 /* "In most cases, all template parameters must have values in order for
20412 deduction to succeed, but for partial ordering purposes a template
20413 parameter may remain without a value provided it is not used in the
20414 types being used for partial ordering."
20416 Thus, if we are missing any of the targs1 we need to substitute into
20417 origs1, then pat2 is not as specialized as pat1. This can happen when
20418 there is a nondeduced context. */
20419 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20421 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20424 processing_template_decl
--;
20426 /* If both deductions succeed, the partial ordering selects the more
20427 constrained template. */
20428 if (!lose1
&& !lose2
)
20430 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20431 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20432 lose1
= !subsumes_constraints (c1
, c2
);
20433 lose2
= !subsumes_constraints (c2
, c1
);
20436 /* All things being equal, if the next argument is a pack expansion
20437 for one function but not for the other, prefer the
20438 non-variadic function. FIXME this is bogus; see c++/41958. */
20440 && args1
&& TREE_VALUE (args1
)
20441 && args2
&& TREE_VALUE (args2
))
20443 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20444 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20447 if (lose1
== lose2
)
20455 /* Determine which of two partial specializations of TMPL is more
20458 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20459 to the first partial specialization. The TREE_PURPOSE is the
20460 innermost set of template parameters for the partial
20461 specialization. PAT2 is similar, but for the second template.
20463 Return 1 if the first partial specialization is more specialized;
20464 -1 if the second is more specialized; 0 if neither is more
20467 See [temp.class.order] for information about determining which of
20468 two templates is more specialized. */
20471 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20475 bool any_deductions
= false;
20477 tree tmpl1
= TREE_VALUE (pat1
);
20478 tree tmpl2
= TREE_VALUE (pat2
);
20479 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20480 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20481 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20482 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20484 /* Just like what happens for functions, if we are ordering between
20485 different template specializations, we may encounter dependent
20486 types in the arguments, and we need our dependency check functions
20487 to behave correctly. */
20488 ++processing_template_decl
;
20489 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20493 any_deductions
= true;
20496 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20500 any_deductions
= true;
20502 --processing_template_decl
;
20504 /* If both deductions succeed, the partial ordering selects the more
20505 constrained template. */
20506 if (!winner
&& any_deductions
)
20507 return more_constrained (tmpl1
, tmpl2
);
20509 /* In the case of a tie where at least one of the templates
20510 has a parameter pack at the end, the template with the most
20511 non-packed parameters wins. */
20514 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20515 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20517 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20518 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20519 int len1
= TREE_VEC_LENGTH (args1
);
20520 int len2
= TREE_VEC_LENGTH (args2
);
20522 /* We don't count the pack expansion at the end. */
20523 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20525 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20530 else if (len1
< len2
)
20537 /* Return the template arguments that will produce the function signature
20538 DECL from the function template FN, with the explicit template
20539 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20540 also match. Return NULL_TREE if no satisfactory arguments could be
20544 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20546 int ntparms
= DECL_NTPARMS (fn
);
20547 tree targs
= make_tree_vec (ntparms
);
20548 tree decl_type
= TREE_TYPE (decl
);
20549 tree decl_arg_types
;
20551 unsigned int nargs
, ix
;
20554 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20556 /* Never do unification on the 'this' parameter. */
20557 decl_arg_types
= skip_artificial_parms_for (decl
,
20558 TYPE_ARG_TYPES (decl_type
));
20560 nargs
= list_length (decl_arg_types
);
20561 args
= XALLOCAVEC (tree
, nargs
);
20562 for (arg
= decl_arg_types
, ix
= 0;
20563 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20564 arg
= TREE_CHAIN (arg
), ++ix
)
20565 args
[ix
] = TREE_VALUE (arg
);
20567 if (fn_type_unification (fn
, explicit_args
, targs
,
20569 (check_rettype
|| DECL_CONV_FN_P (fn
)
20570 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20571 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20573 == error_mark_node
)
20579 /* Return the innermost template arguments that, when applied to a partial
20580 specialization of TMPL whose innermost template parameters are
20581 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20584 For example, suppose we have:
20586 template <class T, class U> struct S {};
20587 template <class T> struct S<T*, int> {};
20589 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20590 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20591 int}. The resulting vector will be {double}, indicating that `T'
20592 is bound to `double'. */
20595 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20597 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20599 tree innermost_deduced_args
;
20601 innermost_deduced_args
= make_tree_vec (ntparms
);
20602 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20604 deduced_args
= copy_node (args
);
20605 SET_TMPL_ARGS_LEVEL (deduced_args
,
20606 TMPL_ARGS_DEPTH (deduced_args
),
20607 innermost_deduced_args
);
20610 deduced_args
= innermost_deduced_args
;
20612 if (unify (tparms
, deduced_args
,
20613 INNERMOST_TEMPLATE_ARGS (spec_args
),
20614 INNERMOST_TEMPLATE_ARGS (args
),
20615 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20618 for (i
= 0; i
< ntparms
; ++i
)
20619 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20622 /* Verify that nondeduced template arguments agree with the type
20623 obtained from argument deduction.
20627 struct A { typedef int X; };
20628 template <class T, class U> struct C {};
20629 template <class T> struct C<T, typename T::X> {};
20631 Then with the instantiation `C<A, int>', we can deduce that
20632 `T' is `A' but unify () does not check whether `typename T::X'
20634 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20635 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20637 tf_none
, false, false);
20638 if (spec_args
== error_mark_node
20639 /* We only need to check the innermost arguments; the other
20640 arguments will always agree. */
20641 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20642 INNERMOST_TEMPLATE_ARGS (args
)))
20645 /* Now that we have bindings for all of the template arguments,
20646 ensure that the arguments deduced for the template template
20647 parameters have compatible template parameter lists. See the use
20648 of template_template_parm_bindings_ok_p in fn_type_unification
20649 for more information. */
20650 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20653 return deduced_args
;
20656 // Compare two function templates T1 and T2 by deducing bindings
20657 // from one against the other. If both deductions succeed, compare
20658 // constraints to see which is more constrained.
20660 more_specialized_inst (tree t1
, tree t2
)
20665 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20671 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20677 // If both deductions succeed, then one may be more constrained.
20678 if (count
== 2 && fate
== 0)
20679 fate
= more_constrained (t1
, t2
);
20684 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20685 Return the TREE_LIST node with the most specialized template, if
20686 any. If there is no most specialized template, the error_mark_node
20689 Note that this function does not look at, or modify, the
20690 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20691 returned is one of the elements of INSTANTIATIONS, callers may
20692 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20693 and retrieve it from the value returned. */
20696 most_specialized_instantiation (tree templates
)
20700 ++processing_template_decl
;
20703 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20705 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20710 /* Equally specialized, move to next function. If there
20711 is no next function, nothing's most specialized. */
20712 fn
= TREE_CHAIN (fn
);
20720 /* Now verify that champ is better than everything earlier in the
20721 instantiation list. */
20722 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20723 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20730 processing_template_decl
--;
20733 return error_mark_node
;
20738 /* If DECL is a specialization of some template, return the most
20739 general such template. Otherwise, returns NULL_TREE.
20741 For example, given:
20743 template <class T> struct S { template <class U> void f(U); };
20745 if TMPL is `template <class U> void S<int>::f(U)' this will return
20746 the full template. This function will not trace past partial
20747 specializations, however. For example, given in addition:
20749 template <class T> struct S<T*> { template <class U> void f(U); };
20751 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20752 `template <class T> template <class U> S<T*>::f(U)'. */
20755 most_general_template (tree decl
)
20757 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20759 if (tree tinfo
= get_template_info (decl
))
20760 decl
= TI_TEMPLATE (tinfo
);
20761 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20762 template friend, or a FIELD_DECL for a capture pack. */
20763 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20767 /* Look for more and more general templates. */
20768 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20770 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20771 (See cp-tree.h for details.) */
20772 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20775 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20776 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20777 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20780 /* Stop if we run into an explicitly specialized class template. */
20781 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20782 && DECL_CONTEXT (decl
)
20783 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20786 decl
= DECL_TI_TEMPLATE (decl
);
20792 /* True iff the TEMPLATE_DECL tmpl is a partial specialization. */
20795 partial_specialization_p (tree tmpl
)
20797 /* Any specialization has DECL_TEMPLATE_SPECIALIZATION. */
20798 if (!DECL_TEMPLATE_SPECIALIZATION (tmpl
))
20800 tree t
= DECL_TI_TEMPLATE (tmpl
);
20801 /* A specialization that fully specializes one of the containing classes is
20802 not a partial specialization. */
20803 return (list_length (DECL_TEMPLATE_PARMS (tmpl
))
20804 == list_length (DECL_TEMPLATE_PARMS (t
)));
20807 /* If TMPL is a partial specialization, return the arguments for its primary
20811 impartial_args (tree tmpl
, tree args
)
20813 if (!partial_specialization_p (tmpl
))
20816 /* If TMPL is a partial specialization, we need to substitute to get
20817 the args for the primary template. */
20818 return tsubst_template_args (DECL_TI_ARGS (tmpl
), args
,
20819 tf_warning_or_error
, tmpl
);
20822 /* Return the most specialized of the template partial specializations
20823 which can produce TARGET, a specialization of some class or variable
20824 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20825 a TEMPLATE_DECL node corresponding to the partial specialization, while
20826 the TREE_PURPOSE is the set of template arguments that must be
20827 substituted into the template pattern in order to generate TARGET.
20829 If the choice of partial specialization is ambiguous, a diagnostic
20830 is issued, and the error_mark_node is returned. If there are no
20831 partial specializations matching TARGET, then NULL_TREE is
20832 returned, indicating that the primary template should be used. */
20835 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20837 tree list
= NULL_TREE
;
20842 tree outer_args
= NULL_TREE
;
20845 if (TYPE_P (target
))
20847 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20848 tmpl
= TI_TEMPLATE (tinfo
);
20849 args
= TI_ARGS (tinfo
);
20851 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20853 tmpl
= TREE_OPERAND (target
, 0);
20854 args
= TREE_OPERAND (target
, 1);
20856 else if (VAR_P (target
))
20858 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20859 tmpl
= TI_TEMPLATE (tinfo
);
20860 args
= TI_ARGS (tinfo
);
20863 gcc_unreachable ();
20865 tree main_tmpl
= most_general_template (tmpl
);
20867 /* For determining which partial specialization to use, only the
20868 innermost args are interesting. */
20869 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20871 outer_args
= strip_innermost_template_args (args
, 1);
20872 args
= INNERMOST_TEMPLATE_ARGS (args
);
20875 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20877 tree partial_spec_args
;
20879 tree spec_tmpl
= TREE_VALUE (t
);
20881 partial_spec_args
= TREE_PURPOSE (t
);
20883 ++processing_template_decl
;
20887 /* Discard the outer levels of args, and then substitute in the
20888 template args from the enclosing class. */
20889 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20890 partial_spec_args
= tsubst_template_args
20891 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20893 /* And the same for the partial specialization TEMPLATE_DECL. */
20894 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20897 partial_spec_args
=
20898 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20901 /*require_all_args=*/true,
20902 /*use_default_args=*/true);
20904 --processing_template_decl
;
20906 if (partial_spec_args
== error_mark_node
)
20907 return error_mark_node
;
20908 if (spec_tmpl
== error_mark_node
)
20909 return error_mark_node
;
20911 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20912 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20918 spec_args
= add_to_template_args (outer_args
, spec_args
);
20920 /* Keep the candidate only if the constraints are satisfied,
20921 or if we're not compiling with concepts. */
20923 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20925 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20926 TREE_TYPE (list
) = TREE_TYPE (t
);
20934 ambiguous_p
= false;
20937 t
= TREE_CHAIN (t
);
20938 for (; t
; t
= TREE_CHAIN (t
))
20940 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20947 t
= TREE_CHAIN (t
);
20950 ambiguous_p
= true;
20959 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
20961 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
20964 ambiguous_p
= true;
20972 char *spaces
= NULL
;
20973 if (!(complain
& tf_error
))
20974 return error_mark_node
;
20975 if (TYPE_P (target
))
20976 error ("ambiguous template instantiation for %q#T", target
);
20978 error ("ambiguous template instantiation for %q#D", target
);
20979 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
20980 for (t
= list
; t
; t
= TREE_CHAIN (t
))
20982 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
20983 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
20984 "%s %#S", spaces
? spaces
: str
, subst
);
20985 spaces
= spaces
? spaces
: get_spaces (str
);
20988 return error_mark_node
;
20994 /* Explicitly instantiate DECL. */
20997 do_decl_instantiation (tree decl
, tree storage
)
20999 tree result
= NULL_TREE
;
21002 if (!decl
|| decl
== error_mark_node
)
21003 /* An error occurred, for which grokdeclarator has already issued
21004 an appropriate message. */
21006 else if (! DECL_LANG_SPECIFIC (decl
))
21008 error ("explicit instantiation of non-template %q#D", decl
);
21012 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
21013 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
21015 if (VAR_P (decl
) && !var_templ
)
21017 /* There is an asymmetry here in the way VAR_DECLs and
21018 FUNCTION_DECLs are handled by grokdeclarator. In the case of
21019 the latter, the DECL we get back will be marked as a
21020 template instantiation, and the appropriate
21021 DECL_TEMPLATE_INFO will be set up. This does not happen for
21022 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
21023 should handle VAR_DECLs as it currently handles
21025 if (!DECL_CLASS_SCOPE_P (decl
))
21027 error ("%qD is not a static data member of a class template", decl
);
21030 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
21031 if (!result
|| !VAR_P (result
))
21033 error ("no matching template for %qD found", decl
);
21036 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
21038 error ("type %qT for explicit instantiation %qD does not match "
21039 "declared type %qT", TREE_TYPE (result
), decl
,
21044 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
21046 error ("explicit instantiation of %q#D", decl
);
21052 /* Check for various error cases. Note that if the explicit
21053 instantiation is valid the RESULT will currently be marked as an
21054 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
21055 until we get here. */
21057 if (DECL_TEMPLATE_SPECIALIZATION (result
))
21059 /* DR 259 [temp.spec].
21061 Both an explicit instantiation and a declaration of an explicit
21062 specialization shall not appear in a program unless the explicit
21063 instantiation follows a declaration of the explicit specialization.
21065 For a given set of template parameters, if an explicit
21066 instantiation of a template appears after a declaration of an
21067 explicit specialization for that template, the explicit
21068 instantiation has no effect. */
21071 else if (DECL_EXPLICIT_INSTANTIATION (result
))
21075 No program shall explicitly instantiate any template more
21078 We check DECL_NOT_REALLY_EXTERN so as not to complain when
21079 the first instantiation was `extern' and the second is not,
21080 and EXTERN_P for the opposite case. */
21081 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
21082 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
21083 /* If an "extern" explicit instantiation follows an ordinary
21084 explicit instantiation, the template is instantiated. */
21088 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
21090 error ("no matching template for %qD found", result
);
21093 else if (!DECL_TEMPLATE_INFO (result
))
21095 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
21099 if (storage
== NULL_TREE
)
21101 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21103 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
21104 pedwarn (input_location
, OPT_Wpedantic
,
21105 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
21110 error ("storage class %qD applied to template instantiation", storage
);
21112 check_explicit_instantiation_namespace (result
);
21113 mark_decl_instantiated (result
, extern_p
);
21115 instantiate_decl (result
, /*defer_ok=*/1,
21116 /*expl_inst_class_mem_p=*/false);
21120 mark_class_instantiated (tree t
, int extern_p
)
21122 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
21123 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
21124 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
21125 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
21128 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
21129 rest_of_type_compilation (t
, 1);
21133 /* Called from do_type_instantiation through binding_table_foreach to
21134 do recursive instantiation for the type bound in ENTRY. */
21136 bt_instantiate_type_proc (binding_entry entry
, void *data
)
21138 tree storage
= *(tree
*) data
;
21140 if (MAYBE_CLASS_TYPE_P (entry
->type
)
21141 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
21142 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
21145 /* Called from do_type_instantiation to instantiate a member
21146 (a member function or a static member variable) of an
21147 explicitly instantiated class template. */
21149 instantiate_class_member (tree decl
, int extern_p
)
21151 mark_decl_instantiated (decl
, extern_p
);
21153 instantiate_decl (decl
, /*defer_ok=*/1,
21154 /*expl_inst_class_mem_p=*/true);
21157 /* Perform an explicit instantiation of template class T. STORAGE, if
21158 non-null, is the RID for extern, inline or static. COMPLAIN is
21159 nonzero if this is called from the parser, zero if called recursively,
21160 since the standard is unclear (as detailed below). */
21163 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
21168 int previous_instantiation_extern_p
= 0;
21170 if (TREE_CODE (t
) == TYPE_DECL
)
21173 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
21176 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
21178 error ("explicit instantiation of non-class template %qD", tmpl
);
21180 error ("explicit instantiation of non-template type %qT", t
);
21186 if (!COMPLETE_TYPE_P (t
))
21188 if (complain
& tf_error
)
21189 error ("explicit instantiation of %q#T before definition of template",
21194 if (storage
!= NULL_TREE
)
21196 if (!in_system_header_at (input_location
))
21198 if (storage
== ridpointers
[(int) RID_EXTERN
])
21200 if (cxx_dialect
== cxx98
)
21201 pedwarn (input_location
, OPT_Wpedantic
,
21202 "ISO C++ 1998 forbids the use of %<extern%> on "
21203 "explicit instantiations");
21206 pedwarn (input_location
, OPT_Wpedantic
,
21207 "ISO C++ forbids the use of %qE"
21208 " on explicit instantiations", storage
);
21211 if (storage
== ridpointers
[(int) RID_INLINE
])
21213 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21215 else if (storage
== ridpointers
[(int) RID_STATIC
])
21219 error ("storage class %qD applied to template instantiation",
21225 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
21227 /* DR 259 [temp.spec].
21229 Both an explicit instantiation and a declaration of an explicit
21230 specialization shall not appear in a program unless the explicit
21231 instantiation follows a declaration of the explicit specialization.
21233 For a given set of template parameters, if an explicit
21234 instantiation of a template appears after a declaration of an
21235 explicit specialization for that template, the explicit
21236 instantiation has no effect. */
21239 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
21243 No program shall explicitly instantiate any template more
21246 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
21247 instantiation was `extern'. If EXTERN_P then the second is.
21248 These cases are OK. */
21249 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
21251 if (!previous_instantiation_extern_p
&& !extern_p
21252 && (complain
& tf_error
))
21253 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
21255 /* If we've already instantiated the template, just return now. */
21256 if (!CLASSTYPE_INTERFACE_ONLY (t
))
21260 check_explicit_instantiation_namespace (TYPE_NAME (t
));
21261 mark_class_instantiated (t
, extern_p
);
21269 /* In contrast to implicit instantiation, where only the
21270 declarations, and not the definitions, of members are
21271 instantiated, we have here:
21275 The explicit instantiation of a class template specialization
21276 implies the instantiation of all of its members not
21277 previously explicitly specialized in the translation unit
21278 containing the explicit instantiation.
21280 Of course, we can't instantiate member template classes, since
21281 we don't have any arguments for them. Note that the standard
21282 is unclear on whether the instantiation of the members are
21283 *explicit* instantiations or not. However, the most natural
21284 interpretation is that it should be an explicit instantiation. */
21287 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21288 if (TREE_CODE (tmp
) == FUNCTION_DECL
21289 && DECL_TEMPLATE_INSTANTIATION (tmp
))
21290 instantiate_class_member (tmp
, extern_p
);
21292 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21293 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
21294 instantiate_class_member (tmp
, extern_p
);
21296 if (CLASSTYPE_NESTED_UTDS (t
))
21297 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
21298 bt_instantiate_type_proc
, &storage
);
21302 /* Given a function DECL, which is a specialization of TMPL, modify
21303 DECL to be a re-instantiation of TMPL with the same template
21304 arguments. TMPL should be the template into which tsubst'ing
21305 should occur for DECL, not the most general template.
21307 One reason for doing this is a scenario like this:
21310 void f(const T&, int i);
21312 void g() { f(3, 7); }
21315 void f(const T& t, const int i) { }
21317 Note that when the template is first instantiated, with
21318 instantiate_template, the resulting DECL will have no name for the
21319 first parameter, and the wrong type for the second. So, when we go
21320 to instantiate the DECL, we regenerate it. */
21323 regenerate_decl_from_template (tree decl
, tree tmpl
)
21325 /* The arguments used to instantiate DECL, from the most general
21330 args
= DECL_TI_ARGS (decl
);
21331 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21333 /* Make sure that we can see identifiers, and compute access
21335 push_access_scope (decl
);
21337 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21345 args_depth
= TMPL_ARGS_DEPTH (args
);
21346 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21347 if (args_depth
> parms_depth
)
21348 args
= get_innermost_template_args (args
, parms_depth
);
21350 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21351 args
, tf_error
, NULL_TREE
,
21352 /*defer_ok*/false);
21353 if (specs
&& specs
!= error_mark_node
)
21354 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21357 /* Merge parameter declarations. */
21358 decl_parm
= skip_artificial_parms_for (decl
,
21359 DECL_ARGUMENTS (decl
));
21361 = skip_artificial_parms_for (code_pattern
,
21362 DECL_ARGUMENTS (code_pattern
));
21363 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21368 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21369 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21370 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21372 parm_type
= type_decays_to (parm_type
);
21373 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21374 TREE_TYPE (decl_parm
) = parm_type
;
21375 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21376 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21378 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21379 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21381 decl_parm
= DECL_CHAIN (decl_parm
);
21382 pattern_parm
= DECL_CHAIN (pattern_parm
);
21384 /* Merge any parameters that match with the function parameter
21386 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21389 tree expanded_types
;
21390 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21391 the parameters in this function parameter pack. */
21392 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21393 args
, tf_error
, NULL_TREE
);
21394 len
= TREE_VEC_LENGTH (expanded_types
);
21395 for (i
= 0; i
< len
; i
++)
21400 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21401 /* Rename the parameter to include the index. */
21402 DECL_NAME (decl_parm
) =
21403 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21404 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21405 parm_type
= type_decays_to (parm_type
);
21406 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21407 TREE_TYPE (decl_parm
) = parm_type
;
21408 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21409 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21411 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21412 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21414 decl_parm
= DECL_CHAIN (decl_parm
);
21417 /* Merge additional specifiers from the CODE_PATTERN. */
21418 if (DECL_DECLARED_INLINE_P (code_pattern
)
21419 && !DECL_DECLARED_INLINE_P (decl
))
21420 DECL_DECLARED_INLINE_P (decl
) = 1;
21422 else if (VAR_P (decl
))
21424 DECL_INITIAL (decl
) =
21425 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21426 tf_error
, DECL_TI_TEMPLATE (decl
),
21427 /*integral_constant_expression_p=*/false);
21428 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21429 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21430 tf_error
, DECL_TI_TEMPLATE (decl
));
21433 gcc_unreachable ();
21435 pop_access_scope (decl
);
21438 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21439 substituted to get DECL. */
21442 template_for_substitution (tree decl
)
21444 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21446 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21447 for the instantiation. This is not always the most general
21448 template. Consider, for example:
21451 struct S { template <class U> void f();
21452 template <> void f<int>(); };
21454 and an instantiation of S<double>::f<int>. We want TD to be the
21455 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21456 while (/* An instantiation cannot have a definition, so we need a
21457 more general template. */
21458 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21459 /* We must also deal with friend templates. Given:
21461 template <class T> struct S {
21462 template <class U> friend void f() {};
21465 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21466 so far as the language is concerned, but that's still
21467 where we get the pattern for the instantiation from. On
21468 other hand, if the definition comes outside the class, say:
21470 template <class T> struct S {
21471 template <class U> friend void f();
21473 template <class U> friend void f() {}
21475 we don't need to look any further. That's what the check for
21476 DECL_INITIAL is for. */
21477 || (TREE_CODE (decl
) == FUNCTION_DECL
21478 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21479 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21481 /* The present template, TD, should not be a definition. If it
21482 were a definition, we should be using it! Note that we
21483 cannot restructure the loop to just keep going until we find
21484 a template with a definition, since that might go too far if
21485 a specialization was declared, but not defined. */
21487 /* Fetch the more general template. */
21488 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21494 /* Returns true if we need to instantiate this template instance even if we
21495 know we aren't going to emit it. */
21498 always_instantiate_p (tree decl
)
21500 /* We always instantiate inline functions so that we can inline them. An
21501 explicit instantiation declaration prohibits implicit instantiation of
21502 non-inline functions. With high levels of optimization, we would
21503 normally inline non-inline functions -- but we're not allowed to do
21504 that for "extern template" functions. Therefore, we check
21505 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21506 return ((TREE_CODE (decl
) == FUNCTION_DECL
21507 && (DECL_DECLARED_INLINE_P (decl
)
21508 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21509 /* And we need to instantiate static data members so that
21510 their initializers are available in integral constant
21513 && decl_maybe_constant_var_p (decl
)));
21516 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21517 instantiate it now, modifying TREE_TYPE (fn). */
21520 maybe_instantiate_noexcept (tree fn
)
21522 tree fntype
, spec
, noex
, clone
;
21524 /* Don't instantiate a noexcept-specification from template context. */
21525 if (processing_template_decl
)
21528 if (DECL_CLONED_FUNCTION_P (fn
))
21529 fn
= DECL_CLONED_FUNCTION (fn
);
21530 fntype
= TREE_TYPE (fn
);
21531 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21533 if (!spec
|| !TREE_PURPOSE (spec
))
21536 noex
= TREE_PURPOSE (spec
);
21538 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21540 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21541 spec
= get_defaulted_eh_spec (fn
);
21542 else if (push_tinst_level (fn
))
21544 push_access_scope (fn
);
21545 push_deferring_access_checks (dk_no_deferred
);
21546 input_location
= DECL_SOURCE_LOCATION (fn
);
21547 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21548 DEFERRED_NOEXCEPT_ARGS (noex
),
21549 tf_warning_or_error
, fn
,
21550 /*function_p=*/false,
21551 /*integral_constant_expression_p=*/true);
21552 pop_deferring_access_checks ();
21553 pop_access_scope (fn
);
21554 pop_tinst_level ();
21555 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21556 if (spec
== error_mark_node
)
21557 spec
= noexcept_false_spec
;
21560 spec
= noexcept_false_spec
;
21562 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21565 FOR_EACH_CLONE (clone
, fn
)
21567 if (TREE_TYPE (clone
) == fntype
)
21568 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21570 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21574 /* Produce the definition of D, a _DECL generated from a template. If
21575 DEFER_OK is nonzero, then we don't have to actually do the
21576 instantiation now; we just have to do it sometime. Normally it is
21577 an error if this is an explicit instantiation but D is undefined.
21578 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21579 explicitly instantiated class template. */
21582 instantiate_decl (tree d
, int defer_ok
,
21583 bool expl_inst_class_mem_p
)
21585 tree tmpl
= DECL_TI_TEMPLATE (d
);
21592 bool pattern_defined
;
21593 location_t saved_loc
= input_location
;
21594 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21595 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21599 bool nested
= false;
21601 /* This function should only be used to instantiate templates for
21602 functions and static member variables. */
21603 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21605 /* A concept is never instantiated. */
21606 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21608 /* Variables are never deferred; if instantiation is required, they
21609 are instantiated right away. That allows for better code in the
21610 case that an expression refers to the value of the variable --
21611 if the variable has a constant value the referring expression can
21612 take advantage of that fact. */
21614 || DECL_DECLARED_CONSTEXPR_P (d
))
21617 /* Don't instantiate cloned functions. Instead, instantiate the
21618 functions they cloned. */
21619 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21620 d
= DECL_CLONED_FUNCTION (d
);
21622 if (DECL_TEMPLATE_INSTANTIATED (d
)
21623 || (TREE_CODE (d
) == FUNCTION_DECL
21624 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21625 || DECL_TEMPLATE_SPECIALIZATION (d
))
21626 /* D has already been instantiated or explicitly specialized, so
21627 there's nothing for us to do here.
21629 It might seem reasonable to check whether or not D is an explicit
21630 instantiation, and, if so, stop here. But when an explicit
21631 instantiation is deferred until the end of the compilation,
21632 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21633 the instantiation. */
21636 /* Check to see whether we know that this template will be
21637 instantiated in some other file, as with "extern template"
21639 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21641 /* In general, we do not instantiate such templates. */
21642 if (external_p
&& !always_instantiate_p (d
))
21645 gen_tmpl
= most_general_template (tmpl
);
21646 gen_args
= impartial_args (tmpl
, DECL_TI_ARGS (d
));
21648 if (tmpl
!= gen_tmpl
)
21649 /* We should already have the extra args. */
21650 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21651 == TMPL_ARGS_DEPTH (gen_args
));
21652 /* And what's in the hash table should match D. */
21653 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21654 || spec
== NULL_TREE
);
21656 /* This needs to happen before any tsubsting. */
21657 if (! push_tinst_level (d
))
21660 timevar_push (TV_TEMPLATE_INST
);
21662 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21663 for the instantiation. */
21664 td
= template_for_substitution (d
);
21665 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21667 /* We should never be trying to instantiate a member of a class
21668 template or partial specialization. */
21669 gcc_assert (d
!= code_pattern
);
21671 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21672 || DECL_TEMPLATE_SPECIALIZATION (td
))
21673 /* In the case of a friend template whose definition is provided
21674 outside the class, we may have too many arguments. Drop the
21675 ones we don't need. The same is true for specializations. */
21676 args
= get_innermost_template_args
21677 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21681 if (TREE_CODE (d
) == FUNCTION_DECL
)
21683 deleted_p
= DECL_DELETED_FN (code_pattern
);
21684 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21685 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21691 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21694 /* We may be in the middle of deferred access check. Disable it now. */
21695 push_deferring_access_checks (dk_no_deferred
);
21697 /* Unless an explicit instantiation directive has already determined
21698 the linkage of D, remember that a definition is available for
21700 if (pattern_defined
21701 && !DECL_INTERFACE_KNOWN (d
)
21702 && !DECL_NOT_REALLY_EXTERN (d
))
21703 mark_definable (d
);
21705 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21706 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21707 input_location
= DECL_SOURCE_LOCATION (d
);
21709 /* If D is a member of an explicitly instantiated class template,
21710 and no definition is available, treat it like an implicit
21712 if (!pattern_defined
&& expl_inst_class_mem_p
21713 && DECL_EXPLICIT_INSTANTIATION (d
))
21715 /* Leave linkage flags alone on instantiations with anonymous
21717 if (TREE_PUBLIC (d
))
21719 DECL_NOT_REALLY_EXTERN (d
) = 0;
21720 DECL_INTERFACE_KNOWN (d
) = 0;
21722 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21725 /* Defer all other templates, unless we have been explicitly
21726 forbidden from doing so. */
21727 if (/* If there is no definition, we cannot instantiate the
21730 /* If it's OK to postpone instantiation, do so. */
21732 /* If this is a static data member that will be defined
21733 elsewhere, we don't want to instantiate the entire data
21734 member, but we do want to instantiate the initializer so that
21735 we can substitute that elsewhere. */
21736 || (external_p
&& VAR_P (d
))
21737 /* Handle here a deleted function too, avoid generating
21738 its body (c++/61080). */
21741 /* The definition of the static data member is now required so
21742 we must substitute the initializer. */
21744 && !DECL_INITIAL (d
)
21745 && DECL_INITIAL (code_pattern
))
21749 bool const_init
= false;
21750 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21752 ns
= decl_namespace_context (d
);
21753 push_nested_namespace (ns
);
21755 push_nested_class (DECL_CONTEXT (d
));
21756 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21758 tf_warning_or_error
, NULL_TREE
,
21759 /*integral_constant_expression_p=*/false);
21760 /* If instantiating the initializer involved instantiating this
21761 again, don't call cp_finish_decl twice. */
21762 if (!DECL_INITIAL (d
))
21764 /* Make sure the initializer is still constant, in case of
21765 circular dependency (template/instantiate6.C). */
21767 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21768 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21769 /*asmspec_tree=*/NULL_TREE
,
21770 LOOKUP_ONLYCONVERTING
);
21773 pop_nested_class ();
21774 pop_nested_namespace (ns
);
21777 /* We restore the source position here because it's used by
21778 add_pending_template. */
21779 input_location
= saved_loc
;
21781 if (at_eof
&& !pattern_defined
21782 && DECL_EXPLICIT_INSTANTIATION (d
)
21783 && DECL_NOT_REALLY_EXTERN (d
))
21786 The definition of a non-exported function template, a
21787 non-exported member function template, or a non-exported
21788 member function or static data member of a class template
21789 shall be present in every translation unit in which it is
21790 explicitly instantiated. */
21791 permerror (input_location
, "explicit instantiation of %qD "
21792 "but no definition available", d
);
21794 /* If we're in unevaluated context, we just wanted to get the
21795 constant value; this isn't an odr use, so don't queue
21796 a full instantiation. */
21797 if (cp_unevaluated_operand
!= 0)
21799 /* ??? Historically, we have instantiated inline functions, even
21800 when marked as "extern template". */
21801 if (!(external_p
&& VAR_P (d
)))
21802 add_pending_template (d
);
21805 /* Tell the repository that D is available in this translation unit
21806 -- and see if it is supposed to be instantiated here. */
21807 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21809 /* In a PCH file, despite the fact that the repository hasn't
21810 requested instantiation in the PCH it is still possible that
21811 an instantiation will be required in a file that includes the
21814 add_pending_template (d
);
21815 /* Instantiate inline functions so that the inliner can do its
21816 job, even though we'll not be emitting a copy of this
21818 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21822 fn_context
= decl_function_context (d
);
21823 nested
= (current_function_decl
!= NULL_TREE
);
21824 vec
<tree
> omp_privatization_save
;
21826 save_omp_privatization_clauses (omp_privatization_save
);
21829 push_to_top_level ();
21833 push_function_context ();
21834 cp_unevaluated_operand
= 0;
21835 c_inhibit_evaluation_warnings
= 0;
21838 /* Mark D as instantiated so that recursive calls to
21839 instantiate_decl do not try to instantiate it again. */
21840 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21842 /* Regenerate the declaration in case the template has been modified
21843 by a subsequent redeclaration. */
21844 regenerate_decl_from_template (d
, td
);
21846 /* We already set the file and line above. Reset them now in case
21847 they changed as a result of calling regenerate_decl_from_template. */
21848 input_location
= DECL_SOURCE_LOCATION (d
);
21853 bool const_init
= false;
21855 /* Clear out DECL_RTL; whatever was there before may not be right
21856 since we've reset the type of the declaration. */
21857 SET_DECL_RTL (d
, NULL
);
21858 DECL_IN_AGGR_P (d
) = 0;
21860 /* The initializer is placed in DECL_INITIAL by
21861 regenerate_decl_from_template so we don't need to
21862 push/pop_access_scope again here. Pull it out so that
21863 cp_finish_decl can process it. */
21864 init
= DECL_INITIAL (d
);
21865 DECL_INITIAL (d
) = NULL_TREE
;
21866 DECL_INITIALIZED_P (d
) = 0;
21868 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21869 initializer. That function will defer actual emission until
21870 we have a chance to determine linkage. */
21871 DECL_EXTERNAL (d
) = 0;
21873 /* Enter the scope of D so that access-checking works correctly. */
21874 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21876 push_nested_class (DECL_CONTEXT (d
));
21878 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21879 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21882 pop_nested_class ();
21884 if (variable_template_p (td
))
21885 note_variable_template_instantiation (d
);
21887 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21888 synthesize_method (d
);
21889 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21891 hash_map
<tree
, tree
> *saved_local_specializations
;
21895 tree block
= NULL_TREE
;
21897 /* Save away the current list, in case we are instantiating one
21898 template from within the body of another. */
21899 saved_local_specializations
= local_specializations
;
21901 /* Set up the list of local specializations. */
21902 local_specializations
= new hash_map
<tree
, tree
>;
21904 /* Set up context. */
21905 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21906 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21907 block
= push_stmt_list ();
21909 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21911 /* Some typedefs referenced from within the template code need to be
21912 access checked at template instantiation time, i.e now. These
21913 types were added to the template at parsing time. Let's get those
21914 and perform the access checks then. */
21915 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21918 /* Create substitution entries for the parameters. */
21919 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21920 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21921 spec_parm
= DECL_ARGUMENTS (d
);
21922 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21924 register_local_specialization (spec_parm
, tmpl_parm
);
21925 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21926 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21928 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21930 if (!DECL_PACK_P (tmpl_parm
))
21932 register_local_specialization (spec_parm
, tmpl_parm
);
21933 spec_parm
= DECL_CHAIN (spec_parm
);
21937 /* Register the (value) argument pack as a specialization of
21938 TMPL_PARM, then move on. */
21939 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
21940 register_local_specialization (argpack
, tmpl_parm
);
21943 gcc_assert (!spec_parm
);
21945 /* Substitute into the body of the function. */
21946 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21947 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
21948 tf_warning_or_error
, tmpl
);
21951 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
21952 tf_warning_or_error
, tmpl
,
21953 /*integral_constant_expression_p=*/false);
21955 /* Set the current input_location to the end of the function
21956 so that finish_function knows where we are. */
21958 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
21960 /* Remember if we saw an infinite loop in the template. */
21961 current_function_infinite_loop
21962 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
21965 /* We don't need the local specializations any more. */
21966 delete local_specializations
;
21967 local_specializations
= saved_local_specializations
;
21969 /* Finish the function. */
21970 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21971 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21972 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
21975 d
= finish_function (0);
21976 expand_or_defer_fn (d
);
21979 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
21980 cp_check_omp_declare_reduction (d
);
21983 /* We're not deferring instantiation any more. */
21984 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
21987 pop_from_top_level ();
21989 pop_function_context ();
21992 input_location
= saved_loc
;
21993 cp_unevaluated_operand
= saved_unevaluated_operand
;
21994 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
21995 pop_deferring_access_checks ();
21996 pop_tinst_level ();
21998 restore_omp_privatization_clauses (omp_privatization_save
);
22000 timevar_pop (TV_TEMPLATE_INST
);
22005 /* Run through the list of templates that we wish we could
22006 instantiate, and instantiate any we can. RETRIES is the
22007 number of times we retry pending template instantiation. */
22010 instantiate_pending_templates (int retries
)
22013 location_t saved_loc
= input_location
;
22015 /* Instantiating templates may trigger vtable generation. This in turn
22016 may require further template instantiations. We place a limit here
22017 to avoid infinite loop. */
22018 if (pending_templates
&& retries
>= max_tinst_depth
)
22020 tree decl
= pending_templates
->tinst
->decl
;
22022 fatal_error (input_location
,
22023 "template instantiation depth exceeds maximum of %d"
22024 " instantiating %q+D, possibly from virtual table generation"
22025 " (use -ftemplate-depth= to increase the maximum)",
22026 max_tinst_depth
, decl
);
22027 if (TREE_CODE (decl
) == FUNCTION_DECL
)
22028 /* Pretend that we defined it. */
22029 DECL_INITIAL (decl
) = error_mark_node
;
22035 struct pending_template
**t
= &pending_templates
;
22036 struct pending_template
*last
= NULL
;
22040 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
22041 bool complete
= false;
22043 if (TYPE_P (instantiation
))
22047 if (!COMPLETE_TYPE_P (instantiation
))
22049 instantiate_class_template (instantiation
);
22050 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
22051 for (fn
= TYPE_METHODS (instantiation
);
22053 fn
= TREE_CHAIN (fn
))
22054 if (! DECL_ARTIFICIAL (fn
))
22055 instantiate_decl (fn
,
22057 /*expl_inst_class_mem_p=*/false);
22058 if (COMPLETE_TYPE_P (instantiation
))
22062 complete
= COMPLETE_TYPE_P (instantiation
);
22066 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
22067 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
22070 = instantiate_decl (instantiation
,
22072 /*expl_inst_class_mem_p=*/false);
22073 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
22077 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
22078 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
22082 /* If INSTANTIATION has been instantiated, then we don't
22083 need to consider it again in the future. */
22091 current_tinst_level
= NULL
;
22093 last_pending_template
= last
;
22095 while (reconsider
);
22097 input_location
= saved_loc
;
22100 /* Substitute ARGVEC into T, which is a list of initializers for
22101 either base class or a non-static data member. The TREE_PURPOSEs
22102 are DECLs, and the TREE_VALUEs are the initializer values. Used by
22103 instantiate_decl. */
22106 tsubst_initializer_list (tree t
, tree argvec
)
22108 tree inits
= NULL_TREE
;
22110 for (; t
; t
= TREE_CHAIN (t
))
22114 tree expanded_bases
= NULL_TREE
;
22115 tree expanded_arguments
= NULL_TREE
;
22118 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
22123 /* Expand the base class expansion type into separate base
22125 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
22126 tf_warning_or_error
,
22128 if (expanded_bases
== error_mark_node
)
22131 /* We'll be building separate TREE_LISTs of arguments for
22133 len
= TREE_VEC_LENGTH (expanded_bases
);
22134 expanded_arguments
= make_tree_vec (len
);
22135 for (i
= 0; i
< len
; i
++)
22136 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
22138 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
22139 expand each argument in the TREE_VALUE of t. */
22140 expr
= make_node (EXPR_PACK_EXPANSION
);
22141 PACK_EXPANSION_LOCAL_P (expr
) = true;
22142 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
22143 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
22145 if (TREE_VALUE (t
) == void_type_node
)
22146 /* VOID_TYPE_NODE is used to indicate
22147 value-initialization. */
22149 for (i
= 0; i
< len
; i
++)
22150 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
22154 /* Substitute parameter packs into each argument in the
22156 in_base_initializer
= 1;
22157 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
22159 tree expanded_exprs
;
22161 /* Expand the argument. */
22162 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
22164 = tsubst_pack_expansion (expr
, argvec
,
22165 tf_warning_or_error
,
22167 if (expanded_exprs
== error_mark_node
)
22170 /* Prepend each of the expanded expressions to the
22171 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
22172 for (i
= 0; i
< len
; i
++)
22174 TREE_VEC_ELT (expanded_arguments
, i
) =
22175 tree_cons (NULL_TREE
,
22176 TREE_VEC_ELT (expanded_exprs
, i
),
22177 TREE_VEC_ELT (expanded_arguments
, i
));
22180 in_base_initializer
= 0;
22182 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
22183 since we built them backwards. */
22184 for (i
= 0; i
< len
; i
++)
22186 TREE_VEC_ELT (expanded_arguments
, i
) =
22187 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
22192 for (i
= 0; i
< len
; ++i
)
22194 if (expanded_bases
)
22196 decl
= TREE_VEC_ELT (expanded_bases
, i
);
22197 decl
= expand_member_init (decl
);
22198 init
= TREE_VEC_ELT (expanded_arguments
, i
);
22203 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
22204 tf_warning_or_error
, NULL_TREE
);
22206 decl
= expand_member_init (decl
);
22207 if (decl
&& !DECL_P (decl
))
22208 in_base_initializer
= 1;
22210 init
= TREE_VALUE (t
);
22212 if (init
!= void_type_node
)
22213 init
= tsubst_expr (init
, argvec
,
22214 tf_warning_or_error
, NULL_TREE
,
22215 /*integral_constant_expression_p=*/false);
22216 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
22217 /* If we had an initializer but it instantiated to nothing,
22218 value-initialize the object. This will only occur when
22219 the initializer was a pack expansion where the parameter
22220 packs used in that expansion were of length zero. */
22221 init
= void_type_node
;
22222 in_base_initializer
= 0;
22227 init
= build_tree_list (decl
, init
);
22228 TREE_CHAIN (init
) = inits
;
22236 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
22239 set_current_access_from_decl (tree decl
)
22241 if (TREE_PRIVATE (decl
))
22242 current_access_specifier
= access_private_node
;
22243 else if (TREE_PROTECTED (decl
))
22244 current_access_specifier
= access_protected_node
;
22246 current_access_specifier
= access_public_node
;
22249 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
22250 is the instantiation (which should have been created with
22251 start_enum) and ARGS are the template arguments to use. */
22254 tsubst_enum (tree tag
, tree newtag
, tree args
)
22258 if (SCOPED_ENUM_P (newtag
))
22259 begin_scope (sk_scoped_enum
, newtag
);
22261 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
22266 decl
= TREE_VALUE (e
);
22267 /* Note that in a template enum, the TREE_VALUE is the
22268 CONST_DECL, not the corresponding INTEGER_CST. */
22269 value
= tsubst_expr (DECL_INITIAL (decl
),
22270 args
, tf_warning_or_error
, NULL_TREE
,
22271 /*integral_constant_expression_p=*/true);
22273 /* Give this enumeration constant the correct access. */
22274 set_current_access_from_decl (decl
);
22276 /* Actually build the enumerator itself. Here we're assuming that
22277 enumerators can't have dependent attributes. */
22278 build_enumerator (DECL_NAME (decl
), value
, newtag
,
22279 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
22282 if (SCOPED_ENUM_P (newtag
))
22285 finish_enum_value_list (newtag
);
22286 finish_enum (newtag
);
22288 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
22289 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
22292 /* DECL is a FUNCTION_DECL that is a template specialization. Return
22293 its type -- but without substituting the innermost set of template
22294 arguments. So, innermost set of template parameters will appear in
22298 get_mostly_instantiated_function_type (tree decl
)
22300 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
22301 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
22304 /* Return truthvalue if we're processing a template different from
22305 the last one involved in diagnostics. */
22307 problematic_instantiation_changed (void)
22309 return current_tinst_level
!= last_error_tinst_level
;
22312 /* Remember current template involved in diagnostics. */
22314 record_last_problematic_instantiation (void)
22316 last_error_tinst_level
= current_tinst_level
;
22319 struct tinst_level
*
22320 current_instantiation (void)
22322 return current_tinst_level
;
22325 /* Return TRUE if current_function_decl is being instantiated, false
22329 instantiating_current_function_p (void)
22331 return (current_instantiation ()
22332 && current_instantiation ()->decl
== current_function_decl
);
22335 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22336 type. Return zero for ok, nonzero for disallowed. Issue error and
22337 warning messages under control of COMPLAIN. */
22340 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22342 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22344 else if (POINTER_TYPE_P (type
))
22346 else if (TYPE_PTRMEM_P (type
))
22348 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22350 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22352 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22354 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22356 /* A bound template template parm could later be instantiated to have a valid
22357 nontype parm type via an alias template. */
22358 else if (cxx_dialect
>= cxx11
22359 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22362 if (complain
& tf_error
)
22364 if (type
== error_mark_node
)
22365 inform (input_location
, "invalid template non-type parameter");
22367 error ("%q#T is not a valid type for a template non-type parameter",
22373 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22374 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22377 dependent_type_p_r (tree type
)
22383 A type is dependent if it is:
22385 -- a template parameter. Template template parameters are types
22386 for us (since TYPE_P holds true for them) so we handle
22388 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22389 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22391 /* -- a qualified-id with a nested-name-specifier which contains a
22392 class-name that names a dependent type or whose unqualified-id
22393 names a dependent type. */
22394 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22397 /* An alias template specialization can be dependent even if the
22398 resulting type is not. */
22399 if (dependent_alias_template_spec_p (type
))
22402 /* -- a cv-qualified type where the cv-unqualified type is
22404 No code is necessary for this bullet; the code below handles
22405 cv-qualified types, and we don't want to strip aliases with
22406 TYPE_MAIN_VARIANT because of DR 1558. */
22407 /* -- a compound type constructed from any dependent type. */
22408 if (TYPE_PTRMEM_P (type
))
22409 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22410 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22412 else if (TYPE_PTR_P (type
)
22413 || TREE_CODE (type
) == REFERENCE_TYPE
)
22414 return dependent_type_p (TREE_TYPE (type
));
22415 else if (TREE_CODE (type
) == FUNCTION_TYPE
22416 || TREE_CODE (type
) == METHOD_TYPE
)
22420 if (dependent_type_p (TREE_TYPE (type
)))
22422 for (arg_type
= TYPE_ARG_TYPES (type
);
22424 arg_type
= TREE_CHAIN (arg_type
))
22425 if (dependent_type_p (TREE_VALUE (arg_type
)))
22429 /* -- an array type constructed from any dependent type or whose
22430 size is specified by a constant expression that is
22433 We checked for type- and value-dependence of the bounds in
22434 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22435 if (TREE_CODE (type
) == ARRAY_TYPE
)
22437 if (TYPE_DOMAIN (type
)
22438 && dependent_type_p (TYPE_DOMAIN (type
)))
22440 return dependent_type_p (TREE_TYPE (type
));
22443 /* -- a template-id in which either the template name is a template
22445 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22447 /* ... or any of the template arguments is a dependent type or
22448 an expression that is type-dependent or value-dependent. */
22449 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22450 && (any_dependent_template_arguments_p
22451 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22454 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22455 dependent; if the argument of the `typeof' expression is not
22456 type-dependent, then it should already been have resolved. */
22457 if (TREE_CODE (type
) == TYPEOF_TYPE
22458 || TREE_CODE (type
) == DECLTYPE_TYPE
22459 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22462 /* A template argument pack is dependent if any of its packed
22464 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22466 tree args
= ARGUMENT_PACK_ARGS (type
);
22467 int i
, len
= TREE_VEC_LENGTH (args
);
22468 for (i
= 0; i
< len
; ++i
)
22469 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22473 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22474 be template parameters. */
22475 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22478 /* The standard does not specifically mention types that are local
22479 to template functions or local classes, but they should be
22480 considered dependent too. For example:
22482 template <int I> void f() {
22487 The size of `E' cannot be known until the value of `I' has been
22488 determined. Therefore, `E' must be considered dependent. */
22489 scope
= TYPE_CONTEXT (type
);
22490 if (scope
&& TYPE_P (scope
))
22491 return dependent_type_p (scope
);
22492 /* Don't use type_dependent_expression_p here, as it can lead
22493 to infinite recursion trying to determine whether a lambda
22494 nested in a lambda is dependent (c++/47687). */
22495 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22496 && DECL_LANG_SPECIFIC (scope
)
22497 && DECL_TEMPLATE_INFO (scope
)
22498 && (any_dependent_template_arguments_p
22499 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22502 /* Other types are non-dependent. */
22506 /* Returns TRUE if TYPE is dependent, in the sense of
22507 [temp.dep.type]. Note that a NULL type is considered dependent. */
22510 dependent_type_p (tree type
)
22512 /* If there are no template parameters in scope, then there can't be
22513 any dependent types. */
22514 if (!processing_template_decl
)
22516 /* If we are not processing a template, then nobody should be
22517 providing us with a dependent type. */
22519 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22523 /* If the type is NULL, we have not computed a type for the entity
22524 in question; in that case, the type is dependent. */
22528 /* Erroneous types can be considered non-dependent. */
22529 if (type
== error_mark_node
)
22532 /* If we have not already computed the appropriate value for TYPE,
22534 if (!TYPE_DEPENDENT_P_VALID (type
))
22536 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22537 TYPE_DEPENDENT_P_VALID (type
) = 1;
22540 return TYPE_DEPENDENT_P (type
);
22543 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22544 lookup. In other words, a dependent type that is not the current
22548 dependent_scope_p (tree scope
)
22550 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22551 && !currently_open_class (scope
));
22554 /* T is a SCOPE_REF; return whether we need to consider it
22555 instantiation-dependent so that we can check access at instantiation
22556 time even though we know which member it resolves to. */
22559 instantiation_dependent_scope_ref_p (tree t
)
22561 if (DECL_P (TREE_OPERAND (t
, 1))
22562 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22563 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22564 TREE_OPERAND (t
, 1)))
22570 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22571 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22574 /* Note that this predicate is not appropriate for general expressions;
22575 only constant expressions (that satisfy potential_constant_expression)
22576 can be tested for value dependence. */
22579 value_dependent_expression_p (tree expression
)
22581 if (!processing_template_decl
)
22584 /* A name declared with a dependent type. */
22585 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22588 switch (TREE_CODE (expression
))
22590 case IDENTIFIER_NODE
:
22591 /* A name that has not been looked up -- must be dependent. */
22594 case TEMPLATE_PARM_INDEX
:
22595 /* A non-type template parm. */
22599 /* A non-type template parm. */
22600 if (DECL_TEMPLATE_PARM_P (expression
))
22602 return value_dependent_expression_p (DECL_INITIAL (expression
));
22605 /* A constant with literal type and is initialized
22606 with an expression that is value-dependent.
22608 Note that a non-dependent parenthesized initializer will have
22609 already been replaced with its constant value, so if we see
22610 a TREE_LIST it must be dependent. */
22611 if (DECL_INITIAL (expression
)
22612 && decl_constant_var_p (expression
)
22613 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22614 /* cp_finish_decl doesn't fold reference initializers. */
22615 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22616 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22620 case DYNAMIC_CAST_EXPR
:
22621 case STATIC_CAST_EXPR
:
22622 case CONST_CAST_EXPR
:
22623 case REINTERPRET_CAST_EXPR
:
22625 /* These expressions are value-dependent if the type to which
22626 the cast occurs is dependent or the expression being casted
22627 is value-dependent. */
22629 tree type
= TREE_TYPE (expression
);
22631 if (dependent_type_p (type
))
22634 /* A functional cast has a list of operands. */
22635 expression
= TREE_OPERAND (expression
, 0);
22638 /* If there are no operands, it must be an expression such
22639 as "int()". This should not happen for aggregate types
22640 because it would form non-constant expressions. */
22641 gcc_assert (cxx_dialect
>= cxx11
22642 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22647 if (TREE_CODE (expression
) == TREE_LIST
)
22648 return any_value_dependent_elements_p (expression
);
22650 return value_dependent_expression_p (expression
);
22654 if (SIZEOF_EXPR_TYPE_P (expression
))
22655 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22659 /* A `sizeof' expression is value-dependent if the operand is
22660 type-dependent or is a pack expansion. */
22661 expression
= TREE_OPERAND (expression
, 0);
22662 if (PACK_EXPANSION_P (expression
))
22664 else if (TYPE_P (expression
))
22665 return dependent_type_p (expression
);
22666 return instantiation_dependent_expression_p (expression
);
22668 case AT_ENCODE_EXPR
:
22669 /* An 'encode' expression is value-dependent if the operand is
22671 expression
= TREE_OPERAND (expression
, 0);
22672 return dependent_type_p (expression
);
22674 case NOEXCEPT_EXPR
:
22675 expression
= TREE_OPERAND (expression
, 0);
22676 return instantiation_dependent_expression_p (expression
);
22679 /* All instantiation-dependent expressions should also be considered
22680 value-dependent. */
22681 return instantiation_dependent_scope_ref_p (expression
);
22683 case COMPONENT_REF
:
22684 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22685 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22687 case NONTYPE_ARGUMENT_PACK
:
22688 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22689 is value-dependent. */
22691 tree values
= ARGUMENT_PACK_ARGS (expression
);
22692 int i
, len
= TREE_VEC_LENGTH (values
);
22694 for (i
= 0; i
< len
; ++i
)
22695 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22703 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22704 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22705 || (type2
? dependent_type_p (type2
) : false));
22709 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22710 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22713 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22714 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22718 tree op
= TREE_OPERAND (expression
, 0);
22719 return (value_dependent_expression_p (op
)
22720 || has_value_dependent_address (op
));
22723 case REQUIRES_EXPR
:
22724 /* Treat all requires-expressions as value-dependent so
22725 we don't try to fold them. */
22729 return dependent_type_p (TREE_OPERAND (expression
, 0));
22733 tree fn
= get_callee_fndecl (expression
);
22735 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22737 nargs
= call_expr_nargs (expression
);
22738 for (i
= 0; i
< nargs
; ++i
)
22740 tree op
= CALL_EXPR_ARG (expression
, i
);
22741 /* In a call to a constexpr member function, look through the
22742 implicit ADDR_EXPR on the object argument so that it doesn't
22743 cause the call to be considered value-dependent. We also
22744 look through it in potential_constant_expression. */
22745 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22746 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22747 && TREE_CODE (op
) == ADDR_EXPR
)
22748 op
= TREE_OPERAND (op
, 0);
22749 if (value_dependent_expression_p (op
))
22755 case TEMPLATE_ID_EXPR
:
22756 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22758 return type_dependent_expression_p (expression
)
22759 || variable_concept_p (TREE_OPERAND (expression
, 0));
22765 if (dependent_type_p (TREE_TYPE (expression
)))
22767 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22768 if (value_dependent_expression_p (val
))
22774 /* Treat a GNU statement expression as dependent to avoid crashing
22775 under instantiate_non_dependent_expr; it can't be constant. */
22779 /* A constant expression is value-dependent if any subexpression is
22780 value-dependent. */
22781 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22783 case tcc_reference
:
22785 case tcc_comparison
:
22787 case tcc_expression
:
22790 int i
, len
= cp_tree_operand_length (expression
);
22792 for (i
= 0; i
< len
; i
++)
22794 tree t
= TREE_OPERAND (expression
, i
);
22796 /* In some cases, some of the operands may be missing.l
22797 (For example, in the case of PREDECREMENT_EXPR, the
22798 amount to increment by may be missing.) That doesn't
22799 make the expression dependent. */
22800 if (t
&& value_dependent_expression_p (t
))
22811 /* The expression is not value-dependent. */
22815 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22816 [temp.dep.expr]. Note that an expression with no type is
22817 considered dependent. Other parts of the compiler arrange for an
22818 expression with type-dependent subexpressions to have no type, so
22819 this function doesn't have to be fully recursive. */
22822 type_dependent_expression_p (tree expression
)
22824 if (!processing_template_decl
)
22827 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22830 /* An unresolved name is always dependent. */
22831 if (identifier_p (expression
)
22832 || TREE_CODE (expression
) == USING_DECL
22833 || TREE_CODE (expression
) == WILDCARD_DECL
)
22836 /* A fold expression is type-dependent. */
22837 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22838 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22839 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22840 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22843 /* Some expression forms are never type-dependent. */
22844 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22845 || TREE_CODE (expression
) == SIZEOF_EXPR
22846 || TREE_CODE (expression
) == ALIGNOF_EXPR
22847 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22848 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22849 || TREE_CODE (expression
) == TRAIT_EXPR
22850 || TREE_CODE (expression
) == TYPEID_EXPR
22851 || TREE_CODE (expression
) == DELETE_EXPR
22852 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22853 || TREE_CODE (expression
) == THROW_EXPR
22854 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22857 /* The types of these expressions depends only on the type to which
22858 the cast occurs. */
22859 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22860 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22861 || TREE_CODE (expression
) == CONST_CAST_EXPR
22862 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22863 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22864 || TREE_CODE (expression
) == CAST_EXPR
)
22865 return dependent_type_p (TREE_TYPE (expression
));
22867 /* The types of these expressions depends only on the type created
22868 by the expression. */
22869 if (TREE_CODE (expression
) == NEW_EXPR
22870 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22872 /* For NEW_EXPR tree nodes created inside a template, either
22873 the object type itself or a TREE_LIST may appear as the
22875 tree type
= TREE_OPERAND (expression
, 1);
22876 if (TREE_CODE (type
) == TREE_LIST
)
22877 /* This is an array type. We need to check array dimensions
22879 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22880 || value_dependent_expression_p
22881 (TREE_OPERAND (TREE_VALUE (type
), 1));
22883 return dependent_type_p (type
);
22886 if (TREE_CODE (expression
) == SCOPE_REF
)
22888 tree scope
= TREE_OPERAND (expression
, 0);
22889 tree name
= TREE_OPERAND (expression
, 1);
22891 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22892 contains an identifier associated by name lookup with one or more
22893 declarations declared with a dependent type, or...a
22894 nested-name-specifier or qualified-id that names a member of an
22895 unknown specialization. */
22896 return (type_dependent_expression_p (name
)
22897 || dependent_scope_p (scope
));
22900 /* A function template specialization is type-dependent if it has any
22901 dependent template arguments. */
22902 if (TREE_CODE (expression
) == FUNCTION_DECL
22903 && DECL_LANG_SPECIFIC (expression
)
22904 && DECL_TEMPLATE_INFO (expression
))
22905 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22907 if (TREE_CODE (expression
) == TEMPLATE_DECL
22908 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22911 if (TREE_CODE (expression
) == STMT_EXPR
)
22912 expression
= stmt_expr_value_expr (expression
);
22914 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22919 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22921 if (type_dependent_expression_p (elt
))
22927 /* A static data member of the current instantiation with incomplete
22928 array type is type-dependent, as the definition and specializations
22929 can have different bounds. */
22930 if (VAR_P (expression
)
22931 && DECL_CLASS_SCOPE_P (expression
)
22932 && dependent_type_p (DECL_CONTEXT (expression
))
22933 && VAR_HAD_UNKNOWN_BOUND (expression
))
22936 /* An array of unknown bound depending on a variadic parameter, eg:
22938 template<typename... Args>
22939 void foo (Args... args)
22941 int arr[] = { args... };
22944 template<int... vals>
22947 int arr[] = { vals... };
22950 If the array has no length and has an initializer, it must be that
22951 we couldn't determine its length in cp_complete_array_type because
22952 it is dependent. */
22953 if (VAR_P (expression
)
22954 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
22955 && !TYPE_DOMAIN (TREE_TYPE (expression
))
22956 && DECL_INITIAL (expression
))
22959 /* A variable template specialization is type-dependent if it has any
22960 dependent template arguments. */
22961 if (VAR_P (expression
)
22962 && DECL_LANG_SPECIFIC (expression
)
22963 && DECL_TEMPLATE_INFO (expression
)
22964 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
22965 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22967 /* Always dependent, on the number of arguments if nothing else. */
22968 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
22971 if (TREE_TYPE (expression
) == unknown_type_node
)
22973 if (TREE_CODE (expression
) == ADDR_EXPR
)
22974 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
22975 if (TREE_CODE (expression
) == COMPONENT_REF
22976 || TREE_CODE (expression
) == OFFSET_REF
)
22978 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22980 expression
= TREE_OPERAND (expression
, 1);
22981 if (identifier_p (expression
))
22984 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
22985 if (TREE_CODE (expression
) == SCOPE_REF
)
22988 if (BASELINK_P (expression
))
22990 if (BASELINK_OPTYPE (expression
)
22991 && dependent_type_p (BASELINK_OPTYPE (expression
)))
22993 expression
= BASELINK_FUNCTIONS (expression
);
22996 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
22998 if (any_dependent_template_arguments_p
22999 (TREE_OPERAND (expression
, 1)))
23001 expression
= TREE_OPERAND (expression
, 0);
23002 if (identifier_p (expression
))
23006 gcc_assert (TREE_CODE (expression
) == OVERLOAD
23007 || TREE_CODE (expression
) == FUNCTION_DECL
);
23011 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
23013 expression
= OVL_NEXT (expression
);
23018 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
23020 return (dependent_type_p (TREE_TYPE (expression
)));
23023 /* walk_tree callback function for instantiation_dependent_expression_p,
23024 below. Returns non-zero if a dependent subexpression is found. */
23027 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
23032 /* We don't have to worry about decltype currently because decltype
23033 of an instantiation-dependent expr is a dependent type. This
23034 might change depending on the resolution of DR 1172. */
23035 *walk_subtrees
= false;
23038 enum tree_code code
= TREE_CODE (*tp
);
23041 /* Don't treat an argument list as dependent just because it has no
23049 /* A constant with a dependent initializer is dependent. */
23050 if (value_dependent_expression_p (*tp
))
23054 case TEMPLATE_PARM_INDEX
:
23057 /* Handle expressions with type operands. */
23061 case AT_ENCODE_EXPR
:
23063 tree op
= TREE_OPERAND (*tp
, 0);
23064 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
23065 op
= TREE_TYPE (op
);
23068 if (dependent_type_p (op
))
23072 *walk_subtrees
= false;
23080 if (value_dependent_expression_p (*tp
))
23082 *walk_subtrees
= false;
23085 case COMPONENT_REF
:
23086 if (identifier_p (TREE_OPERAND (*tp
, 1)))
23087 /* In a template, finish_class_member_access_expr creates a
23088 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
23089 type-dependent, so that we can check access control at
23090 instantiation time (PR 42277). See also Core issue 1273. */
23095 if (instantiation_dependent_scope_ref_p (*tp
))
23100 /* Treat statement-expressions as dependent. */
23104 /* Treat requires-expressions as dependent. */
23105 case REQUIRES_EXPR
:
23109 /* Treat calls to function concepts as dependent. */
23110 if (function_concept_check_p (*tp
))
23114 case TEMPLATE_ID_EXPR
:
23115 /* And variable concepts. */
23116 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
23124 if (type_dependent_expression_p (*tp
))
23130 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
23131 sense defined by the ABI:
23133 "An expression is instantiation-dependent if it is type-dependent
23134 or value-dependent, or it has a subexpression that is type-dependent
23135 or value-dependent." */
23138 instantiation_dependent_expression_p (tree expression
)
23142 if (!processing_template_decl
)
23145 if (expression
== error_mark_node
)
23148 result
= cp_walk_tree_without_duplicates (&expression
,
23149 instantiation_dependent_r
, NULL
);
23150 return result
!= NULL_TREE
;
23153 /* Like type_dependent_expression_p, but it also works while not processing
23154 a template definition, i.e. during substitution or mangling. */
23157 type_dependent_expression_p_push (tree expr
)
23160 ++processing_template_decl
;
23161 b
= type_dependent_expression_p (expr
);
23162 --processing_template_decl
;
23166 /* Returns TRUE if ARGS contains a type-dependent expression. */
23169 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
23174 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
23176 if (type_dependent_expression_p (arg
))
23182 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23183 expressions) contains any type-dependent expressions. */
23186 any_type_dependent_elements_p (const_tree list
)
23188 for (; list
; list
= TREE_CHAIN (list
))
23189 if (type_dependent_expression_p (TREE_VALUE (list
)))
23195 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23196 expressions) contains any value-dependent expressions. */
23199 any_value_dependent_elements_p (const_tree list
)
23201 for (; list
; list
= TREE_CHAIN (list
))
23202 if (value_dependent_expression_p (TREE_VALUE (list
)))
23208 /* Returns TRUE if the ARG (a template argument) is dependent. */
23211 dependent_template_arg_p (tree arg
)
23213 if (!processing_template_decl
)
23216 /* Assume a template argument that was wrongly written by the user
23217 is dependent. This is consistent with what
23218 any_dependent_template_arguments_p [that calls this function]
23220 if (!arg
|| arg
== error_mark_node
)
23223 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
23224 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
23226 if (TREE_CODE (arg
) == TEMPLATE_DECL
23227 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
23228 return dependent_template_p (arg
);
23229 else if (ARGUMENT_PACK_P (arg
))
23231 tree args
= ARGUMENT_PACK_ARGS (arg
);
23232 int i
, len
= TREE_VEC_LENGTH (args
);
23233 for (i
= 0; i
< len
; ++i
)
23235 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
23241 else if (TYPE_P (arg
))
23242 return dependent_type_p (arg
);
23244 return (type_dependent_expression_p (arg
)
23245 || value_dependent_expression_p (arg
));
23248 /* Returns true if ARGS (a collection of template arguments) contains
23249 any types that require structural equality testing. */
23252 any_template_arguments_need_structural_equality_p (tree args
)
23259 if (args
== error_mark_node
)
23262 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23264 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23265 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23267 tree arg
= TREE_VEC_ELT (level
, j
);
23268 tree packed_args
= NULL_TREE
;
23271 if (ARGUMENT_PACK_P (arg
))
23273 /* Look inside the argument pack. */
23274 packed_args
= ARGUMENT_PACK_ARGS (arg
);
23275 len
= TREE_VEC_LENGTH (packed_args
);
23278 for (k
= 0; k
< len
; ++k
)
23281 arg
= TREE_VEC_ELT (packed_args
, k
);
23283 if (error_operand_p (arg
))
23285 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
23287 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
23289 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
23290 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
23299 /* Returns true if ARGS (a collection of template arguments) contains
23300 any dependent arguments. */
23303 any_dependent_template_arguments_p (const_tree args
)
23310 if (args
== error_mark_node
)
23313 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23315 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23316 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23317 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23324 /* Returns TRUE if the template TMPL is dependent. */
23327 dependent_template_p (tree tmpl
)
23329 if (TREE_CODE (tmpl
) == OVERLOAD
)
23333 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23335 tmpl
= OVL_NEXT (tmpl
);
23340 /* Template template parameters are dependent. */
23341 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23342 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23344 /* So are names that have not been looked up. */
23345 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23347 /* So are member templates of dependent classes. */
23348 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23349 return dependent_type_p (DECL_CONTEXT (tmpl
));
23353 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23356 dependent_template_id_p (tree tmpl
, tree args
)
23358 return (dependent_template_p (tmpl
)
23359 || any_dependent_template_arguments_p (args
));
23362 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23366 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23370 if (!processing_template_decl
)
23373 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23375 tree decl
= TREE_VEC_ELT (declv
, i
);
23376 tree init
= TREE_VEC_ELT (initv
, i
);
23377 tree cond
= TREE_VEC_ELT (condv
, i
);
23378 tree incr
= TREE_VEC_ELT (incrv
, i
);
23380 if (type_dependent_expression_p (decl
)
23381 || TREE_CODE (decl
) == SCOPE_REF
)
23384 if (init
&& type_dependent_expression_p (init
))
23387 if (type_dependent_expression_p (cond
))
23390 if (COMPARISON_CLASS_P (cond
)
23391 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23392 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23395 if (TREE_CODE (incr
) == MODOP_EXPR
)
23397 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23398 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23401 else if (type_dependent_expression_p (incr
))
23403 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23405 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23407 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23409 tree t
= TREE_OPERAND (incr
, 1);
23410 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23411 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23420 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23421 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23422 no such TYPE can be found. Note that this function peers inside
23423 uninstantiated templates and therefore should be used only in
23424 extremely limited situations. ONLY_CURRENT_P restricts this
23425 peering to the currently open classes hierarchy (which is required
23426 when comparing types). */
23429 resolve_typename_type (tree type
, bool only_current_p
)
23438 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23440 scope
= TYPE_CONTEXT (type
);
23441 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23442 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23443 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23444 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23445 identifier of the TYPENAME_TYPE anymore.
23446 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23447 TYPENAME_TYPE instead, we avoid messing up with a possible
23448 typedef variant case. */
23449 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23451 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23452 it first before we can figure out what NAME refers to. */
23453 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23455 if (TYPENAME_IS_RESOLVING_P (scope
))
23456 /* Given a class template A with a dependent base with nested type C,
23457 typedef typename A::C::C C will land us here, as trying to resolve
23458 the initial A::C leads to the local C typedef, which leads back to
23459 A::C::C. So we break the recursion now. */
23462 scope
= resolve_typename_type (scope
, only_current_p
);
23464 /* If we don't know what SCOPE refers to, then we cannot resolve the
23466 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23468 /* If the SCOPE is a template type parameter, we have no way of
23469 resolving the name. */
23470 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23472 /* If the SCOPE is not the current instantiation, there's no reason
23473 to look inside it. */
23474 if (only_current_p
&& !currently_open_class (scope
))
23476 /* If this is a typedef, we don't want to look inside (c++/11987). */
23477 if (typedef_variant_p (type
))
23479 /* If SCOPE isn't the template itself, it will not have a valid
23480 TYPE_FIELDS list. */
23481 if (CLASS_TYPE_P (scope
)
23482 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23483 /* scope is either the template itself or a compatible instantiation
23484 like X<T>, so look up the name in the original template. */
23485 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23487 /* scope is a partial instantiation, so we can't do the lookup or we
23488 will lose the template arguments. */
23490 /* Enter the SCOPE so that name lookup will be resolved as if we
23491 were in the class definition. In particular, SCOPE will no
23492 longer be considered a dependent type. */
23493 pushed_scope
= push_scope (scope
);
23494 /* Look up the declaration. */
23495 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23496 tf_warning_or_error
);
23498 result
= NULL_TREE
;
23500 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23501 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23504 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23505 && TREE_CODE (decl
) == TYPE_DECL
)
23507 result
= TREE_TYPE (decl
);
23508 if (result
== error_mark_node
)
23509 result
= NULL_TREE
;
23511 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23512 && DECL_CLASS_TEMPLATE_P (decl
))
23516 /* Obtain the template and the arguments. */
23517 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23518 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23519 /* Instantiate the template. */
23520 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23521 /*entering_scope=*/0,
23522 tf_error
| tf_user
);
23523 if (result
== error_mark_node
)
23524 result
= NULL_TREE
;
23527 /* Leave the SCOPE. */
23529 pop_scope (pushed_scope
);
23531 /* If we failed to resolve it, return the original typename. */
23535 /* If lookup found a typename type, resolve that too. */
23536 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23538 /* Ill-formed programs can cause infinite recursion here, so we
23539 must catch that. */
23540 TYPENAME_IS_RESOLVING_P (type
) = 1;
23541 result
= resolve_typename_type (result
, only_current_p
);
23542 TYPENAME_IS_RESOLVING_P (type
) = 0;
23545 /* Qualify the resulting type. */
23546 quals
= cp_type_quals (type
);
23548 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23553 /* EXPR is an expression which is not type-dependent. Return a proxy
23554 for EXPR that can be used to compute the types of larger
23555 expressions containing EXPR. */
23558 build_non_dependent_expr (tree expr
)
23562 /* When checking, try to get a constant value for all non-dependent
23563 expressions in order to expose bugs in *_dependent_expression_p
23565 if (flag_checking
&& cxx_dialect
>= cxx11
23566 /* Don't do this during nsdmi parsing as it can lead to
23567 unexpected recursive instantiations. */
23568 && !parsing_nsdmi ())
23569 fold_non_dependent_expr (expr
);
23571 /* Preserve OVERLOADs; the functions must be available to resolve
23574 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23575 inner_expr
= stmt_expr_value_expr (inner_expr
);
23576 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23577 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23578 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23579 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23580 if (is_overloaded_fn (inner_expr
)
23581 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23583 /* There is no need to return a proxy for a variable. */
23586 /* Preserve string constants; conversions from string constants to
23587 "char *" are allowed, even though normally a "const char *"
23588 cannot be used to initialize a "char *". */
23589 if (TREE_CODE (expr
) == STRING_CST
)
23591 /* Preserve void and arithmetic constants, as an optimization -- there is no
23592 reason to create a new node. */
23593 if (TREE_CODE (expr
) == VOID_CST
23594 || TREE_CODE (expr
) == INTEGER_CST
23595 || TREE_CODE (expr
) == REAL_CST
)
23597 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23598 There is at least one place where we want to know that a
23599 particular expression is a throw-expression: when checking a ?:
23600 expression, there are special rules if the second or third
23601 argument is a throw-expression. */
23602 if (TREE_CODE (expr
) == THROW_EXPR
)
23605 /* Don't wrap an initializer list, we need to be able to look inside. */
23606 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23609 /* Don't wrap a dummy object, we need to be able to test for it. */
23610 if (is_dummy_object (expr
))
23613 if (TREE_CODE (expr
) == COND_EXPR
)
23614 return build3 (COND_EXPR
,
23616 TREE_OPERAND (expr
, 0),
23617 (TREE_OPERAND (expr
, 1)
23618 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23619 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23620 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23621 if (TREE_CODE (expr
) == COMPOUND_EXPR
23622 && !COMPOUND_EXPR_OVERLOADED (expr
))
23623 return build2 (COMPOUND_EXPR
,
23625 TREE_OPERAND (expr
, 0),
23626 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23628 /* If the type is unknown, it can't really be non-dependent */
23629 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23631 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23632 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23635 /* ARGS is a vector of expressions as arguments to a function call.
23636 Replace the arguments with equivalent non-dependent expressions.
23637 This modifies ARGS in place. */
23640 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23645 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23647 tree newarg
= build_non_dependent_expr (arg
);
23649 (*args
)[ix
] = newarg
;
23653 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23654 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23655 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
23658 make_auto_1 (tree name
, bool set_canonical
)
23660 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23661 TYPE_NAME (au
) = build_decl (input_location
,
23662 TYPE_DECL
, name
, au
);
23663 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23664 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23665 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23666 TYPE_NAME (au
), NULL_TREE
);
23668 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23669 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23670 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23676 make_decltype_auto (void)
23678 return make_auto_1 (get_identifier ("decltype(auto)"), true);
23684 return make_auto_1 (get_identifier ("auto"), true);
23687 /* Make a "constrained auto" type-specifier. This is an
23688 auto type with constraints that must be associated after
23689 deduction. The constraint is formed from the given
23690 CONC and its optional sequence of arguments, which are
23691 non-null if written as partial-concept-id. */
23694 make_constrained_auto (tree con
, tree args
)
23696 tree type
= make_auto_1 (get_identifier ("auto"), false);
23698 /* Build the constraint. */
23699 tree tmpl
= DECL_TI_TEMPLATE (con
);
23702 expr
= build_concept_check (tmpl
, type
, args
);
23704 expr
= build_concept_check (build_overload (tmpl
, NULL_TREE
), type
, args
);
23706 tree constr
= make_predicate_constraint (expr
);
23707 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
23709 /* Our canonical type depends on the constraint. */
23710 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
23712 /* Attach the constraint to the type declaration. */
23713 tree decl
= TYPE_NAME (type
);
23717 /* Given type ARG, return std::initializer_list<ARG>. */
23722 tree std_init_list
= namespace_binding
23723 (get_identifier ("initializer_list"), std_node
);
23725 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23727 error ("deducing from brace-enclosed initializer list requires "
23728 "#include <initializer_list>");
23729 return error_mark_node
;
23731 argvec
= make_tree_vec (1);
23732 TREE_VEC_ELT (argvec
, 0) = arg
;
23733 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23734 NULL_TREE
, 0, tf_warning_or_error
);
23737 /* Replace auto in TYPE with std::initializer_list<auto>. */
23740 listify_autos (tree type
, tree auto_node
)
23742 tree init_auto
= listify (auto_node
);
23743 tree argvec
= make_tree_vec (1);
23744 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23745 if (processing_template_decl
)
23746 argvec
= add_to_template_args (current_template_args (), argvec
);
23747 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23750 /* Hash traits for hashing possibly constrained 'auto'
23751 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
23753 struct auto_hash
: default_hash_traits
<tree
>
23755 static inline hashval_t
hash (tree
);
23756 static inline bool equal (tree
, tree
);
23759 /* Hash the 'auto' T. */
23762 auto_hash::hash (tree t
)
23764 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
23765 /* Matching constrained-type-specifiers denote the same template
23766 parameter, so hash the constraint. */
23767 return hash_placeholder_constraint (c
);
23769 /* But unconstrained autos are all separate, so just hash the pointer. */
23770 return iterative_hash_object (t
, 0);
23773 /* Compare two 'auto's. */
23776 auto_hash::equal (tree t1
, tree t2
)
23781 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
23782 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
23784 /* Two unconstrained autos are distinct. */
23788 return equivalent_placeholder_constraints (c1
, c2
);
23791 /* for_each_template_parm callback for extract_autos: if t is a (possibly
23792 constrained) auto, add it to the vector. */
23795 extract_autos_r (tree t
, void *data
)
23797 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
23798 if (is_auto_or_concept (t
))
23800 /* All the autos were built with index 0; fix that up now. */
23801 tree
*p
= hash
.find_slot (t
, INSERT
);
23804 /* If this is a repeated constrained-type-specifier, use the index we
23806 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
23809 /* Otherwise this is new, so use the current count. */
23811 idx
= hash
.elements () - 1;
23813 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
23816 /* Always keep walking. */
23820 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
23821 says they can appear anywhere in the type. */
23824 extract_autos (tree type
)
23826 hash_set
<tree
> visited
;
23827 hash_table
<auto_hash
> hash (2);
23829 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
23831 tree tree_vec
= make_tree_vec (hash
.elements());
23832 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
23833 iter
!= hash
.end(); ++iter
)
23836 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
23837 TREE_VEC_ELT (tree_vec
, i
)
23838 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
23844 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23845 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23848 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23850 return do_auto_deduction (type
, init
, auto_node
,
23851 tf_warning_or_error
,
23855 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23856 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23857 The CONTEXT determines the context in which auto deduction is performed
23858 and is used to control error diagnostics. */
23861 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23862 tsubst_flags_t complain
, auto_deduction_context context
)
23866 if (init
== error_mark_node
)
23867 return error_mark_node
;
23869 if (type_dependent_expression_p (init
))
23870 /* Defining a subset of type-dependent expressions that we can deduce
23871 from ahead of time isn't worth the trouble. */
23874 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23875 with either a new invented type template parameter U or, if the
23876 initializer is a braced-init-list (8.5.4), with
23877 std::initializer_list<U>. */
23878 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23880 if (!DIRECT_LIST_INIT_P (init
))
23881 type
= listify_autos (type
, auto_node
);
23882 else if (CONSTRUCTOR_NELTS (init
) == 1)
23883 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23886 if (complain
& tf_warning_or_error
)
23888 if (permerror (input_location
, "direct-list-initialization of "
23889 "%<auto%> requires exactly one element"))
23890 inform (input_location
,
23891 "for deduction to %<std::initializer_list%>, use copy-"
23892 "list-initialization (i.e. add %<=%> before the %<{%>)");
23894 type
= listify_autos (type
, auto_node
);
23898 if (type
== error_mark_node
)
23899 return error_mark_node
;
23901 init
= resolve_nondeduced_context (init
, complain
);
23903 if (AUTO_IS_DECLTYPE (auto_node
))
23905 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23906 && !REF_PARENTHESIZED_P (init
)));
23907 targs
= make_tree_vec (1);
23908 TREE_VEC_ELT (targs
, 0)
23909 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23910 if (type
!= auto_node
)
23912 if (complain
& tf_error
)
23913 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23914 return error_mark_node
;
23919 tree parms
= build_tree_list (NULL_TREE
, type
);
23923 tparms
= extract_autos (type
);
23926 tparms
= make_tree_vec (1);
23927 TREE_VEC_ELT (tparms
, 0)
23928 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23931 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
23932 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23933 DEDUCE_CALL
, LOOKUP_NORMAL
,
23934 NULL
, /*explain_p=*/false);
23937 if (processing_template_decl
)
23938 /* Try again at instantiation time. */
23940 if (type
&& type
!= error_mark_node
23941 && (complain
& tf_error
))
23942 /* If type is error_mark_node a diagnostic must have been
23943 emitted by now. Also, having a mention to '<type error>'
23944 in the diagnostic is not really useful to the user. */
23946 if (cfun
&& auto_node
== current_function_auto_return_pattern
23947 && LAMBDA_FUNCTION_P (current_function_decl
))
23948 error ("unable to deduce lambda return type from %qE", init
);
23950 error ("unable to deduce %qT from %qE", type
, init
);
23951 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23952 DEDUCE_CALL
, LOOKUP_NORMAL
,
23953 NULL
, /*explain_p=*/true);
23955 return error_mark_node
;
23959 /* Check any placeholder constraints against the deduced type. */
23960 if (flag_concepts
&& !processing_template_decl
)
23961 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
23963 /* Use the deduced type to check the associated constraints. */
23964 if (!constraints_satisfied_p (constr
, targs
))
23966 if (complain
& tf_warning_or_error
)
23970 case adc_unspecified
:
23971 error("placeholder constraints not satisfied");
23973 case adc_variable_type
:
23974 error ("deduced initializer does not satisfy "
23975 "placeholder constraints");
23977 case adc_return_type
:
23978 error ("deduced return type does not satisfy "
23979 "placeholder constraints");
23981 case adc_requirement
:
23982 error ("deduced expression type does not saatisy "
23983 "placeholder constraints");
23986 diagnose_constraints (input_location
, constr
, targs
);
23988 return error_mark_node
;
23992 if (processing_template_decl
)
23993 targs
= add_to_template_args (current_template_args (), targs
);
23994 return tsubst (type
, targs
, complain
, NULL_TREE
);
23997 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
24001 splice_late_return_type (tree type
, tree late_return_type
)
24003 if (is_auto (type
))
24005 if (late_return_type
)
24006 return late_return_type
;
24008 tree idx
= get_template_parm_index (type
);
24009 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
24010 /* In an abbreviated function template we didn't know we were dealing
24011 with a function template when we saw the auto return type, so update
24012 it to have the correct level. */
24013 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
24018 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
24019 'decltype(auto)'. */
24022 is_auto (const_tree type
)
24024 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
24025 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
24026 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
24032 /* for_each_template_parm callback for type_uses_auto. */
24035 is_auto_r (tree tp
, void */
*data*/
)
24037 return is_auto_or_concept (tp
);
24040 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
24041 a use of `auto'. Returns NULL_TREE otherwise. */
24044 type_uses_auto (tree type
)
24046 if (type
== NULL_TREE
)
24048 else if (flag_concepts
)
24050 /* The Concepts TS allows multiple autos in one type-specifier; just
24051 return the first one we find, do_auto_deduction will collect all of
24053 if (uses_template_parms (type
))
24054 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
24055 /*visited*/NULL
, /*nondeduced*/true);
24060 return find_type_usage (type
, is_auto
);
24063 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
24064 'decltype(auto)' or a concept. */
24067 is_auto_or_concept (const_tree type
)
24069 return is_auto (type
); // or concept
24072 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
24073 a concept identifier) iff TYPE contains a use of a generic type. Returns
24074 NULL_TREE otherwise. */
24077 type_uses_auto_or_concept (tree type
)
24079 return find_type_usage (type
, is_auto_or_concept
);
24083 /* For a given template T, return the vector of typedefs referenced
24084 in T for which access check is needed at T instantiation time.
24085 T is either a FUNCTION_DECL or a RECORD_TYPE.
24086 Those typedefs were added to T by the function
24087 append_type_to_template_for_access_check. */
24089 vec
<qualified_typedef_usage_t
, va_gc
> *
24090 get_types_needing_access_check (tree t
)
24093 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
24095 if (!t
|| t
== error_mark_node
)
24098 if (!(ti
= get_template_info (t
)))
24101 if (CLASS_TYPE_P (t
)
24102 || TREE_CODE (t
) == FUNCTION_DECL
)
24104 if (!TI_TEMPLATE (ti
))
24107 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
24113 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
24114 tied to T. That list of typedefs will be access checked at
24115 T instantiation time.
24116 T is either a FUNCTION_DECL or a RECORD_TYPE.
24117 TYPE_DECL is a TYPE_DECL node representing a typedef.
24118 SCOPE is the scope through which TYPE_DECL is accessed.
24119 LOCATION is the location of the usage point of TYPE_DECL.
24121 This function is a subroutine of
24122 append_type_to_template_for_access_check. */
24125 append_type_to_template_for_access_check_1 (tree t
,
24128 location_t location
)
24130 qualified_typedef_usage_t typedef_usage
;
24133 if (!t
|| t
== error_mark_node
)
24136 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
24137 || CLASS_TYPE_P (t
))
24139 && TREE_CODE (type_decl
) == TYPE_DECL
24142 if (!(ti
= get_template_info (t
)))
24145 gcc_assert (TI_TEMPLATE (ti
));
24147 typedef_usage
.typedef_decl
= type_decl
;
24148 typedef_usage
.context
= scope
;
24149 typedef_usage
.locus
= location
;
24151 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
24154 /* Append TYPE_DECL to the template TEMPL.
24155 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
24156 At TEMPL instanciation time, TYPE_DECL will be checked to see
24157 if it can be accessed through SCOPE.
24158 LOCATION is the location of the usage point of TYPE_DECL.
24160 e.g. consider the following code snippet:
24167 template<class U> struct S
24169 C::myint mi; // <-- usage point of the typedef C::myint
24174 At S<char> instantiation time, we need to check the access of C::myint
24175 In other words, we need to check the access of the myint typedef through
24176 the C scope. For that purpose, this function will add the myint typedef
24177 and the scope C through which its being accessed to a list of typedefs
24178 tied to the template S. That list will be walked at template instantiation
24179 time and access check performed on each typedefs it contains.
24180 Note that this particular code snippet should yield an error because
24181 myint is private to C. */
24184 append_type_to_template_for_access_check (tree templ
,
24187 location_t location
)
24189 qualified_typedef_usage_t
*iter
;
24192 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
24194 /* Make sure we don't append the type to the template twice. */
24195 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
24196 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
24199 append_type_to_template_for_access_check_1 (templ
, type_decl
,
24203 /* Convert the generic type parameters in PARM that match the types given in the
24204 range [START_IDX, END_IDX) from the current_template_parms into generic type
24208 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
24210 tree current
= current_template_parms
;
24211 int depth
= TMPL_PARMS_DEPTH (current
);
24212 current
= INNERMOST_TEMPLATE_PARMS (current
);
24213 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
24215 for (int i
= 0; i
< start_idx
; ++i
)
24216 TREE_VEC_ELT (replacement
, i
)
24217 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24219 for (int i
= start_idx
; i
< end_idx
; ++i
)
24221 /* Create a distinct parameter pack type from the current parm and add it
24222 to the replacement args to tsubst below into the generic function
24225 tree o
= TREE_TYPE (TREE_VALUE
24226 (TREE_VEC_ELT (current
, i
)));
24227 tree t
= copy_type (o
);
24228 TEMPLATE_TYPE_PARM_INDEX (t
)
24229 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
24231 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
24232 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
24233 TYPE_MAIN_VARIANT (t
) = t
;
24234 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
24235 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
24236 TREE_VEC_ELT (replacement
, i
) = t
;
24237 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
24240 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
24241 TREE_VEC_ELT (replacement
, i
)
24242 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24244 /* If there are more levels then build up the replacement with the outer
24247 replacement
= add_to_template_args (template_parms_to_args
24248 (TREE_CHAIN (current_template_parms
)),
24251 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
24254 /* Entries in the decl_constraint hash table. */
24255 struct GTY((for_user
)) constr_entry
24261 /* Hashing function and equality for constraint entries. */
24262 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
24264 static hashval_t
hash (constr_entry
*e
)
24266 return (hashval_t
)DECL_UID (e
->decl
);
24269 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
24271 return e1
->decl
== e2
->decl
;
24275 /* A mapping from declarations to constraint information. Note that
24276 both templates and their underlying declarations are mapped to the
24277 same constraint information.
24279 FIXME: This is defined in pt.c because garbage collection
24280 code is not being generated for constraint.cc. */
24282 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
24284 /* Returns true iff cinfo contains a valid set of constraints.
24285 This is the case when the associated requirements have been
24286 successfully decomposed into lists of atomic constraints.
24287 That is, when the saved assumptions are not error_mark_node. */
24290 valid_constraints_p (tree cinfo
)
24292 gcc_assert (cinfo
);
24293 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
24296 /* Returns the template constraints of declaration T. If T is not
24297 constrained, return NULL_TREE. Note that T must be non-null. */
24300 get_constraints (tree t
)
24302 gcc_assert (DECL_P (t
));
24303 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24304 t
= DECL_TEMPLATE_RESULT (t
);
24305 constr_entry elt
= { t
, NULL_TREE
};
24306 constr_entry
* found
= decl_constraints
->find (&elt
);
24313 /* Associate the given constraint information CI with the declaration
24314 T. If T is a template, then the constraints are associated with
24315 its underlying declaration. Don't build associations if CI is
24319 set_constraints (tree t
, tree ci
)
24324 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24325 t
= DECL_TEMPLATE_RESULT (t
);
24326 gcc_assert (!get_constraints (t
));
24327 constr_entry elt
= {t
, ci
};
24328 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
24329 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
24334 /* Remove the associated constraints of the declaration T. */
24337 remove_constraints (tree t
)
24339 gcc_assert (DECL_P (t
));
24340 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24341 t
= DECL_TEMPLATE_RESULT (t
);
24343 constr_entry elt
= {t
, NULL_TREE
};
24344 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
24346 decl_constraints
->clear_slot (slot
);
24349 /* Set up the hash table for constraint association. */
24352 init_constraint_processing (void)
24354 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
24357 /* Set up the hash tables for template instantiations. */
24360 init_template_processing (void)
24362 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24363 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24366 /* Print stats about the template hash tables for -fstats. */
24369 print_template_statistics (void)
24371 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
24372 "%f collisions\n", (long) decl_specializations
->size (),
24373 (long) decl_specializations
->elements (),
24374 decl_specializations
->collisions ());
24375 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
24376 "%f collisions\n", (long) type_specializations
->size (),
24377 (long) type_specializations
->elements (),
24378 type_specializations
->collisions ());
24381 #include "gt-cp-pt.h"