1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2014 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 "pointer-set.h"
40 #include "c-family/c-common.h"
41 #include "c-family/c-objc.h"
42 #include "cp-objcp-common.h"
43 #include "tree-inline.h"
47 #include "tree-iterator.h"
48 #include "type-utils.h"
51 /* The type of functions taking a tree, and some additional data, and
53 typedef int (*tree_fn_t
) (tree
, void*);
55 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
56 instantiations have been deferred, either because their definitions
57 were not yet available, or because we were putting off doing the work. */
58 struct GTY ((chain_next ("%h.next"))) pending_template
{
59 struct pending_template
*next
;
60 struct tinst_level
*tinst
;
63 static GTY(()) struct pending_template
*pending_templates
;
64 static GTY(()) struct pending_template
*last_pending_template
;
66 int processing_template_parmlist
;
67 static int template_header_count
;
69 static GTY(()) tree saved_trees
;
70 static vec
<int> inline_parm_levels
;
72 static GTY(()) struct tinst_level
*current_tinst_level
;
74 static GTY(()) tree saved_access_scope
;
76 /* Live only within one (recursive) call to tsubst_expr. We use
77 this to pass the statement expression node from the STMT_EXPR
78 to the EXPR_STMT that is its result. */
79 static tree cur_stmt_expr
;
81 /* True if we've recursed into fn_type_unification too many times. */
82 static bool excessive_deduction_depth
;
84 typedef struct GTY(()) spec_entry
91 static GTY ((param_is (spec_entry
)))
92 htab_t decl_specializations
;
94 static GTY ((param_is (spec_entry
)))
95 htab_t type_specializations
;
97 /* Contains canonical template parameter types. The vector is indexed by
98 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
99 TREE_LIST, whose TREE_VALUEs contain the canonical template
100 parameters of various types and levels. */
101 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
103 #define UNIFY_ALLOW_NONE 0
104 #define UNIFY_ALLOW_MORE_CV_QUAL 1
105 #define UNIFY_ALLOW_LESS_CV_QUAL 2
106 #define UNIFY_ALLOW_DERIVED 4
107 #define UNIFY_ALLOW_INTEGER 8
108 #define UNIFY_ALLOW_OUTER_LEVEL 16
109 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
110 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
112 enum template_base_result
{
114 tbr_ambiguous_baseclass
,
118 static void push_access_scope (tree
);
119 static void pop_access_scope (tree
);
120 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
121 unification_kind_t
, int,
123 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
124 unification_kind_t
, int, bool, bool);
125 static int unify (tree
, tree
, tree
, tree
, int, bool);
126 static void add_pending_template (tree
);
127 static tree
reopen_tinst_level (struct tinst_level
*);
128 static tree
tsubst_initializer_list (tree
, tree
);
129 static tree
get_class_bindings (tree
, tree
, tree
, tree
);
130 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
132 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
134 static void tsubst_enum (tree
, tree
, tree
);
135 static tree
add_to_template_args (tree
, tree
);
136 static tree
add_outermost_template_args (tree
, tree
);
137 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
138 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
140 static int type_unification_real (tree
, tree
, tree
, const tree
*,
141 unsigned int, int, unification_kind_t
, int,
142 vec
<deferred_access_check
, va_gc
> **,
144 static void note_template_header (int);
145 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
146 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
147 static tree
convert_template_argument (tree
, tree
, tree
,
148 tsubst_flags_t
, int, tree
);
149 static int for_each_template_parm (tree
, tree_fn_t
, void*,
150 hash_set
<tree
> *, bool);
151 static tree
expand_template_argument_pack (tree
);
152 static tree
build_template_parm_index (int, int, int, tree
, tree
);
153 static bool inline_needs_template_parms (tree
, bool);
154 static void push_inline_template_parms_recursive (tree
, int);
155 static tree
retrieve_local_specialization (tree
);
156 static void register_local_specialization (tree
, tree
);
157 static hashval_t
hash_specialization (const void *p
);
158 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
159 static int mark_template_parm (tree
, void *);
160 static int template_parm_this_level_p (tree
, void *);
161 static tree
tsubst_friend_function (tree
, tree
);
162 static tree
tsubst_friend_class (tree
, tree
);
163 static int can_complete_type_without_circularity (tree
);
164 static tree
get_bindings (tree
, tree
, tree
, bool);
165 static int template_decl_level (tree
);
166 static int check_cv_quals_for_unify (int, tree
, tree
);
167 static void template_parm_level_and_index (tree
, int*, int*);
168 static int unify_pack_expansion (tree
, tree
, tree
,
169 tree
, unification_kind_t
, bool, bool);
170 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
171 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
172 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
173 static void regenerate_decl_from_template (tree
, tree
);
174 static tree
most_specialized_class (tree
, tsubst_flags_t
);
175 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
176 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
177 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
178 static bool check_specialization_scope (void);
179 static tree
process_partial_specialization (tree
);
180 static void set_current_access_from_decl (tree
);
181 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
183 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
184 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
186 static bool template_template_parm_bindings_ok_p (tree
, tree
);
187 static int template_args_equal (tree
, tree
);
188 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
189 static tree
for_each_template_parm_r (tree
*, int *, void *);
190 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
191 static void copy_default_args_to_explicit_spec (tree
);
192 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
193 static bool dependent_template_arg_p (tree
);
194 static bool any_template_arguments_need_structural_equality_p (tree
);
195 static bool dependent_type_p_r (tree
);
196 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
197 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
198 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
199 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
200 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
201 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
203 static tree
listify (tree
);
204 static tree
listify_autos (tree
, tree
);
205 static tree
template_parm_to_arg (tree t
);
206 static tree
current_template_args (void);
207 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
208 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
210 /* Make the current scope suitable for access checking when we are
211 processing T. T can be FUNCTION_DECL for instantiated function
212 template, VAR_DECL for static member variable, or TYPE_DECL for
213 alias template (needed by instantiate_decl). */
216 push_access_scope (tree t
)
218 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
219 || TREE_CODE (t
) == TYPE_DECL
);
221 if (DECL_FRIEND_CONTEXT (t
))
222 push_nested_class (DECL_FRIEND_CONTEXT (t
));
223 else if (DECL_CLASS_SCOPE_P (t
))
224 push_nested_class (DECL_CONTEXT (t
));
226 push_to_top_level ();
228 if (TREE_CODE (t
) == FUNCTION_DECL
)
230 saved_access_scope
= tree_cons
231 (NULL_TREE
, current_function_decl
, saved_access_scope
);
232 current_function_decl
= t
;
236 /* Restore the scope set up by push_access_scope. T is the node we
240 pop_access_scope (tree t
)
242 if (TREE_CODE (t
) == FUNCTION_DECL
)
244 current_function_decl
= TREE_VALUE (saved_access_scope
);
245 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
248 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
251 pop_from_top_level ();
254 /* Do any processing required when DECL (a member template
255 declaration) is finished. Returns the TEMPLATE_DECL corresponding
256 to DECL, unless it is a specialization, in which case the DECL
257 itself is returned. */
260 finish_member_template_decl (tree decl
)
262 if (decl
== error_mark_node
)
263 return error_mark_node
;
265 gcc_assert (DECL_P (decl
));
267 if (TREE_CODE (decl
) == TYPE_DECL
)
271 type
= TREE_TYPE (decl
);
272 if (type
== error_mark_node
)
273 return error_mark_node
;
274 if (MAYBE_CLASS_TYPE_P (type
)
275 && CLASSTYPE_TEMPLATE_INFO (type
)
276 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
278 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
279 check_member_template (tmpl
);
284 else if (TREE_CODE (decl
) == FIELD_DECL
)
285 error ("data member %qD cannot be a member template", decl
);
286 else if (DECL_TEMPLATE_INFO (decl
))
288 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
290 check_member_template (DECL_TI_TEMPLATE (decl
));
291 return DECL_TI_TEMPLATE (decl
);
297 error ("invalid member template declaration %qD", decl
);
299 return error_mark_node
;
302 /* Create a template info node. */
305 build_template_info (tree template_decl
, tree template_args
)
307 tree result
= make_node (TEMPLATE_INFO
);
308 TI_TEMPLATE (result
) = template_decl
;
309 TI_ARGS (result
) = template_args
;
313 /* Return the template info node corresponding to T, whatever T is. */
316 get_template_info (const_tree t
)
318 tree tinfo
= NULL_TREE
;
320 if (!t
|| t
== error_mark_node
)
323 if (TREE_CODE (t
) == NAMESPACE_DECL
)
326 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
327 tinfo
= DECL_TEMPLATE_INFO (t
);
329 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
332 if (OVERLOAD_TYPE_P (t
))
333 tinfo
= TYPE_TEMPLATE_INFO (t
);
334 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
335 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
340 /* Returns the template nesting level of the indicated class TYPE.
350 A<T>::B<U> has depth two, while A<T> has depth one.
351 Both A<T>::B<int> and A<int>::B<U> have depth one, if
352 they are instantiations, not specializations.
354 This function is guaranteed to return 0 if passed NULL_TREE so
355 that, for example, `template_class_depth (current_class_type)' is
359 template_class_depth (tree type
)
364 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
365 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
366 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
368 tree tinfo
= get_template_info (type
);
370 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
371 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
378 /* Subroutine of maybe_begin_member_template_processing.
379 Returns true if processing DECL needs us to push template parms. */
382 inline_needs_template_parms (tree decl
, bool nsdmi
)
384 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
387 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
388 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
391 /* Subroutine of maybe_begin_member_template_processing.
392 Push the template parms in PARMS, starting from LEVELS steps into the
393 chain, and ending at the beginning, since template parms are listed
397 push_inline_template_parms_recursive (tree parmlist
, int levels
)
399 tree parms
= TREE_VALUE (parmlist
);
403 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
405 ++processing_template_decl
;
406 current_template_parms
407 = tree_cons (size_int (processing_template_decl
),
408 parms
, current_template_parms
);
409 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
411 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
413 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
415 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
417 if (error_operand_p (parm
))
420 gcc_assert (DECL_P (parm
));
422 switch (TREE_CODE (parm
))
431 /* Make a CONST_DECL as is done in process_template_parm.
432 It is ugly that we recreate this here; the original
433 version built in process_template_parm is no longer
435 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
436 CONST_DECL
, DECL_NAME (parm
),
438 DECL_ARTIFICIAL (decl
) = 1;
439 TREE_CONSTANT (decl
) = 1;
440 TREE_READONLY (decl
) = 1;
441 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
442 SET_DECL_TEMPLATE_PARM_P (decl
);
453 /* Restore the template parameter context for a member template, a
454 friend template defined in a class definition, or a non-template
455 member of template class. */
458 maybe_begin_member_template_processing (tree decl
)
462 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
466 tree ctx
= DECL_CONTEXT (decl
);
467 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
468 /* Disregard full specializations (c++/60999). */
469 && uses_template_parms (ctx
)
470 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
473 if (inline_needs_template_parms (decl
, nsdmi
))
475 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
476 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
478 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
481 parms
= TREE_CHAIN (parms
);
484 push_inline_template_parms_recursive (parms
, levels
);
487 /* Remember how many levels of template parameters we pushed so that
488 we can pop them later. */
489 inline_parm_levels
.safe_push (levels
);
492 /* Undo the effects of maybe_begin_member_template_processing. */
495 maybe_end_member_template_processing (void)
500 if (inline_parm_levels
.length () == 0)
503 last
= inline_parm_levels
.pop ();
504 for (i
= 0; i
< last
; ++i
)
506 --processing_template_decl
;
507 current_template_parms
= TREE_CHAIN (current_template_parms
);
512 /* Return a new template argument vector which contains all of ARGS,
513 but has as its innermost set of arguments the EXTRA_ARGS. */
516 add_to_template_args (tree args
, tree extra_args
)
523 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
526 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
527 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
529 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
530 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
532 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
533 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
538 /* Like add_to_template_args, but only the outermost ARGS are added to
539 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
540 (EXTRA_ARGS) levels are added. This function is used to combine
541 the template arguments from a partial instantiation with the
542 template arguments used to attain the full instantiation from the
543 partial instantiation. */
546 add_outermost_template_args (tree args
, tree extra_args
)
550 /* If there are more levels of EXTRA_ARGS than there are ARGS,
551 something very fishy is going on. */
552 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
554 /* If *all* the new arguments will be the EXTRA_ARGS, just return
556 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
559 /* For the moment, we make ARGS look like it contains fewer levels. */
560 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
562 new_args
= add_to_template_args (args
, extra_args
);
564 /* Now, we restore ARGS to its full dimensions. */
565 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
570 /* Return the N levels of innermost template arguments from the ARGS. */
573 get_innermost_template_args (tree args
, int n
)
581 /* If N is 1, just return the innermost set of template arguments. */
583 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
585 /* If we're not removing anything, just return the arguments we were
587 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
588 gcc_assert (extra_levels
>= 0);
589 if (extra_levels
== 0)
592 /* Make a new set of arguments, not containing the outer arguments. */
593 new_args
= make_tree_vec (n
);
594 for (i
= 1; i
<= n
; ++i
)
595 SET_TMPL_ARGS_LEVEL (new_args
, i
,
596 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
601 /* The inverse of get_innermost_template_args: Return all but the innermost
602 EXTRA_LEVELS levels of template arguments from the ARGS. */
605 strip_innermost_template_args (tree args
, int extra_levels
)
608 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
613 /* If N is 1, just return the outermost set of template arguments. */
615 return TMPL_ARGS_LEVEL (args
, 1);
617 /* If we're not removing anything, just return the arguments we were
619 gcc_assert (extra_levels
>= 0);
620 if (extra_levels
== 0)
623 /* Make a new set of arguments, not containing the inner arguments. */
624 new_args
= make_tree_vec (n
);
625 for (i
= 1; i
<= n
; ++i
)
626 SET_TMPL_ARGS_LEVEL (new_args
, i
,
627 TMPL_ARGS_LEVEL (args
, i
));
632 /* We've got a template header coming up; push to a new level for storing
636 begin_template_parm_list (void)
638 /* We use a non-tag-transparent scope here, which causes pushtag to
639 put tags in this scope, rather than in the enclosing class or
640 namespace scope. This is the right thing, since we want
641 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
642 global template class, push_template_decl handles putting the
643 TEMPLATE_DECL into top-level scope. For a nested template class,
646 template <class T> struct S1 {
647 template <class T> struct S2 {};
650 pushtag contains special code to call pushdecl_with_scope on the
651 TEMPLATE_DECL for S2. */
652 begin_scope (sk_template_parms
, NULL
);
653 ++processing_template_decl
;
654 ++processing_template_parmlist
;
655 note_template_header (0);
658 /* This routine is called when a specialization is declared. If it is
659 invalid to declare a specialization here, an error is reported and
660 false is returned, otherwise this routine will return true. */
663 check_specialization_scope (void)
665 tree scope
= current_scope ();
669 An explicit specialization shall be declared in the namespace of
670 which the template is a member, or, for member templates, in the
671 namespace of which the enclosing class or enclosing class
672 template is a member. An explicit specialization of a member
673 function, member class or static data member of a class template
674 shall be declared in the namespace of which the class template
676 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
678 error ("explicit specialization in non-namespace scope %qD", scope
);
684 In an explicit specialization declaration for a member of a class
685 template or a member template that appears in namespace scope,
686 the member template and some of its enclosing class templates may
687 remain unspecialized, except that the declaration shall not
688 explicitly specialize a class member template if its enclosing
689 class templates are not explicitly specialized as well. */
690 if (current_template_parms
)
692 error ("enclosing class templates are not explicitly specialized");
699 /* We've just seen template <>. */
702 begin_specialization (void)
704 begin_scope (sk_template_spec
, NULL
);
705 note_template_header (1);
706 return check_specialization_scope ();
709 /* Called at then end of processing a declaration preceded by
713 end_specialization (void)
716 reset_specialization ();
719 /* Any template <>'s that we have seen thus far are not referring to a
720 function specialization. */
723 reset_specialization (void)
725 processing_specialization
= 0;
726 template_header_count
= 0;
729 /* We've just seen a template header. If SPECIALIZATION is nonzero,
730 it was of the form template <>. */
733 note_template_header (int specialization
)
735 processing_specialization
= specialization
;
736 template_header_count
++;
739 /* We're beginning an explicit instantiation. */
742 begin_explicit_instantiation (void)
744 gcc_assert (!processing_explicit_instantiation
);
745 processing_explicit_instantiation
= true;
750 end_explicit_instantiation (void)
752 gcc_assert (processing_explicit_instantiation
);
753 processing_explicit_instantiation
= false;
756 /* An explicit specialization or partial specialization of TMPL is being
757 declared. Check that the namespace in which the specialization is
758 occurring is permissible. Returns false iff it is invalid to
759 specialize TMPL in the current namespace. */
762 check_specialization_namespace (tree tmpl
)
764 tree tpl_ns
= decl_namespace_context (tmpl
);
768 An explicit specialization shall be declared in the namespace of
769 which the template is a member, or, for member templates, in the
770 namespace of which the enclosing class or enclosing class
771 template is a member. An explicit specialization of a member
772 function, member class or static data member of a class template
773 shall be declared in the namespace of which the class template is
775 if (current_scope() != DECL_CONTEXT (tmpl
)
776 && !at_namespace_scope_p ())
778 error ("specialization of %qD must appear at namespace scope", tmpl
);
781 if (is_associated_namespace (current_namespace
, tpl_ns
))
782 /* Same or super-using namespace. */
786 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
787 permerror (input_location
, " from definition of %q+#D", tmpl
);
792 /* SPEC is an explicit instantiation. Check that it is valid to
793 perform this explicit instantiation in the current namespace. */
796 check_explicit_instantiation_namespace (tree spec
)
800 /* DR 275: An explicit instantiation shall appear in an enclosing
801 namespace of its template. */
802 ns
= decl_namespace_context (spec
);
803 if (!is_ancestor (current_namespace
, ns
))
804 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
805 "(which does not enclose namespace %qD)",
806 spec
, current_namespace
, ns
);
809 /* The TYPE is being declared. If it is a template type, that means it
810 is a partial specialization. Do appropriate error-checking. */
813 maybe_process_partial_specialization (tree type
)
817 if (type
== error_mark_node
)
818 return error_mark_node
;
820 /* A lambda that appears in specialization context is not itself a
822 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
825 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
827 error ("name of class shadows template template parameter %qD",
829 return error_mark_node
;
832 context
= TYPE_CONTEXT (type
);
834 if (TYPE_ALIAS_P (type
))
836 if (TYPE_TEMPLATE_INFO (type
)
837 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
838 error ("specialization of alias template %qD",
839 TYPE_TI_TEMPLATE (type
));
841 error ("explicit specialization of non-template %qT", type
);
842 return error_mark_node
;
844 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
846 /* This is for ordinary explicit specialization and partial
847 specialization of a template class such as:
849 template <> class C<int>;
853 template <class T> class C<T*>;
855 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
857 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
858 && !COMPLETE_TYPE_P (type
))
860 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
))
861 && !at_namespace_scope_p ())
862 return error_mark_node
;
863 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
864 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
865 if (processing_template_decl
)
867 if (push_template_decl (TYPE_MAIN_DECL (type
))
869 return error_mark_node
;
872 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
873 error ("specialization of %qT after instantiation", type
);
874 else if (errorcount
&& !processing_specialization
875 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
876 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
877 /* Trying to define a specialization either without a template<> header
878 or in an inappropriate place. We've already given an error, so just
879 bail now so we don't actually define the specialization. */
880 return error_mark_node
;
882 else if (CLASS_TYPE_P (type
)
883 && !CLASSTYPE_USE_TEMPLATE (type
)
884 && CLASSTYPE_TEMPLATE_INFO (type
)
885 && context
&& CLASS_TYPE_P (context
)
886 && CLASSTYPE_TEMPLATE_INFO (context
))
888 /* This is for an explicit specialization of member class
889 template according to [temp.expl.spec/18]:
891 template <> template <class U> class C<int>::D;
893 The context `C<int>' must be an implicit instantiation.
894 Otherwise this is just a member class template declared
897 template <> class C<int> { template <class U> class D; };
898 template <> template <class U> class C<int>::D;
900 In the first case, `C<int>::D' is a specialization of `C<T>::D'
901 while in the second case, `C<int>::D' is a primary template
902 and `C<T>::D' may not exist. */
904 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
905 && !COMPLETE_TYPE_P (type
))
908 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
910 if (current_namespace
911 != decl_namespace_context (tmpl
))
913 permerror (input_location
, "specializing %q#T in different namespace", type
);
914 permerror (input_location
, " from definition of %q+#D", tmpl
);
917 /* Check for invalid specialization after instantiation:
919 template <> template <> class C<int>::D<int>;
920 template <> template <class U> class C<int>::D; */
922 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
923 t
; t
= TREE_CHAIN (t
))
925 tree inst
= TREE_VALUE (t
);
926 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
927 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
929 /* We already have a full specialization of this partial
930 instantiation, or a full specialization has been
931 looked up but not instantiated. Reassign it to the
932 new member specialization template. */
937 elt
.tmpl
= most_general_template (tmpl
);
938 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
941 htab_remove_elt (type_specializations
, &elt
);
944 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
946 slot
= htab_find_slot (type_specializations
, &elt
, INSERT
);
947 entry
= ggc_alloc
<spec_entry
> ();
952 /* But if we've had an implicit instantiation, that's a
953 problem ([temp.expl.spec]/6). */
954 error ("specialization %qT after instantiation %qT",
958 /* Mark TYPE as a specialization. And as a result, we only
959 have one level of template argument for the innermost
961 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
962 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
963 CLASSTYPE_TI_ARGS (type
)
964 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
967 else if (processing_specialization
)
969 /* Someday C++0x may allow for enum template specialization. */
970 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
971 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
972 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
973 "of %qD not allowed by ISO C++", type
);
976 error ("explicit specialization of non-template %qT", type
);
977 return error_mark_node
;
984 /* Returns nonzero if we can optimize the retrieval of specializations
985 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
986 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
989 optimize_specialization_lookup_p (tree tmpl
)
991 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
992 && DECL_CLASS_SCOPE_P (tmpl
)
993 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
995 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
996 /* The optimized lookup depends on the fact that the
997 template arguments for the member function template apply
998 purely to the containing class, which is not true if the
999 containing class is an explicit or partial
1001 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1002 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1003 && !DECL_CONV_FN_P (tmpl
)
1004 /* It is possible to have a template that is not a member
1005 template and is not a member of a template class:
1007 template <typename T>
1008 struct S { friend A::f(); };
1010 Here, the friend function is a template, but the context does
1011 not have template information. The optimized lookup relies
1012 on having ARGS be the template arguments for both the class
1013 and the function template. */
1014 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1017 /* Retrieve the specialization (in the sense of [temp.spec] - a
1018 specialization is either an instantiation or an explicit
1019 specialization) of TMPL for the given template ARGS. If there is
1020 no such specialization, return NULL_TREE. The ARGS are a vector of
1021 arguments, or a vector of vectors of arguments, in the case of
1022 templates with more than one level of parameters.
1024 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1025 then we search for a partial specialization matching ARGS. This
1026 parameter is ignored if TMPL is not a class template.
1028 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1029 result is a NONTYPE_ARGUMENT_PACK. */
1032 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1034 if (tmpl
== NULL_TREE
)
1037 if (args
== error_mark_node
)
1040 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1041 || TREE_CODE (tmpl
) == FIELD_DECL
);
1043 /* There should be as many levels of arguments as there are
1044 levels of parameters. */
1045 gcc_assert (TMPL_ARGS_DEPTH (args
)
1046 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1047 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1048 : template_class_depth (DECL_CONTEXT (tmpl
))));
1050 if (optimize_specialization_lookup_p (tmpl
))
1052 tree class_template
;
1053 tree class_specialization
;
1054 vec
<tree
, va_gc
> *methods
;
1058 /* The template arguments actually apply to the containing
1059 class. Find the class specialization with those
1061 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1062 class_specialization
1063 = retrieve_specialization (class_template
, args
, 0);
1064 if (!class_specialization
)
1066 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1067 for the specialization. */
1068 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1071 /* Iterate through the methods with the indicated name, looking
1072 for the one that has an instance of TMPL. */
1073 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1074 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1076 tree fn
= OVL_CURRENT (fns
);
1077 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1078 /* using-declarations can add base methods to the method vec,
1079 and we don't want those here. */
1080 && DECL_CONTEXT (fn
) == class_specialization
)
1089 htab_t specializations
;
1093 elt
.spec
= NULL_TREE
;
1095 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1096 specializations
= type_specializations
;
1098 specializations
= decl_specializations
;
1101 hash
= hash_specialization (&elt
);
1102 found
= (spec_entry
*) htab_find_with_hash (specializations
, &elt
, hash
);
1110 /* Like retrieve_specialization, but for local declarations. */
1113 retrieve_local_specialization (tree tmpl
)
1115 if (local_specializations
== NULL
)
1118 tree
*slot
= local_specializations
->get (tmpl
);
1119 return slot
? *slot
: NULL_TREE
;
1122 /* Returns nonzero iff DECL is a specialization of TMPL. */
1125 is_specialization_of (tree decl
, tree tmpl
)
1129 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1133 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1139 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1141 for (t
= TREE_TYPE (decl
);
1143 t
= CLASSTYPE_USE_TEMPLATE (t
)
1144 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1145 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1152 /* Returns nonzero iff DECL is a specialization of friend declaration
1153 FRIEND_DECL according to [temp.friend]. */
1156 is_specialization_of_friend (tree decl
, tree friend_decl
)
1158 bool need_template
= true;
1161 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1162 || TREE_CODE (decl
) == TYPE_DECL
);
1164 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1165 of a template class, we want to check if DECL is a specialization
1167 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1168 && DECL_TEMPLATE_INFO (friend_decl
)
1169 && !DECL_USE_TEMPLATE (friend_decl
))
1171 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1172 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1173 need_template
= false;
1175 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1176 && !PRIMARY_TEMPLATE_P (friend_decl
))
1177 need_template
= false;
1179 /* There is nothing to do if this is not a template friend. */
1180 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1183 if (is_specialization_of (decl
, friend_decl
))
1187 A member of a class template may be declared to be a friend of a
1188 non-template class. In this case, the corresponding member of
1189 every specialization of the class template is a friend of the
1190 class granting friendship.
1192 For example, given a template friend declaration
1194 template <class T> friend void A<T>::f();
1196 the member function below is considered a friend
1198 template <> struct A<int> {
1202 For this type of template friend, TEMPLATE_DEPTH below will be
1203 nonzero. To determine if DECL is a friend of FRIEND, we first
1204 check if the enclosing class is a specialization of another. */
1206 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1208 && DECL_CLASS_SCOPE_P (decl
)
1209 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1210 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1212 /* Next, we check the members themselves. In order to handle
1213 a few tricky cases, such as when FRIEND_DECL's are
1215 template <class T> friend void A<T>::g(T t);
1216 template <class T> template <T t> friend void A<T>::h();
1220 void A<int>::g(int);
1221 template <int> void A<int>::h();
1223 we need to figure out ARGS, the template arguments from
1224 the context of DECL. This is required for template substitution
1225 of `T' in the function parameter of `g' and template parameter
1226 of `h' in the above examples. Here ARGS corresponds to `int'. */
1228 tree context
= DECL_CONTEXT (decl
);
1229 tree args
= NULL_TREE
;
1230 int current_depth
= 0;
1232 while (current_depth
< template_depth
)
1234 if (CLASSTYPE_TEMPLATE_INFO (context
))
1236 if (current_depth
== 0)
1237 args
= TYPE_TI_ARGS (context
);
1239 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1242 context
= TYPE_CONTEXT (context
);
1245 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1250 tree friend_args_type
;
1251 tree decl_args_type
;
1253 /* Make sure that both DECL and FRIEND_DECL are templates or
1255 is_template
= DECL_TEMPLATE_INFO (decl
)
1256 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1257 if (need_template
^ is_template
)
1259 else if (is_template
)
1261 /* If both are templates, check template parameter list. */
1263 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1265 if (!comp_template_parms
1266 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1270 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1273 decl_type
= TREE_TYPE (decl
);
1275 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1276 tf_none
, NULL_TREE
);
1277 if (friend_type
== error_mark_node
)
1280 /* Check if return types match. */
1281 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1284 /* Check if function parameter types match, ignoring the
1285 `this' parameter. */
1286 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1287 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1288 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1289 friend_args_type
= TREE_CHAIN (friend_args_type
);
1290 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1291 decl_args_type
= TREE_CHAIN (decl_args_type
);
1293 return compparms (decl_args_type
, friend_args_type
);
1297 /* DECL is a TYPE_DECL */
1299 tree decl_type
= TREE_TYPE (decl
);
1301 /* Make sure that both DECL and FRIEND_DECL are templates or
1304 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1305 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1307 if (need_template
^ is_template
)
1309 else if (is_template
)
1312 /* If both are templates, check the name of the two
1313 TEMPLATE_DECL's first because is_friend didn't. */
1314 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1315 != DECL_NAME (friend_decl
))
1318 /* Now check template parameter list. */
1320 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1322 return comp_template_parms
1323 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1327 return (DECL_NAME (decl
)
1328 == DECL_NAME (friend_decl
));
1334 /* Register the specialization SPEC as a specialization of TMPL with
1335 the indicated ARGS. IS_FRIEND indicates whether the specialization
1336 is actually just a friend declaration. Returns SPEC, or an
1337 equivalent prior declaration, if available.
1339 We also store instantiations of field packs in the hash table, even
1340 though they are not themselves templates, to make lookup easier. */
1343 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1350 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1351 || (TREE_CODE (tmpl
) == FIELD_DECL
1352 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1354 if (TREE_CODE (spec
) == FUNCTION_DECL
1355 && uses_template_parms (DECL_TI_ARGS (spec
)))
1356 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1357 register it; we want the corresponding TEMPLATE_DECL instead.
1358 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1359 the more obvious `uses_template_parms (spec)' to avoid problems
1360 with default function arguments. In particular, given
1361 something like this:
1363 template <class T> void f(T t1, T t = T())
1365 the default argument expression is not substituted for in an
1366 instantiation unless and until it is actually needed. */
1369 if (optimize_specialization_lookup_p (tmpl
))
1370 /* We don't put these specializations in the hash table, but we might
1371 want to give an error about a mismatch. */
1372 fn
= retrieve_specialization (tmpl
, args
, 0);
1380 hash
= hash_specialization (&elt
);
1383 htab_find_slot_with_hash (decl_specializations
, &elt
, hash
, INSERT
);
1385 fn
= ((spec_entry
*) *slot
)->spec
;
1390 /* We can sometimes try to re-register a specialization that we've
1391 already got. In particular, regenerate_decl_from_template calls
1392 duplicate_decls which will update the specialization list. But,
1393 we'll still get called again here anyhow. It's more convenient
1394 to simply allow this than to try to prevent it. */
1397 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1399 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1401 if (DECL_ODR_USED (fn
)
1402 || DECL_EXPLICIT_INSTANTIATION (fn
))
1404 error ("specialization of %qD after instantiation",
1406 return error_mark_node
;
1411 /* This situation should occur only if the first
1412 specialization is an implicit instantiation, the
1413 second is an explicit specialization, and the
1414 implicit instantiation has not yet been used. That
1415 situation can occur if we have implicitly
1416 instantiated a member function and then specialized
1419 We can also wind up here if a friend declaration that
1420 looked like an instantiation turns out to be a
1423 template <class T> void foo(T);
1424 class S { friend void foo<>(int) };
1425 template <> void foo(int);
1427 We transform the existing DECL in place so that any
1428 pointers to it become pointers to the updated
1431 If there was a definition for the template, but not
1432 for the specialization, we want this to look as if
1433 there were no definition, and vice versa. */
1434 DECL_INITIAL (fn
) = NULL_TREE
;
1435 duplicate_decls (spec
, fn
, is_friend
);
1436 /* The call to duplicate_decls will have applied
1439 An explicit specialization of a function template
1440 is inline only if it is explicitly declared to be,
1441 and independently of whether its function template
1444 to the primary function; now copy the inline bits to
1445 the various clones. */
1446 FOR_EACH_CLONE (clone
, fn
)
1448 DECL_DECLARED_INLINE_P (clone
)
1449 = DECL_DECLARED_INLINE_P (fn
);
1450 DECL_SOURCE_LOCATION (clone
)
1451 = DECL_SOURCE_LOCATION (fn
);
1452 DECL_DELETED_FN (clone
)
1453 = DECL_DELETED_FN (fn
);
1455 check_specialization_namespace (tmpl
);
1460 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1462 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1463 /* Dup decl failed, but this is a new definition. Set the
1464 line number so any errors match this new
1466 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1472 return duplicate_decls (spec
, fn
, is_friend
);
1474 /* A specialization must be declared in the same namespace as the
1475 template it is specializing. */
1476 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1477 && !check_specialization_namespace (tmpl
))
1478 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1480 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1482 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1483 gcc_assert (tmpl
&& args
&& spec
);
1486 if (TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1487 && PRIMARY_TEMPLATE_P (tmpl
)
1488 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1489 /* TMPL is a forward declaration of a template function; keep a list
1490 of all specializations in case we need to reassign them to a friend
1491 template later in tsubst_friend_function. */
1492 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1493 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1499 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1500 TMPL and ARGS members, ignores SPEC. */
1502 int comparing_specializations
;
1505 eq_specializations (const void *p1
, const void *p2
)
1507 const spec_entry
*e1
= (const spec_entry
*)p1
;
1508 const spec_entry
*e2
= (const spec_entry
*)p2
;
1511 ++comparing_specializations
;
1512 equal
= (e1
->tmpl
== e2
->tmpl
1513 && comp_template_args (e1
->args
, e2
->args
));
1514 --comparing_specializations
;
1519 /* Returns a hash for a template TMPL and template arguments ARGS. */
1522 hash_tmpl_and_args (tree tmpl
, tree args
)
1524 hashval_t val
= DECL_UID (tmpl
);
1525 return iterative_hash_template_arg (args
, val
);
1528 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1532 hash_specialization (const void *p
)
1534 const spec_entry
*e
= (const spec_entry
*)p
;
1535 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1538 /* Recursively calculate a hash value for a template argument ARG, for use
1539 in the hash tables of template specializations. */
1542 iterative_hash_template_arg (tree arg
, hashval_t val
)
1544 unsigned HOST_WIDE_INT i
;
1545 enum tree_code code
;
1548 if (arg
== NULL_TREE
)
1549 return iterative_hash_object (arg
, val
);
1554 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1555 /* We can get one of these when re-hashing a previous entry in the middle
1556 of substituting into a pack expansion. Just look through it. */
1557 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1559 code
= TREE_CODE (arg
);
1560 tclass
= TREE_CODE_CLASS (code
);
1562 val
= iterative_hash_object (code
, val
);
1569 case IDENTIFIER_NODE
:
1570 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1574 int i
, len
= TREE_VEC_LENGTH (arg
);
1575 for (i
= 0; i
< len
; ++i
)
1576 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1580 case TYPE_PACK_EXPANSION
:
1581 case EXPR_PACK_EXPANSION
:
1582 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1583 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1585 case TYPE_ARGUMENT_PACK
:
1586 case NONTYPE_ARGUMENT_PACK
:
1587 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1590 for (; arg
; arg
= TREE_CHAIN (arg
))
1591 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1595 for (; arg
; arg
= OVL_NEXT (arg
))
1596 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1602 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1604 val
= iterative_hash_template_arg (field
, val
);
1605 val
= iterative_hash_template_arg (value
, val
);
1611 if (!DECL_ARTIFICIAL (arg
))
1613 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1614 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1616 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1619 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1622 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1623 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1625 case TEMPLATE_PARM_INDEX
:
1626 val
= iterative_hash_template_arg
1627 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1628 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1629 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1632 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1633 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1634 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1637 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1639 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1643 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1644 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1645 val
= iterative_hash_object (code
, val
);
1646 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1649 /* A lambda can't appear in a template arg, but don't crash on
1651 gcc_assert (seen_error ());
1655 case IMPLICIT_CONV_EXPR
:
1656 case STATIC_CAST_EXPR
:
1657 case REINTERPRET_CAST_EXPR
:
1658 case CONST_CAST_EXPR
:
1659 case DYNAMIC_CAST_EXPR
:
1661 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1662 /* Now hash operands as usual. */
1672 if (TYPE_CANONICAL (arg
))
1673 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1675 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1676 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1677 /* Otherwise just compare the types during lookup. */
1680 case tcc_declaration
:
1682 return iterative_hash_expr (arg
, val
);
1685 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1687 unsigned n
= cp_tree_operand_length (arg
);
1688 for (i
= 0; i
< n
; ++i
)
1689 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1697 /* Unregister the specialization SPEC as a specialization of TMPL.
1698 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1699 if the SPEC was listed as a specialization of TMPL.
1701 Note that SPEC has been ggc_freed, so we can't look inside it. */
1704 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1709 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1710 elt
.args
= TI_ARGS (tinfo
);
1711 elt
.spec
= NULL_TREE
;
1713 entry
= (spec_entry
*) htab_find (decl_specializations
, &elt
);
1716 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1717 gcc_assert (new_spec
!= NULL_TREE
);
1718 entry
->spec
= new_spec
;
1725 /* Like register_specialization, but for local declarations. We are
1726 registering SPEC, an instantiation of TMPL. */
1729 register_local_specialization (tree spec
, tree tmpl
)
1731 local_specializations
->put (tmpl
, spec
);
1734 /* TYPE is a class type. Returns true if TYPE is an explicitly
1735 specialized class. */
1738 explicit_class_specialization_p (tree type
)
1740 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1742 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1745 /* Print the list of functions at FNS, going through all the overloads
1746 for each element of the list. Alternatively, FNS can not be a
1747 TREE_LIST, in which case it will be printed together with all the
1750 MORE and *STR should respectively be FALSE and NULL when the function
1751 is called from the outside. They are used internally on recursive
1752 calls. print_candidates manages the two parameters and leaves NULL
1753 in *STR when it ends. */
1756 print_candidates_1 (tree fns
, bool more
, const char **str
)
1759 char *spaces
= NULL
;
1761 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1762 if (TREE_CODE (fn
) == TREE_LIST
)
1764 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1765 print_candidates_1 (TREE_VALUE (fn2
),
1766 TREE_CHAIN (fn2
) || more
, str
);
1770 tree cand
= OVL_CURRENT (fn
);
1773 /* Pick the prefix string. */
1774 if (!more
&& !OVL_NEXT (fns
))
1776 inform (DECL_SOURCE_LOCATION (cand
),
1777 "candidate is: %#D", cand
);
1781 *str
= _("candidates are:");
1782 spaces
= get_spaces (*str
);
1784 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1785 *str
= spaces
? spaces
: *str
;
1795 /* Print the list of candidate FNS in an error message. FNS can also
1796 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1799 print_candidates (tree fns
)
1801 const char *str
= NULL
;
1802 print_candidates_1 (fns
, false, &str
);
1803 gcc_assert (str
== NULL
);
1806 /* Returns the template (one of the functions given by TEMPLATE_ID)
1807 which can be specialized to match the indicated DECL with the
1808 explicit template args given in TEMPLATE_ID. The DECL may be
1809 NULL_TREE if none is available. In that case, the functions in
1810 TEMPLATE_ID are non-members.
1812 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1813 specialization of a member template.
1815 The TEMPLATE_COUNT is the number of references to qualifying
1816 template classes that appeared in the name of the function. See
1817 check_explicit_specialization for a more accurate description.
1819 TSK indicates what kind of template declaration (if any) is being
1820 declared. TSK_TEMPLATE indicates that the declaration given by
1821 DECL, though a FUNCTION_DECL, has template parameters, and is
1822 therefore a template function.
1824 The template args (those explicitly specified and those deduced)
1825 are output in a newly created vector *TARGS_OUT.
1827 If it is impossible to determine the result, an error message is
1828 issued. The error_mark_node is returned to indicate failure. */
1831 determine_specialization (tree template_id
,
1834 int need_member_template
,
1840 tree explicit_targs
;
1841 tree candidates
= NULL_TREE
;
1842 /* A TREE_LIST of templates of which DECL may be a specialization.
1843 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1844 corresponding TREE_PURPOSE is the set of template arguments that,
1845 when used to instantiate the template, would produce a function
1846 with the signature of DECL. */
1847 tree templates
= NULL_TREE
;
1849 cp_binding_level
*b
;
1851 *targs_out
= NULL_TREE
;
1853 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1854 return error_mark_node
;
1856 /* We shouldn't be specializing a member template of an
1857 unspecialized class template; we already gave an error in
1858 check_specialization_scope, now avoid crashing. */
1859 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
1860 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
1862 gcc_assert (errorcount
);
1863 return error_mark_node
;
1866 fns
= TREE_OPERAND (template_id
, 0);
1867 explicit_targs
= TREE_OPERAND (template_id
, 1);
1869 if (fns
== error_mark_node
)
1870 return error_mark_node
;
1872 /* Check for baselinks. */
1873 if (BASELINK_P (fns
))
1874 fns
= BASELINK_FUNCTIONS (fns
);
1876 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
1878 error ("%qD is not a function template", fns
);
1879 return error_mark_node
;
1881 else if (VAR_P (decl
) && !variable_template_p (fns
))
1883 error ("%qD is not a variable template", fns
);
1884 return error_mark_node
;
1887 /* Count the number of template headers specified for this
1890 for (b
= current_binding_level
;
1891 b
->kind
== sk_template_parms
;
1895 if (variable_template_p (fns
))
1896 templates
= tree_cons (explicit_targs
, fns
, templates
);
1897 else for (; fns
; fns
= OVL_NEXT (fns
))
1899 tree fn
= OVL_CURRENT (fns
);
1901 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1903 tree decl_arg_types
;
1907 /* In case of explicit specialization, we need to check if
1908 the number of template headers appearing in the specialization
1909 is correct. This is usually done in check_explicit_specialization,
1910 but the check done there cannot be exhaustive when specializing
1911 member functions. Consider the following code:
1913 template <> void A<int>::f(int);
1914 template <> template <> void A<int>::f(int);
1916 Assuming that A<int> is not itself an explicit specialization
1917 already, the first line specializes "f" which is a non-template
1918 member function, whilst the second line specializes "f" which
1919 is a template member function. So both lines are syntactically
1920 correct, and check_explicit_specialization does not reject
1923 Here, we can do better, as we are matching the specialization
1924 against the declarations. We count the number of template
1925 headers, and we check if they match TEMPLATE_COUNT + 1
1926 (TEMPLATE_COUNT is the number of qualifying template classes,
1927 plus there must be another header for the member template
1930 Notice that if header_count is zero, this is not a
1931 specialization but rather a template instantiation, so there
1932 is no check we can perform here. */
1933 if (header_count
&& header_count
!= template_count
+ 1)
1936 /* Check that the number of template arguments at the
1937 innermost level for DECL is the same as for FN. */
1938 if (current_binding_level
->kind
== sk_template_parms
1939 && !current_binding_level
->explicit_spec_p
1940 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1941 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1942 (current_template_parms
))))
1945 /* DECL might be a specialization of FN. */
1946 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1947 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1949 /* For a non-static member function, we need to make sure
1950 that the const qualification is the same. Since
1951 get_bindings does not try to merge the "this" parameter,
1952 we must do the comparison explicitly. */
1953 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1954 && !same_type_p (TREE_VALUE (fn_arg_types
),
1955 TREE_VALUE (decl_arg_types
)))
1958 /* Skip the "this" parameter and, for constructors of
1959 classes with virtual bases, the VTT parameter. A
1960 full specialization of a constructor will have a VTT
1961 parameter, but a template never will. */
1963 = skip_artificial_parms_for (decl
, decl_arg_types
);
1965 = skip_artificial_parms_for (fn
, fn_arg_types
);
1967 /* Function templates cannot be specializations; there are
1968 no partial specializations of functions. Therefore, if
1969 the type of DECL does not match FN, there is no
1971 if (tsk
== tsk_template
)
1973 if (compparms (fn_arg_types
, decl_arg_types
))
1974 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1978 /* See whether this function might be a specialization of this
1979 template. Suppress access control because we might be trying
1980 to make this specialization a friend, and we have already done
1981 access control for the declaration of the specialization. */
1982 push_deferring_access_checks (dk_no_check
);
1983 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1984 pop_deferring_access_checks ();
1987 /* We cannot deduce template arguments that when used to
1988 specialize TMPL will produce DECL. */
1991 /* Make sure that the deduced arguments actually work. */
1992 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
1993 if (insttype
== error_mark_node
)
1996 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
1997 if (!compparms (fn_arg_types
, decl_arg_types
))
2000 /* Save this template, and the arguments deduced. */
2001 templates
= tree_cons (targs
, fn
, templates
);
2003 else if (need_member_template
)
2004 /* FN is an ordinary member function, and we need a
2005 specialization of a member template. */
2007 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2008 /* We can get IDENTIFIER_NODEs here in certain erroneous
2011 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2012 /* This is just an ordinary non-member function. Nothing can
2013 be a specialization of that. */
2015 else if (DECL_ARTIFICIAL (fn
))
2016 /* Cannot specialize functions that are created implicitly. */
2020 tree decl_arg_types
;
2022 /* This is an ordinary member function. However, since
2023 we're here, we can assume its enclosing class is a
2024 template class. For example,
2026 template <typename T> struct S { void f(); };
2027 template <> void S<int>::f() {}
2029 Here, S<int>::f is a non-template, but S<int> is a
2030 template class. If FN has the same type as DECL, we
2031 might be in business. */
2033 if (!DECL_TEMPLATE_INFO (fn
))
2034 /* Its enclosing class is an explicit specialization
2035 of a template class. This is not a candidate. */
2038 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2039 TREE_TYPE (TREE_TYPE (fn
))))
2040 /* The return types differ. */
2043 /* Adjust the type of DECL in case FN is a static member. */
2044 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2045 if (DECL_STATIC_FUNCTION_P (fn
)
2046 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2047 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2049 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2052 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2056 if (templates
&& TREE_CHAIN (templates
))
2062 It is possible for a specialization with a given function
2063 signature to be instantiated from more than one function
2064 template. In such cases, explicit specification of the
2065 template arguments must be used to uniquely identify the
2066 function template specialization being specialized.
2068 Note that here, there's no suggestion that we're supposed to
2069 determine which of the candidate templates is most
2070 specialized. However, we, also have:
2074 Partial ordering of overloaded function template
2075 declarations is used in the following contexts to select
2076 the function template to which a function template
2077 specialization refers:
2079 -- when an explicit specialization refers to a function
2082 So, we do use the partial ordering rules, at least for now.
2083 This extension can only serve to make invalid programs valid,
2084 so it's safe. And, there is strong anecdotal evidence that
2085 the committee intended the partial ordering rules to apply;
2086 the EDG front end has that behavior, and John Spicer claims
2087 that the committee simply forgot to delete the wording in
2088 [temp.expl.spec]. */
2089 tree tmpl
= most_specialized_instantiation (templates
);
2090 if (tmpl
!= error_mark_node
)
2093 TREE_CHAIN (templates
) = NULL_TREE
;
2097 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2099 error ("template-id %qD for %q+D does not match any template "
2100 "declaration", template_id
, decl
);
2101 if (header_count
&& header_count
!= template_count
+ 1)
2102 inform (input_location
, "saw %d %<template<>%>, need %d for "
2103 "specializing a member function template",
2104 header_count
, template_count
+ 1);
2105 return error_mark_node
;
2107 else if ((templates
&& TREE_CHAIN (templates
))
2108 || (candidates
&& TREE_CHAIN (candidates
))
2109 || (templates
&& candidates
))
2111 error ("ambiguous template specialization %qD for %q+D",
2113 candidates
= chainon (candidates
, templates
);
2114 print_candidates (candidates
);
2115 return error_mark_node
;
2118 /* We have one, and exactly one, match. */
2121 tree fn
= TREE_VALUE (candidates
);
2122 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2123 /* DECL is a re-declaration or partial instantiation of a template
2125 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2127 /* It was a specialization of an ordinary member function in a
2129 return DECL_TI_TEMPLATE (fn
);
2132 /* It was a specialization of a template. */
2133 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2134 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2136 *targs_out
= copy_node (targs
);
2137 SET_TMPL_ARGS_LEVEL (*targs_out
,
2138 TMPL_ARGS_DEPTH (*targs_out
),
2139 TREE_PURPOSE (templates
));
2142 *targs_out
= TREE_PURPOSE (templates
);
2143 return TREE_VALUE (templates
);
2146 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2147 but with the default argument values filled in from those in the
2151 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2154 tree new_spec_types
;
2159 if (spec_types
== void_list_node
)
2160 return void_list_node
;
2162 /* Substitute into the rest of the list. */
2164 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2165 TREE_CHAIN (tmpl_types
));
2167 /* Add the default argument for this parameter. */
2168 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2169 TREE_VALUE (spec_types
),
2173 /* DECL is an explicit specialization. Replicate default arguments
2174 from the template it specializes. (That way, code like:
2176 template <class T> void f(T = 3);
2177 template <> void f(double);
2180 works, as required.) An alternative approach would be to look up
2181 the correct default arguments at the call-site, but this approach
2182 is consistent with how implicit instantiations are handled. */
2185 copy_default_args_to_explicit_spec (tree decl
)
2190 tree new_spec_types
;
2194 tree object_type
= NULL_TREE
;
2195 tree in_charge
= NULL_TREE
;
2196 tree vtt
= NULL_TREE
;
2198 /* See if there's anything we need to do. */
2199 tmpl
= DECL_TI_TEMPLATE (decl
);
2200 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2201 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2202 if (TREE_PURPOSE (t
))
2207 old_type
= TREE_TYPE (decl
);
2208 spec_types
= TYPE_ARG_TYPES (old_type
);
2210 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2212 /* Remove the this pointer, but remember the object's type for
2214 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2215 spec_types
= TREE_CHAIN (spec_types
);
2216 tmpl_types
= TREE_CHAIN (tmpl_types
);
2218 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2220 /* DECL may contain more parameters than TMPL due to the extra
2221 in-charge parameter in constructors and destructors. */
2222 in_charge
= spec_types
;
2223 spec_types
= TREE_CHAIN (spec_types
);
2225 if (DECL_HAS_VTT_PARM_P (decl
))
2228 spec_types
= TREE_CHAIN (spec_types
);
2232 /* Compute the merged default arguments. */
2234 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2236 /* Compute the new FUNCTION_TYPE. */
2240 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2245 /* Put the in-charge parameter back. */
2246 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2247 TREE_VALUE (in_charge
),
2250 new_type
= build_method_type_directly (object_type
,
2251 TREE_TYPE (old_type
),
2255 new_type
= build_function_type (TREE_TYPE (old_type
),
2257 new_type
= cp_build_type_attribute_variant (new_type
,
2258 TYPE_ATTRIBUTES (old_type
));
2259 new_type
= build_exception_variant (new_type
,
2260 TYPE_RAISES_EXCEPTIONS (old_type
));
2262 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2263 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2265 TREE_TYPE (decl
) = new_type
;
2268 /* Return the number of template headers we expect to see for a definition
2269 or specialization of CTYPE or one of its non-template members. */
2272 num_template_headers_for_class (tree ctype
)
2274 int num_templates
= 0;
2276 while (ctype
&& CLASS_TYPE_P (ctype
))
2278 /* You're supposed to have one `template <...>' for every
2279 template class, but you don't need one for a full
2280 specialization. For example:
2282 template <class T> struct S{};
2283 template <> struct S<int> { void f(); };
2284 void S<int>::f () {}
2286 is correct; there shouldn't be a `template <>' for the
2287 definition of `S<int>::f'. */
2288 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2289 /* If CTYPE does not have template information of any
2290 kind, then it is not a template, nor is it nested
2291 within a template. */
2293 if (explicit_class_specialization_p (ctype
))
2295 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2298 ctype
= TYPE_CONTEXT (ctype
);
2301 return num_templates
;
2304 /* Do a simple sanity check on the template headers that precede the
2305 variable declaration DECL. */
2308 check_template_variable (tree decl
)
2310 tree ctx
= CP_DECL_CONTEXT (decl
);
2311 int wanted
= num_template_headers_for_class (ctx
);
2312 if (!TYPE_P (ctx
) || !CLASSTYPE_TEMPLATE_INFO (ctx
))
2314 if (cxx_dialect
< cxx1y
)
2315 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2316 "variable templates only available with "
2317 "-std=c++1y or -std=gnu++1y");
2319 // Namespace-scope variable templates should have a template header.
2322 if (template_header_count
> wanted
)
2324 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2325 "too many template headers for %D (should be %d)",
2327 if (warned
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2328 inform (DECL_SOURCE_LOCATION (decl
),
2329 "members of an explicitly specialized class are defined "
2330 "without a template header");
2334 /* Check to see if the function just declared, as indicated in
2335 DECLARATOR, and in DECL, is a specialization of a function
2336 template. We may also discover that the declaration is an explicit
2337 instantiation at this point.
2339 Returns DECL, or an equivalent declaration that should be used
2340 instead if all goes well. Issues an error message if something is
2341 amiss. Returns error_mark_node if the error is not easily
2344 FLAGS is a bitmask consisting of the following flags:
2346 2: The function has a definition.
2347 4: The function is a friend.
2349 The TEMPLATE_COUNT is the number of references to qualifying
2350 template classes that appeared in the name of the function. For
2353 template <class T> struct S { void f(); };
2356 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2357 classes are not counted in the TEMPLATE_COUNT, so that in
2359 template <class T> struct S {};
2360 template <> struct S<int> { void f(); }
2361 template <> void S<int>::f();
2363 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2364 invalid; there should be no template <>.)
2366 If the function is a specialization, it is marked as such via
2367 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2368 is set up correctly, and it is added to the list of specializations
2369 for that template. */
2372 check_explicit_specialization (tree declarator
,
2377 int have_def
= flags
& 2;
2378 int is_friend
= flags
& 4;
2379 int specialization
= 0;
2380 int explicit_instantiation
= 0;
2381 int member_specialization
= 0;
2382 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2383 tree dname
= DECL_NAME (decl
);
2388 if (!processing_specialization
)
2391 tsk
= tsk_excessive_parms
;
2394 tsk
= current_tmpl_spec_kind (template_count
);
2399 if (processing_specialization
)
2402 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2404 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2407 /* This could be something like:
2409 template <class T> void f(T);
2410 class S { friend void f<>(int); } */
2414 /* This case handles bogus declarations like template <>
2415 template <class T> void f<int>(); */
2417 error ("template-id %qD in declaration of primary template",
2424 case tsk_invalid_member_spec
:
2425 /* The error has already been reported in
2426 check_specialization_scope. */
2427 return error_mark_node
;
2429 case tsk_invalid_expl_inst
:
2430 error ("template parameter list used in explicit instantiation");
2436 error ("definition provided for explicit instantiation");
2438 explicit_instantiation
= 1;
2441 case tsk_excessive_parms
:
2442 case tsk_insufficient_parms
:
2443 if (tsk
== tsk_excessive_parms
)
2444 error ("too many template parameter lists in declaration of %qD",
2446 else if (template_header_count
)
2447 error("too few template parameter lists in declaration of %qD", decl
);
2449 error("explicit specialization of %qD must be introduced by "
2450 "%<template <>%>", decl
);
2454 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2456 // In cases like template<> constexpr bool v = true;
2457 error ("%qD is not a template variable", dname
);
2461 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2463 member_specialization
= 1;
2469 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2471 /* This case handles bogus declarations like template <>
2472 template <class T> void f<int>(); */
2474 if (uses_template_parms (declarator
))
2475 error ("function template partial specialization %qD "
2476 "is not allowed", declarator
);
2478 error ("template-id %qD in declaration of primary template",
2483 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2484 /* This is a specialization of a member template, without
2485 specialization the containing class. Something like:
2487 template <class T> struct S {
2488 template <class U> void f (U);
2490 template <> template <class U> void S<int>::f(U) {}
2492 That's a specialization -- but of the entire template. */
2500 if ((specialization
|| member_specialization
)
2501 /* This doesn't apply to variable templates. */
2502 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2503 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2505 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2506 for (; t
; t
= TREE_CHAIN (t
))
2507 if (TREE_PURPOSE (t
))
2509 permerror (input_location
,
2510 "default argument specified in explicit specialization");
2515 if (specialization
|| member_specialization
|| explicit_instantiation
)
2517 tree tmpl
= NULL_TREE
;
2518 tree targs
= NULL_TREE
;
2520 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2521 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2525 gcc_assert (identifier_p (declarator
));
2530 /* If there is no class context, the explicit instantiation
2531 must be at namespace scope. */
2532 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2534 /* Find the namespace binding, using the declaration
2536 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2538 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2540 error ("%qD is not a template function", dname
);
2541 fns
= error_mark_node
;
2545 tree fn
= OVL_CURRENT (fns
);
2546 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2547 CP_DECL_CONTEXT (fn
)))
2548 error ("%qD is not declared in %qD",
2549 decl
, current_namespace
);
2553 declarator
= lookup_template_function (fns
, NULL_TREE
);
2556 if (declarator
== error_mark_node
)
2557 return error_mark_node
;
2559 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2561 if (!explicit_instantiation
)
2562 /* A specialization in class scope. This is invalid,
2563 but the error will already have been flagged by
2564 check_specialization_scope. */
2565 return error_mark_node
;
2568 /* It's not valid to write an explicit instantiation in
2571 class C { template void f(); }
2573 This case is caught by the parser. However, on
2576 template class C { void f(); };
2578 (which is invalid) we can get here. The error will be
2585 else if (ctype
!= NULL_TREE
2586 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2588 // Ignore variable templates.
2592 /* Find the list of functions in ctype that have the same
2593 name as the declared function. */
2594 tree name
= TREE_OPERAND (declarator
, 0);
2595 tree fns
= NULL_TREE
;
2598 if (constructor_name_p (name
, ctype
))
2600 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2602 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2603 : !CLASSTYPE_DESTRUCTORS (ctype
))
2605 /* From [temp.expl.spec]:
2607 If such an explicit specialization for the member
2608 of a class template names an implicitly-declared
2609 special member function (clause _special_), the
2610 program is ill-formed.
2612 Similar language is found in [temp.explicit]. */
2613 error ("specialization of implicitly-declared special member function");
2614 return error_mark_node
;
2617 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2620 if (!DECL_CONV_FN_P (decl
))
2622 idx
= lookup_fnfields_1 (ctype
, name
);
2624 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2628 vec
<tree
, va_gc
> *methods
;
2631 /* For a type-conversion operator, we cannot do a
2632 name-based lookup. We might be looking for `operator
2633 int' which will be a specialization of `operator T'.
2634 So, we find *all* the conversion operators, and then
2635 select from them. */
2638 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2640 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2641 methods
->iterate (idx
, &ovl
);
2644 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2645 /* There are no more conversion functions. */
2648 /* Glue all these conversion functions together
2649 with those we already have. */
2650 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2651 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2655 if (fns
== NULL_TREE
)
2657 error ("no member function %qD declared in %qT", name
, ctype
);
2658 return error_mark_node
;
2661 TREE_OPERAND (declarator
, 0) = fns
;
2664 /* Figure out what exactly is being specialized at this point.
2665 Note that for an explicit instantiation, even one for a
2666 member function, we cannot tell apriori whether the
2667 instantiation is for a member template, or just a member
2668 function of a template class. Even if a member template is
2669 being instantiated, the member template arguments may be
2670 elided if they can be deduced from the rest of the
2672 tmpl
= determine_specialization (declarator
, decl
,
2674 member_specialization
,
2678 if (!tmpl
|| tmpl
== error_mark_node
)
2679 /* We couldn't figure out what this declaration was
2681 return error_mark_node
;
2684 tree gen_tmpl
= most_general_template (tmpl
);
2686 if (explicit_instantiation
)
2688 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2689 is done by do_decl_instantiation later. */
2691 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2692 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2694 if (arg_depth
> parm_depth
)
2696 /* If TMPL is not the most general template (for
2697 example, if TMPL is a friend template that is
2698 injected into namespace scope), then there will
2699 be too many levels of TARGS. Remove some of them
2704 new_targs
= make_tree_vec (parm_depth
);
2705 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2706 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2707 = TREE_VEC_ELT (targs
, i
);
2711 return instantiate_template (tmpl
, targs
, tf_error
);
2714 /* If we thought that the DECL was a member function, but it
2715 turns out to be specializing a static member function,
2716 make DECL a static member function as well. */
2717 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2718 && DECL_STATIC_FUNCTION_P (tmpl
)
2719 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2720 revert_static_member_fn (decl
);
2722 /* If this is a specialization of a member template of a
2723 template class, we want to return the TEMPLATE_DECL, not
2724 the specialization of it. */
2725 if (tsk
== tsk_template
)
2727 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2728 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2729 DECL_INITIAL (result
) = NULL_TREE
;
2733 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2734 DECL_SOURCE_LOCATION (result
)
2735 = DECL_SOURCE_LOCATION (decl
);
2736 /* We want to use the argument list specified in the
2737 definition, not in the original declaration. */
2738 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2739 for (parm
= DECL_ARGUMENTS (result
); parm
;
2740 parm
= DECL_CHAIN (parm
))
2741 DECL_CONTEXT (parm
) = result
;
2743 return register_specialization (tmpl
, gen_tmpl
, targs
,
2747 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2748 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2750 /* Inherit default function arguments from the template
2751 DECL is specializing. */
2752 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2753 copy_default_args_to_explicit_spec (decl
);
2755 /* This specialization has the same protection as the
2756 template it specializes. */
2757 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2758 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2760 /* 7.1.1-1 [dcl.stc]
2762 A storage-class-specifier shall not be specified in an
2763 explicit specialization...
2765 The parser rejects these, so unless action is taken here,
2766 explicit function specializations will always appear with
2769 The action recommended by the C++ CWG in response to C++
2770 defect report 605 is to make the storage class and linkage
2771 of the explicit specialization match the templated function:
2773 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2775 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2777 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2778 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2780 /* This specialization has the same linkage and visibility as
2781 the function template it specializes. */
2782 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2783 if (! TREE_PUBLIC (decl
))
2785 DECL_INTERFACE_KNOWN (decl
) = 1;
2786 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2788 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2789 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2791 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2792 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2796 /* If DECL is a friend declaration, declared using an
2797 unqualified name, the namespace associated with DECL may
2798 have been set incorrectly. For example, in:
2800 template <typename T> void f(T);
2802 struct S { friend void f<int>(int); }
2805 we will have set the DECL_CONTEXT for the friend
2806 declaration to N, rather than to the global namespace. */
2807 if (DECL_NAMESPACE_SCOPE_P (decl
))
2808 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2810 if (is_friend
&& !have_def
)
2811 /* This is not really a declaration of a specialization.
2812 It's just the name of an instantiation. But, it's not
2813 a request for an instantiation, either. */
2814 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2815 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
2816 /* A specialization is not necessarily COMDAT. */
2817 DECL_COMDAT (decl
) = DECL_DECLARED_INLINE_P (decl
);
2818 else if (TREE_CODE (decl
) == VAR_DECL
)
2819 DECL_COMDAT (decl
) = false;
2821 /* Register this specialization so that we can find it
2823 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2825 /* A 'structor should already have clones. */
2826 gcc_assert (decl
== error_mark_node
2827 || variable_template_p (tmpl
)
2828 || !(DECL_CONSTRUCTOR_P (decl
)
2829 || DECL_DESTRUCTOR_P (decl
))
2830 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
2837 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2838 parameters. These are represented in the same format used for
2839 DECL_TEMPLATE_PARMS. */
2842 comp_template_parms (const_tree parms1
, const_tree parms2
)
2847 if (parms1
== parms2
)
2850 for (p1
= parms1
, p2
= parms2
;
2851 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2852 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2854 tree t1
= TREE_VALUE (p1
);
2855 tree t2
= TREE_VALUE (p2
);
2858 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2859 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2861 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2864 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2866 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2867 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2869 /* If either of the template parameters are invalid, assume
2870 they match for the sake of error recovery. */
2871 if (error_operand_p (parm1
) || error_operand_p (parm2
))
2874 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2877 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2878 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2879 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2881 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2886 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2887 /* One set of parameters has more parameters lists than the
2894 /* Determine whether PARM is a parameter pack. */
2897 template_parameter_pack_p (const_tree parm
)
2899 /* Determine if we have a non-type template parameter pack. */
2900 if (TREE_CODE (parm
) == PARM_DECL
)
2901 return (DECL_TEMPLATE_PARM_P (parm
)
2902 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2903 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2904 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2906 /* If this is a list of template parameters, we could get a
2907 TYPE_DECL or a TEMPLATE_DECL. */
2908 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2909 parm
= TREE_TYPE (parm
);
2911 /* Otherwise it must be a type template parameter. */
2912 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2913 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2914 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2917 /* Determine if T is a function parameter pack. */
2920 function_parameter_pack_p (const_tree t
)
2922 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2923 return DECL_PACK_P (t
);
2927 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2928 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2931 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2933 if (! primary_func_tmpl_inst
2934 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2935 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2938 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2941 /* Return true iff the function parameter PARAM_DECL was expanded
2942 from the function parameter pack PACK. */
2945 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2947 if (DECL_ARTIFICIAL (param_decl
)
2948 || !function_parameter_pack_p (pack
))
2951 /* The parameter pack and its pack arguments have the same
2953 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2956 /* Determine whether ARGS describes a variadic template args list,
2957 i.e., one that is terminated by a template argument pack. */
2960 template_args_variadic_p (tree args
)
2965 if (args
== NULL_TREE
)
2968 args
= INNERMOST_TEMPLATE_ARGS (args
);
2969 nargs
= TREE_VEC_LENGTH (args
);
2974 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2976 return ARGUMENT_PACK_P (last_parm
);
2979 /* Generate a new name for the parameter pack name NAME (an
2980 IDENTIFIER_NODE) that incorporates its */
2983 make_ith_pack_parameter_name (tree name
, int i
)
2985 /* Munge the name to include the parameter index. */
2986 #define NUMBUF_LEN 128
2987 char numbuf
[NUMBUF_LEN
];
2991 if (name
== NULL_TREE
)
2993 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2994 newname_len
= IDENTIFIER_LENGTH (name
)
2995 + strlen (numbuf
) + 2;
2996 newname
= (char*)alloca (newname_len
);
2997 snprintf (newname
, newname_len
,
2998 "%s#%i", IDENTIFIER_POINTER (name
), i
);
2999 return get_identifier (newname
);
3002 /* Return true if T is a primary function, class or alias template
3006 primary_template_instantiation_p (const_tree t
)
3011 if (TREE_CODE (t
) == FUNCTION_DECL
)
3012 return DECL_LANG_SPECIFIC (t
)
3013 && DECL_TEMPLATE_INSTANTIATION (t
)
3014 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3015 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3016 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3017 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3018 else if (alias_template_specialization_p (t
))
3023 /* Return true if PARM is a template template parameter. */
3026 template_template_parameter_p (const_tree parm
)
3028 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3031 /* Return true iff PARM is a DECL representing a type template
3035 template_type_parameter_p (const_tree parm
)
3038 && (TREE_CODE (parm
) == TYPE_DECL
3039 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3040 && DECL_TEMPLATE_PARM_P (parm
));
3043 /* Return the template parameters of T if T is a
3044 primary template instantiation, NULL otherwise. */
3047 get_primary_template_innermost_parameters (const_tree t
)
3049 tree parms
= NULL
, template_info
= NULL
;
3051 if ((template_info
= get_template_info (t
))
3052 && primary_template_instantiation_p (t
))
3053 parms
= INNERMOST_TEMPLATE_PARMS
3054 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3059 /* Return the template parameters of the LEVELth level from the full list
3060 of template parameters PARMS. */
3063 get_template_parms_at_level (tree parms
, int level
)
3067 || TREE_CODE (parms
) != TREE_LIST
3068 || level
> TMPL_PARMS_DEPTH (parms
))
3071 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3072 if (TMPL_PARMS_DEPTH (p
) == level
)
3078 /* Returns the template arguments of T if T is a template instantiation,
3082 get_template_innermost_arguments (const_tree t
)
3084 tree args
= NULL
, template_info
= NULL
;
3086 if ((template_info
= get_template_info (t
))
3087 && TI_ARGS (template_info
))
3088 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3093 /* Return the argument pack elements of T if T is a template argument pack,
3097 get_template_argument_pack_elems (const_tree t
)
3099 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3100 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3103 return ARGUMENT_PACK_ARGS (t
);
3106 /* Structure used to track the progress of find_parameter_packs_r. */
3107 struct find_parameter_pack_data
3109 /* TREE_LIST that will contain all of the parameter packs found by
3111 tree
* parameter_packs
;
3113 /* Set of AST nodes that have been visited by the traversal. */
3114 hash_set
<tree
> *visited
;
3117 /* Identifies all of the argument packs that occur in a template
3118 argument and appends them to the TREE_LIST inside DATA, which is a
3119 find_parameter_pack_data structure. This is a subroutine of
3120 make_pack_expansion and uses_parameter_packs. */
3122 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3125 struct find_parameter_pack_data
* ppd
=
3126 (struct find_parameter_pack_data
*)data
;
3127 bool parameter_pack_p
= false;
3129 /* Handle type aliases/typedefs. */
3130 if (TYPE_ALIAS_P (t
))
3132 if (TYPE_TEMPLATE_INFO (t
))
3133 cp_walk_tree (&TYPE_TI_ARGS (t
),
3134 &find_parameter_packs_r
,
3140 /* Identify whether this is a parameter pack or not. */
3141 switch (TREE_CODE (t
))
3143 case TEMPLATE_PARM_INDEX
:
3144 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3145 parameter_pack_p
= true;
3148 case TEMPLATE_TYPE_PARM
:
3149 t
= TYPE_MAIN_VARIANT (t
);
3150 case TEMPLATE_TEMPLATE_PARM
:
3151 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3152 parameter_pack_p
= true;
3157 if (DECL_PACK_P (t
))
3159 /* We don't want to walk into the type of a PARM_DECL,
3160 because we don't want to see the type parameter pack. */
3162 parameter_pack_p
= true;
3166 /* Look through a lambda capture proxy to the field pack. */
3168 if (DECL_HAS_VALUE_EXPR_P (t
))
3170 tree v
= DECL_VALUE_EXPR (t
);
3172 &find_parameter_packs_r
,
3179 parameter_pack_p
= true;
3182 /* Not a parameter pack. */
3186 if (parameter_pack_p
)
3188 /* Add this parameter pack to the list. */
3189 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3193 cp_walk_tree (&TYPE_CONTEXT (t
),
3194 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3196 /* This switch statement will return immediately if we don't find a
3198 switch (TREE_CODE (t
))
3200 case TEMPLATE_PARM_INDEX
:
3203 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3204 /* Check the template itself. */
3205 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3206 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3207 /* Check the template arguments. */
3208 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3213 case TEMPLATE_TYPE_PARM
:
3214 case TEMPLATE_TEMPLATE_PARM
:
3221 if (TYPE_PTRMEMFUNC_P (t
))
3227 if (TYPE_TEMPLATE_INFO (t
))
3228 cp_walk_tree (&TYPE_TI_ARGS (t
),
3229 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3236 cp_walk_tree (&TREE_TYPE (t
),
3237 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3241 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3246 case TYPE_PACK_EXPANSION
:
3247 case EXPR_PACK_EXPANSION
:
3252 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3257 case IDENTIFIER_NODE
:
3258 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3270 /* Determines if the expression or type T uses any parameter packs. */
3272 uses_parameter_packs (tree t
)
3274 tree parameter_packs
= NULL_TREE
;
3275 struct find_parameter_pack_data ppd
;
3276 ppd
.parameter_packs
= ¶meter_packs
;
3277 ppd
.visited
= new hash_set
<tree
>;
3278 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3280 return parameter_packs
!= NULL_TREE
;
3283 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3284 representation a base-class initializer into a parameter pack
3285 expansion. If all goes well, the resulting node will be an
3286 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3289 make_pack_expansion (tree arg
)
3292 tree parameter_packs
= NULL_TREE
;
3293 bool for_types
= false;
3294 struct find_parameter_pack_data ppd
;
3296 if (!arg
|| arg
== error_mark_node
)
3299 if (TREE_CODE (arg
) == TREE_LIST
)
3301 /* The only time we will see a TREE_LIST here is for a base
3302 class initializer. In this case, the TREE_PURPOSE will be a
3303 _TYPE node (representing the base class expansion we're
3304 initializing) and the TREE_VALUE will be a TREE_LIST
3305 containing the initialization arguments.
3307 The resulting expansion looks somewhat different from most
3308 expansions. Rather than returning just one _EXPANSION, we
3309 return a TREE_LIST whose TREE_PURPOSE is a
3310 TYPE_PACK_EXPANSION containing the bases that will be
3311 initialized. The TREE_VALUE will be identical to the
3312 original TREE_VALUE, which is a list of arguments that will
3313 be passed to each base. We do not introduce any new pack
3314 expansion nodes into the TREE_VALUE (although it is possible
3315 that some already exist), because the TREE_PURPOSE and
3316 TREE_VALUE all need to be expanded together with the same
3317 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3318 resulting TREE_PURPOSE will mention the parameter packs in
3319 both the bases and the arguments to the bases. */
3322 tree parameter_packs
= NULL_TREE
;
3324 /* Determine which parameter packs will be used by the base
3326 ppd
.visited
= new hash_set
<tree
>;
3327 ppd
.parameter_packs
= ¶meter_packs
;
3328 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3331 if (parameter_packs
== NULL_TREE
)
3333 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3335 return error_mark_node
;
3338 if (TREE_VALUE (arg
) != void_type_node
)
3340 /* Collect the sets of parameter packs used in each of the
3341 initialization arguments. */
3342 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3344 /* Determine which parameter packs will be expanded in this
3346 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3353 /* Create the pack expansion type for the base type. */
3354 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3355 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3356 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3358 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3359 they will rarely be compared to anything. */
3360 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3362 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3365 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3368 /* Build the PACK_EXPANSION_* node. */
3370 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3371 : make_node (EXPR_PACK_EXPANSION
);
3372 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3373 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3375 /* Propagate type and const-expression information. */
3376 TREE_TYPE (result
) = TREE_TYPE (arg
);
3377 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3380 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3381 they will rarely be compared to anything. */
3382 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3384 /* Determine which parameter packs will be expanded. */
3385 ppd
.parameter_packs
= ¶meter_packs
;
3386 ppd
.visited
= new hash_set
<tree
>;
3387 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3390 /* Make sure we found some parameter packs. */
3391 if (parameter_packs
== NULL_TREE
)
3394 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3396 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3397 return error_mark_node
;
3399 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3401 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3406 /* Checks T for any "bare" parameter packs, which have not yet been
3407 expanded, and issues an error if any are found. This operation can
3408 only be done on full expressions or types (e.g., an expression
3409 statement, "if" condition, etc.), because we could have expressions like:
3411 foo(f(g(h(args)))...)
3413 where "args" is a parameter pack. check_for_bare_parameter_packs
3414 should not be called for the subexpressions args, h(args),
3415 g(h(args)), or f(g(h(args))), because we would produce erroneous
3418 Returns TRUE and emits an error if there were bare parameter packs,
3419 returns FALSE otherwise. */
3421 check_for_bare_parameter_packs (tree t
)
3423 tree parameter_packs
= NULL_TREE
;
3424 struct find_parameter_pack_data ppd
;
3426 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3429 if (TREE_CODE (t
) == TYPE_DECL
)
3432 ppd
.parameter_packs
= ¶meter_packs
;
3433 ppd
.visited
= new hash_set
<tree
>;
3434 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3437 if (parameter_packs
)
3439 error ("parameter packs not expanded with %<...%>:");
3440 while (parameter_packs
)
3442 tree pack
= TREE_VALUE (parameter_packs
);
3443 tree name
= NULL_TREE
;
3445 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3446 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3447 name
= TYPE_NAME (pack
);
3448 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3449 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3451 name
= DECL_NAME (pack
);
3454 inform (input_location
, " %qD", name
);
3456 inform (input_location
, " <anonymous>");
3458 parameter_packs
= TREE_CHAIN (parameter_packs
);
3467 /* Expand any parameter packs that occur in the template arguments in
3470 expand_template_argument_pack (tree args
)
3472 tree result_args
= NULL_TREE
;
3473 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3474 int num_result_args
= -1;
3475 int non_default_args_count
= -1;
3477 /* First, determine if we need to expand anything, and the number of
3478 slots we'll need. */
3479 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3481 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3482 if (arg
== NULL_TREE
)
3484 if (ARGUMENT_PACK_P (arg
))
3486 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3487 if (num_result_args
< 0)
3488 num_result_args
= in_arg
+ num_packed
;
3490 num_result_args
+= num_packed
;
3494 if (num_result_args
>= 0)
3499 /* If no expansion is necessary, we're done. */
3500 if (num_result_args
< 0)
3503 /* Expand arguments. */
3504 result_args
= make_tree_vec (num_result_args
);
3505 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3506 non_default_args_count
=
3507 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3508 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3510 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3511 if (ARGUMENT_PACK_P (arg
))
3513 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3514 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3515 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3516 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3517 if (non_default_args_count
> 0)
3518 non_default_args_count
+= num_packed
- 1;
3522 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3526 if (non_default_args_count
>= 0)
3527 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3531 /* Checks if DECL shadows a template parameter.
3533 [temp.local]: A template-parameter shall not be redeclared within its
3534 scope (including nested scopes).
3536 Emits an error and returns TRUE if the DECL shadows a parameter,
3537 returns FALSE otherwise. */
3540 check_template_shadow (tree decl
)
3544 /* If we're not in a template, we can't possibly shadow a template
3546 if (!current_template_parms
)
3549 /* Figure out what we're shadowing. */
3550 if (TREE_CODE (decl
) == OVERLOAD
)
3551 decl
= OVL_CURRENT (decl
);
3552 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3554 /* If there's no previous binding for this name, we're not shadowing
3555 anything, let alone a template parameter. */
3559 /* If we're not shadowing a template parameter, we're done. Note
3560 that OLDDECL might be an OVERLOAD (or perhaps even an
3561 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3563 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3566 /* We check for decl != olddecl to avoid bogus errors for using a
3567 name inside a class. We check TPFI to avoid duplicate errors for
3568 inline member templates. */
3570 || (DECL_TEMPLATE_PARM_P (decl
)
3571 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3574 /* Don't complain about the injected class name, as we've already
3575 complained about the class itself. */
3576 if (DECL_SELF_REFERENCE_P (decl
))
3579 error ("declaration of %q+#D", decl
);
3580 error (" shadows template parm %q+#D", olddecl
);
3584 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3585 ORIG_LEVEL, DECL, and TYPE. */
3588 build_template_parm_index (int index
,
3594 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3595 TEMPLATE_PARM_IDX (t
) = index
;
3596 TEMPLATE_PARM_LEVEL (t
) = level
;
3597 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3598 TEMPLATE_PARM_DECL (t
) = decl
;
3599 TREE_TYPE (t
) = type
;
3600 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3601 TREE_READONLY (t
) = TREE_READONLY (decl
);
3606 /* Find the canonical type parameter for the given template type
3607 parameter. Returns the canonical type parameter, which may be TYPE
3608 if no such parameter existed. */
3611 canonical_type_parameter (tree type
)
3614 int idx
= TEMPLATE_TYPE_IDX (type
);
3615 if (!canonical_template_parms
)
3616 vec_alloc (canonical_template_parms
, idx
+1);
3618 while (canonical_template_parms
->length () <= (unsigned)idx
)
3619 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3621 list
= (*canonical_template_parms
)[idx
];
3622 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3623 list
= TREE_CHAIN (list
);
3626 return TREE_VALUE (list
);
3629 (*canonical_template_parms
)[idx
]
3630 = tree_cons (NULL_TREE
, type
,
3631 (*canonical_template_parms
)[idx
]);
3636 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3637 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3638 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3639 new one is created. */
3642 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3643 tsubst_flags_t complain
)
3645 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3646 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3647 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3648 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3650 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3653 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3654 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3655 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3656 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3657 DECL_ARTIFICIAL (decl
) = 1;
3658 SET_DECL_TEMPLATE_PARM_P (decl
);
3660 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3661 TEMPLATE_PARM_LEVEL (index
) - levels
,
3662 TEMPLATE_PARM_ORIG_LEVEL (index
),
3664 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3665 TEMPLATE_PARM_PARAMETER_PACK (t
)
3666 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3668 /* Template template parameters need this. */
3669 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3670 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3671 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3675 return TEMPLATE_PARM_DESCENDANTS (index
);
3678 /* Process information from new template parameter PARM and append it
3679 to the LIST being built. This new parameter is a non-type
3680 parameter iff IS_NON_TYPE is true. This new parameter is a
3681 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3685 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3686 bool is_non_type
, bool is_parameter_pack
)
3692 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3693 defval
= TREE_PURPOSE (parm
);
3697 tree p
= tree_last (list
);
3699 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3702 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3703 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3705 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3713 parm
= TREE_VALUE (parm
);
3715 SET_DECL_TEMPLATE_PARM_P (parm
);
3717 if (TREE_TYPE (parm
) != error_mark_node
)
3721 The top-level cv-qualifiers on the template-parameter are
3722 ignored when determining its type. */
3723 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3724 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3725 TREE_TYPE (parm
) = error_mark_node
;
3726 else if (uses_parameter_packs (TREE_TYPE (parm
))
3727 && !is_parameter_pack
3728 /* If we're in a nested template parameter list, the template
3729 template parameter could be a parameter pack. */
3730 && processing_template_parmlist
== 1)
3732 /* This template parameter is not a parameter pack, but it
3733 should be. Complain about "bare" parameter packs. */
3734 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3736 /* Recover by calling this a parameter pack. */
3737 is_parameter_pack
= true;
3741 /* A template parameter is not modifiable. */
3742 TREE_CONSTANT (parm
) = 1;
3743 TREE_READONLY (parm
) = 1;
3744 decl
= build_decl (parm_loc
,
3745 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3746 TREE_CONSTANT (decl
) = 1;
3747 TREE_READONLY (decl
) = 1;
3748 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3749 = build_template_parm_index (idx
, processing_template_decl
,
3750 processing_template_decl
,
3751 decl
, TREE_TYPE (parm
));
3753 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3754 = is_parameter_pack
;
3759 parm
= TREE_VALUE (TREE_VALUE (parm
));
3761 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3763 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3764 /* This is for distinguishing between real templates and template
3765 template parameters */
3766 TREE_TYPE (parm
) = t
;
3767 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3772 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3773 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3774 decl
= build_decl (parm_loc
,
3775 TYPE_DECL
, parm
, t
);
3778 TYPE_NAME (t
) = decl
;
3779 TYPE_STUB_DECL (t
) = decl
;
3781 TEMPLATE_TYPE_PARM_INDEX (t
)
3782 = build_template_parm_index (idx
, processing_template_decl
,
3783 processing_template_decl
,
3784 decl
, TREE_TYPE (parm
));
3785 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3786 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3788 DECL_ARTIFICIAL (decl
) = 1;
3789 SET_DECL_TEMPLATE_PARM_P (decl
);
3791 parm
= build_tree_list (defval
, parm
);
3792 return chainon (list
, parm
);
3795 /* The end of a template parameter list has been reached. Process the
3796 tree list into a parameter vector, converting each parameter into a more
3797 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3801 end_template_parm_list (tree parms
)
3805 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3807 current_template_parms
3808 = tree_cons (size_int (processing_template_decl
),
3809 saved_parmlist
, current_template_parms
);
3811 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3813 next
= TREE_CHAIN (parm
);
3814 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3815 TREE_CHAIN (parm
) = NULL_TREE
;
3818 --processing_template_parmlist
;
3820 return saved_parmlist
;
3823 /* end_template_decl is called after a template declaration is seen. */
3826 end_template_decl (void)
3828 reset_specialization ();
3830 if (! processing_template_decl
)
3833 /* This matches the pushlevel in begin_template_parm_list. */
3836 --processing_template_decl
;
3837 current_template_parms
= TREE_CHAIN (current_template_parms
);
3840 /* Takes a TREE_LIST representing a template parameter and convert it
3841 into an argument suitable to be passed to the type substitution
3842 functions. Note that If the TREE_LIST contains an error_mark
3843 node, the returned argument is error_mark_node. */
3846 template_parm_to_arg (tree t
)
3850 || TREE_CODE (t
) != TREE_LIST
)
3853 if (error_operand_p (TREE_VALUE (t
)))
3854 return error_mark_node
;
3858 if (TREE_CODE (t
) == TYPE_DECL
3859 || TREE_CODE (t
) == TEMPLATE_DECL
)
3863 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3865 /* Turn this argument into a TYPE_ARGUMENT_PACK
3866 with a single element, which expands T. */
3867 tree vec
= make_tree_vec (1);
3868 #ifdef ENABLE_CHECKING
3869 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3870 (vec
, TREE_VEC_LENGTH (vec
));
3872 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3874 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3875 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3880 t
= DECL_INITIAL (t
);
3882 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3884 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3885 with a single element, which expands T. */
3886 tree vec
= make_tree_vec (1);
3887 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3888 #ifdef ENABLE_CHECKING
3889 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3890 (vec
, TREE_VEC_LENGTH (vec
));
3892 t
= convert_from_reference (t
);
3893 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3895 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3896 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3897 TREE_TYPE (t
) = type
;
3900 t
= convert_from_reference (t
);
3905 /* Given a set of template parameters, return them as a set of template
3906 arguments. The template parameters are represented as a TREE_VEC, in
3907 the form documented in cp-tree.h for template arguments. */
3910 template_parms_to_args (tree parms
)
3913 tree args
= NULL_TREE
;
3914 int length
= TMPL_PARMS_DEPTH (parms
);
3917 /* If there is only one level of template parameters, we do not
3918 create a TREE_VEC of TREE_VECs. Instead, we return a single
3919 TREE_VEC containing the arguments. */
3921 args
= make_tree_vec (length
);
3923 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3925 tree a
= copy_node (TREE_VALUE (header
));
3928 TREE_TYPE (a
) = NULL_TREE
;
3929 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3930 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3932 #ifdef ENABLE_CHECKING
3933 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3937 TREE_VEC_ELT (args
, --l
) = a
;
3942 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3943 /* This can happen for template parms of a template template
3946 template<template<class T, class U> class TT> struct S;
3948 Consider the level of the parms of TT; T and U both have
3949 level 2; TT has no template parm of level 1. So in this case
3950 the first element of full_template_args is NULL_TREE. If we
3951 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3952 of 2. This will make tsubst wrongly consider that T and U
3953 have level 1. Instead, let's create a dummy vector as the
3954 first element of full_template_args so that TMPL_ARGS_DEPTH
3955 returns the correct depth for args. */
3956 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3960 /* Within the declaration of a template, return the currently active
3961 template parameters as an argument TREE_VEC. */
3964 current_template_args (void)
3966 return template_parms_to_args (current_template_parms
);
3969 /* Update the declared TYPE by doing any lookups which were thought to be
3970 dependent, but are not now that we know the SCOPE of the declarator. */
3973 maybe_update_decl_type (tree orig_type
, tree scope
)
3975 tree type
= orig_type
;
3977 if (type
== NULL_TREE
)
3980 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3981 type
= TREE_TYPE (type
);
3983 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3984 && dependent_type_p (type
)
3985 /* Don't bother building up the args in this case. */
3986 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3988 /* tsubst in the args corresponding to the template parameters,
3989 including auto if present. Most things will be unchanged, but
3990 make_typename_type and tsubst_qualified_id will resolve
3991 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3992 tree args
= current_template_args ();
3993 tree auto_node
= type_uses_auto (type
);
3997 tree auto_vec
= make_tree_vec (1);
3998 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
3999 args
= add_to_template_args (args
, auto_vec
);
4001 pushed
= push_scope (scope
);
4002 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4007 if (type
== error_mark_node
)
4010 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4012 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4015 type
= TYPE_NAME (type
);
4020 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4021 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
4022 a member template. Used by push_template_decl below. */
4025 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4027 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4028 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4029 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4030 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4031 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4036 struct template_parm_data
4038 /* The level of the template parameters we are currently
4042 /* The index of the specialization argument we are currently
4046 /* An array whose size is the number of template parameters. The
4047 elements are nonzero if the parameter has been used in any one
4048 of the arguments processed so far. */
4051 /* An array whose size is the number of template arguments. The
4052 elements are nonzero if the argument makes use of template
4053 parameters of this level. */
4054 int* arg_uses_template_parms
;
4057 /* Subroutine of push_template_decl used to see if each template
4058 parameter in a partial specialization is used in the explicit
4059 argument list. If T is of the LEVEL given in DATA (which is
4060 treated as a template_parm_data*), then DATA->PARMS is marked
4064 mark_template_parm (tree t
, void* data
)
4068 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4070 template_parm_level_and_index (t
, &level
, &idx
);
4072 if (level
== tpd
->level
)
4074 tpd
->parms
[idx
] = 1;
4075 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4078 /* Return zero so that for_each_template_parm will continue the
4079 traversal of the tree; we want to mark *every* template parm. */
4083 /* Process the partial specialization DECL. */
4086 process_partial_specialization (tree decl
)
4088 tree type
= TREE_TYPE (decl
);
4089 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4090 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4091 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4092 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4095 int nargs
= TREE_VEC_LENGTH (inner_args
);
4098 bool did_error_intro
= false;
4099 struct template_parm_data tpd
;
4100 struct template_parm_data tpd2
;
4102 gcc_assert (current_template_parms
);
4104 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4105 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4107 /* We check that each of the template parameters given in the
4108 partial specialization is used in the argument list to the
4109 specialization. For example:
4111 template <class T> struct S;
4112 template <class T> struct S<T*>;
4114 The second declaration is OK because `T*' uses the template
4115 parameter T, whereas
4117 template <class T> struct S<int>;
4119 is no good. Even trickier is:
4130 The S2<T> declaration is actually invalid; it is a
4131 full-specialization. Of course,
4134 struct S2<T (*)(U)>;
4136 or some such would have been OK. */
4137 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4138 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4139 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4141 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4142 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4143 for (i
= 0; i
< nargs
; ++i
)
4145 tpd
.current_arg
= i
;
4146 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4147 &mark_template_parm
,
4150 /*include_nondeduced_p=*/false);
4152 for (i
= 0; i
< ntparms
; ++i
)
4153 if (tpd
.parms
[i
] == 0)
4155 /* One of the template parms was not used in a deduced context in the
4157 if (!did_error_intro
)
4159 error ("template parameters not deducible in "
4160 "partial specialization:");
4161 did_error_intro
= true;
4164 inform (input_location
, " %qD",
4165 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4168 if (did_error_intro
)
4169 return error_mark_node
;
4171 /* [temp.class.spec]
4173 The argument list of the specialization shall not be identical to
4174 the implicit argument list of the primary template. */
4175 if (comp_template_args
4177 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4179 error ("partial specialization %qT does not specialize any template arguments", type
);
4181 /* A partial specialization that replaces multiple parameters of the
4182 primary template with a pack expansion is less specialized for those
4184 if (nargs
< DECL_NTPARMS (maintmpl
))
4186 error ("partial specialization is not more specialized than the "
4187 "primary template because it replaces multiple parameters "
4188 "with a pack expansion");
4189 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4193 /* [temp.class.spec]
4195 A partially specialized non-type argument expression shall not
4196 involve template parameters of the partial specialization except
4197 when the argument expression is a simple identifier.
4199 The type of a template parameter corresponding to a specialized
4200 non-type argument shall not be dependent on a parameter of the
4203 Also, we verify that pack expansions only occur at the
4204 end of the argument list. */
4205 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4207 for (i
= 0; i
< nargs
; ++i
)
4209 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4210 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4211 tree packed_args
= NULL_TREE
;
4214 if (ARGUMENT_PACK_P (arg
))
4216 /* Extract the arguments from the argument pack. We'll be
4217 iterating over these in the following loop. */
4218 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4219 len
= TREE_VEC_LENGTH (packed_args
);
4222 for (j
= 0; j
< len
; j
++)
4225 /* Get the Jth argument in the parameter pack. */
4226 arg
= TREE_VEC_ELT (packed_args
, j
);
4228 if (PACK_EXPANSION_P (arg
))
4230 /* Pack expansions must come at the end of the
4232 if ((packed_args
&& j
< len
- 1)
4233 || (!packed_args
&& i
< nargs
- 1))
4235 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4236 error ("parameter pack argument %qE must be at the "
4237 "end of the template argument list", arg
);
4239 error ("parameter pack argument %qT must be at the "
4240 "end of the template argument list", arg
);
4244 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4245 /* We only care about the pattern. */
4246 arg
= PACK_EXPANSION_PATTERN (arg
);
4248 if (/* These first two lines are the `non-type' bit. */
4250 && TREE_CODE (arg
) != TEMPLATE_DECL
4251 /* This next two lines are the `argument expression is not just a
4252 simple identifier' condition and also the `specialized
4253 non-type argument' bit. */
4254 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4255 && !(REFERENCE_REF_P (arg
)
4256 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4258 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4259 || (packed_args
&& uses_template_parms (arg
)))
4260 error ("template argument %qE involves template parameter(s)",
4264 /* Look at the corresponding template parameter,
4265 marking which template parameters its type depends
4267 tree type
= TREE_TYPE (parm
);
4271 /* We haven't yet initialized TPD2. Do so now. */
4272 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4273 /* The number of parameters here is the number in the
4274 main template, which, as checked in the assertion
4276 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4278 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4281 /* Mark the template parameters. But this time, we're
4282 looking for the template parameters of the main
4283 template, not in the specialization. */
4284 tpd2
.current_arg
= i
;
4285 tpd2
.arg_uses_template_parms
[i
] = 0;
4286 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4287 for_each_template_parm (type
,
4288 &mark_template_parm
,
4291 /*include_nondeduced_p=*/false);
4293 if (tpd2
.arg_uses_template_parms
[i
])
4295 /* The type depended on some template parameters.
4296 If they are fully specialized in the
4297 specialization, that's OK. */
4300 for (j
= 0; j
< nargs
; ++j
)
4301 if (tpd2
.parms
[j
] != 0
4302 && tpd
.arg_uses_template_parms
[j
])
4305 error_n (input_location
, count
,
4306 "type %qT of template argument %qE depends "
4307 "on a template parameter",
4308 "type %qT of template argument %qE depends "
4309 "on template parameters",
4318 /* We should only get here once. */
4319 gcc_assert (!COMPLETE_TYPE_P (type
));
4321 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4322 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4323 TREE_TYPE (tmpl
) = type
;
4324 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4325 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4326 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4327 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4329 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4330 = tree_cons (specargs
, tmpl
,
4331 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4332 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4334 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4335 inst
= TREE_CHAIN (inst
))
4337 tree inst_type
= TREE_VALUE (inst
);
4338 if (COMPLETE_TYPE_P (inst_type
)
4339 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4341 tree spec
= most_specialized_class (inst_type
, tf_none
);
4342 if (spec
&& TREE_TYPE (spec
) == type
)
4343 permerror (input_location
,
4344 "partial specialization of %qT after instantiation "
4345 "of %qT", type
, inst_type
);
4352 /* PARM is a template parameter of some form; return the corresponding
4353 TEMPLATE_PARM_INDEX. */
4356 get_template_parm_index (tree parm
)
4358 if (TREE_CODE (parm
) == PARM_DECL
4359 || TREE_CODE (parm
) == CONST_DECL
)
4360 parm
= DECL_INITIAL (parm
);
4361 else if (TREE_CODE (parm
) == TYPE_DECL
4362 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4363 parm
= TREE_TYPE (parm
);
4364 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4365 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4366 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4367 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4371 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4372 parameter packs used by the template parameter PARM. */
4375 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4377 /* A type parm can't refer to another parm. */
4378 if (TREE_CODE (parm
) == TYPE_DECL
)
4380 else if (TREE_CODE (parm
) == PARM_DECL
)
4382 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4387 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4389 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4390 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4391 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4394 /* PARM is a template parameter pack. Return any parameter packs used in
4395 its type or the type of any of its template parameters. If there are
4396 any such packs, it will be instantiated into a fixed template parameter
4397 list by partial instantiation rather than be fully deduced. */
4400 fixed_parameter_pack_p (tree parm
)
4402 /* This can only be true in a member template. */
4403 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4405 /* This can only be true for a parameter pack. */
4406 if (!template_parameter_pack_p (parm
))
4408 /* A type parm can't refer to another parm. */
4409 if (TREE_CODE (parm
) == TYPE_DECL
)
4412 tree parameter_packs
= NULL_TREE
;
4413 struct find_parameter_pack_data ppd
;
4414 ppd
.parameter_packs
= ¶meter_packs
;
4415 ppd
.visited
= new hash_set
<tree
>;
4417 fixed_parameter_pack_p_1 (parm
, &ppd
);
4420 return parameter_packs
;
4423 /* Check that a template declaration's use of default arguments and
4424 parameter packs is not invalid. Here, PARMS are the template
4425 parameters. IS_PRIMARY is true if DECL is the thing declared by
4426 a primary template. IS_PARTIAL is true if DECL is a partial
4429 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4430 declaration (but not a definition); 1 indicates a declaration, 2
4431 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4432 emitted for extraneous default arguments.
4434 Returns TRUE if there were no errors found, FALSE otherwise. */
4437 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4438 bool is_partial
, int is_friend_decl
)
4441 int last_level_to_check
;
4443 bool no_errors
= true;
4447 A default template-argument shall not be specified in a
4448 function template declaration or a function template definition, nor
4449 in the template-parameter-list of the definition of a member of a
4452 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4453 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4454 /* You can't have a function template declaration in a local
4455 scope, nor you can you define a member of a class template in a
4459 if (TREE_CODE (decl
) == TYPE_DECL
4461 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4462 /* A lambda doesn't have an explicit declaration; don't complain
4463 about the parms of the enclosing class. */
4466 if (current_class_type
4467 && !TYPE_BEING_DEFINED (current_class_type
)
4468 && DECL_LANG_SPECIFIC (decl
)
4469 && DECL_DECLARES_FUNCTION_P (decl
)
4470 /* If this is either a friend defined in the scope of the class
4471 or a member function. */
4472 && (DECL_FUNCTION_MEMBER_P (decl
)
4473 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4474 : DECL_FRIEND_CONTEXT (decl
)
4475 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4477 /* And, if it was a member function, it really was defined in
4478 the scope of the class. */
4479 && (!DECL_FUNCTION_MEMBER_P (decl
)
4480 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4481 /* We already checked these parameters when the template was
4482 declared, so there's no need to do it again now. This function
4483 was defined in class scope, but we're processing its body now
4484 that the class is complete. */
4487 /* Core issue 226 (C++0x only): the following only applies to class
4490 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4494 If a template-parameter has a default template-argument, all
4495 subsequent template-parameters shall have a default
4496 template-argument supplied. */
4497 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4499 tree inner_parms
= TREE_VALUE (parm_level
);
4500 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4501 int seen_def_arg_p
= 0;
4504 for (i
= 0; i
< ntparms
; ++i
)
4506 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4508 if (parm
== error_mark_node
)
4511 if (TREE_PURPOSE (parm
))
4513 else if (seen_def_arg_p
4514 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4516 error ("no default argument for %qD", TREE_VALUE (parm
));
4517 /* For better subsequent error-recovery, we indicate that
4518 there should have been a default argument. */
4519 TREE_PURPOSE (parm
) = error_mark_node
;
4522 else if (!is_partial
4524 /* Don't complain about an enclosing partial
4526 && parm_level
== parms
4527 && TREE_CODE (decl
) == TYPE_DECL
4529 && template_parameter_pack_p (TREE_VALUE (parm
))
4530 /* A fixed parameter pack will be partially
4531 instantiated into a fixed length list. */
4532 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4534 /* A primary class template can only have one
4535 parameter pack, at the end of the template
4538 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4539 error ("parameter pack %qE must be at the end of the"
4540 " template parameter list", TREE_VALUE (parm
));
4542 error ("parameter pack %qT must be at the end of the"
4543 " template parameter list",
4544 TREE_TYPE (TREE_VALUE (parm
)));
4546 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4554 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4558 /* For an ordinary class template, default template arguments are
4559 allowed at the innermost level, e.g.:
4560 template <class T = int>
4562 but, in a partial specialization, they're not allowed even
4563 there, as we have in [temp.class.spec]:
4565 The template parameter list of a specialization shall not
4566 contain default template argument values.
4568 So, for a partial specialization, or for a function template
4569 (in C++98/C++03), we look at all of them. */
4572 /* But, for a primary class template that is not a partial
4573 specialization we look at all template parameters except the
4575 parms
= TREE_CHAIN (parms
);
4577 /* Figure out what error message to issue. */
4578 if (is_friend_decl
== 2)
4579 msg
= G_("default template arguments may not be used in function template "
4580 "friend re-declaration");
4581 else if (is_friend_decl
)
4582 msg
= G_("default template arguments may not be used in function template "
4583 "friend declarations");
4584 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4585 msg
= G_("default template arguments may not be used in function templates "
4586 "without -std=c++11 or -std=gnu++11");
4587 else if (is_partial
)
4588 msg
= G_("default template arguments may not be used in "
4589 "partial specializations");
4591 msg
= G_("default argument for template parameter for class enclosing %qD");
4593 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4594 /* If we're inside a class definition, there's no need to
4595 examine the parameters to the class itself. On the one
4596 hand, they will be checked when the class is defined, and,
4597 on the other, default arguments are valid in things like:
4598 template <class T = double>
4599 struct S { template <class U> void f(U); };
4600 Here the default argument for `S' has no bearing on the
4601 declaration of `f'. */
4602 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4604 /* Check everything. */
4605 last_level_to_check
= 0;
4607 for (parm_level
= parms
;
4608 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4609 parm_level
= TREE_CHAIN (parm_level
))
4611 tree inner_parms
= TREE_VALUE (parm_level
);
4615 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4616 for (i
= 0; i
< ntparms
; ++i
)
4618 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4621 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4626 if (is_friend_decl
== 2)
4633 /* Clear out the default argument so that we are not
4635 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4639 /* At this point, if we're still interested in issuing messages,
4640 they must apply to classes surrounding the object declared. */
4642 msg
= G_("default argument for template parameter for class "
4649 /* Worker for push_template_decl_real, called via
4650 for_each_template_parm. DATA is really an int, indicating the
4651 level of the parameters we are interested in. If T is a template
4652 parameter of that level, return nonzero. */
4655 template_parm_this_level_p (tree t
, void* data
)
4657 int this_level
= *(int *)data
;
4660 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4661 level
= TEMPLATE_PARM_LEVEL (t
);
4663 level
= TEMPLATE_TYPE_LEVEL (t
);
4664 return level
== this_level
;
4667 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4668 parameters given by current_template_args, or reuses a
4669 previously existing one, if appropriate. Returns the DECL, or an
4670 equivalent one, if it is replaced via a call to duplicate_decls.
4672 If IS_FRIEND is true, DECL is a friend declaration. */
4675 push_template_decl_real (tree decl
, bool is_friend
)
4683 int new_template_p
= 0;
4684 /* True if the template is a member template, in the sense of
4686 bool member_template_p
= false;
4688 if (decl
== error_mark_node
|| !current_template_parms
)
4689 return error_mark_node
;
4691 /* See if this is a partial specialization. */
4692 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4693 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4694 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4696 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4700 /* For a friend, we want the context of the friend function, not
4701 the type of which it is a friend. */
4702 ctx
= CP_DECL_CONTEXT (decl
);
4703 else if (CP_DECL_CONTEXT (decl
)
4704 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4705 /* In the case of a virtual function, we want the class in which
4707 ctx
= CP_DECL_CONTEXT (decl
);
4709 /* Otherwise, if we're currently defining some class, the DECL
4710 is assumed to be a member of the class. */
4711 ctx
= current_scope ();
4713 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4716 if (!DECL_CONTEXT (decl
))
4717 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4719 /* See if this is a primary template. */
4720 if (is_friend
&& ctx
4721 && uses_template_parms_level (ctx
, processing_template_decl
))
4722 /* A friend template that specifies a class context, i.e.
4723 template <typename T> friend void A<T>::f();
4727 is_primary
= template_parm_scope_p ();
4731 if (DECL_CLASS_SCOPE_P (decl
))
4732 member_template_p
= true;
4733 if (TREE_CODE (decl
) == TYPE_DECL
4734 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4736 error ("template class without a name");
4737 return error_mark_node
;
4739 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4741 if (DECL_DESTRUCTOR_P (decl
))
4745 A destructor shall not be a member template. */
4746 error ("destructor %qD declared as member template", decl
);
4747 return error_mark_node
;
4749 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4750 && (!prototype_p (TREE_TYPE (decl
))
4751 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4752 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4753 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4754 == void_list_node
)))
4756 /* [basic.stc.dynamic.allocation]
4758 An allocation function can be a function
4759 template. ... Template allocation functions shall
4760 have two or more parameters. */
4761 error ("invalid template declaration of %qD", decl
);
4762 return error_mark_node
;
4765 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4766 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4768 else if (TREE_CODE (decl
) == TYPE_DECL
4769 && TYPE_DECL_ALIAS_P (decl
))
4770 /* alias-declaration */
4771 gcc_assert (!DECL_ARTIFICIAL (decl
));
4772 else if (VAR_P (decl
))
4774 if (!DECL_DECLARED_CONSTEXPR_P (decl
))
4776 sorry ("template declaration of non-constexpr variable %qD",
4778 return error_mark_node
;
4783 error ("template declaration of %q#D", decl
);
4784 return error_mark_node
;
4788 /* Check to see that the rules regarding the use of default
4789 arguments are not being violated. */
4790 check_default_tmpl_args (decl
, current_template_parms
,
4791 is_primary
, is_partial
, /*is_friend_decl=*/0);
4793 /* Ensure that there are no parameter packs in the type of this
4794 declaration that have not been expanded. */
4795 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4797 /* Check each of the arguments individually to see if there are
4798 any bare parameter packs. */
4799 tree type
= TREE_TYPE (decl
);
4800 tree arg
= DECL_ARGUMENTS (decl
);
4801 tree argtype
= TYPE_ARG_TYPES (type
);
4803 while (arg
&& argtype
)
4805 if (!DECL_PACK_P (arg
)
4806 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4808 /* This is a PARM_DECL that contains unexpanded parameter
4809 packs. We have already complained about this in the
4810 check_for_bare_parameter_packs call, so just replace
4811 these types with ERROR_MARK_NODE. */
4812 TREE_TYPE (arg
) = error_mark_node
;
4813 TREE_VALUE (argtype
) = error_mark_node
;
4816 arg
= DECL_CHAIN (arg
);
4817 argtype
= TREE_CHAIN (argtype
);
4820 /* Check for bare parameter packs in the return type and the
4821 exception specifiers. */
4822 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4823 /* Errors were already issued, set return type to int
4824 as the frontend doesn't expect error_mark_node as
4826 TREE_TYPE (type
) = integer_type_node
;
4827 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4828 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4830 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4831 && TYPE_DECL_ALIAS_P (decl
))
4832 ? DECL_ORIGINAL_TYPE (decl
)
4833 : TREE_TYPE (decl
)))
4835 TREE_TYPE (decl
) = error_mark_node
;
4836 return error_mark_node
;
4840 return process_partial_specialization (decl
);
4842 args
= current_template_args ();
4845 || TREE_CODE (ctx
) == FUNCTION_DECL
4846 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4847 || (TREE_CODE (decl
) == TYPE_DECL
4848 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4849 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4851 if (DECL_LANG_SPECIFIC (decl
)
4852 && DECL_TEMPLATE_INFO (decl
)
4853 && DECL_TI_TEMPLATE (decl
))
4854 tmpl
= DECL_TI_TEMPLATE (decl
);
4855 /* If DECL is a TYPE_DECL for a class-template, then there won't
4856 be DECL_LANG_SPECIFIC. The information equivalent to
4857 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4858 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4859 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4860 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4862 /* Since a template declaration already existed for this
4863 class-type, we must be redeclaring it here. Make sure
4864 that the redeclaration is valid. */
4865 redeclare_class_template (TREE_TYPE (decl
),
4866 current_template_parms
);
4867 /* We don't need to create a new TEMPLATE_DECL; just use the
4868 one we already had. */
4869 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4873 tmpl
= build_template_decl (decl
, current_template_parms
,
4877 if (DECL_LANG_SPECIFIC (decl
)
4878 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4880 /* A specialization of a member template of a template
4882 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4883 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4884 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4890 tree a
, t
, current
, parms
;
4892 tree tinfo
= get_template_info (decl
);
4896 error ("template definition of non-template %q#D", decl
);
4897 return error_mark_node
;
4900 tmpl
= TI_TEMPLATE (tinfo
);
4902 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4903 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4904 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4905 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4909 /* The declaration is a specialization of a member
4910 template, declared outside the class. Therefore, the
4911 innermost template arguments will be NULL, so we
4912 replace them with the arguments determined by the
4913 earlier call to check_explicit_specialization. */
4914 args
= DECL_TI_ARGS (decl
);
4917 = build_template_decl (decl
, current_template_parms
,
4919 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4920 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4921 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4922 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4923 DECL_TEMPLATE_INFO (new_tmpl
)
4924 = build_template_info (tmpl
, args
);
4926 register_specialization (new_tmpl
,
4927 most_general_template (tmpl
),
4933 /* Make sure the template headers we got make sense. */
4935 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4936 i
= TMPL_PARMS_DEPTH (parms
);
4937 if (TMPL_ARGS_DEPTH (args
) != i
)
4939 error ("expected %d levels of template parms for %q#D, got %d",
4940 i
, decl
, TMPL_ARGS_DEPTH (args
));
4941 DECL_INTERFACE_KNOWN (decl
) = 1;
4942 return error_mark_node
;
4945 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4947 a
= TMPL_ARGS_LEVEL (args
, i
);
4948 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4950 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4952 if (current
== decl
)
4953 error ("got %d template parameters for %q#D",
4954 TREE_VEC_LENGTH (a
), decl
);
4956 error ("got %d template parameters for %q#T",
4957 TREE_VEC_LENGTH (a
), current
);
4958 error (" but %d required", TREE_VEC_LENGTH (t
));
4959 /* Avoid crash in import_export_decl. */
4960 DECL_INTERFACE_KNOWN (decl
) = 1;
4961 return error_mark_node
;
4964 if (current
== decl
)
4966 else if (current
== NULL_TREE
)
4967 /* Can happen in erroneous input. */
4970 current
= get_containing_scope (current
);
4973 /* Check that the parms are used in the appropriate qualifying scopes
4974 in the declarator. */
4975 if (!comp_template_args
4977 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4980 template arguments to %qD do not match original template %qD",
4981 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4982 if (!uses_template_parms (TI_ARGS (tinfo
)))
4983 inform (input_location
, "use template<> for an explicit specialization");
4984 /* Avoid crash in import_export_decl. */
4985 DECL_INTERFACE_KNOWN (decl
) = 1;
4986 return error_mark_node
;
4990 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4991 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4993 /* Push template declarations for global functions and types. Note
4994 that we do not try to push a global template friend declared in a
4995 template class; such a thing may well depend on the template
4996 parameters of the class. */
4997 if (new_template_p
&& !ctx
4998 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5000 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5001 if (tmpl
== error_mark_node
)
5002 return error_mark_node
;
5004 /* Hide template friend classes that haven't been declared yet. */
5005 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5007 DECL_ANTICIPATED (tmpl
) = 1;
5008 DECL_FRIEND_P (tmpl
) = 1;
5014 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5017 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5018 if (DECL_CONV_FN_P (tmpl
))
5020 int depth
= TMPL_PARMS_DEPTH (parms
);
5022 /* It is a conversion operator. See if the type converted to
5023 depends on innermost template operands. */
5025 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5027 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5030 /* Give template template parms a DECL_CONTEXT of the template
5031 for which they are a parameter. */
5032 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5033 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5035 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5036 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5037 DECL_CONTEXT (parm
) = tmpl
;
5041 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5042 back to its most general template. If TMPL is a specialization,
5043 ARGS may only have the innermost set of arguments. Add the missing
5044 argument levels if necessary. */
5045 if (DECL_TEMPLATE_INFO (tmpl
))
5046 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5048 info
= build_template_info (tmpl
, args
);
5050 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5051 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5054 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5055 retrofit_lang_decl (decl
);
5056 if (DECL_LANG_SPECIFIC (decl
))
5057 DECL_TEMPLATE_INFO (decl
) = info
;
5060 if (flag_implicit_templates
5062 && VAR_OR_FUNCTION_DECL_P (decl
))
5063 /* Set DECL_COMDAT on template instantiations; if we force
5064 them to be emitted by explicit instantiation or -frepo,
5065 mark_needed will tell cgraph to do the right thing. */
5066 DECL_COMDAT (decl
) = true;
5068 return DECL_TEMPLATE_RESULT (tmpl
);
5072 push_template_decl (tree decl
)
5074 return push_template_decl_real (decl
, false);
5077 /* FN is an inheriting constructor that inherits from the constructor
5078 template INHERITED; turn FN into a constructor template with a matching
5082 add_inherited_template_parms (tree fn
, tree inherited
)
5085 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5086 inner_parms
= copy_node (inner_parms
);
5088 = tree_cons (size_int (processing_template_decl
+ 1),
5089 inner_parms
, current_template_parms
);
5090 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5091 tree args
= template_parms_to_args (parms
);
5092 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5093 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5094 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5095 DECL_ARTIFICIAL (tmpl
) = true;
5096 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5100 /* Called when a class template TYPE is redeclared with the indicated
5101 template PARMS, e.g.:
5103 template <class T> struct S;
5104 template <class T> struct S {}; */
5107 redeclare_class_template (tree type
, tree parms
)
5113 if (!TYPE_TEMPLATE_INFO (type
))
5115 error ("%qT is not a template type", type
);
5119 tmpl
= TYPE_TI_TEMPLATE (type
);
5120 if (!PRIMARY_TEMPLATE_P (tmpl
))
5121 /* The type is nested in some template class. Nothing to worry
5122 about here; there are no new template parameters for the nested
5128 error ("template specifiers not specified in declaration of %qD",
5133 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5134 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5136 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5138 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5139 "redeclared with %d template parameter",
5140 "redeclared with %d template parameters",
5141 TREE_VEC_LENGTH (parms
));
5142 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5143 "previous declaration %q+D used %d template parameter",
5144 "previous declaration %q+D used %d template parameters",
5145 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5149 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5156 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5157 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5160 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5161 if (error_operand_p (tmpl_parm
))
5164 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5165 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5166 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5168 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5170 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5171 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5172 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5173 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5174 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5175 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5176 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5177 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5178 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5180 error ("template parameter %q+#D", tmpl_parm
);
5181 error ("redeclared here as %q#D", parm
);
5185 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5187 /* We have in [temp.param]:
5189 A template-parameter may not be given default arguments
5190 by two different declarations in the same scope. */
5191 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5192 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5193 "original definition appeared here");
5197 if (parm_default
!= NULL_TREE
)
5198 /* Update the previous template parameters (which are the ones
5199 that will really count) with the new default value. */
5200 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5201 else if (tmpl_default
!= NULL_TREE
)
5202 /* Update the new parameters, too; they'll be used as the
5203 parameters for any members. */
5204 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5210 /* Simplify EXPR if it is a non-dependent expression. Returns the
5211 (possibly simplified) expression. */
5214 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5216 if (expr
== NULL_TREE
)
5219 /* If we're in a template, but EXPR isn't value dependent, simplify
5220 it. We're supposed to treat:
5222 template <typename T> void f(T[1 + 1]);
5223 template <typename T> void f(T[2]);
5225 as two declarations of the same function, for example. */
5226 if (processing_template_decl
5227 && !instantiation_dependent_expression_p (expr
)
5228 && potential_constant_expression (expr
))
5230 HOST_WIDE_INT saved_processing_template_decl
;
5232 saved_processing_template_decl
= processing_template_decl
;
5233 processing_template_decl
= 0;
5234 expr
= tsubst_copy_and_build (expr
,
5237 /*in_decl=*/NULL_TREE
,
5238 /*function_p=*/false,
5239 /*integral_constant_expression_p=*/true);
5240 processing_template_decl
= saved_processing_template_decl
;
5246 fold_non_dependent_expr (tree expr
)
5248 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5251 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5252 template declaration, or a TYPE_DECL for an alias declaration. */
5255 alias_type_or_template_p (tree t
)
5259 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5262 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5263 || DECL_ALIAS_TEMPLATE_P (t
));
5266 /* Return TRUE iff is a specialization of an alias template. */
5269 alias_template_specialization_p (const_tree t
)
5275 && TYPE_TEMPLATE_INFO (t
)
5276 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5277 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5280 /* Return the number of innermost template parameters in TMPL. */
5283 num_innermost_template_parms (tree tmpl
)
5285 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5286 return TREE_VEC_LENGTH (parms
);
5289 /* Return either TMPL or another template that it is equivalent to under DR
5290 1286: An alias that just changes the name of a template is equivalent to
5291 the other template. */
5294 get_underlying_template (tree tmpl
)
5296 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5297 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5299 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5300 if (TYPE_TEMPLATE_INFO (result
))
5302 tree sub
= TYPE_TI_TEMPLATE (result
);
5303 if (PRIMARY_TEMPLATE_P (sub
)
5304 && (num_innermost_template_parms (tmpl
)
5305 == num_innermost_template_parms (sub
)))
5307 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5308 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5309 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5311 /* The alias type is equivalent to the pattern of the
5312 underlying template, so strip the alias. */
5322 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5323 must be a function or a pointer-to-function type, as specified
5324 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5325 and check that the resulting function has external linkage. */
5328 convert_nontype_argument_function (tree type
, tree expr
,
5329 tsubst_flags_t complain
)
5333 linkage_kind linkage
;
5335 fn
= instantiate_type (type
, fns
, tf_none
);
5336 if (fn
== error_mark_node
)
5337 return error_mark_node
;
5340 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5341 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5342 if (BASELINK_P (fn_no_ptr
))
5343 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5345 /* [temp.arg.nontype]/1
5347 A template-argument for a non-type, non-template template-parameter
5350 -- the address of an object or function with external [C++11: or
5351 internal] linkage. */
5353 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5355 if (complain
& tf_error
)
5357 error ("%qE is not a valid template argument for type %qT",
5359 if (TYPE_PTR_P (type
))
5360 error ("it must be the address of a function with "
5361 "external linkage");
5363 error ("it must be the name of a function with "
5364 "external linkage");
5369 linkage
= decl_linkage (fn_no_ptr
);
5370 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5372 if (complain
& tf_error
)
5374 if (cxx_dialect
>= cxx11
)
5375 error ("%qE is not a valid template argument for type %qT "
5376 "because %qD has no linkage",
5377 expr
, type
, fn_no_ptr
);
5379 error ("%qE is not a valid template argument for type %qT "
5380 "because %qD does not have external linkage",
5381 expr
, type
, fn_no_ptr
);
5389 /* Subroutine of convert_nontype_argument.
5390 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5391 Emit an error otherwise. */
5394 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5395 tsubst_flags_t complain
)
5398 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5400 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5402 if (processing_template_decl
5403 && TREE_CODE (expr
) == ADDR_EXPR
5404 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5406 if (complain
& tf_error
)
5408 error ("%qE is not a valid template argument for type %qT",
5410 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5415 /* Returns TRUE iff the address of OP is value-dependent.
5417 14.6.2.4 [temp.dep.temp]:
5418 A non-integral non-type template-argument is dependent if its type is
5419 dependent or it has either of the following forms
5422 and contains a nested-name-specifier which specifies a class-name that
5423 names a dependent type.
5425 We generalize this to just say that the address of a member of a
5426 dependent class is value-dependent; the above doesn't cover the
5427 address of a static data member named with an unqualified-id. */
5430 has_value_dependent_address (tree op
)
5432 /* We could use get_inner_reference here, but there's no need;
5433 this is only relevant for template non-type arguments, which
5434 can only be expressed as &id-expression. */
5437 tree ctx
= CP_DECL_CONTEXT (op
);
5438 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5445 /* The next set of functions are used for providing helpful explanatory
5446 diagnostics for failed overload resolution. Their messages should be
5447 indented by two spaces for consistency with the messages in
5451 unify_success (bool /*explain_p*/)
5457 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5460 inform (input_location
,
5461 " couldn't deduce template parameter %qD", parm
);
5466 unify_invalid (bool /*explain_p*/)
5472 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5475 inform (input_location
,
5476 " types %qT and %qT have incompatible cv-qualifiers",
5482 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5485 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5490 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5493 inform (input_location
,
5494 " template parameter %qD is not a parameter pack, but "
5501 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5504 inform (input_location
,
5505 " template argument %qE does not match "
5506 "pointer-to-member constant %qE",
5512 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5515 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5520 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5523 inform (input_location
,
5524 " inconsistent parameter pack deduction with %qT and %qT",
5530 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5535 inform (input_location
,
5536 " deduced conflicting types for parameter %qT (%qT and %qT)",
5537 parm
, first
, second
);
5539 inform (input_location
,
5540 " deduced conflicting values for non-type parameter "
5541 "%qE (%qE and %qE)", parm
, first
, second
);
5547 unify_vla_arg (bool explain_p
, tree arg
)
5550 inform (input_location
,
5551 " variable-sized array type %qT is not "
5552 "a valid template argument",
5558 unify_method_type_error (bool explain_p
, tree arg
)
5561 inform (input_location
,
5562 " member function type %qT is not a valid template argument",
5568 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
5573 inform_n (input_location
, wanted
,
5574 " candidate expects at least %d argument, %d provided",
5575 " candidate expects at least %d arguments, %d provided",
5578 inform_n (input_location
, wanted
,
5579 " candidate expects %d argument, %d provided",
5580 " candidate expects %d arguments, %d provided",
5587 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5589 return unify_arity (explain_p
, have
, wanted
);
5593 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
5594 bool least_p
= false)
5596 return unify_arity (explain_p
, have
, wanted
, least_p
);
5600 unify_arg_conversion (bool explain_p
, tree to_type
,
5601 tree from_type
, tree arg
)
5604 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5605 " cannot convert %qE (type %qT) to type %qT",
5606 arg
, from_type
, to_type
);
5611 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5612 tree parm
, tree arg
)
5617 case tbr_ambiguous_baseclass
:
5618 inform (input_location
, " %qT is an ambiguous base class of %qT",
5622 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5629 unify_inconsistent_template_template_parameters (bool explain_p
)
5632 inform (input_location
,
5633 " template parameters of a template template argument are "
5634 "inconsistent with other deduced template arguments");
5639 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5642 inform (input_location
,
5643 " can't deduce a template for %qT from non-template type %qT",
5649 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5652 inform (input_location
,
5653 " template argument %qE does not match %qD", arg
, parm
);
5658 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5661 inform (input_location
,
5662 " could not resolve address from overloaded function %qE",
5667 /* Attempt to convert the non-type template parameter EXPR to the
5668 indicated TYPE. If the conversion is successful, return the
5669 converted value. If the conversion is unsuccessful, return
5670 NULL_TREE if we issued an error message, or error_mark_node if we
5671 did not. We issue error messages for out-and-out bad template
5672 parameters, but not simply because the conversion failed, since we
5673 might be just trying to do argument deduction. Both TYPE and EXPR
5674 must be non-dependent.
5676 The conversion follows the special rules described in
5677 [temp.arg.nontype], and it is much more strict than an implicit
5680 This function is called twice for each template argument (see
5681 lookup_template_class for a more accurate description of this
5682 problem). This means that we need to handle expressions which
5683 are not valid in a C++ source, but can be created from the
5684 first call (for instance, casts to perform conversions). These
5685 hacks can go away after we fix the double coercion problem. */
5688 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5692 /* Detect immediately string literals as invalid non-type argument.
5693 This special-case is not needed for correctness (we would easily
5694 catch this later), but only to provide better diagnostic for this
5695 common user mistake. As suggested by DR 100, we do not mention
5696 linkage issues in the diagnostic as this is not the point. */
5697 /* FIXME we're making this OK. */
5698 if (TREE_CODE (expr
) == STRING_CST
)
5700 if (complain
& tf_error
)
5701 error ("%qE is not a valid template argument for type %qT "
5702 "because string literals can never be used in this context",
5707 /* Add the ADDR_EXPR now for the benefit of
5708 value_dependent_expression_p. */
5709 if (TYPE_PTROBV_P (type
)
5710 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5712 expr
= decay_conversion (expr
, complain
);
5713 if (expr
== error_mark_node
)
5714 return error_mark_node
;
5717 /* If we are in a template, EXPR may be non-dependent, but still
5718 have a syntactic, rather than semantic, form. For example, EXPR
5719 might be a SCOPE_REF, rather than the VAR_DECL to which the
5720 SCOPE_REF refers. Preserving the qualifying scope is necessary
5721 so that access checking can be performed when the template is
5722 instantiated -- but here we need the resolved form so that we can
5723 convert the argument. */
5724 if (TYPE_REF_OBJ_P (type
)
5725 && has_value_dependent_address (expr
))
5726 /* If we want the address and it's value-dependent, don't fold. */;
5727 else if (!type_unknown_p (expr
))
5728 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5729 if (error_operand_p (expr
))
5730 return error_mark_node
;
5731 expr_type
= TREE_TYPE (expr
);
5732 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5733 expr
= mark_lvalue_use (expr
);
5735 expr
= mark_rvalue_use (expr
);
5737 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5738 to a non-type argument of "nullptr". */
5739 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5740 expr
= convert (type
, expr
);
5742 /* In C++11, integral or enumeration non-type template arguments can be
5743 arbitrary constant expressions. Pointer and pointer to
5744 member arguments can be general constant expressions that evaluate
5745 to a null value, but otherwise still need to be of a specific form. */
5746 if (cxx_dialect
>= cxx11
)
5748 if (TREE_CODE (expr
) == PTRMEM_CST
)
5749 /* A PTRMEM_CST is already constant, and a valid template
5750 argument for a parameter of pointer to member type, we just want
5751 to leave it in that form rather than lower it to a
5753 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5754 expr
= maybe_constant_value (expr
);
5755 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5757 tree folded
= maybe_constant_value (expr
);
5758 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5759 : null_member_pointer_value_p (folded
))
5764 /* HACK: Due to double coercion, we can get a
5765 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5766 which is the tree that we built on the first call (see
5767 below when coercing to reference to object or to reference to
5768 function). We just strip everything and get to the arg.
5769 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5771 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5773 tree probe_type
, probe
= expr
;
5774 if (REFERENCE_REF_P (probe
))
5775 probe
= TREE_OPERAND (probe
, 0);
5776 probe_type
= TREE_TYPE (probe
);
5777 if (TREE_CODE (probe
) == NOP_EXPR
)
5779 /* ??? Maybe we could use convert_from_reference here, but we
5780 would need to relax its constraints because the NOP_EXPR
5781 could actually change the type to something more cv-qualified,
5782 and this is not folded by convert_from_reference. */
5783 tree addr
= TREE_OPERAND (probe
, 0);
5784 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5785 && TREE_CODE (addr
) == ADDR_EXPR
5786 && TYPE_PTR_P (TREE_TYPE (addr
))
5787 && (same_type_ignoring_top_level_qualifiers_p
5788 (TREE_TYPE (probe_type
),
5789 TREE_TYPE (TREE_TYPE (addr
)))))
5791 expr
= TREE_OPERAND (addr
, 0);
5792 expr_type
= TREE_TYPE (probe_type
);
5797 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5798 parameter is a pointer to object, through decay and
5799 qualification conversion. Let's strip everything. */
5800 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5804 if (TREE_CODE (probe
) == ADDR_EXPR
5805 && TYPE_PTR_P (TREE_TYPE (probe
)))
5807 /* Skip the ADDR_EXPR only if it is part of the decay for
5808 an array. Otherwise, it is part of the original argument
5809 in the source code. */
5810 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5811 probe
= TREE_OPERAND (probe
, 0);
5813 expr_type
= TREE_TYPE (expr
);
5817 /* [temp.arg.nontype]/5, bullet 1
5819 For a non-type template-parameter of integral or enumeration type,
5820 integral promotions (_conv.prom_) and integral conversions
5821 (_conv.integral_) are applied. */
5822 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5824 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5825 t
= maybe_constant_value (t
);
5826 if (t
!= error_mark_node
)
5829 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5830 return error_mark_node
;
5832 /* Notice that there are constant expressions like '4 % 0' which
5833 do not fold into integer constants. */
5834 if (TREE_CODE (expr
) != INTEGER_CST
)
5836 if (complain
& tf_error
)
5838 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5839 if (processing_template_decl
5840 && !require_potential_constant_expression (expr
))
5842 expr
= cxx_constant_value (expr
);
5843 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5844 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
5845 "in template argument for type %qT ", type
);
5846 if (expr
== error_mark_node
)
5848 /* else cxx_constant_value complained but gave us
5849 a real constant, so go ahead. */
5850 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5856 /* Avoid typedef problems. */
5857 if (TREE_TYPE (expr
) != type
)
5858 expr
= fold_convert (type
, expr
);
5860 /* [temp.arg.nontype]/5, bullet 2
5862 For a non-type template-parameter of type pointer to object,
5863 qualification conversions (_conv.qual_) and the array-to-pointer
5864 conversion (_conv.array_) are applied. */
5865 else if (TYPE_PTROBV_P (type
))
5867 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5869 A template-argument for a non-type, non-template template-parameter
5870 shall be one of: [...]
5872 -- the name of a non-type template-parameter;
5873 -- the address of an object or function with external linkage, [...]
5874 expressed as "& id-expression" where the & is optional if the name
5875 refers to a function or array, or if the corresponding
5876 template-parameter is a reference.
5878 Here, we do not care about functions, as they are invalid anyway
5879 for a parameter of type pointer-to-object. */
5881 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5882 /* Non-type template parameters are OK. */
5884 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5885 /* Null pointer values are OK in C++11. */;
5886 else if (TREE_CODE (expr
) != ADDR_EXPR
5887 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5891 if (complain
& tf_error
)
5892 error ("%qD is not a valid template argument "
5893 "because %qD is a variable, not the address of "
5894 "a variable", expr
, expr
);
5897 if (POINTER_TYPE_P (expr_type
))
5899 if (complain
& tf_error
)
5900 error ("%qE is not a valid template argument for %qT "
5901 "because it is not the address of a variable",
5905 /* Other values, like integer constants, might be valid
5906 non-type arguments of some other type. */
5907 return error_mark_node
;
5913 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5914 ? TREE_OPERAND (expr
, 0) : expr
);
5917 if (complain
& tf_error
)
5918 error ("%qE is not a valid template argument of type %qT "
5919 "because %qE is not a variable", expr
, type
, decl
);
5922 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5924 if (complain
& tf_error
)
5925 error ("%qE is not a valid template argument of type %qT "
5926 "because %qD does not have external linkage",
5930 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
5932 if (complain
& tf_error
)
5933 error ("%qE is not a valid template argument of type %qT "
5934 "because %qD has no linkage", expr
, type
, decl
);
5939 expr
= decay_conversion (expr
, complain
);
5940 if (expr
== error_mark_node
)
5941 return error_mark_node
;
5943 expr
= perform_qualification_conversions (type
, expr
);
5944 if (expr
== error_mark_node
)
5945 return error_mark_node
;
5947 /* [temp.arg.nontype]/5, bullet 3
5949 For a non-type template-parameter of type reference to object, no
5950 conversions apply. The type referred to by the reference may be more
5951 cv-qualified than the (otherwise identical) type of the
5952 template-argument. The template-parameter is bound directly to the
5953 template-argument, which must be an lvalue. */
5954 else if (TYPE_REF_OBJ_P (type
))
5956 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5958 return error_mark_node
;
5960 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5962 if (complain
& tf_error
)
5963 error ("%qE is not a valid template argument for type %qT "
5964 "because of conflicts in cv-qualification", expr
, type
);
5968 if (!real_lvalue_p (expr
))
5970 if (complain
& tf_error
)
5971 error ("%qE is not a valid template argument for type %qT "
5972 "because it is not an lvalue", expr
, type
);
5976 /* [temp.arg.nontype]/1
5978 A template-argument for a non-type, non-template template-parameter
5979 shall be one of: [...]
5981 -- the address of an object or function with external linkage. */
5982 if (INDIRECT_REF_P (expr
)
5983 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5985 expr
= TREE_OPERAND (expr
, 0);
5988 if (complain
& tf_error
)
5989 error ("%q#D is not a valid template argument for type %qT "
5990 "because a reference variable does not have a constant "
5991 "address", expr
, type
);
5998 if (complain
& tf_error
)
5999 error ("%qE is not a valid template argument for type %qT "
6000 "because it is not an object with external linkage",
6005 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
6007 if (complain
& tf_error
)
6008 error ("%qE is not a valid template argument for type %qT "
6009 "because object %qD has not external linkage",
6014 expr
= build_nop (type
, build_address (expr
));
6016 /* [temp.arg.nontype]/5, bullet 4
6018 For a non-type template-parameter of type pointer to function, only
6019 the function-to-pointer conversion (_conv.func_) is applied. If the
6020 template-argument represents a set of overloaded functions (or a
6021 pointer to such), the matching function is selected from the set
6023 else if (TYPE_PTRFN_P (type
))
6025 /* If the argument is a template-id, we might not have enough
6026 context information to decay the pointer. */
6027 if (!type_unknown_p (expr_type
))
6029 expr
= decay_conversion (expr
, complain
);
6030 if (expr
== error_mark_node
)
6031 return error_mark_node
;
6034 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6035 /* Null pointer values are OK in C++11. */
6036 return perform_qualification_conversions (type
, expr
);
6038 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6039 if (!expr
|| expr
== error_mark_node
)
6042 /* [temp.arg.nontype]/5, bullet 5
6044 For a non-type template-parameter of type reference to function, no
6045 conversions apply. If the template-argument represents a set of
6046 overloaded functions, the matching function is selected from the set
6048 else if (TYPE_REFFN_P (type
))
6050 if (TREE_CODE (expr
) == ADDR_EXPR
)
6052 if (complain
& tf_error
)
6054 error ("%qE is not a valid template argument for type %qT "
6055 "because it is a pointer", expr
, type
);
6056 inform (input_location
, "try using %qE instead",
6057 TREE_OPERAND (expr
, 0));
6062 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6063 if (!expr
|| expr
== error_mark_node
)
6066 expr
= build_nop (type
, build_address (expr
));
6068 /* [temp.arg.nontype]/5, bullet 6
6070 For a non-type template-parameter of type pointer to member function,
6071 no conversions apply. If the template-argument represents a set of
6072 overloaded member functions, the matching member function is selected
6073 from the set (_over.over_). */
6074 else if (TYPE_PTRMEMFUNC_P (type
))
6076 expr
= instantiate_type (type
, expr
, tf_none
);
6077 if (expr
== error_mark_node
)
6078 return error_mark_node
;
6080 /* [temp.arg.nontype] bullet 1 says the pointer to member
6081 expression must be a pointer-to-member constant. */
6082 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6083 return error_mark_node
;
6085 /* There is no way to disable standard conversions in
6086 resolve_address_of_overloaded_function (called by
6087 instantiate_type). It is possible that the call succeeded by
6088 converting &B::I to &D::I (where B is a base of D), so we need
6089 to reject this conversion here.
6091 Actually, even if there was a way to disable standard conversions,
6092 it would still be better to reject them here so that we can
6093 provide a superior diagnostic. */
6094 if (!same_type_p (TREE_TYPE (expr
), type
))
6096 if (complain
& tf_error
)
6098 error ("%qE is not a valid template argument for type %qT "
6099 "because it is of type %qT", expr
, type
,
6101 /* If we are just one standard conversion off, explain. */
6102 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6103 inform (input_location
,
6104 "standard conversions are not allowed in this context");
6109 /* [temp.arg.nontype]/5, bullet 7
6111 For a non-type template-parameter of type pointer to data member,
6112 qualification conversions (_conv.qual_) are applied. */
6113 else if (TYPE_PTRDATAMEM_P (type
))
6115 /* [temp.arg.nontype] bullet 1 says the pointer to member
6116 expression must be a pointer-to-member constant. */
6117 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6118 return error_mark_node
;
6120 expr
= perform_qualification_conversions (type
, expr
);
6121 if (expr
== error_mark_node
)
6124 else if (NULLPTR_TYPE_P (type
))
6126 if (expr
!= nullptr_node
)
6128 if (complain
& tf_error
)
6129 error ("%qE is not a valid template argument for type %qT "
6130 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6135 /* A template non-type parameter must be one of the above. */
6139 /* Sanity check: did we actually convert the argument to the
6141 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6142 (type
, TREE_TYPE (expr
)));
6146 /* Subroutine of coerce_template_template_parms, which returns 1 if
6147 PARM_PARM and ARG_PARM match using the rule for the template
6148 parameters of template template parameters. Both PARM and ARG are
6149 template parameters; the rest of the arguments are the same as for
6150 coerce_template_template_parms.
6153 coerce_template_template_parm (tree parm
,
6155 tsubst_flags_t complain
,
6159 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6160 || parm
== NULL_TREE
|| error_operand_p (parm
))
6163 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6166 switch (TREE_CODE (parm
))
6169 /* We encounter instantiations of templates like
6170 template <template <template <class> class> class TT>
6173 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6174 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6176 if (!coerce_template_template_parms
6177 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6183 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6184 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6185 /* Argument is a parameter pack but parameter is not. */
6190 /* The tsubst call is used to handle cases such as
6192 template <int> class C {};
6193 template <class T, template <T> class TT> class D {};
6196 i.e. the parameter list of TT depends on earlier parameters. */
6197 if (!uses_template_parms (TREE_TYPE (arg
))
6199 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6203 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6204 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6205 /* Argument is a parameter pack but parameter is not. */
6218 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6219 template template parameters. Both PARM_PARMS and ARG_PARMS are
6220 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6223 Consider the example:
6224 template <class T> class A;
6225 template<template <class U> class TT> class B;
6227 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6228 the parameters to A, and OUTER_ARGS contains A. */
6231 coerce_template_template_parms (tree parm_parms
,
6233 tsubst_flags_t complain
,
6237 int nparms
, nargs
, i
;
6241 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6242 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6244 nparms
= TREE_VEC_LENGTH (parm_parms
);
6245 nargs
= TREE_VEC_LENGTH (arg_parms
);
6247 /* Determine whether we have a parameter pack at the end of the
6248 template template parameter's template parameter list. */
6249 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6251 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6253 if (error_operand_p (parm
))
6256 switch (TREE_CODE (parm
))
6260 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6265 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6275 && !(variadic_p
&& nargs
>= nparms
- 1))
6278 /* Check all of the template parameters except the parameter pack at
6279 the end (if any). */
6280 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6282 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6283 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6286 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6287 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6289 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6297 /* Check each of the template parameters in the template
6298 argument against the template parameter pack at the end of
6299 the template template parameter. */
6300 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6303 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6305 for (; i
< nargs
; ++i
)
6307 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6310 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6312 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6321 /* Verifies that the deduced template arguments (in TARGS) for the
6322 template template parameters (in TPARMS) represent valid bindings,
6323 by comparing the template parameter list of each template argument
6324 to the template parameter list of its corresponding template
6325 template parameter, in accordance with DR150. This
6326 routine can only be called after all template arguments have been
6327 deduced. It will return TRUE if all of the template template
6328 parameter bindings are okay, FALSE otherwise. */
6330 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6332 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6335 /* We're dealing with template parms in this process. */
6336 ++processing_template_decl
;
6338 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6340 for (i
= 0; i
< ntparms
; ++i
)
6342 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6343 tree targ
= TREE_VEC_ELT (targs
, i
);
6345 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6347 tree packed_args
= NULL_TREE
;
6350 if (ARGUMENT_PACK_P (targ
))
6352 /* Look inside the argument pack. */
6353 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6354 len
= TREE_VEC_LENGTH (packed_args
);
6357 for (idx
= 0; idx
< len
; ++idx
)
6359 tree targ_parms
= NULL_TREE
;
6362 /* Extract the next argument from the argument
6364 targ
= TREE_VEC_ELT (packed_args
, idx
);
6366 if (PACK_EXPANSION_P (targ
))
6367 /* Look at the pattern of the pack expansion. */
6368 targ
= PACK_EXPANSION_PATTERN (targ
);
6370 /* Extract the template parameters from the template
6372 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6373 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6374 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6375 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6377 /* Verify that we can coerce the template template
6378 parameters from the template argument to the template
6379 parameter. This requires an exact match. */
6381 && !coerce_template_template_parms
6382 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6397 --processing_template_decl
;
6401 /* Since type attributes aren't mangled, we need to strip them from
6402 template type arguments. */
6405 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6408 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6410 mv
= TYPE_MAIN_VARIANT (arg
);
6411 arg
= strip_typedefs (arg
);
6412 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6413 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6415 if (complain
& tf_warning
)
6416 warning (0, "ignoring attributes on template argument %qT", arg
);
6417 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6418 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6423 /* Convert the indicated template ARG as necessary to match the
6424 indicated template PARM. Returns the converted ARG, or
6425 error_mark_node if the conversion was unsuccessful. Error and
6426 warning messages are issued under control of COMPLAIN. This
6427 conversion is for the Ith parameter in the parameter list. ARGS is
6428 the full set of template arguments deduced so far. */
6431 convert_template_argument (tree parm
,
6434 tsubst_flags_t complain
,
6440 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6442 if (TREE_CODE (arg
) == TREE_LIST
6443 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6445 /* The template argument was the name of some
6446 member function. That's usually
6447 invalid, but static members are OK. In any
6448 case, grab the underlying fields/functions
6449 and issue an error later if required. */
6450 orig_arg
= TREE_VALUE (arg
);
6451 TREE_TYPE (arg
) = unknown_type_node
;
6456 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6457 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6458 || requires_tmpl_type
);
6460 /* When determining whether an argument pack expansion is a template,
6461 look at the pattern. */
6462 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6463 arg
= PACK_EXPANSION_PATTERN (arg
);
6465 /* Deal with an injected-class-name used as a template template arg. */
6466 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6468 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6469 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6471 if (cxx_dialect
>= cxx11
)
6472 /* OK under DR 1004. */;
6473 else if (complain
& tf_warning_or_error
)
6474 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6475 " used as template template argument", TYPE_NAME (arg
));
6476 else if (flag_pedantic_errors
)
6484 ((TREE_CODE (arg
) == TEMPLATE_DECL
6485 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6486 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6487 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6488 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6491 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6492 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6493 arg
= TYPE_STUB_DECL (arg
);
6495 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6497 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6498 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6500 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6502 if (complain
& tf_error
)
6503 error ("invalid use of destructor %qE as a type", orig_arg
);
6504 return error_mark_node
;
6507 permerror (input_location
,
6508 "to refer to a type member of a template parameter, "
6509 "use %<typename %E%>", orig_arg
);
6511 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6512 TREE_OPERAND (arg
, 1),
6518 if (is_type
!= requires_type
)
6522 if (complain
& tf_error
)
6524 error ("type/value mismatch at argument %d in template "
6525 "parameter list for %qD",
6528 inform (input_location
,
6529 " expected a constant of type %qT, got %qT",
6531 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6532 else if (requires_tmpl_type
)
6533 inform (input_location
,
6534 " expected a class template, got %qE", orig_arg
);
6536 inform (input_location
,
6537 " expected a type, got %qE", orig_arg
);
6540 return error_mark_node
;
6542 if (is_tmpl_type
^ requires_tmpl_type
)
6544 if (in_decl
&& (complain
& tf_error
))
6546 error ("type/value mismatch at argument %d in template "
6547 "parameter list for %qD",
6550 inform (input_location
,
6551 " expected a type, got %qT", DECL_NAME (arg
));
6553 inform (input_location
,
6554 " expected a class template, got %qT", orig_arg
);
6556 return error_mark_node
;
6561 if (requires_tmpl_type
)
6563 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6565 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6566 /* The number of argument required is not known yet.
6567 Just accept it for now. */
6568 val
= TREE_TYPE (arg
);
6571 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6574 /* Strip alias templates that are equivalent to another
6576 arg
= get_underlying_template (arg
);
6577 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6579 if (coerce_template_template_parms (parmparm
, argparm
,
6585 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6587 if (val
!= error_mark_node
)
6589 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6590 val
= TREE_TYPE (val
);
6591 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6592 val
= make_pack_expansion (val
);
6597 if (in_decl
&& (complain
& tf_error
))
6599 error ("type/value mismatch at argument %d in "
6600 "template parameter list for %qD",
6602 inform (input_location
,
6603 " expected a template of type %qD, got %qT",
6607 val
= error_mark_node
;
6613 /* We only form one instance of each template specialization.
6614 Therefore, if we use a non-canonical variant (i.e., a
6615 typedef), any future messages referring to the type will use
6616 the typedef, which is confusing if those future uses do not
6617 themselves also use the typedef. */
6619 val
= canonicalize_type_argument (val
, complain
);
6623 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6625 if (invalid_nontype_parm_type_p (t
, complain
))
6626 return error_mark_node
;
6628 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6630 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6634 /* Not sure if this is reachable, but it doesn't hurt
6636 error ("type mismatch in nontype parameter pack");
6637 val
= error_mark_node
;
6640 else if (!dependent_template_arg_p (orig_arg
)
6641 && !uses_template_parms (t
))
6642 /* We used to call digest_init here. However, digest_init
6643 will report errors, which we don't want when complain
6644 is zero. More importantly, digest_init will try too
6645 hard to convert things: for example, `0' should not be
6646 converted to pointer type at this point according to
6647 the standard. Accepting this is not merely an
6648 extension, since deciding whether or not these
6649 conversions can occur is part of determining which
6650 function template to call, or whether a given explicit
6651 argument specification is valid. */
6652 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6654 val
= strip_typedefs_expr (orig_arg
);
6656 if (val
== NULL_TREE
)
6657 val
= error_mark_node
;
6658 else if (val
== error_mark_node
&& (complain
& tf_error
))
6659 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6661 if (TREE_CODE (val
) == SCOPE_REF
)
6663 /* Strip typedefs from the SCOPE_REF. */
6664 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6665 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6667 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6668 QUALIFIED_NAME_IS_TEMPLATE (val
));
6675 /* Coerces the remaining template arguments in INNER_ARGS (from
6676 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6677 Returns the coerced argument pack. PARM_IDX is the position of this
6678 parameter in the template parameter list. ARGS is the original
6679 template argument list. */
6681 coerce_template_parameter_pack (tree parms
,
6689 tsubst_flags_t complain
)
6691 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6692 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6695 tree packed_parms
= NULL_TREE
;
6697 if (arg_idx
> nargs
)
6700 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6702 /* When the template parameter is a non-type template parameter pack
6703 or template template parameter pack whose type or template
6704 parameters use parameter packs, we know exactly how many arguments
6705 we are looking for. Build a vector of the instantiated decls for
6706 these template parameters in PACKED_PARMS. */
6707 /* We can't use make_pack_expansion here because it would interpret a
6708 _DECL as a use rather than a declaration. */
6709 tree decl
= TREE_VALUE (parm
);
6710 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6711 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6712 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6713 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6715 TREE_VEC_LENGTH (args
)--;
6716 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6717 TREE_VEC_LENGTH (args
)++;
6719 if (packed_parms
== error_mark_node
)
6720 return error_mark_node
;
6722 /* If we're doing a partial instantiation of a member template,
6723 verify that all of the types used for the non-type
6724 template parameter pack are, in fact, valid for non-type
6725 template parameters. */
6727 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6729 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6730 for (j
= 0; j
< len
; ++j
)
6732 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6733 if (invalid_nontype_parm_type_p (t
, complain
))
6734 return error_mark_node
;
6738 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6741 packed_args
= make_tree_vec (nargs
- arg_idx
);
6743 /* Convert the remaining arguments, which will be a part of the
6744 parameter pack "parm". */
6745 for (; arg_idx
< nargs
; ++arg_idx
)
6747 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6748 tree actual_parm
= TREE_VALUE (parm
);
6749 int pack_idx
= arg_idx
- parm_idx
;
6753 /* Once we've packed as many args as we have types, stop. */
6754 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6756 else if (PACK_EXPANSION_P (arg
))
6757 /* We don't know how many args we have yet, just
6758 use the unconverted ones for now. */
6761 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6764 if (arg
== error_mark_node
)
6766 if (complain
& tf_error
)
6767 error ("template argument %d is invalid", arg_idx
+ 1);
6770 arg
= convert_template_argument (actual_parm
,
6771 arg
, new_args
, complain
, parm_idx
,
6773 if (arg
== error_mark_node
)
6775 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6778 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6779 && TREE_VEC_LENGTH (packed_args
) > 0)
6781 if (complain
& tf_error
)
6782 error ("wrong number of template arguments (%d, should be %d)",
6783 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6784 return error_mark_node
;
6787 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6788 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6789 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6792 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6793 TREE_TYPE (argument_pack
)
6794 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6795 TREE_CONSTANT (argument_pack
) = 1;
6798 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6799 #ifdef ENABLE_CHECKING
6800 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6801 TREE_VEC_LENGTH (packed_args
));
6803 return argument_pack
;
6806 /* Returns the number of pack expansions in the template argument vector
6810 pack_expansion_args_count (tree args
)
6815 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6817 tree elt
= TREE_VEC_ELT (args
, i
);
6818 if (elt
&& PACK_EXPANSION_P (elt
))
6824 /* Convert all template arguments to their appropriate types, and
6825 return a vector containing the innermost resulting template
6826 arguments. If any error occurs, return error_mark_node. Error and
6827 warning messages are issued under control of COMPLAIN.
6829 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6830 for arguments not specified in ARGS. Otherwise, if
6831 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6832 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6833 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6837 coerce_template_parms (tree parms
,
6840 tsubst_flags_t complain
,
6841 bool require_all_args
,
6842 bool use_default_args
)
6844 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6845 tree orig_inner_args
;
6848 tree new_inner_args
;
6849 int saved_unevaluated_operand
;
6850 int saved_inhibit_evaluation_warnings
;
6852 /* When used as a boolean value, indicates whether this is a
6853 variadic template parameter list. Since it's an int, we can also
6854 subtract it from nparms to get the number of non-variadic
6857 int variadic_args_p
= 0;
6858 int post_variadic_parms
= 0;
6860 if (args
== error_mark_node
)
6861 return error_mark_node
;
6863 nparms
= TREE_VEC_LENGTH (parms
);
6865 /* Determine if there are any parameter packs. */
6866 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6868 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
6870 ++post_variadic_parms
;
6871 if (template_parameter_pack_p (tparm
))
6875 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6876 /* If there are no parameters that follow a parameter pack, we need to
6877 expand any argument packs so that we can deduce a parameter pack from
6878 some non-packed args followed by an argument pack, as in variadic85.C.
6879 If there are such parameters, we need to leave argument packs intact
6880 so the arguments are assigned properly. This can happen when dealing
6881 with a nested class inside a partial specialization of a class
6882 template, as in variadic92.C, or when deducing a template parameter pack
6883 from a sub-declarator, as in variadic114.C. */
6884 if (!post_variadic_parms
)
6885 inner_args
= expand_template_argument_pack (inner_args
);
6887 /* Count any pack expansion args. */
6888 variadic_args_p
= pack_expansion_args_count (inner_args
);
6890 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6891 if ((nargs
> nparms
&& !variadic_p
)
6892 || (nargs
< nparms
- variadic_p
6895 && (!use_default_args
6896 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6897 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6899 if (complain
& tf_error
)
6903 nparms
-= variadic_p
;
6904 error ("wrong number of template arguments "
6905 "(%d, should be %d or more)", nargs
, nparms
);
6908 error ("wrong number of template arguments "
6909 "(%d, should be %d)", nargs
, nparms
);
6912 error ("provided for %q+D", in_decl
);
6915 return error_mark_node
;
6917 /* We can't pass a pack expansion to a non-pack parameter of an alias
6918 template (DR 1430). */
6919 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
6921 && nargs
- variadic_args_p
< nparms
- variadic_p
)
6923 if (complain
& tf_error
)
6925 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
6927 tree arg
= TREE_VEC_ELT (inner_args
, i
);
6928 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6930 if (PACK_EXPANSION_P (arg
)
6931 && !template_parameter_pack_p (parm
))
6933 error ("pack expansion argument for non-pack parameter "
6934 "%qD of alias template %qD", parm
, in_decl
);
6935 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
6942 return error_mark_node
;
6945 /* We need to evaluate the template arguments, even though this
6946 template-id may be nested within a "sizeof". */
6947 saved_unevaluated_operand
= cp_unevaluated_operand
;
6948 cp_unevaluated_operand
= 0;
6949 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6950 c_inhibit_evaluation_warnings
= 0;
6951 new_inner_args
= make_tree_vec (nparms
);
6952 new_args
= add_outermost_template_args (args
, new_inner_args
);
6953 int pack_adjust
= 0;
6954 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6959 /* Get the Ith template parameter. */
6960 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6962 if (parm
== error_mark_node
)
6964 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6968 /* Calculate the next argument. */
6969 if (arg_idx
< nargs
)
6970 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6974 if (template_parameter_pack_p (TREE_VALUE (parm
))
6975 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6977 /* Some arguments will be placed in the
6978 template parameter pack PARM. */
6979 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6980 inner_args
, arg_idx
,
6984 if (arg
== NULL_TREE
)
6986 /* We don't know how many args we have yet, just use the
6987 unconverted (and still packed) ones for now. */
6988 new_inner_args
= orig_inner_args
;
6993 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
6995 /* Store this argument. */
6996 if (arg
== error_mark_node
)
6999 /* We are done with all of the arguments. */
7004 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7005 arg_idx
+= pack_adjust
;
7012 if (PACK_EXPANSION_P (arg
))
7014 /* "If every valid specialization of a variadic template
7015 requires an empty template parameter pack, the template is
7016 ill-formed, no diagnostic required." So check that the
7017 pattern works with this parameter. */
7018 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7019 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7023 if (conv
== error_mark_node
)
7025 inform (input_location
, "so any instantiation with a "
7026 "non-empty parameter pack would be ill-formed");
7029 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7030 /* Recover from missing typename. */
7031 TREE_VEC_ELT (inner_args
, arg_idx
)
7032 = make_pack_expansion (conv
);
7034 /* We don't know how many args we have yet, just
7035 use the unconverted ones for now. */
7036 new_inner_args
= inner_args
;
7041 else if (require_all_args
)
7043 /* There must be a default arg in this case. */
7044 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7046 /* The position of the first default template argument,
7047 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7049 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7050 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7051 arg_idx
- pack_adjust
);
7056 if (arg
== error_mark_node
)
7058 if (complain
& tf_error
)
7059 error ("template argument %d is invalid", arg_idx
+ 1);
7062 /* This only occurs if there was an error in the template
7063 parameter list itself (which we would already have
7064 reported) that we are trying to recover from, e.g., a class
7065 template with a parameter list such as
7066 template<typename..., typename>. */
7069 arg
= convert_template_argument (TREE_VALUE (parm
),
7070 arg
, new_args
, complain
,
7073 if (arg
== error_mark_node
)
7075 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7077 cp_unevaluated_operand
= saved_unevaluated_operand
;
7078 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7080 if (variadic_p
&& arg_idx
< nargs
)
7082 if (complain
& tf_error
)
7084 error ("wrong number of template arguments "
7085 "(%d, should be %d)", nargs
, arg_idx
);
7087 error ("provided for %q+D", in_decl
);
7089 return error_mark_node
;
7093 return error_mark_node
;
7095 #ifdef ENABLE_CHECKING
7096 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7097 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7098 TREE_VEC_LENGTH (new_inner_args
));
7101 return new_inner_args
;
7104 /* Like coerce_template_parms. If PARMS represents all template
7105 parameters levels, this function returns a vector of vectors
7106 representing all the resulting argument levels. Note that in this
7107 case, only the innermost arguments are coerced because the
7108 outermost ones are supposed to have been coerced already.
7110 Otherwise, if PARMS represents only (the innermost) vector of
7111 parameters, this function returns a vector containing just the
7112 innermost resulting arguments. */
7115 coerce_innermost_template_parms (tree parms
,
7118 tsubst_flags_t complain
,
7119 bool require_all_args
,
7120 bool use_default_args
)
7122 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7123 int args_depth
= TMPL_ARGS_DEPTH (args
);
7126 if (parms_depth
> 1)
7128 coerced_args
= make_tree_vec (parms_depth
);
7132 for (level
= parms
, cur_depth
= parms_depth
;
7133 parms_depth
> 0 && level
!= NULL_TREE
;
7134 level
= TREE_CHAIN (level
), --cur_depth
)
7137 if (cur_depth
== args_depth
)
7138 l
= coerce_template_parms (TREE_VALUE (level
),
7139 args
, in_decl
, complain
,
7143 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7145 if (l
== error_mark_node
)
7146 return error_mark_node
;
7148 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7152 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7153 args
, in_decl
, complain
,
7156 return coerced_args
;
7159 /* Returns 1 if template args OT and NT are equivalent. */
7162 template_args_equal (tree ot
, tree nt
)
7166 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7169 if (TREE_CODE (nt
) == TREE_VEC
)
7170 /* For member templates */
7171 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7172 else if (PACK_EXPANSION_P (ot
))
7173 return (PACK_EXPANSION_P (nt
)
7174 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7175 PACK_EXPANSION_PATTERN (nt
))
7176 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7177 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7178 else if (ARGUMENT_PACK_P (ot
))
7183 if (!ARGUMENT_PACK_P (nt
))
7186 opack
= ARGUMENT_PACK_ARGS (ot
);
7187 npack
= ARGUMENT_PACK_ARGS (nt
);
7188 len
= TREE_VEC_LENGTH (opack
);
7189 if (TREE_VEC_LENGTH (npack
) != len
)
7191 for (i
= 0; i
< len
; ++i
)
7192 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7193 TREE_VEC_ELT (npack
, i
)))
7197 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7199 /* We get here probably because we are in the middle of substituting
7200 into the pattern of a pack expansion. In that case the
7201 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7202 interested in. So we want to use the initial pack argument for
7204 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7205 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7206 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7207 return template_args_equal (ot
, nt
);
7209 else if (TYPE_P (nt
))
7210 return TYPE_P (ot
) && same_type_p (ot
, nt
);
7211 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7214 return cp_tree_equal (ot
, nt
);
7217 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7218 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7219 NEWARG_PTR with the offending arguments if they are non-NULL. */
7222 comp_template_args_with_info (tree oldargs
, tree newargs
,
7223 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7227 if (oldargs
== newargs
)
7230 if (!oldargs
|| !newargs
)
7233 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7236 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7238 tree nt
= TREE_VEC_ELT (newargs
, i
);
7239 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7241 if (! template_args_equal (ot
, nt
))
7243 if (oldarg_ptr
!= NULL
)
7245 if (newarg_ptr
!= NULL
)
7253 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7254 of template arguments. Returns 0 otherwise. */
7257 comp_template_args (tree oldargs
, tree newargs
)
7259 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7263 add_pending_template (tree d
)
7265 tree ti
= (TYPE_P (d
)
7266 ? CLASSTYPE_TEMPLATE_INFO (d
)
7267 : DECL_TEMPLATE_INFO (d
));
7268 struct pending_template
*pt
;
7271 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7274 /* We are called both from instantiate_decl, where we've already had a
7275 tinst_level pushed, and instantiate_template, where we haven't.
7277 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7280 push_tinst_level (d
);
7282 pt
= ggc_alloc
<pending_template
> ();
7284 pt
->tinst
= current_tinst_level
;
7285 if (last_pending_template
)
7286 last_pending_template
->next
= pt
;
7288 pending_templates
= pt
;
7290 last_pending_template
= pt
;
7292 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7299 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7300 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7301 documentation for TEMPLATE_ID_EXPR. */
7304 lookup_template_function (tree fns
, tree arglist
)
7308 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7309 return error_mark_node
;
7311 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7313 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7315 error ("%q#D is not a function template", fns
);
7316 return error_mark_node
;
7319 if (BASELINK_P (fns
))
7321 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7323 BASELINK_FUNCTIONS (fns
),
7328 type
= TREE_TYPE (fns
);
7329 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7330 type
= unknown_type_node
;
7332 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7335 /* Within the scope of a template class S<T>, the name S gets bound
7336 (in build_self_reference) to a TYPE_DECL for the class, not a
7337 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7338 or one of its enclosing classes, and that type is a template,
7339 return the associated TEMPLATE_DECL. Otherwise, the original
7342 Also handle the case when DECL is a TREE_LIST of ambiguous
7343 injected-class-names from different bases. */
7346 maybe_get_template_decl_from_type_decl (tree decl
)
7348 if (decl
== NULL_TREE
)
7351 /* DR 176: A lookup that finds an injected-class-name (10.2
7352 [class.member.lookup]) can result in an ambiguity in certain cases
7353 (for example, if it is found in more than one base class). If all of
7354 the injected-class-names that are found refer to specializations of
7355 the same class template, and if the name is followed by a
7356 template-argument-list, the reference refers to the class template
7357 itself and not a specialization thereof, and is not ambiguous. */
7358 if (TREE_CODE (decl
) == TREE_LIST
)
7360 tree t
, tmpl
= NULL_TREE
;
7361 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7363 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7366 else if (tmpl
!= elt
)
7369 if (tmpl
&& t
== NULL_TREE
)
7375 return (decl
!= NULL_TREE
7376 && DECL_SELF_REFERENCE_P (decl
)
7377 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7378 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7381 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7382 parameters, find the desired type.
7384 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7386 IN_DECL, if non-NULL, is the template declaration we are trying to
7389 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7390 the class we are looking up.
7392 Issue error and warning messages under control of COMPLAIN.
7394 If the template class is really a local class in a template
7395 function, then the FUNCTION_CONTEXT is the function in which it is
7398 ??? Note that this function is currently called *twice* for each
7399 template-id: the first time from the parser, while creating the
7400 incomplete type (finish_template_type), and the second type during the
7401 real instantiation (instantiate_template_class). This is surely something
7402 that we want to avoid. It also causes some problems with argument
7403 coercion (see convert_nontype_argument for more information on this). */
7406 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7407 int entering_scope
, tsubst_flags_t complain
)
7409 tree templ
= NULL_TREE
, parmlist
;
7416 if (identifier_p (d1
))
7418 tree value
= innermost_non_namespace_value (d1
);
7419 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7424 push_decl_namespace (context
);
7425 templ
= lookup_name (d1
);
7426 templ
= maybe_get_template_decl_from_type_decl (templ
);
7428 pop_decl_namespace ();
7431 context
= DECL_CONTEXT (templ
);
7433 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7435 tree type
= TREE_TYPE (d1
);
7437 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7438 an implicit typename for the second A. Deal with it. */
7439 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7440 type
= TREE_TYPE (type
);
7442 if (CLASSTYPE_TEMPLATE_INFO (type
))
7444 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7445 d1
= DECL_NAME (templ
);
7448 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7449 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7451 templ
= TYPE_TI_TEMPLATE (d1
);
7452 d1
= DECL_NAME (templ
);
7454 else if (DECL_TYPE_TEMPLATE_P (d1
))
7457 d1
= DECL_NAME (templ
);
7458 context
= DECL_CONTEXT (templ
);
7460 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7463 d1
= DECL_NAME (templ
);
7466 /* Issue an error message if we didn't find a template. */
7469 if (complain
& tf_error
)
7470 error ("%qT is not a template", d1
);
7471 return error_mark_node
;
7474 if (TREE_CODE (templ
) != TEMPLATE_DECL
7475 /* Make sure it's a user visible template, if it was named by
7477 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7478 && !PRIMARY_TEMPLATE_P (templ
)))
7480 if (complain
& tf_error
)
7482 error ("non-template type %qT used as a template", d1
);
7484 error ("for template declaration %q+D", in_decl
);
7486 return error_mark_node
;
7489 complain
&= ~tf_user
;
7491 /* An alias that just changes the name of a template is equivalent to the
7492 other template, so if any of the arguments are pack expansions, strip
7493 the alias to avoid problems with a pack expansion passed to a non-pack
7494 alias template parameter (DR 1430). */
7495 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7496 templ
= get_underlying_template (templ
);
7498 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7500 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7501 template arguments */
7507 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7509 /* Consider an example where a template template parameter declared as
7511 template <class T, class U = std::allocator<T> > class TT
7513 The template parameter level of T and U are one level larger than
7514 of TT. To proper process the default argument of U, say when an
7515 instantiation `TT<int>' is seen, we need to build the full
7516 arguments containing {int} as the innermost level. Outer levels,
7517 available when not appearing as default template argument, can be
7518 obtained from the arguments of the enclosing template.
7520 Suppose that TT is later substituted with std::vector. The above
7521 instantiation is `TT<int, std::allocator<T> >' with TT at
7522 level 1, and T at level 2, while the template arguments at level 1
7523 becomes {std::vector} and the inner level 2 is {int}. */
7525 outer
= DECL_CONTEXT (templ
);
7527 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7528 else if (current_template_parms
)
7529 /* This is an argument of the current template, so we haven't set
7530 DECL_CONTEXT yet. */
7531 outer
= current_template_args ();
7534 arglist
= add_to_template_args (outer
, arglist
);
7536 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7538 /*require_all_args=*/true,
7539 /*use_default_args=*/true);
7540 if (arglist2
== error_mark_node
7541 || (!uses_template_parms (arglist2
)
7542 && check_instantiated_args (templ
, arglist2
, complain
)))
7543 return error_mark_node
;
7545 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7550 tree template_type
= TREE_TYPE (templ
);
7553 tree found
= NULL_TREE
;
7556 int is_dependent_type
;
7557 int use_partial_inst_tmpl
= false;
7559 if (template_type
== error_mark_node
)
7560 /* An error occurred while building the template TEMPL, and a
7561 diagnostic has most certainly been emitted for that
7562 already. Let's propagate that error. */
7563 return error_mark_node
;
7565 gen_tmpl
= most_general_template (templ
);
7566 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7567 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7568 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7570 if (arg_depth
== 1 && parm_depth
> 1)
7572 /* We've been given an incomplete set of template arguments.
7575 template <class T> struct S1 {
7576 template <class U> struct S2 {};
7577 template <class U> struct S2<U*> {};
7580 we will be called with an ARGLIST of `U*', but the
7581 TEMPLATE will be `template <class T> template
7582 <class U> struct S1<T>::S2'. We must fill in the missing
7585 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7587 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7590 /* Now we should have enough arguments. */
7591 gcc_assert (parm_depth
== arg_depth
);
7593 /* From here on, we're only interested in the most general
7596 /* Calculate the BOUND_ARGS. These will be the args that are
7597 actually tsubst'd into the definition to create the
7601 /* We have multiple levels of arguments to coerce, at once. */
7603 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7605 tree bound_args
= make_tree_vec (parm_depth
);
7607 for (i
= saved_depth
,
7608 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7609 i
> 0 && t
!= NULL_TREE
;
7610 --i
, t
= TREE_CHAIN (t
))
7613 if (i
== saved_depth
)
7614 a
= coerce_template_parms (TREE_VALUE (t
),
7617 /*require_all_args=*/true,
7618 /*use_default_args=*/true);
7620 /* Outer levels should have already been coerced. */
7621 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7623 /* Don't process further if one of the levels fails. */
7624 if (a
== error_mark_node
)
7626 /* Restore the ARGLIST to its full size. */
7627 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7628 return error_mark_node
;
7631 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7633 /* We temporarily reduce the length of the ARGLIST so
7634 that coerce_template_parms will see only the arguments
7635 corresponding to the template parameters it is
7637 TREE_VEC_LENGTH (arglist
)--;
7640 /* Restore the ARGLIST to its full size. */
7641 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7643 arglist
= bound_args
;
7647 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7648 INNERMOST_TEMPLATE_ARGS (arglist
),
7651 /*require_all_args=*/true,
7652 /*use_default_args=*/true);
7654 if (arglist
== error_mark_node
)
7655 /* We were unable to bind the arguments. */
7656 return error_mark_node
;
7658 /* In the scope of a template class, explicit references to the
7659 template class refer to the type of the template, not any
7660 instantiation of it. For example, in:
7662 template <class T> class C { void f(C<T>); }
7664 the `C<T>' is just the same as `C'. Outside of the
7665 class, however, such a reference is an instantiation. */
7667 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7668 || currently_open_class (template_type
))
7669 /* comp_template_args is expensive, check it last. */
7670 && comp_template_args (TYPE_TI_ARGS (template_type
),
7672 return template_type
;
7674 /* If we already have this specialization, return it. */
7675 elt
.tmpl
= gen_tmpl
;
7677 hash
= hash_specialization (&elt
);
7678 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7684 is_dependent_type
= uses_template_parms (arglist
);
7686 /* If the deduced arguments are invalid, then the binding
7688 if (!is_dependent_type
7689 && check_instantiated_args (gen_tmpl
,
7690 INNERMOST_TEMPLATE_ARGS (arglist
),
7692 return error_mark_node
;
7694 if (!is_dependent_type
7695 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7696 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7697 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7699 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7700 DECL_NAME (gen_tmpl
),
7701 /*tag_scope=*/ts_global
);
7705 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7707 if (context
== error_mark_node
)
7708 return error_mark_node
;
7711 context
= global_namespace
;
7713 /* Create the type. */
7714 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7716 /* The user referred to a specialization of an alias
7717 template represented by GEN_TMPL.
7719 [temp.alias]/2 says:
7721 When a template-id refers to the specialization of an
7722 alias template, it is equivalent to the associated
7723 type obtained by substitution of its
7724 template-arguments for the template-parameters in the
7725 type-id of the alias template. */
7727 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7728 /* Note that the call above (by indirectly calling
7729 register_specialization in tsubst_decl) registers the
7730 TYPE_DECL representing the specialization of the alias
7731 template. So next time someone substitutes ARGLIST for
7732 the template parms into the alias template (GEN_TMPL),
7733 she'll get that TYPE_DECL back. */
7735 if (t
== error_mark_node
)
7738 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7740 if (!is_dependent_type
)
7742 set_current_access_from_decl (TYPE_NAME (template_type
));
7743 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7744 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7745 arglist
, complain
, in_decl
),
7746 SCOPED_ENUM_P (template_type
), NULL
);
7748 if (t
== error_mark_node
)
7753 /* We don't want to call start_enum for this type, since
7754 the values for the enumeration constants may involve
7755 template parameters. And, no one should be interested
7756 in the enumeration constants for such a type. */
7757 t
= cxx_make_type (ENUMERAL_TYPE
);
7758 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7760 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7761 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7762 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7764 else if (CLASS_TYPE_P (template_type
))
7766 t
= make_class_type (TREE_CODE (template_type
));
7767 CLASSTYPE_DECLARED_CLASS (t
)
7768 = CLASSTYPE_DECLARED_CLASS (template_type
);
7769 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7770 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7772 /* A local class. Make sure the decl gets registered properly. */
7773 if (context
== current_function_decl
)
7774 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7776 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7777 /* This instantiation is another name for the primary
7778 template type. Set the TYPE_CANONICAL field
7780 TYPE_CANONICAL (t
) = template_type
;
7781 else if (any_template_arguments_need_structural_equality_p (arglist
))
7782 /* Some of the template arguments require structural
7783 equality testing, so this template class requires
7784 structural equality testing. */
7785 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7790 /* If we called start_enum or pushtag above, this information
7791 will already be set up. */
7794 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7796 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7797 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7798 DECL_SOURCE_LOCATION (type_decl
)
7799 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7802 type_decl
= TYPE_NAME (t
);
7804 if (CLASS_TYPE_P (template_type
))
7806 TREE_PRIVATE (type_decl
)
7807 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7808 TREE_PROTECTED (type_decl
)
7809 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7810 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7812 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7813 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7817 /* Let's consider the explicit specialization of a member
7818 of a class template specialization that is implicitly instantiated,
7823 template<class U> struct M {}; //#0
7828 struct S<int>::M<char> //#1
7832 [temp.expl.spec]/4 says this is valid.
7834 In this case, when we write:
7837 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7840 When we encounter #1, we want to store the partial instantiation
7841 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7843 For all cases other than this "explicit specialization of member of a
7844 class template", we just want to store the most general template into
7845 the CLASSTYPE_TI_TEMPLATE of M.
7847 This case of "explicit specialization of member of a class template"
7849 1/ the enclosing class is an instantiation of, and therefore not
7850 the same as, the context of the most general template, and
7851 2/ we aren't looking at the partial instantiation itself, i.e.
7852 the innermost arguments are not the same as the innermost parms of
7853 the most general template.
7855 So it's only when 1/ and 2/ happens that we want to use the partial
7856 instantiation of the member template in lieu of its most general
7859 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7860 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7861 /* the enclosing class must be an instantiation... */
7862 && CLASS_TYPE_P (context
)
7863 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7865 tree partial_inst_args
;
7866 TREE_VEC_LENGTH (arglist
)--;
7867 ++processing_template_decl
;
7869 tsubst (INNERMOST_TEMPLATE_ARGS
7870 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7871 arglist
, complain
, NULL_TREE
);
7872 --processing_template_decl
;
7873 TREE_VEC_LENGTH (arglist
)++;
7874 use_partial_inst_tmpl
=
7875 /*...and we must not be looking at the partial instantiation
7877 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7881 if (!use_partial_inst_tmpl
)
7882 /* This case is easy; there are no member templates involved. */
7886 /* This is a full instantiation of a member template. Find
7887 the partial instantiation of which this is an instance. */
7889 /* Temporarily reduce by one the number of levels in the ARGLIST
7890 so as to avoid comparing the last set of arguments. */
7891 TREE_VEC_LENGTH (arglist
)--;
7892 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7893 TREE_VEC_LENGTH (arglist
)++;
7894 /* FOUND is either a proper class type, or an alias
7895 template specialization. In the later case, it's a
7896 TYPE_DECL, resulting from the substituting of arguments
7897 for parameters in the TYPE_DECL of the alias template
7898 done earlier. So be careful while getting the template
7900 found
= TREE_CODE (found
) == TYPE_DECL
7901 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7902 : CLASSTYPE_TI_TEMPLATE (found
);
7905 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7908 slot
= htab_find_slot_with_hash (type_specializations
,
7909 &elt
, hash
, INSERT
);
7910 entry
= ggc_alloc
<spec_entry
> ();
7914 /* Note this use of the partial instantiation so we can check it
7915 later in maybe_process_partial_specialization. */
7916 DECL_TEMPLATE_INSTANTIATIONS (found
)
7917 = tree_cons (arglist
, t
,
7918 DECL_TEMPLATE_INSTANTIATIONS (found
));
7920 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
7921 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7922 /* Now that the type has been registered on the instantiations
7923 list, we set up the enumerators. Because the enumeration
7924 constants may involve the enumeration type itself, we make
7925 sure to register the type first, and then create the
7926 constants. That way, doing tsubst_expr for the enumeration
7927 constants won't result in recursive calls here; we'll find
7928 the instantiation and exit above. */
7929 tsubst_enum (template_type
, t
, arglist
);
7931 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7932 /* If the type makes use of template parameters, the
7933 code that generates debugging information will crash. */
7934 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
7936 /* Possibly limit visibility based on template args. */
7937 TREE_PUBLIC (type_decl
) = 1;
7938 determine_visibility (type_decl
);
7944 /* Wrapper for lookup_template_class_1. */
7947 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7948 int entering_scope
, tsubst_flags_t complain
)
7951 timevar_push (TV_TEMPLATE_INST
);
7952 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7953 entering_scope
, complain
);
7954 timevar_pop (TV_TEMPLATE_INST
);
7958 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
7961 lookup_template_variable (tree templ
, tree arglist
)
7963 return build2 (TEMPLATE_ID_EXPR
, TREE_TYPE (templ
), templ
, arglist
);
7970 /* True when we should also visit template parameters that occur in
7971 non-deduced contexts. */
7972 bool include_nondeduced_p
;
7973 hash_set
<tree
> *visited
;
7976 /* Called from for_each_template_parm via walk_tree. */
7979 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
7982 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
7983 tree_fn_t fn
= pfd
->fn
;
7984 void *data
= pfd
->data
;
7987 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
7988 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
7989 pfd
->include_nondeduced_p
))
7990 return error_mark_node
;
7992 switch (TREE_CODE (t
))
7995 if (TYPE_PTRMEMFUNC_P (t
))
8001 if (!TYPE_TEMPLATE_INFO (t
))
8003 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8004 fn
, data
, pfd
->visited
,
8005 pfd
->include_nondeduced_p
))
8006 return error_mark_node
;
8010 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8011 fn
, data
, pfd
->visited
,
8012 pfd
->include_nondeduced_p
)
8013 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8014 fn
, data
, pfd
->visited
,
8015 pfd
->include_nondeduced_p
))
8016 return error_mark_node
;
8020 /* Since we're not going to walk subtrees, we have to do this
8022 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8023 pfd
->visited
, pfd
->include_nondeduced_p
))
8024 return error_mark_node
;
8028 /* Check the return type. */
8029 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8030 pfd
->include_nondeduced_p
))
8031 return error_mark_node
;
8033 /* Check the parameter types. Since default arguments are not
8034 instantiated until they are needed, the TYPE_ARG_TYPES may
8035 contain expressions that involve template parameters. But,
8036 no-one should be looking at them yet. And, once they're
8037 instantiated, they don't contain template parameters, so
8038 there's no point in looking at them then, either. */
8042 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8043 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8044 pfd
->visited
, pfd
->include_nondeduced_p
))
8045 return error_mark_node
;
8047 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8048 want walk_tree walking into them itself. */
8054 case UNDERLYING_TYPE
:
8055 if (pfd
->include_nondeduced_p
8056 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
8058 pfd
->include_nondeduced_p
))
8059 return error_mark_node
;
8064 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8065 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8066 pfd
->visited
, pfd
->include_nondeduced_p
))
8067 return error_mark_node
;
8072 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8073 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8074 pfd
->visited
, pfd
->include_nondeduced_p
))
8075 return error_mark_node
;
8076 if (DECL_CONTEXT (t
)
8077 && pfd
->include_nondeduced_p
8078 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8079 pfd
->visited
, pfd
->include_nondeduced_p
))
8080 return error_mark_node
;
8083 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8084 /* Record template parameters such as `T' inside `TT<T>'. */
8085 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8086 pfd
->include_nondeduced_p
))
8087 return error_mark_node
;
8090 case TEMPLATE_TEMPLATE_PARM
:
8091 case TEMPLATE_TYPE_PARM
:
8092 case TEMPLATE_PARM_INDEX
:
8093 if (fn
&& (*fn
)(t
, data
))
8094 return error_mark_node
;
8096 return error_mark_node
;
8100 /* A template template parameter is encountered. */
8101 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8102 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8103 pfd
->include_nondeduced_p
))
8104 return error_mark_node
;
8106 /* Already substituted template template parameter */
8112 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8114 pfd
->include_nondeduced_p
))
8115 return error_mark_node
;
8119 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8120 && pfd
->include_nondeduced_p
8121 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8122 (TREE_TYPE (t
)), fn
, data
,
8123 pfd
->visited
, pfd
->include_nondeduced_p
))
8124 return error_mark_node
;
8129 /* If there's no type, then this thing must be some expression
8130 involving template parameters. */
8131 if (!fn
&& !TREE_TYPE (t
))
8132 return error_mark_node
;
8137 case IMPLICIT_CONV_EXPR
:
8138 case REINTERPRET_CAST_EXPR
:
8139 case CONST_CAST_EXPR
:
8140 case STATIC_CAST_EXPR
:
8141 case DYNAMIC_CAST_EXPR
:
8145 case PSEUDO_DTOR_EXPR
:
8147 return error_mark_node
;
8154 /* We didn't find any template parameters we liked. */
8158 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8159 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8160 call FN with the parameter and the DATA.
8161 If FN returns nonzero, the iteration is terminated, and
8162 for_each_template_parm returns 1. Otherwise, the iteration
8163 continues. If FN never returns a nonzero value, the value
8164 returned by for_each_template_parm is 0. If FN is NULL, it is
8165 considered to be the function which always returns 1.
8167 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8168 parameters that occur in non-deduced contexts. When false, only
8169 visits those template parameters that can be deduced. */
8172 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8173 hash_set
<tree
> *visited
,
8174 bool include_nondeduced_p
)
8176 struct pair_fn_data pfd
;
8182 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8184 /* Walk the tree. (Conceptually, we would like to walk without
8185 duplicates, but for_each_template_parm_r recursively calls
8186 for_each_template_parm, so we would need to reorganize a fair
8187 bit to use walk_tree_without_duplicates, so we keep our own
8190 pfd
.visited
= visited
;
8192 pfd
.visited
= new hash_set
<tree
>;
8193 result
= cp_walk_tree (&t
,
8194 for_each_template_parm_r
,
8196 pfd
.visited
) != NULL_TREE
;
8208 /* Returns true if T depends on any template parameter. */
8211 uses_template_parms (tree t
)
8214 int saved_processing_template_decl
;
8216 saved_processing_template_decl
= processing_template_decl
;
8217 if (!saved_processing_template_decl
)
8218 processing_template_decl
= 1;
8220 dependent_p
= dependent_type_p (t
);
8221 else if (TREE_CODE (t
) == TREE_VEC
)
8222 dependent_p
= any_dependent_template_arguments_p (t
);
8223 else if (TREE_CODE (t
) == TREE_LIST
)
8224 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8225 || uses_template_parms (TREE_CHAIN (t
)));
8226 else if (TREE_CODE (t
) == TYPE_DECL
)
8227 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8230 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8231 || TREE_CODE (t
) == OVERLOAD
8234 || TREE_CODE (t
) == TRAIT_EXPR
8235 || TREE_CODE (t
) == CONSTRUCTOR
8236 || CONSTANT_CLASS_P (t
))
8237 dependent_p
= (type_dependent_expression_p (t
)
8238 || value_dependent_expression_p (t
));
8241 gcc_assert (t
== error_mark_node
);
8242 dependent_p
= false;
8245 processing_template_decl
= saved_processing_template_decl
;
8250 /* Returns true iff current_function_decl is an incompletely instantiated
8251 template. Useful instead of processing_template_decl because the latter
8252 is set to 0 during fold_non_dependent_expr. */
8255 in_template_function (void)
8257 tree fn
= current_function_decl
;
8259 ++processing_template_decl
;
8260 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8261 && DECL_TEMPLATE_INFO (fn
)
8262 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8263 --processing_template_decl
;
8267 /* Returns true if T depends on any template parameter with level LEVEL. */
8270 uses_template_parms_level (tree t
, int level
)
8272 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8273 /*include_nondeduced_p=*/true);
8276 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8277 ill-formed translation unit, i.e. a variable or function that isn't
8278 usable in a constant expression. */
8281 neglectable_inst_p (tree d
)
8284 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8285 : decl_maybe_constant_var_p (d
)));
8288 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8289 neglectable and instantiated from within an erroneous instantiation. */
8292 limit_bad_template_recursion (tree decl
)
8294 struct tinst_level
*lev
= current_tinst_level
;
8295 int errs
= errorcount
+ sorrycount
;
8296 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8299 for (; lev
; lev
= lev
->next
)
8300 if (neglectable_inst_p (lev
->decl
))
8303 return (lev
&& errs
> lev
->errors
);
8306 static int tinst_depth
;
8307 extern int max_tinst_depth
;
8310 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8312 /* We're starting to instantiate D; record the template instantiation context
8313 for diagnostics and to restore it later. */
8316 push_tinst_level (tree d
)
8318 struct tinst_level
*new_level
;
8320 if (tinst_depth
>= max_tinst_depth
)
8322 last_error_tinst_level
= current_tinst_level
;
8323 if (TREE_CODE (d
) == TREE_LIST
)
8324 error ("template instantiation depth exceeds maximum of %d (use "
8325 "-ftemplate-depth= to increase the maximum) substituting %qS",
8326 max_tinst_depth
, d
);
8328 error ("template instantiation depth exceeds maximum of %d (use "
8329 "-ftemplate-depth= to increase the maximum) instantiating %qD",
8330 max_tinst_depth
, d
);
8332 print_instantiation_context ();
8337 /* If the current instantiation caused problems, don't let it instantiate
8338 anything else. Do allow deduction substitution and decls usable in
8339 constant expressions. */
8340 if (limit_bad_template_recursion (d
))
8343 new_level
= ggc_alloc
<tinst_level
> ();
8344 new_level
->decl
= d
;
8345 new_level
->locus
= input_location
;
8346 new_level
->errors
= errorcount
+sorrycount
;
8347 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8348 new_level
->next
= current_tinst_level
;
8349 current_tinst_level
= new_level
;
8352 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8353 depth_reached
= tinst_depth
;
8358 /* We're done instantiating this template; return to the instantiation
8362 pop_tinst_level (void)
8364 /* Restore the filename and line number stashed away when we started
8365 this instantiation. */
8366 input_location
= current_tinst_level
->locus
;
8367 current_tinst_level
= current_tinst_level
->next
;
8371 /* We're instantiating a deferred template; restore the template
8372 instantiation context in which the instantiation was requested, which
8373 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8376 reopen_tinst_level (struct tinst_level
*level
)
8378 struct tinst_level
*t
;
8381 for (t
= level
; t
; t
= t
->next
)
8384 current_tinst_level
= level
;
8386 if (current_tinst_level
)
8387 current_tinst_level
->errors
= errorcount
+sorrycount
;
8391 /* Returns the TINST_LEVEL which gives the original instantiation
8394 struct tinst_level
*
8395 outermost_tinst_level (void)
8397 struct tinst_level
*level
= current_tinst_level
;
8400 level
= level
->next
;
8404 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8405 vector of template arguments, as for tsubst.
8407 Returns an appropriate tsubst'd friend declaration. */
8410 tsubst_friend_function (tree decl
, tree args
)
8414 if (TREE_CODE (decl
) == FUNCTION_DECL
8415 && DECL_TEMPLATE_INSTANTIATION (decl
)
8416 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8417 /* This was a friend declared with an explicit template
8418 argument list, e.g.:
8422 to indicate that f was a template instantiation, not a new
8423 function declaration. Now, we have to figure out what
8424 instantiation of what template. */
8426 tree template_id
, arglist
, fns
;
8429 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8431 /* Friend functions are looked up in the containing namespace scope.
8432 We must enter that scope, to avoid finding member functions of the
8433 current class with same name. */
8434 push_nested_namespace (ns
);
8435 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8436 tf_warning_or_error
, NULL_TREE
,
8437 /*integral_constant_expression_p=*/false);
8438 pop_nested_namespace (ns
);
8439 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8440 tf_warning_or_error
, NULL_TREE
);
8441 template_id
= lookup_template_function (fns
, arglist
);
8443 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8444 tmpl
= determine_specialization (template_id
, new_friend
,
8446 /*need_member_template=*/0,
8447 TREE_VEC_LENGTH (args
),
8449 return instantiate_template (tmpl
, new_args
, tf_error
);
8452 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8454 /* The NEW_FRIEND will look like an instantiation, to the
8455 compiler, but is not an instantiation from the point of view of
8456 the language. For example, we might have had:
8458 template <class T> struct S {
8459 template <class U> friend void f(T, U);
8462 Then, in S<int>, template <class U> void f(int, U) is not an
8463 instantiation of anything. */
8464 if (new_friend
== error_mark_node
)
8465 return error_mark_node
;
8467 DECL_USE_TEMPLATE (new_friend
) = 0;
8468 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8470 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8471 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8472 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8475 /* The mangled name for the NEW_FRIEND is incorrect. The function
8476 is not a template instantiation and should not be mangled like
8477 one. Therefore, we forget the mangling here; we'll recompute it
8478 later if we need it. */
8479 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8481 SET_DECL_RTL (new_friend
, NULL
);
8482 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8485 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8488 tree new_friend_template_info
;
8489 tree new_friend_result_template_info
;
8491 int new_friend_is_defn
;
8493 /* We must save some information from NEW_FRIEND before calling
8494 duplicate decls since that function will free NEW_FRIEND if
8496 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8497 new_friend_is_defn
=
8498 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8499 (template_for_substitution (new_friend
)))
8501 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8503 /* This declaration is a `primary' template. */
8504 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8506 new_friend_result_template_info
8507 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8510 new_friend_result_template_info
= NULL_TREE
;
8512 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8513 if (new_friend_is_defn
)
8514 DECL_INITIAL (new_friend
) = error_mark_node
;
8516 /* Inside pushdecl_namespace_level, we will push into the
8517 current namespace. However, the friend function should go
8518 into the namespace of the template. */
8519 ns
= decl_namespace_context (new_friend
);
8520 push_nested_namespace (ns
);
8521 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8522 pop_nested_namespace (ns
);
8524 if (old_decl
== error_mark_node
)
8525 return error_mark_node
;
8527 if (old_decl
!= new_friend
)
8529 /* This new friend declaration matched an existing
8530 declaration. For example, given:
8532 template <class T> void f(T);
8533 template <class U> class C {
8534 template <class T> friend void f(T) {}
8537 the friend declaration actually provides the definition
8538 of `f', once C has been instantiated for some type. So,
8539 old_decl will be the out-of-class template declaration,
8540 while new_friend is the in-class definition.
8542 But, if `f' was called before this point, the
8543 instantiation of `f' will have DECL_TI_ARGS corresponding
8544 to `T' but not to `U', references to which might appear
8545 in the definition of `f'. Previously, the most general
8546 template for an instantiation of `f' was the out-of-class
8547 version; now it is the in-class version. Therefore, we
8548 run through all specialization of `f', adding to their
8549 DECL_TI_ARGS appropriately. In particular, they need a
8550 new set of outer arguments, corresponding to the
8551 arguments for this class instantiation.
8553 The same situation can arise with something like this:
8556 template <class T> class C {
8560 when `C<int>' is instantiated. Now, `f(int)' is defined
8563 if (!new_friend_is_defn
)
8564 /* On the other hand, if the in-class declaration does
8565 *not* provide a definition, then we don't want to alter
8566 existing definitions. We can just leave everything
8571 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8572 tree new_args
= TI_ARGS (new_friend_template_info
);
8574 /* Overwrite whatever template info was there before, if
8575 any, with the new template information pertaining to
8577 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8579 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8581 /* We should have called reregister_specialization in
8583 gcc_assert (retrieve_specialization (new_template
,
8587 /* Instantiate it if the global has already been used. */
8588 if (DECL_ODR_USED (old_decl
))
8589 instantiate_decl (old_decl
, /*defer_ok=*/true,
8590 /*expl_inst_class_mem_p=*/false);
8596 /* Indicate that the old function template is a partial
8598 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8599 = new_friend_result_template_info
;
8601 gcc_assert (new_template
8602 == most_general_template (new_template
));
8603 gcc_assert (new_template
!= old_decl
);
8605 /* Reassign any specializations already in the hash table
8606 to the new more general template, and add the
8607 additional template args. */
8608 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8612 tree spec
= TREE_VALUE (t
);
8615 elt
.tmpl
= old_decl
;
8616 elt
.args
= DECL_TI_ARGS (spec
);
8617 elt
.spec
= NULL_TREE
;
8619 htab_remove_elt (decl_specializations
, &elt
);
8622 = add_outermost_template_args (new_args
,
8623 DECL_TI_ARGS (spec
));
8625 register_specialization
8626 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8629 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8633 /* The information from NEW_FRIEND has been merged into OLD_DECL
8634 by duplicate_decls. */
8635 new_friend
= old_decl
;
8640 tree context
= DECL_CONTEXT (new_friend
);
8644 template <class T> class C {
8645 template <class U> friend void C1<U>::f (); // case 1
8646 friend void C2<T>::f (); // case 2
8648 we only need to make sure CONTEXT is a complete type for
8649 case 2. To distinguish between the two cases, we note that
8650 CONTEXT of case 1 remains dependent type after tsubst while
8651 this isn't true for case 2. */
8652 ++processing_template_decl
;
8653 dependent_p
= dependent_type_p (context
);
8654 --processing_template_decl
;
8657 && !complete_type_or_else (context
, NULL_TREE
))
8658 return error_mark_node
;
8660 if (COMPLETE_TYPE_P (context
))
8662 tree fn
= new_friend
;
8663 /* do_friend adds the TEMPLATE_DECL for any member friend
8664 template even if it isn't a member template, i.e.
8665 template <class T> friend A<T>::f();
8666 Look through it in that case. */
8667 if (TREE_CODE (fn
) == TEMPLATE_DECL
8668 && !PRIMARY_TEMPLATE_P (fn
))
8669 fn
= DECL_TEMPLATE_RESULT (fn
);
8670 /* Check to see that the declaration is really present, and,
8671 possibly obtain an improved declaration. */
8672 fn
= check_classfn (context
, fn
, NULL_TREE
);
8682 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8683 template arguments, as for tsubst.
8685 Returns an appropriate tsubst'd friend type or error_mark_node on
8689 tsubst_friend_class (tree friend_tmpl
, tree args
)
8695 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8697 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8698 return TREE_TYPE (t
);
8701 context
= CP_DECL_CONTEXT (friend_tmpl
);
8703 if (context
!= global_namespace
)
8705 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8706 push_nested_namespace (context
);
8708 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8711 /* Look for a class template declaration. We look for hidden names
8712 because two friend declarations of the same template are the
8713 same. For example, in:
8716 template <typename> friend class F;
8718 template <typename> struct B {
8719 template <typename> friend class F;
8722 both F templates are the same. */
8723 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8724 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8726 /* But, if we don't find one, it might be because we're in a
8727 situation like this:
8735 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8736 for `S<int>', not the TEMPLATE_DECL. */
8737 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8739 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8740 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8743 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8745 /* The friend template has already been declared. Just
8746 check to see that the declarations match, and install any new
8747 default parameters. We must tsubst the default parameters,
8748 of course. We only need the innermost template parameters
8749 because that is all that redeclare_class_template will look
8751 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8752 > TMPL_ARGS_DEPTH (args
))
8755 location_t saved_input_location
;
8756 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8757 args
, tf_warning_or_error
);
8759 saved_input_location
= input_location
;
8760 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8761 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8762 input_location
= saved_input_location
;
8766 friend_type
= TREE_TYPE (tmpl
);
8770 /* The friend template has not already been declared. In this
8771 case, the instantiation of the template class will cause the
8772 injection of this template into the global scope. */
8773 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8774 if (tmpl
== error_mark_node
)
8775 return error_mark_node
;
8777 /* The new TMPL is not an instantiation of anything, so we
8778 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8779 the new type because that is supposed to be the corresponding
8780 template decl, i.e., TMPL. */
8781 DECL_USE_TEMPLATE (tmpl
) = 0;
8782 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8783 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8784 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8785 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8787 /* Inject this template into the global scope. */
8788 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8791 if (context
!= global_namespace
)
8793 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8794 pop_nested_namespace (context
);
8796 pop_nested_class ();
8802 /* Returns zero if TYPE cannot be completed later due to circularity.
8803 Otherwise returns one. */
8806 can_complete_type_without_circularity (tree type
)
8808 if (type
== NULL_TREE
|| type
== error_mark_node
)
8810 else if (COMPLETE_TYPE_P (type
))
8812 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8813 return can_complete_type_without_circularity (TREE_TYPE (type
));
8814 else if (CLASS_TYPE_P (type
)
8815 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8821 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
8823 /* Apply any attributes which had to be deferred until instantiation
8824 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8825 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8828 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8829 tree args
, tsubst_flags_t complain
, tree in_decl
)
8831 tree last_dep
= NULL_TREE
;
8835 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8836 if (ATTR_IS_DEPENDENT (t
))
8839 attributes
= copy_list (attributes
);
8843 if (DECL_P (*decl_p
))
8845 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8847 p
= &DECL_ATTRIBUTES (*decl_p
);
8850 p
= &TYPE_ATTRIBUTES (*decl_p
);
8854 tree late_attrs
= NULL_TREE
;
8855 tree
*q
= &late_attrs
;
8857 for (*p
= attributes
; *p
; )
8860 if (ATTR_IS_DEPENDENT (t
))
8862 *p
= TREE_CHAIN (t
);
8863 TREE_CHAIN (t
) = NULL_TREE
;
8864 if ((flag_openmp
|| flag_cilkplus
)
8865 && is_attribute_p ("omp declare simd",
8866 get_attribute_name (t
))
8869 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
8870 clauses
= tsubst_omp_clauses (clauses
, true, args
,
8872 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
8873 clauses
= finish_omp_clauses (clauses
);
8874 tree parms
= DECL_ARGUMENTS (*decl_p
);
8876 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
8878 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
8880 TREE_VALUE (t
) = NULL_TREE
;
8882 /* If the first attribute argument is an identifier, don't
8883 pass it through tsubst. Attributes like mode, format,
8884 cleanup and several target specific attributes expect it
8886 else if (attribute_takes_identifier_p (get_attribute_name (t
))
8890 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8892 /*integral_constant_expression_p=*/false);
8893 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8895 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8900 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8901 /*integral_constant_expression_p=*/false);
8903 q
= &TREE_CHAIN (t
);
8906 p
= &TREE_CHAIN (t
);
8909 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8913 /* Perform (or defer) access check for typedefs that were referenced
8914 from within the template TMPL code.
8915 This is a subroutine of instantiate_decl and instantiate_class_template.
8916 TMPL is the template to consider and TARGS is the list of arguments of
8920 perform_typedefs_access_check (tree tmpl
, tree targs
)
8922 location_t saved_location
;
8924 qualified_typedef_usage_t
*iter
;
8927 || (!CLASS_TYPE_P (tmpl
)
8928 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8931 saved_location
= input_location
;
8932 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8934 tree type_decl
= iter
->typedef_decl
;
8935 tree type_scope
= iter
->context
;
8937 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8940 if (uses_template_parms (type_decl
))
8941 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8942 if (uses_template_parms (type_scope
))
8943 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8945 /* Make access check error messages point to the location
8946 of the use of the typedef. */
8947 input_location
= iter
->locus
;
8948 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8949 type_decl
, type_decl
,
8950 tf_warning_or_error
);
8952 input_location
= saved_location
;
8956 instantiate_class_template_1 (tree type
)
8958 tree templ
, args
, pattern
, t
, member
;
8962 unsigned int saved_maximum_field_alignment
;
8965 if (type
== error_mark_node
)
8966 return error_mark_node
;
8968 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8969 || uses_template_parms (type
))
8972 /* Figure out which template is being instantiated. */
8973 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8974 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8976 /* Determine what specialization of the original template to
8978 t
= most_specialized_class (type
, tf_warning_or_error
);
8979 if (t
== error_mark_node
)
8981 TYPE_BEING_DEFINED (type
) = 1;
8982 return error_mark_node
;
8986 /* This TYPE is actually an instantiation of a partial
8987 specialization. We replace the innermost set of ARGS with
8988 the arguments appropriate for substitution. For example,
8991 template <class T> struct S {};
8992 template <class T> struct S<T*> {};
8994 and supposing that we are instantiating S<int*>, ARGS will
8995 presently be {int*} -- but we need {int}. */
8996 pattern
= TREE_TYPE (t
);
8997 args
= TREE_PURPOSE (t
);
9001 pattern
= TREE_TYPE (templ
);
9002 args
= CLASSTYPE_TI_ARGS (type
);
9005 /* If the template we're instantiating is incomplete, then clearly
9006 there's nothing we can do. */
9007 if (!COMPLETE_TYPE_P (pattern
))
9010 /* If we've recursively instantiated too many templates, stop. */
9011 if (! push_tinst_level (type
))
9014 /* Now we're really doing the instantiation. Mark the type as in
9015 the process of being defined. */
9016 TYPE_BEING_DEFINED (type
) = 1;
9018 /* We may be in the middle of deferred access check. Disable
9020 push_deferring_access_checks (dk_no_deferred
);
9022 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9023 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9024 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9025 fn_context
= error_mark_node
;
9027 push_to_top_level ();
9028 /* Use #pragma pack from the template context. */
9029 saved_maximum_field_alignment
= maximum_field_alignment
;
9030 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9032 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9034 /* Set the input location to the most specialized template definition.
9035 This is needed if tsubsting causes an error. */
9036 typedecl
= TYPE_MAIN_DECL (pattern
);
9037 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9038 DECL_SOURCE_LOCATION (typedecl
);
9040 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9041 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9042 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9043 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9044 if (ANON_AGGR_TYPE_P (pattern
))
9045 SET_ANON_AGGR_TYPE_P (type
);
9046 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9048 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9049 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9050 /* Adjust visibility for template arguments. */
9051 determine_visibility (TYPE_MAIN_DECL (type
));
9053 if (CLASS_TYPE_P (type
))
9054 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9056 pbinfo
= TYPE_BINFO (pattern
);
9058 /* We should never instantiate a nested class before its enclosing
9059 class; we need to look up the nested class by name before we can
9060 instantiate it, and that lookup should instantiate the enclosing
9062 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9063 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9065 base_list
= NULL_TREE
;
9066 if (BINFO_N_BASE_BINFOS (pbinfo
))
9072 /* We must enter the scope containing the type, as that is where
9073 the accessibility of types named in dependent bases are
9075 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9077 /* Substitute into each of the bases to determine the actual
9079 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9082 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9083 tree expanded_bases
= NULL_TREE
;
9086 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9089 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9090 args
, tf_error
, NULL_TREE
);
9091 if (expanded_bases
== error_mark_node
)
9094 len
= TREE_VEC_LENGTH (expanded_bases
);
9097 for (idx
= 0; idx
< len
; idx
++)
9100 /* Extract the already-expanded base class. */
9101 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9103 /* Substitute to figure out the base class. */
9104 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9107 if (base
== error_mark_node
)
9110 base_list
= tree_cons (access
, base
, base_list
);
9111 if (BINFO_VIRTUAL_P (pbase_binfo
))
9112 TREE_TYPE (base_list
) = integer_type_node
;
9116 /* The list is now in reverse order; correct that. */
9117 base_list
= nreverse (base_list
);
9120 pop_scope (pushed_scope
);
9122 /* Now call xref_basetypes to set up all the base-class
9124 xref_basetypes (type
, base_list
);
9126 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9127 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9128 args
, tf_error
, NULL_TREE
);
9129 fixup_attribute_variants (type
);
9131 /* Now that our base classes are set up, enter the scope of the
9132 class, so that name lookups into base classes, etc. will work
9133 correctly. This is precisely analogous to what we do in
9134 begin_class_definition when defining an ordinary non-template
9135 class, except we also need to push the enclosing classes. */
9136 push_nested_class (type
);
9138 /* Now members are processed in the order of declaration. */
9139 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9140 member
; member
= TREE_CHAIN (member
))
9142 tree t
= TREE_VALUE (member
);
9144 if (TREE_PURPOSE (member
))
9148 /* Build new CLASSTYPE_NESTED_UTDS. */
9151 bool class_template_p
;
9153 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9154 && TYPE_LANG_SPECIFIC (t
)
9155 && CLASSTYPE_IS_TEMPLATE (t
));
9156 /* If the member is a class template, then -- even after
9157 substitution -- there may be dependent types in the
9158 template argument list for the class. We increment
9159 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9160 that function will assume that no types are dependent
9161 when outside of a template. */
9162 if (class_template_p
)
9163 ++processing_template_decl
;
9164 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9165 if (class_template_p
)
9166 --processing_template_decl
;
9167 if (newtag
== error_mark_node
)
9170 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9172 tree name
= TYPE_IDENTIFIER (t
);
9174 if (class_template_p
)
9175 /* Unfortunately, lookup_template_class sets
9176 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9177 instantiation (i.e., for the type of a member
9178 template class nested within a template class.)
9179 This behavior is required for
9180 maybe_process_partial_specialization to work
9181 correctly, but is not accurate in this case;
9182 the TAG is not an instantiation of anything.
9183 (The corresponding TEMPLATE_DECL is an
9184 instantiation, but the TYPE is not.) */
9185 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9187 /* Now, we call pushtag to put this NEWTAG into the scope of
9188 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9189 pushtag calling push_template_decl. We don't have to do
9190 this for enums because it will already have been done in
9193 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9194 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9197 else if (DECL_DECLARES_FUNCTION_P (t
))
9199 /* Build new TYPE_METHODS. */
9202 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9203 ++processing_template_decl
;
9204 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9205 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9206 --processing_template_decl
;
9207 set_current_access_from_decl (r
);
9208 finish_member_declaration (r
);
9209 /* Instantiate members marked with attribute used. */
9210 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9212 if (TREE_CODE (r
) == FUNCTION_DECL
9213 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9214 cp_check_omp_declare_reduction (r
);
9218 /* Build new TYPE_FIELDS. */
9219 if (TREE_CODE (t
) == STATIC_ASSERT
)
9223 ++c_inhibit_evaluation_warnings
;
9225 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9226 tf_warning_or_error
, NULL_TREE
,
9227 /*integral_constant_expression_p=*/true);
9228 --c_inhibit_evaluation_warnings
;
9230 finish_static_assert (condition
,
9231 STATIC_ASSERT_MESSAGE (t
),
9232 STATIC_ASSERT_SOURCE_LOCATION (t
),
9235 else if (TREE_CODE (t
) != CONST_DECL
)
9238 tree vec
= NULL_TREE
;
9241 /* The file and line for this declaration, to
9242 assist in error message reporting. Since we
9243 called push_tinst_level above, we don't need to
9245 input_location
= DECL_SOURCE_LOCATION (t
);
9247 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9248 ++processing_template_decl
;
9249 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9250 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9251 --processing_template_decl
;
9253 if (TREE_CODE (r
) == TREE_VEC
)
9255 /* A capture pack became multiple fields. */
9257 len
= TREE_VEC_LENGTH (vec
);
9260 for (int i
= 0; i
< len
; ++i
)
9263 r
= TREE_VEC_ELT (vec
, i
);
9268 [t]he initialization (and any associated
9269 side-effects) of a static data member does
9270 not occur unless the static data member is
9271 itself used in a way that requires the
9272 definition of the static data member to
9275 Therefore, we do not substitute into the
9276 initialized for the static data member here. */
9277 finish_static_data_member_decl
9280 /*init_const_expr_p=*/false,
9281 /*asmspec_tree=*/NULL_TREE
,
9283 /* Instantiate members marked with attribute used. */
9284 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9287 else if (TREE_CODE (r
) == FIELD_DECL
)
9289 /* Determine whether R has a valid type and can be
9290 completed later. If R is invalid, then its type
9291 is replaced by error_mark_node. */
9292 tree rtype
= TREE_TYPE (r
);
9293 if (can_complete_type_without_circularity (rtype
))
9294 complete_type (rtype
);
9296 if (!COMPLETE_TYPE_P (rtype
))
9298 cxx_incomplete_type_error (r
, rtype
);
9299 TREE_TYPE (r
) = error_mark_node
;
9303 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9304 such a thing will already have been added to the field
9305 list by tsubst_enum in finish_member_declaration in the
9306 CLASSTYPE_NESTED_UTDS case above. */
9307 if (!(TREE_CODE (r
) == TYPE_DECL
9308 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9309 && DECL_ARTIFICIAL (r
)))
9311 set_current_access_from_decl (r
);
9312 finish_member_declaration (r
);
9320 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9321 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9323 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9325 tree friend_type
= t
;
9326 bool adjust_processing_template_decl
= false;
9328 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9330 /* template <class T> friend class C; */
9331 friend_type
= tsubst_friend_class (friend_type
, args
);
9332 adjust_processing_template_decl
= true;
9334 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9336 /* template <class T> friend class C::D; */
9337 friend_type
= tsubst (friend_type
, args
,
9338 tf_warning_or_error
, NULL_TREE
);
9339 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9340 friend_type
= TREE_TYPE (friend_type
);
9341 adjust_processing_template_decl
= true;
9343 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9344 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9346 /* This could be either
9350 when dependent_type_p is false or
9352 template <class U> friend class T::C;
9355 friend_type
= tsubst (friend_type
, args
,
9356 tf_warning_or_error
, NULL_TREE
);
9357 /* Bump processing_template_decl for correct
9358 dependent_type_p calculation. */
9359 ++processing_template_decl
;
9360 if (dependent_type_p (friend_type
))
9361 adjust_processing_template_decl
= true;
9362 --processing_template_decl
;
9364 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9365 && hidden_name_p (TYPE_NAME (friend_type
)))
9369 where C hasn't been declared yet. Let's lookup name
9370 from namespace scope directly, bypassing any name that
9371 come from dependent base class. */
9372 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9374 /* The call to xref_tag_from_type does injection for friend
9376 push_nested_namespace (ns
);
9378 xref_tag_from_type (friend_type
, NULL_TREE
,
9379 /*tag_scope=*/ts_current
);
9380 pop_nested_namespace (ns
);
9382 else if (uses_template_parms (friend_type
))
9383 /* friend class C<T>; */
9384 friend_type
= tsubst (friend_type
, args
,
9385 tf_warning_or_error
, NULL_TREE
);
9390 where C is already declared or
9392 friend class C<int>;
9394 We don't have to do anything in these cases. */
9396 if (adjust_processing_template_decl
)
9397 /* Trick make_friend_class into realizing that the friend
9398 we're adding is a template, not an ordinary class. It's
9399 important that we use make_friend_class since it will
9400 perform some error-checking and output cross-reference
9402 ++processing_template_decl
;
9404 if (friend_type
!= error_mark_node
)
9405 make_friend_class (type
, friend_type
, /*complain=*/false);
9407 if (adjust_processing_template_decl
)
9408 --processing_template_decl
;
9412 /* Build new DECL_FRIENDLIST. */
9415 /* The file and line for this declaration, to
9416 assist in error message reporting. Since we
9417 called push_tinst_level above, we don't need to
9419 input_location
= DECL_SOURCE_LOCATION (t
);
9421 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9423 ++processing_template_decl
;
9424 push_deferring_access_checks (dk_no_check
);
9427 r
= tsubst_friend_function (t
, args
);
9428 add_friend (type
, r
, /*complain=*/false);
9429 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9431 pop_deferring_access_checks ();
9432 --processing_template_decl
;
9438 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9440 tree decl
= lambda_function (type
);
9443 if (!DECL_TEMPLATE_INFO (decl
)
9444 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9445 instantiate_decl (decl
, false, false);
9447 /* We need to instantiate the capture list from the template
9448 after we've instantiated the closure members, but before we
9449 consider adding the conversion op. Also keep any captures
9450 that may have been added during instantiation of the op(). */
9451 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9453 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9454 args
, tf_warning_or_error
, NULL_TREE
,
9457 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9458 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9460 maybe_add_lambda_conv_op (type
);
9463 gcc_assert (errorcount
);
9466 /* Set the file and line number information to whatever is given for
9467 the class itself. This puts error messages involving generated
9468 implicit functions at a predictable point, and the same point
9469 that would be used for non-template classes. */
9470 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9472 unreverse_member_declarations (type
);
9473 finish_struct_1 (type
);
9474 TYPE_BEING_DEFINED (type
) = 0;
9476 /* We don't instantiate default arguments for member functions. 14.7.1:
9478 The implicit instantiation of a class template specialization causes
9479 the implicit instantiation of the declarations, but not of the
9480 definitions or default arguments, of the class member functions,
9481 member classes, static data members and member templates.... */
9483 /* Some typedefs referenced from within the template code need to be access
9484 checked at template instantiation time, i.e now. These types were
9485 added to the template at parsing time. Let's get those and perform
9486 the access checks then. */
9487 perform_typedefs_access_check (pattern
, args
);
9488 perform_deferred_access_checks (tf_warning_or_error
);
9489 pop_nested_class ();
9490 maximum_field_alignment
= saved_maximum_field_alignment
;
9492 pop_from_top_level ();
9493 pop_deferring_access_checks ();
9496 /* The vtable for a template class can be emitted in any translation
9497 unit in which the class is instantiated. When there is no key
9498 method, however, finish_struct_1 will already have added TYPE to
9499 the keyed_classes list. */
9500 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9501 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9506 /* Wrapper for instantiate_class_template_1. */
9509 instantiate_class_template (tree type
)
9512 timevar_push (TV_TEMPLATE_INST
);
9513 ret
= instantiate_class_template_1 (type
);
9514 timevar_pop (TV_TEMPLATE_INST
);
9519 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9525 else if (TYPE_P (t
))
9526 r
= tsubst (t
, args
, complain
, in_decl
);
9529 if (!(complain
& tf_warning
))
9530 ++c_inhibit_evaluation_warnings
;
9531 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9532 /*integral_constant_expression_p=*/true);
9533 if (!(complain
& tf_warning
))
9534 --c_inhibit_evaluation_warnings
;
9539 /* Given a function parameter pack TMPL_PARM and some function parameters
9540 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9541 and set *SPEC_P to point at the next point in the list. */
9544 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9546 /* Collect all of the extra "packed" parameters into an
9550 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9551 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9552 tree spec_parm
= *spec_p
;
9555 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9557 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9560 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9561 parmvec
= make_tree_vec (len
);
9562 parmtypevec
= make_tree_vec (len
);
9563 spec_parm
= *spec_p
;
9564 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9566 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9567 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9570 /* Build the argument packs. */
9571 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9572 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9573 TREE_TYPE (argpack
) = argtypepack
;
9574 *spec_p
= spec_parm
;
9579 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9580 NONTYPE_ARGUMENT_PACK. */
9583 make_fnparm_pack (tree spec_parm
)
9585 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9588 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9592 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9594 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9595 if (i
>= TREE_VEC_LENGTH (vec
))
9597 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9601 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9604 make_argument_pack_select (tree arg_pack
, unsigned index
)
9606 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9608 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9609 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9614 /* This is a subroutine of tsubst_pack_expansion.
9616 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9617 mechanism to store the (non complete list of) arguments of the
9618 substitution and return a non substituted pack expansion, in order
9619 to wait for when we have enough arguments to really perform the
9623 use_pack_expansion_extra_args_p (tree parm_packs
,
9627 /* If one pack has an expansion and another pack has a normal
9628 argument or if one pack has an empty argument and an another
9629 one hasn't then tsubst_pack_expansion cannot perform the
9630 substitution and need to fall back on the
9631 PACK_EXPANSION_EXTRA mechanism. */
9632 if (parm_packs
== NULL_TREE
)
9634 else if (has_empty_arg
)
9637 bool has_expansion_arg
= false;
9638 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9640 bool has_non_expansion_arg
= false;
9641 for (tree parm_pack
= parm_packs
;
9643 parm_pack
= TREE_CHAIN (parm_pack
))
9645 tree arg
= TREE_VALUE (parm_pack
);
9647 if (argument_pack_element_is_expansion_p (arg
, i
))
9648 has_expansion_arg
= true;
9650 has_non_expansion_arg
= true;
9653 if (has_expansion_arg
&& has_non_expansion_arg
)
9659 /* [temp.variadic]/6 says that:
9661 The instantiation of a pack expansion [...]
9662 produces a list E1,E2, ..., En, where N is the number of elements
9663 in the pack expansion parameters.
9665 This subroutine of tsubst_pack_expansion produces one of these Ei.
9667 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9668 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9669 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9670 INDEX is the index 'i' of the element Ei to produce. ARGS,
9671 COMPLAIN, and IN_DECL are the same parameters as for the
9672 tsubst_pack_expansion function.
9674 The function returns the resulting Ei upon successful completion,
9677 Note that this function possibly modifies the ARGS parameter, so
9678 it's the responsibility of the caller to restore it. */
9681 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9684 tree args
/* This parm gets
9686 tsubst_flags_t complain
,
9690 bool ith_elem_is_expansion
= false;
9692 /* For each parameter pack, change the substitution of the parameter
9693 pack to the ith argument in its argument pack, then expand the
9695 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9697 tree parm
= TREE_PURPOSE (pack
);
9698 tree arg_pack
= TREE_VALUE (pack
);
9699 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9701 ith_elem_is_expansion
|=
9702 argument_pack_element_is_expansion_p (arg_pack
, index
);
9704 /* Select the Ith argument from the pack. */
9705 if (TREE_CODE (parm
) == PARM_DECL
9706 || TREE_CODE (parm
) == FIELD_DECL
)
9710 aps
= make_argument_pack_select (arg_pack
, index
);
9712 register_local_specialization (aps
, parm
);
9715 aps
= retrieve_local_specialization (parm
);
9720 template_parm_level_and_index (parm
, &level
, &idx
);
9724 aps
= make_argument_pack_select (arg_pack
, index
);
9725 /* Update the corresponding argument. */
9726 TMPL_ARG (args
, level
, idx
) = aps
;
9729 /* Re-use the ARGUMENT_PACK_SELECT. */
9730 aps
= TMPL_ARG (args
, level
, idx
);
9732 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9735 /* Substitute into the PATTERN with the (possibly altered)
9737 if (pattern
== in_decl
)
9738 /* Expanding a fixed parameter pack from
9739 coerce_template_parameter_pack. */
9740 t
= tsubst_decl (pattern
, args
, complain
);
9741 else if (!TYPE_P (pattern
))
9742 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9743 /*integral_constant_expression_p=*/false);
9745 t
= tsubst (pattern
, args
, complain
, in_decl
);
9747 /* If the Ith argument pack element is a pack expansion, then
9748 the Ith element resulting from the substituting is going to
9749 be a pack expansion as well. */
9750 if (ith_elem_is_expansion
)
9751 t
= make_pack_expansion (t
);
9756 /* Substitute ARGS into T, which is an pack expansion
9757 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9758 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9759 (if only a partial substitution could be performed) or
9760 ERROR_MARK_NODE if there was an error. */
9762 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9766 tree pack
, packs
= NULL_TREE
;
9767 bool unsubstituted_packs
= false;
9770 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
9771 bool need_local_specializations
= false;
9774 gcc_assert (PACK_EXPANSION_P (t
));
9775 pattern
= PACK_EXPANSION_PATTERN (t
);
9777 /* Add in any args remembered from an earlier partial instantiation. */
9778 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9780 levels
= TMPL_ARGS_DEPTH (args
);
9782 /* Determine the argument packs that will instantiate the parameter
9783 packs used in the expansion expression. While we're at it,
9784 compute the number of arguments to be expanded and make sure it
9786 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9787 pack
= TREE_CHAIN (pack
))
9789 tree parm_pack
= TREE_VALUE (pack
);
9790 tree arg_pack
= NULL_TREE
;
9791 tree orig_arg
= NULL_TREE
;
9794 if (TREE_CODE (parm_pack
) == BASES
)
9796 if (BASES_DIRECT (parm_pack
))
9797 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9798 args
, complain
, in_decl
, false));
9800 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9801 args
, complain
, in_decl
, false));
9803 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9805 if (PACK_EXPANSION_LOCAL_P (t
))
9806 arg_pack
= retrieve_local_specialization (parm_pack
);
9809 /* We can't rely on local_specializations for a parameter
9810 name used later in a function declaration (such as in a
9811 late-specified return type). Even if it exists, it might
9812 have the wrong value for a recursive call. Just make a
9813 dummy decl, since it's only used for its type. */
9814 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9815 if (arg_pack
&& DECL_PACK_P (arg_pack
))
9816 /* Partial instantiation of the parm_pack, we can't build
9817 up an argument pack yet. */
9818 arg_pack
= NULL_TREE
;
9820 arg_pack
= make_fnparm_pack (arg_pack
);
9821 need_local_specializations
= true;
9824 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
9825 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
9829 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9831 if (level
<= levels
)
9832 arg_pack
= TMPL_ARG (args
, level
, idx
);
9835 orig_arg
= arg_pack
;
9836 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9837 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9839 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9840 /* This can only happen if we forget to expand an argument
9841 pack somewhere else. Just return an error, silently. */
9843 result
= make_tree_vec (1);
9844 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9851 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9853 /* Don't bother trying to do a partial substitution with
9854 incomplete packs; we'll try again after deduction. */
9855 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9860 else if (len
!= my_len
)
9862 if (!(complain
& tf_error
))
9863 /* Fail quietly. */;
9864 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9865 error ("mismatched argument pack lengths while expanding "
9869 error ("mismatched argument pack lengths while expanding "
9872 return error_mark_node
;
9875 /* Keep track of the parameter packs and their corresponding
9877 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9878 TREE_TYPE (packs
) = orig_arg
;
9882 /* We can't substitute for this parameter pack. We use a flag as
9883 well as the missing_level counter because function parameter
9884 packs don't have a level. */
9885 unsubstituted_packs
= true;
9889 /* We cannot expand this expansion expression, because we don't have
9890 all of the argument packs we need. */
9891 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9893 /* We got some full packs, but we can't substitute them in until we
9894 have values for all the packs. So remember these until then. */
9896 t
= make_pack_expansion (pattern
);
9897 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9900 else if (unsubstituted_packs
)
9902 /* There were no real arguments, we're just replacing a parameter
9903 pack with another version of itself. Substitute into the
9904 pattern and return a PACK_EXPANSION_*. The caller will need to
9906 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9907 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9908 /*integral_constant_expression_p=*/false);
9910 t
= tsubst (pattern
, args
, complain
, in_decl
);
9911 t
= make_pack_expansion (t
);
9915 gcc_assert (len
>= 0);
9917 if (need_local_specializations
)
9919 /* We're in a late-specified return type, so create our own local
9920 specializations map; the current map is either NULL or (in the
9921 case of recursive unification) might have bindings that we don't
9922 want to use or alter. */
9923 saved_local_specializations
= local_specializations
;
9924 local_specializations
= new hash_map
<tree
, tree
>;
9927 /* For each argument in each argument pack, substitute into the
9929 result
= make_tree_vec (len
);
9930 for (i
= 0; i
< len
; ++i
)
9932 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9936 TREE_VEC_ELT (result
, i
) = t
;
9937 if (t
== error_mark_node
)
9939 result
= error_mark_node
;
9944 /* Update ARGS to restore the substitution from parameter packs to
9945 their argument packs. */
9946 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9948 tree parm
= TREE_PURPOSE (pack
);
9950 if (TREE_CODE (parm
) == PARM_DECL
9951 || TREE_CODE (parm
) == FIELD_DECL
)
9952 register_local_specialization (TREE_TYPE (pack
), parm
);
9957 if (TREE_VALUE (pack
) == NULL_TREE
)
9960 template_parm_level_and_index (parm
, &level
, &idx
);
9962 /* Update the corresponding argument. */
9963 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9964 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9967 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9971 if (need_local_specializations
)
9973 delete local_specializations
;
9974 local_specializations
= saved_local_specializations
;
9980 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
9981 TMPL. We do this using DECL_PARM_INDEX, which should work even with
9982 parameter packs; all parms generated from a function parameter pack will
9983 have the same DECL_PARM_INDEX. */
9986 get_pattern_parm (tree parm
, tree tmpl
)
9988 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9991 if (DECL_ARTIFICIAL (parm
))
9993 for (patparm
= DECL_ARGUMENTS (pattern
);
9994 patparm
; patparm
= DECL_CHAIN (patparm
))
9995 if (DECL_ARTIFICIAL (patparm
)
9996 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10001 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10002 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10003 gcc_assert (DECL_PARM_INDEX (patparm
)
10004 == DECL_PARM_INDEX (parm
));
10010 /* Substitute ARGS into the vector or list of template arguments T. */
10013 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10016 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10019 if (t
== error_mark_node
)
10020 return error_mark_node
;
10022 len
= TREE_VEC_LENGTH (t
);
10023 elts
= XALLOCAVEC (tree
, len
);
10025 for (i
= 0; i
< len
; i
++)
10027 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10030 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10031 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10032 else if (PACK_EXPANSION_P (orig_arg
))
10034 /* Substitute into an expansion expression. */
10035 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10037 if (TREE_CODE (new_arg
) == TREE_VEC
)
10038 /* Add to the expanded length adjustment the number of
10039 expanded arguments. We subtract one from this
10040 measurement, because the argument pack expression
10041 itself is already counted as 1 in
10042 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10043 the argument pack is empty. */
10044 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10046 else if (ARGUMENT_PACK_P (orig_arg
))
10048 /* Substitute into each of the arguments. */
10049 new_arg
= TYPE_P (orig_arg
)
10050 ? cxx_make_type (TREE_CODE (orig_arg
))
10051 : make_node (TREE_CODE (orig_arg
));
10053 SET_ARGUMENT_PACK_ARGS (
10055 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10056 args
, complain
, in_decl
));
10058 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10059 new_arg
= error_mark_node
;
10061 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10062 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10063 complain
, in_decl
);
10064 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10066 if (TREE_TYPE (new_arg
) == error_mark_node
)
10067 new_arg
= error_mark_node
;
10071 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10073 if (new_arg
== error_mark_node
)
10074 return error_mark_node
;
10077 if (new_arg
!= orig_arg
)
10084 /* Make space for the expanded arguments coming from template
10086 t
= make_tree_vec (len
+ expanded_len_adjust
);
10087 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10088 arguments for a member template.
10089 In that case each TREE_VEC in ORIG_T represents a level of template
10090 arguments, and ORIG_T won't carry any non defaulted argument count.
10091 It will rather be the nested TREE_VECs that will carry one.
10092 In other words, ORIG_T carries a non defaulted argument count only
10093 if it doesn't contain any nested TREE_VEC. */
10094 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10096 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10097 count
+= expanded_len_adjust
;
10098 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10100 for (i
= 0, out
= 0; i
< len
; i
++)
10102 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10103 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10104 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10108 /* Now expand the template argument pack "in place". */
10109 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10110 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10114 TREE_VEC_ELT (t
, out
) = elts
[i
];
10122 /* Return the result of substituting ARGS into the template parameters
10123 given by PARMS. If there are m levels of ARGS and m + n levels of
10124 PARMS, then the result will contain n levels of PARMS. For
10125 example, if PARMS is `template <class T> template <class U>
10126 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10127 result will be `template <int*, double, class V>'. */
10130 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10132 tree r
= NULL_TREE
;
10135 /* When substituting into a template, we must set
10136 PROCESSING_TEMPLATE_DECL as the template parameters may be
10137 dependent if they are based on one-another, and the dependency
10138 predicates are short-circuit outside of templates. */
10139 ++processing_template_decl
;
10141 for (new_parms
= &r
;
10142 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10143 new_parms
= &(TREE_CHAIN (*new_parms
)),
10144 parms
= TREE_CHAIN (parms
))
10147 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10150 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10154 if (parms
== error_mark_node
)
10157 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10159 if (tuple
== error_mark_node
)
10162 TREE_VEC_ELT (new_vec
, i
) =
10163 tsubst_template_parm (tuple
, args
, complain
);
10167 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10168 - TMPL_ARGS_DEPTH (args
)),
10169 new_vec
, NULL_TREE
);
10172 --processing_template_decl
;
10177 /* Return the result of substituting ARGS into one template parameter
10178 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10179 parameter and which TREE_PURPOSE is the default argument of the
10180 template parameter. */
10183 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10185 tree default_value
, parm_decl
;
10187 if (args
== NULL_TREE
10189 || t
== error_mark_node
)
10192 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10194 default_value
= TREE_PURPOSE (t
);
10195 parm_decl
= TREE_VALUE (t
);
10197 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10198 if (TREE_CODE (parm_decl
) == PARM_DECL
10199 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10200 parm_decl
= error_mark_node
;
10201 default_value
= tsubst_template_arg (default_value
, args
,
10202 complain
, NULL_TREE
);
10204 return build_tree_list (default_value
, parm_decl
);
10207 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10208 type T. If T is not an aggregate or enumeration type, it is
10209 handled as if by tsubst. IN_DECL is as for tsubst. If
10210 ENTERING_SCOPE is nonzero, T is the context for a template which
10211 we are presently tsubst'ing. Return the substituted value. */
10214 tsubst_aggr_type (tree t
,
10216 tsubst_flags_t complain
,
10218 int entering_scope
)
10220 if (t
== NULL_TREE
)
10223 switch (TREE_CODE (t
))
10226 if (TYPE_PTRMEMFUNC_P (t
))
10227 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10229 /* Else fall through. */
10230 case ENUMERAL_TYPE
:
10232 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10237 int saved_unevaluated_operand
;
10238 int saved_inhibit_evaluation_warnings
;
10240 /* In "sizeof(X<I>)" we need to evaluate "I". */
10241 saved_unevaluated_operand
= cp_unevaluated_operand
;
10242 cp_unevaluated_operand
= 0;
10243 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10244 c_inhibit_evaluation_warnings
= 0;
10246 /* First, determine the context for the type we are looking
10248 context
= TYPE_CONTEXT (t
);
10249 if (context
&& TYPE_P (context
))
10251 context
= tsubst_aggr_type (context
, args
, complain
,
10252 in_decl
, /*entering_scope=*/1);
10253 /* If context is a nested class inside a class template,
10254 it may still need to be instantiated (c++/33959). */
10255 context
= complete_type (context
);
10258 /* Then, figure out what arguments are appropriate for the
10259 type we are trying to find. For example, given:
10261 template <class T> struct S;
10262 template <class T, class U> void f(T, U) { S<U> su; }
10264 and supposing that we are instantiating f<int, double>,
10265 then our ARGS will be {int, double}, but, when looking up
10266 S we only want {double}. */
10267 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10268 complain
, in_decl
);
10269 if (argvec
== error_mark_node
)
10270 r
= error_mark_node
;
10273 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10274 entering_scope
, complain
);
10275 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10278 cp_unevaluated_operand
= saved_unevaluated_operand
;
10279 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10284 /* This is not a template type, so there's nothing to do. */
10288 return tsubst (t
, args
, complain
, in_decl
);
10292 /* Substitute into the default argument ARG (a default argument for
10293 FN), which has the indicated TYPE. */
10296 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10298 tree saved_class_ptr
= NULL_TREE
;
10299 tree saved_class_ref
= NULL_TREE
;
10300 int errs
= errorcount
+ sorrycount
;
10302 /* This can happen in invalid code. */
10303 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10306 /* This default argument came from a template. Instantiate the
10307 default argument here, not in tsubst. In the case of
10316 we must be careful to do name lookup in the scope of S<T>,
10317 rather than in the current class. */
10318 push_access_scope (fn
);
10319 /* The "this" pointer is not valid in a default argument. */
10322 saved_class_ptr
= current_class_ptr
;
10323 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10324 saved_class_ref
= current_class_ref
;
10325 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10328 push_deferring_access_checks(dk_no_deferred
);
10329 /* The default argument expression may cause implicitly defined
10330 member functions to be synthesized, which will result in garbage
10331 collection. We must treat this situation as if we were within
10332 the body of function so as to avoid collecting live data on the
10335 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10336 complain
, NULL_TREE
,
10337 /*integral_constant_expression_p=*/false);
10339 pop_deferring_access_checks();
10341 /* Restore the "this" pointer. */
10344 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10345 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10348 if (errorcount
+sorrycount
> errs
10349 && (complain
& tf_warning_or_error
))
10350 inform (input_location
,
10351 " when instantiating default argument for call to %D", fn
);
10353 /* Make sure the default argument is reasonable. */
10354 arg
= check_default_argument (type
, arg
, complain
);
10356 pop_access_scope (fn
);
10361 /* Substitute into all the default arguments for FN. */
10364 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10369 tmpl_args
= DECL_TI_ARGS (fn
);
10371 /* If this function is not yet instantiated, we certainly don't need
10372 its default arguments. */
10373 if (uses_template_parms (tmpl_args
))
10375 /* Don't do this again for clones. */
10376 if (DECL_CLONED_FUNCTION_P (fn
))
10379 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10381 arg
= TREE_CHAIN (arg
))
10382 if (TREE_PURPOSE (arg
))
10383 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10385 TREE_PURPOSE (arg
),
10389 /* Substitute the ARGS into the T, which is a _DECL. Return the
10390 result of the substitution. Issue error and warning messages under
10391 control of COMPLAIN. */
10394 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10396 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10397 location_t saved_loc
;
10398 tree r
= NULL_TREE
;
10400 hashval_t hash
= 0;
10402 /* Set the filename and linenumber to improve error-reporting. */
10403 saved_loc
= input_location
;
10404 input_location
= DECL_SOURCE_LOCATION (t
);
10406 switch (TREE_CODE (t
))
10408 case TEMPLATE_DECL
:
10410 /* We can get here when processing a member function template,
10411 member class template, or template template parameter. */
10412 tree decl
= DECL_TEMPLATE_RESULT (t
);
10417 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10419 /* Template template parameter is treated here. */
10420 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10421 if (new_type
== error_mark_node
)
10422 RETURN (error_mark_node
);
10423 /* If we get a real template back, return it. This can happen in
10424 the context of most_specialized_class. */
10425 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10429 DECL_CHAIN (r
) = NULL_TREE
;
10430 TREE_TYPE (r
) = new_type
;
10431 DECL_TEMPLATE_RESULT (r
)
10432 = build_decl (DECL_SOURCE_LOCATION (decl
),
10433 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10434 DECL_TEMPLATE_PARMS (r
)
10435 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10437 TYPE_NAME (new_type
) = r
;
10441 /* We might already have an instance of this template.
10442 The ARGS are for the surrounding class type, so the
10443 full args contain the tsubst'd args for the context,
10444 plus the innermost args from the template decl. */
10445 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10446 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10447 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10448 /* Because this is a template, the arguments will still be
10449 dependent, even after substitution. If
10450 PROCESSING_TEMPLATE_DECL is not set, the dependency
10451 predicates will short-circuit. */
10452 ++processing_template_decl
;
10453 full_args
= tsubst_template_args (tmpl_args
, args
,
10454 complain
, in_decl
);
10455 --processing_template_decl
;
10456 if (full_args
== error_mark_node
)
10457 RETURN (error_mark_node
);
10459 /* If this is a default template template argument,
10460 tsubst might not have changed anything. */
10461 if (full_args
== tmpl_args
)
10464 hash
= hash_tmpl_and_args (t
, full_args
);
10465 spec
= retrieve_specialization (t
, full_args
, hash
);
10466 if (spec
!= NULL_TREE
)
10472 /* Make a new template decl. It will be similar to the
10473 original, but will record the current template arguments.
10474 We also create a new function declaration, which is just
10475 like the old one, but points to this new template, rather
10476 than the old one. */
10478 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10479 DECL_CHAIN (r
) = NULL_TREE
;
10481 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10483 if (TREE_CODE (decl
) == TYPE_DECL
10484 && !TYPE_DECL_ALIAS_P (decl
))
10487 ++processing_template_decl
;
10488 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10489 --processing_template_decl
;
10490 if (new_type
== error_mark_node
)
10491 RETURN (error_mark_node
);
10493 TREE_TYPE (r
) = new_type
;
10494 /* For a partial specialization, we need to keep pointing to
10495 the primary template. */
10496 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10497 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10498 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10499 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10500 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10505 ++processing_template_decl
;
10506 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10507 --processing_template_decl
;
10508 if (new_decl
== error_mark_node
)
10509 RETURN (error_mark_node
);
10511 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10512 DECL_TI_TEMPLATE (new_decl
) = r
;
10513 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10514 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10515 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10518 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10519 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10520 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10522 /* The template parameters for this new template are all the
10523 template parameters for the old template, except the
10524 outermost level of parameters. */
10525 DECL_TEMPLATE_PARMS (r
)
10526 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10529 if (PRIMARY_TEMPLATE_P (t
))
10530 DECL_PRIMARY_TEMPLATE (r
) = r
;
10532 if (TREE_CODE (decl
) != TYPE_DECL
&& TREE_CODE (decl
) != VAR_DECL
)
10533 /* Record this non-type partial instantiation. */
10534 register_specialization (r
, t
,
10535 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10540 case FUNCTION_DECL
:
10543 tree argvec
= NULL_TREE
;
10551 /* Nobody should be tsubst'ing into non-template functions. */
10552 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10554 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10559 /* If T is not dependent, just return it. We have to
10560 increment PROCESSING_TEMPLATE_DECL because
10561 value_dependent_expression_p assumes that nothing is
10562 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10563 ++processing_template_decl
;
10564 dependent_p
= value_dependent_expression_p (t
);
10565 --processing_template_decl
;
10569 /* Calculate the most general template of which R is a
10570 specialization, and the complete set of arguments used to
10572 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10573 argvec
= tsubst_template_args (DECL_TI_ARGS
10574 (DECL_TEMPLATE_RESULT
10575 (DECL_TI_TEMPLATE (t
))),
10576 args
, complain
, in_decl
);
10577 if (argvec
== error_mark_node
)
10578 RETURN (error_mark_node
);
10580 /* Check to see if we already have this specialization. */
10581 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10582 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10590 /* We can see more levels of arguments than parameters if
10591 there was a specialization of a member template, like
10594 template <class T> struct S { template <class U> void f(); }
10595 template <> template <class U> void S<int>::f(U);
10597 Here, we'll be substituting into the specialization,
10598 because that's where we can find the code we actually
10599 want to generate, but we'll have enough arguments for
10600 the most general template.
10602 We also deal with the peculiar case:
10604 template <class T> struct S {
10605 template <class U> friend void f();
10607 template <class U> void f() {}
10609 template void f<double>();
10611 Here, the ARGS for the instantiation of will be {int,
10612 double}. But, we only need as many ARGS as there are
10613 levels of template parameters in CODE_PATTERN. We are
10614 careful not to get fooled into reducing the ARGS in
10617 template <class T> struct S { template <class U> void f(U); }
10618 template <class T> template <> void S<T>::f(int) {}
10620 which we can spot because the pattern will be a
10621 specialization in this case. */
10622 args_depth
= TMPL_ARGS_DEPTH (args
);
10624 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10625 if (args_depth
> parms_depth
10626 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10627 args
= get_innermost_template_args (args
, parms_depth
);
10631 /* This special case arises when we have something like this:
10633 template <class T> struct S {
10634 friend void f<int>(int, double);
10637 Here, the DECL_TI_TEMPLATE for the friend declaration
10638 will be an IDENTIFIER_NODE. We are being called from
10639 tsubst_friend_function, and we want only to create a
10640 new decl (R) with appropriate types so that we can call
10641 determine_specialization. */
10642 gen_tmpl
= NULL_TREE
;
10645 if (DECL_CLASS_SCOPE_P (t
))
10647 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10651 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10652 complain
, t
, /*entering_scope=*/1);
10657 ctx
= DECL_CONTEXT (t
);
10659 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10660 if (type
== error_mark_node
)
10661 RETURN (error_mark_node
);
10663 /* If we hit excessive deduction depth, the type is bogus even if
10664 it isn't error_mark_node, so don't build a decl. */
10665 if (excessive_deduction_depth
)
10666 RETURN (error_mark_node
);
10668 /* We do NOT check for matching decls pushed separately at this
10669 point, as they may not represent instantiations of this
10670 template, and in any case are considered separate under the
10673 DECL_USE_TEMPLATE (r
) = 0;
10674 TREE_TYPE (r
) = type
;
10675 /* Clear out the mangled name and RTL for the instantiation. */
10676 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10677 SET_DECL_RTL (r
, NULL
);
10678 /* Leave DECL_INITIAL set on deleted instantiations. */
10679 if (!DECL_DELETED_FN (r
))
10680 DECL_INITIAL (r
) = NULL_TREE
;
10681 DECL_CONTEXT (r
) = ctx
;
10683 /* OpenMP UDRs have the only argument a reference to the declared
10684 type. We want to diagnose if the declared type is a reference,
10685 which is invalid, but as references to references are usually
10686 quietly merged, diagnose it here. */
10687 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10690 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10691 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10692 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10693 error_at (DECL_SOURCE_LOCATION (t
),
10694 "reference type %qT in "
10695 "%<#pragma omp declare reduction%>", argtype
);
10696 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10697 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10701 if (member
&& DECL_CONV_FN_P (r
))
10702 /* Type-conversion operator. Reconstruct the name, in
10703 case it's the name of one of the template's parameters. */
10704 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10706 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10708 DECL_RESULT (r
) = NULL_TREE
;
10710 TREE_STATIC (r
) = 0;
10711 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10712 DECL_EXTERNAL (r
) = 1;
10713 /* If this is an instantiation of a function with internal
10714 linkage, we already know what object file linkage will be
10715 assigned to the instantiation. */
10716 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10717 DECL_DEFER_OUTPUT (r
) = 0;
10718 DECL_CHAIN (r
) = NULL_TREE
;
10719 DECL_PENDING_INLINE_INFO (r
) = 0;
10720 DECL_PENDING_INLINE_P (r
) = 0;
10721 DECL_SAVED_TREE (r
) = NULL_TREE
;
10722 DECL_STRUCT_FUNCTION (r
) = NULL
;
10724 /* We'll re-clone as appropriate in instantiate_template. */
10725 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10727 /* If we aren't complaining now, return on error before we register
10728 the specialization so that we'll complain eventually. */
10729 if ((complain
& tf_error
) == 0
10730 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10731 && !grok_op_properties (r
, /*complain=*/false))
10732 RETURN (error_mark_node
);
10734 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10735 this in the special friend case mentioned above where
10736 GEN_TMPL is NULL. */
10739 DECL_TEMPLATE_INFO (r
)
10740 = build_template_info (gen_tmpl
, argvec
);
10741 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10744 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10746 /* We instantiated this while substituting into
10747 the type earlier (template/friend54.C). */
10750 /* We're not supposed to instantiate default arguments
10751 until they are called, for a template. But, for a
10754 template <class T> void f ()
10755 { extern void g(int i = T()); }
10757 we should do the substitution when the template is
10758 instantiated. We handle the member function case in
10759 instantiate_class_template since the default arguments
10760 might refer to other members of the class. */
10762 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10763 && !uses_template_parms (argvec
))
10764 tsubst_default_arguments (r
, complain
);
10767 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10769 /* Copy the list of befriending classes. */
10770 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10772 friends
= &TREE_CHAIN (*friends
))
10774 *friends
= copy_node (*friends
);
10775 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10780 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10782 maybe_retrofit_in_chrg (r
);
10783 if (DECL_CONSTRUCTOR_P (r
))
10784 grok_ctor_properties (ctx
, r
);
10785 if (DECL_INHERITED_CTOR_BASE (r
))
10786 deduce_inheriting_ctor (r
);
10787 /* If this is an instantiation of a member template, clone it.
10788 If it isn't, that'll be handled by
10789 clone_constructors_and_destructors. */
10790 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10791 clone_function_decl (r
, /*update_method_vec_p=*/0);
10793 else if ((complain
& tf_error
) != 0
10794 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10795 && !grok_op_properties (r
, /*complain=*/true))
10796 RETURN (error_mark_node
);
10798 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10799 SET_DECL_FRIEND_CONTEXT (r
,
10800 tsubst (DECL_FRIEND_CONTEXT (t
),
10801 args
, complain
, in_decl
));
10803 /* Possibly limit visibility based on template args. */
10804 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10805 if (DECL_VISIBILITY_SPECIFIED (t
))
10807 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10808 DECL_ATTRIBUTES (r
)
10809 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10811 determine_visibility (r
);
10812 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10813 && !processing_template_decl
)
10814 defaulted_late_check (r
);
10816 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10817 args
, complain
, in_decl
);
10823 tree type
= NULL_TREE
;
10825 tree expanded_types
= NULL_TREE
;
10826 tree prev_r
= NULL_TREE
;
10827 tree first_r
= NULL_TREE
;
10829 if (DECL_PACK_P (t
))
10831 /* If there is a local specialization that isn't a
10832 parameter pack, it means that we're doing a "simple"
10833 substitution from inside tsubst_pack_expansion. Just
10834 return the local specialization (which will be a single
10836 tree spec
= retrieve_local_specialization (t
);
10838 && TREE_CODE (spec
) == PARM_DECL
10839 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10842 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10843 the parameters in this function parameter pack. */
10844 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10845 complain
, in_decl
);
10846 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10848 len
= TREE_VEC_LENGTH (expanded_types
);
10850 /* Zero-length parameter packs are boring. Just substitute
10853 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10858 /* All we did was update the type. Make a note of that. */
10859 type
= expanded_types
;
10860 expanded_types
= NULL_TREE
;
10864 /* Loop through all of the parameters we'll build. When T is
10865 a function parameter pack, LEN is the number of expanded
10866 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10868 for (i
= 0; i
< len
; ++i
)
10872 if (DECL_TEMPLATE_PARM_P (t
))
10873 SET_DECL_TEMPLATE_PARM_P (r
);
10875 if (expanded_types
)
10876 /* We're on the Ith parameter of the function parameter
10879 /* Get the Ith type. */
10880 type
= TREE_VEC_ELT (expanded_types
, i
);
10882 /* Rename the parameter to include the index. */
10884 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10887 /* We're dealing with a normal parameter. */
10888 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10890 type
= type_decays_to (type
);
10891 TREE_TYPE (r
) = type
;
10892 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10894 if (DECL_INITIAL (r
))
10896 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10897 DECL_INITIAL (r
) = TREE_TYPE (r
);
10899 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10900 complain
, in_decl
);
10903 DECL_CONTEXT (r
) = NULL_TREE
;
10905 if (!DECL_TEMPLATE_PARM_P (r
))
10906 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10908 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10909 args
, complain
, in_decl
);
10911 /* Keep track of the first new parameter we
10912 generate. That's what will be returned to the
10917 /* Build a proper chain of parameters when substituting
10918 into a function parameter pack. */
10920 DECL_CHAIN (prev_r
) = r
;
10923 /* If cp_unevaluated_operand is set, we're just looking for a
10924 single dummy parameter, so don't keep going. */
10925 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10926 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10927 complain
, DECL_CHAIN (t
));
10929 /* FIRST_R contains the start of the chain we've built. */
10936 tree type
= NULL_TREE
;
10937 tree vec
= NULL_TREE
;
10938 tree expanded_types
= NULL_TREE
;
10941 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
10943 /* This field is a lambda capture pack. Return a TREE_VEC of
10944 the expanded fields to instantiate_class_template_1 and
10945 store them in the specializations hash table as a
10946 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
10947 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10948 complain
, in_decl
);
10949 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10951 len
= TREE_VEC_LENGTH (expanded_types
);
10952 vec
= make_tree_vec (len
);
10956 /* All we did was update the type. Make a note of that. */
10957 type
= expanded_types
;
10958 expanded_types
= NULL_TREE
;
10962 for (int i
= 0; i
< len
; ++i
)
10965 if (expanded_types
)
10967 type
= TREE_VEC_ELT (expanded_types
, i
);
10969 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10972 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10974 if (type
== error_mark_node
)
10975 RETURN (error_mark_node
);
10976 TREE_TYPE (r
) = type
;
10977 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10979 if (DECL_C_BIT_FIELD (r
))
10980 /* For bit-fields, DECL_INITIAL gives the number of bits. For
10981 non-bit-fields DECL_INITIAL is a non-static data member
10982 initializer, which gets deferred instantiation. */
10984 = tsubst_expr (DECL_INITIAL (t
), args
,
10986 /*integral_constant_expression_p=*/true);
10987 else if (DECL_INITIAL (t
))
10989 /* Set up DECL_TEMPLATE_INFO so that we can get at the
10990 NSDMI in perform_member_init. Still set DECL_INITIAL
10991 so that we know there is one. */
10992 DECL_INITIAL (r
) = void_node
;
10993 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
10994 retrofit_lang_decl (r
);
10995 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10997 /* We don't have to set DECL_CONTEXT here; it is set by
10998 finish_member_declaration. */
10999 DECL_CHAIN (r
) = NULL_TREE
;
11001 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11002 args
, complain
, in_decl
);
11005 TREE_VEC_ELT (vec
, i
) = r
;
11011 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11012 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11013 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11014 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11015 TREE_TYPE (pack
) = tpack
;
11016 register_specialization (pack
, t
, args
, false, 0);
11022 /* We reach here only for member using decls. We also need to check
11023 uses_template_parms because DECL_DEPENDENT_P is not set for a
11024 using-declaration that designates a member of the current
11025 instantiation (c++/53549). */
11026 if (DECL_DEPENDENT_P (t
)
11027 || uses_template_parms (USING_DECL_SCOPE (t
)))
11029 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11030 complain
, in_decl
);
11031 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11032 r
= do_class_using_decl (inst_scope
, name
);
11034 r
= error_mark_node
;
11037 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11038 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11044 DECL_CHAIN (r
) = NULL_TREE
;
11051 tree argvec
= NULL_TREE
;
11052 tree gen_tmpl
= NULL_TREE
;
11054 tree tmpl
= NULL_TREE
;
11056 tree type
= NULL_TREE
;
11059 if (TREE_TYPE (t
) == error_mark_node
)
11060 RETURN (error_mark_node
);
11062 if (TREE_CODE (t
) == TYPE_DECL
11063 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11065 /* If this is the canonical decl, we don't have to
11066 mess with instantiations, and often we can't (for
11067 typename, template type parms and such). Note that
11068 TYPE_NAME is not correct for the above test if
11069 we've copied the type for a typedef. */
11070 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11071 if (type
== error_mark_node
)
11072 RETURN (error_mark_node
);
11073 r
= TYPE_NAME (type
);
11077 /* Check to see if we already have the specialization we
11080 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11082 /* T is a static data member or namespace-scope entity.
11083 We have to substitute into namespace-scope variables
11084 (even though such entities are never templates) because
11087 template <class T> void f() { extern T t; }
11089 where the entity referenced is not known until
11090 instantiation time. */
11092 ctx
= DECL_CONTEXT (t
);
11093 if (DECL_CLASS_SCOPE_P (t
))
11095 ctx
= tsubst_aggr_type (ctx
, args
,
11097 in_decl
, /*entering_scope=*/1);
11098 /* If CTX is unchanged, then T is in fact the
11099 specialization we want. That situation occurs when
11100 referencing a static data member within in its own
11101 class. We can use pointer equality, rather than
11102 same_type_p, because DECL_CONTEXT is always
11104 if (ctx
== DECL_CONTEXT (t
)
11105 && (TREE_CODE (t
) != TYPE_DECL
11106 /* ... unless T is a member template; in which
11107 case our caller can be willing to create a
11108 specialization of that template represented
11110 || !(DECL_TI_TEMPLATE (t
)
11111 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))))
11117 tmpl
= DECL_TI_TEMPLATE (t
);
11118 gen_tmpl
= most_general_template (tmpl
);
11119 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11120 if (argvec
== error_mark_node
)
11121 RETURN (error_mark_node
);
11122 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11123 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11128 /* A local variable. */
11130 /* Subsequent calls to pushdecl will fill this in. */
11132 spec
= retrieve_local_specialization (t
);
11134 /* If we already have the specialization we need, there is
11135 nothing more to do. */
11142 /* Create a new node for the specialization we need. */
11144 if (type
== NULL_TREE
)
11146 if (is_typedef_decl (t
))
11147 type
= DECL_ORIGINAL_TYPE (t
);
11149 type
= TREE_TYPE (t
);
11151 && VAR_HAD_UNKNOWN_BOUND (t
)
11152 && type
!= error_mark_node
)
11153 type
= strip_array_domain (type
);
11154 type
= tsubst (type
, args
, complain
, in_decl
);
11158 /* Even if the original location is out of scope, the
11159 newly substituted one is not. */
11160 DECL_DEAD_FOR_LOCAL (r
) = 0;
11161 DECL_INITIALIZED_P (r
) = 0;
11162 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11163 if (type
== error_mark_node
)
11164 RETURN (error_mark_node
);
11165 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11167 /* It may seem that this case cannot occur, since:
11172 declares a function, not a variable. However:
11175 template <typename T> void g() { T t; }
11176 template void g<f>();
11178 is an attempt to declare a variable with function
11180 error ("variable %qD has function type",
11181 /* R is not yet sufficiently initialized, so we
11182 just use its name. */
11184 RETURN (error_mark_node
);
11186 type
= complete_type (type
);
11187 /* Wait until cp_finish_decl to set this again, to handle
11188 circular dependency (template/instantiate6.C). */
11189 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11190 type
= check_var_type (DECL_NAME (r
), type
);
11192 if (DECL_HAS_VALUE_EXPR_P (t
))
11194 tree ve
= DECL_VALUE_EXPR (t
);
11195 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11196 /*constant_expression_p=*/false);
11197 if (REFERENCE_REF_P (ve
))
11199 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11200 ve
= TREE_OPERAND (ve
, 0);
11202 SET_DECL_VALUE_EXPR (r
, ve
);
11205 else if (DECL_SELF_REFERENCE_P (t
))
11206 SET_DECL_SELF_REFERENCE_P (r
);
11207 TREE_TYPE (r
) = type
;
11208 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11209 DECL_CONTEXT (r
) = ctx
;
11210 /* Clear out the mangled name and RTL for the instantiation. */
11211 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11212 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11213 SET_DECL_RTL (r
, NULL
);
11214 /* The initializer must not be expanded until it is required;
11215 see [temp.inst]. */
11216 DECL_INITIAL (r
) = NULL_TREE
;
11217 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11218 SET_DECL_RTL (r
, NULL
);
11219 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11222 /* Possibly limit visibility based on template args. */
11223 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11224 if (DECL_VISIBILITY_SPECIFIED (t
))
11226 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11227 DECL_ATTRIBUTES (r
)
11228 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11230 determine_visibility (r
);
11235 /* A static data member declaration is always marked
11236 external when it is declared in-class, even if an
11237 initializer is present. We mimic the non-template
11238 processing here. */
11239 DECL_EXTERNAL (r
) = 1;
11241 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11242 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11243 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11245 else if (!cp_unevaluated_operand
)
11246 register_local_specialization (r
, t
);
11248 DECL_CHAIN (r
) = NULL_TREE
;
11250 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11252 args
, complain
, in_decl
);
11254 /* Preserve a typedef that names a type. */
11255 if (is_typedef_decl (r
))
11257 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11258 set_underlying_type (r
);
11261 layout_decl (r
, 0);
11266 gcc_unreachable ();
11271 /* Restore the file and line information. */
11272 input_location
= saved_loc
;
11277 /* Substitute into the ARG_TYPES of a function type.
11278 If END is a TREE_CHAIN, leave it and any following types
11282 tsubst_arg_types (tree arg_types
,
11285 tsubst_flags_t complain
,
11288 tree remaining_arg_types
;
11289 tree type
= NULL_TREE
;
11291 tree expanded_args
= NULL_TREE
;
11294 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11297 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11298 args
, end
, complain
, in_decl
);
11299 if (remaining_arg_types
== error_mark_node
)
11300 return error_mark_node
;
11302 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11304 /* For a pack expansion, perform substitution on the
11305 entire expression. Later on, we'll handle the arguments
11307 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11308 args
, complain
, in_decl
);
11310 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11311 /* So that we'll spin through the parameters, one by one. */
11312 i
= TREE_VEC_LENGTH (expanded_args
);
11315 /* We only partially substituted into the parameter
11316 pack. Our type is TYPE_PACK_EXPANSION. */
11317 type
= expanded_args
;
11318 expanded_args
= NULL_TREE
;
11326 type
= TREE_VEC_ELT (expanded_args
, i
);
11328 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11330 if (type
== error_mark_node
)
11331 return error_mark_node
;
11332 if (VOID_TYPE_P (type
))
11334 if (complain
& tf_error
)
11336 error ("invalid parameter type %qT", type
);
11338 error ("in declaration %q+D", in_decl
);
11340 return error_mark_node
;
11343 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11344 return error_mark_node
;
11346 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11347 top-level qualifiers as required. */
11348 type
= cv_unqualified (type_decays_to (type
));
11350 /* We do not substitute into default arguments here. The standard
11351 mandates that they be instantiated only when needed, which is
11352 done in build_over_call. */
11353 default_arg
= TREE_PURPOSE (arg_types
);
11355 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11357 /* We've instantiated a template before its default arguments
11358 have been parsed. This can happen for a nested template
11359 class, and is not an error unless we require the default
11360 argument in a call of this function. */
11361 remaining_arg_types
=
11362 tree_cons (default_arg
, type
, remaining_arg_types
);
11363 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11366 remaining_arg_types
=
11367 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11370 return remaining_arg_types
;
11373 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11374 *not* handle the exception-specification for FNTYPE, because the
11375 initial substitution of explicitly provided template parameters
11376 during argument deduction forbids substitution into the
11377 exception-specification:
11381 All references in the function type of the function template to the
11382 corresponding template parameters are replaced by the specified tem-
11383 plate argument values. If a substitution in a template parameter or
11384 in the function type of the function template results in an invalid
11385 type, type deduction fails. [Note: The equivalent substitution in
11386 exception specifications is done only when the function is instanti-
11387 ated, at which point a program is ill-formed if the substitution
11388 results in an invalid type.] */
11391 tsubst_function_type (tree t
,
11393 tsubst_flags_t complain
,
11397 tree arg_types
= NULL_TREE
;
11400 /* The TYPE_CONTEXT is not used for function/method types. */
11401 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11403 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
11405 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
11407 if (late_return_type_p
)
11409 /* Substitute the argument types. */
11410 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11411 complain
, in_decl
);
11412 if (arg_types
== error_mark_node
)
11413 return error_mark_node
;
11415 tree save_ccp
= current_class_ptr
;
11416 tree save_ccr
= current_class_ref
;
11417 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
11418 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
11419 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
11422 /* DR 1207: 'this' is in scope in the trailing return type. */
11423 inject_this_parameter (this_type
, cp_type_quals (this_type
));
11426 /* Substitute the return type. */
11427 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11431 current_class_ptr
= save_ccp
;
11432 current_class_ref
= save_ccr
;
11436 /* Substitute the return type. */
11437 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11439 if (return_type
== error_mark_node
)
11440 return error_mark_node
;
11441 /* DR 486 clarifies that creation of a function type with an
11442 invalid return type is a deduction failure. */
11443 if (TREE_CODE (return_type
) == ARRAY_TYPE
11444 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11446 if (complain
& tf_error
)
11448 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11449 error ("function returning an array");
11451 error ("function returning a function");
11453 return error_mark_node
;
11456 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11457 return error_mark_node
;
11459 if (!late_return_type_p
)
11461 /* Substitute the argument types. */
11462 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11463 complain
, in_decl
);
11464 if (arg_types
== error_mark_node
)
11465 return error_mark_node
;
11468 /* Construct a new type node and return it. */
11469 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11471 fntype
= build_function_type (return_type
, arg_types
);
11472 fntype
= apply_memfn_quals (fntype
,
11473 type_memfn_quals (t
),
11474 type_memfn_rqual (t
));
11478 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11479 /* Don't pick up extra function qualifiers from the basetype. */
11480 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11481 if (! MAYBE_CLASS_TYPE_P (r
))
11485 Type deduction may fail for any of the following
11488 -- Attempting to create "pointer to member of T" when T
11489 is not a class type. */
11490 if (complain
& tf_error
)
11491 error ("creating pointer to member function of non-class type %qT",
11493 return error_mark_node
;
11496 fntype
= build_method_type_directly (r
, return_type
,
11497 TREE_CHAIN (arg_types
));
11498 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11500 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11502 if (late_return_type_p
)
11503 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
11508 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11509 ARGS into that specification, and return the substituted
11510 specification. If there is no specification, return NULL_TREE. */
11513 tsubst_exception_specification (tree fntype
,
11515 tsubst_flags_t complain
,
11522 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11523 new_specs
= NULL_TREE
;
11524 if (specs
&& TREE_PURPOSE (specs
))
11526 /* A noexcept-specifier. */
11527 tree expr
= TREE_PURPOSE (specs
);
11528 if (TREE_CODE (expr
) == INTEGER_CST
)
11532 /* Defer instantiation of noexcept-specifiers to avoid
11533 excessive instantiations (c++/49107). */
11534 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11535 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11537 /* We already partially instantiated this member template,
11538 so combine the new args with the old. */
11539 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11540 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11541 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11542 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11546 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11547 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11551 new_specs
= tsubst_copy_and_build
11552 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11553 /*integral_constant_expression_p=*/true);
11554 new_specs
= build_noexcept_spec (new_specs
, complain
);
11558 if (! TREE_VALUE (specs
))
11565 tree expanded_specs
= NULL_TREE
;
11567 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11569 /* Expand the pack expansion type. */
11570 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11574 if (expanded_specs
== error_mark_node
)
11575 return error_mark_node
;
11576 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11577 len
= TREE_VEC_LENGTH (expanded_specs
);
11580 /* We're substituting into a member template, so
11581 we got a TYPE_PACK_EXPANSION back. Add that
11582 expansion and move on. */
11583 gcc_assert (TREE_CODE (expanded_specs
)
11584 == TYPE_PACK_EXPANSION
);
11585 new_specs
= add_exception_specifier (new_specs
,
11588 specs
= TREE_CHAIN (specs
);
11593 for (i
= 0; i
< len
; ++i
)
11595 if (expanded_specs
)
11596 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11598 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11599 if (spec
== error_mark_node
)
11601 new_specs
= add_exception_specifier (new_specs
, spec
,
11605 specs
= TREE_CHAIN (specs
);
11611 /* Take the tree structure T and replace template parameters used
11612 therein with the argument vector ARGS. IN_DECL is an associated
11613 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11614 Issue error and warning messages under control of COMPLAIN. Note
11615 that we must be relatively non-tolerant of extensions here, in
11616 order to preserve conformance; if we allow substitutions that
11617 should not be allowed, we may allow argument deductions that should
11618 not succeed, and therefore report ambiguous overload situations
11619 where there are none. In theory, we could allow the substitution,
11620 but indicate that it should have failed, and allow our caller to
11621 make sure that the right thing happens, but we don't try to do this
11624 This function is used for dealing with types, decls and the like;
11625 for expressions, use tsubst_expr or tsubst_copy. */
11628 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11630 enum tree_code code
;
11631 tree type
, r
= NULL_TREE
;
11633 if (t
== NULL_TREE
|| t
== error_mark_node
11634 || t
== integer_type_node
11635 || t
== void_type_node
11636 || t
== char_type_node
11637 || t
== unknown_type_node
11638 || TREE_CODE (t
) == NAMESPACE_DECL
11639 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11643 return tsubst_decl (t
, args
, complain
);
11645 if (args
== NULL_TREE
)
11648 code
= TREE_CODE (t
);
11650 if (code
== IDENTIFIER_NODE
)
11651 type
= IDENTIFIER_TYPE_VALUE (t
);
11653 type
= TREE_TYPE (t
);
11655 gcc_assert (type
!= unknown_type_node
);
11657 /* Reuse typedefs. We need to do this to handle dependent attributes,
11658 such as attribute aligned. */
11660 && typedef_variant_p (t
))
11662 tree decl
= TYPE_NAME (t
);
11664 if (alias_template_specialization_p (t
))
11666 /* DECL represents an alias template and we want to
11668 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11669 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11670 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11672 else if (DECL_CLASS_SCOPE_P (decl
)
11673 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11674 && uses_template_parms (DECL_CONTEXT (decl
)))
11676 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11677 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11678 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11680 else if (DECL_FUNCTION_SCOPE_P (decl
)
11681 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11682 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11683 r
= retrieve_local_specialization (decl
);
11685 /* The typedef is from a non-template context. */
11691 r
= cp_build_qualified_type_real
11692 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11693 complain
| tf_ignore_bad_quals
);
11698 /* We don't have an instantiation yet, so drop the typedef. */
11699 int quals
= cp_type_quals (t
);
11700 t
= DECL_ORIGINAL_TYPE (decl
);
11701 t
= cp_build_qualified_type_real (t
, quals
,
11702 complain
| tf_ignore_bad_quals
);
11707 && code
!= TYPENAME_TYPE
11708 && code
!= TEMPLATE_TYPE_PARM
11709 && code
!= IDENTIFIER_NODE
11710 && code
!= FUNCTION_TYPE
11711 && code
!= METHOD_TYPE
)
11712 type
= tsubst (type
, args
, complain
, in_decl
);
11713 if (type
== error_mark_node
)
11714 return error_mark_node
;
11720 case ENUMERAL_TYPE
:
11721 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11722 /*entering_scope=*/0);
11725 case IDENTIFIER_NODE
:
11736 if (t
== integer_type_node
)
11739 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11740 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11744 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11746 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11747 /*integral_constant_expression_p=*/false);
11749 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11751 if (TREE_CODE (max
) == NOP_EXPR
11752 && TREE_SIDE_EFFECTS (omax
)
11753 && !TREE_TYPE (max
))
11754 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11756 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11757 with TREE_SIDE_EFFECTS that indicates this is not an integral
11758 constant expression. */
11759 if (processing_template_decl
11760 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11762 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11763 TREE_SIDE_EFFECTS (max
) = 1;
11766 return compute_array_index_type (NULL_TREE
, max
, complain
);
11769 case TEMPLATE_TYPE_PARM
:
11770 case TEMPLATE_TEMPLATE_PARM
:
11771 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11772 case TEMPLATE_PARM_INDEX
:
11777 tree arg
= NULL_TREE
;
11781 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11782 template_parm_level_and_index (t
, &level
, &idx
);
11784 levels
= TMPL_ARGS_DEPTH (args
);
11785 if (level
<= levels
)
11787 arg
= TMPL_ARG (args
, level
, idx
);
11789 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11791 /* See through ARGUMENT_PACK_SELECT arguments. */
11792 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11793 /* If the selected argument is an expansion E, that most
11794 likely means we were called from
11795 gen_elem_of_pack_expansion_instantiation during the
11796 substituting of pack an argument pack (which Ith
11797 element is a pack expansion, where I is
11798 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11799 In this case, the Ith element resulting from this
11800 substituting is going to be a pack expansion, which
11801 pattern is the pattern of E. Let's return the
11803 gen_elem_of_pack_expansion_instantiation will
11804 build the resulting pack expansion from it. */
11805 if (PACK_EXPANSION_P (arg
))
11806 arg
= PACK_EXPANSION_PATTERN (arg
);
11810 if (arg
== error_mark_node
)
11811 return error_mark_node
;
11812 else if (arg
!= NULL_TREE
)
11814 if (ARGUMENT_PACK_P (arg
))
11815 /* If ARG is an argument pack, we don't actually want to
11816 perform a substitution here, because substitutions
11817 for argument packs are only done
11818 element-by-element. We can get to this point when
11819 substituting the type of a non-type template
11820 parameter pack, when that type actually contains
11821 template parameter packs from an outer template, e.g.,
11823 template<typename... Types> struct A {
11824 template<Types... Values> struct B { };
11828 if (code
== TEMPLATE_TYPE_PARM
)
11831 gcc_assert (TYPE_P (arg
));
11833 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11835 return cp_build_qualified_type_real
11836 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11838 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11840 /* We are processing a type constructed from a
11841 template template parameter. */
11842 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11843 args
, complain
, in_decl
);
11844 if (argvec
== error_mark_node
)
11845 return error_mark_node
;
11847 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11848 || TREE_CODE (arg
) == TEMPLATE_DECL
11849 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11851 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11852 /* Consider this code:
11854 template <template <class> class Template>
11856 template <class Arg> using Bind = Template<Arg>;
11859 template <template <class> class Template, class Arg>
11860 using Instantiate = Template<Arg>; //#0
11862 template <template <class> class Template,
11865 Instantiate<Internal<Template>::template Bind,
11868 When #1 is parsed, the
11869 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11870 parameter `Template' in #0 matches the
11871 UNBOUND_CLASS_TEMPLATE representing the argument
11872 `Internal<Template>::template Bind'; We then want
11873 to assemble the type `Bind<Argument>' that can't
11874 be fully created right now, because
11875 `Internal<Template>' not being complete, the Bind
11876 template cannot be looked up in that context. So
11877 we need to "store" `Bind<Argument>' for later
11878 when the context of Bind becomes complete. Let's
11879 store that in a TYPENAME_TYPE. */
11880 return make_typename_type (TYPE_CONTEXT (arg
),
11881 build_nt (TEMPLATE_ID_EXPR
,
11882 TYPE_IDENTIFIER (arg
),
11887 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11888 are resolving nested-types in the signature of a
11889 member function templates. Otherwise ARG is a
11890 TEMPLATE_DECL and is the real template to be
11892 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11893 arg
= TYPE_NAME (arg
);
11895 r
= lookup_template_class (arg
,
11897 DECL_CONTEXT (arg
),
11898 /*entering_scope=*/0,
11900 return cp_build_qualified_type_real
11901 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
11904 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11905 return convert_from_reference (unshare_expr (arg
));
11909 /* This can happen during the attempted tsubst'ing in
11910 unify. This means that we don't yet have any information
11911 about the template parameter in question. */
11914 /* Early in template argument deduction substitution, we don't
11915 want to reduce the level of 'auto', or it will be confused
11916 with a normal template parm in subsequent deduction. */
11917 if (is_auto (t
) && (complain
& tf_partial
))
11920 /* If we get here, we must have been looking at a parm for a
11921 more deeply nested template. Make a new version of this
11922 template parameter, but with a lower level. */
11925 case TEMPLATE_TYPE_PARM
:
11926 case TEMPLATE_TEMPLATE_PARM
:
11927 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11928 if (cp_type_quals (t
))
11930 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11931 r
= cp_build_qualified_type_real
11932 (r
, cp_type_quals (t
),
11933 complain
| (code
== TEMPLATE_TYPE_PARM
11934 ? tf_ignore_bad_quals
: 0));
11939 TEMPLATE_TYPE_PARM_INDEX (r
)
11940 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11941 r
, levels
, args
, complain
);
11942 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11943 TYPE_MAIN_VARIANT (r
) = r
;
11944 TYPE_POINTER_TO (r
) = NULL_TREE
;
11945 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11947 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11948 /* We have reduced the level of the template
11949 template parameter, but not the levels of its
11950 template parameters, so canonical_type_parameter
11951 will not be able to find the canonical template
11952 template parameter for this level. Thus, we
11953 require structural equality checking to compare
11954 TEMPLATE_TEMPLATE_PARMs. */
11955 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11956 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11957 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11959 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11961 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11963 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11964 complain
, in_decl
);
11965 if (argvec
== error_mark_node
)
11966 return error_mark_node
;
11968 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11969 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
11974 case TEMPLATE_PARM_INDEX
:
11975 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
11979 gcc_unreachable ();
11987 tree purpose
, value
, chain
;
11989 if (t
== void_list_node
)
11992 purpose
= TREE_PURPOSE (t
);
11995 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
11996 if (purpose
== error_mark_node
)
11997 return error_mark_node
;
11999 value
= TREE_VALUE (t
);
12002 value
= tsubst (value
, args
, complain
, in_decl
);
12003 if (value
== error_mark_node
)
12004 return error_mark_node
;
12006 chain
= TREE_CHAIN (t
);
12007 if (chain
&& chain
!= void_type_node
)
12009 chain
= tsubst (chain
, args
, complain
, in_decl
);
12010 if (chain
== error_mark_node
)
12011 return error_mark_node
;
12013 if (purpose
== TREE_PURPOSE (t
)
12014 && value
== TREE_VALUE (t
)
12015 && chain
== TREE_CHAIN (t
))
12017 return hash_tree_cons (purpose
, value
, chain
);
12021 /* We should never be tsubsting a binfo. */
12022 gcc_unreachable ();
12025 /* A vector of template arguments. */
12026 gcc_assert (!type
);
12027 return tsubst_template_args (t
, args
, complain
, in_decl
);
12030 case REFERENCE_TYPE
:
12032 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12037 Type deduction may fail for any of the following
12040 -- Attempting to create a pointer to reference type.
12041 -- Attempting to create a reference to a reference type or
12042 a reference to void.
12044 Core issue 106 says that creating a reference to a reference
12045 during instantiation is no longer a cause for failure. We
12046 only enforce this check in strict C++98 mode. */
12047 if ((TREE_CODE (type
) == REFERENCE_TYPE
12048 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12049 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12051 static location_t last_loc
;
12053 /* We keep track of the last time we issued this error
12054 message to avoid spewing a ton of messages during a
12055 single bad template instantiation. */
12056 if (complain
& tf_error
12057 && last_loc
!= input_location
)
12059 if (VOID_TYPE_P (type
))
12060 error ("forming reference to void");
12061 else if (code
== POINTER_TYPE
)
12062 error ("forming pointer to reference type %qT", type
);
12064 error ("forming reference to reference type %qT", type
);
12065 last_loc
= input_location
;
12068 return error_mark_node
;
12070 else if (TREE_CODE (type
) == FUNCTION_TYPE
12071 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12072 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12074 if (complain
& tf_error
)
12076 if (code
== POINTER_TYPE
)
12077 error ("forming pointer to qualified function type %qT",
12080 error ("forming reference to qualified function type %qT",
12083 return error_mark_node
;
12085 else if (code
== POINTER_TYPE
)
12087 r
= build_pointer_type (type
);
12088 if (TREE_CODE (type
) == METHOD_TYPE
)
12089 r
= build_ptrmemfunc_type (r
);
12091 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12092 /* In C++0x, during template argument substitution, when there is an
12093 attempt to create a reference to a reference type, reference
12094 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12096 "If a template-argument for a template-parameter T names a type
12097 that is a reference to a type A, an attempt to create the type
12098 'lvalue reference to cv T' creates the type 'lvalue reference to
12099 A,' while an attempt to create the type type rvalue reference to
12100 cv T' creates the type T"
12102 r
= cp_build_reference_type
12104 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12106 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12107 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12109 if (cxx_dialect
>= cxx1y
12110 && !(TREE_CODE (t
) == REFERENCE_TYPE
&& REFERENCE_VLA_OK (t
))
12111 && array_of_runtime_bound_p (type
)
12112 && (flag_iso
|| warn_vla
> 0))
12114 if (complain
& tf_warning_or_error
)
12116 (input_location
, OPT_Wvla
,
12117 code
== REFERENCE_TYPE
12118 ? G_("cannot declare reference to array of runtime bound")
12119 : G_("cannot declare pointer to array of runtime bound"));
12121 r
= error_mark_node
;
12124 if (r
!= error_mark_node
)
12125 /* Will this ever be needed for TYPE_..._TO values? */
12132 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12133 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12137 Type deduction may fail for any of the following
12140 -- Attempting to create "pointer to member of T" when T
12141 is not a class type. */
12142 if (complain
& tf_error
)
12143 error ("creating pointer to member of non-class type %qT", r
);
12144 return error_mark_node
;
12146 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12148 if (complain
& tf_error
)
12149 error ("creating pointer to member reference type %qT", type
);
12150 return error_mark_node
;
12152 if (VOID_TYPE_P (type
))
12154 if (complain
& tf_error
)
12155 error ("creating pointer to member of type void");
12156 return error_mark_node
;
12158 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12159 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12161 /* The type of the implicit object parameter gets its
12162 cv-qualifiers from the FUNCTION_TYPE. */
12165 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12166 type_memfn_rqual (type
));
12167 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12168 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12172 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12176 case FUNCTION_TYPE
:
12181 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12182 if (fntype
== error_mark_node
)
12183 return error_mark_node
;
12185 /* Substitute the exception specification. */
12186 specs
= tsubst_exception_specification (t
, args
, complain
,
12187 in_decl
, /*defer_ok*/true);
12188 if (specs
== error_mark_node
)
12189 return error_mark_node
;
12191 fntype
= build_exception_variant (fntype
, specs
);
12196 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12197 if (domain
== error_mark_node
)
12198 return error_mark_node
;
12200 /* As an optimization, we avoid regenerating the array type if
12201 it will obviously be the same as T. */
12202 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12205 /* These checks should match the ones in create_array_type_for_decl.
12209 The deduction may fail for any of the following reasons:
12211 -- Attempting to create an array with an element type that
12212 is void, a function type, or a reference type, or [DR337]
12213 an abstract class type. */
12214 if (VOID_TYPE_P (type
)
12215 || TREE_CODE (type
) == FUNCTION_TYPE
12216 || (TREE_CODE (type
) == ARRAY_TYPE
12217 && TYPE_DOMAIN (type
) == NULL_TREE
)
12218 || TREE_CODE (type
) == REFERENCE_TYPE
)
12220 if (complain
& tf_error
)
12221 error ("creating array of %qT", type
);
12222 return error_mark_node
;
12225 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12226 return error_mark_node
;
12228 r
= build_cplus_array_type (type
, domain
);
12230 if (TYPE_USER_ALIGN (t
))
12232 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12233 TYPE_USER_ALIGN (r
) = 1;
12239 case TYPENAME_TYPE
:
12241 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12242 in_decl
, /*entering_scope=*/1);
12243 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12244 complain
, in_decl
);
12246 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12247 return error_mark_node
;
12249 if (!MAYBE_CLASS_TYPE_P (ctx
))
12251 if (complain
& tf_error
)
12252 error ("%qT is not a class, struct, or union type", ctx
);
12253 return error_mark_node
;
12255 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12257 /* Normally, make_typename_type does not require that the CTX
12258 have complete type in order to allow things like:
12260 template <class T> struct S { typename S<T>::X Y; };
12262 But, such constructs have already been resolved by this
12263 point, so here CTX really should have complete type, unless
12264 it's a partial instantiation. */
12265 ctx
= complete_type (ctx
);
12266 if (!COMPLETE_TYPE_P (ctx
))
12268 if (complain
& tf_error
)
12269 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12270 return error_mark_node
;
12274 f
= make_typename_type (ctx
, f
, typename_type
,
12275 complain
| tf_keep_type_decl
);
12276 if (f
== error_mark_node
)
12278 if (TREE_CODE (f
) == TYPE_DECL
)
12280 complain
|= tf_ignore_bad_quals
;
12284 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12286 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12288 if (complain
& tf_error
)
12289 error ("%qT resolves to %qT, which is not an enumeration type",
12292 return error_mark_node
;
12294 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12296 if (complain
& tf_error
)
12297 error ("%qT resolves to %qT, which is is not a class type",
12300 return error_mark_node
;
12304 return cp_build_qualified_type_real
12305 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12308 case UNBOUND_CLASS_TEMPLATE
:
12310 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12311 in_decl
, /*entering_scope=*/1);
12312 tree name
= TYPE_IDENTIFIER (t
);
12313 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12315 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12316 return error_mark_node
;
12319 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12320 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12327 ++cp_unevaluated_operand
;
12328 ++c_inhibit_evaluation_warnings
;
12330 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12332 /*integral_constant_expression_p=*/false);
12334 --cp_unevaluated_operand
;
12335 --c_inhibit_evaluation_warnings
;
12337 type
= finish_typeof (type
);
12338 return cp_build_qualified_type_real (type
,
12340 | cp_type_quals (type
),
12344 case DECLTYPE_TYPE
:
12348 ++cp_unevaluated_operand
;
12349 ++c_inhibit_evaluation_warnings
;
12351 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12352 complain
|tf_decltype
, in_decl
,
12353 /*function_p*/false,
12354 /*integral_constant_expression*/false);
12356 --cp_unevaluated_operand
;
12357 --c_inhibit_evaluation_warnings
;
12359 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12360 type
= lambda_capture_field_type (type
,
12361 DECLTYPE_FOR_INIT_CAPTURE (t
));
12362 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12363 type
= lambda_proxy_type (type
);
12366 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12367 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12369 /* In a template ~id could be either a complement expression
12370 or an unqualified-id naming a destructor; if instantiating
12371 it produces an expression, it's not an id-expression or
12374 type
= finish_decltype_type (type
, id
, complain
);
12376 return cp_build_qualified_type_real (type
,
12378 | cp_type_quals (type
),
12382 case UNDERLYING_TYPE
:
12384 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12385 complain
, in_decl
);
12386 return finish_underlying_type (type
);
12389 case TYPE_ARGUMENT_PACK
:
12390 case NONTYPE_ARGUMENT_PACK
:
12392 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12394 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12398 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12400 /* For template nontype argument packs, also substitute into
12402 if (code
== NONTYPE_ARGUMENT_PACK
)
12403 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12422 /* We should use one of the expression tsubsts for these codes. */
12423 gcc_unreachable ();
12426 sorry ("use of %qs in template", get_tree_code_name (code
));
12427 return error_mark_node
;
12431 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12432 type of the expression on the left-hand side of the "." or "->"
12436 tsubst_baselink (tree baselink
, tree object_type
,
12437 tree args
, tsubst_flags_t complain
, tree in_decl
)
12440 tree qualifying_scope
;
12443 tree template_args
= 0;
12444 bool template_id_p
= false;
12445 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12447 /* A baselink indicates a function from a base class. Both the
12448 BASELINK_ACCESS_BINFO and the base class referenced may
12449 indicate bases of the template class, rather than the
12450 instantiated class. In addition, lookups that were not
12451 ambiguous before may be ambiguous now. Therefore, we perform
12452 the lookup again. */
12453 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12454 qualifying_scope
= tsubst (qualifying_scope
, args
,
12455 complain
, in_decl
);
12456 fns
= BASELINK_FUNCTIONS (baselink
);
12457 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12458 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12460 template_id_p
= true;
12461 template_args
= TREE_OPERAND (fns
, 1);
12462 fns
= TREE_OPERAND (fns
, 0);
12464 template_args
= tsubst_template_args (template_args
, args
,
12465 complain
, in_decl
);
12467 name
= DECL_NAME (get_first_fn (fns
));
12468 if (IDENTIFIER_TYPENAME_P (name
))
12469 name
= mangle_conv_op_name_for_type (optype
);
12470 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12472 return error_mark_node
;
12474 /* If lookup found a single function, mark it as used at this
12475 point. (If it lookup found multiple functions the one selected
12476 later by overload resolution will be marked as used at that
12478 if (BASELINK_P (baselink
))
12479 fns
= BASELINK_FUNCTIONS (baselink
);
12480 if (!template_id_p
&& !really_overloaded_fn (fns
))
12481 mark_used (OVL_CURRENT (fns
));
12483 /* Add back the template arguments, if present. */
12484 if (BASELINK_P (baselink
) && template_id_p
)
12485 BASELINK_FUNCTIONS (baselink
)
12486 = build_nt (TEMPLATE_ID_EXPR
,
12487 BASELINK_FUNCTIONS (baselink
),
12489 /* Update the conversion operator type. */
12490 BASELINK_OPTYPE (baselink
) = optype
;
12493 object_type
= current_class_type
;
12496 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12502 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12503 true if the qualified-id will be a postfix-expression in-and-of
12504 itself; false if more of the postfix-expression follows the
12505 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12509 tsubst_qualified_id (tree qualified_id
, tree args
,
12510 tsubst_flags_t complain
, tree in_decl
,
12511 bool done
, bool address_p
)
12517 tree template_args
;
12518 location_t loc
= UNKNOWN_LOCATION
;
12520 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12522 /* Figure out what name to look up. */
12523 name
= TREE_OPERAND (qualified_id
, 1);
12524 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12526 is_template
= true;
12527 loc
= EXPR_LOCATION (name
);
12528 template_args
= TREE_OPERAND (name
, 1);
12530 template_args
= tsubst_template_args (template_args
, args
,
12531 complain
, in_decl
);
12532 name
= TREE_OPERAND (name
, 0);
12536 is_template
= false;
12537 template_args
= NULL_TREE
;
12540 /* Substitute into the qualifying scope. When there are no ARGS, we
12541 are just trying to simplify a non-dependent expression. In that
12542 case the qualifying scope may be dependent, and, in any case,
12543 substituting will not help. */
12544 scope
= TREE_OPERAND (qualified_id
, 0);
12547 scope
= tsubst (scope
, args
, complain
, in_decl
);
12548 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12553 if (dependent_scope_p (scope
))
12556 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12557 return build_qualified_name (NULL_TREE
, scope
, expr
,
12558 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12561 if (!BASELINK_P (name
) && !DECL_P (expr
))
12563 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12565 /* A BIT_NOT_EXPR is used to represent a destructor. */
12566 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12568 error ("qualifying type %qT does not match destructor name ~%qT",
12569 scope
, TREE_OPERAND (expr
, 0));
12570 expr
= error_mark_node
;
12573 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12574 /*is_type_p=*/0, false);
12577 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12578 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12579 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12581 if (complain
& tf_error
)
12583 error ("dependent-name %qE is parsed as a non-type, but "
12584 "instantiation yields a type", qualified_id
);
12585 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12587 return error_mark_node
;
12593 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12595 /* Remember that there was a reference to this entity. */
12599 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12601 if (complain
& tf_error
)
12602 qualified_name_lookup_error (scope
,
12603 TREE_OPERAND (qualified_id
, 1),
12604 expr
, input_location
);
12605 return error_mark_node
;
12609 expr
= lookup_template_function (expr
, template_args
);
12611 if (expr
== error_mark_node
&& complain
& tf_error
)
12612 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12613 expr
, input_location
);
12614 else if (TYPE_P (scope
))
12616 expr
= (adjust_result_of_qualified_name_lookup
12617 (expr
, scope
, current_nonlambda_class_type ()));
12618 expr
= (finish_qualified_id_expr
12619 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12620 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12621 /*template_arg_p=*/false, complain
));
12624 /* Expressions do not generally have reference type. */
12625 if (TREE_CODE (expr
) != SCOPE_REF
12626 /* However, if we're about to form a pointer-to-member, we just
12627 want the referenced member referenced. */
12628 && TREE_CODE (expr
) != OFFSET_REF
)
12629 expr
= convert_from_reference (expr
);
12634 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
12635 initializer, DECL is the substituted VAR_DECL. Other arguments are as
12639 tsubst_init (tree init
, tree decl
, tree args
,
12640 tsubst_flags_t complain
, tree in_decl
)
12645 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
12649 /* If we had an initializer but it
12650 instantiated to nothing,
12651 value-initialize the object. This will
12652 only occur when the initializer was a
12653 pack expansion where the parameter packs
12654 used in that expansion were of length
12656 init
= build_value_init (TREE_TYPE (decl
),
12658 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12659 init
= get_target_expr_sfinae (init
, complain
);
12665 /* Like tsubst, but deals with expressions. This function just replaces
12666 template parms; to finish processing the resultant expression, use
12667 tsubst_copy_and_build or tsubst_expr. */
12670 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12672 enum tree_code code
;
12675 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12678 code
= TREE_CODE (t
);
12683 r
= retrieve_local_specialization (t
);
12685 if (r
== NULL_TREE
)
12687 /* We get here for a use of 'this' in an NSDMI. */
12688 if (DECL_NAME (t
) == this_identifier
12689 && current_function_decl
12690 && DECL_CONSTRUCTOR_P (current_function_decl
))
12691 return current_class_ptr
;
12693 /* This can happen for a parameter name used later in a function
12694 declaration (such as in a late-specified return type). Just
12695 make a dummy decl, since it's only used for its type. */
12696 gcc_assert (cp_unevaluated_operand
!= 0);
12697 r
= tsubst_decl (t
, args
, complain
);
12698 /* Give it the template pattern as its context; its true context
12699 hasn't been instantiated yet and this is good enough for
12701 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12704 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12705 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12714 if (DECL_TEMPLATE_PARM_P (t
))
12715 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12716 /* There is no need to substitute into namespace-scope
12718 if (DECL_NAMESPACE_SCOPE_P (t
))
12720 /* If ARGS is NULL, then T is known to be non-dependent. */
12721 if (args
== NULL_TREE
)
12722 return integral_constant_value (t
);
12724 /* Unfortunately, we cannot just call lookup_name here.
12727 template <int I> int f() {
12729 struct S { void g() { E e = a; } };
12732 When we instantiate f<7>::S::g(), say, lookup_name is not
12733 clever enough to find f<7>::a. */
12735 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12736 /*entering_scope=*/0);
12738 for (v
= TYPE_VALUES (enum_type
);
12740 v
= TREE_CHAIN (v
))
12741 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12742 return TREE_VALUE (v
);
12744 /* We didn't find the name. That should never happen; if
12745 name-lookup found it during preliminary parsing, we
12746 should find it again here during instantiation. */
12747 gcc_unreachable ();
12752 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12754 /* Check for a local specialization set up by
12755 tsubst_pack_expansion. */
12756 if (tree r
= retrieve_local_specialization (t
))
12758 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12759 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12763 /* When retrieving a capture pack from a generic lambda, remove the
12764 lambda call op's own template argument list from ARGS. Only the
12765 template arguments active for the closure type should be used to
12766 retrieve the pack specialization. */
12767 if (LAMBDA_FUNCTION_P (current_function_decl
)
12768 && (template_class_depth (DECL_CONTEXT (t
))
12769 != TMPL_ARGS_DEPTH (args
)))
12770 args
= strip_innermost_template_args (args
, 1);
12772 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12773 tsubst_decl put in the hash table. */
12774 return retrieve_specialization (t
, args
, 0);
12777 if (DECL_CONTEXT (t
))
12781 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12782 /*entering_scope=*/1);
12783 if (ctx
!= DECL_CONTEXT (t
))
12785 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12788 if (complain
& tf_error
)
12789 error ("using invalid field %qD", t
);
12790 return error_mark_node
;
12799 case FUNCTION_DECL
:
12800 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12801 r
= tsubst (t
, args
, complain
, in_decl
);
12802 else if (local_variable_p (t
))
12804 r
= retrieve_local_specialization (t
);
12805 if (r
== NULL_TREE
)
12807 /* First try name lookup to find the instantiation. */
12808 r
= lookup_name (DECL_NAME (t
));
12811 /* Make sure that the one we found is the one we want. */
12812 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
12813 complain
, in_decl
);
12814 if (ctx
!= DECL_CONTEXT (r
))
12822 /* This can happen for a variable used in a
12823 late-specified return type of a local lambda, or for a
12824 local static or constant. Building a new VAR_DECL
12825 should be OK in all those cases. */
12826 r
= tsubst_decl (t
, args
, complain
);
12827 if (decl_maybe_constant_var_p (r
))
12829 /* We can't call cp_finish_decl, so handle the
12830 initializer by hand. */
12831 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
12832 complain
, in_decl
);
12833 if (!processing_template_decl
)
12834 init
= maybe_constant_init (init
);
12835 if (processing_template_decl
12836 ? potential_constant_expression (init
)
12837 : reduced_constant_expression_p (init
))
12838 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
12839 = TREE_CONSTANT (r
) = true;
12840 DECL_INITIAL (r
) = init
;
12842 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
12843 || decl_constant_var_p (r
)
12844 || errorcount
|| sorrycount
);
12845 if (!processing_template_decl
)
12847 if (TREE_STATIC (r
))
12848 rest_of_decl_compilation (r
, toplevel_bindings_p (),
12850 else if (decl_constant_var_p (r
))
12851 /* A use of a local constant decays to its value.
12852 FIXME update for core DR 696. */
12853 r
= integral_constant_value (r
);
12856 /* Remember this for subsequent uses. */
12857 if (local_specializations
)
12858 register_local_specialization (r
, t
);
12866 case NAMESPACE_DECL
:
12870 /* An OVERLOAD will always be a non-dependent overload set; an
12871 overload set from function scope will just be represented with an
12872 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12873 gcc_assert (!uses_template_parms (t
));
12877 return tsubst_baselink (t
, current_nonlambda_class_type (),
12878 args
, complain
, in_decl
);
12880 case TEMPLATE_DECL
:
12881 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12882 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12883 args
, complain
, in_decl
);
12884 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12885 return tsubst (t
, args
, complain
, in_decl
);
12886 else if (DECL_CLASS_SCOPE_P (t
)
12887 && uses_template_parms (DECL_CONTEXT (t
)))
12889 /* Template template argument like the following example need
12892 template <template <class> class TT> struct C {};
12893 template <class T> struct D {
12894 template <class U> struct E {};
12899 We are processing the template argument `E' in #1 for
12900 the template instantiation #2. Originally, `E' is a
12901 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12902 have to substitute this with one having context `D<int>'. */
12904 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12905 return lookup_field (context
, DECL_NAME(t
), 0, false);
12908 /* Ordinary template template argument. */
12912 case REINTERPRET_CAST_EXPR
:
12913 case CONST_CAST_EXPR
:
12914 case STATIC_CAST_EXPR
:
12915 case DYNAMIC_CAST_EXPR
:
12916 case IMPLICIT_CONV_EXPR
:
12920 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12921 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12922 return build1 (code
, type
, op0
);
12926 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12929 tree expanded
, op
= TREE_OPERAND (t
, 0);
12932 if (SIZEOF_EXPR_TYPE_P (t
))
12933 op
= TREE_TYPE (op
);
12935 ++cp_unevaluated_operand
;
12936 ++c_inhibit_evaluation_warnings
;
12937 /* We only want to compute the number of arguments. */
12938 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12939 --cp_unevaluated_operand
;
12940 --c_inhibit_evaluation_warnings
;
12942 if (TREE_CODE (expanded
) == TREE_VEC
)
12943 len
= TREE_VEC_LENGTH (expanded
);
12945 if (expanded
== error_mark_node
)
12946 return error_mark_node
;
12947 else if (PACK_EXPANSION_P (expanded
)
12948 || (TREE_CODE (expanded
) == TREE_VEC
12950 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12952 if (TREE_CODE (expanded
) == TREE_VEC
)
12953 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12955 if (TYPE_P (expanded
))
12956 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12957 complain
& tf_error
);
12959 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12960 complain
& tf_error
);
12963 return build_int_cst (size_type_node
, len
);
12965 if (SIZEOF_EXPR_TYPE_P (t
))
12967 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
12968 args
, complain
, in_decl
);
12969 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
12970 r
= build1 (SIZEOF_EXPR
,
12971 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
12972 SIZEOF_EXPR_TYPE_P (r
) = 1;
12979 case TRUTH_NOT_EXPR
:
12982 case UNARY_PLUS_EXPR
: /* Unary + */
12984 case AT_ENCODE_EXPR
:
12988 case REALPART_EXPR
:
12989 case IMAGPART_EXPR
:
12992 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12993 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12994 return build1 (code
, type
, op0
);
12997 case COMPONENT_REF
:
13002 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13003 name
= TREE_OPERAND (t
, 1);
13004 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13006 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13007 complain
, in_decl
);
13008 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13010 else if (TREE_CODE (name
) == SCOPE_REF
13011 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13013 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13014 complain
, in_decl
);
13015 name
= TREE_OPERAND (name
, 1);
13016 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13017 complain
, in_decl
);
13018 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13019 name
= build_qualified_name (/*type=*/NULL_TREE
,
13021 /*template_p=*/false);
13023 else if (BASELINK_P (name
))
13024 name
= tsubst_baselink (name
,
13025 non_reference (TREE_TYPE (object
)),
13029 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13030 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13036 case TRUNC_DIV_EXPR
:
13037 case CEIL_DIV_EXPR
:
13038 case FLOOR_DIV_EXPR
:
13039 case ROUND_DIV_EXPR
:
13040 case EXACT_DIV_EXPR
:
13044 case TRUNC_MOD_EXPR
:
13045 case FLOOR_MOD_EXPR
:
13046 case TRUTH_ANDIF_EXPR
:
13047 case TRUTH_ORIF_EXPR
:
13048 case TRUTH_AND_EXPR
:
13049 case TRUTH_OR_EXPR
:
13062 case COMPOUND_EXPR
:
13065 case PREDECREMENT_EXPR
:
13066 case PREINCREMENT_EXPR
:
13067 case POSTDECREMENT_EXPR
:
13068 case POSTINCREMENT_EXPR
:
13070 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13071 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13072 return build_nt (code
, op0
, op1
);
13077 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13078 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13079 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13080 QUALIFIED_NAME_IS_TEMPLATE (t
));
13085 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13086 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13087 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13092 int n
= VL_EXP_OPERAND_LENGTH (t
);
13093 tree result
= build_vl_exp (CALL_EXPR
, n
);
13095 for (i
= 0; i
< n
; i
++)
13096 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13097 complain
, in_decl
);
13103 case PSEUDO_DTOR_EXPR
:
13104 case VEC_PERM_EXPR
:
13106 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13107 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13108 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13109 r
= build_nt (code
, op0
, op1
, op2
);
13110 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13116 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13117 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13118 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13119 r
= build_nt (code
, op0
, op1
, op2
);
13120 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13126 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13127 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13128 r
= build_nt (code
, op0
, op1
);
13129 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13130 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13134 case TEMPLATE_ID_EXPR
:
13136 /* Substituted template arguments */
13137 tree fn
= TREE_OPERAND (t
, 0);
13138 tree targs
= TREE_OPERAND (t
, 1);
13140 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13142 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13144 return lookup_template_function (fn
, targs
);
13149 tree purpose
, value
, chain
;
13151 if (t
== void_list_node
)
13154 purpose
= TREE_PURPOSE (t
);
13156 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13157 value
= TREE_VALUE (t
);
13159 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13160 chain
= TREE_CHAIN (t
);
13161 if (chain
&& chain
!= void_type_node
)
13162 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13163 if (purpose
== TREE_PURPOSE (t
)
13164 && value
== TREE_VALUE (t
)
13165 && chain
== TREE_CHAIN (t
))
13167 return tree_cons (purpose
, value
, chain
);
13172 case ENUMERAL_TYPE
:
13174 case TEMPLATE_TYPE_PARM
:
13175 case TEMPLATE_TEMPLATE_PARM
:
13176 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13177 case TEMPLATE_PARM_INDEX
:
13179 case REFERENCE_TYPE
:
13181 case FUNCTION_TYPE
:
13184 case TYPENAME_TYPE
:
13185 case UNBOUND_CLASS_TEMPLATE
:
13187 case DECLTYPE_TYPE
:
13189 return tsubst (t
, args
, complain
, in_decl
);
13193 /* Fall through. */
13194 case IDENTIFIER_NODE
:
13195 if (IDENTIFIER_TYPENAME_P (t
))
13197 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13198 return mangle_conv_op_name_for_type (new_type
);
13204 /* This is handled by tsubst_copy_and_build. */
13205 gcc_unreachable ();
13209 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13210 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13211 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13214 case CLEANUP_POINT_EXPR
:
13215 /* We shouldn't have built any of these during initial template
13216 generation. Instead, they should be built during instantiation
13217 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13218 gcc_unreachable ();
13222 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13223 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13224 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13225 r
= build2 (code
, type
, op0
, op1
);
13226 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13227 mark_used (TREE_OPERAND (r
, 1));
13231 case EXPR_PACK_EXPANSION
:
13232 error ("invalid use of pack expansion expression");
13233 return error_mark_node
;
13235 case NONTYPE_ARGUMENT_PACK
:
13236 error ("use %<...%> to expand argument pack");
13237 return error_mark_node
;
13240 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
13248 /* Instantiate any typedefs in the type. */
13249 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13250 r
= fold_convert (type
, t
);
13251 gcc_assert (TREE_CODE (r
) == code
);
13256 /* These can sometimes show up in a partial instantiation, but never
13257 involve template parms. */
13258 gcc_assert (!uses_template_parms (t
));
13262 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13263 gcc_checking_assert (false);
13268 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13271 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13272 tree args
, tsubst_flags_t complain
, tree in_decl
)
13274 tree new_clauses
= NULL
, nc
, oc
;
13276 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13278 nc
= copy_node (oc
);
13279 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13282 switch (OMP_CLAUSE_CODE (nc
))
13284 case OMP_CLAUSE_LASTPRIVATE
:
13285 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13287 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13288 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13289 in_decl
, /*integral_constant_expression_p=*/false);
13290 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13291 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13294 case OMP_CLAUSE_PRIVATE
:
13295 case OMP_CLAUSE_SHARED
:
13296 case OMP_CLAUSE_FIRSTPRIVATE
:
13297 case OMP_CLAUSE_COPYIN
:
13298 case OMP_CLAUSE_COPYPRIVATE
:
13299 case OMP_CLAUSE_IF
:
13300 case OMP_CLAUSE_NUM_THREADS
:
13301 case OMP_CLAUSE_SCHEDULE
:
13302 case OMP_CLAUSE_COLLAPSE
:
13303 case OMP_CLAUSE_FINAL
:
13304 case OMP_CLAUSE_DEPEND
:
13305 case OMP_CLAUSE_FROM
:
13306 case OMP_CLAUSE_TO
:
13307 case OMP_CLAUSE_UNIFORM
:
13308 case OMP_CLAUSE_MAP
:
13309 case OMP_CLAUSE_DEVICE
:
13310 case OMP_CLAUSE_DIST_SCHEDULE
:
13311 case OMP_CLAUSE_NUM_TEAMS
:
13312 case OMP_CLAUSE_THREAD_LIMIT
:
13313 case OMP_CLAUSE_SAFELEN
:
13314 case OMP_CLAUSE_SIMDLEN
:
13315 OMP_CLAUSE_OPERAND (nc
, 0)
13316 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13317 in_decl
, /*integral_constant_expression_p=*/false);
13319 case OMP_CLAUSE_REDUCTION
:
13320 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13322 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13323 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13325 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13326 complain
, in_decl
);
13327 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13328 = build_qualified_name (NULL_TREE
, scope
,
13329 TREE_OPERAND (placeholder
, 1),
13333 gcc_assert (identifier_p (placeholder
));
13335 OMP_CLAUSE_OPERAND (nc
, 0)
13336 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13337 in_decl
, /*integral_constant_expression_p=*/false);
13339 case OMP_CLAUSE_LINEAR
:
13340 case OMP_CLAUSE_ALIGNED
:
13341 OMP_CLAUSE_OPERAND (nc
, 0)
13342 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13343 in_decl
, /*integral_constant_expression_p=*/false);
13344 OMP_CLAUSE_OPERAND (nc
, 1)
13345 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13346 in_decl
, /*integral_constant_expression_p=*/false);
13349 case OMP_CLAUSE_NOWAIT
:
13350 case OMP_CLAUSE_ORDERED
:
13351 case OMP_CLAUSE_DEFAULT
:
13352 case OMP_CLAUSE_UNTIED
:
13353 case OMP_CLAUSE_MERGEABLE
:
13354 case OMP_CLAUSE_INBRANCH
:
13355 case OMP_CLAUSE_NOTINBRANCH
:
13356 case OMP_CLAUSE_PROC_BIND
:
13357 case OMP_CLAUSE_FOR
:
13358 case OMP_CLAUSE_PARALLEL
:
13359 case OMP_CLAUSE_SECTIONS
:
13360 case OMP_CLAUSE_TASKGROUP
:
13363 gcc_unreachable ();
13367 new_clauses
= nreverse (new_clauses
);
13369 new_clauses
= finish_omp_clauses (new_clauses
);
13370 return new_clauses
;
13373 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13376 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13379 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13381 tree purpose
, value
, chain
;
13386 if (TREE_CODE (t
) != TREE_LIST
)
13387 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13388 /*function_p=*/false,
13389 /*integral_constant_expression_p=*/false);
13391 if (t
== void_list_node
)
13394 purpose
= TREE_PURPOSE (t
);
13396 purpose
= RECUR (purpose
);
13397 value
= TREE_VALUE (t
);
13400 if (TREE_CODE (value
) != LABEL_DECL
)
13401 value
= RECUR (value
);
13404 value
= lookup_label (DECL_NAME (value
));
13405 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13406 TREE_USED (value
) = 1;
13409 chain
= TREE_CHAIN (t
);
13410 if (chain
&& chain
!= void_type_node
)
13411 chain
= RECUR (chain
);
13412 return tree_cons (purpose
, value
, chain
);
13416 /* Substitute one OMP_FOR iterator. */
13419 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13420 tree condv
, tree incrv
, tree
*clauses
,
13421 tree args
, tsubst_flags_t complain
, tree in_decl
,
13422 bool integral_constant_expression_p
)
13424 #define RECUR(NODE) \
13425 tsubst_expr ((NODE), args, complain, in_decl, \
13426 integral_constant_expression_p)
13427 tree decl
, init
, cond
, incr
;
13429 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13430 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13431 decl
= TREE_OPERAND (init
, 0);
13432 init
= TREE_OPERAND (init
, 1);
13433 tree decl_expr
= NULL_TREE
;
13434 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13436 /* We need to jump through some hoops to handle declarations in the
13437 for-init-statement, since we might need to handle auto deduction,
13438 but we need to keep control of initialization. */
13440 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13441 decl
= tsubst_decl (decl
, args
, complain
);
13444 decl
= RECUR (decl
);
13445 init
= RECUR (init
);
13447 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13448 if (auto_node
&& init
)
13450 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13452 gcc_assert (!type_dependent_expression_p (decl
));
13454 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13458 /* Declare the variable, but don't let that initialize it. */
13459 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13460 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13462 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13465 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13466 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13467 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13469 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13470 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
13471 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
13472 NOP_EXPR
, rhs
, complain
);
13475 incr
= RECUR (incr
);
13476 TREE_VEC_ELT (declv
, i
) = decl
;
13477 TREE_VEC_ELT (initv
, i
) = init
;
13478 TREE_VEC_ELT (condv
, i
) = cond
;
13479 TREE_VEC_ELT (incrv
, i
) = incr
;
13485 /* Declare and initialize the variable. */
13492 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13494 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13495 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13496 && OMP_CLAUSE_DECL (c
) == decl
)
13498 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13499 && OMP_CLAUSE_DECL (c
) == decl
)
13500 error ("iteration variable %qD should not be firstprivate", decl
);
13501 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13502 && OMP_CLAUSE_DECL (c
) == decl
)
13503 error ("iteration variable %qD should not be reduction", decl
);
13507 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13508 OMP_CLAUSE_DECL (c
) = decl
;
13509 c
= finish_omp_clauses (c
);
13512 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13517 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13518 if (COMPARISON_CLASS_P (cond
))
13520 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
13521 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
13522 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
13525 cond
= RECUR (cond
);
13526 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13527 switch (TREE_CODE (incr
))
13529 case PREINCREMENT_EXPR
:
13530 case PREDECREMENT_EXPR
:
13531 case POSTINCREMENT_EXPR
:
13532 case POSTDECREMENT_EXPR
:
13533 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13534 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13537 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13538 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13540 tree rhs
= TREE_OPERAND (incr
, 1);
13541 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13542 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13543 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13544 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13545 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13549 incr
= RECUR (incr
);
13552 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13553 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13555 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13556 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13557 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13558 TREE_TYPE (decl
), lhs
,
13559 RECUR (TREE_OPERAND (incr
, 2))));
13561 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13562 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13563 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13565 tree rhs
= TREE_OPERAND (incr
, 2);
13566 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13567 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13568 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13569 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13570 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13574 incr
= RECUR (incr
);
13577 incr
= RECUR (incr
);
13581 TREE_VEC_ELT (declv
, i
) = decl
;
13582 TREE_VEC_ELT (initv
, i
) = init
;
13583 TREE_VEC_ELT (condv
, i
) = cond
;
13584 TREE_VEC_ELT (incrv
, i
) = incr
;
13588 /* Like tsubst_copy for expressions, etc. but also does semantic
13592 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13593 bool integral_constant_expression_p
)
13595 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13596 #define RECUR(NODE) \
13597 tsubst_expr ((NODE), args, complain, in_decl, \
13598 integral_constant_expression_p)
13604 if (t
== NULL_TREE
|| t
== error_mark_node
)
13607 loc
= input_location
;
13608 if (EXPR_HAS_LOCATION (t
))
13609 input_location
= EXPR_LOCATION (t
);
13610 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13611 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13613 switch (TREE_CODE (t
))
13615 case STATEMENT_LIST
:
13617 tree_stmt_iterator i
;
13618 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13619 RECUR (tsi_stmt (i
));
13623 case CTOR_INITIALIZER
:
13624 finish_mem_initializers (tsubst_initializer_list
13625 (TREE_OPERAND (t
, 0), args
));
13629 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13633 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13634 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13635 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13637 finish_expr_stmt (tmp
);
13641 do_using_directive (USING_STMT_NAMESPACE (t
));
13646 tree decl
, pattern_decl
;
13649 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13650 if (TREE_CODE (decl
) == LABEL_DECL
)
13651 finish_label_decl (DECL_NAME (decl
));
13652 else if (TREE_CODE (decl
) == USING_DECL
)
13654 tree scope
= USING_DECL_SCOPE (decl
);
13655 tree name
= DECL_NAME (decl
);
13658 scope
= tsubst (scope
, args
, complain
, in_decl
);
13659 decl
= lookup_qualified_name (scope
, name
,
13660 /*is_type_p=*/false,
13661 /*complain=*/false);
13662 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13663 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13665 do_local_using_decl (decl
, scope
, name
);
13667 else if (DECL_PACK_P (decl
))
13669 /* Don't build up decls for a variadic capture proxy, we'll
13670 instantiate the elements directly as needed. */
13675 init
= DECL_INITIAL (decl
);
13676 decl
= tsubst (decl
, args
, complain
, in_decl
);
13677 if (decl
!= error_mark_node
)
13679 /* By marking the declaration as instantiated, we avoid
13680 trying to instantiate it. Since instantiate_decl can't
13681 handle local variables, and since we've already done
13682 all that needs to be done, that's the right thing to
13685 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13687 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13688 /* Anonymous aggregates are a special case. */
13689 finish_anon_union (decl
);
13690 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13692 DECL_CONTEXT (decl
) = current_function_decl
;
13693 if (DECL_NAME (decl
) == this_identifier
)
13695 tree lam
= DECL_CONTEXT (current_function_decl
);
13696 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13697 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13699 insert_capture_proxy (decl
);
13701 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13702 /* We already did a pushtag. */;
13703 else if (TREE_CODE (decl
) == FUNCTION_DECL
13704 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
13705 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
13707 DECL_CONTEXT (decl
) = NULL_TREE
;
13709 DECL_CONTEXT (decl
) = current_function_decl
;
13710 cp_check_omp_declare_reduction (decl
);
13714 int const_init
= false;
13715 maybe_push_decl (decl
);
13717 && DECL_PRETTY_FUNCTION_P (decl
))
13719 /* For __PRETTY_FUNCTION__ we have to adjust the
13721 const char *const name
13722 = cxx_printable_name (current_function_decl
, 2);
13723 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
13726 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
13729 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13731 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13740 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13741 RECUR (FOR_INIT_STMT (t
));
13742 finish_for_init_stmt (stmt
);
13743 tmp
= RECUR (FOR_COND (t
));
13744 finish_for_cond (tmp
, stmt
, false);
13745 tmp
= RECUR (FOR_EXPR (t
));
13746 finish_for_expr (tmp
, stmt
);
13747 RECUR (FOR_BODY (t
));
13748 finish_for_stmt (stmt
);
13751 case RANGE_FOR_STMT
:
13754 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13755 decl
= RANGE_FOR_DECL (t
);
13756 decl
= tsubst (decl
, args
, complain
, in_decl
);
13757 maybe_push_decl (decl
);
13758 expr
= RECUR (RANGE_FOR_EXPR (t
));
13759 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
13760 RECUR (RANGE_FOR_BODY (t
));
13761 finish_for_stmt (stmt
);
13766 stmt
= begin_while_stmt ();
13767 tmp
= RECUR (WHILE_COND (t
));
13768 finish_while_stmt_cond (tmp
, stmt
, false);
13769 RECUR (WHILE_BODY (t
));
13770 finish_while_stmt (stmt
);
13774 stmt
= begin_do_stmt ();
13775 RECUR (DO_BODY (t
));
13776 finish_do_body (stmt
);
13777 tmp
= RECUR (DO_COND (t
));
13778 finish_do_stmt (tmp
, stmt
, false);
13782 stmt
= begin_if_stmt ();
13783 tmp
= RECUR (IF_COND (t
));
13784 finish_if_stmt_cond (tmp
, stmt
);
13785 RECUR (THEN_CLAUSE (t
));
13786 finish_then_clause (stmt
);
13788 if (ELSE_CLAUSE (t
))
13790 begin_else_clause (stmt
);
13791 RECUR (ELSE_CLAUSE (t
));
13792 finish_else_clause (stmt
);
13795 finish_if_stmt (stmt
);
13799 if (BIND_EXPR_BODY_BLOCK (t
))
13800 stmt
= begin_function_body ();
13802 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13803 ? BCS_TRY_BLOCK
: 0);
13805 RECUR (BIND_EXPR_BODY (t
));
13807 if (BIND_EXPR_BODY_BLOCK (t
))
13808 finish_function_body (stmt
);
13810 finish_compound_stmt (stmt
);
13814 finish_break_stmt ();
13817 case CONTINUE_STMT
:
13818 finish_continue_stmt ();
13822 stmt
= begin_switch_stmt ();
13823 tmp
= RECUR (SWITCH_STMT_COND (t
));
13824 finish_switch_cond (tmp
, stmt
);
13825 RECUR (SWITCH_STMT_BODY (t
));
13826 finish_switch_stmt (stmt
);
13829 case CASE_LABEL_EXPR
:
13831 tree low
= RECUR (CASE_LOW (t
));
13832 tree high
= RECUR (CASE_HIGH (t
));
13833 finish_case_label (EXPR_LOCATION (t
), low
, high
);
13839 tree decl
= LABEL_EXPR_LABEL (t
);
13842 label
= finish_label_stmt (DECL_NAME (decl
));
13843 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13844 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13849 tmp
= GOTO_DESTINATION (t
);
13850 if (TREE_CODE (tmp
) != LABEL_DECL
)
13851 /* Computed goto's must be tsubst'd into. On the other hand,
13852 non-computed gotos must not be; the identifier in question
13853 will have no binding. */
13856 tmp
= DECL_NAME (tmp
);
13857 finish_goto_stmt (tmp
);
13862 tree string
= RECUR (ASM_STRING (t
));
13863 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
13864 complain
, in_decl
);
13865 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
13866 complain
, in_decl
);
13867 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
13868 complain
, in_decl
);
13869 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
13870 complain
, in_decl
);
13871 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
13873 tree asm_expr
= tmp
;
13874 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13875 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13876 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13883 stmt
= begin_try_block ();
13884 RECUR (TRY_STMTS (t
));
13885 finish_cleanup_try_block (stmt
);
13886 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13890 tree compound_stmt
= NULL_TREE
;
13892 if (FN_TRY_BLOCK_P (t
))
13893 stmt
= begin_function_try_block (&compound_stmt
);
13895 stmt
= begin_try_block ();
13897 RECUR (TRY_STMTS (t
));
13899 if (FN_TRY_BLOCK_P (t
))
13900 finish_function_try_block (stmt
);
13902 finish_try_block (stmt
);
13904 RECUR (TRY_HANDLERS (t
));
13905 if (FN_TRY_BLOCK_P (t
))
13906 finish_function_handler_sequence (stmt
, compound_stmt
);
13908 finish_handler_sequence (stmt
);
13914 tree decl
= HANDLER_PARMS (t
);
13918 decl
= tsubst (decl
, args
, complain
, in_decl
);
13919 /* Prevent instantiate_decl from trying to instantiate
13920 this variable. We've already done all that needs to be
13922 if (decl
!= error_mark_node
)
13923 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13925 stmt
= begin_handler ();
13926 finish_handler_parms (decl
, stmt
);
13927 RECUR (HANDLER_BODY (t
));
13928 finish_handler (stmt
);
13933 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13934 if (CLASS_TYPE_P (tmp
))
13936 /* Local classes are not independent templates; they are
13937 instantiated along with their containing function. And this
13938 way we don't have to deal with pushing out of one local class
13939 to instantiate a member of another local class. */
13941 /* Closures are handled by the LAMBDA_EXPR. */
13942 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13943 complete_type (tmp
);
13944 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13945 if (!DECL_ARTIFICIAL (fn
))
13946 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13950 case STATIC_ASSERT
:
13954 ++c_inhibit_evaluation_warnings
;
13956 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13959 /*integral_constant_expression_p=*/true);
13960 --c_inhibit_evaluation_warnings
;
13962 finish_static_assert (condition
,
13963 STATIC_ASSERT_MESSAGE (t
),
13964 STATIC_ASSERT_SOURCE_LOCATION (t
),
13965 /*member_p=*/false);
13970 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
13971 args
, complain
, in_decl
);
13972 stmt
= begin_omp_parallel ();
13973 RECUR (OMP_PARALLEL_BODY (t
));
13974 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
13975 = OMP_PARALLEL_COMBINED (t
);
13979 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
13980 args
, complain
, in_decl
);
13981 stmt
= begin_omp_task ();
13982 RECUR (OMP_TASK_BODY (t
));
13983 finish_omp_task (tmp
, stmt
);
13989 case OMP_DISTRIBUTE
:
13991 tree clauses
, body
, pre_body
;
13992 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
13993 tree incrv
= NULL_TREE
;
13996 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
13997 args
, complain
, in_decl
);
13998 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14000 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14001 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14002 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14003 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14006 stmt
= begin_omp_structured_block ();
14008 pre_body
= push_stmt_list ();
14009 RECUR (OMP_FOR_PRE_BODY (t
));
14010 pre_body
= pop_stmt_list (pre_body
);
14012 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14013 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14014 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14015 &clauses
, args
, complain
, in_decl
,
14016 integral_constant_expression_p
);
14018 body
= push_stmt_list ();
14019 RECUR (OMP_FOR_BODY (t
));
14020 body
= pop_stmt_list (body
);
14022 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14023 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14024 condv
, incrv
, body
, pre_body
, clauses
);
14027 t
= make_node (TREE_CODE (t
));
14028 TREE_TYPE (t
) = void_type_node
;
14029 OMP_FOR_BODY (t
) = body
;
14030 OMP_FOR_PRE_BODY (t
) = pre_body
;
14031 OMP_FOR_CLAUSES (t
) = clauses
;
14032 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14036 add_stmt (finish_omp_structured_block (stmt
));
14043 case OMP_TARGET_DATA
:
14045 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14046 args
, complain
, in_decl
);
14047 stmt
= push_stmt_list ();
14048 RECUR (OMP_BODY (t
));
14049 stmt
= pop_stmt_list (stmt
);
14052 OMP_BODY (t
) = stmt
;
14053 OMP_CLAUSES (t
) = tmp
;
14057 case OMP_TARGET_UPDATE
:
14058 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14059 args
, complain
, in_decl
);
14061 OMP_CLAUSES (t
) = tmp
;
14068 case OMP_TASKGROUP
:
14070 stmt
= push_stmt_list ();
14071 RECUR (OMP_BODY (t
));
14072 stmt
= pop_stmt_list (stmt
);
14075 OMP_BODY (t
) = stmt
;
14080 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14081 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14083 tree op1
= TREE_OPERAND (t
, 1);
14084 tree rhs1
= NULL_TREE
;
14086 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14088 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14089 op1
= TREE_OPERAND (op1
, 1);
14091 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14092 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14093 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14094 NULL_TREE
, NULL_TREE
, rhs1
,
14095 OMP_ATOMIC_SEQ_CST (t
));
14099 tree op1
= TREE_OPERAND (t
, 1);
14100 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14101 tree rhs1
= NULL_TREE
;
14102 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14103 enum tree_code opcode
= NOP_EXPR
;
14104 if (code
== OMP_ATOMIC_READ
)
14106 v
= RECUR (TREE_OPERAND (op1
, 0));
14107 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14109 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14110 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14112 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14113 v
= RECUR (TREE_OPERAND (op1
, 0));
14114 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14115 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14117 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14118 op11
= TREE_OPERAND (op11
, 1);
14120 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14121 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14122 opcode
= TREE_CODE (op11
);
14123 if (opcode
== MODIFY_EXPR
)
14129 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14130 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14132 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14133 OMP_ATOMIC_SEQ_CST (t
));
14137 case TRANSACTION_EXPR
:
14140 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14141 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14143 if (TRANSACTION_EXPR_IS_STMT (t
))
14145 tree body
= TRANSACTION_EXPR_BODY (t
);
14146 tree noex
= NULL_TREE
;
14147 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14149 noex
= MUST_NOT_THROW_COND (body
);
14150 if (noex
== NULL_TREE
)
14151 noex
= boolean_true_node
;
14152 body
= TREE_OPERAND (body
, 0);
14154 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14156 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14160 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14161 RECUR (TRANSACTION_EXPR_BODY (t
)),
14168 case MUST_NOT_THROW_EXPR
:
14170 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14171 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14172 RETURN (build_must_not_throw_expr (op0
, cond
));
14175 case EXPR_PACK_EXPANSION
:
14176 error ("invalid use of pack expansion expression");
14177 RETURN (error_mark_node
);
14179 case NONTYPE_ARGUMENT_PACK
:
14180 error ("use %<...%> to expand argument pack");
14181 RETURN (error_mark_node
);
14183 case CILK_SPAWN_STMT
:
14184 cfun
->calls_cilk_spawn
= 1;
14185 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
14187 case CILK_SYNC_STMT
:
14188 RETURN (build_cilk_sync ());
14190 case COMPOUND_EXPR
:
14191 tmp
= RECUR (TREE_OPERAND (t
, 0));
14192 if (tmp
== NULL_TREE
)
14193 /* If the first operand was a statement, we're done with it. */
14194 RETURN (RECUR (TREE_OPERAND (t
, 1)));
14195 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
14196 RECUR (TREE_OPERAND (t
, 1)),
14199 case ANNOTATE_EXPR
:
14200 tmp
= RECUR (TREE_OPERAND (t
, 0));
14201 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
14202 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
14205 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
14207 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14208 /*function_p=*/false,
14209 integral_constant_expression_p
));
14212 RETURN (NULL_TREE
);
14214 input_location
= loc
;
14220 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14221 function. For description of the body see comment above
14222 cp_parser_omp_declare_reduction_exprs. */
14225 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14227 if (t
== NULL_TREE
|| t
== error_mark_node
)
14230 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14232 tree_stmt_iterator tsi
;
14235 memset (stmts
, 0, sizeof stmts
);
14236 for (i
= 0, tsi
= tsi_start (t
);
14237 i
< 7 && !tsi_end_p (tsi
);
14238 i
++, tsi_next (&tsi
))
14239 stmts
[i
] = tsi_stmt (tsi
);
14240 gcc_assert (tsi_end_p (tsi
));
14244 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14245 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14246 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14247 args
, complain
, in_decl
);
14248 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14249 args
, complain
, in_decl
);
14250 DECL_CONTEXT (omp_out
) = current_function_decl
;
14251 DECL_CONTEXT (omp_in
) = current_function_decl
;
14252 keep_next_level (true);
14253 tree block
= begin_omp_structured_block ();
14254 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14255 block
= finish_omp_structured_block (block
);
14256 block
= maybe_cleanup_point_expr_void (block
);
14257 add_decl_expr (omp_out
);
14258 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14259 TREE_NO_WARNING (omp_out
) = 1;
14260 add_decl_expr (omp_in
);
14261 finish_expr_stmt (block
);
14265 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14266 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14267 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14268 args
, complain
, in_decl
);
14269 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14270 args
, complain
, in_decl
);
14271 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14272 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14273 keep_next_level (true);
14274 tree block
= begin_omp_structured_block ();
14275 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14276 block
= finish_omp_structured_block (block
);
14277 block
= maybe_cleanup_point_expr_void (block
);
14278 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14279 add_decl_expr (omp_priv
);
14280 add_decl_expr (omp_orig
);
14281 finish_expr_stmt (block
);
14283 add_decl_expr (omp_orig
);
14287 /* T is a postfix-expression that is not being used in a function
14288 call. Return the substituted version of T. */
14291 tsubst_non_call_postfix_expression (tree t
, tree args
,
14292 tsubst_flags_t complain
,
14295 if (TREE_CODE (t
) == SCOPE_REF
)
14296 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14297 /*done=*/false, /*address_p=*/false);
14299 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14300 /*function_p=*/false,
14301 /*integral_constant_expression_p=*/false);
14306 /* Sentinel to disable certain warnings during template substitution. */
14308 struct warning_sentinel
{
14311 warning_sentinel(int& flag
, bool suppress
=true)
14312 : flag(flag
), val(flag
) { if (suppress
) flag
= 0; }
14313 ~warning_sentinel() { flag
= val
; }
14316 /* Like tsubst but deals with expressions and performs semantic
14317 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14320 tsubst_copy_and_build (tree t
,
14322 tsubst_flags_t complain
,
14325 bool integral_constant_expression_p
)
14327 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14328 #define RECUR(NODE) \
14329 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14330 /*function_p=*/false, \
14331 integral_constant_expression_p)
14336 if (t
== NULL_TREE
|| t
== error_mark_node
)
14339 loc
= input_location
;
14340 if (EXPR_HAS_LOCATION (t
))
14341 input_location
= EXPR_LOCATION (t
);
14343 /* N3276 decltype magic only applies to calls at the top level or on the
14344 right side of a comma. */
14345 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14346 complain
&= ~tf_decltype
;
14348 switch (TREE_CODE (t
))
14352 /* Fall through. */
14353 case IDENTIFIER_NODE
:
14357 bool non_integral_constant_expression_p
;
14358 const char *error_msg
;
14360 if (IDENTIFIER_TYPENAME_P (t
))
14362 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14363 t
= mangle_conv_op_name_for_type (new_type
);
14366 /* Look up the name. */
14367 decl
= lookup_name (t
);
14369 /* By convention, expressions use ERROR_MARK_NODE to indicate
14370 failure, not NULL_TREE. */
14371 if (decl
== NULL_TREE
)
14372 decl
= error_mark_node
;
14374 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14376 integral_constant_expression_p
,
14377 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14378 &non_integral_constant_expression_p
,
14379 /*template_p=*/false,
14381 /*address_p=*/false,
14382 /*template_arg_p=*/false,
14387 if (!function_p
&& identifier_p (decl
))
14389 if (complain
& tf_error
)
14390 unqualified_name_lookup_error (decl
);
14391 decl
= error_mark_node
;
14396 case TEMPLATE_ID_EXPR
:
14399 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14400 tree targs
= TREE_OPERAND (t
, 1);
14403 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14405 if (TREE_CODE (templ
) == COMPONENT_REF
)
14407 object
= TREE_OPERAND (templ
, 0);
14408 templ
= TREE_OPERAND (templ
, 1);
14411 object
= NULL_TREE
;
14412 templ
= lookup_template_function (templ
, targs
);
14415 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14416 object
, templ
, NULL_TREE
));
14418 RETURN (baselink_for_fns (templ
));
14423 tree r
= RECUR (TREE_OPERAND (t
, 0));
14425 if (REFERENCE_REF_P (t
))
14427 /* A type conversion to reference type will be enclosed in
14428 such an indirect ref, but the substitution of the cast
14429 will have also added such an indirect ref. */
14430 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14431 r
= convert_from_reference (r
);
14434 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14435 complain
|decltype_flag
);
14441 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14442 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14443 RETURN (build_nop (type
, op0
));
14446 case IMPLICIT_CONV_EXPR
:
14448 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14449 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14450 int flags
= LOOKUP_IMPLICIT
;
14451 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14452 flags
= LOOKUP_NORMAL
;
14453 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14459 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14460 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14461 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
14465 case REINTERPRET_CAST_EXPR
:
14466 case CONST_CAST_EXPR
:
14467 case DYNAMIC_CAST_EXPR
:
14468 case STATIC_CAST_EXPR
:
14471 tree op
, r
= NULL_TREE
;
14473 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14474 if (integral_constant_expression_p
14475 && !cast_valid_in_integral_constant_expression_p (type
))
14477 if (complain
& tf_error
)
14478 error ("a cast to a type other than an integral or "
14479 "enumeration type cannot appear in a constant-expression");
14480 RETURN (error_mark_node
);
14483 op
= RECUR (TREE_OPERAND (t
, 0));
14485 warning_sentinel
s(warn_useless_cast
);
14486 switch (TREE_CODE (t
))
14489 r
= build_functional_cast (type
, op
, complain
);
14491 case REINTERPRET_CAST_EXPR
:
14492 r
= build_reinterpret_cast (type
, op
, complain
);
14494 case CONST_CAST_EXPR
:
14495 r
= build_const_cast (type
, op
, complain
);
14497 case DYNAMIC_CAST_EXPR
:
14498 r
= build_dynamic_cast (type
, op
, complain
);
14500 case STATIC_CAST_EXPR
:
14501 r
= build_static_cast (type
, op
, complain
);
14504 gcc_unreachable ();
14510 case POSTDECREMENT_EXPR
:
14511 case POSTINCREMENT_EXPR
:
14512 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14513 args
, complain
, in_decl
);
14514 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14515 complain
|decltype_flag
));
14517 case PREDECREMENT_EXPR
:
14518 case PREINCREMENT_EXPR
:
14522 case TRUTH_NOT_EXPR
:
14523 case UNARY_PLUS_EXPR
: /* Unary + */
14524 case REALPART_EXPR
:
14525 case IMAGPART_EXPR
:
14526 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14527 RECUR (TREE_OPERAND (t
, 0)),
14528 complain
|decltype_flag
));
14530 case FIX_TRUNC_EXPR
:
14531 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14535 op1
= TREE_OPERAND (t
, 0);
14536 if (TREE_CODE (op1
) == LABEL_DECL
)
14537 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14538 EXPR_LOCATION (op1
)));
14539 if (TREE_CODE (op1
) == SCOPE_REF
)
14540 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14541 /*done=*/true, /*address_p=*/true);
14543 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14545 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14546 complain
|decltype_flag
));
14551 case TRUNC_DIV_EXPR
:
14552 case CEIL_DIV_EXPR
:
14553 case FLOOR_DIV_EXPR
:
14554 case ROUND_DIV_EXPR
:
14555 case EXACT_DIV_EXPR
:
14559 case TRUNC_MOD_EXPR
:
14560 case FLOOR_MOD_EXPR
:
14561 case TRUTH_ANDIF_EXPR
:
14562 case TRUTH_ORIF_EXPR
:
14563 case TRUTH_AND_EXPR
:
14564 case TRUTH_OR_EXPR
:
14580 warning_sentinel
s1(warn_type_limits
);
14581 warning_sentinel
s2(warn_div_by_zero
);
14582 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14583 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14584 tree r
= build_x_binary_op
14585 (input_location
, TREE_CODE (t
),
14587 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14589 : TREE_CODE (TREE_OPERAND (t
, 0))),
14591 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14593 : TREE_CODE (TREE_OPERAND (t
, 1))),
14595 complain
|decltype_flag
);
14596 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14597 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14602 case POINTER_PLUS_EXPR
:
14604 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14605 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14606 return fold_build_pointer_plus (op0
, op1
);
14610 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14611 /*address_p=*/false));
14613 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14614 args
, complain
, in_decl
);
14615 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14616 RECUR (TREE_OPERAND (t
, 1)),
14617 complain
|decltype_flag
));
14619 case ARRAY_NOTATION_REF
:
14621 tree start_index
, length
, stride
;
14622 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14623 args
, complain
, in_decl
);
14624 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14625 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14626 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14627 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14628 length
, stride
, TREE_TYPE (op1
)));
14631 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14632 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14639 op1
= TREE_OPERAND (t
, 0);
14640 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14641 op1
= TREE_TYPE (op1
);
14644 /* When there are no ARGS, we are trying to evaluate a
14645 non-dependent expression from the parser. Trying to do
14646 the substitutions may not work. */
14648 op1
= TREE_TYPE (op1
);
14652 ++cp_unevaluated_operand
;
14653 ++c_inhibit_evaluation_warnings
;
14655 op1
= tsubst (op1
, args
, complain
, in_decl
);
14657 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14658 /*function_p=*/false,
14659 /*integral_constant_expression_p=*/
14661 --cp_unevaluated_operand
;
14662 --c_inhibit_evaluation_warnings
;
14665 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14666 complain
& tf_error
);
14668 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14669 complain
& tf_error
);
14670 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14672 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14674 if (!processing_template_decl
&& TYPE_P (op1
))
14676 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14677 build1 (NOP_EXPR
, op1
, error_mark_node
));
14678 SIZEOF_EXPR_TYPE_P (r
) = 1;
14681 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14682 TREE_SIDE_EFFECTS (r
) = 0;
14683 TREE_READONLY (r
) = 1;
14685 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14690 case AT_ENCODE_EXPR
:
14692 op1
= TREE_OPERAND (t
, 0);
14693 ++cp_unevaluated_operand
;
14694 ++c_inhibit_evaluation_warnings
;
14695 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14696 /*function_p=*/false,
14697 /*integral_constant_expression_p=*/false);
14698 --cp_unevaluated_operand
;
14699 --c_inhibit_evaluation_warnings
;
14700 RETURN (objc_build_encode_expr (op1
));
14703 case NOEXCEPT_EXPR
:
14704 op1
= TREE_OPERAND (t
, 0);
14705 ++cp_unevaluated_operand
;
14706 ++c_inhibit_evaluation_warnings
;
14707 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14708 /*function_p=*/false,
14709 /*integral_constant_expression_p=*/false);
14710 --cp_unevaluated_operand
;
14711 --c_inhibit_evaluation_warnings
;
14712 RETURN (finish_noexcept_expr (op1
, complain
));
14716 warning_sentinel
s(warn_div_by_zero
);
14717 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
14718 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
14719 tree r
= build_x_modify_expr
14720 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
14721 complain
|decltype_flag
);
14722 /* TREE_NO_WARNING must be set if either the expression was
14723 parenthesized or it uses an operator such as >>= rather
14724 than plain assignment. In the former case, it was already
14725 set and must be copied. In the latter case,
14726 build_x_modify_expr sets it and it must not be reset
14728 if (TREE_NO_WARNING (t
))
14729 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14735 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14736 args
, complain
, in_decl
);
14737 /* Remember that there was a reference to this entity. */
14740 RETURN (build_x_arrow (input_location
, op1
, complain
));
14744 tree placement
= RECUR (TREE_OPERAND (t
, 0));
14745 tree init
= RECUR (TREE_OPERAND (t
, 3));
14746 vec
<tree
, va_gc
> *placement_vec
;
14747 vec
<tree
, va_gc
> *init_vec
;
14750 if (placement
== NULL_TREE
)
14751 placement_vec
= NULL
;
14754 placement_vec
= make_tree_vector ();
14755 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
14756 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
14759 /* If there was an initializer in the original tree, but it
14760 instantiated to an empty list, then we should pass a
14761 non-NULL empty vector to tell build_new that it was an
14762 empty initializer() rather than no initializer. This can
14763 only happen when the initializer is a pack expansion whose
14764 parameter packs are of length zero. */
14765 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
14769 init_vec
= make_tree_vector ();
14770 if (init
== void_node
)
14771 gcc_assert (init_vec
!= NULL
);
14774 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
14775 vec_safe_push (init_vec
, TREE_VALUE (init
));
14779 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14780 tree op2
= RECUR (TREE_OPERAND (t
, 2));
14781 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
14782 NEW_EXPR_USE_GLOBAL (t
),
14785 if (placement_vec
!= NULL
)
14786 release_tree_vector (placement_vec
);
14787 if (init_vec
!= NULL
)
14788 release_tree_vector (init_vec
);
14795 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14796 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14797 RETURN (delete_sanity (op0
, op1
,
14798 DELETE_EXPR_USE_VEC (t
),
14799 DELETE_EXPR_USE_GLOBAL (t
),
14803 case COMPOUND_EXPR
:
14805 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
14806 complain
& ~tf_decltype
, in_decl
,
14807 /*function_p=*/false,
14808 integral_constant_expression_p
);
14809 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
14811 RECUR (TREE_OPERAND (t
, 1)),
14812 complain
|decltype_flag
));
14818 vec
<tree
, va_gc
> *call_args
;
14819 unsigned int nargs
, i
;
14824 function
= CALL_EXPR_FN (t
);
14825 /* When we parsed the expression, we determined whether or
14826 not Koenig lookup should be performed. */
14827 koenig_p
= KOENIG_LOOKUP_P (t
);
14828 if (TREE_CODE (function
) == SCOPE_REF
)
14830 qualified_p
= true;
14831 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
14833 /*address_p=*/false);
14835 else if (koenig_p
&& identifier_p (function
))
14837 /* Do nothing; calling tsubst_copy_and_build on an identifier
14838 would incorrectly perform unqualified lookup again.
14840 Note that we can also have an IDENTIFIER_NODE if the earlier
14841 unqualified lookup found a member function; in that case
14842 koenig_p will be false and we do want to do the lookup
14843 again to find the instantiated member function.
14845 FIXME but doing that causes c++/15272, so we need to stop
14846 using IDENTIFIER_NODE in that situation. */
14847 qualified_p
= false;
14851 if (TREE_CODE (function
) == COMPONENT_REF
)
14853 tree op
= TREE_OPERAND (function
, 1);
14855 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
14856 || (BASELINK_P (op
)
14857 && BASELINK_QUALIFIED_P (op
)));
14860 qualified_p
= false;
14862 if (TREE_CODE (function
) == ADDR_EXPR
14863 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
14864 /* Avoid error about taking the address of a constructor. */
14865 function
= TREE_OPERAND (function
, 0);
14867 function
= tsubst_copy_and_build (function
, args
, complain
,
14870 integral_constant_expression_p
);
14872 if (BASELINK_P (function
))
14873 qualified_p
= true;
14876 nargs
= call_expr_nargs (t
);
14877 call_args
= make_tree_vector ();
14878 for (i
= 0; i
< nargs
; ++i
)
14880 tree arg
= CALL_EXPR_ARG (t
, i
);
14882 if (!PACK_EXPANSION_P (arg
))
14883 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
14886 /* Expand the pack expansion and push each entry onto
14888 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
14889 if (TREE_CODE (arg
) == TREE_VEC
)
14891 unsigned int len
, j
;
14893 len
= TREE_VEC_LENGTH (arg
);
14894 for (j
= 0; j
< len
; ++j
)
14896 tree value
= TREE_VEC_ELT (arg
, j
);
14897 if (value
!= NULL_TREE
)
14898 value
= convert_from_reference (value
);
14899 vec_safe_push (call_args
, value
);
14904 /* A partial substitution. Add one entry. */
14905 vec_safe_push (call_args
, arg
);
14910 /* We do not perform argument-dependent lookup if normal
14911 lookup finds a non-function, in accordance with the
14912 expected resolution of DR 218. */
14914 && ((is_overloaded_fn (function
)
14915 /* If lookup found a member function, the Koenig lookup is
14916 not appropriate, even if an unqualified-name was used
14917 to denote the function. */
14918 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14919 || identifier_p (function
))
14920 /* Only do this when substitution turns a dependent call
14921 into a non-dependent call. */
14922 && type_dependent_expression_p_push (t
)
14923 && !any_type_dependent_arguments_p (call_args
))
14924 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
14926 if (identifier_p (function
)
14927 && !any_type_dependent_arguments_p (call_args
))
14929 if (koenig_p
&& (complain
& tf_warning_or_error
))
14931 /* For backwards compatibility and good diagnostics, try
14932 the unqualified lookup again if we aren't in SFINAE
14934 tree unq
= (tsubst_copy_and_build
14935 (function
, args
, complain
, in_decl
, true,
14936 integral_constant_expression_p
));
14937 if (unq
== error_mark_node
)
14938 RETURN (error_mark_node
);
14940 if (unq
!= function
)
14943 if (INDIRECT_REF_P (fn
))
14944 fn
= TREE_OPERAND (fn
, 0);
14945 if (TREE_CODE (fn
) == COMPONENT_REF
)
14946 fn
= TREE_OPERAND (fn
, 1);
14947 if (is_overloaded_fn (fn
))
14948 fn
= get_first_fn (fn
);
14949 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
14950 "%qD was not declared in this scope, "
14951 "and no declarations were found by "
14952 "argument-dependent lookup at the point "
14953 "of instantiation", function
))
14956 /* Can't say anything more. */;
14957 else if (DECL_CLASS_SCOPE_P (fn
))
14959 location_t loc
= EXPR_LOC_OR_LOC (t
,
14962 "declarations in dependent base %qT are "
14963 "not found by unqualified lookup",
14964 DECL_CLASS_CONTEXT (fn
));
14965 if (current_class_ptr
)
14967 "use %<this->%D%> instead", function
);
14970 "use %<%T::%D%> instead",
14971 current_class_name
, function
);
14974 inform (0, "%q+D declared here, later in the "
14975 "translation unit", fn
);
14980 if (identifier_p (function
))
14982 if (complain
& tf_error
)
14983 unqualified_name_lookup_error (function
);
14984 release_tree_vector (call_args
);
14985 RETURN (error_mark_node
);
14989 /* Remember that there was a reference to this entity. */
14990 if (DECL_P (function
))
14991 mark_used (function
);
14993 /* Put back tf_decltype for the actual call. */
14994 complain
|= decltype_flag
;
14996 if (TREE_CODE (function
) == OFFSET_REF
)
14997 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
14999 else if (TREE_CODE (function
) == COMPONENT_REF
)
15001 tree instance
= TREE_OPERAND (function
, 0);
15002 tree fn
= TREE_OPERAND (function
, 1);
15004 if (processing_template_decl
15005 && (type_dependent_expression_p (instance
)
15006 || (!BASELINK_P (fn
)
15007 && TREE_CODE (fn
) != FIELD_DECL
)
15008 || type_dependent_expression_p (fn
)
15009 || any_type_dependent_arguments_p (call_args
)))
15010 ret
= build_nt_call_vec (function
, call_args
);
15011 else if (!BASELINK_P (fn
))
15012 ret
= finish_call_expr (function
, &call_args
,
15013 /*disallow_virtual=*/false,
15014 /*koenig_p=*/false,
15017 ret
= (build_new_method_call
15019 &call_args
, NULL_TREE
,
15020 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15025 ret
= finish_call_expr (function
, &call_args
,
15026 /*disallow_virtual=*/qualified_p
,
15030 release_tree_vector (call_args
);
15037 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15040 if (TREE_CODE (cond
) == INTEGER_CST
)
15042 if (integer_zerop (cond
))
15044 ++c_inhibit_evaluation_warnings
;
15045 exp1
= RECUR (TREE_OPERAND (t
, 1));
15046 --c_inhibit_evaluation_warnings
;
15047 exp2
= RECUR (TREE_OPERAND (t
, 2));
15051 exp1
= RECUR (TREE_OPERAND (t
, 1));
15052 ++c_inhibit_evaluation_warnings
;
15053 exp2
= RECUR (TREE_OPERAND (t
, 2));
15054 --c_inhibit_evaluation_warnings
;
15059 exp1
= RECUR (TREE_OPERAND (t
, 1));
15060 exp2
= RECUR (TREE_OPERAND (t
, 2));
15063 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15064 cond
, exp1
, exp2
, complain
));
15067 case PSEUDO_DTOR_EXPR
:
15069 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15070 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15071 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15072 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15078 tree purpose
, value
, chain
;
15080 if (t
== void_list_node
)
15083 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15084 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15086 /* We have pack expansions, so expand those and
15087 create a new list out of it. */
15088 tree purposevec
= NULL_TREE
;
15089 tree valuevec
= NULL_TREE
;
15093 /* Expand the argument expressions. */
15094 if (TREE_PURPOSE (t
))
15095 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15096 complain
, in_decl
);
15097 if (TREE_VALUE (t
))
15098 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15099 complain
, in_decl
);
15101 /* Build the rest of the list. */
15102 chain
= TREE_CHAIN (t
);
15103 if (chain
&& chain
!= void_type_node
)
15104 chain
= RECUR (chain
);
15106 /* Determine the number of arguments. */
15107 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15109 len
= TREE_VEC_LENGTH (purposevec
);
15110 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15112 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15113 len
= TREE_VEC_LENGTH (valuevec
);
15116 /* Since we only performed a partial substitution into
15117 the argument pack, we only RETURN (a single list
15119 if (purposevec
== TREE_PURPOSE (t
)
15120 && valuevec
== TREE_VALUE (t
)
15121 && chain
== TREE_CHAIN (t
))
15124 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15127 /* Convert the argument vectors into a TREE_LIST */
15131 /* Grab the Ith values. */
15133 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15136 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15139 /* Build the list (backwards). */
15140 chain
= tree_cons (purpose
, value
, chain
);
15146 purpose
= TREE_PURPOSE (t
);
15148 purpose
= RECUR (purpose
);
15149 value
= TREE_VALUE (t
);
15151 value
= RECUR (value
);
15152 chain
= TREE_CHAIN (t
);
15153 if (chain
&& chain
!= void_type_node
)
15154 chain
= RECUR (chain
);
15155 if (purpose
== TREE_PURPOSE (t
)
15156 && value
== TREE_VALUE (t
)
15157 && chain
== TREE_CHAIN (t
))
15159 RETURN (tree_cons (purpose
, value
, chain
));
15162 case COMPONENT_REF
:
15169 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15170 args
, complain
, in_decl
);
15171 /* Remember that there was a reference to this entity. */
15172 if (DECL_P (object
))
15173 mark_used (object
);
15174 object_type
= TREE_TYPE (object
);
15176 member
= TREE_OPERAND (t
, 1);
15177 if (BASELINK_P (member
))
15178 member
= tsubst_baselink (member
,
15179 non_reference (TREE_TYPE (object
)),
15180 args
, complain
, in_decl
);
15182 member
= tsubst_copy (member
, args
, complain
, in_decl
);
15183 if (member
== error_mark_node
)
15184 RETURN (error_mark_node
);
15186 if (type_dependent_expression_p (object
))
15187 /* We can't do much here. */;
15188 else if (!CLASS_TYPE_P (object_type
))
15190 if (scalarish_type_p (object_type
))
15192 tree s
= NULL_TREE
;
15193 tree dtor
= member
;
15195 if (TREE_CODE (dtor
) == SCOPE_REF
)
15197 s
= TREE_OPERAND (dtor
, 0);
15198 dtor
= TREE_OPERAND (dtor
, 1);
15200 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
15202 dtor
= TREE_OPERAND (dtor
, 0);
15204 RETURN (finish_pseudo_destructor_expr
15205 (object
, s
, dtor
, input_location
));
15209 else if (TREE_CODE (member
) == SCOPE_REF
15210 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
15212 /* Lookup the template functions now that we know what the
15214 tree scope
= TREE_OPERAND (member
, 0);
15215 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
15216 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
15217 member
= lookup_qualified_name (scope
, tmpl
,
15218 /*is_type_p=*/false,
15219 /*complain=*/false);
15220 if (BASELINK_P (member
))
15222 BASELINK_FUNCTIONS (member
)
15223 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
15225 member
= (adjust_result_of_qualified_name_lookup
15226 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15231 qualified_name_lookup_error (scope
, tmpl
, member
,
15233 RETURN (error_mark_node
);
15236 else if (TREE_CODE (member
) == SCOPE_REF
15237 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15238 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15240 if (complain
& tf_error
)
15242 if (TYPE_P (TREE_OPERAND (member
, 0)))
15243 error ("%qT is not a class or namespace",
15244 TREE_OPERAND (member
, 0));
15246 error ("%qD is not a class or namespace",
15247 TREE_OPERAND (member
, 0));
15249 RETURN (error_mark_node
);
15251 else if (TREE_CODE (member
) == FIELD_DECL
)
15253 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15254 if (TREE_CODE (r
) == COMPONENT_REF
)
15255 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15259 r
= finish_class_member_access_expr (object
, member
,
15260 /*template_p=*/false,
15262 if (TREE_CODE (r
) == COMPONENT_REF
)
15263 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15268 RETURN (build_throw
15269 (RECUR (TREE_OPERAND (t
, 0))));
15273 vec
<constructor_elt
, va_gc
> *n
;
15274 constructor_elt
*ce
;
15275 unsigned HOST_WIDE_INT idx
;
15276 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15277 bool process_index_p
;
15279 bool need_copy_p
= false;
15282 if (type
== error_mark_node
)
15283 RETURN (error_mark_node
);
15285 /* digest_init will do the wrong thing if we let it. */
15286 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15289 /* We do not want to process the index of aggregate
15290 initializers as they are identifier nodes which will be
15291 looked up by digest_init. */
15292 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15294 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15295 newlen
= vec_safe_length (n
);
15296 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15298 if (ce
->index
&& process_index_p
15299 /* An identifier index is looked up in the type
15300 being initialized, not the current scope. */
15301 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15302 ce
->index
= RECUR (ce
->index
);
15304 if (PACK_EXPANSION_P (ce
->value
))
15306 /* Substitute into the pack expansion. */
15307 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15310 if (ce
->value
== error_mark_node
15311 || PACK_EXPANSION_P (ce
->value
))
15313 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15314 /* Just move the argument into place. */
15315 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15318 /* Update the length of the final CONSTRUCTOR
15319 arguments vector, and note that we will need to
15321 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15322 need_copy_p
= true;
15326 ce
->value
= RECUR (ce
->value
);
15331 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15333 vec_alloc (n
, newlen
);
15334 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15336 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15338 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15339 for (i
= 0; i
< len
; ++i
)
15340 CONSTRUCTOR_APPEND_ELT (n
, 0,
15341 TREE_VEC_ELT (ce
->value
, i
));
15344 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15348 r
= build_constructor (init_list_type_node
, n
);
15349 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15351 if (TREE_HAS_CONSTRUCTOR (t
))
15352 RETURN (finish_compound_literal (type
, r
, complain
));
15354 TREE_TYPE (r
) = type
;
15360 tree operand_0
= TREE_OPERAND (t
, 0);
15361 if (TYPE_P (operand_0
))
15363 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15364 RETURN (get_typeid (operand_0
, complain
));
15368 operand_0
= RECUR (operand_0
);
15369 RETURN (build_typeid (operand_0
, complain
));
15376 else if (DECL_PACK_P (t
))
15378 /* We don't build decls for an instantiation of a
15379 variadic capture proxy, we instantiate the elements
15381 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15382 return RECUR (DECL_VALUE_EXPR (t
));
15388 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15390 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15391 /* If the original type was a reference, we'll be wrapped in
15392 the appropriate INDIRECT_REF. */
15393 r
= convert_from_reference (r
);
15399 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15400 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15401 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
15404 case OFFSETOF_EXPR
:
15405 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0))));
15409 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15410 complain
, in_decl
);
15412 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15414 type2
= tsubst (type2
, args
, complain
, in_decl
);
15416 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15421 tree old_stmt_expr
= cur_stmt_expr
;
15422 tree stmt_expr
= begin_stmt_expr ();
15424 cur_stmt_expr
= stmt_expr
;
15425 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15426 integral_constant_expression_p
);
15427 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15428 cur_stmt_expr
= old_stmt_expr
;
15430 /* If the resulting list of expression statement is empty,
15431 fold it further into void_node. */
15432 if (empty_expr_stmt_p (stmt_expr
))
15433 stmt_expr
= void_node
;
15435 RETURN (stmt_expr
);
15440 tree r
= build_lambda_expr ();
15442 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15443 LAMBDA_EXPR_CLOSURE (r
) = type
;
15444 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15446 LAMBDA_EXPR_LOCATION (r
)
15447 = LAMBDA_EXPR_LOCATION (t
);
15448 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15449 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15450 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15451 LAMBDA_EXPR_DISCRIMINATOR (r
)
15452 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15453 /* For a function scope, we want to use tsubst so that we don't
15454 complain about referring to an auto function before its return
15455 type has been deduced. Otherwise, we want to use tsubst_copy so
15456 that we look up the existing field/parameter/variable rather
15457 than build a new one. */
15458 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15459 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15460 scope
= tsubst (scope
, args
, complain
, in_decl
);
15461 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15463 /* Look up the parameter we want directly, as tsubst_copy
15464 doesn't do what we need. */
15465 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15466 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15467 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15468 parm
= DECL_CHAIN (parm
);
15470 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15471 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15472 DECL_CONTEXT (scope
) = fn
;
15475 scope
= RECUR (scope
);
15476 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15477 LAMBDA_EXPR_RETURN_TYPE (r
)
15478 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15480 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15481 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15483 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15484 determine_visibility (TYPE_NAME (type
));
15485 /* Now that we know visibility, instantiate the type so we have a
15486 declaration of the op() for later calls to lambda_function. */
15487 complete_type (type
);
15489 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15491 RETURN (build_lambda_object (r
));
15495 /* We can get here for a constant initializer of non-dependent type.
15496 FIXME stop folding in cp_parser_initializer_clause. */
15498 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15503 case TRANSACTION_EXPR
:
15504 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15505 integral_constant_expression_p
));
15508 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15510 case VEC_PERM_EXPR
:
15512 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15513 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15514 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15515 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
15520 /* Handle Objective-C++ constructs, if appropriate. */
15523 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15524 in_decl
, /*function_p=*/false);
15528 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15534 input_location
= loc
;
15538 /* Verify that the instantiated ARGS are valid. For type arguments,
15539 make sure that the type's linkage is ok. For non-type arguments,
15540 make sure they are constants if they are integral or enumerations.
15541 Emit an error under control of COMPLAIN, and return TRUE on error. */
15544 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15546 if (dependent_template_arg_p (t
))
15548 if (ARGUMENT_PACK_P (t
))
15550 tree vec
= ARGUMENT_PACK_ARGS (t
);
15551 int len
= TREE_VEC_LENGTH (vec
);
15552 bool result
= false;
15555 for (i
= 0; i
< len
; ++i
)
15556 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15560 else if (TYPE_P (t
))
15562 /* [basic.link]: A name with no linkage (notably, the name
15563 of a class or enumeration declared in a local scope)
15564 shall not be used to declare an entity with linkage.
15565 This implies that names with no linkage cannot be used as
15568 DR 757 relaxes this restriction for C++0x. */
15569 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15570 : no_linkage_check (t
, /*relaxed_p=*/false));
15574 /* DR 488 makes use of a type with no linkage cause
15575 type deduction to fail. */
15576 if (complain
& tf_error
)
15578 if (TYPE_ANONYMOUS_P (nt
))
15579 error ("%qT is/uses anonymous type", t
);
15581 error ("template argument for %qD uses local type %qT",
15586 /* In order to avoid all sorts of complications, we do not
15587 allow variably-modified types as template arguments. */
15588 else if (variably_modified_type_p (t
, NULL_TREE
))
15590 if (complain
& tf_error
)
15591 error ("%qT is a variably modified type", t
);
15595 /* Class template and alias template arguments should be OK. */
15596 else if (DECL_TYPE_TEMPLATE_P (t
))
15598 /* A non-type argument of integral or enumerated type must be a
15600 else if (TREE_TYPE (t
)
15601 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15602 && !TREE_CONSTANT (t
))
15604 if (complain
& tf_error
)
15605 error ("integral expression %qE is not constant", t
);
15612 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15614 int ix
, len
= DECL_NTPARMS (tmpl
);
15615 bool result
= false;
15617 for (ix
= 0; ix
!= len
; ix
++)
15619 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15622 if (result
&& (complain
& tf_error
))
15623 error (" trying to instantiate %qD", tmpl
);
15627 /* We're out of SFINAE context now, so generate diagnostics for the access
15628 errors we saw earlier when instantiating D from TMPL and ARGS. */
15631 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15633 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15634 tree type
= TREE_TYPE (pattern
);
15635 location_t loc
= input_location
;
15637 push_access_scope (d
);
15638 push_deferring_access_checks (dk_no_deferred
);
15639 input_location
= DECL_SOURCE_LOCATION (pattern
);
15640 tsubst (type
, args
, tf_warning_or_error
, d
);
15641 input_location
= loc
;
15642 pop_deferring_access_checks ();
15643 pop_access_scope (d
);
15646 /* Instantiate the indicated variable, function, or alias template TMPL with
15647 the template arguments in TARG_PTR. */
15650 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15652 tree targ_ptr
= orig_args
;
15656 bool access_ok
= true;
15658 if (tmpl
== error_mark_node
)
15659 return error_mark_node
;
15661 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15663 /* If this function is a clone, handle it specially. */
15664 if (DECL_CLONED_FUNCTION_P (tmpl
))
15669 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15670 DECL_CLONED_FUNCTION. */
15671 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
15672 targ_ptr
, complain
);
15673 if (spec
== error_mark_node
)
15674 return error_mark_node
;
15676 /* Look for the clone. */
15677 FOR_EACH_CLONE (clone
, spec
)
15678 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
15680 /* We should always have found the clone by now. */
15681 gcc_unreachable ();
15685 if (targ_ptr
== error_mark_node
)
15686 return error_mark_node
;
15688 /* Check to see if we already have this specialization. */
15689 gen_tmpl
= most_general_template (tmpl
);
15690 if (tmpl
!= gen_tmpl
)
15691 /* The TMPL is a partial instantiation. To get a full set of
15692 arguments we must add the arguments used to perform the
15693 partial instantiation. */
15694 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
15697 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15698 but it doesn't seem to be on the hot path. */
15699 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
15701 gcc_assert (tmpl
== gen_tmpl
15702 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
15704 || fndecl
== NULL_TREE
);
15706 if (spec
!= NULL_TREE
)
15708 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
15710 if (complain
& tf_error
)
15711 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
15712 return error_mark_node
;
15717 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
15719 return error_mark_node
;
15721 /* We are building a FUNCTION_DECL, during which the access of its
15722 parameters and return types have to be checked. However this
15723 FUNCTION_DECL which is the desired context for access checking
15724 is not built yet. We solve this chicken-and-egg problem by
15725 deferring all checks until we have the FUNCTION_DECL. */
15726 push_deferring_access_checks (dk_deferred
);
15728 /* Instantiation of the function happens in the context of the function
15729 template, not the context of the overload resolution we're doing. */
15730 push_to_top_level ();
15731 /* If there are dependent arguments, e.g. because we're doing partial
15732 ordering, make sure processing_template_decl stays set. */
15733 if (uses_template_parms (targ_ptr
))
15734 ++processing_template_decl
;
15735 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15737 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
15738 complain
, gen_tmpl
);
15739 push_nested_class (ctx
);
15741 /* Substitute template parameters to obtain the specialization. */
15742 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
15743 targ_ptr
, complain
, gen_tmpl
);
15744 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15745 pop_nested_class ();
15746 pop_from_top_level ();
15748 if (fndecl
== error_mark_node
)
15750 pop_deferring_access_checks ();
15751 return error_mark_node
;
15754 /* The DECL_TI_TEMPLATE should always be the immediate parent
15755 template, not the most general template. */
15756 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
15758 /* Now we know the specialization, compute access previously
15760 push_access_scope (fndecl
);
15761 if (!perform_deferred_access_checks (complain
))
15763 pop_access_scope (fndecl
);
15764 pop_deferring_access_checks ();
15766 /* If we've just instantiated the main entry point for a function,
15767 instantiate all the alternate entry points as well. We do this
15768 by cloning the instantiation of the main entry point, not by
15769 instantiating the template clones. */
15770 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
15771 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
15775 if (!(complain
& tf_error
))
15777 /* Remember to reinstantiate when we're out of SFINAE so the user
15778 can see the errors. */
15779 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
15781 return error_mark_node
;
15786 /* Wrapper for instantiate_template_1. */
15789 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15792 timevar_push (TV_TEMPLATE_INST
);
15793 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
15794 timevar_pop (TV_TEMPLATE_INST
);
15798 /* Instantiate the alias template TMPL with ARGS. Also push a template
15799 instantiation level, which instantiate_template doesn't do because
15800 functions and variables have sufficient context established by the
15804 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
15806 struct pending_template
*old_last_pend
= last_pending_template
;
15807 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15808 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
15809 return error_mark_node
;
15810 tree tinst
= build_tree_list (tmpl
, args
);
15811 if (!push_tinst_level (tinst
))
15814 return error_mark_node
;
15818 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
15819 args
, tmpl
, complain
,
15820 /*require_all_args=*/true,
15821 /*use_default_args=*/true);
15823 tree r
= instantiate_template (tmpl
, args
, complain
);
15824 pop_tinst_level ();
15825 /* We can't free this if a pending_template entry or last_error_tinst_level
15826 is pointing at it. */
15827 if (last_pending_template
== old_last_pend
15828 && last_error_tinst_level
== old_error_tinst
)
15834 /* PARM is a template parameter pack for FN. Returns true iff
15835 PARM is used in a deducible way in the argument list of FN. */
15838 pack_deducible_p (tree parm
, tree fn
)
15840 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
15841 for (; t
; t
= TREE_CHAIN (t
))
15843 tree type
= TREE_VALUE (t
);
15845 if (!PACK_EXPANSION_P (type
))
15847 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
15848 packs
; packs
= TREE_CHAIN (packs
))
15849 if (template_args_equal (TREE_VALUE (packs
), parm
))
15851 /* The template parameter pack is used in a function parameter
15852 pack. If this is the end of the parameter list, the
15853 template parameter pack is deducible. */
15854 if (TREE_CHAIN (t
) == void_list_node
)
15857 /* Otherwise, not. Well, it could be deduced from
15858 a non-pack parameter, but doing so would end up with
15859 a deduction mismatch, so don't bother. */
15863 /* The template parameter pack isn't used in any function parameter
15864 packs, but it might be used deeper, e.g. tuple<Args...>. */
15868 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
15869 NARGS elements of the arguments that are being used when calling
15870 it. TARGS is a vector into which the deduced template arguments
15873 Returns either a FUNCTION_DECL for the matching specialization of FN or
15874 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
15875 true, diagnostics will be printed to explain why it failed.
15877 If FN is a conversion operator, or we are trying to produce a specific
15878 specialization, RETURN_TYPE is the return type desired.
15880 The EXPLICIT_TARGS are explicit template arguments provided via a
15883 The parameter STRICT is one of:
15886 We are deducing arguments for a function call, as in
15887 [temp.deduct.call].
15890 We are deducing arguments for a conversion function, as in
15891 [temp.deduct.conv].
15894 We are deducing arguments when doing an explicit instantiation
15895 as in [temp.explicit], when determining an explicit specialization
15896 as in [temp.expl.spec], or when taking the address of a function
15897 template, as in [temp.deduct.funcaddr]. */
15900 fn_type_unification (tree fn
,
15901 tree explicit_targs
,
15904 unsigned int nargs
,
15906 unification_kind_t strict
,
15913 tree decl
= NULL_TREE
;
15914 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
15916 static int deduction_depth
;
15917 struct pending_template
*old_last_pend
= last_pending_template
;
15918 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15919 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
15921 tree r
= error_mark_node
;
15924 complain
|= tf_decltype
;
15926 /* In C++0x, it's possible to have a function template whose type depends
15927 on itself recursively. This is most obvious with decltype, but can also
15928 occur with enumeration scope (c++/48969). So we need to catch infinite
15929 recursion and reject the substitution at deduction time; this function
15930 will return error_mark_node for any repeated substitution.
15932 This also catches excessive recursion such as when f<N> depends on
15933 f<N-1> across all integers, and returns error_mark_node for all the
15934 substitutions back up to the initial one.
15936 This is, of course, not reentrant. */
15937 if (excessive_deduction_depth
)
15938 return error_mark_node
;
15939 tinst
= build_tree_list (fn
, NULL_TREE
);
15942 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
15944 fntype
= TREE_TYPE (fn
);
15945 if (explicit_targs
)
15949 The specified template arguments must match the template
15950 parameters in kind (i.e., type, nontype, template), and there
15951 must not be more arguments than there are parameters;
15952 otherwise type deduction fails.
15954 Nontype arguments must match the types of the corresponding
15955 nontype template parameters, or must be convertible to the
15956 types of the corresponding nontype parameters as specified in
15957 _temp.arg.nontype_, otherwise type deduction fails.
15959 All references in the function type of the function template
15960 to the corresponding template parameters are replaced by the
15961 specified template argument values. If a substitution in a
15962 template parameter or in the function type of the function
15963 template results in an invalid type, type deduction fails. */
15964 int i
, len
= TREE_VEC_LENGTH (tparms
);
15965 location_t loc
= input_location
;
15966 bool incomplete
= false;
15968 /* Adjust any explicit template arguments before entering the
15969 substitution context. */
15971 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
15973 /*require_all_args=*/false,
15974 /*use_default_args=*/false));
15975 if (explicit_targs
== error_mark_node
)
15978 /* Substitute the explicit args into the function type. This is
15979 necessary so that, for instance, explicitly declared function
15980 arguments can match null pointed constants. If we were given
15981 an incomplete set of explicit args, we must not do semantic
15982 processing during substitution as we could create partial
15984 for (i
= 0; i
< len
; i
++)
15986 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15987 bool parameter_pack
= false;
15988 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
15990 /* Dig out the actual parm. */
15991 if (TREE_CODE (parm
) == TYPE_DECL
15992 || TREE_CODE (parm
) == TEMPLATE_DECL
)
15994 parm
= TREE_TYPE (parm
);
15995 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
15997 else if (TREE_CODE (parm
) == PARM_DECL
)
15999 parm
= DECL_INITIAL (parm
);
16000 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16003 if (!parameter_pack
&& targ
== NULL_TREE
)
16004 /* No explicit argument for this template parameter. */
16007 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16009 /* Mark the argument pack as "incomplete". We could
16010 still deduce more arguments during unification.
16011 We remove this mark in type_unification_real. */
16014 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16015 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16016 = ARGUMENT_PACK_ARGS (targ
);
16019 /* We have some incomplete argument packs. */
16024 TREE_VALUE (tinst
) = explicit_targs
;
16025 if (!push_tinst_level (tinst
))
16027 excessive_deduction_depth
= true;
16030 processing_template_decl
+= incomplete
;
16031 input_location
= DECL_SOURCE_LOCATION (fn
);
16032 /* Ignore any access checks; we'll see them again in
16033 instantiate_template and they might have the wrong
16034 access path at this point. */
16035 push_deferring_access_checks (dk_deferred
);
16036 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16037 complain
| tf_partial
, NULL_TREE
);
16038 pop_deferring_access_checks ();
16039 input_location
= loc
;
16040 processing_template_decl
-= incomplete
;
16041 pop_tinst_level ();
16043 if (fntype
== error_mark_node
)
16046 /* Place the explicitly specified arguments in TARGS. */
16047 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16048 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16051 /* Never do unification on the 'this' parameter. */
16052 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16058 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16059 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16060 new_args
[0] = return_type
;
16061 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16066 /* We allow incomplete unification without an error message here
16067 because the standard doesn't seem to explicitly prohibit it. Our
16068 callers must be ready to deal with unification failures in any
16071 TREE_VALUE (tinst
) = targs
;
16072 /* If we aren't explaining yet, push tinst context so we can see where
16073 any errors (e.g. from class instantiations triggered by instantiation
16074 of default template arguments) come from. If we are explaining, this
16075 context is redundant. */
16076 if (!explain_p
&& !push_tinst_level (tinst
))
16078 excessive_deduction_depth
= true;
16082 /* type_unification_real will pass back any access checks from default
16083 template argument substitution. */
16084 vec
<deferred_access_check
, va_gc
> *checks
;
16087 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16088 targs
, parms
, args
, nargs
, /*subr=*/0,
16089 strict
, flags
, &checks
, explain_p
);
16091 pop_tinst_level ();
16095 /* Now that we have bindings for all of the template arguments,
16096 ensure that the arguments deduced for the template template
16097 parameters have compatible template parameter lists. We cannot
16098 check this property before we have deduced all template
16099 arguments, because the template parameter types of a template
16100 template parameter might depend on prior template parameters
16101 deduced after the template template parameter. The following
16102 ill-formed example illustrates this issue:
16104 template<typename T, template<T> class C> void f(C<5>, T);
16106 template<int N> struct X {};
16109 f(X<5>(), 5l); // error: template argument deduction fails
16112 The template parameter list of 'C' depends on the template type
16113 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16114 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16115 time that we deduce 'C'. */
16116 if (!template_template_parm_bindings_ok_p
16117 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
16119 unify_inconsistent_template_template_parameters (explain_p
);
16123 /* All is well so far. Now, check:
16127 When all template arguments have been deduced, all uses of
16128 template parameters in nondeduced contexts are replaced with
16129 the corresponding deduced argument values. If the
16130 substitution results in an invalid type, as described above,
16131 type deduction fails. */
16132 TREE_VALUE (tinst
) = targs
;
16133 if (!push_tinst_level (tinst
))
16135 excessive_deduction_depth
= true;
16139 /* Also collect access checks from the instantiation. */
16140 reopen_deferring_access_checks (checks
);
16142 decl
= instantiate_template (fn
, targs
, complain
);
16144 checks
= get_deferred_access_checks ();
16145 pop_deferring_access_checks ();
16147 pop_tinst_level ();
16149 if (decl
== error_mark_node
)
16152 /* Now perform any access checks encountered during substitution. */
16153 push_access_scope (decl
);
16154 ok
= perform_access_checks (checks
, complain
);
16155 pop_access_scope (decl
);
16159 /* If we're looking for an exact match, check that what we got
16160 is indeed an exact match. It might not be if some template
16161 parameters are used in non-deduced contexts. But don't check
16162 for an exact match if we have dependent template arguments;
16163 in that case we're doing partial ordering, and we already know
16164 that we have two candidates that will provide the actual type. */
16165 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
16167 tree substed
= TREE_TYPE (decl
);
16171 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
16173 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
16174 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
16175 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
16177 unify_type_mismatch (explain_p
, args
[i
],
16178 TREE_VALUE (sarg
));
16187 if (excessive_deduction_depth
)
16189 if (deduction_depth
== 0)
16190 /* Reset once we're all the way out. */
16191 excessive_deduction_depth
= false;
16194 /* We can't free this if a pending_template entry or last_error_tinst_level
16195 is pointing at it. */
16196 if (last_pending_template
== old_last_pend
16197 && last_error_tinst_level
== old_error_tinst
)
16203 /* Adjust types before performing type deduction, as described in
16204 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16205 sections are symmetric. PARM is the type of a function parameter
16206 or the return type of the conversion function. ARG is the type of
16207 the argument passed to the call, or the type of the value
16208 initialized with the result of the conversion function.
16209 ARG_EXPR is the original argument expression, which may be null. */
16212 maybe_adjust_types_for_deduction (unification_kind_t strict
,
16226 /* Swap PARM and ARG throughout the remainder of this
16227 function; the handling is precisely symmetric since PARM
16228 will initialize ARG rather than vice versa. */
16236 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16237 too, but here handle it by stripping the reference from PARM
16238 rather than by adding it to ARG. */
16239 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16240 && TYPE_REF_IS_RVALUE (*parm
)
16241 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16242 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16243 && TREE_CODE (*arg
) == REFERENCE_TYPE
16244 && !TYPE_REF_IS_RVALUE (*arg
))
16245 *parm
= TREE_TYPE (*parm
);
16246 /* Nothing else to do in this case. */
16250 gcc_unreachable ();
16253 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16255 /* [temp.deduct.call]
16257 If P is not a reference type:
16259 --If A is an array type, the pointer type produced by the
16260 array-to-pointer standard conversion (_conv.array_) is
16261 used in place of A for type deduction; otherwise,
16263 --If A is a function type, the pointer type produced by
16264 the function-to-pointer standard conversion
16265 (_conv.func_) is used in place of A for type deduction;
16268 --If A is a cv-qualified type, the top level
16269 cv-qualifiers of A's type are ignored for type
16271 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16272 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16273 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16274 *arg
= build_pointer_type (*arg
);
16276 *arg
= TYPE_MAIN_VARIANT (*arg
);
16279 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16280 of the form T&&, where T is a template parameter, and the argument
16281 is an lvalue, T is deduced as A& */
16282 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16283 && TYPE_REF_IS_RVALUE (*parm
)
16284 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16285 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16286 && (arg_expr
? real_lvalue_p (arg_expr
)
16287 /* try_one_overload doesn't provide an arg_expr, but
16288 functions are always lvalues. */
16289 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16290 *arg
= build_reference_type (*arg
);
16292 /* [temp.deduct.call]
16294 If P is a cv-qualified type, the top level cv-qualifiers
16295 of P's type are ignored for type deduction. If P is a
16296 reference type, the type referred to by P is used for
16298 *parm
= TYPE_MAIN_VARIANT (*parm
);
16299 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16301 *parm
= TREE_TYPE (*parm
);
16302 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16305 /* DR 322. For conversion deduction, remove a reference type on parm
16306 too (which has been swapped into ARG). */
16307 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16308 *arg
= TREE_TYPE (*arg
);
16313 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16314 template which does contain any deducible template parameters; check if
16315 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16316 unify_one_argument. */
16319 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16320 int flags
, bool explain_p
)
16325 type
= TREE_TYPE (arg
);
16329 if (same_type_p (parm
, type
))
16330 return unify_success (explain_p
);
16332 if (strict
== DEDUCE_CONV
)
16334 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16335 explain_p
? tf_warning_or_error
: tf_none
))
16336 return unify_success (explain_p
);
16338 else if (strict
!= DEDUCE_EXACT
)
16340 if (can_convert_arg (parm
, type
,
16341 TYPE_P (arg
) ? NULL_TREE
: arg
,
16342 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16343 return unify_success (explain_p
);
16346 if (strict
== DEDUCE_EXACT
)
16347 return unify_type_mismatch (explain_p
, parm
, arg
);
16349 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16352 static bool uses_deducible_template_parms (tree type
);
16354 /* Returns true iff the expression EXPR is one from which a template
16355 argument can be deduced. In other words, if it's an undecorated
16356 use of a template non-type parameter. */
16359 deducible_expression (tree expr
)
16361 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16364 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16365 deducible way; that is, if it has a max value of <PARM> - 1. */
16368 deducible_array_bound (tree domain
)
16370 if (domain
== NULL_TREE
)
16373 tree max
= TYPE_MAX_VALUE (domain
);
16374 if (TREE_CODE (max
) != MINUS_EXPR
)
16377 return deducible_expression (TREE_OPERAND (max
, 0));
16380 /* Returns true iff the template arguments ARGS use a template parameter
16381 in a deducible way. */
16384 deducible_template_args (tree args
)
16386 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16389 tree elt
= TREE_VEC_ELT (args
, i
);
16390 if (ARGUMENT_PACK_P (elt
))
16391 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16394 if (PACK_EXPANSION_P (elt
))
16395 elt
= PACK_EXPANSION_PATTERN (elt
);
16396 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16398 else if (TYPE_P (elt
))
16399 deducible
= uses_deducible_template_parms (elt
);
16401 deducible
= deducible_expression (elt
);
16409 /* Returns true iff TYPE contains any deducible references to template
16410 parameters, as per 14.8.2.5. */
16413 uses_deducible_template_parms (tree type
)
16415 if (PACK_EXPANSION_P (type
))
16416 type
= PACK_EXPANSION_PATTERN (type
);
16423 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16424 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16430 if (POINTER_TYPE_P (type
))
16431 return uses_deducible_template_parms (TREE_TYPE (type
));
16433 /* T[integer-constant ]
16435 if (TREE_CODE (type
) == ARRAY_TYPE
)
16436 return (uses_deducible_template_parms (TREE_TYPE (type
))
16437 || deducible_array_bound (TYPE_DOMAIN (type
)));
16449 if (TYPE_PTRMEM_P (type
))
16450 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16451 || (uses_deducible_template_parms
16452 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16454 /* template-name <T> (where template-name refers to a class template)
16455 template-name <i> (where template-name refers to a class template) */
16456 if (CLASS_TYPE_P (type
)
16457 && CLASSTYPE_TEMPLATE_INFO (type
)
16458 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16459 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16460 (CLASSTYPE_TI_ARGS (type
)));
16465 if (TREE_CODE (type
) == FUNCTION_TYPE
16466 || TREE_CODE (type
) == METHOD_TYPE
)
16468 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16470 tree parm
= TYPE_ARG_TYPES (type
);
16471 if (TREE_CODE (type
) == METHOD_TYPE
)
16472 parm
= TREE_CHAIN (parm
);
16473 for (; parm
; parm
= TREE_CHAIN (parm
))
16474 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16481 /* Subroutine of type_unification_real and unify_pack_expansion to
16482 handle unification of a single P/A pair. Parameters are as
16483 for those functions. */
16486 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16487 int subr
, unification_kind_t strict
, int flags
,
16490 tree arg_expr
= NULL_TREE
;
16493 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16494 return unify_invalid (explain_p
);
16495 if (arg
== unknown_type_node
)
16496 /* We can't deduce anything from this, but we might get all the
16497 template args from other function args. */
16498 return unify_success (explain_p
);
16500 /* Implicit conversions (Clause 4) will be performed on a function
16501 argument to convert it to the type of the corresponding function
16502 parameter if the parameter type contains no template-parameters that
16503 participate in template argument deduction. */
16504 if (TYPE_P (parm
) && !uses_template_parms (parm
))
16505 /* For function parameters that contain no template-parameters at all,
16506 we have historically checked for convertibility in order to shortcut
16507 consideration of this candidate. */
16508 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
16510 else if (strict
== DEDUCE_CALL
16511 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16512 /* For function parameters with only non-deducible template parameters,
16514 return unify_success (explain_p
);
16519 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16520 | UNIFY_ALLOW_MORE_CV_QUAL
16521 | UNIFY_ALLOW_DERIVED
);
16525 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16529 arg_strict
= UNIFY_ALLOW_NONE
;
16533 gcc_unreachable ();
16536 /* We only do these transformations if this is the top-level
16537 parameter_type_list in a call or declaration matching; in other
16538 situations (nested function declarators, template argument lists) we
16539 won't be comparing a type to an expression, and we don't do any type
16545 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16546 if (type_unknown_p (arg
))
16548 /* [temp.deduct.type] A template-argument can be
16549 deduced from a pointer to function or pointer
16550 to member function argument if the set of
16551 overloaded functions does not contain function
16552 templates and at most one of a set of
16553 overloaded functions provides a unique
16556 if (resolve_overloaded_unification
16557 (tparms
, targs
, parm
, arg
, strict
,
16558 arg_strict
, explain_p
))
16559 return unify_success (explain_p
);
16560 return unify_overload_resolution_failure (explain_p
, arg
);
16564 arg
= unlowered_expr_type (arg
);
16565 if (arg
== error_mark_node
)
16566 return unify_invalid (explain_p
);
16570 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16573 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16574 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
16575 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16577 /* For deduction from an init-list we need the actual list. */
16578 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16580 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16583 /* Most parms like fn_type_unification.
16585 If SUBR is 1, we're being called recursively (to unify the
16586 arguments of a function or method parameter of a function
16589 CHECKS is a pointer to a vector of access checks encountered while
16590 substituting default template arguments. */
16593 type_unification_real (tree tparms
,
16597 unsigned int xnargs
,
16599 unification_kind_t strict
,
16601 vec
<deferred_access_check
, va_gc
> **checks
,
16606 int ntparms
= TREE_VEC_LENGTH (tparms
);
16607 int saw_undeduced
= 0;
16610 unsigned int nargs
;
16613 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16614 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16615 gcc_assert (ntparms
> 0);
16617 /* Reset the number of non-defaulted template arguments contained
16619 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16627 while (parms
&& parms
!= void_list_node
16630 parm
= TREE_VALUE (parms
);
16632 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16633 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16634 /* For a function parameter pack that occurs at the end of the
16635 parameter-declaration-list, the type A of each remaining
16636 argument of the call is compared with the type P of the
16637 declarator-id of the function parameter pack. */
16640 parms
= TREE_CHAIN (parms
);
16642 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16643 /* For a function parameter pack that does not occur at the
16644 end of the parameter-declaration-list, the type of the
16645 parameter pack is a non-deduced context. */
16651 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16657 && parms
!= void_list_node
16658 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16660 /* Unify the remaining arguments with the pack expansion type. */
16662 tree parmvec
= make_tree_vec (1);
16664 /* Allocate a TREE_VEC and copy in all of the arguments */
16665 argvec
= make_tree_vec (nargs
- ia
);
16666 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
16667 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
16669 /* Copy the parameter into parmvec. */
16670 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
16671 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
16672 /*subr=*/subr
, explain_p
))
16675 /* Advance to the end of the list of parameters. */
16676 parms
= TREE_CHAIN (parms
);
16679 /* Fail if we've reached the end of the parm list, and more args
16680 are present, and the parm list isn't variadic. */
16681 if (ia
< nargs
&& parms
== void_list_node
)
16682 return unify_too_many_arguments (explain_p
, nargs
, ia
);
16683 /* Fail if parms are left and they don't have default values and
16684 they aren't all deduced as empty packs (c++/57397). This is
16685 consistent with sufficient_parms_p. */
16686 if (parms
&& parms
!= void_list_node
16687 && TREE_PURPOSE (parms
) == NULL_TREE
)
16689 unsigned int count
= nargs
;
16694 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
16697 p
= TREE_CHAIN (p
);
16699 while (p
&& p
!= void_list_node
);
16700 if (count
!= nargs
)
16701 return unify_too_few_arguments (explain_p
, ia
, count
,
16707 tsubst_flags_t complain
= (explain_p
16708 ? tf_warning_or_error
16711 for (i
= 0; i
< ntparms
; i
++)
16713 tree targ
= TREE_VEC_ELT (targs
, i
);
16714 tree tparm
= TREE_VEC_ELT (tparms
, i
);
16716 /* Clear the "incomplete" flags on all argument packs now so that
16717 substituting them into later default arguments works. */
16718 if (targ
&& ARGUMENT_PACK_P (targ
))
16720 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
16721 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
16724 if (targ
|| tparm
== error_mark_node
)
16726 tparm
= TREE_VALUE (tparm
);
16728 /* If this is an undeduced nontype parameter that depends on
16729 a type parameter, try another pass; its type may have been
16730 deduced from a later argument than the one from which
16731 this parameter can be deduced. */
16732 if (TREE_CODE (tparm
) == PARM_DECL
16733 && uses_template_parms (TREE_TYPE (tparm
))
16734 && !saw_undeduced
++)
16737 /* Core issue #226 (C++0x) [temp.deduct]:
16739 If a template argument has not been deduced, its
16740 default template argument, if any, is used.
16742 When we are in C++98 mode, TREE_PURPOSE will either
16743 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16744 to explicitly check cxx_dialect here. */
16745 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
16747 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16748 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
16749 reopen_deferring_access_checks (*checks
);
16750 location_t save_loc
= input_location
;
16752 input_location
= DECL_SOURCE_LOCATION (parm
);
16753 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
16754 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
16756 input_location
= save_loc
;
16757 *checks
= get_deferred_access_checks ();
16758 pop_deferring_access_checks ();
16759 if (arg
== error_mark_node
)
16763 TREE_VEC_ELT (targs
, i
) = arg
;
16764 /* The position of the first default template argument,
16765 is also the number of non-defaulted arguments in TARGS.
16767 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16768 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
16773 /* If the type parameter is a parameter pack, then it will
16774 be deduced to an empty parameter pack. */
16775 if (template_parameter_pack_p (tparm
))
16779 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
16781 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
16782 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
16783 TREE_CONSTANT (arg
) = 1;
16786 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16788 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
16790 TREE_VEC_ELT (targs
, i
) = arg
;
16794 return unify_parameter_deduction_failure (explain_p
, tparm
);
16797 #ifdef ENABLE_CHECKING
16798 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16799 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
16802 return unify_success (explain_p
);
16805 /* Subroutine of type_unification_real. Args are like the variables
16806 at the call site. ARG is an overloaded function (or template-id);
16807 we try deducing template args from each of the overloads, and if
16808 only one succeeds, we go with that. Modifies TARGS and returns
16809 true on success. */
16812 resolve_overloaded_unification (tree tparms
,
16816 unification_kind_t strict
,
16820 tree tempargs
= copy_node (targs
);
16822 tree goodfn
= NULL_TREE
;
16825 if (TREE_CODE (arg
) == ADDR_EXPR
)
16827 arg
= TREE_OPERAND (arg
, 0);
16833 if (TREE_CODE (arg
) == COMPONENT_REF
)
16834 /* Handle `&x' where `x' is some static or non-static member
16836 arg
= TREE_OPERAND (arg
, 1);
16838 if (TREE_CODE (arg
) == OFFSET_REF
)
16839 arg
= TREE_OPERAND (arg
, 1);
16841 /* Strip baselink information. */
16842 if (BASELINK_P (arg
))
16843 arg
= BASELINK_FUNCTIONS (arg
);
16845 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
16847 /* If we got some explicit template args, we need to plug them into
16848 the affected templates before we try to unify, in case the
16849 explicit args will completely resolve the templates in question. */
16852 tree expl_subargs
= TREE_OPERAND (arg
, 1);
16853 arg
= TREE_OPERAND (arg
, 0);
16855 for (; arg
; arg
= OVL_NEXT (arg
))
16857 tree fn
= OVL_CURRENT (arg
);
16858 tree subargs
, elem
;
16860 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16863 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16864 expl_subargs
, NULL_TREE
, tf_none
,
16865 /*require_all_args=*/true,
16866 /*use_default_args=*/true);
16867 if (subargs
!= error_mark_node
16868 && !any_dependent_template_arguments_p (subargs
))
16870 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
16871 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16872 elem
, strict
, sub_strict
, addr_p
, explain_p
)
16873 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
16882 /* If no templates (or more than one) are fully resolved by the
16883 explicit arguments, this template-id is a non-deduced context; it
16884 could still be OK if we deduce all template arguments for the
16885 enclosing call through other arguments. */
16889 else if (TREE_CODE (arg
) != OVERLOAD
16890 && TREE_CODE (arg
) != FUNCTION_DECL
)
16891 /* If ARG is, for example, "(0, &f)" then its type will be unknown
16892 -- but the deduction does not succeed because the expression is
16893 not just the function on its own. */
16896 for (; arg
; arg
= OVL_NEXT (arg
))
16897 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16898 TREE_TYPE (OVL_CURRENT (arg
)),
16899 strict
, sub_strict
, addr_p
, explain_p
)
16900 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
16902 goodfn
= OVL_CURRENT (arg
);
16906 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16907 to function or pointer to member function argument if the set of
16908 overloaded functions does not contain function templates and at most
16909 one of a set of overloaded functions provides a unique match.
16911 So if we found multiple possibilities, we return success but don't
16912 deduce anything. */
16916 int i
= TREE_VEC_LENGTH (targs
);
16918 if (TREE_VEC_ELT (tempargs
, i
))
16920 tree old
= TREE_VEC_ELT (targs
, i
);
16921 tree new_
= TREE_VEC_ELT (tempargs
, i
);
16922 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
16923 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
16924 /* Don't forget explicit template arguments in a pack. */
16925 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
16926 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
16927 TREE_VEC_ELT (targs
, i
) = new_
;
16936 /* Core DR 115: In contexts where deduction is done and fails, or in
16937 contexts where deduction is not done, if a template argument list is
16938 specified and it, along with any default template arguments, identifies
16939 a single function template specialization, then the template-id is an
16940 lvalue for the function template specialization. */
16943 resolve_nondeduced_context (tree orig_expr
)
16945 tree expr
, offset
, baselink
;
16948 if (!type_unknown_p (orig_expr
))
16953 offset
= NULL_TREE
;
16954 baselink
= NULL_TREE
;
16956 if (TREE_CODE (expr
) == ADDR_EXPR
)
16958 expr
= TREE_OPERAND (expr
, 0);
16961 if (TREE_CODE (expr
) == OFFSET_REF
)
16964 expr
= TREE_OPERAND (expr
, 1);
16966 if (BASELINK_P (expr
))
16969 expr
= BASELINK_FUNCTIONS (expr
);
16972 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
16975 tree goodfn
= NULL_TREE
;
16977 /* If we got some explicit template args, we need to plug them into
16978 the affected templates before we try to unify, in case the
16979 explicit args will completely resolve the templates in question. */
16981 tree expl_subargs
= TREE_OPERAND (expr
, 1);
16982 tree arg
= TREE_OPERAND (expr
, 0);
16983 tree badfn
= NULL_TREE
;
16984 tree badargs
= NULL_TREE
;
16986 for (; arg
; arg
= OVL_NEXT (arg
))
16988 tree fn
= OVL_CURRENT (arg
);
16989 tree subargs
, elem
;
16991 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16994 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16995 expl_subargs
, NULL_TREE
, tf_none
,
16996 /*require_all_args=*/true,
16997 /*use_default_args=*/true);
16998 if (subargs
!= error_mark_node
16999 && !any_dependent_template_arguments_p (subargs
))
17001 elem
= instantiate_template (fn
, subargs
, tf_none
);
17002 if (elem
== error_mark_node
)
17007 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17016 mark_used (goodfn
);
17019 expr
= build_baselink (BASELINK_BINFO (baselink
),
17020 BASELINK_ACCESS_BINFO (baselink
),
17021 expr
, BASELINK_OPTYPE (baselink
));
17025 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17026 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17029 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17032 else if (good
== 0 && badargs
)
17033 /* There were no good options and at least one bad one, so let the
17034 user know what the problem is. */
17035 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17040 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17041 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17042 different overloads deduce different arguments for a given parm.
17043 ADDR_P is true if the expression for which deduction is being
17044 performed was of the form "& fn" rather than simply "fn".
17046 Returns 1 on success. */
17049 try_one_overload (tree tparms
,
17054 unification_kind_t strict
,
17063 if (arg
== error_mark_node
)
17066 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17067 to function or pointer to member function argument if the set of
17068 overloaded functions does not contain function templates and at most
17069 one of a set of overloaded functions provides a unique match.
17071 So if this is a template, just return success. */
17073 if (uses_template_parms (arg
))
17076 if (TREE_CODE (arg
) == METHOD_TYPE
)
17077 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
17079 arg
= build_pointer_type (arg
);
17081 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
17083 /* We don't copy orig_targs for this because if we have already deduced
17084 some template args from previous args, unify would complain when we
17085 try to deduce a template parameter for the same argument, even though
17086 there isn't really a conflict. */
17087 nargs
= TREE_VEC_LENGTH (targs
);
17088 tempargs
= make_tree_vec (nargs
);
17090 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
17093 /* First make sure we didn't deduce anything that conflicts with
17094 explicitly specified args. */
17095 for (i
= nargs
; i
--; )
17097 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17098 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
17102 else if (uses_template_parms (elt
))
17103 /* Since we're unifying against ourselves, we will fill in
17104 template args used in the function parm list with our own
17105 template parms. Discard them. */
17106 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
17107 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
17111 for (i
= nargs
; i
--; )
17113 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17116 TREE_VEC_ELT (targs
, i
) = elt
;
17122 /* PARM is a template class (perhaps with unbound template
17123 parameters). ARG is a fully instantiated type. If ARG can be
17124 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
17125 TARGS are as for unify. */
17128 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
17131 tree copy_of_targs
;
17133 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
17134 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
17135 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
17138 /* We need to make a new template argument vector for the call to
17139 unify. If we used TARGS, we'd clutter it up with the result of
17140 the attempted unification, even if this class didn't work out.
17141 We also don't want to commit ourselves to all the unifications
17142 we've already done, since unification is supposed to be done on
17143 an argument-by-argument basis. In other words, consider the
17144 following pathological case:
17146 template <int I, int J, int K>
17149 template <int I, int J>
17150 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
17152 template <int I, int J, int K>
17153 void f(S<I, J, K>, S<I, I, I>);
17162 Now, by the time we consider the unification involving `s2', we
17163 already know that we must have `f<0, 0, 0>'. But, even though
17164 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17165 because there are two ways to unify base classes of S<0, 1, 2>
17166 with S<I, I, I>. If we kept the already deduced knowledge, we
17167 would reject the possibility I=1. */
17168 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
17170 /* If unification failed, we're done. */
17171 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
17172 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
17178 /* Given a template type PARM and a class type ARG, find the unique
17179 base type in ARG that is an instance of PARM. We do not examine
17180 ARG itself; only its base-classes. If there is not exactly one
17181 appropriate base class, return NULL_TREE. PARM may be the type of
17182 a partial specialization, as well as a plain template type. Used
17185 static enum template_base_result
17186 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
17187 bool explain_p
, tree
*result
)
17189 tree rval
= NULL_TREE
;
17192 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
17194 binfo
= TYPE_BINFO (complete_type (arg
));
17197 /* The type could not be completed. */
17198 *result
= NULL_TREE
;
17199 return tbr_incomplete_type
;
17202 /* Walk in inheritance graph order. The search order is not
17203 important, and this avoids multiple walks of virtual bases. */
17204 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
17206 tree r
= try_class_unification (tparms
, targs
, parm
,
17207 BINFO_TYPE (binfo
), explain_p
);
17211 /* If there is more than one satisfactory baseclass, then:
17215 If they yield more than one possible deduced A, the type
17219 if (rval
&& !same_type_p (r
, rval
))
17221 *result
= NULL_TREE
;
17222 return tbr_ambiguous_baseclass
;
17230 return tbr_success
;
17233 /* Returns the level of DECL, which declares a template parameter. */
17236 template_decl_level (tree decl
)
17238 switch (TREE_CODE (decl
))
17241 case TEMPLATE_DECL
:
17242 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
17245 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
17248 gcc_unreachable ();
17253 /* Decide whether ARG can be unified with PARM, considering only the
17254 cv-qualifiers of each type, given STRICT as documented for unify.
17255 Returns nonzero iff the unification is OK on that basis. */
17258 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17260 int arg_quals
= cp_type_quals (arg
);
17261 int parm_quals
= cp_type_quals (parm
);
17263 /* DR 1584: cv-qualification of a deduced function type is
17264 ignored; see 8.3.5 [dcl.fct]. */
17265 if (TREE_CODE (arg
) == FUNCTION_TYPE
)
17268 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17269 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17271 /* Although a CVR qualifier is ignored when being applied to a
17272 substituted template parameter ([8.3.2]/1 for example), that
17273 does not allow us to unify "const T" with "int&" because both
17274 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17275 It is ok when we're allowing additional CV qualifiers
17276 at the outer level [14.8.2.1]/3,1st bullet. */
17277 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17278 || TREE_CODE (arg
) == FUNCTION_TYPE
17279 || TREE_CODE (arg
) == METHOD_TYPE
)
17280 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17283 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17284 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17288 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17289 && (arg_quals
& parm_quals
) != parm_quals
)
17292 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17293 && (parm_quals
& arg_quals
) != arg_quals
)
17299 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17301 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17303 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17304 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17305 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17307 *index
= TEMPLATE_TYPE_IDX (parm
);
17308 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17312 *index
= TEMPLATE_PARM_IDX (parm
);
17313 *level
= TEMPLATE_PARM_LEVEL (parm
);
17317 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17319 if (unify (TP, TA, P, A, S, EP)) \
17323 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17324 expansion at the end of PACKED_PARMS. Returns 0 if the type
17325 deduction succeeds, 1 otherwise. STRICT is the same as in
17326 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17327 call argument list. We'll need to adjust the arguments to make them
17328 types. SUBR tells us if this is from a recursive call to
17329 type_unification_real, or for comparing two template argument
17333 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17334 tree packed_args
, unification_kind_t strict
,
17335 bool subr
, bool explain_p
)
17338 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17339 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17340 tree pack
, packs
= NULL_TREE
;
17341 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17343 packed_args
= expand_template_argument_pack (packed_args
);
17345 int len
= TREE_VEC_LENGTH (packed_args
);
17347 /* Determine the parameter packs we will be deducing from the
17348 pattern, and record their current deductions. */
17349 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17350 pack
; pack
= TREE_CHAIN (pack
))
17352 tree parm_pack
= TREE_VALUE (pack
);
17355 /* Determine the index and level of this parameter pack. */
17356 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17358 /* Keep track of the parameter packs and their corresponding
17360 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17361 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17364 /* Loop through all of the arguments that have not yet been
17365 unified and unify each with the pattern. */
17366 for (i
= start
; i
< len
; i
++)
17369 bool any_explicit
= false;
17370 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17372 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17373 or the element of its argument pack at the current index if
17374 this argument was explicitly specified. */
17375 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17379 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17382 if (TREE_VALUE (pack
)
17383 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17384 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17386 any_explicit
= true;
17387 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17389 TMPL_ARG (targs
, level
, idx
) = arg
;
17392 /* If we had explicit template arguments, substitute them into the
17393 pattern before deduction. */
17396 /* Some arguments might still be unspecified or dependent. */
17398 ++processing_template_decl
;
17399 dependent
= any_dependent_template_arguments_p (targs
);
17401 --processing_template_decl
;
17402 parm
= tsubst (pattern
, targs
,
17403 explain_p
? tf_warning_or_error
: tf_none
,
17406 --processing_template_decl
;
17407 if (parm
== error_mark_node
)
17413 /* Unify the pattern with the current argument. */
17414 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17415 LOOKUP_IMPLICIT
, explain_p
))
17418 /* For each parameter pack, collect the deduced value. */
17419 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17422 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17424 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17425 TMPL_ARG (targs
, level
, idx
);
17429 /* Verify that the results of unification with the parameter packs
17430 produce results consistent with what we've seen before, and make
17431 the deduced argument packs available. */
17432 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17434 tree old_pack
= TREE_VALUE (pack
);
17435 tree new_args
= TREE_TYPE (pack
);
17436 int i
, len
= TREE_VEC_LENGTH (new_args
);
17438 bool nondeduced_p
= false;
17440 /* By default keep the original deduced argument pack.
17441 If necessary, more specific code is going to update the
17442 resulting deduced argument later down in this function. */
17443 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17444 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17446 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17447 actually deduce anything. */
17448 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17449 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17450 nondeduced_p
= true;
17454 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17456 /* If we had fewer function args than explicit template args,
17457 just use the explicits. */
17458 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17459 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17460 if (len
< explicit_len
)
17461 new_args
= explicit_args
;
17467 /* Build the deduced *_ARGUMENT_PACK. */
17468 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17470 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17471 TREE_TYPE (result
) =
17472 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17473 TREE_CONSTANT (result
) = 1;
17476 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17478 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17480 /* Note the deduced argument packs for this parameter
17482 TMPL_ARG (targs
, level
, idx
) = result
;
17484 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17485 && (ARGUMENT_PACK_ARGS (old_pack
)
17486 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17488 /* We only had the explicitly-provided arguments before, but
17489 now we have a complete set of arguments. */
17490 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17492 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17493 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17494 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17498 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17499 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17501 if (!comp_template_args_with_info (old_args
, new_args
,
17502 &bad_old_arg
, &bad_new_arg
))
17503 /* Inconsistent unification of this parameter pack. */
17504 return unify_parameter_pack_inconsistent (explain_p
,
17510 return unify_success (explain_p
);
17513 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17514 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17515 parameters and return value are as for unify. */
17518 unify_array_domain (tree tparms
, tree targs
,
17519 tree parm_dom
, tree arg_dom
,
17527 /* Our representation of array types uses "N - 1" as the
17528 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17529 not an integer constant. We cannot unify arbitrarily
17530 complex expressions, so we eliminate the MINUS_EXPRs
17532 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17533 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17536 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17537 parm_max
= TREE_OPERAND (parm_max
, 0);
17539 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17540 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17543 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17544 trying to unify the type of a variable with the type
17545 of a template parameter. For example:
17547 template <unsigned int N>
17548 void f (char (&) [N]);
17555 Here, the type of the ARG will be "int [g(i)]", and
17556 may be a SAVE_EXPR, etc. */
17557 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17558 return unify_vla_arg (explain_p
, arg_dom
);
17559 arg_max
= TREE_OPERAND (arg_max
, 0);
17562 /* If only one of the bounds used a MINUS_EXPR, compensate
17563 by adding one to the other bound. */
17564 if (parm_cst
&& !arg_cst
)
17565 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17569 else if (arg_cst
&& !parm_cst
)
17570 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17575 return unify (tparms
, targs
, parm_max
, arg_max
,
17576 UNIFY_ALLOW_INTEGER
, explain_p
);
17579 /* Deduce the value of template parameters. TPARMS is the (innermost)
17580 set of template parameters to a template. TARGS is the bindings
17581 for those template parameters, as determined thus far; TARGS may
17582 include template arguments for outer levels of template parameters
17583 as well. PARM is a parameter to a template function, or a
17584 subcomponent of that parameter; ARG is the corresponding argument.
17585 This function attempts to match PARM with ARG in a manner
17586 consistent with the existing assignments in TARGS. If more values
17587 are deduced, then TARGS is updated.
17589 Returns 0 if the type deduction succeeds, 1 otherwise. The
17590 parameter STRICT is a bitwise or of the following flags:
17593 Require an exact match between PARM and ARG.
17594 UNIFY_ALLOW_MORE_CV_QUAL:
17595 Allow the deduced ARG to be more cv-qualified (by qualification
17596 conversion) than ARG.
17597 UNIFY_ALLOW_LESS_CV_QUAL:
17598 Allow the deduced ARG to be less cv-qualified than ARG.
17599 UNIFY_ALLOW_DERIVED:
17600 Allow the deduced ARG to be a template base class of ARG,
17601 or a pointer to a template base class of the type pointed to by
17603 UNIFY_ALLOW_INTEGER:
17604 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17605 case for more information.
17606 UNIFY_ALLOW_OUTER_LEVEL:
17607 This is the outermost level of a deduction. Used to determine validity
17608 of qualification conversions. A valid qualification conversion must
17609 have const qualified pointers leading up to the inner type which
17610 requires additional CV quals, except at the outer level, where const
17611 is not required [conv.qual]. It would be normal to set this flag in
17612 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17613 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17614 This is the outermost level of a deduction, and PARM can be more CV
17615 qualified at this point.
17616 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17617 This is the outermost level of a deduction, and PARM can be less CV
17618 qualified at this point. */
17621 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
17627 int strict_in
= strict
;
17629 /* I don't think this will do the right thing with respect to types.
17630 But the only case I've seen it in so far has been array bounds, where
17631 signedness is the only information lost, and I think that will be
17633 while (TREE_CODE (parm
) == NOP_EXPR
)
17634 parm
= TREE_OPERAND (parm
, 0);
17636 if (arg
== error_mark_node
)
17637 return unify_invalid (explain_p
);
17638 if (arg
== unknown_type_node
17639 || arg
== init_list_type_node
)
17640 /* We can't deduce anything from this, but we might get all the
17641 template args from other function args. */
17642 return unify_success (explain_p
);
17644 /* If PARM uses template parameters, then we can't bail out here,
17645 even if ARG == PARM, since we won't record unifications for the
17646 template parameters. We might need them if we're trying to
17647 figure out which of two things is more specialized. */
17648 if (arg
== parm
&& !uses_template_parms (parm
))
17649 return unify_success (explain_p
);
17651 /* Handle init lists early, so the rest of the function can assume
17652 we're dealing with a type. */
17653 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
17657 tree orig_parm
= parm
;
17659 /* Replace T with std::initializer_list<T> for deduction. */
17660 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17661 && flag_deduce_init_list
)
17662 parm
= listify (parm
);
17664 if (!is_std_init_list (parm
)
17665 && TREE_CODE (parm
) != ARRAY_TYPE
)
17666 /* We can only deduce from an initializer list argument if the
17667 parameter is std::initializer_list or an array; otherwise this
17668 is a non-deduced context. */
17669 return unify_success (explain_p
);
17671 if (TREE_CODE (parm
) == ARRAY_TYPE
)
17672 elttype
= TREE_TYPE (parm
);
17674 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
17676 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
17678 int elt_strict
= strict
;
17680 if (elt
== error_mark_node
)
17681 return unify_invalid (explain_p
);
17683 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
17685 tree type
= TREE_TYPE (elt
);
17686 /* It should only be possible to get here for a call. */
17687 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
17688 elt_strict
|= maybe_adjust_types_for_deduction
17689 (DEDUCE_CALL
, &elttype
, &type
, elt
);
17693 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
17697 if (TREE_CODE (parm
) == ARRAY_TYPE
17698 && deducible_array_bound (TYPE_DOMAIN (parm
)))
17700 /* Also deduce from the length of the initializer list. */
17701 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
17702 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
17703 if (idx
== error_mark_node
)
17704 return unify_invalid (explain_p
);
17705 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17709 /* If the std::initializer_list<T> deduction worked, replace the
17710 deduced A with std::initializer_list<A>. */
17711 if (orig_parm
!= parm
)
17713 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
17714 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17715 targ
= listify (targ
);
17716 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
17718 return unify_success (explain_p
);
17721 /* Immediately reject some pairs that won't unify because of
17722 cv-qualification mismatches. */
17723 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17725 /* It is the elements of the array which hold the cv quals of an array
17726 type, and the elements might be template type parms. We'll check
17727 when we recurse. */
17728 && TREE_CODE (arg
) != ARRAY_TYPE
17729 /* We check the cv-qualifiers when unifying with template type
17730 parameters below. We want to allow ARG `const T' to unify with
17731 PARM `T' for example, when computing which of two templates
17732 is more specialized, for example. */
17733 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
17734 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
17735 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17737 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
17738 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
17739 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
17740 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
17741 strict
&= ~UNIFY_ALLOW_DERIVED
;
17742 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17743 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
17745 switch (TREE_CODE (parm
))
17747 case TYPENAME_TYPE
:
17749 case UNBOUND_CLASS_TEMPLATE
:
17750 /* In a type which contains a nested-name-specifier, template
17751 argument values cannot be deduced for template parameters used
17752 within the nested-name-specifier. */
17753 return unify_success (explain_p
);
17755 case TEMPLATE_TYPE_PARM
:
17756 case TEMPLATE_TEMPLATE_PARM
:
17757 case BOUND_TEMPLATE_TEMPLATE_PARM
:
17758 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17759 if (error_operand_p (tparm
))
17760 return unify_invalid (explain_p
);
17762 if (TEMPLATE_TYPE_LEVEL (parm
)
17763 != template_decl_level (tparm
))
17764 /* The PARM is not one we're trying to unify. Just check
17765 to see if it matches ARG. */
17767 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17768 && (is_auto (parm
) ? is_auto (arg
)
17769 : same_type_p (parm
, arg
)))
17770 return unify_success (explain_p
);
17772 return unify_type_mismatch (explain_p
, parm
, arg
);
17774 idx
= TEMPLATE_TYPE_IDX (parm
);
17775 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17776 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
17777 if (error_operand_p (tparm
))
17778 return unify_invalid (explain_p
);
17780 /* Check for mixed types and values. */
17781 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17782 && TREE_CODE (tparm
) != TYPE_DECL
)
17783 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17784 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
17785 gcc_unreachable ();
17787 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17789 /* ARG must be constructed from a template class or a template
17790 template parameter. */
17791 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
17792 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
17793 return unify_template_deduction_failure (explain_p
, parm
, arg
);
17795 tree parmvec
= TYPE_TI_ARGS (parm
);
17796 /* An alias template name is never deduced. */
17797 if (TYPE_ALIAS_P (arg
))
17798 arg
= strip_typedefs (arg
);
17799 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
17800 tree full_argvec
= add_to_template_args (targs
, argvec
);
17802 = DECL_INNERMOST_TEMPLATE_PARMS
17803 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
17805 int parm_variadic_p
= 0;
17807 /* The resolution to DR150 makes clear that default
17808 arguments for an N-argument may not be used to bind T
17809 to a template template parameter with fewer than N
17810 parameters. It is not safe to permit the binding of
17811 default arguments as an extension, as that may change
17812 the meaning of a conforming program. Consider:
17814 struct Dense { static const unsigned int dim = 1; };
17816 template <template <typename> class View,
17818 void operator+(float, View<Block> const&);
17820 template <typename Block,
17821 unsigned int Dim = Block::dim>
17822 struct Lvalue_proxy { operator float() const; };
17826 Lvalue_proxy<Dense> p;
17831 Here, if Lvalue_proxy is permitted to bind to View, then
17832 the global operator+ will be used; if they are not, the
17833 Lvalue_proxy will be converted to float. */
17834 if (coerce_template_parms (parm_parms
,
17836 TYPE_TI_TEMPLATE (parm
),
17838 ? tf_warning_or_error
17840 /*require_all_args=*/true,
17841 /*use_default_args=*/false)
17842 == error_mark_node
)
17845 /* Deduce arguments T, i from TT<T> or TT<i>.
17846 We check each element of PARMVEC and ARGVEC individually
17847 rather than the whole TREE_VEC since they can have
17848 different number of elements. */
17850 parmvec
= expand_template_argument_pack (parmvec
);
17851 argvec
= expand_template_argument_pack (argvec
);
17853 len
= TREE_VEC_LENGTH (parmvec
);
17855 /* Check if the parameters end in a pack, making them
17858 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
17859 parm_variadic_p
= 1;
17861 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17862 /* If the template argument list of P contains a pack
17863 expansion that is not the last template argument, the
17864 entire template argument list is a non-deduced
17866 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
17867 return unify_success (explain_p
);
17869 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
17870 return unify_too_few_arguments (explain_p
,
17871 TREE_VEC_LENGTH (argvec
), len
);
17873 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17875 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17876 TREE_VEC_ELT (parmvec
, i
),
17877 TREE_VEC_ELT (argvec
, i
),
17878 UNIFY_ALLOW_NONE
, explain_p
);
17881 if (parm_variadic_p
17882 && unify_pack_expansion (tparms
, targs
,
17885 /*subr=*/true, explain_p
))
17888 arg
= TYPE_TI_TEMPLATE (arg
);
17890 /* Fall through to deduce template name. */
17893 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17894 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17896 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
17898 /* Simple cases: Value already set, does match or doesn't. */
17899 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
17900 return unify_success (explain_p
);
17902 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17906 /* If PARM is `const T' and ARG is only `int', we don't have
17907 a match unless we are allowing additional qualification.
17908 If ARG is `const int' and PARM is just `T' that's OK;
17909 that binds `const int' to `T'. */
17910 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
17912 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17914 /* Consider the case where ARG is `const volatile int' and
17915 PARM is `const T'. Then, T should be `volatile int'. */
17916 arg
= cp_build_qualified_type_real
17917 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
17918 if (arg
== error_mark_node
)
17919 return unify_invalid (explain_p
);
17921 /* Simple cases: Value already set, does match or doesn't. */
17922 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
17923 return unify_success (explain_p
);
17925 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17927 /* Make sure that ARG is not a variable-sized array. (Note
17928 that were talking about variable-sized arrays (like
17929 `int[n]'), rather than arrays of unknown size (like
17930 `int[]').) We'll get very confused by such a type since
17931 the bound of the array is not constant, and therefore
17932 not mangleable. Besides, such types are not allowed in
17933 ISO C++, so we can do as we please here. We do allow
17934 them for 'auto' deduction, since that isn't ABI-exposed. */
17935 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
17936 return unify_vla_arg (explain_p
, arg
);
17938 /* Strip typedefs as in convert_template_argument. */
17939 arg
= canonicalize_type_argument (arg
, tf_none
);
17942 /* If ARG is a parameter pack or an expansion, we cannot unify
17943 against it unless PARM is also a parameter pack. */
17944 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
17945 && !template_parameter_pack_p (parm
))
17946 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
17948 /* If the argument deduction results is a METHOD_TYPE,
17949 then there is a problem.
17950 METHOD_TYPE doesn't map to any real C++ type the result of
17951 the deduction can not be of that type. */
17952 if (TREE_CODE (arg
) == METHOD_TYPE
)
17953 return unify_method_type_error (explain_p
, arg
);
17955 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
17956 return unify_success (explain_p
);
17958 case TEMPLATE_PARM_INDEX
:
17959 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17960 if (error_operand_p (tparm
))
17961 return unify_invalid (explain_p
);
17963 if (TEMPLATE_PARM_LEVEL (parm
)
17964 != template_decl_level (tparm
))
17966 /* The PARM is not one we're trying to unify. Just check
17967 to see if it matches ARG. */
17968 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
17969 && cp_tree_equal (parm
, arg
));
17971 unify_expression_unequal (explain_p
, parm
, arg
);
17975 idx
= TEMPLATE_PARM_IDX (parm
);
17976 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17980 int x
= !cp_tree_equal (targ
, arg
);
17982 unify_inconsistency (explain_p
, parm
, targ
, arg
);
17986 /* [temp.deduct.type] If, in the declaration of a function template
17987 with a non-type template-parameter, the non-type
17988 template-parameter is used in an expression in the function
17989 parameter-list and, if the corresponding template-argument is
17990 deduced, the template-argument type shall match the type of the
17991 template-parameter exactly, except that a template-argument
17992 deduced from an array bound may be of any integral type.
17993 The non-type parameter might use already deduced type parameters. */
17994 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
17995 if (!TREE_TYPE (arg
))
17996 /* Template-parameter dependent expression. Just accept it for now.
17997 It will later be processed in convert_template_argument. */
17999 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18001 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18002 && CP_INTEGRAL_TYPE_P (tparm
))
18003 /* Convert the ARG to the type of PARM; the deduced non-type
18004 template argument must exactly match the types of the
18005 corresponding parameter. */
18006 arg
= fold (build_nop (tparm
, arg
));
18007 else if (uses_template_parms (tparm
))
18008 /* We haven't deduced the type of this parameter yet. Try again
18010 return unify_success (explain_p
);
18012 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18014 /* If ARG is a parameter pack or an expansion, we cannot unify
18015 against it unless PARM is also a parameter pack. */
18016 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18017 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18018 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18020 arg
= strip_typedefs_expr (arg
);
18021 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18022 return unify_success (explain_p
);
18026 /* A pointer-to-member constant can be unified only with
18027 another constant. */
18028 if (TREE_CODE (arg
) != PTRMEM_CST
)
18029 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18031 /* Just unify the class member. It would be useless (and possibly
18032 wrong, depending on the strict flags) to unify also
18033 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18034 arg refer to the same variable, even if through different
18035 classes. For instance:
18037 struct A { int x; };
18040 Unification of &A::x and &B::x must succeed. */
18041 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18042 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18047 if (!TYPE_PTR_P (arg
))
18048 return unify_type_mismatch (explain_p
, parm
, arg
);
18050 /* [temp.deduct.call]
18052 A can be another pointer or pointer to member type that can
18053 be converted to the deduced A via a qualification
18054 conversion (_conv.qual_).
18056 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18057 This will allow for additional cv-qualification of the
18058 pointed-to types if appropriate. */
18060 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18061 /* The derived-to-base conversion only persists through one
18062 level of pointers. */
18063 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
18065 return unify (tparms
, targs
, TREE_TYPE (parm
),
18066 TREE_TYPE (arg
), strict
, explain_p
);
18069 case REFERENCE_TYPE
:
18070 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
18071 return unify_type_mismatch (explain_p
, parm
, arg
);
18072 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18073 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18076 if (TREE_CODE (arg
) != ARRAY_TYPE
)
18077 return unify_type_mismatch (explain_p
, parm
, arg
);
18078 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
18079 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
18080 return unify_type_mismatch (explain_p
, parm
, arg
);
18081 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18082 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18083 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
18084 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18085 TYPE_DOMAIN (arg
), explain_p
);
18086 return unify_success (explain_p
);
18093 case ENUMERAL_TYPE
:
18096 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18097 return unify_type_mismatch (explain_p
, parm
, arg
);
18099 /* We have already checked cv-qualification at the top of the
18101 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
18102 return unify_type_mismatch (explain_p
, parm
, arg
);
18104 /* As far as unification is concerned, this wins. Later checks
18105 will invalidate it if necessary. */
18106 return unify_success (explain_p
);
18108 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
18109 /* Type INTEGER_CST can come from ordinary constant template args. */
18111 while (TREE_CODE (arg
) == NOP_EXPR
)
18112 arg
= TREE_OPERAND (arg
, 0);
18114 if (TREE_CODE (arg
) != INTEGER_CST
)
18115 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18116 return (tree_int_cst_equal (parm
, arg
)
18117 ? unify_success (explain_p
)
18118 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
18122 int i
, len
, argslen
;
18123 int parm_variadic_p
= 0;
18125 if (TREE_CODE (arg
) != TREE_VEC
)
18126 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18128 len
= TREE_VEC_LENGTH (parm
);
18129 argslen
= TREE_VEC_LENGTH (arg
);
18131 /* Check for pack expansions in the parameters. */
18132 for (i
= 0; i
< len
; ++i
)
18134 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
18137 /* We can unify against something with a trailing
18139 parm_variadic_p
= 1;
18141 /* [temp.deduct.type]/9: If the template argument list of
18142 P contains a pack expansion that is not the last
18143 template argument, the entire template argument list
18144 is a non-deduced context. */
18145 return unify_success (explain_p
);
18149 /* If we don't have enough arguments to satisfy the parameters
18150 (not counting the pack expression at the end), or we have
18151 too many arguments for a parameter list that doesn't end in
18152 a pack expression, we can't unify. */
18153 if (parm_variadic_p
18154 ? argslen
< len
- parm_variadic_p
18156 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
18158 /* Unify all of the parameters that precede the (optional)
18159 pack expression. */
18160 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18162 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18163 TREE_VEC_ELT (parm
, i
),
18164 TREE_VEC_ELT (arg
, i
),
18165 UNIFY_ALLOW_NONE
, explain_p
);
18167 if (parm_variadic_p
)
18168 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
18170 /*subr=*/true, explain_p
);
18171 return unify_success (explain_p
);
18176 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18177 return unify_type_mismatch (explain_p
, parm
, arg
);
18179 if (TYPE_PTRMEMFUNC_P (parm
))
18181 if (!TYPE_PTRMEMFUNC_P (arg
))
18182 return unify_type_mismatch (explain_p
, parm
, arg
);
18184 return unify (tparms
, targs
,
18185 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
18186 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
18187 strict
, explain_p
);
18189 else if (TYPE_PTRMEMFUNC_P (arg
))
18190 return unify_type_mismatch (explain_p
, parm
, arg
);
18192 if (CLASSTYPE_TEMPLATE_INFO (parm
))
18194 tree t
= NULL_TREE
;
18196 if (strict_in
& UNIFY_ALLOW_DERIVED
)
18198 /* First, we try to unify the PARM and ARG directly. */
18199 t
= try_class_unification (tparms
, targs
,
18200 parm
, arg
, explain_p
);
18204 /* Fallback to the special case allowed in
18205 [temp.deduct.call]:
18207 If P is a class, and P has the form
18208 template-id, then A can be a derived class of
18209 the deduced A. Likewise, if P is a pointer to
18210 a class of the form template-id, A can be a
18211 pointer to a derived class pointed to by the
18213 enum template_base_result r
;
18214 r
= get_template_base (tparms
, targs
, parm
, arg
,
18218 return unify_no_common_base (explain_p
, r
, parm
, arg
);
18221 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
18222 && (CLASSTYPE_TI_TEMPLATE (parm
)
18223 == CLASSTYPE_TI_TEMPLATE (arg
)))
18224 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18225 Then, we should unify `int' and `U'. */
18228 /* There's no chance of unification succeeding. */
18229 return unify_type_mismatch (explain_p
, parm
, arg
);
18231 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
18232 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
18234 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
18235 return unify_type_mismatch (explain_p
, parm
, arg
);
18236 return unify_success (explain_p
);
18239 case FUNCTION_TYPE
:
18241 unsigned int nargs
;
18246 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18247 return unify_type_mismatch (explain_p
, parm
, arg
);
18249 /* CV qualifications for methods can never be deduced, they must
18250 match exactly. We need to check them explicitly here,
18251 because type_unification_real treats them as any other
18252 cv-qualified parameter. */
18253 if (TREE_CODE (parm
) == METHOD_TYPE
18254 && (!check_cv_quals_for_unify
18256 class_of_this_parm (arg
),
18257 class_of_this_parm (parm
))))
18258 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18260 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18261 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18263 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18264 args
= XALLOCAVEC (tree
, nargs
);
18265 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18266 a
!= NULL_TREE
&& a
!= void_list_node
;
18267 a
= TREE_CHAIN (a
), ++i
)
18268 args
[i
] = TREE_VALUE (a
);
18271 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18272 args
, nargs
, 1, DEDUCE_EXACT
,
18273 LOOKUP_NORMAL
, NULL
, explain_p
);
18277 /* Unify a pointer to member with a pointer to member function, which
18278 deduces the type of the member as a function type. */
18279 if (TYPE_PTRMEMFUNC_P (arg
))
18281 /* Check top-level cv qualifiers */
18282 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18283 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18285 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18286 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18287 UNIFY_ALLOW_NONE
, explain_p
);
18289 /* Determine the type of the function we are unifying against. */
18290 tree fntype
= static_fn_type (arg
);
18292 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18295 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18296 return unify_type_mismatch (explain_p
, parm
, arg
);
18297 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18298 TYPE_OFFSET_BASETYPE (arg
),
18299 UNIFY_ALLOW_NONE
, explain_p
);
18300 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18301 strict
, explain_p
);
18304 if (DECL_TEMPLATE_PARM_P (parm
))
18305 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18306 if (arg
!= integral_constant_value (parm
))
18307 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18308 return unify_success (explain_p
);
18311 case TEMPLATE_DECL
:
18312 /* Matched cases are handled by the ARG == PARM test above. */
18313 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18316 /* A non-type template parameter that is a variable should be a
18317 an integral constant, in which case, it whould have been
18318 folded into its (constant) value. So we should not be getting
18319 a variable here. */
18320 gcc_unreachable ();
18322 case TYPE_ARGUMENT_PACK
:
18323 case NONTYPE_ARGUMENT_PACK
:
18324 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18325 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18328 case DECLTYPE_TYPE
:
18329 case UNDERLYING_TYPE
:
18330 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18331 or UNDERLYING_TYPE nodes. */
18332 return unify_success (explain_p
);
18335 /* Unification fails if we hit an error node. */
18336 return unify_invalid (explain_p
);
18339 if (REFERENCE_REF_P (parm
))
18340 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18341 strict
, explain_p
);
18345 /* An unresolved overload is a nondeduced context. */
18346 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18347 return unify_success (explain_p
);
18348 gcc_assert (EXPR_P (parm
));
18350 /* We must be looking at an expression. This can happen with
18354 void foo(S<I>, S<I + 2>);
18356 This is a "nondeduced context":
18360 The nondeduced contexts are:
18362 --A type that is a template-id in which one or more of
18363 the template-arguments is an expression that references
18364 a template-parameter.
18366 In these cases, we assume deduction succeeded, but don't
18367 actually infer any unifications. */
18369 if (!uses_template_parms (parm
)
18370 && !template_args_equal (parm
, arg
))
18371 return unify_expression_unequal (explain_p
, parm
, arg
);
18373 return unify_success (explain_p
);
18376 #undef RECUR_AND_CHECK_FAILURE
18378 /* Note that DECL can be defined in this translation unit, if
18382 mark_definable (tree decl
)
18385 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18386 FOR_EACH_CLONE (clone
, decl
)
18387 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18390 /* Called if RESULT is explicitly instantiated, or is a member of an
18391 explicitly instantiated class. */
18394 mark_decl_instantiated (tree result
, int extern_p
)
18396 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18398 /* If this entity has already been written out, it's too late to
18399 make any modifications. */
18400 if (TREE_ASM_WRITTEN (result
))
18403 /* For anonymous namespace we don't need to do anything. */
18404 if (decl_anon_ns_mem_p (result
))
18406 gcc_assert (!TREE_PUBLIC (result
));
18410 if (TREE_CODE (result
) != FUNCTION_DECL
)
18411 /* The TREE_PUBLIC flag for function declarations will have been
18412 set correctly by tsubst. */
18413 TREE_PUBLIC (result
) = 1;
18415 /* This might have been set by an earlier implicit instantiation. */
18416 DECL_COMDAT (result
) = 0;
18419 DECL_NOT_REALLY_EXTERN (result
) = 0;
18422 mark_definable (result
);
18423 mark_needed (result
);
18424 /* Always make artificials weak. */
18425 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18426 comdat_linkage (result
);
18427 /* For WIN32 we also want to put explicit instantiations in
18428 linkonce sections. */
18429 else if (TREE_PUBLIC (result
))
18430 maybe_make_one_only (result
);
18433 /* If EXTERN_P, then this function will not be emitted -- unless
18434 followed by an explicit instantiation, at which point its linkage
18435 will be adjusted. If !EXTERN_P, then this function will be
18436 emitted here. In neither circumstance do we want
18437 import_export_decl to adjust the linkage. */
18438 DECL_INTERFACE_KNOWN (result
) = 1;
18441 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18442 important template arguments. If any are missing, we check whether
18443 they're important by using error_mark_node for substituting into any
18444 args that were used for partial ordering (the ones between ARGS and END)
18445 and seeing if it bubbles up. */
18448 check_undeduced_parms (tree targs
, tree args
, tree end
)
18450 bool found
= false;
18452 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18453 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18456 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18460 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18461 if (substed
== error_mark_node
)
18467 /* Given two function templates PAT1 and PAT2, return:
18469 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18470 -1 if PAT2 is more specialized than PAT1.
18471 0 if neither is more specialized.
18473 LEN indicates the number of parameters we should consider
18474 (defaulted parameters should not be considered).
18476 The 1998 std underspecified function template partial ordering, and
18477 DR214 addresses the issue. We take pairs of arguments, one from
18478 each of the templates, and deduce them against each other. One of
18479 the templates will be more specialized if all the *other*
18480 template's arguments deduce against its arguments and at least one
18481 of its arguments *does* *not* deduce against the other template's
18482 corresponding argument. Deduction is done as for class templates.
18483 The arguments used in deduction have reference and top level cv
18484 qualifiers removed. Iff both arguments were originally reference
18485 types *and* deduction succeeds in both directions, an lvalue reference
18486 wins against an rvalue reference and otherwise the template
18487 with the more cv-qualified argument wins for that pairing (if
18488 neither is more cv-qualified, they both are equal). Unlike regular
18489 deduction, after all the arguments have been deduced in this way,
18490 we do *not* verify the deduced template argument values can be
18491 substituted into non-deduced contexts.
18493 The logic can be a bit confusing here, because we look at deduce1 and
18494 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18495 can find template arguments for pat1 to make arg1 look like arg2, that
18496 means that arg2 is at least as specialized as arg1. */
18499 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18501 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18502 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18503 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18504 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18505 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18506 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18507 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18508 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18509 tree origs1
, origs2
;
18510 bool lose1
= false;
18511 bool lose2
= false;
18513 /* Remove the this parameter from non-static member functions. If
18514 one is a non-static member function and the other is not a static
18515 member function, remove the first parameter from that function
18516 also. This situation occurs for operator functions where we
18517 locate both a member function (with this pointer) and non-member
18518 operator (with explicit first operand). */
18519 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18521 len
--; /* LEN is the number of significant arguments for DECL1 */
18522 args1
= TREE_CHAIN (args1
);
18523 if (!DECL_STATIC_FUNCTION_P (decl2
))
18524 args2
= TREE_CHAIN (args2
);
18526 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18528 args2
= TREE_CHAIN (args2
);
18529 if (!DECL_STATIC_FUNCTION_P (decl1
))
18532 args1
= TREE_CHAIN (args1
);
18536 /* If only one is a conversion operator, they are unordered. */
18537 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18540 /* Consider the return type for a conversion function */
18541 if (DECL_CONV_FN_P (decl1
))
18543 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18544 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18548 processing_template_decl
++;
18554 /* Stop when an ellipsis is seen. */
18555 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18557 tree arg1
= TREE_VALUE (args1
);
18558 tree arg2
= TREE_VALUE (args2
);
18559 int deduce1
, deduce2
;
18565 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18566 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18568 /* When both arguments are pack expansions, we need only
18569 unify the patterns themselves. */
18570 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18571 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18573 /* This is the last comparison we need to do. */
18577 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18579 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18580 arg1
= TREE_TYPE (arg1
);
18581 quals1
= cp_type_quals (arg1
);
18584 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18586 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18587 arg2
= TREE_TYPE (arg2
);
18588 quals2
= cp_type_quals (arg2
);
18591 arg1
= TYPE_MAIN_VARIANT (arg1
);
18592 arg2
= TYPE_MAIN_VARIANT (arg2
);
18594 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
18596 int i
, len2
= list_length (args2
);
18597 tree parmvec
= make_tree_vec (1);
18598 tree argvec
= make_tree_vec (len2
);
18601 /* Setup the parameter vector, which contains only ARG1. */
18602 TREE_VEC_ELT (parmvec
, 0) = arg1
;
18604 /* Setup the argument vector, which contains the remaining
18606 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
18607 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18609 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
18610 argvec
, DEDUCE_EXACT
,
18611 /*subr=*/true, /*explain_p=*/false)
18614 /* We cannot deduce in the other direction, because ARG1 is
18615 a pack expansion but ARG2 is not. */
18618 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18620 int i
, len1
= list_length (args1
);
18621 tree parmvec
= make_tree_vec (1);
18622 tree argvec
= make_tree_vec (len1
);
18625 /* Setup the parameter vector, which contains only ARG1. */
18626 TREE_VEC_ELT (parmvec
, 0) = arg2
;
18628 /* Setup the argument vector, which contains the remaining
18630 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
18631 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18633 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
18634 argvec
, DEDUCE_EXACT
,
18635 /*subr=*/true, /*explain_p=*/false)
18638 /* We cannot deduce in the other direction, because ARG2 is
18639 a pack expansion but ARG1 is not.*/
18645 /* The normal case, where neither argument is a pack
18647 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
18648 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18650 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
18651 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18655 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18656 arg2, then arg2 is not as specialized as arg1. */
18662 /* "If, for a given type, deduction succeeds in both directions
18663 (i.e., the types are identical after the transformations above)
18664 and both P and A were reference types (before being replaced with
18665 the type referred to above):
18666 - if the type from the argument template was an lvalue reference and
18667 the type from the parameter template was not, the argument type is
18668 considered to be more specialized than the other; otherwise,
18669 - if the type from the argument template is more cv-qualified
18670 than the type from the parameter template (as described above),
18671 the argument type is considered to be more specialized than the other;
18673 - neither type is more specialized than the other." */
18675 if (deduce1
&& deduce2
)
18677 if (ref1
&& ref2
&& ref1
!= ref2
)
18684 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
18686 if ((quals1
& quals2
) == quals2
)
18688 if ((quals1
& quals2
) == quals1
)
18693 if (lose1
&& lose2
)
18694 /* We've failed to deduce something in either direction.
18695 These must be unordered. */
18698 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18699 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18700 /* We have already processed all of the arguments in our
18701 handing of the pack expansion type. */
18704 args1
= TREE_CHAIN (args1
);
18705 args2
= TREE_CHAIN (args2
);
18708 /* "In most cases, all template parameters must have values in order for
18709 deduction to succeed, but for partial ordering purposes a template
18710 parameter may remain without a value provided it is not used in the
18711 types being used for partial ordering."
18713 Thus, if we are missing any of the targs1 we need to substitute into
18714 origs1, then pat2 is not as specialized as pat1. This can happen when
18715 there is a nondeduced context. */
18716 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
18718 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
18721 processing_template_decl
--;
18723 /* All things being equal, if the next argument is a pack expansion
18724 for one function but not for the other, prefer the
18725 non-variadic function. FIXME this is bogus; see c++/41958. */
18727 && args1
&& TREE_VALUE (args1
)
18728 && args2
&& TREE_VALUE (args2
))
18730 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
18731 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
18734 if (lose1
== lose2
)
18742 /* Determine which of two partial specializations of TMPL is more
18745 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
18746 to the first partial specialization. The TREE_VALUE is the
18747 innermost set of template parameters for the partial
18748 specialization. PAT2 is similar, but for the second template.
18750 Return 1 if the first partial specialization is more specialized;
18751 -1 if the second is more specialized; 0 if neither is more
18754 See [temp.class.order] for information about determining which of
18755 two templates is more specialized. */
18758 more_specialized_class (tree tmpl
, tree pat1
, tree pat2
)
18763 bool any_deductions
= false;
18765 tmpl1
= TREE_TYPE (pat1
);
18766 tmpl2
= TREE_TYPE (pat2
);
18768 /* Just like what happens for functions, if we are ordering between
18769 different class template specializations, we may encounter dependent
18770 types in the arguments, and we need our dependency check functions
18771 to behave correctly. */
18772 ++processing_template_decl
;
18773 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat1
),
18774 CLASSTYPE_TI_ARGS (tmpl1
),
18775 CLASSTYPE_TI_ARGS (tmpl2
));
18779 any_deductions
= true;
18782 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat2
),
18783 CLASSTYPE_TI_ARGS (tmpl2
),
18784 CLASSTYPE_TI_ARGS (tmpl1
));
18788 any_deductions
= true;
18790 --processing_template_decl
;
18792 /* In the case of a tie where at least one of the class templates
18793 has a parameter pack at the end, the template with the most
18794 non-packed parameters wins. */
18797 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
18798 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
18800 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
18801 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
18802 int len1
= TREE_VEC_LENGTH (args1
);
18803 int len2
= TREE_VEC_LENGTH (args2
);
18805 /* We don't count the pack expansion at the end. */
18806 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
18808 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
18813 else if (len1
< len2
)
18820 /* Return the template arguments that will produce the function signature
18821 DECL from the function template FN, with the explicit template
18822 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
18823 also match. Return NULL_TREE if no satisfactory arguments could be
18827 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
18829 int ntparms
= DECL_NTPARMS (fn
);
18830 tree targs
= make_tree_vec (ntparms
);
18831 tree decl_type
= TREE_TYPE (decl
);
18832 tree decl_arg_types
;
18834 unsigned int nargs
, ix
;
18837 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
18839 /* Never do unification on the 'this' parameter. */
18840 decl_arg_types
= skip_artificial_parms_for (decl
,
18841 TYPE_ARG_TYPES (decl_type
));
18843 nargs
= list_length (decl_arg_types
);
18844 args
= XALLOCAVEC (tree
, nargs
);
18845 for (arg
= decl_arg_types
, ix
= 0;
18846 arg
!= NULL_TREE
&& arg
!= void_list_node
;
18847 arg
= TREE_CHAIN (arg
), ++ix
)
18848 args
[ix
] = TREE_VALUE (arg
);
18850 if (fn_type_unification (fn
, explicit_args
, targs
,
18852 (check_rettype
|| DECL_CONV_FN_P (fn
)
18853 ? TREE_TYPE (decl_type
) : NULL_TREE
),
18854 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
18856 == error_mark_node
)
18862 /* Return the innermost template arguments that, when applied to a partial
18863 specialization of TMPL whose innermost template parameters are
18864 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
18867 For example, suppose we have:
18869 template <class T, class U> struct S {};
18870 template <class T> struct S<T*, int> {};
18872 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
18873 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
18874 int}. The resulting vector will be {double}, indicating that `T'
18875 is bound to `double'. */
18878 get_class_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
18880 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
18882 tree innermost_deduced_args
;
18884 innermost_deduced_args
= make_tree_vec (ntparms
);
18885 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18887 deduced_args
= copy_node (args
);
18888 SET_TMPL_ARGS_LEVEL (deduced_args
,
18889 TMPL_ARGS_DEPTH (deduced_args
),
18890 innermost_deduced_args
);
18893 deduced_args
= innermost_deduced_args
;
18895 if (unify (tparms
, deduced_args
,
18896 INNERMOST_TEMPLATE_ARGS (spec_args
),
18897 INNERMOST_TEMPLATE_ARGS (args
),
18898 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
18901 for (i
= 0; i
< ntparms
; ++i
)
18902 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
18905 /* Verify that nondeduced template arguments agree with the type
18906 obtained from argument deduction.
18910 struct A { typedef int X; };
18911 template <class T, class U> struct C {};
18912 template <class T> struct C<T, typename T::X> {};
18914 Then with the instantiation `C<A, int>', we can deduce that
18915 `T' is `A' but unify () does not check whether `typename T::X'
18917 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
18918 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18920 tf_none
, false, false);
18921 if (spec_args
== error_mark_node
18922 /* We only need to check the innermost arguments; the other
18923 arguments will always agree. */
18924 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
18925 INNERMOST_TEMPLATE_ARGS (args
)))
18928 /* Now that we have bindings for all of the template arguments,
18929 ensure that the arguments deduced for the template template
18930 parameters have compatible template parameter lists. See the use
18931 of template_template_parm_bindings_ok_p in fn_type_unification
18932 for more information. */
18933 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
18936 return deduced_args
;
18939 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
18940 Return the TREE_LIST node with the most specialized template, if
18941 any. If there is no most specialized template, the error_mark_node
18944 Note that this function does not look at, or modify, the
18945 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
18946 returned is one of the elements of INSTANTIATIONS, callers may
18947 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
18948 and retrieve it from the value returned. */
18951 most_specialized_instantiation (tree templates
)
18955 ++processing_template_decl
;
18958 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
18962 if (get_bindings (TREE_VALUE (champ
),
18963 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18964 NULL_TREE
, /*check_ret=*/true))
18967 if (get_bindings (TREE_VALUE (fn
),
18968 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18969 NULL_TREE
, /*check_ret=*/true))
18976 /* Equally specialized, move to next function. If there
18977 is no next function, nothing's most specialized. */
18978 fn
= TREE_CHAIN (fn
);
18986 /* Now verify that champ is better than everything earlier in the
18987 instantiation list. */
18988 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
18989 if (get_bindings (TREE_VALUE (champ
),
18990 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18991 NULL_TREE
, /*check_ret=*/true)
18992 || !get_bindings (TREE_VALUE (fn
),
18993 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18994 NULL_TREE
, /*check_ret=*/true))
19000 processing_template_decl
--;
19003 return error_mark_node
;
19008 /* If DECL is a specialization of some template, return the most
19009 general such template. Otherwise, returns NULL_TREE.
19011 For example, given:
19013 template <class T> struct S { template <class U> void f(U); };
19015 if TMPL is `template <class U> void S<int>::f(U)' this will return
19016 the full template. This function will not trace past partial
19017 specializations, however. For example, given in addition:
19019 template <class T> struct S<T*> { template <class U> void f(U); };
19021 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19022 `template <class T> template <class U> S<T*>::f(U)'. */
19025 most_general_template (tree decl
)
19027 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19029 if (tree tinfo
= get_template_info (decl
))
19030 decl
= TI_TEMPLATE (tinfo
);
19031 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19032 template friend, or a FIELD_DECL for a capture pack. */
19033 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19037 /* Look for more and more general templates. */
19038 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
19040 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
19041 (See cp-tree.h for details.) */
19042 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
19045 if (CLASS_TYPE_P (TREE_TYPE (decl
))
19046 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
19049 /* Stop if we run into an explicitly specialized class template. */
19050 if (!DECL_NAMESPACE_SCOPE_P (decl
)
19051 && DECL_CONTEXT (decl
)
19052 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
19055 decl
= DECL_TI_TEMPLATE (decl
);
19061 /* Return the most specialized of the class template partial
19062 specializations which can produce TYPE, a specialization of some class
19063 template. The value returned is actually a TREE_LIST; the TREE_TYPE is
19064 a _TYPE node corresponding to the partial specialization, while the
19065 TREE_PURPOSE is the set of template arguments that must be
19066 substituted into the TREE_TYPE in order to generate TYPE.
19068 If the choice of partial specialization is ambiguous, a diagnostic
19069 is issued, and the error_mark_node is returned. If there are no
19070 partial specializations matching TYPE, then NULL_TREE is
19071 returned, indicating that the primary template should be used. */
19074 most_specialized_class (tree type
, tsubst_flags_t complain
)
19076 tree list
= NULL_TREE
;
19081 tree outer_args
= NULL_TREE
;
19083 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
19084 tree main_tmpl
= most_general_template (tmpl
);
19085 tree args
= CLASSTYPE_TI_ARGS (type
);
19087 /* For determining which partial specialization to use, only the
19088 innermost args are interesting. */
19089 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19091 outer_args
= strip_innermost_template_args (args
, 1);
19092 args
= INNERMOST_TEMPLATE_ARGS (args
);
19095 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
19097 tree partial_spec_args
;
19099 tree spec_tmpl
= TREE_VALUE (t
);
19100 tree orig_parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19102 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
19104 ++processing_template_decl
;
19108 /* Discard the outer levels of args, and then substitute in the
19109 template args from the enclosing class. */
19110 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
19111 partial_spec_args
= tsubst_template_args
19112 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
19114 /* And the same for the partial specialization TEMPLATE_DECL. */
19115 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
19118 partial_spec_args
=
19119 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19122 /*require_all_args=*/true,
19123 /*use_default_args=*/true);
19125 --processing_template_decl
;
19127 if (partial_spec_args
== error_mark_node
)
19128 return error_mark_node
;
19129 if (spec_tmpl
== error_mark_node
)
19130 return error_mark_node
;
19132 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19133 spec_args
= get_class_bindings (tmpl
, parms
,
19139 spec_args
= add_to_template_args (outer_args
, spec_args
);
19140 list
= tree_cons (spec_args
, orig_parms
, list
);
19141 TREE_TYPE (list
) = TREE_TYPE (t
);
19148 ambiguous_p
= false;
19151 t
= TREE_CHAIN (t
);
19152 for (; t
; t
= TREE_CHAIN (t
))
19154 fate
= more_specialized_class (tmpl
, champ
, t
);
19161 t
= TREE_CHAIN (t
);
19164 ambiguous_p
= true;
19173 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
19175 fate
= more_specialized_class (tmpl
, champ
, t
);
19178 ambiguous_p
= true;
19186 char *spaces
= NULL
;
19187 if (!(complain
& tf_error
))
19188 return error_mark_node
;
19189 error ("ambiguous class template instantiation for %q#T", type
);
19190 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
19191 for (t
= list
; t
; t
= TREE_CHAIN (t
))
19193 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
19194 spaces
= spaces
? spaces
: get_spaces (str
);
19197 return error_mark_node
;
19203 /* Explicitly instantiate DECL. */
19206 do_decl_instantiation (tree decl
, tree storage
)
19208 tree result
= NULL_TREE
;
19211 if (!decl
|| decl
== error_mark_node
)
19212 /* An error occurred, for which grokdeclarator has already issued
19213 an appropriate message. */
19215 else if (! DECL_LANG_SPECIFIC (decl
))
19217 error ("explicit instantiation of non-template %q#D", decl
);
19221 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
19222 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
19224 if (VAR_P (decl
) && !var_templ
)
19226 /* There is an asymmetry here in the way VAR_DECLs and
19227 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19228 the latter, the DECL we get back will be marked as a
19229 template instantiation, and the appropriate
19230 DECL_TEMPLATE_INFO will be set up. This does not happen for
19231 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19232 should handle VAR_DECLs as it currently handles
19234 if (!DECL_CLASS_SCOPE_P (decl
))
19236 error ("%qD is not a static data member of a class template", decl
);
19239 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
19240 if (!result
|| !VAR_P (result
))
19242 error ("no matching template for %qD found", decl
);
19245 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
19247 error ("type %qT for explicit instantiation %qD does not match "
19248 "declared type %qT", TREE_TYPE (result
), decl
,
19253 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
19255 error ("explicit instantiation of %q#D", decl
);
19261 /* Check for various error cases. Note that if the explicit
19262 instantiation is valid the RESULT will currently be marked as an
19263 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19264 until we get here. */
19266 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19268 /* DR 259 [temp.spec].
19270 Both an explicit instantiation and a declaration of an explicit
19271 specialization shall not appear in a program unless the explicit
19272 instantiation follows a declaration of the explicit specialization.
19274 For a given set of template parameters, if an explicit
19275 instantiation of a template appears after a declaration of an
19276 explicit specialization for that template, the explicit
19277 instantiation has no effect. */
19280 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19284 No program shall explicitly instantiate any template more
19287 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19288 the first instantiation was `extern' and the second is not,
19289 and EXTERN_P for the opposite case. */
19290 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19291 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19292 /* If an "extern" explicit instantiation follows an ordinary
19293 explicit instantiation, the template is instantiated. */
19297 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19299 error ("no matching template for %qD found", result
);
19302 else if (!DECL_TEMPLATE_INFO (result
))
19304 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19308 if (storage
== NULL_TREE
)
19310 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19312 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19313 pedwarn (input_location
, OPT_Wpedantic
,
19314 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19319 error ("storage class %qD applied to template instantiation", storage
);
19321 check_explicit_instantiation_namespace (result
);
19322 mark_decl_instantiated (result
, extern_p
);
19324 instantiate_decl (result
, /*defer_ok=*/1,
19325 /*expl_inst_class_mem_p=*/false);
19329 mark_class_instantiated (tree t
, int extern_p
)
19331 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19332 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19333 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19334 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19337 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19338 rest_of_type_compilation (t
, 1);
19342 /* Called from do_type_instantiation through binding_table_foreach to
19343 do recursive instantiation for the type bound in ENTRY. */
19345 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19347 tree storage
= *(tree
*) data
;
19349 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19350 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19351 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19354 /* Called from do_type_instantiation to instantiate a member
19355 (a member function or a static member variable) of an
19356 explicitly instantiated class template. */
19358 instantiate_class_member (tree decl
, int extern_p
)
19360 mark_decl_instantiated (decl
, extern_p
);
19362 instantiate_decl (decl
, /*defer_ok=*/1,
19363 /*expl_inst_class_mem_p=*/true);
19366 /* Perform an explicit instantiation of template class T. STORAGE, if
19367 non-null, is the RID for extern, inline or static. COMPLAIN is
19368 nonzero if this is called from the parser, zero if called recursively,
19369 since the standard is unclear (as detailed below). */
19372 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19377 int previous_instantiation_extern_p
= 0;
19379 if (TREE_CODE (t
) == TYPE_DECL
)
19382 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19385 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19387 error ("explicit instantiation of non-class template %qD", tmpl
);
19389 error ("explicit instantiation of non-template type %qT", t
);
19395 if (!COMPLETE_TYPE_P (t
))
19397 if (complain
& tf_error
)
19398 error ("explicit instantiation of %q#T before definition of template",
19403 if (storage
!= NULL_TREE
)
19405 if (!in_system_header_at (input_location
))
19407 if (storage
== ridpointers
[(int) RID_EXTERN
])
19409 if (cxx_dialect
== cxx98
)
19410 pedwarn (input_location
, OPT_Wpedantic
,
19411 "ISO C++ 1998 forbids the use of %<extern%> on "
19412 "explicit instantiations");
19415 pedwarn (input_location
, OPT_Wpedantic
,
19416 "ISO C++ forbids the use of %qE"
19417 " on explicit instantiations", storage
);
19420 if (storage
== ridpointers
[(int) RID_INLINE
])
19422 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19424 else if (storage
== ridpointers
[(int) RID_STATIC
])
19428 error ("storage class %qD applied to template instantiation",
19434 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19436 /* DR 259 [temp.spec].
19438 Both an explicit instantiation and a declaration of an explicit
19439 specialization shall not appear in a program unless the explicit
19440 instantiation follows a declaration of the explicit specialization.
19442 For a given set of template parameters, if an explicit
19443 instantiation of a template appears after a declaration of an
19444 explicit specialization for that template, the explicit
19445 instantiation has no effect. */
19448 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19452 No program shall explicitly instantiate any template more
19455 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19456 instantiation was `extern'. If EXTERN_P then the second is.
19457 These cases are OK. */
19458 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19460 if (!previous_instantiation_extern_p
&& !extern_p
19461 && (complain
& tf_error
))
19462 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19464 /* If we've already instantiated the template, just return now. */
19465 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19469 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19470 mark_class_instantiated (t
, extern_p
);
19478 /* In contrast to implicit instantiation, where only the
19479 declarations, and not the definitions, of members are
19480 instantiated, we have here:
19484 The explicit instantiation of a class template specialization
19485 implies the instantiation of all of its members not
19486 previously explicitly specialized in the translation unit
19487 containing the explicit instantiation.
19489 Of course, we can't instantiate member template classes, since
19490 we don't have any arguments for them. Note that the standard
19491 is unclear on whether the instantiation of the members are
19492 *explicit* instantiations or not. However, the most natural
19493 interpretation is that it should be an explicit instantiation. */
19496 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19497 if (TREE_CODE (tmp
) == FUNCTION_DECL
19498 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19499 instantiate_class_member (tmp
, extern_p
);
19501 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19502 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19503 instantiate_class_member (tmp
, extern_p
);
19505 if (CLASSTYPE_NESTED_UTDS (t
))
19506 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19507 bt_instantiate_type_proc
, &storage
);
19511 /* Given a function DECL, which is a specialization of TMPL, modify
19512 DECL to be a re-instantiation of TMPL with the same template
19513 arguments. TMPL should be the template into which tsubst'ing
19514 should occur for DECL, not the most general template.
19516 One reason for doing this is a scenario like this:
19519 void f(const T&, int i);
19521 void g() { f(3, 7); }
19524 void f(const T& t, const int i) { }
19526 Note that when the template is first instantiated, with
19527 instantiate_template, the resulting DECL will have no name for the
19528 first parameter, and the wrong type for the second. So, when we go
19529 to instantiate the DECL, we regenerate it. */
19532 regenerate_decl_from_template (tree decl
, tree tmpl
)
19534 /* The arguments used to instantiate DECL, from the most general
19539 args
= DECL_TI_ARGS (decl
);
19540 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19542 /* Make sure that we can see identifiers, and compute access
19544 push_access_scope (decl
);
19546 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19554 args_depth
= TMPL_ARGS_DEPTH (args
);
19555 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19556 if (args_depth
> parms_depth
)
19557 args
= get_innermost_template_args (args
, parms_depth
);
19559 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19560 args
, tf_error
, NULL_TREE
,
19561 /*defer_ok*/false);
19562 if (specs
&& specs
!= error_mark_node
)
19563 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19566 /* Merge parameter declarations. */
19567 decl_parm
= skip_artificial_parms_for (decl
,
19568 DECL_ARGUMENTS (decl
));
19570 = skip_artificial_parms_for (code_pattern
,
19571 DECL_ARGUMENTS (code_pattern
));
19572 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
19577 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19578 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
19579 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
19581 parm_type
= type_decays_to (parm_type
);
19582 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19583 TREE_TYPE (decl_parm
) = parm_type
;
19584 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19585 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19587 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19588 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19590 decl_parm
= DECL_CHAIN (decl_parm
);
19591 pattern_parm
= DECL_CHAIN (pattern_parm
);
19593 /* Merge any parameters that match with the function parameter
19595 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
19598 tree expanded_types
;
19599 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19600 the parameters in this function parameter pack. */
19601 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
19602 args
, tf_error
, NULL_TREE
);
19603 len
= TREE_VEC_LENGTH (expanded_types
);
19604 for (i
= 0; i
< len
; i
++)
19609 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19610 /* Rename the parameter to include the index. */
19611 DECL_NAME (decl_parm
) =
19612 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
19613 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
19614 parm_type
= type_decays_to (parm_type
);
19615 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19616 TREE_TYPE (decl_parm
) = parm_type
;
19617 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19618 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19620 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19621 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19623 decl_parm
= DECL_CHAIN (decl_parm
);
19626 /* Merge additional specifiers from the CODE_PATTERN. */
19627 if (DECL_DECLARED_INLINE_P (code_pattern
)
19628 && !DECL_DECLARED_INLINE_P (decl
))
19629 DECL_DECLARED_INLINE_P (decl
) = 1;
19631 else if (VAR_P (decl
))
19633 DECL_INITIAL (decl
) =
19634 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
19635 tf_error
, DECL_TI_TEMPLATE (decl
),
19636 /*integral_constant_expression_p=*/false);
19637 if (VAR_HAD_UNKNOWN_BOUND (decl
))
19638 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
19639 tf_error
, DECL_TI_TEMPLATE (decl
));
19642 gcc_unreachable ();
19644 pop_access_scope (decl
);
19647 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19648 substituted to get DECL. */
19651 template_for_substitution (tree decl
)
19653 tree tmpl
= DECL_TI_TEMPLATE (decl
);
19655 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19656 for the instantiation. This is not always the most general
19657 template. Consider, for example:
19660 struct S { template <class U> void f();
19661 template <> void f<int>(); };
19663 and an instantiation of S<double>::f<int>. We want TD to be the
19664 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19665 while (/* An instantiation cannot have a definition, so we need a
19666 more general template. */
19667 DECL_TEMPLATE_INSTANTIATION (tmpl
)
19668 /* We must also deal with friend templates. Given:
19670 template <class T> struct S {
19671 template <class U> friend void f() {};
19674 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19675 so far as the language is concerned, but that's still
19676 where we get the pattern for the instantiation from. On
19677 other hand, if the definition comes outside the class, say:
19679 template <class T> struct S {
19680 template <class U> friend void f();
19682 template <class U> friend void f() {}
19684 we don't need to look any further. That's what the check for
19685 DECL_INITIAL is for. */
19686 || (TREE_CODE (decl
) == FUNCTION_DECL
19687 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
19688 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
19690 /* The present template, TD, should not be a definition. If it
19691 were a definition, we should be using it! Note that we
19692 cannot restructure the loop to just keep going until we find
19693 a template with a definition, since that might go too far if
19694 a specialization was declared, but not defined. */
19695 gcc_assert (!VAR_P (decl
)
19696 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
19698 /* Fetch the more general template. */
19699 tmpl
= DECL_TI_TEMPLATE (tmpl
);
19705 /* Returns true if we need to instantiate this template instance even if we
19706 know we aren't going to emit it.. */
19709 always_instantiate_p (tree decl
)
19711 /* We always instantiate inline functions so that we can inline them. An
19712 explicit instantiation declaration prohibits implicit instantiation of
19713 non-inline functions. With high levels of optimization, we would
19714 normally inline non-inline functions -- but we're not allowed to do
19715 that for "extern template" functions. Therefore, we check
19716 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19717 return ((TREE_CODE (decl
) == FUNCTION_DECL
19718 && (DECL_DECLARED_INLINE_P (decl
)
19719 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
19720 /* And we need to instantiate static data members so that
19721 their initializers are available in integral constant
19724 && decl_maybe_constant_var_p (decl
)));
19727 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19728 instantiate it now, modifying TREE_TYPE (fn). */
19731 maybe_instantiate_noexcept (tree fn
)
19733 tree fntype
, spec
, noex
, clone
;
19735 /* Don't instantiate a noexcept-specification from template context. */
19736 if (processing_template_decl
)
19739 if (DECL_CLONED_FUNCTION_P (fn
))
19740 fn
= DECL_CLONED_FUNCTION (fn
);
19741 fntype
= TREE_TYPE (fn
);
19742 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
19744 if (!spec
|| !TREE_PURPOSE (spec
))
19747 noex
= TREE_PURPOSE (spec
);
19749 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
19751 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
19752 spec
= get_defaulted_eh_spec (fn
);
19753 else if (push_tinst_level (fn
))
19755 push_access_scope (fn
);
19756 push_deferring_access_checks (dk_no_deferred
);
19757 input_location
= DECL_SOURCE_LOCATION (fn
);
19758 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
19759 DEFERRED_NOEXCEPT_ARGS (noex
),
19760 tf_warning_or_error
, fn
,
19761 /*function_p=*/false,
19762 /*integral_constant_expression_p=*/true);
19763 pop_deferring_access_checks ();
19764 pop_access_scope (fn
);
19765 pop_tinst_level ();
19766 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
19767 if (spec
== error_mark_node
)
19768 spec
= noexcept_false_spec
;
19771 spec
= noexcept_false_spec
;
19773 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
19776 FOR_EACH_CLONE (clone
, fn
)
19778 if (TREE_TYPE (clone
) == fntype
)
19779 TREE_TYPE (clone
) = TREE_TYPE (fn
);
19781 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
19785 /* Produce the definition of D, a _DECL generated from a template. If
19786 DEFER_OK is nonzero, then we don't have to actually do the
19787 instantiation now; we just have to do it sometime. Normally it is
19788 an error if this is an explicit instantiation but D is undefined.
19789 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
19790 explicitly instantiated class template. */
19793 instantiate_decl (tree d
, int defer_ok
,
19794 bool expl_inst_class_mem_p
)
19796 tree tmpl
= DECL_TI_TEMPLATE (d
);
19803 bool pattern_defined
;
19804 location_t saved_loc
= input_location
;
19805 int saved_unevaluated_operand
= cp_unevaluated_operand
;
19806 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
19812 /* This function should only be used to instantiate templates for
19813 functions and static member variables. */
19814 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
19816 /* Variables are never deferred; if instantiation is required, they
19817 are instantiated right away. That allows for better code in the
19818 case that an expression refers to the value of the variable --
19819 if the variable has a constant value the referring expression can
19820 take advantage of that fact. */
19822 || DECL_DECLARED_CONSTEXPR_P (d
))
19825 /* Don't instantiate cloned functions. Instead, instantiate the
19826 functions they cloned. */
19827 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
19828 d
= DECL_CLONED_FUNCTION (d
);
19830 if (DECL_TEMPLATE_INSTANTIATED (d
)
19831 || (TREE_CODE (d
) == FUNCTION_DECL
19832 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
19833 || DECL_TEMPLATE_SPECIALIZATION (d
))
19834 /* D has already been instantiated or explicitly specialized, so
19835 there's nothing for us to do here.
19837 It might seem reasonable to check whether or not D is an explicit
19838 instantiation, and, if so, stop here. But when an explicit
19839 instantiation is deferred until the end of the compilation,
19840 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
19841 the instantiation. */
19844 /* Check to see whether we know that this template will be
19845 instantiated in some other file, as with "extern template"
19847 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
19849 /* In general, we do not instantiate such templates. */
19850 if (external_p
&& !always_instantiate_p (d
))
19853 gen_tmpl
= most_general_template (tmpl
);
19854 gen_args
= DECL_TI_ARGS (d
);
19856 if (tmpl
!= gen_tmpl
)
19857 /* We should already have the extra args. */
19858 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
19859 == TMPL_ARGS_DEPTH (gen_args
));
19860 /* And what's in the hash table should match D. */
19861 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
19862 || spec
== NULL_TREE
);
19864 /* This needs to happen before any tsubsting. */
19865 if (! push_tinst_level (d
))
19868 timevar_push (TV_TEMPLATE_INST
);
19870 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
19871 for the instantiation. */
19872 td
= template_for_substitution (d
);
19873 code_pattern
= DECL_TEMPLATE_RESULT (td
);
19875 /* We should never be trying to instantiate a member of a class
19876 template or partial specialization. */
19877 gcc_assert (d
!= code_pattern
);
19879 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
19880 || DECL_TEMPLATE_SPECIALIZATION (td
))
19881 /* In the case of a friend template whose definition is provided
19882 outside the class, we may have too many arguments. Drop the
19883 ones we don't need. The same is true for specializations. */
19884 args
= get_innermost_template_args
19885 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
19889 if (TREE_CODE (d
) == FUNCTION_DECL
)
19891 deleted_p
= DECL_DELETED_FN (code_pattern
);
19892 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
19893 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
19899 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
19902 /* We may be in the middle of deferred access check. Disable it now. */
19903 push_deferring_access_checks (dk_no_deferred
);
19905 /* Unless an explicit instantiation directive has already determined
19906 the linkage of D, remember that a definition is available for
19908 if (pattern_defined
19909 && !DECL_INTERFACE_KNOWN (d
)
19910 && !DECL_NOT_REALLY_EXTERN (d
))
19911 mark_definable (d
);
19913 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
19914 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
19915 input_location
= DECL_SOURCE_LOCATION (d
);
19917 /* If D is a member of an explicitly instantiated class template,
19918 and no definition is available, treat it like an implicit
19920 if (!pattern_defined
&& expl_inst_class_mem_p
19921 && DECL_EXPLICIT_INSTANTIATION (d
))
19923 /* Leave linkage flags alone on instantiations with anonymous
19925 if (TREE_PUBLIC (d
))
19927 DECL_NOT_REALLY_EXTERN (d
) = 0;
19928 DECL_INTERFACE_KNOWN (d
) = 0;
19930 SET_DECL_IMPLICIT_INSTANTIATION (d
);
19933 /* Defer all other templates, unless we have been explicitly
19934 forbidden from doing so. */
19935 if (/* If there is no definition, we cannot instantiate the
19938 /* If it's OK to postpone instantiation, do so. */
19940 /* If this is a static data member that will be defined
19941 elsewhere, we don't want to instantiate the entire data
19942 member, but we do want to instantiate the initializer so that
19943 we can substitute that elsewhere. */
19944 || (external_p
&& VAR_P (d
))
19945 /* Handle here a deleted function too, avoid generating
19946 its body (c++/61080). */
19949 /* The definition of the static data member is now required so
19950 we must substitute the initializer. */
19952 && !DECL_INITIAL (d
)
19953 && DECL_INITIAL (code_pattern
))
19957 bool const_init
= false;
19958 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
19960 ns
= decl_namespace_context (d
);
19961 push_nested_namespace (ns
);
19963 push_nested_class (DECL_CONTEXT (d
));
19964 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
19966 tf_warning_or_error
, NULL_TREE
,
19967 /*integral_constant_expression_p=*/false);
19968 /* Make sure the initializer is still constant, in case of
19969 circular dependency (template/instantiate6.C). */
19971 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
19972 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
19973 /*asmspec_tree=*/NULL_TREE
,
19974 LOOKUP_ONLYCONVERTING
);
19976 pop_nested_class ();
19977 pop_nested_namespace (ns
);
19980 /* We restore the source position here because it's used by
19981 add_pending_template. */
19982 input_location
= saved_loc
;
19984 if (at_eof
&& !pattern_defined
19985 && DECL_EXPLICIT_INSTANTIATION (d
)
19986 && DECL_NOT_REALLY_EXTERN (d
))
19989 The definition of a non-exported function template, a
19990 non-exported member function template, or a non-exported
19991 member function or static data member of a class template
19992 shall be present in every translation unit in which it is
19993 explicitly instantiated. */
19994 permerror (input_location
, "explicit instantiation of %qD "
19995 "but no definition available", d
);
19997 /* If we're in unevaluated context, we just wanted to get the
19998 constant value; this isn't an odr use, so don't queue
19999 a full instantiation. */
20000 if (cp_unevaluated_operand
!= 0)
20002 /* ??? Historically, we have instantiated inline functions, even
20003 when marked as "extern template". */
20004 if (!(external_p
&& VAR_P (d
)))
20005 add_pending_template (d
);
20008 /* Tell the repository that D is available in this translation unit
20009 -- and see if it is supposed to be instantiated here. */
20010 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
20012 /* In a PCH file, despite the fact that the repository hasn't
20013 requested instantiation in the PCH it is still possible that
20014 an instantiation will be required in a file that includes the
20017 add_pending_template (d
);
20018 /* Instantiate inline functions so that the inliner can do its
20019 job, even though we'll not be emitting a copy of this
20021 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
20025 fn_context
= decl_function_context (d
);
20026 nested
= (current_function_decl
!= NULL_TREE
);
20028 push_to_top_level ();
20032 push_function_context ();
20033 cp_unevaluated_operand
= 0;
20034 c_inhibit_evaluation_warnings
= 0;
20037 /* Mark D as instantiated so that recursive calls to
20038 instantiate_decl do not try to instantiate it again. */
20039 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
20041 /* Regenerate the declaration in case the template has been modified
20042 by a subsequent redeclaration. */
20043 regenerate_decl_from_template (d
, td
);
20045 /* We already set the file and line above. Reset them now in case
20046 they changed as a result of calling regenerate_decl_from_template. */
20047 input_location
= DECL_SOURCE_LOCATION (d
);
20052 bool const_init
= false;
20054 /* Clear out DECL_RTL; whatever was there before may not be right
20055 since we've reset the type of the declaration. */
20056 SET_DECL_RTL (d
, NULL
);
20057 DECL_IN_AGGR_P (d
) = 0;
20059 /* The initializer is placed in DECL_INITIAL by
20060 regenerate_decl_from_template so we don't need to
20061 push/pop_access_scope again here. Pull it out so that
20062 cp_finish_decl can process it. */
20063 init
= DECL_INITIAL (d
);
20064 DECL_INITIAL (d
) = NULL_TREE
;
20065 DECL_INITIALIZED_P (d
) = 0;
20067 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
20068 initializer. That function will defer actual emission until
20069 we have a chance to determine linkage. */
20070 DECL_EXTERNAL (d
) = 0;
20072 /* Enter the scope of D so that access-checking works correctly. */
20073 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20075 push_nested_class (DECL_CONTEXT (d
));
20077 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20078 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
20081 pop_nested_class ();
20083 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
20084 synthesize_method (d
);
20085 else if (TREE_CODE (d
) == FUNCTION_DECL
)
20087 hash_map
<tree
, tree
> *saved_local_specializations
;
20091 tree block
= NULL_TREE
;
20093 /* Save away the current list, in case we are instantiating one
20094 template from within the body of another. */
20095 saved_local_specializations
= local_specializations
;
20097 /* Set up the list of local specializations. */
20098 local_specializations
= new hash_map
<tree
, tree
>;
20100 /* Set up context. */
20101 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20102 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20103 block
= push_stmt_list ();
20105 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
20107 /* Some typedefs referenced from within the template code need to be
20108 access checked at template instantiation time, i.e now. These
20109 types were added to the template at parsing time. Let's get those
20110 and perform the access checks then. */
20111 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
20114 /* Create substitution entries for the parameters. */
20115 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
20116 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
20117 spec_parm
= DECL_ARGUMENTS (d
);
20118 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
20120 register_local_specialization (spec_parm
, tmpl_parm
);
20121 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
20122 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
20124 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
20126 if (!DECL_PACK_P (tmpl_parm
))
20128 register_local_specialization (spec_parm
, tmpl_parm
);
20129 spec_parm
= DECL_CHAIN (spec_parm
);
20133 /* Register the (value) argument pack as a specialization of
20134 TMPL_PARM, then move on. */
20135 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
20136 register_local_specialization (argpack
, tmpl_parm
);
20139 gcc_assert (!spec_parm
);
20141 /* Substitute into the body of the function. */
20142 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20143 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
20144 tf_warning_or_error
, tmpl
);
20147 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
20148 tf_warning_or_error
, tmpl
,
20149 /*integral_constant_expression_p=*/false);
20151 /* Set the current input_location to the end of the function
20152 so that finish_function knows where we are. */
20154 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
20156 /* Remember if we saw an infinite loop in the template. */
20157 current_function_infinite_loop
20158 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
20161 /* We don't need the local specializations any more. */
20162 delete local_specializations
;
20163 local_specializations
= saved_local_specializations
;
20165 /* Finish the function. */
20166 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20167 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20168 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
20171 d
= finish_function (0);
20172 expand_or_defer_fn (d
);
20175 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20176 cp_check_omp_declare_reduction (d
);
20179 /* We're not deferring instantiation any more. */
20180 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
20183 pop_from_top_level ();
20185 pop_function_context ();
20188 input_location
= saved_loc
;
20189 cp_unevaluated_operand
= saved_unevaluated_operand
;
20190 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20191 pop_deferring_access_checks ();
20192 pop_tinst_level ();
20194 timevar_pop (TV_TEMPLATE_INST
);
20199 /* Run through the list of templates that we wish we could
20200 instantiate, and instantiate any we can. RETRIES is the
20201 number of times we retry pending template instantiation. */
20204 instantiate_pending_templates (int retries
)
20207 location_t saved_loc
= input_location
;
20209 /* Instantiating templates may trigger vtable generation. This in turn
20210 may require further template instantiations. We place a limit here
20211 to avoid infinite loop. */
20212 if (pending_templates
&& retries
>= max_tinst_depth
)
20214 tree decl
= pending_templates
->tinst
->decl
;
20216 error ("template instantiation depth exceeds maximum of %d"
20217 " instantiating %q+D, possibly from virtual table generation"
20218 " (use -ftemplate-depth= to increase the maximum)",
20219 max_tinst_depth
, decl
);
20220 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20221 /* Pretend that we defined it. */
20222 DECL_INITIAL (decl
) = error_mark_node
;
20228 struct pending_template
**t
= &pending_templates
;
20229 struct pending_template
*last
= NULL
;
20233 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
20234 bool complete
= false;
20236 if (TYPE_P (instantiation
))
20240 if (!COMPLETE_TYPE_P (instantiation
))
20242 instantiate_class_template (instantiation
);
20243 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
20244 for (fn
= TYPE_METHODS (instantiation
);
20246 fn
= TREE_CHAIN (fn
))
20247 if (! DECL_ARTIFICIAL (fn
))
20248 instantiate_decl (fn
,
20250 /*expl_inst_class_mem_p=*/false);
20251 if (COMPLETE_TYPE_P (instantiation
))
20255 complete
= COMPLETE_TYPE_P (instantiation
);
20259 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20260 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
20263 = instantiate_decl (instantiation
,
20265 /*expl_inst_class_mem_p=*/false);
20266 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20270 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20271 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20275 /* If INSTANTIATION has been instantiated, then we don't
20276 need to consider it again in the future. */
20284 current_tinst_level
= NULL
;
20286 last_pending_template
= last
;
20288 while (reconsider
);
20290 input_location
= saved_loc
;
20293 /* Substitute ARGVEC into T, which is a list of initializers for
20294 either base class or a non-static data member. The TREE_PURPOSEs
20295 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20296 instantiate_decl. */
20299 tsubst_initializer_list (tree t
, tree argvec
)
20301 tree inits
= NULL_TREE
;
20303 for (; t
; t
= TREE_CHAIN (t
))
20307 tree expanded_bases
= NULL_TREE
;
20308 tree expanded_arguments
= NULL_TREE
;
20311 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20316 /* Expand the base class expansion type into separate base
20318 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20319 tf_warning_or_error
,
20321 if (expanded_bases
== error_mark_node
)
20324 /* We'll be building separate TREE_LISTs of arguments for
20326 len
= TREE_VEC_LENGTH (expanded_bases
);
20327 expanded_arguments
= make_tree_vec (len
);
20328 for (i
= 0; i
< len
; i
++)
20329 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20331 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20332 expand each argument in the TREE_VALUE of t. */
20333 expr
= make_node (EXPR_PACK_EXPANSION
);
20334 PACK_EXPANSION_LOCAL_P (expr
) = true;
20335 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20336 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20338 if (TREE_VALUE (t
) == void_type_node
)
20339 /* VOID_TYPE_NODE is used to indicate
20340 value-initialization. */
20342 for (i
= 0; i
< len
; i
++)
20343 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20347 /* Substitute parameter packs into each argument in the
20349 in_base_initializer
= 1;
20350 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20352 tree expanded_exprs
;
20354 /* Expand the argument. */
20355 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20357 = tsubst_pack_expansion (expr
, argvec
,
20358 tf_warning_or_error
,
20360 if (expanded_exprs
== error_mark_node
)
20363 /* Prepend each of the expanded expressions to the
20364 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20365 for (i
= 0; i
< len
; i
++)
20367 TREE_VEC_ELT (expanded_arguments
, i
) =
20368 tree_cons (NULL_TREE
,
20369 TREE_VEC_ELT (expanded_exprs
, i
),
20370 TREE_VEC_ELT (expanded_arguments
, i
));
20373 in_base_initializer
= 0;
20375 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20376 since we built them backwards. */
20377 for (i
= 0; i
< len
; i
++)
20379 TREE_VEC_ELT (expanded_arguments
, i
) =
20380 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20385 for (i
= 0; i
< len
; ++i
)
20387 if (expanded_bases
)
20389 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20390 decl
= expand_member_init (decl
);
20391 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20396 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20397 tf_warning_or_error
, NULL_TREE
);
20399 decl
= expand_member_init (decl
);
20400 if (decl
&& !DECL_P (decl
))
20401 in_base_initializer
= 1;
20403 init
= TREE_VALUE (t
);
20405 if (init
!= void_type_node
)
20406 init
= tsubst_expr (init
, argvec
,
20407 tf_warning_or_error
, NULL_TREE
,
20408 /*integral_constant_expression_p=*/false);
20409 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20410 /* If we had an initializer but it instantiated to nothing,
20411 value-initialize the object. This will only occur when
20412 the initializer was a pack expansion where the parameter
20413 packs used in that expansion were of length zero. */
20414 init
= void_type_node
;
20415 in_base_initializer
= 0;
20420 init
= build_tree_list (decl
, init
);
20421 TREE_CHAIN (init
) = inits
;
20429 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20432 set_current_access_from_decl (tree decl
)
20434 if (TREE_PRIVATE (decl
))
20435 current_access_specifier
= access_private_node
;
20436 else if (TREE_PROTECTED (decl
))
20437 current_access_specifier
= access_protected_node
;
20439 current_access_specifier
= access_public_node
;
20442 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20443 is the instantiation (which should have been created with
20444 start_enum) and ARGS are the template arguments to use. */
20447 tsubst_enum (tree tag
, tree newtag
, tree args
)
20451 if (SCOPED_ENUM_P (newtag
))
20452 begin_scope (sk_scoped_enum
, newtag
);
20454 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20459 decl
= TREE_VALUE (e
);
20460 /* Note that in a template enum, the TREE_VALUE is the
20461 CONST_DECL, not the corresponding INTEGER_CST. */
20462 value
= tsubst_expr (DECL_INITIAL (decl
),
20463 args
, tf_warning_or_error
, NULL_TREE
,
20464 /*integral_constant_expression_p=*/true);
20466 /* Give this enumeration constant the correct access. */
20467 set_current_access_from_decl (decl
);
20469 /* Actually build the enumerator itself. */
20471 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
20474 if (SCOPED_ENUM_P (newtag
))
20477 finish_enum_value_list (newtag
);
20478 finish_enum (newtag
);
20480 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20481 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20484 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20485 its type -- but without substituting the innermost set of template
20486 arguments. So, innermost set of template parameters will appear in
20490 get_mostly_instantiated_function_type (tree decl
)
20498 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
20499 targs
= DECL_TI_ARGS (decl
);
20500 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
20501 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
20503 /* There should be as many levels of arguments as there are levels
20505 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
20507 fn_type
= TREE_TYPE (tmpl
);
20509 if (parm_depth
== 1)
20510 /* No substitution is necessary. */
20517 /* Replace the innermost level of the TARGS with NULL_TREEs to
20518 let tsubst know not to substitute for those parameters. */
20519 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20520 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
20521 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
20522 TMPL_ARGS_LEVEL (targs
, i
));
20523 SET_TMPL_ARGS_LEVEL (partial_args
,
20524 TMPL_ARGS_DEPTH (targs
),
20525 make_tree_vec (DECL_NTPARMS (tmpl
)));
20527 /* Make sure that we can see identifiers, and compute access
20529 push_access_scope (decl
);
20531 ++processing_template_decl
;
20532 /* Now, do the (partial) substitution to figure out the
20533 appropriate function type. */
20534 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
20535 --processing_template_decl
;
20537 /* Substitute into the template parameters to obtain the real
20538 innermost set of parameters. This step is important if the
20539 innermost set of template parameters contains value
20540 parameters whose types depend on outer template parameters. */
20541 TREE_VEC_LENGTH (partial_args
)--;
20542 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
20544 pop_access_scope (decl
);
20550 /* Return truthvalue if we're processing a template different from
20551 the last one involved in diagnostics. */
20553 problematic_instantiation_changed (void)
20555 return current_tinst_level
!= last_error_tinst_level
;
20558 /* Remember current template involved in diagnostics. */
20560 record_last_problematic_instantiation (void)
20562 last_error_tinst_level
= current_tinst_level
;
20565 struct tinst_level
*
20566 current_instantiation (void)
20568 return current_tinst_level
;
20571 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20572 type. Return zero for ok, nonzero for disallowed. Issue error and
20573 warning messages under control of COMPLAIN. */
20576 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20578 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20580 else if (POINTER_TYPE_P (type
))
20582 else if (TYPE_PTRMEM_P (type
))
20584 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20586 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20588 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20590 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20593 if (complain
& tf_error
)
20595 if (type
== error_mark_node
)
20596 inform (input_location
, "invalid template non-type parameter");
20598 error ("%q#T is not a valid type for a template non-type parameter",
20604 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20605 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20608 dependent_type_p_r (tree type
)
20614 A type is dependent if it is:
20616 -- a template parameter. Template template parameters are types
20617 for us (since TYPE_P holds true for them) so we handle
20619 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20620 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
20622 /* -- a qualified-id with a nested-name-specifier which contains a
20623 class-name that names a dependent type or whose unqualified-id
20624 names a dependent type. */
20625 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20627 /* -- a cv-qualified type where the cv-unqualified type is
20629 type
= TYPE_MAIN_VARIANT (type
);
20630 /* -- a compound type constructed from any dependent type. */
20631 if (TYPE_PTRMEM_P (type
))
20632 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
20633 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
20635 else if (TYPE_PTR_P (type
)
20636 || TREE_CODE (type
) == REFERENCE_TYPE
)
20637 return dependent_type_p (TREE_TYPE (type
));
20638 else if (TREE_CODE (type
) == FUNCTION_TYPE
20639 || TREE_CODE (type
) == METHOD_TYPE
)
20643 if (dependent_type_p (TREE_TYPE (type
)))
20645 for (arg_type
= TYPE_ARG_TYPES (type
);
20647 arg_type
= TREE_CHAIN (arg_type
))
20648 if (dependent_type_p (TREE_VALUE (arg_type
)))
20652 /* -- an array type constructed from any dependent type or whose
20653 size is specified by a constant expression that is
20656 We checked for type- and value-dependence of the bounds in
20657 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20658 if (TREE_CODE (type
) == ARRAY_TYPE
)
20660 if (TYPE_DOMAIN (type
)
20661 && dependent_type_p (TYPE_DOMAIN (type
)))
20663 return dependent_type_p (TREE_TYPE (type
));
20666 /* -- a template-id in which either the template name is a template
20668 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20670 /* ... or any of the template arguments is a dependent type or
20671 an expression that is type-dependent or value-dependent. */
20672 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
20673 && (any_dependent_template_arguments_p
20674 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
20677 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20678 dependent; if the argument of the `typeof' expression is not
20679 type-dependent, then it should already been have resolved. */
20680 if (TREE_CODE (type
) == TYPEOF_TYPE
20681 || TREE_CODE (type
) == DECLTYPE_TYPE
20682 || TREE_CODE (type
) == UNDERLYING_TYPE
)
20685 /* A template argument pack is dependent if any of its packed
20687 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
20689 tree args
= ARGUMENT_PACK_ARGS (type
);
20690 int i
, len
= TREE_VEC_LENGTH (args
);
20691 for (i
= 0; i
< len
; ++i
)
20692 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20696 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20697 be template parameters. */
20698 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
20701 /* The standard does not specifically mention types that are local
20702 to template functions or local classes, but they should be
20703 considered dependent too. For example:
20705 template <int I> void f() {
20710 The size of `E' cannot be known until the value of `I' has been
20711 determined. Therefore, `E' must be considered dependent. */
20712 scope
= TYPE_CONTEXT (type
);
20713 if (scope
&& TYPE_P (scope
))
20714 return dependent_type_p (scope
);
20715 /* Don't use type_dependent_expression_p here, as it can lead
20716 to infinite recursion trying to determine whether a lambda
20717 nested in a lambda is dependent (c++/47687). */
20718 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
20719 && DECL_LANG_SPECIFIC (scope
)
20720 && DECL_TEMPLATE_INFO (scope
)
20721 && (any_dependent_template_arguments_p
20722 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
20725 /* Other types are non-dependent. */
20729 /* Returns TRUE if TYPE is dependent, in the sense of
20730 [temp.dep.type]. Note that a NULL type is considered dependent. */
20733 dependent_type_p (tree type
)
20735 /* If there are no template parameters in scope, then there can't be
20736 any dependent types. */
20737 if (!processing_template_decl
)
20739 /* If we are not processing a template, then nobody should be
20740 providing us with a dependent type. */
20742 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
20746 /* If the type is NULL, we have not computed a type for the entity
20747 in question; in that case, the type is dependent. */
20751 /* Erroneous types can be considered non-dependent. */
20752 if (type
== error_mark_node
)
20755 /* If we have not already computed the appropriate value for TYPE,
20757 if (!TYPE_DEPENDENT_P_VALID (type
))
20759 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
20760 TYPE_DEPENDENT_P_VALID (type
) = 1;
20763 return TYPE_DEPENDENT_P (type
);
20766 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
20767 lookup. In other words, a dependent type that is not the current
20771 dependent_scope_p (tree scope
)
20773 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
20774 && !currently_open_class (scope
));
20777 /* T is a SCOPE_REF; return whether we need to consider it
20778 instantiation-dependent so that we can check access at instantiation
20779 time even though we know which member it resolves to. */
20782 instantiation_dependent_scope_ref_p (tree t
)
20784 if (DECL_P (TREE_OPERAND (t
, 1))
20785 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
20786 && accessible_in_template_p (TREE_OPERAND (t
, 0),
20787 TREE_OPERAND (t
, 1)))
20793 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
20794 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
20797 /* Note that this predicate is not appropriate for general expressions;
20798 only constant expressions (that satisfy potential_constant_expression)
20799 can be tested for value dependence. */
20802 value_dependent_expression_p (tree expression
)
20804 if (!processing_template_decl
)
20807 /* A name declared with a dependent type. */
20808 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
20811 switch (TREE_CODE (expression
))
20813 case IDENTIFIER_NODE
:
20814 /* A name that has not been looked up -- must be dependent. */
20817 case TEMPLATE_PARM_INDEX
:
20818 /* A non-type template parm. */
20822 /* A non-type template parm. */
20823 if (DECL_TEMPLATE_PARM_P (expression
))
20825 return value_dependent_expression_p (DECL_INITIAL (expression
));
20828 /* A constant with literal type and is initialized
20829 with an expression that is value-dependent.
20831 Note that a non-dependent parenthesized initializer will have
20832 already been replaced with its constant value, so if we see
20833 a TREE_LIST it must be dependent. */
20834 if (DECL_INITIAL (expression
)
20835 && decl_constant_var_p (expression
)
20836 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
20837 || value_dependent_expression_p (DECL_INITIAL (expression
))))
20841 case DYNAMIC_CAST_EXPR
:
20842 case STATIC_CAST_EXPR
:
20843 case CONST_CAST_EXPR
:
20844 case REINTERPRET_CAST_EXPR
:
20846 /* These expressions are value-dependent if the type to which
20847 the cast occurs is dependent or the expression being casted
20848 is value-dependent. */
20850 tree type
= TREE_TYPE (expression
);
20852 if (dependent_type_p (type
))
20855 /* A functional cast has a list of operands. */
20856 expression
= TREE_OPERAND (expression
, 0);
20859 /* If there are no operands, it must be an expression such
20860 as "int()". This should not happen for aggregate types
20861 because it would form non-constant expressions. */
20862 gcc_assert (cxx_dialect
>= cxx11
20863 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
20868 if (TREE_CODE (expression
) == TREE_LIST
)
20869 return any_value_dependent_elements_p (expression
);
20871 return value_dependent_expression_p (expression
);
20875 if (SIZEOF_EXPR_TYPE_P (expression
))
20876 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
20880 /* A `sizeof' expression is value-dependent if the operand is
20881 type-dependent or is a pack expansion. */
20882 expression
= TREE_OPERAND (expression
, 0);
20883 if (PACK_EXPANSION_P (expression
))
20885 else if (TYPE_P (expression
))
20886 return dependent_type_p (expression
);
20887 return instantiation_dependent_expression_p (expression
);
20889 case AT_ENCODE_EXPR
:
20890 /* An 'encode' expression is value-dependent if the operand is
20892 expression
= TREE_OPERAND (expression
, 0);
20893 return dependent_type_p (expression
);
20895 case NOEXCEPT_EXPR
:
20896 expression
= TREE_OPERAND (expression
, 0);
20897 return instantiation_dependent_expression_p (expression
);
20900 /* All instantiation-dependent expressions should also be considered
20901 value-dependent. */
20902 return instantiation_dependent_scope_ref_p (expression
);
20904 case COMPONENT_REF
:
20905 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
20906 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
20908 case NONTYPE_ARGUMENT_PACK
:
20909 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
20910 is value-dependent. */
20912 tree values
= ARGUMENT_PACK_ARGS (expression
);
20913 int i
, len
= TREE_VEC_LENGTH (values
);
20915 for (i
= 0; i
< len
; ++i
)
20916 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
20924 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
20925 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
20926 || (type2
? dependent_type_p (type2
) : false));
20930 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20931 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
20934 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20935 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
20939 tree op
= TREE_OPERAND (expression
, 0);
20940 return (value_dependent_expression_p (op
)
20941 || has_value_dependent_address (op
));
20946 tree fn
= get_callee_fndecl (expression
);
20948 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
20950 nargs
= call_expr_nargs (expression
);
20951 for (i
= 0; i
< nargs
; ++i
)
20953 tree op
= CALL_EXPR_ARG (expression
, i
);
20954 /* In a call to a constexpr member function, look through the
20955 implicit ADDR_EXPR on the object argument so that it doesn't
20956 cause the call to be considered value-dependent. We also
20957 look through it in potential_constant_expression. */
20958 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
20959 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
20960 && TREE_CODE (op
) == ADDR_EXPR
)
20961 op
= TREE_OPERAND (op
, 0);
20962 if (value_dependent_expression_p (op
))
20968 case TEMPLATE_ID_EXPR
:
20969 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
20971 return type_dependent_expression_p (expression
);
20977 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
20978 if (value_dependent_expression_p (val
))
20984 /* Treat a GNU statement expression as dependent to avoid crashing
20985 under fold_non_dependent_expr; it can't be constant. */
20989 /* A constant expression is value-dependent if any subexpression is
20990 value-dependent. */
20991 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
20993 case tcc_reference
:
20995 case tcc_comparison
:
20997 case tcc_expression
:
21000 int i
, len
= cp_tree_operand_length (expression
);
21002 for (i
= 0; i
< len
; i
++)
21004 tree t
= TREE_OPERAND (expression
, i
);
21006 /* In some cases, some of the operands may be missing.l
21007 (For example, in the case of PREDECREMENT_EXPR, the
21008 amount to increment by may be missing.) That doesn't
21009 make the expression dependent. */
21010 if (t
&& value_dependent_expression_p (t
))
21021 /* The expression is not value-dependent. */
21025 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
21026 [temp.dep.expr]. Note that an expression with no type is
21027 considered dependent. Other parts of the compiler arrange for an
21028 expression with type-dependent subexpressions to have no type, so
21029 this function doesn't have to be fully recursive. */
21032 type_dependent_expression_p (tree expression
)
21034 if (!processing_template_decl
)
21037 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
21040 /* An unresolved name is always dependent. */
21041 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
21044 /* Some expression forms are never type-dependent. */
21045 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
21046 || TREE_CODE (expression
) == SIZEOF_EXPR
21047 || TREE_CODE (expression
) == ALIGNOF_EXPR
21048 || TREE_CODE (expression
) == AT_ENCODE_EXPR
21049 || TREE_CODE (expression
) == NOEXCEPT_EXPR
21050 || TREE_CODE (expression
) == TRAIT_EXPR
21051 || TREE_CODE (expression
) == TYPEID_EXPR
21052 || TREE_CODE (expression
) == DELETE_EXPR
21053 || TREE_CODE (expression
) == VEC_DELETE_EXPR
21054 || TREE_CODE (expression
) == THROW_EXPR
)
21057 /* The types of these expressions depends only on the type to which
21058 the cast occurs. */
21059 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
21060 || TREE_CODE (expression
) == STATIC_CAST_EXPR
21061 || TREE_CODE (expression
) == CONST_CAST_EXPR
21062 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
21063 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
21064 || TREE_CODE (expression
) == CAST_EXPR
)
21065 return dependent_type_p (TREE_TYPE (expression
));
21067 /* The types of these expressions depends only on the type created
21068 by the expression. */
21069 if (TREE_CODE (expression
) == NEW_EXPR
21070 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
21072 /* For NEW_EXPR tree nodes created inside a template, either
21073 the object type itself or a TREE_LIST may appear as the
21075 tree type
= TREE_OPERAND (expression
, 1);
21076 if (TREE_CODE (type
) == TREE_LIST
)
21077 /* This is an array type. We need to check array dimensions
21079 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
21080 || value_dependent_expression_p
21081 (TREE_OPERAND (TREE_VALUE (type
), 1));
21083 return dependent_type_p (type
);
21086 if (TREE_CODE (expression
) == SCOPE_REF
)
21088 tree scope
= TREE_OPERAND (expression
, 0);
21089 tree name
= TREE_OPERAND (expression
, 1);
21091 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
21092 contains an identifier associated by name lookup with one or more
21093 declarations declared with a dependent type, or...a
21094 nested-name-specifier or qualified-id that names a member of an
21095 unknown specialization. */
21096 return (type_dependent_expression_p (name
)
21097 || dependent_scope_p (scope
));
21100 if (TREE_CODE (expression
) == FUNCTION_DECL
21101 && DECL_LANG_SPECIFIC (expression
)
21102 && DECL_TEMPLATE_INFO (expression
)
21103 && (any_dependent_template_arguments_p
21104 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
21107 if (TREE_CODE (expression
) == TEMPLATE_DECL
21108 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
21111 if (TREE_CODE (expression
) == STMT_EXPR
)
21112 expression
= stmt_expr_value_expr (expression
);
21114 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
21119 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
21121 if (type_dependent_expression_p (elt
))
21127 /* A static data member of the current instantiation with incomplete
21128 array type is type-dependent, as the definition and specializations
21129 can have different bounds. */
21130 if (VAR_P (expression
)
21131 && DECL_CLASS_SCOPE_P (expression
)
21132 && dependent_type_p (DECL_CONTEXT (expression
))
21133 && VAR_HAD_UNKNOWN_BOUND (expression
))
21136 /* An array of unknown bound depending on a variadic parameter, eg:
21138 template<typename... Args>
21139 void foo (Args... args)
21141 int arr[] = { args... };
21144 template<int... vals>
21147 int arr[] = { vals... };
21150 If the array has no length and has an initializer, it must be that
21151 we couldn't determine its length in cp_complete_array_type because
21152 it is dependent. */
21153 if (VAR_P (expression
)
21154 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
21155 && !TYPE_DOMAIN (TREE_TYPE (expression
))
21156 && DECL_INITIAL (expression
))
21159 if (TREE_TYPE (expression
) == unknown_type_node
)
21161 if (TREE_CODE (expression
) == ADDR_EXPR
)
21162 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
21163 if (TREE_CODE (expression
) == COMPONENT_REF
21164 || TREE_CODE (expression
) == OFFSET_REF
)
21166 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21168 expression
= TREE_OPERAND (expression
, 1);
21169 if (identifier_p (expression
))
21172 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21173 if (TREE_CODE (expression
) == SCOPE_REF
)
21176 /* Always dependent, on the number of arguments if nothing else. */
21177 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
21180 if (BASELINK_P (expression
))
21182 if (BASELINK_OPTYPE (expression
)
21183 && dependent_type_p (BASELINK_OPTYPE (expression
)))
21185 expression
= BASELINK_FUNCTIONS (expression
);
21188 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
21190 if (any_dependent_template_arguments_p
21191 (TREE_OPERAND (expression
, 1)))
21193 expression
= TREE_OPERAND (expression
, 0);
21195 gcc_assert (TREE_CODE (expression
) == OVERLOAD
21196 || TREE_CODE (expression
) == FUNCTION_DECL
);
21200 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
21202 expression
= OVL_NEXT (expression
);
21207 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
21209 return (dependent_type_p (TREE_TYPE (expression
)));
21212 /* walk_tree callback function for instantiation_dependent_expression_p,
21213 below. Returns non-zero if a dependent subexpression is found. */
21216 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
21221 /* We don't have to worry about decltype currently because decltype
21222 of an instantiation-dependent expr is a dependent type. This
21223 might change depending on the resolution of DR 1172. */
21224 *walk_subtrees
= false;
21227 enum tree_code code
= TREE_CODE (*tp
);
21230 /* Don't treat an argument list as dependent just because it has no
21238 /* A constant with a dependent initializer is dependent. */
21239 if (value_dependent_expression_p (*tp
))
21243 case TEMPLATE_PARM_INDEX
:
21246 /* Handle expressions with type operands. */
21250 case AT_ENCODE_EXPR
:
21252 tree op
= TREE_OPERAND (*tp
, 0);
21253 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
21254 op
= TREE_TYPE (op
);
21257 if (dependent_type_p (op
))
21261 *walk_subtrees
= false;
21269 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21270 || (TRAIT_EXPR_TYPE2 (*tp
)
21271 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21273 *walk_subtrees
= false;
21276 case COMPONENT_REF
:
21277 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21278 /* In a template, finish_class_member_access_expr creates a
21279 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21280 type-dependent, so that we can check access control at
21281 instantiation time (PR 42277). See also Core issue 1273. */
21286 if (instantiation_dependent_scope_ref_p (*tp
))
21291 /* Treat statement-expressions as dependent. */
21299 if (type_dependent_expression_p (*tp
))
21305 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21306 sense defined by the ABI:
21308 "An expression is instantiation-dependent if it is type-dependent
21309 or value-dependent, or it has a subexpression that is type-dependent
21310 or value-dependent." */
21313 instantiation_dependent_expression_p (tree expression
)
21317 if (!processing_template_decl
)
21320 if (expression
== error_mark_node
)
21323 result
= cp_walk_tree_without_duplicates (&expression
,
21324 instantiation_dependent_r
, NULL
);
21325 return result
!= NULL_TREE
;
21328 /* Like type_dependent_expression_p, but it also works while not processing
21329 a template definition, i.e. during substitution or mangling. */
21332 type_dependent_expression_p_push (tree expr
)
21335 ++processing_template_decl
;
21336 b
= type_dependent_expression_p (expr
);
21337 --processing_template_decl
;
21341 /* Returns TRUE if ARGS contains a type-dependent expression. */
21344 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21349 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21351 if (type_dependent_expression_p (arg
))
21357 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21358 expressions) contains any type-dependent expressions. */
21361 any_type_dependent_elements_p (const_tree list
)
21363 for (; list
; list
= TREE_CHAIN (list
))
21364 if (type_dependent_expression_p (TREE_VALUE (list
)))
21370 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21371 expressions) contains any value-dependent expressions. */
21374 any_value_dependent_elements_p (const_tree list
)
21376 for (; list
; list
= TREE_CHAIN (list
))
21377 if (value_dependent_expression_p (TREE_VALUE (list
)))
21383 /* Returns TRUE if the ARG (a template argument) is dependent. */
21386 dependent_template_arg_p (tree arg
)
21388 if (!processing_template_decl
)
21391 /* Assume a template argument that was wrongly written by the user
21392 is dependent. This is consistent with what
21393 any_dependent_template_arguments_p [that calls this function]
21395 if (!arg
|| arg
== error_mark_node
)
21398 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21399 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21401 if (TREE_CODE (arg
) == TEMPLATE_DECL
21402 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21403 return dependent_template_p (arg
);
21404 else if (ARGUMENT_PACK_P (arg
))
21406 tree args
= ARGUMENT_PACK_ARGS (arg
);
21407 int i
, len
= TREE_VEC_LENGTH (args
);
21408 for (i
= 0; i
< len
; ++i
)
21410 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21416 else if (TYPE_P (arg
))
21417 return dependent_type_p (arg
);
21419 return (type_dependent_expression_p (arg
)
21420 || value_dependent_expression_p (arg
));
21423 /* Returns true if ARGS (a collection of template arguments) contains
21424 any types that require structural equality testing. */
21427 any_template_arguments_need_structural_equality_p (tree args
)
21434 if (args
== error_mark_node
)
21437 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21439 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21440 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21442 tree arg
= TREE_VEC_ELT (level
, j
);
21443 tree packed_args
= NULL_TREE
;
21446 if (ARGUMENT_PACK_P (arg
))
21448 /* Look inside the argument pack. */
21449 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21450 len
= TREE_VEC_LENGTH (packed_args
);
21453 for (k
= 0; k
< len
; ++k
)
21456 arg
= TREE_VEC_ELT (packed_args
, k
);
21458 if (error_operand_p (arg
))
21460 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21462 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21464 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21465 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21474 /* Returns true if ARGS (a collection of template arguments) contains
21475 any dependent arguments. */
21478 any_dependent_template_arguments_p (const_tree args
)
21485 if (args
== error_mark_node
)
21488 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21490 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21491 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21492 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21499 /* Returns TRUE if the template TMPL is dependent. */
21502 dependent_template_p (tree tmpl
)
21504 if (TREE_CODE (tmpl
) == OVERLOAD
)
21508 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21510 tmpl
= OVL_NEXT (tmpl
);
21515 /* Template template parameters are dependent. */
21516 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21517 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21519 /* So are names that have not been looked up. */
21520 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21522 /* So are member templates of dependent classes. */
21523 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21524 return dependent_type_p (DECL_CONTEXT (tmpl
));
21528 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21531 dependent_template_id_p (tree tmpl
, tree args
)
21533 return (dependent_template_p (tmpl
)
21534 || any_dependent_template_arguments_p (args
));
21537 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21541 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21545 if (!processing_template_decl
)
21548 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21550 tree decl
= TREE_VEC_ELT (declv
, i
);
21551 tree init
= TREE_VEC_ELT (initv
, i
);
21552 tree cond
= TREE_VEC_ELT (condv
, i
);
21553 tree incr
= TREE_VEC_ELT (incrv
, i
);
21555 if (type_dependent_expression_p (decl
))
21558 if (init
&& type_dependent_expression_p (init
))
21561 if (type_dependent_expression_p (cond
))
21564 if (COMPARISON_CLASS_P (cond
)
21565 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21566 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21569 if (TREE_CODE (incr
) == MODOP_EXPR
)
21571 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21572 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21575 else if (type_dependent_expression_p (incr
))
21577 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21579 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21581 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
21583 tree t
= TREE_OPERAND (incr
, 1);
21584 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
21585 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
21594 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21595 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21596 no such TYPE can be found. Note that this function peers inside
21597 uninstantiated templates and therefore should be used only in
21598 extremely limited situations. ONLY_CURRENT_P restricts this
21599 peering to the currently open classes hierarchy (which is required
21600 when comparing types). */
21603 resolve_typename_type (tree type
, bool only_current_p
)
21612 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
21614 scope
= TYPE_CONTEXT (type
);
21615 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21616 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21617 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21618 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21619 identifier of the TYPENAME_TYPE anymore.
21620 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21621 TYPENAME_TYPE instead, we avoid messing up with a possible
21622 typedef variant case. */
21623 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
21625 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21626 it first before we can figure out what NAME refers to. */
21627 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21629 if (TYPENAME_IS_RESOLVING_P (scope
))
21630 /* Given a class template A with a dependent base with nested type C,
21631 typedef typename A::C::C C will land us here, as trying to resolve
21632 the initial A::C leads to the local C typedef, which leads back to
21633 A::C::C. So we break the recursion now. */
21636 scope
= resolve_typename_type (scope
, only_current_p
);
21638 /* If we don't know what SCOPE refers to, then we cannot resolve the
21640 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21642 /* If the SCOPE is a template type parameter, we have no way of
21643 resolving the name. */
21644 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
21646 /* If the SCOPE is not the current instantiation, there's no reason
21647 to look inside it. */
21648 if (only_current_p
&& !currently_open_class (scope
))
21650 /* If this is a typedef, we don't want to look inside (c++/11987). */
21651 if (typedef_variant_p (type
))
21653 /* If SCOPE isn't the template itself, it will not have a valid
21654 TYPE_FIELDS list. */
21655 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
21656 /* scope is either the template itself or a compatible instantiation
21657 like X<T>, so look up the name in the original template. */
21658 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
21660 /* scope is a partial instantiation, so we can't do the lookup or we
21661 will lose the template arguments. */
21663 /* Enter the SCOPE so that name lookup will be resolved as if we
21664 were in the class definition. In particular, SCOPE will no
21665 longer be considered a dependent type. */
21666 pushed_scope
= push_scope (scope
);
21667 /* Look up the declaration. */
21668 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
21669 tf_warning_or_error
);
21671 result
= NULL_TREE
;
21673 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21674 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21677 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
21678 && TREE_CODE (decl
) == TYPE_DECL
)
21680 result
= TREE_TYPE (decl
);
21681 if (result
== error_mark_node
)
21682 result
= NULL_TREE
;
21684 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
21685 && DECL_CLASS_TEMPLATE_P (decl
))
21689 /* Obtain the template and the arguments. */
21690 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
21691 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
21692 /* Instantiate the template. */
21693 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
21694 /*entering_scope=*/0,
21695 tf_error
| tf_user
);
21696 if (result
== error_mark_node
)
21697 result
= NULL_TREE
;
21700 /* Leave the SCOPE. */
21702 pop_scope (pushed_scope
);
21704 /* If we failed to resolve it, return the original typename. */
21708 /* If lookup found a typename type, resolve that too. */
21709 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
21711 /* Ill-formed programs can cause infinite recursion here, so we
21712 must catch that. */
21713 TYPENAME_IS_RESOLVING_P (type
) = 1;
21714 result
= resolve_typename_type (result
, only_current_p
);
21715 TYPENAME_IS_RESOLVING_P (type
) = 0;
21718 /* Qualify the resulting type. */
21719 quals
= cp_type_quals (type
);
21721 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
21726 /* EXPR is an expression which is not type-dependent. Return a proxy
21727 for EXPR that can be used to compute the types of larger
21728 expressions containing EXPR. */
21731 build_non_dependent_expr (tree expr
)
21735 #ifdef ENABLE_CHECKING
21736 /* Try to get a constant value for all non-dependent expressions in
21737 order to expose bugs in *_dependent_expression_p and constexpr. */
21738 if (cxx_dialect
>= cxx11
)
21739 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
21742 /* Preserve OVERLOADs; the functions must be available to resolve
21745 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
21746 inner_expr
= stmt_expr_value_expr (inner_expr
);
21747 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
21748 inner_expr
= TREE_OPERAND (inner_expr
, 0);
21749 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
21750 inner_expr
= TREE_OPERAND (inner_expr
, 1);
21751 if (is_overloaded_fn (inner_expr
)
21752 || TREE_CODE (inner_expr
) == OFFSET_REF
)
21754 /* There is no need to return a proxy for a variable. */
21757 /* Preserve string constants; conversions from string constants to
21758 "char *" are allowed, even though normally a "const char *"
21759 cannot be used to initialize a "char *". */
21760 if (TREE_CODE (expr
) == STRING_CST
)
21762 /* Preserve void and arithmetic constants, as an optimization -- there is no
21763 reason to create a new node. */
21764 if (TREE_CODE (expr
) == VOID_CST
21765 || TREE_CODE (expr
) == INTEGER_CST
21766 || TREE_CODE (expr
) == REAL_CST
)
21768 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
21769 There is at least one place where we want to know that a
21770 particular expression is a throw-expression: when checking a ?:
21771 expression, there are special rules if the second or third
21772 argument is a throw-expression. */
21773 if (TREE_CODE (expr
) == THROW_EXPR
)
21776 /* Don't wrap an initializer list, we need to be able to look inside. */
21777 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
21780 /* Don't wrap a dummy object, we need to be able to test for it. */
21781 if (is_dummy_object (expr
))
21784 if (TREE_CODE (expr
) == COND_EXPR
)
21785 return build3 (COND_EXPR
,
21787 TREE_OPERAND (expr
, 0),
21788 (TREE_OPERAND (expr
, 1)
21789 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
21790 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
21791 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
21792 if (TREE_CODE (expr
) == COMPOUND_EXPR
21793 && !COMPOUND_EXPR_OVERLOADED (expr
))
21794 return build2 (COMPOUND_EXPR
,
21796 TREE_OPERAND (expr
, 0),
21797 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
21799 /* If the type is unknown, it can't really be non-dependent */
21800 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
21802 /* Otherwise, build a NON_DEPENDENT_EXPR. */
21803 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
21806 /* ARGS is a vector of expressions as arguments to a function call.
21807 Replace the arguments with equivalent non-dependent expressions.
21808 This modifies ARGS in place. */
21811 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
21816 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
21818 tree newarg
= build_non_dependent_expr (arg
);
21820 (*args
)[ix
] = newarg
;
21824 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
21825 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
21829 make_auto_1 (tree name
)
21831 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
21832 TYPE_NAME (au
) = build_decl (input_location
,
21833 TYPE_DECL
, name
, au
);
21834 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
21835 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
21836 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
21837 TYPE_NAME (au
), NULL_TREE
);
21838 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
21839 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
21840 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
21846 make_decltype_auto (void)
21848 return make_auto_1 (get_identifier ("decltype(auto)"));
21854 return make_auto_1 (get_identifier ("auto"));
21857 /* Given type ARG, return std::initializer_list<ARG>. */
21862 tree std_init_list
= namespace_binding
21863 (get_identifier ("initializer_list"), std_node
);
21865 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
21867 error ("deducing from brace-enclosed initializer list requires "
21868 "#include <initializer_list>");
21869 return error_mark_node
;
21871 argvec
= make_tree_vec (1);
21872 TREE_VEC_ELT (argvec
, 0) = arg
;
21873 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
21874 NULL_TREE
, 0, tf_warning_or_error
);
21877 /* Replace auto in TYPE with std::initializer_list<auto>. */
21880 listify_autos (tree type
, tree auto_node
)
21882 tree init_auto
= listify (auto_node
);
21883 tree argvec
= make_tree_vec (1);
21884 TREE_VEC_ELT (argvec
, 0) = init_auto
;
21885 if (processing_template_decl
)
21886 argvec
= add_to_template_args (current_template_args (), argvec
);
21887 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21890 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
21891 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
21894 do_auto_deduction (tree type
, tree init
, tree auto_node
)
21898 if (init
== error_mark_node
)
21899 return error_mark_node
;
21901 if (type_dependent_expression_p (init
))
21902 /* Defining a subset of type-dependent expressions that we can deduce
21903 from ahead of time isn't worth the trouble. */
21906 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
21907 with either a new invented type template parameter U or, if the
21908 initializer is a braced-init-list (8.5.4), with
21909 std::initializer_list<U>. */
21910 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
21911 type
= listify_autos (type
, auto_node
);
21913 init
= resolve_nondeduced_context (init
);
21915 targs
= make_tree_vec (1);
21916 if (AUTO_IS_DECLTYPE (auto_node
))
21918 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
21919 && !REF_PARENTHESIZED_P (init
)));
21920 TREE_VEC_ELT (targs
, 0)
21921 = finish_decltype_type (init
, id
, tf_warning_or_error
);
21922 if (type
!= auto_node
)
21924 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
21925 return error_mark_node
;
21930 tree parms
= build_tree_list (NULL_TREE
, type
);
21931 tree tparms
= make_tree_vec (1);
21934 TREE_VEC_ELT (tparms
, 0)
21935 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
21936 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
21937 DEDUCE_CALL
, LOOKUP_NORMAL
,
21938 NULL
, /*explain_p=*/false);
21941 if (processing_template_decl
)
21942 /* Try again at instantiation time. */
21944 if (type
&& type
!= error_mark_node
)
21945 /* If type is error_mark_node a diagnostic must have been
21946 emitted by now. Also, having a mention to '<type error>'
21947 in the diagnostic is not really useful to the user. */
21949 if (cfun
&& auto_node
== current_function_auto_return_pattern
21950 && LAMBDA_FUNCTION_P (current_function_decl
))
21951 error ("unable to deduce lambda return type from %qE", init
);
21953 error ("unable to deduce %qT from %qE", type
, init
);
21955 return error_mark_node
;
21959 /* If the list of declarators contains more than one declarator, the type
21960 of each declared variable is determined as described above. If the
21961 type deduced for the template parameter U is not the same in each
21962 deduction, the program is ill-formed. */
21963 if (TREE_TYPE (auto_node
)
21964 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
21966 if (cfun
&& auto_node
== current_function_auto_return_pattern
21967 && LAMBDA_FUNCTION_P (current_function_decl
))
21968 error ("inconsistent types %qT and %qT deduced for "
21969 "lambda return type", TREE_TYPE (auto_node
),
21970 TREE_VEC_ELT (targs
, 0));
21972 error ("inconsistent deduction for %qT: %qT and then %qT",
21973 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
21974 return error_mark_node
;
21976 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
21978 if (processing_template_decl
)
21979 targs
= add_to_template_args (current_template_args (), targs
);
21980 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
21983 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
21987 splice_late_return_type (tree type
, tree late_return_type
)
21991 if (late_return_type
== NULL_TREE
)
21993 argvec
= make_tree_vec (1);
21994 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
21995 if (processing_template_parmlist
)
21996 /* For a late-specified return type in a template type-parameter, we
21997 need to add a dummy argument level for its parmlist. */
21998 argvec
= add_to_template_args
21999 (make_tree_vec (processing_template_parmlist
), argvec
);
22000 if (current_template_parms
)
22001 argvec
= add_to_template_args (current_template_args (), argvec
);
22002 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22005 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
22006 'decltype(auto)'. */
22009 is_auto (const_tree type
)
22011 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22012 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
22013 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
22019 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
22020 a use of `auto'. Returns NULL_TREE otherwise. */
22023 type_uses_auto (tree type
)
22025 return find_type_usage (type
, is_auto
);
22028 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
22029 'decltype(auto)' or a concept. */
22032 is_auto_or_concept (const_tree type
)
22034 return is_auto (type
); // or concept
22037 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
22038 a concept identifier) iff TYPE contains a use of a generic type. Returns
22039 NULL_TREE otherwise. */
22042 type_uses_auto_or_concept (tree type
)
22044 return find_type_usage (type
, is_auto_or_concept
);
22048 /* For a given template T, return the vector of typedefs referenced
22049 in T for which access check is needed at T instantiation time.
22050 T is either a FUNCTION_DECL or a RECORD_TYPE.
22051 Those typedefs were added to T by the function
22052 append_type_to_template_for_access_check. */
22054 vec
<qualified_typedef_usage_t
, va_gc
> *
22055 get_types_needing_access_check (tree t
)
22058 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
22060 if (!t
|| t
== error_mark_node
)
22063 if (!(ti
= get_template_info (t
)))
22066 if (CLASS_TYPE_P (t
)
22067 || TREE_CODE (t
) == FUNCTION_DECL
)
22069 if (!TI_TEMPLATE (ti
))
22072 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
22078 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
22079 tied to T. That list of typedefs will be access checked at
22080 T instantiation time.
22081 T is either a FUNCTION_DECL or a RECORD_TYPE.
22082 TYPE_DECL is a TYPE_DECL node representing a typedef.
22083 SCOPE is the scope through which TYPE_DECL is accessed.
22084 LOCATION is the location of the usage point of TYPE_DECL.
22086 This function is a subroutine of
22087 append_type_to_template_for_access_check. */
22090 append_type_to_template_for_access_check_1 (tree t
,
22093 location_t location
)
22095 qualified_typedef_usage_t typedef_usage
;
22098 if (!t
|| t
== error_mark_node
)
22101 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
22102 || CLASS_TYPE_P (t
))
22104 && TREE_CODE (type_decl
) == TYPE_DECL
22107 if (!(ti
= get_template_info (t
)))
22110 gcc_assert (TI_TEMPLATE (ti
));
22112 typedef_usage
.typedef_decl
= type_decl
;
22113 typedef_usage
.context
= scope
;
22114 typedef_usage
.locus
= location
;
22116 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
22119 /* Append TYPE_DECL to the template TEMPL.
22120 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
22121 At TEMPL instanciation time, TYPE_DECL will be checked to see
22122 if it can be accessed through SCOPE.
22123 LOCATION is the location of the usage point of TYPE_DECL.
22125 e.g. consider the following code snippet:
22132 template<class U> struct S
22134 C::myint mi; // <-- usage point of the typedef C::myint
22139 At S<char> instantiation time, we need to check the access of C::myint
22140 In other words, we need to check the access of the myint typedef through
22141 the C scope. For that purpose, this function will add the myint typedef
22142 and the scope C through which its being accessed to a list of typedefs
22143 tied to the template S. That list will be walked at template instantiation
22144 time and access check performed on each typedefs it contains.
22145 Note that this particular code snippet should yield an error because
22146 myint is private to C. */
22149 append_type_to_template_for_access_check (tree templ
,
22152 location_t location
)
22154 qualified_typedef_usage_t
*iter
;
22157 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
22159 /* Make sure we don't append the type to the template twice. */
22160 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
22161 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
22164 append_type_to_template_for_access_check_1 (templ
, type_decl
,
22168 /* Convert the generic type parameters in PARM that match the types given in the
22169 range [START_IDX, END_IDX) from the current_template_parms into generic type
22173 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
22175 tree current
= current_template_parms
;
22176 int depth
= TMPL_PARMS_DEPTH (current
);
22177 current
= INNERMOST_TEMPLATE_PARMS (current
);
22178 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
22180 for (int i
= 0; i
< start_idx
; ++i
)
22181 TREE_VEC_ELT (replacement
, i
)
22182 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22184 for (int i
= start_idx
; i
< end_idx
; ++i
)
22186 /* Create a distinct parameter pack type from the current parm and add it
22187 to the replacement args to tsubst below into the generic function
22190 tree o
= TREE_TYPE (TREE_VALUE
22191 (TREE_VEC_ELT (current
, i
)));
22192 tree t
= copy_type (o
);
22193 TEMPLATE_TYPE_PARM_INDEX (t
)
22194 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
22196 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
22197 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
22198 TYPE_MAIN_VARIANT (t
) = t
;
22199 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
22200 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
22201 TREE_VEC_ELT (replacement
, i
) = t
;
22202 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
22205 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
22206 TREE_VEC_ELT (replacement
, i
)
22207 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22209 /* If there are more levels then build up the replacement with the outer
22212 replacement
= add_to_template_args (template_parms_to_args
22213 (TREE_CHAIN (current_template_parms
)),
22216 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
22220 /* Set up the hash tables for template instantiations. */
22223 init_template_processing (void)
22225 decl_specializations
= htab_create_ggc (37,
22226 hash_specialization
,
22227 eq_specializations
,
22229 type_specializations
= htab_create_ggc (37,
22230 hash_specialization
,
22231 eq_specializations
,
22235 /* Print stats about the template hash tables for -fstats. */
22238 print_template_statistics (void)
22240 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
22241 "%f collisions\n", (long) htab_size (decl_specializations
),
22242 (long) htab_elements (decl_specializations
),
22243 htab_collisions (decl_specializations
));
22244 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
22245 "%f collisions\n", (long) htab_size (type_specializations
),
22246 (long) htab_elements (type_specializations
),
22247 htab_collisions (type_specializations
));
22250 #include "gt-cp-pt.h"