1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2016 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
29 #include "coretypes.h"
32 #include "stringpool.h"
35 #include "stor-layout.h"
37 #include "c-family/c-objc.h"
38 #include "cp-objcp-common.h"
40 #include "tree-iterator.h"
41 #include "type-utils.h"
44 /* The type of functions taking a tree, and some additional data, and
46 typedef int (*tree_fn_t
) (tree
, void*);
48 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
49 instantiations have been deferred, either because their definitions
50 were not yet available, or because we were putting off doing the work. */
51 struct GTY ((chain_next ("%h.next"))) pending_template
{
52 struct pending_template
*next
;
53 struct tinst_level
*tinst
;
56 static GTY(()) struct pending_template
*pending_templates
;
57 static GTY(()) struct pending_template
*last_pending_template
;
59 int processing_template_parmlist
;
60 static int template_header_count
;
62 static GTY(()) tree saved_trees
;
63 static vec
<int> inline_parm_levels
;
65 static GTY(()) struct tinst_level
*current_tinst_level
;
67 static GTY(()) tree saved_access_scope
;
69 /* Live only within one (recursive) call to tsubst_expr. We use
70 this to pass the statement expression node from the STMT_EXPR
71 to the EXPR_STMT that is its result. */
72 static tree cur_stmt_expr
;
74 // -------------------------------------------------------------------------- //
75 // Local Specialization Stack
77 // Implementation of the RAII helper for creating new local
79 local_specialization_stack::local_specialization_stack ()
80 : saved (local_specializations
)
82 local_specializations
= new hash_map
<tree
, tree
>;
85 local_specialization_stack::~local_specialization_stack ()
87 delete local_specializations
;
88 local_specializations
= saved
;
91 /* True if we've recursed into fn_type_unification too many times. */
92 static bool excessive_deduction_depth
;
94 struct GTY((for_user
)) spec_entry
101 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
103 static hashval_t
hash (spec_entry
*);
104 static bool equal (spec_entry
*, spec_entry
*);
107 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
109 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
111 /* Contains canonical template parameter types. The vector is indexed by
112 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
113 TREE_LIST, whose TREE_VALUEs contain the canonical template
114 parameters of various types and levels. */
115 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
117 #define UNIFY_ALLOW_NONE 0
118 #define UNIFY_ALLOW_MORE_CV_QUAL 1
119 #define UNIFY_ALLOW_LESS_CV_QUAL 2
120 #define UNIFY_ALLOW_DERIVED 4
121 #define UNIFY_ALLOW_INTEGER 8
122 #define UNIFY_ALLOW_OUTER_LEVEL 16
123 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
124 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
126 enum template_base_result
{
128 tbr_ambiguous_baseclass
,
132 static void push_access_scope (tree
);
133 static void pop_access_scope (tree
);
134 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
135 unification_kind_t
, int,
137 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
138 unification_kind_t
, int, bool, bool);
139 static int unify (tree
, tree
, tree
, tree
, int, bool);
140 static void add_pending_template (tree
);
141 static tree
reopen_tinst_level (struct tinst_level
*);
142 static tree
tsubst_initializer_list (tree
, tree
);
143 static tree
get_partial_spec_bindings (tree
, tree
, tree
, tree
);
144 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
146 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
148 static void tsubst_enum (tree
, tree
, tree
);
149 static tree
add_to_template_args (tree
, tree
);
150 static tree
add_outermost_template_args (tree
, tree
);
151 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
152 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
154 static int type_unification_real (tree
, tree
, tree
, const tree
*,
155 unsigned int, int, unification_kind_t
, int,
156 vec
<deferred_access_check
, va_gc
> **,
158 static void note_template_header (int);
159 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
160 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
161 static tree
convert_template_argument (tree
, tree
, tree
,
162 tsubst_flags_t
, int, tree
);
163 static tree
for_each_template_parm (tree
, tree_fn_t
, void*,
164 hash_set
<tree
> *, bool);
165 static tree
expand_template_argument_pack (tree
);
166 static tree
build_template_parm_index (int, int, int, tree
, tree
);
167 static bool inline_needs_template_parms (tree
, bool);
168 static void push_inline_template_parms_recursive (tree
, int);
169 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
170 static int mark_template_parm (tree
, void *);
171 static int template_parm_this_level_p (tree
, void *);
172 static tree
tsubst_friend_function (tree
, tree
);
173 static tree
tsubst_friend_class (tree
, tree
);
174 static int can_complete_type_without_circularity (tree
);
175 static tree
get_bindings (tree
, tree
, tree
, bool);
176 static int template_decl_level (tree
);
177 static int check_cv_quals_for_unify (int, tree
, tree
);
178 static void template_parm_level_and_index (tree
, int*, int*);
179 static int unify_pack_expansion (tree
, tree
, tree
,
180 tree
, unification_kind_t
, bool, bool);
181 static tree
copy_template_args (tree
);
182 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
183 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
184 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
185 static void regenerate_decl_from_template (tree
, tree
);
186 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
187 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
188 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
189 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
190 static bool check_specialization_scope (void);
191 static tree
process_partial_specialization (tree
);
192 static void set_current_access_from_decl (tree
);
193 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
195 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
196 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
198 static bool template_template_parm_bindings_ok_p (tree
, tree
);
199 static int template_args_equal (tree
, tree
);
200 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
201 static tree
for_each_template_parm_r (tree
*, int *, void *);
202 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
203 static void copy_default_args_to_explicit_spec (tree
);
204 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
205 static bool dependent_template_arg_p (tree
);
206 static bool any_template_arguments_need_structural_equality_p (tree
);
207 static bool dependent_type_p_r (tree
);
208 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
209 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
210 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
211 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
213 static tree
listify (tree
);
214 static tree
listify_autos (tree
, tree
);
215 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
216 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
217 static bool complex_alias_template_p (const_tree tmpl
);
218 static tree
tsubst_attributes (tree
, tree
, tsubst_flags_t
, tree
);
220 /* Make the current scope suitable for access checking when we are
221 processing T. T can be FUNCTION_DECL for instantiated function
222 template, VAR_DECL for static member variable, or TYPE_DECL for
223 alias template (needed by instantiate_decl). */
226 push_access_scope (tree t
)
228 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
229 || TREE_CODE (t
) == TYPE_DECL
);
231 if (DECL_FRIEND_CONTEXT (t
))
232 push_nested_class (DECL_FRIEND_CONTEXT (t
));
233 else if (DECL_CLASS_SCOPE_P (t
))
234 push_nested_class (DECL_CONTEXT (t
));
236 push_to_top_level ();
238 if (TREE_CODE (t
) == FUNCTION_DECL
)
240 saved_access_scope
= tree_cons
241 (NULL_TREE
, current_function_decl
, saved_access_scope
);
242 current_function_decl
= t
;
246 /* Restore the scope set up by push_access_scope. T is the node we
250 pop_access_scope (tree t
)
252 if (TREE_CODE (t
) == FUNCTION_DECL
)
254 current_function_decl
= TREE_VALUE (saved_access_scope
);
255 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
258 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
261 pop_from_top_level ();
264 /* Do any processing required when DECL (a member template
265 declaration) is finished. Returns the TEMPLATE_DECL corresponding
266 to DECL, unless it is a specialization, in which case the DECL
267 itself is returned. */
270 finish_member_template_decl (tree decl
)
272 if (decl
== error_mark_node
)
273 return error_mark_node
;
275 gcc_assert (DECL_P (decl
));
277 if (TREE_CODE (decl
) == TYPE_DECL
)
281 type
= TREE_TYPE (decl
);
282 if (type
== error_mark_node
)
283 return error_mark_node
;
284 if (MAYBE_CLASS_TYPE_P (type
)
285 && CLASSTYPE_TEMPLATE_INFO (type
)
286 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
288 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
289 check_member_template (tmpl
);
294 else if (TREE_CODE (decl
) == FIELD_DECL
)
295 error ("data member %qD cannot be a member template", decl
);
296 else if (DECL_TEMPLATE_INFO (decl
))
298 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
300 check_member_template (DECL_TI_TEMPLATE (decl
));
301 return DECL_TI_TEMPLATE (decl
);
307 error ("invalid member template declaration %qD", decl
);
309 return error_mark_node
;
312 /* Create a template info node. */
315 build_template_info (tree template_decl
, tree template_args
)
317 tree result
= make_node (TEMPLATE_INFO
);
318 TI_TEMPLATE (result
) = template_decl
;
319 TI_ARGS (result
) = template_args
;
323 /* Return the template info node corresponding to T, whatever T is. */
326 get_template_info (const_tree t
)
328 tree tinfo
= NULL_TREE
;
330 if (!t
|| t
== error_mark_node
)
333 if (TREE_CODE (t
) == NAMESPACE_DECL
)
336 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
337 tinfo
= DECL_TEMPLATE_INFO (t
);
339 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
342 if (OVERLOAD_TYPE_P (t
))
343 tinfo
= TYPE_TEMPLATE_INFO (t
);
344 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
345 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
350 /* Returns the template nesting level of the indicated class TYPE.
360 A<T>::B<U> has depth two, while A<T> has depth one.
361 Both A<T>::B<int> and A<int>::B<U> have depth one, if
362 they are instantiations, not specializations.
364 This function is guaranteed to return 0 if passed NULL_TREE so
365 that, for example, `template_class_depth (current_class_type)' is
369 template_class_depth (tree type
)
374 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
375 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
376 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
378 tree tinfo
= get_template_info (type
);
380 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
381 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
388 /* Subroutine of maybe_begin_member_template_processing.
389 Returns true if processing DECL needs us to push template parms. */
392 inline_needs_template_parms (tree decl
, bool nsdmi
)
394 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
397 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
398 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
401 /* Subroutine of maybe_begin_member_template_processing.
402 Push the template parms in PARMS, starting from LEVELS steps into the
403 chain, and ending at the beginning, since template parms are listed
407 push_inline_template_parms_recursive (tree parmlist
, int levels
)
409 tree parms
= TREE_VALUE (parmlist
);
413 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
415 ++processing_template_decl
;
416 current_template_parms
417 = tree_cons (size_int (processing_template_decl
),
418 parms
, current_template_parms
);
419 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
421 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
423 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
425 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
427 if (error_operand_p (parm
))
430 gcc_assert (DECL_P (parm
));
432 switch (TREE_CODE (parm
))
440 /* Push the CONST_DECL. */
441 pushdecl (TEMPLATE_PARM_DECL (DECL_INITIAL (parm
)));
450 /* Restore the template parameter context for a member template, a
451 friend template defined in a class definition, or a non-template
452 member of template class. */
455 maybe_begin_member_template_processing (tree decl
)
459 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
463 tree ctx
= DECL_CONTEXT (decl
);
464 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
465 /* Disregard full specializations (c++/60999). */
466 && uses_template_parms (ctx
)
467 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
470 if (inline_needs_template_parms (decl
, nsdmi
))
472 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
473 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
475 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
478 parms
= TREE_CHAIN (parms
);
481 push_inline_template_parms_recursive (parms
, levels
);
484 /* Remember how many levels of template parameters we pushed so that
485 we can pop them later. */
486 inline_parm_levels
.safe_push (levels
);
489 /* Undo the effects of maybe_begin_member_template_processing. */
492 maybe_end_member_template_processing (void)
497 if (inline_parm_levels
.length () == 0)
500 last
= inline_parm_levels
.pop ();
501 for (i
= 0; i
< last
; ++i
)
503 --processing_template_decl
;
504 current_template_parms
= TREE_CHAIN (current_template_parms
);
509 /* Return a new template argument vector which contains all of ARGS,
510 but has as its innermost set of arguments the EXTRA_ARGS. */
513 add_to_template_args (tree args
, tree extra_args
)
520 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
523 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
524 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
526 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
527 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
529 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
530 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
535 /* Like add_to_template_args, but only the outermost ARGS are added to
536 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
537 (EXTRA_ARGS) levels are added. This function is used to combine
538 the template arguments from a partial instantiation with the
539 template arguments used to attain the full instantiation from the
540 partial instantiation. */
543 add_outermost_template_args (tree args
, tree extra_args
)
547 /* If there are more levels of EXTRA_ARGS than there are ARGS,
548 something very fishy is going on. */
549 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
551 /* If *all* the new arguments will be the EXTRA_ARGS, just return
553 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
556 /* For the moment, we make ARGS look like it contains fewer levels. */
557 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
559 new_args
= add_to_template_args (args
, extra_args
);
561 /* Now, we restore ARGS to its full dimensions. */
562 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
567 /* Return the N levels of innermost template arguments from the ARGS. */
570 get_innermost_template_args (tree args
, int n
)
578 /* If N is 1, just return the innermost set of template arguments. */
580 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
582 /* If we're not removing anything, just return the arguments we were
584 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
585 gcc_assert (extra_levels
>= 0);
586 if (extra_levels
== 0)
589 /* Make a new set of arguments, not containing the outer arguments. */
590 new_args
= make_tree_vec (n
);
591 for (i
= 1; i
<= n
; ++i
)
592 SET_TMPL_ARGS_LEVEL (new_args
, i
,
593 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
598 /* The inverse of get_innermost_template_args: Return all but the innermost
599 EXTRA_LEVELS levels of template arguments from the ARGS. */
602 strip_innermost_template_args (tree args
, int extra_levels
)
605 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
610 /* If N is 1, just return the outermost set of template arguments. */
612 return TMPL_ARGS_LEVEL (args
, 1);
614 /* If we're not removing anything, just return the arguments we were
616 gcc_assert (extra_levels
>= 0);
617 if (extra_levels
== 0)
620 /* Make a new set of arguments, not containing the inner arguments. */
621 new_args
= make_tree_vec (n
);
622 for (i
= 1; i
<= n
; ++i
)
623 SET_TMPL_ARGS_LEVEL (new_args
, i
,
624 TMPL_ARGS_LEVEL (args
, i
));
629 /* We've got a template header coming up; push to a new level for storing
633 begin_template_parm_list (void)
635 /* We use a non-tag-transparent scope here, which causes pushtag to
636 put tags in this scope, rather than in the enclosing class or
637 namespace scope. This is the right thing, since we want
638 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
639 global template class, push_template_decl handles putting the
640 TEMPLATE_DECL into top-level scope. For a nested template class,
643 template <class T> struct S1 {
644 template <class T> struct S2 {};
647 pushtag contains special code to call pushdecl_with_scope on the
648 TEMPLATE_DECL for S2. */
649 begin_scope (sk_template_parms
, NULL
);
650 ++processing_template_decl
;
651 ++processing_template_parmlist
;
652 note_template_header (0);
654 /* Add a dummy parameter level while we process the parameter list. */
655 current_template_parms
656 = tree_cons (size_int (processing_template_decl
),
658 current_template_parms
);
661 /* This routine is called when a specialization is declared. If it is
662 invalid to declare a specialization here, an error is reported and
663 false is returned, otherwise this routine will return true. */
666 check_specialization_scope (void)
668 tree scope
= current_scope ();
672 An explicit specialization shall be declared in the namespace of
673 which the template is a member, or, for member templates, in the
674 namespace of which the enclosing class or enclosing class
675 template is a member. An explicit specialization of a member
676 function, member class or static data member of a class template
677 shall be declared in the namespace of which the class template
679 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
681 error ("explicit specialization in non-namespace scope %qD", scope
);
687 In an explicit specialization declaration for a member of a class
688 template or a member template that appears in namespace scope,
689 the member template and some of its enclosing class templates may
690 remain unspecialized, except that the declaration shall not
691 explicitly specialize a class member template if its enclosing
692 class templates are not explicitly specialized as well. */
693 if (current_template_parms
)
695 error ("enclosing class templates are not explicitly specialized");
702 /* We've just seen template <>. */
705 begin_specialization (void)
707 begin_scope (sk_template_spec
, NULL
);
708 note_template_header (1);
709 return check_specialization_scope ();
712 /* Called at then end of processing a declaration preceded by
716 end_specialization (void)
719 reset_specialization ();
722 /* Any template <>'s that we have seen thus far are not referring to a
723 function specialization. */
726 reset_specialization (void)
728 processing_specialization
= 0;
729 template_header_count
= 0;
732 /* We've just seen a template header. If SPECIALIZATION is nonzero,
733 it was of the form template <>. */
736 note_template_header (int specialization
)
738 processing_specialization
= specialization
;
739 template_header_count
++;
742 /* We're beginning an explicit instantiation. */
745 begin_explicit_instantiation (void)
747 gcc_assert (!processing_explicit_instantiation
);
748 processing_explicit_instantiation
= true;
753 end_explicit_instantiation (void)
755 gcc_assert (processing_explicit_instantiation
);
756 processing_explicit_instantiation
= false;
759 /* An explicit specialization or partial specialization of TMPL is being
760 declared. Check that the namespace in which the specialization is
761 occurring is permissible. Returns false iff it is invalid to
762 specialize TMPL in the current namespace. */
765 check_specialization_namespace (tree tmpl
)
767 tree tpl_ns
= decl_namespace_context (tmpl
);
771 An explicit specialization shall be declared in the namespace of
772 which the template is a member, or, for member templates, in the
773 namespace of which the enclosing class or enclosing class
774 template is a member. An explicit specialization of a member
775 function, member class or static data member of a class template
776 shall be declared in the namespace of which the class template is
778 if (current_scope() != DECL_CONTEXT (tmpl
)
779 && !at_namespace_scope_p ())
781 error ("specialization of %qD must appear at namespace scope", tmpl
);
784 if (is_associated_namespace (current_namespace
, tpl_ns
))
785 /* Same or super-using namespace. */
789 permerror (input_location
,
790 "specialization of %qD in different namespace", tmpl
);
791 permerror (DECL_SOURCE_LOCATION (tmpl
),
792 " from definition of %q#D", tmpl
);
797 /* SPEC is an explicit instantiation. Check that it is valid to
798 perform this explicit instantiation in the current namespace. */
801 check_explicit_instantiation_namespace (tree spec
)
805 /* DR 275: An explicit instantiation shall appear in an enclosing
806 namespace of its template. */
807 ns
= decl_namespace_context (spec
);
808 if (!is_ancestor (current_namespace
, ns
))
809 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
810 "(which does not enclose namespace %qD)",
811 spec
, current_namespace
, ns
);
814 // Returns the type of a template specialization only if that
815 // specialization needs to be defined. Otherwise (e.g., if the type has
816 // already been defined), the function returns NULL_TREE.
818 maybe_new_partial_specialization (tree type
)
820 // An implicit instantiation of an incomplete type implies
821 // the definition of a new class template.
823 // template<typename T>
826 // template<typename T>
829 // Here, S<T*> is an implicit instantiation of S whose type
831 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
834 // It can also be the case that TYPE is a completed specialization.
835 // Continuing the previous example, suppose we also declare:
837 // template<typename T>
838 // requires Integral<T>
841 // Here, S<T*> refers to the specialization S<T*> defined
842 // above. However, we need to differentiate definitions because
843 // we intend to define a new partial specialization. In this case,
844 // we rely on the fact that the constraints are different for
845 // this declaration than that above.
847 // Note that we also get here for injected class names and
848 // late-parsed template definitions. We must ensure that we
849 // do not create new type declarations for those cases.
850 if (flag_concepts
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
852 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
853 tree args
= CLASSTYPE_TI_ARGS (type
);
855 // If there are no template parameters, this cannot be a new
856 // partial template specializtion?
857 if (!current_template_parms
)
860 // The injected-class-name is not a new partial specialization.
861 if (DECL_SELF_REFERENCE_P (TYPE_NAME (type
)))
864 // If the constraints are not the same as those of the primary
865 // then, we can probably create a new specialization.
866 tree type_constr
= current_template_constraints ();
868 if (type
== TREE_TYPE (tmpl
))
870 tree main_constr
= get_constraints (tmpl
);
871 if (equivalent_constraints (type_constr
, main_constr
))
875 // Also, if there's a pre-existing specialization with matching
876 // constraints, then this also isn't new.
877 tree specs
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
880 tree spec_tmpl
= TREE_VALUE (specs
);
881 tree spec_args
= TREE_PURPOSE (specs
);
882 tree spec_constr
= get_constraints (spec_tmpl
);
883 if (comp_template_args (args
, spec_args
)
884 && equivalent_constraints (type_constr
, spec_constr
))
886 specs
= TREE_CHAIN (specs
);
889 // Create a new type node (and corresponding type decl)
890 // for the newly declared specialization.
891 tree t
= make_class_type (TREE_CODE (type
));
892 CLASSTYPE_DECLARED_CLASS (t
) = CLASSTYPE_DECLARED_CLASS (type
);
893 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (type
);
894 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (tmpl
, args
));
896 /* We only need a separate type node for storing the definition of this
897 partial specialization; uses of S<T*> are unconstrained, so all are
898 equivalent. So keep TYPE_CANONICAL the same. */
899 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
901 // Build the corresponding type decl.
902 tree d
= create_implicit_typedef (DECL_NAME (tmpl
), t
);
903 DECL_CONTEXT (d
) = TYPE_CONTEXT (t
);
904 DECL_SOURCE_LOCATION (d
) = input_location
;
912 /* The TYPE is being declared. If it is a template type, that means it
913 is a partial specialization. Do appropriate error-checking. */
916 maybe_process_partial_specialization (tree type
)
920 if (type
== error_mark_node
)
921 return error_mark_node
;
923 /* A lambda that appears in specialization context is not itself a
925 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
928 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
930 error ("name of class shadows template template parameter %qD",
932 return error_mark_node
;
935 context
= TYPE_CONTEXT (type
);
937 if (TYPE_ALIAS_P (type
))
939 if (TYPE_TEMPLATE_INFO (type
)
940 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
941 error ("specialization of alias template %qD",
942 TYPE_TI_TEMPLATE (type
));
944 error ("explicit specialization of non-template %qT", type
);
945 return error_mark_node
;
947 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
949 /* This is for ordinary explicit specialization and partial
950 specialization of a template class such as:
952 template <> class C<int>;
956 template <class T> class C<T*>;
958 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
960 if (tree t
= maybe_new_partial_specialization (type
))
962 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (t
))
963 && !at_namespace_scope_p ())
964 return error_mark_node
;
965 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (t
);
966 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (t
)) = input_location
;
967 if (processing_template_decl
)
969 tree decl
= push_template_decl (TYPE_MAIN_DECL (t
));
970 if (decl
== error_mark_node
)
971 return error_mark_node
;
972 return TREE_TYPE (decl
);
975 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
976 error ("specialization of %qT after instantiation", type
);
977 else if (errorcount
&& !processing_specialization
978 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
979 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
980 /* Trying to define a specialization either without a template<> header
981 or in an inappropriate place. We've already given an error, so just
982 bail now so we don't actually define the specialization. */
983 return error_mark_node
;
985 else if (CLASS_TYPE_P (type
)
986 && !CLASSTYPE_USE_TEMPLATE (type
)
987 && CLASSTYPE_TEMPLATE_INFO (type
)
988 && context
&& CLASS_TYPE_P (context
)
989 && CLASSTYPE_TEMPLATE_INFO (context
))
991 /* This is for an explicit specialization of member class
992 template according to [temp.expl.spec/18]:
994 template <> template <class U> class C<int>::D;
996 The context `C<int>' must be an implicit instantiation.
997 Otherwise this is just a member class template declared
1000 template <> class C<int> { template <class U> class D; };
1001 template <> template <class U> class C<int>::D;
1003 In the first case, `C<int>::D' is a specialization of `C<T>::D'
1004 while in the second case, `C<int>::D' is a primary template
1005 and `C<T>::D' may not exist. */
1007 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
1008 && !COMPLETE_TYPE_P (type
))
1011 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
1013 if (current_namespace
1014 != decl_namespace_context (tmpl
))
1016 permerror (input_location
,
1017 "specializing %q#T in different namespace", type
);
1018 permerror (DECL_SOURCE_LOCATION (tmpl
),
1019 " from definition of %q#D", tmpl
);
1022 /* Check for invalid specialization after instantiation:
1024 template <> template <> class C<int>::D<int>;
1025 template <> template <class U> class C<int>::D; */
1027 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
1028 t
; t
= TREE_CHAIN (t
))
1030 tree inst
= TREE_VALUE (t
);
1031 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
1032 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
1034 /* We already have a full specialization of this partial
1035 instantiation, or a full specialization has been
1036 looked up but not instantiated. Reassign it to the
1037 new member specialization template. */
1041 elt
.tmpl
= most_general_template (tmpl
);
1042 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
1045 type_specializations
->remove_elt (&elt
);
1048 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
1051 = type_specializations
->find_slot (&elt
, INSERT
);
1052 entry
= ggc_alloc
<spec_entry
> ();
1057 /* But if we've had an implicit instantiation, that's a
1058 problem ([temp.expl.spec]/6). */
1059 error ("specialization %qT after instantiation %qT",
1063 /* Mark TYPE as a specialization. And as a result, we only
1064 have one level of template argument for the innermost
1066 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
1067 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
1068 CLASSTYPE_TI_ARGS (type
)
1069 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
1072 else if (processing_specialization
)
1074 /* Someday C++0x may allow for enum template specialization. */
1075 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
1076 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
1077 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
1078 "of %qD not allowed by ISO C++", type
);
1081 error ("explicit specialization of non-template %qT", type
);
1082 return error_mark_node
;
1089 /* Returns nonzero if we can optimize the retrieval of specializations
1090 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
1091 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
1094 optimize_specialization_lookup_p (tree tmpl
)
1096 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
1097 && DECL_CLASS_SCOPE_P (tmpl
)
1098 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
1100 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1101 /* The optimized lookup depends on the fact that the
1102 template arguments for the member function template apply
1103 purely to the containing class, which is not true if the
1104 containing class is an explicit or partial
1106 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1107 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1108 && !DECL_CONV_FN_P (tmpl
)
1109 /* It is possible to have a template that is not a member
1110 template and is not a member of a template class:
1112 template <typename T>
1113 struct S { friend A::f(); };
1115 Here, the friend function is a template, but the context does
1116 not have template information. The optimized lookup relies
1117 on having ARGS be the template arguments for both the class
1118 and the function template. */
1119 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1122 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1123 gone through coerce_template_parms by now. */
1126 verify_unstripped_args (tree args
)
1128 ++processing_template_decl
;
1129 if (!any_dependent_template_arguments_p (args
))
1131 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1132 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1134 tree arg
= TREE_VEC_ELT (inner
, i
);
1135 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1137 else if (TYPE_P (arg
))
1138 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1139 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1140 /* Allow typedefs on the type of a non-type argument, since a
1141 parameter can have them. */;
1143 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1146 --processing_template_decl
;
1149 /* Retrieve the specialization (in the sense of [temp.spec] - a
1150 specialization is either an instantiation or an explicit
1151 specialization) of TMPL for the given template ARGS. If there is
1152 no such specialization, return NULL_TREE. The ARGS are a vector of
1153 arguments, or a vector of vectors of arguments, in the case of
1154 templates with more than one level of parameters.
1156 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1157 then we search for a partial specialization matching ARGS. This
1158 parameter is ignored if TMPL is not a class template.
1160 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1161 result is a NONTYPE_ARGUMENT_PACK. */
1164 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1166 if (tmpl
== NULL_TREE
)
1169 if (args
== error_mark_node
)
1172 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1173 || TREE_CODE (tmpl
) == FIELD_DECL
);
1175 /* There should be as many levels of arguments as there are
1176 levels of parameters. */
1177 gcc_assert (TMPL_ARGS_DEPTH (args
)
1178 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1179 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1180 : template_class_depth (DECL_CONTEXT (tmpl
))));
1183 verify_unstripped_args (args
);
1185 if (optimize_specialization_lookup_p (tmpl
))
1187 tree class_template
;
1188 tree class_specialization
;
1189 vec
<tree
, va_gc
> *methods
;
1193 /* The template arguments actually apply to the containing
1194 class. Find the class specialization with those
1196 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1197 class_specialization
1198 = retrieve_specialization (class_template
, args
, 0);
1199 if (!class_specialization
)
1201 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1202 for the specialization. */
1203 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1206 /* Iterate through the methods with the indicated name, looking
1207 for the one that has an instance of TMPL. */
1208 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1209 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1211 tree fn
= OVL_CURRENT (fns
);
1212 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1213 /* using-declarations can add base methods to the method vec,
1214 and we don't want those here. */
1215 && DECL_CONTEXT (fn
) == class_specialization
)
1224 hash_table
<spec_hasher
> *specializations
;
1228 elt
.spec
= NULL_TREE
;
1230 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1231 specializations
= type_specializations
;
1233 specializations
= decl_specializations
;
1236 hash
= spec_hasher::hash (&elt
);
1237 found
= specializations
->find_with_hash (&elt
, hash
);
1245 /* Like retrieve_specialization, but for local declarations. */
1248 retrieve_local_specialization (tree tmpl
)
1250 if (local_specializations
== NULL
)
1253 tree
*slot
= local_specializations
->get (tmpl
);
1254 return slot
? *slot
: NULL_TREE
;
1257 /* Returns nonzero iff DECL is a specialization of TMPL. */
1260 is_specialization_of (tree decl
, tree tmpl
)
1264 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1268 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1274 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1276 for (t
= TREE_TYPE (decl
);
1278 t
= CLASSTYPE_USE_TEMPLATE (t
)
1279 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1280 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1287 /* Returns nonzero iff DECL is a specialization of friend declaration
1288 FRIEND_DECL according to [temp.friend]. */
1291 is_specialization_of_friend (tree decl
, tree friend_decl
)
1293 bool need_template
= true;
1296 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1297 || TREE_CODE (decl
) == TYPE_DECL
);
1299 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1300 of a template class, we want to check if DECL is a specialization
1302 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1303 && DECL_TEMPLATE_INFO (friend_decl
)
1304 && !DECL_USE_TEMPLATE (friend_decl
))
1306 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1307 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1308 need_template
= false;
1310 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1311 && !PRIMARY_TEMPLATE_P (friend_decl
))
1312 need_template
= false;
1314 /* There is nothing to do if this is not a template friend. */
1315 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1318 if (is_specialization_of (decl
, friend_decl
))
1322 A member of a class template may be declared to be a friend of a
1323 non-template class. In this case, the corresponding member of
1324 every specialization of the class template is a friend of the
1325 class granting friendship.
1327 For example, given a template friend declaration
1329 template <class T> friend void A<T>::f();
1331 the member function below is considered a friend
1333 template <> struct A<int> {
1337 For this type of template friend, TEMPLATE_DEPTH below will be
1338 nonzero. To determine if DECL is a friend of FRIEND, we first
1339 check if the enclosing class is a specialization of another. */
1341 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1343 && DECL_CLASS_SCOPE_P (decl
)
1344 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1345 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1347 /* Next, we check the members themselves. In order to handle
1348 a few tricky cases, such as when FRIEND_DECL's are
1350 template <class T> friend void A<T>::g(T t);
1351 template <class T> template <T t> friend void A<T>::h();
1355 void A<int>::g(int);
1356 template <int> void A<int>::h();
1358 we need to figure out ARGS, the template arguments from
1359 the context of DECL. This is required for template substitution
1360 of `T' in the function parameter of `g' and template parameter
1361 of `h' in the above examples. Here ARGS corresponds to `int'. */
1363 tree context
= DECL_CONTEXT (decl
);
1364 tree args
= NULL_TREE
;
1365 int current_depth
= 0;
1367 while (current_depth
< template_depth
)
1369 if (CLASSTYPE_TEMPLATE_INFO (context
))
1371 if (current_depth
== 0)
1372 args
= TYPE_TI_ARGS (context
);
1374 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1377 context
= TYPE_CONTEXT (context
);
1380 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1385 tree friend_args_type
;
1386 tree decl_args_type
;
1388 /* Make sure that both DECL and FRIEND_DECL are templates or
1390 is_template
= DECL_TEMPLATE_INFO (decl
)
1391 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1392 if (need_template
^ is_template
)
1394 else if (is_template
)
1396 /* If both are templates, check template parameter list. */
1398 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1400 if (!comp_template_parms
1401 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1405 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1408 decl_type
= TREE_TYPE (decl
);
1410 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1411 tf_none
, NULL_TREE
);
1412 if (friend_type
== error_mark_node
)
1415 /* Check if return types match. */
1416 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1419 /* Check if function parameter types match, ignoring the
1420 `this' parameter. */
1421 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1422 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1423 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1424 friend_args_type
= TREE_CHAIN (friend_args_type
);
1425 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1426 decl_args_type
= TREE_CHAIN (decl_args_type
);
1428 return compparms (decl_args_type
, friend_args_type
);
1432 /* DECL is a TYPE_DECL */
1434 tree decl_type
= TREE_TYPE (decl
);
1436 /* Make sure that both DECL and FRIEND_DECL are templates or
1439 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1440 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1442 if (need_template
^ is_template
)
1444 else if (is_template
)
1447 /* If both are templates, check the name of the two
1448 TEMPLATE_DECL's first because is_friend didn't. */
1449 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1450 != DECL_NAME (friend_decl
))
1453 /* Now check template parameter list. */
1455 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1457 return comp_template_parms
1458 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1462 return (DECL_NAME (decl
)
1463 == DECL_NAME (friend_decl
));
1469 /* Register the specialization SPEC as a specialization of TMPL with
1470 the indicated ARGS. IS_FRIEND indicates whether the specialization
1471 is actually just a friend declaration. Returns SPEC, or an
1472 equivalent prior declaration, if available.
1474 We also store instantiations of field packs in the hash table, even
1475 though they are not themselves templates, to make lookup easier. */
1478 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1482 spec_entry
**slot
= NULL
;
1485 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1486 || (TREE_CODE (tmpl
) == FIELD_DECL
1487 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1489 if (TREE_CODE (spec
) == FUNCTION_DECL
1490 && uses_template_parms (DECL_TI_ARGS (spec
)))
1491 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1492 register it; we want the corresponding TEMPLATE_DECL instead.
1493 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1494 the more obvious `uses_template_parms (spec)' to avoid problems
1495 with default function arguments. In particular, given
1496 something like this:
1498 template <class T> void f(T t1, T t = T())
1500 the default argument expression is not substituted for in an
1501 instantiation unless and until it is actually needed. */
1504 if (optimize_specialization_lookup_p (tmpl
))
1505 /* We don't put these specializations in the hash table, but we might
1506 want to give an error about a mismatch. */
1507 fn
= retrieve_specialization (tmpl
, args
, 0);
1515 hash
= spec_hasher::hash (&elt
);
1518 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1520 fn
= ((spec_entry
*) *slot
)->spec
;
1525 /* We can sometimes try to re-register a specialization that we've
1526 already got. In particular, regenerate_decl_from_template calls
1527 duplicate_decls which will update the specialization list. But,
1528 we'll still get called again here anyhow. It's more convenient
1529 to simply allow this than to try to prevent it. */
1532 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1534 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1536 if (DECL_ODR_USED (fn
)
1537 || DECL_EXPLICIT_INSTANTIATION (fn
))
1539 error ("specialization of %qD after instantiation",
1541 return error_mark_node
;
1546 /* This situation should occur only if the first
1547 specialization is an implicit instantiation, the
1548 second is an explicit specialization, and the
1549 implicit instantiation has not yet been used. That
1550 situation can occur if we have implicitly
1551 instantiated a member function and then specialized
1554 We can also wind up here if a friend declaration that
1555 looked like an instantiation turns out to be a
1558 template <class T> void foo(T);
1559 class S { friend void foo<>(int) };
1560 template <> void foo(int);
1562 We transform the existing DECL in place so that any
1563 pointers to it become pointers to the updated
1566 If there was a definition for the template, but not
1567 for the specialization, we want this to look as if
1568 there were no definition, and vice versa. */
1569 DECL_INITIAL (fn
) = NULL_TREE
;
1570 duplicate_decls (spec
, fn
, is_friend
);
1571 /* The call to duplicate_decls will have applied
1574 An explicit specialization of a function template
1575 is inline only if it is explicitly declared to be,
1576 and independently of whether its function template
1579 to the primary function; now copy the inline bits to
1580 the various clones. */
1581 FOR_EACH_CLONE (clone
, fn
)
1583 DECL_DECLARED_INLINE_P (clone
)
1584 = DECL_DECLARED_INLINE_P (fn
);
1585 DECL_SOURCE_LOCATION (clone
)
1586 = DECL_SOURCE_LOCATION (fn
);
1587 DECL_DELETED_FN (clone
)
1588 = DECL_DELETED_FN (fn
);
1590 check_specialization_namespace (tmpl
);
1595 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1597 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1598 /* Dup decl failed, but this is a new definition. Set the
1599 line number so any errors match this new
1601 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1607 return duplicate_decls (spec
, fn
, is_friend
);
1609 /* A specialization must be declared in the same namespace as the
1610 template it is specializing. */
1611 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1612 && !check_specialization_namespace (tmpl
))
1613 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1615 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1617 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1618 gcc_assert (tmpl
&& args
&& spec
);
1621 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1622 && PRIMARY_TEMPLATE_P (tmpl
)
1623 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1624 || variable_template_p (tmpl
))
1625 /* If TMPL is a forward declaration of a template function, keep a list
1626 of all specializations in case we need to reassign them to a friend
1627 template later in tsubst_friend_function.
1629 Also keep a list of all variable template instantiations so that
1630 process_partial_specialization can check whether a later partial
1631 specialization would have used it. */
1632 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1633 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1639 /* Returns true iff two spec_entry nodes are equivalent. */
1641 int comparing_specializations
;
1644 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1648 ++comparing_specializations
;
1649 equal
= (e1
->tmpl
== e2
->tmpl
1650 && comp_template_args (e1
->args
, e2
->args
));
1651 if (equal
&& flag_concepts
1652 /* tmpl could be a FIELD_DECL for a capture pack. */
1653 && TREE_CODE (e1
->tmpl
) == TEMPLATE_DECL
1654 && VAR_P (DECL_TEMPLATE_RESULT (e1
->tmpl
))
1655 && uses_template_parms (e1
->args
))
1657 /* Partial specializations of a variable template can be distinguished by
1659 tree c1
= e1
->spec
? get_constraints (e1
->spec
) : NULL_TREE
;
1660 tree c2
= e2
->spec
? get_constraints (e2
->spec
) : NULL_TREE
;
1661 equal
= equivalent_constraints (c1
, c2
);
1663 --comparing_specializations
;
1668 /* Returns a hash for a template TMPL and template arguments ARGS. */
1671 hash_tmpl_and_args (tree tmpl
, tree args
)
1673 hashval_t val
= iterative_hash_object (DECL_UID (tmpl
), 0);
1674 return iterative_hash_template_arg (args
, val
);
1677 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1681 spec_hasher::hash (spec_entry
*e
)
1683 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1686 /* Recursively calculate a hash value for a template argument ARG, for use
1687 in the hash tables of template specializations. */
1690 iterative_hash_template_arg (tree arg
, hashval_t val
)
1692 unsigned HOST_WIDE_INT i
;
1693 enum tree_code code
;
1696 if (arg
== NULL_TREE
)
1697 return iterative_hash_object (arg
, val
);
1702 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1703 /* We can get one of these when re-hashing a previous entry in the middle
1704 of substituting into a pack expansion. Just look through it. */
1705 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1707 code
= TREE_CODE (arg
);
1708 tclass
= TREE_CODE_CLASS (code
);
1710 val
= iterative_hash_object (code
, val
);
1717 case IDENTIFIER_NODE
:
1718 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1722 int i
, len
= TREE_VEC_LENGTH (arg
);
1723 for (i
= 0; i
< len
; ++i
)
1724 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1728 case TYPE_PACK_EXPANSION
:
1729 case EXPR_PACK_EXPANSION
:
1730 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1731 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1733 case TYPE_ARGUMENT_PACK
:
1734 case NONTYPE_ARGUMENT_PACK
:
1735 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1738 for (; arg
; arg
= TREE_CHAIN (arg
))
1739 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1743 for (; arg
; arg
= OVL_NEXT (arg
))
1744 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1750 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1751 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1753 val
= iterative_hash_template_arg (field
, val
);
1754 val
= iterative_hash_template_arg (value
, val
);
1760 if (!DECL_ARTIFICIAL (arg
))
1762 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1763 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1765 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1768 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1771 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1772 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1774 case TEMPLATE_PARM_INDEX
:
1775 val
= iterative_hash_template_arg
1776 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1777 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1778 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1781 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1782 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1783 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1786 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1788 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1792 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1793 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1794 val
= iterative_hash_object (code
, val
);
1795 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1798 /* A lambda can't appear in a template arg, but don't crash on
1800 gcc_assert (seen_error ());
1804 case IMPLICIT_CONV_EXPR
:
1805 case STATIC_CAST_EXPR
:
1806 case REINTERPRET_CAST_EXPR
:
1807 case CONST_CAST_EXPR
:
1808 case DYNAMIC_CAST_EXPR
:
1810 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1811 /* Now hash operands as usual. */
1821 if (alias_template_specialization_p (arg
))
1823 // We want an alias specialization that survived strip_typedefs
1824 // to hash differently from its TYPE_CANONICAL, to avoid hash
1825 // collisions that compare as different in template_args_equal.
1826 // These could be dependent specializations that strip_typedefs
1827 // left alone, or untouched specializations because
1828 // coerce_template_parms returns the unconverted template
1829 // arguments if it sees incomplete argument packs.
1830 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1831 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1833 if (TYPE_CANONICAL (arg
))
1834 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1836 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1837 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1838 /* Otherwise just compare the types during lookup. */
1841 case tcc_declaration
:
1843 return iterative_hash_expr (arg
, val
);
1846 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1848 unsigned n
= cp_tree_operand_length (arg
);
1849 for (i
= 0; i
< n
; ++i
)
1850 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1858 /* Unregister the specialization SPEC as a specialization of TMPL.
1859 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1860 if the SPEC was listed as a specialization of TMPL.
1862 Note that SPEC has been ggc_freed, so we can't look inside it. */
1865 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1870 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1871 elt
.args
= TI_ARGS (tinfo
);
1872 elt
.spec
= NULL_TREE
;
1874 entry
= decl_specializations
->find (&elt
);
1877 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1878 gcc_assert (new_spec
!= NULL_TREE
);
1879 entry
->spec
= new_spec
;
1886 /* Like register_specialization, but for local declarations. We are
1887 registering SPEC, an instantiation of TMPL. */
1890 register_local_specialization (tree spec
, tree tmpl
)
1892 local_specializations
->put (tmpl
, spec
);
1895 /* TYPE is a class type. Returns true if TYPE is an explicitly
1896 specialized class. */
1899 explicit_class_specialization_p (tree type
)
1901 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1903 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1906 /* Print the list of functions at FNS, going through all the overloads
1907 for each element of the list. Alternatively, FNS can not be a
1908 TREE_LIST, in which case it will be printed together with all the
1911 MORE and *STR should respectively be FALSE and NULL when the function
1912 is called from the outside. They are used internally on recursive
1913 calls. print_candidates manages the two parameters and leaves NULL
1914 in *STR when it ends. */
1917 print_candidates_1 (tree fns
, bool more
, const char **str
)
1920 char *spaces
= NULL
;
1922 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1923 if (TREE_CODE (fn
) == TREE_LIST
)
1925 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1926 print_candidates_1 (TREE_VALUE (fn2
),
1927 TREE_CHAIN (fn2
) || more
, str
);
1931 tree cand
= OVL_CURRENT (fn
);
1934 /* Pick the prefix string. */
1935 if (!more
&& !OVL_NEXT (fns
))
1937 inform (DECL_SOURCE_LOCATION (cand
),
1938 "candidate is: %#D", cand
);
1942 *str
= _("candidates are:");
1943 spaces
= get_spaces (*str
);
1945 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1946 *str
= spaces
? spaces
: *str
;
1956 /* Print the list of candidate FNS in an error message. FNS can also
1957 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1960 print_candidates (tree fns
)
1962 const char *str
= NULL
;
1963 print_candidates_1 (fns
, false, &str
);
1964 gcc_assert (str
== NULL
);
1967 /* Get a (possibly) constrained template declaration for the
1968 purpose of ordering candidates. */
1970 get_template_for_ordering (tree list
)
1972 gcc_assert (TREE_CODE (list
) == TREE_LIST
);
1973 tree f
= TREE_VALUE (list
);
1974 if (tree ti
= DECL_TEMPLATE_INFO (f
))
1975 return TI_TEMPLATE (ti
);
1979 /* Among candidates having the same signature, return the
1980 most constrained or NULL_TREE if there is no best candidate.
1981 If the signatures of candidates vary (e.g., template
1982 specialization vs. member function), then there can be no
1985 Note that we don't compare constraints on the functions
1986 themselves, but rather those of their templates. */
1988 most_constrained_function (tree candidates
)
1990 // Try to find the best candidate in a first pass.
1991 tree champ
= candidates
;
1992 for (tree c
= TREE_CHAIN (champ
); c
; c
= TREE_CHAIN (c
))
1994 int winner
= more_constrained (get_template_for_ordering (champ
),
1995 get_template_for_ordering (c
));
1997 champ
= c
; // The candidate is more constrained
1998 else if (winner
== 0)
1999 return NULL_TREE
; // Neither is more constrained
2002 // Verify that the champ is better than previous candidates.
2003 for (tree c
= candidates
; c
!= champ
; c
= TREE_CHAIN (c
)) {
2004 if (!more_constrained (get_template_for_ordering (champ
),
2005 get_template_for_ordering (c
)))
2013 /* Returns the template (one of the functions given by TEMPLATE_ID)
2014 which can be specialized to match the indicated DECL with the
2015 explicit template args given in TEMPLATE_ID. The DECL may be
2016 NULL_TREE if none is available. In that case, the functions in
2017 TEMPLATE_ID are non-members.
2019 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
2020 specialization of a member template.
2022 The TEMPLATE_COUNT is the number of references to qualifying
2023 template classes that appeared in the name of the function. See
2024 check_explicit_specialization for a more accurate description.
2026 TSK indicates what kind of template declaration (if any) is being
2027 declared. TSK_TEMPLATE indicates that the declaration given by
2028 DECL, though a FUNCTION_DECL, has template parameters, and is
2029 therefore a template function.
2031 The template args (those explicitly specified and those deduced)
2032 are output in a newly created vector *TARGS_OUT.
2034 If it is impossible to determine the result, an error message is
2035 issued. The error_mark_node is returned to indicate failure. */
2038 determine_specialization (tree template_id
,
2041 int need_member_template
,
2047 tree explicit_targs
;
2048 tree candidates
= NULL_TREE
;
2050 /* A TREE_LIST of templates of which DECL may be a specialization.
2051 The TREE_VALUE of each node is a TEMPLATE_DECL. The
2052 corresponding TREE_PURPOSE is the set of template arguments that,
2053 when used to instantiate the template, would produce a function
2054 with the signature of DECL. */
2055 tree templates
= NULL_TREE
;
2057 cp_binding_level
*b
;
2059 *targs_out
= NULL_TREE
;
2061 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
2062 return error_mark_node
;
2064 /* We shouldn't be specializing a member template of an
2065 unspecialized class template; we already gave an error in
2066 check_specialization_scope, now avoid crashing. */
2067 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
2068 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
2070 gcc_assert (errorcount
);
2071 return error_mark_node
;
2074 fns
= TREE_OPERAND (template_id
, 0);
2075 explicit_targs
= TREE_OPERAND (template_id
, 1);
2077 if (fns
== error_mark_node
)
2078 return error_mark_node
;
2080 /* Check for baselinks. */
2081 if (BASELINK_P (fns
))
2082 fns
= BASELINK_FUNCTIONS (fns
);
2084 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
2086 error ("%qD is not a function template", fns
);
2087 return error_mark_node
;
2089 else if (VAR_P (decl
) && !variable_template_p (fns
))
2091 error ("%qD is not a variable template", fns
);
2092 return error_mark_node
;
2095 /* Count the number of template headers specified for this
2098 for (b
= current_binding_level
;
2099 b
->kind
== sk_template_parms
;
2103 tree orig_fns
= fns
;
2105 if (variable_template_p (fns
))
2107 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
2108 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
2109 tf_warning_or_error
,
2110 /*req_all*/true, /*use_defarg*/true);
2111 if (targs
!= error_mark_node
)
2112 templates
= tree_cons (targs
, fns
, templates
);
2114 else for (; fns
; fns
= OVL_NEXT (fns
))
2116 tree fn
= OVL_CURRENT (fns
);
2118 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2120 tree decl_arg_types
;
2124 /* In case of explicit specialization, we need to check if
2125 the number of template headers appearing in the specialization
2126 is correct. This is usually done in check_explicit_specialization,
2127 but the check done there cannot be exhaustive when specializing
2128 member functions. Consider the following code:
2130 template <> void A<int>::f(int);
2131 template <> template <> void A<int>::f(int);
2133 Assuming that A<int> is not itself an explicit specialization
2134 already, the first line specializes "f" which is a non-template
2135 member function, whilst the second line specializes "f" which
2136 is a template member function. So both lines are syntactically
2137 correct, and check_explicit_specialization does not reject
2140 Here, we can do better, as we are matching the specialization
2141 against the declarations. We count the number of template
2142 headers, and we check if they match TEMPLATE_COUNT + 1
2143 (TEMPLATE_COUNT is the number of qualifying template classes,
2144 plus there must be another header for the member template
2147 Notice that if header_count is zero, this is not a
2148 specialization but rather a template instantiation, so there
2149 is no check we can perform here. */
2150 if (header_count
&& header_count
!= template_count
+ 1)
2153 /* Check that the number of template arguments at the
2154 innermost level for DECL is the same as for FN. */
2155 if (current_binding_level
->kind
== sk_template_parms
2156 && !current_binding_level
->explicit_spec_p
2157 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
2158 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
2159 (current_template_parms
))))
2162 /* DECL might be a specialization of FN. */
2163 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2164 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2166 /* For a non-static member function, we need to make sure
2167 that the const qualification is the same. Since
2168 get_bindings does not try to merge the "this" parameter,
2169 we must do the comparison explicitly. */
2170 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2171 && !same_type_p (TREE_VALUE (fn_arg_types
),
2172 TREE_VALUE (decl_arg_types
)))
2175 /* Skip the "this" parameter and, for constructors of
2176 classes with virtual bases, the VTT parameter. A
2177 full specialization of a constructor will have a VTT
2178 parameter, but a template never will. */
2180 = skip_artificial_parms_for (decl
, decl_arg_types
);
2182 = skip_artificial_parms_for (fn
, fn_arg_types
);
2184 /* Function templates cannot be specializations; there are
2185 no partial specializations of functions. Therefore, if
2186 the type of DECL does not match FN, there is no
2189 Note that it should never be the case that we have both
2190 candidates added here, and for regular member functions
2192 if (tsk
== tsk_template
)
2194 if (compparms (fn_arg_types
, decl_arg_types
))
2195 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2199 /* See whether this function might be a specialization of this
2200 template. Suppress access control because we might be trying
2201 to make this specialization a friend, and we have already done
2202 access control for the declaration of the specialization. */
2203 push_deferring_access_checks (dk_no_check
);
2204 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2205 pop_deferring_access_checks ();
2208 /* We cannot deduce template arguments that when used to
2209 specialize TMPL will produce DECL. */
2212 /* Remove, from the set of candidates, all those functions
2213 whose constraints are not satisfied. */
2214 if (flag_concepts
&& !constraints_satisfied_p (fn
, targs
))
2217 // Then, try to form the new function type.
2218 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2219 if (insttype
== error_mark_node
)
2222 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2223 if (!compparms (fn_arg_types
, decl_arg_types
))
2226 /* Save this template, and the arguments deduced. */
2227 templates
= tree_cons (targs
, fn
, templates
);
2229 else if (need_member_template
)
2230 /* FN is an ordinary member function, and we need a
2231 specialization of a member template. */
2233 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2234 /* We can get IDENTIFIER_NODEs here in certain erroneous
2237 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2238 /* This is just an ordinary non-member function. Nothing can
2239 be a specialization of that. */
2241 else if (DECL_ARTIFICIAL (fn
))
2242 /* Cannot specialize functions that are created implicitly. */
2246 tree decl_arg_types
;
2248 /* This is an ordinary member function. However, since
2249 we're here, we can assume its enclosing class is a
2250 template class. For example,
2252 template <typename T> struct S { void f(); };
2253 template <> void S<int>::f() {}
2255 Here, S<int>::f is a non-template, but S<int> is a
2256 template class. If FN has the same type as DECL, we
2257 might be in business. */
2259 if (!DECL_TEMPLATE_INFO (fn
))
2260 /* Its enclosing class is an explicit specialization
2261 of a template class. This is not a candidate. */
2264 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2265 TREE_TYPE (TREE_TYPE (fn
))))
2266 /* The return types differ. */
2269 /* Adjust the type of DECL in case FN is a static member. */
2270 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2271 if (DECL_STATIC_FUNCTION_P (fn
)
2272 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2273 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2275 if (!compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2279 // If the deduced arguments do not satisfy the constraints,
2280 // this is not a candidate.
2281 if (flag_concepts
&& !constraints_satisfied_p (fn
))
2284 // Add the candidate.
2285 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2289 if (templates
&& TREE_CHAIN (templates
))
2295 It is possible for a specialization with a given function
2296 signature to be instantiated from more than one function
2297 template. In such cases, explicit specification of the
2298 template arguments must be used to uniquely identify the
2299 function template specialization being specialized.
2301 Note that here, there's no suggestion that we're supposed to
2302 determine which of the candidate templates is most
2303 specialized. However, we, also have:
2307 Partial ordering of overloaded function template
2308 declarations is used in the following contexts to select
2309 the function template to which a function template
2310 specialization refers:
2312 -- when an explicit specialization refers to a function
2315 So, we do use the partial ordering rules, at least for now.
2316 This extension can only serve to make invalid programs valid,
2317 so it's safe. And, there is strong anecdotal evidence that
2318 the committee intended the partial ordering rules to apply;
2319 the EDG front end has that behavior, and John Spicer claims
2320 that the committee simply forgot to delete the wording in
2321 [temp.expl.spec]. */
2322 tree tmpl
= most_specialized_instantiation (templates
);
2323 if (tmpl
!= error_mark_node
)
2326 TREE_CHAIN (templates
) = NULL_TREE
;
2330 // Concepts allows multiple declarations of member functions
2331 // with the same signature. Like above, we need to rely on
2332 // on the partial ordering of those candidates to determine which
2334 if (flag_concepts
&& candidates
&& TREE_CHAIN (candidates
))
2336 if (tree cand
= most_constrained_function (candidates
))
2339 TREE_CHAIN (cand
) = NULL_TREE
;
2343 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2345 error ("template-id %qD for %q+D does not match any template "
2346 "declaration", template_id
, decl
);
2347 if (header_count
&& header_count
!= template_count
+ 1)
2348 inform (input_location
, "saw %d %<template<>%>, need %d for "
2349 "specializing a member function template",
2350 header_count
, template_count
+ 1);
2352 print_candidates (orig_fns
);
2353 return error_mark_node
;
2355 else if ((templates
&& TREE_CHAIN (templates
))
2356 || (candidates
&& TREE_CHAIN (candidates
))
2357 || (templates
&& candidates
))
2359 error ("ambiguous template specialization %qD for %q+D",
2361 candidates
= chainon (candidates
, templates
);
2362 print_candidates (candidates
);
2363 return error_mark_node
;
2366 /* We have one, and exactly one, match. */
2369 tree fn
= TREE_VALUE (candidates
);
2370 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2372 // Propagate the candidate's constraints to the declaration.
2373 set_constraints (decl
, get_constraints (fn
));
2375 /* DECL is a re-declaration or partial instantiation of a template
2377 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2379 /* It was a specialization of an ordinary member function in a
2381 return DECL_TI_TEMPLATE (fn
);
2384 /* It was a specialization of a template. */
2385 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2386 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2388 *targs_out
= copy_node (targs
);
2389 SET_TMPL_ARGS_LEVEL (*targs_out
,
2390 TMPL_ARGS_DEPTH (*targs_out
),
2391 TREE_PURPOSE (templates
));
2394 *targs_out
= TREE_PURPOSE (templates
);
2395 return TREE_VALUE (templates
);
2398 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2399 but with the default argument values filled in from those in the
2403 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2406 tree new_spec_types
;
2411 if (spec_types
== void_list_node
)
2412 return void_list_node
;
2414 /* Substitute into the rest of the list. */
2416 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2417 TREE_CHAIN (tmpl_types
));
2419 /* Add the default argument for this parameter. */
2420 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2421 TREE_VALUE (spec_types
),
2425 /* DECL is an explicit specialization. Replicate default arguments
2426 from the template it specializes. (That way, code like:
2428 template <class T> void f(T = 3);
2429 template <> void f(double);
2432 works, as required.) An alternative approach would be to look up
2433 the correct default arguments at the call-site, but this approach
2434 is consistent with how implicit instantiations are handled. */
2437 copy_default_args_to_explicit_spec (tree decl
)
2442 tree new_spec_types
;
2446 tree object_type
= NULL_TREE
;
2447 tree in_charge
= NULL_TREE
;
2448 tree vtt
= NULL_TREE
;
2450 /* See if there's anything we need to do. */
2451 tmpl
= DECL_TI_TEMPLATE (decl
);
2452 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2453 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2454 if (TREE_PURPOSE (t
))
2459 old_type
= TREE_TYPE (decl
);
2460 spec_types
= TYPE_ARG_TYPES (old_type
);
2462 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2464 /* Remove the this pointer, but remember the object's type for
2466 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2467 spec_types
= TREE_CHAIN (spec_types
);
2468 tmpl_types
= TREE_CHAIN (tmpl_types
);
2470 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2472 /* DECL may contain more parameters than TMPL due to the extra
2473 in-charge parameter in constructors and destructors. */
2474 in_charge
= spec_types
;
2475 spec_types
= TREE_CHAIN (spec_types
);
2477 if (DECL_HAS_VTT_PARM_P (decl
))
2480 spec_types
= TREE_CHAIN (spec_types
);
2484 /* Compute the merged default arguments. */
2486 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2488 /* Compute the new FUNCTION_TYPE. */
2492 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2497 /* Put the in-charge parameter back. */
2498 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2499 TREE_VALUE (in_charge
),
2502 new_type
= build_method_type_directly (object_type
,
2503 TREE_TYPE (old_type
),
2507 new_type
= build_function_type (TREE_TYPE (old_type
),
2509 new_type
= cp_build_type_attribute_variant (new_type
,
2510 TYPE_ATTRIBUTES (old_type
));
2511 new_type
= build_exception_variant (new_type
,
2512 TYPE_RAISES_EXCEPTIONS (old_type
));
2514 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2515 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2517 TREE_TYPE (decl
) = new_type
;
2520 /* Return the number of template headers we expect to see for a definition
2521 or specialization of CTYPE or one of its non-template members. */
2524 num_template_headers_for_class (tree ctype
)
2526 int num_templates
= 0;
2528 while (ctype
&& CLASS_TYPE_P (ctype
))
2530 /* You're supposed to have one `template <...>' for every
2531 template class, but you don't need one for a full
2532 specialization. For example:
2534 template <class T> struct S{};
2535 template <> struct S<int> { void f(); };
2536 void S<int>::f () {}
2538 is correct; there shouldn't be a `template <>' for the
2539 definition of `S<int>::f'. */
2540 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2541 /* If CTYPE does not have template information of any
2542 kind, then it is not a template, nor is it nested
2543 within a template. */
2545 if (explicit_class_specialization_p (ctype
))
2547 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2550 ctype
= TYPE_CONTEXT (ctype
);
2553 return num_templates
;
2556 /* Do a simple sanity check on the template headers that precede the
2557 variable declaration DECL. */
2560 check_template_variable (tree decl
)
2562 tree ctx
= CP_DECL_CONTEXT (decl
);
2563 int wanted
= num_template_headers_for_class (ctx
);
2564 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2565 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2567 if (cxx_dialect
< cxx14
)
2568 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2569 "variable templates only available with "
2570 "-std=c++14 or -std=gnu++14");
2572 // Namespace-scope variable templates should have a template header.
2575 if (template_header_count
> wanted
)
2577 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2578 "too many template headers for %D (should be %d)",
2580 if (warned
&& CLASS_TYPE_P (ctx
)
2581 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2582 inform (DECL_SOURCE_LOCATION (decl
),
2583 "members of an explicitly specialized class are defined "
2584 "without a template header");
2588 /* Check to see if the function just declared, as indicated in
2589 DECLARATOR, and in DECL, is a specialization of a function
2590 template. We may also discover that the declaration is an explicit
2591 instantiation at this point.
2593 Returns DECL, or an equivalent declaration that should be used
2594 instead if all goes well. Issues an error message if something is
2595 amiss. Returns error_mark_node if the error is not easily
2598 FLAGS is a bitmask consisting of the following flags:
2600 2: The function has a definition.
2601 4: The function is a friend.
2603 The TEMPLATE_COUNT is the number of references to qualifying
2604 template classes that appeared in the name of the function. For
2607 template <class T> struct S { void f(); };
2610 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2611 classes are not counted in the TEMPLATE_COUNT, so that in
2613 template <class T> struct S {};
2614 template <> struct S<int> { void f(); }
2615 template <> void S<int>::f();
2617 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2618 invalid; there should be no template <>.)
2620 If the function is a specialization, it is marked as such via
2621 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2622 is set up correctly, and it is added to the list of specializations
2623 for that template. */
2626 check_explicit_specialization (tree declarator
,
2631 int have_def
= flags
& 2;
2632 int is_friend
= flags
& 4;
2633 bool is_concept
= flags
& 8;
2634 int specialization
= 0;
2635 int explicit_instantiation
= 0;
2636 int member_specialization
= 0;
2637 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2638 tree dname
= DECL_NAME (decl
);
2643 if (!processing_specialization
)
2646 tsk
= tsk_excessive_parms
;
2649 tsk
= current_tmpl_spec_kind (template_count
);
2654 if (processing_specialization
&& !VAR_P (decl
))
2657 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2659 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2662 /* This could be something like:
2664 template <class T> void f(T);
2665 class S { friend void f<>(int); } */
2669 /* This case handles bogus declarations like template <>
2670 template <class T> void f<int>(); */
2672 error ("template-id %qD in declaration of primary template",
2679 case tsk_invalid_member_spec
:
2680 /* The error has already been reported in
2681 check_specialization_scope. */
2682 return error_mark_node
;
2684 case tsk_invalid_expl_inst
:
2685 error ("template parameter list used in explicit instantiation");
2691 error ("definition provided for explicit instantiation");
2693 explicit_instantiation
= 1;
2696 case tsk_excessive_parms
:
2697 case tsk_insufficient_parms
:
2698 if (tsk
== tsk_excessive_parms
)
2699 error ("too many template parameter lists in declaration of %qD",
2701 else if (template_header_count
)
2702 error("too few template parameter lists in declaration of %qD", decl
);
2704 error("explicit specialization of %qD must be introduced by "
2705 "%<template <>%>", decl
);
2710 error ("explicit specialization declared %<concept%>");
2712 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2713 /* In cases like template<> constexpr bool v = true;
2714 We'll give an error in check_template_variable. */
2717 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2719 member_specialization
= 1;
2725 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2727 /* This case handles bogus declarations like template <>
2728 template <class T> void f<int>(); */
2730 if (!uses_template_parms (declarator
))
2731 error ("template-id %qD in declaration of primary template",
2733 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2735 /* Partial specialization of variable template. */
2736 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2740 else if (cxx_dialect
< cxx14
)
2741 error ("non-type partial specialization %qD "
2742 "is not allowed", declarator
);
2744 error ("non-class, non-variable partial specialization %qD "
2745 "is not allowed", declarator
);
2750 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2751 /* This is a specialization of a member template, without
2752 specialization the containing class. Something like:
2754 template <class T> struct S {
2755 template <class U> void f (U);
2757 template <> template <class U> void S<int>::f(U) {}
2759 That's a specialization -- but of the entire template. */
2767 if ((specialization
|| member_specialization
)
2768 /* This doesn't apply to variable templates. */
2769 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2770 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2772 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2773 for (; t
; t
= TREE_CHAIN (t
))
2774 if (TREE_PURPOSE (t
))
2776 permerror (input_location
,
2777 "default argument specified in explicit specialization");
2782 if (specialization
|| member_specialization
|| explicit_instantiation
)
2784 tree tmpl
= NULL_TREE
;
2785 tree targs
= NULL_TREE
;
2786 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2788 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2789 if (!was_template_id
)
2793 gcc_assert (identifier_p (declarator
));
2798 /* If there is no class context, the explicit instantiation
2799 must be at namespace scope. */
2800 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2802 /* Find the namespace binding, using the declaration
2804 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2806 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2808 error ("%qD is not a template function", dname
);
2809 fns
= error_mark_node
;
2813 declarator
= lookup_template_function (fns
, NULL_TREE
);
2816 if (declarator
== error_mark_node
)
2817 return error_mark_node
;
2819 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2821 if (!explicit_instantiation
)
2822 /* A specialization in class scope. This is invalid,
2823 but the error will already have been flagged by
2824 check_specialization_scope. */
2825 return error_mark_node
;
2828 /* It's not valid to write an explicit instantiation in
2831 class C { template void f(); }
2833 This case is caught by the parser. However, on
2836 template class C { void f(); };
2838 (which is invalid) we can get here. The error will be
2845 else if (ctype
!= NULL_TREE
2846 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2848 // We'll match variable templates in start_decl.
2852 /* Find the list of functions in ctype that have the same
2853 name as the declared function. */
2854 tree name
= TREE_OPERAND (declarator
, 0);
2855 tree fns
= NULL_TREE
;
2858 if (constructor_name_p (name
, ctype
))
2860 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2862 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2863 : !CLASSTYPE_DESTRUCTORS (ctype
))
2865 /* From [temp.expl.spec]:
2867 If such an explicit specialization for the member
2868 of a class template names an implicitly-declared
2869 special member function (clause _special_), the
2870 program is ill-formed.
2872 Similar language is found in [temp.explicit]. */
2873 error ("specialization of implicitly-declared special member function");
2874 return error_mark_node
;
2877 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2880 if (!DECL_CONV_FN_P (decl
))
2882 idx
= lookup_fnfields_1 (ctype
, name
);
2884 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2888 vec
<tree
, va_gc
> *methods
;
2891 /* For a type-conversion operator, we cannot do a
2892 name-based lookup. We might be looking for `operator
2893 int' which will be a specialization of `operator T'.
2894 So, we find *all* the conversion operators, and then
2895 select from them. */
2898 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2900 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2901 methods
->iterate (idx
, &ovl
);
2904 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2905 /* There are no more conversion functions. */
2908 /* Glue all these conversion functions together
2909 with those we already have. */
2910 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2911 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2915 if (fns
== NULL_TREE
)
2917 error ("no member function %qD declared in %qT", name
, ctype
);
2918 return error_mark_node
;
2921 TREE_OPERAND (declarator
, 0) = fns
;
2924 /* Figure out what exactly is being specialized at this point.
2925 Note that for an explicit instantiation, even one for a
2926 member function, we cannot tell apriori whether the
2927 instantiation is for a member template, or just a member
2928 function of a template class. Even if a member template is
2929 being instantiated, the member template arguments may be
2930 elided if they can be deduced from the rest of the
2932 tmpl
= determine_specialization (declarator
, decl
,
2934 member_specialization
,
2938 if (!tmpl
|| tmpl
== error_mark_node
)
2939 /* We couldn't figure out what this declaration was
2941 return error_mark_node
;
2944 if (!ctype
&& !was_template_id
2945 && (specialization
|| member_specialization
2946 || explicit_instantiation
)
2947 && !is_associated_namespace (CP_DECL_CONTEXT (decl
),
2948 CP_DECL_CONTEXT (tmpl
)))
2949 error ("%qD is not declared in %qD",
2950 tmpl
, current_namespace
);
2952 tree gen_tmpl
= most_general_template (tmpl
);
2954 if (explicit_instantiation
)
2956 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2957 is done by do_decl_instantiation later. */
2959 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2960 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2962 if (arg_depth
> parm_depth
)
2964 /* If TMPL is not the most general template (for
2965 example, if TMPL is a friend template that is
2966 injected into namespace scope), then there will
2967 be too many levels of TARGS. Remove some of them
2972 new_targs
= make_tree_vec (parm_depth
);
2973 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2974 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2975 = TREE_VEC_ELT (targs
, i
);
2979 return instantiate_template (tmpl
, targs
, tf_error
);
2982 /* If we thought that the DECL was a member function, but it
2983 turns out to be specializing a static member function,
2984 make DECL a static member function as well. */
2985 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2986 && DECL_STATIC_FUNCTION_P (tmpl
)
2987 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2988 revert_static_member_fn (decl
);
2990 /* If this is a specialization of a member template of a
2991 template class, we want to return the TEMPLATE_DECL, not
2992 the specialization of it. */
2993 if (tsk
== tsk_template
&& !was_template_id
)
2995 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2996 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2997 DECL_INITIAL (result
) = NULL_TREE
;
3001 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3002 DECL_SOURCE_LOCATION (result
)
3003 = DECL_SOURCE_LOCATION (decl
);
3004 /* We want to use the argument list specified in the
3005 definition, not in the original declaration. */
3006 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
3007 for (parm
= DECL_ARGUMENTS (result
); parm
;
3008 parm
= DECL_CHAIN (parm
))
3009 DECL_CONTEXT (parm
) = result
;
3011 return register_specialization (tmpl
, gen_tmpl
, targs
,
3015 /* Set up the DECL_TEMPLATE_INFO for DECL. */
3016 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
3018 if (was_template_id
)
3019 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
3021 /* Inherit default function arguments from the template
3022 DECL is specializing. */
3023 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
3024 copy_default_args_to_explicit_spec (decl
);
3026 /* This specialization has the same protection as the
3027 template it specializes. */
3028 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
3029 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
3031 /* 7.1.1-1 [dcl.stc]
3033 A storage-class-specifier shall not be specified in an
3034 explicit specialization...
3036 The parser rejects these, so unless action is taken here,
3037 explicit function specializations will always appear with
3040 The action recommended by the C++ CWG in response to C++
3041 defect report 605 is to make the storage class and linkage
3042 of the explicit specialization match the templated function:
3044 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
3046 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
3048 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
3049 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
3051 /* A concept cannot be specialized. */
3052 if (DECL_DECLARED_CONCEPT_P (tmpl_func
))
3054 error ("explicit specialization of function concept %qD",
3056 return error_mark_node
;
3059 /* This specialization has the same linkage and visibility as
3060 the function template it specializes. */
3061 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
3062 if (! TREE_PUBLIC (decl
))
3064 DECL_INTERFACE_KNOWN (decl
) = 1;
3065 DECL_NOT_REALLY_EXTERN (decl
) = 1;
3067 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
3068 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
3070 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
3071 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
3075 /* If DECL is a friend declaration, declared using an
3076 unqualified name, the namespace associated with DECL may
3077 have been set incorrectly. For example, in:
3079 template <typename T> void f(T);
3081 struct S { friend void f<int>(int); }
3084 we will have set the DECL_CONTEXT for the friend
3085 declaration to N, rather than to the global namespace. */
3086 if (DECL_NAMESPACE_SCOPE_P (decl
))
3087 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
3089 if (is_friend
&& !have_def
)
3090 /* This is not really a declaration of a specialization.
3091 It's just the name of an instantiation. But, it's not
3092 a request for an instantiation, either. */
3093 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
3094 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
3095 /* A specialization is not necessarily COMDAT. */
3096 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
3097 && DECL_DECLARED_INLINE_P (decl
));
3098 else if (VAR_P (decl
))
3099 DECL_COMDAT (decl
) = false;
3101 /* If this is a full specialization, register it so that we can find
3102 it again. Partial specializations will be registered in
3103 process_partial_specialization. */
3104 if (!processing_template_decl
)
3105 decl
= register_specialization (decl
, gen_tmpl
, targs
,
3108 /* A 'structor should already have clones. */
3109 gcc_assert (decl
== error_mark_node
3110 || variable_template_p (tmpl
)
3111 || !(DECL_CONSTRUCTOR_P (decl
)
3112 || DECL_DESTRUCTOR_P (decl
))
3113 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
3120 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
3121 parameters. These are represented in the same format used for
3122 DECL_TEMPLATE_PARMS. */
3125 comp_template_parms (const_tree parms1
, const_tree parms2
)
3130 if (parms1
== parms2
)
3133 for (p1
= parms1
, p2
= parms2
;
3134 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
3135 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
3137 tree t1
= TREE_VALUE (p1
);
3138 tree t2
= TREE_VALUE (p2
);
3141 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
3142 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
3144 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
3147 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
3149 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
3150 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
3152 /* If either of the template parameters are invalid, assume
3153 they match for the sake of error recovery. */
3154 if (error_operand_p (parm1
) || error_operand_p (parm2
))
3157 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
3160 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
3161 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
3162 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
3164 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
3169 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
3170 /* One set of parameters has more parameters lists than the
3177 /* Determine whether PARM is a parameter pack. */
3180 template_parameter_pack_p (const_tree parm
)
3182 /* Determine if we have a non-type template parameter pack. */
3183 if (TREE_CODE (parm
) == PARM_DECL
)
3184 return (DECL_TEMPLATE_PARM_P (parm
)
3185 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
3186 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
3187 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
3189 /* If this is a list of template parameters, we could get a
3190 TYPE_DECL or a TEMPLATE_DECL. */
3191 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
3192 parm
= TREE_TYPE (parm
);
3194 /* Otherwise it must be a type template parameter. */
3195 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
3196 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
3197 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
3200 /* Determine if T is a function parameter pack. */
3203 function_parameter_pack_p (const_tree t
)
3205 if (t
&& TREE_CODE (t
) == PARM_DECL
)
3206 return DECL_PACK_P (t
);
3210 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3211 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3214 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3216 if (! primary_func_tmpl_inst
3217 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3218 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3221 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3224 /* Return true iff the function parameter PARAM_DECL was expanded
3225 from the function parameter pack PACK. */
3228 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3230 if (DECL_ARTIFICIAL (param_decl
)
3231 || !function_parameter_pack_p (pack
))
3234 /* The parameter pack and its pack arguments have the same
3236 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3239 /* Determine whether ARGS describes a variadic template args list,
3240 i.e., one that is terminated by a template argument pack. */
3243 template_args_variadic_p (tree args
)
3248 if (args
== NULL_TREE
)
3251 args
= INNERMOST_TEMPLATE_ARGS (args
);
3252 nargs
= TREE_VEC_LENGTH (args
);
3257 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3259 return ARGUMENT_PACK_P (last_parm
);
3262 /* Generate a new name for the parameter pack name NAME (an
3263 IDENTIFIER_NODE) that incorporates its */
3266 make_ith_pack_parameter_name (tree name
, int i
)
3268 /* Munge the name to include the parameter index. */
3269 #define NUMBUF_LEN 128
3270 char numbuf
[NUMBUF_LEN
];
3274 if (name
== NULL_TREE
)
3276 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3277 newname_len
= IDENTIFIER_LENGTH (name
)
3278 + strlen (numbuf
) + 2;
3279 newname
= (char*)alloca (newname_len
);
3280 snprintf (newname
, newname_len
,
3281 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3282 return get_identifier (newname
);
3285 /* Return true if T is a primary function, class or alias template
3289 primary_template_instantiation_p (const_tree t
)
3294 if (TREE_CODE (t
) == FUNCTION_DECL
)
3295 return DECL_LANG_SPECIFIC (t
)
3296 && DECL_TEMPLATE_INSTANTIATION (t
)
3297 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3298 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3299 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3300 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3301 else if (alias_template_specialization_p (t
))
3306 /* Return true if PARM is a template template parameter. */
3309 template_template_parameter_p (const_tree parm
)
3311 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3314 /* Return true iff PARM is a DECL representing a type template
3318 template_type_parameter_p (const_tree parm
)
3321 && (TREE_CODE (parm
) == TYPE_DECL
3322 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3323 && DECL_TEMPLATE_PARM_P (parm
));
3326 /* Return the template parameters of T if T is a
3327 primary template instantiation, NULL otherwise. */
3330 get_primary_template_innermost_parameters (const_tree t
)
3332 tree parms
= NULL
, template_info
= NULL
;
3334 if ((template_info
= get_template_info (t
))
3335 && primary_template_instantiation_p (t
))
3336 parms
= INNERMOST_TEMPLATE_PARMS
3337 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3342 /* Return the template parameters of the LEVELth level from the full list
3343 of template parameters PARMS. */
3346 get_template_parms_at_level (tree parms
, int level
)
3350 || TREE_CODE (parms
) != TREE_LIST
3351 || level
> TMPL_PARMS_DEPTH (parms
))
3354 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3355 if (TMPL_PARMS_DEPTH (p
) == level
)
3361 /* Returns the template arguments of T if T is a template instantiation,
3365 get_template_innermost_arguments (const_tree t
)
3367 tree args
= NULL
, template_info
= NULL
;
3369 if ((template_info
= get_template_info (t
))
3370 && TI_ARGS (template_info
))
3371 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3376 /* Return the argument pack elements of T if T is a template argument pack,
3380 get_template_argument_pack_elems (const_tree t
)
3382 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3383 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3386 return ARGUMENT_PACK_ARGS (t
);
3389 /* Structure used to track the progress of find_parameter_packs_r. */
3390 struct find_parameter_pack_data
3392 /* TREE_LIST that will contain all of the parameter packs found by
3394 tree
* parameter_packs
;
3396 /* Set of AST nodes that have been visited by the traversal. */
3397 hash_set
<tree
> *visited
;
3399 /* True iff we're making a type pack expansion. */
3400 bool type_pack_expansion_p
;
3403 /* Identifies all of the argument packs that occur in a template
3404 argument and appends them to the TREE_LIST inside DATA, which is a
3405 find_parameter_pack_data structure. This is a subroutine of
3406 make_pack_expansion and uses_parameter_packs. */
3408 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3411 struct find_parameter_pack_data
* ppd
=
3412 (struct find_parameter_pack_data
*)data
;
3413 bool parameter_pack_p
= false;
3415 /* Handle type aliases/typedefs. */
3416 if (TYPE_ALIAS_P (t
))
3418 if (TYPE_TEMPLATE_INFO (t
))
3419 cp_walk_tree (&TYPE_TI_ARGS (t
),
3420 &find_parameter_packs_r
,
3426 /* Identify whether this is a parameter pack or not. */
3427 switch (TREE_CODE (t
))
3429 case TEMPLATE_PARM_INDEX
:
3430 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3431 parameter_pack_p
= true;
3434 case TEMPLATE_TYPE_PARM
:
3435 t
= TYPE_MAIN_VARIANT (t
);
3436 case TEMPLATE_TEMPLATE_PARM
:
3437 /* If the placeholder appears in the decl-specifier-seq of a function
3438 parameter pack (14.6.3), or the type-specifier-seq of a type-id that
3439 is a pack expansion, the invented template parameter is a template
3441 if (ppd
->type_pack_expansion_p
&& is_auto_or_concept (t
))
3442 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
3443 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3444 parameter_pack_p
= true;
3449 if (DECL_PACK_P (t
))
3451 /* We don't want to walk into the type of a PARM_DECL,
3452 because we don't want to see the type parameter pack. */
3454 parameter_pack_p
= true;
3458 /* Look through a lambda capture proxy to the field pack. */
3460 if (DECL_HAS_VALUE_EXPR_P (t
))
3462 tree v
= DECL_VALUE_EXPR (t
);
3464 &find_parameter_packs_r
,
3468 else if (variable_template_specialization_p (t
))
3470 cp_walk_tree (&DECL_TI_ARGS (t
),
3471 find_parameter_packs_r
,
3478 parameter_pack_p
= true;
3481 /* Not a parameter pack. */
3485 if (parameter_pack_p
)
3487 /* Add this parameter pack to the list. */
3488 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3492 cp_walk_tree (&TYPE_CONTEXT (t
),
3493 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3495 /* This switch statement will return immediately if we don't find a
3497 switch (TREE_CODE (t
))
3499 case TEMPLATE_PARM_INDEX
:
3502 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3503 /* Check the template itself. */
3504 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3505 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3506 /* Check the template arguments. */
3507 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3512 case TEMPLATE_TYPE_PARM
:
3513 case TEMPLATE_TEMPLATE_PARM
:
3520 if (TYPE_PTRMEMFUNC_P (t
))
3526 if (TYPE_TEMPLATE_INFO (t
))
3527 cp_walk_tree (&TYPE_TI_ARGS (t
),
3528 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3535 cp_walk_tree (&TREE_TYPE (t
),
3536 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3540 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3545 case TYPE_PACK_EXPANSION
:
3546 case EXPR_PACK_EXPANSION
:
3551 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3556 case IDENTIFIER_NODE
:
3557 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3564 /* When traversing a DECLTYPE_TYPE_EXPR, we need to set
3565 type_pack_expansion_p to false so that any placeholders
3566 within the expression don't get marked as parameter packs. */
3567 bool type_pack_expansion_p
= ppd
->type_pack_expansion_p
;
3568 ppd
->type_pack_expansion_p
= false;
3569 cp_walk_tree (&DECLTYPE_TYPE_EXPR (t
), &find_parameter_packs_r
,
3571 ppd
->type_pack_expansion_p
= type_pack_expansion_p
;
3583 /* Determines if the expression or type T uses any parameter packs. */
3585 uses_parameter_packs (tree t
)
3587 tree parameter_packs
= NULL_TREE
;
3588 struct find_parameter_pack_data ppd
;
3589 ppd
.parameter_packs
= ¶meter_packs
;
3590 ppd
.visited
= new hash_set
<tree
>;
3591 ppd
.type_pack_expansion_p
= false;
3592 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3594 return parameter_packs
!= NULL_TREE
;
3597 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3598 representation a base-class initializer into a parameter pack
3599 expansion. If all goes well, the resulting node will be an
3600 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3603 make_pack_expansion (tree arg
)
3606 tree parameter_packs
= NULL_TREE
;
3607 bool for_types
= false;
3608 struct find_parameter_pack_data ppd
;
3610 if (!arg
|| arg
== error_mark_node
)
3613 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3615 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3616 class initializer. In this case, the TREE_PURPOSE will be a
3617 _TYPE node (representing the base class expansion we're
3618 initializing) and the TREE_VALUE will be a TREE_LIST
3619 containing the initialization arguments.
3621 The resulting expansion looks somewhat different from most
3622 expansions. Rather than returning just one _EXPANSION, we
3623 return a TREE_LIST whose TREE_PURPOSE is a
3624 TYPE_PACK_EXPANSION containing the bases that will be
3625 initialized. The TREE_VALUE will be identical to the
3626 original TREE_VALUE, which is a list of arguments that will
3627 be passed to each base. We do not introduce any new pack
3628 expansion nodes into the TREE_VALUE (although it is possible
3629 that some already exist), because the TREE_PURPOSE and
3630 TREE_VALUE all need to be expanded together with the same
3631 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3632 resulting TREE_PURPOSE will mention the parameter packs in
3633 both the bases and the arguments to the bases. */
3636 tree parameter_packs
= NULL_TREE
;
3638 /* Determine which parameter packs will be used by the base
3640 ppd
.visited
= new hash_set
<tree
>;
3641 ppd
.parameter_packs
= ¶meter_packs
;
3642 ppd
.type_pack_expansion_p
= true;
3643 gcc_assert (TYPE_P (TREE_PURPOSE (arg
)));
3644 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3647 if (parameter_packs
== NULL_TREE
)
3649 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3651 return error_mark_node
;
3654 if (TREE_VALUE (arg
) != void_type_node
)
3656 /* Collect the sets of parameter packs used in each of the
3657 initialization arguments. */
3658 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3660 /* Determine which parameter packs will be expanded in this
3662 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3669 /* Create the pack expansion type for the base type. */
3670 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3671 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3672 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3674 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3675 they will rarely be compared to anything. */
3676 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3678 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3681 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3684 /* Build the PACK_EXPANSION_* node. */
3686 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3687 : make_node (EXPR_PACK_EXPANSION
);
3688 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3689 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3691 /* Propagate type and const-expression information. */
3692 TREE_TYPE (result
) = TREE_TYPE (arg
);
3693 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3696 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3697 they will rarely be compared to anything. */
3698 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3700 /* Determine which parameter packs will be expanded. */
3701 ppd
.parameter_packs
= ¶meter_packs
;
3702 ppd
.visited
= new hash_set
<tree
>;
3703 ppd
.type_pack_expansion_p
= TYPE_P (arg
);
3704 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3707 /* Make sure we found some parameter packs. */
3708 if (parameter_packs
== NULL_TREE
)
3711 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3713 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3714 return error_mark_node
;
3716 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3718 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3723 /* Checks T for any "bare" parameter packs, which have not yet been
3724 expanded, and issues an error if any are found. This operation can
3725 only be done on full expressions or types (e.g., an expression
3726 statement, "if" condition, etc.), because we could have expressions like:
3728 foo(f(g(h(args)))...)
3730 where "args" is a parameter pack. check_for_bare_parameter_packs
3731 should not be called for the subexpressions args, h(args),
3732 g(h(args)), or f(g(h(args))), because we would produce erroneous
3735 Returns TRUE and emits an error if there were bare parameter packs,
3736 returns FALSE otherwise. */
3738 check_for_bare_parameter_packs (tree t
)
3740 tree parameter_packs
= NULL_TREE
;
3741 struct find_parameter_pack_data ppd
;
3743 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3746 if (TREE_CODE (t
) == TYPE_DECL
)
3749 ppd
.parameter_packs
= ¶meter_packs
;
3750 ppd
.visited
= new hash_set
<tree
>;
3751 ppd
.type_pack_expansion_p
= false;
3752 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3755 if (parameter_packs
)
3757 error ("parameter packs not expanded with %<...%>:");
3758 while (parameter_packs
)
3760 tree pack
= TREE_VALUE (parameter_packs
);
3761 tree name
= NULL_TREE
;
3763 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3764 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3765 name
= TYPE_NAME (pack
);
3766 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3767 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3769 name
= DECL_NAME (pack
);
3772 inform (input_location
, " %qD", name
);
3774 inform (input_location
, " <anonymous>");
3776 parameter_packs
= TREE_CHAIN (parameter_packs
);
3785 /* Expand any parameter packs that occur in the template arguments in
3788 expand_template_argument_pack (tree args
)
3790 tree result_args
= NULL_TREE
;
3791 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3792 int num_result_args
= -1;
3793 int non_default_args_count
= -1;
3795 /* First, determine if we need to expand anything, and the number of
3796 slots we'll need. */
3797 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3799 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3800 if (arg
== NULL_TREE
)
3802 if (ARGUMENT_PACK_P (arg
))
3804 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3805 if (num_result_args
< 0)
3806 num_result_args
= in_arg
+ num_packed
;
3808 num_result_args
+= num_packed
;
3812 if (num_result_args
>= 0)
3817 /* If no expansion is necessary, we're done. */
3818 if (num_result_args
< 0)
3821 /* Expand arguments. */
3822 result_args
= make_tree_vec (num_result_args
);
3823 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3824 non_default_args_count
=
3825 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3826 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3828 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3829 if (ARGUMENT_PACK_P (arg
))
3831 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3832 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3833 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3834 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3835 if (non_default_args_count
> 0)
3836 non_default_args_count
+= num_packed
- 1;
3840 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3844 if (non_default_args_count
>= 0)
3845 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3849 /* Checks if DECL shadows a template parameter.
3851 [temp.local]: A template-parameter shall not be redeclared within its
3852 scope (including nested scopes).
3854 Emits an error and returns TRUE if the DECL shadows a parameter,
3855 returns FALSE otherwise. */
3858 check_template_shadow (tree decl
)
3862 /* If we're not in a template, we can't possibly shadow a template
3864 if (!current_template_parms
)
3867 /* Figure out what we're shadowing. */
3868 if (TREE_CODE (decl
) == OVERLOAD
)
3869 decl
= OVL_CURRENT (decl
);
3870 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3872 /* If there's no previous binding for this name, we're not shadowing
3873 anything, let alone a template parameter. */
3877 /* If we're not shadowing a template parameter, we're done. Note
3878 that OLDDECL might be an OVERLOAD (or perhaps even an
3879 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3881 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3884 /* We check for decl != olddecl to avoid bogus errors for using a
3885 name inside a class. We check TPFI to avoid duplicate errors for
3886 inline member templates. */
3888 || (DECL_TEMPLATE_PARM_P (decl
)
3889 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3892 /* Don't complain about the injected class name, as we've already
3893 complained about the class itself. */
3894 if (DECL_SELF_REFERENCE_P (decl
))
3897 if (DECL_TEMPLATE_PARM_P (decl
))
3898 error ("declaration of template parameter %q+D shadows "
3899 "template parameter", decl
);
3901 error ("declaration of %q+#D shadows template parameter", decl
);
3902 inform (DECL_SOURCE_LOCATION (olddecl
),
3903 "template parameter %qD declared here", olddecl
);
3907 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3908 ORIG_LEVEL, DECL, and TYPE. */
3911 build_template_parm_index (int index
,
3917 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3918 TEMPLATE_PARM_IDX (t
) = index
;
3919 TEMPLATE_PARM_LEVEL (t
) = level
;
3920 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3921 TEMPLATE_PARM_DECL (t
) = decl
;
3922 TREE_TYPE (t
) = type
;
3923 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3924 TREE_READONLY (t
) = TREE_READONLY (decl
);
3929 /* Find the canonical type parameter for the given template type
3930 parameter. Returns the canonical type parameter, which may be TYPE
3931 if no such parameter existed. */
3934 canonical_type_parameter (tree type
)
3937 int idx
= TEMPLATE_TYPE_IDX (type
);
3938 if (!canonical_template_parms
)
3939 vec_alloc (canonical_template_parms
, idx
+1);
3941 while (canonical_template_parms
->length () <= (unsigned)idx
)
3942 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3944 list
= (*canonical_template_parms
)[idx
];
3945 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3946 list
= TREE_CHAIN (list
);
3949 return TREE_VALUE (list
);
3952 (*canonical_template_parms
)[idx
]
3953 = tree_cons (NULL_TREE
, type
,
3954 (*canonical_template_parms
)[idx
]);
3959 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3960 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3961 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3962 new one is created. */
3965 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3966 tsubst_flags_t complain
)
3968 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3969 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3970 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3971 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3973 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3976 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3977 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3978 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3979 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3980 DECL_ARTIFICIAL (decl
) = 1;
3981 SET_DECL_TEMPLATE_PARM_P (decl
);
3983 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3984 TEMPLATE_PARM_LEVEL (index
) - levels
,
3985 TEMPLATE_PARM_ORIG_LEVEL (index
),
3987 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3988 TEMPLATE_PARM_PARAMETER_PACK (t
)
3989 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3991 /* Template template parameters need this. */
3992 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3994 DECL_TEMPLATE_RESULT (decl
)
3995 = build_decl (DECL_SOURCE_LOCATION (decl
),
3996 TYPE_DECL
, DECL_NAME (decl
), type
);
3997 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
3998 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3999 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
4003 return TEMPLATE_PARM_DESCENDANTS (index
);
4006 /* Process information from new template parameter PARM and append it
4007 to the LIST being built. This new parameter is a non-type
4008 parameter iff IS_NON_TYPE is true. This new parameter is a
4009 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
4013 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
4014 bool is_non_type
, bool is_parameter_pack
)
4019 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
4020 tree defval
= TREE_PURPOSE (parm
);
4021 tree constr
= TREE_TYPE (parm
);
4025 tree p
= tree_last (list
);
4027 if (p
&& TREE_VALUE (p
) != error_mark_node
)
4030 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
4031 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
4033 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
4041 parm
= TREE_VALUE (parm
);
4043 SET_DECL_TEMPLATE_PARM_P (parm
);
4045 if (TREE_TYPE (parm
) != error_mark_node
)
4049 The top-level cv-qualifiers on the template-parameter are
4050 ignored when determining its type. */
4051 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
4052 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
4053 TREE_TYPE (parm
) = error_mark_node
;
4054 else if (uses_parameter_packs (TREE_TYPE (parm
))
4055 && !is_parameter_pack
4056 /* If we're in a nested template parameter list, the template
4057 template parameter could be a parameter pack. */
4058 && processing_template_parmlist
== 1)
4060 /* This template parameter is not a parameter pack, but it
4061 should be. Complain about "bare" parameter packs. */
4062 check_for_bare_parameter_packs (TREE_TYPE (parm
));
4064 /* Recover by calling this a parameter pack. */
4065 is_parameter_pack
= true;
4069 /* A template parameter is not modifiable. */
4070 TREE_CONSTANT (parm
) = 1;
4071 TREE_READONLY (parm
) = 1;
4072 decl
= build_decl (parm_loc
,
4073 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
4074 TREE_CONSTANT (decl
) = 1;
4075 TREE_READONLY (decl
) = 1;
4076 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
4077 = build_template_parm_index (idx
, processing_template_decl
,
4078 processing_template_decl
,
4079 decl
, TREE_TYPE (parm
));
4081 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
4082 = is_parameter_pack
;
4087 parm
= TREE_VALUE (TREE_VALUE (parm
));
4089 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
4091 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
4092 /* This is for distinguishing between real templates and template
4093 template parameters */
4094 TREE_TYPE (parm
) = t
;
4095 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
4100 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
4101 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
4102 decl
= build_decl (parm_loc
,
4103 TYPE_DECL
, parm
, t
);
4106 TYPE_NAME (t
) = decl
;
4107 TYPE_STUB_DECL (t
) = decl
;
4109 TEMPLATE_TYPE_PARM_INDEX (t
)
4110 = build_template_parm_index (idx
, processing_template_decl
,
4111 processing_template_decl
,
4112 decl
, TREE_TYPE (parm
));
4113 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
4114 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
4116 DECL_ARTIFICIAL (decl
) = 1;
4117 SET_DECL_TEMPLATE_PARM_P (decl
);
4119 /* Build requirements for the type/template parameter.
4120 This must be done after SET_DECL_TEMPLATE_PARM_P or
4121 process_template_parm could fail. */
4122 tree reqs
= finish_shorthand_constraint (parm
, constr
);
4126 /* Build the parameter node linking the parameter declaration,
4127 its default argument (if any), and its constraints (if any). */
4128 parm
= build_tree_list (defval
, parm
);
4129 TEMPLATE_PARM_CONSTRAINTS (parm
) = reqs
;
4131 return chainon (list
, parm
);
4134 /* The end of a template parameter list has been reached. Process the
4135 tree list into a parameter vector, converting each parameter into a more
4136 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
4140 end_template_parm_list (tree parms
)
4144 tree saved_parmlist
= make_tree_vec (list_length (parms
));
4146 /* Pop the dummy parameter level and add the real one. */
4147 current_template_parms
= TREE_CHAIN (current_template_parms
);
4149 current_template_parms
4150 = tree_cons (size_int (processing_template_decl
),
4151 saved_parmlist
, current_template_parms
);
4153 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
4155 next
= TREE_CHAIN (parm
);
4156 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
4157 TREE_CHAIN (parm
) = NULL_TREE
;
4160 --processing_template_parmlist
;
4162 return saved_parmlist
;
4165 // Explicitly indicate the end of the template parameter list. We assume
4166 // that the current template parameters have been constructed and/or
4167 // managed explicitly, as when creating new template template parameters
4168 // from a shorthand constraint.
4170 end_template_parm_list ()
4172 --processing_template_parmlist
;
4175 /* end_template_decl is called after a template declaration is seen. */
4178 end_template_decl (void)
4180 reset_specialization ();
4182 if (! processing_template_decl
)
4185 /* This matches the pushlevel in begin_template_parm_list. */
4188 --processing_template_decl
;
4189 current_template_parms
= TREE_CHAIN (current_template_parms
);
4192 /* Takes a TREE_LIST representing a template parameter and convert it
4193 into an argument suitable to be passed to the type substitution
4194 functions. Note that If the TREE_LIST contains an error_mark
4195 node, the returned argument is error_mark_node. */
4198 template_parm_to_arg (tree t
)
4202 || TREE_CODE (t
) != TREE_LIST
)
4205 if (error_operand_p (TREE_VALUE (t
)))
4206 return error_mark_node
;
4210 if (TREE_CODE (t
) == TYPE_DECL
4211 || TREE_CODE (t
) == TEMPLATE_DECL
)
4215 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
4217 /* Turn this argument into a TYPE_ARGUMENT_PACK
4218 with a single element, which expands T. */
4219 tree vec
= make_tree_vec (1);
4221 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4223 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4225 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
4226 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4231 t
= DECL_INITIAL (t
);
4233 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
4235 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
4236 with a single element, which expands T. */
4237 tree vec
= make_tree_vec (1);
4238 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
4240 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
4242 t
= convert_from_reference (t
);
4243 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
4245 t
= make_node (NONTYPE_ARGUMENT_PACK
);
4246 SET_ARGUMENT_PACK_ARGS (t
, vec
);
4247 TREE_TYPE (t
) = type
;
4250 t
= convert_from_reference (t
);
4255 /* Given a set of template parameters, return them as a set of template
4256 arguments. The template parameters are represented as a TREE_VEC, in
4257 the form documented in cp-tree.h for template arguments. */
4260 template_parms_to_args (tree parms
)
4263 tree args
= NULL_TREE
;
4264 int length
= TMPL_PARMS_DEPTH (parms
);
4267 /* If there is only one level of template parameters, we do not
4268 create a TREE_VEC of TREE_VECs. Instead, we return a single
4269 TREE_VEC containing the arguments. */
4271 args
= make_tree_vec (length
);
4273 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4275 tree a
= copy_node (TREE_VALUE (header
));
4278 TREE_TYPE (a
) = NULL_TREE
;
4279 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4280 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4283 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4286 TREE_VEC_ELT (args
, --l
) = a
;
4294 /* Within the declaration of a template, return the currently active
4295 template parameters as an argument TREE_VEC. */
4298 current_template_args (void)
4300 return template_parms_to_args (current_template_parms
);
4303 /* Update the declared TYPE by doing any lookups which were thought to be
4304 dependent, but are not now that we know the SCOPE of the declarator. */
4307 maybe_update_decl_type (tree orig_type
, tree scope
)
4309 tree type
= orig_type
;
4311 if (type
== NULL_TREE
)
4314 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4315 type
= TREE_TYPE (type
);
4317 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4318 && dependent_type_p (type
)
4319 /* Don't bother building up the args in this case. */
4320 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4322 /* tsubst in the args corresponding to the template parameters,
4323 including auto if present. Most things will be unchanged, but
4324 make_typename_type and tsubst_qualified_id will resolve
4325 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4326 tree args
= current_template_args ();
4327 tree auto_node
= type_uses_auto (type
);
4331 tree auto_vec
= make_tree_vec (1);
4332 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4333 args
= add_to_template_args (args
, auto_vec
);
4335 pushed
= push_scope (scope
);
4336 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4341 if (type
== error_mark_node
)
4344 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4346 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4349 type
= TYPE_NAME (type
);
4354 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4355 template PARMS and constraints, CONSTR. If MEMBER_TEMPLATE_P is true,
4356 the new template is a member template. */
4359 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4361 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4362 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4363 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4364 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4365 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4370 struct template_parm_data
4372 /* The level of the template parameters we are currently
4376 /* The index of the specialization argument we are currently
4380 /* An array whose size is the number of template parameters. The
4381 elements are nonzero if the parameter has been used in any one
4382 of the arguments processed so far. */
4385 /* An array whose size is the number of template arguments. The
4386 elements are nonzero if the argument makes use of template
4387 parameters of this level. */
4388 int* arg_uses_template_parms
;
4391 /* Subroutine of push_template_decl used to see if each template
4392 parameter in a partial specialization is used in the explicit
4393 argument list. If T is of the LEVEL given in DATA (which is
4394 treated as a template_parm_data*), then DATA->PARMS is marked
4398 mark_template_parm (tree t
, void* data
)
4402 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4404 template_parm_level_and_index (t
, &level
, &idx
);
4406 if (level
== tpd
->level
)
4408 tpd
->parms
[idx
] = 1;
4409 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4412 /* Return zero so that for_each_template_parm will continue the
4413 traversal of the tree; we want to mark *every* template parm. */
4417 /* Process the partial specialization DECL. */
4420 process_partial_specialization (tree decl
)
4422 tree type
= TREE_TYPE (decl
);
4423 tree tinfo
= get_template_info (decl
);
4424 tree maintmpl
= TI_TEMPLATE (tinfo
);
4425 tree specargs
= TI_ARGS (tinfo
);
4426 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4427 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4430 int nargs
= TREE_VEC_LENGTH (inner_args
);
4433 bool did_error_intro
= false;
4434 struct template_parm_data tpd
;
4435 struct template_parm_data tpd2
;
4437 gcc_assert (current_template_parms
);
4439 /* A concept cannot be specialized. */
4440 if (flag_concepts
&& variable_concept_p (maintmpl
))
4442 error ("specialization of variable concept %q#D", maintmpl
);
4443 return error_mark_node
;
4446 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4447 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4449 /* We check that each of the template parameters given in the
4450 partial specialization is used in the argument list to the
4451 specialization. For example:
4453 template <class T> struct S;
4454 template <class T> struct S<T*>;
4456 The second declaration is OK because `T*' uses the template
4457 parameter T, whereas
4459 template <class T> struct S<int>;
4461 is no good. Even trickier is:
4472 The S2<T> declaration is actually invalid; it is a
4473 full-specialization. Of course,
4476 struct S2<T (*)(U)>;
4478 or some such would have been OK. */
4479 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4480 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4481 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4483 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4484 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4485 for (i
= 0; i
< nargs
; ++i
)
4487 tpd
.current_arg
= i
;
4488 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4489 &mark_template_parm
,
4492 /*include_nondeduced_p=*/false);
4494 for (i
= 0; i
< ntparms
; ++i
)
4495 if (tpd
.parms
[i
] == 0)
4497 /* One of the template parms was not used in a deduced context in the
4499 if (!did_error_intro
)
4501 error ("template parameters not deducible in "
4502 "partial specialization:");
4503 did_error_intro
= true;
4506 inform (input_location
, " %qD",
4507 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4510 if (did_error_intro
)
4511 return error_mark_node
;
4513 /* [temp.class.spec]
4515 The argument list of the specialization shall not be identical to
4516 the implicit argument list of the primary template. */
4518 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4519 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
))
4521 || !strictly_subsumes (current_template_constraints (),
4522 get_constraints (maintmpl
))))
4525 error ("partial specialization %q+D does not specialize "
4526 "any template arguments", decl
);
4528 error ("partial specialization %q+D does not specialize any "
4529 "template arguments and is not more constrained than", decl
);
4530 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4533 /* A partial specialization that replaces multiple parameters of the
4534 primary template with a pack expansion is less specialized for those
4536 if (nargs
< DECL_NTPARMS (maintmpl
))
4538 error ("partial specialization is not more specialized than the "
4539 "primary template because it replaces multiple parameters "
4540 "with a pack expansion");
4541 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4545 /* [temp.class.spec]
4547 A partially specialized non-type argument expression shall not
4548 involve template parameters of the partial specialization except
4549 when the argument expression is a simple identifier.
4551 The type of a template parameter corresponding to a specialized
4552 non-type argument shall not be dependent on a parameter of the
4555 Also, we verify that pack expansions only occur at the
4556 end of the argument list. */
4557 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4559 for (i
= 0; i
< nargs
; ++i
)
4561 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4562 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4563 tree packed_args
= NULL_TREE
;
4566 if (ARGUMENT_PACK_P (arg
))
4568 /* Extract the arguments from the argument pack. We'll be
4569 iterating over these in the following loop. */
4570 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4571 len
= TREE_VEC_LENGTH (packed_args
);
4574 for (j
= 0; j
< len
; j
++)
4577 /* Get the Jth argument in the parameter pack. */
4578 arg
= TREE_VEC_ELT (packed_args
, j
);
4580 if (PACK_EXPANSION_P (arg
))
4582 /* Pack expansions must come at the end of the
4584 if ((packed_args
&& j
< len
- 1)
4585 || (!packed_args
&& i
< nargs
- 1))
4587 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4588 error ("parameter pack argument %qE must be at the "
4589 "end of the template argument list", arg
);
4591 error ("parameter pack argument %qT must be at the "
4592 "end of the template argument list", arg
);
4596 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4597 /* We only care about the pattern. */
4598 arg
= PACK_EXPANSION_PATTERN (arg
);
4600 if (/* These first two lines are the `non-type' bit. */
4602 && TREE_CODE (arg
) != TEMPLATE_DECL
4603 /* This next two lines are the `argument expression is not just a
4604 simple identifier' condition and also the `specialized
4605 non-type argument' bit. */
4606 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4607 && !(REFERENCE_REF_P (arg
)
4608 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4610 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4611 || (packed_args
&& uses_template_parms (arg
)))
4612 error ("template argument %qE involves template parameter(s)",
4616 /* Look at the corresponding template parameter,
4617 marking which template parameters its type depends
4619 tree type
= TREE_TYPE (parm
);
4623 /* We haven't yet initialized TPD2. Do so now. */
4624 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4625 /* The number of parameters here is the number in the
4626 main template, which, as checked in the assertion
4628 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4630 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4633 /* Mark the template parameters. But this time, we're
4634 looking for the template parameters of the main
4635 template, not in the specialization. */
4636 tpd2
.current_arg
= i
;
4637 tpd2
.arg_uses_template_parms
[i
] = 0;
4638 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4639 for_each_template_parm (type
,
4640 &mark_template_parm
,
4643 /*include_nondeduced_p=*/false);
4645 if (tpd2
.arg_uses_template_parms
[i
])
4647 /* The type depended on some template parameters.
4648 If they are fully specialized in the
4649 specialization, that's OK. */
4652 for (j
= 0; j
< nargs
; ++j
)
4653 if (tpd2
.parms
[j
] != 0
4654 && tpd
.arg_uses_template_parms
[j
])
4657 error_n (input_location
, count
,
4658 "type %qT of template argument %qE depends "
4659 "on a template parameter",
4660 "type %qT of template argument %qE depends "
4661 "on template parameters",
4670 /* We should only get here once. */
4671 if (TREE_CODE (decl
) == TYPE_DECL
)
4672 gcc_assert (!COMPLETE_TYPE_P (type
));
4674 // Build the template decl.
4675 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4676 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4677 TREE_TYPE (tmpl
) = type
;
4678 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4679 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4680 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4681 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4684 /* We didn't register this in check_explicit_specialization so we could
4685 wait until the constraints were set. */
4686 decl
= register_specialization (decl
, maintmpl
, specargs
, false, 0);
4688 associate_classtype_constraints (type
);
4690 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4691 = tree_cons (specargs
, tmpl
,
4692 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4693 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4695 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4696 inst
= TREE_CHAIN (inst
))
4698 tree instance
= TREE_VALUE (inst
);
4699 if (TYPE_P (instance
)
4700 ? (COMPLETE_TYPE_P (instance
)
4701 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4702 : DECL_TEMPLATE_INSTANTIATION (instance
))
4704 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4705 tree inst_decl
= (DECL_P (instance
)
4706 ? instance
: TYPE_NAME (instance
));
4709 else if (spec
== error_mark_node
)
4710 permerror (input_location
,
4711 "declaration of %qD ambiguates earlier template "
4712 "instantiation for %qD", decl
, inst_decl
);
4713 else if (TREE_VALUE (spec
) == tmpl
)
4714 permerror (input_location
,
4715 "partial specialization of %qD after instantiation "
4716 "of %qD", decl
, inst_decl
);
4723 /* PARM is a template parameter of some form; return the corresponding
4724 TEMPLATE_PARM_INDEX. */
4727 get_template_parm_index (tree parm
)
4729 if (TREE_CODE (parm
) == PARM_DECL
4730 || TREE_CODE (parm
) == CONST_DECL
)
4731 parm
= DECL_INITIAL (parm
);
4732 else if (TREE_CODE (parm
) == TYPE_DECL
4733 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4734 parm
= TREE_TYPE (parm
);
4735 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4736 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4737 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4738 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4739 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4743 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4744 parameter packs used by the template parameter PARM. */
4747 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4749 /* A type parm can't refer to another parm. */
4750 if (TREE_CODE (parm
) == TYPE_DECL
)
4752 else if (TREE_CODE (parm
) == PARM_DECL
)
4754 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4759 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4761 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4762 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4763 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4766 /* PARM is a template parameter pack. Return any parameter packs used in
4767 its type or the type of any of its template parameters. If there are
4768 any such packs, it will be instantiated into a fixed template parameter
4769 list by partial instantiation rather than be fully deduced. */
4772 fixed_parameter_pack_p (tree parm
)
4774 /* This can only be true in a member template. */
4775 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4777 /* This can only be true for a parameter pack. */
4778 if (!template_parameter_pack_p (parm
))
4780 /* A type parm can't refer to another parm. */
4781 if (TREE_CODE (parm
) == TYPE_DECL
)
4784 tree parameter_packs
= NULL_TREE
;
4785 struct find_parameter_pack_data ppd
;
4786 ppd
.parameter_packs
= ¶meter_packs
;
4787 ppd
.visited
= new hash_set
<tree
>;
4788 ppd
.type_pack_expansion_p
= false;
4790 fixed_parameter_pack_p_1 (parm
, &ppd
);
4793 return parameter_packs
;
4796 /* Check that a template declaration's use of default arguments and
4797 parameter packs is not invalid. Here, PARMS are the template
4798 parameters. IS_PRIMARY is true if DECL is the thing declared by
4799 a primary template. IS_PARTIAL is true if DECL is a partial
4802 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4803 declaration (but not a definition); 1 indicates a declaration, 2
4804 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4805 emitted for extraneous default arguments.
4807 Returns TRUE if there were no errors found, FALSE otherwise. */
4810 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4811 bool is_partial
, int is_friend_decl
)
4814 int last_level_to_check
;
4816 bool no_errors
= true;
4820 A default template-argument shall not be specified in a
4821 function template declaration or a function template definition, nor
4822 in the template-parameter-list of the definition of a member of a
4825 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4826 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4827 /* You can't have a function template declaration in a local
4828 scope, nor you can you define a member of a class template in a
4832 if ((TREE_CODE (decl
) == TYPE_DECL
4834 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4835 || (TREE_CODE (decl
) == FUNCTION_DECL
4836 && LAMBDA_FUNCTION_P (decl
)))
4837 /* A lambda doesn't have an explicit declaration; don't complain
4838 about the parms of the enclosing class. */
4841 if (current_class_type
4842 && !TYPE_BEING_DEFINED (current_class_type
)
4843 && DECL_LANG_SPECIFIC (decl
)
4844 && DECL_DECLARES_FUNCTION_P (decl
)
4845 /* If this is either a friend defined in the scope of the class
4846 or a member function. */
4847 && (DECL_FUNCTION_MEMBER_P (decl
)
4848 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4849 : DECL_FRIEND_CONTEXT (decl
)
4850 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4852 /* And, if it was a member function, it really was defined in
4853 the scope of the class. */
4854 && (!DECL_FUNCTION_MEMBER_P (decl
)
4855 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4856 /* We already checked these parameters when the template was
4857 declared, so there's no need to do it again now. This function
4858 was defined in class scope, but we're processing its body now
4859 that the class is complete. */
4862 /* Core issue 226 (C++0x only): the following only applies to class
4865 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4869 If a template-parameter has a default template-argument, all
4870 subsequent template-parameters shall have a default
4871 template-argument supplied. */
4872 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4874 tree inner_parms
= TREE_VALUE (parm_level
);
4875 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4876 int seen_def_arg_p
= 0;
4879 for (i
= 0; i
< ntparms
; ++i
)
4881 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4883 if (parm
== error_mark_node
)
4886 if (TREE_PURPOSE (parm
))
4888 else if (seen_def_arg_p
4889 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4891 error ("no default argument for %qD", TREE_VALUE (parm
));
4892 /* For better subsequent error-recovery, we indicate that
4893 there should have been a default argument. */
4894 TREE_PURPOSE (parm
) = error_mark_node
;
4897 else if (!is_partial
4899 /* Don't complain about an enclosing partial
4901 && parm_level
== parms
4902 && TREE_CODE (decl
) == TYPE_DECL
4904 && template_parameter_pack_p (TREE_VALUE (parm
))
4905 /* A fixed parameter pack will be partially
4906 instantiated into a fixed length list. */
4907 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4909 /* A primary class template can only have one
4910 parameter pack, at the end of the template
4913 error ("parameter pack %q+D must be at the end of the"
4914 " template parameter list", TREE_VALUE (parm
));
4916 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4924 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4928 /* For an ordinary class template, default template arguments are
4929 allowed at the innermost level, e.g.:
4930 template <class T = int>
4932 but, in a partial specialization, they're not allowed even
4933 there, as we have in [temp.class.spec]:
4935 The template parameter list of a specialization shall not
4936 contain default template argument values.
4938 So, for a partial specialization, or for a function template
4939 (in C++98/C++03), we look at all of them. */
4942 /* But, for a primary class template that is not a partial
4943 specialization we look at all template parameters except the
4945 parms
= TREE_CHAIN (parms
);
4947 /* Figure out what error message to issue. */
4948 if (is_friend_decl
== 2)
4949 msg
= G_("default template arguments may not be used in function template "
4950 "friend re-declaration");
4951 else if (is_friend_decl
)
4952 msg
= G_("default template arguments may not be used in function template "
4953 "friend declarations");
4954 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4955 msg
= G_("default template arguments may not be used in function templates "
4956 "without -std=c++11 or -std=gnu++11");
4957 else if (is_partial
)
4958 msg
= G_("default template arguments may not be used in "
4959 "partial specializations");
4960 else if (current_class_type
&& CLASSTYPE_IS_TEMPLATE (current_class_type
))
4961 msg
= G_("default argument for template parameter for class enclosing %qD");
4963 /* Per [temp.param]/9, "A default template-argument shall not be
4964 specified in the template-parameter-lists of the definition of
4965 a member of a class template that appears outside of the member's
4966 class.", thus if we aren't handling a member of a class template
4967 there is no need to examine the parameters. */
4970 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4971 /* If we're inside a class definition, there's no need to
4972 examine the parameters to the class itself. On the one
4973 hand, they will be checked when the class is defined, and,
4974 on the other, default arguments are valid in things like:
4975 template <class T = double>
4976 struct S { template <class U> void f(U); };
4977 Here the default argument for `S' has no bearing on the
4978 declaration of `f'. */
4979 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4981 /* Check everything. */
4982 last_level_to_check
= 0;
4984 for (parm_level
= parms
;
4985 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4986 parm_level
= TREE_CHAIN (parm_level
))
4988 tree inner_parms
= TREE_VALUE (parm_level
);
4992 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4993 for (i
= 0; i
< ntparms
; ++i
)
4995 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4998 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
5003 if (is_friend_decl
== 2)
5010 /* Clear out the default argument so that we are not
5012 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
5016 /* At this point, if we're still interested in issuing messages,
5017 they must apply to classes surrounding the object declared. */
5019 msg
= G_("default argument for template parameter for class "
5026 /* Worker for push_template_decl_real, called via
5027 for_each_template_parm. DATA is really an int, indicating the
5028 level of the parameters we are interested in. If T is a template
5029 parameter of that level, return nonzero. */
5032 template_parm_this_level_p (tree t
, void* data
)
5034 int this_level
= *(int *)data
;
5037 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
5038 level
= TEMPLATE_PARM_LEVEL (t
);
5040 level
= TEMPLATE_TYPE_LEVEL (t
);
5041 return level
== this_level
;
5044 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
5045 parameters given by current_template_args, or reuses a
5046 previously existing one, if appropriate. Returns the DECL, or an
5047 equivalent one, if it is replaced via a call to duplicate_decls.
5049 If IS_FRIEND is true, DECL is a friend declaration. */
5052 push_template_decl_real (tree decl
, bool is_friend
)
5060 int new_template_p
= 0;
5061 /* True if the template is a member template, in the sense of
5063 bool member_template_p
= false;
5065 if (decl
== error_mark_node
|| !current_template_parms
)
5066 return error_mark_node
;
5068 /* See if this is a partial specialization. */
5069 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
5070 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
5071 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
5073 && DECL_LANG_SPECIFIC (decl
)
5074 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5075 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
5077 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
5081 /* For a friend, we want the context of the friend function, not
5082 the type of which it is a friend. */
5083 ctx
= CP_DECL_CONTEXT (decl
);
5084 else if (CP_DECL_CONTEXT (decl
)
5085 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
5086 /* In the case of a virtual function, we want the class in which
5088 ctx
= CP_DECL_CONTEXT (decl
);
5090 /* Otherwise, if we're currently defining some class, the DECL
5091 is assumed to be a member of the class. */
5092 ctx
= current_scope ();
5094 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5097 if (!DECL_CONTEXT (decl
))
5098 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
5100 /* See if this is a primary template. */
5101 if (is_friend
&& ctx
5102 && uses_template_parms_level (ctx
, processing_template_decl
))
5103 /* A friend template that specifies a class context, i.e.
5104 template <typename T> friend void A<T>::f();
5107 else if (TREE_CODE (decl
) == TYPE_DECL
5108 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5111 is_primary
= template_parm_scope_p ();
5115 warning (OPT_Wtemplates
, "template %qD declared", decl
);
5117 if (DECL_CLASS_SCOPE_P (decl
))
5118 member_template_p
= true;
5119 if (TREE_CODE (decl
) == TYPE_DECL
5120 && anon_aggrname_p (DECL_NAME (decl
)))
5122 error ("template class without a name");
5123 return error_mark_node
;
5125 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
5127 if (member_template_p
)
5129 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
5130 error ("member template %qD may not have virt-specifiers", decl
);
5132 if (DECL_DESTRUCTOR_P (decl
))
5136 A destructor shall not be a member template. */
5137 error ("destructor %qD declared as member template", decl
);
5138 return error_mark_node
;
5140 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
5141 && (!prototype_p (TREE_TYPE (decl
))
5142 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
5143 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
5144 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
5145 == void_list_node
)))
5147 /* [basic.stc.dynamic.allocation]
5149 An allocation function can be a function
5150 template. ... Template allocation functions shall
5151 have two or more parameters. */
5152 error ("invalid template declaration of %qD", decl
);
5153 return error_mark_node
;
5156 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5157 && CLASS_TYPE_P (TREE_TYPE (decl
)))
5159 else if (TREE_CODE (decl
) == TYPE_DECL
5160 && TYPE_DECL_ALIAS_P (decl
))
5161 /* alias-declaration */
5162 gcc_assert (!DECL_ARTIFICIAL (decl
));
5163 else if (VAR_P (decl
))
5164 /* C++14 variable template. */;
5167 error ("template declaration of %q#D", decl
);
5168 return error_mark_node
;
5172 /* Check to see that the rules regarding the use of default
5173 arguments are not being violated. */
5174 check_default_tmpl_args (decl
, current_template_parms
,
5175 is_primary
, is_partial
, /*is_friend_decl=*/0);
5177 /* Ensure that there are no parameter packs in the type of this
5178 declaration that have not been expanded. */
5179 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5181 /* Check each of the arguments individually to see if there are
5182 any bare parameter packs. */
5183 tree type
= TREE_TYPE (decl
);
5184 tree arg
= DECL_ARGUMENTS (decl
);
5185 tree argtype
= TYPE_ARG_TYPES (type
);
5187 while (arg
&& argtype
)
5189 if (!DECL_PACK_P (arg
)
5190 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
5192 /* This is a PARM_DECL that contains unexpanded parameter
5193 packs. We have already complained about this in the
5194 check_for_bare_parameter_packs call, so just replace
5195 these types with ERROR_MARK_NODE. */
5196 TREE_TYPE (arg
) = error_mark_node
;
5197 TREE_VALUE (argtype
) = error_mark_node
;
5200 arg
= DECL_CHAIN (arg
);
5201 argtype
= TREE_CHAIN (argtype
);
5204 /* Check for bare parameter packs in the return type and the
5205 exception specifiers. */
5206 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
5207 /* Errors were already issued, set return type to int
5208 as the frontend doesn't expect error_mark_node as
5210 TREE_TYPE (type
) = integer_type_node
;
5211 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
5212 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
5214 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
5215 && TYPE_DECL_ALIAS_P (decl
))
5216 ? DECL_ORIGINAL_TYPE (decl
)
5217 : TREE_TYPE (decl
)))
5219 TREE_TYPE (decl
) = error_mark_node
;
5220 return error_mark_node
;
5224 return process_partial_specialization (decl
);
5226 args
= current_template_args ();
5229 || TREE_CODE (ctx
) == FUNCTION_DECL
5230 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
5231 || (TREE_CODE (decl
) == TYPE_DECL
5232 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
5233 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
5235 if (DECL_LANG_SPECIFIC (decl
)
5236 && DECL_TEMPLATE_INFO (decl
)
5237 && DECL_TI_TEMPLATE (decl
))
5238 tmpl
= DECL_TI_TEMPLATE (decl
);
5239 /* If DECL is a TYPE_DECL for a class-template, then there won't
5240 be DECL_LANG_SPECIFIC. The information equivalent to
5241 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
5242 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
5243 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
5244 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
5246 /* Since a template declaration already existed for this
5247 class-type, we must be redeclaring it here. Make sure
5248 that the redeclaration is valid. */
5249 redeclare_class_template (TREE_TYPE (decl
),
5250 current_template_parms
,
5251 current_template_constraints ());
5252 /* We don't need to create a new TEMPLATE_DECL; just use the
5253 one we already had. */
5254 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
5258 tmpl
= build_template_decl (decl
, current_template_parms
,
5262 if (DECL_LANG_SPECIFIC (decl
)
5263 && DECL_TEMPLATE_SPECIALIZATION (decl
))
5265 /* A specialization of a member template of a template
5267 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
5268 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
5269 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
5275 tree a
, t
, current
, parms
;
5277 tree tinfo
= get_template_info (decl
);
5281 error ("template definition of non-template %q#D", decl
);
5282 return error_mark_node
;
5285 tmpl
= TI_TEMPLATE (tinfo
);
5287 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
5288 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
5289 && DECL_TEMPLATE_SPECIALIZATION (decl
)
5290 && DECL_MEMBER_TEMPLATE_P (tmpl
))
5294 /* The declaration is a specialization of a member
5295 template, declared outside the class. Therefore, the
5296 innermost template arguments will be NULL, so we
5297 replace them with the arguments determined by the
5298 earlier call to check_explicit_specialization. */
5299 args
= DECL_TI_ARGS (decl
);
5302 = build_template_decl (decl
, current_template_parms
,
5304 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5305 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5306 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5307 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5308 DECL_TEMPLATE_INFO (new_tmpl
)
5309 = build_template_info (tmpl
, args
);
5311 register_specialization (new_tmpl
,
5312 most_general_template (tmpl
),
5318 /* Make sure the template headers we got make sense. */
5320 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5321 i
= TMPL_PARMS_DEPTH (parms
);
5322 if (TMPL_ARGS_DEPTH (args
) != i
)
5324 error ("expected %d levels of template parms for %q#D, got %d",
5325 i
, decl
, TMPL_ARGS_DEPTH (args
));
5326 DECL_INTERFACE_KNOWN (decl
) = 1;
5327 return error_mark_node
;
5330 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5332 a
= TMPL_ARGS_LEVEL (args
, i
);
5333 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5335 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5337 if (current
== decl
)
5338 error ("got %d template parameters for %q#D",
5339 TREE_VEC_LENGTH (a
), decl
);
5341 error ("got %d template parameters for %q#T",
5342 TREE_VEC_LENGTH (a
), current
);
5343 error (" but %d required", TREE_VEC_LENGTH (t
));
5344 /* Avoid crash in import_export_decl. */
5345 DECL_INTERFACE_KNOWN (decl
) = 1;
5346 return error_mark_node
;
5349 if (current
== decl
)
5351 else if (current
== NULL_TREE
)
5352 /* Can happen in erroneous input. */
5355 current
= get_containing_scope (current
);
5358 /* Check that the parms are used in the appropriate qualifying scopes
5359 in the declarator. */
5360 if (!comp_template_args
5362 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5365 template arguments to %qD do not match original template %qD",
5366 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5367 if (!uses_template_parms (TI_ARGS (tinfo
)))
5368 inform (input_location
, "use template<> for an explicit specialization");
5369 /* Avoid crash in import_export_decl. */
5370 DECL_INTERFACE_KNOWN (decl
) = 1;
5371 return error_mark_node
;
5375 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5376 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5378 /* Push template declarations for global functions and types. Note
5379 that we do not try to push a global template friend declared in a
5380 template class; such a thing may well depend on the template
5381 parameters of the class. */
5382 if (new_template_p
&& !ctx
5383 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5385 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5386 if (tmpl
== error_mark_node
)
5387 return error_mark_node
;
5389 /* Hide template friend classes that haven't been declared yet. */
5390 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5392 DECL_ANTICIPATED (tmpl
) = 1;
5393 DECL_FRIEND_P (tmpl
) = 1;
5399 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5402 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5403 if (DECL_CONV_FN_P (tmpl
))
5405 int depth
= TMPL_PARMS_DEPTH (parms
);
5407 /* It is a conversion operator. See if the type converted to
5408 depends on innermost template operands. */
5410 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5412 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5415 /* Give template template parms a DECL_CONTEXT of the template
5416 for which they are a parameter. */
5417 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5418 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5420 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5421 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5422 DECL_CONTEXT (parm
) = tmpl
;
5425 if (TREE_CODE (decl
) == TYPE_DECL
5426 && TYPE_DECL_ALIAS_P (decl
)
5427 && complex_alias_template_p (tmpl
))
5428 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5431 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5432 back to its most general template. If TMPL is a specialization,
5433 ARGS may only have the innermost set of arguments. Add the missing
5434 argument levels if necessary. */
5435 if (DECL_TEMPLATE_INFO (tmpl
))
5436 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5438 info
= build_template_info (tmpl
, args
);
5440 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5441 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5444 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5445 retrofit_lang_decl (decl
);
5446 if (DECL_LANG_SPECIFIC (decl
))
5447 DECL_TEMPLATE_INFO (decl
) = info
;
5450 if (flag_implicit_templates
5452 && TREE_PUBLIC (decl
)
5453 && VAR_OR_FUNCTION_DECL_P (decl
))
5454 /* Set DECL_COMDAT on template instantiations; if we force
5455 them to be emitted by explicit instantiation or -frepo,
5456 mark_needed will tell cgraph to do the right thing. */
5457 DECL_COMDAT (decl
) = true;
5459 return DECL_TEMPLATE_RESULT (tmpl
);
5463 push_template_decl (tree decl
)
5465 return push_template_decl_real (decl
, false);
5468 /* FN is an inheriting constructor that inherits from the constructor
5469 template INHERITED; turn FN into a constructor template with a matching
5473 add_inherited_template_parms (tree fn
, tree inherited
)
5476 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5477 inner_parms
= copy_node (inner_parms
);
5479 = tree_cons (size_int (processing_template_decl
+ 1),
5480 inner_parms
, current_template_parms
);
5481 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5482 tree args
= template_parms_to_args (parms
);
5483 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5484 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5485 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5486 DECL_ARTIFICIAL (tmpl
) = true;
5487 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5491 /* Called when a class template TYPE is redeclared with the indicated
5492 template PARMS, e.g.:
5494 template <class T> struct S;
5495 template <class T> struct S {}; */
5498 redeclare_class_template (tree type
, tree parms
, tree cons
)
5504 if (!TYPE_TEMPLATE_INFO (type
))
5506 error ("%qT is not a template type", type
);
5510 tmpl
= TYPE_TI_TEMPLATE (type
);
5511 if (!PRIMARY_TEMPLATE_P (tmpl
))
5512 /* The type is nested in some template class. Nothing to worry
5513 about here; there are no new template parameters for the nested
5519 error ("template specifiers not specified in declaration of %qD",
5524 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5525 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5527 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5529 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5530 "redeclared with %d template parameter",
5531 "redeclared with %d template parameters",
5532 TREE_VEC_LENGTH (parms
));
5533 inform_n (DECL_SOURCE_LOCATION (tmpl
), TREE_VEC_LENGTH (tmpl_parms
),
5534 "previous declaration %qD used %d template parameter",
5535 "previous declaration %qD used %d template parameters",
5536 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5540 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5547 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5548 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5551 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5552 if (error_operand_p (tmpl_parm
))
5555 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5556 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5557 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5559 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5561 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5562 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5563 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5564 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5565 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5566 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5567 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5568 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5569 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5571 error ("template parameter %q+#D", tmpl_parm
);
5572 error ("redeclared here as %q#D", parm
);
5576 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5578 /* We have in [temp.param]:
5580 A template-parameter may not be given default arguments
5581 by two different declarations in the same scope. */
5582 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5583 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5584 "original definition appeared here");
5588 if (parm_default
!= NULL_TREE
)
5589 /* Update the previous template parameters (which are the ones
5590 that will really count) with the new default value. */
5591 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5592 else if (tmpl_default
!= NULL_TREE
)
5593 /* Update the new parameters, too; they'll be used as the
5594 parameters for any members. */
5595 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5597 /* Give each template template parm in this redeclaration a
5598 DECL_CONTEXT of the template for which they are a parameter. */
5599 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5601 gcc_assert (DECL_CONTEXT (parm
) == NULL_TREE
);
5602 DECL_CONTEXT (parm
) = tmpl
;
5606 // Cannot redeclare a class template with a different set of constraints.
5607 if (!equivalent_constraints (get_constraints (tmpl
), cons
))
5609 error_at (input_location
, "redeclaration %q#D with different "
5610 "constraints", tmpl
);
5611 inform (DECL_SOURCE_LOCATION (tmpl
),
5612 "original declaration appeared here");
5618 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5619 to be used when the caller has already checked
5620 (processing_template_decl
5621 && !instantiation_dependent_expression_p (expr)
5622 && potential_constant_expression (expr))
5623 and cleared processing_template_decl. */
5626 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5628 return tsubst_copy_and_build (expr
,
5631 /*in_decl=*/NULL_TREE
,
5632 /*function_p=*/false,
5633 /*integral_constant_expression_p=*/true);
5636 /* Simplify EXPR if it is a non-dependent expression. Returns the
5637 (possibly simplified) expression. */
5640 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5642 if (expr
== NULL_TREE
)
5645 /* If we're in a template, but EXPR isn't value dependent, simplify
5646 it. We're supposed to treat:
5648 template <typename T> void f(T[1 + 1]);
5649 template <typename T> void f(T[2]);
5651 as two declarations of the same function, for example. */
5652 if (processing_template_decl
5653 && !instantiation_dependent_expression_p (expr
)
5654 && potential_constant_expression (expr
))
5656 processing_template_decl_sentinel s
;
5657 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5663 instantiate_non_dependent_expr (tree expr
)
5665 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5668 /* Like instantiate_non_dependent_expr, but return NULL_TREE rather than
5669 an uninstantiated expression. */
5672 instantiate_non_dependent_or_null (tree expr
)
5674 if (expr
== NULL_TREE
)
5676 if (processing_template_decl
)
5678 if (instantiation_dependent_expression_p (expr
)
5679 || !potential_constant_expression (expr
))
5683 processing_template_decl_sentinel s
;
5684 expr
= instantiate_non_dependent_expr_internal (expr
, tf_error
);
5690 /* True iff T is a specialization of a variable template. */
5693 variable_template_specialization_p (tree t
)
5695 if (!VAR_P (t
) || !DECL_LANG_SPECIFIC (t
) || !DECL_TEMPLATE_INFO (t
))
5697 tree tmpl
= DECL_TI_TEMPLATE (t
);
5698 return variable_template_p (tmpl
);
5701 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5702 template declaration, or a TYPE_DECL for an alias declaration. */
5705 alias_type_or_template_p (tree t
)
5709 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5712 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5713 || DECL_ALIAS_TEMPLATE_P (t
));
5716 /* Return TRUE iff T is a specialization of an alias template. */
5719 alias_template_specialization_p (const_tree t
)
5721 /* It's an alias template specialization if it's an alias and its
5722 TYPE_NAME is a specialization of a primary template. */
5723 if (TYPE_ALIAS_P (t
))
5725 tree name
= TYPE_NAME (t
);
5726 if (DECL_LANG_SPECIFIC (name
))
5727 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5729 tree tmpl
= TI_TEMPLATE (ti
);
5730 return PRIMARY_TEMPLATE_P (tmpl
);
5736 /* An alias template is complex from a SFINAE perspective if a template-id
5737 using that alias can be ill-formed when the expansion is not, as with
5738 the void_t template. We determine this by checking whether the
5739 expansion for the alias template uses all its template parameters. */
5741 struct uses_all_template_parms_data
5748 uses_all_template_parms_r (tree t
, void *data_
)
5750 struct uses_all_template_parms_data
&data
5751 = *(struct uses_all_template_parms_data
*)data_
;
5752 tree idx
= get_template_parm_index (t
);
5754 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5755 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5760 complex_alias_template_p (const_tree tmpl
)
5762 struct uses_all_template_parms_data data
;
5763 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5764 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5765 data
.level
= TMPL_PARMS_DEPTH (parms
);
5766 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5767 data
.seen
= XALLOCAVEC (bool, len
);
5768 for (int i
= 0; i
< len
; ++i
)
5769 data
.seen
[i
] = false;
5771 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5772 for (int i
= 0; i
< len
; ++i
)
5778 /* Return TRUE iff T is a specialization of a complex alias template with
5779 dependent template-arguments. */
5782 dependent_alias_template_spec_p (const_tree t
)
5784 return (alias_template_specialization_p (t
)
5785 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5786 && (any_dependent_template_arguments_p
5787 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5790 /* Return the number of innermost template parameters in TMPL. */
5793 num_innermost_template_parms (tree tmpl
)
5795 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5796 return TREE_VEC_LENGTH (parms
);
5799 /* Return either TMPL or another template that it is equivalent to under DR
5800 1286: An alias that just changes the name of a template is equivalent to
5801 the other template. */
5804 get_underlying_template (tree tmpl
)
5806 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5807 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5809 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5810 if (TYPE_TEMPLATE_INFO (result
))
5812 tree sub
= TYPE_TI_TEMPLATE (result
);
5813 if (PRIMARY_TEMPLATE_P (sub
)
5814 && (num_innermost_template_parms (tmpl
)
5815 == num_innermost_template_parms (sub
)))
5817 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5818 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5819 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5821 /* The alias type is equivalent to the pattern of the
5822 underlying template, so strip the alias. */
5832 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5833 must be a function or a pointer-to-function type, as specified
5834 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5835 and check that the resulting function has external linkage. */
5838 convert_nontype_argument_function (tree type
, tree expr
,
5839 tsubst_flags_t complain
)
5843 linkage_kind linkage
;
5845 fn
= instantiate_type (type
, fns
, tf_none
);
5846 if (fn
== error_mark_node
)
5847 return error_mark_node
;
5850 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5851 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5852 if (BASELINK_P (fn_no_ptr
))
5853 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5855 /* [temp.arg.nontype]/1
5857 A template-argument for a non-type, non-template template-parameter
5860 -- the address of an object or function with external [C++11: or
5861 internal] linkage. */
5863 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5865 if (complain
& tf_error
)
5867 error ("%qE is not a valid template argument for type %qT",
5869 if (TYPE_PTR_P (type
))
5870 error ("it must be the address of a function with "
5871 "external linkage");
5873 error ("it must be the name of a function with "
5874 "external linkage");
5879 linkage
= decl_linkage (fn_no_ptr
);
5880 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5882 if (complain
& tf_error
)
5884 if (cxx_dialect
>= cxx11
)
5885 error ("%qE is not a valid template argument for type %qT "
5886 "because %qD has no linkage",
5887 expr
, type
, fn_no_ptr
);
5889 error ("%qE is not a valid template argument for type %qT "
5890 "because %qD does not have external linkage",
5891 expr
, type
, fn_no_ptr
);
5899 /* Subroutine of convert_nontype_argument.
5900 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5901 Emit an error otherwise. */
5904 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5905 tsubst_flags_t complain
)
5908 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5910 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5912 if (processing_template_decl
5913 && TREE_CODE (expr
) == ADDR_EXPR
5914 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5916 if (complain
& tf_error
)
5918 error ("%qE is not a valid template argument for type %qT",
5920 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5925 /* Returns TRUE iff the address of OP is value-dependent.
5927 14.6.2.4 [temp.dep.temp]:
5928 A non-integral non-type template-argument is dependent if its type is
5929 dependent or it has either of the following forms
5932 and contains a nested-name-specifier which specifies a class-name that
5933 names a dependent type.
5935 We generalize this to just say that the address of a member of a
5936 dependent class is value-dependent; the above doesn't cover the
5937 address of a static data member named with an unqualified-id. */
5940 has_value_dependent_address (tree op
)
5942 /* We could use get_inner_reference here, but there's no need;
5943 this is only relevant for template non-type arguments, which
5944 can only be expressed as &id-expression. */
5947 tree ctx
= CP_DECL_CONTEXT (op
);
5948 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5955 /* The next set of functions are used for providing helpful explanatory
5956 diagnostics for failed overload resolution. Their messages should be
5957 indented by two spaces for consistency with the messages in
5961 unify_success (bool /*explain_p*/)
5967 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5970 inform (input_location
,
5971 " couldn't deduce template parameter %qD", parm
);
5976 unify_invalid (bool /*explain_p*/)
5982 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5985 inform (input_location
,
5986 " types %qT and %qT have incompatible cv-qualifiers",
5992 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5995 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
6000 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
6003 inform (input_location
,
6004 " template parameter %qD is not a parameter pack, but "
6011 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
6014 inform (input_location
,
6015 " template argument %qE does not match "
6016 "pointer-to-member constant %qE",
6022 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
6025 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
6030 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
6033 inform (input_location
,
6034 " inconsistent parameter pack deduction with %qT and %qT",
6040 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
6045 inform (input_location
,
6046 " deduced conflicting types for parameter %qT (%qT and %qT)",
6047 parm
, first
, second
);
6049 inform (input_location
,
6050 " deduced conflicting values for non-type parameter "
6051 "%qE (%qE and %qE)", parm
, first
, second
);
6057 unify_vla_arg (bool explain_p
, tree arg
)
6060 inform (input_location
,
6061 " variable-sized array type %qT is not "
6062 "a valid template argument",
6068 unify_method_type_error (bool explain_p
, tree arg
)
6071 inform (input_location
,
6072 " member function type %qT is not a valid template argument",
6078 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
6083 inform_n (input_location
, wanted
,
6084 " candidate expects at least %d argument, %d provided",
6085 " candidate expects at least %d arguments, %d provided",
6088 inform_n (input_location
, wanted
,
6089 " candidate expects %d argument, %d provided",
6090 " candidate expects %d arguments, %d provided",
6097 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
6099 return unify_arity (explain_p
, have
, wanted
);
6103 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
6104 bool least_p
= false)
6106 return unify_arity (explain_p
, have
, wanted
, least_p
);
6110 unify_arg_conversion (bool explain_p
, tree to_type
,
6111 tree from_type
, tree arg
)
6114 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
6115 " cannot convert %qE (type %qT) to type %qT",
6116 arg
, from_type
, to_type
);
6121 unify_no_common_base (bool explain_p
, enum template_base_result r
,
6122 tree parm
, tree arg
)
6127 case tbr_ambiguous_baseclass
:
6128 inform (input_location
, " %qT is an ambiguous base class of %qT",
6132 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
6139 unify_inconsistent_template_template_parameters (bool explain_p
)
6142 inform (input_location
,
6143 " template parameters of a template template argument are "
6144 "inconsistent with other deduced template arguments");
6149 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
6152 inform (input_location
,
6153 " can't deduce a template for %qT from non-template type %qT",
6159 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
6162 inform (input_location
,
6163 " template argument %qE does not match %qD", arg
, parm
);
6168 unify_overload_resolution_failure (bool explain_p
, tree arg
)
6171 inform (input_location
,
6172 " could not resolve address from overloaded function %qE",
6177 /* Attempt to convert the non-type template parameter EXPR to the
6178 indicated TYPE. If the conversion is successful, return the
6179 converted value. If the conversion is unsuccessful, return
6180 NULL_TREE if we issued an error message, or error_mark_node if we
6181 did not. We issue error messages for out-and-out bad template
6182 parameters, but not simply because the conversion failed, since we
6183 might be just trying to do argument deduction. Both TYPE and EXPR
6184 must be non-dependent.
6186 The conversion follows the special rules described in
6187 [temp.arg.nontype], and it is much more strict than an implicit
6190 This function is called twice for each template argument (see
6191 lookup_template_class for a more accurate description of this
6192 problem). This means that we need to handle expressions which
6193 are not valid in a C++ source, but can be created from the
6194 first call (for instance, casts to perform conversions). These
6195 hacks can go away after we fix the double coercion problem. */
6198 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
6202 /* Detect immediately string literals as invalid non-type argument.
6203 This special-case is not needed for correctness (we would easily
6204 catch this later), but only to provide better diagnostic for this
6205 common user mistake. As suggested by DR 100, we do not mention
6206 linkage issues in the diagnostic as this is not the point. */
6207 /* FIXME we're making this OK. */
6208 if (TREE_CODE (expr
) == STRING_CST
)
6210 if (complain
& tf_error
)
6211 error ("%qE is not a valid template argument for type %qT "
6212 "because string literals can never be used in this context",
6217 /* Add the ADDR_EXPR now for the benefit of
6218 value_dependent_expression_p. */
6219 if (TYPE_PTROBV_P (type
)
6220 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
6222 expr
= decay_conversion (expr
, complain
);
6223 if (expr
== error_mark_node
)
6224 return error_mark_node
;
6227 /* If we are in a template, EXPR may be non-dependent, but still
6228 have a syntactic, rather than semantic, form. For example, EXPR
6229 might be a SCOPE_REF, rather than the VAR_DECL to which the
6230 SCOPE_REF refers. Preserving the qualifying scope is necessary
6231 so that access checking can be performed when the template is
6232 instantiated -- but here we need the resolved form so that we can
6233 convert the argument. */
6234 bool non_dep
= false;
6235 if (TYPE_REF_OBJ_P (type
)
6236 && has_value_dependent_address (expr
))
6237 /* If we want the address and it's value-dependent, don't fold. */;
6238 else if (!type_unknown_p (expr
)
6239 && processing_template_decl
6240 && !instantiation_dependent_expression_p (expr
)
6241 && potential_constant_expression (expr
))
6243 if (error_operand_p (expr
))
6244 return error_mark_node
;
6245 expr_type
= TREE_TYPE (expr
);
6246 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6247 expr
= mark_lvalue_use (expr
);
6249 expr
= mark_rvalue_use (expr
);
6251 /* If the argument is non-dependent, perform any conversions in
6252 non-dependent context as well. */
6253 processing_template_decl_sentinel
s (non_dep
);
6255 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
6257 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
6258 to a non-type argument of "nullptr". */
6259 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
6260 expr
= fold_simple (convert (type
, expr
));
6262 /* In C++11, integral or enumeration non-type template arguments can be
6263 arbitrary constant expressions. Pointer and pointer to
6264 member arguments can be general constant expressions that evaluate
6265 to a null value, but otherwise still need to be of a specific form. */
6266 if (cxx_dialect
>= cxx11
)
6268 if (TREE_CODE (expr
) == PTRMEM_CST
)
6269 /* A PTRMEM_CST is already constant, and a valid template
6270 argument for a parameter of pointer to member type, we just want
6271 to leave it in that form rather than lower it to a
6273 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6274 expr
= maybe_constant_value (expr
);
6275 else if (cxx_dialect
>= cxx1z
)
6277 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6278 expr
= maybe_constant_value (expr
);
6279 else if (REFERENCE_REF_P (expr
))
6281 expr
= TREE_OPERAND (expr
, 0);
6282 expr
= maybe_constant_value (expr
);
6283 expr
= convert_from_reference (expr
);
6286 else if (TYPE_PTR_OR_PTRMEM_P (type
))
6288 tree folded
= maybe_constant_value (expr
);
6289 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
6290 : null_member_pointer_value_p (folded
))
6295 /* HACK: Due to double coercion, we can get a
6296 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
6297 which is the tree that we built on the first call (see
6298 below when coercing to reference to object or to reference to
6299 function). We just strip everything and get to the arg.
6300 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
6302 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
6304 tree probe_type
, probe
= expr
;
6305 if (REFERENCE_REF_P (probe
))
6306 probe
= TREE_OPERAND (probe
, 0);
6307 probe_type
= TREE_TYPE (probe
);
6308 if (TREE_CODE (probe
) == NOP_EXPR
)
6310 /* ??? Maybe we could use convert_from_reference here, but we
6311 would need to relax its constraints because the NOP_EXPR
6312 could actually change the type to something more cv-qualified,
6313 and this is not folded by convert_from_reference. */
6314 tree addr
= TREE_OPERAND (probe
, 0);
6315 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
6316 && TREE_CODE (addr
) == ADDR_EXPR
6317 && TYPE_PTR_P (TREE_TYPE (addr
))
6318 && (same_type_ignoring_top_level_qualifiers_p
6319 (TREE_TYPE (probe_type
),
6320 TREE_TYPE (TREE_TYPE (addr
)))))
6322 expr
= TREE_OPERAND (addr
, 0);
6323 expr_type
= TREE_TYPE (probe_type
);
6328 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
6329 parameter is a pointer to object, through decay and
6330 qualification conversion. Let's strip everything. */
6331 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
6335 if (TREE_CODE (probe
) == ADDR_EXPR
6336 && TYPE_PTR_P (TREE_TYPE (probe
)))
6338 /* Skip the ADDR_EXPR only if it is part of the decay for
6339 an array. Otherwise, it is part of the original argument
6340 in the source code. */
6341 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
6342 probe
= TREE_OPERAND (probe
, 0);
6344 expr_type
= TREE_TYPE (expr
);
6348 /* [temp.arg.nontype]/5, bullet 1
6350 For a non-type template-parameter of integral or enumeration type,
6351 integral promotions (_conv.prom_) and integral conversions
6352 (_conv.integral_) are applied. */
6353 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6355 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
6356 t
= maybe_constant_value (t
);
6357 if (t
!= error_mark_node
)
6360 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6361 return error_mark_node
;
6363 /* Notice that there are constant expressions like '4 % 0' which
6364 do not fold into integer constants. */
6365 if (TREE_CODE (expr
) != INTEGER_CST
)
6367 if (complain
& tf_error
)
6369 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6370 if (processing_template_decl
6371 && !require_potential_constant_expression (expr
))
6373 expr
= cxx_constant_value (expr
);
6374 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6375 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6376 "in template argument for type %qT ", type
);
6377 if (expr
== error_mark_node
)
6379 /* else cxx_constant_value complained but gave us
6380 a real constant, so go ahead. */
6381 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6387 /* Avoid typedef problems. */
6388 if (TREE_TYPE (expr
) != type
)
6389 expr
= fold_convert (type
, expr
);
6391 /* [temp.arg.nontype]/5, bullet 2
6393 For a non-type template-parameter of type pointer to object,
6394 qualification conversions (_conv.qual_) and the array-to-pointer
6395 conversion (_conv.array_) are applied. */
6396 else if (TYPE_PTROBV_P (type
))
6398 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6400 A template-argument for a non-type, non-template template-parameter
6401 shall be one of: [...]
6403 -- the name of a non-type template-parameter;
6404 -- the address of an object or function with external linkage, [...]
6405 expressed as "& id-expression" where the & is optional if the name
6406 refers to a function or array, or if the corresponding
6407 template-parameter is a reference.
6409 Here, we do not care about functions, as they are invalid anyway
6410 for a parameter of type pointer-to-object. */
6412 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6413 /* Non-type template parameters are OK. */
6415 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6416 /* Null pointer values are OK in C++11. */;
6417 else if (TREE_CODE (expr
) != ADDR_EXPR
6418 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6422 if (complain
& tf_error
)
6423 error ("%qD is not a valid template argument "
6424 "because %qD is a variable, not the address of "
6425 "a variable", expr
, expr
);
6428 if (POINTER_TYPE_P (expr_type
))
6430 if (complain
& tf_error
)
6431 error ("%qE is not a valid template argument for %qT "
6432 "because it is not the address of a variable",
6436 /* Other values, like integer constants, might be valid
6437 non-type arguments of some other type. */
6438 return error_mark_node
;
6444 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6445 ? TREE_OPERAND (expr
, 0) : expr
);
6448 if (complain
& tf_error
)
6449 error ("%qE is not a valid template argument of type %qT "
6450 "because %qE is not a variable", expr
, type
, decl
);
6453 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6455 if (complain
& tf_error
)
6456 error ("%qE is not a valid template argument of type %qT "
6457 "because %qD does not have external linkage",
6461 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6463 if (complain
& tf_error
)
6464 error ("%qE is not a valid template argument of type %qT "
6465 "because %qD has no linkage", expr
, type
, decl
);
6470 expr
= decay_conversion (expr
, complain
);
6471 if (expr
== error_mark_node
)
6472 return error_mark_node
;
6474 expr
= perform_qualification_conversions (type
, expr
);
6475 if (expr
== error_mark_node
)
6476 return error_mark_node
;
6478 /* [temp.arg.nontype]/5, bullet 3
6480 For a non-type template-parameter of type reference to object, no
6481 conversions apply. The type referred to by the reference may be more
6482 cv-qualified than the (otherwise identical) type of the
6483 template-argument. The template-parameter is bound directly to the
6484 template-argument, which must be an lvalue. */
6485 else if (TYPE_REF_OBJ_P (type
))
6487 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6489 return error_mark_node
;
6491 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6493 if (complain
& tf_error
)
6494 error ("%qE is not a valid template argument for type %qT "
6495 "because of conflicts in cv-qualification", expr
, type
);
6499 if (!real_lvalue_p (expr
))
6501 if (complain
& tf_error
)
6502 error ("%qE is not a valid template argument for type %qT "
6503 "because it is not an lvalue", expr
, type
);
6507 /* [temp.arg.nontype]/1
6509 A template-argument for a non-type, non-template template-parameter
6510 shall be one of: [...]
6512 -- the address of an object or function with external linkage. */
6513 if (INDIRECT_REF_P (expr
)
6514 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6516 expr
= TREE_OPERAND (expr
, 0);
6519 if (complain
& tf_error
)
6520 error ("%q#D is not a valid template argument for type %qT "
6521 "because a reference variable does not have a constant "
6522 "address", expr
, type
);
6529 if (complain
& tf_error
)
6530 error ("%qE is not a valid template argument for type %qT "
6531 "because it is not an object with linkage",
6536 /* DR 1155 allows internal linkage in C++11 and up. */
6537 linkage_kind linkage
= decl_linkage (expr
);
6538 if (linkage
< (cxx_dialect
>= cxx11
? lk_internal
: lk_external
))
6540 if (complain
& tf_error
)
6541 error ("%qE is not a valid template argument for type %qT "
6542 "because object %qD does not have linkage",
6547 expr
= build_nop (type
, build_address (expr
));
6549 /* [temp.arg.nontype]/5, bullet 4
6551 For a non-type template-parameter of type pointer to function, only
6552 the function-to-pointer conversion (_conv.func_) is applied. If the
6553 template-argument represents a set of overloaded functions (or a
6554 pointer to such), the matching function is selected from the set
6556 else if (TYPE_PTRFN_P (type
))
6558 /* If the argument is a template-id, we might not have enough
6559 context information to decay the pointer. */
6560 if (!type_unknown_p (expr_type
))
6562 expr
= decay_conversion (expr
, complain
);
6563 if (expr
== error_mark_node
)
6564 return error_mark_node
;
6567 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6568 /* Null pointer values are OK in C++11. */
6569 return perform_qualification_conversions (type
, expr
);
6571 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6572 if (!expr
|| expr
== error_mark_node
)
6575 /* [temp.arg.nontype]/5, bullet 5
6577 For a non-type template-parameter of type reference to function, no
6578 conversions apply. If the template-argument represents a set of
6579 overloaded functions, the matching function is selected from the set
6581 else if (TYPE_REFFN_P (type
))
6583 if (TREE_CODE (expr
) == ADDR_EXPR
)
6585 if (complain
& tf_error
)
6587 error ("%qE is not a valid template argument for type %qT "
6588 "because it is a pointer", expr
, type
);
6589 inform (input_location
, "try using %qE instead",
6590 TREE_OPERAND (expr
, 0));
6595 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6596 if (!expr
|| expr
== error_mark_node
)
6599 expr
= build_nop (type
, build_address (expr
));
6601 /* [temp.arg.nontype]/5, bullet 6
6603 For a non-type template-parameter of type pointer to member function,
6604 no conversions apply. If the template-argument represents a set of
6605 overloaded member functions, the matching member function is selected
6606 from the set (_over.over_). */
6607 else if (TYPE_PTRMEMFUNC_P (type
))
6609 expr
= instantiate_type (type
, expr
, tf_none
);
6610 if (expr
== error_mark_node
)
6611 return error_mark_node
;
6613 /* [temp.arg.nontype] bullet 1 says the pointer to member
6614 expression must be a pointer-to-member constant. */
6615 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6616 return error_mark_node
;
6618 /* There is no way to disable standard conversions in
6619 resolve_address_of_overloaded_function (called by
6620 instantiate_type). It is possible that the call succeeded by
6621 converting &B::I to &D::I (where B is a base of D), so we need
6622 to reject this conversion here.
6624 Actually, even if there was a way to disable standard conversions,
6625 it would still be better to reject them here so that we can
6626 provide a superior diagnostic. */
6627 if (!same_type_p (TREE_TYPE (expr
), type
))
6629 if (complain
& tf_error
)
6631 error ("%qE is not a valid template argument for type %qT "
6632 "because it is of type %qT", expr
, type
,
6634 /* If we are just one standard conversion off, explain. */
6635 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6636 inform (input_location
,
6637 "standard conversions are not allowed in this context");
6642 /* [temp.arg.nontype]/5, bullet 7
6644 For a non-type template-parameter of type pointer to data member,
6645 qualification conversions (_conv.qual_) are applied. */
6646 else if (TYPE_PTRDATAMEM_P (type
))
6648 /* [temp.arg.nontype] bullet 1 says the pointer to member
6649 expression must be a pointer-to-member constant. */
6650 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6651 return error_mark_node
;
6653 expr
= perform_qualification_conversions (type
, expr
);
6654 if (expr
== error_mark_node
)
6657 else if (NULLPTR_TYPE_P (type
))
6659 if (expr
!= nullptr_node
)
6661 if (complain
& tf_error
)
6662 error ("%qE is not a valid template argument for type %qT "
6663 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6668 /* A template non-type parameter must be one of the above. */
6672 /* Sanity check: did we actually convert the argument to the
6674 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6675 (type
, TREE_TYPE (expr
)));
6676 return convert_from_reference (expr
);
6679 /* Subroutine of coerce_template_template_parms, which returns 1 if
6680 PARM_PARM and ARG_PARM match using the rule for the template
6681 parameters of template template parameters. Both PARM and ARG are
6682 template parameters; the rest of the arguments are the same as for
6683 coerce_template_template_parms.
6686 coerce_template_template_parm (tree parm
,
6688 tsubst_flags_t complain
,
6692 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6693 || parm
== NULL_TREE
|| error_operand_p (parm
))
6696 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6699 switch (TREE_CODE (parm
))
6702 /* We encounter instantiations of templates like
6703 template <template <template <class> class> class TT>
6706 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6707 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6709 if (!coerce_template_template_parms
6710 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6716 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6717 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6718 /* Argument is a parameter pack but parameter is not. */
6723 /* The tsubst call is used to handle cases such as
6725 template <int> class C {};
6726 template <class T, template <T> class TT> class D {};
6729 i.e. the parameter list of TT depends on earlier parameters. */
6730 if (!uses_template_parms (TREE_TYPE (arg
)))
6732 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6733 if (!uses_template_parms (t
)
6734 && !same_type_p (t
, TREE_TYPE (arg
)))
6738 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6739 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6740 /* Argument is a parameter pack but parameter is not. */
6753 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6754 template template parameters. Both PARM_PARMS and ARG_PARMS are
6755 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6758 Consider the example:
6759 template <class T> class A;
6760 template<template <class U> class TT> class B;
6762 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6763 the parameters to A, and OUTER_ARGS contains A. */
6766 coerce_template_template_parms (tree parm_parms
,
6768 tsubst_flags_t complain
,
6772 int nparms
, nargs
, i
;
6776 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6777 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6779 nparms
= TREE_VEC_LENGTH (parm_parms
);
6780 nargs
= TREE_VEC_LENGTH (arg_parms
);
6782 /* Determine whether we have a parameter pack at the end of the
6783 template template parameter's template parameter list. */
6784 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6786 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6788 if (error_operand_p (parm
))
6791 switch (TREE_CODE (parm
))
6795 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6800 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6810 && !(variadic_p
&& nargs
>= nparms
- 1))
6813 /* Check all of the template parameters except the parameter pack at
6814 the end (if any). */
6815 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6817 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6818 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6821 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6822 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6824 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6832 /* Check each of the template parameters in the template
6833 argument against the template parameter pack at the end of
6834 the template template parameter. */
6835 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6838 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6840 for (; i
< nargs
; ++i
)
6842 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6845 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6847 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6856 /* Verifies that the deduced template arguments (in TARGS) for the
6857 template template parameters (in TPARMS) represent valid bindings,
6858 by comparing the template parameter list of each template argument
6859 to the template parameter list of its corresponding template
6860 template parameter, in accordance with DR150. This
6861 routine can only be called after all template arguments have been
6862 deduced. It will return TRUE if all of the template template
6863 parameter bindings are okay, FALSE otherwise. */
6865 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6867 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6870 /* We're dealing with template parms in this process. */
6871 ++processing_template_decl
;
6873 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6875 for (i
= 0; i
< ntparms
; ++i
)
6877 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6878 tree targ
= TREE_VEC_ELT (targs
, i
);
6880 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6882 tree packed_args
= NULL_TREE
;
6885 if (ARGUMENT_PACK_P (targ
))
6887 /* Look inside the argument pack. */
6888 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6889 len
= TREE_VEC_LENGTH (packed_args
);
6892 for (idx
= 0; idx
< len
; ++idx
)
6894 tree targ_parms
= NULL_TREE
;
6897 /* Extract the next argument from the argument
6899 targ
= TREE_VEC_ELT (packed_args
, idx
);
6901 if (PACK_EXPANSION_P (targ
))
6902 /* Look at the pattern of the pack expansion. */
6903 targ
= PACK_EXPANSION_PATTERN (targ
);
6905 /* Extract the template parameters from the template
6907 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6908 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6909 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6910 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6912 /* Verify that we can coerce the template template
6913 parameters from the template argument to the template
6914 parameter. This requires an exact match. */
6916 && !coerce_template_template_parms
6917 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6932 --processing_template_decl
;
6936 /* Since type attributes aren't mangled, we need to strip them from
6937 template type arguments. */
6940 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6942 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6944 bool removed_attributes
= false;
6945 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6946 if (removed_attributes
6947 && (complain
& tf_warning
))
6948 warning (0, "ignoring attributes on template argument %qT", arg
);
6952 // A template declaration can be substituted for a constrained
6953 // template template parameter only when the argument is more
6954 // constrained than the parameter.
6956 is_compatible_template_arg (tree parm
, tree arg
)
6958 tree parm_cons
= get_constraints (parm
);
6960 /* For now, allow constrained template template arguments
6961 and unconstrained template template parameters. */
6962 if (parm_cons
== NULL_TREE
)
6965 tree arg_cons
= get_constraints (arg
);
6967 // If the template parameter is constrained, we need to rewrite its
6968 // constraints in terms of the ARG's template parameters. This ensures
6969 // that all of the template parameter types will have the same depth.
6971 // Note that this is only valid when coerce_template_template_parm is
6972 // true for the innermost template parameters of PARM and ARG. In other
6973 // words, because coercion is successful, this conversion will be valid.
6976 tree args
= template_parms_to_args (DECL_TEMPLATE_PARMS (arg
));
6977 parm_cons
= tsubst_constraint_info (parm_cons
,
6978 INNERMOST_TEMPLATE_ARGS (args
),
6979 tf_none
, NULL_TREE
);
6980 if (parm_cons
== error_mark_node
)
6984 return subsumes (parm_cons
, arg_cons
);
6987 // Convert a placeholder argument into a binding to the original
6988 // parameter. The original parameter is saved as the TREE_TYPE of
6991 convert_wildcard_argument (tree parm
, tree arg
)
6993 TREE_TYPE (arg
) = parm
;
6997 /* Convert the indicated template ARG as necessary to match the
6998 indicated template PARM. Returns the converted ARG, or
6999 error_mark_node if the conversion was unsuccessful. Error and
7000 warning messages are issued under control of COMPLAIN. This
7001 conversion is for the Ith parameter in the parameter list. ARGS is
7002 the full set of template arguments deduced so far. */
7005 convert_template_argument (tree parm
,
7008 tsubst_flags_t complain
,
7014 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
7016 if (parm
== error_mark_node
)
7017 return error_mark_node
;
7019 /* Trivially convert placeholders. */
7020 if (TREE_CODE (arg
) == WILDCARD_DECL
)
7021 return convert_wildcard_argument (parm
, arg
);
7023 if (TREE_CODE (arg
) == TREE_LIST
7024 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
7026 /* The template argument was the name of some
7027 member function. That's usually
7028 invalid, but static members are OK. In any
7029 case, grab the underlying fields/functions
7030 and issue an error later if required. */
7031 orig_arg
= TREE_VALUE (arg
);
7032 TREE_TYPE (arg
) = unknown_type_node
;
7037 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
7038 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
7039 || requires_tmpl_type
);
7041 /* When determining whether an argument pack expansion is a template,
7042 look at the pattern. */
7043 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
7044 arg
= PACK_EXPANSION_PATTERN (arg
);
7046 /* Deal with an injected-class-name used as a template template arg. */
7047 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
7049 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
7050 if (TREE_CODE (t
) == TEMPLATE_DECL
)
7052 if (cxx_dialect
>= cxx11
)
7053 /* OK under DR 1004. */;
7054 else if (complain
& tf_warning_or_error
)
7055 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
7056 " used as template template argument", TYPE_NAME (arg
));
7057 else if (flag_pedantic_errors
)
7065 ((TREE_CODE (arg
) == TEMPLATE_DECL
7066 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
7067 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
7068 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7069 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
7072 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
7073 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
7074 arg
= TYPE_STUB_DECL (arg
);
7076 is_type
= TYPE_P (arg
) || is_tmpl_type
;
7078 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
7079 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
7081 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
7083 if (complain
& tf_error
)
7084 error ("invalid use of destructor %qE as a type", orig_arg
);
7085 return error_mark_node
;
7088 permerror (input_location
,
7089 "to refer to a type member of a template parameter, "
7090 "use %<typename %E%>", orig_arg
);
7092 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
7093 TREE_OPERAND (arg
, 1),
7099 if (is_type
!= requires_type
)
7103 if (complain
& tf_error
)
7105 error ("type/value mismatch at argument %d in template "
7106 "parameter list for %qD",
7109 inform (input_location
,
7110 " expected a constant of type %qT, got %qT",
7112 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
7113 else if (requires_tmpl_type
)
7114 inform (input_location
,
7115 " expected a class template, got %qE", orig_arg
);
7117 inform (input_location
,
7118 " expected a type, got %qE", orig_arg
);
7121 return error_mark_node
;
7123 if (is_tmpl_type
^ requires_tmpl_type
)
7125 if (in_decl
&& (complain
& tf_error
))
7127 error ("type/value mismatch at argument %d in template "
7128 "parameter list for %qD",
7131 inform (input_location
,
7132 " expected a type, got %qT", DECL_NAME (arg
));
7134 inform (input_location
,
7135 " expected a class template, got %qT", orig_arg
);
7137 return error_mark_node
;
7142 if (requires_tmpl_type
)
7144 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7146 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
7147 /* The number of argument required is not known yet.
7148 Just accept it for now. */
7149 val
= TREE_TYPE (arg
);
7152 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
7155 /* Strip alias templates that are equivalent to another
7157 arg
= get_underlying_template (arg
);
7158 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
7160 if (coerce_template_template_parms (parmparm
, argparm
,
7166 /* TEMPLATE_TEMPLATE_PARM node is preferred over
7168 if (val
!= error_mark_node
)
7170 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
7171 val
= TREE_TYPE (val
);
7172 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
7173 val
= make_pack_expansion (val
);
7178 if (in_decl
&& (complain
& tf_error
))
7180 error ("type/value mismatch at argument %d in "
7181 "template parameter list for %qD",
7183 inform (input_location
,
7184 " expected a template of type %qD, got %qT",
7188 val
= error_mark_node
;
7191 // Check that the constraints are compatible before allowing the
7193 if (val
!= error_mark_node
)
7194 if (!is_compatible_template_arg (parm
, arg
))
7196 if (in_decl
&& (complain
& tf_error
))
7198 error ("constraint mismatch at argument %d in "
7199 "template parameter list for %qD",
7201 inform (input_location
, " expected %qD but got %qD",
7204 val
= error_mark_node
;
7210 /* We only form one instance of each template specialization.
7211 Therefore, if we use a non-canonical variant (i.e., a
7212 typedef), any future messages referring to the type will use
7213 the typedef, which is confusing if those future uses do not
7214 themselves also use the typedef. */
7216 val
= canonicalize_type_argument (val
, complain
);
7220 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
7222 if (invalid_nontype_parm_type_p (t
, complain
))
7223 return error_mark_node
;
7225 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
7227 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
7231 /* Not sure if this is reachable, but it doesn't hurt
7233 error ("type mismatch in nontype parameter pack");
7234 val
= error_mark_node
;
7237 else if (!dependent_template_arg_p (orig_arg
)
7238 && !uses_template_parms (t
))
7239 /* We used to call digest_init here. However, digest_init
7240 will report errors, which we don't want when complain
7241 is zero. More importantly, digest_init will try too
7242 hard to convert things: for example, `0' should not be
7243 converted to pointer type at this point according to
7244 the standard. Accepting this is not merely an
7245 extension, since deciding whether or not these
7246 conversions can occur is part of determining which
7247 function template to call, or whether a given explicit
7248 argument specification is valid. */
7249 val
= convert_nontype_argument (t
, orig_arg
, complain
);
7252 bool removed_attr
= false;
7253 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
7256 if (val
== NULL_TREE
)
7257 val
= error_mark_node
;
7258 else if (val
== error_mark_node
&& (complain
& tf_error
))
7259 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
7261 if (INDIRECT_REF_P (val
))
7263 /* Reject template arguments that are references to built-in
7264 functions with no library fallbacks. */
7265 const_tree inner
= TREE_OPERAND (val
, 0);
7266 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7267 && TREE_CODE (TREE_TYPE (TREE_TYPE (inner
))) == FUNCTION_TYPE
7268 && TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
7269 && 0 < TREE_OPERAND_LENGTH (inner
)
7270 && reject_gcc_builtin (TREE_OPERAND (inner
, 0)))
7271 return error_mark_node
;
7274 if (TREE_CODE (val
) == SCOPE_REF
)
7276 /* Strip typedefs from the SCOPE_REF. */
7277 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
7278 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
7280 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
7281 QUALIFIED_NAME_IS_TEMPLATE (val
));
7288 /* Coerces the remaining template arguments in INNER_ARGS (from
7289 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
7290 Returns the coerced argument pack. PARM_IDX is the position of this
7291 parameter in the template parameter list. ARGS is the original
7292 template argument list. */
7294 coerce_template_parameter_pack (tree parms
,
7302 tsubst_flags_t complain
)
7304 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7305 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7308 tree packed_parms
= NULL_TREE
;
7310 if (arg_idx
> nargs
)
7313 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
7315 /* When the template parameter is a non-type template parameter pack
7316 or template template parameter pack whose type or template
7317 parameters use parameter packs, we know exactly how many arguments
7318 we are looking for. Build a vector of the instantiated decls for
7319 these template parameters in PACKED_PARMS. */
7320 /* We can't use make_pack_expansion here because it would interpret a
7321 _DECL as a use rather than a declaration. */
7322 tree decl
= TREE_VALUE (parm
);
7323 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
7324 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
7325 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
7326 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
7328 TREE_VEC_LENGTH (args
)--;
7329 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
7330 TREE_VEC_LENGTH (args
)++;
7332 if (packed_parms
== error_mark_node
)
7333 return error_mark_node
;
7335 /* If we're doing a partial instantiation of a member template,
7336 verify that all of the types used for the non-type
7337 template parameter pack are, in fact, valid for non-type
7338 template parameters. */
7340 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7342 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
7343 for (j
= 0; j
< len
; ++j
)
7345 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
7346 if (invalid_nontype_parm_type_p (t
, complain
))
7347 return error_mark_node
;
7349 /* We don't know how many args we have yet, just
7350 use the unconverted ones for now. */
7354 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
7356 /* Check if we have a placeholder pack, which indicates we're
7357 in the context of a introduction list. In that case we want
7358 to match this pack to the single placeholder. */
7359 else if (arg_idx
< nargs
7360 && TREE_CODE (TREE_VEC_ELT (inner_args
, arg_idx
)) == WILDCARD_DECL
7361 && WILDCARD_PACK_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
7363 nargs
= arg_idx
+ 1;
7364 packed_args
= make_tree_vec (1);
7367 packed_args
= make_tree_vec (nargs
- arg_idx
);
7369 /* Convert the remaining arguments, which will be a part of the
7370 parameter pack "parm". */
7371 for (; arg_idx
< nargs
; ++arg_idx
)
7373 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7374 tree actual_parm
= TREE_VALUE (parm
);
7375 int pack_idx
= arg_idx
- parm_idx
;
7379 /* Once we've packed as many args as we have types, stop. */
7380 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
7382 else if (PACK_EXPANSION_P (arg
))
7383 /* We don't know how many args we have yet, just
7384 use the unconverted ones for now. */
7387 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
7390 if (arg
== error_mark_node
)
7392 if (complain
& tf_error
)
7393 error ("template argument %d is invalid", arg_idx
+ 1);
7396 arg
= convert_template_argument (actual_parm
,
7397 arg
, new_args
, complain
, parm_idx
,
7399 if (arg
== error_mark_node
)
7401 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
7404 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
7405 && TREE_VEC_LENGTH (packed_args
) > 0)
7407 if (complain
& tf_error
)
7408 error ("wrong number of template arguments (%d, should be %d)",
7409 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
7410 return error_mark_node
;
7413 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
7414 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
7415 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
7418 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
7419 TREE_TYPE (argument_pack
)
7420 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
7421 TREE_CONSTANT (argument_pack
) = 1;
7424 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
7426 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
7427 TREE_VEC_LENGTH (packed_args
));
7428 return argument_pack
;
7431 /* Returns the number of pack expansions in the template argument vector
7435 pack_expansion_args_count (tree args
)
7440 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
7442 tree elt
= TREE_VEC_ELT (args
, i
);
7443 if (elt
&& PACK_EXPANSION_P (elt
))
7449 /* Convert all template arguments to their appropriate types, and
7450 return a vector containing the innermost resulting template
7451 arguments. If any error occurs, return error_mark_node. Error and
7452 warning messages are issued under control of COMPLAIN.
7454 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7455 for arguments not specified in ARGS. Otherwise, if
7456 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7457 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7458 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7462 coerce_template_parms (tree parms
,
7465 tsubst_flags_t complain
,
7466 bool require_all_args
,
7467 bool use_default_args
)
7469 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7470 tree orig_inner_args
;
7473 tree new_inner_args
;
7474 int saved_unevaluated_operand
;
7475 int saved_inhibit_evaluation_warnings
;
7477 /* When used as a boolean value, indicates whether this is a
7478 variadic template parameter list. Since it's an int, we can also
7479 subtract it from nparms to get the number of non-variadic
7482 int variadic_args_p
= 0;
7483 int post_variadic_parms
= 0;
7485 /* Likewise for parameters with default arguments. */
7488 if (args
== error_mark_node
)
7489 return error_mark_node
;
7491 nparms
= TREE_VEC_LENGTH (parms
);
7493 /* Determine if there are any parameter packs or default arguments. */
7494 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7496 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7498 ++post_variadic_parms
;
7499 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7501 if (TREE_PURPOSE (parm
))
7505 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7506 /* If there are no parameters that follow a parameter pack, we need to
7507 expand any argument packs so that we can deduce a parameter pack from
7508 some non-packed args followed by an argument pack, as in variadic85.C.
7509 If there are such parameters, we need to leave argument packs intact
7510 so the arguments are assigned properly. This can happen when dealing
7511 with a nested class inside a partial specialization of a class
7512 template, as in variadic92.C, or when deducing a template parameter pack
7513 from a sub-declarator, as in variadic114.C. */
7514 if (!post_variadic_parms
)
7515 inner_args
= expand_template_argument_pack (inner_args
);
7517 /* Count any pack expansion args. */
7518 variadic_args_p
= pack_expansion_args_count (inner_args
);
7520 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7521 if ((nargs
> nparms
&& !variadic_p
)
7522 || (nargs
< nparms
- variadic_p
7525 && (!use_default_args
7526 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7527 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7529 if (complain
& tf_error
)
7531 if (variadic_p
|| default_p
)
7533 nparms
-= variadic_p
+ default_p
;
7534 error ("wrong number of template arguments "
7535 "(%d, should be at least %d)", nargs
, nparms
);
7538 error ("wrong number of template arguments "
7539 "(%d, should be %d)", nargs
, nparms
);
7542 inform (DECL_SOURCE_LOCATION (in_decl
),
7543 "provided for %qD", in_decl
);
7546 return error_mark_node
;
7548 /* We can't pass a pack expansion to a non-pack parameter of an alias
7549 template (DR 1430). */
7551 && (DECL_ALIAS_TEMPLATE_P (in_decl
)
7552 || concept_template_p (in_decl
))
7554 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7556 if (complain
& tf_error
)
7558 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7560 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7561 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7563 if (PACK_EXPANSION_P (arg
)
7564 && !template_parameter_pack_p (parm
))
7566 if (DECL_ALIAS_TEMPLATE_P (in_decl
))
7567 error_at (location_of (arg
),
7568 "pack expansion argument for non-pack parameter "
7569 "%qD of alias template %qD", parm
, in_decl
);
7571 error_at (location_of (arg
),
7572 "pack expansion argument for non-pack parameter "
7573 "%qD of concept %qD", parm
, in_decl
);
7574 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7581 return error_mark_node
;
7584 /* We need to evaluate the template arguments, even though this
7585 template-id may be nested within a "sizeof". */
7586 saved_unevaluated_operand
= cp_unevaluated_operand
;
7587 cp_unevaluated_operand
= 0;
7588 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7589 c_inhibit_evaluation_warnings
= 0;
7590 new_inner_args
= make_tree_vec (nparms
);
7591 new_args
= add_outermost_template_args (args
, new_inner_args
);
7592 int pack_adjust
= 0;
7593 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7598 /* Get the Ith template parameter. */
7599 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7601 if (parm
== error_mark_node
)
7603 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7607 /* Calculate the next argument. */
7608 if (arg_idx
< nargs
)
7609 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7613 if (template_parameter_pack_p (TREE_VALUE (parm
))
7614 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7616 /* Some arguments will be placed in the
7617 template parameter pack PARM. */
7618 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7619 inner_args
, arg_idx
,
7623 if (arg
== NULL_TREE
)
7625 /* We don't know how many args we have yet, just use the
7626 unconverted (and still packed) ones for now. */
7627 new_inner_args
= orig_inner_args
;
7632 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7634 /* Store this argument. */
7635 if (arg
== error_mark_node
)
7638 /* We are done with all of the arguments. */
7643 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7644 arg_idx
+= pack_adjust
;
7651 if (PACK_EXPANSION_P (arg
))
7653 /* "If every valid specialization of a variadic template
7654 requires an empty template parameter pack, the template is
7655 ill-formed, no diagnostic required." So check that the
7656 pattern works with this parameter. */
7657 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7658 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7662 if (conv
== error_mark_node
)
7664 inform (input_location
, "so any instantiation with a "
7665 "non-empty parameter pack would be ill-formed");
7668 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7669 /* Recover from missing typename. */
7670 TREE_VEC_ELT (inner_args
, arg_idx
)
7671 = make_pack_expansion (conv
);
7673 /* We don't know how many args we have yet, just
7674 use the unconverted ones for now. */
7675 new_inner_args
= inner_args
;
7680 else if (require_all_args
)
7682 /* There must be a default arg in this case. */
7683 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7685 /* The position of the first default template argument,
7686 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7688 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7689 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7690 arg_idx
- pack_adjust
);
7695 if (arg
== error_mark_node
)
7697 if (complain
& tf_error
)
7698 error ("template argument %d is invalid", arg_idx
+ 1);
7701 /* This only occurs if there was an error in the template
7702 parameter list itself (which we would already have
7703 reported) that we are trying to recover from, e.g., a class
7704 template with a parameter list such as
7705 template<typename..., typename>. */
7708 arg
= convert_template_argument (TREE_VALUE (parm
),
7709 arg
, new_args
, complain
,
7712 if (arg
== error_mark_node
)
7714 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7716 cp_unevaluated_operand
= saved_unevaluated_operand
;
7717 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7719 if (variadic_p
&& arg_idx
< nargs
)
7721 if (complain
& tf_error
)
7723 error ("wrong number of template arguments "
7724 "(%d, should be %d)", nargs
, arg_idx
);
7726 error ("provided for %q+D", in_decl
);
7728 return error_mark_node
;
7732 return error_mark_node
;
7734 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7735 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7736 TREE_VEC_LENGTH (new_inner_args
));
7738 return new_inner_args
;
7741 /* Convert all template arguments to their appropriate types, and
7742 return a vector containing the innermost resulting template
7743 arguments. If any error occurs, return error_mark_node. Error and
7744 warning messages are not issued.
7746 Note that no function argument deduction is performed, and default
7747 arguments are used to fill in unspecified arguments. */
7749 coerce_template_parms (tree parms
, tree args
, tree in_decl
)
7751 return coerce_template_parms (parms
, args
, in_decl
, tf_none
, true, true);
7754 /* Convert all template arguments to their appropriate type, and
7755 instantiate default arguments as needed. This returns a vector
7756 containing the innermost resulting template arguments, or
7757 error_mark_node if unsuccessful. */
7759 coerce_template_parms (tree parms
, tree args
, tree in_decl
,
7760 tsubst_flags_t complain
)
7762 return coerce_template_parms (parms
, args
, in_decl
, complain
, true, true);
7765 /* Like coerce_template_parms. If PARMS represents all template
7766 parameters levels, this function returns a vector of vectors
7767 representing all the resulting argument levels. Note that in this
7768 case, only the innermost arguments are coerced because the
7769 outermost ones are supposed to have been coerced already.
7771 Otherwise, if PARMS represents only (the innermost) vector of
7772 parameters, this function returns a vector containing just the
7773 innermost resulting arguments. */
7776 coerce_innermost_template_parms (tree parms
,
7779 tsubst_flags_t complain
,
7780 bool require_all_args
,
7781 bool use_default_args
)
7783 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7784 int args_depth
= TMPL_ARGS_DEPTH (args
);
7787 if (parms_depth
> 1)
7789 coerced_args
= make_tree_vec (parms_depth
);
7793 for (level
= parms
, cur_depth
= parms_depth
;
7794 parms_depth
> 0 && level
!= NULL_TREE
;
7795 level
= TREE_CHAIN (level
), --cur_depth
)
7798 if (cur_depth
== args_depth
)
7799 l
= coerce_template_parms (TREE_VALUE (level
),
7800 args
, in_decl
, complain
,
7804 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7806 if (l
== error_mark_node
)
7807 return error_mark_node
;
7809 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7813 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7814 args
, in_decl
, complain
,
7817 return coerced_args
;
7820 /* Returns 1 if template args OT and NT are equivalent. */
7823 template_args_equal (tree ot
, tree nt
)
7827 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7830 if (TREE_CODE (nt
) == TREE_VEC
)
7831 /* For member templates */
7832 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7833 else if (PACK_EXPANSION_P (ot
))
7834 return (PACK_EXPANSION_P (nt
)
7835 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7836 PACK_EXPANSION_PATTERN (nt
))
7837 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7838 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7839 else if (ARGUMENT_PACK_P (ot
))
7844 if (!ARGUMENT_PACK_P (nt
))
7847 opack
= ARGUMENT_PACK_ARGS (ot
);
7848 npack
= ARGUMENT_PACK_ARGS (nt
);
7849 len
= TREE_VEC_LENGTH (opack
);
7850 if (TREE_VEC_LENGTH (npack
) != len
)
7852 for (i
= 0; i
< len
; ++i
)
7853 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7854 TREE_VEC_ELT (npack
, i
)))
7858 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7860 /* We get here probably because we are in the middle of substituting
7861 into the pattern of a pack expansion. In that case the
7862 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7863 interested in. So we want to use the initial pack argument for
7865 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7866 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7867 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7868 return template_args_equal (ot
, nt
);
7870 else if (TYPE_P (nt
))
7874 /* Don't treat an alias template specialization with dependent
7875 arguments as equivalent to its underlying type when used as a
7876 template argument; we need them to be distinct so that we
7877 substitute into the specialization arguments at instantiation
7878 time. And aliases can't be equivalent without being ==, so
7879 we don't need to look any deeper. */
7880 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7883 return same_type_p (ot
, nt
);
7885 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7889 /* Try to treat a template non-type argument that has been converted
7890 to the parameter type as equivalent to one that hasn't yet. */
7891 for (enum tree_code code1
= TREE_CODE (ot
);
7892 CONVERT_EXPR_CODE_P (code1
)
7893 || code1
== NON_LVALUE_EXPR
;
7894 code1
= TREE_CODE (ot
))
7895 ot
= TREE_OPERAND (ot
, 0);
7896 for (enum tree_code code2
= TREE_CODE (nt
);
7897 CONVERT_EXPR_CODE_P (code2
)
7898 || code2
== NON_LVALUE_EXPR
;
7899 code2
= TREE_CODE (nt
))
7900 nt
= TREE_OPERAND (nt
, 0);
7902 return cp_tree_equal (ot
, nt
);
7906 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7907 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7908 NEWARG_PTR with the offending arguments if they are non-NULL. */
7911 comp_template_args (tree oldargs
, tree newargs
,
7912 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7916 if (oldargs
== newargs
)
7919 if (!oldargs
|| !newargs
)
7922 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7925 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7927 tree nt
= TREE_VEC_ELT (newargs
, i
);
7928 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7930 if (! template_args_equal (ot
, nt
))
7932 if (oldarg_ptr
!= NULL
)
7934 if (newarg_ptr
!= NULL
)
7943 add_pending_template (tree d
)
7945 tree ti
= (TYPE_P (d
)
7946 ? CLASSTYPE_TEMPLATE_INFO (d
)
7947 : DECL_TEMPLATE_INFO (d
));
7948 struct pending_template
*pt
;
7951 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7954 /* We are called both from instantiate_decl, where we've already had a
7955 tinst_level pushed, and instantiate_template, where we haven't.
7957 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7960 push_tinst_level (d
);
7962 pt
= ggc_alloc
<pending_template
> ();
7964 pt
->tinst
= current_tinst_level
;
7965 if (last_pending_template
)
7966 last_pending_template
->next
= pt
;
7968 pending_templates
= pt
;
7970 last_pending_template
= pt
;
7972 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7979 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7980 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7981 documentation for TEMPLATE_ID_EXPR. */
7984 lookup_template_function (tree fns
, tree arglist
)
7988 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7989 return error_mark_node
;
7991 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7993 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7995 error ("%q#D is not a function template", fns
);
7996 return error_mark_node
;
7999 if (BASELINK_P (fns
))
8001 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
8003 BASELINK_FUNCTIONS (fns
),
8008 type
= TREE_TYPE (fns
);
8009 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
8010 type
= unknown_type_node
;
8012 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
8015 /* Within the scope of a template class S<T>, the name S gets bound
8016 (in build_self_reference) to a TYPE_DECL for the class, not a
8017 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
8018 or one of its enclosing classes, and that type is a template,
8019 return the associated TEMPLATE_DECL. Otherwise, the original
8022 Also handle the case when DECL is a TREE_LIST of ambiguous
8023 injected-class-names from different bases. */
8026 maybe_get_template_decl_from_type_decl (tree decl
)
8028 if (decl
== NULL_TREE
)
8031 /* DR 176: A lookup that finds an injected-class-name (10.2
8032 [class.member.lookup]) can result in an ambiguity in certain cases
8033 (for example, if it is found in more than one base class). If all of
8034 the injected-class-names that are found refer to specializations of
8035 the same class template, and if the name is followed by a
8036 template-argument-list, the reference refers to the class template
8037 itself and not a specialization thereof, and is not ambiguous. */
8038 if (TREE_CODE (decl
) == TREE_LIST
)
8040 tree t
, tmpl
= NULL_TREE
;
8041 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
8043 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
8046 else if (tmpl
!= elt
)
8049 if (tmpl
&& t
== NULL_TREE
)
8055 return (decl
!= NULL_TREE
8056 && DECL_SELF_REFERENCE_P (decl
)
8057 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
8058 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
8061 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
8062 parameters, find the desired type.
8064 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
8066 IN_DECL, if non-NULL, is the template declaration we are trying to
8069 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
8070 the class we are looking up.
8072 Issue error and warning messages under control of COMPLAIN.
8074 If the template class is really a local class in a template
8075 function, then the FUNCTION_CONTEXT is the function in which it is
8078 ??? Note that this function is currently called *twice* for each
8079 template-id: the first time from the parser, while creating the
8080 incomplete type (finish_template_type), and the second type during the
8081 real instantiation (instantiate_template_class). This is surely something
8082 that we want to avoid. It also causes some problems with argument
8083 coercion (see convert_nontype_argument for more information on this). */
8086 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
8087 int entering_scope
, tsubst_flags_t complain
)
8089 tree templ
= NULL_TREE
, parmlist
;
8096 if (identifier_p (d1
))
8098 tree value
= innermost_non_namespace_value (d1
);
8099 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
8104 push_decl_namespace (context
);
8105 templ
= lookup_name (d1
);
8106 templ
= maybe_get_template_decl_from_type_decl (templ
);
8108 pop_decl_namespace ();
8111 context
= DECL_CONTEXT (templ
);
8113 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
8115 tree type
= TREE_TYPE (d1
);
8117 /* If we are declaring a constructor, say A<T>::A<T>, we will get
8118 an implicit typename for the second A. Deal with it. */
8119 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
8120 type
= TREE_TYPE (type
);
8122 if (CLASSTYPE_TEMPLATE_INFO (type
))
8124 templ
= CLASSTYPE_TI_TEMPLATE (type
);
8125 d1
= DECL_NAME (templ
);
8128 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
8129 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
8131 templ
= TYPE_TI_TEMPLATE (d1
);
8132 d1
= DECL_NAME (templ
);
8134 else if (DECL_TYPE_TEMPLATE_P (d1
))
8137 d1
= DECL_NAME (templ
);
8138 context
= DECL_CONTEXT (templ
);
8140 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
8143 d1
= DECL_NAME (templ
);
8146 /* Issue an error message if we didn't find a template. */
8149 if (complain
& tf_error
)
8150 error ("%qT is not a template", d1
);
8151 return error_mark_node
;
8154 if (TREE_CODE (templ
) != TEMPLATE_DECL
8155 /* Make sure it's a user visible template, if it was named by
8157 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
8158 && !PRIMARY_TEMPLATE_P (templ
)))
8160 if (complain
& tf_error
)
8162 error ("non-template type %qT used as a template", d1
);
8164 error ("for template declaration %q+D", in_decl
);
8166 return error_mark_node
;
8169 complain
&= ~tf_user
;
8171 /* An alias that just changes the name of a template is equivalent to the
8172 other template, so if any of the arguments are pack expansions, strip
8173 the alias to avoid problems with a pack expansion passed to a non-pack
8174 alias template parameter (DR 1430). */
8175 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
8176 templ
= get_underlying_template (templ
);
8178 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
8180 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
8181 template arguments */
8187 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
8189 /* Consider an example where a template template parameter declared as
8191 template <class T, class U = std::allocator<T> > class TT
8193 The template parameter level of T and U are one level larger than
8194 of TT. To proper process the default argument of U, say when an
8195 instantiation `TT<int>' is seen, we need to build the full
8196 arguments containing {int} as the innermost level. Outer levels,
8197 available when not appearing as default template argument, can be
8198 obtained from the arguments of the enclosing template.
8200 Suppose that TT is later substituted with std::vector. The above
8201 instantiation is `TT<int, std::allocator<T> >' with TT at
8202 level 1, and T at level 2, while the template arguments at level 1
8203 becomes {std::vector} and the inner level 2 is {int}. */
8205 outer
= DECL_CONTEXT (templ
);
8207 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
8208 else if (current_template_parms
)
8210 /* This is an argument of the current template, so we haven't set
8211 DECL_CONTEXT yet. */
8212 tree relevant_template_parms
;
8214 /* Parameter levels that are greater than the level of the given
8215 template template parm are irrelevant. */
8216 relevant_template_parms
= current_template_parms
;
8217 while (TMPL_PARMS_DEPTH (relevant_template_parms
)
8218 != TEMPLATE_TYPE_LEVEL (TREE_TYPE (templ
)))
8219 relevant_template_parms
= TREE_CHAIN (relevant_template_parms
);
8221 outer
= template_parms_to_args (relevant_template_parms
);
8225 arglist
= add_to_template_args (outer
, arglist
);
8227 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
8229 /*require_all_args=*/true,
8230 /*use_default_args=*/true);
8231 if (arglist2
== error_mark_node
8232 || (!uses_template_parms (arglist2
)
8233 && check_instantiated_args (templ
, arglist2
, complain
)))
8234 return error_mark_node
;
8236 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
8241 tree template_type
= TREE_TYPE (templ
);
8244 tree found
= NULL_TREE
;
8247 int is_dependent_type
;
8248 int use_partial_inst_tmpl
= false;
8250 if (template_type
== error_mark_node
)
8251 /* An error occurred while building the template TEMPL, and a
8252 diagnostic has most certainly been emitted for that
8253 already. Let's propagate that error. */
8254 return error_mark_node
;
8256 gen_tmpl
= most_general_template (templ
);
8257 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
8258 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
8259 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8261 if (arg_depth
== 1 && parm_depth
> 1)
8263 /* We've been given an incomplete set of template arguments.
8266 template <class T> struct S1 {
8267 template <class U> struct S2 {};
8268 template <class U> struct S2<U*> {};
8271 we will be called with an ARGLIST of `U*', but the
8272 TEMPLATE will be `template <class T> template
8273 <class U> struct S1<T>::S2'. We must fill in the missing
8276 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
8278 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
8281 /* Now we should have enough arguments. */
8282 gcc_assert (parm_depth
== arg_depth
);
8284 /* From here on, we're only interested in the most general
8287 /* Calculate the BOUND_ARGS. These will be the args that are
8288 actually tsubst'd into the definition to create the
8290 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
8292 /*require_all_args=*/true,
8293 /*use_default_args=*/true);
8295 if (arglist
== error_mark_node
)
8296 /* We were unable to bind the arguments. */
8297 return error_mark_node
;
8299 /* In the scope of a template class, explicit references to the
8300 template class refer to the type of the template, not any
8301 instantiation of it. For example, in:
8303 template <class T> class C { void f(C<T>); }
8305 the `C<T>' is just the same as `C'. Outside of the
8306 class, however, such a reference is an instantiation. */
8308 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
8309 || currently_open_class (template_type
))
8310 /* comp_template_args is expensive, check it last. */
8311 && comp_template_args (TYPE_TI_ARGS (template_type
),
8313 return template_type
;
8315 /* If we already have this specialization, return it. */
8316 elt
.tmpl
= gen_tmpl
;
8318 elt
.spec
= NULL_TREE
;
8319 hash
= spec_hasher::hash (&elt
);
8320 entry
= type_specializations
->find_with_hash (&elt
, hash
);
8325 /* If the the template's constraints are not satisfied,
8326 then we cannot form a valid type.
8328 Note that the check is deferred until after the hash
8329 lookup. This prevents redundant checks on previously
8330 instantiated specializations. */
8331 if (flag_concepts
&& !constraints_satisfied_p (gen_tmpl
, arglist
))
8333 if (complain
& tf_error
)
8335 error ("template constraint failure");
8336 diagnose_constraints (input_location
, gen_tmpl
, arglist
);
8338 return error_mark_node
;
8341 is_dependent_type
= uses_template_parms (arglist
);
8343 /* If the deduced arguments are invalid, then the binding
8345 if (!is_dependent_type
8346 && check_instantiated_args (gen_tmpl
,
8347 INNERMOST_TEMPLATE_ARGS (arglist
),
8349 return error_mark_node
;
8351 if (!is_dependent_type
8352 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
8353 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
8354 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
8356 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
8357 DECL_NAME (gen_tmpl
),
8358 /*tag_scope=*/ts_global
);
8362 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
8364 if (context
== error_mark_node
)
8365 return error_mark_node
;
8368 context
= global_namespace
;
8370 /* Create the type. */
8371 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8373 /* The user referred to a specialization of an alias
8374 template represented by GEN_TMPL.
8376 [temp.alias]/2 says:
8378 When a template-id refers to the specialization of an
8379 alias template, it is equivalent to the associated
8380 type obtained by substitution of its
8381 template-arguments for the template-parameters in the
8382 type-id of the alias template. */
8384 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
8385 /* Note that the call above (by indirectly calling
8386 register_specialization in tsubst_decl) registers the
8387 TYPE_DECL representing the specialization of the alias
8388 template. So next time someone substitutes ARGLIST for
8389 the template parms into the alias template (GEN_TMPL),
8390 she'll get that TYPE_DECL back. */
8392 if (t
== error_mark_node
)
8395 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
8397 if (!is_dependent_type
)
8399 set_current_access_from_decl (TYPE_NAME (template_type
));
8400 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
8401 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
8402 arglist
, complain
, in_decl
),
8403 tsubst_attributes (TYPE_ATTRIBUTES (template_type
),
8404 arglist
, complain
, in_decl
),
8405 SCOPED_ENUM_P (template_type
), NULL
);
8407 if (t
== error_mark_node
)
8412 /* We don't want to call start_enum for this type, since
8413 the values for the enumeration constants may involve
8414 template parameters. And, no one should be interested
8415 in the enumeration constants for such a type. */
8416 t
= cxx_make_type (ENUMERAL_TYPE
);
8417 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
8419 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
8420 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
8421 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
8423 else if (CLASS_TYPE_P (template_type
))
8425 t
= make_class_type (TREE_CODE (template_type
));
8426 CLASSTYPE_DECLARED_CLASS (t
)
8427 = CLASSTYPE_DECLARED_CLASS (template_type
);
8428 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
8429 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
8431 /* A local class. Make sure the decl gets registered properly. */
8432 if (context
== current_function_decl
)
8433 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
8435 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
8436 /* This instantiation is another name for the primary
8437 template type. Set the TYPE_CANONICAL field
8439 TYPE_CANONICAL (t
) = template_type
;
8440 else if (any_template_arguments_need_structural_equality_p (arglist
))
8441 /* Some of the template arguments require structural
8442 equality testing, so this template class requires
8443 structural equality testing. */
8444 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8449 /* If we called start_enum or pushtag above, this information
8450 will already be set up. */
8453 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
8455 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
8456 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
8457 DECL_SOURCE_LOCATION (type_decl
)
8458 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
8461 type_decl
= TYPE_NAME (t
);
8463 if (CLASS_TYPE_P (template_type
))
8465 TREE_PRIVATE (type_decl
)
8466 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
8467 TREE_PROTECTED (type_decl
)
8468 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
8469 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
8471 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
8472 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
8476 if (OVERLOAD_TYPE_P (t
)
8477 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8479 static const char *tags
[] = {"abi_tag", "may_alias"};
8481 for (unsigned ix
= 0; ix
!= 2; ix
++)
8484 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
8488 = tree_cons (TREE_PURPOSE (attributes
),
8489 TREE_VALUE (attributes
),
8490 TYPE_ATTRIBUTES (t
));
8494 /* Let's consider the explicit specialization of a member
8495 of a class template specialization that is implicitly instantiated,
8500 template<class U> struct M {}; //#0
8505 struct S<int>::M<char> //#1
8509 [temp.expl.spec]/4 says this is valid.
8511 In this case, when we write:
8514 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8517 When we encounter #1, we want to store the partial instantiation
8518 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8520 For all cases other than this "explicit specialization of member of a
8521 class template", we just want to store the most general template into
8522 the CLASSTYPE_TI_TEMPLATE of M.
8524 This case of "explicit specialization of member of a class template"
8526 1/ the enclosing class is an instantiation of, and therefore not
8527 the same as, the context of the most general template, and
8528 2/ we aren't looking at the partial instantiation itself, i.e.
8529 the innermost arguments are not the same as the innermost parms of
8530 the most general template.
8532 So it's only when 1/ and 2/ happens that we want to use the partial
8533 instantiation of the member template in lieu of its most general
8536 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8537 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8538 /* the enclosing class must be an instantiation... */
8539 && CLASS_TYPE_P (context
)
8540 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8542 tree partial_inst_args
;
8543 TREE_VEC_LENGTH (arglist
)--;
8544 ++processing_template_decl
;
8546 tsubst (INNERMOST_TEMPLATE_ARGS
8547 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8548 arglist
, complain
, NULL_TREE
);
8549 --processing_template_decl
;
8550 TREE_VEC_LENGTH (arglist
)++;
8551 if (partial_inst_args
== error_mark_node
)
8552 return error_mark_node
;
8553 use_partial_inst_tmpl
=
8554 /*...and we must not be looking at the partial instantiation
8556 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8560 if (!use_partial_inst_tmpl
)
8561 /* This case is easy; there are no member templates involved. */
8565 /* This is a full instantiation of a member template. Find
8566 the partial instantiation of which this is an instance. */
8568 /* Temporarily reduce by one the number of levels in the ARGLIST
8569 so as to avoid comparing the last set of arguments. */
8570 TREE_VEC_LENGTH (arglist
)--;
8571 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8572 TREE_VEC_LENGTH (arglist
)++;
8573 /* FOUND is either a proper class type, or an alias
8574 template specialization. In the later case, it's a
8575 TYPE_DECL, resulting from the substituting of arguments
8576 for parameters in the TYPE_DECL of the alias template
8577 done earlier. So be careful while getting the template
8579 found
= TREE_CODE (found
) == TYPE_DECL
8580 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8581 : CLASSTYPE_TI_TEMPLATE (found
);
8584 // Build template info for the new specialization.
8585 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8588 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8589 entry
= ggc_alloc
<spec_entry
> ();
8593 /* Note this use of the partial instantiation so we can check it
8594 later in maybe_process_partial_specialization. */
8595 DECL_TEMPLATE_INSTANTIATIONS (found
)
8596 = tree_cons (arglist
, t
,
8597 DECL_TEMPLATE_INSTANTIATIONS (found
));
8599 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8600 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8601 /* Now that the type has been registered on the instantiations
8602 list, we set up the enumerators. Because the enumeration
8603 constants may involve the enumeration type itself, we make
8604 sure to register the type first, and then create the
8605 constants. That way, doing tsubst_expr for the enumeration
8606 constants won't result in recursive calls here; we'll find
8607 the instantiation and exit above. */
8608 tsubst_enum (template_type
, t
, arglist
);
8610 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8611 /* If the type makes use of template parameters, the
8612 code that generates debugging information will crash. */
8613 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8615 /* Possibly limit visibility based on template args. */
8616 TREE_PUBLIC (type_decl
) = 1;
8617 determine_visibility (type_decl
);
8619 inherit_targ_abi_tags (t
);
8625 /* Wrapper for lookup_template_class_1. */
8628 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8629 int entering_scope
, tsubst_flags_t complain
)
8632 timevar_push (TV_TEMPLATE_INST
);
8633 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8634 entering_scope
, complain
);
8635 timevar_pop (TV_TEMPLATE_INST
);
8639 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
8642 lookup_template_variable (tree templ
, tree arglist
)
8644 /* The type of the expression is NULL_TREE since the template-id could refer
8645 to an explicit or partial specialization. */
8646 tree type
= NULL_TREE
;
8647 if (flag_concepts
&& variable_concept_p (templ
))
8648 /* Except that concepts are always bool. */
8649 type
= boolean_type_node
;
8650 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8653 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8656 finish_template_variable (tree var
, tsubst_flags_t complain
)
8658 tree templ
= TREE_OPERAND (var
, 0);
8659 tree arglist
= TREE_OPERAND (var
, 1);
8661 /* We never want to return a VAR_DECL for a variable concept, since they
8662 aren't instantiated. In a template, leave the TEMPLATE_ID_EXPR alone. */
8663 bool concept_p
= flag_concepts
&& variable_concept_p (templ
);
8664 if (concept_p
&& processing_template_decl
)
8667 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8668 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8670 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8671 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8673 /*use_default*/true);
8675 if (flag_concepts
&& !constraints_satisfied_p (templ
, arglist
))
8677 if (complain
& tf_error
)
8679 error ("constraints for %qD not satisfied", templ
);
8680 diagnose_constraints (location_of (var
), templ
, arglist
);
8682 return error_mark_node
;
8685 /* If a template-id refers to a specialization of a variable
8686 concept, then the expression is true if and only if the
8687 concept's constraints are satisfied by the given template
8690 NOTE: This is an extension of Concepts Lite TS that
8691 allows constraints to be used in expressions. */
8694 tree decl
= DECL_TEMPLATE_RESULT (templ
);
8695 return evaluate_variable_concept (decl
, arglist
);
8698 return instantiate_template (templ
, arglist
, complain
);
8701 /* Construct a TEMPLATE_ID_EXPR for the given variable template TEMPL having
8702 TARGS template args, and instantiate it if it's not dependent. */
8705 lookup_and_finish_template_variable (tree templ
, tree targs
,
8706 tsubst_flags_t complain
)
8708 templ
= lookup_template_variable (templ
, targs
);
8709 if (!any_dependent_template_arguments_p (targs
))
8711 templ
= finish_template_variable (templ
, complain
);
8715 return convert_from_reference (templ
);
8723 /* True when we should also visit template parameters that occur in
8724 non-deduced contexts. */
8725 bool include_nondeduced_p
;
8726 hash_set
<tree
> *visited
;
8729 /* Called from for_each_template_parm via walk_tree. */
8732 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8735 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8736 tree_fn_t fn
= pfd
->fn
;
8737 void *data
= pfd
->data
;
8738 tree result
= NULL_TREE
;
8740 #define WALK_SUBTREE(NODE) \
8743 result = for_each_template_parm (NODE, fn, data, pfd->visited, \
8744 pfd->include_nondeduced_p); \
8745 if (result) goto out; \
8750 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
))
8751 WALK_SUBTREE (TYPE_CONTEXT (t
));
8753 switch (TREE_CODE (t
))
8756 if (TYPE_PTRMEMFUNC_P (t
))
8762 if (!TYPE_TEMPLATE_INFO (t
))
8765 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8769 WALK_SUBTREE (TYPE_MIN_VALUE (t
));
8770 WALK_SUBTREE (TYPE_MAX_VALUE (t
));
8774 /* Since we're not going to walk subtrees, we have to do this
8776 WALK_SUBTREE (TYPE_METHOD_BASETYPE (t
));
8780 /* Check the return type. */
8781 WALK_SUBTREE (TREE_TYPE (t
));
8783 /* Check the parameter types. Since default arguments are not
8784 instantiated until they are needed, the TYPE_ARG_TYPES may
8785 contain expressions that involve template parameters. But,
8786 no-one should be looking at them yet. And, once they're
8787 instantiated, they don't contain template parameters, so
8788 there's no point in looking at them then, either. */
8792 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8793 WALK_SUBTREE (TREE_VALUE (parm
));
8795 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8796 want walk_tree walking into them itself. */
8802 case UNDERLYING_TYPE
:
8803 if (pfd
->include_nondeduced_p
8804 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8806 pfd
->include_nondeduced_p
))
8807 return error_mark_node
;
8812 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
8813 WALK_SUBTREE (DECL_TI_ARGS (t
));
8818 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
))
8819 WALK_SUBTREE (DECL_INITIAL (t
));
8820 if (DECL_CONTEXT (t
)
8821 && pfd
->include_nondeduced_p
)
8822 WALK_SUBTREE (DECL_CONTEXT (t
));
8825 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8826 /* Record template parameters such as `T' inside `TT<T>'. */
8827 WALK_SUBTREE (TYPE_TI_ARGS (t
));
8830 case TEMPLATE_TEMPLATE_PARM
:
8831 case TEMPLATE_TYPE_PARM
:
8832 case TEMPLATE_PARM_INDEX
:
8833 if (fn
&& (*fn
)(t
, data
))
8840 /* A template template parameter is encountered. */
8841 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
8842 WALK_SUBTREE (TREE_TYPE (t
));
8844 /* Already substituted template template parameter */
8850 WALK_SUBTREE (TYPENAME_TYPE_FULLNAME (t
));
8854 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8855 && pfd
->include_nondeduced_p
)
8856 WALK_SUBTREE (TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (t
)));
8861 /* If there's no type, then this thing must be some expression
8862 involving template parameters. */
8863 if (!fn
&& !TREE_TYPE (t
))
8864 return error_mark_node
;
8869 case IMPLICIT_CONV_EXPR
:
8870 case REINTERPRET_CAST_EXPR
:
8871 case CONST_CAST_EXPR
:
8872 case STATIC_CAST_EXPR
:
8873 case DYNAMIC_CAST_EXPR
:
8877 case PSEUDO_DTOR_EXPR
:
8879 return error_mark_node
;
8888 /* We didn't find any template parameters we liked. */
8893 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8894 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8895 call FN with the parameter and the DATA.
8896 If FN returns nonzero, the iteration is terminated, and
8897 for_each_template_parm returns 1. Otherwise, the iteration
8898 continues. If FN never returns a nonzero value, the value
8899 returned by for_each_template_parm is 0. If FN is NULL, it is
8900 considered to be the function which always returns 1.
8902 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8903 parameters that occur in non-deduced contexts. When false, only
8904 visits those template parameters that can be deduced. */
8907 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8908 hash_set
<tree
> *visited
,
8909 bool include_nondeduced_p
)
8911 struct pair_fn_data pfd
;
8917 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8919 /* Walk the tree. (Conceptually, we would like to walk without
8920 duplicates, but for_each_template_parm_r recursively calls
8921 for_each_template_parm, so we would need to reorganize a fair
8922 bit to use walk_tree_without_duplicates, so we keep our own
8925 pfd
.visited
= visited
;
8927 pfd
.visited
= new hash_set
<tree
>;
8928 result
= cp_walk_tree (&t
,
8929 for_each_template_parm_r
,
8943 /* Returns true if T depends on any template parameter. */
8946 uses_template_parms (tree t
)
8952 int saved_processing_template_decl
;
8954 saved_processing_template_decl
= processing_template_decl
;
8955 if (!saved_processing_template_decl
)
8956 processing_template_decl
= 1;
8958 dependent_p
= dependent_type_p (t
);
8959 else if (TREE_CODE (t
) == TREE_VEC
)
8960 dependent_p
= any_dependent_template_arguments_p (t
);
8961 else if (TREE_CODE (t
) == TREE_LIST
)
8962 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8963 || uses_template_parms (TREE_CHAIN (t
)));
8964 else if (TREE_CODE (t
) == TYPE_DECL
)
8965 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8968 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8969 || TREE_CODE (t
) == OVERLOAD
8972 || TREE_CODE (t
) == TRAIT_EXPR
8973 || TREE_CODE (t
) == CONSTRUCTOR
8974 || CONSTANT_CLASS_P (t
))
8975 dependent_p
= (type_dependent_expression_p (t
)
8976 || value_dependent_expression_p (t
));
8979 gcc_assert (t
== error_mark_node
);
8980 dependent_p
= false;
8983 processing_template_decl
= saved_processing_template_decl
;
8988 /* Returns true iff current_function_decl is an incompletely instantiated
8989 template. Useful instead of processing_template_decl because the latter
8990 is set to 0 during instantiate_non_dependent_expr. */
8993 in_template_function (void)
8995 tree fn
= current_function_decl
;
8997 ++processing_template_decl
;
8998 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8999 && DECL_TEMPLATE_INFO (fn
)
9000 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
9001 --processing_template_decl
;
9005 /* Returns true if T depends on any template parameter with level LEVEL. */
9008 uses_template_parms_level (tree t
, int level
)
9010 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
9011 /*include_nondeduced_p=*/true);
9014 /* Returns TRUE iff INST is an instantiation we don't need to do in an
9015 ill-formed translation unit, i.e. a variable or function that isn't
9016 usable in a constant expression. */
9019 neglectable_inst_p (tree d
)
9022 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
9023 : decl_maybe_constant_var_p (d
)));
9026 /* Returns TRUE iff we should refuse to instantiate DECL because it's
9027 neglectable and instantiated from within an erroneous instantiation. */
9030 limit_bad_template_recursion (tree decl
)
9032 struct tinst_level
*lev
= current_tinst_level
;
9033 int errs
= errorcount
+ sorrycount
;
9034 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
9037 for (; lev
; lev
= lev
->next
)
9038 if (neglectable_inst_p (lev
->decl
))
9041 return (lev
&& errs
> lev
->errors
);
9044 static int tinst_depth
;
9045 extern int max_tinst_depth
;
9048 static GTY(()) struct tinst_level
*last_error_tinst_level
;
9050 /* We're starting to instantiate D; record the template instantiation context
9051 for diagnostics and to restore it later. */
9054 push_tinst_level (tree d
)
9056 return push_tinst_level_loc (d
, input_location
);
9059 /* We're starting to instantiate D; record the template instantiation context
9060 at LOC for diagnostics and to restore it later. */
9063 push_tinst_level_loc (tree d
, location_t loc
)
9065 struct tinst_level
*new_level
;
9067 if (tinst_depth
>= max_tinst_depth
)
9069 fatal_error (input_location
,
9070 "template instantiation depth exceeds maximum of %d"
9071 " (use -ftemplate-depth= to increase the maximum)",
9076 /* If the current instantiation caused problems, don't let it instantiate
9077 anything else. Do allow deduction substitution and decls usable in
9078 constant expressions. */
9079 if (limit_bad_template_recursion (d
))
9082 new_level
= ggc_alloc
<tinst_level
> ();
9083 new_level
->decl
= d
;
9084 new_level
->locus
= loc
;
9085 new_level
->errors
= errorcount
+sorrycount
;
9086 new_level
->in_system_header_p
= in_system_header_at (input_location
);
9087 new_level
->next
= current_tinst_level
;
9088 current_tinst_level
= new_level
;
9091 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
9092 depth_reached
= tinst_depth
;
9097 /* We're done instantiating this template; return to the instantiation
9101 pop_tinst_level (void)
9103 /* Restore the filename and line number stashed away when we started
9104 this instantiation. */
9105 input_location
= current_tinst_level
->locus
;
9106 current_tinst_level
= current_tinst_level
->next
;
9110 /* We're instantiating a deferred template; restore the template
9111 instantiation context in which the instantiation was requested, which
9112 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
9115 reopen_tinst_level (struct tinst_level
*level
)
9117 struct tinst_level
*t
;
9120 for (t
= level
; t
; t
= t
->next
)
9123 current_tinst_level
= level
;
9125 if (current_tinst_level
)
9126 current_tinst_level
->errors
= errorcount
+sorrycount
;
9130 /* Returns the TINST_LEVEL which gives the original instantiation
9133 struct tinst_level
*
9134 outermost_tinst_level (void)
9136 struct tinst_level
*level
= current_tinst_level
;
9139 level
= level
->next
;
9143 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
9144 vector of template arguments, as for tsubst.
9146 Returns an appropriate tsubst'd friend declaration. */
9149 tsubst_friend_function (tree decl
, tree args
)
9153 if (TREE_CODE (decl
) == FUNCTION_DECL
9154 && DECL_TEMPLATE_INSTANTIATION (decl
)
9155 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
9156 /* This was a friend declared with an explicit template
9157 argument list, e.g.:
9161 to indicate that f was a template instantiation, not a new
9162 function declaration. Now, we have to figure out what
9163 instantiation of what template. */
9165 tree template_id
, arglist
, fns
;
9168 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
9170 /* Friend functions are looked up in the containing namespace scope.
9171 We must enter that scope, to avoid finding member functions of the
9172 current class with same name. */
9173 push_nested_namespace (ns
);
9174 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
9175 tf_warning_or_error
, NULL_TREE
,
9176 /*integral_constant_expression_p=*/false);
9177 pop_nested_namespace (ns
);
9178 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
9179 tf_warning_or_error
, NULL_TREE
);
9180 template_id
= lookup_template_function (fns
, arglist
);
9182 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9183 tmpl
= determine_specialization (template_id
, new_friend
,
9185 /*need_member_template=*/0,
9186 TREE_VEC_LENGTH (args
),
9188 return instantiate_template (tmpl
, new_args
, tf_error
);
9191 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
9193 /* The NEW_FRIEND will look like an instantiation, to the
9194 compiler, but is not an instantiation from the point of view of
9195 the language. For example, we might have had:
9197 template <class T> struct S {
9198 template <class U> friend void f(T, U);
9201 Then, in S<int>, template <class U> void f(int, U) is not an
9202 instantiation of anything. */
9203 if (new_friend
== error_mark_node
)
9204 return error_mark_node
;
9206 DECL_USE_TEMPLATE (new_friend
) = 0;
9207 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9209 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
9210 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
9211 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
9214 /* The mangled name for the NEW_FRIEND is incorrect. The function
9215 is not a template instantiation and should not be mangled like
9216 one. Therefore, we forget the mangling here; we'll recompute it
9217 later if we need it. */
9218 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
9220 SET_DECL_RTL (new_friend
, NULL
);
9221 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
9224 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
9227 tree new_friend_template_info
;
9228 tree new_friend_result_template_info
;
9230 int new_friend_is_defn
;
9232 /* We must save some information from NEW_FRIEND before calling
9233 duplicate decls since that function will free NEW_FRIEND if
9235 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
9236 new_friend_is_defn
=
9237 (DECL_INITIAL (DECL_TEMPLATE_RESULT
9238 (template_for_substitution (new_friend
)))
9240 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
9242 /* This declaration is a `primary' template. */
9243 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
9245 new_friend_result_template_info
9246 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
9249 new_friend_result_template_info
= NULL_TREE
;
9251 /* Make the init_value nonzero so pushdecl knows this is a defn. */
9252 if (new_friend_is_defn
)
9253 DECL_INITIAL (new_friend
) = error_mark_node
;
9255 /* Inside pushdecl_namespace_level, we will push into the
9256 current namespace. However, the friend function should go
9257 into the namespace of the template. */
9258 ns
= decl_namespace_context (new_friend
);
9259 push_nested_namespace (ns
);
9260 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
9261 pop_nested_namespace (ns
);
9263 if (old_decl
== error_mark_node
)
9264 return error_mark_node
;
9266 if (old_decl
!= new_friend
)
9268 /* This new friend declaration matched an existing
9269 declaration. For example, given:
9271 template <class T> void f(T);
9272 template <class U> class C {
9273 template <class T> friend void f(T) {}
9276 the friend declaration actually provides the definition
9277 of `f', once C has been instantiated for some type. So,
9278 old_decl will be the out-of-class template declaration,
9279 while new_friend is the in-class definition.
9281 But, if `f' was called before this point, the
9282 instantiation of `f' will have DECL_TI_ARGS corresponding
9283 to `T' but not to `U', references to which might appear
9284 in the definition of `f'. Previously, the most general
9285 template for an instantiation of `f' was the out-of-class
9286 version; now it is the in-class version. Therefore, we
9287 run through all specialization of `f', adding to their
9288 DECL_TI_ARGS appropriately. In particular, they need a
9289 new set of outer arguments, corresponding to the
9290 arguments for this class instantiation.
9292 The same situation can arise with something like this:
9295 template <class T> class C {
9299 when `C<int>' is instantiated. Now, `f(int)' is defined
9302 if (!new_friend_is_defn
)
9303 /* On the other hand, if the in-class declaration does
9304 *not* provide a definition, then we don't want to alter
9305 existing definitions. We can just leave everything
9310 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
9311 tree new_args
= TI_ARGS (new_friend_template_info
);
9313 /* Overwrite whatever template info was there before, if
9314 any, with the new template information pertaining to
9316 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
9318 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
9320 /* We should have called reregister_specialization in
9322 gcc_assert (retrieve_specialization (new_template
,
9326 /* Instantiate it if the global has already been used. */
9327 if (DECL_ODR_USED (old_decl
))
9328 instantiate_decl (old_decl
, /*defer_ok=*/true,
9329 /*expl_inst_class_mem_p=*/false);
9335 /* Indicate that the old function template is a partial
9337 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
9338 = new_friend_result_template_info
;
9340 gcc_assert (new_template
9341 == most_general_template (new_template
));
9342 gcc_assert (new_template
!= old_decl
);
9344 /* Reassign any specializations already in the hash table
9345 to the new more general template, and add the
9346 additional template args. */
9347 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
9351 tree spec
= TREE_VALUE (t
);
9354 elt
.tmpl
= old_decl
;
9355 elt
.args
= DECL_TI_ARGS (spec
);
9356 elt
.spec
= NULL_TREE
;
9358 decl_specializations
->remove_elt (&elt
);
9361 = add_outermost_template_args (new_args
,
9362 DECL_TI_ARGS (spec
));
9364 register_specialization
9365 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
9368 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
9372 /* The information from NEW_FRIEND has been merged into OLD_DECL
9373 by duplicate_decls. */
9374 new_friend
= old_decl
;
9379 tree context
= DECL_CONTEXT (new_friend
);
9383 template <class T> class C {
9384 template <class U> friend void C1<U>::f (); // case 1
9385 friend void C2<T>::f (); // case 2
9387 we only need to make sure CONTEXT is a complete type for
9388 case 2. To distinguish between the two cases, we note that
9389 CONTEXT of case 1 remains dependent type after tsubst while
9390 this isn't true for case 2. */
9391 ++processing_template_decl
;
9392 dependent_p
= dependent_type_p (context
);
9393 --processing_template_decl
;
9396 && !complete_type_or_else (context
, NULL_TREE
))
9397 return error_mark_node
;
9399 if (COMPLETE_TYPE_P (context
))
9401 tree fn
= new_friend
;
9402 /* do_friend adds the TEMPLATE_DECL for any member friend
9403 template even if it isn't a member template, i.e.
9404 template <class T> friend A<T>::f();
9405 Look through it in that case. */
9406 if (TREE_CODE (fn
) == TEMPLATE_DECL
9407 && !PRIMARY_TEMPLATE_P (fn
))
9408 fn
= DECL_TEMPLATE_RESULT (fn
);
9409 /* Check to see that the declaration is really present, and,
9410 possibly obtain an improved declaration. */
9411 fn
= check_classfn (context
, fn
, NULL_TREE
);
9421 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
9422 template arguments, as for tsubst.
9424 Returns an appropriate tsubst'd friend type or error_mark_node on
9428 tsubst_friend_class (tree friend_tmpl
, tree args
)
9434 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
9436 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
9437 return TREE_TYPE (t
);
9440 context
= CP_DECL_CONTEXT (friend_tmpl
);
9442 if (context
!= global_namespace
)
9444 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9445 push_nested_namespace (context
);
9447 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
9450 /* Look for a class template declaration. We look for hidden names
9451 because two friend declarations of the same template are the
9452 same. For example, in:
9455 template <typename> friend class F;
9457 template <typename> struct B {
9458 template <typename> friend class F;
9461 both F templates are the same. */
9462 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
9463 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
9465 /* But, if we don't find one, it might be because we're in a
9466 situation like this:
9474 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
9475 for `S<int>', not the TEMPLATE_DECL. */
9476 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
9478 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
9479 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
9482 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
9484 /* The friend template has already been declared. Just
9485 check to see that the declarations match, and install any new
9486 default parameters. We must tsubst the default parameters,
9487 of course. We only need the innermost template parameters
9488 because that is all that redeclare_class_template will look
9490 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
9491 > TMPL_ARGS_DEPTH (args
))
9494 location_t saved_input_location
;
9495 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
9496 args
, tf_warning_or_error
);
9498 saved_input_location
= input_location
;
9499 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
9500 tree cons
= get_constraints (tmpl
);
9501 redeclare_class_template (TREE_TYPE (tmpl
), parms
, cons
);
9502 input_location
= saved_input_location
;
9506 friend_type
= TREE_TYPE (tmpl
);
9510 /* The friend template has not already been declared. In this
9511 case, the instantiation of the template class will cause the
9512 injection of this template into the global scope. */
9513 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
9514 if (tmpl
== error_mark_node
)
9515 return error_mark_node
;
9517 /* The new TMPL is not an instantiation of anything, so we
9518 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
9519 the new type because that is supposed to be the corresponding
9520 template decl, i.e., TMPL. */
9521 DECL_USE_TEMPLATE (tmpl
) = 0;
9522 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
9523 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
9524 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
9525 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
9527 /* Inject this template into the global scope. */
9528 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9531 if (context
!= global_namespace
)
9533 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9534 pop_nested_namespace (context
);
9536 pop_nested_class ();
9542 /* Returns zero if TYPE cannot be completed later due to circularity.
9543 Otherwise returns one. */
9546 can_complete_type_without_circularity (tree type
)
9548 if (type
== NULL_TREE
|| type
== error_mark_node
)
9550 else if (COMPLETE_TYPE_P (type
))
9552 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9553 return can_complete_type_without_circularity (TREE_TYPE (type
));
9554 else if (CLASS_TYPE_P (type
)
9555 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9561 static tree
tsubst_omp_clauses (tree
, bool, bool, tree
, tsubst_flags_t
, tree
);
9563 /* Instantiate a single dependent attribute T (a TREE_LIST), and return either
9564 T or a new TREE_LIST, possibly a chain in the case of a pack expansion. */
9567 tsubst_attribute (tree t
, tree
*decl_p
, tree args
,
9568 tsubst_flags_t complain
, tree in_decl
)
9570 gcc_assert (ATTR_IS_DEPENDENT (t
));
9572 tree val
= TREE_VALUE (t
);
9573 if (val
== NULL_TREE
)
9574 /* Nothing to do. */;
9575 else if ((flag_openmp
|| flag_openmp_simd
|| flag_cilkplus
)
9576 && is_attribute_p ("omp declare simd",
9577 get_attribute_name (t
)))
9579 tree clauses
= TREE_VALUE (val
);
9580 clauses
= tsubst_omp_clauses (clauses
, true, false, args
,
9582 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9583 clauses
= finish_omp_clauses (clauses
, false, true);
9584 tree parms
= DECL_ARGUMENTS (*decl_p
);
9586 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9588 val
= build_tree_list (NULL_TREE
, clauses
);
9592 /* If the first attribute argument is an identifier, don't
9593 pass it through tsubst. Attributes like mode, format,
9594 cleanup and several target specific attributes expect it
9596 else if (attribute_takes_identifier_p (get_attribute_name (t
)))
9599 = tsubst_expr (TREE_CHAIN (val
), args
, complain
, in_decl
,
9600 /*integral_constant_expression_p=*/false);
9601 if (chain
!= TREE_CHAIN (val
))
9602 val
= tree_cons (NULL_TREE
, TREE_VALUE (val
), chain
);
9604 else if (PACK_EXPANSION_P (val
))
9606 /* An attribute pack expansion. */
9607 tree purp
= TREE_PURPOSE (t
);
9608 tree pack
= tsubst_pack_expansion (val
, args
, complain
, in_decl
);
9609 int len
= TREE_VEC_LENGTH (pack
);
9610 tree list
= NULL_TREE
;
9612 for (int i
= 0; i
< len
; ++i
)
9614 tree elt
= TREE_VEC_ELT (pack
, i
);
9615 *q
= build_tree_list (purp
, elt
);
9616 q
= &TREE_CHAIN (*q
);
9621 val
= tsubst_expr (val
, args
, complain
, in_decl
,
9622 /*integral_constant_expression_p=*/false);
9624 if (val
!= TREE_VALUE (t
))
9625 return build_tree_list (TREE_PURPOSE (t
), val
);
9629 /* Instantiate any dependent attributes in ATTRIBUTES, returning either it
9630 unchanged or a new TREE_LIST chain. */
9633 tsubst_attributes (tree attributes
, tree args
,
9634 tsubst_flags_t complain
, tree in_decl
)
9636 tree last_dep
= NULL_TREE
;
9638 for (tree t
= attributes
; t
; t
= TREE_CHAIN (t
))
9639 if (ATTR_IS_DEPENDENT (t
))
9642 attributes
= copy_list (attributes
);
9647 for (tree
*p
= &attributes
; *p
; p
= &TREE_CHAIN (*p
))
9650 if (ATTR_IS_DEPENDENT (t
))
9652 tree subst
= tsubst_attribute (t
, NULL
, args
, complain
, in_decl
);
9657 p
= &TREE_CHAIN (*p
);
9659 *p
= TREE_CHAIN (t
);
9666 /* Apply any attributes which had to be deferred until instantiation
9667 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9668 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9671 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9672 tree args
, tsubst_flags_t complain
, tree in_decl
)
9674 tree last_dep
= NULL_TREE
;
9678 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9679 if (ATTR_IS_DEPENDENT (t
))
9682 attributes
= copy_list (attributes
);
9686 if (DECL_P (*decl_p
))
9688 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9690 p
= &DECL_ATTRIBUTES (*decl_p
);
9693 p
= &TYPE_ATTRIBUTES (*decl_p
);
9697 tree late_attrs
= NULL_TREE
;
9698 tree
*q
= &late_attrs
;
9700 for (*p
= attributes
; *p
; )
9703 if (ATTR_IS_DEPENDENT (t
))
9705 *p
= TREE_CHAIN (t
);
9706 TREE_CHAIN (t
) = NULL_TREE
;
9707 *q
= tsubst_attribute (t
, decl_p
, args
, complain
, in_decl
);
9709 q
= &TREE_CHAIN (*q
);
9713 p
= &TREE_CHAIN (t
);
9716 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9720 /* Perform (or defer) access check for typedefs that were referenced
9721 from within the template TMPL code.
9722 This is a subroutine of instantiate_decl and instantiate_class_template.
9723 TMPL is the template to consider and TARGS is the list of arguments of
9727 perform_typedefs_access_check (tree tmpl
, tree targs
)
9729 location_t saved_location
;
9731 qualified_typedef_usage_t
*iter
;
9734 || (!CLASS_TYPE_P (tmpl
)
9735 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9738 saved_location
= input_location
;
9739 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9741 tree type_decl
= iter
->typedef_decl
;
9742 tree type_scope
= iter
->context
;
9744 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9747 if (uses_template_parms (type_decl
))
9748 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9749 if (uses_template_parms (type_scope
))
9750 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9752 /* Make access check error messages point to the location
9753 of the use of the typedef. */
9754 input_location
= iter
->locus
;
9755 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9756 type_decl
, type_decl
,
9757 tf_warning_or_error
);
9759 input_location
= saved_location
;
9763 instantiate_class_template_1 (tree type
)
9765 tree templ
, args
, pattern
, t
, member
;
9769 unsigned int saved_maximum_field_alignment
;
9772 if (type
== error_mark_node
)
9773 return error_mark_node
;
9775 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9776 || uses_template_parms (type
))
9779 /* Figure out which template is being instantiated. */
9780 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9781 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9783 /* Determine what specialization of the original template to
9785 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9786 if (t
== error_mark_node
)
9788 TYPE_BEING_DEFINED (type
) = 1;
9789 return error_mark_node
;
9793 /* This TYPE is actually an instantiation of a partial
9794 specialization. We replace the innermost set of ARGS with
9795 the arguments appropriate for substitution. For example,
9798 template <class T> struct S {};
9799 template <class T> struct S<T*> {};
9801 and supposing that we are instantiating S<int*>, ARGS will
9802 presently be {int*} -- but we need {int}. */
9803 pattern
= TREE_TYPE (t
);
9804 args
= TREE_PURPOSE (t
);
9808 pattern
= TREE_TYPE (templ
);
9809 args
= CLASSTYPE_TI_ARGS (type
);
9812 /* If the template we're instantiating is incomplete, then clearly
9813 there's nothing we can do. */
9814 if (!COMPLETE_TYPE_P (pattern
))
9817 /* If we've recursively instantiated too many templates, stop. */
9818 if (! push_tinst_level (type
))
9821 /* Now we're really doing the instantiation. Mark the type as in
9822 the process of being defined. */
9823 TYPE_BEING_DEFINED (type
) = 1;
9825 /* We may be in the middle of deferred access check. Disable
9827 push_deferring_access_checks (dk_no_deferred
);
9829 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9830 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9832 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9833 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9834 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9835 fn_context
= error_mark_node
;
9837 push_to_top_level ();
9840 cp_unevaluated_operand
= 0;
9841 c_inhibit_evaluation_warnings
= 0;
9843 /* Use #pragma pack from the template context. */
9844 saved_maximum_field_alignment
= maximum_field_alignment
;
9845 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9847 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9849 /* Set the input location to the most specialized template definition.
9850 This is needed if tsubsting causes an error. */
9851 typedecl
= TYPE_MAIN_DECL (pattern
);
9852 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9853 DECL_SOURCE_LOCATION (typedecl
);
9855 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9856 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9857 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9858 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9859 if (ANON_AGGR_TYPE_P (pattern
))
9860 SET_ANON_AGGR_TYPE_P (type
);
9861 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9863 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9864 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9865 /* Adjust visibility for template arguments. */
9866 determine_visibility (TYPE_MAIN_DECL (type
));
9868 if (CLASS_TYPE_P (type
))
9869 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9871 pbinfo
= TYPE_BINFO (pattern
);
9873 /* We should never instantiate a nested class before its enclosing
9874 class; we need to look up the nested class by name before we can
9875 instantiate it, and that lookup should instantiate the enclosing
9877 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9878 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9880 base_list
= NULL_TREE
;
9881 if (BINFO_N_BASE_BINFOS (pbinfo
))
9887 /* We must enter the scope containing the type, as that is where
9888 the accessibility of types named in dependent bases are
9890 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9892 /* Substitute into each of the bases to determine the actual
9894 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9897 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9898 tree expanded_bases
= NULL_TREE
;
9901 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9904 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9905 args
, tf_error
, NULL_TREE
);
9906 if (expanded_bases
== error_mark_node
)
9909 len
= TREE_VEC_LENGTH (expanded_bases
);
9912 for (idx
= 0; idx
< len
; idx
++)
9915 /* Extract the already-expanded base class. */
9916 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9918 /* Substitute to figure out the base class. */
9919 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9922 if (base
== error_mark_node
)
9925 base_list
= tree_cons (access
, base
, base_list
);
9926 if (BINFO_VIRTUAL_P (pbase_binfo
))
9927 TREE_TYPE (base_list
) = integer_type_node
;
9931 /* The list is now in reverse order; correct that. */
9932 base_list
= nreverse (base_list
);
9935 pop_scope (pushed_scope
);
9937 /* Now call xref_basetypes to set up all the base-class
9939 xref_basetypes (type
, base_list
);
9941 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9942 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9943 args
, tf_error
, NULL_TREE
);
9944 fixup_attribute_variants (type
);
9946 /* Now that our base classes are set up, enter the scope of the
9947 class, so that name lookups into base classes, etc. will work
9948 correctly. This is precisely analogous to what we do in
9949 begin_class_definition when defining an ordinary non-template
9950 class, except we also need to push the enclosing classes. */
9951 push_nested_class (type
);
9953 /* Now members are processed in the order of declaration. */
9954 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9955 member
; member
= TREE_CHAIN (member
))
9957 tree t
= TREE_VALUE (member
);
9959 if (TREE_PURPOSE (member
))
9963 /* Build new CLASSTYPE_NESTED_UTDS. */
9966 bool class_template_p
;
9968 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9969 && TYPE_LANG_SPECIFIC (t
)
9970 && CLASSTYPE_IS_TEMPLATE (t
));
9971 /* If the member is a class template, then -- even after
9972 substitution -- there may be dependent types in the
9973 template argument list for the class. We increment
9974 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9975 that function will assume that no types are dependent
9976 when outside of a template. */
9977 if (class_template_p
)
9978 ++processing_template_decl
;
9979 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9980 if (class_template_p
)
9981 --processing_template_decl
;
9982 if (newtag
== error_mark_node
)
9985 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9987 tree name
= TYPE_IDENTIFIER (t
);
9989 if (class_template_p
)
9990 /* Unfortunately, lookup_template_class sets
9991 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9992 instantiation (i.e., for the type of a member
9993 template class nested within a template class.)
9994 This behavior is required for
9995 maybe_process_partial_specialization to work
9996 correctly, but is not accurate in this case;
9997 the TAG is not an instantiation of anything.
9998 (The corresponding TEMPLATE_DECL is an
9999 instantiation, but the TYPE is not.) */
10000 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
10002 /* Now, we call pushtag to put this NEWTAG into the scope of
10003 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
10004 pushtag calling push_template_decl. We don't have to do
10005 this for enums because it will already have been done in
10008 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
10009 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
10012 else if (DECL_DECLARES_FUNCTION_P (t
))
10014 /* Build new TYPE_METHODS. */
10017 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10018 ++processing_template_decl
;
10019 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
10020 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10021 --processing_template_decl
;
10022 set_current_access_from_decl (r
);
10023 finish_member_declaration (r
);
10024 /* Instantiate members marked with attribute used. */
10025 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10027 if (TREE_CODE (r
) == FUNCTION_DECL
10028 && DECL_OMP_DECLARE_REDUCTION_P (r
))
10029 cp_check_omp_declare_reduction (r
);
10031 else if (DECL_CLASS_TEMPLATE_P (t
)
10032 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
10033 /* A closure type for a lambda in a default argument for a
10034 member template. Ignore it; it will be instantiated with
10035 the default argument. */;
10038 /* Build new TYPE_FIELDS. */
10039 if (TREE_CODE (t
) == STATIC_ASSERT
)
10043 ++c_inhibit_evaluation_warnings
;
10045 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
10046 tf_warning_or_error
, NULL_TREE
,
10047 /*integral_constant_expression_p=*/true);
10048 --c_inhibit_evaluation_warnings
;
10050 finish_static_assert (condition
,
10051 STATIC_ASSERT_MESSAGE (t
),
10052 STATIC_ASSERT_SOURCE_LOCATION (t
),
10053 /*member_p=*/true);
10055 else if (TREE_CODE (t
) != CONST_DECL
)
10058 tree vec
= NULL_TREE
;
10061 /* The file and line for this declaration, to
10062 assist in error message reporting. Since we
10063 called push_tinst_level above, we don't need to
10065 input_location
= DECL_SOURCE_LOCATION (t
);
10067 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10068 ++processing_template_decl
;
10069 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
10070 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10071 --processing_template_decl
;
10073 if (TREE_CODE (r
) == TREE_VEC
)
10075 /* A capture pack became multiple fields. */
10077 len
= TREE_VEC_LENGTH (vec
);
10080 for (int i
= 0; i
< len
; ++i
)
10083 r
= TREE_VEC_ELT (vec
, i
);
10088 [t]he initialization (and any associated
10089 side-effects) of a static data member does
10090 not occur unless the static data member is
10091 itself used in a way that requires the
10092 definition of the static data member to
10095 Therefore, we do not substitute into the
10096 initialized for the static data member here. */
10097 finish_static_data_member_decl
10099 /*init=*/NULL_TREE
,
10100 /*init_const_expr_p=*/false,
10101 /*asmspec_tree=*/NULL_TREE
,
10103 /* Instantiate members marked with attribute used. */
10104 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
10107 else if (TREE_CODE (r
) == FIELD_DECL
)
10109 /* Determine whether R has a valid type and can be
10110 completed later. If R is invalid, then its type
10111 is replaced by error_mark_node. */
10112 tree rtype
= TREE_TYPE (r
);
10113 if (can_complete_type_without_circularity (rtype
))
10114 complete_type (rtype
);
10116 if (TREE_CODE (r
) == FIELD_DECL
10117 && TREE_CODE (rtype
) == ARRAY_TYPE
10118 && COMPLETE_TYPE_P (TREE_TYPE (rtype
))
10119 && !COMPLETE_TYPE_P (rtype
))
10121 /* Flexible array mmembers of elements
10122 of complete type have an incomplete type
10123 and that's okay. */
10125 else if (!COMPLETE_TYPE_P (rtype
))
10127 cxx_incomplete_type_error (r
, rtype
);
10128 TREE_TYPE (r
) = error_mark_node
;
10132 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
10133 such a thing will already have been added to the field
10134 list by tsubst_enum in finish_member_declaration in the
10135 CLASSTYPE_NESTED_UTDS case above. */
10136 if (!(TREE_CODE (r
) == TYPE_DECL
10137 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
10138 && DECL_ARTIFICIAL (r
)))
10140 set_current_access_from_decl (r
);
10141 finish_member_declaration (r
);
10149 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
10150 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10152 /* Build new CLASSTYPE_FRIEND_CLASSES. */
10154 tree friend_type
= t
;
10155 bool adjust_processing_template_decl
= false;
10157 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10159 /* template <class T> friend class C; */
10160 friend_type
= tsubst_friend_class (friend_type
, args
);
10161 adjust_processing_template_decl
= true;
10163 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
10165 /* template <class T> friend class C::D; */
10166 friend_type
= tsubst (friend_type
, args
,
10167 tf_warning_or_error
, NULL_TREE
);
10168 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
10169 friend_type
= TREE_TYPE (friend_type
);
10170 adjust_processing_template_decl
= true;
10172 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
10173 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
10175 /* This could be either
10179 when dependent_type_p is false or
10181 template <class U> friend class T::C;
10184 /* Bump processing_template_decl in case this is something like
10185 template <class T> friend struct A<T>::B. */
10186 ++processing_template_decl
;
10187 friend_type
= tsubst (friend_type
, args
,
10188 tf_warning_or_error
, NULL_TREE
);
10189 if (dependent_type_p (friend_type
))
10190 adjust_processing_template_decl
= true;
10191 --processing_template_decl
;
10193 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
10194 && hidden_name_p (TYPE_NAME (friend_type
)))
10198 where C hasn't been declared yet. Let's lookup name
10199 from namespace scope directly, bypassing any name that
10200 come from dependent base class. */
10201 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
10203 /* The call to xref_tag_from_type does injection for friend
10205 push_nested_namespace (ns
);
10207 xref_tag_from_type (friend_type
, NULL_TREE
,
10208 /*tag_scope=*/ts_current
);
10209 pop_nested_namespace (ns
);
10211 else if (uses_template_parms (friend_type
))
10212 /* friend class C<T>; */
10213 friend_type
= tsubst (friend_type
, args
,
10214 tf_warning_or_error
, NULL_TREE
);
10219 where C is already declared or
10221 friend class C<int>;
10223 We don't have to do anything in these cases. */
10225 if (adjust_processing_template_decl
)
10226 /* Trick make_friend_class into realizing that the friend
10227 we're adding is a template, not an ordinary class. It's
10228 important that we use make_friend_class since it will
10229 perform some error-checking and output cross-reference
10231 ++processing_template_decl
;
10233 if (friend_type
!= error_mark_node
)
10234 make_friend_class (type
, friend_type
, /*complain=*/false);
10236 if (adjust_processing_template_decl
)
10237 --processing_template_decl
;
10241 /* Build new DECL_FRIENDLIST. */
10244 /* The file and line for this declaration, to
10245 assist in error message reporting. Since we
10246 called push_tinst_level above, we don't need to
10248 input_location
= DECL_SOURCE_LOCATION (t
);
10250 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10252 ++processing_template_decl
;
10253 push_deferring_access_checks (dk_no_check
);
10256 r
= tsubst_friend_function (t
, args
);
10257 add_friend (type
, r
, /*complain=*/false);
10258 if (TREE_CODE (t
) == TEMPLATE_DECL
)
10260 pop_deferring_access_checks ();
10261 --processing_template_decl
;
10269 /* Restore these before substituting into the lambda capture
10271 cp_unevaluated_operand
= saved_unevaluated_operand
;
10272 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10275 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
10277 tree decl
= lambda_function (type
);
10280 if (!DECL_TEMPLATE_INFO (decl
)
10281 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
10283 /* Set function_depth to avoid garbage collection. */
10285 instantiate_decl (decl
, false, false);
10289 /* We need to instantiate the capture list from the template
10290 after we've instantiated the closure members, but before we
10291 consider adding the conversion op. Also keep any captures
10292 that may have been added during instantiation of the op(). */
10293 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
10295 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
10296 args
, tf_warning_or_error
, NULL_TREE
,
10299 LAMBDA_EXPR_CAPTURE_LIST (expr
)
10300 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
10302 maybe_add_lambda_conv_op (type
);
10305 gcc_assert (errorcount
);
10308 /* Set the file and line number information to whatever is given for
10309 the class itself. This puts error messages involving generated
10310 implicit functions at a predictable point, and the same point
10311 that would be used for non-template classes. */
10312 input_location
= DECL_SOURCE_LOCATION (typedecl
);
10314 unreverse_member_declarations (type
);
10315 finish_struct_1 (type
);
10316 TYPE_BEING_DEFINED (type
) = 0;
10318 /* We don't instantiate default arguments for member functions. 14.7.1:
10320 The implicit instantiation of a class template specialization causes
10321 the implicit instantiation of the declarations, but not of the
10322 definitions or default arguments, of the class member functions,
10323 member classes, static data members and member templates.... */
10325 /* Some typedefs referenced from within the template code need to be access
10326 checked at template instantiation time, i.e now. These types were
10327 added to the template at parsing time. Let's get those and perform
10328 the access checks then. */
10329 perform_typedefs_access_check (pattern
, args
);
10330 perform_deferred_access_checks (tf_warning_or_error
);
10331 pop_nested_class ();
10332 maximum_field_alignment
= saved_maximum_field_alignment
;
10334 pop_from_top_level ();
10335 pop_deferring_access_checks ();
10336 pop_tinst_level ();
10338 /* The vtable for a template class can be emitted in any translation
10339 unit in which the class is instantiated. When there is no key
10340 method, however, finish_struct_1 will already have added TYPE to
10341 the keyed_classes list. */
10342 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
10343 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
10348 /* Wrapper for instantiate_class_template_1. */
10351 instantiate_class_template (tree type
)
10354 timevar_push (TV_TEMPLATE_INST
);
10355 ret
= instantiate_class_template_1 (type
);
10356 timevar_pop (TV_TEMPLATE_INST
);
10361 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10367 else if (TYPE_P (t
))
10368 r
= tsubst (t
, args
, complain
, in_decl
);
10371 if (!(complain
& tf_warning
))
10372 ++c_inhibit_evaluation_warnings
;
10373 r
= tsubst_expr (t
, args
, complain
, in_decl
,
10374 /*integral_constant_expression_p=*/true);
10375 if (!(complain
& tf_warning
))
10376 --c_inhibit_evaluation_warnings
;
10381 /* Given a function parameter pack TMPL_PARM and some function parameters
10382 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
10383 and set *SPEC_P to point at the next point in the list. */
10386 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
10388 /* Collect all of the extra "packed" parameters into an
10392 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
10393 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10394 tree spec_parm
= *spec_p
;
10397 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
10399 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
10402 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
10403 parmvec
= make_tree_vec (len
);
10404 parmtypevec
= make_tree_vec (len
);
10405 spec_parm
= *spec_p
;
10406 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
10408 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
10409 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
10412 /* Build the argument packs. */
10413 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
10414 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
10415 TREE_TYPE (argpack
) = argtypepack
;
10416 *spec_p
= spec_parm
;
10421 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
10422 NONTYPE_ARGUMENT_PACK. */
10425 make_fnparm_pack (tree spec_parm
)
10427 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
10430 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
10431 pack expansion with no extra args, 2 if it has extra args, or 0
10432 if it is not a pack expansion. */
10435 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
10437 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
10438 if (i
>= TREE_VEC_LENGTH (vec
))
10440 tree elt
= TREE_VEC_ELT (vec
, i
);
10442 /* A decl pack is itself an expansion. */
10443 elt
= TREE_TYPE (elt
);
10444 if (!PACK_EXPANSION_P (elt
))
10446 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
10452 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
10455 make_argument_pack_select (tree arg_pack
, unsigned index
)
10457 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
10459 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
10460 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10465 /* This is a subroutine of tsubst_pack_expansion.
10467 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
10468 mechanism to store the (non complete list of) arguments of the
10469 substitution and return a non substituted pack expansion, in order
10470 to wait for when we have enough arguments to really perform the
10474 use_pack_expansion_extra_args_p (tree parm_packs
,
10476 bool has_empty_arg
)
10478 /* If one pack has an expansion and another pack has a normal
10479 argument or if one pack has an empty argument and an another
10480 one hasn't then tsubst_pack_expansion cannot perform the
10481 substitution and need to fall back on the
10482 PACK_EXPANSION_EXTRA mechanism. */
10483 if (parm_packs
== NULL_TREE
)
10485 else if (has_empty_arg
)
10488 bool has_expansion_arg
= false;
10489 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
10491 bool has_non_expansion_arg
= false;
10492 for (tree parm_pack
= parm_packs
;
10494 parm_pack
= TREE_CHAIN (parm_pack
))
10496 tree arg
= TREE_VALUE (parm_pack
);
10498 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
10500 /* We can't substitute a pack expansion with extra args into
10504 has_expansion_arg
= true;
10506 has_non_expansion_arg
= true;
10509 if (has_expansion_arg
&& has_non_expansion_arg
)
10515 /* [temp.variadic]/6 says that:
10517 The instantiation of a pack expansion [...]
10518 produces a list E1,E2, ..., En, where N is the number of elements
10519 in the pack expansion parameters.
10521 This subroutine of tsubst_pack_expansion produces one of these Ei.
10523 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
10524 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
10525 PATTERN, and each TREE_VALUE is its corresponding argument pack.
10526 INDEX is the index 'i' of the element Ei to produce. ARGS,
10527 COMPLAIN, and IN_DECL are the same parameters as for the
10528 tsubst_pack_expansion function.
10530 The function returns the resulting Ei upon successful completion,
10531 or error_mark_node.
10533 Note that this function possibly modifies the ARGS parameter, so
10534 it's the responsibility of the caller to restore it. */
10537 gen_elem_of_pack_expansion_instantiation (tree pattern
,
10540 tree args
/* This parm gets
10542 tsubst_flags_t complain
,
10546 bool ith_elem_is_expansion
= false;
10548 /* For each parameter pack, change the substitution of the parameter
10549 pack to the ith argument in its argument pack, then expand the
10551 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
10553 tree parm
= TREE_PURPOSE (pack
);
10554 tree arg_pack
= TREE_VALUE (pack
);
10555 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
10557 ith_elem_is_expansion
|=
10558 argument_pack_element_is_expansion_p (arg_pack
, index
);
10560 /* Select the Ith argument from the pack. */
10561 if (TREE_CODE (parm
) == PARM_DECL
10562 || TREE_CODE (parm
) == FIELD_DECL
)
10566 aps
= make_argument_pack_select (arg_pack
, index
);
10567 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
10568 return error_mark_node
;
10569 register_local_specialization (aps
, parm
);
10572 aps
= retrieve_local_specialization (parm
);
10577 template_parm_level_and_index (parm
, &level
, &idx
);
10581 aps
= make_argument_pack_select (arg_pack
, index
);
10582 /* Update the corresponding argument. */
10583 TMPL_ARG (args
, level
, idx
) = aps
;
10586 /* Re-use the ARGUMENT_PACK_SELECT. */
10587 aps
= TMPL_ARG (args
, level
, idx
);
10589 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
10592 /* Substitute into the PATTERN with the (possibly altered)
10594 if (pattern
== in_decl
)
10595 /* Expanding a fixed parameter pack from
10596 coerce_template_parameter_pack. */
10597 t
= tsubst_decl (pattern
, args
, complain
);
10598 else if (pattern
== error_mark_node
)
10599 t
= error_mark_node
;
10600 else if (constraint_p (pattern
))
10602 if (processing_template_decl
)
10603 t
= tsubst_constraint (pattern
, args
, complain
, in_decl
);
10605 t
= (constraints_satisfied_p (pattern
, args
)
10606 ? boolean_true_node
: boolean_false_node
);
10608 else if (!TYPE_P (pattern
))
10609 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10610 /*integral_constant_expression_p=*/false);
10612 t
= tsubst (pattern
, args
, complain
, in_decl
);
10614 /* If the Ith argument pack element is a pack expansion, then
10615 the Ith element resulting from the substituting is going to
10616 be a pack expansion as well. */
10617 if (ith_elem_is_expansion
)
10618 t
= make_pack_expansion (t
);
10623 /* When the unexpanded parameter pack in a fold expression expands to an empty
10624 sequence, the value of the expression is as follows; the program is
10625 ill-formed if the operator is not listed in this table.
10636 expand_empty_fold (tree t
, tsubst_flags_t complain
)
10638 tree_code code
= (tree_code
)TREE_INT_CST_LOW (TREE_OPERAND (t
, 0));
10639 if (!FOLD_EXPR_MODIFY_P (t
))
10643 return integer_one_node
;
10645 return integer_zero_node
;
10647 return integer_minus_one_node
;
10649 return integer_zero_node
;
10650 case TRUTH_ANDIF_EXPR
:
10651 return boolean_true_node
;
10652 case TRUTH_ORIF_EXPR
:
10653 return boolean_false_node
;
10654 case COMPOUND_EXPR
:
10660 if (complain
& tf_error
)
10661 error_at (location_of (t
),
10662 "fold of empty expansion over %O", code
);
10663 return error_mark_node
;
10666 /* Given a fold-expression T and a current LEFT and RIGHT operand,
10667 form an expression that combines the two terms using the
10671 fold_expression (tree t
, tree left
, tree right
, tsubst_flags_t complain
)
10673 tree op
= FOLD_EXPR_OP (t
);
10674 tree_code code
= (tree_code
)TREE_INT_CST_LOW (op
);
10676 // Handle compound assignment operators.
10677 if (FOLD_EXPR_MODIFY_P (t
))
10678 return build_x_modify_expr (input_location
, left
, code
, right
, complain
);
10682 case COMPOUND_EXPR
:
10683 return build_x_compound_expr (input_location
, left
, right
, complain
);
10685 return build_m_component_ref (left
, right
, complain
);
10687 return build_x_binary_op (input_location
, code
,
10688 left
, TREE_CODE (left
),
10689 right
, TREE_CODE (right
),
10695 /* Substitute ARGS into the pack of a fold expression T. */
10698 tsubst_fold_expr_pack (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10700 return tsubst_pack_expansion (FOLD_EXPR_PACK (t
), args
, complain
, in_decl
);
10703 /* Substitute ARGS into the pack of a fold expression T. */
10706 tsubst_fold_expr_init (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10708 return tsubst_expr (FOLD_EXPR_INIT (t
), args
, complain
, in_decl
, false);
10711 /* Expand a PACK of arguments into a grouped as left fold.
10712 Given a pack containing elements A0, A1, ..., An and an
10713 operator @, this builds the expression:
10715 ((A0 @ A1) @ A2) ... @ An
10717 Note that PACK must not be empty.
10719 The operator is defined by the original fold expression T. */
10722 expand_left_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10724 tree left
= TREE_VEC_ELT (pack
, 0);
10725 for (int i
= 1; i
< TREE_VEC_LENGTH (pack
); ++i
)
10727 tree right
= TREE_VEC_ELT (pack
, i
);
10728 left
= fold_expression (t
, left
, right
, complain
);
10733 /* Substitute into a unary left fold expression. */
10736 tsubst_unary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10739 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10740 if (pack
== error_mark_node
)
10741 return error_mark_node
;
10742 if (TREE_VEC_LENGTH (pack
) == 0)
10743 return expand_empty_fold (t
, complain
);
10745 return expand_left_fold (t
, pack
, complain
);
10748 /* Substitute into a binary left fold expression.
10750 Do ths by building a single (non-empty) vector of argumnts and
10751 building the expression from those elements. */
10754 tsubst_binary_left_fold (tree t
, tree args
, tsubst_flags_t complain
,
10757 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10758 if (pack
== error_mark_node
)
10759 return error_mark_node
;
10760 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10761 if (init
== error_mark_node
)
10762 return error_mark_node
;
10764 tree vec
= make_tree_vec (TREE_VEC_LENGTH (pack
) + 1);
10765 TREE_VEC_ELT (vec
, 0) = init
;
10766 for (int i
= 0; i
< TREE_VEC_LENGTH (pack
); ++i
)
10767 TREE_VEC_ELT (vec
, i
+ 1) = TREE_VEC_ELT (pack
, i
);
10769 return expand_left_fold (t
, vec
, complain
);
10772 /* Expand a PACK of arguments into a grouped as right fold.
10773 Given a pack containing elementns A0, A1, ..., and an
10774 operator @, this builds the expression:
10776 A0@ ... (An-2 @ (An-1 @ An))
10778 Note that PACK must not be empty.
10780 The operator is defined by the original fold expression T. */
10783 expand_right_fold (tree t
, tree pack
, tsubst_flags_t complain
)
10785 // Build the expression.
10786 int n
= TREE_VEC_LENGTH (pack
);
10787 tree right
= TREE_VEC_ELT (pack
, n
- 1);
10788 for (--n
; n
!= 0; --n
)
10790 tree left
= TREE_VEC_ELT (pack
, n
- 1);
10791 right
= fold_expression (t
, left
, right
, complain
);
10796 /* Substitute into a unary right fold expression. */
10799 tsubst_unary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10802 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10803 if (pack
== error_mark_node
)
10804 return error_mark_node
;
10805 if (TREE_VEC_LENGTH (pack
) == 0)
10806 return expand_empty_fold (t
, complain
);
10808 return expand_right_fold (t
, pack
, complain
);
10811 /* Substitute into a binary right fold expression.
10813 Do ths by building a single (non-empty) vector of arguments and
10814 building the expression from those elements. */
10817 tsubst_binary_right_fold (tree t
, tree args
, tsubst_flags_t complain
,
10820 tree pack
= tsubst_fold_expr_pack (t
, args
, complain
, in_decl
);
10821 if (pack
== error_mark_node
)
10822 return error_mark_node
;
10823 tree init
= tsubst_fold_expr_init (t
, args
, complain
, in_decl
);
10824 if (init
== error_mark_node
)
10825 return error_mark_node
;
10827 int n
= TREE_VEC_LENGTH (pack
);
10828 tree vec
= make_tree_vec (n
+ 1);
10829 for (int i
= 0; i
< n
; ++i
)
10830 TREE_VEC_ELT (vec
, i
) = TREE_VEC_ELT (pack
, i
);
10831 TREE_VEC_ELT (vec
, n
) = init
;
10833 return expand_right_fold (t
, vec
, complain
);
10837 /* Substitute ARGS into T, which is an pack expansion
10838 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10839 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10840 (if only a partial substitution could be performed) or
10841 ERROR_MARK_NODE if there was an error. */
10843 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10847 tree pack
, packs
= NULL_TREE
;
10848 bool unsubstituted_packs
= false;
10851 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10852 bool need_local_specializations
= false;
10855 gcc_assert (PACK_EXPANSION_P (t
));
10856 pattern
= PACK_EXPANSION_PATTERN (t
);
10858 /* Add in any args remembered from an earlier partial instantiation. */
10859 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10861 levels
= TMPL_ARGS_DEPTH (args
);
10863 /* Determine the argument packs that will instantiate the parameter
10864 packs used in the expansion expression. While we're at it,
10865 compute the number of arguments to be expanded and make sure it
10867 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10868 pack
= TREE_CHAIN (pack
))
10870 tree parm_pack
= TREE_VALUE (pack
);
10871 tree arg_pack
= NULL_TREE
;
10872 tree orig_arg
= NULL_TREE
;
10875 if (TREE_CODE (parm_pack
) == BASES
)
10877 if (BASES_DIRECT (parm_pack
))
10878 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10879 args
, complain
, in_decl
, false));
10881 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10882 args
, complain
, in_decl
, false));
10884 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10886 /* We know we have correct local_specializations if this
10887 expansion is at function scope, or if we're dealing with a
10888 local parameter in a requires expression; for the latter,
10889 tsubst_requires_expr set it up appropriately. */
10890 if (PACK_EXPANSION_LOCAL_P (t
) || CONSTRAINT_VAR_P (parm_pack
))
10891 arg_pack
= retrieve_local_specialization (parm_pack
);
10893 /* We can't rely on local_specializations for a parameter
10894 name used later in a function declaration (such as in a
10895 late-specified return type). Even if it exists, it might
10896 have the wrong value for a recursive call. */
10897 need_local_specializations
= true;
10901 /* This parameter pack was used in an unevaluated context. Just
10902 make a dummy decl, since it's only used for its type. */
10903 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10904 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10905 /* Partial instantiation of the parm_pack, we can't build
10906 up an argument pack yet. */
10907 arg_pack
= NULL_TREE
;
10909 arg_pack
= make_fnparm_pack (arg_pack
);
10912 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10913 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10917 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10919 if (level
<= levels
)
10920 arg_pack
= TMPL_ARG (args
, level
, idx
);
10923 orig_arg
= arg_pack
;
10924 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10925 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10927 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10928 /* This can only happen if we forget to expand an argument
10929 pack somewhere else. Just return an error, silently. */
10931 result
= make_tree_vec (1);
10932 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10939 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10941 /* Don't bother trying to do a partial substitution with
10942 incomplete packs; we'll try again after deduction. */
10943 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10948 else if (len
!= my_len
)
10950 if (!(complain
& tf_error
))
10951 /* Fail quietly. */;
10952 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10953 error ("mismatched argument pack lengths while expanding "
10957 error ("mismatched argument pack lengths while expanding "
10960 return error_mark_node
;
10963 /* Keep track of the parameter packs and their corresponding
10965 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10966 TREE_TYPE (packs
) = orig_arg
;
10970 /* We can't substitute for this parameter pack. We use a flag as
10971 well as the missing_level counter because function parameter
10972 packs don't have a level. */
10973 unsubstituted_packs
= true;
10977 /* If the expansion is just T..., return the matching argument pack, unless
10978 we need to call convert_from_reference on all the elements. This is an
10979 important optimization; see c++/68422. */
10980 if (!unsubstituted_packs
10981 && TREE_PURPOSE (packs
) == pattern
)
10983 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10984 /* Types need no adjustment, nor does sizeof..., and if we still have
10985 some pack expansion args we won't do anything yet. */
10986 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10987 || PACK_EXPANSION_SIZEOF_P (t
)
10988 || pack_expansion_args_count (args
))
10990 /* Also optimize expression pack expansions if we can tell that the
10991 elements won't have reference type. */
10992 tree type
= TREE_TYPE (pattern
);
10993 if (type
&& TREE_CODE (type
) != REFERENCE_TYPE
10994 && !PACK_EXPANSION_P (type
)
10995 && !WILDCARD_TYPE_P (type
))
10997 /* Otherwise use the normal path so we get convert_from_reference. */
11000 /* We cannot expand this expansion expression, because we don't have
11001 all of the argument packs we need. */
11002 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
11004 /* We got some full packs, but we can't substitute them in until we
11005 have values for all the packs. So remember these until then. */
11007 t
= make_pack_expansion (pattern
);
11008 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
11011 else if (unsubstituted_packs
)
11013 /* There were no real arguments, we're just replacing a parameter
11014 pack with another version of itself. Substitute into the
11015 pattern and return a PACK_EXPANSION_*. The caller will need to
11017 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
11018 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
11019 /*integral_constant_expression_p=*/false);
11021 t
= tsubst (pattern
, args
, complain
, in_decl
);
11022 t
= make_pack_expansion (t
);
11026 gcc_assert (len
>= 0);
11028 if (need_local_specializations
)
11030 /* We're in a late-specified return type, so create our own local
11031 specializations map; the current map is either NULL or (in the
11032 case of recursive unification) might have bindings that we don't
11033 want to use or alter. */
11034 saved_local_specializations
= local_specializations
;
11035 local_specializations
= new hash_map
<tree
, tree
>;
11038 /* For each argument in each argument pack, substitute into the
11040 result
= make_tree_vec (len
);
11041 tree elem_args
= copy_template_args (args
);
11042 for (i
= 0; i
< len
; ++i
)
11044 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
11046 elem_args
, complain
,
11048 TREE_VEC_ELT (result
, i
) = t
;
11049 if (t
== error_mark_node
)
11051 result
= error_mark_node
;
11056 /* Update ARGS to restore the substitution from parameter packs to
11057 their argument packs. */
11058 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
11060 tree parm
= TREE_PURPOSE (pack
);
11062 if (TREE_CODE (parm
) == PARM_DECL
11063 || TREE_CODE (parm
) == FIELD_DECL
)
11064 register_local_specialization (TREE_TYPE (pack
), parm
);
11069 if (TREE_VALUE (pack
) == NULL_TREE
)
11072 template_parm_level_and_index (parm
, &level
, &idx
);
11074 /* Update the corresponding argument. */
11075 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
11076 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
11079 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
11083 if (need_local_specializations
)
11085 delete local_specializations
;
11086 local_specializations
= saved_local_specializations
;
11092 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
11093 TMPL. We do this using DECL_PARM_INDEX, which should work even with
11094 parameter packs; all parms generated from a function parameter pack will
11095 have the same DECL_PARM_INDEX. */
11098 get_pattern_parm (tree parm
, tree tmpl
)
11100 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
11103 if (DECL_ARTIFICIAL (parm
))
11105 for (patparm
= DECL_ARGUMENTS (pattern
);
11106 patparm
; patparm
= DECL_CHAIN (patparm
))
11107 if (DECL_ARTIFICIAL (patparm
)
11108 && DECL_NAME (parm
) == DECL_NAME (patparm
))
11113 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
11114 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
11115 gcc_assert (DECL_PARM_INDEX (patparm
)
11116 == DECL_PARM_INDEX (parm
));
11122 /* Make an argument pack out of the TREE_VEC VEC. */
11125 make_argument_pack (tree vec
)
11128 tree elt
= TREE_VEC_ELT (vec
, 0);
11130 pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11133 pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11134 TREE_TYPE (pack
) = TREE_TYPE (elt
);
11135 TREE_CONSTANT (pack
) = 1;
11137 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11141 /* Return an exact copy of template args T that can be modified
11145 copy_template_args (tree t
)
11147 if (t
== error_mark_node
)
11150 int len
= TREE_VEC_LENGTH (t
);
11151 tree new_vec
= make_tree_vec (len
);
11153 for (int i
= 0; i
< len
; ++i
)
11155 tree elt
= TREE_VEC_ELT (t
, i
);
11156 if (elt
&& TREE_CODE (elt
) == TREE_VEC
)
11157 elt
= copy_template_args (elt
);
11158 TREE_VEC_ELT (new_vec
, i
) = elt
;
11161 NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_vec
)
11162 = NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
);
11167 /* Substitute ARGS into the vector or list of template arguments T. */
11170 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11173 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
11176 if (t
== error_mark_node
)
11177 return error_mark_node
;
11179 len
= TREE_VEC_LENGTH (t
);
11180 elts
= XALLOCAVEC (tree
, len
);
11182 for (i
= 0; i
< len
; i
++)
11184 tree orig_arg
= TREE_VEC_ELT (t
, i
);
11187 if (TREE_CODE (orig_arg
) == TREE_VEC
)
11188 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
11189 else if (PACK_EXPANSION_P (orig_arg
))
11191 /* Substitute into an expansion expression. */
11192 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
11194 if (TREE_CODE (new_arg
) == TREE_VEC
)
11195 /* Add to the expanded length adjustment the number of
11196 expanded arguments. We subtract one from this
11197 measurement, because the argument pack expression
11198 itself is already counted as 1 in
11199 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
11200 the argument pack is empty. */
11201 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
11203 else if (ARGUMENT_PACK_P (orig_arg
))
11205 /* Substitute into each of the arguments. */
11206 new_arg
= TYPE_P (orig_arg
)
11207 ? cxx_make_type (TREE_CODE (orig_arg
))
11208 : make_node (TREE_CODE (orig_arg
));
11210 SET_ARGUMENT_PACK_ARGS (
11212 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
11213 args
, complain
, in_decl
));
11215 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
11216 new_arg
= error_mark_node
;
11218 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
11219 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
11220 complain
, in_decl
);
11221 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
11223 if (TREE_TYPE (new_arg
) == error_mark_node
)
11224 new_arg
= error_mark_node
;
11228 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
11230 if (new_arg
== error_mark_node
)
11231 return error_mark_node
;
11234 if (new_arg
!= orig_arg
)
11241 /* Make space for the expanded arguments coming from template
11243 t
= make_tree_vec (len
+ expanded_len_adjust
);
11244 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
11245 arguments for a member template.
11246 In that case each TREE_VEC in ORIG_T represents a level of template
11247 arguments, and ORIG_T won't carry any non defaulted argument count.
11248 It will rather be the nested TREE_VECs that will carry one.
11249 In other words, ORIG_T carries a non defaulted argument count only
11250 if it doesn't contain any nested TREE_VEC. */
11251 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
11253 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
11254 count
+= expanded_len_adjust
;
11255 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
11257 for (i
= 0, out
= 0; i
< len
; i
++)
11259 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
11260 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
11261 && TREE_CODE (elts
[i
]) == TREE_VEC
)
11265 /* Now expand the template argument pack "in place". */
11266 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
11267 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
11271 TREE_VEC_ELT (t
, out
) = elts
[i
];
11279 /* Return the result of substituting ARGS into the template parameters
11280 given by PARMS. If there are m levels of ARGS and m + n levels of
11281 PARMS, then the result will contain n levels of PARMS. For
11282 example, if PARMS is `template <class T> template <class U>
11283 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
11284 result will be `template <int*, double, class V>'. */
11287 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
11289 tree r
= NULL_TREE
;
11292 /* When substituting into a template, we must set
11293 PROCESSING_TEMPLATE_DECL as the template parameters may be
11294 dependent if they are based on one-another, and the dependency
11295 predicates are short-circuit outside of templates. */
11296 ++processing_template_decl
;
11298 for (new_parms
= &r
;
11299 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
11300 new_parms
= &(TREE_CHAIN (*new_parms
)),
11301 parms
= TREE_CHAIN (parms
))
11304 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
11307 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
11311 if (parms
== error_mark_node
)
11314 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
11316 if (tuple
== error_mark_node
)
11319 TREE_VEC_ELT (new_vec
, i
) =
11320 tsubst_template_parm (tuple
, args
, complain
);
11324 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
11325 - TMPL_ARGS_DEPTH (args
)),
11326 new_vec
, NULL_TREE
);
11329 --processing_template_decl
;
11334 /* Return the result of substituting ARGS into one template parameter
11335 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
11336 parameter and which TREE_PURPOSE is the default argument of the
11337 template parameter. */
11340 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
11342 tree default_value
, parm_decl
;
11344 if (args
== NULL_TREE
11346 || t
== error_mark_node
)
11349 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
11351 default_value
= TREE_PURPOSE (t
);
11352 parm_decl
= TREE_VALUE (t
);
11354 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
11355 if (TREE_CODE (parm_decl
) == PARM_DECL
11356 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
11357 parm_decl
= error_mark_node
;
11358 default_value
= tsubst_template_arg (default_value
, args
,
11359 complain
, NULL_TREE
);
11361 return build_tree_list (default_value
, parm_decl
);
11364 /* Substitute the ARGS into the indicated aggregate (or enumeration)
11365 type T. If T is not an aggregate or enumeration type, it is
11366 handled as if by tsubst. IN_DECL is as for tsubst. If
11367 ENTERING_SCOPE is nonzero, T is the context for a template which
11368 we are presently tsubst'ing. Return the substituted value. */
11371 tsubst_aggr_type (tree t
,
11373 tsubst_flags_t complain
,
11375 int entering_scope
)
11377 if (t
== NULL_TREE
)
11380 switch (TREE_CODE (t
))
11383 if (TYPE_PTRMEMFUNC_P (t
))
11384 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
11386 /* Else fall through. */
11387 case ENUMERAL_TYPE
:
11389 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
11394 int saved_unevaluated_operand
;
11395 int saved_inhibit_evaluation_warnings
;
11397 /* In "sizeof(X<I>)" we need to evaluate "I". */
11398 saved_unevaluated_operand
= cp_unevaluated_operand
;
11399 cp_unevaluated_operand
= 0;
11400 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
11401 c_inhibit_evaluation_warnings
= 0;
11403 /* First, determine the context for the type we are looking
11405 context
= TYPE_CONTEXT (t
);
11406 if (context
&& TYPE_P (context
))
11408 context
= tsubst_aggr_type (context
, args
, complain
,
11409 in_decl
, /*entering_scope=*/1);
11410 /* If context is a nested class inside a class template,
11411 it may still need to be instantiated (c++/33959). */
11412 context
= complete_type (context
);
11415 /* Then, figure out what arguments are appropriate for the
11416 type we are trying to find. For example, given:
11418 template <class T> struct S;
11419 template <class T, class U> void f(T, U) { S<U> su; }
11421 and supposing that we are instantiating f<int, double>,
11422 then our ARGS will be {int, double}, but, when looking up
11423 S we only want {double}. */
11424 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
11425 complain
, in_decl
);
11426 if (argvec
== error_mark_node
)
11427 r
= error_mark_node
;
11430 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
11431 entering_scope
, complain
);
11432 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
11435 cp_unevaluated_operand
= saved_unevaluated_operand
;
11436 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
11441 /* This is not a template type, so there's nothing to do. */
11445 return tsubst (t
, args
, complain
, in_decl
);
11449 /* Substitute into the default argument ARG (a default argument for
11450 FN), which has the indicated TYPE. */
11453 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
11455 tree saved_class_ptr
= NULL_TREE
;
11456 tree saved_class_ref
= NULL_TREE
;
11457 int errs
= errorcount
+ sorrycount
;
11459 /* This can happen in invalid code. */
11460 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11463 /* This default argument came from a template. Instantiate the
11464 default argument here, not in tsubst. In the case of
11473 we must be careful to do name lookup in the scope of S<T>,
11474 rather than in the current class. */
11475 push_access_scope (fn
);
11476 /* The "this" pointer is not valid in a default argument. */
11479 saved_class_ptr
= current_class_ptr
;
11480 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
11481 saved_class_ref
= current_class_ref
;
11482 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
11485 push_deferring_access_checks(dk_no_deferred
);
11486 /* The default argument expression may cause implicitly defined
11487 member functions to be synthesized, which will result in garbage
11488 collection. We must treat this situation as if we were within
11489 the body of function so as to avoid collecting live data on the
11492 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
11493 complain
, NULL_TREE
,
11494 /*integral_constant_expression_p=*/false);
11496 pop_deferring_access_checks();
11498 /* Restore the "this" pointer. */
11501 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
11502 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
11505 if (errorcount
+sorrycount
> errs
11506 && (complain
& tf_warning_or_error
))
11507 inform (input_location
,
11508 " when instantiating default argument for call to %D", fn
);
11510 /* Make sure the default argument is reasonable. */
11511 arg
= check_default_argument (type
, arg
, complain
);
11513 pop_access_scope (fn
);
11518 /* Substitute into all the default arguments for FN. */
11521 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
11526 tmpl_args
= DECL_TI_ARGS (fn
);
11528 /* If this function is not yet instantiated, we certainly don't need
11529 its default arguments. */
11530 if (uses_template_parms (tmpl_args
))
11532 /* Don't do this again for clones. */
11533 if (DECL_CLONED_FUNCTION_P (fn
))
11536 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
11538 arg
= TREE_CHAIN (arg
))
11539 if (TREE_PURPOSE (arg
))
11540 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
11542 TREE_PURPOSE (arg
),
11546 /* Substitute the ARGS into the T, which is a _DECL. Return the
11547 result of the substitution. Issue error and warning messages under
11548 control of COMPLAIN. */
11551 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
11553 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
11554 location_t saved_loc
;
11555 tree r
= NULL_TREE
;
11557 hashval_t hash
= 0;
11559 /* Set the filename and linenumber to improve error-reporting. */
11560 saved_loc
= input_location
;
11561 input_location
= DECL_SOURCE_LOCATION (t
);
11563 switch (TREE_CODE (t
))
11565 case TEMPLATE_DECL
:
11567 /* We can get here when processing a member function template,
11568 member class template, or template template parameter. */
11569 tree decl
= DECL_TEMPLATE_RESULT (t
);
11574 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
11576 /* Template template parameter is treated here. */
11577 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11578 if (new_type
== error_mark_node
)
11579 r
= error_mark_node
;
11580 /* If we get a real template back, return it. This can happen in
11581 the context of most_specialized_partial_spec. */
11582 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
11585 /* The new TEMPLATE_DECL was built in
11586 reduce_template_parm_level. */
11587 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
11591 /* We might already have an instance of this template.
11592 The ARGS are for the surrounding class type, so the
11593 full args contain the tsubst'd args for the context,
11594 plus the innermost args from the template decl. */
11595 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
11596 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
11597 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
11598 /* Because this is a template, the arguments will still be
11599 dependent, even after substitution. If
11600 PROCESSING_TEMPLATE_DECL is not set, the dependency
11601 predicates will short-circuit. */
11602 ++processing_template_decl
;
11603 full_args
= tsubst_template_args (tmpl_args
, args
,
11604 complain
, in_decl
);
11605 --processing_template_decl
;
11606 if (full_args
== error_mark_node
)
11607 RETURN (error_mark_node
);
11609 /* If this is a default template template argument,
11610 tsubst might not have changed anything. */
11611 if (full_args
== tmpl_args
)
11614 hash
= hash_tmpl_and_args (t
, full_args
);
11615 spec
= retrieve_specialization (t
, full_args
, hash
);
11616 if (spec
!= NULL_TREE
)
11622 /* Make a new template decl. It will be similar to the
11623 original, but will record the current template arguments.
11624 We also create a new function declaration, which is just
11625 like the old one, but points to this new template, rather
11626 than the old one. */
11628 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
11629 DECL_CHAIN (r
) = NULL_TREE
;
11631 // Build new template info linking to the original template decl.
11632 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11634 if (TREE_CODE (decl
) == TYPE_DECL
11635 && !TYPE_DECL_ALIAS_P (decl
))
11638 ++processing_template_decl
;
11639 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11640 --processing_template_decl
;
11641 if (new_type
== error_mark_node
)
11642 RETURN (error_mark_node
);
11644 TREE_TYPE (r
) = new_type
;
11645 /* For a partial specialization, we need to keep pointing to
11646 the primary template. */
11647 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
11648 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
11649 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
11650 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
11651 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
11656 ++processing_template_decl
;
11657 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
11658 --processing_template_decl
;
11659 if (new_decl
== error_mark_node
)
11660 RETURN (error_mark_node
);
11662 DECL_TEMPLATE_RESULT (r
) = new_decl
;
11663 DECL_TI_TEMPLATE (new_decl
) = r
;
11664 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
11665 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
11666 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
11669 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11670 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
11671 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
11673 /* The template parameters for this new template are all the
11674 template parameters for the old template, except the
11675 outermost level of parameters. */
11676 DECL_TEMPLATE_PARMS (r
)
11677 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
11680 if (PRIMARY_TEMPLATE_P (t
))
11681 DECL_PRIMARY_TEMPLATE (r
) = r
;
11683 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
11684 /* Record this non-type partial instantiation. */
11685 register_specialization (r
, t
,
11686 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
11691 case FUNCTION_DECL
:
11694 tree argvec
= NULL_TREE
;
11702 /* Nobody should be tsubst'ing into non-template functions. */
11703 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
11705 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
11710 /* If T is not dependent, just return it. We have to
11711 increment PROCESSING_TEMPLATE_DECL because
11712 value_dependent_expression_p assumes that nothing is
11713 dependent when PROCESSING_TEMPLATE_DECL is zero. */
11714 ++processing_template_decl
;
11715 dependent_p
= value_dependent_expression_p (t
);
11716 --processing_template_decl
;
11720 /* Calculate the most general template of which R is a
11721 specialization, and the complete set of arguments used to
11723 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
11724 argvec
= tsubst_template_args (DECL_TI_ARGS
11725 (DECL_TEMPLATE_RESULT
11726 (DECL_TI_TEMPLATE (t
))),
11727 args
, complain
, in_decl
);
11728 if (argvec
== error_mark_node
)
11729 RETURN (error_mark_node
);
11731 /* Check to see if we already have this specialization. */
11732 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11733 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11741 /* We can see more levels of arguments than parameters if
11742 there was a specialization of a member template, like
11745 template <class T> struct S { template <class U> void f(); }
11746 template <> template <class U> void S<int>::f(U);
11748 Here, we'll be substituting into the specialization,
11749 because that's where we can find the code we actually
11750 want to generate, but we'll have enough arguments for
11751 the most general template.
11753 We also deal with the peculiar case:
11755 template <class T> struct S {
11756 template <class U> friend void f();
11758 template <class U> void f() {}
11760 template void f<double>();
11762 Here, the ARGS for the instantiation of will be {int,
11763 double}. But, we only need as many ARGS as there are
11764 levels of template parameters in CODE_PATTERN. We are
11765 careful not to get fooled into reducing the ARGS in
11768 template <class T> struct S { template <class U> void f(U); }
11769 template <class T> template <> void S<T>::f(int) {}
11771 which we can spot because the pattern will be a
11772 specialization in this case. */
11773 args_depth
= TMPL_ARGS_DEPTH (args
);
11775 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
11776 if (args_depth
> parms_depth
11777 && !DECL_TEMPLATE_SPECIALIZATION (t
))
11778 args
= get_innermost_template_args (args
, parms_depth
);
11782 /* This special case arises when we have something like this:
11784 template <class T> struct S {
11785 friend void f<int>(int, double);
11788 Here, the DECL_TI_TEMPLATE for the friend declaration
11789 will be an IDENTIFIER_NODE. We are being called from
11790 tsubst_friend_function, and we want only to create a
11791 new decl (R) with appropriate types so that we can call
11792 determine_specialization. */
11793 gen_tmpl
= NULL_TREE
;
11796 if (DECL_CLASS_SCOPE_P (t
))
11798 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
11802 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
11803 complain
, t
, /*entering_scope=*/1);
11808 ctx
= DECL_CONTEXT (t
);
11810 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11811 if (type
== error_mark_node
)
11812 RETURN (error_mark_node
);
11814 /* If we hit excessive deduction depth, the type is bogus even if
11815 it isn't error_mark_node, so don't build a decl. */
11816 if (excessive_deduction_depth
)
11817 RETURN (error_mark_node
);
11819 /* We do NOT check for matching decls pushed separately at this
11820 point, as they may not represent instantiations of this
11821 template, and in any case are considered separate under the
11824 DECL_USE_TEMPLATE (r
) = 0;
11825 TREE_TYPE (r
) = type
;
11826 /* Clear out the mangled name and RTL for the instantiation. */
11827 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11828 SET_DECL_RTL (r
, NULL
);
11829 /* Leave DECL_INITIAL set on deleted instantiations. */
11830 if (!DECL_DELETED_FN (r
))
11831 DECL_INITIAL (r
) = NULL_TREE
;
11832 DECL_CONTEXT (r
) = ctx
;
11834 /* OpenMP UDRs have the only argument a reference to the declared
11835 type. We want to diagnose if the declared type is a reference,
11836 which is invalid, but as references to references are usually
11837 quietly merged, diagnose it here. */
11838 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
11841 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
11842 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
11843 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
11844 error_at (DECL_SOURCE_LOCATION (t
),
11845 "reference type %qT in "
11846 "%<#pragma omp declare reduction%>", argtype
);
11847 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
11848 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
11852 if (member
&& DECL_CONV_FN_P (r
))
11853 /* Type-conversion operator. Reconstruct the name, in
11854 case it's the name of one of the template's parameters. */
11855 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
11857 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
11859 DECL_RESULT (r
) = NULL_TREE
;
11861 TREE_STATIC (r
) = 0;
11862 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
11863 DECL_EXTERNAL (r
) = 1;
11864 /* If this is an instantiation of a function with internal
11865 linkage, we already know what object file linkage will be
11866 assigned to the instantiation. */
11867 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
11868 DECL_DEFER_OUTPUT (r
) = 0;
11869 DECL_CHAIN (r
) = NULL_TREE
;
11870 DECL_PENDING_INLINE_INFO (r
) = 0;
11871 DECL_PENDING_INLINE_P (r
) = 0;
11872 DECL_SAVED_TREE (r
) = NULL_TREE
;
11873 DECL_STRUCT_FUNCTION (r
) = NULL
;
11875 /* We'll re-clone as appropriate in instantiate_template. */
11876 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
11878 /* If we aren't complaining now, return on error before we register
11879 the specialization so that we'll complain eventually. */
11880 if ((complain
& tf_error
) == 0
11881 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11882 && !grok_op_properties (r
, /*complain=*/false))
11883 RETURN (error_mark_node
);
11885 /* When instantiating a constrained member, substitute
11886 into the constraints to create a new constraint. */
11887 if (tree ci
= get_constraints (t
))
11890 ci
= tsubst_constraint_info (ci
, argvec
, complain
, NULL_TREE
);
11891 set_constraints (r
, ci
);
11894 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11895 this in the special friend case mentioned above where
11896 GEN_TMPL is NULL. */
11899 DECL_TEMPLATE_INFO (r
)
11900 = build_template_info (gen_tmpl
, argvec
);
11901 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11904 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11906 /* We instantiated this while substituting into
11907 the type earlier (template/friend54.C). */
11910 /* We're not supposed to instantiate default arguments
11911 until they are called, for a template. But, for a
11914 template <class T> void f ()
11915 { extern void g(int i = T()); }
11917 we should do the substitution when the template is
11918 instantiated. We handle the member function case in
11919 instantiate_class_template since the default arguments
11920 might refer to other members of the class. */
11922 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11923 && !uses_template_parms (argvec
))
11924 tsubst_default_arguments (r
, complain
);
11927 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11929 /* Copy the list of befriending classes. */
11930 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11932 friends
= &TREE_CHAIN (*friends
))
11934 *friends
= copy_node (*friends
);
11935 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11940 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11942 maybe_retrofit_in_chrg (r
);
11943 if (DECL_CONSTRUCTOR_P (r
))
11944 grok_ctor_properties (ctx
, r
);
11945 if (DECL_INHERITED_CTOR_BASE (r
))
11946 deduce_inheriting_ctor (r
);
11947 /* If this is an instantiation of a member template, clone it.
11948 If it isn't, that'll be handled by
11949 clone_constructors_and_destructors. */
11950 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11951 clone_function_decl (r
, /*update_method_vec_p=*/0);
11953 else if ((complain
& tf_error
) != 0
11954 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11955 && !grok_op_properties (r
, /*complain=*/true))
11956 RETURN (error_mark_node
);
11958 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11959 SET_DECL_FRIEND_CONTEXT (r
,
11960 tsubst (DECL_FRIEND_CONTEXT (t
),
11961 args
, complain
, in_decl
));
11963 /* Possibly limit visibility based on template args. */
11964 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11965 if (DECL_VISIBILITY_SPECIFIED (t
))
11967 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11968 DECL_ATTRIBUTES (r
)
11969 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11971 determine_visibility (r
);
11972 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11973 && !processing_template_decl
)
11974 defaulted_late_check (r
);
11976 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11977 args
, complain
, in_decl
);
11983 tree type
= NULL_TREE
;
11985 tree expanded_types
= NULL_TREE
;
11986 tree prev_r
= NULL_TREE
;
11987 tree first_r
= NULL_TREE
;
11989 if (DECL_PACK_P (t
))
11991 /* If there is a local specialization that isn't a
11992 parameter pack, it means that we're doing a "simple"
11993 substitution from inside tsubst_pack_expansion. Just
11994 return the local specialization (which will be a single
11996 tree spec
= retrieve_local_specialization (t
);
11998 && TREE_CODE (spec
) == PARM_DECL
11999 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
12002 /* Expand the TYPE_PACK_EXPANSION that provides the types for
12003 the parameters in this function parameter pack. */
12004 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
12005 complain
, in_decl
);
12006 if (TREE_CODE (expanded_types
) == TREE_VEC
)
12008 len
= TREE_VEC_LENGTH (expanded_types
);
12010 /* Zero-length parameter packs are boring. Just substitute
12013 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
12018 /* All we did was update the type. Make a note of that. */
12019 type
= expanded_types
;
12020 expanded_types
= NULL_TREE
;
12024 /* Loop through all of the parameters we'll build. When T is
12025 a function parameter pack, LEN is the number of expanded
12026 types in EXPANDED_TYPES; otherwise, LEN is 1. */
12028 for (i
= 0; i
< len
; ++i
)
12032 if (DECL_TEMPLATE_PARM_P (t
))
12033 SET_DECL_TEMPLATE_PARM_P (r
);
12035 if (expanded_types
)
12036 /* We're on the Ith parameter of the function parameter
12039 /* Get the Ith type. */
12040 type
= TREE_VEC_ELT (expanded_types
, i
);
12042 /* Rename the parameter to include the index. */
12044 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
12047 /* We're dealing with a normal parameter. */
12048 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12050 type
= type_decays_to (type
);
12051 TREE_TYPE (r
) = type
;
12052 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12054 if (DECL_INITIAL (r
))
12056 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
12057 DECL_INITIAL (r
) = TREE_TYPE (r
);
12059 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
12060 complain
, in_decl
);
12063 DECL_CONTEXT (r
) = NULL_TREE
;
12065 if (!DECL_TEMPLATE_PARM_P (r
))
12066 DECL_ARG_TYPE (r
) = type_passed_as (type
);
12068 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12069 args
, complain
, in_decl
);
12071 /* Keep track of the first new parameter we
12072 generate. That's what will be returned to the
12077 /* Build a proper chain of parameters when substituting
12078 into a function parameter pack. */
12080 DECL_CHAIN (prev_r
) = r
;
12083 /* If cp_unevaluated_operand is set, we're just looking for a
12084 single dummy parameter, so don't keep going. */
12085 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
12086 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
12087 complain
, DECL_CHAIN (t
));
12089 /* FIRST_R contains the start of the chain we've built. */
12096 tree type
= NULL_TREE
;
12097 tree vec
= NULL_TREE
;
12098 tree expanded_types
= NULL_TREE
;
12101 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12103 /* This field is a lambda capture pack. Return a TREE_VEC of
12104 the expanded fields to instantiate_class_template_1 and
12105 store them in the specializations hash table as a
12106 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
12107 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
12108 complain
, in_decl
);
12109 if (TREE_CODE (expanded_types
) == TREE_VEC
)
12111 len
= TREE_VEC_LENGTH (expanded_types
);
12112 vec
= make_tree_vec (len
);
12116 /* All we did was update the type. Make a note of that. */
12117 type
= expanded_types
;
12118 expanded_types
= NULL_TREE
;
12122 for (int i
= 0; i
< len
; ++i
)
12125 if (expanded_types
)
12127 type
= TREE_VEC_ELT (expanded_types
, i
);
12129 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
12132 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12134 if (type
== error_mark_node
)
12135 RETURN (error_mark_node
);
12136 TREE_TYPE (r
) = type
;
12137 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12139 if (DECL_C_BIT_FIELD (r
))
12140 /* For bit-fields, DECL_INITIAL gives the number of bits. For
12141 non-bit-fields DECL_INITIAL is a non-static data member
12142 initializer, which gets deferred instantiation. */
12144 = tsubst_expr (DECL_INITIAL (t
), args
,
12146 /*integral_constant_expression_p=*/true);
12147 else if (DECL_INITIAL (t
))
12149 /* Set up DECL_TEMPLATE_INFO so that we can get at the
12150 NSDMI in perform_member_init. Still set DECL_INITIAL
12151 so that we know there is one. */
12152 DECL_INITIAL (r
) = void_node
;
12153 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
12154 retrofit_lang_decl (r
);
12155 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
12157 /* We don't have to set DECL_CONTEXT here; it is set by
12158 finish_member_declaration. */
12159 DECL_CHAIN (r
) = NULL_TREE
;
12161 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
12162 args
, complain
, in_decl
);
12165 TREE_VEC_ELT (vec
, i
) = r
;
12171 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
12172 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
12173 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
12174 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
12175 TREE_TYPE (pack
) = tpack
;
12176 register_specialization (pack
, t
, args
, false, 0);
12182 /* We reach here only for member using decls. We also need to check
12183 uses_template_parms because DECL_DEPENDENT_P is not set for a
12184 using-declaration that designates a member of the current
12185 instantiation (c++/53549). */
12186 if (DECL_DEPENDENT_P (t
)
12187 || uses_template_parms (USING_DECL_SCOPE (t
)))
12189 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
12190 complain
, in_decl
);
12191 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
12192 r
= do_class_using_decl (inst_scope
, name
);
12194 r
= error_mark_node
;
12197 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
12198 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
12204 DECL_CHAIN (r
) = NULL_TREE
;
12211 tree argvec
= NULL_TREE
;
12212 tree gen_tmpl
= NULL_TREE
;
12214 tree tmpl
= NULL_TREE
;
12216 tree type
= NULL_TREE
;
12219 if (TREE_TYPE (t
) == error_mark_node
)
12220 RETURN (error_mark_node
);
12222 if (TREE_CODE (t
) == TYPE_DECL
12223 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
12225 /* If this is the canonical decl, we don't have to
12226 mess with instantiations, and often we can't (for
12227 typename, template type parms and such). Note that
12228 TYPE_NAME is not correct for the above test if
12229 we've copied the type for a typedef. */
12230 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12231 if (type
== error_mark_node
)
12232 RETURN (error_mark_node
);
12233 r
= TYPE_NAME (type
);
12237 /* Check to see if we already have the specialization we
12240 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
12242 /* T is a static data member or namespace-scope entity.
12243 We have to substitute into namespace-scope variables
12244 (not just variable templates) because of cases like:
12246 template <class T> void f() { extern T t; }
12248 where the entity referenced is not known until
12249 instantiation time. */
12251 ctx
= DECL_CONTEXT (t
);
12252 if (DECL_CLASS_SCOPE_P (t
))
12254 ctx
= tsubst_aggr_type (ctx
, args
,
12256 in_decl
, /*entering_scope=*/1);
12257 /* If CTX is unchanged, then T is in fact the
12258 specialization we want. That situation occurs when
12259 referencing a static data member within in its own
12260 class. We can use pointer equality, rather than
12261 same_type_p, because DECL_CONTEXT is always
12263 if (ctx
== DECL_CONTEXT (t
)
12264 /* ... unless T is a member template; in which
12265 case our caller can be willing to create a
12266 specialization of that template represented
12268 && !(DECL_TI_TEMPLATE (t
)
12269 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
12275 tmpl
= DECL_TI_TEMPLATE (t
);
12276 gen_tmpl
= most_general_template (tmpl
);
12277 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
12278 if (argvec
!= error_mark_node
)
12279 argvec
= (coerce_innermost_template_parms
12280 (DECL_TEMPLATE_PARMS (gen_tmpl
),
12281 argvec
, t
, complain
,
12282 /*all*/true, /*defarg*/true));
12283 if (argvec
== error_mark_node
)
12284 RETURN (error_mark_node
);
12285 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
12286 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
12291 /* A local variable. */
12293 /* Subsequent calls to pushdecl will fill this in. */
12295 spec
= retrieve_local_specialization (t
);
12297 /* If we already have the specialization we need, there is
12298 nothing more to do. */
12305 /* Create a new node for the specialization we need. */
12307 if (type
== NULL_TREE
)
12309 if (is_typedef_decl (t
))
12310 type
= DECL_ORIGINAL_TYPE (t
);
12312 type
= TREE_TYPE (t
);
12314 && VAR_HAD_UNKNOWN_BOUND (t
)
12315 && type
!= error_mark_node
)
12316 type
= strip_array_domain (type
);
12317 type
= tsubst (type
, args
, complain
, in_decl
);
12321 /* Even if the original location is out of scope, the
12322 newly substituted one is not. */
12323 DECL_DEAD_FOR_LOCAL (r
) = 0;
12324 DECL_INITIALIZED_P (r
) = 0;
12325 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
12326 if (type
== error_mark_node
)
12327 RETURN (error_mark_node
);
12328 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12330 /* It may seem that this case cannot occur, since:
12335 declares a function, not a variable. However:
12338 template <typename T> void g() { T t; }
12339 template void g<f>();
12341 is an attempt to declare a variable with function
12343 error ("variable %qD has function type",
12344 /* R is not yet sufficiently initialized, so we
12345 just use its name. */
12347 RETURN (error_mark_node
);
12349 type
= complete_type (type
);
12350 /* Wait until cp_finish_decl to set this again, to handle
12351 circular dependency (template/instantiate6.C). */
12352 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
12353 type
= check_var_type (DECL_NAME (r
), type
);
12355 if (DECL_HAS_VALUE_EXPR_P (t
))
12357 tree ve
= DECL_VALUE_EXPR (t
);
12358 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
12359 /*constant_expression_p=*/false);
12360 if (REFERENCE_REF_P (ve
))
12362 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
12363 ve
= TREE_OPERAND (ve
, 0);
12365 SET_DECL_VALUE_EXPR (r
, ve
);
12367 if (CP_DECL_THREAD_LOCAL_P (r
)
12368 && !processing_template_decl
)
12369 set_decl_tls_model (r
, decl_default_tls_model (r
));
12371 else if (DECL_SELF_REFERENCE_P (t
))
12372 SET_DECL_SELF_REFERENCE_P (r
);
12373 TREE_TYPE (r
) = type
;
12374 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
12375 DECL_CONTEXT (r
) = ctx
;
12376 /* Clear out the mangled name and RTL for the instantiation. */
12377 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
12378 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12379 SET_DECL_RTL (r
, NULL
);
12380 /* The initializer must not be expanded until it is required;
12381 see [temp.inst]. */
12382 DECL_INITIAL (r
) = NULL_TREE
;
12383 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
12384 SET_DECL_RTL (r
, NULL
);
12385 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
12388 /* Possibly limit visibility based on template args. */
12389 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
12390 if (DECL_VISIBILITY_SPECIFIED (t
))
12392 DECL_VISIBILITY_SPECIFIED (r
) = 0;
12393 DECL_ATTRIBUTES (r
)
12394 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
12396 determine_visibility (r
);
12401 /* A static data member declaration is always marked
12402 external when it is declared in-class, even if an
12403 initializer is present. We mimic the non-template
12404 processing here. */
12405 DECL_EXTERNAL (r
) = 1;
12406 if (DECL_NAMESPACE_SCOPE_P (t
))
12407 DECL_NOT_REALLY_EXTERN (r
) = 1;
12409 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
12410 SET_DECL_IMPLICIT_INSTANTIATION (r
);
12411 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
12415 if (DECL_LANG_SPECIFIC (r
))
12416 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
12417 if (!cp_unevaluated_operand
)
12418 register_local_specialization (r
, t
);
12421 DECL_CHAIN (r
) = NULL_TREE
;
12423 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
12425 args
, complain
, in_decl
);
12427 /* Preserve a typedef that names a type. */
12428 if (is_typedef_decl (r
))
12430 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
12431 set_underlying_type (r
);
12432 if (TYPE_DECL_ALIAS_P (r
) && type
!= error_mark_node
)
12433 /* An alias template specialization can be dependent
12434 even if its underlying type is not. */
12435 TYPE_DEPENDENT_P_VALID (TREE_TYPE (r
)) = false;
12438 layout_decl (r
, 0);
12443 gcc_unreachable ();
12448 /* Restore the file and line information. */
12449 input_location
= saved_loc
;
12454 /* Substitute into the ARG_TYPES of a function type.
12455 If END is a TREE_CHAIN, leave it and any following types
12459 tsubst_arg_types (tree arg_types
,
12462 tsubst_flags_t complain
,
12465 tree remaining_arg_types
;
12466 tree type
= NULL_TREE
;
12468 tree expanded_args
= NULL_TREE
;
12471 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
12474 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
12475 args
, end
, complain
, in_decl
);
12476 if (remaining_arg_types
== error_mark_node
)
12477 return error_mark_node
;
12479 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
12481 /* For a pack expansion, perform substitution on the
12482 entire expression. Later on, we'll handle the arguments
12484 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
12485 args
, complain
, in_decl
);
12487 if (TREE_CODE (expanded_args
) == TREE_VEC
)
12488 /* So that we'll spin through the parameters, one by one. */
12489 i
= TREE_VEC_LENGTH (expanded_args
);
12492 /* We only partially substituted into the parameter
12493 pack. Our type is TYPE_PACK_EXPANSION. */
12494 type
= expanded_args
;
12495 expanded_args
= NULL_TREE
;
12503 type
= TREE_VEC_ELT (expanded_args
, i
);
12505 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
12507 if (type
== error_mark_node
)
12508 return error_mark_node
;
12509 if (VOID_TYPE_P (type
))
12511 if (complain
& tf_error
)
12513 error ("invalid parameter type %qT", type
);
12515 error ("in declaration %q+D", in_decl
);
12517 return error_mark_node
;
12520 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
12521 return error_mark_node
;
12523 /* Do array-to-pointer, function-to-pointer conversion, and ignore
12524 top-level qualifiers as required. */
12525 type
= cv_unqualified (type_decays_to (type
));
12527 /* We do not substitute into default arguments here. The standard
12528 mandates that they be instantiated only when needed, which is
12529 done in build_over_call. */
12530 default_arg
= TREE_PURPOSE (arg_types
);
12532 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
12534 /* We've instantiated a template before its default arguments
12535 have been parsed. This can happen for a nested template
12536 class, and is not an error unless we require the default
12537 argument in a call of this function. */
12538 remaining_arg_types
=
12539 tree_cons (default_arg
, type
, remaining_arg_types
);
12540 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
12543 remaining_arg_types
=
12544 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
12547 return remaining_arg_types
;
12550 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
12551 *not* handle the exception-specification for FNTYPE, because the
12552 initial substitution of explicitly provided template parameters
12553 during argument deduction forbids substitution into the
12554 exception-specification:
12558 All references in the function type of the function template to the
12559 corresponding template parameters are replaced by the specified tem-
12560 plate argument values. If a substitution in a template parameter or
12561 in the function type of the function template results in an invalid
12562 type, type deduction fails. [Note: The equivalent substitution in
12563 exception specifications is done only when the function is instanti-
12564 ated, at which point a program is ill-formed if the substitution
12565 results in an invalid type.] */
12568 tsubst_function_type (tree t
,
12570 tsubst_flags_t complain
,
12574 tree arg_types
= NULL_TREE
;
12577 /* The TYPE_CONTEXT is not used for function/method types. */
12578 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
12580 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
12582 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
12584 if (late_return_type_p
)
12586 /* Substitute the argument types. */
12587 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12588 complain
, in_decl
);
12589 if (arg_types
== error_mark_node
)
12590 return error_mark_node
;
12592 tree save_ccp
= current_class_ptr
;
12593 tree save_ccr
= current_class_ref
;
12594 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
12595 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
12596 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
12599 /* DR 1207: 'this' is in scope in the trailing return type. */
12600 inject_this_parameter (this_type
, cp_type_quals (this_type
));
12603 /* Substitute the return type. */
12604 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12608 current_class_ptr
= save_ccp
;
12609 current_class_ref
= save_ccr
;
12613 /* Substitute the return type. */
12614 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12616 if (return_type
== error_mark_node
)
12617 return error_mark_node
;
12618 /* DR 486 clarifies that creation of a function type with an
12619 invalid return type is a deduction failure. */
12620 if (TREE_CODE (return_type
) == ARRAY_TYPE
12621 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
12623 if (complain
& tf_error
)
12625 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
12626 error ("function returning an array");
12628 error ("function returning a function");
12630 return error_mark_node
;
12633 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
12634 return error_mark_node
;
12636 if (!late_return_type_p
)
12638 /* Substitute the argument types. */
12639 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
12640 complain
, in_decl
);
12641 if (arg_types
== error_mark_node
)
12642 return error_mark_node
;
12645 /* Construct a new type node and return it. */
12646 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12648 fntype
= build_function_type (return_type
, arg_types
);
12649 fntype
= apply_memfn_quals (fntype
,
12650 type_memfn_quals (t
),
12651 type_memfn_rqual (t
));
12655 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
12656 /* Don't pick up extra function qualifiers from the basetype. */
12657 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
12658 if (! MAYBE_CLASS_TYPE_P (r
))
12662 Type deduction may fail for any of the following
12665 -- Attempting to create "pointer to member of T" when T
12666 is not a class type. */
12667 if (complain
& tf_error
)
12668 error ("creating pointer to member function of non-class type %qT",
12670 return error_mark_node
;
12673 fntype
= build_method_type_directly (r
, return_type
,
12674 TREE_CHAIN (arg_types
));
12675 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
12677 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
12679 if (late_return_type_p
)
12680 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
12685 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
12686 ARGS into that specification, and return the substituted
12687 specification. If there is no specification, return NULL_TREE. */
12690 tsubst_exception_specification (tree fntype
,
12692 tsubst_flags_t complain
,
12699 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
12700 new_specs
= NULL_TREE
;
12701 if (specs
&& TREE_PURPOSE (specs
))
12703 /* A noexcept-specifier. */
12704 tree expr
= TREE_PURPOSE (specs
);
12705 if (TREE_CODE (expr
) == INTEGER_CST
)
12709 /* Defer instantiation of noexcept-specifiers to avoid
12710 excessive instantiations (c++/49107). */
12711 new_specs
= make_node (DEFERRED_NOEXCEPT
);
12712 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
12714 /* We already partially instantiated this member template,
12715 so combine the new args with the old. */
12716 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
12717 = DEFERRED_NOEXCEPT_PATTERN (expr
);
12718 DEFERRED_NOEXCEPT_ARGS (new_specs
)
12719 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
12723 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
12724 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
12728 new_specs
= tsubst_copy_and_build
12729 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
12730 /*integral_constant_expression_p=*/true);
12731 new_specs
= build_noexcept_spec (new_specs
, complain
);
12735 if (! TREE_VALUE (specs
))
12742 tree expanded_specs
= NULL_TREE
;
12744 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
12746 /* Expand the pack expansion type. */
12747 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
12751 if (expanded_specs
== error_mark_node
)
12752 return error_mark_node
;
12753 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
12754 len
= TREE_VEC_LENGTH (expanded_specs
);
12757 /* We're substituting into a member template, so
12758 we got a TYPE_PACK_EXPANSION back. Add that
12759 expansion and move on. */
12760 gcc_assert (TREE_CODE (expanded_specs
)
12761 == TYPE_PACK_EXPANSION
);
12762 new_specs
= add_exception_specifier (new_specs
,
12765 specs
= TREE_CHAIN (specs
);
12770 for (i
= 0; i
< len
; ++i
)
12772 if (expanded_specs
)
12773 spec
= TREE_VEC_ELT (expanded_specs
, i
);
12775 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
12776 if (spec
== error_mark_node
)
12778 new_specs
= add_exception_specifier (new_specs
, spec
,
12782 specs
= TREE_CHAIN (specs
);
12788 /* Take the tree structure T and replace template parameters used
12789 therein with the argument vector ARGS. IN_DECL is an associated
12790 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
12791 Issue error and warning messages under control of COMPLAIN. Note
12792 that we must be relatively non-tolerant of extensions here, in
12793 order to preserve conformance; if we allow substitutions that
12794 should not be allowed, we may allow argument deductions that should
12795 not succeed, and therefore report ambiguous overload situations
12796 where there are none. In theory, we could allow the substitution,
12797 but indicate that it should have failed, and allow our caller to
12798 make sure that the right thing happens, but we don't try to do this
12801 This function is used for dealing with types, decls and the like;
12802 for expressions, use tsubst_expr or tsubst_copy. */
12805 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12807 enum tree_code code
;
12808 tree type
, r
= NULL_TREE
;
12810 if (t
== NULL_TREE
|| t
== error_mark_node
12811 || t
== integer_type_node
12812 || t
== void_type_node
12813 || t
== char_type_node
12814 || t
== unknown_type_node
12815 || TREE_CODE (t
) == NAMESPACE_DECL
12816 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
12820 return tsubst_decl (t
, args
, complain
);
12822 if (args
== NULL_TREE
)
12825 code
= TREE_CODE (t
);
12827 if (code
== IDENTIFIER_NODE
)
12828 type
= IDENTIFIER_TYPE_VALUE (t
);
12830 type
= TREE_TYPE (t
);
12832 gcc_assert (type
!= unknown_type_node
);
12834 /* Reuse typedefs. We need to do this to handle dependent attributes,
12835 such as attribute aligned. */
12837 && typedef_variant_p (t
))
12839 tree decl
= TYPE_NAME (t
);
12841 if (alias_template_specialization_p (t
))
12843 /* DECL represents an alias template and we want to
12845 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12846 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12847 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
12849 else if (DECL_CLASS_SCOPE_P (decl
)
12850 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12851 && uses_template_parms (DECL_CONTEXT (decl
)))
12853 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
12854 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
12855 r
= retrieve_specialization (tmpl
, gen_args
, 0);
12857 else if (DECL_FUNCTION_SCOPE_P (decl
)
12858 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
12859 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
12860 r
= retrieve_local_specialization (decl
);
12862 /* The typedef is from a non-template context. */
12868 r
= cp_build_qualified_type_real
12869 (r
, cp_type_quals (t
) | cp_type_quals (r
),
12870 complain
| tf_ignore_bad_quals
);
12875 /* We don't have an instantiation yet, so drop the typedef. */
12876 int quals
= cp_type_quals (t
);
12877 t
= DECL_ORIGINAL_TYPE (decl
);
12878 t
= cp_build_qualified_type_real (t
, quals
,
12879 complain
| tf_ignore_bad_quals
);
12884 && code
!= TYPENAME_TYPE
12885 && code
!= TEMPLATE_TYPE_PARM
12886 && code
!= IDENTIFIER_NODE
12887 && code
!= FUNCTION_TYPE
12888 && code
!= METHOD_TYPE
)
12889 type
= tsubst (type
, args
, complain
, in_decl
);
12890 if (type
== error_mark_node
)
12891 return error_mark_node
;
12897 case ENUMERAL_TYPE
:
12898 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
12899 /*entering_scope=*/0);
12902 case IDENTIFIER_NODE
:
12913 if (t
== integer_type_node
)
12916 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12917 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12921 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12923 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12924 /*integral_constant_expression_p=*/false);
12926 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12928 if (TREE_CODE (max
) == NOP_EXPR
12929 && TREE_SIDE_EFFECTS (omax
)
12930 && !TREE_TYPE (max
))
12931 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12933 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12934 with TREE_SIDE_EFFECTS that indicates this is not an integral
12935 constant expression. */
12936 if (processing_template_decl
12937 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12939 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12940 TREE_SIDE_EFFECTS (max
) = 1;
12943 return compute_array_index_type (NULL_TREE
, max
, complain
);
12946 case TEMPLATE_TYPE_PARM
:
12947 case TEMPLATE_TEMPLATE_PARM
:
12948 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12949 case TEMPLATE_PARM_INDEX
:
12954 tree arg
= NULL_TREE
;
12956 /* Early in template argument deduction substitution, we don't
12957 want to reduce the level of 'auto', or it will be confused
12958 with a normal template parm in subsequent deduction. */
12959 if (is_auto (t
) && (complain
& tf_partial
))
12964 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12965 template_parm_level_and_index (t
, &level
, &idx
);
12967 levels
= TMPL_ARGS_DEPTH (args
);
12968 if (level
<= levels
12969 && TREE_VEC_LENGTH (TMPL_ARGS_LEVEL (args
, level
)) > 0)
12971 arg
= TMPL_ARG (args
, level
, idx
);
12973 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12975 /* See through ARGUMENT_PACK_SELECT arguments. */
12976 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12977 /* If the selected argument is an expansion E, that most
12978 likely means we were called from
12979 gen_elem_of_pack_expansion_instantiation during the
12980 substituting of pack an argument pack (which Ith
12981 element is a pack expansion, where I is
12982 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12983 In this case, the Ith element resulting from this
12984 substituting is going to be a pack expansion, which
12985 pattern is the pattern of E. Let's return the
12987 gen_elem_of_pack_expansion_instantiation will
12988 build the resulting pack expansion from it. */
12989 if (PACK_EXPANSION_P (arg
))
12991 /* Make sure we aren't throwing away arg info. */
12992 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12993 arg
= PACK_EXPANSION_PATTERN (arg
);
12998 if (arg
== error_mark_node
)
12999 return error_mark_node
;
13000 else if (arg
!= NULL_TREE
)
13002 if (ARGUMENT_PACK_P (arg
))
13003 /* If ARG is an argument pack, we don't actually want to
13004 perform a substitution here, because substitutions
13005 for argument packs are only done
13006 element-by-element. We can get to this point when
13007 substituting the type of a non-type template
13008 parameter pack, when that type actually contains
13009 template parameter packs from an outer template, e.g.,
13011 template<typename... Types> struct A {
13012 template<Types... Values> struct B { };
13016 if (code
== TEMPLATE_TYPE_PARM
)
13019 gcc_assert (TYPE_P (arg
));
13021 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
13023 return cp_build_qualified_type_real
13024 (arg
, quals
, complain
| tf_ignore_bad_quals
);
13026 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13028 /* We are processing a type constructed from a
13029 template template parameter. */
13030 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
13031 args
, complain
, in_decl
);
13032 if (argvec
== error_mark_node
)
13033 return error_mark_node
;
13035 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
13036 || TREE_CODE (arg
) == TEMPLATE_DECL
13037 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
13039 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
13040 /* Consider this code:
13042 template <template <class> class Template>
13044 template <class Arg> using Bind = Template<Arg>;
13047 template <template <class> class Template, class Arg>
13048 using Instantiate = Template<Arg>; //#0
13050 template <template <class> class Template,
13053 Instantiate<Internal<Template>::template Bind,
13056 When #1 is parsed, the
13057 BOUND_TEMPLATE_TEMPLATE_PARM representing the
13058 parameter `Template' in #0 matches the
13059 UNBOUND_CLASS_TEMPLATE representing the argument
13060 `Internal<Template>::template Bind'; We then want
13061 to assemble the type `Bind<Argument>' that can't
13062 be fully created right now, because
13063 `Internal<Template>' not being complete, the Bind
13064 template cannot be looked up in that context. So
13065 we need to "store" `Bind<Argument>' for later
13066 when the context of Bind becomes complete. Let's
13067 store that in a TYPENAME_TYPE. */
13068 return make_typename_type (TYPE_CONTEXT (arg
),
13069 build_nt (TEMPLATE_ID_EXPR
,
13070 TYPE_IDENTIFIER (arg
),
13075 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
13076 are resolving nested-types in the signature of a
13077 member function templates. Otherwise ARG is a
13078 TEMPLATE_DECL and is the real template to be
13080 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
13081 arg
= TYPE_NAME (arg
);
13083 r
= lookup_template_class (arg
,
13085 DECL_CONTEXT (arg
),
13086 /*entering_scope=*/0,
13088 return cp_build_qualified_type_real
13089 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
13092 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
13093 return convert_from_reference (unshare_expr (arg
));
13097 /* This can happen during the attempted tsubst'ing in
13098 unify. This means that we don't yet have any information
13099 about the template parameter in question. */
13102 /* If we get here, we must have been looking at a parm for a
13103 more deeply nested template. Make a new version of this
13104 template parameter, but with a lower level. */
13107 case TEMPLATE_TYPE_PARM
:
13108 case TEMPLATE_TEMPLATE_PARM
:
13109 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13110 if (cp_type_quals (t
))
13112 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
13113 r
= cp_build_qualified_type_real
13114 (r
, cp_type_quals (t
),
13115 complain
| (code
== TEMPLATE_TYPE_PARM
13116 ? tf_ignore_bad_quals
: 0));
13118 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
13119 && PLACEHOLDER_TYPE_CONSTRAINTS (t
)
13120 && (r
= (TEMPLATE_PARM_DESCENDANTS
13121 (TEMPLATE_TYPE_PARM_INDEX (t
))))
13122 && (r
= TREE_TYPE (r
))
13123 && !PLACEHOLDER_TYPE_CONSTRAINTS (r
))
13124 /* Break infinite recursion when substituting the constraints
13125 of a constrained placeholder. */;
13129 TEMPLATE_TYPE_PARM_INDEX (r
)
13130 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
13131 r
, levels
, args
, complain
);
13132 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
13133 TYPE_MAIN_VARIANT (r
) = r
;
13134 TYPE_POINTER_TO (r
) = NULL_TREE
;
13135 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
13137 /* Propagate constraints on placeholders. */
13138 if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
13139 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
13140 PLACEHOLDER_TYPE_CONSTRAINTS (r
)
13141 = tsubst_constraint (constr
, args
, complain
, in_decl
);
13143 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
13144 /* We have reduced the level of the template
13145 template parameter, but not the levels of its
13146 template parameters, so canonical_type_parameter
13147 will not be able to find the canonical template
13148 template parameter for this level. Thus, we
13149 require structural equality checking to compare
13150 TEMPLATE_TEMPLATE_PARMs. */
13151 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13152 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
13153 SET_TYPE_STRUCTURAL_EQUALITY (r
);
13155 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
13157 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
13159 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
13160 complain
, in_decl
);
13161 if (argvec
== error_mark_node
)
13162 return error_mark_node
;
13164 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
13165 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
13170 case TEMPLATE_PARM_INDEX
:
13171 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
13175 gcc_unreachable ();
13183 tree purpose
, value
, chain
;
13185 if (t
== void_list_node
)
13188 purpose
= TREE_PURPOSE (t
);
13191 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
13192 if (purpose
== error_mark_node
)
13193 return error_mark_node
;
13195 value
= TREE_VALUE (t
);
13198 value
= tsubst (value
, args
, complain
, in_decl
);
13199 if (value
== error_mark_node
)
13200 return error_mark_node
;
13202 chain
= TREE_CHAIN (t
);
13203 if (chain
&& chain
!= void_type_node
)
13205 chain
= tsubst (chain
, args
, complain
, in_decl
);
13206 if (chain
== error_mark_node
)
13207 return error_mark_node
;
13209 if (purpose
== TREE_PURPOSE (t
)
13210 && value
== TREE_VALUE (t
)
13211 && chain
== TREE_CHAIN (t
))
13213 return hash_tree_cons (purpose
, value
, chain
);
13217 /* We should never be tsubsting a binfo. */
13218 gcc_unreachable ();
13221 /* A vector of template arguments. */
13222 gcc_assert (!type
);
13223 return tsubst_template_args (t
, args
, complain
, in_decl
);
13226 case REFERENCE_TYPE
:
13228 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
13233 Type deduction may fail for any of the following
13236 -- Attempting to create a pointer to reference type.
13237 -- Attempting to create a reference to a reference type or
13238 a reference to void.
13240 Core issue 106 says that creating a reference to a reference
13241 during instantiation is no longer a cause for failure. We
13242 only enforce this check in strict C++98 mode. */
13243 if ((TREE_CODE (type
) == REFERENCE_TYPE
13244 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
13245 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
13247 static location_t last_loc
;
13249 /* We keep track of the last time we issued this error
13250 message to avoid spewing a ton of messages during a
13251 single bad template instantiation. */
13252 if (complain
& tf_error
13253 && last_loc
!= input_location
)
13255 if (VOID_TYPE_P (type
))
13256 error ("forming reference to void");
13257 else if (code
== POINTER_TYPE
)
13258 error ("forming pointer to reference type %qT", type
);
13260 error ("forming reference to reference type %qT", type
);
13261 last_loc
= input_location
;
13264 return error_mark_node
;
13266 else if (TREE_CODE (type
) == FUNCTION_TYPE
13267 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
13268 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
13270 if (complain
& tf_error
)
13272 if (code
== POINTER_TYPE
)
13273 error ("forming pointer to qualified function type %qT",
13276 error ("forming reference to qualified function type %qT",
13279 return error_mark_node
;
13281 else if (code
== POINTER_TYPE
)
13283 r
= build_pointer_type (type
);
13284 if (TREE_CODE (type
) == METHOD_TYPE
)
13285 r
= build_ptrmemfunc_type (r
);
13287 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
13288 /* In C++0x, during template argument substitution, when there is an
13289 attempt to create a reference to a reference type, reference
13290 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
13292 "If a template-argument for a template-parameter T names a type
13293 that is a reference to a type A, an attempt to create the type
13294 'lvalue reference to cv T' creates the type 'lvalue reference to
13295 A,' while an attempt to create the type type rvalue reference to
13296 cv T' creates the type T"
13298 r
= cp_build_reference_type
13300 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
13302 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
13303 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
13305 if (r
!= error_mark_node
)
13306 /* Will this ever be needed for TYPE_..._TO values? */
13313 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
13314 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
13318 Type deduction may fail for any of the following
13321 -- Attempting to create "pointer to member of T" when T
13322 is not a class type. */
13323 if (complain
& tf_error
)
13324 error ("creating pointer to member of non-class type %qT", r
);
13325 return error_mark_node
;
13327 if (TREE_CODE (type
) == REFERENCE_TYPE
)
13329 if (complain
& tf_error
)
13330 error ("creating pointer to member reference type %qT", type
);
13331 return error_mark_node
;
13333 if (VOID_TYPE_P (type
))
13335 if (complain
& tf_error
)
13336 error ("creating pointer to member of type void");
13337 return error_mark_node
;
13339 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
13340 if (TREE_CODE (type
) == FUNCTION_TYPE
)
13342 /* The type of the implicit object parameter gets its
13343 cv-qualifiers from the FUNCTION_TYPE. */
13346 = build_memfn_type (type
, r
, type_memfn_quals (type
),
13347 type_memfn_rqual (type
));
13348 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
13349 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
13353 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
13357 case FUNCTION_TYPE
:
13362 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
13363 if (fntype
== error_mark_node
)
13364 return error_mark_node
;
13366 /* Substitute the exception specification. */
13367 specs
= tsubst_exception_specification (t
, args
, complain
,
13368 in_decl
, /*defer_ok*/true);
13369 if (specs
== error_mark_node
)
13370 return error_mark_node
;
13372 fntype
= build_exception_variant (fntype
, specs
);
13377 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
13378 if (domain
== error_mark_node
)
13379 return error_mark_node
;
13381 /* As an optimization, we avoid regenerating the array type if
13382 it will obviously be the same as T. */
13383 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
13386 /* These checks should match the ones in create_array_type_for_decl.
13390 The deduction may fail for any of the following reasons:
13392 -- Attempting to create an array with an element type that
13393 is void, a function type, or a reference type, or [DR337]
13394 an abstract class type. */
13395 if (VOID_TYPE_P (type
)
13396 || TREE_CODE (type
) == FUNCTION_TYPE
13397 || (TREE_CODE (type
) == ARRAY_TYPE
13398 && TYPE_DOMAIN (type
) == NULL_TREE
)
13399 || TREE_CODE (type
) == REFERENCE_TYPE
)
13401 if (complain
& tf_error
)
13402 error ("creating array of %qT", type
);
13403 return error_mark_node
;
13406 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
13407 return error_mark_node
;
13409 r
= build_cplus_array_type (type
, domain
);
13411 if (TYPE_USER_ALIGN (t
))
13413 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
13414 TYPE_USER_ALIGN (r
) = 1;
13420 case TYPENAME_TYPE
:
13422 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13423 in_decl
, /*entering_scope=*/1);
13424 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
13425 complain
, in_decl
);
13427 if (ctx
== error_mark_node
|| f
== error_mark_node
)
13428 return error_mark_node
;
13430 if (!MAYBE_CLASS_TYPE_P (ctx
))
13432 if (complain
& tf_error
)
13433 error ("%qT is not a class, struct, or union type", ctx
);
13434 return error_mark_node
;
13436 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
13438 /* Normally, make_typename_type does not require that the CTX
13439 have complete type in order to allow things like:
13441 template <class T> struct S { typename S<T>::X Y; };
13443 But, such constructs have already been resolved by this
13444 point, so here CTX really should have complete type, unless
13445 it's a partial instantiation. */
13446 ctx
= complete_type (ctx
);
13447 if (!COMPLETE_TYPE_P (ctx
))
13449 if (complain
& tf_error
)
13450 cxx_incomplete_type_error (NULL_TREE
, ctx
);
13451 return error_mark_node
;
13455 f
= make_typename_type (ctx
, f
, typename_type
,
13456 complain
| tf_keep_type_decl
);
13457 if (f
== error_mark_node
)
13459 if (TREE_CODE (f
) == TYPE_DECL
)
13461 complain
|= tf_ignore_bad_quals
;
13465 if (TREE_CODE (f
) != TYPENAME_TYPE
)
13467 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
13469 if (complain
& tf_error
)
13470 error ("%qT resolves to %qT, which is not an enumeration type",
13473 return error_mark_node
;
13475 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
13477 if (complain
& tf_error
)
13478 error ("%qT resolves to %qT, which is is not a class type",
13481 return error_mark_node
;
13485 return cp_build_qualified_type_real
13486 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
13489 case UNBOUND_CLASS_TEMPLATE
:
13491 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
13492 in_decl
, /*entering_scope=*/1);
13493 tree name
= TYPE_IDENTIFIER (t
);
13494 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
13496 if (ctx
== error_mark_node
|| name
== error_mark_node
)
13497 return error_mark_node
;
13500 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
13501 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
13508 ++cp_unevaluated_operand
;
13509 ++c_inhibit_evaluation_warnings
;
13511 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
13513 /*integral_constant_expression_p=*/false);
13515 --cp_unevaluated_operand
;
13516 --c_inhibit_evaluation_warnings
;
13518 type
= finish_typeof (type
);
13519 return cp_build_qualified_type_real (type
,
13521 | cp_type_quals (type
),
13525 case DECLTYPE_TYPE
:
13529 ++cp_unevaluated_operand
;
13530 ++c_inhibit_evaluation_warnings
;
13532 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
13533 complain
|tf_decltype
, in_decl
,
13534 /*function_p*/false,
13535 /*integral_constant_expression*/false);
13537 --cp_unevaluated_operand
;
13538 --c_inhibit_evaluation_warnings
;
13540 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
13541 type
= lambda_capture_field_type (type
,
13542 DECLTYPE_FOR_INIT_CAPTURE (t
));
13543 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
13544 type
= lambda_proxy_type (type
);
13547 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
13548 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
13550 /* In a template ~id could be either a complement expression
13551 or an unqualified-id naming a destructor; if instantiating
13552 it produces an expression, it's not an id-expression or
13555 type
= finish_decltype_type (type
, id
, complain
);
13557 return cp_build_qualified_type_real (type
,
13559 | cp_type_quals (type
),
13560 complain
| tf_ignore_bad_quals
);
13563 case UNDERLYING_TYPE
:
13565 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
13566 complain
, in_decl
);
13567 return finish_underlying_type (type
);
13570 case TYPE_ARGUMENT_PACK
:
13571 case NONTYPE_ARGUMENT_PACK
:
13573 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
13575 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
13579 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
13581 /* For template nontype argument packs, also substitute into
13583 if (code
== NONTYPE_ARGUMENT_PACK
)
13584 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13603 /* We should use one of the expression tsubsts for these codes. */
13604 gcc_unreachable ();
13607 sorry ("use of %qs in template", get_tree_code_name (code
));
13608 return error_mark_node
;
13612 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
13613 type of the expression on the left-hand side of the "." or "->"
13617 tsubst_baselink (tree baselink
, tree object_type
,
13618 tree args
, tsubst_flags_t complain
, tree in_decl
)
13621 tree qualifying_scope
;
13624 tree template_args
= 0;
13625 bool template_id_p
= false;
13626 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
13628 /* A baselink indicates a function from a base class. Both the
13629 BASELINK_ACCESS_BINFO and the base class referenced may
13630 indicate bases of the template class, rather than the
13631 instantiated class. In addition, lookups that were not
13632 ambiguous before may be ambiguous now. Therefore, we perform
13633 the lookup again. */
13634 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
13635 qualifying_scope
= tsubst (qualifying_scope
, args
,
13636 complain
, in_decl
);
13637 fns
= BASELINK_FUNCTIONS (baselink
);
13638 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
13639 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
13641 template_id_p
= true;
13642 template_args
= TREE_OPERAND (fns
, 1);
13643 fns
= TREE_OPERAND (fns
, 0);
13645 template_args
= tsubst_template_args (template_args
, args
,
13646 complain
, in_decl
);
13648 name
= DECL_NAME (get_first_fn (fns
));
13649 if (IDENTIFIER_TYPENAME_P (name
))
13650 name
= mangle_conv_op_name_for_type (optype
);
13651 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
13654 if (constructor_name_p (name
, qualifying_scope
))
13656 if (complain
& tf_error
)
13657 error ("cannot call constructor %<%T::%D%> directly",
13658 qualifying_scope
, name
);
13660 return error_mark_node
;
13663 /* If lookup found a single function, mark it as used at this
13664 point. (If it lookup found multiple functions the one selected
13665 later by overload resolution will be marked as used at that
13667 if (BASELINK_P (baselink
))
13668 fns
= BASELINK_FUNCTIONS (baselink
);
13669 if (!template_id_p
&& !really_overloaded_fn (fns
)
13670 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
13671 return error_mark_node
;
13673 /* Add back the template arguments, if present. */
13674 if (BASELINK_P (baselink
) && template_id_p
)
13675 BASELINK_FUNCTIONS (baselink
)
13676 = build_nt (TEMPLATE_ID_EXPR
,
13677 BASELINK_FUNCTIONS (baselink
),
13679 /* Update the conversion operator type. */
13680 BASELINK_OPTYPE (baselink
) = optype
;
13683 object_type
= current_class_type
;
13686 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
13692 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
13693 true if the qualified-id will be a postfix-expression in-and-of
13694 itself; false if more of the postfix-expression follows the
13695 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
13699 tsubst_qualified_id (tree qualified_id
, tree args
,
13700 tsubst_flags_t complain
, tree in_decl
,
13701 bool done
, bool address_p
)
13707 tree template_args
;
13708 location_t loc
= UNKNOWN_LOCATION
;
13710 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
13712 /* Figure out what name to look up. */
13713 name
= TREE_OPERAND (qualified_id
, 1);
13714 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
13716 is_template
= true;
13717 loc
= EXPR_LOCATION (name
);
13718 template_args
= TREE_OPERAND (name
, 1);
13720 template_args
= tsubst_template_args (template_args
, args
,
13721 complain
, in_decl
);
13722 name
= TREE_OPERAND (name
, 0);
13726 is_template
= false;
13727 template_args
= NULL_TREE
;
13730 /* Substitute into the qualifying scope. When there are no ARGS, we
13731 are just trying to simplify a non-dependent expression. In that
13732 case the qualifying scope may be dependent, and, in any case,
13733 substituting will not help. */
13734 scope
= TREE_OPERAND (qualified_id
, 0);
13737 scope
= tsubst (scope
, args
, complain
, in_decl
);
13738 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
13743 if (dependent_scope_p (scope
))
13746 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
13747 return build_qualified_name (NULL_TREE
, scope
, expr
,
13748 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
13751 if (!BASELINK_P (name
) && !DECL_P (expr
))
13753 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
13755 /* A BIT_NOT_EXPR is used to represent a destructor. */
13756 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
13758 error ("qualifying type %qT does not match destructor name ~%qT",
13759 scope
, TREE_OPERAND (expr
, 0));
13760 expr
= error_mark_node
;
13763 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
13764 /*is_type_p=*/0, false);
13767 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
13768 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
13769 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
13771 if (complain
& tf_error
)
13773 error ("dependent-name %qE is parsed as a non-type, but "
13774 "instantiation yields a type", qualified_id
);
13775 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
13777 return error_mark_node
;
13783 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
13785 /* Remember that there was a reference to this entity. */
13786 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
13787 return error_mark_node
;
13790 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
13792 if (complain
& tf_error
)
13793 qualified_name_lookup_error (scope
,
13794 TREE_OPERAND (qualified_id
, 1),
13795 expr
, input_location
);
13796 return error_mark_node
;
13801 if (variable_template_p (expr
))
13802 expr
= lookup_and_finish_template_variable (expr
, template_args
,
13805 expr
= lookup_template_function (expr
, template_args
);
13808 if (expr
== error_mark_node
&& complain
& tf_error
)
13809 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
13810 expr
, input_location
);
13811 else if (TYPE_P (scope
))
13813 expr
= (adjust_result_of_qualified_name_lookup
13814 (expr
, scope
, current_nonlambda_class_type ()));
13815 expr
= (finish_qualified_id_expr
13816 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
13817 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
13818 /*template_arg_p=*/false, complain
));
13821 /* Expressions do not generally have reference type. */
13822 if (TREE_CODE (expr
) != SCOPE_REF
13823 /* However, if we're about to form a pointer-to-member, we just
13824 want the referenced member referenced. */
13825 && TREE_CODE (expr
) != OFFSET_REF
)
13826 expr
= convert_from_reference (expr
);
13831 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
13832 initializer, DECL is the substituted VAR_DECL. Other arguments are as
13836 tsubst_init (tree init
, tree decl
, tree args
,
13837 tsubst_flags_t complain
, tree in_decl
)
13842 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
13846 /* If we had an initializer but it
13847 instantiated to nothing,
13848 value-initialize the object. This will
13849 only occur when the initializer was a
13850 pack expansion where the parameter packs
13851 used in that expansion were of length
13853 init
= build_value_init (TREE_TYPE (decl
),
13855 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13856 init
= get_target_expr_sfinae (init
, complain
);
13862 /* Like tsubst, but deals with expressions. This function just replaces
13863 template parms; to finish processing the resultant expression, use
13864 tsubst_copy_and_build or tsubst_expr. */
13867 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
13869 enum tree_code code
;
13872 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
13875 code
= TREE_CODE (t
);
13880 r
= retrieve_local_specialization (t
);
13882 if (r
== NULL_TREE
)
13884 /* We get here for a use of 'this' in an NSDMI. */
13885 if (DECL_NAME (t
) == this_identifier
13886 && current_function_decl
13887 && DECL_CONSTRUCTOR_P (current_function_decl
))
13888 return current_class_ptr
;
13890 /* This can happen for a parameter name used later in a function
13891 declaration (such as in a late-specified return type). Just
13892 make a dummy decl, since it's only used for its type. */
13893 gcc_assert (cp_unevaluated_operand
!= 0);
13894 r
= tsubst_decl (t
, args
, complain
);
13895 /* Give it the template pattern as its context; its true context
13896 hasn't been instantiated yet and this is good enough for
13898 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
13901 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13902 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13903 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13904 return error_mark_node
;
13912 if (DECL_TEMPLATE_PARM_P (t
))
13913 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
13914 /* There is no need to substitute into namespace-scope
13916 if (DECL_NAMESPACE_SCOPE_P (t
))
13918 /* If ARGS is NULL, then T is known to be non-dependent. */
13919 if (args
== NULL_TREE
)
13920 return scalar_constant_value (t
);
13922 /* Unfortunately, we cannot just call lookup_name here.
13925 template <int I> int f() {
13927 struct S { void g() { E e = a; } };
13930 When we instantiate f<7>::S::g(), say, lookup_name is not
13931 clever enough to find f<7>::a. */
13933 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13934 /*entering_scope=*/0);
13936 for (v
= TYPE_VALUES (enum_type
);
13938 v
= TREE_CHAIN (v
))
13939 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13940 return TREE_VALUE (v
);
13942 /* We didn't find the name. That should never happen; if
13943 name-lookup found it during preliminary parsing, we
13944 should find it again here during instantiation. */
13945 gcc_unreachable ();
13950 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13952 /* Check for a local specialization set up by
13953 tsubst_pack_expansion. */
13954 if (tree r
= retrieve_local_specialization (t
))
13956 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13957 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13961 /* When retrieving a capture pack from a generic lambda, remove the
13962 lambda call op's own template argument list from ARGS. Only the
13963 template arguments active for the closure type should be used to
13964 retrieve the pack specialization. */
13965 if (LAMBDA_FUNCTION_P (current_function_decl
)
13966 && (template_class_depth (DECL_CONTEXT (t
))
13967 != TMPL_ARGS_DEPTH (args
)))
13968 args
= strip_innermost_template_args (args
, 1);
13970 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13971 tsubst_decl put in the hash table. */
13972 return retrieve_specialization (t
, args
, 0);
13975 if (DECL_CONTEXT (t
))
13979 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13980 /*entering_scope=*/1);
13981 if (ctx
!= DECL_CONTEXT (t
))
13983 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13986 if (complain
& tf_error
)
13987 error ("using invalid field %qD", t
);
13988 return error_mark_node
;
13997 case FUNCTION_DECL
:
13998 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13999 r
= tsubst (t
, args
, complain
, in_decl
);
14000 else if (local_variable_p (t
))
14002 r
= retrieve_local_specialization (t
);
14003 if (r
== NULL_TREE
)
14005 /* First try name lookup to find the instantiation. */
14006 r
= lookup_name (DECL_NAME (t
));
14009 /* Make sure that the one we found is the one we want. */
14010 tree ctx
= DECL_CONTEXT (t
);
14011 if (DECL_LANG_SPECIFIC (ctx
) && DECL_TEMPLATE_INFO (ctx
))
14012 ctx
= tsubst (ctx
, args
, complain
, in_decl
);
14013 if (ctx
!= DECL_CONTEXT (r
))
14021 /* This can happen for a variable used in a
14022 late-specified return type of a local lambda, or for a
14023 local static or constant. Building a new VAR_DECL
14024 should be OK in all those cases. */
14025 r
= tsubst_decl (t
, args
, complain
);
14026 if (decl_maybe_constant_var_p (r
))
14028 /* We can't call cp_finish_decl, so handle the
14029 initializer by hand. */
14030 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
14031 complain
, in_decl
);
14032 if (!processing_template_decl
)
14033 init
= maybe_constant_init (init
);
14034 if (processing_template_decl
14035 ? potential_constant_expression (init
)
14036 : reduced_constant_expression_p (init
))
14037 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
14038 = TREE_CONSTANT (r
) = true;
14039 DECL_INITIAL (r
) = init
;
14041 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
14042 || decl_constant_var_p (r
)
14043 || errorcount
|| sorrycount
);
14044 if (!processing_template_decl
)
14046 if (TREE_STATIC (r
))
14047 rest_of_decl_compilation (r
, toplevel_bindings_p (),
14050 r
= process_outer_var_ref (r
, complain
);
14053 /* Remember this for subsequent uses. */
14054 if (local_specializations
)
14055 register_local_specialization (r
, t
);
14060 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
14061 return error_mark_node
;
14064 case NAMESPACE_DECL
:
14068 /* An OVERLOAD will always be a non-dependent overload set; an
14069 overload set from function scope will just be represented with an
14070 IDENTIFIER_NODE, and from class scope with a BASELINK. */
14071 gcc_assert (!uses_template_parms (t
));
14075 return tsubst_baselink (t
, current_nonlambda_class_type (),
14076 args
, complain
, in_decl
);
14078 case TEMPLATE_DECL
:
14079 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
14080 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
14081 args
, complain
, in_decl
);
14082 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
14083 return tsubst (t
, args
, complain
, in_decl
);
14084 else if (DECL_CLASS_SCOPE_P (t
)
14085 && uses_template_parms (DECL_CONTEXT (t
)))
14087 /* Template template argument like the following example need
14090 template <template <class> class TT> struct C {};
14091 template <class T> struct D {
14092 template <class U> struct E {};
14097 We are processing the template argument `E' in #1 for
14098 the template instantiation #2. Originally, `E' is a
14099 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
14100 have to substitute this with one having context `D<int>'. */
14102 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
14103 return lookup_field (context
, DECL_NAME(t
), 0, false);
14106 /* Ordinary template template argument. */
14110 case REINTERPRET_CAST_EXPR
:
14111 case CONST_CAST_EXPR
:
14112 case STATIC_CAST_EXPR
:
14113 case DYNAMIC_CAST_EXPR
:
14114 case IMPLICIT_CONV_EXPR
:
14118 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14119 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14120 return build1 (code
, type
, op0
);
14124 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
14125 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
14127 tree expanded
, op
= TREE_OPERAND (t
, 0);
14130 if (SIZEOF_EXPR_TYPE_P (t
))
14131 op
= TREE_TYPE (op
);
14133 ++cp_unevaluated_operand
;
14134 ++c_inhibit_evaluation_warnings
;
14135 /* We only want to compute the number of arguments. */
14136 if (PACK_EXPANSION_P (op
))
14137 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
14139 expanded
= tsubst_template_args (ARGUMENT_PACK_ARGS (op
),
14140 args
, complain
, in_decl
);
14141 --cp_unevaluated_operand
;
14142 --c_inhibit_evaluation_warnings
;
14144 if (TREE_CODE (expanded
) == TREE_VEC
)
14146 len
= TREE_VEC_LENGTH (expanded
);
14147 /* Set TREE_USED for the benefit of -Wunused. */
14148 for (int i
= 0; i
< len
; i
++)
14149 TREE_USED (TREE_VEC_ELT (expanded
, i
)) = true;
14152 if (expanded
== error_mark_node
)
14153 return error_mark_node
;
14154 else if (PACK_EXPANSION_P (expanded
)
14155 || (TREE_CODE (expanded
) == TREE_VEC
14156 && pack_expansion_args_count (expanded
)))
14159 if (PACK_EXPANSION_P (expanded
))
14161 else if (TREE_VEC_LENGTH (expanded
) == 1)
14162 expanded
= TREE_VEC_ELT (expanded
, 0);
14164 expanded
= make_argument_pack (expanded
);
14166 if (TYPE_P (expanded
))
14167 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
14168 complain
& tf_error
);
14170 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
14171 complain
& tf_error
);
14174 return build_int_cst (size_type_node
, len
);
14176 if (SIZEOF_EXPR_TYPE_P (t
))
14178 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
14179 args
, complain
, in_decl
);
14180 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
14181 r
= build1 (SIZEOF_EXPR
,
14182 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
14183 SIZEOF_EXPR_TYPE_P (r
) = 1;
14190 case TRUTH_NOT_EXPR
:
14193 case UNARY_PLUS_EXPR
: /* Unary + */
14195 case AT_ENCODE_EXPR
:
14199 case REALPART_EXPR
:
14200 case IMAGPART_EXPR
:
14203 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14204 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14205 return build1 (code
, type
, op0
);
14208 case COMPONENT_REF
:
14213 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14214 name
= TREE_OPERAND (t
, 1);
14215 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14217 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14218 complain
, in_decl
);
14219 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14221 else if (TREE_CODE (name
) == SCOPE_REF
14222 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
14224 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14225 complain
, in_decl
);
14226 name
= TREE_OPERAND (name
, 1);
14227 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
14228 complain
, in_decl
);
14229 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
14230 name
= build_qualified_name (/*type=*/NULL_TREE
,
14232 /*template_p=*/false);
14234 else if (BASELINK_P (name
))
14235 name
= tsubst_baselink (name
,
14236 non_reference (TREE_TYPE (object
)),
14240 name
= tsubst_copy (name
, args
, complain
, in_decl
);
14241 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
14247 case TRUNC_DIV_EXPR
:
14248 case CEIL_DIV_EXPR
:
14249 case FLOOR_DIV_EXPR
:
14250 case ROUND_DIV_EXPR
:
14251 case EXACT_DIV_EXPR
:
14255 case TRUNC_MOD_EXPR
:
14256 case FLOOR_MOD_EXPR
:
14257 case TRUTH_ANDIF_EXPR
:
14258 case TRUTH_ORIF_EXPR
:
14259 case TRUTH_AND_EXPR
:
14260 case TRUTH_OR_EXPR
:
14273 case COMPOUND_EXPR
:
14276 case PREDECREMENT_EXPR
:
14277 case PREINCREMENT_EXPR
:
14278 case POSTDECREMENT_EXPR
:
14279 case POSTINCREMENT_EXPR
:
14281 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14282 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14283 return build_nt (code
, op0
, op1
);
14288 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14289 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14290 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
14291 QUALIFIED_NAME_IS_TEMPLATE (t
));
14296 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14297 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14298 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
14303 int n
= VL_EXP_OPERAND_LENGTH (t
);
14304 tree result
= build_vl_exp (CALL_EXPR
, n
);
14306 for (i
= 0; i
< n
; i
++)
14307 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
14308 complain
, in_decl
);
14314 case PSEUDO_DTOR_EXPR
:
14315 case VEC_PERM_EXPR
:
14317 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14318 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14319 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14320 r
= build_nt (code
, op0
, op1
, op2
);
14321 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14327 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14328 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14329 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
14330 r
= build_nt (code
, op0
, op1
, op2
);
14331 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
14337 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14338 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14339 r
= build_nt (code
, op0
, op1
);
14340 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
14341 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
14345 case TEMPLATE_ID_EXPR
:
14347 /* Substituted template arguments */
14348 tree fn
= TREE_OPERAND (t
, 0);
14349 tree targs
= TREE_OPERAND (t
, 1);
14351 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
14353 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14355 return lookup_template_function (fn
, targs
);
14360 tree purpose
, value
, chain
;
14362 if (t
== void_list_node
)
14365 purpose
= TREE_PURPOSE (t
);
14367 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
14368 value
= TREE_VALUE (t
);
14370 value
= tsubst_copy (value
, args
, complain
, in_decl
);
14371 chain
= TREE_CHAIN (t
);
14372 if (chain
&& chain
!= void_type_node
)
14373 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
14374 if (purpose
== TREE_PURPOSE (t
)
14375 && value
== TREE_VALUE (t
)
14376 && chain
== TREE_CHAIN (t
))
14378 return tree_cons (purpose
, value
, chain
);
14383 case ENUMERAL_TYPE
:
14385 case TEMPLATE_TYPE_PARM
:
14386 case TEMPLATE_TEMPLATE_PARM
:
14387 case BOUND_TEMPLATE_TEMPLATE_PARM
:
14388 case TEMPLATE_PARM_INDEX
:
14390 case REFERENCE_TYPE
:
14392 case FUNCTION_TYPE
:
14395 case TYPENAME_TYPE
:
14396 case UNBOUND_CLASS_TEMPLATE
:
14398 case DECLTYPE_TYPE
:
14400 return tsubst (t
, args
, complain
, in_decl
);
14404 /* Fall through. */
14405 case IDENTIFIER_NODE
:
14406 if (IDENTIFIER_TYPENAME_P (t
))
14408 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14409 return mangle_conv_op_name_for_type (new_type
);
14415 /* This is handled by tsubst_copy_and_build. */
14416 gcc_unreachable ();
14420 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14421 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14422 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
14425 case CLEANUP_POINT_EXPR
:
14426 /* We shouldn't have built any of these during initial template
14427 generation. Instead, they should be built during instantiation
14428 in response to the saved STMT_IS_FULL_EXPR_P setting. */
14429 gcc_unreachable ();
14433 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14434 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
14435 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14436 r
= build2 (code
, type
, op0
, op1
);
14437 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
14438 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
14439 && !(complain
& tf_error
))
14440 return error_mark_node
;
14444 case EXPR_PACK_EXPANSION
:
14445 error ("invalid use of pack expansion expression");
14446 return error_mark_node
;
14448 case NONTYPE_ARGUMENT_PACK
:
14449 error ("use %<...%> to expand argument pack");
14450 return error_mark_node
;
14453 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
14461 /* Instantiate any typedefs in the type. */
14462 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14463 r
= fold_convert (type
, t
);
14464 gcc_assert (TREE_CODE (r
) == code
);
14469 /* These can sometimes show up in a partial instantiation, but never
14470 involve template parms. */
14471 gcc_assert (!uses_template_parms (t
));
14474 case UNARY_LEFT_FOLD_EXPR
:
14475 return tsubst_unary_left_fold (t
, args
, complain
, in_decl
);
14476 case UNARY_RIGHT_FOLD_EXPR
:
14477 return tsubst_unary_right_fold (t
, args
, complain
, in_decl
);
14478 case BINARY_LEFT_FOLD_EXPR
:
14479 return tsubst_binary_left_fold (t
, args
, complain
, in_decl
);
14480 case BINARY_RIGHT_FOLD_EXPR
:
14481 return tsubst_binary_right_fold (t
, args
, complain
, in_decl
);
14484 /* We shouldn't get here, but keep going if !flag_checking. */
14486 gcc_unreachable ();
14491 /* Helper function for tsubst_omp_clauses, used for instantiation of
14492 OMP_CLAUSE_DECL of clauses. */
14495 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
14498 if (decl
== NULL_TREE
)
14501 /* Handle an OpenMP array section represented as a TREE_LIST (or
14502 OMP_CLAUSE_DEPEND_KIND). An OMP_CLAUSE_DEPEND (with a depend
14503 kind of OMP_CLAUSE_DEPEND_SINK) can also be represented as a
14504 TREE_LIST. We can handle it exactly the same as an array section
14505 (purpose, value, and a chain), even though the nomenclature
14506 (low_bound, length, etc) is different. */
14507 if (TREE_CODE (decl
) == TREE_LIST
)
14510 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
14511 /*integral_constant_expression_p=*/false);
14512 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
14513 /*integral_constant_expression_p=*/false);
14514 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
14516 if (TREE_PURPOSE (decl
) == low_bound
14517 && TREE_VALUE (decl
) == length
14518 && TREE_CHAIN (decl
) == chain
)
14520 tree ret
= tree_cons (low_bound
, length
, chain
);
14521 OMP_CLAUSE_DEPEND_SINK_NEGATIVE (ret
)
14522 = OMP_CLAUSE_DEPEND_SINK_NEGATIVE (decl
);
14525 tree ret
= tsubst_expr (decl
, args
, complain
, in_decl
,
14526 /*integral_constant_expression_p=*/false);
14527 /* Undo convert_from_reference tsubst_expr could have called. */
14529 && REFERENCE_REF_P (ret
)
14530 && !REFERENCE_REF_P (decl
))
14531 ret
= TREE_OPERAND (ret
, 0);
14535 /* Like tsubst_copy, but specifically for OpenMP clauses. */
14538 tsubst_omp_clauses (tree clauses
, bool declare_simd
, bool allow_fields
,
14539 tree args
, tsubst_flags_t complain
, tree in_decl
)
14541 tree new_clauses
= NULL_TREE
, nc
, oc
;
14542 tree linear_no_step
= NULL_TREE
;
14544 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
14546 nc
= copy_node (oc
);
14547 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
14550 switch (OMP_CLAUSE_CODE (nc
))
14552 case OMP_CLAUSE_LASTPRIVATE
:
14553 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
14555 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
14556 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
14557 in_decl
, /*integral_constant_expression_p=*/false);
14558 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
14559 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
14562 case OMP_CLAUSE_PRIVATE
:
14563 case OMP_CLAUSE_SHARED
:
14564 case OMP_CLAUSE_FIRSTPRIVATE
:
14565 case OMP_CLAUSE_COPYIN
:
14566 case OMP_CLAUSE_COPYPRIVATE
:
14567 case OMP_CLAUSE_UNIFORM
:
14568 case OMP_CLAUSE_DEPEND
:
14569 case OMP_CLAUSE_FROM
:
14570 case OMP_CLAUSE_TO
:
14571 case OMP_CLAUSE_MAP
:
14572 case OMP_CLAUSE_USE_DEVICE_PTR
:
14573 case OMP_CLAUSE_IS_DEVICE_PTR
:
14574 OMP_CLAUSE_DECL (nc
)
14575 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14578 case OMP_CLAUSE_IF
:
14579 case OMP_CLAUSE_NUM_THREADS
:
14580 case OMP_CLAUSE_SCHEDULE
:
14581 case OMP_CLAUSE_COLLAPSE
:
14582 case OMP_CLAUSE_FINAL
:
14583 case OMP_CLAUSE_DEVICE
:
14584 case OMP_CLAUSE_DIST_SCHEDULE
:
14585 case OMP_CLAUSE_NUM_TEAMS
:
14586 case OMP_CLAUSE_THREAD_LIMIT
:
14587 case OMP_CLAUSE_SAFELEN
:
14588 case OMP_CLAUSE_SIMDLEN
:
14589 case OMP_CLAUSE_NUM_TASKS
:
14590 case OMP_CLAUSE_GRAINSIZE
:
14591 case OMP_CLAUSE_PRIORITY
:
14592 case OMP_CLAUSE_ORDERED
:
14593 case OMP_CLAUSE_HINT
:
14594 case OMP_CLAUSE_NUM_GANGS
:
14595 case OMP_CLAUSE_NUM_WORKERS
:
14596 case OMP_CLAUSE_VECTOR_LENGTH
:
14597 case OMP_CLAUSE_WORKER
:
14598 case OMP_CLAUSE_VECTOR
:
14599 case OMP_CLAUSE_ASYNC
:
14600 case OMP_CLAUSE_WAIT
:
14601 OMP_CLAUSE_OPERAND (nc
, 0)
14602 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
14603 in_decl
, /*integral_constant_expression_p=*/false);
14605 case OMP_CLAUSE_REDUCTION
:
14606 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
14608 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
14609 if (TREE_CODE (placeholder
) == SCOPE_REF
)
14611 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
14612 complain
, in_decl
);
14613 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
14614 = build_qualified_name (NULL_TREE
, scope
,
14615 TREE_OPERAND (placeholder
, 1),
14619 gcc_assert (identifier_p (placeholder
));
14621 OMP_CLAUSE_DECL (nc
)
14622 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14625 case OMP_CLAUSE_GANG
:
14626 case OMP_CLAUSE_ALIGNED
:
14627 OMP_CLAUSE_DECL (nc
)
14628 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14630 OMP_CLAUSE_OPERAND (nc
, 1)
14631 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
14632 in_decl
, /*integral_constant_expression_p=*/false);
14634 case OMP_CLAUSE_LINEAR
:
14635 OMP_CLAUSE_DECL (nc
)
14636 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
14638 if (OMP_CLAUSE_LINEAR_STEP (oc
) == NULL_TREE
)
14640 gcc_assert (!linear_no_step
);
14641 linear_no_step
= nc
;
14643 else if (OMP_CLAUSE_LINEAR_VARIABLE_STRIDE (oc
))
14644 OMP_CLAUSE_LINEAR_STEP (nc
)
14645 = tsubst_omp_clause_decl (OMP_CLAUSE_LINEAR_STEP (oc
), args
,
14646 complain
, in_decl
);
14648 OMP_CLAUSE_LINEAR_STEP (nc
)
14649 = tsubst_expr (OMP_CLAUSE_LINEAR_STEP (oc
), args
, complain
,
14651 /*integral_constant_expression_p=*/false);
14653 case OMP_CLAUSE_NOWAIT
:
14654 case OMP_CLAUSE_DEFAULT
:
14655 case OMP_CLAUSE_UNTIED
:
14656 case OMP_CLAUSE_MERGEABLE
:
14657 case OMP_CLAUSE_INBRANCH
:
14658 case OMP_CLAUSE_NOTINBRANCH
:
14659 case OMP_CLAUSE_PROC_BIND
:
14660 case OMP_CLAUSE_FOR
:
14661 case OMP_CLAUSE_PARALLEL
:
14662 case OMP_CLAUSE_SECTIONS
:
14663 case OMP_CLAUSE_TASKGROUP
:
14664 case OMP_CLAUSE_NOGROUP
:
14665 case OMP_CLAUSE_THREADS
:
14666 case OMP_CLAUSE_SIMD
:
14667 case OMP_CLAUSE_DEFAULTMAP
:
14668 case OMP_CLAUSE_INDEPENDENT
:
14669 case OMP_CLAUSE_AUTO
:
14670 case OMP_CLAUSE_SEQ
:
14672 case OMP_CLAUSE_TILE
:
14675 for (lnc
= OMP_CLAUSE_TILE_LIST (nc
),
14676 loc
= OMP_CLAUSE_TILE_LIST (oc
);
14678 loc
= TREE_CHAIN (loc
), lnc
= TREE_CHAIN (lnc
))
14680 TREE_VALUE (lnc
) = tsubst_expr (TREE_VALUE (loc
), args
,
14681 complain
, in_decl
, false);
14686 gcc_unreachable ();
14689 switch (OMP_CLAUSE_CODE (nc
))
14691 case OMP_CLAUSE_SHARED
:
14692 case OMP_CLAUSE_PRIVATE
:
14693 case OMP_CLAUSE_FIRSTPRIVATE
:
14694 case OMP_CLAUSE_LASTPRIVATE
:
14695 case OMP_CLAUSE_COPYPRIVATE
:
14696 case OMP_CLAUSE_LINEAR
:
14697 case OMP_CLAUSE_REDUCTION
:
14698 case OMP_CLAUSE_USE_DEVICE_PTR
:
14699 case OMP_CLAUSE_IS_DEVICE_PTR
:
14700 /* tsubst_expr on SCOPE_REF results in returning
14701 finish_non_static_data_member result. Undo that here. */
14702 if (TREE_CODE (OMP_CLAUSE_DECL (oc
)) == SCOPE_REF
14703 && (TREE_CODE (TREE_OPERAND (OMP_CLAUSE_DECL (oc
), 1))
14704 == IDENTIFIER_NODE
))
14706 tree t
= OMP_CLAUSE_DECL (nc
);
14709 switch (TREE_CODE (v
))
14711 case COMPONENT_REF
:
14715 case POINTER_PLUS_EXPR
:
14716 v
= TREE_OPERAND (v
, 0);
14719 if (DECL_CONTEXT (v
) == current_function_decl
14720 && DECL_ARTIFICIAL (v
)
14721 && DECL_NAME (v
) == this_identifier
)
14722 OMP_CLAUSE_DECL (nc
) = TREE_OPERAND (t
, 1);
14729 else if (VAR_P (OMP_CLAUSE_DECL (oc
))
14730 && DECL_HAS_VALUE_EXPR_P (OMP_CLAUSE_DECL (oc
))
14731 && DECL_ARTIFICIAL (OMP_CLAUSE_DECL (oc
))
14732 && DECL_LANG_SPECIFIC (OMP_CLAUSE_DECL (oc
))
14733 && DECL_OMP_PRIVATIZED_MEMBER (OMP_CLAUSE_DECL (oc
)))
14735 tree decl
= OMP_CLAUSE_DECL (nc
);
14738 if (!DECL_LANG_SPECIFIC (decl
))
14739 retrofit_lang_decl (decl
);
14740 DECL_OMP_PRIVATIZED_MEMBER (decl
) = 1;
14749 new_clauses
= nreverse (new_clauses
);
14752 new_clauses
= finish_omp_clauses (new_clauses
, allow_fields
);
14753 if (linear_no_step
)
14754 for (nc
= new_clauses
; nc
; nc
= OMP_CLAUSE_CHAIN (nc
))
14755 if (nc
== linear_no_step
)
14757 OMP_CLAUSE_LINEAR_STEP (nc
) = NULL_TREE
;
14761 return new_clauses
;
14764 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
14767 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
14770 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
14772 tree purpose
, value
, chain
;
14777 if (TREE_CODE (t
) != TREE_LIST
)
14778 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14779 /*function_p=*/false,
14780 /*integral_constant_expression_p=*/false);
14782 if (t
== void_list_node
)
14785 purpose
= TREE_PURPOSE (t
);
14787 purpose
= RECUR (purpose
);
14788 value
= TREE_VALUE (t
);
14791 if (TREE_CODE (value
) != LABEL_DECL
)
14792 value
= RECUR (value
);
14795 value
= lookup_label (DECL_NAME (value
));
14796 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
14797 TREE_USED (value
) = 1;
14800 chain
= TREE_CHAIN (t
);
14801 if (chain
&& chain
!= void_type_node
)
14802 chain
= RECUR (chain
);
14803 return tree_cons (purpose
, value
, chain
);
14807 /* Used to temporarily communicate the list of #pragma omp parallel
14808 clauses to #pragma omp for instantiation if they are combined
14811 static tree
*omp_parallel_combined_clauses
;
14813 /* Substitute one OMP_FOR iterator. */
14816 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree orig_declv
,
14817 tree initv
, tree condv
, tree incrv
, tree
*clauses
,
14818 tree args
, tsubst_flags_t complain
, tree in_decl
,
14819 bool integral_constant_expression_p
)
14821 #define RECUR(NODE) \
14822 tsubst_expr ((NODE), args, complain, in_decl, \
14823 integral_constant_expression_p)
14824 tree decl
, init
, cond
, incr
;
14826 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
14827 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
14829 if (orig_declv
&& OMP_FOR_ORIG_DECLS (t
))
14831 tree o
= TREE_VEC_ELT (OMP_FOR_ORIG_DECLS (t
), i
);
14832 TREE_VEC_ELT (orig_declv
, i
) = RECUR (o
);
14835 decl
= TREE_OPERAND (init
, 0);
14836 init
= TREE_OPERAND (init
, 1);
14837 tree decl_expr
= NULL_TREE
;
14838 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
14840 /* We need to jump through some hoops to handle declarations in the
14841 for-init-statement, since we might need to handle auto deduction,
14842 but we need to keep control of initialization. */
14844 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
14845 decl
= tsubst_decl (decl
, args
, complain
);
14849 if (TREE_CODE (decl
) == SCOPE_REF
)
14851 decl
= RECUR (decl
);
14852 if (TREE_CODE (decl
) == COMPONENT_REF
)
14856 switch (TREE_CODE (v
))
14858 case COMPONENT_REF
:
14862 case POINTER_PLUS_EXPR
:
14863 v
= TREE_OPERAND (v
, 0);
14866 if (DECL_CONTEXT (v
) == current_function_decl
14867 && DECL_ARTIFICIAL (v
)
14868 && DECL_NAME (v
) == this_identifier
)
14870 decl
= TREE_OPERAND (decl
, 1);
14871 decl
= omp_privatize_field (decl
, false);
14881 decl
= RECUR (decl
);
14883 init
= RECUR (init
);
14885 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
14886 if (auto_node
&& init
)
14888 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
14890 gcc_assert (!type_dependent_expression_p (decl
));
14892 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
14896 /* Declare the variable, but don't let that initialize it. */
14897 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
14898 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
14900 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
14903 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
14904 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14905 if (TREE_CODE (incr
) == MODIFY_EXPR
)
14907 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
14908 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
14909 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
14910 NOP_EXPR
, rhs
, complain
);
14913 incr
= RECUR (incr
);
14914 TREE_VEC_ELT (declv
, i
) = decl
;
14915 TREE_VEC_ELT (initv
, i
) = init
;
14916 TREE_VEC_ELT (condv
, i
) = cond
;
14917 TREE_VEC_ELT (incrv
, i
) = incr
;
14923 /* Declare and initialize the variable. */
14931 for (j
= (omp_parallel_combined_clauses
== NULL
? 1 : 0); j
< 2; j
++)
14933 for (pc
= j
? clauses
: omp_parallel_combined_clauses
; *pc
; )
14935 if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_PRIVATE
14936 && OMP_CLAUSE_DECL (*pc
) == decl
)
14938 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_LASTPRIVATE
14939 && OMP_CLAUSE_DECL (*pc
) == decl
)
14943 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
14945 *pc
= OMP_CLAUSE_CHAIN (c
);
14946 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14949 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_FIRSTPRIVATE
14950 && OMP_CLAUSE_DECL (*pc
) == decl
)
14952 error ("iteration variable %qD should not be firstprivate",
14954 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14956 else if (OMP_CLAUSE_CODE (*pc
) == OMP_CLAUSE_REDUCTION
14957 && OMP_CLAUSE_DECL (*pc
) == decl
)
14959 error ("iteration variable %qD should not be reduction",
14961 *pc
= OMP_CLAUSE_CHAIN (*pc
);
14964 pc
= &OMP_CLAUSE_CHAIN (*pc
);
14969 if (*pc
== NULL_TREE
)
14971 tree c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
14972 OMP_CLAUSE_DECL (c
) = decl
;
14973 c
= finish_omp_clauses (c
, true);
14976 OMP_CLAUSE_CHAIN (c
) = *clauses
;
14981 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
14982 if (COMPARISON_CLASS_P (cond
))
14984 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
14985 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
14986 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
14989 cond
= RECUR (cond
);
14990 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
14991 switch (TREE_CODE (incr
))
14993 case PREINCREMENT_EXPR
:
14994 case PREDECREMENT_EXPR
:
14995 case POSTINCREMENT_EXPR
:
14996 case POSTDECREMENT_EXPR
:
14997 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
14998 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
15001 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
15002 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
15004 tree rhs
= TREE_OPERAND (incr
, 1);
15005 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15006 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
15007 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
15008 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15009 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
15013 incr
= RECUR (incr
);
15016 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
15017 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
15019 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15020 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15021 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
15022 TREE_TYPE (decl
), lhs
,
15023 RECUR (TREE_OPERAND (incr
, 2))));
15025 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
15026 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
15027 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
15029 tree rhs
= TREE_OPERAND (incr
, 2);
15030 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
15031 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
15032 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
15033 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
15034 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
15038 incr
= RECUR (incr
);
15041 incr
= RECUR (incr
);
15045 TREE_VEC_ELT (declv
, i
) = decl
;
15046 TREE_VEC_ELT (initv
, i
) = init
;
15047 TREE_VEC_ELT (condv
, i
) = cond
;
15048 TREE_VEC_ELT (incrv
, i
) = incr
;
15052 /* Helper function of tsubst_expr, find OMP_TEAMS inside
15053 of OMP_TARGET's body. */
15056 tsubst_find_omp_teams (tree
*tp
, int *walk_subtrees
, void *)
15058 *walk_subtrees
= 0;
15059 switch (TREE_CODE (*tp
))
15064 case STATEMENT_LIST
:
15065 *walk_subtrees
= 1;
15073 /* Like tsubst_copy for expressions, etc. but also does semantic
15077 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
15078 bool integral_constant_expression_p
)
15080 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
15081 #define RECUR(NODE) \
15082 tsubst_expr ((NODE), args, complain, in_decl, \
15083 integral_constant_expression_p)
15089 if (t
== NULL_TREE
|| t
== error_mark_node
)
15092 loc
= input_location
;
15093 if (EXPR_HAS_LOCATION (t
))
15094 input_location
= EXPR_LOCATION (t
);
15095 if (STATEMENT_CODE_P (TREE_CODE (t
)))
15096 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
15098 switch (TREE_CODE (t
))
15100 case STATEMENT_LIST
:
15102 tree_stmt_iterator i
;
15103 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
15104 RECUR (tsi_stmt (i
));
15108 case CTOR_INITIALIZER
:
15109 finish_mem_initializers (tsubst_initializer_list
15110 (TREE_OPERAND (t
, 0), args
));
15114 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
15118 tmp
= RECUR (EXPR_STMT_EXPR (t
));
15119 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
15120 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
15122 finish_expr_stmt (tmp
);
15126 do_using_directive (USING_STMT_NAMESPACE (t
));
15131 tree decl
, pattern_decl
;
15134 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
15135 if (TREE_CODE (decl
) == LABEL_DECL
)
15136 finish_label_decl (DECL_NAME (decl
));
15137 else if (TREE_CODE (decl
) == USING_DECL
)
15139 tree scope
= USING_DECL_SCOPE (decl
);
15140 tree name
= DECL_NAME (decl
);
15143 scope
= tsubst (scope
, args
, complain
, in_decl
);
15144 decl
= lookup_qualified_name (scope
, name
,
15145 /*is_type_p=*/false,
15146 /*complain=*/false);
15147 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
15148 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
15150 do_local_using_decl (decl
, scope
, name
);
15152 else if (DECL_PACK_P (decl
))
15154 /* Don't build up decls for a variadic capture proxy, we'll
15155 instantiate the elements directly as needed. */
15160 init
= DECL_INITIAL (decl
);
15161 decl
= tsubst (decl
, args
, complain
, in_decl
);
15162 if (decl
!= error_mark_node
)
15164 /* By marking the declaration as instantiated, we avoid
15165 trying to instantiate it. Since instantiate_decl can't
15166 handle local variables, and since we've already done
15167 all that needs to be done, that's the right thing to
15170 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15172 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
15173 /* Anonymous aggregates are a special case. */
15174 finish_anon_union (decl
);
15175 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
15177 DECL_CONTEXT (decl
) = current_function_decl
;
15178 if (DECL_NAME (decl
) == this_identifier
)
15180 tree lam
= DECL_CONTEXT (current_function_decl
);
15181 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
15182 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
15184 insert_capture_proxy (decl
);
15186 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
15187 /* We already did a pushtag. */;
15188 else if (TREE_CODE (decl
) == FUNCTION_DECL
15189 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
15190 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
15192 DECL_CONTEXT (decl
) = NULL_TREE
;
15194 DECL_CONTEXT (decl
) = current_function_decl
;
15195 cp_check_omp_declare_reduction (decl
);
15199 int const_init
= false;
15200 maybe_push_decl (decl
);
15202 && DECL_PRETTY_FUNCTION_P (decl
))
15204 /* For __PRETTY_FUNCTION__ we have to adjust the
15206 const char *const name
15207 = cxx_printable_name (current_function_decl
, 2);
15208 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
15211 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
15214 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
15216 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
15225 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15226 RECUR (FOR_INIT_STMT (t
));
15227 finish_for_init_stmt (stmt
);
15228 tmp
= RECUR (FOR_COND (t
));
15229 finish_for_cond (tmp
, stmt
, false);
15230 tmp
= RECUR (FOR_EXPR (t
));
15231 finish_for_expr (tmp
, stmt
);
15232 RECUR (FOR_BODY (t
));
15233 finish_for_stmt (stmt
);
15236 case RANGE_FOR_STMT
:
15239 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
15240 decl
= RANGE_FOR_DECL (t
);
15241 decl
= tsubst (decl
, args
, complain
, in_decl
);
15242 maybe_push_decl (decl
);
15243 expr
= RECUR (RANGE_FOR_EXPR (t
));
15244 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
15245 RECUR (RANGE_FOR_BODY (t
));
15246 finish_for_stmt (stmt
);
15251 stmt
= begin_while_stmt ();
15252 tmp
= RECUR (WHILE_COND (t
));
15253 finish_while_stmt_cond (tmp
, stmt
, false);
15254 RECUR (WHILE_BODY (t
));
15255 finish_while_stmt (stmt
);
15259 stmt
= begin_do_stmt ();
15260 RECUR (DO_BODY (t
));
15261 finish_do_body (stmt
);
15262 tmp
= RECUR (DO_COND (t
));
15263 finish_do_stmt (tmp
, stmt
, false);
15267 stmt
= begin_if_stmt ();
15268 tmp
= RECUR (IF_COND (t
));
15269 finish_if_stmt_cond (tmp
, stmt
);
15270 RECUR (THEN_CLAUSE (t
));
15271 finish_then_clause (stmt
);
15273 if (ELSE_CLAUSE (t
))
15275 begin_else_clause (stmt
);
15276 RECUR (ELSE_CLAUSE (t
));
15277 finish_else_clause (stmt
);
15280 finish_if_stmt (stmt
);
15284 if (BIND_EXPR_BODY_BLOCK (t
))
15285 stmt
= begin_function_body ();
15287 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
15288 ? BCS_TRY_BLOCK
: 0);
15290 RECUR (BIND_EXPR_BODY (t
));
15292 if (BIND_EXPR_BODY_BLOCK (t
))
15293 finish_function_body (stmt
);
15295 finish_compound_stmt (stmt
);
15299 finish_break_stmt ();
15302 case CONTINUE_STMT
:
15303 finish_continue_stmt ();
15307 stmt
= begin_switch_stmt ();
15308 tmp
= RECUR (SWITCH_STMT_COND (t
));
15309 finish_switch_cond (tmp
, stmt
);
15310 RECUR (SWITCH_STMT_BODY (t
));
15311 finish_switch_stmt (stmt
);
15314 case CASE_LABEL_EXPR
:
15316 tree low
= RECUR (CASE_LOW (t
));
15317 tree high
= RECUR (CASE_HIGH (t
));
15318 finish_case_label (EXPR_LOCATION (t
), low
, high
);
15324 tree decl
= LABEL_EXPR_LABEL (t
);
15327 label
= finish_label_stmt (DECL_NAME (decl
));
15328 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
15329 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
15334 tmp
= GOTO_DESTINATION (t
);
15335 if (TREE_CODE (tmp
) != LABEL_DECL
)
15336 /* Computed goto's must be tsubst'd into. On the other hand,
15337 non-computed gotos must not be; the identifier in question
15338 will have no binding. */
15341 tmp
= DECL_NAME (tmp
);
15342 finish_goto_stmt (tmp
);
15347 tree string
= RECUR (ASM_STRING (t
));
15348 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
15349 complain
, in_decl
);
15350 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
15351 complain
, in_decl
);
15352 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
15353 complain
, in_decl
);
15354 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
15355 complain
, in_decl
);
15356 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
15358 tree asm_expr
= tmp
;
15359 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
15360 asm_expr
= TREE_OPERAND (asm_expr
, 0);
15361 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
15368 stmt
= begin_try_block ();
15369 RECUR (TRY_STMTS (t
));
15370 finish_cleanup_try_block (stmt
);
15371 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
15375 tree compound_stmt
= NULL_TREE
;
15377 if (FN_TRY_BLOCK_P (t
))
15378 stmt
= begin_function_try_block (&compound_stmt
);
15380 stmt
= begin_try_block ();
15382 RECUR (TRY_STMTS (t
));
15384 if (FN_TRY_BLOCK_P (t
))
15385 finish_function_try_block (stmt
);
15387 finish_try_block (stmt
);
15389 RECUR (TRY_HANDLERS (t
));
15390 if (FN_TRY_BLOCK_P (t
))
15391 finish_function_handler_sequence (stmt
, compound_stmt
);
15393 finish_handler_sequence (stmt
);
15399 tree decl
= HANDLER_PARMS (t
);
15403 decl
= tsubst (decl
, args
, complain
, in_decl
);
15404 /* Prevent instantiate_decl from trying to instantiate
15405 this variable. We've already done all that needs to be
15407 if (decl
!= error_mark_node
)
15408 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
15410 stmt
= begin_handler ();
15411 finish_handler_parms (decl
, stmt
);
15412 RECUR (HANDLER_BODY (t
));
15413 finish_handler (stmt
);
15418 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
15419 if (CLASS_TYPE_P (tmp
))
15421 /* Local classes are not independent templates; they are
15422 instantiated along with their containing function. And this
15423 way we don't have to deal with pushing out of one local class
15424 to instantiate a member of another local class. */
15426 /* Closures are handled by the LAMBDA_EXPR. */
15427 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
15428 complete_type (tmp
);
15429 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
15430 if (!DECL_ARTIFICIAL (fn
))
15431 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
15435 case STATIC_ASSERT
:
15439 ++c_inhibit_evaluation_warnings
;
15441 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
15444 /*integral_constant_expression_p=*/true);
15445 --c_inhibit_evaluation_warnings
;
15447 finish_static_assert (condition
,
15448 STATIC_ASSERT_MESSAGE (t
),
15449 STATIC_ASSERT_SOURCE_LOCATION (t
),
15450 /*member_p=*/false);
15455 case OACC_PARALLEL
:
15456 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, false, args
, complain
,
15458 stmt
= begin_omp_parallel ();
15459 RECUR (OMP_BODY (t
));
15460 finish_omp_construct (TREE_CODE (t
), stmt
, tmp
);
15464 r
= push_omp_privatization_clauses (OMP_PARALLEL_COMBINED (t
));
15465 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false, true,
15466 args
, complain
, in_decl
);
15467 if (OMP_PARALLEL_COMBINED (t
))
15468 omp_parallel_combined_clauses
= &tmp
;
15469 stmt
= begin_omp_parallel ();
15470 RECUR (OMP_PARALLEL_BODY (t
));
15471 gcc_assert (omp_parallel_combined_clauses
== NULL
);
15472 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
15473 = OMP_PARALLEL_COMBINED (t
);
15474 pop_omp_privatization_clauses (r
);
15478 r
= push_omp_privatization_clauses (false);
15479 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false, true,
15480 args
, complain
, in_decl
);
15481 stmt
= begin_omp_task ();
15482 RECUR (OMP_TASK_BODY (t
));
15483 finish_omp_task (tmp
, stmt
);
15484 pop_omp_privatization_clauses (r
);
15491 case OMP_DISTRIBUTE
:
15495 tree clauses
, body
, pre_body
;
15496 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
15497 tree orig_declv
= NULL_TREE
;
15498 tree incrv
= NULL_TREE
;
15501 r
= push_omp_privatization_clauses (OMP_FOR_INIT (t
) == NULL_TREE
);
15502 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
15503 TREE_CODE (t
) != OACC_LOOP
,
15504 args
, complain
, in_decl
);
15505 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15507 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15508 if (OMP_FOR_ORIG_DECLS (t
))
15509 orig_declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15510 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15511 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15512 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
15515 stmt
= begin_omp_structured_block ();
15517 pre_body
= push_stmt_list ();
15518 RECUR (OMP_FOR_PRE_BODY (t
));
15519 pre_body
= pop_stmt_list (pre_body
);
15521 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15522 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
15523 tsubst_omp_for_iterator (t
, i
, declv
, orig_declv
, initv
, condv
,
15524 incrv
, &clauses
, args
, complain
, in_decl
,
15525 integral_constant_expression_p
);
15526 omp_parallel_combined_clauses
= NULL
;
15528 body
= push_stmt_list ();
15529 RECUR (OMP_FOR_BODY (t
));
15530 body
= pop_stmt_list (body
);
15532 if (OMP_FOR_INIT (t
) != NULL_TREE
)
15533 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
,
15534 orig_declv
, initv
, condv
, incrv
, body
, pre_body
,
15538 t
= make_node (TREE_CODE (t
));
15539 TREE_TYPE (t
) = void_type_node
;
15540 OMP_FOR_BODY (t
) = body
;
15541 OMP_FOR_PRE_BODY (t
) = pre_body
;
15542 OMP_FOR_CLAUSES (t
) = clauses
;
15543 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
15547 add_stmt (finish_omp_structured_block (stmt
));
15548 pop_omp_privatization_clauses (r
);
15553 omp_parallel_combined_clauses
= NULL
;
15558 r
= push_omp_privatization_clauses (TREE_CODE (t
) == OMP_TEAMS
15559 && OMP_TEAMS_COMBINED (t
));
15560 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false, true,
15561 args
, complain
, in_decl
);
15562 stmt
= push_stmt_list ();
15563 RECUR (OMP_BODY (t
));
15564 stmt
= pop_stmt_list (stmt
);
15567 OMP_BODY (t
) = stmt
;
15568 OMP_CLAUSES (t
) = tmp
;
15570 pop_omp_privatization_clauses (r
);
15574 case OMP_TARGET_DATA
:
15576 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
15577 TREE_CODE (t
) != OACC_DATA
,
15578 args
, complain
, in_decl
);
15579 keep_next_level (true);
15580 stmt
= begin_omp_structured_block ();
15582 RECUR (OMP_BODY (t
));
15583 stmt
= finish_omp_structured_block (stmt
);
15586 OMP_BODY (t
) = stmt
;
15587 OMP_CLAUSES (t
) = tmp
;
15588 if (TREE_CODE (t
) == OMP_TARGET
&& OMP_TARGET_COMBINED (t
))
15590 tree teams
= cp_walk_tree (&stmt
, tsubst_find_omp_teams
, NULL
, NULL
);
15593 /* For combined target teams, ensure the num_teams and
15594 thread_limit clause expressions are evaluated on the host,
15595 before entering the target construct. */
15597 for (c
= OMP_TEAMS_CLAUSES (teams
);
15598 c
; c
= OMP_CLAUSE_CHAIN (c
))
15599 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_NUM_TEAMS
15600 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_THREAD_LIMIT
)
15601 && TREE_CODE (OMP_CLAUSE_OPERAND (c
, 0)) != INTEGER_CST
)
15603 tree expr
= OMP_CLAUSE_OPERAND (c
, 0);
15604 expr
= force_target_expr (TREE_TYPE (expr
), expr
, tf_none
);
15605 if (expr
== error_mark_node
)
15607 tmp
= TARGET_EXPR_SLOT (expr
);
15609 OMP_CLAUSE_OPERAND (c
, 0) = expr
;
15610 tree tc
= build_omp_clause (OMP_CLAUSE_LOCATION (c
),
15611 OMP_CLAUSE_FIRSTPRIVATE
);
15612 OMP_CLAUSE_DECL (tc
) = tmp
;
15613 OMP_CLAUSE_CHAIN (tc
) = OMP_TARGET_CLAUSES (t
);
15614 OMP_TARGET_CLAUSES (t
) = tc
;
15623 tmp
= tsubst_omp_clauses (OACC_DECLARE_CLAUSES (t
), false, false,
15624 args
, complain
, in_decl
);
15625 OACC_DECLARE_CLAUSES (t
) = tmp
;
15629 case OMP_TARGET_UPDATE
:
15630 case OMP_TARGET_ENTER_DATA
:
15631 case OMP_TARGET_EXIT_DATA
:
15632 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, true,
15633 args
, complain
, in_decl
);
15635 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15639 case OACC_ENTER_DATA
:
15640 case OACC_EXIT_DATA
:
15642 tmp
= tsubst_omp_clauses (OMP_STANDALONE_CLAUSES (t
), false, false,
15643 args
, complain
, in_decl
);
15645 OMP_STANDALONE_CLAUSES (t
) = tmp
;
15650 tmp
= tsubst_omp_clauses (OMP_ORDERED_CLAUSES (t
), false, true,
15651 args
, complain
, in_decl
);
15652 stmt
= push_stmt_list ();
15653 RECUR (OMP_BODY (t
));
15654 stmt
= pop_stmt_list (stmt
);
15657 OMP_BODY (t
) = stmt
;
15658 OMP_ORDERED_CLAUSES (t
) = tmp
;
15664 case OMP_TASKGROUP
:
15665 stmt
= push_stmt_list ();
15666 RECUR (OMP_BODY (t
));
15667 stmt
= pop_stmt_list (stmt
);
15670 OMP_BODY (t
) = stmt
;
15675 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
15676 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
15678 tree op1
= TREE_OPERAND (t
, 1);
15679 tree rhs1
= NULL_TREE
;
15681 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
15683 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
15684 op1
= TREE_OPERAND (op1
, 1);
15686 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15687 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15688 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
15689 NULL_TREE
, NULL_TREE
, rhs1
,
15690 OMP_ATOMIC_SEQ_CST (t
));
15694 tree op1
= TREE_OPERAND (t
, 1);
15695 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
15696 tree rhs1
= NULL_TREE
;
15697 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
15698 enum tree_code opcode
= NOP_EXPR
;
15699 if (code
== OMP_ATOMIC_READ
)
15701 v
= RECUR (TREE_OPERAND (op1
, 0));
15702 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15704 else if (code
== OMP_ATOMIC_CAPTURE_OLD
15705 || code
== OMP_ATOMIC_CAPTURE_NEW
)
15707 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
15708 v
= RECUR (TREE_OPERAND (op1
, 0));
15709 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
15710 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
15712 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
15713 op11
= TREE_OPERAND (op11
, 1);
15715 lhs
= RECUR (TREE_OPERAND (op11
, 0));
15716 rhs
= RECUR (TREE_OPERAND (op11
, 1));
15717 opcode
= TREE_CODE (op11
);
15718 if (opcode
== MODIFY_EXPR
)
15724 lhs
= RECUR (TREE_OPERAND (op1
, 0));
15725 rhs
= RECUR (TREE_OPERAND (op1
, 1));
15727 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
15728 OMP_ATOMIC_SEQ_CST (t
));
15732 case TRANSACTION_EXPR
:
15735 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
15736 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
15738 if (TRANSACTION_EXPR_IS_STMT (t
))
15740 tree body
= TRANSACTION_EXPR_BODY (t
);
15741 tree noex
= NULL_TREE
;
15742 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
15744 noex
= MUST_NOT_THROW_COND (body
);
15745 if (noex
== NULL_TREE
)
15746 noex
= boolean_true_node
;
15747 body
= TREE_OPERAND (body
, 0);
15749 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
15751 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
15755 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
15756 RECUR (TRANSACTION_EXPR_BODY (t
)),
15763 case MUST_NOT_THROW_EXPR
:
15765 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15766 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
15767 RETURN (build_must_not_throw_expr (op0
, cond
));
15770 case EXPR_PACK_EXPANSION
:
15771 error ("invalid use of pack expansion expression");
15772 RETURN (error_mark_node
);
15774 case NONTYPE_ARGUMENT_PACK
:
15775 error ("use %<...%> to expand argument pack");
15776 RETURN (error_mark_node
);
15778 case CILK_SPAWN_STMT
:
15779 cfun
->calls_cilk_spawn
= 1;
15780 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
15782 case CILK_SYNC_STMT
:
15783 RETURN (build_cilk_sync ());
15785 case COMPOUND_EXPR
:
15786 tmp
= RECUR (TREE_OPERAND (t
, 0));
15787 if (tmp
== NULL_TREE
)
15788 /* If the first operand was a statement, we're done with it. */
15789 RETURN (RECUR (TREE_OPERAND (t
, 1)));
15790 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
15791 RECUR (TREE_OPERAND (t
, 1)),
15794 case ANNOTATE_EXPR
:
15795 tmp
= RECUR (TREE_OPERAND (t
, 0));
15796 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
15797 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
15800 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
15802 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15803 /*function_p=*/false,
15804 integral_constant_expression_p
));
15807 RETURN (NULL_TREE
);
15809 input_location
= loc
;
15815 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
15816 function. For description of the body see comment above
15817 cp_parser_omp_declare_reduction_exprs. */
15820 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
15822 if (t
== NULL_TREE
|| t
== error_mark_node
)
15825 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
15827 tree_stmt_iterator tsi
;
15830 memset (stmts
, 0, sizeof stmts
);
15831 for (i
= 0, tsi
= tsi_start (t
);
15832 i
< 7 && !tsi_end_p (tsi
);
15833 i
++, tsi_next (&tsi
))
15834 stmts
[i
] = tsi_stmt (tsi
);
15835 gcc_assert (tsi_end_p (tsi
));
15839 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
15840 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
15841 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
15842 args
, complain
, in_decl
);
15843 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
15844 args
, complain
, in_decl
);
15845 DECL_CONTEXT (omp_out
) = current_function_decl
;
15846 DECL_CONTEXT (omp_in
) = current_function_decl
;
15847 keep_next_level (true);
15848 tree block
= begin_omp_structured_block ();
15849 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
15850 block
= finish_omp_structured_block (block
);
15851 block
= maybe_cleanup_point_expr_void (block
);
15852 add_decl_expr (omp_out
);
15853 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
15854 TREE_NO_WARNING (omp_out
) = 1;
15855 add_decl_expr (omp_in
);
15856 finish_expr_stmt (block
);
15860 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
15861 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
15862 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
15863 args
, complain
, in_decl
);
15864 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
15865 args
, complain
, in_decl
);
15866 DECL_CONTEXT (omp_priv
) = current_function_decl
;
15867 DECL_CONTEXT (omp_orig
) = current_function_decl
;
15868 keep_next_level (true);
15869 tree block
= begin_omp_structured_block ();
15870 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
15871 block
= finish_omp_structured_block (block
);
15872 block
= maybe_cleanup_point_expr_void (block
);
15873 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
15874 add_decl_expr (omp_priv
);
15875 add_decl_expr (omp_orig
);
15876 finish_expr_stmt (block
);
15878 add_decl_expr (omp_orig
);
15882 /* T is a postfix-expression that is not being used in a function
15883 call. Return the substituted version of T. */
15886 tsubst_non_call_postfix_expression (tree t
, tree args
,
15887 tsubst_flags_t complain
,
15890 if (TREE_CODE (t
) == SCOPE_REF
)
15891 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
15892 /*done=*/false, /*address_p=*/false);
15894 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
15895 /*function_p=*/false,
15896 /*integral_constant_expression_p=*/false);
15901 /* Like tsubst but deals with expressions and performs semantic
15902 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
15905 tsubst_copy_and_build (tree t
,
15907 tsubst_flags_t complain
,
15910 bool integral_constant_expression_p
)
15912 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
15913 #define RECUR(NODE) \
15914 tsubst_copy_and_build (NODE, args, complain, in_decl, \
15915 /*function_p=*/false, \
15916 integral_constant_expression_p)
15921 if (t
== NULL_TREE
|| t
== error_mark_node
)
15924 loc
= input_location
;
15925 if (EXPR_HAS_LOCATION (t
))
15926 input_location
= EXPR_LOCATION (t
);
15928 /* N3276 decltype magic only applies to calls at the top level or on the
15929 right side of a comma. */
15930 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
15931 complain
&= ~tf_decltype
;
15933 switch (TREE_CODE (t
))
15937 /* Fall through. */
15938 case IDENTIFIER_NODE
:
15942 bool non_integral_constant_expression_p
;
15943 const char *error_msg
;
15945 if (IDENTIFIER_TYPENAME_P (t
))
15947 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15948 t
= mangle_conv_op_name_for_type (new_type
);
15951 /* Look up the name. */
15952 decl
= lookup_name (t
);
15954 /* By convention, expressions use ERROR_MARK_NODE to indicate
15955 failure, not NULL_TREE. */
15956 if (decl
== NULL_TREE
)
15957 decl
= error_mark_node
;
15959 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
15961 integral_constant_expression_p
,
15962 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
15963 &non_integral_constant_expression_p
,
15964 /*template_p=*/false,
15966 /*address_p=*/false,
15967 /*template_arg_p=*/false,
15972 if (!function_p
&& identifier_p (decl
))
15974 if (complain
& tf_error
)
15975 unqualified_name_lookup_error (decl
);
15976 decl
= error_mark_node
;
15981 case TEMPLATE_ID_EXPR
:
15984 tree templ
= RECUR (TREE_OPERAND (t
, 0));
15985 tree targs
= TREE_OPERAND (t
, 1);
15988 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
15989 if (targs
== error_mark_node
)
15990 return error_mark_node
;
15992 if (variable_template_p (templ
))
15993 RETURN (lookup_and_finish_template_variable (templ
, targs
, complain
));
15995 if (TREE_CODE (templ
) == COMPONENT_REF
)
15997 object
= TREE_OPERAND (templ
, 0);
15998 templ
= TREE_OPERAND (templ
, 1);
16001 object
= NULL_TREE
;
16002 templ
= lookup_template_function (templ
, targs
);
16005 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
16006 object
, templ
, NULL_TREE
));
16008 RETURN (baselink_for_fns (templ
));
16013 tree r
= RECUR (TREE_OPERAND (t
, 0));
16015 if (REFERENCE_REF_P (t
))
16017 /* A type conversion to reference type will be enclosed in
16018 such an indirect ref, but the substitution of the cast
16019 will have also added such an indirect ref. */
16020 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
16021 r
= convert_from_reference (r
);
16024 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
16025 complain
|decltype_flag
);
16027 if (TREE_CODE (r
) == INDIRECT_REF
)
16028 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16035 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16036 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16037 RETURN (build_nop (type
, op0
));
16040 case IMPLICIT_CONV_EXPR
:
16042 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16043 tree expr
= RECUR (TREE_OPERAND (t
, 0));
16044 int flags
= LOOKUP_IMPLICIT
;
16045 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
16046 flags
= LOOKUP_NORMAL
;
16047 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
16053 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16054 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16055 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
16059 case REINTERPRET_CAST_EXPR
:
16060 case CONST_CAST_EXPR
:
16061 case DYNAMIC_CAST_EXPR
:
16062 case STATIC_CAST_EXPR
:
16065 tree op
, r
= NULL_TREE
;
16067 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16068 if (integral_constant_expression_p
16069 && !cast_valid_in_integral_constant_expression_p (type
))
16071 if (complain
& tf_error
)
16072 error ("a cast to a type other than an integral or "
16073 "enumeration type cannot appear in a constant-expression");
16074 RETURN (error_mark_node
);
16077 op
= RECUR (TREE_OPERAND (t
, 0));
16079 warning_sentinel
s(warn_useless_cast
);
16080 switch (TREE_CODE (t
))
16083 r
= build_functional_cast (type
, op
, complain
);
16085 case REINTERPRET_CAST_EXPR
:
16086 r
= build_reinterpret_cast (type
, op
, complain
);
16088 case CONST_CAST_EXPR
:
16089 r
= build_const_cast (type
, op
, complain
);
16091 case DYNAMIC_CAST_EXPR
:
16092 r
= build_dynamic_cast (type
, op
, complain
);
16094 case STATIC_CAST_EXPR
:
16095 r
= build_static_cast (type
, op
, complain
);
16098 gcc_unreachable ();
16104 case POSTDECREMENT_EXPR
:
16105 case POSTINCREMENT_EXPR
:
16106 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16107 args
, complain
, in_decl
);
16108 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
16109 complain
|decltype_flag
));
16111 case PREDECREMENT_EXPR
:
16112 case PREINCREMENT_EXPR
:
16116 case TRUTH_NOT_EXPR
:
16117 case UNARY_PLUS_EXPR
: /* Unary + */
16118 case REALPART_EXPR
:
16119 case IMAGPART_EXPR
:
16120 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
16121 RECUR (TREE_OPERAND (t
, 0)),
16122 complain
|decltype_flag
));
16124 case FIX_TRUNC_EXPR
:
16125 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
16129 op1
= TREE_OPERAND (t
, 0);
16130 if (TREE_CODE (op1
) == LABEL_DECL
)
16131 RETURN (finish_label_address_expr (DECL_NAME (op1
),
16132 EXPR_LOCATION (op1
)));
16133 if (TREE_CODE (op1
) == SCOPE_REF
)
16134 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
16135 /*done=*/true, /*address_p=*/true);
16137 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
16139 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
16140 complain
|decltype_flag
));
16145 case TRUNC_DIV_EXPR
:
16146 case CEIL_DIV_EXPR
:
16147 case FLOOR_DIV_EXPR
:
16148 case ROUND_DIV_EXPR
:
16149 case EXACT_DIV_EXPR
:
16153 case TRUNC_MOD_EXPR
:
16154 case FLOOR_MOD_EXPR
:
16155 case TRUTH_ANDIF_EXPR
:
16156 case TRUTH_ORIF_EXPR
:
16157 case TRUTH_AND_EXPR
:
16158 case TRUTH_OR_EXPR
:
16174 warning_sentinel
s1(warn_type_limits
);
16175 warning_sentinel
s2(warn_div_by_zero
);
16176 warning_sentinel
s3(warn_logical_op
);
16177 warning_sentinel
s4(warn_tautological_compare
);
16178 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16179 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16180 tree r
= build_x_binary_op
16181 (input_location
, TREE_CODE (t
),
16183 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
16185 : TREE_CODE (TREE_OPERAND (t
, 0))),
16187 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
16189 : TREE_CODE (TREE_OPERAND (t
, 1))),
16191 complain
|decltype_flag
);
16192 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
16193 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16198 case POINTER_PLUS_EXPR
:
16200 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16201 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16202 return fold_build_pointer_plus (op0
, op1
);
16206 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
16207 /*address_p=*/false));
16209 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16210 args
, complain
, in_decl
);
16211 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
16212 RECUR (TREE_OPERAND (t
, 1)),
16213 complain
|decltype_flag
));
16215 case ARRAY_NOTATION_REF
:
16217 tree start_index
, length
, stride
;
16218 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
16219 args
, complain
, in_decl
);
16220 start_index
= RECUR (ARRAY_NOTATION_START (t
));
16221 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
16222 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
16223 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
16224 length
, stride
, TREE_TYPE (op1
)));
16227 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0))
16228 || ARGUMENT_PACK_P (TREE_OPERAND (t
, 0)))
16229 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
16236 op1
= TREE_OPERAND (t
, 0);
16237 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
16238 op1
= TREE_TYPE (op1
);
16241 /* When there are no ARGS, we are trying to evaluate a
16242 non-dependent expression from the parser. Trying to do
16243 the substitutions may not work. */
16245 op1
= TREE_TYPE (op1
);
16249 ++cp_unevaluated_operand
;
16250 ++c_inhibit_evaluation_warnings
;
16252 op1
= tsubst (op1
, args
, complain
, in_decl
);
16254 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16255 /*function_p=*/false,
16256 /*integral_constant_expression_p=*/
16258 --cp_unevaluated_operand
;
16259 --c_inhibit_evaluation_warnings
;
16262 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
16263 complain
& tf_error
);
16265 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
16266 complain
& tf_error
);
16267 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
16269 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
16271 if (!processing_template_decl
&& TYPE_P (op1
))
16273 r
= build_min (SIZEOF_EXPR
, size_type_node
,
16274 build1 (NOP_EXPR
, op1
, error_mark_node
));
16275 SIZEOF_EXPR_TYPE_P (r
) = 1;
16278 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
16279 TREE_SIDE_EFFECTS (r
) = 0;
16280 TREE_READONLY (r
) = 1;
16282 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
16287 case AT_ENCODE_EXPR
:
16289 op1
= TREE_OPERAND (t
, 0);
16290 ++cp_unevaluated_operand
;
16291 ++c_inhibit_evaluation_warnings
;
16292 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16293 /*function_p=*/false,
16294 /*integral_constant_expression_p=*/false);
16295 --cp_unevaluated_operand
;
16296 --c_inhibit_evaluation_warnings
;
16297 RETURN (objc_build_encode_expr (op1
));
16300 case NOEXCEPT_EXPR
:
16301 op1
= TREE_OPERAND (t
, 0);
16302 ++cp_unevaluated_operand
;
16303 ++c_inhibit_evaluation_warnings
;
16304 ++cp_noexcept_operand
;
16305 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
16306 /*function_p=*/false,
16307 /*integral_constant_expression_p=*/false);
16308 --cp_unevaluated_operand
;
16309 --c_inhibit_evaluation_warnings
;
16310 --cp_noexcept_operand
;
16311 RETURN (finish_noexcept_expr (op1
, complain
));
16315 warning_sentinel
s(warn_div_by_zero
);
16316 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
16317 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
16318 tree r
= build_x_modify_expr
16319 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
16320 complain
|decltype_flag
);
16321 /* TREE_NO_WARNING must be set if either the expression was
16322 parenthesized or it uses an operator such as >>= rather
16323 than plain assignment. In the former case, it was already
16324 set and must be copied. In the latter case,
16325 build_x_modify_expr sets it and it must not be reset
16327 if (TREE_NO_WARNING (t
))
16328 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
16334 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16335 args
, complain
, in_decl
);
16336 /* Remember that there was a reference to this entity. */
16338 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
16339 RETURN (error_mark_node
);
16340 RETURN (build_x_arrow (input_location
, op1
, complain
));
16344 tree placement
= RECUR (TREE_OPERAND (t
, 0));
16345 tree init
= RECUR (TREE_OPERAND (t
, 3));
16346 vec
<tree
, va_gc
> *placement_vec
;
16347 vec
<tree
, va_gc
> *init_vec
;
16350 if (placement
== NULL_TREE
)
16351 placement_vec
= NULL
;
16354 placement_vec
= make_tree_vector ();
16355 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
16356 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
16359 /* If there was an initializer in the original tree, but it
16360 instantiated to an empty list, then we should pass a
16361 non-NULL empty vector to tell build_new that it was an
16362 empty initializer() rather than no initializer. This can
16363 only happen when the initializer is a pack expansion whose
16364 parameter packs are of length zero. */
16365 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
16369 init_vec
= make_tree_vector ();
16370 if (init
== void_node
)
16371 gcc_assert (init_vec
!= NULL
);
16374 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
16375 vec_safe_push (init_vec
, TREE_VALUE (init
));
16379 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
16380 tree op2
= RECUR (TREE_OPERAND (t
, 2));
16381 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
16382 NEW_EXPR_USE_GLOBAL (t
),
16385 if (placement_vec
!= NULL
)
16386 release_tree_vector (placement_vec
);
16387 if (init_vec
!= NULL
)
16388 release_tree_vector (init_vec
);
16395 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16396 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16397 RETURN (delete_sanity (op0
, op1
,
16398 DELETE_EXPR_USE_VEC (t
),
16399 DELETE_EXPR_USE_GLOBAL (t
),
16403 case COMPOUND_EXPR
:
16405 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
16406 complain
& ~tf_decltype
, in_decl
,
16407 /*function_p=*/false,
16408 integral_constant_expression_p
);
16409 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
16411 RECUR (TREE_OPERAND (t
, 1)),
16412 complain
|decltype_flag
));
16418 vec
<tree
, va_gc
> *call_args
;
16419 unsigned int nargs
, i
;
16424 function
= CALL_EXPR_FN (t
);
16425 /* When we parsed the expression, we determined whether or
16426 not Koenig lookup should be performed. */
16427 koenig_p
= KOENIG_LOOKUP_P (t
);
16428 if (TREE_CODE (function
) == SCOPE_REF
)
16430 qualified_p
= true;
16431 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
16433 /*address_p=*/false);
16435 else if (koenig_p
&& identifier_p (function
))
16437 /* Do nothing; calling tsubst_copy_and_build on an identifier
16438 would incorrectly perform unqualified lookup again.
16440 Note that we can also have an IDENTIFIER_NODE if the earlier
16441 unqualified lookup found a member function; in that case
16442 koenig_p will be false and we do want to do the lookup
16443 again to find the instantiated member function.
16445 FIXME but doing that causes c++/15272, so we need to stop
16446 using IDENTIFIER_NODE in that situation. */
16447 qualified_p
= false;
16451 if (TREE_CODE (function
) == COMPONENT_REF
)
16453 tree op
= TREE_OPERAND (function
, 1);
16455 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
16456 || (BASELINK_P (op
)
16457 && BASELINK_QUALIFIED_P (op
)));
16460 qualified_p
= false;
16462 if (TREE_CODE (function
) == ADDR_EXPR
16463 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
16464 /* Avoid error about taking the address of a constructor. */
16465 function
= TREE_OPERAND (function
, 0);
16467 function
= tsubst_copy_and_build (function
, args
, complain
,
16470 integral_constant_expression_p
);
16472 if (BASELINK_P (function
))
16473 qualified_p
= true;
16476 nargs
= call_expr_nargs (t
);
16477 call_args
= make_tree_vector ();
16478 for (i
= 0; i
< nargs
; ++i
)
16480 tree arg
= CALL_EXPR_ARG (t
, i
);
16482 if (!PACK_EXPANSION_P (arg
))
16483 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
16486 /* Expand the pack expansion and push each entry onto
16488 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
16489 if (TREE_CODE (arg
) == TREE_VEC
)
16491 unsigned int len
, j
;
16493 len
= TREE_VEC_LENGTH (arg
);
16494 for (j
= 0; j
< len
; ++j
)
16496 tree value
= TREE_VEC_ELT (arg
, j
);
16497 if (value
!= NULL_TREE
)
16498 value
= convert_from_reference (value
);
16499 vec_safe_push (call_args
, value
);
16504 /* A partial substitution. Add one entry. */
16505 vec_safe_push (call_args
, arg
);
16510 /* We do not perform argument-dependent lookup if normal
16511 lookup finds a non-function, in accordance with the
16512 expected resolution of DR 218. */
16514 && ((is_overloaded_fn (function
)
16515 /* If lookup found a member function, the Koenig lookup is
16516 not appropriate, even if an unqualified-name was used
16517 to denote the function. */
16518 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
16519 || identifier_p (function
))
16520 /* Only do this when substitution turns a dependent call
16521 into a non-dependent call. */
16522 && type_dependent_expression_p_push (t
)
16523 && !any_type_dependent_arguments_p (call_args
))
16524 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
16526 if (identifier_p (function
)
16527 && !any_type_dependent_arguments_p (call_args
))
16529 if (koenig_p
&& (complain
& tf_warning_or_error
))
16531 /* For backwards compatibility and good diagnostics, try
16532 the unqualified lookup again if we aren't in SFINAE
16534 tree unq
= (tsubst_copy_and_build
16535 (function
, args
, complain
, in_decl
, true,
16536 integral_constant_expression_p
));
16537 if (unq
== error_mark_node
)
16538 RETURN (error_mark_node
);
16540 if (unq
!= function
)
16543 if (INDIRECT_REF_P (fn
))
16544 fn
= TREE_OPERAND (fn
, 0);
16545 if (TREE_CODE (fn
) == COMPONENT_REF
)
16546 fn
= TREE_OPERAND (fn
, 1);
16547 if (is_overloaded_fn (fn
))
16548 fn
= get_first_fn (fn
);
16549 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
16550 "%qD was not declared in this scope, "
16551 "and no declarations were found by "
16552 "argument-dependent lookup at the point "
16553 "of instantiation", function
))
16556 /* Can't say anything more. */;
16557 else if (DECL_CLASS_SCOPE_P (fn
))
16559 location_t loc
= EXPR_LOC_OR_LOC (t
,
16562 "declarations in dependent base %qT are "
16563 "not found by unqualified lookup",
16564 DECL_CLASS_CONTEXT (fn
));
16565 if (current_class_ptr
)
16567 "use %<this->%D%> instead", function
);
16570 "use %<%T::%D%> instead",
16571 current_class_name
, function
);
16574 inform (DECL_SOURCE_LOCATION (fn
),
16575 "%qD declared here, later in the "
16576 "translation unit", fn
);
16581 if (identifier_p (function
))
16583 if (complain
& tf_error
)
16584 unqualified_name_lookup_error (function
);
16585 release_tree_vector (call_args
);
16586 RETURN (error_mark_node
);
16590 /* Remember that there was a reference to this entity. */
16591 if (DECL_P (function
)
16592 && !mark_used (function
, complain
) && !(complain
& tf_error
))
16593 RETURN (error_mark_node
);
16595 /* Put back tf_decltype for the actual call. */
16596 complain
|= decltype_flag
;
16598 if (TREE_CODE (function
) == OFFSET_REF
)
16599 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
16601 else if (TREE_CODE (function
) == COMPONENT_REF
)
16603 tree instance
= TREE_OPERAND (function
, 0);
16604 tree fn
= TREE_OPERAND (function
, 1);
16606 if (processing_template_decl
16607 && (type_dependent_expression_p (instance
)
16608 || (!BASELINK_P (fn
)
16609 && TREE_CODE (fn
) != FIELD_DECL
)
16610 || type_dependent_expression_p (fn
)
16611 || any_type_dependent_arguments_p (call_args
)))
16612 ret
= build_nt_call_vec (function
, call_args
);
16613 else if (!BASELINK_P (fn
))
16614 ret
= finish_call_expr (function
, &call_args
,
16615 /*disallow_virtual=*/false,
16616 /*koenig_p=*/false,
16619 ret
= (build_new_method_call
16621 &call_args
, NULL_TREE
,
16622 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
16627 ret
= finish_call_expr (function
, &call_args
,
16628 /*disallow_virtual=*/qualified_p
,
16632 release_tree_vector (call_args
);
16639 tree cond
= RECUR (TREE_OPERAND (t
, 0));
16640 tree folded_cond
= fold_non_dependent_expr (cond
);
16643 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
16645 if (integer_zerop (folded_cond
))
16647 ++c_inhibit_evaluation_warnings
;
16648 exp1
= RECUR (TREE_OPERAND (t
, 1));
16649 --c_inhibit_evaluation_warnings
;
16650 exp2
= RECUR (TREE_OPERAND (t
, 2));
16654 exp1
= RECUR (TREE_OPERAND (t
, 1));
16655 ++c_inhibit_evaluation_warnings
;
16656 exp2
= RECUR (TREE_OPERAND (t
, 2));
16657 --c_inhibit_evaluation_warnings
;
16659 cond
= folded_cond
;
16663 exp1
= RECUR (TREE_OPERAND (t
, 1));
16664 exp2
= RECUR (TREE_OPERAND (t
, 2));
16667 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
16668 cond
, exp1
, exp2
, complain
));
16671 case PSEUDO_DTOR_EXPR
:
16673 tree op0
= RECUR (TREE_OPERAND (t
, 0));
16674 tree op1
= RECUR (TREE_OPERAND (t
, 1));
16675 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
16676 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
16682 tree purpose
, value
, chain
;
16684 if (t
== void_list_node
)
16687 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
16688 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
16690 /* We have pack expansions, so expand those and
16691 create a new list out of it. */
16692 tree purposevec
= NULL_TREE
;
16693 tree valuevec
= NULL_TREE
;
16697 /* Expand the argument expressions. */
16698 if (TREE_PURPOSE (t
))
16699 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
16700 complain
, in_decl
);
16701 if (TREE_VALUE (t
))
16702 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
16703 complain
, in_decl
);
16705 /* Build the rest of the list. */
16706 chain
= TREE_CHAIN (t
);
16707 if (chain
&& chain
!= void_type_node
)
16708 chain
= RECUR (chain
);
16710 /* Determine the number of arguments. */
16711 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
16713 len
= TREE_VEC_LENGTH (purposevec
);
16714 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
16716 else if (TREE_CODE (valuevec
) == TREE_VEC
)
16717 len
= TREE_VEC_LENGTH (valuevec
);
16720 /* Since we only performed a partial substitution into
16721 the argument pack, we only RETURN (a single list
16723 if (purposevec
== TREE_PURPOSE (t
)
16724 && valuevec
== TREE_VALUE (t
)
16725 && chain
== TREE_CHAIN (t
))
16728 RETURN (tree_cons (purposevec
, valuevec
, chain
));
16731 /* Convert the argument vectors into a TREE_LIST */
16735 /* Grab the Ith values. */
16737 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
16740 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
16743 /* Build the list (backwards). */
16744 chain
= tree_cons (purpose
, value
, chain
);
16750 purpose
= TREE_PURPOSE (t
);
16752 purpose
= RECUR (purpose
);
16753 value
= TREE_VALUE (t
);
16755 value
= RECUR (value
);
16756 chain
= TREE_CHAIN (t
);
16757 if (chain
&& chain
!= void_type_node
)
16758 chain
= RECUR (chain
);
16759 if (purpose
== TREE_PURPOSE (t
)
16760 && value
== TREE_VALUE (t
)
16761 && chain
== TREE_CHAIN (t
))
16763 RETURN (tree_cons (purpose
, value
, chain
));
16766 case COMPONENT_REF
:
16773 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
16774 args
, complain
, in_decl
);
16775 /* Remember that there was a reference to this entity. */
16776 if (DECL_P (object
)
16777 && !mark_used (object
, complain
) && !(complain
& tf_error
))
16778 RETURN (error_mark_node
);
16779 object_type
= TREE_TYPE (object
);
16781 member
= TREE_OPERAND (t
, 1);
16782 if (BASELINK_P (member
))
16783 member
= tsubst_baselink (member
,
16784 non_reference (TREE_TYPE (object
)),
16785 args
, complain
, in_decl
);
16787 member
= tsubst_copy (member
, args
, complain
, in_decl
);
16788 if (member
== error_mark_node
)
16789 RETURN (error_mark_node
);
16791 if (type_dependent_expression_p (object
))
16792 /* We can't do much here. */;
16793 else if (!CLASS_TYPE_P (object_type
))
16795 if (scalarish_type_p (object_type
))
16797 tree s
= NULL_TREE
;
16798 tree dtor
= member
;
16800 if (TREE_CODE (dtor
) == SCOPE_REF
)
16802 s
= TREE_OPERAND (dtor
, 0);
16803 dtor
= TREE_OPERAND (dtor
, 1);
16805 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
16807 dtor
= TREE_OPERAND (dtor
, 0);
16809 RETURN (finish_pseudo_destructor_expr
16810 (object
, s
, dtor
, input_location
));
16814 else if (TREE_CODE (member
) == SCOPE_REF
16815 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
16817 /* Lookup the template functions now that we know what the
16819 tree scope
= TREE_OPERAND (member
, 0);
16820 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
16821 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
16822 member
= lookup_qualified_name (scope
, tmpl
,
16823 /*is_type_p=*/false,
16824 /*complain=*/false);
16825 if (BASELINK_P (member
))
16827 BASELINK_FUNCTIONS (member
)
16828 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
16830 member
= (adjust_result_of_qualified_name_lookup
16831 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
16836 qualified_name_lookup_error (scope
, tmpl
, member
,
16838 RETURN (error_mark_node
);
16841 else if (TREE_CODE (member
) == SCOPE_REF
16842 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
16843 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
16845 if (complain
& tf_error
)
16847 if (TYPE_P (TREE_OPERAND (member
, 0)))
16848 error ("%qT is not a class or namespace",
16849 TREE_OPERAND (member
, 0));
16851 error ("%qD is not a class or namespace",
16852 TREE_OPERAND (member
, 0));
16854 RETURN (error_mark_node
);
16856 else if (TREE_CODE (member
) == FIELD_DECL
)
16858 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
16859 if (TREE_CODE (r
) == COMPONENT_REF
)
16860 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16864 r
= finish_class_member_access_expr (object
, member
,
16865 /*template_p=*/false,
16867 if (TREE_CODE (r
) == COMPONENT_REF
)
16868 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
16873 RETURN (build_throw
16874 (RECUR (TREE_OPERAND (t
, 0))));
16878 vec
<constructor_elt
, va_gc
> *n
;
16879 constructor_elt
*ce
;
16880 unsigned HOST_WIDE_INT idx
;
16881 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
16882 bool process_index_p
;
16884 bool need_copy_p
= false;
16887 if (type
== error_mark_node
)
16888 RETURN (error_mark_node
);
16890 /* digest_init will do the wrong thing if we let it. */
16891 if (type
&& TYPE_PTRMEMFUNC_P (type
))
16894 /* We do not want to process the index of aggregate
16895 initializers as they are identifier nodes which will be
16896 looked up by digest_init. */
16897 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
16899 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
16900 newlen
= vec_safe_length (n
);
16901 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
16903 if (ce
->index
&& process_index_p
16904 /* An identifier index is looked up in the type
16905 being initialized, not the current scope. */
16906 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
16907 ce
->index
= RECUR (ce
->index
);
16909 if (PACK_EXPANSION_P (ce
->value
))
16911 /* Substitute into the pack expansion. */
16912 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
16915 if (ce
->value
== error_mark_node
16916 || PACK_EXPANSION_P (ce
->value
))
16918 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
16919 /* Just move the argument into place. */
16920 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
16923 /* Update the length of the final CONSTRUCTOR
16924 arguments vector, and note that we will need to
16926 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
16927 need_copy_p
= true;
16931 ce
->value
= RECUR (ce
->value
);
16936 vec
<constructor_elt
, va_gc
> *old_n
= n
;
16938 vec_alloc (n
, newlen
);
16939 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
16941 if (TREE_CODE (ce
->value
) == TREE_VEC
)
16943 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
16944 for (i
= 0; i
< len
; ++i
)
16945 CONSTRUCTOR_APPEND_ELT (n
, 0,
16946 TREE_VEC_ELT (ce
->value
, i
));
16949 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
16953 r
= build_constructor (init_list_type_node
, n
);
16954 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
16956 if (TREE_HAS_CONSTRUCTOR (t
))
16957 RETURN (finish_compound_literal (type
, r
, complain
));
16959 TREE_TYPE (r
) = type
;
16965 tree operand_0
= TREE_OPERAND (t
, 0);
16966 if (TYPE_P (operand_0
))
16968 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
16969 RETURN (get_typeid (operand_0
, complain
));
16973 operand_0
= RECUR (operand_0
);
16974 RETURN (build_typeid (operand_0
, complain
));
16981 else if (DECL_PACK_P (t
))
16983 /* We don't build decls for an instantiation of a
16984 variadic capture proxy, we instantiate the elements
16986 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
16987 return RECUR (DECL_VALUE_EXPR (t
));
16993 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
16994 /* ??? We're doing a subset of finish_id_expression here. */
16996 && !processing_template_decl
16997 && !cp_unevaluated_operand
16998 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
16999 && CP_DECL_THREAD_LOCAL_P (r
))
17001 if (tree wrap
= get_tls_wrapper_fn (r
))
17002 /* Replace an evaluated use of the thread_local variable with
17003 a call to its wrapper. */
17004 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
17006 else if (outer_automatic_var_p (r
))
17008 r
= process_outer_var_ref (r
, complain
);
17009 if (is_capture_proxy (r
))
17010 register_local_specialization (r
, t
);
17013 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
17014 /* If the original type was a reference, we'll be wrapped in
17015 the appropriate INDIRECT_REF. */
17016 r
= convert_from_reference (r
);
17022 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17023 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
17024 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
17027 case OFFSETOF_EXPR
:
17028 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
17029 EXPR_LOCATION (t
)));
17033 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
17034 complain
, in_decl
);
17036 tree type2
= TRAIT_EXPR_TYPE2 (t
);
17037 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
17038 type2
= RECUR (type2
);
17040 type2
= tsubst (type2
, args
, complain
, in_decl
);
17042 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
17047 tree old_stmt_expr
= cur_stmt_expr
;
17048 tree stmt_expr
= begin_stmt_expr ();
17050 cur_stmt_expr
= stmt_expr
;
17051 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
17052 integral_constant_expression_p
);
17053 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
17054 cur_stmt_expr
= old_stmt_expr
;
17056 /* If the resulting list of expression statement is empty,
17057 fold it further into void_node. */
17058 if (empty_expr_stmt_p (stmt_expr
))
17059 stmt_expr
= void_node
;
17061 RETURN (stmt_expr
);
17066 tree r
= build_lambda_expr ();
17068 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
17069 LAMBDA_EXPR_CLOSURE (r
) = type
;
17070 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
17072 LAMBDA_EXPR_LOCATION (r
)
17073 = LAMBDA_EXPR_LOCATION (t
);
17074 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
17075 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
17076 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
17077 LAMBDA_EXPR_DISCRIMINATOR (r
)
17078 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
17079 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
17081 /* No substitution needed. */;
17082 else if (VAR_OR_FUNCTION_DECL_P (scope
))
17083 /* For a function or variable scope, we want to use tsubst so that we
17084 don't complain about referring to an auto before deduction. */
17085 scope
= tsubst (scope
, args
, complain
, in_decl
);
17086 else if (TREE_CODE (scope
) == PARM_DECL
)
17088 /* Look up the parameter we want directly, as tsubst_copy
17089 doesn't do what we need. */
17090 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
17091 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
17092 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
17093 parm
= DECL_CHAIN (parm
);
17095 /* FIXME Work around the parm not having DECL_CONTEXT set. */
17096 if (DECL_CONTEXT (scope
) == NULL_TREE
)
17097 DECL_CONTEXT (scope
) = fn
;
17099 else if (TREE_CODE (scope
) == FIELD_DECL
)
17100 /* For a field, use tsubst_copy so that we look up the existing field
17101 rather than build a new one. */
17102 scope
= RECUR (scope
);
17104 gcc_unreachable ();
17105 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
17107 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
17108 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
17110 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
17111 determine_visibility (TYPE_NAME (type
));
17112 /* Now that we know visibility, instantiate the type so we have a
17113 declaration of the op() for later calls to lambda_function. */
17114 complete_type (type
);
17116 if (tree fn
= lambda_function (type
))
17117 LAMBDA_EXPR_RETURN_TYPE (r
) = TREE_TYPE (TREE_TYPE (fn
));
17119 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
17121 insert_pending_capture_proxies ();
17123 RETURN (build_lambda_object (r
));
17127 /* We can get here for a constant initializer of non-dependent type.
17128 FIXME stop folding in cp_parser_initializer_clause. */
17130 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
17135 case TRANSACTION_EXPR
:
17136 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
17137 integral_constant_expression_p
));
17140 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
17142 case VEC_PERM_EXPR
:
17144 tree op0
= RECUR (TREE_OPERAND (t
, 0));
17145 tree op1
= RECUR (TREE_OPERAND (t
, 1));
17146 tree op2
= RECUR (TREE_OPERAND (t
, 2));
17147 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
17151 case REQUIRES_EXPR
:
17152 RETURN (tsubst_requires_expr (t
, args
, complain
, in_decl
));
17155 /* Handle Objective-C++ constructs, if appropriate. */
17158 = objcp_tsubst_copy_and_build (t
, args
, complain
,
17159 in_decl
, /*function_p=*/false);
17163 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
17169 input_location
= loc
;
17173 /* Verify that the instantiated ARGS are valid. For type arguments,
17174 make sure that the type's linkage is ok. For non-type arguments,
17175 make sure they are constants if they are integral or enumerations.
17176 Emit an error under control of COMPLAIN, and return TRUE on error. */
17179 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
17181 if (dependent_template_arg_p (t
))
17183 if (ARGUMENT_PACK_P (t
))
17185 tree vec
= ARGUMENT_PACK_ARGS (t
);
17186 int len
= TREE_VEC_LENGTH (vec
);
17187 bool result
= false;
17190 for (i
= 0; i
< len
; ++i
)
17191 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
17195 else if (TYPE_P (t
))
17197 /* [basic.link]: A name with no linkage (notably, the name
17198 of a class or enumeration declared in a local scope)
17199 shall not be used to declare an entity with linkage.
17200 This implies that names with no linkage cannot be used as
17203 DR 757 relaxes this restriction for C++0x. */
17204 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
17205 : no_linkage_check (t
, /*relaxed_p=*/false));
17209 /* DR 488 makes use of a type with no linkage cause
17210 type deduction to fail. */
17211 if (complain
& tf_error
)
17213 if (TYPE_ANONYMOUS_P (nt
))
17214 error ("%qT is/uses anonymous type", t
);
17216 error ("template argument for %qD uses local type %qT",
17221 /* In order to avoid all sorts of complications, we do not
17222 allow variably-modified types as template arguments. */
17223 else if (variably_modified_type_p (t
, NULL_TREE
))
17225 if (complain
& tf_error
)
17226 error ("%qT is a variably modified type", t
);
17230 /* Class template and alias template arguments should be OK. */
17231 else if (DECL_TYPE_TEMPLATE_P (t
))
17233 /* A non-type argument of integral or enumerated type must be a
17235 else if (TREE_TYPE (t
)
17236 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
17237 && !REFERENCE_REF_P (t
)
17238 && !TREE_CONSTANT (t
))
17240 if (complain
& tf_error
)
17241 error ("integral expression %qE is not constant", t
);
17248 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
17250 int ix
, len
= DECL_NTPARMS (tmpl
);
17251 bool result
= false;
17253 for (ix
= 0; ix
!= len
; ix
++)
17255 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
17258 if (result
&& (complain
& tf_error
))
17259 error (" trying to instantiate %qD", tmpl
);
17263 /* We're out of SFINAE context now, so generate diagnostics for the access
17264 errors we saw earlier when instantiating D from TMPL and ARGS. */
17267 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
17269 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17270 tree type
= TREE_TYPE (pattern
);
17271 location_t loc
= input_location
;
17273 push_access_scope (d
);
17274 push_deferring_access_checks (dk_no_deferred
);
17275 input_location
= DECL_SOURCE_LOCATION (pattern
);
17276 tsubst (type
, args
, tf_warning_or_error
, d
);
17277 input_location
= loc
;
17278 pop_deferring_access_checks ();
17279 pop_access_scope (d
);
17282 /* Instantiate the indicated variable, function, or alias template TMPL with
17283 the template arguments in TARG_PTR. */
17286 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17288 tree targ_ptr
= orig_args
;
17292 bool access_ok
= true;
17294 if (tmpl
== error_mark_node
)
17295 return error_mark_node
;
17297 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
17299 /* If this function is a clone, handle it specially. */
17300 if (DECL_CLONED_FUNCTION_P (tmpl
))
17305 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
17306 DECL_CLONED_FUNCTION. */
17307 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
17308 targ_ptr
, complain
);
17309 if (spec
== error_mark_node
)
17310 return error_mark_node
;
17312 /* Look for the clone. */
17313 FOR_EACH_CLONE (clone
, spec
)
17314 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
17316 /* We should always have found the clone by now. */
17317 gcc_unreachable ();
17321 if (targ_ptr
== error_mark_node
)
17322 return error_mark_node
;
17324 /* Check to see if we already have this specialization. */
17325 gen_tmpl
= most_general_template (tmpl
);
17326 if (tmpl
!= gen_tmpl
)
17327 /* The TMPL is a partial instantiation. To get a full set of
17328 arguments we must add the arguments used to perform the
17329 partial instantiation. */
17330 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
17333 /* It would be nice to avoid hashing here and then again in tsubst_decl,
17334 but it doesn't seem to be on the hot path. */
17335 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
17337 gcc_assert (tmpl
== gen_tmpl
17338 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
17340 || fndecl
== NULL_TREE
);
17342 if (spec
!= NULL_TREE
)
17344 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
17346 if (complain
& tf_error
)
17347 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
17348 return error_mark_node
;
17353 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
17355 return error_mark_node
;
17357 /* We are building a FUNCTION_DECL, during which the access of its
17358 parameters and return types have to be checked. However this
17359 FUNCTION_DECL which is the desired context for access checking
17360 is not built yet. We solve this chicken-and-egg problem by
17361 deferring all checks until we have the FUNCTION_DECL. */
17362 push_deferring_access_checks (dk_deferred
);
17364 /* Instantiation of the function happens in the context of the function
17365 template, not the context of the overload resolution we're doing. */
17366 push_to_top_level ();
17367 /* If there are dependent arguments, e.g. because we're doing partial
17368 ordering, make sure processing_template_decl stays set. */
17369 if (uses_template_parms (targ_ptr
))
17370 ++processing_template_decl
;
17371 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17373 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
17374 complain
, gen_tmpl
, true);
17375 push_nested_class (ctx
);
17378 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
17380 if (VAR_P (pattern
))
17382 /* We need to determine if we're using a partial or explicit
17383 specialization now, because the type of the variable could be
17385 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
17386 tree elt
= most_specialized_partial_spec (tid
, complain
);
17387 if (elt
== error_mark_node
)
17388 pattern
= error_mark_node
;
17391 tmpl
= TREE_VALUE (elt
);
17392 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
17393 targ_ptr
= TREE_PURPOSE (elt
);
17397 /* Substitute template parameters to obtain the specialization. */
17398 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
17399 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
17400 pop_nested_class ();
17401 pop_from_top_level ();
17403 if (fndecl
== error_mark_node
)
17405 pop_deferring_access_checks ();
17406 return error_mark_node
;
17409 /* The DECL_TI_TEMPLATE should always be the immediate parent
17410 template, not the most general template. */
17411 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
17412 DECL_TI_ARGS (fndecl
) = targ_ptr
;
17414 /* Now we know the specialization, compute access previously
17416 push_access_scope (fndecl
);
17417 if (!perform_deferred_access_checks (complain
))
17419 pop_access_scope (fndecl
);
17420 pop_deferring_access_checks ();
17422 /* If we've just instantiated the main entry point for a function,
17423 instantiate all the alternate entry points as well. We do this
17424 by cloning the instantiation of the main entry point, not by
17425 instantiating the template clones. */
17426 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
17427 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
17431 if (!(complain
& tf_error
))
17433 /* Remember to reinstantiate when we're out of SFINAE so the user
17434 can see the errors. */
17435 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
17437 return error_mark_node
;
17442 /* Wrapper for instantiate_template_1. */
17445 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
17448 timevar_push (TV_TEMPLATE_INST
);
17449 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
17450 timevar_pop (TV_TEMPLATE_INST
);
17454 /* Instantiate the alias template TMPL with ARGS. Also push a template
17455 instantiation level, which instantiate_template doesn't do because
17456 functions and variables have sufficient context established by the
17460 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
17462 struct pending_template
*old_last_pend
= last_pending_template
;
17463 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17464 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
17465 return error_mark_node
;
17466 tree tinst
= build_tree_list (tmpl
, args
);
17467 if (!push_tinst_level (tinst
))
17470 return error_mark_node
;
17474 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
17475 args
, tmpl
, complain
,
17476 /*require_all_args=*/true,
17477 /*use_default_args=*/true);
17479 tree r
= instantiate_template (tmpl
, args
, complain
);
17480 pop_tinst_level ();
17481 /* We can't free this if a pending_template entry or last_error_tinst_level
17482 is pointing at it. */
17483 if (last_pending_template
== old_last_pend
17484 && last_error_tinst_level
== old_error_tinst
)
17490 /* PARM is a template parameter pack for FN. Returns true iff
17491 PARM is used in a deducible way in the argument list of FN. */
17494 pack_deducible_p (tree parm
, tree fn
)
17496 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
17497 for (; t
; t
= TREE_CHAIN (t
))
17499 tree type
= TREE_VALUE (t
);
17501 if (!PACK_EXPANSION_P (type
))
17503 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
17504 packs
; packs
= TREE_CHAIN (packs
))
17505 if (template_args_equal (TREE_VALUE (packs
), parm
))
17507 /* The template parameter pack is used in a function parameter
17508 pack. If this is the end of the parameter list, the
17509 template parameter pack is deducible. */
17510 if (TREE_CHAIN (t
) == void_list_node
)
17513 /* Otherwise, not. Well, it could be deduced from
17514 a non-pack parameter, but doing so would end up with
17515 a deduction mismatch, so don't bother. */
17519 /* The template parameter pack isn't used in any function parameter
17520 packs, but it might be used deeper, e.g. tuple<Args...>. */
17524 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
17525 NARGS elements of the arguments that are being used when calling
17526 it. TARGS is a vector into which the deduced template arguments
17529 Returns either a FUNCTION_DECL for the matching specialization of FN or
17530 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
17531 true, diagnostics will be printed to explain why it failed.
17533 If FN is a conversion operator, or we are trying to produce a specific
17534 specialization, RETURN_TYPE is the return type desired.
17536 The EXPLICIT_TARGS are explicit template arguments provided via a
17539 The parameter STRICT is one of:
17542 We are deducing arguments for a function call, as in
17543 [temp.deduct.call]. If RETURN_TYPE is non-null, we are
17544 deducing arguments for a call to the result of a conversion
17545 function template, as in [over.call.object].
17548 We are deducing arguments for a conversion function, as in
17549 [temp.deduct.conv].
17552 We are deducing arguments when doing an explicit instantiation
17553 as in [temp.explicit], when determining an explicit specialization
17554 as in [temp.expl.spec], or when taking the address of a function
17555 template, as in [temp.deduct.funcaddr]. */
17558 fn_type_unification (tree fn
,
17559 tree explicit_targs
,
17562 unsigned int nargs
,
17564 unification_kind_t strict
,
17571 tree decl
= NULL_TREE
;
17572 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
17574 static int deduction_depth
;
17575 struct pending_template
*old_last_pend
= last_pending_template
;
17576 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
17577 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
17579 tree r
= error_mark_node
;
17582 complain
|= tf_decltype
;
17584 /* In C++0x, it's possible to have a function template whose type depends
17585 on itself recursively. This is most obvious with decltype, but can also
17586 occur with enumeration scope (c++/48969). So we need to catch infinite
17587 recursion and reject the substitution at deduction time; this function
17588 will return error_mark_node for any repeated substitution.
17590 This also catches excessive recursion such as when f<N> depends on
17591 f<N-1> across all integers, and returns error_mark_node for all the
17592 substitutions back up to the initial one.
17594 This is, of course, not reentrant. */
17595 if (excessive_deduction_depth
)
17596 return error_mark_node
;
17597 tinst
= build_tree_list (fn
, NULL_TREE
);
17600 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
17602 fntype
= TREE_TYPE (fn
);
17603 if (explicit_targs
)
17607 The specified template arguments must match the template
17608 parameters in kind (i.e., type, nontype, template), and there
17609 must not be more arguments than there are parameters;
17610 otherwise type deduction fails.
17612 Nontype arguments must match the types of the corresponding
17613 nontype template parameters, or must be convertible to the
17614 types of the corresponding nontype parameters as specified in
17615 _temp.arg.nontype_, otherwise type deduction fails.
17617 All references in the function type of the function template
17618 to the corresponding template parameters are replaced by the
17619 specified template argument values. If a substitution in a
17620 template parameter or in the function type of the function
17621 template results in an invalid type, type deduction fails. */
17622 int i
, len
= TREE_VEC_LENGTH (tparms
);
17623 location_t loc
= input_location
;
17624 bool incomplete
= false;
17626 /* Adjust any explicit template arguments before entering the
17627 substitution context. */
17629 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
17631 /*require_all_args=*/false,
17632 /*use_default_args=*/false));
17633 if (explicit_targs
== error_mark_node
)
17636 /* Substitute the explicit args into the function type. This is
17637 necessary so that, for instance, explicitly declared function
17638 arguments can match null pointed constants. If we were given
17639 an incomplete set of explicit args, we must not do semantic
17640 processing during substitution as we could create partial
17642 for (i
= 0; i
< len
; i
++)
17644 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
17645 bool parameter_pack
= false;
17646 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
17648 /* Dig out the actual parm. */
17649 if (TREE_CODE (parm
) == TYPE_DECL
17650 || TREE_CODE (parm
) == TEMPLATE_DECL
)
17652 parm
= TREE_TYPE (parm
);
17653 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
17655 else if (TREE_CODE (parm
) == PARM_DECL
)
17657 parm
= DECL_INITIAL (parm
);
17658 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
17661 if (!parameter_pack
&& targ
== NULL_TREE
)
17662 /* No explicit argument for this template parameter. */
17665 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
17667 /* Mark the argument pack as "incomplete". We could
17668 still deduce more arguments during unification.
17669 We remove this mark in type_unification_real. */
17672 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
17673 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
17674 = ARGUMENT_PACK_ARGS (targ
);
17677 /* We have some incomplete argument packs. */
17682 TREE_VALUE (tinst
) = explicit_targs
;
17683 if (!push_tinst_level (tinst
))
17685 excessive_deduction_depth
= true;
17688 processing_template_decl
+= incomplete
;
17689 input_location
= DECL_SOURCE_LOCATION (fn
);
17690 /* Ignore any access checks; we'll see them again in
17691 instantiate_template and they might have the wrong
17692 access path at this point. */
17693 push_deferring_access_checks (dk_deferred
);
17694 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
17695 complain
| tf_partial
, NULL_TREE
);
17696 pop_deferring_access_checks ();
17697 input_location
= loc
;
17698 processing_template_decl
-= incomplete
;
17699 pop_tinst_level ();
17701 if (fntype
== error_mark_node
)
17704 /* Place the explicitly specified arguments in TARGS. */
17705 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
17706 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
17709 /* Never do unification on the 'this' parameter. */
17710 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
17712 if (return_type
&& strict
== DEDUCE_CALL
)
17714 /* We're deducing for a call to the result of a template conversion
17715 function. The parms we really want are in return_type. */
17716 if (POINTER_TYPE_P (return_type
))
17717 return_type
= TREE_TYPE (return_type
);
17718 parms
= TYPE_ARG_TYPES (return_type
);
17720 else if (return_type
)
17724 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
17725 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
17726 new_args
[0] = return_type
;
17727 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
17732 /* We allow incomplete unification without an error message here
17733 because the standard doesn't seem to explicitly prohibit it. Our
17734 callers must be ready to deal with unification failures in any
17737 TREE_VALUE (tinst
) = targs
;
17738 /* If we aren't explaining yet, push tinst context so we can see where
17739 any errors (e.g. from class instantiations triggered by instantiation
17740 of default template arguments) come from. If we are explaining, this
17741 context is redundant. */
17742 if (!explain_p
&& !push_tinst_level (tinst
))
17744 excessive_deduction_depth
= true;
17748 /* type_unification_real will pass back any access checks from default
17749 template argument substitution. */
17750 vec
<deferred_access_check
, va_gc
> *checks
;
17753 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17754 targs
, parms
, args
, nargs
, /*subr=*/0,
17755 strict
, flags
, &checks
, explain_p
);
17757 pop_tinst_level ();
17761 /* Now that we have bindings for all of the template arguments,
17762 ensure that the arguments deduced for the template template
17763 parameters have compatible template parameter lists. We cannot
17764 check this property before we have deduced all template
17765 arguments, because the template parameter types of a template
17766 template parameter might depend on prior template parameters
17767 deduced after the template template parameter. The following
17768 ill-formed example illustrates this issue:
17770 template<typename T, template<T> class C> void f(C<5>, T);
17772 template<int N> struct X {};
17775 f(X<5>(), 5l); // error: template argument deduction fails
17778 The template parameter list of 'C' depends on the template type
17779 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
17780 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
17781 time that we deduce 'C'. */
17782 if (!template_template_parm_bindings_ok_p
17783 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
17785 unify_inconsistent_template_template_parameters (explain_p
);
17789 /* All is well so far. Now, check:
17793 When all template arguments have been deduced, all uses of
17794 template parameters in nondeduced contexts are replaced with
17795 the corresponding deduced argument values. If the
17796 substitution results in an invalid type, as described above,
17797 type deduction fails. */
17798 TREE_VALUE (tinst
) = targs
;
17799 if (!push_tinst_level (tinst
))
17801 excessive_deduction_depth
= true;
17805 /* Also collect access checks from the instantiation. */
17806 reopen_deferring_access_checks (checks
);
17808 decl
= instantiate_template (fn
, targs
, complain
);
17810 checks
= get_deferred_access_checks ();
17811 pop_deferring_access_checks ();
17813 pop_tinst_level ();
17815 if (decl
== error_mark_node
)
17818 /* Now perform any access checks encountered during substitution. */
17819 push_access_scope (decl
);
17820 ok
= perform_access_checks (checks
, complain
);
17821 pop_access_scope (decl
);
17825 /* If we're looking for an exact match, check that what we got
17826 is indeed an exact match. It might not be if some template
17827 parameters are used in non-deduced contexts. But don't check
17828 for an exact match if we have dependent template arguments;
17829 in that case we're doing partial ordering, and we already know
17830 that we have two candidates that will provide the actual type. */
17831 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
17833 tree substed
= TREE_TYPE (decl
);
17837 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
17839 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
17840 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
17841 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
17843 unify_type_mismatch (explain_p
, args
[i
],
17844 TREE_VALUE (sarg
));
17853 if (excessive_deduction_depth
)
17855 if (deduction_depth
== 0)
17856 /* Reset once we're all the way out. */
17857 excessive_deduction_depth
= false;
17860 /* We can't free this if a pending_template entry or last_error_tinst_level
17861 is pointing at it. */
17862 if (last_pending_template
== old_last_pend
17863 && last_error_tinst_level
== old_error_tinst
)
17869 /* Adjust types before performing type deduction, as described in
17870 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
17871 sections are symmetric. PARM is the type of a function parameter
17872 or the return type of the conversion function. ARG is the type of
17873 the argument passed to the call, or the type of the value
17874 initialized with the result of the conversion function.
17875 ARG_EXPR is the original argument expression, which may be null. */
17878 maybe_adjust_types_for_deduction (unification_kind_t strict
,
17891 /* Swap PARM and ARG throughout the remainder of this
17892 function; the handling is precisely symmetric since PARM
17893 will initialize ARG rather than vice versa. */
17894 std::swap (parm
, arg
);
17898 /* Core issue #873: Do the DR606 thing (see below) for these cases,
17899 too, but here handle it by stripping the reference from PARM
17900 rather than by adding it to ARG. */
17901 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17902 && TYPE_REF_IS_RVALUE (*parm
)
17903 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17904 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17905 && TREE_CODE (*arg
) == REFERENCE_TYPE
17906 && !TYPE_REF_IS_RVALUE (*arg
))
17907 *parm
= TREE_TYPE (*parm
);
17908 /* Nothing else to do in this case. */
17912 gcc_unreachable ();
17915 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
17917 /* [temp.deduct.call]
17919 If P is not a reference type:
17921 --If A is an array type, the pointer type produced by the
17922 array-to-pointer standard conversion (_conv.array_) is
17923 used in place of A for type deduction; otherwise,
17925 --If A is a function type, the pointer type produced by
17926 the function-to-pointer standard conversion
17927 (_conv.func_) is used in place of A for type deduction;
17930 --If A is a cv-qualified type, the top level
17931 cv-qualifiers of A's type are ignored for type
17933 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
17934 *arg
= build_pointer_type (TREE_TYPE (*arg
));
17935 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
17936 *arg
= build_pointer_type (*arg
);
17938 *arg
= TYPE_MAIN_VARIANT (*arg
);
17941 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
17942 of the form T&&, where T is a template parameter, and the argument
17943 is an lvalue, T is deduced as A& */
17944 if (TREE_CODE (*parm
) == REFERENCE_TYPE
17945 && TYPE_REF_IS_RVALUE (*parm
)
17946 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
17947 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
17948 && (arg_expr
? real_lvalue_p (arg_expr
)
17949 /* try_one_overload doesn't provide an arg_expr, but
17950 functions are always lvalues. */
17951 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
17952 *arg
= build_reference_type (*arg
);
17954 /* [temp.deduct.call]
17956 If P is a cv-qualified type, the top level cv-qualifiers
17957 of P's type are ignored for type deduction. If P is a
17958 reference type, the type referred to by P is used for
17960 *parm
= TYPE_MAIN_VARIANT (*parm
);
17961 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
17963 *parm
= TREE_TYPE (*parm
);
17964 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17967 /* DR 322. For conversion deduction, remove a reference type on parm
17968 too (which has been swapped into ARG). */
17969 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
17970 *arg
= TREE_TYPE (*arg
);
17975 /* Subroutine of unify_one_argument. PARM is a function parameter of a
17976 template which does contain any deducible template parameters; check if
17977 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
17978 unify_one_argument. */
17981 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
17982 int flags
, bool explain_p
)
17987 type
= TREE_TYPE (arg
);
17991 if (same_type_p (parm
, type
))
17992 return unify_success (explain_p
);
17994 if (strict
== DEDUCE_CONV
)
17996 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
17997 explain_p
? tf_warning_or_error
: tf_none
))
17998 return unify_success (explain_p
);
18000 else if (strict
!= DEDUCE_EXACT
)
18002 if (can_convert_arg (parm
, type
,
18003 TYPE_P (arg
) ? NULL_TREE
: arg
,
18004 flags
, explain_p
? tf_warning_or_error
: tf_none
))
18005 return unify_success (explain_p
);
18008 if (strict
== DEDUCE_EXACT
)
18009 return unify_type_mismatch (explain_p
, parm
, arg
);
18011 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
18014 static bool uses_deducible_template_parms (tree type
);
18016 /* Returns true iff the expression EXPR is one from which a template
18017 argument can be deduced. In other words, if it's an undecorated
18018 use of a template non-type parameter. */
18021 deducible_expression (tree expr
)
18023 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
18026 /* Returns true iff the array domain DOMAIN uses a template parameter in a
18027 deducible way; that is, if it has a max value of <PARM> - 1. */
18030 deducible_array_bound (tree domain
)
18032 if (domain
== NULL_TREE
)
18035 tree max
= TYPE_MAX_VALUE (domain
);
18036 if (TREE_CODE (max
) != MINUS_EXPR
)
18039 return deducible_expression (TREE_OPERAND (max
, 0));
18042 /* Returns true iff the template arguments ARGS use a template parameter
18043 in a deducible way. */
18046 deducible_template_args (tree args
)
18048 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
18051 tree elt
= TREE_VEC_ELT (args
, i
);
18052 if (ARGUMENT_PACK_P (elt
))
18053 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
18056 if (PACK_EXPANSION_P (elt
))
18057 elt
= PACK_EXPANSION_PATTERN (elt
);
18058 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
18060 else if (TYPE_P (elt
))
18061 deducible
= uses_deducible_template_parms (elt
);
18063 deducible
= deducible_expression (elt
);
18071 /* Returns true iff TYPE contains any deducible references to template
18072 parameters, as per 14.8.2.5. */
18075 uses_deducible_template_parms (tree type
)
18077 if (PACK_EXPANSION_P (type
))
18078 type
= PACK_EXPANSION_PATTERN (type
);
18085 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
18086 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18092 if (POINTER_TYPE_P (type
))
18093 return uses_deducible_template_parms (TREE_TYPE (type
));
18095 /* T[integer-constant ]
18097 if (TREE_CODE (type
) == ARRAY_TYPE
)
18098 return (uses_deducible_template_parms (TREE_TYPE (type
))
18099 || deducible_array_bound (TYPE_DOMAIN (type
)));
18111 if (TYPE_PTRMEM_P (type
))
18112 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
18113 || (uses_deducible_template_parms
18114 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
18116 /* template-name <T> (where template-name refers to a class template)
18117 template-name <i> (where template-name refers to a class template) */
18118 if (CLASS_TYPE_P (type
)
18119 && CLASSTYPE_TEMPLATE_INFO (type
)
18120 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
18121 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
18122 (CLASSTYPE_TI_ARGS (type
)));
18127 if (TREE_CODE (type
) == FUNCTION_TYPE
18128 || TREE_CODE (type
) == METHOD_TYPE
)
18130 if (uses_deducible_template_parms (TREE_TYPE (type
)))
18132 tree parm
= TYPE_ARG_TYPES (type
);
18133 if (TREE_CODE (type
) == METHOD_TYPE
)
18134 parm
= TREE_CHAIN (parm
);
18135 for (; parm
; parm
= TREE_CHAIN (parm
))
18136 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
18143 /* Subroutine of type_unification_real and unify_pack_expansion to
18144 handle unification of a single P/A pair. Parameters are as
18145 for those functions. */
18148 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
18149 int subr
, unification_kind_t strict
,
18152 tree arg_expr
= NULL_TREE
;
18155 if (arg
== error_mark_node
|| parm
== error_mark_node
)
18156 return unify_invalid (explain_p
);
18157 if (arg
== unknown_type_node
)
18158 /* We can't deduce anything from this, but we might get all the
18159 template args from other function args. */
18160 return unify_success (explain_p
);
18162 /* Implicit conversions (Clause 4) will be performed on a function
18163 argument to convert it to the type of the corresponding function
18164 parameter if the parameter type contains no template-parameters that
18165 participate in template argument deduction. */
18166 if (strict
!= DEDUCE_EXACT
18167 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
18168 /* For function parameters with no deducible template parameters,
18169 just return. We'll check non-dependent conversions later. */
18170 return unify_success (explain_p
);
18175 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
18176 | UNIFY_ALLOW_MORE_CV_QUAL
18177 | UNIFY_ALLOW_DERIVED
);
18181 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
18185 arg_strict
= UNIFY_ALLOW_NONE
;
18189 gcc_unreachable ();
18192 /* We only do these transformations if this is the top-level
18193 parameter_type_list in a call or declaration matching; in other
18194 situations (nested function declarators, template argument lists) we
18195 won't be comparing a type to an expression, and we don't do any type
18201 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
18202 if (type_unknown_p (arg
))
18204 /* [temp.deduct.type] A template-argument can be
18205 deduced from a pointer to function or pointer
18206 to member function argument if the set of
18207 overloaded functions does not contain function
18208 templates and at most one of a set of
18209 overloaded functions provides a unique
18212 if (resolve_overloaded_unification
18213 (tparms
, targs
, parm
, arg
, strict
,
18214 arg_strict
, explain_p
))
18215 return unify_success (explain_p
);
18216 return unify_overload_resolution_failure (explain_p
, arg
);
18220 arg
= unlowered_expr_type (arg
);
18221 if (arg
== error_mark_node
)
18222 return unify_invalid (explain_p
);
18226 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
18229 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
18230 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
18231 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18233 /* For deduction from an init-list we need the actual list. */
18234 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
18236 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
18239 /* Most parms like fn_type_unification.
18241 If SUBR is 1, we're being called recursively (to unify the
18242 arguments of a function or method parameter of a function
18245 CHECKS is a pointer to a vector of access checks encountered while
18246 substituting default template arguments. */
18249 type_unification_real (tree tparms
,
18253 unsigned int xnargs
,
18255 unification_kind_t strict
,
18257 vec
<deferred_access_check
, va_gc
> **checks
,
18262 int ntparms
= TREE_VEC_LENGTH (tparms
);
18263 int saw_undeduced
= 0;
18266 unsigned int nargs
;
18269 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
18270 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
18271 gcc_assert (ntparms
> 0);
18273 /* Reset the number of non-defaulted template arguments contained
18275 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
18283 while (parms
&& parms
!= void_list_node
18286 parm
= TREE_VALUE (parms
);
18288 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18289 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
18290 /* For a function parameter pack that occurs at the end of the
18291 parameter-declaration-list, the type A of each remaining
18292 argument of the call is compared with the type P of the
18293 declarator-id of the function parameter pack. */
18296 parms
= TREE_CHAIN (parms
);
18298 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18299 /* For a function parameter pack that does not occur at the
18300 end of the parameter-declaration-list, the type of the
18301 parameter pack is a non-deduced context. */
18307 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
18313 && parms
!= void_list_node
18314 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
18316 /* Unify the remaining arguments with the pack expansion type. */
18318 tree parmvec
= make_tree_vec (1);
18320 /* Allocate a TREE_VEC and copy in all of the arguments */
18321 argvec
= make_tree_vec (nargs
- ia
);
18322 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
18323 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
18325 /* Copy the parameter into parmvec. */
18326 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
18327 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
18328 /*subr=*/subr
, explain_p
))
18331 /* Advance to the end of the list of parameters. */
18332 parms
= TREE_CHAIN (parms
);
18335 /* Fail if we've reached the end of the parm list, and more args
18336 are present, and the parm list isn't variadic. */
18337 if (ia
< nargs
&& parms
== void_list_node
)
18338 return unify_too_many_arguments (explain_p
, nargs
, ia
);
18339 /* Fail if parms are left and they don't have default values and
18340 they aren't all deduced as empty packs (c++/57397). This is
18341 consistent with sufficient_parms_p. */
18342 if (parms
&& parms
!= void_list_node
18343 && TREE_PURPOSE (parms
) == NULL_TREE
)
18345 unsigned int count
= nargs
;
18350 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
18353 p
= TREE_CHAIN (p
);
18355 while (p
&& p
!= void_list_node
);
18356 if (count
!= nargs
)
18357 return unify_too_few_arguments (explain_p
, ia
, count
,
18363 tsubst_flags_t complain
= (explain_p
18364 ? tf_warning_or_error
18367 for (i
= 0; i
< ntparms
; i
++)
18369 tree targ
= TREE_VEC_ELT (targs
, i
);
18370 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18372 /* Clear the "incomplete" flags on all argument packs now so that
18373 substituting them into later default arguments works. */
18374 if (targ
&& ARGUMENT_PACK_P (targ
))
18376 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
18377 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
18380 if (targ
|| tparm
== error_mark_node
)
18382 tparm
= TREE_VALUE (tparm
);
18384 /* If this is an undeduced nontype parameter that depends on
18385 a type parameter, try another pass; its type may have been
18386 deduced from a later argument than the one from which
18387 this parameter can be deduced. */
18388 if (TREE_CODE (tparm
) == PARM_DECL
18389 && uses_template_parms (TREE_TYPE (tparm
))
18390 && saw_undeduced
< 2)
18396 /* Core issue #226 (C++0x) [temp.deduct]:
18398 If a template argument has not been deduced, its
18399 default template argument, if any, is used.
18401 When we are in C++98 mode, TREE_PURPOSE will either
18402 be NULL_TREE or ERROR_MARK_NODE, so we do not need
18403 to explicitly check cxx_dialect here. */
18404 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
18405 /* OK, there is a default argument. Wait until after the
18406 conversion check to do substitution. */
18409 /* If the type parameter is a parameter pack, then it will
18410 be deduced to an empty parameter pack. */
18411 if (template_parameter_pack_p (tparm
))
18415 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
18417 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
18418 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
18419 TREE_CONSTANT (arg
) = 1;
18422 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
18424 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
18426 TREE_VEC_ELT (targs
, i
) = arg
;
18430 return unify_parameter_deduction_failure (explain_p
, tparm
);
18433 /* DR 1391: All parameters have args, now check non-dependent parms for
18435 if (saw_undeduced
< 2)
18436 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
18437 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
18439 parm
= TREE_VALUE (parms
);
18441 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
18442 && (!TREE_CHAIN (parms
)
18443 || TREE_CHAIN (parms
) == void_list_node
))
18444 /* For a function parameter pack that occurs at the end of the
18445 parameter-declaration-list, the type A of each remaining
18446 argument of the call is compared with the type P of the
18447 declarator-id of the function parameter pack. */
18450 parms
= TREE_CHAIN (parms
);
18452 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
18453 /* For a function parameter pack that does not occur at the
18454 end of the parameter-declaration-list, the type of the
18455 parameter pack is a non-deduced context. */
18461 if (uses_template_parms (parm
))
18463 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
18468 /* Now substitute into the default template arguments. */
18469 for (i
= 0; i
< ntparms
; i
++)
18471 tree targ
= TREE_VEC_ELT (targs
, i
);
18472 tree tparm
= TREE_VEC_ELT (tparms
, i
);
18474 if (targ
|| tparm
== error_mark_node
)
18476 tree parm
= TREE_VALUE (tparm
);
18478 if (TREE_CODE (parm
) == PARM_DECL
18479 && uses_template_parms (TREE_TYPE (parm
))
18480 && saw_undeduced
< 2)
18483 tree arg
= TREE_PURPOSE (tparm
);
18484 reopen_deferring_access_checks (*checks
);
18485 location_t save_loc
= input_location
;
18487 input_location
= DECL_SOURCE_LOCATION (parm
);
18488 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
18489 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
18491 input_location
= save_loc
;
18492 *checks
= get_deferred_access_checks ();
18493 pop_deferring_access_checks ();
18494 if (arg
== error_mark_node
)
18498 TREE_VEC_ELT (targs
, i
) = arg
;
18499 /* The position of the first default template argument,
18500 is also the number of non-defaulted arguments in TARGS.
18502 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18503 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
18508 if (saw_undeduced
++ == 1)
18512 if (CHECKING_P
&& !NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
18513 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
18515 return unify_success (explain_p
);
18518 /* Subroutine of type_unification_real. Args are like the variables
18519 at the call site. ARG is an overloaded function (or template-id);
18520 we try deducing template args from each of the overloads, and if
18521 only one succeeds, we go with that. Modifies TARGS and returns
18522 true on success. */
18525 resolve_overloaded_unification (tree tparms
,
18529 unification_kind_t strict
,
18533 tree tempargs
= copy_node (targs
);
18535 tree goodfn
= NULL_TREE
;
18538 if (TREE_CODE (arg
) == ADDR_EXPR
)
18540 arg
= TREE_OPERAND (arg
, 0);
18546 if (TREE_CODE (arg
) == COMPONENT_REF
)
18547 /* Handle `&x' where `x' is some static or non-static member
18549 arg
= TREE_OPERAND (arg
, 1);
18551 if (TREE_CODE (arg
) == OFFSET_REF
)
18552 arg
= TREE_OPERAND (arg
, 1);
18554 /* Strip baselink information. */
18555 if (BASELINK_P (arg
))
18556 arg
= BASELINK_FUNCTIONS (arg
);
18558 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
18560 /* If we got some explicit template args, we need to plug them into
18561 the affected templates before we try to unify, in case the
18562 explicit args will completely resolve the templates in question. */
18565 tree expl_subargs
= TREE_OPERAND (arg
, 1);
18566 arg
= TREE_OPERAND (arg
, 0);
18568 for (; arg
; arg
= OVL_NEXT (arg
))
18570 tree fn
= OVL_CURRENT (arg
);
18571 tree subargs
, elem
;
18573 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18576 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18577 expl_subargs
, NULL_TREE
, tf_none
,
18578 /*require_all_args=*/true,
18579 /*use_default_args=*/true);
18580 if (subargs
!= error_mark_node
18581 && !any_dependent_template_arguments_p (subargs
))
18583 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
18584 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18585 elem
, strict
, sub_strict
, addr_p
, explain_p
)
18586 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
18595 /* If no templates (or more than one) are fully resolved by the
18596 explicit arguments, this template-id is a non-deduced context; it
18597 could still be OK if we deduce all template arguments for the
18598 enclosing call through other arguments. */
18602 else if (TREE_CODE (arg
) != OVERLOAD
18603 && TREE_CODE (arg
) != FUNCTION_DECL
)
18604 /* If ARG is, for example, "(0, &f)" then its type will be unknown
18605 -- but the deduction does not succeed because the expression is
18606 not just the function on its own. */
18609 for (; arg
; arg
= OVL_NEXT (arg
))
18610 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
18611 TREE_TYPE (OVL_CURRENT (arg
)),
18612 strict
, sub_strict
, addr_p
, explain_p
)
18613 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
18615 goodfn
= OVL_CURRENT (arg
);
18619 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18620 to function or pointer to member function argument if the set of
18621 overloaded functions does not contain function templates and at most
18622 one of a set of overloaded functions provides a unique match.
18624 So if we found multiple possibilities, we return success but don't
18625 deduce anything. */
18629 int i
= TREE_VEC_LENGTH (targs
);
18631 if (TREE_VEC_ELT (tempargs
, i
))
18633 tree old
= TREE_VEC_ELT (targs
, i
);
18634 tree new_
= TREE_VEC_ELT (tempargs
, i
);
18635 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
18636 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
18637 /* Don't forget explicit template arguments in a pack. */
18638 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
18639 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
18640 TREE_VEC_ELT (targs
, i
) = new_
;
18649 /* Core DR 115: In contexts where deduction is done and fails, or in
18650 contexts where deduction is not done, if a template argument list is
18651 specified and it, along with any default template arguments, identifies
18652 a single function template specialization, then the template-id is an
18653 lvalue for the function template specialization. */
18656 resolve_nondeduced_context (tree orig_expr
, tsubst_flags_t complain
)
18658 tree expr
, offset
, baselink
;
18661 if (!type_unknown_p (orig_expr
))
18666 offset
= NULL_TREE
;
18667 baselink
= NULL_TREE
;
18669 if (TREE_CODE (expr
) == ADDR_EXPR
)
18671 expr
= TREE_OPERAND (expr
, 0);
18674 if (TREE_CODE (expr
) == OFFSET_REF
)
18677 expr
= TREE_OPERAND (expr
, 1);
18679 if (BASELINK_P (expr
))
18682 expr
= BASELINK_FUNCTIONS (expr
);
18685 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
18688 tree goodfn
= NULL_TREE
;
18690 /* If we got some explicit template args, we need to plug them into
18691 the affected templates before we try to unify, in case the
18692 explicit args will completely resolve the templates in question. */
18694 tree expl_subargs
= TREE_OPERAND (expr
, 1);
18695 tree arg
= TREE_OPERAND (expr
, 0);
18696 tree badfn
= NULL_TREE
;
18697 tree badargs
= NULL_TREE
;
18699 for (; arg
; arg
= OVL_NEXT (arg
))
18701 tree fn
= OVL_CURRENT (arg
);
18702 tree subargs
, elem
;
18704 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
18707 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
18708 expl_subargs
, NULL_TREE
, tf_none
,
18709 /*require_all_args=*/true,
18710 /*use_default_args=*/true);
18711 if (subargs
!= error_mark_node
18712 && !any_dependent_template_arguments_p (subargs
))
18714 elem
= instantiate_template (fn
, subargs
, tf_none
);
18715 if (elem
== error_mark_node
)
18720 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
18729 mark_used (goodfn
);
18732 expr
= build_baselink (BASELINK_BINFO (baselink
),
18733 BASELINK_ACCESS_BINFO (baselink
),
18734 expr
, BASELINK_OPTYPE (baselink
));
18738 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
18739 expr
= build_offset_ref (base
, expr
, addr
, complain
);
18742 expr
= cp_build_addr_expr (expr
, complain
);
18745 else if (good
== 0 && badargs
&& (complain
& tf_error
))
18746 /* There were no good options and at least one bad one, so let the
18747 user know what the problem is. */
18748 instantiate_template (badfn
, badargs
, complain
);
18753 /* Subroutine of resolve_overloaded_unification; does deduction for a single
18754 overload. Fills TARGS with any deduced arguments, or error_mark_node if
18755 different overloads deduce different arguments for a given parm.
18756 ADDR_P is true if the expression for which deduction is being
18757 performed was of the form "& fn" rather than simply "fn".
18759 Returns 1 on success. */
18762 try_one_overload (tree tparms
,
18767 unification_kind_t strict
,
18776 if (arg
== error_mark_node
)
18779 /* [temp.deduct.type] A template-argument can be deduced from a pointer
18780 to function or pointer to member function argument if the set of
18781 overloaded functions does not contain function templates and at most
18782 one of a set of overloaded functions provides a unique match.
18784 So if this is a template, just return success. */
18786 if (uses_template_parms (arg
))
18789 if (TREE_CODE (arg
) == METHOD_TYPE
)
18790 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
18792 arg
= build_pointer_type (arg
);
18794 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
18796 /* We don't copy orig_targs for this because if we have already deduced
18797 some template args from previous args, unify would complain when we
18798 try to deduce a template parameter for the same argument, even though
18799 there isn't really a conflict. */
18800 nargs
= TREE_VEC_LENGTH (targs
);
18801 tempargs
= make_tree_vec (nargs
);
18803 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
18806 /* First make sure we didn't deduce anything that conflicts with
18807 explicitly specified args. */
18808 for (i
= nargs
; i
--; )
18810 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18811 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
18815 else if (uses_template_parms (elt
))
18816 /* Since we're unifying against ourselves, we will fill in
18817 template args used in the function parm list with our own
18818 template parms. Discard them. */
18819 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
18820 else if (oldelt
&& ARGUMENT_PACK_P (oldelt
))
18822 /* Check that the argument at each index of the deduced argument pack
18823 is equivalent to the corresponding explicitly specified argument.
18824 We may have deduced more arguments than were explicitly specified,
18826 gcc_assert (ARGUMENT_PACK_INCOMPLETE_P (oldelt
));
18827 gcc_assert (ARGUMENT_PACK_ARGS (oldelt
)
18828 == ARGUMENT_PACK_EXPLICIT_ARGS (oldelt
));
18830 tree explicit_pack
= ARGUMENT_PACK_ARGS (oldelt
);
18831 tree deduced_pack
= ARGUMENT_PACK_ARGS (elt
);
18833 if (TREE_VEC_LENGTH (deduced_pack
)
18834 < TREE_VEC_LENGTH (explicit_pack
))
18837 for (int j
= 0; j
< TREE_VEC_LENGTH (explicit_pack
); j
++)
18838 if (!template_args_equal (TREE_VEC_ELT (explicit_pack
, j
),
18839 TREE_VEC_ELT (deduced_pack
, j
)))
18842 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
18846 for (i
= nargs
; i
--; )
18848 tree elt
= TREE_VEC_ELT (tempargs
, i
);
18851 TREE_VEC_ELT (targs
, i
) = elt
;
18857 /* PARM is a template class (perhaps with unbound template
18858 parameters). ARG is a fully instantiated type. If ARG can be
18859 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
18860 TARGS are as for unify. */
18863 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
18866 tree copy_of_targs
;
18868 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
18869 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
18870 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
18873 /* We need to make a new template argument vector for the call to
18874 unify. If we used TARGS, we'd clutter it up with the result of
18875 the attempted unification, even if this class didn't work out.
18876 We also don't want to commit ourselves to all the unifications
18877 we've already done, since unification is supposed to be done on
18878 an argument-by-argument basis. In other words, consider the
18879 following pathological case:
18881 template <int I, int J, int K>
18884 template <int I, int J>
18885 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
18887 template <int I, int J, int K>
18888 void f(S<I, J, K>, S<I, I, I>);
18897 Now, by the time we consider the unification involving `s2', we
18898 already know that we must have `f<0, 0, 0>'. But, even though
18899 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
18900 because there are two ways to unify base classes of S<0, 1, 2>
18901 with S<I, I, I>. If we kept the already deduced knowledge, we
18902 would reject the possibility I=1. */
18903 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
18905 /* If unification failed, we're done. */
18906 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
18907 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
18913 /* Given a template type PARM and a class type ARG, find the unique
18914 base type in ARG that is an instance of PARM. We do not examine
18915 ARG itself; only its base-classes. If there is not exactly one
18916 appropriate base class, return NULL_TREE. PARM may be the type of
18917 a partial specialization, as well as a plain template type. Used
18920 static enum template_base_result
18921 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
18922 bool explain_p
, tree
*result
)
18924 tree rval
= NULL_TREE
;
18927 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
18929 binfo
= TYPE_BINFO (complete_type (arg
));
18932 /* The type could not be completed. */
18933 *result
= NULL_TREE
;
18934 return tbr_incomplete_type
;
18937 /* Walk in inheritance graph order. The search order is not
18938 important, and this avoids multiple walks of virtual bases. */
18939 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
18941 tree r
= try_class_unification (tparms
, targs
, parm
,
18942 BINFO_TYPE (binfo
), explain_p
);
18946 /* If there is more than one satisfactory baseclass, then:
18950 If they yield more than one possible deduced A, the type
18954 if (rval
&& !same_type_p (r
, rval
))
18956 *result
= NULL_TREE
;
18957 return tbr_ambiguous_baseclass
;
18965 return tbr_success
;
18968 /* Returns the level of DECL, which declares a template parameter. */
18971 template_decl_level (tree decl
)
18973 switch (TREE_CODE (decl
))
18976 case TEMPLATE_DECL
:
18977 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
18980 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
18983 gcc_unreachable ();
18988 /* Decide whether ARG can be unified with PARM, considering only the
18989 cv-qualifiers of each type, given STRICT as documented for unify.
18990 Returns nonzero iff the unification is OK on that basis. */
18993 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
18995 int arg_quals
= cp_type_quals (arg
);
18996 int parm_quals
= cp_type_quals (parm
);
18998 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18999 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
19001 /* Although a CVR qualifier is ignored when being applied to a
19002 substituted template parameter ([8.3.2]/1 for example), that
19003 does not allow us to unify "const T" with "int&" because both
19004 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
19005 It is ok when we're allowing additional CV qualifiers
19006 at the outer level [14.8.2.1]/3,1st bullet. */
19007 if ((TREE_CODE (arg
) == REFERENCE_TYPE
19008 || TREE_CODE (arg
) == FUNCTION_TYPE
19009 || TREE_CODE (arg
) == METHOD_TYPE
)
19010 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
19013 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
19014 && (parm_quals
& TYPE_QUAL_RESTRICT
))
19018 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
19019 && (arg_quals
& parm_quals
) != parm_quals
)
19022 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
19023 && (parm_quals
& arg_quals
) != arg_quals
)
19029 /* Determines the LEVEL and INDEX for the template parameter PARM. */
19031 template_parm_level_and_index (tree parm
, int* level
, int* index
)
19033 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19034 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19035 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19037 *index
= TEMPLATE_TYPE_IDX (parm
);
19038 *level
= TEMPLATE_TYPE_LEVEL (parm
);
19042 *index
= TEMPLATE_PARM_IDX (parm
);
19043 *level
= TEMPLATE_PARM_LEVEL (parm
);
19047 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
19049 if (unify (TP, TA, P, A, S, EP)) \
19053 /* Unifies the remaining arguments in PACKED_ARGS with the pack
19054 expansion at the end of PACKED_PARMS. Returns 0 if the type
19055 deduction succeeds, 1 otherwise. STRICT is the same as in
19056 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
19057 call argument list. We'll need to adjust the arguments to make them
19058 types. SUBR tells us if this is from a recursive call to
19059 type_unification_real, or for comparing two template argument
19063 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
19064 tree packed_args
, unification_kind_t strict
,
19065 bool subr
, bool explain_p
)
19068 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
19069 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
19070 tree pack
, packs
= NULL_TREE
;
19071 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
19073 packed_args
= expand_template_argument_pack (packed_args
);
19075 int len
= TREE_VEC_LENGTH (packed_args
);
19077 /* Determine the parameter packs we will be deducing from the
19078 pattern, and record their current deductions. */
19079 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
19080 pack
; pack
= TREE_CHAIN (pack
))
19082 tree parm_pack
= TREE_VALUE (pack
);
19085 /* Determine the index and level of this parameter pack. */
19086 template_parm_level_and_index (parm_pack
, &level
, &idx
);
19088 /* Keep track of the parameter packs and their corresponding
19090 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
19091 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
19094 /* Loop through all of the arguments that have not yet been
19095 unified and unify each with the pattern. */
19096 for (i
= start
; i
< len
; i
++)
19099 bool any_explicit
= false;
19100 tree arg
= TREE_VEC_ELT (packed_args
, i
);
19102 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
19103 or the element of its argument pack at the current index if
19104 this argument was explicitly specified. */
19105 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19109 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19112 if (TREE_VALUE (pack
)
19113 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
19114 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
19116 any_explicit
= true;
19117 arg
= TREE_VEC_ELT (pargs
, i
- start
);
19119 TMPL_ARG (targs
, level
, idx
) = arg
;
19122 /* If we had explicit template arguments, substitute them into the
19123 pattern before deduction. */
19126 /* Some arguments might still be unspecified or dependent. */
19128 ++processing_template_decl
;
19129 dependent
= any_dependent_template_arguments_p (targs
);
19131 --processing_template_decl
;
19132 parm
= tsubst (pattern
, targs
,
19133 explain_p
? tf_warning_or_error
: tf_none
,
19136 --processing_template_decl
;
19137 if (parm
== error_mark_node
)
19143 /* Unify the pattern with the current argument. */
19144 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
19148 /* For each parameter pack, collect the deduced value. */
19149 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19152 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19154 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
19155 TMPL_ARG (targs
, level
, idx
);
19159 /* Verify that the results of unification with the parameter packs
19160 produce results consistent with what we've seen before, and make
19161 the deduced argument packs available. */
19162 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
19164 tree old_pack
= TREE_VALUE (pack
);
19165 tree new_args
= TREE_TYPE (pack
);
19166 int i
, len
= TREE_VEC_LENGTH (new_args
);
19168 bool nondeduced_p
= false;
19170 /* By default keep the original deduced argument pack.
19171 If necessary, more specific code is going to update the
19172 resulting deduced argument later down in this function. */
19173 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
19174 TMPL_ARG (targs
, level
, idx
) = old_pack
;
19176 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
19177 actually deduce anything. */
19178 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
19179 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
19180 nondeduced_p
= true;
19184 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
19186 /* If we had fewer function args than explicit template args,
19187 just use the explicits. */
19188 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19189 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
19190 if (len
< explicit_len
)
19191 new_args
= explicit_args
;
19197 /* Build the deduced *_ARGUMENT_PACK. */
19198 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
19200 result
= make_node (NONTYPE_ARGUMENT_PACK
);
19201 TREE_TYPE (result
) =
19202 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
19203 TREE_CONSTANT (result
) = 1;
19206 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
19208 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
19210 /* Note the deduced argument packs for this parameter
19212 TMPL_ARG (targs
, level
, idx
) = result
;
19214 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
19215 && (ARGUMENT_PACK_ARGS (old_pack
)
19216 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
19218 /* We only had the explicitly-provided arguments before, but
19219 now we have a complete set of arguments. */
19220 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
19222 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
19223 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
19224 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
19228 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
19229 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
19231 if (!comp_template_args (old_args
, new_args
,
19232 &bad_old_arg
, &bad_new_arg
))
19233 /* Inconsistent unification of this parameter pack. */
19234 return unify_parameter_pack_inconsistent (explain_p
,
19240 return unify_success (explain_p
);
19243 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
19244 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
19245 parameters and return value are as for unify. */
19248 unify_array_domain (tree tparms
, tree targs
,
19249 tree parm_dom
, tree arg_dom
,
19257 /* Our representation of array types uses "N - 1" as the
19258 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
19259 not an integer constant. We cannot unify arbitrarily
19260 complex expressions, so we eliminate the MINUS_EXPRs
19262 parm_max
= TYPE_MAX_VALUE (parm_dom
);
19263 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
19266 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
19267 parm_max
= TREE_OPERAND (parm_max
, 0);
19269 arg_max
= TYPE_MAX_VALUE (arg_dom
);
19270 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
19273 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
19274 trying to unify the type of a variable with the type
19275 of a template parameter. For example:
19277 template <unsigned int N>
19278 void f (char (&) [N]);
19285 Here, the type of the ARG will be "int [g(i)]", and
19286 may be a SAVE_EXPR, etc. */
19287 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
19288 return unify_vla_arg (explain_p
, arg_dom
);
19289 arg_max
= TREE_OPERAND (arg_max
, 0);
19292 /* If only one of the bounds used a MINUS_EXPR, compensate
19293 by adding one to the other bound. */
19294 if (parm_cst
&& !arg_cst
)
19295 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19299 else if (arg_cst
&& !parm_cst
)
19300 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
19305 return unify (tparms
, targs
, parm_max
, arg_max
,
19306 UNIFY_ALLOW_INTEGER
, explain_p
);
19309 /* Deduce the value of template parameters. TPARMS is the (innermost)
19310 set of template parameters to a template. TARGS is the bindings
19311 for those template parameters, as determined thus far; TARGS may
19312 include template arguments for outer levels of template parameters
19313 as well. PARM is a parameter to a template function, or a
19314 subcomponent of that parameter; ARG is the corresponding argument.
19315 This function attempts to match PARM with ARG in a manner
19316 consistent with the existing assignments in TARGS. If more values
19317 are deduced, then TARGS is updated.
19319 Returns 0 if the type deduction succeeds, 1 otherwise. The
19320 parameter STRICT is a bitwise or of the following flags:
19323 Require an exact match between PARM and ARG.
19324 UNIFY_ALLOW_MORE_CV_QUAL:
19325 Allow the deduced ARG to be more cv-qualified (by qualification
19326 conversion) than ARG.
19327 UNIFY_ALLOW_LESS_CV_QUAL:
19328 Allow the deduced ARG to be less cv-qualified than ARG.
19329 UNIFY_ALLOW_DERIVED:
19330 Allow the deduced ARG to be a template base class of ARG,
19331 or a pointer to a template base class of the type pointed to by
19333 UNIFY_ALLOW_INTEGER:
19334 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
19335 case for more information.
19336 UNIFY_ALLOW_OUTER_LEVEL:
19337 This is the outermost level of a deduction. Used to determine validity
19338 of qualification conversions. A valid qualification conversion must
19339 have const qualified pointers leading up to the inner type which
19340 requires additional CV quals, except at the outer level, where const
19341 is not required [conv.qual]. It would be normal to set this flag in
19342 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
19343 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
19344 This is the outermost level of a deduction, and PARM can be more CV
19345 qualified at this point.
19346 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
19347 This is the outermost level of a deduction, and PARM can be less CV
19348 qualified at this point. */
19351 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
19357 int strict_in
= strict
;
19359 /* I don't think this will do the right thing with respect to types.
19360 But the only case I've seen it in so far has been array bounds, where
19361 signedness is the only information lost, and I think that will be
19363 while (TREE_CODE (parm
) == NOP_EXPR
)
19364 parm
= TREE_OPERAND (parm
, 0);
19366 if (arg
== error_mark_node
)
19367 return unify_invalid (explain_p
);
19368 if (arg
== unknown_type_node
19369 || arg
== init_list_type_node
)
19370 /* We can't deduce anything from this, but we might get all the
19371 template args from other function args. */
19372 return unify_success (explain_p
);
19374 /* If PARM uses template parameters, then we can't bail out here,
19375 even if ARG == PARM, since we won't record unifications for the
19376 template parameters. We might need them if we're trying to
19377 figure out which of two things is more specialized. */
19378 if (arg
== parm
&& !uses_template_parms (parm
))
19379 return unify_success (explain_p
);
19381 /* Handle init lists early, so the rest of the function can assume
19382 we're dealing with a type. */
19383 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
19387 tree orig_parm
= parm
;
19389 /* Replace T with std::initializer_list<T> for deduction. */
19390 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19391 && flag_deduce_init_list
)
19392 parm
= listify (parm
);
19394 if (!is_std_init_list (parm
)
19395 && TREE_CODE (parm
) != ARRAY_TYPE
)
19396 /* We can only deduce from an initializer list argument if the
19397 parameter is std::initializer_list or an array; otherwise this
19398 is a non-deduced context. */
19399 return unify_success (explain_p
);
19401 if (TREE_CODE (parm
) == ARRAY_TYPE
)
19402 elttype
= TREE_TYPE (parm
);
19405 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
19406 /* Deduction is defined in terms of a single type, so just punt
19407 on the (bizarre) std::initializer_list<T...>. */
19408 if (PACK_EXPANSION_P (elttype
))
19409 return unify_success (explain_p
);
19412 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
19414 int elt_strict
= strict
;
19416 if (elt
== error_mark_node
)
19417 return unify_invalid (explain_p
);
19419 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
19421 tree type
= TREE_TYPE (elt
);
19422 if (type
== error_mark_node
)
19423 return unify_invalid (explain_p
);
19424 /* It should only be possible to get here for a call. */
19425 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
19426 elt_strict
|= maybe_adjust_types_for_deduction
19427 (DEDUCE_CALL
, &elttype
, &type
, elt
);
19431 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
19435 if (TREE_CODE (parm
) == ARRAY_TYPE
19436 && deducible_array_bound (TYPE_DOMAIN (parm
)))
19438 /* Also deduce from the length of the initializer list. */
19439 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
19440 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
19441 if (idx
== error_mark_node
)
19442 return unify_invalid (explain_p
);
19443 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19447 /* If the std::initializer_list<T> deduction worked, replace the
19448 deduced A with std::initializer_list<A>. */
19449 if (orig_parm
!= parm
)
19451 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
19452 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19453 targ
= listify (targ
);
19454 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
19456 return unify_success (explain_p
);
19459 /* Immediately reject some pairs that won't unify because of
19460 cv-qualification mismatches. */
19461 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19463 /* It is the elements of the array which hold the cv quals of an array
19464 type, and the elements might be template type parms. We'll check
19465 when we recurse. */
19466 && TREE_CODE (arg
) != ARRAY_TYPE
19467 /* We check the cv-qualifiers when unifying with template type
19468 parameters below. We want to allow ARG `const T' to unify with
19469 PARM `T' for example, when computing which of two templates
19470 is more specialized, for example. */
19471 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
19472 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
19473 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19475 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
19476 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
19477 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
19478 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
19479 strict
&= ~UNIFY_ALLOW_DERIVED
;
19480 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
19481 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
19483 switch (TREE_CODE (parm
))
19485 case TYPENAME_TYPE
:
19487 case UNBOUND_CLASS_TEMPLATE
:
19488 /* In a type which contains a nested-name-specifier, template
19489 argument values cannot be deduced for template parameters used
19490 within the nested-name-specifier. */
19491 return unify_success (explain_p
);
19493 case TEMPLATE_TYPE_PARM
:
19494 case TEMPLATE_TEMPLATE_PARM
:
19495 case BOUND_TEMPLATE_TEMPLATE_PARM
:
19496 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19497 if (error_operand_p (tparm
))
19498 return unify_invalid (explain_p
);
19500 if (TEMPLATE_TYPE_LEVEL (parm
)
19501 != template_decl_level (tparm
))
19502 /* The PARM is not one we're trying to unify. Just check
19503 to see if it matches ARG. */
19505 if (TREE_CODE (arg
) == TREE_CODE (parm
)
19506 && (is_auto (parm
) ? is_auto (arg
)
19507 : same_type_p (parm
, arg
)))
19508 return unify_success (explain_p
);
19510 return unify_type_mismatch (explain_p
, parm
, arg
);
19512 idx
= TEMPLATE_TYPE_IDX (parm
);
19513 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19514 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
19515 if (error_operand_p (tparm
))
19516 return unify_invalid (explain_p
);
19518 /* Check for mixed types and values. */
19519 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
19520 && TREE_CODE (tparm
) != TYPE_DECL
)
19521 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19522 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
19523 gcc_unreachable ();
19525 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19527 /* ARG must be constructed from a template class or a template
19528 template parameter. */
19529 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
19530 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
19531 return unify_template_deduction_failure (explain_p
, parm
, arg
);
19533 tree parmvec
= TYPE_TI_ARGS (parm
);
19534 /* An alias template name is never deduced. */
19535 if (TYPE_ALIAS_P (arg
))
19536 arg
= strip_typedefs (arg
);
19537 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
19538 tree full_argvec
= add_to_template_args (targs
, argvec
);
19540 = DECL_INNERMOST_TEMPLATE_PARMS
19541 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
19543 int parm_variadic_p
= 0;
19545 /* The resolution to DR150 makes clear that default
19546 arguments for an N-argument may not be used to bind T
19547 to a template template parameter with fewer than N
19548 parameters. It is not safe to permit the binding of
19549 default arguments as an extension, as that may change
19550 the meaning of a conforming program. Consider:
19552 struct Dense { static const unsigned int dim = 1; };
19554 template <template <typename> class View,
19556 void operator+(float, View<Block> const&);
19558 template <typename Block,
19559 unsigned int Dim = Block::dim>
19560 struct Lvalue_proxy { operator float() const; };
19564 Lvalue_proxy<Dense> p;
19569 Here, if Lvalue_proxy is permitted to bind to View, then
19570 the global operator+ will be used; if they are not, the
19571 Lvalue_proxy will be converted to float. */
19572 if (coerce_template_parms (parm_parms
,
19574 TYPE_TI_TEMPLATE (parm
),
19576 ? tf_warning_or_error
19578 /*require_all_args=*/true,
19579 /*use_default_args=*/false)
19580 == error_mark_node
)
19583 /* Deduce arguments T, i from TT<T> or TT<i>.
19584 We check each element of PARMVEC and ARGVEC individually
19585 rather than the whole TREE_VEC since they can have
19586 different number of elements. */
19588 parmvec
= expand_template_argument_pack (parmvec
);
19589 argvec
= expand_template_argument_pack (argvec
);
19591 len
= TREE_VEC_LENGTH (parmvec
);
19593 /* Check if the parameters end in a pack, making them
19596 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
19597 parm_variadic_p
= 1;
19599 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19600 /* If the template argument list of P contains a pack
19601 expansion that is not the last template argument, the
19602 entire template argument list is a non-deduced
19604 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
19605 return unify_success (explain_p
);
19607 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
19608 return unify_too_few_arguments (explain_p
,
19609 TREE_VEC_LENGTH (argvec
), len
);
19611 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19613 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19614 TREE_VEC_ELT (parmvec
, i
),
19615 TREE_VEC_ELT (argvec
, i
),
19616 UNIFY_ALLOW_NONE
, explain_p
);
19619 if (parm_variadic_p
19620 && unify_pack_expansion (tparms
, targs
,
19623 /*subr=*/true, explain_p
))
19626 arg
= TYPE_TI_TEMPLATE (arg
);
19628 /* Fall through to deduce template name. */
19631 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
19632 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
19634 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
19636 /* Simple cases: Value already set, does match or doesn't. */
19637 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
19638 return unify_success (explain_p
);
19640 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19644 /* If PARM is `const T' and ARG is only `int', we don't have
19645 a match unless we are allowing additional qualification.
19646 If ARG is `const int' and PARM is just `T' that's OK;
19647 that binds `const int' to `T'. */
19648 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
19650 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
19652 /* Consider the case where ARG is `const volatile int' and
19653 PARM is `const T'. Then, T should be `volatile int'. */
19654 arg
= cp_build_qualified_type_real
19655 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
19656 if (arg
== error_mark_node
)
19657 return unify_invalid (explain_p
);
19659 /* Simple cases: Value already set, does match or doesn't. */
19660 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
19661 return unify_success (explain_p
);
19663 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
19665 /* Make sure that ARG is not a variable-sized array. (Note
19666 that were talking about variable-sized arrays (like
19667 `int[n]'), rather than arrays of unknown size (like
19668 `int[]').) We'll get very confused by such a type since
19669 the bound of the array is not constant, and therefore
19670 not mangleable. Besides, such types are not allowed in
19671 ISO C++, so we can do as we please here. We do allow
19672 them for 'auto' deduction, since that isn't ABI-exposed. */
19673 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
19674 return unify_vla_arg (explain_p
, arg
);
19676 /* Strip typedefs as in convert_template_argument. */
19677 arg
= canonicalize_type_argument (arg
, tf_none
);
19680 /* If ARG is a parameter pack or an expansion, we cannot unify
19681 against it unless PARM is also a parameter pack. */
19682 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19683 && !template_parameter_pack_p (parm
))
19684 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19686 /* If the argument deduction results is a METHOD_TYPE,
19687 then there is a problem.
19688 METHOD_TYPE doesn't map to any real C++ type the result of
19689 the deduction can not be of that type. */
19690 if (TREE_CODE (arg
) == METHOD_TYPE
)
19691 return unify_method_type_error (explain_p
, arg
);
19693 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19694 return unify_success (explain_p
);
19696 case TEMPLATE_PARM_INDEX
:
19697 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
19698 if (error_operand_p (tparm
))
19699 return unify_invalid (explain_p
);
19701 if (TEMPLATE_PARM_LEVEL (parm
)
19702 != template_decl_level (tparm
))
19704 /* The PARM is not one we're trying to unify. Just check
19705 to see if it matches ARG. */
19706 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
19707 && cp_tree_equal (parm
, arg
));
19709 unify_expression_unequal (explain_p
, parm
, arg
);
19713 idx
= TEMPLATE_PARM_IDX (parm
);
19714 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
19718 int x
= !cp_tree_equal (targ
, arg
);
19720 unify_inconsistency (explain_p
, parm
, targ
, arg
);
19724 /* [temp.deduct.type] If, in the declaration of a function template
19725 with a non-type template-parameter, the non-type
19726 template-parameter is used in an expression in the function
19727 parameter-list and, if the corresponding template-argument is
19728 deduced, the template-argument type shall match the type of the
19729 template-parameter exactly, except that a template-argument
19730 deduced from an array bound may be of any integral type.
19731 The non-type parameter might use already deduced type parameters. */
19732 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
19733 if (!TREE_TYPE (arg
))
19734 /* Template-parameter dependent expression. Just accept it for now.
19735 It will later be processed in convert_template_argument. */
19737 else if (same_type_p (TREE_TYPE (arg
), tparm
))
19739 else if ((strict
& UNIFY_ALLOW_INTEGER
)
19740 && CP_INTEGRAL_TYPE_P (tparm
))
19741 /* Convert the ARG to the type of PARM; the deduced non-type
19742 template argument must exactly match the types of the
19743 corresponding parameter. */
19744 arg
= fold (build_nop (tparm
, arg
));
19745 else if (uses_template_parms (tparm
))
19746 /* We haven't deduced the type of this parameter yet. Try again
19748 return unify_success (explain_p
);
19750 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
19752 /* If ARG is a parameter pack or an expansion, we cannot unify
19753 against it unless PARM is also a parameter pack. */
19754 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
19755 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
19756 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
19759 bool removed_attr
= false;
19760 arg
= strip_typedefs_expr (arg
, &removed_attr
);
19762 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
19763 return unify_success (explain_p
);
19767 /* A pointer-to-member constant can be unified only with
19768 another constant. */
19769 if (TREE_CODE (arg
) != PTRMEM_CST
)
19770 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
19772 /* Just unify the class member. It would be useless (and possibly
19773 wrong, depending on the strict flags) to unify also
19774 PTRMEM_CST_CLASS, because we want to be sure that both parm and
19775 arg refer to the same variable, even if through different
19776 classes. For instance:
19778 struct A { int x; };
19781 Unification of &A::x and &B::x must succeed. */
19782 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
19783 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
19788 if (!TYPE_PTR_P (arg
))
19789 return unify_type_mismatch (explain_p
, parm
, arg
);
19791 /* [temp.deduct.call]
19793 A can be another pointer or pointer to member type that can
19794 be converted to the deduced A via a qualification
19795 conversion (_conv.qual_).
19797 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
19798 This will allow for additional cv-qualification of the
19799 pointed-to types if appropriate. */
19801 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
19802 /* The derived-to-base conversion only persists through one
19803 level of pointers. */
19804 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
19806 return unify (tparms
, targs
, TREE_TYPE (parm
),
19807 TREE_TYPE (arg
), strict
, explain_p
);
19810 case REFERENCE_TYPE
:
19811 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
19812 return unify_type_mismatch (explain_p
, parm
, arg
);
19813 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19814 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19817 if (TREE_CODE (arg
) != ARRAY_TYPE
)
19818 return unify_type_mismatch (explain_p
, parm
, arg
);
19819 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
19820 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
19821 return unify_type_mismatch (explain_p
, parm
, arg
);
19822 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
19823 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
19824 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
19825 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
19826 TYPE_DOMAIN (arg
), explain_p
);
19827 return unify_success (explain_p
);
19834 case ENUMERAL_TYPE
:
19837 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19838 return unify_type_mismatch (explain_p
, parm
, arg
);
19840 /* We have already checked cv-qualification at the top of the
19842 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
19843 return unify_type_mismatch (explain_p
, parm
, arg
);
19845 /* As far as unification is concerned, this wins. Later checks
19846 will invalidate it if necessary. */
19847 return unify_success (explain_p
);
19849 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
19850 /* Type INTEGER_CST can come from ordinary constant template args. */
19852 while (TREE_CODE (arg
) == NOP_EXPR
)
19853 arg
= TREE_OPERAND (arg
, 0);
19855 if (TREE_CODE (arg
) != INTEGER_CST
)
19856 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19857 return (tree_int_cst_equal (parm
, arg
)
19858 ? unify_success (explain_p
)
19859 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
19863 int i
, len
, argslen
;
19864 int parm_variadic_p
= 0;
19866 if (TREE_CODE (arg
) != TREE_VEC
)
19867 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
19869 len
= TREE_VEC_LENGTH (parm
);
19870 argslen
= TREE_VEC_LENGTH (arg
);
19872 /* Check for pack expansions in the parameters. */
19873 for (i
= 0; i
< len
; ++i
)
19875 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
19878 /* We can unify against something with a trailing
19880 parm_variadic_p
= 1;
19882 /* [temp.deduct.type]/9: If the template argument list of
19883 P contains a pack expansion that is not the last
19884 template argument, the entire template argument list
19885 is a non-deduced context. */
19886 return unify_success (explain_p
);
19890 /* If we don't have enough arguments to satisfy the parameters
19891 (not counting the pack expression at the end), or we have
19892 too many arguments for a parameter list that doesn't end in
19893 a pack expression, we can't unify. */
19894 if (parm_variadic_p
19895 ? argslen
< len
- parm_variadic_p
19897 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
19899 /* Unify all of the parameters that precede the (optional)
19900 pack expression. */
19901 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
19903 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
19904 TREE_VEC_ELT (parm
, i
),
19905 TREE_VEC_ELT (arg
, i
),
19906 UNIFY_ALLOW_NONE
, explain_p
);
19908 if (parm_variadic_p
)
19909 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
19911 /*subr=*/true, explain_p
);
19912 return unify_success (explain_p
);
19917 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19918 return unify_type_mismatch (explain_p
, parm
, arg
);
19920 if (TYPE_PTRMEMFUNC_P (parm
))
19922 if (!TYPE_PTRMEMFUNC_P (arg
))
19923 return unify_type_mismatch (explain_p
, parm
, arg
);
19925 return unify (tparms
, targs
,
19926 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
19927 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
19928 strict
, explain_p
);
19930 else if (TYPE_PTRMEMFUNC_P (arg
))
19931 return unify_type_mismatch (explain_p
, parm
, arg
);
19933 if (CLASSTYPE_TEMPLATE_INFO (parm
))
19935 tree t
= NULL_TREE
;
19937 if (strict_in
& UNIFY_ALLOW_DERIVED
)
19939 /* First, we try to unify the PARM and ARG directly. */
19940 t
= try_class_unification (tparms
, targs
,
19941 parm
, arg
, explain_p
);
19945 /* Fallback to the special case allowed in
19946 [temp.deduct.call]:
19948 If P is a class, and P has the form
19949 template-id, then A can be a derived class of
19950 the deduced A. Likewise, if P is a pointer to
19951 a class of the form template-id, A can be a
19952 pointer to a derived class pointed to by the
19954 enum template_base_result r
;
19955 r
= get_template_base (tparms
, targs
, parm
, arg
,
19960 /* Don't give the derived diagnostic if we're
19961 already dealing with the same template. */
19963 = (CLASSTYPE_TEMPLATE_INFO (arg
)
19964 && (CLASSTYPE_TI_TEMPLATE (parm
)
19965 == CLASSTYPE_TI_TEMPLATE (arg
)));
19966 return unify_no_common_base (explain_p
&& !same_template
,
19971 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
19972 && (CLASSTYPE_TI_TEMPLATE (parm
)
19973 == CLASSTYPE_TI_TEMPLATE (arg
)))
19974 /* Perhaps PARM is something like S<U> and ARG is S<int>.
19975 Then, we should unify `int' and `U'. */
19978 /* There's no chance of unification succeeding. */
19979 return unify_type_mismatch (explain_p
, parm
, arg
);
19981 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
19982 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
19984 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
19985 return unify_type_mismatch (explain_p
, parm
, arg
);
19986 return unify_success (explain_p
);
19989 case FUNCTION_TYPE
:
19991 unsigned int nargs
;
19996 if (TREE_CODE (arg
) != TREE_CODE (parm
))
19997 return unify_type_mismatch (explain_p
, parm
, arg
);
19999 /* CV qualifications for methods can never be deduced, they must
20000 match exactly. We need to check them explicitly here,
20001 because type_unification_real treats them as any other
20002 cv-qualified parameter. */
20003 if (TREE_CODE (parm
) == METHOD_TYPE
20004 && (!check_cv_quals_for_unify
20006 class_of_this_parm (arg
),
20007 class_of_this_parm (parm
))))
20008 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
20010 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
20011 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
20013 nargs
= list_length (TYPE_ARG_TYPES (arg
));
20014 args
= XALLOCAVEC (tree
, nargs
);
20015 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
20016 a
!= NULL_TREE
&& a
!= void_list_node
;
20017 a
= TREE_CHAIN (a
), ++i
)
20018 args
[i
] = TREE_VALUE (a
);
20021 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
20022 args
, nargs
, 1, DEDUCE_EXACT
,
20023 LOOKUP_NORMAL
, NULL
, explain_p
);
20027 /* Unify a pointer to member with a pointer to member function, which
20028 deduces the type of the member as a function type. */
20029 if (TYPE_PTRMEMFUNC_P (arg
))
20031 /* Check top-level cv qualifiers */
20032 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
20033 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
20035 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
20036 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
20037 UNIFY_ALLOW_NONE
, explain_p
);
20039 /* Determine the type of the function we are unifying against. */
20040 tree fntype
= static_fn_type (arg
);
20042 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
20045 if (TREE_CODE (arg
) != OFFSET_TYPE
)
20046 return unify_type_mismatch (explain_p
, parm
, arg
);
20047 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
20048 TYPE_OFFSET_BASETYPE (arg
),
20049 UNIFY_ALLOW_NONE
, explain_p
);
20050 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
20051 strict
, explain_p
);
20054 if (DECL_TEMPLATE_PARM_P (parm
))
20055 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
20056 if (arg
!= scalar_constant_value (parm
))
20057 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20058 return unify_success (explain_p
);
20061 case TEMPLATE_DECL
:
20062 /* Matched cases are handled by the ARG == PARM test above. */
20063 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
20066 /* We might get a variable as a non-type template argument in parm if the
20067 corresponding parameter is type-dependent. Make any necessary
20068 adjustments based on whether arg is a reference. */
20069 if (CONSTANT_CLASS_P (arg
))
20070 parm
= fold_non_dependent_expr (parm
);
20071 else if (REFERENCE_REF_P (arg
))
20073 tree sub
= TREE_OPERAND (arg
, 0);
20075 if (TREE_CODE (sub
) == ADDR_EXPR
)
20076 arg
= TREE_OPERAND (sub
, 0);
20078 /* Now use the normal expression code to check whether they match. */
20081 case TYPE_ARGUMENT_PACK
:
20082 case NONTYPE_ARGUMENT_PACK
:
20083 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
20084 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
20087 case DECLTYPE_TYPE
:
20088 case UNDERLYING_TYPE
:
20089 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
20090 or UNDERLYING_TYPE nodes. */
20091 return unify_success (explain_p
);
20094 /* Unification fails if we hit an error node. */
20095 return unify_invalid (explain_p
);
20098 if (REFERENCE_REF_P (parm
))
20100 if (REFERENCE_REF_P (arg
))
20101 arg
= TREE_OPERAND (arg
, 0);
20102 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
20103 strict
, explain_p
);
20108 /* An unresolved overload is a nondeduced context. */
20109 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
20110 return unify_success (explain_p
);
20111 gcc_assert (EXPR_P (parm
));
20113 /* We must be looking at an expression. This can happen with
20117 void foo(S<I>, S<I + 2>);
20119 This is a "nondeduced context":
20123 The nondeduced contexts are:
20125 --A type that is a template-id in which one or more of
20126 the template-arguments is an expression that references
20127 a template-parameter.
20129 In these cases, we assume deduction succeeded, but don't
20130 actually infer any unifications. */
20132 if (!uses_template_parms (parm
)
20133 && !template_args_equal (parm
, arg
))
20134 return unify_expression_unequal (explain_p
, parm
, arg
);
20136 return unify_success (explain_p
);
20139 #undef RECUR_AND_CHECK_FAILURE
20141 /* Note that DECL can be defined in this translation unit, if
20145 mark_definable (tree decl
)
20148 DECL_NOT_REALLY_EXTERN (decl
) = 1;
20149 FOR_EACH_CLONE (clone
, decl
)
20150 DECL_NOT_REALLY_EXTERN (clone
) = 1;
20153 /* Called if RESULT is explicitly instantiated, or is a member of an
20154 explicitly instantiated class. */
20157 mark_decl_instantiated (tree result
, int extern_p
)
20159 SET_DECL_EXPLICIT_INSTANTIATION (result
);
20161 /* If this entity has already been written out, it's too late to
20162 make any modifications. */
20163 if (TREE_ASM_WRITTEN (result
))
20166 /* For anonymous namespace we don't need to do anything. */
20167 if (decl_anon_ns_mem_p (result
))
20169 gcc_assert (!TREE_PUBLIC (result
));
20173 if (TREE_CODE (result
) != FUNCTION_DECL
)
20174 /* The TREE_PUBLIC flag for function declarations will have been
20175 set correctly by tsubst. */
20176 TREE_PUBLIC (result
) = 1;
20178 /* This might have been set by an earlier implicit instantiation. */
20179 DECL_COMDAT (result
) = 0;
20182 DECL_NOT_REALLY_EXTERN (result
) = 0;
20185 mark_definable (result
);
20186 mark_needed (result
);
20187 /* Always make artificials weak. */
20188 if (DECL_ARTIFICIAL (result
) && flag_weak
)
20189 comdat_linkage (result
);
20190 /* For WIN32 we also want to put explicit instantiations in
20191 linkonce sections. */
20192 else if (TREE_PUBLIC (result
))
20193 maybe_make_one_only (result
);
20196 /* If EXTERN_P, then this function will not be emitted -- unless
20197 followed by an explicit instantiation, at which point its linkage
20198 will be adjusted. If !EXTERN_P, then this function will be
20199 emitted here. In neither circumstance do we want
20200 import_export_decl to adjust the linkage. */
20201 DECL_INTERFACE_KNOWN (result
) = 1;
20204 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
20205 important template arguments. If any are missing, we check whether
20206 they're important by using error_mark_node for substituting into any
20207 args that were used for partial ordering (the ones between ARGS and END)
20208 and seeing if it bubbles up. */
20211 check_undeduced_parms (tree targs
, tree args
, tree end
)
20213 bool found
= false;
20215 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
20216 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
20219 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
20223 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
20224 if (substed
== error_mark_node
)
20230 /* Given two function templates PAT1 and PAT2, return:
20232 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
20233 -1 if PAT2 is more specialized than PAT1.
20234 0 if neither is more specialized.
20236 LEN indicates the number of parameters we should consider
20237 (defaulted parameters should not be considered).
20239 The 1998 std underspecified function template partial ordering, and
20240 DR214 addresses the issue. We take pairs of arguments, one from
20241 each of the templates, and deduce them against each other. One of
20242 the templates will be more specialized if all the *other*
20243 template's arguments deduce against its arguments and at least one
20244 of its arguments *does* *not* deduce against the other template's
20245 corresponding argument. Deduction is done as for class templates.
20246 The arguments used in deduction have reference and top level cv
20247 qualifiers removed. Iff both arguments were originally reference
20248 types *and* deduction succeeds in both directions, an lvalue reference
20249 wins against an rvalue reference and otherwise the template
20250 with the more cv-qualified argument wins for that pairing (if
20251 neither is more cv-qualified, they both are equal). Unlike regular
20252 deduction, after all the arguments have been deduced in this way,
20253 we do *not* verify the deduced template argument values can be
20254 substituted into non-deduced contexts.
20256 The logic can be a bit confusing here, because we look at deduce1 and
20257 targs1 to see if pat2 is at least as specialized, and vice versa; if we
20258 can find template arguments for pat1 to make arg1 look like arg2, that
20259 means that arg2 is at least as specialized as arg1. */
20262 more_specialized_fn (tree pat1
, tree pat2
, int len
)
20264 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
20265 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
20266 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
20267 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
20268 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
20269 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
20270 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
20271 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
20272 tree origs1
, origs2
;
20273 bool lose1
= false;
20274 bool lose2
= false;
20276 /* Remove the this parameter from non-static member functions. If
20277 one is a non-static member function and the other is not a static
20278 member function, remove the first parameter from that function
20279 also. This situation occurs for operator functions where we
20280 locate both a member function (with this pointer) and non-member
20281 operator (with explicit first operand). */
20282 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
20284 len
--; /* LEN is the number of significant arguments for DECL1 */
20285 args1
= TREE_CHAIN (args1
);
20286 if (!DECL_STATIC_FUNCTION_P (decl2
))
20287 args2
= TREE_CHAIN (args2
);
20289 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
20291 args2
= TREE_CHAIN (args2
);
20292 if (!DECL_STATIC_FUNCTION_P (decl1
))
20295 args1
= TREE_CHAIN (args1
);
20299 /* If only one is a conversion operator, they are unordered. */
20300 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
20303 /* Consider the return type for a conversion function */
20304 if (DECL_CONV_FN_P (decl1
))
20306 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
20307 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
20311 processing_template_decl
++;
20317 /* Stop when an ellipsis is seen. */
20318 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
20320 tree arg1
= TREE_VALUE (args1
);
20321 tree arg2
= TREE_VALUE (args2
);
20322 int deduce1
, deduce2
;
20328 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20329 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20331 /* When both arguments are pack expansions, we need only
20332 unify the patterns themselves. */
20333 arg1
= PACK_EXPANSION_PATTERN (arg1
);
20334 arg2
= PACK_EXPANSION_PATTERN (arg2
);
20336 /* This is the last comparison we need to do. */
20340 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
20342 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
20343 arg1
= TREE_TYPE (arg1
);
20344 quals1
= cp_type_quals (arg1
);
20347 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
20349 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
20350 arg2
= TREE_TYPE (arg2
);
20351 quals2
= cp_type_quals (arg2
);
20354 arg1
= TYPE_MAIN_VARIANT (arg1
);
20355 arg2
= TYPE_MAIN_VARIANT (arg2
);
20357 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
20359 int i
, len2
= remaining_arguments (args2
);
20360 tree parmvec
= make_tree_vec (1);
20361 tree argvec
= make_tree_vec (len2
);
20364 /* Setup the parameter vector, which contains only ARG1. */
20365 TREE_VEC_ELT (parmvec
, 0) = arg1
;
20367 /* Setup the argument vector, which contains the remaining
20369 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
20370 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20372 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
20373 argvec
, DEDUCE_EXACT
,
20374 /*subr=*/true, /*explain_p=*/false)
20377 /* We cannot deduce in the other direction, because ARG1 is
20378 a pack expansion but ARG2 is not. */
20381 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20383 int i
, len1
= remaining_arguments (args1
);
20384 tree parmvec
= make_tree_vec (1);
20385 tree argvec
= make_tree_vec (len1
);
20388 /* Setup the parameter vector, which contains only ARG1. */
20389 TREE_VEC_ELT (parmvec
, 0) = arg2
;
20391 /* Setup the argument vector, which contains the remaining
20393 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
20394 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
20396 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
20397 argvec
, DEDUCE_EXACT
,
20398 /*subr=*/true, /*explain_p=*/false)
20401 /* We cannot deduce in the other direction, because ARG2 is
20402 a pack expansion but ARG1 is not.*/
20408 /* The normal case, where neither argument is a pack
20410 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
20411 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20413 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
20414 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
20418 /* If we couldn't deduce arguments for tparms1 to make arg1 match
20419 arg2, then arg2 is not as specialized as arg1. */
20425 /* "If, for a given type, deduction succeeds in both directions
20426 (i.e., the types are identical after the transformations above)
20427 and both P and A were reference types (before being replaced with
20428 the type referred to above):
20429 - if the type from the argument template was an lvalue reference and
20430 the type from the parameter template was not, the argument type is
20431 considered to be more specialized than the other; otherwise,
20432 - if the type from the argument template is more cv-qualified
20433 than the type from the parameter template (as described above),
20434 the argument type is considered to be more specialized than the other;
20436 - neither type is more specialized than the other." */
20438 if (deduce1
&& deduce2
)
20440 if (ref1
&& ref2
&& ref1
!= ref2
)
20447 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
20449 if ((quals1
& quals2
) == quals2
)
20451 if ((quals1
& quals2
) == quals1
)
20456 if (lose1
&& lose2
)
20457 /* We've failed to deduce something in either direction.
20458 These must be unordered. */
20461 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
20462 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
20463 /* We have already processed all of the arguments in our
20464 handing of the pack expansion type. */
20467 args1
= TREE_CHAIN (args1
);
20468 args2
= TREE_CHAIN (args2
);
20471 /* "In most cases, all template parameters must have values in order for
20472 deduction to succeed, but for partial ordering purposes a template
20473 parameter may remain without a value provided it is not used in the
20474 types being used for partial ordering."
20476 Thus, if we are missing any of the targs1 we need to substitute into
20477 origs1, then pat2 is not as specialized as pat1. This can happen when
20478 there is a nondeduced context. */
20479 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
20481 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
20484 processing_template_decl
--;
20486 /* If both deductions succeed, the partial ordering selects the more
20487 constrained template. */
20488 if (!lose1
&& !lose2
)
20490 tree c1
= get_constraints (DECL_TEMPLATE_RESULT (pat1
));
20491 tree c2
= get_constraints (DECL_TEMPLATE_RESULT (pat2
));
20492 lose1
= !subsumes_constraints (c1
, c2
);
20493 lose2
= !subsumes_constraints (c2
, c1
);
20496 /* All things being equal, if the next argument is a pack expansion
20497 for one function but not for the other, prefer the
20498 non-variadic function. FIXME this is bogus; see c++/41958. */
20500 && args1
&& TREE_VALUE (args1
)
20501 && args2
&& TREE_VALUE (args2
))
20503 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
20504 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
20507 if (lose1
== lose2
)
20515 /* Determine which of two partial specializations of TMPL is more
20518 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
20519 to the first partial specialization. The TREE_PURPOSE is the
20520 innermost set of template parameters for the partial
20521 specialization. PAT2 is similar, but for the second template.
20523 Return 1 if the first partial specialization is more specialized;
20524 -1 if the second is more specialized; 0 if neither is more
20527 See [temp.class.order] for information about determining which of
20528 two templates is more specialized. */
20531 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
20535 bool any_deductions
= false;
20537 tree tmpl1
= TREE_VALUE (pat1
);
20538 tree tmpl2
= TREE_VALUE (pat2
);
20539 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
20540 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
20541 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
20542 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
20544 /* Just like what happens for functions, if we are ordering between
20545 different template specializations, we may encounter dependent
20546 types in the arguments, and we need our dependency check functions
20547 to behave correctly. */
20548 ++processing_template_decl
;
20549 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
20553 any_deductions
= true;
20556 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
20560 any_deductions
= true;
20562 --processing_template_decl
;
20564 /* If both deductions succeed, the partial ordering selects the more
20565 constrained template. */
20566 if (!winner
&& any_deductions
)
20567 return more_constrained (tmpl1
, tmpl2
);
20569 /* In the case of a tie where at least one of the templates
20570 has a parameter pack at the end, the template with the most
20571 non-packed parameters wins. */
20574 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
20575 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
20577 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
20578 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
20579 int len1
= TREE_VEC_LENGTH (args1
);
20580 int len2
= TREE_VEC_LENGTH (args2
);
20582 /* We don't count the pack expansion at the end. */
20583 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
20585 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
20590 else if (len1
< len2
)
20597 /* Return the template arguments that will produce the function signature
20598 DECL from the function template FN, with the explicit template
20599 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
20600 also match. Return NULL_TREE if no satisfactory arguments could be
20604 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
20606 int ntparms
= DECL_NTPARMS (fn
);
20607 tree targs
= make_tree_vec (ntparms
);
20608 tree decl_type
= TREE_TYPE (decl
);
20609 tree decl_arg_types
;
20611 unsigned int nargs
, ix
;
20614 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
20616 /* Never do unification on the 'this' parameter. */
20617 decl_arg_types
= skip_artificial_parms_for (decl
,
20618 TYPE_ARG_TYPES (decl_type
));
20620 nargs
= list_length (decl_arg_types
);
20621 args
= XALLOCAVEC (tree
, nargs
);
20622 for (arg
= decl_arg_types
, ix
= 0;
20623 arg
!= NULL_TREE
&& arg
!= void_list_node
;
20624 arg
= TREE_CHAIN (arg
), ++ix
)
20625 args
[ix
] = TREE_VALUE (arg
);
20627 if (fn_type_unification (fn
, explicit_args
, targs
,
20629 (check_rettype
|| DECL_CONV_FN_P (fn
)
20630 ? TREE_TYPE (decl_type
) : NULL_TREE
),
20631 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
20633 == error_mark_node
)
20639 /* Return the innermost template arguments that, when applied to a partial
20640 specialization of TMPL whose innermost template parameters are
20641 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
20644 For example, suppose we have:
20646 template <class T, class U> struct S {};
20647 template <class T> struct S<T*, int> {};
20649 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
20650 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
20651 int}. The resulting vector will be {double}, indicating that `T'
20652 is bound to `double'. */
20655 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
20657 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
20659 tree innermost_deduced_args
;
20661 innermost_deduced_args
= make_tree_vec (ntparms
);
20662 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20664 deduced_args
= copy_node (args
);
20665 SET_TMPL_ARGS_LEVEL (deduced_args
,
20666 TMPL_ARGS_DEPTH (deduced_args
),
20667 innermost_deduced_args
);
20670 deduced_args
= innermost_deduced_args
;
20672 if (unify (tparms
, deduced_args
,
20673 INNERMOST_TEMPLATE_ARGS (spec_args
),
20674 INNERMOST_TEMPLATE_ARGS (args
),
20675 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
20678 for (i
= 0; i
< ntparms
; ++i
)
20679 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
20682 /* Verify that nondeduced template arguments agree with the type
20683 obtained from argument deduction.
20687 struct A { typedef int X; };
20688 template <class T, class U> struct C {};
20689 template <class T> struct C<T, typename T::X> {};
20691 Then with the instantiation `C<A, int>', we can deduce that
20692 `T' is `A' but unify () does not check whether `typename T::X'
20694 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
20695 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20697 tf_none
, false, false);
20698 if (spec_args
== error_mark_node
20699 /* We only need to check the innermost arguments; the other
20700 arguments will always agree. */
20701 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
20702 INNERMOST_TEMPLATE_ARGS (args
)))
20705 /* Now that we have bindings for all of the template arguments,
20706 ensure that the arguments deduced for the template template
20707 parameters have compatible template parameter lists. See the use
20708 of template_template_parm_bindings_ok_p in fn_type_unification
20709 for more information. */
20710 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
20713 return deduced_args
;
20716 // Compare two function templates T1 and T2 by deducing bindings
20717 // from one against the other. If both deductions succeed, compare
20718 // constraints to see which is more constrained.
20720 more_specialized_inst (tree t1
, tree t2
)
20725 if (get_bindings (t1
, DECL_TEMPLATE_RESULT (t2
), NULL_TREE
, true))
20731 if (get_bindings (t2
, DECL_TEMPLATE_RESULT (t1
), NULL_TREE
, true))
20737 // If both deductions succeed, then one may be more constrained.
20738 if (count
== 2 && fate
== 0)
20739 fate
= more_constrained (t1
, t2
);
20744 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
20745 Return the TREE_LIST node with the most specialized template, if
20746 any. If there is no most specialized template, the error_mark_node
20749 Note that this function does not look at, or modify, the
20750 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
20751 returned is one of the elements of INSTANTIATIONS, callers may
20752 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
20753 and retrieve it from the value returned. */
20756 most_specialized_instantiation (tree templates
)
20760 ++processing_template_decl
;
20763 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
20765 int fate
= more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
));
20770 /* Equally specialized, move to next function. If there
20771 is no next function, nothing's most specialized. */
20772 fn
= TREE_CHAIN (fn
);
20780 /* Now verify that champ is better than everything earlier in the
20781 instantiation list. */
20782 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
)) {
20783 if (more_specialized_inst (TREE_VALUE (champ
), TREE_VALUE (fn
)) != 1)
20790 processing_template_decl
--;
20793 return error_mark_node
;
20798 /* If DECL is a specialization of some template, return the most
20799 general such template. Otherwise, returns NULL_TREE.
20801 For example, given:
20803 template <class T> struct S { template <class U> void f(U); };
20805 if TMPL is `template <class U> void S<int>::f(U)' this will return
20806 the full template. This function will not trace past partial
20807 specializations, however. For example, given in addition:
20809 template <class T> struct S<T*> { template <class U> void f(U); };
20811 if TMPL is `template <class U> void S<int*>::f(U)' this will return
20812 `template <class T> template <class U> S<T*>::f(U)'. */
20815 most_general_template (tree decl
)
20817 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20819 if (tree tinfo
= get_template_info (decl
))
20820 decl
= TI_TEMPLATE (tinfo
);
20821 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
20822 template friend, or a FIELD_DECL for a capture pack. */
20823 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
20827 /* Look for more and more general templates. */
20828 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
20830 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
20831 (See cp-tree.h for details.) */
20832 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
20835 if (CLASS_TYPE_P (TREE_TYPE (decl
))
20836 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
20837 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
20840 /* Stop if we run into an explicitly specialized class template. */
20841 if (!DECL_NAMESPACE_SCOPE_P (decl
)
20842 && DECL_CONTEXT (decl
)
20843 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
20846 decl
= DECL_TI_TEMPLATE (decl
);
20852 /* True iff the TEMPLATE_DECL tmpl is a partial specialization. */
20855 partial_specialization_p (tree tmpl
)
20857 /* Any specialization has DECL_TEMPLATE_SPECIALIZATION. */
20858 if (!DECL_TEMPLATE_SPECIALIZATION (tmpl
))
20860 tree t
= DECL_TI_TEMPLATE (tmpl
);
20861 /* A specialization that fully specializes one of the containing classes is
20862 not a partial specialization. */
20863 return (list_length (DECL_TEMPLATE_PARMS (tmpl
))
20864 == list_length (DECL_TEMPLATE_PARMS (t
)));
20867 /* If TMPL is a partial specialization, return the arguments for its primary
20871 impartial_args (tree tmpl
, tree args
)
20873 if (!partial_specialization_p (tmpl
))
20876 /* If TMPL is a partial specialization, we need to substitute to get
20877 the args for the primary template. */
20878 return tsubst_template_args (DECL_TI_ARGS (tmpl
), args
,
20879 tf_warning_or_error
, tmpl
);
20882 /* Return the most specialized of the template partial specializations
20883 which can produce TARGET, a specialization of some class or variable
20884 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
20885 a TEMPLATE_DECL node corresponding to the partial specialization, while
20886 the TREE_PURPOSE is the set of template arguments that must be
20887 substituted into the template pattern in order to generate TARGET.
20889 If the choice of partial specialization is ambiguous, a diagnostic
20890 is issued, and the error_mark_node is returned. If there are no
20891 partial specializations matching TARGET, then NULL_TREE is
20892 returned, indicating that the primary template should be used. */
20895 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
20897 tree list
= NULL_TREE
;
20902 tree outer_args
= NULL_TREE
;
20905 if (TYPE_P (target
))
20907 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
20908 tmpl
= TI_TEMPLATE (tinfo
);
20909 args
= TI_ARGS (tinfo
);
20911 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
20913 tmpl
= TREE_OPERAND (target
, 0);
20914 args
= TREE_OPERAND (target
, 1);
20916 else if (VAR_P (target
))
20918 tree tinfo
= DECL_TEMPLATE_INFO (target
);
20919 tmpl
= TI_TEMPLATE (tinfo
);
20920 args
= TI_ARGS (tinfo
);
20923 gcc_unreachable ();
20925 tree main_tmpl
= most_general_template (tmpl
);
20927 /* For determining which partial specialization to use, only the
20928 innermost args are interesting. */
20929 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
20931 outer_args
= strip_innermost_template_args (args
, 1);
20932 args
= INNERMOST_TEMPLATE_ARGS (args
);
20935 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
20937 tree partial_spec_args
;
20939 tree spec_tmpl
= TREE_VALUE (t
);
20941 partial_spec_args
= TREE_PURPOSE (t
);
20943 ++processing_template_decl
;
20947 /* Discard the outer levels of args, and then substitute in the
20948 template args from the enclosing class. */
20949 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
20950 partial_spec_args
= tsubst_template_args
20951 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
20953 /* And the same for the partial specialization TEMPLATE_DECL. */
20954 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
20957 partial_spec_args
=
20958 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
20961 /*require_all_args=*/true,
20962 /*use_default_args=*/true);
20964 --processing_template_decl
;
20966 if (partial_spec_args
== error_mark_node
)
20967 return error_mark_node
;
20968 if (spec_tmpl
== error_mark_node
)
20969 return error_mark_node
;
20971 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
20972 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
20978 spec_args
= add_to_template_args (outer_args
, spec_args
);
20980 /* Keep the candidate only if the constraints are satisfied,
20981 or if we're not compiling with concepts. */
20983 || constraints_satisfied_p (spec_tmpl
, spec_args
))
20985 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
20986 TREE_TYPE (list
) = TREE_TYPE (t
);
20994 ambiguous_p
= false;
20997 t
= TREE_CHAIN (t
);
20998 for (; t
; t
= TREE_CHAIN (t
))
21000 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
21007 t
= TREE_CHAIN (t
);
21010 ambiguous_p
= true;
21019 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
21021 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
21024 ambiguous_p
= true;
21032 char *spaces
= NULL
;
21033 if (!(complain
& tf_error
))
21034 return error_mark_node
;
21035 if (TYPE_P (target
))
21036 error ("ambiguous template instantiation for %q#T", target
);
21038 error ("ambiguous template instantiation for %q#D", target
);
21039 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
21040 for (t
= list
; t
; t
= TREE_CHAIN (t
))
21042 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
21043 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
21044 "%s %#S", spaces
? spaces
: str
, subst
);
21045 spaces
= spaces
? spaces
: get_spaces (str
);
21048 return error_mark_node
;
21054 /* Explicitly instantiate DECL. */
21057 do_decl_instantiation (tree decl
, tree storage
)
21059 tree result
= NULL_TREE
;
21062 if (!decl
|| decl
== error_mark_node
)
21063 /* An error occurred, for which grokdeclarator has already issued
21064 an appropriate message. */
21066 else if (! DECL_LANG_SPECIFIC (decl
))
21068 error ("explicit instantiation of non-template %q#D", decl
);
21072 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
21073 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
21075 if (VAR_P (decl
) && !var_templ
)
21077 /* There is an asymmetry here in the way VAR_DECLs and
21078 FUNCTION_DECLs are handled by grokdeclarator. In the case of
21079 the latter, the DECL we get back will be marked as a
21080 template instantiation, and the appropriate
21081 DECL_TEMPLATE_INFO will be set up. This does not happen for
21082 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
21083 should handle VAR_DECLs as it currently handles
21085 if (!DECL_CLASS_SCOPE_P (decl
))
21087 error ("%qD is not a static data member of a class template", decl
);
21090 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
21091 if (!result
|| !VAR_P (result
))
21093 error ("no matching template for %qD found", decl
);
21096 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
21098 error ("type %qT for explicit instantiation %qD does not match "
21099 "declared type %qT", TREE_TYPE (result
), decl
,
21104 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
21106 error ("explicit instantiation of %q#D", decl
);
21112 /* Check for various error cases. Note that if the explicit
21113 instantiation is valid the RESULT will currently be marked as an
21114 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
21115 until we get here. */
21117 if (DECL_TEMPLATE_SPECIALIZATION (result
))
21119 /* DR 259 [temp.spec].
21121 Both an explicit instantiation and a declaration of an explicit
21122 specialization shall not appear in a program unless the explicit
21123 instantiation follows a declaration of the explicit specialization.
21125 For a given set of template parameters, if an explicit
21126 instantiation of a template appears after a declaration of an
21127 explicit specialization for that template, the explicit
21128 instantiation has no effect. */
21131 else if (DECL_EXPLICIT_INSTANTIATION (result
))
21135 No program shall explicitly instantiate any template more
21138 We check DECL_NOT_REALLY_EXTERN so as not to complain when
21139 the first instantiation was `extern' and the second is not,
21140 and EXTERN_P for the opposite case. */
21141 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
21142 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
21143 /* If an "extern" explicit instantiation follows an ordinary
21144 explicit instantiation, the template is instantiated. */
21148 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
21150 error ("no matching template for %qD found", result
);
21153 else if (!DECL_TEMPLATE_INFO (result
))
21155 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
21159 if (storage
== NULL_TREE
)
21161 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21163 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
21164 pedwarn (input_location
, OPT_Wpedantic
,
21165 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
21170 error ("storage class %qD applied to template instantiation", storage
);
21172 check_explicit_instantiation_namespace (result
);
21173 mark_decl_instantiated (result
, extern_p
);
21175 instantiate_decl (result
, /*defer_ok=*/1,
21176 /*expl_inst_class_mem_p=*/false);
21180 mark_class_instantiated (tree t
, int extern_p
)
21182 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
21183 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
21184 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
21185 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
21188 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
21189 rest_of_type_compilation (t
, 1);
21193 /* Called from do_type_instantiation through binding_table_foreach to
21194 do recursive instantiation for the type bound in ENTRY. */
21196 bt_instantiate_type_proc (binding_entry entry
, void *data
)
21198 tree storage
= *(tree
*) data
;
21200 if (MAYBE_CLASS_TYPE_P (entry
->type
)
21201 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
21202 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
21205 /* Called from do_type_instantiation to instantiate a member
21206 (a member function or a static member variable) of an
21207 explicitly instantiated class template. */
21209 instantiate_class_member (tree decl
, int extern_p
)
21211 mark_decl_instantiated (decl
, extern_p
);
21213 instantiate_decl (decl
, /*defer_ok=*/1,
21214 /*expl_inst_class_mem_p=*/true);
21217 /* Perform an explicit instantiation of template class T. STORAGE, if
21218 non-null, is the RID for extern, inline or static. COMPLAIN is
21219 nonzero if this is called from the parser, zero if called recursively,
21220 since the standard is unclear (as detailed below). */
21223 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
21228 int previous_instantiation_extern_p
= 0;
21230 if (TREE_CODE (t
) == TYPE_DECL
)
21233 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
21236 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
21238 error ("explicit instantiation of non-class template %qD", tmpl
);
21240 error ("explicit instantiation of non-template type %qT", t
);
21246 if (!COMPLETE_TYPE_P (t
))
21248 if (complain
& tf_error
)
21249 error ("explicit instantiation of %q#T before definition of template",
21254 if (storage
!= NULL_TREE
)
21256 if (!in_system_header_at (input_location
))
21258 if (storage
== ridpointers
[(int) RID_EXTERN
])
21260 if (cxx_dialect
== cxx98
)
21261 pedwarn (input_location
, OPT_Wpedantic
,
21262 "ISO C++ 1998 forbids the use of %<extern%> on "
21263 "explicit instantiations");
21266 pedwarn (input_location
, OPT_Wpedantic
,
21267 "ISO C++ forbids the use of %qE"
21268 " on explicit instantiations", storage
);
21271 if (storage
== ridpointers
[(int) RID_INLINE
])
21273 else if (storage
== ridpointers
[(int) RID_EXTERN
])
21275 else if (storage
== ridpointers
[(int) RID_STATIC
])
21279 error ("storage class %qD applied to template instantiation",
21285 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
21287 /* DR 259 [temp.spec].
21289 Both an explicit instantiation and a declaration of an explicit
21290 specialization shall not appear in a program unless the explicit
21291 instantiation follows a declaration of the explicit specialization.
21293 For a given set of template parameters, if an explicit
21294 instantiation of a template appears after a declaration of an
21295 explicit specialization for that template, the explicit
21296 instantiation has no effect. */
21299 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
21303 No program shall explicitly instantiate any template more
21306 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
21307 instantiation was `extern'. If EXTERN_P then the second is.
21308 These cases are OK. */
21309 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
21311 if (!previous_instantiation_extern_p
&& !extern_p
21312 && (complain
& tf_error
))
21313 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
21315 /* If we've already instantiated the template, just return now. */
21316 if (!CLASSTYPE_INTERFACE_ONLY (t
))
21320 check_explicit_instantiation_namespace (TYPE_NAME (t
));
21321 mark_class_instantiated (t
, extern_p
);
21329 /* In contrast to implicit instantiation, where only the
21330 declarations, and not the definitions, of members are
21331 instantiated, we have here:
21335 The explicit instantiation of a class template specialization
21336 implies the instantiation of all of its members not
21337 previously explicitly specialized in the translation unit
21338 containing the explicit instantiation.
21340 Of course, we can't instantiate member template classes, since
21341 we don't have any arguments for them. Note that the standard
21342 is unclear on whether the instantiation of the members are
21343 *explicit* instantiations or not. However, the most natural
21344 interpretation is that it should be an explicit instantiation. */
21347 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21348 if (TREE_CODE (tmp
) == FUNCTION_DECL
21349 && DECL_TEMPLATE_INSTANTIATION (tmp
))
21350 instantiate_class_member (tmp
, extern_p
);
21352 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
21353 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
21354 instantiate_class_member (tmp
, extern_p
);
21356 if (CLASSTYPE_NESTED_UTDS (t
))
21357 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
21358 bt_instantiate_type_proc
, &storage
);
21362 /* Given a function DECL, which is a specialization of TMPL, modify
21363 DECL to be a re-instantiation of TMPL with the same template
21364 arguments. TMPL should be the template into which tsubst'ing
21365 should occur for DECL, not the most general template.
21367 One reason for doing this is a scenario like this:
21370 void f(const T&, int i);
21372 void g() { f(3, 7); }
21375 void f(const T& t, const int i) { }
21377 Note that when the template is first instantiated, with
21378 instantiate_template, the resulting DECL will have no name for the
21379 first parameter, and the wrong type for the second. So, when we go
21380 to instantiate the DECL, we regenerate it. */
21383 regenerate_decl_from_template (tree decl
, tree tmpl
)
21385 /* The arguments used to instantiate DECL, from the most general
21390 args
= DECL_TI_ARGS (decl
);
21391 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
21393 /* Make sure that we can see identifiers, and compute access
21395 push_access_scope (decl
);
21397 if (TREE_CODE (decl
) == FUNCTION_DECL
)
21405 args_depth
= TMPL_ARGS_DEPTH (args
);
21406 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
21407 if (args_depth
> parms_depth
)
21408 args
= get_innermost_template_args (args
, parms_depth
);
21410 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
21411 args
, tf_error
, NULL_TREE
,
21412 /*defer_ok*/false);
21413 if (specs
&& specs
!= error_mark_node
)
21414 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
21417 /* Merge parameter declarations. */
21418 decl_parm
= skip_artificial_parms_for (decl
,
21419 DECL_ARGUMENTS (decl
));
21421 = skip_artificial_parms_for (code_pattern
,
21422 DECL_ARGUMENTS (code_pattern
));
21423 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
21428 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21429 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
21430 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
21432 parm_type
= type_decays_to (parm_type
);
21433 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21434 TREE_TYPE (decl_parm
) = parm_type
;
21435 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21436 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21438 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21439 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21441 decl_parm
= DECL_CHAIN (decl_parm
);
21442 pattern_parm
= DECL_CHAIN (pattern_parm
);
21444 /* Merge any parameters that match with the function parameter
21446 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
21449 tree expanded_types
;
21450 /* Expand the TYPE_PACK_EXPANSION that provides the types for
21451 the parameters in this function parameter pack. */
21452 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
21453 args
, tf_error
, NULL_TREE
);
21454 len
= TREE_VEC_LENGTH (expanded_types
);
21455 for (i
= 0; i
< len
; i
++)
21460 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
21461 /* Rename the parameter to include the index. */
21462 DECL_NAME (decl_parm
) =
21463 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
21464 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
21465 parm_type
= type_decays_to (parm_type
);
21466 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
21467 TREE_TYPE (decl_parm
) = parm_type
;
21468 attributes
= DECL_ATTRIBUTES (pattern_parm
);
21469 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
21471 DECL_ATTRIBUTES (decl_parm
) = attributes
;
21472 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
21474 decl_parm
= DECL_CHAIN (decl_parm
);
21477 /* Merge additional specifiers from the CODE_PATTERN. */
21478 if (DECL_DECLARED_INLINE_P (code_pattern
)
21479 && !DECL_DECLARED_INLINE_P (decl
))
21480 DECL_DECLARED_INLINE_P (decl
) = 1;
21482 else if (VAR_P (decl
))
21484 DECL_INITIAL (decl
) =
21485 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
21486 tf_error
, DECL_TI_TEMPLATE (decl
),
21487 /*integral_constant_expression_p=*/false);
21488 if (VAR_HAD_UNKNOWN_BOUND (decl
))
21489 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
21490 tf_error
, DECL_TI_TEMPLATE (decl
));
21493 gcc_unreachable ();
21495 pop_access_scope (decl
);
21498 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
21499 substituted to get DECL. */
21502 template_for_substitution (tree decl
)
21504 tree tmpl
= DECL_TI_TEMPLATE (decl
);
21506 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
21507 for the instantiation. This is not always the most general
21508 template. Consider, for example:
21511 struct S { template <class U> void f();
21512 template <> void f<int>(); };
21514 and an instantiation of S<double>::f<int>. We want TD to be the
21515 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
21516 while (/* An instantiation cannot have a definition, so we need a
21517 more general template. */
21518 DECL_TEMPLATE_INSTANTIATION (tmpl
)
21519 /* We must also deal with friend templates. Given:
21521 template <class T> struct S {
21522 template <class U> friend void f() {};
21525 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
21526 so far as the language is concerned, but that's still
21527 where we get the pattern for the instantiation from. On
21528 other hand, if the definition comes outside the class, say:
21530 template <class T> struct S {
21531 template <class U> friend void f();
21533 template <class U> friend void f() {}
21535 we don't need to look any further. That's what the check for
21536 DECL_INITIAL is for. */
21537 || (TREE_CODE (decl
) == FUNCTION_DECL
21538 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
21539 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
21541 /* The present template, TD, should not be a definition. If it
21542 were a definition, we should be using it! Note that we
21543 cannot restructure the loop to just keep going until we find
21544 a template with a definition, since that might go too far if
21545 a specialization was declared, but not defined. */
21547 /* Fetch the more general template. */
21548 tmpl
= DECL_TI_TEMPLATE (tmpl
);
21554 /* Returns true if we need to instantiate this template instance even if we
21555 know we aren't going to emit it. */
21558 always_instantiate_p (tree decl
)
21560 /* We always instantiate inline functions so that we can inline them. An
21561 explicit instantiation declaration prohibits implicit instantiation of
21562 non-inline functions. With high levels of optimization, we would
21563 normally inline non-inline functions -- but we're not allowed to do
21564 that for "extern template" functions. Therefore, we check
21565 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
21566 return ((TREE_CODE (decl
) == FUNCTION_DECL
21567 && (DECL_DECLARED_INLINE_P (decl
)
21568 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
21569 /* And we need to instantiate static data members so that
21570 their initializers are available in integral constant
21573 && decl_maybe_constant_var_p (decl
)));
21576 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
21577 instantiate it now, modifying TREE_TYPE (fn). */
21580 maybe_instantiate_noexcept (tree fn
)
21582 tree fntype
, spec
, noex
, clone
;
21584 /* Don't instantiate a noexcept-specification from template context. */
21585 if (processing_template_decl
)
21588 if (DECL_CLONED_FUNCTION_P (fn
))
21589 fn
= DECL_CLONED_FUNCTION (fn
);
21590 fntype
= TREE_TYPE (fn
);
21591 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
21593 if (!spec
|| !TREE_PURPOSE (spec
))
21596 noex
= TREE_PURPOSE (spec
);
21598 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
21600 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
21601 spec
= get_defaulted_eh_spec (fn
);
21602 else if (push_tinst_level (fn
))
21604 push_access_scope (fn
);
21605 push_deferring_access_checks (dk_no_deferred
);
21606 input_location
= DECL_SOURCE_LOCATION (fn
);
21607 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
21608 DEFERRED_NOEXCEPT_ARGS (noex
),
21609 tf_warning_or_error
, fn
,
21610 /*function_p=*/false,
21611 /*integral_constant_expression_p=*/true);
21612 pop_deferring_access_checks ();
21613 pop_access_scope (fn
);
21614 pop_tinst_level ();
21615 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
21616 if (spec
== error_mark_node
)
21617 spec
= noexcept_false_spec
;
21620 spec
= noexcept_false_spec
;
21622 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
21625 FOR_EACH_CLONE (clone
, fn
)
21627 if (TREE_TYPE (clone
) == fntype
)
21628 TREE_TYPE (clone
) = TREE_TYPE (fn
);
21630 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
21634 /* Produce the definition of D, a _DECL generated from a template. If
21635 DEFER_OK is nonzero, then we don't have to actually do the
21636 instantiation now; we just have to do it sometime. Normally it is
21637 an error if this is an explicit instantiation but D is undefined.
21638 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
21639 explicitly instantiated class template. */
21642 instantiate_decl (tree d
, int defer_ok
,
21643 bool expl_inst_class_mem_p
)
21645 tree tmpl
= DECL_TI_TEMPLATE (d
);
21652 bool pattern_defined
;
21653 location_t saved_loc
= input_location
;
21654 int saved_unevaluated_operand
= cp_unevaluated_operand
;
21655 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
21659 bool nested
= false;
21661 /* This function should only be used to instantiate templates for
21662 functions and static member variables. */
21663 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
21665 /* A concept is never instantiated. */
21666 gcc_assert (!DECL_DECLARED_CONCEPT_P (d
));
21668 /* Variables are never deferred; if instantiation is required, they
21669 are instantiated right away. That allows for better code in the
21670 case that an expression refers to the value of the variable --
21671 if the variable has a constant value the referring expression can
21672 take advantage of that fact. */
21674 || DECL_DECLARED_CONSTEXPR_P (d
))
21677 /* Don't instantiate cloned functions. Instead, instantiate the
21678 functions they cloned. */
21679 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
21680 d
= DECL_CLONED_FUNCTION (d
);
21682 if (DECL_TEMPLATE_INSTANTIATED (d
)
21683 || (TREE_CODE (d
) == FUNCTION_DECL
21684 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
21685 || DECL_TEMPLATE_SPECIALIZATION (d
))
21686 /* D has already been instantiated or explicitly specialized, so
21687 there's nothing for us to do here.
21689 It might seem reasonable to check whether or not D is an explicit
21690 instantiation, and, if so, stop here. But when an explicit
21691 instantiation is deferred until the end of the compilation,
21692 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
21693 the instantiation. */
21696 /* Check to see whether we know that this template will be
21697 instantiated in some other file, as with "extern template"
21699 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
21701 /* In general, we do not instantiate such templates. */
21702 if (external_p
&& !always_instantiate_p (d
))
21705 gen_tmpl
= most_general_template (tmpl
);
21706 gen_args
= impartial_args (tmpl
, DECL_TI_ARGS (d
));
21708 if (tmpl
!= gen_tmpl
)
21709 /* We should already have the extra args. */
21710 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
21711 == TMPL_ARGS_DEPTH (gen_args
));
21712 /* And what's in the hash table should match D. */
21713 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
21714 || spec
== NULL_TREE
);
21716 /* This needs to happen before any tsubsting. */
21717 if (! push_tinst_level (d
))
21720 timevar_push (TV_TEMPLATE_INST
);
21722 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
21723 for the instantiation. */
21724 td
= template_for_substitution (d
);
21725 code_pattern
= DECL_TEMPLATE_RESULT (td
);
21727 /* We should never be trying to instantiate a member of a class
21728 template or partial specialization. */
21729 gcc_assert (d
!= code_pattern
);
21731 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
21732 || DECL_TEMPLATE_SPECIALIZATION (td
))
21733 /* In the case of a friend template whose definition is provided
21734 outside the class, we may have too many arguments. Drop the
21735 ones we don't need. The same is true for specializations. */
21736 args
= get_innermost_template_args
21737 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
21741 if (TREE_CODE (d
) == FUNCTION_DECL
)
21743 deleted_p
= DECL_DELETED_FN (code_pattern
);
21744 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
21745 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
21751 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
21754 /* We may be in the middle of deferred access check. Disable it now. */
21755 push_deferring_access_checks (dk_no_deferred
);
21757 /* Unless an explicit instantiation directive has already determined
21758 the linkage of D, remember that a definition is available for
21760 if (pattern_defined
21761 && !DECL_INTERFACE_KNOWN (d
)
21762 && !DECL_NOT_REALLY_EXTERN (d
))
21763 mark_definable (d
);
21765 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
21766 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
21767 input_location
= DECL_SOURCE_LOCATION (d
);
21769 /* If D is a member of an explicitly instantiated class template,
21770 and no definition is available, treat it like an implicit
21772 if (!pattern_defined
&& expl_inst_class_mem_p
21773 && DECL_EXPLICIT_INSTANTIATION (d
))
21775 /* Leave linkage flags alone on instantiations with anonymous
21777 if (TREE_PUBLIC (d
))
21779 DECL_NOT_REALLY_EXTERN (d
) = 0;
21780 DECL_INTERFACE_KNOWN (d
) = 0;
21782 SET_DECL_IMPLICIT_INSTANTIATION (d
);
21785 /* Defer all other templates, unless we have been explicitly
21786 forbidden from doing so. */
21787 if (/* If there is no definition, we cannot instantiate the
21790 /* If it's OK to postpone instantiation, do so. */
21792 /* If this is a static data member that will be defined
21793 elsewhere, we don't want to instantiate the entire data
21794 member, but we do want to instantiate the initializer so that
21795 we can substitute that elsewhere. */
21796 || (external_p
&& VAR_P (d
))
21797 /* Handle here a deleted function too, avoid generating
21798 its body (c++/61080). */
21801 /* The definition of the static data member is now required so
21802 we must substitute the initializer. */
21804 && !DECL_INITIAL (d
)
21805 && DECL_INITIAL (code_pattern
))
21809 bool const_init
= false;
21810 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21812 ns
= decl_namespace_context (d
);
21813 push_nested_namespace (ns
);
21815 push_nested_class (DECL_CONTEXT (d
));
21816 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
21818 tf_warning_or_error
, NULL_TREE
,
21819 /*integral_constant_expression_p=*/false);
21820 /* If instantiating the initializer involved instantiating this
21821 again, don't call cp_finish_decl twice. */
21822 if (!DECL_INITIAL (d
))
21824 /* Make sure the initializer is still constant, in case of
21825 circular dependency (template/instantiate6.C). */
21827 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21828 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
21829 /*asmspec_tree=*/NULL_TREE
,
21830 LOOKUP_ONLYCONVERTING
);
21833 pop_nested_class ();
21834 pop_nested_namespace (ns
);
21837 /* We restore the source position here because it's used by
21838 add_pending_template. */
21839 input_location
= saved_loc
;
21841 if (at_eof
&& !pattern_defined
21842 && DECL_EXPLICIT_INSTANTIATION (d
)
21843 && DECL_NOT_REALLY_EXTERN (d
))
21846 The definition of a non-exported function template, a
21847 non-exported member function template, or a non-exported
21848 member function or static data member of a class template
21849 shall be present in every translation unit in which it is
21850 explicitly instantiated. */
21851 permerror (input_location
, "explicit instantiation of %qD "
21852 "but no definition available", d
);
21854 /* If we're in unevaluated context, we just wanted to get the
21855 constant value; this isn't an odr use, so don't queue
21856 a full instantiation. */
21857 if (cp_unevaluated_operand
!= 0)
21859 /* ??? Historically, we have instantiated inline functions, even
21860 when marked as "extern template". */
21861 if (!(external_p
&& VAR_P (d
)))
21862 add_pending_template (d
);
21865 /* Tell the repository that D is available in this translation unit
21866 -- and see if it is supposed to be instantiated here. */
21867 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
21869 /* In a PCH file, despite the fact that the repository hasn't
21870 requested instantiation in the PCH it is still possible that
21871 an instantiation will be required in a file that includes the
21874 add_pending_template (d
);
21875 /* Instantiate inline functions so that the inliner can do its
21876 job, even though we'll not be emitting a copy of this
21878 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
21882 fn_context
= decl_function_context (d
);
21883 nested
= (current_function_decl
!= NULL_TREE
);
21884 vec
<tree
> omp_privatization_save
;
21886 save_omp_privatization_clauses (omp_privatization_save
);
21889 push_to_top_level ();
21893 push_function_context ();
21894 cp_unevaluated_operand
= 0;
21895 c_inhibit_evaluation_warnings
= 0;
21898 /* Mark D as instantiated so that recursive calls to
21899 instantiate_decl do not try to instantiate it again. */
21900 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
21902 /* Regenerate the declaration in case the template has been modified
21903 by a subsequent redeclaration. */
21904 regenerate_decl_from_template (d
, td
);
21906 /* We already set the file and line above. Reset them now in case
21907 they changed as a result of calling regenerate_decl_from_template. */
21908 input_location
= DECL_SOURCE_LOCATION (d
);
21913 bool const_init
= false;
21915 /* Clear out DECL_RTL; whatever was there before may not be right
21916 since we've reset the type of the declaration. */
21917 SET_DECL_RTL (d
, NULL
);
21918 DECL_IN_AGGR_P (d
) = 0;
21920 /* The initializer is placed in DECL_INITIAL by
21921 regenerate_decl_from_template so we don't need to
21922 push/pop_access_scope again here. Pull it out so that
21923 cp_finish_decl can process it. */
21924 init
= DECL_INITIAL (d
);
21925 DECL_INITIAL (d
) = NULL_TREE
;
21926 DECL_INITIALIZED_P (d
) = 0;
21928 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
21929 initializer. That function will defer actual emission until
21930 we have a chance to determine linkage. */
21931 DECL_EXTERNAL (d
) = 0;
21933 /* Enter the scope of D so that access-checking works correctly. */
21934 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
21936 push_nested_class (DECL_CONTEXT (d
));
21938 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
21939 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
21942 pop_nested_class ();
21944 if (variable_template_p (td
))
21945 note_variable_template_instantiation (d
);
21947 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
21948 synthesize_method (d
);
21949 else if (TREE_CODE (d
) == FUNCTION_DECL
)
21951 hash_map
<tree
, tree
> *saved_local_specializations
;
21955 tree block
= NULL_TREE
;
21957 /* Save away the current list, in case we are instantiating one
21958 template from within the body of another. */
21959 saved_local_specializations
= local_specializations
;
21961 /* Set up the list of local specializations. */
21962 local_specializations
= new hash_map
<tree
, tree
>;
21964 /* Set up context. */
21965 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
21966 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
21967 block
= push_stmt_list ();
21969 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
21971 /* Some typedefs referenced from within the template code need to be
21972 access checked at template instantiation time, i.e now. These
21973 types were added to the template at parsing time. Let's get those
21974 and perform the access checks then. */
21975 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
21978 /* Create substitution entries for the parameters. */
21979 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
21980 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
21981 spec_parm
= DECL_ARGUMENTS (d
);
21982 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
21984 register_local_specialization (spec_parm
, tmpl_parm
);
21985 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
21986 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
21988 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
21990 if (!DECL_PACK_P (tmpl_parm
))
21992 register_local_specialization (spec_parm
, tmpl_parm
);
21993 spec_parm
= DECL_CHAIN (spec_parm
);
21997 /* Register the (value) argument pack as a specialization of
21998 TMPL_PARM, then move on. */
21999 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
22000 register_local_specialization (argpack
, tmpl_parm
);
22003 gcc_assert (!spec_parm
);
22005 /* Substitute into the body of the function. */
22006 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
22007 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
22008 tf_warning_or_error
, tmpl
);
22011 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
22012 tf_warning_or_error
, tmpl
,
22013 /*integral_constant_expression_p=*/false);
22015 /* Set the current input_location to the end of the function
22016 so that finish_function knows where we are. */
22018 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
22020 /* Remember if we saw an infinite loop in the template. */
22021 current_function_infinite_loop
22022 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
22025 /* We don't need the local specializations any more. */
22026 delete local_specializations
;
22027 local_specializations
= saved_local_specializations
;
22029 /* Finish the function. */
22030 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
22031 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
22032 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
22035 d
= finish_function (0);
22036 expand_or_defer_fn (d
);
22039 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
22040 cp_check_omp_declare_reduction (d
);
22043 /* We're not deferring instantiation any more. */
22044 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
22047 pop_from_top_level ();
22049 pop_function_context ();
22052 input_location
= saved_loc
;
22053 cp_unevaluated_operand
= saved_unevaluated_operand
;
22054 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
22055 pop_deferring_access_checks ();
22056 pop_tinst_level ();
22058 restore_omp_privatization_clauses (omp_privatization_save
);
22060 timevar_pop (TV_TEMPLATE_INST
);
22065 /* Run through the list of templates that we wish we could
22066 instantiate, and instantiate any we can. RETRIES is the
22067 number of times we retry pending template instantiation. */
22070 instantiate_pending_templates (int retries
)
22073 location_t saved_loc
= input_location
;
22075 /* Instantiating templates may trigger vtable generation. This in turn
22076 may require further template instantiations. We place a limit here
22077 to avoid infinite loop. */
22078 if (pending_templates
&& retries
>= max_tinst_depth
)
22080 tree decl
= pending_templates
->tinst
->decl
;
22082 fatal_error (input_location
,
22083 "template instantiation depth exceeds maximum of %d"
22084 " instantiating %q+D, possibly from virtual table generation"
22085 " (use -ftemplate-depth= to increase the maximum)",
22086 max_tinst_depth
, decl
);
22087 if (TREE_CODE (decl
) == FUNCTION_DECL
)
22088 /* Pretend that we defined it. */
22089 DECL_INITIAL (decl
) = error_mark_node
;
22095 struct pending_template
**t
= &pending_templates
;
22096 struct pending_template
*last
= NULL
;
22100 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
22101 bool complete
= false;
22103 if (TYPE_P (instantiation
))
22107 if (!COMPLETE_TYPE_P (instantiation
))
22109 instantiate_class_template (instantiation
);
22110 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
22111 for (fn
= TYPE_METHODS (instantiation
);
22113 fn
= TREE_CHAIN (fn
))
22114 if (! DECL_ARTIFICIAL (fn
))
22115 instantiate_decl (fn
,
22117 /*expl_inst_class_mem_p=*/false);
22118 if (COMPLETE_TYPE_P (instantiation
))
22122 complete
= COMPLETE_TYPE_P (instantiation
);
22126 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
22127 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
22130 = instantiate_decl (instantiation
,
22132 /*expl_inst_class_mem_p=*/false);
22133 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
22137 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
22138 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
22142 /* If INSTANTIATION has been instantiated, then we don't
22143 need to consider it again in the future. */
22151 current_tinst_level
= NULL
;
22153 last_pending_template
= last
;
22155 while (reconsider
);
22157 input_location
= saved_loc
;
22160 /* Substitute ARGVEC into T, which is a list of initializers for
22161 either base class or a non-static data member. The TREE_PURPOSEs
22162 are DECLs, and the TREE_VALUEs are the initializer values. Used by
22163 instantiate_decl. */
22166 tsubst_initializer_list (tree t
, tree argvec
)
22168 tree inits
= NULL_TREE
;
22170 for (; t
; t
= TREE_CHAIN (t
))
22174 tree expanded_bases
= NULL_TREE
;
22175 tree expanded_arguments
= NULL_TREE
;
22178 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
22183 /* Expand the base class expansion type into separate base
22185 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
22186 tf_warning_or_error
,
22188 if (expanded_bases
== error_mark_node
)
22191 /* We'll be building separate TREE_LISTs of arguments for
22193 len
= TREE_VEC_LENGTH (expanded_bases
);
22194 expanded_arguments
= make_tree_vec (len
);
22195 for (i
= 0; i
< len
; i
++)
22196 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
22198 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
22199 expand each argument in the TREE_VALUE of t. */
22200 expr
= make_node (EXPR_PACK_EXPANSION
);
22201 PACK_EXPANSION_LOCAL_P (expr
) = true;
22202 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
22203 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
22205 if (TREE_VALUE (t
) == void_type_node
)
22206 /* VOID_TYPE_NODE is used to indicate
22207 value-initialization. */
22209 for (i
= 0; i
< len
; i
++)
22210 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
22214 /* Substitute parameter packs into each argument in the
22216 in_base_initializer
= 1;
22217 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
22219 tree expanded_exprs
;
22221 /* Expand the argument. */
22222 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
22224 = tsubst_pack_expansion (expr
, argvec
,
22225 tf_warning_or_error
,
22227 if (expanded_exprs
== error_mark_node
)
22230 /* Prepend each of the expanded expressions to the
22231 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
22232 for (i
= 0; i
< len
; i
++)
22234 TREE_VEC_ELT (expanded_arguments
, i
) =
22235 tree_cons (NULL_TREE
,
22236 TREE_VEC_ELT (expanded_exprs
, i
),
22237 TREE_VEC_ELT (expanded_arguments
, i
));
22240 in_base_initializer
= 0;
22242 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
22243 since we built them backwards. */
22244 for (i
= 0; i
< len
; i
++)
22246 TREE_VEC_ELT (expanded_arguments
, i
) =
22247 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
22252 for (i
= 0; i
< len
; ++i
)
22254 if (expanded_bases
)
22256 decl
= TREE_VEC_ELT (expanded_bases
, i
);
22257 decl
= expand_member_init (decl
);
22258 init
= TREE_VEC_ELT (expanded_arguments
, i
);
22263 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
22264 tf_warning_or_error
, NULL_TREE
);
22266 decl
= expand_member_init (decl
);
22267 if (decl
&& !DECL_P (decl
))
22268 in_base_initializer
= 1;
22270 init
= TREE_VALUE (t
);
22272 if (init
!= void_type_node
)
22273 init
= tsubst_expr (init
, argvec
,
22274 tf_warning_or_error
, NULL_TREE
,
22275 /*integral_constant_expression_p=*/false);
22276 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
22277 /* If we had an initializer but it instantiated to nothing,
22278 value-initialize the object. This will only occur when
22279 the initializer was a pack expansion where the parameter
22280 packs used in that expansion were of length zero. */
22281 init
= void_type_node
;
22282 in_base_initializer
= 0;
22287 init
= build_tree_list (decl
, init
);
22288 TREE_CHAIN (init
) = inits
;
22296 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
22299 set_current_access_from_decl (tree decl
)
22301 if (TREE_PRIVATE (decl
))
22302 current_access_specifier
= access_private_node
;
22303 else if (TREE_PROTECTED (decl
))
22304 current_access_specifier
= access_protected_node
;
22306 current_access_specifier
= access_public_node
;
22309 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
22310 is the instantiation (which should have been created with
22311 start_enum) and ARGS are the template arguments to use. */
22314 tsubst_enum (tree tag
, tree newtag
, tree args
)
22318 if (SCOPED_ENUM_P (newtag
))
22319 begin_scope (sk_scoped_enum
, newtag
);
22321 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
22326 decl
= TREE_VALUE (e
);
22327 /* Note that in a template enum, the TREE_VALUE is the
22328 CONST_DECL, not the corresponding INTEGER_CST. */
22329 value
= tsubst_expr (DECL_INITIAL (decl
),
22330 args
, tf_warning_or_error
, NULL_TREE
,
22331 /*integral_constant_expression_p=*/true);
22333 /* Give this enumeration constant the correct access. */
22334 set_current_access_from_decl (decl
);
22336 /* Actually build the enumerator itself. Here we're assuming that
22337 enumerators can't have dependent attributes. */
22338 build_enumerator (DECL_NAME (decl
), value
, newtag
,
22339 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
22342 if (SCOPED_ENUM_P (newtag
))
22345 finish_enum_value_list (newtag
);
22346 finish_enum (newtag
);
22348 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
22349 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
22352 /* DECL is a FUNCTION_DECL that is a template specialization. Return
22353 its type -- but without substituting the innermost set of template
22354 arguments. So, innermost set of template parameters will appear in
22358 get_mostly_instantiated_function_type (tree decl
)
22360 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
22361 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
22364 /* Return truthvalue if we're processing a template different from
22365 the last one involved in diagnostics. */
22367 problematic_instantiation_changed (void)
22369 return current_tinst_level
!= last_error_tinst_level
;
22372 /* Remember current template involved in diagnostics. */
22374 record_last_problematic_instantiation (void)
22376 last_error_tinst_level
= current_tinst_level
;
22379 struct tinst_level
*
22380 current_instantiation (void)
22382 return current_tinst_level
;
22385 /* Return TRUE if current_function_decl is being instantiated, false
22389 instantiating_current_function_p (void)
22391 return (current_instantiation ()
22392 && current_instantiation ()->decl
== current_function_decl
);
22395 /* [temp.param] Check that template non-type parm TYPE is of an allowable
22396 type. Return zero for ok, nonzero for disallowed. Issue error and
22397 warning messages under control of COMPLAIN. */
22400 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
22402 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
22404 else if (POINTER_TYPE_P (type
))
22406 else if (TYPE_PTRMEM_P (type
))
22408 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
22410 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
22412 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
22414 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
22416 /* A bound template template parm could later be instantiated to have a valid
22417 nontype parm type via an alias template. */
22418 else if (cxx_dialect
>= cxx11
22419 && TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22422 if (complain
& tf_error
)
22424 if (type
== error_mark_node
)
22425 inform (input_location
, "invalid template non-type parameter");
22427 error ("%q#T is not a valid type for a template non-type parameter",
22433 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
22434 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
22437 dependent_type_p_r (tree type
)
22443 A type is dependent if it is:
22445 -- a template parameter. Template template parameters are types
22446 for us (since TYPE_P holds true for them) so we handle
22448 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22449 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
22451 /* -- a qualified-id with a nested-name-specifier which contains a
22452 class-name that names a dependent type or whose unqualified-id
22453 names a dependent type. */
22454 if (TREE_CODE (type
) == TYPENAME_TYPE
)
22457 /* An alias template specialization can be dependent even if the
22458 resulting type is not. */
22459 if (dependent_alias_template_spec_p (type
))
22462 /* -- a cv-qualified type where the cv-unqualified type is
22464 No code is necessary for this bullet; the code below handles
22465 cv-qualified types, and we don't want to strip aliases with
22466 TYPE_MAIN_VARIANT because of DR 1558. */
22467 /* -- a compound type constructed from any dependent type. */
22468 if (TYPE_PTRMEM_P (type
))
22469 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
22470 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
22472 else if (TYPE_PTR_P (type
)
22473 || TREE_CODE (type
) == REFERENCE_TYPE
)
22474 return dependent_type_p (TREE_TYPE (type
));
22475 else if (TREE_CODE (type
) == FUNCTION_TYPE
22476 || TREE_CODE (type
) == METHOD_TYPE
)
22480 if (dependent_type_p (TREE_TYPE (type
)))
22482 for (arg_type
= TYPE_ARG_TYPES (type
);
22484 arg_type
= TREE_CHAIN (arg_type
))
22485 if (dependent_type_p (TREE_VALUE (arg_type
)))
22489 /* -- an array type constructed from any dependent type or whose
22490 size is specified by a constant expression that is
22493 We checked for type- and value-dependence of the bounds in
22494 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
22495 if (TREE_CODE (type
) == ARRAY_TYPE
)
22497 if (TYPE_DOMAIN (type
)
22498 && dependent_type_p (TYPE_DOMAIN (type
)))
22500 return dependent_type_p (TREE_TYPE (type
));
22503 /* -- a template-id in which either the template name is a template
22505 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
22507 /* ... or any of the template arguments is a dependent type or
22508 an expression that is type-dependent or value-dependent. */
22509 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
22510 && (any_dependent_template_arguments_p
22511 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
22514 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
22515 dependent; if the argument of the `typeof' expression is not
22516 type-dependent, then it should already been have resolved. */
22517 if (TREE_CODE (type
) == TYPEOF_TYPE
22518 || TREE_CODE (type
) == DECLTYPE_TYPE
22519 || TREE_CODE (type
) == UNDERLYING_TYPE
)
22522 /* A template argument pack is dependent if any of its packed
22524 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
22526 tree args
= ARGUMENT_PACK_ARGS (type
);
22527 int i
, len
= TREE_VEC_LENGTH (args
);
22528 for (i
= 0; i
< len
; ++i
)
22529 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
22533 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
22534 be template parameters. */
22535 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
22538 /* The standard does not specifically mention types that are local
22539 to template functions or local classes, but they should be
22540 considered dependent too. For example:
22542 template <int I> void f() {
22547 The size of `E' cannot be known until the value of `I' has been
22548 determined. Therefore, `E' must be considered dependent. */
22549 scope
= TYPE_CONTEXT (type
);
22550 if (scope
&& TYPE_P (scope
))
22551 return dependent_type_p (scope
);
22552 /* Don't use type_dependent_expression_p here, as it can lead
22553 to infinite recursion trying to determine whether a lambda
22554 nested in a lambda is dependent (c++/47687). */
22555 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
22556 && DECL_LANG_SPECIFIC (scope
)
22557 && DECL_TEMPLATE_INFO (scope
)
22558 && (any_dependent_template_arguments_p
22559 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
22562 /* Other types are non-dependent. */
22566 /* Returns TRUE if TYPE is dependent, in the sense of
22567 [temp.dep.type]. Note that a NULL type is considered dependent. */
22570 dependent_type_p (tree type
)
22572 /* If there are no template parameters in scope, then there can't be
22573 any dependent types. */
22574 if (!processing_template_decl
)
22576 /* If we are not processing a template, then nobody should be
22577 providing us with a dependent type. */
22579 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
22583 /* If the type is NULL, we have not computed a type for the entity
22584 in question; in that case, the type is dependent. */
22588 /* Erroneous types can be considered non-dependent. */
22589 if (type
== error_mark_node
)
22592 /* If we have not already computed the appropriate value for TYPE,
22594 if (!TYPE_DEPENDENT_P_VALID (type
))
22596 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
22597 TYPE_DEPENDENT_P_VALID (type
) = 1;
22600 return TYPE_DEPENDENT_P (type
);
22603 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
22604 lookup. In other words, a dependent type that is not the current
22608 dependent_scope_p (tree scope
)
22610 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
22611 && !currently_open_class (scope
));
22614 /* T is a SCOPE_REF; return whether we need to consider it
22615 instantiation-dependent so that we can check access at instantiation
22616 time even though we know which member it resolves to. */
22619 instantiation_dependent_scope_ref_p (tree t
)
22621 if (DECL_P (TREE_OPERAND (t
, 1))
22622 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
22623 && accessible_in_template_p (TREE_OPERAND (t
, 0),
22624 TREE_OPERAND (t
, 1)))
22630 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
22631 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
22634 /* Note that this predicate is not appropriate for general expressions;
22635 only constant expressions (that satisfy potential_constant_expression)
22636 can be tested for value dependence. */
22639 value_dependent_expression_p (tree expression
)
22641 if (!processing_template_decl
)
22644 /* A name declared with a dependent type. */
22645 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
22648 switch (TREE_CODE (expression
))
22650 case IDENTIFIER_NODE
:
22651 /* A name that has not been looked up -- must be dependent. */
22654 case TEMPLATE_PARM_INDEX
:
22655 /* A non-type template parm. */
22659 /* A non-type template parm. */
22660 if (DECL_TEMPLATE_PARM_P (expression
))
22662 return value_dependent_expression_p (DECL_INITIAL (expression
));
22665 /* A constant with literal type and is initialized
22666 with an expression that is value-dependent.
22668 Note that a non-dependent parenthesized initializer will have
22669 already been replaced with its constant value, so if we see
22670 a TREE_LIST it must be dependent. */
22671 if (DECL_INITIAL (expression
)
22672 && decl_constant_var_p (expression
)
22673 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
22674 /* cp_finish_decl doesn't fold reference initializers. */
22675 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
22676 || value_dependent_expression_p (DECL_INITIAL (expression
))))
22680 case DYNAMIC_CAST_EXPR
:
22681 case STATIC_CAST_EXPR
:
22682 case CONST_CAST_EXPR
:
22683 case REINTERPRET_CAST_EXPR
:
22685 /* These expressions are value-dependent if the type to which
22686 the cast occurs is dependent or the expression being casted
22687 is value-dependent. */
22689 tree type
= TREE_TYPE (expression
);
22691 if (dependent_type_p (type
))
22694 /* A functional cast has a list of operands. */
22695 expression
= TREE_OPERAND (expression
, 0);
22698 /* If there are no operands, it must be an expression such
22699 as "int()". This should not happen for aggregate types
22700 because it would form non-constant expressions. */
22701 gcc_assert (cxx_dialect
>= cxx11
22702 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
22707 if (TREE_CODE (expression
) == TREE_LIST
)
22708 return any_value_dependent_elements_p (expression
);
22710 return value_dependent_expression_p (expression
);
22714 if (SIZEOF_EXPR_TYPE_P (expression
))
22715 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
22719 /* A `sizeof' expression is value-dependent if the operand is
22720 type-dependent or is a pack expansion. */
22721 expression
= TREE_OPERAND (expression
, 0);
22722 if (PACK_EXPANSION_P (expression
))
22724 else if (TYPE_P (expression
))
22725 return dependent_type_p (expression
);
22726 return instantiation_dependent_expression_p (expression
);
22728 case AT_ENCODE_EXPR
:
22729 /* An 'encode' expression is value-dependent if the operand is
22731 expression
= TREE_OPERAND (expression
, 0);
22732 return dependent_type_p (expression
);
22734 case NOEXCEPT_EXPR
:
22735 expression
= TREE_OPERAND (expression
, 0);
22736 return instantiation_dependent_expression_p (expression
);
22739 /* All instantiation-dependent expressions should also be considered
22740 value-dependent. */
22741 return instantiation_dependent_scope_ref_p (expression
);
22743 case COMPONENT_REF
:
22744 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
22745 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
22747 case NONTYPE_ARGUMENT_PACK
:
22748 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
22749 is value-dependent. */
22751 tree values
= ARGUMENT_PACK_ARGS (expression
);
22752 int i
, len
= TREE_VEC_LENGTH (values
);
22754 for (i
= 0; i
< len
; ++i
)
22755 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
22763 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
22764 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
22765 || (type2
? dependent_type_p (type2
) : false));
22769 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22770 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
22773 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
22774 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
22778 tree op
= TREE_OPERAND (expression
, 0);
22779 return (value_dependent_expression_p (op
)
22780 || has_value_dependent_address (op
));
22783 case REQUIRES_EXPR
:
22784 /* Treat all requires-expressions as value-dependent so
22785 we don't try to fold them. */
22789 return dependent_type_p (TREE_OPERAND (expression
, 0));
22793 tree fn
= get_callee_fndecl (expression
);
22795 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
22797 nargs
= call_expr_nargs (expression
);
22798 for (i
= 0; i
< nargs
; ++i
)
22800 tree op
= CALL_EXPR_ARG (expression
, i
);
22801 /* In a call to a constexpr member function, look through the
22802 implicit ADDR_EXPR on the object argument so that it doesn't
22803 cause the call to be considered value-dependent. We also
22804 look through it in potential_constant_expression. */
22805 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
22806 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
22807 && TREE_CODE (op
) == ADDR_EXPR
)
22808 op
= TREE_OPERAND (op
, 0);
22809 if (value_dependent_expression_p (op
))
22815 case TEMPLATE_ID_EXPR
:
22816 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
22818 return type_dependent_expression_p (expression
)
22819 || variable_concept_p (TREE_OPERAND (expression
, 0));
22825 if (dependent_type_p (TREE_TYPE (expression
)))
22827 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
22828 if (value_dependent_expression_p (val
))
22834 /* Treat a GNU statement expression as dependent to avoid crashing
22835 under instantiate_non_dependent_expr; it can't be constant. */
22839 /* A constant expression is value-dependent if any subexpression is
22840 value-dependent. */
22841 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
22843 case tcc_reference
:
22845 case tcc_comparison
:
22847 case tcc_expression
:
22850 int i
, len
= cp_tree_operand_length (expression
);
22852 for (i
= 0; i
< len
; i
++)
22854 tree t
= TREE_OPERAND (expression
, i
);
22856 /* In some cases, some of the operands may be missing.l
22857 (For example, in the case of PREDECREMENT_EXPR, the
22858 amount to increment by may be missing.) That doesn't
22859 make the expression dependent. */
22860 if (t
&& value_dependent_expression_p (t
))
22871 /* The expression is not value-dependent. */
22875 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
22876 [temp.dep.expr]. Note that an expression with no type is
22877 considered dependent. Other parts of the compiler arrange for an
22878 expression with type-dependent subexpressions to have no type, so
22879 this function doesn't have to be fully recursive. */
22882 type_dependent_expression_p (tree expression
)
22884 if (!processing_template_decl
)
22887 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
22890 /* An unresolved name is always dependent. */
22891 if (identifier_p (expression
)
22892 || TREE_CODE (expression
) == USING_DECL
22893 || TREE_CODE (expression
) == WILDCARD_DECL
)
22896 /* A fold expression is type-dependent. */
22897 if (TREE_CODE (expression
) == UNARY_LEFT_FOLD_EXPR
22898 || TREE_CODE (expression
) == UNARY_RIGHT_FOLD_EXPR
22899 || TREE_CODE (expression
) == BINARY_LEFT_FOLD_EXPR
22900 || TREE_CODE (expression
) == BINARY_RIGHT_FOLD_EXPR
)
22903 /* Some expression forms are never type-dependent. */
22904 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
22905 || TREE_CODE (expression
) == SIZEOF_EXPR
22906 || TREE_CODE (expression
) == ALIGNOF_EXPR
22907 || TREE_CODE (expression
) == AT_ENCODE_EXPR
22908 || TREE_CODE (expression
) == NOEXCEPT_EXPR
22909 || TREE_CODE (expression
) == TRAIT_EXPR
22910 || TREE_CODE (expression
) == TYPEID_EXPR
22911 || TREE_CODE (expression
) == DELETE_EXPR
22912 || TREE_CODE (expression
) == VEC_DELETE_EXPR
22913 || TREE_CODE (expression
) == THROW_EXPR
22914 || TREE_CODE (expression
) == REQUIRES_EXPR
)
22917 /* The types of these expressions depends only on the type to which
22918 the cast occurs. */
22919 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
22920 || TREE_CODE (expression
) == STATIC_CAST_EXPR
22921 || TREE_CODE (expression
) == CONST_CAST_EXPR
22922 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
22923 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
22924 || TREE_CODE (expression
) == CAST_EXPR
)
22925 return dependent_type_p (TREE_TYPE (expression
));
22927 /* The types of these expressions depends only on the type created
22928 by the expression. */
22929 if (TREE_CODE (expression
) == NEW_EXPR
22930 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
22932 /* For NEW_EXPR tree nodes created inside a template, either
22933 the object type itself or a TREE_LIST may appear as the
22935 tree type
= TREE_OPERAND (expression
, 1);
22936 if (TREE_CODE (type
) == TREE_LIST
)
22937 /* This is an array type. We need to check array dimensions
22939 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
22940 || value_dependent_expression_p
22941 (TREE_OPERAND (TREE_VALUE (type
), 1));
22943 return dependent_type_p (type
);
22946 if (TREE_CODE (expression
) == SCOPE_REF
)
22948 tree scope
= TREE_OPERAND (expression
, 0);
22949 tree name
= TREE_OPERAND (expression
, 1);
22951 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
22952 contains an identifier associated by name lookup with one or more
22953 declarations declared with a dependent type, or...a
22954 nested-name-specifier or qualified-id that names a member of an
22955 unknown specialization. */
22956 return (type_dependent_expression_p (name
)
22957 || dependent_scope_p (scope
));
22960 /* A function template specialization is type-dependent if it has any
22961 dependent template arguments. */
22962 if (TREE_CODE (expression
) == FUNCTION_DECL
22963 && DECL_LANG_SPECIFIC (expression
)
22964 && DECL_TEMPLATE_INFO (expression
))
22965 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
22967 if (TREE_CODE (expression
) == TEMPLATE_DECL
22968 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
22971 if (TREE_CODE (expression
) == STMT_EXPR
)
22972 expression
= stmt_expr_value_expr (expression
);
22974 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
22979 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
22981 if (type_dependent_expression_p (elt
))
22987 /* A static data member of the current instantiation with incomplete
22988 array type is type-dependent, as the definition and specializations
22989 can have different bounds. */
22990 if (VAR_P (expression
)
22991 && DECL_CLASS_SCOPE_P (expression
)
22992 && dependent_type_p (DECL_CONTEXT (expression
))
22993 && VAR_HAD_UNKNOWN_BOUND (expression
))
22996 /* An array of unknown bound depending on a variadic parameter, eg:
22998 template<typename... Args>
22999 void foo (Args... args)
23001 int arr[] = { args... };
23004 template<int... vals>
23007 int arr[] = { vals... };
23010 If the array has no length and has an initializer, it must be that
23011 we couldn't determine its length in cp_complete_array_type because
23012 it is dependent. */
23013 if (VAR_P (expression
)
23014 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
23015 && !TYPE_DOMAIN (TREE_TYPE (expression
))
23016 && DECL_INITIAL (expression
))
23019 /* A variable template specialization is type-dependent if it has any
23020 dependent template arguments. */
23021 if (VAR_P (expression
)
23022 && DECL_LANG_SPECIFIC (expression
)
23023 && DECL_TEMPLATE_INFO (expression
)
23024 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
23025 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
23027 /* Always dependent, on the number of arguments if nothing else. */
23028 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
23031 if (TREE_TYPE (expression
) == unknown_type_node
)
23033 if (TREE_CODE (expression
) == ADDR_EXPR
)
23034 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
23035 if (TREE_CODE (expression
) == COMPONENT_REF
23036 || TREE_CODE (expression
) == OFFSET_REF
)
23038 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
23040 expression
= TREE_OPERAND (expression
, 1);
23041 if (identifier_p (expression
))
23044 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
23045 if (TREE_CODE (expression
) == SCOPE_REF
)
23048 if (BASELINK_P (expression
))
23050 if (BASELINK_OPTYPE (expression
)
23051 && dependent_type_p (BASELINK_OPTYPE (expression
)))
23053 expression
= BASELINK_FUNCTIONS (expression
);
23056 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
23058 if (any_dependent_template_arguments_p
23059 (TREE_OPERAND (expression
, 1)))
23061 expression
= TREE_OPERAND (expression
, 0);
23062 if (identifier_p (expression
))
23066 gcc_assert (TREE_CODE (expression
) == OVERLOAD
23067 || TREE_CODE (expression
) == FUNCTION_DECL
);
23071 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
23073 expression
= OVL_NEXT (expression
);
23078 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
23080 return (dependent_type_p (TREE_TYPE (expression
)));
23083 /* walk_tree callback function for instantiation_dependent_expression_p,
23084 below. Returns non-zero if a dependent subexpression is found. */
23087 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
23092 /* We don't have to worry about decltype currently because decltype
23093 of an instantiation-dependent expr is a dependent type. This
23094 might change depending on the resolution of DR 1172. */
23095 *walk_subtrees
= false;
23098 enum tree_code code
= TREE_CODE (*tp
);
23101 /* Don't treat an argument list as dependent just because it has no
23109 /* A constant with a dependent initializer is dependent. */
23110 if (value_dependent_expression_p (*tp
))
23114 case TEMPLATE_PARM_INDEX
:
23117 /* Handle expressions with type operands. */
23121 case AT_ENCODE_EXPR
:
23123 tree op
= TREE_OPERAND (*tp
, 0);
23124 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
23125 op
= TREE_TYPE (op
);
23128 if (dependent_type_p (op
))
23132 *walk_subtrees
= false;
23140 if (value_dependent_expression_p (*tp
))
23142 *walk_subtrees
= false;
23145 case COMPONENT_REF
:
23146 if (identifier_p (TREE_OPERAND (*tp
, 1)))
23147 /* In a template, finish_class_member_access_expr creates a
23148 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
23149 type-dependent, so that we can check access control at
23150 instantiation time (PR 42277). See also Core issue 1273. */
23155 if (instantiation_dependent_scope_ref_p (*tp
))
23160 /* Treat statement-expressions as dependent. */
23164 /* Treat requires-expressions as dependent. */
23165 case REQUIRES_EXPR
:
23169 /* Treat calls to function concepts as dependent. */
23170 if (function_concept_check_p (*tp
))
23174 case TEMPLATE_ID_EXPR
:
23175 /* And variable concepts. */
23176 if (variable_concept_p (TREE_OPERAND (*tp
, 0)))
23184 if (type_dependent_expression_p (*tp
))
23190 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
23191 sense defined by the ABI:
23193 "An expression is instantiation-dependent if it is type-dependent
23194 or value-dependent, or it has a subexpression that is type-dependent
23195 or value-dependent." */
23198 instantiation_dependent_expression_p (tree expression
)
23202 if (!processing_template_decl
)
23205 if (expression
== error_mark_node
)
23208 result
= cp_walk_tree_without_duplicates (&expression
,
23209 instantiation_dependent_r
, NULL
);
23210 return result
!= NULL_TREE
;
23213 /* Like type_dependent_expression_p, but it also works while not processing
23214 a template definition, i.e. during substitution or mangling. */
23217 type_dependent_expression_p_push (tree expr
)
23220 ++processing_template_decl
;
23221 b
= type_dependent_expression_p (expr
);
23222 --processing_template_decl
;
23226 /* Returns TRUE if ARGS contains a type-dependent expression. */
23229 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
23234 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
23236 if (type_dependent_expression_p (arg
))
23242 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23243 expressions) contains any type-dependent expressions. */
23246 any_type_dependent_elements_p (const_tree list
)
23248 for (; list
; list
= TREE_CHAIN (list
))
23249 if (type_dependent_expression_p (TREE_VALUE (list
)))
23255 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
23256 expressions) contains any value-dependent expressions. */
23259 any_value_dependent_elements_p (const_tree list
)
23261 for (; list
; list
= TREE_CHAIN (list
))
23262 if (value_dependent_expression_p (TREE_VALUE (list
)))
23268 /* Returns TRUE if the ARG (a template argument) is dependent. */
23271 dependent_template_arg_p (tree arg
)
23273 if (!processing_template_decl
)
23276 /* Assume a template argument that was wrongly written by the user
23277 is dependent. This is consistent with what
23278 any_dependent_template_arguments_p [that calls this function]
23280 if (!arg
|| arg
== error_mark_node
)
23283 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
23284 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
23286 if (TREE_CODE (arg
) == TEMPLATE_DECL
23287 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
23288 return dependent_template_p (arg
);
23289 else if (ARGUMENT_PACK_P (arg
))
23291 tree args
= ARGUMENT_PACK_ARGS (arg
);
23292 int i
, len
= TREE_VEC_LENGTH (args
);
23293 for (i
= 0; i
< len
; ++i
)
23295 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
23301 else if (TYPE_P (arg
))
23302 return dependent_type_p (arg
);
23304 return (type_dependent_expression_p (arg
)
23305 || value_dependent_expression_p (arg
));
23308 /* Returns true if ARGS (a collection of template arguments) contains
23309 any types that require structural equality testing. */
23312 any_template_arguments_need_structural_equality_p (tree args
)
23319 if (args
== error_mark_node
)
23322 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23324 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23325 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23327 tree arg
= TREE_VEC_ELT (level
, j
);
23328 tree packed_args
= NULL_TREE
;
23331 if (ARGUMENT_PACK_P (arg
))
23333 /* Look inside the argument pack. */
23334 packed_args
= ARGUMENT_PACK_ARGS (arg
);
23335 len
= TREE_VEC_LENGTH (packed_args
);
23338 for (k
= 0; k
< len
; ++k
)
23341 arg
= TREE_VEC_ELT (packed_args
, k
);
23343 if (error_operand_p (arg
))
23345 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
23347 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
23349 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
23350 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
23359 /* Returns true if ARGS (a collection of template arguments) contains
23360 any dependent arguments. */
23363 any_dependent_template_arguments_p (const_tree args
)
23370 if (args
== error_mark_node
)
23373 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
23375 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
23376 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
23377 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
23384 /* Returns TRUE if the template TMPL is dependent. */
23387 dependent_template_p (tree tmpl
)
23389 if (TREE_CODE (tmpl
) == OVERLOAD
)
23393 if (dependent_template_p (OVL_CURRENT (tmpl
)))
23395 tmpl
= OVL_NEXT (tmpl
);
23400 /* Template template parameters are dependent. */
23401 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
23402 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
23404 /* So are names that have not been looked up. */
23405 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
23407 /* So are member templates of dependent classes. */
23408 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
23409 return dependent_type_p (DECL_CONTEXT (tmpl
));
23413 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
23416 dependent_template_id_p (tree tmpl
, tree args
)
23418 return (dependent_template_p (tmpl
)
23419 || any_dependent_template_arguments_p (args
));
23422 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
23426 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
23430 if (!processing_template_decl
)
23433 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
23435 tree decl
= TREE_VEC_ELT (declv
, i
);
23436 tree init
= TREE_VEC_ELT (initv
, i
);
23437 tree cond
= TREE_VEC_ELT (condv
, i
);
23438 tree incr
= TREE_VEC_ELT (incrv
, i
);
23440 if (type_dependent_expression_p (decl
)
23441 || TREE_CODE (decl
) == SCOPE_REF
)
23444 if (init
&& type_dependent_expression_p (init
))
23447 if (type_dependent_expression_p (cond
))
23450 if (COMPARISON_CLASS_P (cond
)
23451 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
23452 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
23455 if (TREE_CODE (incr
) == MODOP_EXPR
)
23457 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
23458 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
23461 else if (type_dependent_expression_p (incr
))
23463 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
23465 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
23467 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
23469 tree t
= TREE_OPERAND (incr
, 1);
23470 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
23471 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
23480 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
23481 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
23482 no such TYPE can be found. Note that this function peers inside
23483 uninstantiated templates and therefore should be used only in
23484 extremely limited situations. ONLY_CURRENT_P restricts this
23485 peering to the currently open classes hierarchy (which is required
23486 when comparing types). */
23489 resolve_typename_type (tree type
, bool only_current_p
)
23498 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
23500 scope
= TYPE_CONTEXT (type
);
23501 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
23502 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
23503 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
23504 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
23505 identifier of the TYPENAME_TYPE anymore.
23506 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
23507 TYPENAME_TYPE instead, we avoid messing up with a possible
23508 typedef variant case. */
23509 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
23511 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
23512 it first before we can figure out what NAME refers to. */
23513 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23515 if (TYPENAME_IS_RESOLVING_P (scope
))
23516 /* Given a class template A with a dependent base with nested type C,
23517 typedef typename A::C::C C will land us here, as trying to resolve
23518 the initial A::C leads to the local C typedef, which leads back to
23519 A::C::C. So we break the recursion now. */
23522 scope
= resolve_typename_type (scope
, only_current_p
);
23524 /* If we don't know what SCOPE refers to, then we cannot resolve the
23526 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
23528 /* If the SCOPE is a template type parameter, we have no way of
23529 resolving the name. */
23530 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
23532 /* If the SCOPE is not the current instantiation, there's no reason
23533 to look inside it. */
23534 if (only_current_p
&& !currently_open_class (scope
))
23536 /* If this is a typedef, we don't want to look inside (c++/11987). */
23537 if (typedef_variant_p (type
))
23539 /* If SCOPE isn't the template itself, it will not have a valid
23540 TYPE_FIELDS list. */
23541 if (CLASS_TYPE_P (scope
)
23542 && same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
23543 /* scope is either the template itself or a compatible instantiation
23544 like X<T>, so look up the name in the original template. */
23545 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
23547 /* scope is a partial instantiation, so we can't do the lookup or we
23548 will lose the template arguments. */
23550 /* Enter the SCOPE so that name lookup will be resolved as if we
23551 were in the class definition. In particular, SCOPE will no
23552 longer be considered a dependent type. */
23553 pushed_scope
= push_scope (scope
);
23554 /* Look up the declaration. */
23555 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
23556 tf_warning_or_error
);
23558 result
= NULL_TREE
;
23560 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
23561 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
23564 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
23565 && TREE_CODE (decl
) == TYPE_DECL
)
23567 result
= TREE_TYPE (decl
);
23568 if (result
== error_mark_node
)
23569 result
= NULL_TREE
;
23571 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
23572 && DECL_CLASS_TEMPLATE_P (decl
))
23576 /* Obtain the template and the arguments. */
23577 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
23578 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
23579 /* Instantiate the template. */
23580 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
23581 /*entering_scope=*/0,
23582 tf_error
| tf_user
);
23583 if (result
== error_mark_node
)
23584 result
= NULL_TREE
;
23587 /* Leave the SCOPE. */
23589 pop_scope (pushed_scope
);
23591 /* If we failed to resolve it, return the original typename. */
23595 /* If lookup found a typename type, resolve that too. */
23596 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
23598 /* Ill-formed programs can cause infinite recursion here, so we
23599 must catch that. */
23600 TYPENAME_IS_RESOLVING_P (type
) = 1;
23601 result
= resolve_typename_type (result
, only_current_p
);
23602 TYPENAME_IS_RESOLVING_P (type
) = 0;
23605 /* Qualify the resulting type. */
23606 quals
= cp_type_quals (type
);
23608 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
23613 /* EXPR is an expression which is not type-dependent. Return a proxy
23614 for EXPR that can be used to compute the types of larger
23615 expressions containing EXPR. */
23618 build_non_dependent_expr (tree expr
)
23622 /* When checking, try to get a constant value for all non-dependent
23623 expressions in order to expose bugs in *_dependent_expression_p
23625 if (flag_checking
&& cxx_dialect
>= cxx11
23626 /* Don't do this during nsdmi parsing as it can lead to
23627 unexpected recursive instantiations. */
23628 && !parsing_nsdmi ())
23629 fold_non_dependent_expr (expr
);
23631 /* Preserve OVERLOADs; the functions must be available to resolve
23634 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
23635 inner_expr
= stmt_expr_value_expr (inner_expr
);
23636 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
23637 inner_expr
= TREE_OPERAND (inner_expr
, 0);
23638 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
23639 inner_expr
= TREE_OPERAND (inner_expr
, 1);
23640 if (is_overloaded_fn (inner_expr
)
23641 || TREE_CODE (inner_expr
) == OFFSET_REF
)
23643 /* There is no need to return a proxy for a variable. */
23646 /* Preserve string constants; conversions from string constants to
23647 "char *" are allowed, even though normally a "const char *"
23648 cannot be used to initialize a "char *". */
23649 if (TREE_CODE (expr
) == STRING_CST
)
23651 /* Preserve void and arithmetic constants, as an optimization -- there is no
23652 reason to create a new node. */
23653 if (TREE_CODE (expr
) == VOID_CST
23654 || TREE_CODE (expr
) == INTEGER_CST
23655 || TREE_CODE (expr
) == REAL_CST
)
23657 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
23658 There is at least one place where we want to know that a
23659 particular expression is a throw-expression: when checking a ?:
23660 expression, there are special rules if the second or third
23661 argument is a throw-expression. */
23662 if (TREE_CODE (expr
) == THROW_EXPR
)
23665 /* Don't wrap an initializer list, we need to be able to look inside. */
23666 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
23669 /* Don't wrap a dummy object, we need to be able to test for it. */
23670 if (is_dummy_object (expr
))
23673 if (TREE_CODE (expr
) == COND_EXPR
)
23674 return build3 (COND_EXPR
,
23676 TREE_OPERAND (expr
, 0),
23677 (TREE_OPERAND (expr
, 1)
23678 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
23679 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
23680 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
23681 if (TREE_CODE (expr
) == COMPOUND_EXPR
23682 && !COMPOUND_EXPR_OVERLOADED (expr
))
23683 return build2 (COMPOUND_EXPR
,
23685 TREE_OPERAND (expr
, 0),
23686 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
23688 /* If the type is unknown, it can't really be non-dependent */
23689 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
23691 /* Otherwise, build a NON_DEPENDENT_EXPR. */
23692 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
23695 /* ARGS is a vector of expressions as arguments to a function call.
23696 Replace the arguments with equivalent non-dependent expressions.
23697 This modifies ARGS in place. */
23700 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
23705 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
23707 tree newarg
= build_non_dependent_expr (arg
);
23709 (*args
)[ix
] = newarg
;
23713 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
23714 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
23715 parms. If set_canonical is true, we set TYPE_CANONICAL on it. */
23718 make_auto_1 (tree name
, bool set_canonical
)
23720 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
23721 TYPE_NAME (au
) = build_decl (input_location
,
23722 TYPE_DECL
, name
, au
);
23723 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
23724 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
23725 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
23726 TYPE_NAME (au
), NULL_TREE
);
23728 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
23729 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
23730 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
23736 make_decltype_auto (void)
23738 return make_auto_1 (get_identifier ("decltype(auto)"), true);
23744 return make_auto_1 (get_identifier ("auto"), true);
23747 /* Make a "constrained auto" type-specifier. This is an
23748 auto type with constraints that must be associated after
23749 deduction. The constraint is formed from the given
23750 CONC and its optional sequence of arguments, which are
23751 non-null if written as partial-concept-id. */
23754 make_constrained_auto (tree con
, tree args
)
23756 tree type
= make_auto_1 (get_identifier ("auto"), false);
23758 /* Build the constraint. */
23759 tree tmpl
= DECL_TI_TEMPLATE (con
);
23762 expr
= build_concept_check (tmpl
, type
, args
);
23764 expr
= build_concept_check (build_overload (tmpl
, NULL_TREE
), type
, args
);
23766 tree constr
= make_predicate_constraint (expr
);
23767 PLACEHOLDER_TYPE_CONSTRAINTS (type
) = constr
;
23769 /* Our canonical type depends on the constraint. */
23770 TYPE_CANONICAL (type
) = canonical_type_parameter (type
);
23772 /* Attach the constraint to the type declaration. */
23773 tree decl
= TYPE_NAME (type
);
23777 /* Given type ARG, return std::initializer_list<ARG>. */
23782 tree std_init_list
= namespace_binding
23783 (get_identifier ("initializer_list"), std_node
);
23785 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
23787 error ("deducing from brace-enclosed initializer list requires "
23788 "#include <initializer_list>");
23789 return error_mark_node
;
23791 argvec
= make_tree_vec (1);
23792 TREE_VEC_ELT (argvec
, 0) = arg
;
23793 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
23794 NULL_TREE
, 0, tf_warning_or_error
);
23797 /* Replace auto in TYPE with std::initializer_list<auto>. */
23800 listify_autos (tree type
, tree auto_node
)
23802 tree init_auto
= listify (auto_node
);
23803 tree argvec
= make_tree_vec (1);
23804 TREE_VEC_ELT (argvec
, 0) = init_auto
;
23805 if (processing_template_decl
)
23806 argvec
= add_to_template_args (current_template_args (), argvec
);
23807 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
23810 /* Hash traits for hashing possibly constrained 'auto'
23811 TEMPLATE_TYPE_PARMs for use by do_auto_deduction. */
23813 struct auto_hash
: default_hash_traits
<tree
>
23815 static inline hashval_t
hash (tree
);
23816 static inline bool equal (tree
, tree
);
23819 /* Hash the 'auto' T. */
23822 auto_hash::hash (tree t
)
23824 if (tree c
= PLACEHOLDER_TYPE_CONSTRAINTS (t
))
23825 /* Matching constrained-type-specifiers denote the same template
23826 parameter, so hash the constraint. */
23827 return hash_placeholder_constraint (c
);
23829 /* But unconstrained autos are all separate, so just hash the pointer. */
23830 return iterative_hash_object (t
, 0);
23833 /* Compare two 'auto's. */
23836 auto_hash::equal (tree t1
, tree t2
)
23841 tree c1
= PLACEHOLDER_TYPE_CONSTRAINTS (t1
);
23842 tree c2
= PLACEHOLDER_TYPE_CONSTRAINTS (t2
);
23844 /* Two unconstrained autos are distinct. */
23848 return equivalent_placeholder_constraints (c1
, c2
);
23851 /* for_each_template_parm callback for extract_autos: if t is a (possibly
23852 constrained) auto, add it to the vector. */
23855 extract_autos_r (tree t
, void *data
)
23857 hash_table
<auto_hash
> &hash
= *(hash_table
<auto_hash
>*)data
;
23858 if (is_auto_or_concept (t
))
23860 /* All the autos were built with index 0; fix that up now. */
23861 tree
*p
= hash
.find_slot (t
, INSERT
);
23864 /* If this is a repeated constrained-type-specifier, use the index we
23866 idx
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (*p
));
23869 /* Otherwise this is new, so use the current count. */
23871 idx
= hash
.elements () - 1;
23873 TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (t
)) = idx
;
23876 /* Always keep walking. */
23880 /* Return a TREE_VEC of the 'auto's used in type under the Concepts TS, which
23881 says they can appear anywhere in the type. */
23884 extract_autos (tree type
)
23886 hash_set
<tree
> visited
;
23887 hash_table
<auto_hash
> hash (2);
23889 for_each_template_parm (type
, extract_autos_r
, &hash
, &visited
, true);
23891 tree tree_vec
= make_tree_vec (hash
.elements());
23892 for (hash_table
<auto_hash
>::iterator iter
= hash
.begin();
23893 iter
!= hash
.end(); ++iter
)
23896 unsigned i
= TEMPLATE_PARM_IDX (TEMPLATE_TYPE_PARM_INDEX (elt
));
23897 TREE_VEC_ELT (tree_vec
, i
)
23898 = build_tree_list (NULL_TREE
, TYPE_NAME (elt
));
23904 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23905 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
23908 do_auto_deduction (tree type
, tree init
, tree auto_node
)
23910 return do_auto_deduction (type
, init
, auto_node
,
23911 tf_warning_or_error
,
23915 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
23916 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE.
23917 The CONTEXT determines the context in which auto deduction is performed
23918 and is used to control error diagnostics. */
23921 do_auto_deduction (tree type
, tree init
, tree auto_node
,
23922 tsubst_flags_t complain
, auto_deduction_context context
)
23926 if (init
== error_mark_node
)
23927 return error_mark_node
;
23929 if (type_dependent_expression_p (init
))
23930 /* Defining a subset of type-dependent expressions that we can deduce
23931 from ahead of time isn't worth the trouble. */
23934 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
23935 with either a new invented type template parameter U or, if the
23936 initializer is a braced-init-list (8.5.4), with
23937 std::initializer_list<U>. */
23938 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
23940 if (!DIRECT_LIST_INIT_P (init
))
23941 type
= listify_autos (type
, auto_node
);
23942 else if (CONSTRUCTOR_NELTS (init
) == 1)
23943 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
23946 if (complain
& tf_warning_or_error
)
23948 if (permerror (input_location
, "direct-list-initialization of "
23949 "%<auto%> requires exactly one element"))
23950 inform (input_location
,
23951 "for deduction to %<std::initializer_list%>, use copy-"
23952 "list-initialization (i.e. add %<=%> before the %<{%>)");
23954 type
= listify_autos (type
, auto_node
);
23958 if (type
== error_mark_node
)
23959 return error_mark_node
;
23961 init
= resolve_nondeduced_context (init
, complain
);
23963 if (AUTO_IS_DECLTYPE (auto_node
))
23965 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
23966 && !REF_PARENTHESIZED_P (init
)));
23967 targs
= make_tree_vec (1);
23968 TREE_VEC_ELT (targs
, 0)
23969 = finish_decltype_type (init
, id
, tf_warning_or_error
);
23970 if (type
!= auto_node
)
23972 if (complain
& tf_error
)
23973 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
23974 return error_mark_node
;
23979 tree parms
= build_tree_list (NULL_TREE
, type
);
23983 tparms
= extract_autos (type
);
23986 tparms
= make_tree_vec (1);
23987 TREE_VEC_ELT (tparms
, 0)
23988 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
23991 targs
= make_tree_vec (TREE_VEC_LENGTH (tparms
));
23992 int val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
23993 DEDUCE_CALL
, LOOKUP_NORMAL
,
23994 NULL
, /*explain_p=*/false);
23997 if (processing_template_decl
)
23998 /* Try again at instantiation time. */
24000 if (type
&& type
!= error_mark_node
24001 && (complain
& tf_error
))
24002 /* If type is error_mark_node a diagnostic must have been
24003 emitted by now. Also, having a mention to '<type error>'
24004 in the diagnostic is not really useful to the user. */
24006 if (cfun
&& auto_node
== current_function_auto_return_pattern
24007 && LAMBDA_FUNCTION_P (current_function_decl
))
24008 error ("unable to deduce lambda return type from %qE", init
);
24010 error ("unable to deduce %qT from %qE", type
, init
);
24011 type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
24012 DEDUCE_CALL
, LOOKUP_NORMAL
,
24013 NULL
, /*explain_p=*/true);
24015 return error_mark_node
;
24019 /* Check any placeholder constraints against the deduced type. */
24020 if (flag_concepts
&& !processing_template_decl
)
24021 if (tree constr
= PLACEHOLDER_TYPE_CONSTRAINTS (auto_node
))
24023 /* Use the deduced type to check the associated constraints. */
24024 if (!constraints_satisfied_p (constr
, targs
))
24026 if (complain
& tf_warning_or_error
)
24030 case adc_unspecified
:
24031 error("placeholder constraints not satisfied");
24033 case adc_variable_type
:
24034 error ("deduced initializer does not satisfy "
24035 "placeholder constraints");
24037 case adc_return_type
:
24038 error ("deduced return type does not satisfy "
24039 "placeholder constraints");
24041 case adc_requirement
:
24042 error ("deduced expression type does not saatisy "
24043 "placeholder constraints");
24046 diagnose_constraints (input_location
, constr
, targs
);
24048 return error_mark_node
;
24052 if (processing_template_decl
)
24053 targs
= add_to_template_args (current_template_args (), targs
);
24054 return tsubst (type
, targs
, complain
, NULL_TREE
);
24057 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
24061 splice_late_return_type (tree type
, tree late_return_type
)
24063 if (is_auto (type
))
24065 if (late_return_type
)
24066 return late_return_type
;
24068 tree idx
= get_template_parm_index (type
);
24069 if (TEMPLATE_PARM_LEVEL (idx
) <= processing_template_decl
)
24070 /* In an abbreviated function template we didn't know we were dealing
24071 with a function template when we saw the auto return type, so update
24072 it to have the correct level. */
24073 return make_auto_1 (TYPE_IDENTIFIER (type
), true);
24078 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
24079 'decltype(auto)'. */
24082 is_auto (const_tree type
)
24084 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
24085 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
24086 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
24092 /* for_each_template_parm callback for type_uses_auto. */
24095 is_auto_r (tree tp
, void */
*data*/
)
24097 return is_auto_or_concept (tp
);
24100 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
24101 a use of `auto'. Returns NULL_TREE otherwise. */
24104 type_uses_auto (tree type
)
24106 if (type
== NULL_TREE
)
24108 else if (flag_concepts
)
24110 /* The Concepts TS allows multiple autos in one type-specifier; just
24111 return the first one we find, do_auto_deduction will collect all of
24113 if (uses_template_parms (type
))
24114 return for_each_template_parm (type
, is_auto_r
, /*data*/NULL
,
24115 /*visited*/NULL
, /*nondeduced*/true);
24120 return find_type_usage (type
, is_auto
);
24123 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
24124 'decltype(auto)' or a concept. */
24127 is_auto_or_concept (const_tree type
)
24129 return is_auto (type
); // or concept
24132 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
24133 a concept identifier) iff TYPE contains a use of a generic type. Returns
24134 NULL_TREE otherwise. */
24137 type_uses_auto_or_concept (tree type
)
24139 return find_type_usage (type
, is_auto_or_concept
);
24143 /* For a given template T, return the vector of typedefs referenced
24144 in T for which access check is needed at T instantiation time.
24145 T is either a FUNCTION_DECL or a RECORD_TYPE.
24146 Those typedefs were added to T by the function
24147 append_type_to_template_for_access_check. */
24149 vec
<qualified_typedef_usage_t
, va_gc
> *
24150 get_types_needing_access_check (tree t
)
24153 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
24155 if (!t
|| t
== error_mark_node
)
24158 if (!(ti
= get_template_info (t
)))
24161 if (CLASS_TYPE_P (t
)
24162 || TREE_CODE (t
) == FUNCTION_DECL
)
24164 if (!TI_TEMPLATE (ti
))
24167 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
24173 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
24174 tied to T. That list of typedefs will be access checked at
24175 T instantiation time.
24176 T is either a FUNCTION_DECL or a RECORD_TYPE.
24177 TYPE_DECL is a TYPE_DECL node representing a typedef.
24178 SCOPE is the scope through which TYPE_DECL is accessed.
24179 LOCATION is the location of the usage point of TYPE_DECL.
24181 This function is a subroutine of
24182 append_type_to_template_for_access_check. */
24185 append_type_to_template_for_access_check_1 (tree t
,
24188 location_t location
)
24190 qualified_typedef_usage_t typedef_usage
;
24193 if (!t
|| t
== error_mark_node
)
24196 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
24197 || CLASS_TYPE_P (t
))
24199 && TREE_CODE (type_decl
) == TYPE_DECL
24202 if (!(ti
= get_template_info (t
)))
24205 gcc_assert (TI_TEMPLATE (ti
));
24207 typedef_usage
.typedef_decl
= type_decl
;
24208 typedef_usage
.context
= scope
;
24209 typedef_usage
.locus
= location
;
24211 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
24214 /* Append TYPE_DECL to the template TEMPL.
24215 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
24216 At TEMPL instanciation time, TYPE_DECL will be checked to see
24217 if it can be accessed through SCOPE.
24218 LOCATION is the location of the usage point of TYPE_DECL.
24220 e.g. consider the following code snippet:
24227 template<class U> struct S
24229 C::myint mi; // <-- usage point of the typedef C::myint
24234 At S<char> instantiation time, we need to check the access of C::myint
24235 In other words, we need to check the access of the myint typedef through
24236 the C scope. For that purpose, this function will add the myint typedef
24237 and the scope C through which its being accessed to a list of typedefs
24238 tied to the template S. That list will be walked at template instantiation
24239 time and access check performed on each typedefs it contains.
24240 Note that this particular code snippet should yield an error because
24241 myint is private to C. */
24244 append_type_to_template_for_access_check (tree templ
,
24247 location_t location
)
24249 qualified_typedef_usage_t
*iter
;
24252 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
24254 /* Make sure we don't append the type to the template twice. */
24255 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
24256 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
24259 append_type_to_template_for_access_check_1 (templ
, type_decl
,
24263 /* Convert the generic type parameters in PARM that match the types given in the
24264 range [START_IDX, END_IDX) from the current_template_parms into generic type
24268 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
24270 tree current
= current_template_parms
;
24271 int depth
= TMPL_PARMS_DEPTH (current
);
24272 current
= INNERMOST_TEMPLATE_PARMS (current
);
24273 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
24275 for (int i
= 0; i
< start_idx
; ++i
)
24276 TREE_VEC_ELT (replacement
, i
)
24277 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24279 for (int i
= start_idx
; i
< end_idx
; ++i
)
24281 /* Create a distinct parameter pack type from the current parm and add it
24282 to the replacement args to tsubst below into the generic function
24285 tree o
= TREE_TYPE (TREE_VALUE
24286 (TREE_VEC_ELT (current
, i
)));
24287 tree t
= copy_type (o
);
24288 TEMPLATE_TYPE_PARM_INDEX (t
)
24289 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
24291 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
24292 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
24293 TYPE_MAIN_VARIANT (t
) = t
;
24294 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
24295 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
24296 TREE_VEC_ELT (replacement
, i
) = t
;
24297 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
24300 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
24301 TREE_VEC_ELT (replacement
, i
)
24302 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
24304 /* If there are more levels then build up the replacement with the outer
24307 replacement
= add_to_template_args (template_parms_to_args
24308 (TREE_CHAIN (current_template_parms
)),
24311 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
24314 /* Entries in the decl_constraint hash table. */
24315 struct GTY((for_user
)) constr_entry
24321 /* Hashing function and equality for constraint entries. */
24322 struct constr_hasher
: ggc_ptr_hash
<constr_entry
>
24324 static hashval_t
hash (constr_entry
*e
)
24326 return (hashval_t
)DECL_UID (e
->decl
);
24329 static bool equal (constr_entry
*e1
, constr_entry
*e2
)
24331 return e1
->decl
== e2
->decl
;
24335 /* A mapping from declarations to constraint information. Note that
24336 both templates and their underlying declarations are mapped to the
24337 same constraint information.
24339 FIXME: This is defined in pt.c because garbage collection
24340 code is not being generated for constraint.cc. */
24342 static GTY (()) hash_table
<constr_hasher
> *decl_constraints
;
24344 /* Returns true iff cinfo contains a valid set of constraints.
24345 This is the case when the associated requirements have been
24346 successfully decomposed into lists of atomic constraints.
24347 That is, when the saved assumptions are not error_mark_node. */
24350 valid_constraints_p (tree cinfo
)
24352 gcc_assert (cinfo
);
24353 return CI_ASSUMPTIONS (cinfo
) != error_mark_node
;
24356 /* Returns the template constraints of declaration T. If T is not
24357 constrained, return NULL_TREE. Note that T must be non-null. */
24360 get_constraints (tree t
)
24362 gcc_assert (DECL_P (t
));
24363 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24364 t
= DECL_TEMPLATE_RESULT (t
);
24365 constr_entry elt
= { t
, NULL_TREE
};
24366 constr_entry
* found
= decl_constraints
->find (&elt
);
24373 /* Associate the given constraint information CI with the declaration
24374 T. If T is a template, then the constraints are associated with
24375 its underlying declaration. Don't build associations if CI is
24379 set_constraints (tree t
, tree ci
)
24384 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24385 t
= DECL_TEMPLATE_RESULT (t
);
24386 gcc_assert (!get_constraints (t
));
24387 constr_entry elt
= {t
, ci
};
24388 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, INSERT
);
24389 constr_entry
* entry
= ggc_alloc
<constr_entry
> ();
24394 /* Remove the associated constraints of the declaration T. */
24397 remove_constraints (tree t
)
24399 gcc_assert (DECL_P (t
));
24400 if (TREE_CODE (t
) == TEMPLATE_DECL
)
24401 t
= DECL_TEMPLATE_RESULT (t
);
24403 constr_entry elt
= {t
, NULL_TREE
};
24404 constr_entry
** slot
= decl_constraints
->find_slot (&elt
, NO_INSERT
);
24406 decl_constraints
->clear_slot (slot
);
24409 /* Set up the hash table for constraint association. */
24412 init_constraint_processing (void)
24414 decl_constraints
= hash_table
<constr_hasher
>::create_ggc(37);
24417 /* Set up the hash tables for template instantiations. */
24420 init_template_processing (void)
24422 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24423 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
24426 /* Print stats about the template hash tables for -fstats. */
24429 print_template_statistics (void)
24431 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
24432 "%f collisions\n", (long) decl_specializations
->size (),
24433 (long) decl_specializations
->elements (),
24434 decl_specializations
->collisions ());
24435 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
24436 "%f collisions\n", (long) type_specializations
->size (),
24437 (long) type_specializations
->elements (),
24438 type_specializations
->collisions ());
24441 #include "gt-cp-pt.h"