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"
39 #include "c-family/c-common.h"
40 #include "c-family/c-objc.h"
41 #include "cp-objcp-common.h"
42 #include "tree-inline.h"
46 #include "tree-iterator.h"
47 #include "type-utils.h"
50 /* The type of functions taking a tree, and some additional data, and
52 typedef int (*tree_fn_t
) (tree
, void*);
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the work. */
57 struct GTY ((chain_next ("%h.next"))) pending_template
{
58 struct pending_template
*next
;
59 struct tinst_level
*tinst
;
62 static GTY(()) struct pending_template
*pending_templates
;
63 static GTY(()) struct pending_template
*last_pending_template
;
65 int processing_template_parmlist
;
66 static int template_header_count
;
68 static GTY(()) tree saved_trees
;
69 static vec
<int> inline_parm_levels
;
71 static GTY(()) struct tinst_level
*current_tinst_level
;
73 static GTY(()) tree saved_access_scope
;
75 /* Live only within one (recursive) call to tsubst_expr. We use
76 this to pass the statement expression node from the STMT_EXPR
77 to the EXPR_STMT that is its result. */
78 static tree cur_stmt_expr
;
80 /* True if we've recursed into fn_type_unification too many times. */
81 static bool excessive_deduction_depth
;
83 typedef struct GTY(()) spec_entry
90 static GTY ((param_is (spec_entry
)))
91 htab_t decl_specializations
;
93 static GTY ((param_is (spec_entry
)))
94 htab_t type_specializations
;
96 /* Contains canonical template parameter types. The vector is indexed by
97 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
98 TREE_LIST, whose TREE_VALUEs contain the canonical template
99 parameters of various types and levels. */
100 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
102 #define UNIFY_ALLOW_NONE 0
103 #define UNIFY_ALLOW_MORE_CV_QUAL 1
104 #define UNIFY_ALLOW_LESS_CV_QUAL 2
105 #define UNIFY_ALLOW_DERIVED 4
106 #define UNIFY_ALLOW_INTEGER 8
107 #define UNIFY_ALLOW_OUTER_LEVEL 16
108 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
109 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
111 enum template_base_result
{
113 tbr_ambiguous_baseclass
,
117 static void push_access_scope (tree
);
118 static void pop_access_scope (tree
);
119 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
120 unification_kind_t
, int,
122 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
123 unification_kind_t
, int, bool, bool);
124 static int unify (tree
, tree
, tree
, tree
, int, bool);
125 static void add_pending_template (tree
);
126 static tree
reopen_tinst_level (struct tinst_level
*);
127 static tree
tsubst_initializer_list (tree
, tree
);
128 static tree
get_class_bindings (tree
, tree
, tree
, tree
);
129 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
131 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
133 static void tsubst_enum (tree
, tree
, tree
);
134 static tree
add_to_template_args (tree
, tree
);
135 static tree
add_outermost_template_args (tree
, tree
);
136 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
137 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
139 static int type_unification_real (tree
, tree
, tree
, const tree
*,
140 unsigned int, int, unification_kind_t
, int,
141 vec
<deferred_access_check
, va_gc
> **,
143 static void note_template_header (int);
144 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
145 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
146 static tree
convert_template_argument (tree
, tree
, tree
,
147 tsubst_flags_t
, int, tree
);
148 static int for_each_template_parm (tree
, tree_fn_t
, void*,
149 hash_set
<tree
> *, bool);
150 static tree
expand_template_argument_pack (tree
);
151 static tree
build_template_parm_index (int, int, int, tree
, tree
);
152 static bool inline_needs_template_parms (tree
, bool);
153 static void push_inline_template_parms_recursive (tree
, int);
154 static tree
retrieve_local_specialization (tree
);
155 static void register_local_specialization (tree
, tree
);
156 static hashval_t
hash_specialization (const void *p
);
157 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
158 static int mark_template_parm (tree
, void *);
159 static int template_parm_this_level_p (tree
, void *);
160 static tree
tsubst_friend_function (tree
, tree
);
161 static tree
tsubst_friend_class (tree
, tree
);
162 static int can_complete_type_without_circularity (tree
);
163 static tree
get_bindings (tree
, tree
, tree
, bool);
164 static int template_decl_level (tree
);
165 static int check_cv_quals_for_unify (int, tree
, tree
);
166 static void template_parm_level_and_index (tree
, int*, int*);
167 static int unify_pack_expansion (tree
, tree
, tree
,
168 tree
, unification_kind_t
, bool, bool);
169 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
170 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
171 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
172 static void regenerate_decl_from_template (tree
, tree
);
173 static tree
most_specialized_class (tree
, tsubst_flags_t
);
174 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
175 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
176 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
177 static bool check_specialization_scope (void);
178 static tree
process_partial_specialization (tree
);
179 static void set_current_access_from_decl (tree
);
180 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
182 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
183 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
185 static bool template_template_parm_bindings_ok_p (tree
, tree
);
186 static int template_args_equal (tree
, tree
);
187 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
188 static tree
for_each_template_parm_r (tree
*, int *, void *);
189 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
190 static void copy_default_args_to_explicit_spec (tree
);
191 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
192 static bool dependent_template_arg_p (tree
);
193 static bool any_template_arguments_need_structural_equality_p (tree
);
194 static bool dependent_type_p_r (tree
);
195 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
196 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
197 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
198 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
199 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
200 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
202 static tree
listify (tree
);
203 static tree
listify_autos (tree
, tree
);
204 static tree
template_parm_to_arg (tree t
);
205 static tree
current_template_args (void);
206 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
207 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
209 /* Make the current scope suitable for access checking when we are
210 processing T. T can be FUNCTION_DECL for instantiated function
211 template, VAR_DECL for static member variable, or TYPE_DECL for
212 alias template (needed by instantiate_decl). */
215 push_access_scope (tree t
)
217 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
218 || TREE_CODE (t
) == TYPE_DECL
);
220 if (DECL_FRIEND_CONTEXT (t
))
221 push_nested_class (DECL_FRIEND_CONTEXT (t
));
222 else if (DECL_CLASS_SCOPE_P (t
))
223 push_nested_class (DECL_CONTEXT (t
));
225 push_to_top_level ();
227 if (TREE_CODE (t
) == FUNCTION_DECL
)
229 saved_access_scope
= tree_cons
230 (NULL_TREE
, current_function_decl
, saved_access_scope
);
231 current_function_decl
= t
;
235 /* Restore the scope set up by push_access_scope. T is the node we
239 pop_access_scope (tree t
)
241 if (TREE_CODE (t
) == FUNCTION_DECL
)
243 current_function_decl
= TREE_VALUE (saved_access_scope
);
244 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
247 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
250 pop_from_top_level ();
253 /* Do any processing required when DECL (a member template
254 declaration) is finished. Returns the TEMPLATE_DECL corresponding
255 to DECL, unless it is a specialization, in which case the DECL
256 itself is returned. */
259 finish_member_template_decl (tree decl
)
261 if (decl
== error_mark_node
)
262 return error_mark_node
;
264 gcc_assert (DECL_P (decl
));
266 if (TREE_CODE (decl
) == TYPE_DECL
)
270 type
= TREE_TYPE (decl
);
271 if (type
== error_mark_node
)
272 return error_mark_node
;
273 if (MAYBE_CLASS_TYPE_P (type
)
274 && CLASSTYPE_TEMPLATE_INFO (type
)
275 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
277 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
278 check_member_template (tmpl
);
283 else if (TREE_CODE (decl
) == FIELD_DECL
)
284 error ("data member %qD cannot be a member template", decl
);
285 else if (DECL_TEMPLATE_INFO (decl
))
287 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
289 check_member_template (DECL_TI_TEMPLATE (decl
));
290 return DECL_TI_TEMPLATE (decl
);
296 error ("invalid member template declaration %qD", decl
);
298 return error_mark_node
;
301 /* Create a template info node. */
304 build_template_info (tree template_decl
, tree template_args
)
306 tree result
= make_node (TEMPLATE_INFO
);
307 TI_TEMPLATE (result
) = template_decl
;
308 TI_ARGS (result
) = template_args
;
312 /* Return the template info node corresponding to T, whatever T is. */
315 get_template_info (const_tree t
)
317 tree tinfo
= NULL_TREE
;
319 if (!t
|| t
== error_mark_node
)
322 if (TREE_CODE (t
) == NAMESPACE_DECL
)
325 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
326 tinfo
= DECL_TEMPLATE_INFO (t
);
328 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
331 if (OVERLOAD_TYPE_P (t
))
332 tinfo
= TYPE_TEMPLATE_INFO (t
);
333 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
334 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
339 /* Returns the template nesting level of the indicated class TYPE.
349 A<T>::B<U> has depth two, while A<T> has depth one.
350 Both A<T>::B<int> and A<int>::B<U> have depth one, if
351 they are instantiations, not specializations.
353 This function is guaranteed to return 0 if passed NULL_TREE so
354 that, for example, `template_class_depth (current_class_type)' is
358 template_class_depth (tree type
)
363 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
364 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
365 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
367 tree tinfo
= get_template_info (type
);
369 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
370 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
377 /* Subroutine of maybe_begin_member_template_processing.
378 Returns true if processing DECL needs us to push template parms. */
381 inline_needs_template_parms (tree decl
, bool nsdmi
)
383 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
386 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
387 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
390 /* Subroutine of maybe_begin_member_template_processing.
391 Push the template parms in PARMS, starting from LEVELS steps into the
392 chain, and ending at the beginning, since template parms are listed
396 push_inline_template_parms_recursive (tree parmlist
, int levels
)
398 tree parms
= TREE_VALUE (parmlist
);
402 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
404 ++processing_template_decl
;
405 current_template_parms
406 = tree_cons (size_int (processing_template_decl
),
407 parms
, current_template_parms
);
408 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
410 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
412 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
414 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
416 if (error_operand_p (parm
))
419 gcc_assert (DECL_P (parm
));
421 switch (TREE_CODE (parm
))
430 /* Make a CONST_DECL as is done in process_template_parm.
431 It is ugly that we recreate this here; the original
432 version built in process_template_parm is no longer
434 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
435 CONST_DECL
, DECL_NAME (parm
),
437 DECL_ARTIFICIAL (decl
) = 1;
438 TREE_CONSTANT (decl
) = 1;
439 TREE_READONLY (decl
) = 1;
440 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
441 SET_DECL_TEMPLATE_PARM_P (decl
);
452 /* Restore the template parameter context for a member template, a
453 friend template defined in a class definition, or a non-template
454 member of template class. */
457 maybe_begin_member_template_processing (tree decl
)
461 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
465 tree ctx
= DECL_CONTEXT (decl
);
466 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
467 /* Disregard full specializations (c++/60999). */
468 && uses_template_parms (ctx
)
469 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
472 if (inline_needs_template_parms (decl
, nsdmi
))
474 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
475 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
477 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
480 parms
= TREE_CHAIN (parms
);
483 push_inline_template_parms_recursive (parms
, levels
);
486 /* Remember how many levels of template parameters we pushed so that
487 we can pop them later. */
488 inline_parm_levels
.safe_push (levels
);
491 /* Undo the effects of maybe_begin_member_template_processing. */
494 maybe_end_member_template_processing (void)
499 if (inline_parm_levels
.length () == 0)
502 last
= inline_parm_levels
.pop ();
503 for (i
= 0; i
< last
; ++i
)
505 --processing_template_decl
;
506 current_template_parms
= TREE_CHAIN (current_template_parms
);
511 /* Return a new template argument vector which contains all of ARGS,
512 but has as its innermost set of arguments the EXTRA_ARGS. */
515 add_to_template_args (tree args
, tree extra_args
)
522 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
525 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
526 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
528 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
529 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
531 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
532 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
537 /* Like add_to_template_args, but only the outermost ARGS are added to
538 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
539 (EXTRA_ARGS) levels are added. This function is used to combine
540 the template arguments from a partial instantiation with the
541 template arguments used to attain the full instantiation from the
542 partial instantiation. */
545 add_outermost_template_args (tree args
, tree extra_args
)
549 /* If there are more levels of EXTRA_ARGS than there are ARGS,
550 something very fishy is going on. */
551 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
553 /* If *all* the new arguments will be the EXTRA_ARGS, just return
555 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
558 /* For the moment, we make ARGS look like it contains fewer levels. */
559 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
561 new_args
= add_to_template_args (args
, extra_args
);
563 /* Now, we restore ARGS to its full dimensions. */
564 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
569 /* Return the N levels of innermost template arguments from the ARGS. */
572 get_innermost_template_args (tree args
, int n
)
580 /* If N is 1, just return the innermost set of template arguments. */
582 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
584 /* If we're not removing anything, just return the arguments we were
586 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
587 gcc_assert (extra_levels
>= 0);
588 if (extra_levels
== 0)
591 /* Make a new set of arguments, not containing the outer arguments. */
592 new_args
= make_tree_vec (n
);
593 for (i
= 1; i
<= n
; ++i
)
594 SET_TMPL_ARGS_LEVEL (new_args
, i
,
595 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
600 /* The inverse of get_innermost_template_args: Return all but the innermost
601 EXTRA_LEVELS levels of template arguments from the ARGS. */
604 strip_innermost_template_args (tree args
, int extra_levels
)
607 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
612 /* If N is 1, just return the outermost set of template arguments. */
614 return TMPL_ARGS_LEVEL (args
, 1);
616 /* If we're not removing anything, just return the arguments we were
618 gcc_assert (extra_levels
>= 0);
619 if (extra_levels
== 0)
622 /* Make a new set of arguments, not containing the inner arguments. */
623 new_args
= make_tree_vec (n
);
624 for (i
= 1; i
<= n
; ++i
)
625 SET_TMPL_ARGS_LEVEL (new_args
, i
,
626 TMPL_ARGS_LEVEL (args
, i
));
631 /* We've got a template header coming up; push to a new level for storing
635 begin_template_parm_list (void)
637 /* We use a non-tag-transparent scope here, which causes pushtag to
638 put tags in this scope, rather than in the enclosing class or
639 namespace scope. This is the right thing, since we want
640 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
641 global template class, push_template_decl handles putting the
642 TEMPLATE_DECL into top-level scope. For a nested template class,
645 template <class T> struct S1 {
646 template <class T> struct S2 {};
649 pushtag contains special code to call pushdecl_with_scope on the
650 TEMPLATE_DECL for S2. */
651 begin_scope (sk_template_parms
, NULL
);
652 ++processing_template_decl
;
653 ++processing_template_parmlist
;
654 note_template_header (0);
657 /* This routine is called when a specialization is declared. If it is
658 invalid to declare a specialization here, an error is reported and
659 false is returned, otherwise this routine will return true. */
662 check_specialization_scope (void)
664 tree scope
= current_scope ();
668 An explicit specialization shall be declared in the namespace of
669 which the template is a member, or, for member templates, in the
670 namespace of which the enclosing class or enclosing class
671 template is a member. An explicit specialization of a member
672 function, member class or static data member of a class template
673 shall be declared in the namespace of which the class template
675 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
677 error ("explicit specialization in non-namespace scope %qD", scope
);
683 In an explicit specialization declaration for a member of a class
684 template or a member template that appears in namespace scope,
685 the member template and some of its enclosing class templates may
686 remain unspecialized, except that the declaration shall not
687 explicitly specialize a class member template if its enclosing
688 class templates are not explicitly specialized as well. */
689 if (current_template_parms
)
691 error ("enclosing class templates are not explicitly specialized");
698 /* We've just seen template <>. */
701 begin_specialization (void)
703 begin_scope (sk_template_spec
, NULL
);
704 note_template_header (1);
705 return check_specialization_scope ();
708 /* Called at then end of processing a declaration preceded by
712 end_specialization (void)
715 reset_specialization ();
718 /* Any template <>'s that we have seen thus far are not referring to a
719 function specialization. */
722 reset_specialization (void)
724 processing_specialization
= 0;
725 template_header_count
= 0;
728 /* We've just seen a template header. If SPECIALIZATION is nonzero,
729 it was of the form template <>. */
732 note_template_header (int specialization
)
734 processing_specialization
= specialization
;
735 template_header_count
++;
738 /* We're beginning an explicit instantiation. */
741 begin_explicit_instantiation (void)
743 gcc_assert (!processing_explicit_instantiation
);
744 processing_explicit_instantiation
= true;
749 end_explicit_instantiation (void)
751 gcc_assert (processing_explicit_instantiation
);
752 processing_explicit_instantiation
= false;
755 /* An explicit specialization or partial specialization of TMPL is being
756 declared. Check that the namespace in which the specialization is
757 occurring is permissible. Returns false iff it is invalid to
758 specialize TMPL in the current namespace. */
761 check_specialization_namespace (tree tmpl
)
763 tree tpl_ns
= decl_namespace_context (tmpl
);
767 An explicit specialization shall be declared in the namespace of
768 which the template is a member, or, for member templates, in the
769 namespace of which the enclosing class or enclosing class
770 template is a member. An explicit specialization of a member
771 function, member class or static data member of a class template
772 shall be declared in the namespace of which the class template is
774 if (current_scope() != DECL_CONTEXT (tmpl
)
775 && !at_namespace_scope_p ())
777 error ("specialization of %qD must appear at namespace scope", tmpl
);
780 if (is_associated_namespace (current_namespace
, tpl_ns
))
781 /* Same or super-using namespace. */
785 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
786 permerror (input_location
, " from definition of %q+#D", tmpl
);
791 /* SPEC is an explicit instantiation. Check that it is valid to
792 perform this explicit instantiation in the current namespace. */
795 check_explicit_instantiation_namespace (tree spec
)
799 /* DR 275: An explicit instantiation shall appear in an enclosing
800 namespace of its template. */
801 ns
= decl_namespace_context (spec
);
802 if (!is_ancestor (current_namespace
, ns
))
803 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
804 "(which does not enclose namespace %qD)",
805 spec
, current_namespace
, ns
);
808 /* The TYPE is being declared. If it is a template type, that means it
809 is a partial specialization. Do appropriate error-checking. */
812 maybe_process_partial_specialization (tree type
)
816 if (type
== error_mark_node
)
817 return error_mark_node
;
819 /* A lambda that appears in specialization context is not itself a
821 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
824 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
826 error ("name of class shadows template template parameter %qD",
828 return error_mark_node
;
831 context
= TYPE_CONTEXT (type
);
833 if (TYPE_ALIAS_P (type
))
835 if (TYPE_TEMPLATE_INFO (type
)
836 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
837 error ("specialization of alias template %qD",
838 TYPE_TI_TEMPLATE (type
));
840 error ("explicit specialization of non-template %qT", type
);
841 return error_mark_node
;
843 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
845 /* This is for ordinary explicit specialization and partial
846 specialization of a template class such as:
848 template <> class C<int>;
852 template <class T> class C<T*>;
854 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
856 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
857 && !COMPLETE_TYPE_P (type
))
859 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
))
860 && !at_namespace_scope_p ())
861 return error_mark_node
;
862 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
863 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
864 if (processing_template_decl
)
866 if (push_template_decl (TYPE_MAIN_DECL (type
))
868 return error_mark_node
;
871 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
872 error ("specialization of %qT after instantiation", type
);
873 else if (errorcount
&& !processing_specialization
874 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
875 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
876 /* Trying to define a specialization either without a template<> header
877 or in an inappropriate place. We've already given an error, so just
878 bail now so we don't actually define the specialization. */
879 return error_mark_node
;
881 else if (CLASS_TYPE_P (type
)
882 && !CLASSTYPE_USE_TEMPLATE (type
)
883 && CLASSTYPE_TEMPLATE_INFO (type
)
884 && context
&& CLASS_TYPE_P (context
)
885 && CLASSTYPE_TEMPLATE_INFO (context
))
887 /* This is for an explicit specialization of member class
888 template according to [temp.expl.spec/18]:
890 template <> template <class U> class C<int>::D;
892 The context `C<int>' must be an implicit instantiation.
893 Otherwise this is just a member class template declared
896 template <> class C<int> { template <class U> class D; };
897 template <> template <class U> class C<int>::D;
899 In the first case, `C<int>::D' is a specialization of `C<T>::D'
900 while in the second case, `C<int>::D' is a primary template
901 and `C<T>::D' may not exist. */
903 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
904 && !COMPLETE_TYPE_P (type
))
907 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
909 if (current_namespace
910 != decl_namespace_context (tmpl
))
912 permerror (input_location
, "specializing %q#T in different namespace", type
);
913 permerror (input_location
, " from definition of %q+#D", tmpl
);
916 /* Check for invalid specialization after instantiation:
918 template <> template <> class C<int>::D<int>;
919 template <> template <class U> class C<int>::D; */
921 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
922 t
; t
= TREE_CHAIN (t
))
924 tree inst
= TREE_VALUE (t
);
925 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
926 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
928 /* We already have a full specialization of this partial
929 instantiation, or a full specialization has been
930 looked up but not instantiated. Reassign it to the
931 new member specialization template. */
936 elt
.tmpl
= most_general_template (tmpl
);
937 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
940 htab_remove_elt (type_specializations
, &elt
);
943 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
945 slot
= htab_find_slot (type_specializations
, &elt
, INSERT
);
946 entry
= ggc_alloc
<spec_entry
> ();
951 /* But if we've had an implicit instantiation, that's a
952 problem ([temp.expl.spec]/6). */
953 error ("specialization %qT after instantiation %qT",
957 /* Mark TYPE as a specialization. And as a result, we only
958 have one level of template argument for the innermost
960 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
961 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
962 CLASSTYPE_TI_ARGS (type
)
963 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
966 else if (processing_specialization
)
968 /* Someday C++0x may allow for enum template specialization. */
969 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
970 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
971 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
972 "of %qD not allowed by ISO C++", type
);
975 error ("explicit specialization of non-template %qT", type
);
976 return error_mark_node
;
983 /* Returns nonzero if we can optimize the retrieval of specializations
984 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
985 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
988 optimize_specialization_lookup_p (tree tmpl
)
990 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
991 && DECL_CLASS_SCOPE_P (tmpl
)
992 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
994 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
995 /* The optimized lookup depends on the fact that the
996 template arguments for the member function template apply
997 purely to the containing class, which is not true if the
998 containing class is an explicit or partial
1000 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1001 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1002 && !DECL_CONV_FN_P (tmpl
)
1003 /* It is possible to have a template that is not a member
1004 template and is not a member of a template class:
1006 template <typename T>
1007 struct S { friend A::f(); };
1009 Here, the friend function is a template, but the context does
1010 not have template information. The optimized lookup relies
1011 on having ARGS be the template arguments for both the class
1012 and the function template. */
1013 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1016 /* Retrieve the specialization (in the sense of [temp.spec] - a
1017 specialization is either an instantiation or an explicit
1018 specialization) of TMPL for the given template ARGS. If there is
1019 no such specialization, return NULL_TREE. The ARGS are a vector of
1020 arguments, or a vector of vectors of arguments, in the case of
1021 templates with more than one level of parameters.
1023 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1024 then we search for a partial specialization matching ARGS. This
1025 parameter is ignored if TMPL is not a class template.
1027 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1028 result is a NONTYPE_ARGUMENT_PACK. */
1031 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1033 if (tmpl
== NULL_TREE
)
1036 if (args
== error_mark_node
)
1039 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1040 || TREE_CODE (tmpl
) == FIELD_DECL
);
1042 /* There should be as many levels of arguments as there are
1043 levels of parameters. */
1044 gcc_assert (TMPL_ARGS_DEPTH (args
)
1045 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1046 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1047 : template_class_depth (DECL_CONTEXT (tmpl
))));
1049 if (optimize_specialization_lookup_p (tmpl
))
1051 tree class_template
;
1052 tree class_specialization
;
1053 vec
<tree
, va_gc
> *methods
;
1057 /* The template arguments actually apply to the containing
1058 class. Find the class specialization with those
1060 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1061 class_specialization
1062 = retrieve_specialization (class_template
, args
, 0);
1063 if (!class_specialization
)
1065 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1066 for the specialization. */
1067 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1070 /* Iterate through the methods with the indicated name, looking
1071 for the one that has an instance of TMPL. */
1072 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1073 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1075 tree fn
= OVL_CURRENT (fns
);
1076 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1077 /* using-declarations can add base methods to the method vec,
1078 and we don't want those here. */
1079 && DECL_CONTEXT (fn
) == class_specialization
)
1088 htab_t specializations
;
1092 elt
.spec
= NULL_TREE
;
1094 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1095 specializations
= type_specializations
;
1097 specializations
= decl_specializations
;
1100 hash
= hash_specialization (&elt
);
1101 found
= (spec_entry
*) htab_find_with_hash (specializations
, &elt
, hash
);
1109 /* Like retrieve_specialization, but for local declarations. */
1112 retrieve_local_specialization (tree tmpl
)
1114 if (local_specializations
== NULL
)
1117 tree
*slot
= local_specializations
->get (tmpl
);
1118 return slot
? *slot
: NULL_TREE
;
1121 /* Returns nonzero iff DECL is a specialization of TMPL. */
1124 is_specialization_of (tree decl
, tree tmpl
)
1128 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1132 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1138 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1140 for (t
= TREE_TYPE (decl
);
1142 t
= CLASSTYPE_USE_TEMPLATE (t
)
1143 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1144 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1151 /* Returns nonzero iff DECL is a specialization of friend declaration
1152 FRIEND_DECL according to [temp.friend]. */
1155 is_specialization_of_friend (tree decl
, tree friend_decl
)
1157 bool need_template
= true;
1160 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1161 || TREE_CODE (decl
) == TYPE_DECL
);
1163 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1164 of a template class, we want to check if DECL is a specialization
1166 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1167 && DECL_TEMPLATE_INFO (friend_decl
)
1168 && !DECL_USE_TEMPLATE (friend_decl
))
1170 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1171 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1172 need_template
= false;
1174 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1175 && !PRIMARY_TEMPLATE_P (friend_decl
))
1176 need_template
= false;
1178 /* There is nothing to do if this is not a template friend. */
1179 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1182 if (is_specialization_of (decl
, friend_decl
))
1186 A member of a class template may be declared to be a friend of a
1187 non-template class. In this case, the corresponding member of
1188 every specialization of the class template is a friend of the
1189 class granting friendship.
1191 For example, given a template friend declaration
1193 template <class T> friend void A<T>::f();
1195 the member function below is considered a friend
1197 template <> struct A<int> {
1201 For this type of template friend, TEMPLATE_DEPTH below will be
1202 nonzero. To determine if DECL is a friend of FRIEND, we first
1203 check if the enclosing class is a specialization of another. */
1205 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1207 && DECL_CLASS_SCOPE_P (decl
)
1208 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1209 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1211 /* Next, we check the members themselves. In order to handle
1212 a few tricky cases, such as when FRIEND_DECL's are
1214 template <class T> friend void A<T>::g(T t);
1215 template <class T> template <T t> friend void A<T>::h();
1219 void A<int>::g(int);
1220 template <int> void A<int>::h();
1222 we need to figure out ARGS, the template arguments from
1223 the context of DECL. This is required for template substitution
1224 of `T' in the function parameter of `g' and template parameter
1225 of `h' in the above examples. Here ARGS corresponds to `int'. */
1227 tree context
= DECL_CONTEXT (decl
);
1228 tree args
= NULL_TREE
;
1229 int current_depth
= 0;
1231 while (current_depth
< template_depth
)
1233 if (CLASSTYPE_TEMPLATE_INFO (context
))
1235 if (current_depth
== 0)
1236 args
= TYPE_TI_ARGS (context
);
1238 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1241 context
= TYPE_CONTEXT (context
);
1244 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1249 tree friend_args_type
;
1250 tree decl_args_type
;
1252 /* Make sure that both DECL and FRIEND_DECL are templates or
1254 is_template
= DECL_TEMPLATE_INFO (decl
)
1255 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1256 if (need_template
^ is_template
)
1258 else if (is_template
)
1260 /* If both are templates, check template parameter list. */
1262 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1264 if (!comp_template_parms
1265 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1269 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1272 decl_type
= TREE_TYPE (decl
);
1274 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1275 tf_none
, NULL_TREE
);
1276 if (friend_type
== error_mark_node
)
1279 /* Check if return types match. */
1280 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1283 /* Check if function parameter types match, ignoring the
1284 `this' parameter. */
1285 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1286 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1287 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1288 friend_args_type
= TREE_CHAIN (friend_args_type
);
1289 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1290 decl_args_type
= TREE_CHAIN (decl_args_type
);
1292 return compparms (decl_args_type
, friend_args_type
);
1296 /* DECL is a TYPE_DECL */
1298 tree decl_type
= TREE_TYPE (decl
);
1300 /* Make sure that both DECL and FRIEND_DECL are templates or
1303 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1304 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1306 if (need_template
^ is_template
)
1308 else if (is_template
)
1311 /* If both are templates, check the name of the two
1312 TEMPLATE_DECL's first because is_friend didn't. */
1313 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1314 != DECL_NAME (friend_decl
))
1317 /* Now check template parameter list. */
1319 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1321 return comp_template_parms
1322 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1326 return (DECL_NAME (decl
)
1327 == DECL_NAME (friend_decl
));
1333 /* Register the specialization SPEC as a specialization of TMPL with
1334 the indicated ARGS. IS_FRIEND indicates whether the specialization
1335 is actually just a friend declaration. Returns SPEC, or an
1336 equivalent prior declaration, if available.
1338 We also store instantiations of field packs in the hash table, even
1339 though they are not themselves templates, to make lookup easier. */
1342 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1349 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1350 || (TREE_CODE (tmpl
) == FIELD_DECL
1351 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1353 if (TREE_CODE (spec
) == FUNCTION_DECL
1354 && uses_template_parms (DECL_TI_ARGS (spec
)))
1355 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1356 register it; we want the corresponding TEMPLATE_DECL instead.
1357 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1358 the more obvious `uses_template_parms (spec)' to avoid problems
1359 with default function arguments. In particular, given
1360 something like this:
1362 template <class T> void f(T t1, T t = T())
1364 the default argument expression is not substituted for in an
1365 instantiation unless and until it is actually needed. */
1368 if (optimize_specialization_lookup_p (tmpl
))
1369 /* We don't put these specializations in the hash table, but we might
1370 want to give an error about a mismatch. */
1371 fn
= retrieve_specialization (tmpl
, args
, 0);
1379 hash
= hash_specialization (&elt
);
1382 htab_find_slot_with_hash (decl_specializations
, &elt
, hash
, INSERT
);
1384 fn
= ((spec_entry
*) *slot
)->spec
;
1389 /* We can sometimes try to re-register a specialization that we've
1390 already got. In particular, regenerate_decl_from_template calls
1391 duplicate_decls which will update the specialization list. But,
1392 we'll still get called again here anyhow. It's more convenient
1393 to simply allow this than to try to prevent it. */
1396 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1398 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1400 if (DECL_ODR_USED (fn
)
1401 || DECL_EXPLICIT_INSTANTIATION (fn
))
1403 error ("specialization of %qD after instantiation",
1405 return error_mark_node
;
1410 /* This situation should occur only if the first
1411 specialization is an implicit instantiation, the
1412 second is an explicit specialization, and the
1413 implicit instantiation has not yet been used. That
1414 situation can occur if we have implicitly
1415 instantiated a member function and then specialized
1418 We can also wind up here if a friend declaration that
1419 looked like an instantiation turns out to be a
1422 template <class T> void foo(T);
1423 class S { friend void foo<>(int) };
1424 template <> void foo(int);
1426 We transform the existing DECL in place so that any
1427 pointers to it become pointers to the updated
1430 If there was a definition for the template, but not
1431 for the specialization, we want this to look as if
1432 there were no definition, and vice versa. */
1433 DECL_INITIAL (fn
) = NULL_TREE
;
1434 duplicate_decls (spec
, fn
, is_friend
);
1435 /* The call to duplicate_decls will have applied
1438 An explicit specialization of a function template
1439 is inline only if it is explicitly declared to be,
1440 and independently of whether its function template
1443 to the primary function; now copy the inline bits to
1444 the various clones. */
1445 FOR_EACH_CLONE (clone
, fn
)
1447 DECL_DECLARED_INLINE_P (clone
)
1448 = DECL_DECLARED_INLINE_P (fn
);
1449 DECL_SOURCE_LOCATION (clone
)
1450 = DECL_SOURCE_LOCATION (fn
);
1451 DECL_DELETED_FN (clone
)
1452 = DECL_DELETED_FN (fn
);
1454 check_specialization_namespace (tmpl
);
1459 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1461 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1462 /* Dup decl failed, but this is a new definition. Set the
1463 line number so any errors match this new
1465 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1471 return duplicate_decls (spec
, fn
, is_friend
);
1473 /* A specialization must be declared in the same namespace as the
1474 template it is specializing. */
1475 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1476 && !check_specialization_namespace (tmpl
))
1477 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1479 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1481 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1482 gcc_assert (tmpl
&& args
&& spec
);
1485 if (TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1486 && PRIMARY_TEMPLATE_P (tmpl
)
1487 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1488 /* TMPL is a forward declaration of a template function; keep a list
1489 of all specializations in case we need to reassign them to a friend
1490 template later in tsubst_friend_function. */
1491 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1492 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1498 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1499 TMPL and ARGS members, ignores SPEC. */
1501 int comparing_specializations
;
1504 eq_specializations (const void *p1
, const void *p2
)
1506 const spec_entry
*e1
= (const spec_entry
*)p1
;
1507 const spec_entry
*e2
= (const spec_entry
*)p2
;
1510 ++comparing_specializations
;
1511 equal
= (e1
->tmpl
== e2
->tmpl
1512 && comp_template_args (e1
->args
, e2
->args
));
1513 --comparing_specializations
;
1518 /* Returns a hash for a template TMPL and template arguments ARGS. */
1521 hash_tmpl_and_args (tree tmpl
, tree args
)
1523 hashval_t val
= DECL_UID (tmpl
);
1524 return iterative_hash_template_arg (args
, val
);
1527 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1531 hash_specialization (const void *p
)
1533 const spec_entry
*e
= (const spec_entry
*)p
;
1534 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1537 /* Recursively calculate a hash value for a template argument ARG, for use
1538 in the hash tables of template specializations. */
1541 iterative_hash_template_arg (tree arg
, hashval_t val
)
1543 unsigned HOST_WIDE_INT i
;
1544 enum tree_code code
;
1547 if (arg
== NULL_TREE
)
1548 return iterative_hash_object (arg
, val
);
1553 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1554 /* We can get one of these when re-hashing a previous entry in the middle
1555 of substituting into a pack expansion. Just look through it. */
1556 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1558 code
= TREE_CODE (arg
);
1559 tclass
= TREE_CODE_CLASS (code
);
1561 val
= iterative_hash_object (code
, val
);
1568 case IDENTIFIER_NODE
:
1569 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1573 int i
, len
= TREE_VEC_LENGTH (arg
);
1574 for (i
= 0; i
< len
; ++i
)
1575 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1579 case TYPE_PACK_EXPANSION
:
1580 case EXPR_PACK_EXPANSION
:
1581 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1582 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1584 case TYPE_ARGUMENT_PACK
:
1585 case NONTYPE_ARGUMENT_PACK
:
1586 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1589 for (; arg
; arg
= TREE_CHAIN (arg
))
1590 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1594 for (; arg
; arg
= OVL_NEXT (arg
))
1595 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1601 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1603 val
= iterative_hash_template_arg (field
, val
);
1604 val
= iterative_hash_template_arg (value
, val
);
1610 if (!DECL_ARTIFICIAL (arg
))
1612 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1613 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1615 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1618 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1621 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1622 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1624 case TEMPLATE_PARM_INDEX
:
1625 val
= iterative_hash_template_arg
1626 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1627 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1628 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1631 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1632 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1633 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1636 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1638 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1642 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1643 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1644 val
= iterative_hash_object (code
, val
);
1645 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1648 /* A lambda can't appear in a template arg, but don't crash on
1650 gcc_assert (seen_error ());
1654 case IMPLICIT_CONV_EXPR
:
1655 case STATIC_CAST_EXPR
:
1656 case REINTERPRET_CAST_EXPR
:
1657 case CONST_CAST_EXPR
:
1658 case DYNAMIC_CAST_EXPR
:
1660 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1661 /* Now hash operands as usual. */
1671 if (TYPE_CANONICAL (arg
))
1672 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1674 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1675 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1676 /* Otherwise just compare the types during lookup. */
1679 case tcc_declaration
:
1681 return iterative_hash_expr (arg
, val
);
1684 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1686 unsigned n
= cp_tree_operand_length (arg
);
1687 for (i
= 0; i
< n
; ++i
)
1688 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1696 /* Unregister the specialization SPEC as a specialization of TMPL.
1697 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1698 if the SPEC was listed as a specialization of TMPL.
1700 Note that SPEC has been ggc_freed, so we can't look inside it. */
1703 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1708 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1709 elt
.args
= TI_ARGS (tinfo
);
1710 elt
.spec
= NULL_TREE
;
1712 entry
= (spec_entry
*) htab_find (decl_specializations
, &elt
);
1715 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1716 gcc_assert (new_spec
!= NULL_TREE
);
1717 entry
->spec
= new_spec
;
1724 /* Like register_specialization, but for local declarations. We are
1725 registering SPEC, an instantiation of TMPL. */
1728 register_local_specialization (tree spec
, tree tmpl
)
1730 local_specializations
->put (tmpl
, spec
);
1733 /* TYPE is a class type. Returns true if TYPE is an explicitly
1734 specialized class. */
1737 explicit_class_specialization_p (tree type
)
1739 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1741 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1744 /* Print the list of functions at FNS, going through all the overloads
1745 for each element of the list. Alternatively, FNS can not be a
1746 TREE_LIST, in which case it will be printed together with all the
1749 MORE and *STR should respectively be FALSE and NULL when the function
1750 is called from the outside. They are used internally on recursive
1751 calls. print_candidates manages the two parameters and leaves NULL
1752 in *STR when it ends. */
1755 print_candidates_1 (tree fns
, bool more
, const char **str
)
1758 char *spaces
= NULL
;
1760 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1761 if (TREE_CODE (fn
) == TREE_LIST
)
1763 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1764 print_candidates_1 (TREE_VALUE (fn2
),
1765 TREE_CHAIN (fn2
) || more
, str
);
1769 tree cand
= OVL_CURRENT (fn
);
1772 /* Pick the prefix string. */
1773 if (!more
&& !OVL_NEXT (fns
))
1775 inform (DECL_SOURCE_LOCATION (cand
),
1776 "candidate is: %#D", cand
);
1780 *str
= _("candidates are:");
1781 spaces
= get_spaces (*str
);
1783 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1784 *str
= spaces
? spaces
: *str
;
1794 /* Print the list of candidate FNS in an error message. FNS can also
1795 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1798 print_candidates (tree fns
)
1800 const char *str
= NULL
;
1801 print_candidates_1 (fns
, false, &str
);
1802 gcc_assert (str
== NULL
);
1805 /* Returns the template (one of the functions given by TEMPLATE_ID)
1806 which can be specialized to match the indicated DECL with the
1807 explicit template args given in TEMPLATE_ID. The DECL may be
1808 NULL_TREE if none is available. In that case, the functions in
1809 TEMPLATE_ID are non-members.
1811 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1812 specialization of a member template.
1814 The TEMPLATE_COUNT is the number of references to qualifying
1815 template classes that appeared in the name of the function. See
1816 check_explicit_specialization for a more accurate description.
1818 TSK indicates what kind of template declaration (if any) is being
1819 declared. TSK_TEMPLATE indicates that the declaration given by
1820 DECL, though a FUNCTION_DECL, has template parameters, and is
1821 therefore a template function.
1823 The template args (those explicitly specified and those deduced)
1824 are output in a newly created vector *TARGS_OUT.
1826 If it is impossible to determine the result, an error message is
1827 issued. The error_mark_node is returned to indicate failure. */
1830 determine_specialization (tree template_id
,
1833 int need_member_template
,
1839 tree explicit_targs
;
1840 tree candidates
= NULL_TREE
;
1841 /* A TREE_LIST of templates of which DECL may be a specialization.
1842 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1843 corresponding TREE_PURPOSE is the set of template arguments that,
1844 when used to instantiate the template, would produce a function
1845 with the signature of DECL. */
1846 tree templates
= NULL_TREE
;
1848 cp_binding_level
*b
;
1850 *targs_out
= NULL_TREE
;
1852 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1853 return error_mark_node
;
1855 /* We shouldn't be specializing a member template of an
1856 unspecialized class template; we already gave an error in
1857 check_specialization_scope, now avoid crashing. */
1858 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
1859 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
1861 gcc_assert (errorcount
);
1862 return error_mark_node
;
1865 fns
= TREE_OPERAND (template_id
, 0);
1866 explicit_targs
= TREE_OPERAND (template_id
, 1);
1868 if (fns
== error_mark_node
)
1869 return error_mark_node
;
1871 /* Check for baselinks. */
1872 if (BASELINK_P (fns
))
1873 fns
= BASELINK_FUNCTIONS (fns
);
1875 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
1877 error ("%qD is not a function template", fns
);
1878 return error_mark_node
;
1880 else if (VAR_P (decl
) && !variable_template_p (fns
))
1882 error ("%qD is not a variable template", fns
);
1883 return error_mark_node
;
1886 /* Count the number of template headers specified for this
1889 for (b
= current_binding_level
;
1890 b
->kind
== sk_template_parms
;
1894 if (variable_template_p (fns
))
1895 templates
= tree_cons (explicit_targs
, fns
, templates
);
1896 else for (; fns
; fns
= OVL_NEXT (fns
))
1898 tree fn
= OVL_CURRENT (fns
);
1900 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1902 tree decl_arg_types
;
1906 /* In case of explicit specialization, we need to check if
1907 the number of template headers appearing in the specialization
1908 is correct. This is usually done in check_explicit_specialization,
1909 but the check done there cannot be exhaustive when specializing
1910 member functions. Consider the following code:
1912 template <> void A<int>::f(int);
1913 template <> template <> void A<int>::f(int);
1915 Assuming that A<int> is not itself an explicit specialization
1916 already, the first line specializes "f" which is a non-template
1917 member function, whilst the second line specializes "f" which
1918 is a template member function. So both lines are syntactically
1919 correct, and check_explicit_specialization does not reject
1922 Here, we can do better, as we are matching the specialization
1923 against the declarations. We count the number of template
1924 headers, and we check if they match TEMPLATE_COUNT + 1
1925 (TEMPLATE_COUNT is the number of qualifying template classes,
1926 plus there must be another header for the member template
1929 Notice that if header_count is zero, this is not a
1930 specialization but rather a template instantiation, so there
1931 is no check we can perform here. */
1932 if (header_count
&& header_count
!= template_count
+ 1)
1935 /* Check that the number of template arguments at the
1936 innermost level for DECL is the same as for FN. */
1937 if (current_binding_level
->kind
== sk_template_parms
1938 && !current_binding_level
->explicit_spec_p
1939 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1940 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1941 (current_template_parms
))))
1944 /* DECL might be a specialization of FN. */
1945 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1946 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1948 /* For a non-static member function, we need to make sure
1949 that the const qualification is the same. Since
1950 get_bindings does not try to merge the "this" parameter,
1951 we must do the comparison explicitly. */
1952 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1953 && !same_type_p (TREE_VALUE (fn_arg_types
),
1954 TREE_VALUE (decl_arg_types
)))
1957 /* Skip the "this" parameter and, for constructors of
1958 classes with virtual bases, the VTT parameter. A
1959 full specialization of a constructor will have a VTT
1960 parameter, but a template never will. */
1962 = skip_artificial_parms_for (decl
, decl_arg_types
);
1964 = skip_artificial_parms_for (fn
, fn_arg_types
);
1966 /* Function templates cannot be specializations; there are
1967 no partial specializations of functions. Therefore, if
1968 the type of DECL does not match FN, there is no
1970 if (tsk
== tsk_template
)
1972 if (compparms (fn_arg_types
, decl_arg_types
))
1973 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1977 /* See whether this function might be a specialization of this
1978 template. Suppress access control because we might be trying
1979 to make this specialization a friend, and we have already done
1980 access control for the declaration of the specialization. */
1981 push_deferring_access_checks (dk_no_check
);
1982 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1983 pop_deferring_access_checks ();
1986 /* We cannot deduce template arguments that when used to
1987 specialize TMPL will produce DECL. */
1990 /* Make sure that the deduced arguments actually work. */
1991 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
1992 if (insttype
== error_mark_node
)
1995 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
1996 if (!compparms (fn_arg_types
, decl_arg_types
))
1999 /* Save this template, and the arguments deduced. */
2000 templates
= tree_cons (targs
, fn
, templates
);
2002 else if (need_member_template
)
2003 /* FN is an ordinary member function, and we need a
2004 specialization of a member template. */
2006 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2007 /* We can get IDENTIFIER_NODEs here in certain erroneous
2010 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2011 /* This is just an ordinary non-member function. Nothing can
2012 be a specialization of that. */
2014 else if (DECL_ARTIFICIAL (fn
))
2015 /* Cannot specialize functions that are created implicitly. */
2019 tree decl_arg_types
;
2021 /* This is an ordinary member function. However, since
2022 we're here, we can assume its enclosing class is a
2023 template class. For example,
2025 template <typename T> struct S { void f(); };
2026 template <> void S<int>::f() {}
2028 Here, S<int>::f is a non-template, but S<int> is a
2029 template class. If FN has the same type as DECL, we
2030 might be in business. */
2032 if (!DECL_TEMPLATE_INFO (fn
))
2033 /* Its enclosing class is an explicit specialization
2034 of a template class. This is not a candidate. */
2037 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2038 TREE_TYPE (TREE_TYPE (fn
))))
2039 /* The return types differ. */
2042 /* Adjust the type of DECL in case FN is a static member. */
2043 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2044 if (DECL_STATIC_FUNCTION_P (fn
)
2045 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2046 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2048 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2051 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2055 if (templates
&& TREE_CHAIN (templates
))
2061 It is possible for a specialization with a given function
2062 signature to be instantiated from more than one function
2063 template. In such cases, explicit specification of the
2064 template arguments must be used to uniquely identify the
2065 function template specialization being specialized.
2067 Note that here, there's no suggestion that we're supposed to
2068 determine which of the candidate templates is most
2069 specialized. However, we, also have:
2073 Partial ordering of overloaded function template
2074 declarations is used in the following contexts to select
2075 the function template to which a function template
2076 specialization refers:
2078 -- when an explicit specialization refers to a function
2081 So, we do use the partial ordering rules, at least for now.
2082 This extension can only serve to make invalid programs valid,
2083 so it's safe. And, there is strong anecdotal evidence that
2084 the committee intended the partial ordering rules to apply;
2085 the EDG front end has that behavior, and John Spicer claims
2086 that the committee simply forgot to delete the wording in
2087 [temp.expl.spec]. */
2088 tree tmpl
= most_specialized_instantiation (templates
);
2089 if (tmpl
!= error_mark_node
)
2092 TREE_CHAIN (templates
) = NULL_TREE
;
2096 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2098 error ("template-id %qD for %q+D does not match any template "
2099 "declaration", template_id
, decl
);
2100 if (header_count
&& header_count
!= template_count
+ 1)
2101 inform (input_location
, "saw %d %<template<>%>, need %d for "
2102 "specializing a member function template",
2103 header_count
, template_count
+ 1);
2104 return error_mark_node
;
2106 else if ((templates
&& TREE_CHAIN (templates
))
2107 || (candidates
&& TREE_CHAIN (candidates
))
2108 || (templates
&& candidates
))
2110 error ("ambiguous template specialization %qD for %q+D",
2112 candidates
= chainon (candidates
, templates
);
2113 print_candidates (candidates
);
2114 return error_mark_node
;
2117 /* We have one, and exactly one, match. */
2120 tree fn
= TREE_VALUE (candidates
);
2121 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2122 /* DECL is a re-declaration or partial instantiation of a template
2124 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2126 /* It was a specialization of an ordinary member function in a
2128 return DECL_TI_TEMPLATE (fn
);
2131 /* It was a specialization of a template. */
2132 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2133 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2135 *targs_out
= copy_node (targs
);
2136 SET_TMPL_ARGS_LEVEL (*targs_out
,
2137 TMPL_ARGS_DEPTH (*targs_out
),
2138 TREE_PURPOSE (templates
));
2141 *targs_out
= TREE_PURPOSE (templates
);
2142 return TREE_VALUE (templates
);
2145 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2146 but with the default argument values filled in from those in the
2150 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2153 tree new_spec_types
;
2158 if (spec_types
== void_list_node
)
2159 return void_list_node
;
2161 /* Substitute into the rest of the list. */
2163 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2164 TREE_CHAIN (tmpl_types
));
2166 /* Add the default argument for this parameter. */
2167 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2168 TREE_VALUE (spec_types
),
2172 /* DECL is an explicit specialization. Replicate default arguments
2173 from the template it specializes. (That way, code like:
2175 template <class T> void f(T = 3);
2176 template <> void f(double);
2179 works, as required.) An alternative approach would be to look up
2180 the correct default arguments at the call-site, but this approach
2181 is consistent with how implicit instantiations are handled. */
2184 copy_default_args_to_explicit_spec (tree decl
)
2189 tree new_spec_types
;
2193 tree object_type
= NULL_TREE
;
2194 tree in_charge
= NULL_TREE
;
2195 tree vtt
= NULL_TREE
;
2197 /* See if there's anything we need to do. */
2198 tmpl
= DECL_TI_TEMPLATE (decl
);
2199 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2200 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2201 if (TREE_PURPOSE (t
))
2206 old_type
= TREE_TYPE (decl
);
2207 spec_types
= TYPE_ARG_TYPES (old_type
);
2209 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2211 /* Remove the this pointer, but remember the object's type for
2213 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2214 spec_types
= TREE_CHAIN (spec_types
);
2215 tmpl_types
= TREE_CHAIN (tmpl_types
);
2217 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2219 /* DECL may contain more parameters than TMPL due to the extra
2220 in-charge parameter in constructors and destructors. */
2221 in_charge
= spec_types
;
2222 spec_types
= TREE_CHAIN (spec_types
);
2224 if (DECL_HAS_VTT_PARM_P (decl
))
2227 spec_types
= TREE_CHAIN (spec_types
);
2231 /* Compute the merged default arguments. */
2233 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2235 /* Compute the new FUNCTION_TYPE. */
2239 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2244 /* Put the in-charge parameter back. */
2245 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2246 TREE_VALUE (in_charge
),
2249 new_type
= build_method_type_directly (object_type
,
2250 TREE_TYPE (old_type
),
2254 new_type
= build_function_type (TREE_TYPE (old_type
),
2256 new_type
= cp_build_type_attribute_variant (new_type
,
2257 TYPE_ATTRIBUTES (old_type
));
2258 new_type
= build_exception_variant (new_type
,
2259 TYPE_RAISES_EXCEPTIONS (old_type
));
2261 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2262 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2264 TREE_TYPE (decl
) = new_type
;
2267 /* Return the number of template headers we expect to see for a definition
2268 or specialization of CTYPE or one of its non-template members. */
2271 num_template_headers_for_class (tree ctype
)
2273 int num_templates
= 0;
2275 while (ctype
&& CLASS_TYPE_P (ctype
))
2277 /* You're supposed to have one `template <...>' for every
2278 template class, but you don't need one for a full
2279 specialization. For example:
2281 template <class T> struct S{};
2282 template <> struct S<int> { void f(); };
2283 void S<int>::f () {}
2285 is correct; there shouldn't be a `template <>' for the
2286 definition of `S<int>::f'. */
2287 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2288 /* If CTYPE does not have template information of any
2289 kind, then it is not a template, nor is it nested
2290 within a template. */
2292 if (explicit_class_specialization_p (ctype
))
2294 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2297 ctype
= TYPE_CONTEXT (ctype
);
2300 return num_templates
;
2303 /* Do a simple sanity check on the template headers that precede the
2304 variable declaration DECL. */
2307 check_template_variable (tree decl
)
2309 tree ctx
= CP_DECL_CONTEXT (decl
);
2310 int wanted
= num_template_headers_for_class (ctx
);
2311 if (!TYPE_P (ctx
) || !CLASSTYPE_TEMPLATE_INFO (ctx
))
2313 if (cxx_dialect
< cxx1y
)
2314 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2315 "variable templates only available with "
2316 "-std=c++1y or -std=gnu++1y");
2318 // Namespace-scope variable templates should have a template header.
2321 if (template_header_count
> wanted
)
2323 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2324 "too many template headers for %D (should be %d)",
2326 if (warned
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2327 inform (DECL_SOURCE_LOCATION (decl
),
2328 "members of an explicitly specialized class are defined "
2329 "without a template header");
2333 /* Check to see if the function just declared, as indicated in
2334 DECLARATOR, and in DECL, is a specialization of a function
2335 template. We may also discover that the declaration is an explicit
2336 instantiation at this point.
2338 Returns DECL, or an equivalent declaration that should be used
2339 instead if all goes well. Issues an error message if something is
2340 amiss. Returns error_mark_node if the error is not easily
2343 FLAGS is a bitmask consisting of the following flags:
2345 2: The function has a definition.
2346 4: The function is a friend.
2348 The TEMPLATE_COUNT is the number of references to qualifying
2349 template classes that appeared in the name of the function. For
2352 template <class T> struct S { void f(); };
2355 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2356 classes are not counted in the TEMPLATE_COUNT, so that in
2358 template <class T> struct S {};
2359 template <> struct S<int> { void f(); }
2360 template <> void S<int>::f();
2362 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2363 invalid; there should be no template <>.)
2365 If the function is a specialization, it is marked as such via
2366 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2367 is set up correctly, and it is added to the list of specializations
2368 for that template. */
2371 check_explicit_specialization (tree declarator
,
2376 int have_def
= flags
& 2;
2377 int is_friend
= flags
& 4;
2378 int specialization
= 0;
2379 int explicit_instantiation
= 0;
2380 int member_specialization
= 0;
2381 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2382 tree dname
= DECL_NAME (decl
);
2387 if (!processing_specialization
)
2390 tsk
= tsk_excessive_parms
;
2393 tsk
= current_tmpl_spec_kind (template_count
);
2398 if (processing_specialization
)
2401 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2403 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2406 /* This could be something like:
2408 template <class T> void f(T);
2409 class S { friend void f<>(int); } */
2413 /* This case handles bogus declarations like template <>
2414 template <class T> void f<int>(); */
2416 error ("template-id %qD in declaration of primary template",
2423 case tsk_invalid_member_spec
:
2424 /* The error has already been reported in
2425 check_specialization_scope. */
2426 return error_mark_node
;
2428 case tsk_invalid_expl_inst
:
2429 error ("template parameter list used in explicit instantiation");
2435 error ("definition provided for explicit instantiation");
2437 explicit_instantiation
= 1;
2440 case tsk_excessive_parms
:
2441 case tsk_insufficient_parms
:
2442 if (tsk
== tsk_excessive_parms
)
2443 error ("too many template parameter lists in declaration of %qD",
2445 else if (template_header_count
)
2446 error("too few template parameter lists in declaration of %qD", decl
);
2448 error("explicit specialization of %qD must be introduced by "
2449 "%<template <>%>", decl
);
2453 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2455 // In cases like template<> constexpr bool v = true;
2456 error ("%qD is not a template variable", dname
);
2460 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2462 member_specialization
= 1;
2468 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2470 /* This case handles bogus declarations like template <>
2471 template <class T> void f<int>(); */
2473 if (uses_template_parms (declarator
))
2474 error ("function template partial specialization %qD "
2475 "is not allowed", declarator
);
2477 error ("template-id %qD in declaration of primary template",
2482 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2483 /* This is a specialization of a member template, without
2484 specialization the containing class. Something like:
2486 template <class T> struct S {
2487 template <class U> void f (U);
2489 template <> template <class U> void S<int>::f(U) {}
2491 That's a specialization -- but of the entire template. */
2499 if ((specialization
|| member_specialization
)
2500 /* This doesn't apply to variable templates. */
2501 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2502 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2504 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2505 for (; t
; t
= TREE_CHAIN (t
))
2506 if (TREE_PURPOSE (t
))
2508 permerror (input_location
,
2509 "default argument specified in explicit specialization");
2514 if (specialization
|| member_specialization
|| explicit_instantiation
)
2516 tree tmpl
= NULL_TREE
;
2517 tree targs
= NULL_TREE
;
2519 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2520 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2524 gcc_assert (identifier_p (declarator
));
2529 /* If there is no class context, the explicit instantiation
2530 must be at namespace scope. */
2531 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2533 /* Find the namespace binding, using the declaration
2535 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2537 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2539 error ("%qD is not a template function", dname
);
2540 fns
= error_mark_node
;
2544 tree fn
= OVL_CURRENT (fns
);
2545 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2546 CP_DECL_CONTEXT (fn
)))
2547 error ("%qD is not declared in %qD",
2548 decl
, current_namespace
);
2552 declarator
= lookup_template_function (fns
, NULL_TREE
);
2555 if (declarator
== error_mark_node
)
2556 return error_mark_node
;
2558 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2560 if (!explicit_instantiation
)
2561 /* A specialization in class scope. This is invalid,
2562 but the error will already have been flagged by
2563 check_specialization_scope. */
2564 return error_mark_node
;
2567 /* It's not valid to write an explicit instantiation in
2570 class C { template void f(); }
2572 This case is caught by the parser. However, on
2575 template class C { void f(); };
2577 (which is invalid) we can get here. The error will be
2584 else if (ctype
!= NULL_TREE
2585 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2587 // Ignore variable templates.
2591 /* Find the list of functions in ctype that have the same
2592 name as the declared function. */
2593 tree name
= TREE_OPERAND (declarator
, 0);
2594 tree fns
= NULL_TREE
;
2597 if (constructor_name_p (name
, ctype
))
2599 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2601 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2602 : !CLASSTYPE_DESTRUCTORS (ctype
))
2604 /* From [temp.expl.spec]:
2606 If such an explicit specialization for the member
2607 of a class template names an implicitly-declared
2608 special member function (clause _special_), the
2609 program is ill-formed.
2611 Similar language is found in [temp.explicit]. */
2612 error ("specialization of implicitly-declared special member function");
2613 return error_mark_node
;
2616 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2619 if (!DECL_CONV_FN_P (decl
))
2621 idx
= lookup_fnfields_1 (ctype
, name
);
2623 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2627 vec
<tree
, va_gc
> *methods
;
2630 /* For a type-conversion operator, we cannot do a
2631 name-based lookup. We might be looking for `operator
2632 int' which will be a specialization of `operator T'.
2633 So, we find *all* the conversion operators, and then
2634 select from them. */
2637 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2639 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2640 methods
->iterate (idx
, &ovl
);
2643 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2644 /* There are no more conversion functions. */
2647 /* Glue all these conversion functions together
2648 with those we already have. */
2649 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2650 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2654 if (fns
== NULL_TREE
)
2656 error ("no member function %qD declared in %qT", name
, ctype
);
2657 return error_mark_node
;
2660 TREE_OPERAND (declarator
, 0) = fns
;
2663 /* Figure out what exactly is being specialized at this point.
2664 Note that for an explicit instantiation, even one for a
2665 member function, we cannot tell apriori whether the
2666 instantiation is for a member template, or just a member
2667 function of a template class. Even if a member template is
2668 being instantiated, the member template arguments may be
2669 elided if they can be deduced from the rest of the
2671 tmpl
= determine_specialization (declarator
, decl
,
2673 member_specialization
,
2677 if (!tmpl
|| tmpl
== error_mark_node
)
2678 /* We couldn't figure out what this declaration was
2680 return error_mark_node
;
2683 tree gen_tmpl
= most_general_template (tmpl
);
2685 if (explicit_instantiation
)
2687 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2688 is done by do_decl_instantiation later. */
2690 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2691 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2693 if (arg_depth
> parm_depth
)
2695 /* If TMPL is not the most general template (for
2696 example, if TMPL is a friend template that is
2697 injected into namespace scope), then there will
2698 be too many levels of TARGS. Remove some of them
2703 new_targs
= make_tree_vec (parm_depth
);
2704 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2705 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2706 = TREE_VEC_ELT (targs
, i
);
2710 return instantiate_template (tmpl
, targs
, tf_error
);
2713 /* If we thought that the DECL was a member function, but it
2714 turns out to be specializing a static member function,
2715 make DECL a static member function as well. */
2716 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2717 && DECL_STATIC_FUNCTION_P (tmpl
)
2718 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2719 revert_static_member_fn (decl
);
2721 /* If this is a specialization of a member template of a
2722 template class, we want to return the TEMPLATE_DECL, not
2723 the specialization of it. */
2724 if (tsk
== tsk_template
)
2726 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2727 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2728 DECL_INITIAL (result
) = NULL_TREE
;
2732 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2733 DECL_SOURCE_LOCATION (result
)
2734 = DECL_SOURCE_LOCATION (decl
);
2735 /* We want to use the argument list specified in the
2736 definition, not in the original declaration. */
2737 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2738 for (parm
= DECL_ARGUMENTS (result
); parm
;
2739 parm
= DECL_CHAIN (parm
))
2740 DECL_CONTEXT (parm
) = result
;
2742 return register_specialization (tmpl
, gen_tmpl
, targs
,
2746 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2747 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2749 /* Inherit default function arguments from the template
2750 DECL is specializing. */
2751 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2752 copy_default_args_to_explicit_spec (decl
);
2754 /* This specialization has the same protection as the
2755 template it specializes. */
2756 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2757 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2759 /* 7.1.1-1 [dcl.stc]
2761 A storage-class-specifier shall not be specified in an
2762 explicit specialization...
2764 The parser rejects these, so unless action is taken here,
2765 explicit function specializations will always appear with
2768 The action recommended by the C++ CWG in response to C++
2769 defect report 605 is to make the storage class and linkage
2770 of the explicit specialization match the templated function:
2772 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2774 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2776 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2777 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2779 /* This specialization has the same linkage and visibility as
2780 the function template it specializes. */
2781 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2782 if (! TREE_PUBLIC (decl
))
2784 DECL_INTERFACE_KNOWN (decl
) = 1;
2785 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2787 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2788 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2790 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2791 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2795 /* If DECL is a friend declaration, declared using an
2796 unqualified name, the namespace associated with DECL may
2797 have been set incorrectly. For example, in:
2799 template <typename T> void f(T);
2801 struct S { friend void f<int>(int); }
2804 we will have set the DECL_CONTEXT for the friend
2805 declaration to N, rather than to the global namespace. */
2806 if (DECL_NAMESPACE_SCOPE_P (decl
))
2807 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2809 if (is_friend
&& !have_def
)
2810 /* This is not really a declaration of a specialization.
2811 It's just the name of an instantiation. But, it's not
2812 a request for an instantiation, either. */
2813 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2814 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
2815 /* A specialization is not necessarily COMDAT. */
2816 DECL_COMDAT (decl
) = DECL_DECLARED_INLINE_P (decl
);
2817 else if (TREE_CODE (decl
) == VAR_DECL
)
2818 DECL_COMDAT (decl
) = false;
2820 /* Register this specialization so that we can find it
2822 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2824 /* A 'structor should already have clones. */
2825 gcc_assert (decl
== error_mark_node
2826 || variable_template_p (tmpl
)
2827 || !(DECL_CONSTRUCTOR_P (decl
)
2828 || DECL_DESTRUCTOR_P (decl
))
2829 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
2836 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2837 parameters. These are represented in the same format used for
2838 DECL_TEMPLATE_PARMS. */
2841 comp_template_parms (const_tree parms1
, const_tree parms2
)
2846 if (parms1
== parms2
)
2849 for (p1
= parms1
, p2
= parms2
;
2850 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2851 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2853 tree t1
= TREE_VALUE (p1
);
2854 tree t2
= TREE_VALUE (p2
);
2857 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2858 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2860 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2863 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2865 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2866 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2868 /* If either of the template parameters are invalid, assume
2869 they match for the sake of error recovery. */
2870 if (error_operand_p (parm1
) || error_operand_p (parm2
))
2873 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2876 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2877 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2878 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2880 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2885 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2886 /* One set of parameters has more parameters lists than the
2893 /* Determine whether PARM is a parameter pack. */
2896 template_parameter_pack_p (const_tree parm
)
2898 /* Determine if we have a non-type template parameter pack. */
2899 if (TREE_CODE (parm
) == PARM_DECL
)
2900 return (DECL_TEMPLATE_PARM_P (parm
)
2901 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2902 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2903 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2905 /* If this is a list of template parameters, we could get a
2906 TYPE_DECL or a TEMPLATE_DECL. */
2907 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2908 parm
= TREE_TYPE (parm
);
2910 /* Otherwise it must be a type template parameter. */
2911 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2912 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2913 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2916 /* Determine if T is a function parameter pack. */
2919 function_parameter_pack_p (const_tree t
)
2921 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2922 return DECL_PACK_P (t
);
2926 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2927 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2930 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2932 if (! primary_func_tmpl_inst
2933 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2934 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2937 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2940 /* Return true iff the function parameter PARAM_DECL was expanded
2941 from the function parameter pack PACK. */
2944 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2946 if (DECL_ARTIFICIAL (param_decl
)
2947 || !function_parameter_pack_p (pack
))
2950 /* The parameter pack and its pack arguments have the same
2952 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2955 /* Determine whether ARGS describes a variadic template args list,
2956 i.e., one that is terminated by a template argument pack. */
2959 template_args_variadic_p (tree args
)
2964 if (args
== NULL_TREE
)
2967 args
= INNERMOST_TEMPLATE_ARGS (args
);
2968 nargs
= TREE_VEC_LENGTH (args
);
2973 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2975 return ARGUMENT_PACK_P (last_parm
);
2978 /* Generate a new name for the parameter pack name NAME (an
2979 IDENTIFIER_NODE) that incorporates its */
2982 make_ith_pack_parameter_name (tree name
, int i
)
2984 /* Munge the name to include the parameter index. */
2985 #define NUMBUF_LEN 128
2986 char numbuf
[NUMBUF_LEN
];
2990 if (name
== NULL_TREE
)
2992 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2993 newname_len
= IDENTIFIER_LENGTH (name
)
2994 + strlen (numbuf
) + 2;
2995 newname
= (char*)alloca (newname_len
);
2996 snprintf (newname
, newname_len
,
2997 "%s#%i", IDENTIFIER_POINTER (name
), i
);
2998 return get_identifier (newname
);
3001 /* Return true if T is a primary function, class or alias template
3005 primary_template_instantiation_p (const_tree t
)
3010 if (TREE_CODE (t
) == FUNCTION_DECL
)
3011 return DECL_LANG_SPECIFIC (t
)
3012 && DECL_TEMPLATE_INSTANTIATION (t
)
3013 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3014 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3015 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3016 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3017 else if (alias_template_specialization_p (t
))
3022 /* Return true if PARM is a template template parameter. */
3025 template_template_parameter_p (const_tree parm
)
3027 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3030 /* Return true iff PARM is a DECL representing a type template
3034 template_type_parameter_p (const_tree parm
)
3037 && (TREE_CODE (parm
) == TYPE_DECL
3038 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3039 && DECL_TEMPLATE_PARM_P (parm
));
3042 /* Return the template parameters of T if T is a
3043 primary template instantiation, NULL otherwise. */
3046 get_primary_template_innermost_parameters (const_tree t
)
3048 tree parms
= NULL
, template_info
= NULL
;
3050 if ((template_info
= get_template_info (t
))
3051 && primary_template_instantiation_p (t
))
3052 parms
= INNERMOST_TEMPLATE_PARMS
3053 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3058 /* Return the template parameters of the LEVELth level from the full list
3059 of template parameters PARMS. */
3062 get_template_parms_at_level (tree parms
, int level
)
3066 || TREE_CODE (parms
) != TREE_LIST
3067 || level
> TMPL_PARMS_DEPTH (parms
))
3070 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3071 if (TMPL_PARMS_DEPTH (p
) == level
)
3077 /* Returns the template arguments of T if T is a template instantiation,
3081 get_template_innermost_arguments (const_tree t
)
3083 tree args
= NULL
, template_info
= NULL
;
3085 if ((template_info
= get_template_info (t
))
3086 && TI_ARGS (template_info
))
3087 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3092 /* Return the argument pack elements of T if T is a template argument pack,
3096 get_template_argument_pack_elems (const_tree t
)
3098 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3099 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3102 return ARGUMENT_PACK_ARGS (t
);
3105 /* Structure used to track the progress of find_parameter_packs_r. */
3106 struct find_parameter_pack_data
3108 /* TREE_LIST that will contain all of the parameter packs found by
3110 tree
* parameter_packs
;
3112 /* Set of AST nodes that have been visited by the traversal. */
3113 hash_set
<tree
> *visited
;
3116 /* Identifies all of the argument packs that occur in a template
3117 argument and appends them to the TREE_LIST inside DATA, which is a
3118 find_parameter_pack_data structure. This is a subroutine of
3119 make_pack_expansion and uses_parameter_packs. */
3121 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3124 struct find_parameter_pack_data
* ppd
=
3125 (struct find_parameter_pack_data
*)data
;
3126 bool parameter_pack_p
= false;
3128 /* Handle type aliases/typedefs. */
3129 if (TYPE_ALIAS_P (t
))
3131 if (TYPE_TEMPLATE_INFO (t
))
3132 cp_walk_tree (&TYPE_TI_ARGS (t
),
3133 &find_parameter_packs_r
,
3139 /* Identify whether this is a parameter pack or not. */
3140 switch (TREE_CODE (t
))
3142 case TEMPLATE_PARM_INDEX
:
3143 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3144 parameter_pack_p
= true;
3147 case TEMPLATE_TYPE_PARM
:
3148 t
= TYPE_MAIN_VARIANT (t
);
3149 case TEMPLATE_TEMPLATE_PARM
:
3150 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3151 parameter_pack_p
= true;
3156 if (DECL_PACK_P (t
))
3158 /* We don't want to walk into the type of a PARM_DECL,
3159 because we don't want to see the type parameter pack. */
3161 parameter_pack_p
= true;
3165 /* Look through a lambda capture proxy to the field pack. */
3167 if (DECL_HAS_VALUE_EXPR_P (t
))
3169 tree v
= DECL_VALUE_EXPR (t
);
3171 &find_parameter_packs_r
,
3178 parameter_pack_p
= true;
3181 /* Not a parameter pack. */
3185 if (parameter_pack_p
)
3187 /* Add this parameter pack to the list. */
3188 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3192 cp_walk_tree (&TYPE_CONTEXT (t
),
3193 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3195 /* This switch statement will return immediately if we don't find a
3197 switch (TREE_CODE (t
))
3199 case TEMPLATE_PARM_INDEX
:
3202 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3203 /* Check the template itself. */
3204 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3205 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3206 /* Check the template arguments. */
3207 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3212 case TEMPLATE_TYPE_PARM
:
3213 case TEMPLATE_TEMPLATE_PARM
:
3220 if (TYPE_PTRMEMFUNC_P (t
))
3226 if (TYPE_TEMPLATE_INFO (t
))
3227 cp_walk_tree (&TYPE_TI_ARGS (t
),
3228 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3235 cp_walk_tree (&TREE_TYPE (t
),
3236 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3240 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3245 case TYPE_PACK_EXPANSION
:
3246 case EXPR_PACK_EXPANSION
:
3251 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3256 case IDENTIFIER_NODE
:
3257 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3269 /* Determines if the expression or type T uses any parameter packs. */
3271 uses_parameter_packs (tree t
)
3273 tree parameter_packs
= NULL_TREE
;
3274 struct find_parameter_pack_data ppd
;
3275 ppd
.parameter_packs
= ¶meter_packs
;
3276 ppd
.visited
= new hash_set
<tree
>;
3277 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3279 return parameter_packs
!= NULL_TREE
;
3282 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3283 representation a base-class initializer into a parameter pack
3284 expansion. If all goes well, the resulting node will be an
3285 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3288 make_pack_expansion (tree arg
)
3291 tree parameter_packs
= NULL_TREE
;
3292 bool for_types
= false;
3293 struct find_parameter_pack_data ppd
;
3295 if (!arg
|| arg
== error_mark_node
)
3298 if (TREE_CODE (arg
) == TREE_LIST
)
3300 /* The only time we will see a TREE_LIST here is for a base
3301 class initializer. In this case, the TREE_PURPOSE will be a
3302 _TYPE node (representing the base class expansion we're
3303 initializing) and the TREE_VALUE will be a TREE_LIST
3304 containing the initialization arguments.
3306 The resulting expansion looks somewhat different from most
3307 expansions. Rather than returning just one _EXPANSION, we
3308 return a TREE_LIST whose TREE_PURPOSE is a
3309 TYPE_PACK_EXPANSION containing the bases that will be
3310 initialized. The TREE_VALUE will be identical to the
3311 original TREE_VALUE, which is a list of arguments that will
3312 be passed to each base. We do not introduce any new pack
3313 expansion nodes into the TREE_VALUE (although it is possible
3314 that some already exist), because the TREE_PURPOSE and
3315 TREE_VALUE all need to be expanded together with the same
3316 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3317 resulting TREE_PURPOSE will mention the parameter packs in
3318 both the bases and the arguments to the bases. */
3321 tree parameter_packs
= NULL_TREE
;
3323 /* Determine which parameter packs will be used by the base
3325 ppd
.visited
= new hash_set
<tree
>;
3326 ppd
.parameter_packs
= ¶meter_packs
;
3327 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3330 if (parameter_packs
== NULL_TREE
)
3332 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3334 return error_mark_node
;
3337 if (TREE_VALUE (arg
) != void_type_node
)
3339 /* Collect the sets of parameter packs used in each of the
3340 initialization arguments. */
3341 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3343 /* Determine which parameter packs will be expanded in this
3345 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3352 /* Create the pack expansion type for the base type. */
3353 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3354 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3355 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3357 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3358 they will rarely be compared to anything. */
3359 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3361 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3364 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3367 /* Build the PACK_EXPANSION_* node. */
3369 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3370 : make_node (EXPR_PACK_EXPANSION
);
3371 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3372 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3374 /* Propagate type and const-expression information. */
3375 TREE_TYPE (result
) = TREE_TYPE (arg
);
3376 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3379 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3380 they will rarely be compared to anything. */
3381 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3383 /* Determine which parameter packs will be expanded. */
3384 ppd
.parameter_packs
= ¶meter_packs
;
3385 ppd
.visited
= new hash_set
<tree
>;
3386 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3389 /* Make sure we found some parameter packs. */
3390 if (parameter_packs
== NULL_TREE
)
3393 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3395 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3396 return error_mark_node
;
3398 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3400 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3405 /* Checks T for any "bare" parameter packs, which have not yet been
3406 expanded, and issues an error if any are found. This operation can
3407 only be done on full expressions or types (e.g., an expression
3408 statement, "if" condition, etc.), because we could have expressions like:
3410 foo(f(g(h(args)))...)
3412 where "args" is a parameter pack. check_for_bare_parameter_packs
3413 should not be called for the subexpressions args, h(args),
3414 g(h(args)), or f(g(h(args))), because we would produce erroneous
3417 Returns TRUE and emits an error if there were bare parameter packs,
3418 returns FALSE otherwise. */
3420 check_for_bare_parameter_packs (tree t
)
3422 tree parameter_packs
= NULL_TREE
;
3423 struct find_parameter_pack_data ppd
;
3425 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3428 if (TREE_CODE (t
) == TYPE_DECL
)
3431 ppd
.parameter_packs
= ¶meter_packs
;
3432 ppd
.visited
= new hash_set
<tree
>;
3433 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3436 if (parameter_packs
)
3438 error ("parameter packs not expanded with %<...%>:");
3439 while (parameter_packs
)
3441 tree pack
= TREE_VALUE (parameter_packs
);
3442 tree name
= NULL_TREE
;
3444 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3445 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3446 name
= TYPE_NAME (pack
);
3447 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3448 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3450 name
= DECL_NAME (pack
);
3453 inform (input_location
, " %qD", name
);
3455 inform (input_location
, " <anonymous>");
3457 parameter_packs
= TREE_CHAIN (parameter_packs
);
3466 /* Expand any parameter packs that occur in the template arguments in
3469 expand_template_argument_pack (tree args
)
3471 tree result_args
= NULL_TREE
;
3472 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3473 int num_result_args
= -1;
3474 int non_default_args_count
= -1;
3476 /* First, determine if we need to expand anything, and the number of
3477 slots we'll need. */
3478 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3480 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3481 if (arg
== NULL_TREE
)
3483 if (ARGUMENT_PACK_P (arg
))
3485 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3486 if (num_result_args
< 0)
3487 num_result_args
= in_arg
+ num_packed
;
3489 num_result_args
+= num_packed
;
3493 if (num_result_args
>= 0)
3498 /* If no expansion is necessary, we're done. */
3499 if (num_result_args
< 0)
3502 /* Expand arguments. */
3503 result_args
= make_tree_vec (num_result_args
);
3504 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3505 non_default_args_count
=
3506 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3507 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3509 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3510 if (ARGUMENT_PACK_P (arg
))
3512 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3513 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3514 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3515 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3516 if (non_default_args_count
> 0)
3517 non_default_args_count
+= num_packed
- 1;
3521 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3525 if (non_default_args_count
>= 0)
3526 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3530 /* Checks if DECL shadows a template parameter.
3532 [temp.local]: A template-parameter shall not be redeclared within its
3533 scope (including nested scopes).
3535 Emits an error and returns TRUE if the DECL shadows a parameter,
3536 returns FALSE otherwise. */
3539 check_template_shadow (tree decl
)
3543 /* If we're not in a template, we can't possibly shadow a template
3545 if (!current_template_parms
)
3548 /* Figure out what we're shadowing. */
3549 if (TREE_CODE (decl
) == OVERLOAD
)
3550 decl
= OVL_CURRENT (decl
);
3551 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3553 /* If there's no previous binding for this name, we're not shadowing
3554 anything, let alone a template parameter. */
3558 /* If we're not shadowing a template parameter, we're done. Note
3559 that OLDDECL might be an OVERLOAD (or perhaps even an
3560 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3562 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3565 /* We check for decl != olddecl to avoid bogus errors for using a
3566 name inside a class. We check TPFI to avoid duplicate errors for
3567 inline member templates. */
3569 || (DECL_TEMPLATE_PARM_P (decl
)
3570 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3573 /* Don't complain about the injected class name, as we've already
3574 complained about the class itself. */
3575 if (DECL_SELF_REFERENCE_P (decl
))
3578 error ("declaration of %q+#D", decl
);
3579 error (" shadows template parm %q+#D", olddecl
);
3583 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3584 ORIG_LEVEL, DECL, and TYPE. */
3587 build_template_parm_index (int index
,
3593 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3594 TEMPLATE_PARM_IDX (t
) = index
;
3595 TEMPLATE_PARM_LEVEL (t
) = level
;
3596 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3597 TEMPLATE_PARM_DECL (t
) = decl
;
3598 TREE_TYPE (t
) = type
;
3599 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3600 TREE_READONLY (t
) = TREE_READONLY (decl
);
3605 /* Find the canonical type parameter for the given template type
3606 parameter. Returns the canonical type parameter, which may be TYPE
3607 if no such parameter existed. */
3610 canonical_type_parameter (tree type
)
3613 int idx
= TEMPLATE_TYPE_IDX (type
);
3614 if (!canonical_template_parms
)
3615 vec_alloc (canonical_template_parms
, idx
+1);
3617 while (canonical_template_parms
->length () <= (unsigned)idx
)
3618 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3620 list
= (*canonical_template_parms
)[idx
];
3621 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3622 list
= TREE_CHAIN (list
);
3625 return TREE_VALUE (list
);
3628 (*canonical_template_parms
)[idx
]
3629 = tree_cons (NULL_TREE
, type
,
3630 (*canonical_template_parms
)[idx
]);
3635 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3636 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3637 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3638 new one is created. */
3641 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3642 tsubst_flags_t complain
)
3644 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3645 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3646 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3647 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3649 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3652 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3653 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3654 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3655 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3656 DECL_ARTIFICIAL (decl
) = 1;
3657 SET_DECL_TEMPLATE_PARM_P (decl
);
3659 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3660 TEMPLATE_PARM_LEVEL (index
) - levels
,
3661 TEMPLATE_PARM_ORIG_LEVEL (index
),
3663 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3664 TEMPLATE_PARM_PARAMETER_PACK (t
)
3665 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3667 /* Template template parameters need this. */
3668 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3669 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3670 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3674 return TEMPLATE_PARM_DESCENDANTS (index
);
3677 /* Process information from new template parameter PARM and append it
3678 to the LIST being built. This new parameter is a non-type
3679 parameter iff IS_NON_TYPE is true. This new parameter is a
3680 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3684 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3685 bool is_non_type
, bool is_parameter_pack
)
3691 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3692 defval
= TREE_PURPOSE (parm
);
3696 tree p
= tree_last (list
);
3698 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3701 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3702 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3704 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3712 parm
= TREE_VALUE (parm
);
3714 SET_DECL_TEMPLATE_PARM_P (parm
);
3716 if (TREE_TYPE (parm
) != error_mark_node
)
3720 The top-level cv-qualifiers on the template-parameter are
3721 ignored when determining its type. */
3722 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3723 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3724 TREE_TYPE (parm
) = error_mark_node
;
3725 else if (uses_parameter_packs (TREE_TYPE (parm
))
3726 && !is_parameter_pack
3727 /* If we're in a nested template parameter list, the template
3728 template parameter could be a parameter pack. */
3729 && processing_template_parmlist
== 1)
3731 /* This template parameter is not a parameter pack, but it
3732 should be. Complain about "bare" parameter packs. */
3733 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3735 /* Recover by calling this a parameter pack. */
3736 is_parameter_pack
= true;
3740 /* A template parameter is not modifiable. */
3741 TREE_CONSTANT (parm
) = 1;
3742 TREE_READONLY (parm
) = 1;
3743 decl
= build_decl (parm_loc
,
3744 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3745 TREE_CONSTANT (decl
) = 1;
3746 TREE_READONLY (decl
) = 1;
3747 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3748 = build_template_parm_index (idx
, processing_template_decl
,
3749 processing_template_decl
,
3750 decl
, TREE_TYPE (parm
));
3752 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3753 = is_parameter_pack
;
3758 parm
= TREE_VALUE (TREE_VALUE (parm
));
3760 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3762 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3763 /* This is for distinguishing between real templates and template
3764 template parameters */
3765 TREE_TYPE (parm
) = t
;
3766 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3771 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3772 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3773 decl
= build_decl (parm_loc
,
3774 TYPE_DECL
, parm
, t
);
3777 TYPE_NAME (t
) = decl
;
3778 TYPE_STUB_DECL (t
) = decl
;
3780 TEMPLATE_TYPE_PARM_INDEX (t
)
3781 = build_template_parm_index (idx
, processing_template_decl
,
3782 processing_template_decl
,
3783 decl
, TREE_TYPE (parm
));
3784 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3785 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3787 DECL_ARTIFICIAL (decl
) = 1;
3788 SET_DECL_TEMPLATE_PARM_P (decl
);
3790 parm
= build_tree_list (defval
, parm
);
3791 return chainon (list
, parm
);
3794 /* The end of a template parameter list has been reached. Process the
3795 tree list into a parameter vector, converting each parameter into a more
3796 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3800 end_template_parm_list (tree parms
)
3804 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3806 current_template_parms
3807 = tree_cons (size_int (processing_template_decl
),
3808 saved_parmlist
, current_template_parms
);
3810 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3812 next
= TREE_CHAIN (parm
);
3813 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3814 TREE_CHAIN (parm
) = NULL_TREE
;
3817 --processing_template_parmlist
;
3819 return saved_parmlist
;
3822 /* end_template_decl is called after a template declaration is seen. */
3825 end_template_decl (void)
3827 reset_specialization ();
3829 if (! processing_template_decl
)
3832 /* This matches the pushlevel in begin_template_parm_list. */
3835 --processing_template_decl
;
3836 current_template_parms
= TREE_CHAIN (current_template_parms
);
3839 /* Takes a TREE_LIST representing a template parameter and convert it
3840 into an argument suitable to be passed to the type substitution
3841 functions. Note that If the TREE_LIST contains an error_mark
3842 node, the returned argument is error_mark_node. */
3845 template_parm_to_arg (tree t
)
3849 || TREE_CODE (t
) != TREE_LIST
)
3852 if (error_operand_p (TREE_VALUE (t
)))
3853 return error_mark_node
;
3857 if (TREE_CODE (t
) == TYPE_DECL
3858 || TREE_CODE (t
) == TEMPLATE_DECL
)
3862 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3864 /* Turn this argument into a TYPE_ARGUMENT_PACK
3865 with a single element, which expands T. */
3866 tree vec
= make_tree_vec (1);
3867 #ifdef ENABLE_CHECKING
3868 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3869 (vec
, TREE_VEC_LENGTH (vec
));
3871 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3873 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3874 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3879 t
= DECL_INITIAL (t
);
3881 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3883 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3884 with a single element, which expands T. */
3885 tree vec
= make_tree_vec (1);
3886 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3887 #ifdef ENABLE_CHECKING
3888 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3889 (vec
, TREE_VEC_LENGTH (vec
));
3891 t
= convert_from_reference (t
);
3892 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3894 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3895 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3896 TREE_TYPE (t
) = type
;
3899 t
= convert_from_reference (t
);
3904 /* Given a set of template parameters, return them as a set of template
3905 arguments. The template parameters are represented as a TREE_VEC, in
3906 the form documented in cp-tree.h for template arguments. */
3909 template_parms_to_args (tree parms
)
3912 tree args
= NULL_TREE
;
3913 int length
= TMPL_PARMS_DEPTH (parms
);
3916 /* If there is only one level of template parameters, we do not
3917 create a TREE_VEC of TREE_VECs. Instead, we return a single
3918 TREE_VEC containing the arguments. */
3920 args
= make_tree_vec (length
);
3922 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3924 tree a
= copy_node (TREE_VALUE (header
));
3927 TREE_TYPE (a
) = NULL_TREE
;
3928 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3929 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3931 #ifdef ENABLE_CHECKING
3932 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3936 TREE_VEC_ELT (args
, --l
) = a
;
3941 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3942 /* This can happen for template parms of a template template
3945 template<template<class T, class U> class TT> struct S;
3947 Consider the level of the parms of TT; T and U both have
3948 level 2; TT has no template parm of level 1. So in this case
3949 the first element of full_template_args is NULL_TREE. If we
3950 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3951 of 2. This will make tsubst wrongly consider that T and U
3952 have level 1. Instead, let's create a dummy vector as the
3953 first element of full_template_args so that TMPL_ARGS_DEPTH
3954 returns the correct depth for args. */
3955 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3959 /* Within the declaration of a template, return the currently active
3960 template parameters as an argument TREE_VEC. */
3963 current_template_args (void)
3965 return template_parms_to_args (current_template_parms
);
3968 /* Update the declared TYPE by doing any lookups which were thought to be
3969 dependent, but are not now that we know the SCOPE of the declarator. */
3972 maybe_update_decl_type (tree orig_type
, tree scope
)
3974 tree type
= orig_type
;
3976 if (type
== NULL_TREE
)
3979 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3980 type
= TREE_TYPE (type
);
3982 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3983 && dependent_type_p (type
)
3984 /* Don't bother building up the args in this case. */
3985 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3987 /* tsubst in the args corresponding to the template parameters,
3988 including auto if present. Most things will be unchanged, but
3989 make_typename_type and tsubst_qualified_id will resolve
3990 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3991 tree args
= current_template_args ();
3992 tree auto_node
= type_uses_auto (type
);
3996 tree auto_vec
= make_tree_vec (1);
3997 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
3998 args
= add_to_template_args (args
, auto_vec
);
4000 pushed
= push_scope (scope
);
4001 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4006 if (type
== error_mark_node
)
4009 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4011 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4014 type
= TYPE_NAME (type
);
4019 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4020 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
4021 a member template. Used by push_template_decl below. */
4024 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4026 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4027 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4028 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4029 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4030 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4035 struct template_parm_data
4037 /* The level of the template parameters we are currently
4041 /* The index of the specialization argument we are currently
4045 /* An array whose size is the number of template parameters. The
4046 elements are nonzero if the parameter has been used in any one
4047 of the arguments processed so far. */
4050 /* An array whose size is the number of template arguments. The
4051 elements are nonzero if the argument makes use of template
4052 parameters of this level. */
4053 int* arg_uses_template_parms
;
4056 /* Subroutine of push_template_decl used to see if each template
4057 parameter in a partial specialization is used in the explicit
4058 argument list. If T is of the LEVEL given in DATA (which is
4059 treated as a template_parm_data*), then DATA->PARMS is marked
4063 mark_template_parm (tree t
, void* data
)
4067 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4069 template_parm_level_and_index (t
, &level
, &idx
);
4071 if (level
== tpd
->level
)
4073 tpd
->parms
[idx
] = 1;
4074 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4077 /* Return zero so that for_each_template_parm will continue the
4078 traversal of the tree; we want to mark *every* template parm. */
4082 /* Process the partial specialization DECL. */
4085 process_partial_specialization (tree decl
)
4087 tree type
= TREE_TYPE (decl
);
4088 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4089 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4090 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4091 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4094 int nargs
= TREE_VEC_LENGTH (inner_args
);
4097 bool did_error_intro
= false;
4098 struct template_parm_data tpd
;
4099 struct template_parm_data tpd2
;
4101 gcc_assert (current_template_parms
);
4103 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4104 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4106 /* We check that each of the template parameters given in the
4107 partial specialization is used in the argument list to the
4108 specialization. For example:
4110 template <class T> struct S;
4111 template <class T> struct S<T*>;
4113 The second declaration is OK because `T*' uses the template
4114 parameter T, whereas
4116 template <class T> struct S<int>;
4118 is no good. Even trickier is:
4129 The S2<T> declaration is actually invalid; it is a
4130 full-specialization. Of course,
4133 struct S2<T (*)(U)>;
4135 or some such would have been OK. */
4136 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4137 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4138 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4140 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4141 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4142 for (i
= 0; i
< nargs
; ++i
)
4144 tpd
.current_arg
= i
;
4145 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4146 &mark_template_parm
,
4149 /*include_nondeduced_p=*/false);
4151 for (i
= 0; i
< ntparms
; ++i
)
4152 if (tpd
.parms
[i
] == 0)
4154 /* One of the template parms was not used in a deduced context in the
4156 if (!did_error_intro
)
4158 error ("template parameters not deducible in "
4159 "partial specialization:");
4160 did_error_intro
= true;
4163 inform (input_location
, " %qD",
4164 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4167 if (did_error_intro
)
4168 return error_mark_node
;
4170 /* [temp.class.spec]
4172 The argument list of the specialization shall not be identical to
4173 the implicit argument list of the primary template. */
4174 if (comp_template_args
4176 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4178 error ("partial specialization %qT does not specialize any template arguments", type
);
4180 /* A partial specialization that replaces multiple parameters of the
4181 primary template with a pack expansion is less specialized for those
4183 if (nargs
< DECL_NTPARMS (maintmpl
))
4185 error ("partial specialization is not more specialized than the "
4186 "primary template because it replaces multiple parameters "
4187 "with a pack expansion");
4188 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4192 /* [temp.class.spec]
4194 A partially specialized non-type argument expression shall not
4195 involve template parameters of the partial specialization except
4196 when the argument expression is a simple identifier.
4198 The type of a template parameter corresponding to a specialized
4199 non-type argument shall not be dependent on a parameter of the
4202 Also, we verify that pack expansions only occur at the
4203 end of the argument list. */
4204 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4206 for (i
= 0; i
< nargs
; ++i
)
4208 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4209 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4210 tree packed_args
= NULL_TREE
;
4213 if (ARGUMENT_PACK_P (arg
))
4215 /* Extract the arguments from the argument pack. We'll be
4216 iterating over these in the following loop. */
4217 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4218 len
= TREE_VEC_LENGTH (packed_args
);
4221 for (j
= 0; j
< len
; j
++)
4224 /* Get the Jth argument in the parameter pack. */
4225 arg
= TREE_VEC_ELT (packed_args
, j
);
4227 if (PACK_EXPANSION_P (arg
))
4229 /* Pack expansions must come at the end of the
4231 if ((packed_args
&& j
< len
- 1)
4232 || (!packed_args
&& i
< nargs
- 1))
4234 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4235 error ("parameter pack argument %qE must be at the "
4236 "end of the template argument list", arg
);
4238 error ("parameter pack argument %qT must be at the "
4239 "end of the template argument list", arg
);
4243 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4244 /* We only care about the pattern. */
4245 arg
= PACK_EXPANSION_PATTERN (arg
);
4247 if (/* These first two lines are the `non-type' bit. */
4249 && TREE_CODE (arg
) != TEMPLATE_DECL
4250 /* This next two lines are the `argument expression is not just a
4251 simple identifier' condition and also the `specialized
4252 non-type argument' bit. */
4253 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4254 && !(REFERENCE_REF_P (arg
)
4255 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4257 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4258 || (packed_args
&& uses_template_parms (arg
)))
4259 error ("template argument %qE involves template parameter(s)",
4263 /* Look at the corresponding template parameter,
4264 marking which template parameters its type depends
4266 tree type
= TREE_TYPE (parm
);
4270 /* We haven't yet initialized TPD2. Do so now. */
4271 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4272 /* The number of parameters here is the number in the
4273 main template, which, as checked in the assertion
4275 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4277 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4280 /* Mark the template parameters. But this time, we're
4281 looking for the template parameters of the main
4282 template, not in the specialization. */
4283 tpd2
.current_arg
= i
;
4284 tpd2
.arg_uses_template_parms
[i
] = 0;
4285 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4286 for_each_template_parm (type
,
4287 &mark_template_parm
,
4290 /*include_nondeduced_p=*/false);
4292 if (tpd2
.arg_uses_template_parms
[i
])
4294 /* The type depended on some template parameters.
4295 If they are fully specialized in the
4296 specialization, that's OK. */
4299 for (j
= 0; j
< nargs
; ++j
)
4300 if (tpd2
.parms
[j
] != 0
4301 && tpd
.arg_uses_template_parms
[j
])
4304 error_n (input_location
, count
,
4305 "type %qT of template argument %qE depends "
4306 "on a template parameter",
4307 "type %qT of template argument %qE depends "
4308 "on template parameters",
4317 /* We should only get here once. */
4318 gcc_assert (!COMPLETE_TYPE_P (type
));
4320 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4321 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4322 TREE_TYPE (tmpl
) = type
;
4323 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4324 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4325 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4326 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4328 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4329 = tree_cons (specargs
, tmpl
,
4330 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4331 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4333 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4334 inst
= TREE_CHAIN (inst
))
4336 tree inst_type
= TREE_VALUE (inst
);
4337 if (COMPLETE_TYPE_P (inst_type
)
4338 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4340 tree spec
= most_specialized_class (inst_type
, tf_none
);
4341 if (spec
&& TREE_TYPE (spec
) == type
)
4342 permerror (input_location
,
4343 "partial specialization of %qT after instantiation "
4344 "of %qT", type
, inst_type
);
4351 /* PARM is a template parameter of some form; return the corresponding
4352 TEMPLATE_PARM_INDEX. */
4355 get_template_parm_index (tree parm
)
4357 if (TREE_CODE (parm
) == PARM_DECL
4358 || TREE_CODE (parm
) == CONST_DECL
)
4359 parm
= DECL_INITIAL (parm
);
4360 else if (TREE_CODE (parm
) == TYPE_DECL
4361 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4362 parm
= TREE_TYPE (parm
);
4363 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4364 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4365 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4366 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4370 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4371 parameter packs used by the template parameter PARM. */
4374 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4376 /* A type parm can't refer to another parm. */
4377 if (TREE_CODE (parm
) == TYPE_DECL
)
4379 else if (TREE_CODE (parm
) == PARM_DECL
)
4381 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4386 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4388 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4389 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4390 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4393 /* PARM is a template parameter pack. Return any parameter packs used in
4394 its type or the type of any of its template parameters. If there are
4395 any such packs, it will be instantiated into a fixed template parameter
4396 list by partial instantiation rather than be fully deduced. */
4399 fixed_parameter_pack_p (tree parm
)
4401 /* This can only be true in a member template. */
4402 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4404 /* This can only be true for a parameter pack. */
4405 if (!template_parameter_pack_p (parm
))
4407 /* A type parm can't refer to another parm. */
4408 if (TREE_CODE (parm
) == TYPE_DECL
)
4411 tree parameter_packs
= NULL_TREE
;
4412 struct find_parameter_pack_data ppd
;
4413 ppd
.parameter_packs
= ¶meter_packs
;
4414 ppd
.visited
= new hash_set
<tree
>;
4416 fixed_parameter_pack_p_1 (parm
, &ppd
);
4419 return parameter_packs
;
4422 /* Check that a template declaration's use of default arguments and
4423 parameter packs is not invalid. Here, PARMS are the template
4424 parameters. IS_PRIMARY is true if DECL is the thing declared by
4425 a primary template. IS_PARTIAL is true if DECL is a partial
4428 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4429 declaration (but not a definition); 1 indicates a declaration, 2
4430 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4431 emitted for extraneous default arguments.
4433 Returns TRUE if there were no errors found, FALSE otherwise. */
4436 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4437 bool is_partial
, int is_friend_decl
)
4440 int last_level_to_check
;
4442 bool no_errors
= true;
4446 A default template-argument shall not be specified in a
4447 function template declaration or a function template definition, nor
4448 in the template-parameter-list of the definition of a member of a
4451 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4452 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4453 /* You can't have a function template declaration in a local
4454 scope, nor you can you define a member of a class template in a
4458 if (TREE_CODE (decl
) == TYPE_DECL
4460 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4461 /* A lambda doesn't have an explicit declaration; don't complain
4462 about the parms of the enclosing class. */
4465 if (current_class_type
4466 && !TYPE_BEING_DEFINED (current_class_type
)
4467 && DECL_LANG_SPECIFIC (decl
)
4468 && DECL_DECLARES_FUNCTION_P (decl
)
4469 /* If this is either a friend defined in the scope of the class
4470 or a member function. */
4471 && (DECL_FUNCTION_MEMBER_P (decl
)
4472 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4473 : DECL_FRIEND_CONTEXT (decl
)
4474 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4476 /* And, if it was a member function, it really was defined in
4477 the scope of the class. */
4478 && (!DECL_FUNCTION_MEMBER_P (decl
)
4479 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4480 /* We already checked these parameters when the template was
4481 declared, so there's no need to do it again now. This function
4482 was defined in class scope, but we're processing its body now
4483 that the class is complete. */
4486 /* Core issue 226 (C++0x only): the following only applies to class
4489 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4493 If a template-parameter has a default template-argument, all
4494 subsequent template-parameters shall have a default
4495 template-argument supplied. */
4496 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4498 tree inner_parms
= TREE_VALUE (parm_level
);
4499 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4500 int seen_def_arg_p
= 0;
4503 for (i
= 0; i
< ntparms
; ++i
)
4505 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4507 if (parm
== error_mark_node
)
4510 if (TREE_PURPOSE (parm
))
4512 else if (seen_def_arg_p
4513 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4515 error ("no default argument for %qD", TREE_VALUE (parm
));
4516 /* For better subsequent error-recovery, we indicate that
4517 there should have been a default argument. */
4518 TREE_PURPOSE (parm
) = error_mark_node
;
4521 else if (!is_partial
4523 /* Don't complain about an enclosing partial
4525 && parm_level
== parms
4526 && TREE_CODE (decl
) == TYPE_DECL
4528 && template_parameter_pack_p (TREE_VALUE (parm
))
4529 /* A fixed parameter pack will be partially
4530 instantiated into a fixed length list. */
4531 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4533 /* A primary class template can only have one
4534 parameter pack, at the end of the template
4537 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4538 error ("parameter pack %qE must be at the end of the"
4539 " template parameter list", TREE_VALUE (parm
));
4541 error ("parameter pack %qT must be at the end of the"
4542 " template parameter list",
4543 TREE_TYPE (TREE_VALUE (parm
)));
4545 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4553 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4557 /* For an ordinary class template, default template arguments are
4558 allowed at the innermost level, e.g.:
4559 template <class T = int>
4561 but, in a partial specialization, they're not allowed even
4562 there, as we have in [temp.class.spec]:
4564 The template parameter list of a specialization shall not
4565 contain default template argument values.
4567 So, for a partial specialization, or for a function template
4568 (in C++98/C++03), we look at all of them. */
4571 /* But, for a primary class template that is not a partial
4572 specialization we look at all template parameters except the
4574 parms
= TREE_CHAIN (parms
);
4576 /* Figure out what error message to issue. */
4577 if (is_friend_decl
== 2)
4578 msg
= G_("default template arguments may not be used in function template "
4579 "friend re-declaration");
4580 else if (is_friend_decl
)
4581 msg
= G_("default template arguments may not be used in function template "
4582 "friend declarations");
4583 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4584 msg
= G_("default template arguments may not be used in function templates "
4585 "without -std=c++11 or -std=gnu++11");
4586 else if (is_partial
)
4587 msg
= G_("default template arguments may not be used in "
4588 "partial specializations");
4590 msg
= G_("default argument for template parameter for class enclosing %qD");
4592 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4593 /* If we're inside a class definition, there's no need to
4594 examine the parameters to the class itself. On the one
4595 hand, they will be checked when the class is defined, and,
4596 on the other, default arguments are valid in things like:
4597 template <class T = double>
4598 struct S { template <class U> void f(U); };
4599 Here the default argument for `S' has no bearing on the
4600 declaration of `f'. */
4601 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4603 /* Check everything. */
4604 last_level_to_check
= 0;
4606 for (parm_level
= parms
;
4607 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4608 parm_level
= TREE_CHAIN (parm_level
))
4610 tree inner_parms
= TREE_VALUE (parm_level
);
4614 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4615 for (i
= 0; i
< ntparms
; ++i
)
4617 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4620 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4625 if (is_friend_decl
== 2)
4632 /* Clear out the default argument so that we are not
4634 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4638 /* At this point, if we're still interested in issuing messages,
4639 they must apply to classes surrounding the object declared. */
4641 msg
= G_("default argument for template parameter for class "
4648 /* Worker for push_template_decl_real, called via
4649 for_each_template_parm. DATA is really an int, indicating the
4650 level of the parameters we are interested in. If T is a template
4651 parameter of that level, return nonzero. */
4654 template_parm_this_level_p (tree t
, void* data
)
4656 int this_level
= *(int *)data
;
4659 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4660 level
= TEMPLATE_PARM_LEVEL (t
);
4662 level
= TEMPLATE_TYPE_LEVEL (t
);
4663 return level
== this_level
;
4666 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4667 parameters given by current_template_args, or reuses a
4668 previously existing one, if appropriate. Returns the DECL, or an
4669 equivalent one, if it is replaced via a call to duplicate_decls.
4671 If IS_FRIEND is true, DECL is a friend declaration. */
4674 push_template_decl_real (tree decl
, bool is_friend
)
4682 int new_template_p
= 0;
4683 /* True if the template is a member template, in the sense of
4685 bool member_template_p
= false;
4687 if (decl
== error_mark_node
|| !current_template_parms
)
4688 return error_mark_node
;
4690 /* See if this is a partial specialization. */
4691 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4692 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4693 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4695 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4699 /* For a friend, we want the context of the friend function, not
4700 the type of which it is a friend. */
4701 ctx
= CP_DECL_CONTEXT (decl
);
4702 else if (CP_DECL_CONTEXT (decl
)
4703 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4704 /* In the case of a virtual function, we want the class in which
4706 ctx
= CP_DECL_CONTEXT (decl
);
4708 /* Otherwise, if we're currently defining some class, the DECL
4709 is assumed to be a member of the class. */
4710 ctx
= current_scope ();
4712 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4715 if (!DECL_CONTEXT (decl
))
4716 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4718 /* See if this is a primary template. */
4719 if (is_friend
&& ctx
4720 && uses_template_parms_level (ctx
, processing_template_decl
))
4721 /* A friend template that specifies a class context, i.e.
4722 template <typename T> friend void A<T>::f();
4726 is_primary
= template_parm_scope_p ();
4730 if (DECL_CLASS_SCOPE_P (decl
))
4731 member_template_p
= true;
4732 if (TREE_CODE (decl
) == TYPE_DECL
4733 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4735 error ("template class without a name");
4736 return error_mark_node
;
4738 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4740 if (member_template_p
)
4742 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
4743 error ("member template %qD may not have virt-specifiers", decl
);
4745 if (DECL_DESTRUCTOR_P (decl
))
4749 A destructor shall not be a member template. */
4750 error ("destructor %qD declared as member template", decl
);
4751 return error_mark_node
;
4753 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4754 && (!prototype_p (TREE_TYPE (decl
))
4755 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4756 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4757 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4758 == void_list_node
)))
4760 /* [basic.stc.dynamic.allocation]
4762 An allocation function can be a function
4763 template. ... Template allocation functions shall
4764 have two or more parameters. */
4765 error ("invalid template declaration of %qD", decl
);
4766 return error_mark_node
;
4769 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4770 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4772 else if (TREE_CODE (decl
) == TYPE_DECL
4773 && TYPE_DECL_ALIAS_P (decl
))
4774 /* alias-declaration */
4775 gcc_assert (!DECL_ARTIFICIAL (decl
));
4776 else if (VAR_P (decl
))
4778 if (!DECL_DECLARED_CONSTEXPR_P (decl
))
4780 sorry ("template declaration of non-constexpr variable %qD",
4782 return error_mark_node
;
4787 error ("template declaration of %q#D", decl
);
4788 return error_mark_node
;
4792 /* Check to see that the rules regarding the use of default
4793 arguments are not being violated. */
4794 check_default_tmpl_args (decl
, current_template_parms
,
4795 is_primary
, is_partial
, /*is_friend_decl=*/0);
4797 /* Ensure that there are no parameter packs in the type of this
4798 declaration that have not been expanded. */
4799 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4801 /* Check each of the arguments individually to see if there are
4802 any bare parameter packs. */
4803 tree type
= TREE_TYPE (decl
);
4804 tree arg
= DECL_ARGUMENTS (decl
);
4805 tree argtype
= TYPE_ARG_TYPES (type
);
4807 while (arg
&& argtype
)
4809 if (!DECL_PACK_P (arg
)
4810 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4812 /* This is a PARM_DECL that contains unexpanded parameter
4813 packs. We have already complained about this in the
4814 check_for_bare_parameter_packs call, so just replace
4815 these types with ERROR_MARK_NODE. */
4816 TREE_TYPE (arg
) = error_mark_node
;
4817 TREE_VALUE (argtype
) = error_mark_node
;
4820 arg
= DECL_CHAIN (arg
);
4821 argtype
= TREE_CHAIN (argtype
);
4824 /* Check for bare parameter packs in the return type and the
4825 exception specifiers. */
4826 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4827 /* Errors were already issued, set return type to int
4828 as the frontend doesn't expect error_mark_node as
4830 TREE_TYPE (type
) = integer_type_node
;
4831 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4832 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4834 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4835 && TYPE_DECL_ALIAS_P (decl
))
4836 ? DECL_ORIGINAL_TYPE (decl
)
4837 : TREE_TYPE (decl
)))
4839 TREE_TYPE (decl
) = error_mark_node
;
4840 return error_mark_node
;
4844 return process_partial_specialization (decl
);
4846 args
= current_template_args ();
4849 || TREE_CODE (ctx
) == FUNCTION_DECL
4850 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4851 || (TREE_CODE (decl
) == TYPE_DECL
4852 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4853 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4855 if (DECL_LANG_SPECIFIC (decl
)
4856 && DECL_TEMPLATE_INFO (decl
)
4857 && DECL_TI_TEMPLATE (decl
))
4858 tmpl
= DECL_TI_TEMPLATE (decl
);
4859 /* If DECL is a TYPE_DECL for a class-template, then there won't
4860 be DECL_LANG_SPECIFIC. The information equivalent to
4861 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4862 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4863 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4864 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4866 /* Since a template declaration already existed for this
4867 class-type, we must be redeclaring it here. Make sure
4868 that the redeclaration is valid. */
4869 redeclare_class_template (TREE_TYPE (decl
),
4870 current_template_parms
);
4871 /* We don't need to create a new TEMPLATE_DECL; just use the
4872 one we already had. */
4873 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4877 tmpl
= build_template_decl (decl
, current_template_parms
,
4881 if (DECL_LANG_SPECIFIC (decl
)
4882 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4884 /* A specialization of a member template of a template
4886 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4887 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4888 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4894 tree a
, t
, current
, parms
;
4896 tree tinfo
= get_template_info (decl
);
4900 error ("template definition of non-template %q#D", decl
);
4901 return error_mark_node
;
4904 tmpl
= TI_TEMPLATE (tinfo
);
4906 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4907 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4908 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4909 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4913 /* The declaration is a specialization of a member
4914 template, declared outside the class. Therefore, the
4915 innermost template arguments will be NULL, so we
4916 replace them with the arguments determined by the
4917 earlier call to check_explicit_specialization. */
4918 args
= DECL_TI_ARGS (decl
);
4921 = build_template_decl (decl
, current_template_parms
,
4923 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4924 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4925 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4926 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4927 DECL_TEMPLATE_INFO (new_tmpl
)
4928 = build_template_info (tmpl
, args
);
4930 register_specialization (new_tmpl
,
4931 most_general_template (tmpl
),
4937 /* Make sure the template headers we got make sense. */
4939 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4940 i
= TMPL_PARMS_DEPTH (parms
);
4941 if (TMPL_ARGS_DEPTH (args
) != i
)
4943 error ("expected %d levels of template parms for %q#D, got %d",
4944 i
, decl
, TMPL_ARGS_DEPTH (args
));
4945 DECL_INTERFACE_KNOWN (decl
) = 1;
4946 return error_mark_node
;
4949 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4951 a
= TMPL_ARGS_LEVEL (args
, i
);
4952 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4954 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4956 if (current
== decl
)
4957 error ("got %d template parameters for %q#D",
4958 TREE_VEC_LENGTH (a
), decl
);
4960 error ("got %d template parameters for %q#T",
4961 TREE_VEC_LENGTH (a
), current
);
4962 error (" but %d required", TREE_VEC_LENGTH (t
));
4963 /* Avoid crash in import_export_decl. */
4964 DECL_INTERFACE_KNOWN (decl
) = 1;
4965 return error_mark_node
;
4968 if (current
== decl
)
4970 else if (current
== NULL_TREE
)
4971 /* Can happen in erroneous input. */
4974 current
= get_containing_scope (current
);
4977 /* Check that the parms are used in the appropriate qualifying scopes
4978 in the declarator. */
4979 if (!comp_template_args
4981 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4984 template arguments to %qD do not match original template %qD",
4985 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4986 if (!uses_template_parms (TI_ARGS (tinfo
)))
4987 inform (input_location
, "use template<> for an explicit specialization");
4988 /* Avoid crash in import_export_decl. */
4989 DECL_INTERFACE_KNOWN (decl
) = 1;
4990 return error_mark_node
;
4994 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4995 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4997 /* Push template declarations for global functions and types. Note
4998 that we do not try to push a global template friend declared in a
4999 template class; such a thing may well depend on the template
5000 parameters of the class. */
5001 if (new_template_p
&& !ctx
5002 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5004 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5005 if (tmpl
== error_mark_node
)
5006 return error_mark_node
;
5008 /* Hide template friend classes that haven't been declared yet. */
5009 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5011 DECL_ANTICIPATED (tmpl
) = 1;
5012 DECL_FRIEND_P (tmpl
) = 1;
5018 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5021 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5022 if (DECL_CONV_FN_P (tmpl
))
5024 int depth
= TMPL_PARMS_DEPTH (parms
);
5026 /* It is a conversion operator. See if the type converted to
5027 depends on innermost template operands. */
5029 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5031 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5034 /* Give template template parms a DECL_CONTEXT of the template
5035 for which they are a parameter. */
5036 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5037 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5039 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5040 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5041 DECL_CONTEXT (parm
) = tmpl
;
5045 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5046 back to its most general template. If TMPL is a specialization,
5047 ARGS may only have the innermost set of arguments. Add the missing
5048 argument levels if necessary. */
5049 if (DECL_TEMPLATE_INFO (tmpl
))
5050 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5052 info
= build_template_info (tmpl
, args
);
5054 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5055 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5058 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5059 retrofit_lang_decl (decl
);
5060 if (DECL_LANG_SPECIFIC (decl
))
5061 DECL_TEMPLATE_INFO (decl
) = info
;
5064 if (flag_implicit_templates
5066 && VAR_OR_FUNCTION_DECL_P (decl
))
5067 /* Set DECL_COMDAT on template instantiations; if we force
5068 them to be emitted by explicit instantiation or -frepo,
5069 mark_needed will tell cgraph to do the right thing. */
5070 DECL_COMDAT (decl
) = true;
5072 return DECL_TEMPLATE_RESULT (tmpl
);
5076 push_template_decl (tree decl
)
5078 return push_template_decl_real (decl
, false);
5081 /* FN is an inheriting constructor that inherits from the constructor
5082 template INHERITED; turn FN into a constructor template with a matching
5086 add_inherited_template_parms (tree fn
, tree inherited
)
5089 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5090 inner_parms
= copy_node (inner_parms
);
5092 = tree_cons (size_int (processing_template_decl
+ 1),
5093 inner_parms
, current_template_parms
);
5094 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5095 tree args
= template_parms_to_args (parms
);
5096 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5097 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5098 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5099 DECL_ARTIFICIAL (tmpl
) = true;
5100 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5104 /* Called when a class template TYPE is redeclared with the indicated
5105 template PARMS, e.g.:
5107 template <class T> struct S;
5108 template <class T> struct S {}; */
5111 redeclare_class_template (tree type
, tree parms
)
5117 if (!TYPE_TEMPLATE_INFO (type
))
5119 error ("%qT is not a template type", type
);
5123 tmpl
= TYPE_TI_TEMPLATE (type
);
5124 if (!PRIMARY_TEMPLATE_P (tmpl
))
5125 /* The type is nested in some template class. Nothing to worry
5126 about here; there are no new template parameters for the nested
5132 error ("template specifiers not specified in declaration of %qD",
5137 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5138 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5140 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5142 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5143 "redeclared with %d template parameter",
5144 "redeclared with %d template parameters",
5145 TREE_VEC_LENGTH (parms
));
5146 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5147 "previous declaration %q+D used %d template parameter",
5148 "previous declaration %q+D used %d template parameters",
5149 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5153 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5160 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5161 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5164 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5165 if (error_operand_p (tmpl_parm
))
5168 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5169 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5170 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5172 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5174 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5175 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5176 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5177 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5178 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5179 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5180 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5181 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5182 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5184 error ("template parameter %q+#D", tmpl_parm
);
5185 error ("redeclared here as %q#D", parm
);
5189 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5191 /* We have in [temp.param]:
5193 A template-parameter may not be given default arguments
5194 by two different declarations in the same scope. */
5195 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5196 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5197 "original definition appeared here");
5201 if (parm_default
!= NULL_TREE
)
5202 /* Update the previous template parameters (which are the ones
5203 that will really count) with the new default value. */
5204 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5205 else if (tmpl_default
!= NULL_TREE
)
5206 /* Update the new parameters, too; they'll be used as the
5207 parameters for any members. */
5208 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5214 /* Simplify EXPR if it is a non-dependent expression. Returns the
5215 (possibly simplified) expression. */
5218 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5220 if (expr
== NULL_TREE
)
5223 /* If we're in a template, but EXPR isn't value dependent, simplify
5224 it. We're supposed to treat:
5226 template <typename T> void f(T[1 + 1]);
5227 template <typename T> void f(T[2]);
5229 as two declarations of the same function, for example. */
5230 if (processing_template_decl
5231 && !instantiation_dependent_expression_p (expr
)
5232 && potential_constant_expression (expr
))
5234 HOST_WIDE_INT saved_processing_template_decl
;
5236 saved_processing_template_decl
= processing_template_decl
;
5237 processing_template_decl
= 0;
5238 expr
= tsubst_copy_and_build (expr
,
5241 /*in_decl=*/NULL_TREE
,
5242 /*function_p=*/false,
5243 /*integral_constant_expression_p=*/true);
5244 processing_template_decl
= saved_processing_template_decl
;
5250 fold_non_dependent_expr (tree expr
)
5252 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5255 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5256 template declaration, or a TYPE_DECL for an alias declaration. */
5259 alias_type_or_template_p (tree t
)
5263 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5266 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5267 || DECL_ALIAS_TEMPLATE_P (t
));
5270 /* Return TRUE iff is a specialization of an alias template. */
5273 alias_template_specialization_p (const_tree t
)
5279 && TYPE_TEMPLATE_INFO (t
)
5280 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5281 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5284 /* Return the number of innermost template parameters in TMPL. */
5287 num_innermost_template_parms (tree tmpl
)
5289 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5290 return TREE_VEC_LENGTH (parms
);
5293 /* Return either TMPL or another template that it is equivalent to under DR
5294 1286: An alias that just changes the name of a template is equivalent to
5295 the other template. */
5298 get_underlying_template (tree tmpl
)
5300 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5301 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5303 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5304 if (TYPE_TEMPLATE_INFO (result
))
5306 tree sub
= TYPE_TI_TEMPLATE (result
);
5307 if (PRIMARY_TEMPLATE_P (sub
)
5308 && (num_innermost_template_parms (tmpl
)
5309 == num_innermost_template_parms (sub
)))
5311 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5312 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5313 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5315 /* The alias type is equivalent to the pattern of the
5316 underlying template, so strip the alias. */
5326 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5327 must be a function or a pointer-to-function type, as specified
5328 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5329 and check that the resulting function has external linkage. */
5332 convert_nontype_argument_function (tree type
, tree expr
,
5333 tsubst_flags_t complain
)
5337 linkage_kind linkage
;
5339 fn
= instantiate_type (type
, fns
, tf_none
);
5340 if (fn
== error_mark_node
)
5341 return error_mark_node
;
5344 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5345 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5346 if (BASELINK_P (fn_no_ptr
))
5347 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5349 /* [temp.arg.nontype]/1
5351 A template-argument for a non-type, non-template template-parameter
5354 -- the address of an object or function with external [C++11: or
5355 internal] linkage. */
5357 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5359 if (complain
& tf_error
)
5361 error ("%qE is not a valid template argument for type %qT",
5363 if (TYPE_PTR_P (type
))
5364 error ("it must be the address of a function with "
5365 "external linkage");
5367 error ("it must be the name of a function with "
5368 "external linkage");
5373 linkage
= decl_linkage (fn_no_ptr
);
5374 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5376 if (complain
& tf_error
)
5378 if (cxx_dialect
>= cxx11
)
5379 error ("%qE is not a valid template argument for type %qT "
5380 "because %qD has no linkage",
5381 expr
, type
, fn_no_ptr
);
5383 error ("%qE is not a valid template argument for type %qT "
5384 "because %qD does not have external linkage",
5385 expr
, type
, fn_no_ptr
);
5393 /* Subroutine of convert_nontype_argument.
5394 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5395 Emit an error otherwise. */
5398 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5399 tsubst_flags_t complain
)
5402 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5404 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5406 if (processing_template_decl
5407 && TREE_CODE (expr
) == ADDR_EXPR
5408 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5410 if (complain
& tf_error
)
5412 error ("%qE is not a valid template argument for type %qT",
5414 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5419 /* Returns TRUE iff the address of OP is value-dependent.
5421 14.6.2.4 [temp.dep.temp]:
5422 A non-integral non-type template-argument is dependent if its type is
5423 dependent or it has either of the following forms
5426 and contains a nested-name-specifier which specifies a class-name that
5427 names a dependent type.
5429 We generalize this to just say that the address of a member of a
5430 dependent class is value-dependent; the above doesn't cover the
5431 address of a static data member named with an unqualified-id. */
5434 has_value_dependent_address (tree op
)
5436 /* We could use get_inner_reference here, but there's no need;
5437 this is only relevant for template non-type arguments, which
5438 can only be expressed as &id-expression. */
5441 tree ctx
= CP_DECL_CONTEXT (op
);
5442 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5449 /* The next set of functions are used for providing helpful explanatory
5450 diagnostics for failed overload resolution. Their messages should be
5451 indented by two spaces for consistency with the messages in
5455 unify_success (bool /*explain_p*/)
5461 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5464 inform (input_location
,
5465 " couldn't deduce template parameter %qD", parm
);
5470 unify_invalid (bool /*explain_p*/)
5476 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5479 inform (input_location
,
5480 " types %qT and %qT have incompatible cv-qualifiers",
5486 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5489 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5494 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5497 inform (input_location
,
5498 " template parameter %qD is not a parameter pack, but "
5505 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5508 inform (input_location
,
5509 " template argument %qE does not match "
5510 "pointer-to-member constant %qE",
5516 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5519 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5524 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5527 inform (input_location
,
5528 " inconsistent parameter pack deduction with %qT and %qT",
5534 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5539 inform (input_location
,
5540 " deduced conflicting types for parameter %qT (%qT and %qT)",
5541 parm
, first
, second
);
5543 inform (input_location
,
5544 " deduced conflicting values for non-type parameter "
5545 "%qE (%qE and %qE)", parm
, first
, second
);
5551 unify_vla_arg (bool explain_p
, tree arg
)
5554 inform (input_location
,
5555 " variable-sized array type %qT is not "
5556 "a valid template argument",
5562 unify_method_type_error (bool explain_p
, tree arg
)
5565 inform (input_location
,
5566 " member function type %qT is not a valid template argument",
5572 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
5577 inform_n (input_location
, wanted
,
5578 " candidate expects at least %d argument, %d provided",
5579 " candidate expects at least %d arguments, %d provided",
5582 inform_n (input_location
, wanted
,
5583 " candidate expects %d argument, %d provided",
5584 " candidate expects %d arguments, %d provided",
5591 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5593 return unify_arity (explain_p
, have
, wanted
);
5597 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
5598 bool least_p
= false)
5600 return unify_arity (explain_p
, have
, wanted
, least_p
);
5604 unify_arg_conversion (bool explain_p
, tree to_type
,
5605 tree from_type
, tree arg
)
5608 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5609 " cannot convert %qE (type %qT) to type %qT",
5610 arg
, from_type
, to_type
);
5615 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5616 tree parm
, tree arg
)
5621 case tbr_ambiguous_baseclass
:
5622 inform (input_location
, " %qT is an ambiguous base class of %qT",
5626 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5633 unify_inconsistent_template_template_parameters (bool explain_p
)
5636 inform (input_location
,
5637 " template parameters of a template template argument are "
5638 "inconsistent with other deduced template arguments");
5643 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5646 inform (input_location
,
5647 " can't deduce a template for %qT from non-template type %qT",
5653 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5656 inform (input_location
,
5657 " template argument %qE does not match %qD", arg
, parm
);
5662 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5665 inform (input_location
,
5666 " could not resolve address from overloaded function %qE",
5671 /* Attempt to convert the non-type template parameter EXPR to the
5672 indicated TYPE. If the conversion is successful, return the
5673 converted value. If the conversion is unsuccessful, return
5674 NULL_TREE if we issued an error message, or error_mark_node if we
5675 did not. We issue error messages for out-and-out bad template
5676 parameters, but not simply because the conversion failed, since we
5677 might be just trying to do argument deduction. Both TYPE and EXPR
5678 must be non-dependent.
5680 The conversion follows the special rules described in
5681 [temp.arg.nontype], and it is much more strict than an implicit
5684 This function is called twice for each template argument (see
5685 lookup_template_class for a more accurate description of this
5686 problem). This means that we need to handle expressions which
5687 are not valid in a C++ source, but can be created from the
5688 first call (for instance, casts to perform conversions). These
5689 hacks can go away after we fix the double coercion problem. */
5692 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5696 /* Detect immediately string literals as invalid non-type argument.
5697 This special-case is not needed for correctness (we would easily
5698 catch this later), but only to provide better diagnostic for this
5699 common user mistake. As suggested by DR 100, we do not mention
5700 linkage issues in the diagnostic as this is not the point. */
5701 /* FIXME we're making this OK. */
5702 if (TREE_CODE (expr
) == STRING_CST
)
5704 if (complain
& tf_error
)
5705 error ("%qE is not a valid template argument for type %qT "
5706 "because string literals can never be used in this context",
5711 /* Add the ADDR_EXPR now for the benefit of
5712 value_dependent_expression_p. */
5713 if (TYPE_PTROBV_P (type
)
5714 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5716 expr
= decay_conversion (expr
, complain
);
5717 if (expr
== error_mark_node
)
5718 return error_mark_node
;
5721 /* If we are in a template, EXPR may be non-dependent, but still
5722 have a syntactic, rather than semantic, form. For example, EXPR
5723 might be a SCOPE_REF, rather than the VAR_DECL to which the
5724 SCOPE_REF refers. Preserving the qualifying scope is necessary
5725 so that access checking can be performed when the template is
5726 instantiated -- but here we need the resolved form so that we can
5727 convert the argument. */
5728 if (TYPE_REF_OBJ_P (type
)
5729 && has_value_dependent_address (expr
))
5730 /* If we want the address and it's value-dependent, don't fold. */;
5731 else if (!type_unknown_p (expr
))
5732 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5733 if (error_operand_p (expr
))
5734 return error_mark_node
;
5735 expr_type
= TREE_TYPE (expr
);
5736 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5737 expr
= mark_lvalue_use (expr
);
5739 expr
= mark_rvalue_use (expr
);
5741 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5742 to a non-type argument of "nullptr". */
5743 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5744 expr
= convert (type
, expr
);
5746 /* In C++11, integral or enumeration non-type template arguments can be
5747 arbitrary constant expressions. Pointer and pointer to
5748 member arguments can be general constant expressions that evaluate
5749 to a null value, but otherwise still need to be of a specific form. */
5750 if (cxx_dialect
>= cxx11
)
5752 if (TREE_CODE (expr
) == PTRMEM_CST
)
5753 /* A PTRMEM_CST is already constant, and a valid template
5754 argument for a parameter of pointer to member type, we just want
5755 to leave it in that form rather than lower it to a
5757 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5758 expr
= maybe_constant_value (expr
);
5759 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5761 tree folded
= maybe_constant_value (expr
);
5762 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5763 : null_member_pointer_value_p (folded
))
5768 /* HACK: Due to double coercion, we can get a
5769 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5770 which is the tree that we built on the first call (see
5771 below when coercing to reference to object or to reference to
5772 function). We just strip everything and get to the arg.
5773 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5775 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5777 tree probe_type
, probe
= expr
;
5778 if (REFERENCE_REF_P (probe
))
5779 probe
= TREE_OPERAND (probe
, 0);
5780 probe_type
= TREE_TYPE (probe
);
5781 if (TREE_CODE (probe
) == NOP_EXPR
)
5783 /* ??? Maybe we could use convert_from_reference here, but we
5784 would need to relax its constraints because the NOP_EXPR
5785 could actually change the type to something more cv-qualified,
5786 and this is not folded by convert_from_reference. */
5787 tree addr
= TREE_OPERAND (probe
, 0);
5788 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5789 && TREE_CODE (addr
) == ADDR_EXPR
5790 && TYPE_PTR_P (TREE_TYPE (addr
))
5791 && (same_type_ignoring_top_level_qualifiers_p
5792 (TREE_TYPE (probe_type
),
5793 TREE_TYPE (TREE_TYPE (addr
)))))
5795 expr
= TREE_OPERAND (addr
, 0);
5796 expr_type
= TREE_TYPE (probe_type
);
5801 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5802 parameter is a pointer to object, through decay and
5803 qualification conversion. Let's strip everything. */
5804 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5808 if (TREE_CODE (probe
) == ADDR_EXPR
5809 && TYPE_PTR_P (TREE_TYPE (probe
)))
5811 /* Skip the ADDR_EXPR only if it is part of the decay for
5812 an array. Otherwise, it is part of the original argument
5813 in the source code. */
5814 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5815 probe
= TREE_OPERAND (probe
, 0);
5817 expr_type
= TREE_TYPE (expr
);
5821 /* [temp.arg.nontype]/5, bullet 1
5823 For a non-type template-parameter of integral or enumeration type,
5824 integral promotions (_conv.prom_) and integral conversions
5825 (_conv.integral_) are applied. */
5826 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5828 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5829 t
= maybe_constant_value (t
);
5830 if (t
!= error_mark_node
)
5833 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5834 return error_mark_node
;
5836 /* Notice that there are constant expressions like '4 % 0' which
5837 do not fold into integer constants. */
5838 if (TREE_CODE (expr
) != INTEGER_CST
)
5840 if (complain
& tf_error
)
5842 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5843 if (processing_template_decl
5844 && !require_potential_constant_expression (expr
))
5846 expr
= cxx_constant_value (expr
);
5847 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5848 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
5849 "in template argument for type %qT ", type
);
5850 if (expr
== error_mark_node
)
5852 /* else cxx_constant_value complained but gave us
5853 a real constant, so go ahead. */
5854 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5860 /* Avoid typedef problems. */
5861 if (TREE_TYPE (expr
) != type
)
5862 expr
= fold_convert (type
, expr
);
5864 /* [temp.arg.nontype]/5, bullet 2
5866 For a non-type template-parameter of type pointer to object,
5867 qualification conversions (_conv.qual_) and the array-to-pointer
5868 conversion (_conv.array_) are applied. */
5869 else if (TYPE_PTROBV_P (type
))
5871 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5873 A template-argument for a non-type, non-template template-parameter
5874 shall be one of: [...]
5876 -- the name of a non-type template-parameter;
5877 -- the address of an object or function with external linkage, [...]
5878 expressed as "& id-expression" where the & is optional if the name
5879 refers to a function or array, or if the corresponding
5880 template-parameter is a reference.
5882 Here, we do not care about functions, as they are invalid anyway
5883 for a parameter of type pointer-to-object. */
5885 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5886 /* Non-type template parameters are OK. */
5888 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5889 /* Null pointer values are OK in C++11. */;
5890 else if (TREE_CODE (expr
) != ADDR_EXPR
5891 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5895 if (complain
& tf_error
)
5896 error ("%qD is not a valid template argument "
5897 "because %qD is a variable, not the address of "
5898 "a variable", expr
, expr
);
5901 if (POINTER_TYPE_P (expr_type
))
5903 if (complain
& tf_error
)
5904 error ("%qE is not a valid template argument for %qT "
5905 "because it is not the address of a variable",
5909 /* Other values, like integer constants, might be valid
5910 non-type arguments of some other type. */
5911 return error_mark_node
;
5917 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5918 ? TREE_OPERAND (expr
, 0) : expr
);
5921 if (complain
& tf_error
)
5922 error ("%qE is not a valid template argument of type %qT "
5923 "because %qE is not a variable", expr
, type
, decl
);
5926 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5928 if (complain
& tf_error
)
5929 error ("%qE is not a valid template argument of type %qT "
5930 "because %qD does not have external linkage",
5934 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
5936 if (complain
& tf_error
)
5937 error ("%qE is not a valid template argument of type %qT "
5938 "because %qD has no linkage", expr
, type
, decl
);
5943 expr
= decay_conversion (expr
, complain
);
5944 if (expr
== error_mark_node
)
5945 return error_mark_node
;
5947 expr
= perform_qualification_conversions (type
, expr
);
5948 if (expr
== error_mark_node
)
5949 return error_mark_node
;
5951 /* [temp.arg.nontype]/5, bullet 3
5953 For a non-type template-parameter of type reference to object, no
5954 conversions apply. The type referred to by the reference may be more
5955 cv-qualified than the (otherwise identical) type of the
5956 template-argument. The template-parameter is bound directly to the
5957 template-argument, which must be an lvalue. */
5958 else if (TYPE_REF_OBJ_P (type
))
5960 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5962 return error_mark_node
;
5964 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5966 if (complain
& tf_error
)
5967 error ("%qE is not a valid template argument for type %qT "
5968 "because of conflicts in cv-qualification", expr
, type
);
5972 if (!real_lvalue_p (expr
))
5974 if (complain
& tf_error
)
5975 error ("%qE is not a valid template argument for type %qT "
5976 "because it is not an lvalue", expr
, type
);
5980 /* [temp.arg.nontype]/1
5982 A template-argument for a non-type, non-template template-parameter
5983 shall be one of: [...]
5985 -- the address of an object or function with external linkage. */
5986 if (INDIRECT_REF_P (expr
)
5987 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5989 expr
= TREE_OPERAND (expr
, 0);
5992 if (complain
& tf_error
)
5993 error ("%q#D is not a valid template argument for type %qT "
5994 "because a reference variable does not have a constant "
5995 "address", expr
, type
);
6002 if (complain
& tf_error
)
6003 error ("%qE is not a valid template argument for type %qT "
6004 "because it is not an object with external linkage",
6009 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
6011 if (complain
& tf_error
)
6012 error ("%qE is not a valid template argument for type %qT "
6013 "because object %qD has not external linkage",
6018 expr
= build_nop (type
, build_address (expr
));
6020 /* [temp.arg.nontype]/5, bullet 4
6022 For a non-type template-parameter of type pointer to function, only
6023 the function-to-pointer conversion (_conv.func_) is applied. If the
6024 template-argument represents a set of overloaded functions (or a
6025 pointer to such), the matching function is selected from the set
6027 else if (TYPE_PTRFN_P (type
))
6029 /* If the argument is a template-id, we might not have enough
6030 context information to decay the pointer. */
6031 if (!type_unknown_p (expr_type
))
6033 expr
= decay_conversion (expr
, complain
);
6034 if (expr
== error_mark_node
)
6035 return error_mark_node
;
6038 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6039 /* Null pointer values are OK in C++11. */
6040 return perform_qualification_conversions (type
, expr
);
6042 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6043 if (!expr
|| expr
== error_mark_node
)
6046 /* [temp.arg.nontype]/5, bullet 5
6048 For a non-type template-parameter of type reference to function, no
6049 conversions apply. If the template-argument represents a set of
6050 overloaded functions, the matching function is selected from the set
6052 else if (TYPE_REFFN_P (type
))
6054 if (TREE_CODE (expr
) == ADDR_EXPR
)
6056 if (complain
& tf_error
)
6058 error ("%qE is not a valid template argument for type %qT "
6059 "because it is a pointer", expr
, type
);
6060 inform (input_location
, "try using %qE instead",
6061 TREE_OPERAND (expr
, 0));
6066 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6067 if (!expr
|| expr
== error_mark_node
)
6070 expr
= build_nop (type
, build_address (expr
));
6072 /* [temp.arg.nontype]/5, bullet 6
6074 For a non-type template-parameter of type pointer to member function,
6075 no conversions apply. If the template-argument represents a set of
6076 overloaded member functions, the matching member function is selected
6077 from the set (_over.over_). */
6078 else if (TYPE_PTRMEMFUNC_P (type
))
6080 expr
= instantiate_type (type
, expr
, tf_none
);
6081 if (expr
== error_mark_node
)
6082 return error_mark_node
;
6084 /* [temp.arg.nontype] bullet 1 says the pointer to member
6085 expression must be a pointer-to-member constant. */
6086 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6087 return error_mark_node
;
6089 /* There is no way to disable standard conversions in
6090 resolve_address_of_overloaded_function (called by
6091 instantiate_type). It is possible that the call succeeded by
6092 converting &B::I to &D::I (where B is a base of D), so we need
6093 to reject this conversion here.
6095 Actually, even if there was a way to disable standard conversions,
6096 it would still be better to reject them here so that we can
6097 provide a superior diagnostic. */
6098 if (!same_type_p (TREE_TYPE (expr
), type
))
6100 if (complain
& tf_error
)
6102 error ("%qE is not a valid template argument for type %qT "
6103 "because it is of type %qT", expr
, type
,
6105 /* If we are just one standard conversion off, explain. */
6106 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6107 inform (input_location
,
6108 "standard conversions are not allowed in this context");
6113 /* [temp.arg.nontype]/5, bullet 7
6115 For a non-type template-parameter of type pointer to data member,
6116 qualification conversions (_conv.qual_) are applied. */
6117 else if (TYPE_PTRDATAMEM_P (type
))
6119 /* [temp.arg.nontype] bullet 1 says the pointer to member
6120 expression must be a pointer-to-member constant. */
6121 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6122 return error_mark_node
;
6124 expr
= perform_qualification_conversions (type
, expr
);
6125 if (expr
== error_mark_node
)
6128 else if (NULLPTR_TYPE_P (type
))
6130 if (expr
!= nullptr_node
)
6132 if (complain
& tf_error
)
6133 error ("%qE is not a valid template argument for type %qT "
6134 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6139 /* A template non-type parameter must be one of the above. */
6143 /* Sanity check: did we actually convert the argument to the
6145 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6146 (type
, TREE_TYPE (expr
)));
6150 /* Subroutine of coerce_template_template_parms, which returns 1 if
6151 PARM_PARM and ARG_PARM match using the rule for the template
6152 parameters of template template parameters. Both PARM and ARG are
6153 template parameters; the rest of the arguments are the same as for
6154 coerce_template_template_parms.
6157 coerce_template_template_parm (tree parm
,
6159 tsubst_flags_t complain
,
6163 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6164 || parm
== NULL_TREE
|| error_operand_p (parm
))
6167 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6170 switch (TREE_CODE (parm
))
6173 /* We encounter instantiations of templates like
6174 template <template <template <class> class> class TT>
6177 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6178 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6180 if (!coerce_template_template_parms
6181 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6187 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6188 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6189 /* Argument is a parameter pack but parameter is not. */
6194 /* The tsubst call is used to handle cases such as
6196 template <int> class C {};
6197 template <class T, template <T> class TT> class D {};
6200 i.e. the parameter list of TT depends on earlier parameters. */
6201 if (!uses_template_parms (TREE_TYPE (arg
))
6203 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6207 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6208 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6209 /* Argument is a parameter pack but parameter is not. */
6222 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6223 template template parameters. Both PARM_PARMS and ARG_PARMS are
6224 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6227 Consider the example:
6228 template <class T> class A;
6229 template<template <class U> class TT> class B;
6231 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6232 the parameters to A, and OUTER_ARGS contains A. */
6235 coerce_template_template_parms (tree parm_parms
,
6237 tsubst_flags_t complain
,
6241 int nparms
, nargs
, i
;
6245 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6246 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6248 nparms
= TREE_VEC_LENGTH (parm_parms
);
6249 nargs
= TREE_VEC_LENGTH (arg_parms
);
6251 /* Determine whether we have a parameter pack at the end of the
6252 template template parameter's template parameter list. */
6253 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6255 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6257 if (error_operand_p (parm
))
6260 switch (TREE_CODE (parm
))
6264 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6269 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6279 && !(variadic_p
&& nargs
>= nparms
- 1))
6282 /* Check all of the template parameters except the parameter pack at
6283 the end (if any). */
6284 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6286 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6287 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6290 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6291 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6293 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6301 /* Check each of the template parameters in the template
6302 argument against the template parameter pack at the end of
6303 the template template parameter. */
6304 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6307 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6309 for (; i
< nargs
; ++i
)
6311 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6314 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6316 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6325 /* Verifies that the deduced template arguments (in TARGS) for the
6326 template template parameters (in TPARMS) represent valid bindings,
6327 by comparing the template parameter list of each template argument
6328 to the template parameter list of its corresponding template
6329 template parameter, in accordance with DR150. This
6330 routine can only be called after all template arguments have been
6331 deduced. It will return TRUE if all of the template template
6332 parameter bindings are okay, FALSE otherwise. */
6334 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6336 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6339 /* We're dealing with template parms in this process. */
6340 ++processing_template_decl
;
6342 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6344 for (i
= 0; i
< ntparms
; ++i
)
6346 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6347 tree targ
= TREE_VEC_ELT (targs
, i
);
6349 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6351 tree packed_args
= NULL_TREE
;
6354 if (ARGUMENT_PACK_P (targ
))
6356 /* Look inside the argument pack. */
6357 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6358 len
= TREE_VEC_LENGTH (packed_args
);
6361 for (idx
= 0; idx
< len
; ++idx
)
6363 tree targ_parms
= NULL_TREE
;
6366 /* Extract the next argument from the argument
6368 targ
= TREE_VEC_ELT (packed_args
, idx
);
6370 if (PACK_EXPANSION_P (targ
))
6371 /* Look at the pattern of the pack expansion. */
6372 targ
= PACK_EXPANSION_PATTERN (targ
);
6374 /* Extract the template parameters from the template
6376 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6377 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6378 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6379 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6381 /* Verify that we can coerce the template template
6382 parameters from the template argument to the template
6383 parameter. This requires an exact match. */
6385 && !coerce_template_template_parms
6386 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6401 --processing_template_decl
;
6405 /* Since type attributes aren't mangled, we need to strip them from
6406 template type arguments. */
6409 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6412 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6414 mv
= TYPE_MAIN_VARIANT (arg
);
6415 arg
= strip_typedefs (arg
);
6416 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6417 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6419 if (complain
& tf_warning
)
6420 warning (0, "ignoring attributes on template argument %qT", arg
);
6421 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6422 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6427 /* Convert the indicated template ARG as necessary to match the
6428 indicated template PARM. Returns the converted ARG, or
6429 error_mark_node if the conversion was unsuccessful. Error and
6430 warning messages are issued under control of COMPLAIN. This
6431 conversion is for the Ith parameter in the parameter list. ARGS is
6432 the full set of template arguments deduced so far. */
6435 convert_template_argument (tree parm
,
6438 tsubst_flags_t complain
,
6444 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6446 if (TREE_CODE (arg
) == TREE_LIST
6447 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6449 /* The template argument was the name of some
6450 member function. That's usually
6451 invalid, but static members are OK. In any
6452 case, grab the underlying fields/functions
6453 and issue an error later if required. */
6454 orig_arg
= TREE_VALUE (arg
);
6455 TREE_TYPE (arg
) = unknown_type_node
;
6460 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6461 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6462 || requires_tmpl_type
);
6464 /* When determining whether an argument pack expansion is a template,
6465 look at the pattern. */
6466 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6467 arg
= PACK_EXPANSION_PATTERN (arg
);
6469 /* Deal with an injected-class-name used as a template template arg. */
6470 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6472 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6473 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6475 if (cxx_dialect
>= cxx11
)
6476 /* OK under DR 1004. */;
6477 else if (complain
& tf_warning_or_error
)
6478 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6479 " used as template template argument", TYPE_NAME (arg
));
6480 else if (flag_pedantic_errors
)
6488 ((TREE_CODE (arg
) == TEMPLATE_DECL
6489 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6490 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6491 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6492 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6495 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6496 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6497 arg
= TYPE_STUB_DECL (arg
);
6499 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6501 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6502 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6504 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6506 if (complain
& tf_error
)
6507 error ("invalid use of destructor %qE as a type", orig_arg
);
6508 return error_mark_node
;
6511 permerror (input_location
,
6512 "to refer to a type member of a template parameter, "
6513 "use %<typename %E%>", orig_arg
);
6515 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6516 TREE_OPERAND (arg
, 1),
6522 if (is_type
!= requires_type
)
6526 if (complain
& tf_error
)
6528 error ("type/value mismatch at argument %d in template "
6529 "parameter list for %qD",
6532 inform (input_location
,
6533 " expected a constant of type %qT, got %qT",
6535 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6536 else if (requires_tmpl_type
)
6537 inform (input_location
,
6538 " expected a class template, got %qE", orig_arg
);
6540 inform (input_location
,
6541 " expected a type, got %qE", orig_arg
);
6544 return error_mark_node
;
6546 if (is_tmpl_type
^ requires_tmpl_type
)
6548 if (in_decl
&& (complain
& tf_error
))
6550 error ("type/value mismatch at argument %d in template "
6551 "parameter list for %qD",
6554 inform (input_location
,
6555 " expected a type, got %qT", DECL_NAME (arg
));
6557 inform (input_location
,
6558 " expected a class template, got %qT", orig_arg
);
6560 return error_mark_node
;
6565 if (requires_tmpl_type
)
6567 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6569 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6570 /* The number of argument required is not known yet.
6571 Just accept it for now. */
6572 val
= TREE_TYPE (arg
);
6575 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6578 /* Strip alias templates that are equivalent to another
6580 arg
= get_underlying_template (arg
);
6581 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6583 if (coerce_template_template_parms (parmparm
, argparm
,
6589 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6591 if (val
!= error_mark_node
)
6593 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6594 val
= TREE_TYPE (val
);
6595 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6596 val
= make_pack_expansion (val
);
6601 if (in_decl
&& (complain
& tf_error
))
6603 error ("type/value mismatch at argument %d in "
6604 "template parameter list for %qD",
6606 inform (input_location
,
6607 " expected a template of type %qD, got %qT",
6611 val
= error_mark_node
;
6617 /* We only form one instance of each template specialization.
6618 Therefore, if we use a non-canonical variant (i.e., a
6619 typedef), any future messages referring to the type will use
6620 the typedef, which is confusing if those future uses do not
6621 themselves also use the typedef. */
6623 val
= canonicalize_type_argument (val
, complain
);
6627 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6629 if (invalid_nontype_parm_type_p (t
, complain
))
6630 return error_mark_node
;
6632 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6634 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6638 /* Not sure if this is reachable, but it doesn't hurt
6640 error ("type mismatch in nontype parameter pack");
6641 val
= error_mark_node
;
6644 else if (!dependent_template_arg_p (orig_arg
)
6645 && !uses_template_parms (t
))
6646 /* We used to call digest_init here. However, digest_init
6647 will report errors, which we don't want when complain
6648 is zero. More importantly, digest_init will try too
6649 hard to convert things: for example, `0' should not be
6650 converted to pointer type at this point according to
6651 the standard. Accepting this is not merely an
6652 extension, since deciding whether or not these
6653 conversions can occur is part of determining which
6654 function template to call, or whether a given explicit
6655 argument specification is valid. */
6656 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6658 val
= strip_typedefs_expr (orig_arg
);
6660 if (val
== NULL_TREE
)
6661 val
= error_mark_node
;
6662 else if (val
== error_mark_node
&& (complain
& tf_error
))
6663 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6665 if (TREE_CODE (val
) == SCOPE_REF
)
6667 /* Strip typedefs from the SCOPE_REF. */
6668 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6669 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6671 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6672 QUALIFIED_NAME_IS_TEMPLATE (val
));
6679 /* Coerces the remaining template arguments in INNER_ARGS (from
6680 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6681 Returns the coerced argument pack. PARM_IDX is the position of this
6682 parameter in the template parameter list. ARGS is the original
6683 template argument list. */
6685 coerce_template_parameter_pack (tree parms
,
6693 tsubst_flags_t complain
)
6695 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6696 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6699 tree packed_parms
= NULL_TREE
;
6701 if (arg_idx
> nargs
)
6704 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6706 /* When the template parameter is a non-type template parameter pack
6707 or template template parameter pack whose type or template
6708 parameters use parameter packs, we know exactly how many arguments
6709 we are looking for. Build a vector of the instantiated decls for
6710 these template parameters in PACKED_PARMS. */
6711 /* We can't use make_pack_expansion here because it would interpret a
6712 _DECL as a use rather than a declaration. */
6713 tree decl
= TREE_VALUE (parm
);
6714 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6715 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6716 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6717 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6719 TREE_VEC_LENGTH (args
)--;
6720 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6721 TREE_VEC_LENGTH (args
)++;
6723 if (packed_parms
== error_mark_node
)
6724 return error_mark_node
;
6726 /* If we're doing a partial instantiation of a member template,
6727 verify that all of the types used for the non-type
6728 template parameter pack are, in fact, valid for non-type
6729 template parameters. */
6731 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6733 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6734 for (j
= 0; j
< len
; ++j
)
6736 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6737 if (invalid_nontype_parm_type_p (t
, complain
))
6738 return error_mark_node
;
6742 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6745 packed_args
= make_tree_vec (nargs
- arg_idx
);
6747 /* Convert the remaining arguments, which will be a part of the
6748 parameter pack "parm". */
6749 for (; arg_idx
< nargs
; ++arg_idx
)
6751 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6752 tree actual_parm
= TREE_VALUE (parm
);
6753 int pack_idx
= arg_idx
- parm_idx
;
6757 /* Once we've packed as many args as we have types, stop. */
6758 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6760 else if (PACK_EXPANSION_P (arg
))
6761 /* We don't know how many args we have yet, just
6762 use the unconverted ones for now. */
6765 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6768 if (arg
== error_mark_node
)
6770 if (complain
& tf_error
)
6771 error ("template argument %d is invalid", arg_idx
+ 1);
6774 arg
= convert_template_argument (actual_parm
,
6775 arg
, new_args
, complain
, parm_idx
,
6777 if (arg
== error_mark_node
)
6779 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6782 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6783 && TREE_VEC_LENGTH (packed_args
) > 0)
6785 if (complain
& tf_error
)
6786 error ("wrong number of template arguments (%d, should be %d)",
6787 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6788 return error_mark_node
;
6791 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6792 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6793 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6796 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6797 TREE_TYPE (argument_pack
)
6798 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6799 TREE_CONSTANT (argument_pack
) = 1;
6802 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6803 #ifdef ENABLE_CHECKING
6804 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6805 TREE_VEC_LENGTH (packed_args
));
6807 return argument_pack
;
6810 /* Returns the number of pack expansions in the template argument vector
6814 pack_expansion_args_count (tree args
)
6819 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6821 tree elt
= TREE_VEC_ELT (args
, i
);
6822 if (elt
&& PACK_EXPANSION_P (elt
))
6828 /* Convert all template arguments to their appropriate types, and
6829 return a vector containing the innermost resulting template
6830 arguments. If any error occurs, return error_mark_node. Error and
6831 warning messages are issued under control of COMPLAIN.
6833 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6834 for arguments not specified in ARGS. Otherwise, if
6835 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6836 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6837 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6841 coerce_template_parms (tree parms
,
6844 tsubst_flags_t complain
,
6845 bool require_all_args
,
6846 bool use_default_args
)
6848 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6849 tree orig_inner_args
;
6852 tree new_inner_args
;
6853 int saved_unevaluated_operand
;
6854 int saved_inhibit_evaluation_warnings
;
6856 /* When used as a boolean value, indicates whether this is a
6857 variadic template parameter list. Since it's an int, we can also
6858 subtract it from nparms to get the number of non-variadic
6861 int variadic_args_p
= 0;
6862 int post_variadic_parms
= 0;
6864 /* Likewise for parameters with default arguments. */
6867 if (args
== error_mark_node
)
6868 return error_mark_node
;
6870 nparms
= TREE_VEC_LENGTH (parms
);
6872 /* Determine if there are any parameter packs or default arguments. */
6873 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6875 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6877 ++post_variadic_parms
;
6878 if (template_parameter_pack_p (TREE_VALUE (parm
)))
6880 if (TREE_PURPOSE (parm
))
6884 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6885 /* If there are no parameters that follow a parameter pack, we need to
6886 expand any argument packs so that we can deduce a parameter pack from
6887 some non-packed args followed by an argument pack, as in variadic85.C.
6888 If there are such parameters, we need to leave argument packs intact
6889 so the arguments are assigned properly. This can happen when dealing
6890 with a nested class inside a partial specialization of a class
6891 template, as in variadic92.C, or when deducing a template parameter pack
6892 from a sub-declarator, as in variadic114.C. */
6893 if (!post_variadic_parms
)
6894 inner_args
= expand_template_argument_pack (inner_args
);
6896 /* Count any pack expansion args. */
6897 variadic_args_p
= pack_expansion_args_count (inner_args
);
6899 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6900 if ((nargs
> nparms
&& !variadic_p
)
6901 || (nargs
< nparms
- variadic_p
6904 && (!use_default_args
6905 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6906 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6908 if (complain
& tf_error
)
6910 if (variadic_p
|| default_p
)
6912 nparms
-= variadic_p
+ default_p
;
6913 error ("wrong number of template arguments "
6914 "(%d, should be at least %d)", nargs
, nparms
);
6917 error ("wrong number of template arguments "
6918 "(%d, should be %d)", nargs
, nparms
);
6921 inform (input_location
, "provided for %q+D", in_decl
);
6924 return error_mark_node
;
6926 /* We can't pass a pack expansion to a non-pack parameter of an alias
6927 template (DR 1430). */
6928 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
6930 && nargs
- variadic_args_p
< nparms
- variadic_p
)
6932 if (complain
& tf_error
)
6934 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
6936 tree arg
= TREE_VEC_ELT (inner_args
, i
);
6937 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6939 if (PACK_EXPANSION_P (arg
)
6940 && !template_parameter_pack_p (parm
))
6942 error ("pack expansion argument for non-pack parameter "
6943 "%qD of alias template %qD", parm
, in_decl
);
6944 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
6951 return error_mark_node
;
6954 /* We need to evaluate the template arguments, even though this
6955 template-id may be nested within a "sizeof". */
6956 saved_unevaluated_operand
= cp_unevaluated_operand
;
6957 cp_unevaluated_operand
= 0;
6958 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6959 c_inhibit_evaluation_warnings
= 0;
6960 new_inner_args
= make_tree_vec (nparms
);
6961 new_args
= add_outermost_template_args (args
, new_inner_args
);
6962 int pack_adjust
= 0;
6963 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6968 /* Get the Ith template parameter. */
6969 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6971 if (parm
== error_mark_node
)
6973 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6977 /* Calculate the next argument. */
6978 if (arg_idx
< nargs
)
6979 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6983 if (template_parameter_pack_p (TREE_VALUE (parm
))
6984 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6986 /* Some arguments will be placed in the
6987 template parameter pack PARM. */
6988 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6989 inner_args
, arg_idx
,
6993 if (arg
== NULL_TREE
)
6995 /* We don't know how many args we have yet, just use the
6996 unconverted (and still packed) ones for now. */
6997 new_inner_args
= orig_inner_args
;
7002 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7004 /* Store this argument. */
7005 if (arg
== error_mark_node
)
7008 /* We are done with all of the arguments. */
7013 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7014 arg_idx
+= pack_adjust
;
7021 if (PACK_EXPANSION_P (arg
))
7023 /* "If every valid specialization of a variadic template
7024 requires an empty template parameter pack, the template is
7025 ill-formed, no diagnostic required." So check that the
7026 pattern works with this parameter. */
7027 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7028 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7032 if (conv
== error_mark_node
)
7034 inform (input_location
, "so any instantiation with a "
7035 "non-empty parameter pack would be ill-formed");
7038 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7039 /* Recover from missing typename. */
7040 TREE_VEC_ELT (inner_args
, arg_idx
)
7041 = make_pack_expansion (conv
);
7043 /* We don't know how many args we have yet, just
7044 use the unconverted ones for now. */
7045 new_inner_args
= inner_args
;
7050 else if (require_all_args
)
7052 /* There must be a default arg in this case. */
7053 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7055 /* The position of the first default template argument,
7056 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7058 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7059 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7060 arg_idx
- pack_adjust
);
7065 if (arg
== error_mark_node
)
7067 if (complain
& tf_error
)
7068 error ("template argument %d is invalid", arg_idx
+ 1);
7071 /* This only occurs if there was an error in the template
7072 parameter list itself (which we would already have
7073 reported) that we are trying to recover from, e.g., a class
7074 template with a parameter list such as
7075 template<typename..., typename>. */
7078 arg
= convert_template_argument (TREE_VALUE (parm
),
7079 arg
, new_args
, complain
,
7082 if (arg
== error_mark_node
)
7084 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7086 cp_unevaluated_operand
= saved_unevaluated_operand
;
7087 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7089 if (variadic_p
&& arg_idx
< nargs
)
7091 if (complain
& tf_error
)
7093 error ("wrong number of template arguments "
7094 "(%d, should be %d)", nargs
, arg_idx
);
7096 error ("provided for %q+D", in_decl
);
7098 return error_mark_node
;
7102 return error_mark_node
;
7104 #ifdef ENABLE_CHECKING
7105 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7106 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7107 TREE_VEC_LENGTH (new_inner_args
));
7110 return new_inner_args
;
7113 /* Like coerce_template_parms. If PARMS represents all template
7114 parameters levels, this function returns a vector of vectors
7115 representing all the resulting argument levels. Note that in this
7116 case, only the innermost arguments are coerced because the
7117 outermost ones are supposed to have been coerced already.
7119 Otherwise, if PARMS represents only (the innermost) vector of
7120 parameters, this function returns a vector containing just the
7121 innermost resulting arguments. */
7124 coerce_innermost_template_parms (tree parms
,
7127 tsubst_flags_t complain
,
7128 bool require_all_args
,
7129 bool use_default_args
)
7131 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7132 int args_depth
= TMPL_ARGS_DEPTH (args
);
7135 if (parms_depth
> 1)
7137 coerced_args
= make_tree_vec (parms_depth
);
7141 for (level
= parms
, cur_depth
= parms_depth
;
7142 parms_depth
> 0 && level
!= NULL_TREE
;
7143 level
= TREE_CHAIN (level
), --cur_depth
)
7146 if (cur_depth
== args_depth
)
7147 l
= coerce_template_parms (TREE_VALUE (level
),
7148 args
, in_decl
, complain
,
7152 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7154 if (l
== error_mark_node
)
7155 return error_mark_node
;
7157 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7161 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7162 args
, in_decl
, complain
,
7165 return coerced_args
;
7168 /* Returns 1 if template args OT and NT are equivalent. */
7171 template_args_equal (tree ot
, tree nt
)
7175 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7178 if (TREE_CODE (nt
) == TREE_VEC
)
7179 /* For member templates */
7180 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7181 else if (PACK_EXPANSION_P (ot
))
7182 return (PACK_EXPANSION_P (nt
)
7183 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7184 PACK_EXPANSION_PATTERN (nt
))
7185 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7186 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7187 else if (ARGUMENT_PACK_P (ot
))
7192 if (!ARGUMENT_PACK_P (nt
))
7195 opack
= ARGUMENT_PACK_ARGS (ot
);
7196 npack
= ARGUMENT_PACK_ARGS (nt
);
7197 len
= TREE_VEC_LENGTH (opack
);
7198 if (TREE_VEC_LENGTH (npack
) != len
)
7200 for (i
= 0; i
< len
; ++i
)
7201 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7202 TREE_VEC_ELT (npack
, i
)))
7206 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7208 /* We get here probably because we are in the middle of substituting
7209 into the pattern of a pack expansion. In that case the
7210 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7211 interested in. So we want to use the initial pack argument for
7213 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7214 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7215 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7216 return template_args_equal (ot
, nt
);
7218 else if (TYPE_P (nt
))
7219 return TYPE_P (ot
) && same_type_p (ot
, nt
);
7220 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7223 return cp_tree_equal (ot
, nt
);
7226 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7227 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7228 NEWARG_PTR with the offending arguments if they are non-NULL. */
7231 comp_template_args_with_info (tree oldargs
, tree newargs
,
7232 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7236 if (oldargs
== newargs
)
7239 if (!oldargs
|| !newargs
)
7242 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7245 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7247 tree nt
= TREE_VEC_ELT (newargs
, i
);
7248 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7250 if (! template_args_equal (ot
, nt
))
7252 if (oldarg_ptr
!= NULL
)
7254 if (newarg_ptr
!= NULL
)
7262 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7263 of template arguments. Returns 0 otherwise. */
7266 comp_template_args (tree oldargs
, tree newargs
)
7268 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7272 add_pending_template (tree d
)
7274 tree ti
= (TYPE_P (d
)
7275 ? CLASSTYPE_TEMPLATE_INFO (d
)
7276 : DECL_TEMPLATE_INFO (d
));
7277 struct pending_template
*pt
;
7280 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7283 /* We are called both from instantiate_decl, where we've already had a
7284 tinst_level pushed, and instantiate_template, where we haven't.
7286 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7289 push_tinst_level (d
);
7291 pt
= ggc_alloc
<pending_template
> ();
7293 pt
->tinst
= current_tinst_level
;
7294 if (last_pending_template
)
7295 last_pending_template
->next
= pt
;
7297 pending_templates
= pt
;
7299 last_pending_template
= pt
;
7301 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7308 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7309 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7310 documentation for TEMPLATE_ID_EXPR. */
7313 lookup_template_function (tree fns
, tree arglist
)
7317 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7318 return error_mark_node
;
7320 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7322 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7324 error ("%q#D is not a function template", fns
);
7325 return error_mark_node
;
7328 if (BASELINK_P (fns
))
7330 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7332 BASELINK_FUNCTIONS (fns
),
7337 type
= TREE_TYPE (fns
);
7338 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7339 type
= unknown_type_node
;
7341 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7344 /* Within the scope of a template class S<T>, the name S gets bound
7345 (in build_self_reference) to a TYPE_DECL for the class, not a
7346 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7347 or one of its enclosing classes, and that type is a template,
7348 return the associated TEMPLATE_DECL. Otherwise, the original
7351 Also handle the case when DECL is a TREE_LIST of ambiguous
7352 injected-class-names from different bases. */
7355 maybe_get_template_decl_from_type_decl (tree decl
)
7357 if (decl
== NULL_TREE
)
7360 /* DR 176: A lookup that finds an injected-class-name (10.2
7361 [class.member.lookup]) can result in an ambiguity in certain cases
7362 (for example, if it is found in more than one base class). If all of
7363 the injected-class-names that are found refer to specializations of
7364 the same class template, and if the name is followed by a
7365 template-argument-list, the reference refers to the class template
7366 itself and not a specialization thereof, and is not ambiguous. */
7367 if (TREE_CODE (decl
) == TREE_LIST
)
7369 tree t
, tmpl
= NULL_TREE
;
7370 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7372 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7375 else if (tmpl
!= elt
)
7378 if (tmpl
&& t
== NULL_TREE
)
7384 return (decl
!= NULL_TREE
7385 && DECL_SELF_REFERENCE_P (decl
)
7386 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7387 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7390 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7391 parameters, find the desired type.
7393 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7395 IN_DECL, if non-NULL, is the template declaration we are trying to
7398 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7399 the class we are looking up.
7401 Issue error and warning messages under control of COMPLAIN.
7403 If the template class is really a local class in a template
7404 function, then the FUNCTION_CONTEXT is the function in which it is
7407 ??? Note that this function is currently called *twice* for each
7408 template-id: the first time from the parser, while creating the
7409 incomplete type (finish_template_type), and the second type during the
7410 real instantiation (instantiate_template_class). This is surely something
7411 that we want to avoid. It also causes some problems with argument
7412 coercion (see convert_nontype_argument for more information on this). */
7415 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7416 int entering_scope
, tsubst_flags_t complain
)
7418 tree templ
= NULL_TREE
, parmlist
;
7425 if (identifier_p (d1
))
7427 tree value
= innermost_non_namespace_value (d1
);
7428 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7433 push_decl_namespace (context
);
7434 templ
= lookup_name (d1
);
7435 templ
= maybe_get_template_decl_from_type_decl (templ
);
7437 pop_decl_namespace ();
7440 context
= DECL_CONTEXT (templ
);
7442 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7444 tree type
= TREE_TYPE (d1
);
7446 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7447 an implicit typename for the second A. Deal with it. */
7448 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7449 type
= TREE_TYPE (type
);
7451 if (CLASSTYPE_TEMPLATE_INFO (type
))
7453 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7454 d1
= DECL_NAME (templ
);
7457 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7458 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7460 templ
= TYPE_TI_TEMPLATE (d1
);
7461 d1
= DECL_NAME (templ
);
7463 else if (DECL_TYPE_TEMPLATE_P (d1
))
7466 d1
= DECL_NAME (templ
);
7467 context
= DECL_CONTEXT (templ
);
7469 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7472 d1
= DECL_NAME (templ
);
7475 /* Issue an error message if we didn't find a template. */
7478 if (complain
& tf_error
)
7479 error ("%qT is not a template", d1
);
7480 return error_mark_node
;
7483 if (TREE_CODE (templ
) != TEMPLATE_DECL
7484 /* Make sure it's a user visible template, if it was named by
7486 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7487 && !PRIMARY_TEMPLATE_P (templ
)))
7489 if (complain
& tf_error
)
7491 error ("non-template type %qT used as a template", d1
);
7493 error ("for template declaration %q+D", in_decl
);
7495 return error_mark_node
;
7498 complain
&= ~tf_user
;
7500 /* An alias that just changes the name of a template is equivalent to the
7501 other template, so if any of the arguments are pack expansions, strip
7502 the alias to avoid problems with a pack expansion passed to a non-pack
7503 alias template parameter (DR 1430). */
7504 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7505 templ
= get_underlying_template (templ
);
7507 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7509 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7510 template arguments */
7516 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7518 /* Consider an example where a template template parameter declared as
7520 template <class T, class U = std::allocator<T> > class TT
7522 The template parameter level of T and U are one level larger than
7523 of TT. To proper process the default argument of U, say when an
7524 instantiation `TT<int>' is seen, we need to build the full
7525 arguments containing {int} as the innermost level. Outer levels,
7526 available when not appearing as default template argument, can be
7527 obtained from the arguments of the enclosing template.
7529 Suppose that TT is later substituted with std::vector. The above
7530 instantiation is `TT<int, std::allocator<T> >' with TT at
7531 level 1, and T at level 2, while the template arguments at level 1
7532 becomes {std::vector} and the inner level 2 is {int}. */
7534 outer
= DECL_CONTEXT (templ
);
7536 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7537 else if (current_template_parms
)
7538 /* This is an argument of the current template, so we haven't set
7539 DECL_CONTEXT yet. */
7540 outer
= current_template_args ();
7543 arglist
= add_to_template_args (outer
, arglist
);
7545 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7547 /*require_all_args=*/true,
7548 /*use_default_args=*/true);
7549 if (arglist2
== error_mark_node
7550 || (!uses_template_parms (arglist2
)
7551 && check_instantiated_args (templ
, arglist2
, complain
)))
7552 return error_mark_node
;
7554 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7559 tree template_type
= TREE_TYPE (templ
);
7562 tree found
= NULL_TREE
;
7565 int is_dependent_type
;
7566 int use_partial_inst_tmpl
= false;
7568 if (template_type
== error_mark_node
)
7569 /* An error occurred while building the template TEMPL, and a
7570 diagnostic has most certainly been emitted for that
7571 already. Let's propagate that error. */
7572 return error_mark_node
;
7574 gen_tmpl
= most_general_template (templ
);
7575 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7576 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7577 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7579 if (arg_depth
== 1 && parm_depth
> 1)
7581 /* We've been given an incomplete set of template arguments.
7584 template <class T> struct S1 {
7585 template <class U> struct S2 {};
7586 template <class U> struct S2<U*> {};
7589 we will be called with an ARGLIST of `U*', but the
7590 TEMPLATE will be `template <class T> template
7591 <class U> struct S1<T>::S2'. We must fill in the missing
7594 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7596 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7599 /* Now we should have enough arguments. */
7600 gcc_assert (parm_depth
== arg_depth
);
7602 /* From here on, we're only interested in the most general
7605 /* Calculate the BOUND_ARGS. These will be the args that are
7606 actually tsubst'd into the definition to create the
7610 /* We have multiple levels of arguments to coerce, at once. */
7612 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7614 tree bound_args
= make_tree_vec (parm_depth
);
7616 for (i
= saved_depth
,
7617 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7618 i
> 0 && t
!= NULL_TREE
;
7619 --i
, t
= TREE_CHAIN (t
))
7622 if (i
== saved_depth
)
7623 a
= coerce_template_parms (TREE_VALUE (t
),
7626 /*require_all_args=*/true,
7627 /*use_default_args=*/true);
7629 /* Outer levels should have already been coerced. */
7630 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7632 /* Don't process further if one of the levels fails. */
7633 if (a
== error_mark_node
)
7635 /* Restore the ARGLIST to its full size. */
7636 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7637 return error_mark_node
;
7640 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7642 /* We temporarily reduce the length of the ARGLIST so
7643 that coerce_template_parms will see only the arguments
7644 corresponding to the template parameters it is
7646 TREE_VEC_LENGTH (arglist
)--;
7649 /* Restore the ARGLIST to its full size. */
7650 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7652 arglist
= bound_args
;
7656 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7657 INNERMOST_TEMPLATE_ARGS (arglist
),
7660 /*require_all_args=*/true,
7661 /*use_default_args=*/true);
7663 if (arglist
== error_mark_node
)
7664 /* We were unable to bind the arguments. */
7665 return error_mark_node
;
7667 /* In the scope of a template class, explicit references to the
7668 template class refer to the type of the template, not any
7669 instantiation of it. For example, in:
7671 template <class T> class C { void f(C<T>); }
7673 the `C<T>' is just the same as `C'. Outside of the
7674 class, however, such a reference is an instantiation. */
7676 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7677 || currently_open_class (template_type
))
7678 /* comp_template_args is expensive, check it last. */
7679 && comp_template_args (TYPE_TI_ARGS (template_type
),
7681 return template_type
;
7683 /* If we already have this specialization, return it. */
7684 elt
.tmpl
= gen_tmpl
;
7686 hash
= hash_specialization (&elt
);
7687 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7693 is_dependent_type
= uses_template_parms (arglist
);
7695 /* If the deduced arguments are invalid, then the binding
7697 if (!is_dependent_type
7698 && check_instantiated_args (gen_tmpl
,
7699 INNERMOST_TEMPLATE_ARGS (arglist
),
7701 return error_mark_node
;
7703 if (!is_dependent_type
7704 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7705 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7706 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7708 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7709 DECL_NAME (gen_tmpl
),
7710 /*tag_scope=*/ts_global
);
7714 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7716 if (context
== error_mark_node
)
7717 return error_mark_node
;
7720 context
= global_namespace
;
7722 /* Create the type. */
7723 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7725 /* The user referred to a specialization of an alias
7726 template represented by GEN_TMPL.
7728 [temp.alias]/2 says:
7730 When a template-id refers to the specialization of an
7731 alias template, it is equivalent to the associated
7732 type obtained by substitution of its
7733 template-arguments for the template-parameters in the
7734 type-id of the alias template. */
7736 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7737 /* Note that the call above (by indirectly calling
7738 register_specialization in tsubst_decl) registers the
7739 TYPE_DECL representing the specialization of the alias
7740 template. So next time someone substitutes ARGLIST for
7741 the template parms into the alias template (GEN_TMPL),
7742 she'll get that TYPE_DECL back. */
7744 if (t
== error_mark_node
)
7747 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7749 if (!is_dependent_type
)
7751 set_current_access_from_decl (TYPE_NAME (template_type
));
7752 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7753 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7754 arglist
, complain
, in_decl
),
7755 SCOPED_ENUM_P (template_type
), NULL
);
7757 if (t
== error_mark_node
)
7762 /* We don't want to call start_enum for this type, since
7763 the values for the enumeration constants may involve
7764 template parameters. And, no one should be interested
7765 in the enumeration constants for such a type. */
7766 t
= cxx_make_type (ENUMERAL_TYPE
);
7767 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7769 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7770 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7771 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7773 else if (CLASS_TYPE_P (template_type
))
7775 t
= make_class_type (TREE_CODE (template_type
));
7776 CLASSTYPE_DECLARED_CLASS (t
)
7777 = CLASSTYPE_DECLARED_CLASS (template_type
);
7778 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7779 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7781 /* A local class. Make sure the decl gets registered properly. */
7782 if (context
== current_function_decl
)
7783 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7785 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7786 /* This instantiation is another name for the primary
7787 template type. Set the TYPE_CANONICAL field
7789 TYPE_CANONICAL (t
) = template_type
;
7790 else if (any_template_arguments_need_structural_equality_p (arglist
))
7791 /* Some of the template arguments require structural
7792 equality testing, so this template class requires
7793 structural equality testing. */
7794 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7799 /* If we called start_enum or pushtag above, this information
7800 will already be set up. */
7803 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7805 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7806 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7807 DECL_SOURCE_LOCATION (type_decl
)
7808 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7811 type_decl
= TYPE_NAME (t
);
7813 if (CLASS_TYPE_P (template_type
))
7815 TREE_PRIVATE (type_decl
)
7816 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7817 TREE_PROTECTED (type_decl
)
7818 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7819 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7821 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7822 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7826 if (OVERLOAD_TYPE_P (t
)
7827 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7829 = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (template_type
)))
7830 TYPE_ATTRIBUTES (t
) = attributes
;
7832 /* Let's consider the explicit specialization of a member
7833 of a class template specialization that is implicitly instantiated,
7838 template<class U> struct M {}; //#0
7843 struct S<int>::M<char> //#1
7847 [temp.expl.spec]/4 says this is valid.
7849 In this case, when we write:
7852 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7855 When we encounter #1, we want to store the partial instantiation
7856 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7858 For all cases other than this "explicit specialization of member of a
7859 class template", we just want to store the most general template into
7860 the CLASSTYPE_TI_TEMPLATE of M.
7862 This case of "explicit specialization of member of a class template"
7864 1/ the enclosing class is an instantiation of, and therefore not
7865 the same as, the context of the most general template, and
7866 2/ we aren't looking at the partial instantiation itself, i.e.
7867 the innermost arguments are not the same as the innermost parms of
7868 the most general template.
7870 So it's only when 1/ and 2/ happens that we want to use the partial
7871 instantiation of the member template in lieu of its most general
7874 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7875 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7876 /* the enclosing class must be an instantiation... */
7877 && CLASS_TYPE_P (context
)
7878 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7880 tree partial_inst_args
;
7881 TREE_VEC_LENGTH (arglist
)--;
7882 ++processing_template_decl
;
7884 tsubst (INNERMOST_TEMPLATE_ARGS
7885 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7886 arglist
, complain
, NULL_TREE
);
7887 --processing_template_decl
;
7888 TREE_VEC_LENGTH (arglist
)++;
7889 use_partial_inst_tmpl
=
7890 /*...and we must not be looking at the partial instantiation
7892 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7896 if (!use_partial_inst_tmpl
)
7897 /* This case is easy; there are no member templates involved. */
7901 /* This is a full instantiation of a member template. Find
7902 the partial instantiation of which this is an instance. */
7904 /* Temporarily reduce by one the number of levels in the ARGLIST
7905 so as to avoid comparing the last set of arguments. */
7906 TREE_VEC_LENGTH (arglist
)--;
7907 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7908 TREE_VEC_LENGTH (arglist
)++;
7909 /* FOUND is either a proper class type, or an alias
7910 template specialization. In the later case, it's a
7911 TYPE_DECL, resulting from the substituting of arguments
7912 for parameters in the TYPE_DECL of the alias template
7913 done earlier. So be careful while getting the template
7915 found
= TREE_CODE (found
) == TYPE_DECL
7916 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7917 : CLASSTYPE_TI_TEMPLATE (found
);
7920 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7923 slot
= htab_find_slot_with_hash (type_specializations
,
7924 &elt
, hash
, INSERT
);
7925 entry
= ggc_alloc
<spec_entry
> ();
7929 /* Note this use of the partial instantiation so we can check it
7930 later in maybe_process_partial_specialization. */
7931 DECL_TEMPLATE_INSTANTIATIONS (found
)
7932 = tree_cons (arglist
, t
,
7933 DECL_TEMPLATE_INSTANTIATIONS (found
));
7935 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
7936 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7937 /* Now that the type has been registered on the instantiations
7938 list, we set up the enumerators. Because the enumeration
7939 constants may involve the enumeration type itself, we make
7940 sure to register the type first, and then create the
7941 constants. That way, doing tsubst_expr for the enumeration
7942 constants won't result in recursive calls here; we'll find
7943 the instantiation and exit above. */
7944 tsubst_enum (template_type
, t
, arglist
);
7946 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7947 /* If the type makes use of template parameters, the
7948 code that generates debugging information will crash. */
7949 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
7951 /* Possibly limit visibility based on template args. */
7952 TREE_PUBLIC (type_decl
) = 1;
7953 determine_visibility (type_decl
);
7959 /* Wrapper for lookup_template_class_1. */
7962 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7963 int entering_scope
, tsubst_flags_t complain
)
7966 timevar_push (TV_TEMPLATE_INST
);
7967 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7968 entering_scope
, complain
);
7969 timevar_pop (TV_TEMPLATE_INST
);
7973 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST.
7974 If the ARGLIST refers to any template parameters, the type of the
7975 expression is the unknown_type_node since the template-id could
7976 refer to an explicit or partial specialization. */
7979 lookup_template_variable (tree templ
, tree arglist
)
7982 if (uses_template_parms (arglist
))
7983 type
= unknown_type_node
;
7985 type
= TREE_TYPE (templ
);
7986 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
7994 /* True when we should also visit template parameters that occur in
7995 non-deduced contexts. */
7996 bool include_nondeduced_p
;
7997 hash_set
<tree
> *visited
;
8000 /* Called from for_each_template_parm via walk_tree. */
8003 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8006 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8007 tree_fn_t fn
= pfd
->fn
;
8008 void *data
= pfd
->data
;
8011 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8012 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8013 pfd
->include_nondeduced_p
))
8014 return error_mark_node
;
8016 switch (TREE_CODE (t
))
8019 if (TYPE_PTRMEMFUNC_P (t
))
8025 if (!TYPE_TEMPLATE_INFO (t
))
8027 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8028 fn
, data
, pfd
->visited
,
8029 pfd
->include_nondeduced_p
))
8030 return error_mark_node
;
8034 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8035 fn
, data
, pfd
->visited
,
8036 pfd
->include_nondeduced_p
)
8037 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8038 fn
, data
, pfd
->visited
,
8039 pfd
->include_nondeduced_p
))
8040 return error_mark_node
;
8044 /* Since we're not going to walk subtrees, we have to do this
8046 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8047 pfd
->visited
, pfd
->include_nondeduced_p
))
8048 return error_mark_node
;
8052 /* Check the return type. */
8053 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8054 pfd
->include_nondeduced_p
))
8055 return error_mark_node
;
8057 /* Check the parameter types. Since default arguments are not
8058 instantiated until they are needed, the TYPE_ARG_TYPES may
8059 contain expressions that involve template parameters. But,
8060 no-one should be looking at them yet. And, once they're
8061 instantiated, they don't contain template parameters, so
8062 there's no point in looking at them then, either. */
8066 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8067 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8068 pfd
->visited
, pfd
->include_nondeduced_p
))
8069 return error_mark_node
;
8071 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8072 want walk_tree walking into them itself. */
8078 case UNDERLYING_TYPE
:
8079 if (pfd
->include_nondeduced_p
8080 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
8082 pfd
->include_nondeduced_p
))
8083 return error_mark_node
;
8088 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8089 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8090 pfd
->visited
, pfd
->include_nondeduced_p
))
8091 return error_mark_node
;
8096 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8097 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8098 pfd
->visited
, pfd
->include_nondeduced_p
))
8099 return error_mark_node
;
8100 if (DECL_CONTEXT (t
)
8101 && pfd
->include_nondeduced_p
8102 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8103 pfd
->visited
, pfd
->include_nondeduced_p
))
8104 return error_mark_node
;
8107 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8108 /* Record template parameters such as `T' inside `TT<T>'. */
8109 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8110 pfd
->include_nondeduced_p
))
8111 return error_mark_node
;
8114 case TEMPLATE_TEMPLATE_PARM
:
8115 case TEMPLATE_TYPE_PARM
:
8116 case TEMPLATE_PARM_INDEX
:
8117 if (fn
&& (*fn
)(t
, data
))
8118 return error_mark_node
;
8120 return error_mark_node
;
8124 /* A template template parameter is encountered. */
8125 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8126 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8127 pfd
->include_nondeduced_p
))
8128 return error_mark_node
;
8130 /* Already substituted template template parameter */
8136 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8138 pfd
->include_nondeduced_p
))
8139 return error_mark_node
;
8143 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8144 && pfd
->include_nondeduced_p
8145 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8146 (TREE_TYPE (t
)), fn
, data
,
8147 pfd
->visited
, pfd
->include_nondeduced_p
))
8148 return error_mark_node
;
8153 /* If there's no type, then this thing must be some expression
8154 involving template parameters. */
8155 if (!fn
&& !TREE_TYPE (t
))
8156 return error_mark_node
;
8161 case IMPLICIT_CONV_EXPR
:
8162 case REINTERPRET_CAST_EXPR
:
8163 case CONST_CAST_EXPR
:
8164 case STATIC_CAST_EXPR
:
8165 case DYNAMIC_CAST_EXPR
:
8169 case PSEUDO_DTOR_EXPR
:
8171 return error_mark_node
;
8178 /* We didn't find any template parameters we liked. */
8182 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8183 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8184 call FN with the parameter and the DATA.
8185 If FN returns nonzero, the iteration is terminated, and
8186 for_each_template_parm returns 1. Otherwise, the iteration
8187 continues. If FN never returns a nonzero value, the value
8188 returned by for_each_template_parm is 0. If FN is NULL, it is
8189 considered to be the function which always returns 1.
8191 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8192 parameters that occur in non-deduced contexts. When false, only
8193 visits those template parameters that can be deduced. */
8196 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8197 hash_set
<tree
> *visited
,
8198 bool include_nondeduced_p
)
8200 struct pair_fn_data pfd
;
8206 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8208 /* Walk the tree. (Conceptually, we would like to walk without
8209 duplicates, but for_each_template_parm_r recursively calls
8210 for_each_template_parm, so we would need to reorganize a fair
8211 bit to use walk_tree_without_duplicates, so we keep our own
8214 pfd
.visited
= visited
;
8216 pfd
.visited
= new hash_set
<tree
>;
8217 result
= cp_walk_tree (&t
,
8218 for_each_template_parm_r
,
8220 pfd
.visited
) != NULL_TREE
;
8232 /* Returns true if T depends on any template parameter. */
8235 uses_template_parms (tree t
)
8238 int saved_processing_template_decl
;
8240 saved_processing_template_decl
= processing_template_decl
;
8241 if (!saved_processing_template_decl
)
8242 processing_template_decl
= 1;
8244 dependent_p
= dependent_type_p (t
);
8245 else if (TREE_CODE (t
) == TREE_VEC
)
8246 dependent_p
= any_dependent_template_arguments_p (t
);
8247 else if (TREE_CODE (t
) == TREE_LIST
)
8248 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8249 || uses_template_parms (TREE_CHAIN (t
)));
8250 else if (TREE_CODE (t
) == TYPE_DECL
)
8251 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8254 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8255 || TREE_CODE (t
) == OVERLOAD
8258 || TREE_CODE (t
) == TRAIT_EXPR
8259 || TREE_CODE (t
) == CONSTRUCTOR
8260 || CONSTANT_CLASS_P (t
))
8261 dependent_p
= (type_dependent_expression_p (t
)
8262 || value_dependent_expression_p (t
));
8265 gcc_assert (t
== error_mark_node
);
8266 dependent_p
= false;
8269 processing_template_decl
= saved_processing_template_decl
;
8274 /* Returns true iff current_function_decl is an incompletely instantiated
8275 template. Useful instead of processing_template_decl because the latter
8276 is set to 0 during fold_non_dependent_expr. */
8279 in_template_function (void)
8281 tree fn
= current_function_decl
;
8283 ++processing_template_decl
;
8284 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8285 && DECL_TEMPLATE_INFO (fn
)
8286 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8287 --processing_template_decl
;
8291 /* Returns true if T depends on any template parameter with level LEVEL. */
8294 uses_template_parms_level (tree t
, int level
)
8296 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8297 /*include_nondeduced_p=*/true);
8300 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8301 ill-formed translation unit, i.e. a variable or function that isn't
8302 usable in a constant expression. */
8305 neglectable_inst_p (tree d
)
8308 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8309 : decl_maybe_constant_var_p (d
)));
8312 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8313 neglectable and instantiated from within an erroneous instantiation. */
8316 limit_bad_template_recursion (tree decl
)
8318 struct tinst_level
*lev
= current_tinst_level
;
8319 int errs
= errorcount
+ sorrycount
;
8320 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8323 for (; lev
; lev
= lev
->next
)
8324 if (neglectable_inst_p (lev
->decl
))
8327 return (lev
&& errs
> lev
->errors
);
8330 static int tinst_depth
;
8331 extern int max_tinst_depth
;
8334 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8336 /* We're starting to instantiate D; record the template instantiation context
8337 for diagnostics and to restore it later. */
8340 push_tinst_level (tree d
)
8342 struct tinst_level
*new_level
;
8344 if (tinst_depth
>= max_tinst_depth
)
8346 last_error_tinst_level
= current_tinst_level
;
8347 if (TREE_CODE (d
) == TREE_LIST
)
8348 error ("template instantiation depth exceeds maximum of %d (use "
8349 "-ftemplate-depth= to increase the maximum) substituting %qS",
8350 max_tinst_depth
, d
);
8352 error ("template instantiation depth exceeds maximum of %d (use "
8353 "-ftemplate-depth= to increase the maximum) instantiating %qD",
8354 max_tinst_depth
, d
);
8356 print_instantiation_context ();
8361 /* If the current instantiation caused problems, don't let it instantiate
8362 anything else. Do allow deduction substitution and decls usable in
8363 constant expressions. */
8364 if (limit_bad_template_recursion (d
))
8367 new_level
= ggc_alloc
<tinst_level
> ();
8368 new_level
->decl
= d
;
8369 new_level
->locus
= input_location
;
8370 new_level
->errors
= errorcount
+sorrycount
;
8371 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8372 new_level
->next
= current_tinst_level
;
8373 current_tinst_level
= new_level
;
8376 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8377 depth_reached
= tinst_depth
;
8382 /* We're done instantiating this template; return to the instantiation
8386 pop_tinst_level (void)
8388 /* Restore the filename and line number stashed away when we started
8389 this instantiation. */
8390 input_location
= current_tinst_level
->locus
;
8391 current_tinst_level
= current_tinst_level
->next
;
8395 /* We're instantiating a deferred template; restore the template
8396 instantiation context in which the instantiation was requested, which
8397 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8400 reopen_tinst_level (struct tinst_level
*level
)
8402 struct tinst_level
*t
;
8405 for (t
= level
; t
; t
= t
->next
)
8408 current_tinst_level
= level
;
8410 if (current_tinst_level
)
8411 current_tinst_level
->errors
= errorcount
+sorrycount
;
8415 /* Returns the TINST_LEVEL which gives the original instantiation
8418 struct tinst_level
*
8419 outermost_tinst_level (void)
8421 struct tinst_level
*level
= current_tinst_level
;
8424 level
= level
->next
;
8428 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8429 vector of template arguments, as for tsubst.
8431 Returns an appropriate tsubst'd friend declaration. */
8434 tsubst_friend_function (tree decl
, tree args
)
8438 if (TREE_CODE (decl
) == FUNCTION_DECL
8439 && DECL_TEMPLATE_INSTANTIATION (decl
)
8440 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8441 /* This was a friend declared with an explicit template
8442 argument list, e.g.:
8446 to indicate that f was a template instantiation, not a new
8447 function declaration. Now, we have to figure out what
8448 instantiation of what template. */
8450 tree template_id
, arglist
, fns
;
8453 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8455 /* Friend functions are looked up in the containing namespace scope.
8456 We must enter that scope, to avoid finding member functions of the
8457 current class with same name. */
8458 push_nested_namespace (ns
);
8459 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8460 tf_warning_or_error
, NULL_TREE
,
8461 /*integral_constant_expression_p=*/false);
8462 pop_nested_namespace (ns
);
8463 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8464 tf_warning_or_error
, NULL_TREE
);
8465 template_id
= lookup_template_function (fns
, arglist
);
8467 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8468 tmpl
= determine_specialization (template_id
, new_friend
,
8470 /*need_member_template=*/0,
8471 TREE_VEC_LENGTH (args
),
8473 return instantiate_template (tmpl
, new_args
, tf_error
);
8476 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8478 /* The NEW_FRIEND will look like an instantiation, to the
8479 compiler, but is not an instantiation from the point of view of
8480 the language. For example, we might have had:
8482 template <class T> struct S {
8483 template <class U> friend void f(T, U);
8486 Then, in S<int>, template <class U> void f(int, U) is not an
8487 instantiation of anything. */
8488 if (new_friend
== error_mark_node
)
8489 return error_mark_node
;
8491 DECL_USE_TEMPLATE (new_friend
) = 0;
8492 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8494 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8495 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8496 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8499 /* The mangled name for the NEW_FRIEND is incorrect. The function
8500 is not a template instantiation and should not be mangled like
8501 one. Therefore, we forget the mangling here; we'll recompute it
8502 later if we need it. */
8503 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8505 SET_DECL_RTL (new_friend
, NULL
);
8506 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8509 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8512 tree new_friend_template_info
;
8513 tree new_friend_result_template_info
;
8515 int new_friend_is_defn
;
8517 /* We must save some information from NEW_FRIEND before calling
8518 duplicate decls since that function will free NEW_FRIEND if
8520 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8521 new_friend_is_defn
=
8522 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8523 (template_for_substitution (new_friend
)))
8525 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8527 /* This declaration is a `primary' template. */
8528 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8530 new_friend_result_template_info
8531 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8534 new_friend_result_template_info
= NULL_TREE
;
8536 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8537 if (new_friend_is_defn
)
8538 DECL_INITIAL (new_friend
) = error_mark_node
;
8540 /* Inside pushdecl_namespace_level, we will push into the
8541 current namespace. However, the friend function should go
8542 into the namespace of the template. */
8543 ns
= decl_namespace_context (new_friend
);
8544 push_nested_namespace (ns
);
8545 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8546 pop_nested_namespace (ns
);
8548 if (old_decl
== error_mark_node
)
8549 return error_mark_node
;
8551 if (old_decl
!= new_friend
)
8553 /* This new friend declaration matched an existing
8554 declaration. For example, given:
8556 template <class T> void f(T);
8557 template <class U> class C {
8558 template <class T> friend void f(T) {}
8561 the friend declaration actually provides the definition
8562 of `f', once C has been instantiated for some type. So,
8563 old_decl will be the out-of-class template declaration,
8564 while new_friend is the in-class definition.
8566 But, if `f' was called before this point, the
8567 instantiation of `f' will have DECL_TI_ARGS corresponding
8568 to `T' but not to `U', references to which might appear
8569 in the definition of `f'. Previously, the most general
8570 template for an instantiation of `f' was the out-of-class
8571 version; now it is the in-class version. Therefore, we
8572 run through all specialization of `f', adding to their
8573 DECL_TI_ARGS appropriately. In particular, they need a
8574 new set of outer arguments, corresponding to the
8575 arguments for this class instantiation.
8577 The same situation can arise with something like this:
8580 template <class T> class C {
8584 when `C<int>' is instantiated. Now, `f(int)' is defined
8587 if (!new_friend_is_defn
)
8588 /* On the other hand, if the in-class declaration does
8589 *not* provide a definition, then we don't want to alter
8590 existing definitions. We can just leave everything
8595 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8596 tree new_args
= TI_ARGS (new_friend_template_info
);
8598 /* Overwrite whatever template info was there before, if
8599 any, with the new template information pertaining to
8601 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8603 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8605 /* We should have called reregister_specialization in
8607 gcc_assert (retrieve_specialization (new_template
,
8611 /* Instantiate it if the global has already been used. */
8612 if (DECL_ODR_USED (old_decl
))
8613 instantiate_decl (old_decl
, /*defer_ok=*/true,
8614 /*expl_inst_class_mem_p=*/false);
8620 /* Indicate that the old function template is a partial
8622 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8623 = new_friend_result_template_info
;
8625 gcc_assert (new_template
8626 == most_general_template (new_template
));
8627 gcc_assert (new_template
!= old_decl
);
8629 /* Reassign any specializations already in the hash table
8630 to the new more general template, and add the
8631 additional template args. */
8632 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8636 tree spec
= TREE_VALUE (t
);
8639 elt
.tmpl
= old_decl
;
8640 elt
.args
= DECL_TI_ARGS (spec
);
8641 elt
.spec
= NULL_TREE
;
8643 htab_remove_elt (decl_specializations
, &elt
);
8646 = add_outermost_template_args (new_args
,
8647 DECL_TI_ARGS (spec
));
8649 register_specialization
8650 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8653 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8657 /* The information from NEW_FRIEND has been merged into OLD_DECL
8658 by duplicate_decls. */
8659 new_friend
= old_decl
;
8664 tree context
= DECL_CONTEXT (new_friend
);
8668 template <class T> class C {
8669 template <class U> friend void C1<U>::f (); // case 1
8670 friend void C2<T>::f (); // case 2
8672 we only need to make sure CONTEXT is a complete type for
8673 case 2. To distinguish between the two cases, we note that
8674 CONTEXT of case 1 remains dependent type after tsubst while
8675 this isn't true for case 2. */
8676 ++processing_template_decl
;
8677 dependent_p
= dependent_type_p (context
);
8678 --processing_template_decl
;
8681 && !complete_type_or_else (context
, NULL_TREE
))
8682 return error_mark_node
;
8684 if (COMPLETE_TYPE_P (context
))
8686 tree fn
= new_friend
;
8687 /* do_friend adds the TEMPLATE_DECL for any member friend
8688 template even if it isn't a member template, i.e.
8689 template <class T> friend A<T>::f();
8690 Look through it in that case. */
8691 if (TREE_CODE (fn
) == TEMPLATE_DECL
8692 && !PRIMARY_TEMPLATE_P (fn
))
8693 fn
= DECL_TEMPLATE_RESULT (fn
);
8694 /* Check to see that the declaration is really present, and,
8695 possibly obtain an improved declaration. */
8696 fn
= check_classfn (context
, fn
, NULL_TREE
);
8706 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8707 template arguments, as for tsubst.
8709 Returns an appropriate tsubst'd friend type or error_mark_node on
8713 tsubst_friend_class (tree friend_tmpl
, tree args
)
8719 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8721 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8722 return TREE_TYPE (t
);
8725 context
= CP_DECL_CONTEXT (friend_tmpl
);
8727 if (context
!= global_namespace
)
8729 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8730 push_nested_namespace (context
);
8732 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8735 /* Look for a class template declaration. We look for hidden names
8736 because two friend declarations of the same template are the
8737 same. For example, in:
8740 template <typename> friend class F;
8742 template <typename> struct B {
8743 template <typename> friend class F;
8746 both F templates are the same. */
8747 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8748 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8750 /* But, if we don't find one, it might be because we're in a
8751 situation like this:
8759 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8760 for `S<int>', not the TEMPLATE_DECL. */
8761 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8763 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8764 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8767 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8769 /* The friend template has already been declared. Just
8770 check to see that the declarations match, and install any new
8771 default parameters. We must tsubst the default parameters,
8772 of course. We only need the innermost template parameters
8773 because that is all that redeclare_class_template will look
8775 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8776 > TMPL_ARGS_DEPTH (args
))
8779 location_t saved_input_location
;
8780 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8781 args
, tf_warning_or_error
);
8783 saved_input_location
= input_location
;
8784 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8785 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8786 input_location
= saved_input_location
;
8790 friend_type
= TREE_TYPE (tmpl
);
8794 /* The friend template has not already been declared. In this
8795 case, the instantiation of the template class will cause the
8796 injection of this template into the global scope. */
8797 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8798 if (tmpl
== error_mark_node
)
8799 return error_mark_node
;
8801 /* The new TMPL is not an instantiation of anything, so we
8802 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8803 the new type because that is supposed to be the corresponding
8804 template decl, i.e., TMPL. */
8805 DECL_USE_TEMPLATE (tmpl
) = 0;
8806 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8807 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8808 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8809 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8811 /* Inject this template into the global scope. */
8812 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8815 if (context
!= global_namespace
)
8817 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8818 pop_nested_namespace (context
);
8820 pop_nested_class ();
8826 /* Returns zero if TYPE cannot be completed later due to circularity.
8827 Otherwise returns one. */
8830 can_complete_type_without_circularity (tree type
)
8832 if (type
== NULL_TREE
|| type
== error_mark_node
)
8834 else if (COMPLETE_TYPE_P (type
))
8836 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8837 return can_complete_type_without_circularity (TREE_TYPE (type
));
8838 else if (CLASS_TYPE_P (type
)
8839 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8845 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
8847 /* Apply any attributes which had to be deferred until instantiation
8848 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8849 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8852 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8853 tree args
, tsubst_flags_t complain
, tree in_decl
)
8855 tree last_dep
= NULL_TREE
;
8859 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8860 if (ATTR_IS_DEPENDENT (t
))
8863 attributes
= copy_list (attributes
);
8867 if (DECL_P (*decl_p
))
8869 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8871 p
= &DECL_ATTRIBUTES (*decl_p
);
8874 p
= &TYPE_ATTRIBUTES (*decl_p
);
8878 tree late_attrs
= NULL_TREE
;
8879 tree
*q
= &late_attrs
;
8881 for (*p
= attributes
; *p
; )
8884 if (ATTR_IS_DEPENDENT (t
))
8886 *p
= TREE_CHAIN (t
);
8887 TREE_CHAIN (t
) = NULL_TREE
;
8888 if ((flag_openmp
|| flag_cilkplus
)
8889 && is_attribute_p ("omp declare simd",
8890 get_attribute_name (t
))
8893 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
8894 clauses
= tsubst_omp_clauses (clauses
, true, args
,
8896 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
8897 clauses
= finish_omp_clauses (clauses
);
8898 tree parms
= DECL_ARGUMENTS (*decl_p
);
8900 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
8902 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
8904 TREE_VALUE (t
) = NULL_TREE
;
8906 /* If the first attribute argument is an identifier, don't
8907 pass it through tsubst. Attributes like mode, format,
8908 cleanup and several target specific attributes expect it
8910 else if (attribute_takes_identifier_p (get_attribute_name (t
))
8914 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8916 /*integral_constant_expression_p=*/false);
8917 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8919 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8924 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8925 /*integral_constant_expression_p=*/false);
8927 q
= &TREE_CHAIN (t
);
8930 p
= &TREE_CHAIN (t
);
8933 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8937 /* Perform (or defer) access check for typedefs that were referenced
8938 from within the template TMPL code.
8939 This is a subroutine of instantiate_decl and instantiate_class_template.
8940 TMPL is the template to consider and TARGS is the list of arguments of
8944 perform_typedefs_access_check (tree tmpl
, tree targs
)
8946 location_t saved_location
;
8948 qualified_typedef_usage_t
*iter
;
8951 || (!CLASS_TYPE_P (tmpl
)
8952 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8955 saved_location
= input_location
;
8956 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8958 tree type_decl
= iter
->typedef_decl
;
8959 tree type_scope
= iter
->context
;
8961 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8964 if (uses_template_parms (type_decl
))
8965 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8966 if (uses_template_parms (type_scope
))
8967 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8969 /* Make access check error messages point to the location
8970 of the use of the typedef. */
8971 input_location
= iter
->locus
;
8972 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8973 type_decl
, type_decl
,
8974 tf_warning_or_error
);
8976 input_location
= saved_location
;
8980 instantiate_class_template_1 (tree type
)
8982 tree templ
, args
, pattern
, t
, member
;
8986 unsigned int saved_maximum_field_alignment
;
8989 if (type
== error_mark_node
)
8990 return error_mark_node
;
8992 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8993 || uses_template_parms (type
))
8996 /* Figure out which template is being instantiated. */
8997 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8998 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9000 /* Determine what specialization of the original template to
9002 t
= most_specialized_class (type
, tf_warning_or_error
);
9003 if (t
== error_mark_node
)
9005 TYPE_BEING_DEFINED (type
) = 1;
9006 return error_mark_node
;
9010 /* This TYPE is actually an instantiation of a partial
9011 specialization. We replace the innermost set of ARGS with
9012 the arguments appropriate for substitution. For example,
9015 template <class T> struct S {};
9016 template <class T> struct S<T*> {};
9018 and supposing that we are instantiating S<int*>, ARGS will
9019 presently be {int*} -- but we need {int}. */
9020 pattern
= TREE_TYPE (t
);
9021 args
= TREE_PURPOSE (t
);
9025 pattern
= TREE_TYPE (templ
);
9026 args
= CLASSTYPE_TI_ARGS (type
);
9029 /* If the template we're instantiating is incomplete, then clearly
9030 there's nothing we can do. */
9031 if (!COMPLETE_TYPE_P (pattern
))
9034 /* If we've recursively instantiated too many templates, stop. */
9035 if (! push_tinst_level (type
))
9038 /* Now we're really doing the instantiation. Mark the type as in
9039 the process of being defined. */
9040 TYPE_BEING_DEFINED (type
) = 1;
9042 /* We may be in the middle of deferred access check. Disable
9044 push_deferring_access_checks (dk_no_deferred
);
9046 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9047 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9048 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9049 fn_context
= error_mark_node
;
9051 push_to_top_level ();
9052 /* Use #pragma pack from the template context. */
9053 saved_maximum_field_alignment
= maximum_field_alignment
;
9054 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9056 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9058 /* Set the input location to the most specialized template definition.
9059 This is needed if tsubsting causes an error. */
9060 typedecl
= TYPE_MAIN_DECL (pattern
);
9061 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9062 DECL_SOURCE_LOCATION (typedecl
);
9064 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9065 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9066 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9067 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9068 if (ANON_AGGR_TYPE_P (pattern
))
9069 SET_ANON_AGGR_TYPE_P (type
);
9070 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9072 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9073 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9074 /* Adjust visibility for template arguments. */
9075 determine_visibility (TYPE_MAIN_DECL (type
));
9077 if (CLASS_TYPE_P (type
))
9078 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9080 pbinfo
= TYPE_BINFO (pattern
);
9082 /* We should never instantiate a nested class before its enclosing
9083 class; we need to look up the nested class by name before we can
9084 instantiate it, and that lookup should instantiate the enclosing
9086 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9087 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9089 base_list
= NULL_TREE
;
9090 if (BINFO_N_BASE_BINFOS (pbinfo
))
9096 /* We must enter the scope containing the type, as that is where
9097 the accessibility of types named in dependent bases are
9099 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9101 /* Substitute into each of the bases to determine the actual
9103 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9106 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9107 tree expanded_bases
= NULL_TREE
;
9110 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9113 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9114 args
, tf_error
, NULL_TREE
);
9115 if (expanded_bases
== error_mark_node
)
9118 len
= TREE_VEC_LENGTH (expanded_bases
);
9121 for (idx
= 0; idx
< len
; idx
++)
9124 /* Extract the already-expanded base class. */
9125 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9127 /* Substitute to figure out the base class. */
9128 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9131 if (base
== error_mark_node
)
9134 base_list
= tree_cons (access
, base
, base_list
);
9135 if (BINFO_VIRTUAL_P (pbase_binfo
))
9136 TREE_TYPE (base_list
) = integer_type_node
;
9140 /* The list is now in reverse order; correct that. */
9141 base_list
= nreverse (base_list
);
9144 pop_scope (pushed_scope
);
9146 /* Now call xref_basetypes to set up all the base-class
9148 xref_basetypes (type
, base_list
);
9150 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9151 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9152 args
, tf_error
, NULL_TREE
);
9153 fixup_attribute_variants (type
);
9155 /* Now that our base classes are set up, enter the scope of the
9156 class, so that name lookups into base classes, etc. will work
9157 correctly. This is precisely analogous to what we do in
9158 begin_class_definition when defining an ordinary non-template
9159 class, except we also need to push the enclosing classes. */
9160 push_nested_class (type
);
9162 /* Now members are processed in the order of declaration. */
9163 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9164 member
; member
= TREE_CHAIN (member
))
9166 tree t
= TREE_VALUE (member
);
9168 if (TREE_PURPOSE (member
))
9172 /* Build new CLASSTYPE_NESTED_UTDS. */
9175 bool class_template_p
;
9177 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9178 && TYPE_LANG_SPECIFIC (t
)
9179 && CLASSTYPE_IS_TEMPLATE (t
));
9180 /* If the member is a class template, then -- even after
9181 substitution -- there may be dependent types in the
9182 template argument list for the class. We increment
9183 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9184 that function will assume that no types are dependent
9185 when outside of a template. */
9186 if (class_template_p
)
9187 ++processing_template_decl
;
9188 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9189 if (class_template_p
)
9190 --processing_template_decl
;
9191 if (newtag
== error_mark_node
)
9194 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9196 tree name
= TYPE_IDENTIFIER (t
);
9198 if (class_template_p
)
9199 /* Unfortunately, lookup_template_class sets
9200 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9201 instantiation (i.e., for the type of a member
9202 template class nested within a template class.)
9203 This behavior is required for
9204 maybe_process_partial_specialization to work
9205 correctly, but is not accurate in this case;
9206 the TAG is not an instantiation of anything.
9207 (The corresponding TEMPLATE_DECL is an
9208 instantiation, but the TYPE is not.) */
9209 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9211 /* Now, we call pushtag to put this NEWTAG into the scope of
9212 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9213 pushtag calling push_template_decl. We don't have to do
9214 this for enums because it will already have been done in
9217 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9218 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9221 else if (DECL_DECLARES_FUNCTION_P (t
))
9223 /* Build new TYPE_METHODS. */
9226 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9227 ++processing_template_decl
;
9228 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9229 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9230 --processing_template_decl
;
9231 set_current_access_from_decl (r
);
9232 finish_member_declaration (r
);
9233 /* Instantiate members marked with attribute used. */
9234 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9236 if (TREE_CODE (r
) == FUNCTION_DECL
9237 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9238 cp_check_omp_declare_reduction (r
);
9242 /* Build new TYPE_FIELDS. */
9243 if (TREE_CODE (t
) == STATIC_ASSERT
)
9247 ++c_inhibit_evaluation_warnings
;
9249 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9250 tf_warning_or_error
, NULL_TREE
,
9251 /*integral_constant_expression_p=*/true);
9252 --c_inhibit_evaluation_warnings
;
9254 finish_static_assert (condition
,
9255 STATIC_ASSERT_MESSAGE (t
),
9256 STATIC_ASSERT_SOURCE_LOCATION (t
),
9259 else if (TREE_CODE (t
) != CONST_DECL
)
9262 tree vec
= NULL_TREE
;
9265 /* The file and line for this declaration, to
9266 assist in error message reporting. Since we
9267 called push_tinst_level above, we don't need to
9269 input_location
= DECL_SOURCE_LOCATION (t
);
9271 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9272 ++processing_template_decl
;
9273 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9274 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9275 --processing_template_decl
;
9277 if (TREE_CODE (r
) == TREE_VEC
)
9279 /* A capture pack became multiple fields. */
9281 len
= TREE_VEC_LENGTH (vec
);
9284 for (int i
= 0; i
< len
; ++i
)
9287 r
= TREE_VEC_ELT (vec
, i
);
9292 [t]he initialization (and any associated
9293 side-effects) of a static data member does
9294 not occur unless the static data member is
9295 itself used in a way that requires the
9296 definition of the static data member to
9299 Therefore, we do not substitute into the
9300 initialized for the static data member here. */
9301 finish_static_data_member_decl
9304 /*init_const_expr_p=*/false,
9305 /*asmspec_tree=*/NULL_TREE
,
9307 /* Instantiate members marked with attribute used. */
9308 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9311 else if (TREE_CODE (r
) == FIELD_DECL
)
9313 /* Determine whether R has a valid type and can be
9314 completed later. If R is invalid, then its type
9315 is replaced by error_mark_node. */
9316 tree rtype
= TREE_TYPE (r
);
9317 if (can_complete_type_without_circularity (rtype
))
9318 complete_type (rtype
);
9320 if (!COMPLETE_TYPE_P (rtype
))
9322 cxx_incomplete_type_error (r
, rtype
);
9323 TREE_TYPE (r
) = error_mark_node
;
9327 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9328 such a thing will already have been added to the field
9329 list by tsubst_enum in finish_member_declaration in the
9330 CLASSTYPE_NESTED_UTDS case above. */
9331 if (!(TREE_CODE (r
) == TYPE_DECL
9332 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9333 && DECL_ARTIFICIAL (r
)))
9335 set_current_access_from_decl (r
);
9336 finish_member_declaration (r
);
9344 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9345 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9347 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9349 tree friend_type
= t
;
9350 bool adjust_processing_template_decl
= false;
9352 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9354 /* template <class T> friend class C; */
9355 friend_type
= tsubst_friend_class (friend_type
, args
);
9356 adjust_processing_template_decl
= true;
9358 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9360 /* template <class T> friend class C::D; */
9361 friend_type
= tsubst (friend_type
, args
,
9362 tf_warning_or_error
, NULL_TREE
);
9363 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9364 friend_type
= TREE_TYPE (friend_type
);
9365 adjust_processing_template_decl
= true;
9367 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9368 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9370 /* This could be either
9374 when dependent_type_p is false or
9376 template <class U> friend class T::C;
9379 friend_type
= tsubst (friend_type
, args
,
9380 tf_warning_or_error
, NULL_TREE
);
9381 /* Bump processing_template_decl for correct
9382 dependent_type_p calculation. */
9383 ++processing_template_decl
;
9384 if (dependent_type_p (friend_type
))
9385 adjust_processing_template_decl
= true;
9386 --processing_template_decl
;
9388 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9389 && hidden_name_p (TYPE_NAME (friend_type
)))
9393 where C hasn't been declared yet. Let's lookup name
9394 from namespace scope directly, bypassing any name that
9395 come from dependent base class. */
9396 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9398 /* The call to xref_tag_from_type does injection for friend
9400 push_nested_namespace (ns
);
9402 xref_tag_from_type (friend_type
, NULL_TREE
,
9403 /*tag_scope=*/ts_current
);
9404 pop_nested_namespace (ns
);
9406 else if (uses_template_parms (friend_type
))
9407 /* friend class C<T>; */
9408 friend_type
= tsubst (friend_type
, args
,
9409 tf_warning_or_error
, NULL_TREE
);
9414 where C is already declared or
9416 friend class C<int>;
9418 We don't have to do anything in these cases. */
9420 if (adjust_processing_template_decl
)
9421 /* Trick make_friend_class into realizing that the friend
9422 we're adding is a template, not an ordinary class. It's
9423 important that we use make_friend_class since it will
9424 perform some error-checking and output cross-reference
9426 ++processing_template_decl
;
9428 if (friend_type
!= error_mark_node
)
9429 make_friend_class (type
, friend_type
, /*complain=*/false);
9431 if (adjust_processing_template_decl
)
9432 --processing_template_decl
;
9436 /* Build new DECL_FRIENDLIST. */
9439 /* The file and line for this declaration, to
9440 assist in error message reporting. Since we
9441 called push_tinst_level above, we don't need to
9443 input_location
= DECL_SOURCE_LOCATION (t
);
9445 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9447 ++processing_template_decl
;
9448 push_deferring_access_checks (dk_no_check
);
9451 r
= tsubst_friend_function (t
, args
);
9452 add_friend (type
, r
, /*complain=*/false);
9453 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9455 pop_deferring_access_checks ();
9456 --processing_template_decl
;
9462 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9464 tree decl
= lambda_function (type
);
9467 if (!DECL_TEMPLATE_INFO (decl
)
9468 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9469 instantiate_decl (decl
, false, false);
9471 /* We need to instantiate the capture list from the template
9472 after we've instantiated the closure members, but before we
9473 consider adding the conversion op. Also keep any captures
9474 that may have been added during instantiation of the op(). */
9475 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9477 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9478 args
, tf_warning_or_error
, NULL_TREE
,
9481 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9482 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9484 maybe_add_lambda_conv_op (type
);
9487 gcc_assert (errorcount
);
9490 /* Set the file and line number information to whatever is given for
9491 the class itself. This puts error messages involving generated
9492 implicit functions at a predictable point, and the same point
9493 that would be used for non-template classes. */
9494 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9496 unreverse_member_declarations (type
);
9497 finish_struct_1 (type
);
9498 TYPE_BEING_DEFINED (type
) = 0;
9500 /* We don't instantiate default arguments for member functions. 14.7.1:
9502 The implicit instantiation of a class template specialization causes
9503 the implicit instantiation of the declarations, but not of the
9504 definitions or default arguments, of the class member functions,
9505 member classes, static data members and member templates.... */
9507 /* Some typedefs referenced from within the template code need to be access
9508 checked at template instantiation time, i.e now. These types were
9509 added to the template at parsing time. Let's get those and perform
9510 the access checks then. */
9511 perform_typedefs_access_check (pattern
, args
);
9512 perform_deferred_access_checks (tf_warning_or_error
);
9513 pop_nested_class ();
9514 maximum_field_alignment
= saved_maximum_field_alignment
;
9516 pop_from_top_level ();
9517 pop_deferring_access_checks ();
9520 /* The vtable for a template class can be emitted in any translation
9521 unit in which the class is instantiated. When there is no key
9522 method, however, finish_struct_1 will already have added TYPE to
9523 the keyed_classes list. */
9524 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9525 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9530 /* Wrapper for instantiate_class_template_1. */
9533 instantiate_class_template (tree type
)
9536 timevar_push (TV_TEMPLATE_INST
);
9537 ret
= instantiate_class_template_1 (type
);
9538 timevar_pop (TV_TEMPLATE_INST
);
9543 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9549 else if (TYPE_P (t
))
9550 r
= tsubst (t
, args
, complain
, in_decl
);
9553 if (!(complain
& tf_warning
))
9554 ++c_inhibit_evaluation_warnings
;
9555 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9556 /*integral_constant_expression_p=*/true);
9557 if (!(complain
& tf_warning
))
9558 --c_inhibit_evaluation_warnings
;
9563 /* Given a function parameter pack TMPL_PARM and some function parameters
9564 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9565 and set *SPEC_P to point at the next point in the list. */
9568 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9570 /* Collect all of the extra "packed" parameters into an
9574 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9575 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9576 tree spec_parm
= *spec_p
;
9579 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9581 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9584 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9585 parmvec
= make_tree_vec (len
);
9586 parmtypevec
= make_tree_vec (len
);
9587 spec_parm
= *spec_p
;
9588 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9590 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9591 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9594 /* Build the argument packs. */
9595 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9596 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9597 TREE_TYPE (argpack
) = argtypepack
;
9598 *spec_p
= spec_parm
;
9603 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9604 NONTYPE_ARGUMENT_PACK. */
9607 make_fnparm_pack (tree spec_parm
)
9609 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9612 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9616 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9618 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9619 if (i
>= TREE_VEC_LENGTH (vec
))
9621 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9625 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9628 make_argument_pack_select (tree arg_pack
, unsigned index
)
9630 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9632 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9633 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9638 /* This is a subroutine of tsubst_pack_expansion.
9640 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9641 mechanism to store the (non complete list of) arguments of the
9642 substitution and return a non substituted pack expansion, in order
9643 to wait for when we have enough arguments to really perform the
9647 use_pack_expansion_extra_args_p (tree parm_packs
,
9651 /* If one pack has an expansion and another pack has a normal
9652 argument or if one pack has an empty argument and an another
9653 one hasn't then tsubst_pack_expansion cannot perform the
9654 substitution and need to fall back on the
9655 PACK_EXPANSION_EXTRA mechanism. */
9656 if (parm_packs
== NULL_TREE
)
9658 else if (has_empty_arg
)
9661 bool has_expansion_arg
= false;
9662 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9664 bool has_non_expansion_arg
= false;
9665 for (tree parm_pack
= parm_packs
;
9667 parm_pack
= TREE_CHAIN (parm_pack
))
9669 tree arg
= TREE_VALUE (parm_pack
);
9671 if (argument_pack_element_is_expansion_p (arg
, i
))
9672 has_expansion_arg
= true;
9674 has_non_expansion_arg
= true;
9677 if (has_expansion_arg
&& has_non_expansion_arg
)
9683 /* [temp.variadic]/6 says that:
9685 The instantiation of a pack expansion [...]
9686 produces a list E1,E2, ..., En, where N is the number of elements
9687 in the pack expansion parameters.
9689 This subroutine of tsubst_pack_expansion produces one of these Ei.
9691 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9692 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9693 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9694 INDEX is the index 'i' of the element Ei to produce. ARGS,
9695 COMPLAIN, and IN_DECL are the same parameters as for the
9696 tsubst_pack_expansion function.
9698 The function returns the resulting Ei upon successful completion,
9701 Note that this function possibly modifies the ARGS parameter, so
9702 it's the responsibility of the caller to restore it. */
9705 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9708 tree args
/* This parm gets
9710 tsubst_flags_t complain
,
9714 bool ith_elem_is_expansion
= false;
9716 /* For each parameter pack, change the substitution of the parameter
9717 pack to the ith argument in its argument pack, then expand the
9719 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9721 tree parm
= TREE_PURPOSE (pack
);
9722 tree arg_pack
= TREE_VALUE (pack
);
9723 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9725 ith_elem_is_expansion
|=
9726 argument_pack_element_is_expansion_p (arg_pack
, index
);
9728 /* Select the Ith argument from the pack. */
9729 if (TREE_CODE (parm
) == PARM_DECL
9730 || TREE_CODE (parm
) == FIELD_DECL
)
9734 aps
= make_argument_pack_select (arg_pack
, index
);
9736 register_local_specialization (aps
, parm
);
9739 aps
= retrieve_local_specialization (parm
);
9744 template_parm_level_and_index (parm
, &level
, &idx
);
9748 aps
= make_argument_pack_select (arg_pack
, index
);
9749 /* Update the corresponding argument. */
9750 TMPL_ARG (args
, level
, idx
) = aps
;
9753 /* Re-use the ARGUMENT_PACK_SELECT. */
9754 aps
= TMPL_ARG (args
, level
, idx
);
9756 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9759 /* Substitute into the PATTERN with the (possibly altered)
9761 if (pattern
== in_decl
)
9762 /* Expanding a fixed parameter pack from
9763 coerce_template_parameter_pack. */
9764 t
= tsubst_decl (pattern
, args
, complain
);
9765 else if (!TYPE_P (pattern
))
9766 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9767 /*integral_constant_expression_p=*/false);
9769 t
= tsubst (pattern
, args
, complain
, in_decl
);
9771 /* If the Ith argument pack element is a pack expansion, then
9772 the Ith element resulting from the substituting is going to
9773 be a pack expansion as well. */
9774 if (ith_elem_is_expansion
)
9775 t
= make_pack_expansion (t
);
9780 /* Substitute ARGS into T, which is an pack expansion
9781 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9782 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9783 (if only a partial substitution could be performed) or
9784 ERROR_MARK_NODE if there was an error. */
9786 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9790 tree pack
, packs
= NULL_TREE
;
9791 bool unsubstituted_packs
= false;
9794 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
9795 bool need_local_specializations
= false;
9798 gcc_assert (PACK_EXPANSION_P (t
));
9799 pattern
= PACK_EXPANSION_PATTERN (t
);
9801 /* Add in any args remembered from an earlier partial instantiation. */
9802 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9804 levels
= TMPL_ARGS_DEPTH (args
);
9806 /* Determine the argument packs that will instantiate the parameter
9807 packs used in the expansion expression. While we're at it,
9808 compute the number of arguments to be expanded and make sure it
9810 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9811 pack
= TREE_CHAIN (pack
))
9813 tree parm_pack
= TREE_VALUE (pack
);
9814 tree arg_pack
= NULL_TREE
;
9815 tree orig_arg
= NULL_TREE
;
9818 if (TREE_CODE (parm_pack
) == BASES
)
9820 if (BASES_DIRECT (parm_pack
))
9821 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9822 args
, complain
, in_decl
, false));
9824 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9825 args
, complain
, in_decl
, false));
9827 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9829 if (PACK_EXPANSION_LOCAL_P (t
))
9830 arg_pack
= retrieve_local_specialization (parm_pack
);
9833 /* We can't rely on local_specializations for a parameter
9834 name used later in a function declaration (such as in a
9835 late-specified return type). Even if it exists, it might
9836 have the wrong value for a recursive call. Just make a
9837 dummy decl, since it's only used for its type. */
9838 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9839 if (arg_pack
&& DECL_PACK_P (arg_pack
))
9840 /* Partial instantiation of the parm_pack, we can't build
9841 up an argument pack yet. */
9842 arg_pack
= NULL_TREE
;
9844 arg_pack
= make_fnparm_pack (arg_pack
);
9845 need_local_specializations
= true;
9848 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
9849 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
9853 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9855 if (level
<= levels
)
9856 arg_pack
= TMPL_ARG (args
, level
, idx
);
9859 orig_arg
= arg_pack
;
9860 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9861 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9863 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9864 /* This can only happen if we forget to expand an argument
9865 pack somewhere else. Just return an error, silently. */
9867 result
= make_tree_vec (1);
9868 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9875 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9877 /* Don't bother trying to do a partial substitution with
9878 incomplete packs; we'll try again after deduction. */
9879 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9884 else if (len
!= my_len
)
9886 if (!(complain
& tf_error
))
9887 /* Fail quietly. */;
9888 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9889 error ("mismatched argument pack lengths while expanding "
9893 error ("mismatched argument pack lengths while expanding "
9896 return error_mark_node
;
9899 /* Keep track of the parameter packs and their corresponding
9901 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9902 TREE_TYPE (packs
) = orig_arg
;
9906 /* We can't substitute for this parameter pack. We use a flag as
9907 well as the missing_level counter because function parameter
9908 packs don't have a level. */
9909 unsubstituted_packs
= true;
9913 /* We cannot expand this expansion expression, because we don't have
9914 all of the argument packs we need. */
9915 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9917 /* We got some full packs, but we can't substitute them in until we
9918 have values for all the packs. So remember these until then. */
9920 t
= make_pack_expansion (pattern
);
9921 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9924 else if (unsubstituted_packs
)
9926 /* There were no real arguments, we're just replacing a parameter
9927 pack with another version of itself. Substitute into the
9928 pattern and return a PACK_EXPANSION_*. The caller will need to
9930 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9931 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9932 /*integral_constant_expression_p=*/false);
9934 t
= tsubst (pattern
, args
, complain
, in_decl
);
9935 t
= make_pack_expansion (t
);
9939 gcc_assert (len
>= 0);
9941 if (need_local_specializations
)
9943 /* We're in a late-specified return type, so create our own local
9944 specializations map; the current map is either NULL or (in the
9945 case of recursive unification) might have bindings that we don't
9946 want to use or alter. */
9947 saved_local_specializations
= local_specializations
;
9948 local_specializations
= new hash_map
<tree
, tree
>;
9951 /* For each argument in each argument pack, substitute into the
9953 result
= make_tree_vec (len
);
9954 for (i
= 0; i
< len
; ++i
)
9956 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9960 TREE_VEC_ELT (result
, i
) = t
;
9961 if (t
== error_mark_node
)
9963 result
= error_mark_node
;
9968 /* Update ARGS to restore the substitution from parameter packs to
9969 their argument packs. */
9970 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9972 tree parm
= TREE_PURPOSE (pack
);
9974 if (TREE_CODE (parm
) == PARM_DECL
9975 || TREE_CODE (parm
) == FIELD_DECL
)
9976 register_local_specialization (TREE_TYPE (pack
), parm
);
9981 if (TREE_VALUE (pack
) == NULL_TREE
)
9984 template_parm_level_and_index (parm
, &level
, &idx
);
9986 /* Update the corresponding argument. */
9987 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9988 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9991 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9995 if (need_local_specializations
)
9997 delete local_specializations
;
9998 local_specializations
= saved_local_specializations
;
10004 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10005 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10006 parameter packs; all parms generated from a function parameter pack will
10007 have the same DECL_PARM_INDEX. */
10010 get_pattern_parm (tree parm
, tree tmpl
)
10012 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10015 if (DECL_ARTIFICIAL (parm
))
10017 for (patparm
= DECL_ARGUMENTS (pattern
);
10018 patparm
; patparm
= DECL_CHAIN (patparm
))
10019 if (DECL_ARTIFICIAL (patparm
)
10020 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10025 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10026 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10027 gcc_assert (DECL_PARM_INDEX (patparm
)
10028 == DECL_PARM_INDEX (parm
));
10034 /* Substitute ARGS into the vector or list of template arguments T. */
10037 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10040 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10043 if (t
== error_mark_node
)
10044 return error_mark_node
;
10046 len
= TREE_VEC_LENGTH (t
);
10047 elts
= XALLOCAVEC (tree
, len
);
10049 for (i
= 0; i
< len
; i
++)
10051 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10054 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10055 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10056 else if (PACK_EXPANSION_P (orig_arg
))
10058 /* Substitute into an expansion expression. */
10059 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10061 if (TREE_CODE (new_arg
) == TREE_VEC
)
10062 /* Add to the expanded length adjustment the number of
10063 expanded arguments. We subtract one from this
10064 measurement, because the argument pack expression
10065 itself is already counted as 1 in
10066 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10067 the argument pack is empty. */
10068 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10070 else if (ARGUMENT_PACK_P (orig_arg
))
10072 /* Substitute into each of the arguments. */
10073 new_arg
= TYPE_P (orig_arg
)
10074 ? cxx_make_type (TREE_CODE (orig_arg
))
10075 : make_node (TREE_CODE (orig_arg
));
10077 SET_ARGUMENT_PACK_ARGS (
10079 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10080 args
, complain
, in_decl
));
10082 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10083 new_arg
= error_mark_node
;
10085 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10086 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10087 complain
, in_decl
);
10088 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10090 if (TREE_TYPE (new_arg
) == error_mark_node
)
10091 new_arg
= error_mark_node
;
10095 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10097 if (new_arg
== error_mark_node
)
10098 return error_mark_node
;
10101 if (new_arg
!= orig_arg
)
10108 /* Make space for the expanded arguments coming from template
10110 t
= make_tree_vec (len
+ expanded_len_adjust
);
10111 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10112 arguments for a member template.
10113 In that case each TREE_VEC in ORIG_T represents a level of template
10114 arguments, and ORIG_T won't carry any non defaulted argument count.
10115 It will rather be the nested TREE_VECs that will carry one.
10116 In other words, ORIG_T carries a non defaulted argument count only
10117 if it doesn't contain any nested TREE_VEC. */
10118 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10120 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10121 count
+= expanded_len_adjust
;
10122 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10124 for (i
= 0, out
= 0; i
< len
; i
++)
10126 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10127 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10128 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10132 /* Now expand the template argument pack "in place". */
10133 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10134 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10138 TREE_VEC_ELT (t
, out
) = elts
[i
];
10146 /* Return the result of substituting ARGS into the template parameters
10147 given by PARMS. If there are m levels of ARGS and m + n levels of
10148 PARMS, then the result will contain n levels of PARMS. For
10149 example, if PARMS is `template <class T> template <class U>
10150 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10151 result will be `template <int*, double, class V>'. */
10154 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10156 tree r
= NULL_TREE
;
10159 /* When substituting into a template, we must set
10160 PROCESSING_TEMPLATE_DECL as the template parameters may be
10161 dependent if they are based on one-another, and the dependency
10162 predicates are short-circuit outside of templates. */
10163 ++processing_template_decl
;
10165 for (new_parms
= &r
;
10166 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10167 new_parms
= &(TREE_CHAIN (*new_parms
)),
10168 parms
= TREE_CHAIN (parms
))
10171 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10174 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10178 if (parms
== error_mark_node
)
10181 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10183 if (tuple
== error_mark_node
)
10186 TREE_VEC_ELT (new_vec
, i
) =
10187 tsubst_template_parm (tuple
, args
, complain
);
10191 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10192 - TMPL_ARGS_DEPTH (args
)),
10193 new_vec
, NULL_TREE
);
10196 --processing_template_decl
;
10201 /* Return the result of substituting ARGS into one template parameter
10202 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10203 parameter and which TREE_PURPOSE is the default argument of the
10204 template parameter. */
10207 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10209 tree default_value
, parm_decl
;
10211 if (args
== NULL_TREE
10213 || t
== error_mark_node
)
10216 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10218 default_value
= TREE_PURPOSE (t
);
10219 parm_decl
= TREE_VALUE (t
);
10221 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10222 if (TREE_CODE (parm_decl
) == PARM_DECL
10223 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10224 parm_decl
= error_mark_node
;
10225 default_value
= tsubst_template_arg (default_value
, args
,
10226 complain
, NULL_TREE
);
10228 return build_tree_list (default_value
, parm_decl
);
10231 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10232 type T. If T is not an aggregate or enumeration type, it is
10233 handled as if by tsubst. IN_DECL is as for tsubst. If
10234 ENTERING_SCOPE is nonzero, T is the context for a template which
10235 we are presently tsubst'ing. Return the substituted value. */
10238 tsubst_aggr_type (tree t
,
10240 tsubst_flags_t complain
,
10242 int entering_scope
)
10244 if (t
== NULL_TREE
)
10247 switch (TREE_CODE (t
))
10250 if (TYPE_PTRMEMFUNC_P (t
))
10251 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10253 /* Else fall through. */
10254 case ENUMERAL_TYPE
:
10256 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10261 int saved_unevaluated_operand
;
10262 int saved_inhibit_evaluation_warnings
;
10264 /* In "sizeof(X<I>)" we need to evaluate "I". */
10265 saved_unevaluated_operand
= cp_unevaluated_operand
;
10266 cp_unevaluated_operand
= 0;
10267 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10268 c_inhibit_evaluation_warnings
= 0;
10270 /* First, determine the context for the type we are looking
10272 context
= TYPE_CONTEXT (t
);
10273 if (context
&& TYPE_P (context
))
10275 context
= tsubst_aggr_type (context
, args
, complain
,
10276 in_decl
, /*entering_scope=*/1);
10277 /* If context is a nested class inside a class template,
10278 it may still need to be instantiated (c++/33959). */
10279 context
= complete_type (context
);
10282 /* Then, figure out what arguments are appropriate for the
10283 type we are trying to find. For example, given:
10285 template <class T> struct S;
10286 template <class T, class U> void f(T, U) { S<U> su; }
10288 and supposing that we are instantiating f<int, double>,
10289 then our ARGS will be {int, double}, but, when looking up
10290 S we only want {double}. */
10291 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10292 complain
, in_decl
);
10293 if (argvec
== error_mark_node
)
10294 r
= error_mark_node
;
10297 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10298 entering_scope
, complain
);
10299 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10302 cp_unevaluated_operand
= saved_unevaluated_operand
;
10303 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10308 /* This is not a template type, so there's nothing to do. */
10312 return tsubst (t
, args
, complain
, in_decl
);
10316 /* Substitute into the default argument ARG (a default argument for
10317 FN), which has the indicated TYPE. */
10320 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10322 tree saved_class_ptr
= NULL_TREE
;
10323 tree saved_class_ref
= NULL_TREE
;
10324 int errs
= errorcount
+ sorrycount
;
10326 /* This can happen in invalid code. */
10327 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10330 /* This default argument came from a template. Instantiate the
10331 default argument here, not in tsubst. In the case of
10340 we must be careful to do name lookup in the scope of S<T>,
10341 rather than in the current class. */
10342 push_access_scope (fn
);
10343 /* The "this" pointer is not valid in a default argument. */
10346 saved_class_ptr
= current_class_ptr
;
10347 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10348 saved_class_ref
= current_class_ref
;
10349 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10352 push_deferring_access_checks(dk_no_deferred
);
10353 /* The default argument expression may cause implicitly defined
10354 member functions to be synthesized, which will result in garbage
10355 collection. We must treat this situation as if we were within
10356 the body of function so as to avoid collecting live data on the
10359 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10360 complain
, NULL_TREE
,
10361 /*integral_constant_expression_p=*/false);
10363 pop_deferring_access_checks();
10365 /* Restore the "this" pointer. */
10368 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10369 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10372 if (errorcount
+sorrycount
> errs
10373 && (complain
& tf_warning_or_error
))
10374 inform (input_location
,
10375 " when instantiating default argument for call to %D", fn
);
10377 /* Make sure the default argument is reasonable. */
10378 arg
= check_default_argument (type
, arg
, complain
);
10380 pop_access_scope (fn
);
10385 /* Substitute into all the default arguments for FN. */
10388 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10393 tmpl_args
= DECL_TI_ARGS (fn
);
10395 /* If this function is not yet instantiated, we certainly don't need
10396 its default arguments. */
10397 if (uses_template_parms (tmpl_args
))
10399 /* Don't do this again for clones. */
10400 if (DECL_CLONED_FUNCTION_P (fn
))
10403 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10405 arg
= TREE_CHAIN (arg
))
10406 if (TREE_PURPOSE (arg
))
10407 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10409 TREE_PURPOSE (arg
),
10413 /* Substitute the ARGS into the T, which is a _DECL. Return the
10414 result of the substitution. Issue error and warning messages under
10415 control of COMPLAIN. */
10418 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10420 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10421 location_t saved_loc
;
10422 tree r
= NULL_TREE
;
10424 hashval_t hash
= 0;
10426 /* Set the filename and linenumber to improve error-reporting. */
10427 saved_loc
= input_location
;
10428 input_location
= DECL_SOURCE_LOCATION (t
);
10430 switch (TREE_CODE (t
))
10432 case TEMPLATE_DECL
:
10434 /* We can get here when processing a member function template,
10435 member class template, or template template parameter. */
10436 tree decl
= DECL_TEMPLATE_RESULT (t
);
10441 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10443 /* Template template parameter is treated here. */
10444 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10445 if (new_type
== error_mark_node
)
10446 RETURN (error_mark_node
);
10447 /* If we get a real template back, return it. This can happen in
10448 the context of most_specialized_class. */
10449 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10453 DECL_CHAIN (r
) = NULL_TREE
;
10454 TREE_TYPE (r
) = new_type
;
10455 DECL_TEMPLATE_RESULT (r
)
10456 = build_decl (DECL_SOURCE_LOCATION (decl
),
10457 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10458 DECL_TEMPLATE_PARMS (r
)
10459 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10461 TYPE_NAME (new_type
) = r
;
10465 /* We might already have an instance of this template.
10466 The ARGS are for the surrounding class type, so the
10467 full args contain the tsubst'd args for the context,
10468 plus the innermost args from the template decl. */
10469 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10470 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10471 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10472 /* Because this is a template, the arguments will still be
10473 dependent, even after substitution. If
10474 PROCESSING_TEMPLATE_DECL is not set, the dependency
10475 predicates will short-circuit. */
10476 ++processing_template_decl
;
10477 full_args
= tsubst_template_args (tmpl_args
, args
,
10478 complain
, in_decl
);
10479 --processing_template_decl
;
10480 if (full_args
== error_mark_node
)
10481 RETURN (error_mark_node
);
10483 /* If this is a default template template argument,
10484 tsubst might not have changed anything. */
10485 if (full_args
== tmpl_args
)
10488 hash
= hash_tmpl_and_args (t
, full_args
);
10489 spec
= retrieve_specialization (t
, full_args
, hash
);
10490 if (spec
!= NULL_TREE
)
10496 /* Make a new template decl. It will be similar to the
10497 original, but will record the current template arguments.
10498 We also create a new function declaration, which is just
10499 like the old one, but points to this new template, rather
10500 than the old one. */
10502 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10503 DECL_CHAIN (r
) = NULL_TREE
;
10505 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10507 if (TREE_CODE (decl
) == TYPE_DECL
10508 && !TYPE_DECL_ALIAS_P (decl
))
10511 ++processing_template_decl
;
10512 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10513 --processing_template_decl
;
10514 if (new_type
== error_mark_node
)
10515 RETURN (error_mark_node
);
10517 TREE_TYPE (r
) = new_type
;
10518 /* For a partial specialization, we need to keep pointing to
10519 the primary template. */
10520 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10521 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10522 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10523 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10524 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10529 ++processing_template_decl
;
10530 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10531 --processing_template_decl
;
10532 if (new_decl
== error_mark_node
)
10533 RETURN (error_mark_node
);
10535 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10536 DECL_TI_TEMPLATE (new_decl
) = r
;
10537 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10538 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10539 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10542 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10543 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10544 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10546 /* The template parameters for this new template are all the
10547 template parameters for the old template, except the
10548 outermost level of parameters. */
10549 DECL_TEMPLATE_PARMS (r
)
10550 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10553 if (PRIMARY_TEMPLATE_P (t
))
10554 DECL_PRIMARY_TEMPLATE (r
) = r
;
10556 if (TREE_CODE (decl
) != TYPE_DECL
&& TREE_CODE (decl
) != VAR_DECL
)
10557 /* Record this non-type partial instantiation. */
10558 register_specialization (r
, t
,
10559 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10564 case FUNCTION_DECL
:
10567 tree argvec
= NULL_TREE
;
10575 /* Nobody should be tsubst'ing into non-template functions. */
10576 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10578 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10583 /* If T is not dependent, just return it. We have to
10584 increment PROCESSING_TEMPLATE_DECL because
10585 value_dependent_expression_p assumes that nothing is
10586 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10587 ++processing_template_decl
;
10588 dependent_p
= value_dependent_expression_p (t
);
10589 --processing_template_decl
;
10593 /* Calculate the most general template of which R is a
10594 specialization, and the complete set of arguments used to
10596 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10597 argvec
= tsubst_template_args (DECL_TI_ARGS
10598 (DECL_TEMPLATE_RESULT
10599 (DECL_TI_TEMPLATE (t
))),
10600 args
, complain
, in_decl
);
10601 if (argvec
== error_mark_node
)
10602 RETURN (error_mark_node
);
10604 /* Check to see if we already have this specialization. */
10605 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10606 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10614 /* We can see more levels of arguments than parameters if
10615 there was a specialization of a member template, like
10618 template <class T> struct S { template <class U> void f(); }
10619 template <> template <class U> void S<int>::f(U);
10621 Here, we'll be substituting into the specialization,
10622 because that's where we can find the code we actually
10623 want to generate, but we'll have enough arguments for
10624 the most general template.
10626 We also deal with the peculiar case:
10628 template <class T> struct S {
10629 template <class U> friend void f();
10631 template <class U> void f() {}
10633 template void f<double>();
10635 Here, the ARGS for the instantiation of will be {int,
10636 double}. But, we only need as many ARGS as there are
10637 levels of template parameters in CODE_PATTERN. We are
10638 careful not to get fooled into reducing the ARGS in
10641 template <class T> struct S { template <class U> void f(U); }
10642 template <class T> template <> void S<T>::f(int) {}
10644 which we can spot because the pattern will be a
10645 specialization in this case. */
10646 args_depth
= TMPL_ARGS_DEPTH (args
);
10648 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10649 if (args_depth
> parms_depth
10650 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10651 args
= get_innermost_template_args (args
, parms_depth
);
10655 /* This special case arises when we have something like this:
10657 template <class T> struct S {
10658 friend void f<int>(int, double);
10661 Here, the DECL_TI_TEMPLATE for the friend declaration
10662 will be an IDENTIFIER_NODE. We are being called from
10663 tsubst_friend_function, and we want only to create a
10664 new decl (R) with appropriate types so that we can call
10665 determine_specialization. */
10666 gen_tmpl
= NULL_TREE
;
10669 if (DECL_CLASS_SCOPE_P (t
))
10671 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10675 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10676 complain
, t
, /*entering_scope=*/1);
10681 ctx
= DECL_CONTEXT (t
);
10683 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10684 if (type
== error_mark_node
)
10685 RETURN (error_mark_node
);
10687 /* If we hit excessive deduction depth, the type is bogus even if
10688 it isn't error_mark_node, so don't build a decl. */
10689 if (excessive_deduction_depth
)
10690 RETURN (error_mark_node
);
10692 /* We do NOT check for matching decls pushed separately at this
10693 point, as they may not represent instantiations of this
10694 template, and in any case are considered separate under the
10697 DECL_USE_TEMPLATE (r
) = 0;
10698 TREE_TYPE (r
) = type
;
10699 /* Clear out the mangled name and RTL for the instantiation. */
10700 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10701 SET_DECL_RTL (r
, NULL
);
10702 /* Leave DECL_INITIAL set on deleted instantiations. */
10703 if (!DECL_DELETED_FN (r
))
10704 DECL_INITIAL (r
) = NULL_TREE
;
10705 DECL_CONTEXT (r
) = ctx
;
10707 /* OpenMP UDRs have the only argument a reference to the declared
10708 type. We want to diagnose if the declared type is a reference,
10709 which is invalid, but as references to references are usually
10710 quietly merged, diagnose it here. */
10711 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10714 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10715 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10716 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10717 error_at (DECL_SOURCE_LOCATION (t
),
10718 "reference type %qT in "
10719 "%<#pragma omp declare reduction%>", argtype
);
10720 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10721 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10725 if (member
&& DECL_CONV_FN_P (r
))
10726 /* Type-conversion operator. Reconstruct the name, in
10727 case it's the name of one of the template's parameters. */
10728 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10730 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10732 DECL_RESULT (r
) = NULL_TREE
;
10734 TREE_STATIC (r
) = 0;
10735 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10736 DECL_EXTERNAL (r
) = 1;
10737 /* If this is an instantiation of a function with internal
10738 linkage, we already know what object file linkage will be
10739 assigned to the instantiation. */
10740 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10741 DECL_DEFER_OUTPUT (r
) = 0;
10742 DECL_CHAIN (r
) = NULL_TREE
;
10743 DECL_PENDING_INLINE_INFO (r
) = 0;
10744 DECL_PENDING_INLINE_P (r
) = 0;
10745 DECL_SAVED_TREE (r
) = NULL_TREE
;
10746 DECL_STRUCT_FUNCTION (r
) = NULL
;
10748 /* We'll re-clone as appropriate in instantiate_template. */
10749 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10751 /* If we aren't complaining now, return on error before we register
10752 the specialization so that we'll complain eventually. */
10753 if ((complain
& tf_error
) == 0
10754 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10755 && !grok_op_properties (r
, /*complain=*/false))
10756 RETURN (error_mark_node
);
10758 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10759 this in the special friend case mentioned above where
10760 GEN_TMPL is NULL. */
10763 DECL_TEMPLATE_INFO (r
)
10764 = build_template_info (gen_tmpl
, argvec
);
10765 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10768 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10770 /* We instantiated this while substituting into
10771 the type earlier (template/friend54.C). */
10774 /* We're not supposed to instantiate default arguments
10775 until they are called, for a template. But, for a
10778 template <class T> void f ()
10779 { extern void g(int i = T()); }
10781 we should do the substitution when the template is
10782 instantiated. We handle the member function case in
10783 instantiate_class_template since the default arguments
10784 might refer to other members of the class. */
10786 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10787 && !uses_template_parms (argvec
))
10788 tsubst_default_arguments (r
, complain
);
10791 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10793 /* Copy the list of befriending classes. */
10794 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10796 friends
= &TREE_CHAIN (*friends
))
10798 *friends
= copy_node (*friends
);
10799 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10804 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10806 maybe_retrofit_in_chrg (r
);
10807 if (DECL_CONSTRUCTOR_P (r
))
10808 grok_ctor_properties (ctx
, r
);
10809 if (DECL_INHERITED_CTOR_BASE (r
))
10810 deduce_inheriting_ctor (r
);
10811 /* If this is an instantiation of a member template, clone it.
10812 If it isn't, that'll be handled by
10813 clone_constructors_and_destructors. */
10814 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10815 clone_function_decl (r
, /*update_method_vec_p=*/0);
10817 else if ((complain
& tf_error
) != 0
10818 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10819 && !grok_op_properties (r
, /*complain=*/true))
10820 RETURN (error_mark_node
);
10822 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10823 SET_DECL_FRIEND_CONTEXT (r
,
10824 tsubst (DECL_FRIEND_CONTEXT (t
),
10825 args
, complain
, in_decl
));
10827 /* Possibly limit visibility based on template args. */
10828 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10829 if (DECL_VISIBILITY_SPECIFIED (t
))
10831 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10832 DECL_ATTRIBUTES (r
)
10833 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10835 determine_visibility (r
);
10836 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10837 && !processing_template_decl
)
10838 defaulted_late_check (r
);
10840 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10841 args
, complain
, in_decl
);
10847 tree type
= NULL_TREE
;
10849 tree expanded_types
= NULL_TREE
;
10850 tree prev_r
= NULL_TREE
;
10851 tree first_r
= NULL_TREE
;
10853 if (DECL_PACK_P (t
))
10855 /* If there is a local specialization that isn't a
10856 parameter pack, it means that we're doing a "simple"
10857 substitution from inside tsubst_pack_expansion. Just
10858 return the local specialization (which will be a single
10860 tree spec
= retrieve_local_specialization (t
);
10862 && TREE_CODE (spec
) == PARM_DECL
10863 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10866 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10867 the parameters in this function parameter pack. */
10868 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10869 complain
, in_decl
);
10870 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10872 len
= TREE_VEC_LENGTH (expanded_types
);
10874 /* Zero-length parameter packs are boring. Just substitute
10877 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10882 /* All we did was update the type. Make a note of that. */
10883 type
= expanded_types
;
10884 expanded_types
= NULL_TREE
;
10888 /* Loop through all of the parameters we'll build. When T is
10889 a function parameter pack, LEN is the number of expanded
10890 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10892 for (i
= 0; i
< len
; ++i
)
10896 if (DECL_TEMPLATE_PARM_P (t
))
10897 SET_DECL_TEMPLATE_PARM_P (r
);
10899 if (expanded_types
)
10900 /* We're on the Ith parameter of the function parameter
10903 /* Get the Ith type. */
10904 type
= TREE_VEC_ELT (expanded_types
, i
);
10906 /* Rename the parameter to include the index. */
10908 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10911 /* We're dealing with a normal parameter. */
10912 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10914 type
= type_decays_to (type
);
10915 TREE_TYPE (r
) = type
;
10916 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10918 if (DECL_INITIAL (r
))
10920 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10921 DECL_INITIAL (r
) = TREE_TYPE (r
);
10923 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10924 complain
, in_decl
);
10927 DECL_CONTEXT (r
) = NULL_TREE
;
10929 if (!DECL_TEMPLATE_PARM_P (r
))
10930 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10932 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10933 args
, complain
, in_decl
);
10935 /* Keep track of the first new parameter we
10936 generate. That's what will be returned to the
10941 /* Build a proper chain of parameters when substituting
10942 into a function parameter pack. */
10944 DECL_CHAIN (prev_r
) = r
;
10947 /* If cp_unevaluated_operand is set, we're just looking for a
10948 single dummy parameter, so don't keep going. */
10949 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10950 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10951 complain
, DECL_CHAIN (t
));
10953 /* FIRST_R contains the start of the chain we've built. */
10960 tree type
= NULL_TREE
;
10961 tree vec
= NULL_TREE
;
10962 tree expanded_types
= NULL_TREE
;
10965 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
10967 /* This field is a lambda capture pack. Return a TREE_VEC of
10968 the expanded fields to instantiate_class_template_1 and
10969 store them in the specializations hash table as a
10970 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
10971 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10972 complain
, in_decl
);
10973 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10975 len
= TREE_VEC_LENGTH (expanded_types
);
10976 vec
= make_tree_vec (len
);
10980 /* All we did was update the type. Make a note of that. */
10981 type
= expanded_types
;
10982 expanded_types
= NULL_TREE
;
10986 for (int i
= 0; i
< len
; ++i
)
10989 if (expanded_types
)
10991 type
= TREE_VEC_ELT (expanded_types
, i
);
10993 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10996 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10998 if (type
== error_mark_node
)
10999 RETURN (error_mark_node
);
11000 TREE_TYPE (r
) = type
;
11001 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11003 if (DECL_C_BIT_FIELD (r
))
11004 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11005 non-bit-fields DECL_INITIAL is a non-static data member
11006 initializer, which gets deferred instantiation. */
11008 = tsubst_expr (DECL_INITIAL (t
), args
,
11010 /*integral_constant_expression_p=*/true);
11011 else if (DECL_INITIAL (t
))
11013 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11014 NSDMI in perform_member_init. Still set DECL_INITIAL
11015 so that we know there is one. */
11016 DECL_INITIAL (r
) = void_node
;
11017 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11018 retrofit_lang_decl (r
);
11019 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11021 /* We don't have to set DECL_CONTEXT here; it is set by
11022 finish_member_declaration. */
11023 DECL_CHAIN (r
) = NULL_TREE
;
11025 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11026 args
, complain
, in_decl
);
11029 TREE_VEC_ELT (vec
, i
) = r
;
11035 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11036 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11037 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11038 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11039 TREE_TYPE (pack
) = tpack
;
11040 register_specialization (pack
, t
, args
, false, 0);
11046 /* We reach here only for member using decls. We also need to check
11047 uses_template_parms because DECL_DEPENDENT_P is not set for a
11048 using-declaration that designates a member of the current
11049 instantiation (c++/53549). */
11050 if (DECL_DEPENDENT_P (t
)
11051 || uses_template_parms (USING_DECL_SCOPE (t
)))
11053 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11054 complain
, in_decl
);
11055 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11056 r
= do_class_using_decl (inst_scope
, name
);
11058 r
= error_mark_node
;
11061 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11062 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11068 DECL_CHAIN (r
) = NULL_TREE
;
11075 tree argvec
= NULL_TREE
;
11076 tree gen_tmpl
= NULL_TREE
;
11078 tree tmpl
= NULL_TREE
;
11080 tree type
= NULL_TREE
;
11083 if (TREE_TYPE (t
) == error_mark_node
)
11084 RETURN (error_mark_node
);
11086 if (TREE_CODE (t
) == TYPE_DECL
11087 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11089 /* If this is the canonical decl, we don't have to
11090 mess with instantiations, and often we can't (for
11091 typename, template type parms and such). Note that
11092 TYPE_NAME is not correct for the above test if
11093 we've copied the type for a typedef. */
11094 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11095 if (type
== error_mark_node
)
11096 RETURN (error_mark_node
);
11097 r
= TYPE_NAME (type
);
11101 /* Check to see if we already have the specialization we
11104 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11106 /* T is a static data member or namespace-scope entity.
11107 We have to substitute into namespace-scope variables
11108 (even though such entities are never templates) because
11111 template <class T> void f() { extern T t; }
11113 where the entity referenced is not known until
11114 instantiation time. */
11116 ctx
= DECL_CONTEXT (t
);
11117 if (DECL_CLASS_SCOPE_P (t
))
11119 ctx
= tsubst_aggr_type (ctx
, args
,
11121 in_decl
, /*entering_scope=*/1);
11122 /* If CTX is unchanged, then T is in fact the
11123 specialization we want. That situation occurs when
11124 referencing a static data member within in its own
11125 class. We can use pointer equality, rather than
11126 same_type_p, because DECL_CONTEXT is always
11128 if (ctx
== DECL_CONTEXT (t
)
11129 && (TREE_CODE (t
) != TYPE_DECL
11130 /* ... unless T is a member template; in which
11131 case our caller can be willing to create a
11132 specialization of that template represented
11134 || !(DECL_TI_TEMPLATE (t
)
11135 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))))
11141 tmpl
= DECL_TI_TEMPLATE (t
);
11142 gen_tmpl
= most_general_template (tmpl
);
11143 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11144 if (argvec
== error_mark_node
)
11145 RETURN (error_mark_node
);
11146 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11147 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11152 /* A local variable. */
11154 /* Subsequent calls to pushdecl will fill this in. */
11156 spec
= retrieve_local_specialization (t
);
11158 /* If we already have the specialization we need, there is
11159 nothing more to do. */
11166 /* Create a new node for the specialization we need. */
11168 if (type
== NULL_TREE
)
11170 if (is_typedef_decl (t
))
11171 type
= DECL_ORIGINAL_TYPE (t
);
11173 type
= TREE_TYPE (t
);
11175 && VAR_HAD_UNKNOWN_BOUND (t
)
11176 && type
!= error_mark_node
)
11177 type
= strip_array_domain (type
);
11178 type
= tsubst (type
, args
, complain
, in_decl
);
11182 /* Even if the original location is out of scope, the
11183 newly substituted one is not. */
11184 DECL_DEAD_FOR_LOCAL (r
) = 0;
11185 DECL_INITIALIZED_P (r
) = 0;
11186 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11187 if (type
== error_mark_node
)
11188 RETURN (error_mark_node
);
11189 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11191 /* It may seem that this case cannot occur, since:
11196 declares a function, not a variable. However:
11199 template <typename T> void g() { T t; }
11200 template void g<f>();
11202 is an attempt to declare a variable with function
11204 error ("variable %qD has function type",
11205 /* R is not yet sufficiently initialized, so we
11206 just use its name. */
11208 RETURN (error_mark_node
);
11210 type
= complete_type (type
);
11211 /* Wait until cp_finish_decl to set this again, to handle
11212 circular dependency (template/instantiate6.C). */
11213 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11214 type
= check_var_type (DECL_NAME (r
), type
);
11216 if (DECL_HAS_VALUE_EXPR_P (t
))
11218 tree ve
= DECL_VALUE_EXPR (t
);
11219 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11220 /*constant_expression_p=*/false);
11221 if (REFERENCE_REF_P (ve
))
11223 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11224 ve
= TREE_OPERAND (ve
, 0);
11226 SET_DECL_VALUE_EXPR (r
, ve
);
11229 else if (DECL_SELF_REFERENCE_P (t
))
11230 SET_DECL_SELF_REFERENCE_P (r
);
11231 TREE_TYPE (r
) = type
;
11232 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11233 DECL_CONTEXT (r
) = ctx
;
11234 /* Clear out the mangled name and RTL for the instantiation. */
11235 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11236 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11237 SET_DECL_RTL (r
, NULL
);
11238 /* The initializer must not be expanded until it is required;
11239 see [temp.inst]. */
11240 DECL_INITIAL (r
) = NULL_TREE
;
11241 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11242 SET_DECL_RTL (r
, NULL
);
11243 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11246 /* Possibly limit visibility based on template args. */
11247 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11248 if (DECL_VISIBILITY_SPECIFIED (t
))
11250 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11251 DECL_ATTRIBUTES (r
)
11252 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11254 determine_visibility (r
);
11259 /* A static data member declaration is always marked
11260 external when it is declared in-class, even if an
11261 initializer is present. We mimic the non-template
11262 processing here. */
11263 DECL_EXTERNAL (r
) = 1;
11265 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11266 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11267 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11269 else if (!cp_unevaluated_operand
)
11270 register_local_specialization (r
, t
);
11272 DECL_CHAIN (r
) = NULL_TREE
;
11274 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11276 args
, complain
, in_decl
);
11278 /* Preserve a typedef that names a type. */
11279 if (is_typedef_decl (r
))
11281 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11282 set_underlying_type (r
);
11285 layout_decl (r
, 0);
11290 gcc_unreachable ();
11295 /* Restore the file and line information. */
11296 input_location
= saved_loc
;
11301 /* Substitute into the ARG_TYPES of a function type.
11302 If END is a TREE_CHAIN, leave it and any following types
11306 tsubst_arg_types (tree arg_types
,
11309 tsubst_flags_t complain
,
11312 tree remaining_arg_types
;
11313 tree type
= NULL_TREE
;
11315 tree expanded_args
= NULL_TREE
;
11318 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11321 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11322 args
, end
, complain
, in_decl
);
11323 if (remaining_arg_types
== error_mark_node
)
11324 return error_mark_node
;
11326 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11328 /* For a pack expansion, perform substitution on the
11329 entire expression. Later on, we'll handle the arguments
11331 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11332 args
, complain
, in_decl
);
11334 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11335 /* So that we'll spin through the parameters, one by one. */
11336 i
= TREE_VEC_LENGTH (expanded_args
);
11339 /* We only partially substituted into the parameter
11340 pack. Our type is TYPE_PACK_EXPANSION. */
11341 type
= expanded_args
;
11342 expanded_args
= NULL_TREE
;
11350 type
= TREE_VEC_ELT (expanded_args
, i
);
11352 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11354 if (type
== error_mark_node
)
11355 return error_mark_node
;
11356 if (VOID_TYPE_P (type
))
11358 if (complain
& tf_error
)
11360 error ("invalid parameter type %qT", type
);
11362 error ("in declaration %q+D", in_decl
);
11364 return error_mark_node
;
11367 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11368 return error_mark_node
;
11370 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11371 top-level qualifiers as required. */
11372 type
= cv_unqualified (type_decays_to (type
));
11374 /* We do not substitute into default arguments here. The standard
11375 mandates that they be instantiated only when needed, which is
11376 done in build_over_call. */
11377 default_arg
= TREE_PURPOSE (arg_types
);
11379 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11381 /* We've instantiated a template before its default arguments
11382 have been parsed. This can happen for a nested template
11383 class, and is not an error unless we require the default
11384 argument in a call of this function. */
11385 remaining_arg_types
=
11386 tree_cons (default_arg
, type
, remaining_arg_types
);
11387 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11390 remaining_arg_types
=
11391 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11394 return remaining_arg_types
;
11397 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11398 *not* handle the exception-specification for FNTYPE, because the
11399 initial substitution of explicitly provided template parameters
11400 during argument deduction forbids substitution into the
11401 exception-specification:
11405 All references in the function type of the function template to the
11406 corresponding template parameters are replaced by the specified tem-
11407 plate argument values. If a substitution in a template parameter or
11408 in the function type of the function template results in an invalid
11409 type, type deduction fails. [Note: The equivalent substitution in
11410 exception specifications is done only when the function is instanti-
11411 ated, at which point a program is ill-formed if the substitution
11412 results in an invalid type.] */
11415 tsubst_function_type (tree t
,
11417 tsubst_flags_t complain
,
11421 tree arg_types
= NULL_TREE
;
11424 /* The TYPE_CONTEXT is not used for function/method types. */
11425 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11427 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
11429 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
11431 if (late_return_type_p
)
11433 /* Substitute the argument types. */
11434 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11435 complain
, in_decl
);
11436 if (arg_types
== error_mark_node
)
11437 return error_mark_node
;
11439 tree save_ccp
= current_class_ptr
;
11440 tree save_ccr
= current_class_ref
;
11441 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
11442 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
11443 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
11446 /* DR 1207: 'this' is in scope in the trailing return type. */
11447 inject_this_parameter (this_type
, cp_type_quals (this_type
));
11450 /* Substitute the return type. */
11451 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11455 current_class_ptr
= save_ccp
;
11456 current_class_ref
= save_ccr
;
11460 /* Substitute the return type. */
11461 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11463 if (return_type
== error_mark_node
)
11464 return error_mark_node
;
11465 /* DR 486 clarifies that creation of a function type with an
11466 invalid return type is a deduction failure. */
11467 if (TREE_CODE (return_type
) == ARRAY_TYPE
11468 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11470 if (complain
& tf_error
)
11472 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11473 error ("function returning an array");
11475 error ("function returning a function");
11477 return error_mark_node
;
11480 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11481 return error_mark_node
;
11483 if (!late_return_type_p
)
11485 /* Substitute the argument types. */
11486 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11487 complain
, in_decl
);
11488 if (arg_types
== error_mark_node
)
11489 return error_mark_node
;
11492 /* Construct a new type node and return it. */
11493 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11495 fntype
= build_function_type (return_type
, arg_types
);
11496 fntype
= apply_memfn_quals (fntype
,
11497 type_memfn_quals (t
),
11498 type_memfn_rqual (t
));
11502 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11503 /* Don't pick up extra function qualifiers from the basetype. */
11504 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11505 if (! MAYBE_CLASS_TYPE_P (r
))
11509 Type deduction may fail for any of the following
11512 -- Attempting to create "pointer to member of T" when T
11513 is not a class type. */
11514 if (complain
& tf_error
)
11515 error ("creating pointer to member function of non-class type %qT",
11517 return error_mark_node
;
11520 fntype
= build_method_type_directly (r
, return_type
,
11521 TREE_CHAIN (arg_types
));
11522 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11524 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11526 if (late_return_type_p
)
11527 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
11532 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11533 ARGS into that specification, and return the substituted
11534 specification. If there is no specification, return NULL_TREE. */
11537 tsubst_exception_specification (tree fntype
,
11539 tsubst_flags_t complain
,
11546 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11547 new_specs
= NULL_TREE
;
11548 if (specs
&& TREE_PURPOSE (specs
))
11550 /* A noexcept-specifier. */
11551 tree expr
= TREE_PURPOSE (specs
);
11552 if (TREE_CODE (expr
) == INTEGER_CST
)
11556 /* Defer instantiation of noexcept-specifiers to avoid
11557 excessive instantiations (c++/49107). */
11558 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11559 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11561 /* We already partially instantiated this member template,
11562 so combine the new args with the old. */
11563 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11564 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11565 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11566 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11570 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11571 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11575 new_specs
= tsubst_copy_and_build
11576 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11577 /*integral_constant_expression_p=*/true);
11578 new_specs
= build_noexcept_spec (new_specs
, complain
);
11582 if (! TREE_VALUE (specs
))
11589 tree expanded_specs
= NULL_TREE
;
11591 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11593 /* Expand the pack expansion type. */
11594 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11598 if (expanded_specs
== error_mark_node
)
11599 return error_mark_node
;
11600 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11601 len
= TREE_VEC_LENGTH (expanded_specs
);
11604 /* We're substituting into a member template, so
11605 we got a TYPE_PACK_EXPANSION back. Add that
11606 expansion and move on. */
11607 gcc_assert (TREE_CODE (expanded_specs
)
11608 == TYPE_PACK_EXPANSION
);
11609 new_specs
= add_exception_specifier (new_specs
,
11612 specs
= TREE_CHAIN (specs
);
11617 for (i
= 0; i
< len
; ++i
)
11619 if (expanded_specs
)
11620 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11622 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11623 if (spec
== error_mark_node
)
11625 new_specs
= add_exception_specifier (new_specs
, spec
,
11629 specs
= TREE_CHAIN (specs
);
11635 /* Take the tree structure T and replace template parameters used
11636 therein with the argument vector ARGS. IN_DECL is an associated
11637 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11638 Issue error and warning messages under control of COMPLAIN. Note
11639 that we must be relatively non-tolerant of extensions here, in
11640 order to preserve conformance; if we allow substitutions that
11641 should not be allowed, we may allow argument deductions that should
11642 not succeed, and therefore report ambiguous overload situations
11643 where there are none. In theory, we could allow the substitution,
11644 but indicate that it should have failed, and allow our caller to
11645 make sure that the right thing happens, but we don't try to do this
11648 This function is used for dealing with types, decls and the like;
11649 for expressions, use tsubst_expr or tsubst_copy. */
11652 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11654 enum tree_code code
;
11655 tree type
, r
= NULL_TREE
;
11657 if (t
== NULL_TREE
|| t
== error_mark_node
11658 || t
== integer_type_node
11659 || t
== void_type_node
11660 || t
== char_type_node
11661 || t
== unknown_type_node
11662 || TREE_CODE (t
) == NAMESPACE_DECL
11663 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11667 return tsubst_decl (t
, args
, complain
);
11669 if (args
== NULL_TREE
)
11672 code
= TREE_CODE (t
);
11674 if (code
== IDENTIFIER_NODE
)
11675 type
= IDENTIFIER_TYPE_VALUE (t
);
11677 type
= TREE_TYPE (t
);
11679 gcc_assert (type
!= unknown_type_node
);
11681 /* Reuse typedefs. We need to do this to handle dependent attributes,
11682 such as attribute aligned. */
11684 && typedef_variant_p (t
))
11686 tree decl
= TYPE_NAME (t
);
11688 if (alias_template_specialization_p (t
))
11690 /* DECL represents an alias template and we want to
11692 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11693 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11694 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11696 else if (DECL_CLASS_SCOPE_P (decl
)
11697 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11698 && uses_template_parms (DECL_CONTEXT (decl
)))
11700 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11701 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11702 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11704 else if (DECL_FUNCTION_SCOPE_P (decl
)
11705 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11706 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11707 r
= retrieve_local_specialization (decl
);
11709 /* The typedef is from a non-template context. */
11715 r
= cp_build_qualified_type_real
11716 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11717 complain
| tf_ignore_bad_quals
);
11722 /* We don't have an instantiation yet, so drop the typedef. */
11723 int quals
= cp_type_quals (t
);
11724 t
= DECL_ORIGINAL_TYPE (decl
);
11725 t
= cp_build_qualified_type_real (t
, quals
,
11726 complain
| tf_ignore_bad_quals
);
11731 && code
!= TYPENAME_TYPE
11732 && code
!= TEMPLATE_TYPE_PARM
11733 && code
!= IDENTIFIER_NODE
11734 && code
!= FUNCTION_TYPE
11735 && code
!= METHOD_TYPE
)
11736 type
= tsubst (type
, args
, complain
, in_decl
);
11737 if (type
== error_mark_node
)
11738 return error_mark_node
;
11744 case ENUMERAL_TYPE
:
11745 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11746 /*entering_scope=*/0);
11749 case IDENTIFIER_NODE
:
11760 if (t
== integer_type_node
)
11763 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11764 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11768 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11770 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11771 /*integral_constant_expression_p=*/false);
11773 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11775 if (TREE_CODE (max
) == NOP_EXPR
11776 && TREE_SIDE_EFFECTS (omax
)
11777 && !TREE_TYPE (max
))
11778 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11780 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11781 with TREE_SIDE_EFFECTS that indicates this is not an integral
11782 constant expression. */
11783 if (processing_template_decl
11784 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11786 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11787 TREE_SIDE_EFFECTS (max
) = 1;
11790 return compute_array_index_type (NULL_TREE
, max
, complain
);
11793 case TEMPLATE_TYPE_PARM
:
11794 case TEMPLATE_TEMPLATE_PARM
:
11795 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11796 case TEMPLATE_PARM_INDEX
:
11801 tree arg
= NULL_TREE
;
11805 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11806 template_parm_level_and_index (t
, &level
, &idx
);
11808 levels
= TMPL_ARGS_DEPTH (args
);
11809 if (level
<= levels
)
11811 arg
= TMPL_ARG (args
, level
, idx
);
11813 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11815 /* See through ARGUMENT_PACK_SELECT arguments. */
11816 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11817 /* If the selected argument is an expansion E, that most
11818 likely means we were called from
11819 gen_elem_of_pack_expansion_instantiation during the
11820 substituting of pack an argument pack (which Ith
11821 element is a pack expansion, where I is
11822 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11823 In this case, the Ith element resulting from this
11824 substituting is going to be a pack expansion, which
11825 pattern is the pattern of E. Let's return the
11827 gen_elem_of_pack_expansion_instantiation will
11828 build the resulting pack expansion from it. */
11829 if (PACK_EXPANSION_P (arg
))
11830 arg
= PACK_EXPANSION_PATTERN (arg
);
11834 if (arg
== error_mark_node
)
11835 return error_mark_node
;
11836 else if (arg
!= NULL_TREE
)
11838 if (ARGUMENT_PACK_P (arg
))
11839 /* If ARG is an argument pack, we don't actually want to
11840 perform a substitution here, because substitutions
11841 for argument packs are only done
11842 element-by-element. We can get to this point when
11843 substituting the type of a non-type template
11844 parameter pack, when that type actually contains
11845 template parameter packs from an outer template, e.g.,
11847 template<typename... Types> struct A {
11848 template<Types... Values> struct B { };
11852 if (code
== TEMPLATE_TYPE_PARM
)
11855 gcc_assert (TYPE_P (arg
));
11857 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11859 return cp_build_qualified_type_real
11860 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11862 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11864 /* We are processing a type constructed from a
11865 template template parameter. */
11866 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11867 args
, complain
, in_decl
);
11868 if (argvec
== error_mark_node
)
11869 return error_mark_node
;
11871 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11872 || TREE_CODE (arg
) == TEMPLATE_DECL
11873 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11875 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11876 /* Consider this code:
11878 template <template <class> class Template>
11880 template <class Arg> using Bind = Template<Arg>;
11883 template <template <class> class Template, class Arg>
11884 using Instantiate = Template<Arg>; //#0
11886 template <template <class> class Template,
11889 Instantiate<Internal<Template>::template Bind,
11892 When #1 is parsed, the
11893 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11894 parameter `Template' in #0 matches the
11895 UNBOUND_CLASS_TEMPLATE representing the argument
11896 `Internal<Template>::template Bind'; We then want
11897 to assemble the type `Bind<Argument>' that can't
11898 be fully created right now, because
11899 `Internal<Template>' not being complete, the Bind
11900 template cannot be looked up in that context. So
11901 we need to "store" `Bind<Argument>' for later
11902 when the context of Bind becomes complete. Let's
11903 store that in a TYPENAME_TYPE. */
11904 return make_typename_type (TYPE_CONTEXT (arg
),
11905 build_nt (TEMPLATE_ID_EXPR
,
11906 TYPE_IDENTIFIER (arg
),
11911 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11912 are resolving nested-types in the signature of a
11913 member function templates. Otherwise ARG is a
11914 TEMPLATE_DECL and is the real template to be
11916 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11917 arg
= TYPE_NAME (arg
);
11919 r
= lookup_template_class (arg
,
11921 DECL_CONTEXT (arg
),
11922 /*entering_scope=*/0,
11924 return cp_build_qualified_type_real
11925 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
11928 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11929 return convert_from_reference (unshare_expr (arg
));
11933 /* This can happen during the attempted tsubst'ing in
11934 unify. This means that we don't yet have any information
11935 about the template parameter in question. */
11938 /* Early in template argument deduction substitution, we don't
11939 want to reduce the level of 'auto', or it will be confused
11940 with a normal template parm in subsequent deduction. */
11941 if (is_auto (t
) && (complain
& tf_partial
))
11944 /* If we get here, we must have been looking at a parm for a
11945 more deeply nested template. Make a new version of this
11946 template parameter, but with a lower level. */
11949 case TEMPLATE_TYPE_PARM
:
11950 case TEMPLATE_TEMPLATE_PARM
:
11951 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11952 if (cp_type_quals (t
))
11954 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11955 r
= cp_build_qualified_type_real
11956 (r
, cp_type_quals (t
),
11957 complain
| (code
== TEMPLATE_TYPE_PARM
11958 ? tf_ignore_bad_quals
: 0));
11963 TEMPLATE_TYPE_PARM_INDEX (r
)
11964 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11965 r
, levels
, args
, complain
);
11966 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11967 TYPE_MAIN_VARIANT (r
) = r
;
11968 TYPE_POINTER_TO (r
) = NULL_TREE
;
11969 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11971 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11972 /* We have reduced the level of the template
11973 template parameter, but not the levels of its
11974 template parameters, so canonical_type_parameter
11975 will not be able to find the canonical template
11976 template parameter for this level. Thus, we
11977 require structural equality checking to compare
11978 TEMPLATE_TEMPLATE_PARMs. */
11979 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11980 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11981 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11983 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11985 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11987 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11988 complain
, in_decl
);
11989 if (argvec
== error_mark_node
)
11990 return error_mark_node
;
11992 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11993 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
11998 case TEMPLATE_PARM_INDEX
:
11999 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
12003 gcc_unreachable ();
12011 tree purpose
, value
, chain
;
12013 if (t
== void_list_node
)
12016 purpose
= TREE_PURPOSE (t
);
12019 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
12020 if (purpose
== error_mark_node
)
12021 return error_mark_node
;
12023 value
= TREE_VALUE (t
);
12026 value
= tsubst (value
, args
, complain
, in_decl
);
12027 if (value
== error_mark_node
)
12028 return error_mark_node
;
12030 chain
= TREE_CHAIN (t
);
12031 if (chain
&& chain
!= void_type_node
)
12033 chain
= tsubst (chain
, args
, complain
, in_decl
);
12034 if (chain
== error_mark_node
)
12035 return error_mark_node
;
12037 if (purpose
== TREE_PURPOSE (t
)
12038 && value
== TREE_VALUE (t
)
12039 && chain
== TREE_CHAIN (t
))
12041 return hash_tree_cons (purpose
, value
, chain
);
12045 /* We should never be tsubsting a binfo. */
12046 gcc_unreachable ();
12049 /* A vector of template arguments. */
12050 gcc_assert (!type
);
12051 return tsubst_template_args (t
, args
, complain
, in_decl
);
12054 case REFERENCE_TYPE
:
12056 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12061 Type deduction may fail for any of the following
12064 -- Attempting to create a pointer to reference type.
12065 -- Attempting to create a reference to a reference type or
12066 a reference to void.
12068 Core issue 106 says that creating a reference to a reference
12069 during instantiation is no longer a cause for failure. We
12070 only enforce this check in strict C++98 mode. */
12071 if ((TREE_CODE (type
) == REFERENCE_TYPE
12072 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12073 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12075 static location_t last_loc
;
12077 /* We keep track of the last time we issued this error
12078 message to avoid spewing a ton of messages during a
12079 single bad template instantiation. */
12080 if (complain
& tf_error
12081 && last_loc
!= input_location
)
12083 if (VOID_TYPE_P (type
))
12084 error ("forming reference to void");
12085 else if (code
== POINTER_TYPE
)
12086 error ("forming pointer to reference type %qT", type
);
12088 error ("forming reference to reference type %qT", type
);
12089 last_loc
= input_location
;
12092 return error_mark_node
;
12094 else if (TREE_CODE (type
) == FUNCTION_TYPE
12095 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12096 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12098 if (complain
& tf_error
)
12100 if (code
== POINTER_TYPE
)
12101 error ("forming pointer to qualified function type %qT",
12104 error ("forming reference to qualified function type %qT",
12107 return error_mark_node
;
12109 else if (code
== POINTER_TYPE
)
12111 r
= build_pointer_type (type
);
12112 if (TREE_CODE (type
) == METHOD_TYPE
)
12113 r
= build_ptrmemfunc_type (r
);
12115 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12116 /* In C++0x, during template argument substitution, when there is an
12117 attempt to create a reference to a reference type, reference
12118 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12120 "If a template-argument for a template-parameter T names a type
12121 that is a reference to a type A, an attempt to create the type
12122 'lvalue reference to cv T' creates the type 'lvalue reference to
12123 A,' while an attempt to create the type type rvalue reference to
12124 cv T' creates the type T"
12126 r
= cp_build_reference_type
12128 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12130 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12131 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12133 if (cxx_dialect
>= cxx1y
12134 && !(TREE_CODE (t
) == REFERENCE_TYPE
&& REFERENCE_VLA_OK (t
))
12135 && array_of_runtime_bound_p (type
)
12136 && (flag_iso
|| warn_vla
> 0))
12138 if (complain
& tf_warning_or_error
)
12140 (input_location
, OPT_Wvla
,
12141 code
== REFERENCE_TYPE
12142 ? G_("cannot declare reference to array of runtime bound")
12143 : G_("cannot declare pointer to array of runtime bound"));
12145 r
= error_mark_node
;
12148 if (r
!= error_mark_node
)
12149 /* Will this ever be needed for TYPE_..._TO values? */
12156 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12157 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12161 Type deduction may fail for any of the following
12164 -- Attempting to create "pointer to member of T" when T
12165 is not a class type. */
12166 if (complain
& tf_error
)
12167 error ("creating pointer to member of non-class type %qT", r
);
12168 return error_mark_node
;
12170 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12172 if (complain
& tf_error
)
12173 error ("creating pointer to member reference type %qT", type
);
12174 return error_mark_node
;
12176 if (VOID_TYPE_P (type
))
12178 if (complain
& tf_error
)
12179 error ("creating pointer to member of type void");
12180 return error_mark_node
;
12182 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12183 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12185 /* The type of the implicit object parameter gets its
12186 cv-qualifiers from the FUNCTION_TYPE. */
12189 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12190 type_memfn_rqual (type
));
12191 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12192 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12196 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12200 case FUNCTION_TYPE
:
12205 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12206 if (fntype
== error_mark_node
)
12207 return error_mark_node
;
12209 /* Substitute the exception specification. */
12210 specs
= tsubst_exception_specification (t
, args
, complain
,
12211 in_decl
, /*defer_ok*/true);
12212 if (specs
== error_mark_node
)
12213 return error_mark_node
;
12215 fntype
= build_exception_variant (fntype
, specs
);
12220 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12221 if (domain
== error_mark_node
)
12222 return error_mark_node
;
12224 /* As an optimization, we avoid regenerating the array type if
12225 it will obviously be the same as T. */
12226 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12229 /* These checks should match the ones in create_array_type_for_decl.
12233 The deduction may fail for any of the following reasons:
12235 -- Attempting to create an array with an element type that
12236 is void, a function type, or a reference type, or [DR337]
12237 an abstract class type. */
12238 if (VOID_TYPE_P (type
)
12239 || TREE_CODE (type
) == FUNCTION_TYPE
12240 || (TREE_CODE (type
) == ARRAY_TYPE
12241 && TYPE_DOMAIN (type
) == NULL_TREE
)
12242 || TREE_CODE (type
) == REFERENCE_TYPE
)
12244 if (complain
& tf_error
)
12245 error ("creating array of %qT", type
);
12246 return error_mark_node
;
12249 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12250 return error_mark_node
;
12252 r
= build_cplus_array_type (type
, domain
);
12254 if (TYPE_USER_ALIGN (t
))
12256 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12257 TYPE_USER_ALIGN (r
) = 1;
12263 case TYPENAME_TYPE
:
12265 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12266 in_decl
, /*entering_scope=*/1);
12267 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12268 complain
, in_decl
);
12270 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12271 return error_mark_node
;
12273 if (!MAYBE_CLASS_TYPE_P (ctx
))
12275 if (complain
& tf_error
)
12276 error ("%qT is not a class, struct, or union type", ctx
);
12277 return error_mark_node
;
12279 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12281 /* Normally, make_typename_type does not require that the CTX
12282 have complete type in order to allow things like:
12284 template <class T> struct S { typename S<T>::X Y; };
12286 But, such constructs have already been resolved by this
12287 point, so here CTX really should have complete type, unless
12288 it's a partial instantiation. */
12289 ctx
= complete_type (ctx
);
12290 if (!COMPLETE_TYPE_P (ctx
))
12292 if (complain
& tf_error
)
12293 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12294 return error_mark_node
;
12298 f
= make_typename_type (ctx
, f
, typename_type
,
12299 complain
| tf_keep_type_decl
);
12300 if (f
== error_mark_node
)
12302 if (TREE_CODE (f
) == TYPE_DECL
)
12304 complain
|= tf_ignore_bad_quals
;
12308 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12310 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12312 if (complain
& tf_error
)
12313 error ("%qT resolves to %qT, which is not an enumeration type",
12316 return error_mark_node
;
12318 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12320 if (complain
& tf_error
)
12321 error ("%qT resolves to %qT, which is is not a class type",
12324 return error_mark_node
;
12328 return cp_build_qualified_type_real
12329 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12332 case UNBOUND_CLASS_TEMPLATE
:
12334 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12335 in_decl
, /*entering_scope=*/1);
12336 tree name
= TYPE_IDENTIFIER (t
);
12337 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12339 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12340 return error_mark_node
;
12343 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12344 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12351 ++cp_unevaluated_operand
;
12352 ++c_inhibit_evaluation_warnings
;
12354 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12356 /*integral_constant_expression_p=*/false);
12358 --cp_unevaluated_operand
;
12359 --c_inhibit_evaluation_warnings
;
12361 type
= finish_typeof (type
);
12362 return cp_build_qualified_type_real (type
,
12364 | cp_type_quals (type
),
12368 case DECLTYPE_TYPE
:
12372 ++cp_unevaluated_operand
;
12373 ++c_inhibit_evaluation_warnings
;
12375 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12376 complain
|tf_decltype
, in_decl
,
12377 /*function_p*/false,
12378 /*integral_constant_expression*/false);
12380 --cp_unevaluated_operand
;
12381 --c_inhibit_evaluation_warnings
;
12383 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12384 type
= lambda_capture_field_type (type
,
12385 DECLTYPE_FOR_INIT_CAPTURE (t
));
12386 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12387 type
= lambda_proxy_type (type
);
12390 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12391 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12393 /* In a template ~id could be either a complement expression
12394 or an unqualified-id naming a destructor; if instantiating
12395 it produces an expression, it's not an id-expression or
12398 type
= finish_decltype_type (type
, id
, complain
);
12400 return cp_build_qualified_type_real (type
,
12402 | cp_type_quals (type
),
12406 case UNDERLYING_TYPE
:
12408 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12409 complain
, in_decl
);
12410 return finish_underlying_type (type
);
12413 case TYPE_ARGUMENT_PACK
:
12414 case NONTYPE_ARGUMENT_PACK
:
12416 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12418 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12422 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12424 /* For template nontype argument packs, also substitute into
12426 if (code
== NONTYPE_ARGUMENT_PACK
)
12427 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12446 /* We should use one of the expression tsubsts for these codes. */
12447 gcc_unreachable ();
12450 sorry ("use of %qs in template", get_tree_code_name (code
));
12451 return error_mark_node
;
12455 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12456 type of the expression on the left-hand side of the "." or "->"
12460 tsubst_baselink (tree baselink
, tree object_type
,
12461 tree args
, tsubst_flags_t complain
, tree in_decl
)
12464 tree qualifying_scope
;
12467 tree template_args
= 0;
12468 bool template_id_p
= false;
12469 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12471 /* A baselink indicates a function from a base class. Both the
12472 BASELINK_ACCESS_BINFO and the base class referenced may
12473 indicate bases of the template class, rather than the
12474 instantiated class. In addition, lookups that were not
12475 ambiguous before may be ambiguous now. Therefore, we perform
12476 the lookup again. */
12477 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12478 qualifying_scope
= tsubst (qualifying_scope
, args
,
12479 complain
, in_decl
);
12480 fns
= BASELINK_FUNCTIONS (baselink
);
12481 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12482 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12484 template_id_p
= true;
12485 template_args
= TREE_OPERAND (fns
, 1);
12486 fns
= TREE_OPERAND (fns
, 0);
12488 template_args
= tsubst_template_args (template_args
, args
,
12489 complain
, in_decl
);
12491 name
= DECL_NAME (get_first_fn (fns
));
12492 if (IDENTIFIER_TYPENAME_P (name
))
12493 name
= mangle_conv_op_name_for_type (optype
);
12494 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12496 return error_mark_node
;
12498 /* If lookup found a single function, mark it as used at this
12499 point. (If it lookup found multiple functions the one selected
12500 later by overload resolution will be marked as used at that
12502 if (BASELINK_P (baselink
))
12503 fns
= BASELINK_FUNCTIONS (baselink
);
12504 if (!template_id_p
&& !really_overloaded_fn (fns
))
12505 mark_used (OVL_CURRENT (fns
));
12507 /* Add back the template arguments, if present. */
12508 if (BASELINK_P (baselink
) && template_id_p
)
12509 BASELINK_FUNCTIONS (baselink
)
12510 = build_nt (TEMPLATE_ID_EXPR
,
12511 BASELINK_FUNCTIONS (baselink
),
12513 /* Update the conversion operator type. */
12514 BASELINK_OPTYPE (baselink
) = optype
;
12517 object_type
= current_class_type
;
12520 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12526 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12527 true if the qualified-id will be a postfix-expression in-and-of
12528 itself; false if more of the postfix-expression follows the
12529 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12533 tsubst_qualified_id (tree qualified_id
, tree args
,
12534 tsubst_flags_t complain
, tree in_decl
,
12535 bool done
, bool address_p
)
12541 tree template_args
;
12542 location_t loc
= UNKNOWN_LOCATION
;
12544 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12546 /* Figure out what name to look up. */
12547 name
= TREE_OPERAND (qualified_id
, 1);
12548 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12550 is_template
= true;
12551 loc
= EXPR_LOCATION (name
);
12552 template_args
= TREE_OPERAND (name
, 1);
12554 template_args
= tsubst_template_args (template_args
, args
,
12555 complain
, in_decl
);
12556 name
= TREE_OPERAND (name
, 0);
12560 is_template
= false;
12561 template_args
= NULL_TREE
;
12564 /* Substitute into the qualifying scope. When there are no ARGS, we
12565 are just trying to simplify a non-dependent expression. In that
12566 case the qualifying scope may be dependent, and, in any case,
12567 substituting will not help. */
12568 scope
= TREE_OPERAND (qualified_id
, 0);
12571 scope
= tsubst (scope
, args
, complain
, in_decl
);
12572 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12577 if (dependent_scope_p (scope
))
12580 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12581 return build_qualified_name (NULL_TREE
, scope
, expr
,
12582 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12585 if (!BASELINK_P (name
) && !DECL_P (expr
))
12587 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12589 /* A BIT_NOT_EXPR is used to represent a destructor. */
12590 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12592 error ("qualifying type %qT does not match destructor name ~%qT",
12593 scope
, TREE_OPERAND (expr
, 0));
12594 expr
= error_mark_node
;
12597 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12598 /*is_type_p=*/0, false);
12601 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12602 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12603 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12605 if (complain
& tf_error
)
12607 error ("dependent-name %qE is parsed as a non-type, but "
12608 "instantiation yields a type", qualified_id
);
12609 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12611 return error_mark_node
;
12617 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12619 /* Remember that there was a reference to this entity. */
12623 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12625 if (complain
& tf_error
)
12626 qualified_name_lookup_error (scope
,
12627 TREE_OPERAND (qualified_id
, 1),
12628 expr
, input_location
);
12629 return error_mark_node
;
12633 expr
= lookup_template_function (expr
, template_args
);
12635 if (expr
== error_mark_node
&& complain
& tf_error
)
12636 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12637 expr
, input_location
);
12638 else if (TYPE_P (scope
))
12640 expr
= (adjust_result_of_qualified_name_lookup
12641 (expr
, scope
, current_nonlambda_class_type ()));
12642 expr
= (finish_qualified_id_expr
12643 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12644 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12645 /*template_arg_p=*/false, complain
));
12648 /* Expressions do not generally have reference type. */
12649 if (TREE_CODE (expr
) != SCOPE_REF
12650 /* However, if we're about to form a pointer-to-member, we just
12651 want the referenced member referenced. */
12652 && TREE_CODE (expr
) != OFFSET_REF
)
12653 expr
= convert_from_reference (expr
);
12658 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
12659 initializer, DECL is the substituted VAR_DECL. Other arguments are as
12663 tsubst_init (tree init
, tree decl
, tree args
,
12664 tsubst_flags_t complain
, tree in_decl
)
12669 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
12673 /* If we had an initializer but it
12674 instantiated to nothing,
12675 value-initialize the object. This will
12676 only occur when the initializer was a
12677 pack expansion where the parameter packs
12678 used in that expansion were of length
12680 init
= build_value_init (TREE_TYPE (decl
),
12682 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12683 init
= get_target_expr_sfinae (init
, complain
);
12689 /* Like tsubst, but deals with expressions. This function just replaces
12690 template parms; to finish processing the resultant expression, use
12691 tsubst_copy_and_build or tsubst_expr. */
12694 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12696 enum tree_code code
;
12699 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12702 code
= TREE_CODE (t
);
12707 r
= retrieve_local_specialization (t
);
12709 if (r
== NULL_TREE
)
12711 /* We get here for a use of 'this' in an NSDMI. */
12712 if (DECL_NAME (t
) == this_identifier
12713 && current_function_decl
12714 && DECL_CONSTRUCTOR_P (current_function_decl
))
12715 return current_class_ptr
;
12717 /* This can happen for a parameter name used later in a function
12718 declaration (such as in a late-specified return type). Just
12719 make a dummy decl, since it's only used for its type. */
12720 gcc_assert (cp_unevaluated_operand
!= 0);
12721 r
= tsubst_decl (t
, args
, complain
);
12722 /* Give it the template pattern as its context; its true context
12723 hasn't been instantiated yet and this is good enough for
12725 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12728 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12729 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12738 if (DECL_TEMPLATE_PARM_P (t
))
12739 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12740 /* There is no need to substitute into namespace-scope
12742 if (DECL_NAMESPACE_SCOPE_P (t
))
12744 /* If ARGS is NULL, then T is known to be non-dependent. */
12745 if (args
== NULL_TREE
)
12746 return integral_constant_value (t
);
12748 /* Unfortunately, we cannot just call lookup_name here.
12751 template <int I> int f() {
12753 struct S { void g() { E e = a; } };
12756 When we instantiate f<7>::S::g(), say, lookup_name is not
12757 clever enough to find f<7>::a. */
12759 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12760 /*entering_scope=*/0);
12762 for (v
= TYPE_VALUES (enum_type
);
12764 v
= TREE_CHAIN (v
))
12765 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12766 return TREE_VALUE (v
);
12768 /* We didn't find the name. That should never happen; if
12769 name-lookup found it during preliminary parsing, we
12770 should find it again here during instantiation. */
12771 gcc_unreachable ();
12776 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12778 /* Check for a local specialization set up by
12779 tsubst_pack_expansion. */
12780 if (tree r
= retrieve_local_specialization (t
))
12782 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12783 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12787 /* When retrieving a capture pack from a generic lambda, remove the
12788 lambda call op's own template argument list from ARGS. Only the
12789 template arguments active for the closure type should be used to
12790 retrieve the pack specialization. */
12791 if (LAMBDA_FUNCTION_P (current_function_decl
)
12792 && (template_class_depth (DECL_CONTEXT (t
))
12793 != TMPL_ARGS_DEPTH (args
)))
12794 args
= strip_innermost_template_args (args
, 1);
12796 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12797 tsubst_decl put in the hash table. */
12798 return retrieve_specialization (t
, args
, 0);
12801 if (DECL_CONTEXT (t
))
12805 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12806 /*entering_scope=*/1);
12807 if (ctx
!= DECL_CONTEXT (t
))
12809 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12812 if (complain
& tf_error
)
12813 error ("using invalid field %qD", t
);
12814 return error_mark_node
;
12823 case FUNCTION_DECL
:
12824 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12825 r
= tsubst (t
, args
, complain
, in_decl
);
12826 else if (local_variable_p (t
))
12828 r
= retrieve_local_specialization (t
);
12829 if (r
== NULL_TREE
)
12831 /* First try name lookup to find the instantiation. */
12832 r
= lookup_name (DECL_NAME (t
));
12835 /* Make sure that the one we found is the one we want. */
12836 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
12837 complain
, in_decl
);
12838 if (ctx
!= DECL_CONTEXT (r
))
12846 /* This can happen for a variable used in a
12847 late-specified return type of a local lambda, or for a
12848 local static or constant. Building a new VAR_DECL
12849 should be OK in all those cases. */
12850 r
= tsubst_decl (t
, args
, complain
);
12851 if (decl_maybe_constant_var_p (r
))
12853 /* We can't call cp_finish_decl, so handle the
12854 initializer by hand. */
12855 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
12856 complain
, in_decl
);
12857 if (!processing_template_decl
)
12858 init
= maybe_constant_init (init
);
12859 if (processing_template_decl
12860 ? potential_constant_expression (init
)
12861 : reduced_constant_expression_p (init
))
12862 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
12863 = TREE_CONSTANT (r
) = true;
12864 DECL_INITIAL (r
) = init
;
12866 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
12867 || decl_constant_var_p (r
)
12868 || errorcount
|| sorrycount
);
12869 if (!processing_template_decl
)
12871 if (TREE_STATIC (r
))
12872 rest_of_decl_compilation (r
, toplevel_bindings_p (),
12874 else if (decl_constant_var_p (r
))
12875 /* A use of a local constant decays to its value.
12876 FIXME update for core DR 696. */
12877 r
= integral_constant_value (r
);
12880 /* Remember this for subsequent uses. */
12881 if (local_specializations
)
12882 register_local_specialization (r
, t
);
12890 case NAMESPACE_DECL
:
12894 /* An OVERLOAD will always be a non-dependent overload set; an
12895 overload set from function scope will just be represented with an
12896 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12897 gcc_assert (!uses_template_parms (t
));
12901 return tsubst_baselink (t
, current_nonlambda_class_type (),
12902 args
, complain
, in_decl
);
12904 case TEMPLATE_DECL
:
12905 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12906 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12907 args
, complain
, in_decl
);
12908 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12909 return tsubst (t
, args
, complain
, in_decl
);
12910 else if (DECL_CLASS_SCOPE_P (t
)
12911 && uses_template_parms (DECL_CONTEXT (t
)))
12913 /* Template template argument like the following example need
12916 template <template <class> class TT> struct C {};
12917 template <class T> struct D {
12918 template <class U> struct E {};
12923 We are processing the template argument `E' in #1 for
12924 the template instantiation #2. Originally, `E' is a
12925 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12926 have to substitute this with one having context `D<int>'. */
12928 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12929 return lookup_field (context
, DECL_NAME(t
), 0, false);
12932 /* Ordinary template template argument. */
12936 case REINTERPRET_CAST_EXPR
:
12937 case CONST_CAST_EXPR
:
12938 case STATIC_CAST_EXPR
:
12939 case DYNAMIC_CAST_EXPR
:
12940 case IMPLICIT_CONV_EXPR
:
12944 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12945 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12946 return build1 (code
, type
, op0
);
12950 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12953 tree expanded
, op
= TREE_OPERAND (t
, 0);
12956 if (SIZEOF_EXPR_TYPE_P (t
))
12957 op
= TREE_TYPE (op
);
12959 ++cp_unevaluated_operand
;
12960 ++c_inhibit_evaluation_warnings
;
12961 /* We only want to compute the number of arguments. */
12962 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12963 --cp_unevaluated_operand
;
12964 --c_inhibit_evaluation_warnings
;
12966 if (TREE_CODE (expanded
) == TREE_VEC
)
12967 len
= TREE_VEC_LENGTH (expanded
);
12969 if (expanded
== error_mark_node
)
12970 return error_mark_node
;
12971 else if (PACK_EXPANSION_P (expanded
)
12972 || (TREE_CODE (expanded
) == TREE_VEC
12974 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12976 if (TREE_CODE (expanded
) == TREE_VEC
)
12977 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12979 if (TYPE_P (expanded
))
12980 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12981 complain
& tf_error
);
12983 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12984 complain
& tf_error
);
12987 return build_int_cst (size_type_node
, len
);
12989 if (SIZEOF_EXPR_TYPE_P (t
))
12991 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
12992 args
, complain
, in_decl
);
12993 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
12994 r
= build1 (SIZEOF_EXPR
,
12995 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
12996 SIZEOF_EXPR_TYPE_P (r
) = 1;
13003 case TRUTH_NOT_EXPR
:
13006 case UNARY_PLUS_EXPR
: /* Unary + */
13008 case AT_ENCODE_EXPR
:
13012 case REALPART_EXPR
:
13013 case IMAGPART_EXPR
:
13016 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13017 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13018 return build1 (code
, type
, op0
);
13021 case COMPONENT_REF
:
13026 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13027 name
= TREE_OPERAND (t
, 1);
13028 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13030 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13031 complain
, in_decl
);
13032 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13034 else if (TREE_CODE (name
) == SCOPE_REF
13035 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13037 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13038 complain
, in_decl
);
13039 name
= TREE_OPERAND (name
, 1);
13040 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13041 complain
, in_decl
);
13042 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13043 name
= build_qualified_name (/*type=*/NULL_TREE
,
13045 /*template_p=*/false);
13047 else if (BASELINK_P (name
))
13048 name
= tsubst_baselink (name
,
13049 non_reference (TREE_TYPE (object
)),
13053 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13054 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13060 case TRUNC_DIV_EXPR
:
13061 case CEIL_DIV_EXPR
:
13062 case FLOOR_DIV_EXPR
:
13063 case ROUND_DIV_EXPR
:
13064 case EXACT_DIV_EXPR
:
13068 case TRUNC_MOD_EXPR
:
13069 case FLOOR_MOD_EXPR
:
13070 case TRUTH_ANDIF_EXPR
:
13071 case TRUTH_ORIF_EXPR
:
13072 case TRUTH_AND_EXPR
:
13073 case TRUTH_OR_EXPR
:
13086 case COMPOUND_EXPR
:
13089 case PREDECREMENT_EXPR
:
13090 case PREINCREMENT_EXPR
:
13091 case POSTDECREMENT_EXPR
:
13092 case POSTINCREMENT_EXPR
:
13094 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13095 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13096 return build_nt (code
, op0
, op1
);
13101 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13102 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13103 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13104 QUALIFIED_NAME_IS_TEMPLATE (t
));
13109 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13110 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13111 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13116 int n
= VL_EXP_OPERAND_LENGTH (t
);
13117 tree result
= build_vl_exp (CALL_EXPR
, n
);
13119 for (i
= 0; i
< n
; i
++)
13120 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13121 complain
, in_decl
);
13127 case PSEUDO_DTOR_EXPR
:
13128 case VEC_PERM_EXPR
:
13130 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13131 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13132 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13133 r
= build_nt (code
, op0
, op1
, op2
);
13134 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13140 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13141 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13142 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13143 r
= build_nt (code
, op0
, op1
, op2
);
13144 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13150 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13151 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13152 r
= build_nt (code
, op0
, op1
);
13153 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13154 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13158 case TEMPLATE_ID_EXPR
:
13160 /* Substituted template arguments */
13161 tree fn
= TREE_OPERAND (t
, 0);
13162 tree targs
= TREE_OPERAND (t
, 1);
13164 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13166 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13168 return lookup_template_function (fn
, targs
);
13173 tree purpose
, value
, chain
;
13175 if (t
== void_list_node
)
13178 purpose
= TREE_PURPOSE (t
);
13180 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13181 value
= TREE_VALUE (t
);
13183 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13184 chain
= TREE_CHAIN (t
);
13185 if (chain
&& chain
!= void_type_node
)
13186 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13187 if (purpose
== TREE_PURPOSE (t
)
13188 && value
== TREE_VALUE (t
)
13189 && chain
== TREE_CHAIN (t
))
13191 return tree_cons (purpose
, value
, chain
);
13196 case ENUMERAL_TYPE
:
13198 case TEMPLATE_TYPE_PARM
:
13199 case TEMPLATE_TEMPLATE_PARM
:
13200 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13201 case TEMPLATE_PARM_INDEX
:
13203 case REFERENCE_TYPE
:
13205 case FUNCTION_TYPE
:
13208 case TYPENAME_TYPE
:
13209 case UNBOUND_CLASS_TEMPLATE
:
13211 case DECLTYPE_TYPE
:
13213 return tsubst (t
, args
, complain
, in_decl
);
13217 /* Fall through. */
13218 case IDENTIFIER_NODE
:
13219 if (IDENTIFIER_TYPENAME_P (t
))
13221 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13222 return mangle_conv_op_name_for_type (new_type
);
13228 /* This is handled by tsubst_copy_and_build. */
13229 gcc_unreachable ();
13233 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13234 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13235 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13238 case CLEANUP_POINT_EXPR
:
13239 /* We shouldn't have built any of these during initial template
13240 generation. Instead, they should be built during instantiation
13241 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13242 gcc_unreachable ();
13246 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13247 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13248 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13249 r
= build2 (code
, type
, op0
, op1
);
13250 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13251 mark_used (TREE_OPERAND (r
, 1));
13255 case EXPR_PACK_EXPANSION
:
13256 error ("invalid use of pack expansion expression");
13257 return error_mark_node
;
13259 case NONTYPE_ARGUMENT_PACK
:
13260 error ("use %<...%> to expand argument pack");
13261 return error_mark_node
;
13264 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
13272 /* Instantiate any typedefs in the type. */
13273 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13274 r
= fold_convert (type
, t
);
13275 gcc_assert (TREE_CODE (r
) == code
);
13280 /* These can sometimes show up in a partial instantiation, but never
13281 involve template parms. */
13282 gcc_assert (!uses_template_parms (t
));
13286 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13287 gcc_checking_assert (false);
13292 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13295 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13296 tree args
, tsubst_flags_t complain
, tree in_decl
)
13298 tree new_clauses
= NULL
, nc
, oc
;
13300 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13302 nc
= copy_node (oc
);
13303 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13306 switch (OMP_CLAUSE_CODE (nc
))
13308 case OMP_CLAUSE_LASTPRIVATE
:
13309 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13311 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13312 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13313 in_decl
, /*integral_constant_expression_p=*/false);
13314 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13315 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13318 case OMP_CLAUSE_PRIVATE
:
13319 case OMP_CLAUSE_SHARED
:
13320 case OMP_CLAUSE_FIRSTPRIVATE
:
13321 case OMP_CLAUSE_COPYIN
:
13322 case OMP_CLAUSE_COPYPRIVATE
:
13323 case OMP_CLAUSE_IF
:
13324 case OMP_CLAUSE_NUM_THREADS
:
13325 case OMP_CLAUSE_SCHEDULE
:
13326 case OMP_CLAUSE_COLLAPSE
:
13327 case OMP_CLAUSE_FINAL
:
13328 case OMP_CLAUSE_DEPEND
:
13329 case OMP_CLAUSE_FROM
:
13330 case OMP_CLAUSE_TO
:
13331 case OMP_CLAUSE_UNIFORM
:
13332 case OMP_CLAUSE_MAP
:
13333 case OMP_CLAUSE_DEVICE
:
13334 case OMP_CLAUSE_DIST_SCHEDULE
:
13335 case OMP_CLAUSE_NUM_TEAMS
:
13336 case OMP_CLAUSE_THREAD_LIMIT
:
13337 case OMP_CLAUSE_SAFELEN
:
13338 case OMP_CLAUSE_SIMDLEN
:
13339 OMP_CLAUSE_OPERAND (nc
, 0)
13340 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13341 in_decl
, /*integral_constant_expression_p=*/false);
13343 case OMP_CLAUSE_REDUCTION
:
13344 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13346 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13347 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13349 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13350 complain
, in_decl
);
13351 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13352 = build_qualified_name (NULL_TREE
, scope
,
13353 TREE_OPERAND (placeholder
, 1),
13357 gcc_assert (identifier_p (placeholder
));
13359 OMP_CLAUSE_OPERAND (nc
, 0)
13360 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13361 in_decl
, /*integral_constant_expression_p=*/false);
13363 case OMP_CLAUSE_LINEAR
:
13364 case OMP_CLAUSE_ALIGNED
:
13365 OMP_CLAUSE_OPERAND (nc
, 0)
13366 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13367 in_decl
, /*integral_constant_expression_p=*/false);
13368 OMP_CLAUSE_OPERAND (nc
, 1)
13369 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13370 in_decl
, /*integral_constant_expression_p=*/false);
13373 case OMP_CLAUSE_NOWAIT
:
13374 case OMP_CLAUSE_ORDERED
:
13375 case OMP_CLAUSE_DEFAULT
:
13376 case OMP_CLAUSE_UNTIED
:
13377 case OMP_CLAUSE_MERGEABLE
:
13378 case OMP_CLAUSE_INBRANCH
:
13379 case OMP_CLAUSE_NOTINBRANCH
:
13380 case OMP_CLAUSE_PROC_BIND
:
13381 case OMP_CLAUSE_FOR
:
13382 case OMP_CLAUSE_PARALLEL
:
13383 case OMP_CLAUSE_SECTIONS
:
13384 case OMP_CLAUSE_TASKGROUP
:
13387 gcc_unreachable ();
13391 new_clauses
= nreverse (new_clauses
);
13393 new_clauses
= finish_omp_clauses (new_clauses
);
13394 return new_clauses
;
13397 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13400 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13403 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13405 tree purpose
, value
, chain
;
13410 if (TREE_CODE (t
) != TREE_LIST
)
13411 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13412 /*function_p=*/false,
13413 /*integral_constant_expression_p=*/false);
13415 if (t
== void_list_node
)
13418 purpose
= TREE_PURPOSE (t
);
13420 purpose
= RECUR (purpose
);
13421 value
= TREE_VALUE (t
);
13424 if (TREE_CODE (value
) != LABEL_DECL
)
13425 value
= RECUR (value
);
13428 value
= lookup_label (DECL_NAME (value
));
13429 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13430 TREE_USED (value
) = 1;
13433 chain
= TREE_CHAIN (t
);
13434 if (chain
&& chain
!= void_type_node
)
13435 chain
= RECUR (chain
);
13436 return tree_cons (purpose
, value
, chain
);
13440 /* Substitute one OMP_FOR iterator. */
13443 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13444 tree condv
, tree incrv
, tree
*clauses
,
13445 tree args
, tsubst_flags_t complain
, tree in_decl
,
13446 bool integral_constant_expression_p
)
13448 #define RECUR(NODE) \
13449 tsubst_expr ((NODE), args, complain, in_decl, \
13450 integral_constant_expression_p)
13451 tree decl
, init
, cond
, incr
;
13453 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13454 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13455 decl
= TREE_OPERAND (init
, 0);
13456 init
= TREE_OPERAND (init
, 1);
13457 tree decl_expr
= NULL_TREE
;
13458 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13460 /* We need to jump through some hoops to handle declarations in the
13461 for-init-statement, since we might need to handle auto deduction,
13462 but we need to keep control of initialization. */
13464 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13465 decl
= tsubst_decl (decl
, args
, complain
);
13468 decl
= RECUR (decl
);
13469 init
= RECUR (init
);
13471 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13472 if (auto_node
&& init
)
13474 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13476 gcc_assert (!type_dependent_expression_p (decl
));
13478 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13482 /* Declare the variable, but don't let that initialize it. */
13483 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13484 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13486 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13489 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13490 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13491 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13493 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13494 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
13495 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
13496 NOP_EXPR
, rhs
, complain
);
13499 incr
= RECUR (incr
);
13500 TREE_VEC_ELT (declv
, i
) = decl
;
13501 TREE_VEC_ELT (initv
, i
) = init
;
13502 TREE_VEC_ELT (condv
, i
) = cond
;
13503 TREE_VEC_ELT (incrv
, i
) = incr
;
13509 /* Declare and initialize the variable. */
13516 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13518 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13519 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13520 && OMP_CLAUSE_DECL (c
) == decl
)
13522 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13523 && OMP_CLAUSE_DECL (c
) == decl
)
13524 error ("iteration variable %qD should not be firstprivate", decl
);
13525 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13526 && OMP_CLAUSE_DECL (c
) == decl
)
13527 error ("iteration variable %qD should not be reduction", decl
);
13531 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13532 OMP_CLAUSE_DECL (c
) = decl
;
13533 c
= finish_omp_clauses (c
);
13536 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13541 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13542 if (COMPARISON_CLASS_P (cond
))
13544 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
13545 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
13546 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
13549 cond
= RECUR (cond
);
13550 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13551 switch (TREE_CODE (incr
))
13553 case PREINCREMENT_EXPR
:
13554 case PREDECREMENT_EXPR
:
13555 case POSTINCREMENT_EXPR
:
13556 case POSTDECREMENT_EXPR
:
13557 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13558 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13561 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13562 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13564 tree rhs
= TREE_OPERAND (incr
, 1);
13565 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13566 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13567 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13568 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13569 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13573 incr
= RECUR (incr
);
13576 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13577 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13579 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13580 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13581 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13582 TREE_TYPE (decl
), lhs
,
13583 RECUR (TREE_OPERAND (incr
, 2))));
13585 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13586 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13587 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13589 tree rhs
= TREE_OPERAND (incr
, 2);
13590 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13591 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13592 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13593 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13594 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13598 incr
= RECUR (incr
);
13601 incr
= RECUR (incr
);
13605 TREE_VEC_ELT (declv
, i
) = decl
;
13606 TREE_VEC_ELT (initv
, i
) = init
;
13607 TREE_VEC_ELT (condv
, i
) = cond
;
13608 TREE_VEC_ELT (incrv
, i
) = incr
;
13612 /* Like tsubst_copy for expressions, etc. but also does semantic
13616 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13617 bool integral_constant_expression_p
)
13619 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13620 #define RECUR(NODE) \
13621 tsubst_expr ((NODE), args, complain, in_decl, \
13622 integral_constant_expression_p)
13628 if (t
== NULL_TREE
|| t
== error_mark_node
)
13631 loc
= input_location
;
13632 if (EXPR_HAS_LOCATION (t
))
13633 input_location
= EXPR_LOCATION (t
);
13634 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13635 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13637 switch (TREE_CODE (t
))
13639 case STATEMENT_LIST
:
13641 tree_stmt_iterator i
;
13642 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13643 RECUR (tsi_stmt (i
));
13647 case CTOR_INITIALIZER
:
13648 finish_mem_initializers (tsubst_initializer_list
13649 (TREE_OPERAND (t
, 0), args
));
13653 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13657 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13658 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13659 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13661 finish_expr_stmt (tmp
);
13665 do_using_directive (USING_STMT_NAMESPACE (t
));
13670 tree decl
, pattern_decl
;
13673 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13674 if (TREE_CODE (decl
) == LABEL_DECL
)
13675 finish_label_decl (DECL_NAME (decl
));
13676 else if (TREE_CODE (decl
) == USING_DECL
)
13678 tree scope
= USING_DECL_SCOPE (decl
);
13679 tree name
= DECL_NAME (decl
);
13682 scope
= tsubst (scope
, args
, complain
, in_decl
);
13683 decl
= lookup_qualified_name (scope
, name
,
13684 /*is_type_p=*/false,
13685 /*complain=*/false);
13686 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13687 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13689 do_local_using_decl (decl
, scope
, name
);
13691 else if (DECL_PACK_P (decl
))
13693 /* Don't build up decls for a variadic capture proxy, we'll
13694 instantiate the elements directly as needed. */
13699 init
= DECL_INITIAL (decl
);
13700 decl
= tsubst (decl
, args
, complain
, in_decl
);
13701 if (decl
!= error_mark_node
)
13703 /* By marking the declaration as instantiated, we avoid
13704 trying to instantiate it. Since instantiate_decl can't
13705 handle local variables, and since we've already done
13706 all that needs to be done, that's the right thing to
13709 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13711 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13712 /* Anonymous aggregates are a special case. */
13713 finish_anon_union (decl
);
13714 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13716 DECL_CONTEXT (decl
) = current_function_decl
;
13717 if (DECL_NAME (decl
) == this_identifier
)
13719 tree lam
= DECL_CONTEXT (current_function_decl
);
13720 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13721 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13723 insert_capture_proxy (decl
);
13725 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13726 /* We already did a pushtag. */;
13727 else if (TREE_CODE (decl
) == FUNCTION_DECL
13728 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
13729 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
13731 DECL_CONTEXT (decl
) = NULL_TREE
;
13733 DECL_CONTEXT (decl
) = current_function_decl
;
13734 cp_check_omp_declare_reduction (decl
);
13738 int const_init
= false;
13739 maybe_push_decl (decl
);
13741 && DECL_PRETTY_FUNCTION_P (decl
))
13743 /* For __PRETTY_FUNCTION__ we have to adjust the
13745 const char *const name
13746 = cxx_printable_name (current_function_decl
, 2);
13747 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
13750 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
13753 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13755 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13764 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13765 RECUR (FOR_INIT_STMT (t
));
13766 finish_for_init_stmt (stmt
);
13767 tmp
= RECUR (FOR_COND (t
));
13768 finish_for_cond (tmp
, stmt
, false);
13769 tmp
= RECUR (FOR_EXPR (t
));
13770 finish_for_expr (tmp
, stmt
);
13771 RECUR (FOR_BODY (t
));
13772 finish_for_stmt (stmt
);
13775 case RANGE_FOR_STMT
:
13778 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13779 decl
= RANGE_FOR_DECL (t
);
13780 decl
= tsubst (decl
, args
, complain
, in_decl
);
13781 maybe_push_decl (decl
);
13782 expr
= RECUR (RANGE_FOR_EXPR (t
));
13783 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
13784 RECUR (RANGE_FOR_BODY (t
));
13785 finish_for_stmt (stmt
);
13790 stmt
= begin_while_stmt ();
13791 tmp
= RECUR (WHILE_COND (t
));
13792 finish_while_stmt_cond (tmp
, stmt
, false);
13793 RECUR (WHILE_BODY (t
));
13794 finish_while_stmt (stmt
);
13798 stmt
= begin_do_stmt ();
13799 RECUR (DO_BODY (t
));
13800 finish_do_body (stmt
);
13801 tmp
= RECUR (DO_COND (t
));
13802 finish_do_stmt (tmp
, stmt
, false);
13806 stmt
= begin_if_stmt ();
13807 tmp
= RECUR (IF_COND (t
));
13808 finish_if_stmt_cond (tmp
, stmt
);
13809 RECUR (THEN_CLAUSE (t
));
13810 finish_then_clause (stmt
);
13812 if (ELSE_CLAUSE (t
))
13814 begin_else_clause (stmt
);
13815 RECUR (ELSE_CLAUSE (t
));
13816 finish_else_clause (stmt
);
13819 finish_if_stmt (stmt
);
13823 if (BIND_EXPR_BODY_BLOCK (t
))
13824 stmt
= begin_function_body ();
13826 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13827 ? BCS_TRY_BLOCK
: 0);
13829 RECUR (BIND_EXPR_BODY (t
));
13831 if (BIND_EXPR_BODY_BLOCK (t
))
13832 finish_function_body (stmt
);
13834 finish_compound_stmt (stmt
);
13838 finish_break_stmt ();
13841 case CONTINUE_STMT
:
13842 finish_continue_stmt ();
13846 stmt
= begin_switch_stmt ();
13847 tmp
= RECUR (SWITCH_STMT_COND (t
));
13848 finish_switch_cond (tmp
, stmt
);
13849 RECUR (SWITCH_STMT_BODY (t
));
13850 finish_switch_stmt (stmt
);
13853 case CASE_LABEL_EXPR
:
13855 tree low
= RECUR (CASE_LOW (t
));
13856 tree high
= RECUR (CASE_HIGH (t
));
13857 finish_case_label (EXPR_LOCATION (t
), low
, high
);
13863 tree decl
= LABEL_EXPR_LABEL (t
);
13866 label
= finish_label_stmt (DECL_NAME (decl
));
13867 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13868 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13873 tmp
= GOTO_DESTINATION (t
);
13874 if (TREE_CODE (tmp
) != LABEL_DECL
)
13875 /* Computed goto's must be tsubst'd into. On the other hand,
13876 non-computed gotos must not be; the identifier in question
13877 will have no binding. */
13880 tmp
= DECL_NAME (tmp
);
13881 finish_goto_stmt (tmp
);
13886 tree string
= RECUR (ASM_STRING (t
));
13887 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
13888 complain
, in_decl
);
13889 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
13890 complain
, in_decl
);
13891 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
13892 complain
, in_decl
);
13893 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
13894 complain
, in_decl
);
13895 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
13897 tree asm_expr
= tmp
;
13898 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13899 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13900 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13907 stmt
= begin_try_block ();
13908 RECUR (TRY_STMTS (t
));
13909 finish_cleanup_try_block (stmt
);
13910 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13914 tree compound_stmt
= NULL_TREE
;
13916 if (FN_TRY_BLOCK_P (t
))
13917 stmt
= begin_function_try_block (&compound_stmt
);
13919 stmt
= begin_try_block ();
13921 RECUR (TRY_STMTS (t
));
13923 if (FN_TRY_BLOCK_P (t
))
13924 finish_function_try_block (stmt
);
13926 finish_try_block (stmt
);
13928 RECUR (TRY_HANDLERS (t
));
13929 if (FN_TRY_BLOCK_P (t
))
13930 finish_function_handler_sequence (stmt
, compound_stmt
);
13932 finish_handler_sequence (stmt
);
13938 tree decl
= HANDLER_PARMS (t
);
13942 decl
= tsubst (decl
, args
, complain
, in_decl
);
13943 /* Prevent instantiate_decl from trying to instantiate
13944 this variable. We've already done all that needs to be
13946 if (decl
!= error_mark_node
)
13947 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13949 stmt
= begin_handler ();
13950 finish_handler_parms (decl
, stmt
);
13951 RECUR (HANDLER_BODY (t
));
13952 finish_handler (stmt
);
13957 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13958 if (CLASS_TYPE_P (tmp
))
13960 /* Local classes are not independent templates; they are
13961 instantiated along with their containing function. And this
13962 way we don't have to deal with pushing out of one local class
13963 to instantiate a member of another local class. */
13965 /* Closures are handled by the LAMBDA_EXPR. */
13966 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13967 complete_type (tmp
);
13968 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13969 if (!DECL_ARTIFICIAL (fn
))
13970 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13974 case STATIC_ASSERT
:
13978 ++c_inhibit_evaluation_warnings
;
13980 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13983 /*integral_constant_expression_p=*/true);
13984 --c_inhibit_evaluation_warnings
;
13986 finish_static_assert (condition
,
13987 STATIC_ASSERT_MESSAGE (t
),
13988 STATIC_ASSERT_SOURCE_LOCATION (t
),
13989 /*member_p=*/false);
13994 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
13995 args
, complain
, in_decl
);
13996 stmt
= begin_omp_parallel ();
13997 RECUR (OMP_PARALLEL_BODY (t
));
13998 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
13999 = OMP_PARALLEL_COMBINED (t
);
14003 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
14004 args
, complain
, in_decl
);
14005 stmt
= begin_omp_task ();
14006 RECUR (OMP_TASK_BODY (t
));
14007 finish_omp_task (tmp
, stmt
);
14013 case OMP_DISTRIBUTE
:
14015 tree clauses
, body
, pre_body
;
14016 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
14017 tree incrv
= NULL_TREE
;
14020 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
14021 args
, complain
, in_decl
);
14022 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14024 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14025 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14026 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14027 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14030 stmt
= begin_omp_structured_block ();
14032 pre_body
= push_stmt_list ();
14033 RECUR (OMP_FOR_PRE_BODY (t
));
14034 pre_body
= pop_stmt_list (pre_body
);
14036 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14037 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14038 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14039 &clauses
, args
, complain
, in_decl
,
14040 integral_constant_expression_p
);
14042 body
= push_stmt_list ();
14043 RECUR (OMP_FOR_BODY (t
));
14044 body
= pop_stmt_list (body
);
14046 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14047 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14048 condv
, incrv
, body
, pre_body
, clauses
);
14051 t
= make_node (TREE_CODE (t
));
14052 TREE_TYPE (t
) = void_type_node
;
14053 OMP_FOR_BODY (t
) = body
;
14054 OMP_FOR_PRE_BODY (t
) = pre_body
;
14055 OMP_FOR_CLAUSES (t
) = clauses
;
14056 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14060 add_stmt (finish_omp_structured_block (stmt
));
14067 case OMP_TARGET_DATA
:
14069 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14070 args
, complain
, in_decl
);
14071 stmt
= push_stmt_list ();
14072 RECUR (OMP_BODY (t
));
14073 stmt
= pop_stmt_list (stmt
);
14076 OMP_BODY (t
) = stmt
;
14077 OMP_CLAUSES (t
) = tmp
;
14081 case OMP_TARGET_UPDATE
:
14082 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14083 args
, complain
, in_decl
);
14085 OMP_CLAUSES (t
) = tmp
;
14092 case OMP_TASKGROUP
:
14094 stmt
= push_stmt_list ();
14095 RECUR (OMP_BODY (t
));
14096 stmt
= pop_stmt_list (stmt
);
14099 OMP_BODY (t
) = stmt
;
14104 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14105 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14107 tree op1
= TREE_OPERAND (t
, 1);
14108 tree rhs1
= NULL_TREE
;
14110 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14112 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14113 op1
= TREE_OPERAND (op1
, 1);
14115 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14116 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14117 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14118 NULL_TREE
, NULL_TREE
, rhs1
,
14119 OMP_ATOMIC_SEQ_CST (t
));
14123 tree op1
= TREE_OPERAND (t
, 1);
14124 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14125 tree rhs1
= NULL_TREE
;
14126 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14127 enum tree_code opcode
= NOP_EXPR
;
14128 if (code
== OMP_ATOMIC_READ
)
14130 v
= RECUR (TREE_OPERAND (op1
, 0));
14131 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14133 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14134 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14136 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14137 v
= RECUR (TREE_OPERAND (op1
, 0));
14138 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14139 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14141 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14142 op11
= TREE_OPERAND (op11
, 1);
14144 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14145 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14146 opcode
= TREE_CODE (op11
);
14147 if (opcode
== MODIFY_EXPR
)
14153 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14154 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14156 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14157 OMP_ATOMIC_SEQ_CST (t
));
14161 case TRANSACTION_EXPR
:
14164 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14165 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14167 if (TRANSACTION_EXPR_IS_STMT (t
))
14169 tree body
= TRANSACTION_EXPR_BODY (t
);
14170 tree noex
= NULL_TREE
;
14171 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14173 noex
= MUST_NOT_THROW_COND (body
);
14174 if (noex
== NULL_TREE
)
14175 noex
= boolean_true_node
;
14176 body
= TREE_OPERAND (body
, 0);
14178 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14180 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14184 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14185 RECUR (TRANSACTION_EXPR_BODY (t
)),
14192 case MUST_NOT_THROW_EXPR
:
14194 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14195 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14196 RETURN (build_must_not_throw_expr (op0
, cond
));
14199 case EXPR_PACK_EXPANSION
:
14200 error ("invalid use of pack expansion expression");
14201 RETURN (error_mark_node
);
14203 case NONTYPE_ARGUMENT_PACK
:
14204 error ("use %<...%> to expand argument pack");
14205 RETURN (error_mark_node
);
14207 case CILK_SPAWN_STMT
:
14208 cfun
->calls_cilk_spawn
= 1;
14209 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
14211 case CILK_SYNC_STMT
:
14212 RETURN (build_cilk_sync ());
14214 case COMPOUND_EXPR
:
14215 tmp
= RECUR (TREE_OPERAND (t
, 0));
14216 if (tmp
== NULL_TREE
)
14217 /* If the first operand was a statement, we're done with it. */
14218 RETURN (RECUR (TREE_OPERAND (t
, 1)));
14219 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
14220 RECUR (TREE_OPERAND (t
, 1)),
14223 case ANNOTATE_EXPR
:
14224 tmp
= RECUR (TREE_OPERAND (t
, 0));
14225 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
14226 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
14229 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
14231 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14232 /*function_p=*/false,
14233 integral_constant_expression_p
));
14236 RETURN (NULL_TREE
);
14238 input_location
= loc
;
14244 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14245 function. For description of the body see comment above
14246 cp_parser_omp_declare_reduction_exprs. */
14249 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14251 if (t
== NULL_TREE
|| t
== error_mark_node
)
14254 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14256 tree_stmt_iterator tsi
;
14259 memset (stmts
, 0, sizeof stmts
);
14260 for (i
= 0, tsi
= tsi_start (t
);
14261 i
< 7 && !tsi_end_p (tsi
);
14262 i
++, tsi_next (&tsi
))
14263 stmts
[i
] = tsi_stmt (tsi
);
14264 gcc_assert (tsi_end_p (tsi
));
14268 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14269 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14270 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14271 args
, complain
, in_decl
);
14272 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14273 args
, complain
, in_decl
);
14274 DECL_CONTEXT (omp_out
) = current_function_decl
;
14275 DECL_CONTEXT (omp_in
) = current_function_decl
;
14276 keep_next_level (true);
14277 tree block
= begin_omp_structured_block ();
14278 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14279 block
= finish_omp_structured_block (block
);
14280 block
= maybe_cleanup_point_expr_void (block
);
14281 add_decl_expr (omp_out
);
14282 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14283 TREE_NO_WARNING (omp_out
) = 1;
14284 add_decl_expr (omp_in
);
14285 finish_expr_stmt (block
);
14289 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14290 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14291 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14292 args
, complain
, in_decl
);
14293 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14294 args
, complain
, in_decl
);
14295 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14296 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14297 keep_next_level (true);
14298 tree block
= begin_omp_structured_block ();
14299 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14300 block
= finish_omp_structured_block (block
);
14301 block
= maybe_cleanup_point_expr_void (block
);
14302 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14303 add_decl_expr (omp_priv
);
14304 add_decl_expr (omp_orig
);
14305 finish_expr_stmt (block
);
14307 add_decl_expr (omp_orig
);
14311 /* T is a postfix-expression that is not being used in a function
14312 call. Return the substituted version of T. */
14315 tsubst_non_call_postfix_expression (tree t
, tree args
,
14316 tsubst_flags_t complain
,
14319 if (TREE_CODE (t
) == SCOPE_REF
)
14320 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14321 /*done=*/false, /*address_p=*/false);
14323 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14324 /*function_p=*/false,
14325 /*integral_constant_expression_p=*/false);
14330 /* Sentinel to disable certain warnings during template substitution. */
14332 struct warning_sentinel
{
14335 warning_sentinel(int& flag
, bool suppress
=true)
14336 : flag(flag
), val(flag
) { if (suppress
) flag
= 0; }
14337 ~warning_sentinel() { flag
= val
; }
14340 /* Like tsubst but deals with expressions and performs semantic
14341 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14344 tsubst_copy_and_build (tree t
,
14346 tsubst_flags_t complain
,
14349 bool integral_constant_expression_p
)
14351 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14352 #define RECUR(NODE) \
14353 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14354 /*function_p=*/false, \
14355 integral_constant_expression_p)
14360 if (t
== NULL_TREE
|| t
== error_mark_node
)
14363 loc
= input_location
;
14364 if (EXPR_HAS_LOCATION (t
))
14365 input_location
= EXPR_LOCATION (t
);
14367 /* N3276 decltype magic only applies to calls at the top level or on the
14368 right side of a comma. */
14369 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14370 complain
&= ~tf_decltype
;
14372 switch (TREE_CODE (t
))
14376 /* Fall through. */
14377 case IDENTIFIER_NODE
:
14381 bool non_integral_constant_expression_p
;
14382 const char *error_msg
;
14384 if (IDENTIFIER_TYPENAME_P (t
))
14386 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14387 t
= mangle_conv_op_name_for_type (new_type
);
14390 /* Look up the name. */
14391 decl
= lookup_name (t
);
14393 /* By convention, expressions use ERROR_MARK_NODE to indicate
14394 failure, not NULL_TREE. */
14395 if (decl
== NULL_TREE
)
14396 decl
= error_mark_node
;
14398 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14400 integral_constant_expression_p
,
14401 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14402 &non_integral_constant_expression_p
,
14403 /*template_p=*/false,
14405 /*address_p=*/false,
14406 /*template_arg_p=*/false,
14411 if (!function_p
&& identifier_p (decl
))
14413 if (complain
& tf_error
)
14414 unqualified_name_lookup_error (decl
);
14415 decl
= error_mark_node
;
14420 case TEMPLATE_ID_EXPR
:
14423 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14424 tree targs
= TREE_OPERAND (t
, 1);
14427 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14429 if (TREE_CODE (templ
) == COMPONENT_REF
)
14431 object
= TREE_OPERAND (templ
, 0);
14432 templ
= TREE_OPERAND (templ
, 1);
14435 object
= NULL_TREE
;
14436 templ
= lookup_template_function (templ
, targs
);
14439 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14440 object
, templ
, NULL_TREE
));
14442 RETURN (baselink_for_fns (templ
));
14447 tree r
= RECUR (TREE_OPERAND (t
, 0));
14449 if (REFERENCE_REF_P (t
))
14451 /* A type conversion to reference type will be enclosed in
14452 such an indirect ref, but the substitution of the cast
14453 will have also added such an indirect ref. */
14454 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14455 r
= convert_from_reference (r
);
14458 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14459 complain
|decltype_flag
);
14465 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14466 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14467 RETURN (build_nop (type
, op0
));
14470 case IMPLICIT_CONV_EXPR
:
14472 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14473 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14474 int flags
= LOOKUP_IMPLICIT
;
14475 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14476 flags
= LOOKUP_NORMAL
;
14477 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14483 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14484 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14485 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
14489 case REINTERPRET_CAST_EXPR
:
14490 case CONST_CAST_EXPR
:
14491 case DYNAMIC_CAST_EXPR
:
14492 case STATIC_CAST_EXPR
:
14495 tree op
, r
= NULL_TREE
;
14497 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14498 if (integral_constant_expression_p
14499 && !cast_valid_in_integral_constant_expression_p (type
))
14501 if (complain
& tf_error
)
14502 error ("a cast to a type other than an integral or "
14503 "enumeration type cannot appear in a constant-expression");
14504 RETURN (error_mark_node
);
14507 op
= RECUR (TREE_OPERAND (t
, 0));
14509 warning_sentinel
s(warn_useless_cast
);
14510 switch (TREE_CODE (t
))
14513 r
= build_functional_cast (type
, op
, complain
);
14515 case REINTERPRET_CAST_EXPR
:
14516 r
= build_reinterpret_cast (type
, op
, complain
);
14518 case CONST_CAST_EXPR
:
14519 r
= build_const_cast (type
, op
, complain
);
14521 case DYNAMIC_CAST_EXPR
:
14522 r
= build_dynamic_cast (type
, op
, complain
);
14524 case STATIC_CAST_EXPR
:
14525 r
= build_static_cast (type
, op
, complain
);
14528 gcc_unreachable ();
14534 case POSTDECREMENT_EXPR
:
14535 case POSTINCREMENT_EXPR
:
14536 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14537 args
, complain
, in_decl
);
14538 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14539 complain
|decltype_flag
));
14541 case PREDECREMENT_EXPR
:
14542 case PREINCREMENT_EXPR
:
14546 case TRUTH_NOT_EXPR
:
14547 case UNARY_PLUS_EXPR
: /* Unary + */
14548 case REALPART_EXPR
:
14549 case IMAGPART_EXPR
:
14550 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14551 RECUR (TREE_OPERAND (t
, 0)),
14552 complain
|decltype_flag
));
14554 case FIX_TRUNC_EXPR
:
14555 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14559 op1
= TREE_OPERAND (t
, 0);
14560 if (TREE_CODE (op1
) == LABEL_DECL
)
14561 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14562 EXPR_LOCATION (op1
)));
14563 if (TREE_CODE (op1
) == SCOPE_REF
)
14564 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14565 /*done=*/true, /*address_p=*/true);
14567 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14569 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14570 complain
|decltype_flag
));
14575 case TRUNC_DIV_EXPR
:
14576 case CEIL_DIV_EXPR
:
14577 case FLOOR_DIV_EXPR
:
14578 case ROUND_DIV_EXPR
:
14579 case EXACT_DIV_EXPR
:
14583 case TRUNC_MOD_EXPR
:
14584 case FLOOR_MOD_EXPR
:
14585 case TRUTH_ANDIF_EXPR
:
14586 case TRUTH_ORIF_EXPR
:
14587 case TRUTH_AND_EXPR
:
14588 case TRUTH_OR_EXPR
:
14604 warning_sentinel
s1(warn_type_limits
);
14605 warning_sentinel
s2(warn_div_by_zero
);
14606 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14607 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14608 tree r
= build_x_binary_op
14609 (input_location
, TREE_CODE (t
),
14611 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14613 : TREE_CODE (TREE_OPERAND (t
, 0))),
14615 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14617 : TREE_CODE (TREE_OPERAND (t
, 1))),
14619 complain
|decltype_flag
);
14620 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14621 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14626 case POINTER_PLUS_EXPR
:
14628 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14629 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14630 return fold_build_pointer_plus (op0
, op1
);
14634 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14635 /*address_p=*/false));
14637 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14638 args
, complain
, in_decl
);
14639 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14640 RECUR (TREE_OPERAND (t
, 1)),
14641 complain
|decltype_flag
));
14643 case ARRAY_NOTATION_REF
:
14645 tree start_index
, length
, stride
;
14646 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14647 args
, complain
, in_decl
);
14648 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14649 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14650 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14651 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14652 length
, stride
, TREE_TYPE (op1
)));
14655 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14656 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14663 op1
= TREE_OPERAND (t
, 0);
14664 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14665 op1
= TREE_TYPE (op1
);
14668 /* When there are no ARGS, we are trying to evaluate a
14669 non-dependent expression from the parser. Trying to do
14670 the substitutions may not work. */
14672 op1
= TREE_TYPE (op1
);
14676 ++cp_unevaluated_operand
;
14677 ++c_inhibit_evaluation_warnings
;
14679 op1
= tsubst (op1
, args
, complain
, in_decl
);
14681 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14682 /*function_p=*/false,
14683 /*integral_constant_expression_p=*/
14685 --cp_unevaluated_operand
;
14686 --c_inhibit_evaluation_warnings
;
14689 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14690 complain
& tf_error
);
14692 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14693 complain
& tf_error
);
14694 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14696 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14698 if (!processing_template_decl
&& TYPE_P (op1
))
14700 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14701 build1 (NOP_EXPR
, op1
, error_mark_node
));
14702 SIZEOF_EXPR_TYPE_P (r
) = 1;
14705 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14706 TREE_SIDE_EFFECTS (r
) = 0;
14707 TREE_READONLY (r
) = 1;
14709 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14714 case AT_ENCODE_EXPR
:
14716 op1
= TREE_OPERAND (t
, 0);
14717 ++cp_unevaluated_operand
;
14718 ++c_inhibit_evaluation_warnings
;
14719 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14720 /*function_p=*/false,
14721 /*integral_constant_expression_p=*/false);
14722 --cp_unevaluated_operand
;
14723 --c_inhibit_evaluation_warnings
;
14724 RETURN (objc_build_encode_expr (op1
));
14727 case NOEXCEPT_EXPR
:
14728 op1
= TREE_OPERAND (t
, 0);
14729 ++cp_unevaluated_operand
;
14730 ++c_inhibit_evaluation_warnings
;
14731 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14732 /*function_p=*/false,
14733 /*integral_constant_expression_p=*/false);
14734 --cp_unevaluated_operand
;
14735 --c_inhibit_evaluation_warnings
;
14736 RETURN (finish_noexcept_expr (op1
, complain
));
14740 warning_sentinel
s(warn_div_by_zero
);
14741 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
14742 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
14743 tree r
= build_x_modify_expr
14744 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
14745 complain
|decltype_flag
);
14746 /* TREE_NO_WARNING must be set if either the expression was
14747 parenthesized or it uses an operator such as >>= rather
14748 than plain assignment. In the former case, it was already
14749 set and must be copied. In the latter case,
14750 build_x_modify_expr sets it and it must not be reset
14752 if (TREE_NO_WARNING (t
))
14753 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14759 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14760 args
, complain
, in_decl
);
14761 /* Remember that there was a reference to this entity. */
14764 RETURN (build_x_arrow (input_location
, op1
, complain
));
14768 tree placement
= RECUR (TREE_OPERAND (t
, 0));
14769 tree init
= RECUR (TREE_OPERAND (t
, 3));
14770 vec
<tree
, va_gc
> *placement_vec
;
14771 vec
<tree
, va_gc
> *init_vec
;
14774 if (placement
== NULL_TREE
)
14775 placement_vec
= NULL
;
14778 placement_vec
= make_tree_vector ();
14779 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
14780 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
14783 /* If there was an initializer in the original tree, but it
14784 instantiated to an empty list, then we should pass a
14785 non-NULL empty vector to tell build_new that it was an
14786 empty initializer() rather than no initializer. This can
14787 only happen when the initializer is a pack expansion whose
14788 parameter packs are of length zero. */
14789 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
14793 init_vec
= make_tree_vector ();
14794 if (init
== void_node
)
14795 gcc_assert (init_vec
!= NULL
);
14798 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
14799 vec_safe_push (init_vec
, TREE_VALUE (init
));
14803 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14804 tree op2
= RECUR (TREE_OPERAND (t
, 2));
14805 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
14806 NEW_EXPR_USE_GLOBAL (t
),
14809 if (placement_vec
!= NULL
)
14810 release_tree_vector (placement_vec
);
14811 if (init_vec
!= NULL
)
14812 release_tree_vector (init_vec
);
14819 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14820 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14821 RETURN (delete_sanity (op0
, op1
,
14822 DELETE_EXPR_USE_VEC (t
),
14823 DELETE_EXPR_USE_GLOBAL (t
),
14827 case COMPOUND_EXPR
:
14829 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
14830 complain
& ~tf_decltype
, in_decl
,
14831 /*function_p=*/false,
14832 integral_constant_expression_p
);
14833 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
14835 RECUR (TREE_OPERAND (t
, 1)),
14836 complain
|decltype_flag
));
14842 vec
<tree
, va_gc
> *call_args
;
14843 unsigned int nargs
, i
;
14848 function
= CALL_EXPR_FN (t
);
14849 /* When we parsed the expression, we determined whether or
14850 not Koenig lookup should be performed. */
14851 koenig_p
= KOENIG_LOOKUP_P (t
);
14852 if (TREE_CODE (function
) == SCOPE_REF
)
14854 qualified_p
= true;
14855 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
14857 /*address_p=*/false);
14859 else if (koenig_p
&& identifier_p (function
))
14861 /* Do nothing; calling tsubst_copy_and_build on an identifier
14862 would incorrectly perform unqualified lookup again.
14864 Note that we can also have an IDENTIFIER_NODE if the earlier
14865 unqualified lookup found a member function; in that case
14866 koenig_p will be false and we do want to do the lookup
14867 again to find the instantiated member function.
14869 FIXME but doing that causes c++/15272, so we need to stop
14870 using IDENTIFIER_NODE in that situation. */
14871 qualified_p
= false;
14875 if (TREE_CODE (function
) == COMPONENT_REF
)
14877 tree op
= TREE_OPERAND (function
, 1);
14879 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
14880 || (BASELINK_P (op
)
14881 && BASELINK_QUALIFIED_P (op
)));
14884 qualified_p
= false;
14886 if (TREE_CODE (function
) == ADDR_EXPR
14887 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
14888 /* Avoid error about taking the address of a constructor. */
14889 function
= TREE_OPERAND (function
, 0);
14891 function
= tsubst_copy_and_build (function
, args
, complain
,
14894 integral_constant_expression_p
);
14896 if (BASELINK_P (function
))
14897 qualified_p
= true;
14900 nargs
= call_expr_nargs (t
);
14901 call_args
= make_tree_vector ();
14902 for (i
= 0; i
< nargs
; ++i
)
14904 tree arg
= CALL_EXPR_ARG (t
, i
);
14906 if (!PACK_EXPANSION_P (arg
))
14907 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
14910 /* Expand the pack expansion and push each entry onto
14912 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
14913 if (TREE_CODE (arg
) == TREE_VEC
)
14915 unsigned int len
, j
;
14917 len
= TREE_VEC_LENGTH (arg
);
14918 for (j
= 0; j
< len
; ++j
)
14920 tree value
= TREE_VEC_ELT (arg
, j
);
14921 if (value
!= NULL_TREE
)
14922 value
= convert_from_reference (value
);
14923 vec_safe_push (call_args
, value
);
14928 /* A partial substitution. Add one entry. */
14929 vec_safe_push (call_args
, arg
);
14934 /* We do not perform argument-dependent lookup if normal
14935 lookup finds a non-function, in accordance with the
14936 expected resolution of DR 218. */
14938 && ((is_overloaded_fn (function
)
14939 /* If lookup found a member function, the Koenig lookup is
14940 not appropriate, even if an unqualified-name was used
14941 to denote the function. */
14942 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14943 || identifier_p (function
))
14944 /* Only do this when substitution turns a dependent call
14945 into a non-dependent call. */
14946 && type_dependent_expression_p_push (t
)
14947 && !any_type_dependent_arguments_p (call_args
))
14948 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
14950 if (identifier_p (function
)
14951 && !any_type_dependent_arguments_p (call_args
))
14953 if (koenig_p
&& (complain
& tf_warning_or_error
))
14955 /* For backwards compatibility and good diagnostics, try
14956 the unqualified lookup again if we aren't in SFINAE
14958 tree unq
= (tsubst_copy_and_build
14959 (function
, args
, complain
, in_decl
, true,
14960 integral_constant_expression_p
));
14961 if (unq
== error_mark_node
)
14962 RETURN (error_mark_node
);
14964 if (unq
!= function
)
14967 if (INDIRECT_REF_P (fn
))
14968 fn
= TREE_OPERAND (fn
, 0);
14969 if (TREE_CODE (fn
) == COMPONENT_REF
)
14970 fn
= TREE_OPERAND (fn
, 1);
14971 if (is_overloaded_fn (fn
))
14972 fn
= get_first_fn (fn
);
14973 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
14974 "%qD was not declared in this scope, "
14975 "and no declarations were found by "
14976 "argument-dependent lookup at the point "
14977 "of instantiation", function
))
14980 /* Can't say anything more. */;
14981 else if (DECL_CLASS_SCOPE_P (fn
))
14983 location_t loc
= EXPR_LOC_OR_LOC (t
,
14986 "declarations in dependent base %qT are "
14987 "not found by unqualified lookup",
14988 DECL_CLASS_CONTEXT (fn
));
14989 if (current_class_ptr
)
14991 "use %<this->%D%> instead", function
);
14994 "use %<%T::%D%> instead",
14995 current_class_name
, function
);
14998 inform (0, "%q+D declared here, later in the "
14999 "translation unit", fn
);
15004 if (identifier_p (function
))
15006 if (complain
& tf_error
)
15007 unqualified_name_lookup_error (function
);
15008 release_tree_vector (call_args
);
15009 RETURN (error_mark_node
);
15013 /* Remember that there was a reference to this entity. */
15014 if (DECL_P (function
))
15015 mark_used (function
);
15017 /* Put back tf_decltype for the actual call. */
15018 complain
|= decltype_flag
;
15020 if (TREE_CODE (function
) == OFFSET_REF
)
15021 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
15023 else if (TREE_CODE (function
) == COMPONENT_REF
)
15025 tree instance
= TREE_OPERAND (function
, 0);
15026 tree fn
= TREE_OPERAND (function
, 1);
15028 if (processing_template_decl
15029 && (type_dependent_expression_p (instance
)
15030 || (!BASELINK_P (fn
)
15031 && TREE_CODE (fn
) != FIELD_DECL
)
15032 || type_dependent_expression_p (fn
)
15033 || any_type_dependent_arguments_p (call_args
)))
15034 ret
= build_nt_call_vec (function
, call_args
);
15035 else if (!BASELINK_P (fn
))
15036 ret
= finish_call_expr (function
, &call_args
,
15037 /*disallow_virtual=*/false,
15038 /*koenig_p=*/false,
15041 ret
= (build_new_method_call
15043 &call_args
, NULL_TREE
,
15044 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15049 ret
= finish_call_expr (function
, &call_args
,
15050 /*disallow_virtual=*/qualified_p
,
15054 release_tree_vector (call_args
);
15061 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15064 if (TREE_CODE (cond
) == INTEGER_CST
)
15066 if (integer_zerop (cond
))
15068 ++c_inhibit_evaluation_warnings
;
15069 exp1
= RECUR (TREE_OPERAND (t
, 1));
15070 --c_inhibit_evaluation_warnings
;
15071 exp2
= RECUR (TREE_OPERAND (t
, 2));
15075 exp1
= RECUR (TREE_OPERAND (t
, 1));
15076 ++c_inhibit_evaluation_warnings
;
15077 exp2
= RECUR (TREE_OPERAND (t
, 2));
15078 --c_inhibit_evaluation_warnings
;
15083 exp1
= RECUR (TREE_OPERAND (t
, 1));
15084 exp2
= RECUR (TREE_OPERAND (t
, 2));
15087 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15088 cond
, exp1
, exp2
, complain
));
15091 case PSEUDO_DTOR_EXPR
:
15093 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15094 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15095 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15096 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15102 tree purpose
, value
, chain
;
15104 if (t
== void_list_node
)
15107 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15108 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15110 /* We have pack expansions, so expand those and
15111 create a new list out of it. */
15112 tree purposevec
= NULL_TREE
;
15113 tree valuevec
= NULL_TREE
;
15117 /* Expand the argument expressions. */
15118 if (TREE_PURPOSE (t
))
15119 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15120 complain
, in_decl
);
15121 if (TREE_VALUE (t
))
15122 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15123 complain
, in_decl
);
15125 /* Build the rest of the list. */
15126 chain
= TREE_CHAIN (t
);
15127 if (chain
&& chain
!= void_type_node
)
15128 chain
= RECUR (chain
);
15130 /* Determine the number of arguments. */
15131 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15133 len
= TREE_VEC_LENGTH (purposevec
);
15134 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15136 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15137 len
= TREE_VEC_LENGTH (valuevec
);
15140 /* Since we only performed a partial substitution into
15141 the argument pack, we only RETURN (a single list
15143 if (purposevec
== TREE_PURPOSE (t
)
15144 && valuevec
== TREE_VALUE (t
)
15145 && chain
== TREE_CHAIN (t
))
15148 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15151 /* Convert the argument vectors into a TREE_LIST */
15155 /* Grab the Ith values. */
15157 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15160 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15163 /* Build the list (backwards). */
15164 chain
= tree_cons (purpose
, value
, chain
);
15170 purpose
= TREE_PURPOSE (t
);
15172 purpose
= RECUR (purpose
);
15173 value
= TREE_VALUE (t
);
15175 value
= RECUR (value
);
15176 chain
= TREE_CHAIN (t
);
15177 if (chain
&& chain
!= void_type_node
)
15178 chain
= RECUR (chain
);
15179 if (purpose
== TREE_PURPOSE (t
)
15180 && value
== TREE_VALUE (t
)
15181 && chain
== TREE_CHAIN (t
))
15183 RETURN (tree_cons (purpose
, value
, chain
));
15186 case COMPONENT_REF
:
15193 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15194 args
, complain
, in_decl
);
15195 /* Remember that there was a reference to this entity. */
15196 if (DECL_P (object
))
15197 mark_used (object
);
15198 object_type
= TREE_TYPE (object
);
15200 member
= TREE_OPERAND (t
, 1);
15201 if (BASELINK_P (member
))
15202 member
= tsubst_baselink (member
,
15203 non_reference (TREE_TYPE (object
)),
15204 args
, complain
, in_decl
);
15206 member
= tsubst_copy (member
, args
, complain
, in_decl
);
15207 if (member
== error_mark_node
)
15208 RETURN (error_mark_node
);
15210 if (type_dependent_expression_p (object
))
15211 /* We can't do much here. */;
15212 else if (!CLASS_TYPE_P (object_type
))
15214 if (scalarish_type_p (object_type
))
15216 tree s
= NULL_TREE
;
15217 tree dtor
= member
;
15219 if (TREE_CODE (dtor
) == SCOPE_REF
)
15221 s
= TREE_OPERAND (dtor
, 0);
15222 dtor
= TREE_OPERAND (dtor
, 1);
15224 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
15226 dtor
= TREE_OPERAND (dtor
, 0);
15228 RETURN (finish_pseudo_destructor_expr
15229 (object
, s
, dtor
, input_location
));
15233 else if (TREE_CODE (member
) == SCOPE_REF
15234 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
15236 /* Lookup the template functions now that we know what the
15238 tree scope
= TREE_OPERAND (member
, 0);
15239 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
15240 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
15241 member
= lookup_qualified_name (scope
, tmpl
,
15242 /*is_type_p=*/false,
15243 /*complain=*/false);
15244 if (BASELINK_P (member
))
15246 BASELINK_FUNCTIONS (member
)
15247 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
15249 member
= (adjust_result_of_qualified_name_lookup
15250 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15255 qualified_name_lookup_error (scope
, tmpl
, member
,
15257 RETURN (error_mark_node
);
15260 else if (TREE_CODE (member
) == SCOPE_REF
15261 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15262 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15264 if (complain
& tf_error
)
15266 if (TYPE_P (TREE_OPERAND (member
, 0)))
15267 error ("%qT is not a class or namespace",
15268 TREE_OPERAND (member
, 0));
15270 error ("%qD is not a class or namespace",
15271 TREE_OPERAND (member
, 0));
15273 RETURN (error_mark_node
);
15275 else if (TREE_CODE (member
) == FIELD_DECL
)
15277 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15278 if (TREE_CODE (r
) == COMPONENT_REF
)
15279 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15283 r
= finish_class_member_access_expr (object
, member
,
15284 /*template_p=*/false,
15286 if (TREE_CODE (r
) == COMPONENT_REF
)
15287 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15292 RETURN (build_throw
15293 (RECUR (TREE_OPERAND (t
, 0))));
15297 vec
<constructor_elt
, va_gc
> *n
;
15298 constructor_elt
*ce
;
15299 unsigned HOST_WIDE_INT idx
;
15300 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15301 bool process_index_p
;
15303 bool need_copy_p
= false;
15306 if (type
== error_mark_node
)
15307 RETURN (error_mark_node
);
15309 /* digest_init will do the wrong thing if we let it. */
15310 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15313 /* We do not want to process the index of aggregate
15314 initializers as they are identifier nodes which will be
15315 looked up by digest_init. */
15316 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15318 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15319 newlen
= vec_safe_length (n
);
15320 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15322 if (ce
->index
&& process_index_p
15323 /* An identifier index is looked up in the type
15324 being initialized, not the current scope. */
15325 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15326 ce
->index
= RECUR (ce
->index
);
15328 if (PACK_EXPANSION_P (ce
->value
))
15330 /* Substitute into the pack expansion. */
15331 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15334 if (ce
->value
== error_mark_node
15335 || PACK_EXPANSION_P (ce
->value
))
15337 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15338 /* Just move the argument into place. */
15339 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15342 /* Update the length of the final CONSTRUCTOR
15343 arguments vector, and note that we will need to
15345 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15346 need_copy_p
= true;
15350 ce
->value
= RECUR (ce
->value
);
15355 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15357 vec_alloc (n
, newlen
);
15358 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15360 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15362 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15363 for (i
= 0; i
< len
; ++i
)
15364 CONSTRUCTOR_APPEND_ELT (n
, 0,
15365 TREE_VEC_ELT (ce
->value
, i
));
15368 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15372 r
= build_constructor (init_list_type_node
, n
);
15373 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15375 if (TREE_HAS_CONSTRUCTOR (t
))
15376 RETURN (finish_compound_literal (type
, r
, complain
));
15378 TREE_TYPE (r
) = type
;
15384 tree operand_0
= TREE_OPERAND (t
, 0);
15385 if (TYPE_P (operand_0
))
15387 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15388 RETURN (get_typeid (operand_0
, complain
));
15392 operand_0
= RECUR (operand_0
);
15393 RETURN (build_typeid (operand_0
, complain
));
15400 else if (DECL_PACK_P (t
))
15402 /* We don't build decls for an instantiation of a
15403 variadic capture proxy, we instantiate the elements
15405 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15406 return RECUR (DECL_VALUE_EXPR (t
));
15412 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15414 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15415 /* If the original type was a reference, we'll be wrapped in
15416 the appropriate INDIRECT_REF. */
15417 r
= convert_from_reference (r
);
15423 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15424 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15425 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
15428 case OFFSETOF_EXPR
:
15429 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0))));
15433 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15434 complain
, in_decl
);
15436 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15438 type2
= tsubst (type2
, args
, complain
, in_decl
);
15440 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15445 tree old_stmt_expr
= cur_stmt_expr
;
15446 tree stmt_expr
= begin_stmt_expr ();
15448 cur_stmt_expr
= stmt_expr
;
15449 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15450 integral_constant_expression_p
);
15451 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15452 cur_stmt_expr
= old_stmt_expr
;
15454 /* If the resulting list of expression statement is empty,
15455 fold it further into void_node. */
15456 if (empty_expr_stmt_p (stmt_expr
))
15457 stmt_expr
= void_node
;
15459 RETURN (stmt_expr
);
15464 tree r
= build_lambda_expr ();
15466 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15467 LAMBDA_EXPR_CLOSURE (r
) = type
;
15468 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15470 LAMBDA_EXPR_LOCATION (r
)
15471 = LAMBDA_EXPR_LOCATION (t
);
15472 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15473 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15474 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15475 LAMBDA_EXPR_DISCRIMINATOR (r
)
15476 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15477 /* For a function scope, we want to use tsubst so that we don't
15478 complain about referring to an auto function before its return
15479 type has been deduced. Otherwise, we want to use tsubst_copy so
15480 that we look up the existing field/parameter/variable rather
15481 than build a new one. */
15482 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15483 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15484 scope
= tsubst (scope
, args
, complain
, in_decl
);
15485 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15487 /* Look up the parameter we want directly, as tsubst_copy
15488 doesn't do what we need. */
15489 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15490 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15491 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15492 parm
= DECL_CHAIN (parm
);
15494 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15495 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15496 DECL_CONTEXT (scope
) = fn
;
15499 scope
= RECUR (scope
);
15500 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15501 LAMBDA_EXPR_RETURN_TYPE (r
)
15502 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15504 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15505 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15507 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15508 determine_visibility (TYPE_NAME (type
));
15509 /* Now that we know visibility, instantiate the type so we have a
15510 declaration of the op() for later calls to lambda_function. */
15511 complete_type (type
);
15513 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15515 RETURN (build_lambda_object (r
));
15519 /* We can get here for a constant initializer of non-dependent type.
15520 FIXME stop folding in cp_parser_initializer_clause. */
15522 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15527 case TRANSACTION_EXPR
:
15528 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15529 integral_constant_expression_p
));
15532 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15534 case VEC_PERM_EXPR
:
15536 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15537 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15538 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15539 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
15544 /* Handle Objective-C++ constructs, if appropriate. */
15547 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15548 in_decl
, /*function_p=*/false);
15552 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15558 input_location
= loc
;
15562 /* Verify that the instantiated ARGS are valid. For type arguments,
15563 make sure that the type's linkage is ok. For non-type arguments,
15564 make sure they are constants if they are integral or enumerations.
15565 Emit an error under control of COMPLAIN, and return TRUE on error. */
15568 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15570 if (dependent_template_arg_p (t
))
15572 if (ARGUMENT_PACK_P (t
))
15574 tree vec
= ARGUMENT_PACK_ARGS (t
);
15575 int len
= TREE_VEC_LENGTH (vec
);
15576 bool result
= false;
15579 for (i
= 0; i
< len
; ++i
)
15580 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15584 else if (TYPE_P (t
))
15586 /* [basic.link]: A name with no linkage (notably, the name
15587 of a class or enumeration declared in a local scope)
15588 shall not be used to declare an entity with linkage.
15589 This implies that names with no linkage cannot be used as
15592 DR 757 relaxes this restriction for C++0x. */
15593 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15594 : no_linkage_check (t
, /*relaxed_p=*/false));
15598 /* DR 488 makes use of a type with no linkage cause
15599 type deduction to fail. */
15600 if (complain
& tf_error
)
15602 if (TYPE_ANONYMOUS_P (nt
))
15603 error ("%qT is/uses anonymous type", t
);
15605 error ("template argument for %qD uses local type %qT",
15610 /* In order to avoid all sorts of complications, we do not
15611 allow variably-modified types as template arguments. */
15612 else if (variably_modified_type_p (t
, NULL_TREE
))
15614 if (complain
& tf_error
)
15615 error ("%qT is a variably modified type", t
);
15619 /* Class template and alias template arguments should be OK. */
15620 else if (DECL_TYPE_TEMPLATE_P (t
))
15622 /* A non-type argument of integral or enumerated type must be a
15624 else if (TREE_TYPE (t
)
15625 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15626 && !TREE_CONSTANT (t
))
15628 if (complain
& tf_error
)
15629 error ("integral expression %qE is not constant", t
);
15636 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15638 int ix
, len
= DECL_NTPARMS (tmpl
);
15639 bool result
= false;
15641 for (ix
= 0; ix
!= len
; ix
++)
15643 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15646 if (result
&& (complain
& tf_error
))
15647 error (" trying to instantiate %qD", tmpl
);
15651 /* We're out of SFINAE context now, so generate diagnostics for the access
15652 errors we saw earlier when instantiating D from TMPL and ARGS. */
15655 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15657 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15658 tree type
= TREE_TYPE (pattern
);
15659 location_t loc
= input_location
;
15661 push_access_scope (d
);
15662 push_deferring_access_checks (dk_no_deferred
);
15663 input_location
= DECL_SOURCE_LOCATION (pattern
);
15664 tsubst (type
, args
, tf_warning_or_error
, d
);
15665 input_location
= loc
;
15666 pop_deferring_access_checks ();
15667 pop_access_scope (d
);
15670 /* Instantiate the indicated variable, function, or alias template TMPL with
15671 the template arguments in TARG_PTR. */
15674 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15676 tree targ_ptr
= orig_args
;
15680 bool access_ok
= true;
15682 if (tmpl
== error_mark_node
)
15683 return error_mark_node
;
15685 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15687 /* If this function is a clone, handle it specially. */
15688 if (DECL_CLONED_FUNCTION_P (tmpl
))
15693 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15694 DECL_CLONED_FUNCTION. */
15695 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
15696 targ_ptr
, complain
);
15697 if (spec
== error_mark_node
)
15698 return error_mark_node
;
15700 /* Look for the clone. */
15701 FOR_EACH_CLONE (clone
, spec
)
15702 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
15704 /* We should always have found the clone by now. */
15705 gcc_unreachable ();
15709 if (targ_ptr
== error_mark_node
)
15710 return error_mark_node
;
15712 /* Check to see if we already have this specialization. */
15713 gen_tmpl
= most_general_template (tmpl
);
15714 if (tmpl
!= gen_tmpl
)
15715 /* The TMPL is a partial instantiation. To get a full set of
15716 arguments we must add the arguments used to perform the
15717 partial instantiation. */
15718 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
15721 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15722 but it doesn't seem to be on the hot path. */
15723 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
15725 gcc_assert (tmpl
== gen_tmpl
15726 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
15728 || fndecl
== NULL_TREE
);
15730 if (spec
!= NULL_TREE
)
15732 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
15734 if (complain
& tf_error
)
15735 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
15736 return error_mark_node
;
15741 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
15743 return error_mark_node
;
15745 /* We are building a FUNCTION_DECL, during which the access of its
15746 parameters and return types have to be checked. However this
15747 FUNCTION_DECL which is the desired context for access checking
15748 is not built yet. We solve this chicken-and-egg problem by
15749 deferring all checks until we have the FUNCTION_DECL. */
15750 push_deferring_access_checks (dk_deferred
);
15752 /* Instantiation of the function happens in the context of the function
15753 template, not the context of the overload resolution we're doing. */
15754 push_to_top_level ();
15755 /* If there are dependent arguments, e.g. because we're doing partial
15756 ordering, make sure processing_template_decl stays set. */
15757 if (uses_template_parms (targ_ptr
))
15758 ++processing_template_decl
;
15759 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15761 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
15762 complain
, gen_tmpl
);
15763 push_nested_class (ctx
);
15765 /* Substitute template parameters to obtain the specialization. */
15766 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
15767 targ_ptr
, complain
, gen_tmpl
);
15768 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15769 pop_nested_class ();
15770 pop_from_top_level ();
15772 if (fndecl
== error_mark_node
)
15774 pop_deferring_access_checks ();
15775 return error_mark_node
;
15778 /* The DECL_TI_TEMPLATE should always be the immediate parent
15779 template, not the most general template. */
15780 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
15782 /* Now we know the specialization, compute access previously
15784 push_access_scope (fndecl
);
15785 if (!perform_deferred_access_checks (complain
))
15787 pop_access_scope (fndecl
);
15788 pop_deferring_access_checks ();
15790 /* If we've just instantiated the main entry point for a function,
15791 instantiate all the alternate entry points as well. We do this
15792 by cloning the instantiation of the main entry point, not by
15793 instantiating the template clones. */
15794 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
15795 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
15799 if (!(complain
& tf_error
))
15801 /* Remember to reinstantiate when we're out of SFINAE so the user
15802 can see the errors. */
15803 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
15805 return error_mark_node
;
15810 /* Wrapper for instantiate_template_1. */
15813 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15816 timevar_push (TV_TEMPLATE_INST
);
15817 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
15818 timevar_pop (TV_TEMPLATE_INST
);
15822 /* Instantiate the alias template TMPL with ARGS. Also push a template
15823 instantiation level, which instantiate_template doesn't do because
15824 functions and variables have sufficient context established by the
15828 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
15830 struct pending_template
*old_last_pend
= last_pending_template
;
15831 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15832 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
15833 return error_mark_node
;
15834 tree tinst
= build_tree_list (tmpl
, args
);
15835 if (!push_tinst_level (tinst
))
15838 return error_mark_node
;
15842 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
15843 args
, tmpl
, complain
,
15844 /*require_all_args=*/true,
15845 /*use_default_args=*/true);
15847 tree r
= instantiate_template (tmpl
, args
, complain
);
15848 pop_tinst_level ();
15849 /* We can't free this if a pending_template entry or last_error_tinst_level
15850 is pointing at it. */
15851 if (last_pending_template
== old_last_pend
15852 && last_error_tinst_level
== old_error_tinst
)
15858 /* PARM is a template parameter pack for FN. Returns true iff
15859 PARM is used in a deducible way in the argument list of FN. */
15862 pack_deducible_p (tree parm
, tree fn
)
15864 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
15865 for (; t
; t
= TREE_CHAIN (t
))
15867 tree type
= TREE_VALUE (t
);
15869 if (!PACK_EXPANSION_P (type
))
15871 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
15872 packs
; packs
= TREE_CHAIN (packs
))
15873 if (template_args_equal (TREE_VALUE (packs
), parm
))
15875 /* The template parameter pack is used in a function parameter
15876 pack. If this is the end of the parameter list, the
15877 template parameter pack is deducible. */
15878 if (TREE_CHAIN (t
) == void_list_node
)
15881 /* Otherwise, not. Well, it could be deduced from
15882 a non-pack parameter, but doing so would end up with
15883 a deduction mismatch, so don't bother. */
15887 /* The template parameter pack isn't used in any function parameter
15888 packs, but it might be used deeper, e.g. tuple<Args...>. */
15892 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
15893 NARGS elements of the arguments that are being used when calling
15894 it. TARGS is a vector into which the deduced template arguments
15897 Returns either a FUNCTION_DECL for the matching specialization of FN or
15898 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
15899 true, diagnostics will be printed to explain why it failed.
15901 If FN is a conversion operator, or we are trying to produce a specific
15902 specialization, RETURN_TYPE is the return type desired.
15904 The EXPLICIT_TARGS are explicit template arguments provided via a
15907 The parameter STRICT is one of:
15910 We are deducing arguments for a function call, as in
15911 [temp.deduct.call].
15914 We are deducing arguments for a conversion function, as in
15915 [temp.deduct.conv].
15918 We are deducing arguments when doing an explicit instantiation
15919 as in [temp.explicit], when determining an explicit specialization
15920 as in [temp.expl.spec], or when taking the address of a function
15921 template, as in [temp.deduct.funcaddr]. */
15924 fn_type_unification (tree fn
,
15925 tree explicit_targs
,
15928 unsigned int nargs
,
15930 unification_kind_t strict
,
15937 tree decl
= NULL_TREE
;
15938 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
15940 static int deduction_depth
;
15941 struct pending_template
*old_last_pend
= last_pending_template
;
15942 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15943 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
15945 tree r
= error_mark_node
;
15948 complain
|= tf_decltype
;
15950 /* In C++0x, it's possible to have a function template whose type depends
15951 on itself recursively. This is most obvious with decltype, but can also
15952 occur with enumeration scope (c++/48969). So we need to catch infinite
15953 recursion and reject the substitution at deduction time; this function
15954 will return error_mark_node for any repeated substitution.
15956 This also catches excessive recursion such as when f<N> depends on
15957 f<N-1> across all integers, and returns error_mark_node for all the
15958 substitutions back up to the initial one.
15960 This is, of course, not reentrant. */
15961 if (excessive_deduction_depth
)
15962 return error_mark_node
;
15963 tinst
= build_tree_list (fn
, NULL_TREE
);
15966 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
15968 fntype
= TREE_TYPE (fn
);
15969 if (explicit_targs
)
15973 The specified template arguments must match the template
15974 parameters in kind (i.e., type, nontype, template), and there
15975 must not be more arguments than there are parameters;
15976 otherwise type deduction fails.
15978 Nontype arguments must match the types of the corresponding
15979 nontype template parameters, or must be convertible to the
15980 types of the corresponding nontype parameters as specified in
15981 _temp.arg.nontype_, otherwise type deduction fails.
15983 All references in the function type of the function template
15984 to the corresponding template parameters are replaced by the
15985 specified template argument values. If a substitution in a
15986 template parameter or in the function type of the function
15987 template results in an invalid type, type deduction fails. */
15988 int i
, len
= TREE_VEC_LENGTH (tparms
);
15989 location_t loc
= input_location
;
15990 bool incomplete
= false;
15992 /* Adjust any explicit template arguments before entering the
15993 substitution context. */
15995 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
15997 /*require_all_args=*/false,
15998 /*use_default_args=*/false));
15999 if (explicit_targs
== error_mark_node
)
16002 /* Substitute the explicit args into the function type. This is
16003 necessary so that, for instance, explicitly declared function
16004 arguments can match null pointed constants. If we were given
16005 an incomplete set of explicit args, we must not do semantic
16006 processing during substitution as we could create partial
16008 for (i
= 0; i
< len
; i
++)
16010 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16011 bool parameter_pack
= false;
16012 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
16014 /* Dig out the actual parm. */
16015 if (TREE_CODE (parm
) == TYPE_DECL
16016 || TREE_CODE (parm
) == TEMPLATE_DECL
)
16018 parm
= TREE_TYPE (parm
);
16019 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
16021 else if (TREE_CODE (parm
) == PARM_DECL
)
16023 parm
= DECL_INITIAL (parm
);
16024 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16027 if (!parameter_pack
&& targ
== NULL_TREE
)
16028 /* No explicit argument for this template parameter. */
16031 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16033 /* Mark the argument pack as "incomplete". We could
16034 still deduce more arguments during unification.
16035 We remove this mark in type_unification_real. */
16038 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16039 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16040 = ARGUMENT_PACK_ARGS (targ
);
16043 /* We have some incomplete argument packs. */
16048 TREE_VALUE (tinst
) = explicit_targs
;
16049 if (!push_tinst_level (tinst
))
16051 excessive_deduction_depth
= true;
16054 processing_template_decl
+= incomplete
;
16055 input_location
= DECL_SOURCE_LOCATION (fn
);
16056 /* Ignore any access checks; we'll see them again in
16057 instantiate_template and they might have the wrong
16058 access path at this point. */
16059 push_deferring_access_checks (dk_deferred
);
16060 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16061 complain
| tf_partial
, NULL_TREE
);
16062 pop_deferring_access_checks ();
16063 input_location
= loc
;
16064 processing_template_decl
-= incomplete
;
16065 pop_tinst_level ();
16067 if (fntype
== error_mark_node
)
16070 /* Place the explicitly specified arguments in TARGS. */
16071 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16072 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16075 /* Never do unification on the 'this' parameter. */
16076 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16082 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16083 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16084 new_args
[0] = return_type
;
16085 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16090 /* We allow incomplete unification without an error message here
16091 because the standard doesn't seem to explicitly prohibit it. Our
16092 callers must be ready to deal with unification failures in any
16095 TREE_VALUE (tinst
) = targs
;
16096 /* If we aren't explaining yet, push tinst context so we can see where
16097 any errors (e.g. from class instantiations triggered by instantiation
16098 of default template arguments) come from. If we are explaining, this
16099 context is redundant. */
16100 if (!explain_p
&& !push_tinst_level (tinst
))
16102 excessive_deduction_depth
= true;
16106 /* type_unification_real will pass back any access checks from default
16107 template argument substitution. */
16108 vec
<deferred_access_check
, va_gc
> *checks
;
16111 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16112 targs
, parms
, args
, nargs
, /*subr=*/0,
16113 strict
, flags
, &checks
, explain_p
);
16115 pop_tinst_level ();
16119 /* Now that we have bindings for all of the template arguments,
16120 ensure that the arguments deduced for the template template
16121 parameters have compatible template parameter lists. We cannot
16122 check this property before we have deduced all template
16123 arguments, because the template parameter types of a template
16124 template parameter might depend on prior template parameters
16125 deduced after the template template parameter. The following
16126 ill-formed example illustrates this issue:
16128 template<typename T, template<T> class C> void f(C<5>, T);
16130 template<int N> struct X {};
16133 f(X<5>(), 5l); // error: template argument deduction fails
16136 The template parameter list of 'C' depends on the template type
16137 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16138 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16139 time that we deduce 'C'. */
16140 if (!template_template_parm_bindings_ok_p
16141 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
16143 unify_inconsistent_template_template_parameters (explain_p
);
16147 /* All is well so far. Now, check:
16151 When all template arguments have been deduced, all uses of
16152 template parameters in nondeduced contexts are replaced with
16153 the corresponding deduced argument values. If the
16154 substitution results in an invalid type, as described above,
16155 type deduction fails. */
16156 TREE_VALUE (tinst
) = targs
;
16157 if (!push_tinst_level (tinst
))
16159 excessive_deduction_depth
= true;
16163 /* Also collect access checks from the instantiation. */
16164 reopen_deferring_access_checks (checks
);
16166 decl
= instantiate_template (fn
, targs
, complain
);
16168 checks
= get_deferred_access_checks ();
16169 pop_deferring_access_checks ();
16171 pop_tinst_level ();
16173 if (decl
== error_mark_node
)
16176 /* Now perform any access checks encountered during substitution. */
16177 push_access_scope (decl
);
16178 ok
= perform_access_checks (checks
, complain
);
16179 pop_access_scope (decl
);
16183 /* If we're looking for an exact match, check that what we got
16184 is indeed an exact match. It might not be if some template
16185 parameters are used in non-deduced contexts. But don't check
16186 for an exact match if we have dependent template arguments;
16187 in that case we're doing partial ordering, and we already know
16188 that we have two candidates that will provide the actual type. */
16189 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
16191 tree substed
= TREE_TYPE (decl
);
16195 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
16197 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
16198 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
16199 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
16201 unify_type_mismatch (explain_p
, args
[i
],
16202 TREE_VALUE (sarg
));
16211 if (excessive_deduction_depth
)
16213 if (deduction_depth
== 0)
16214 /* Reset once we're all the way out. */
16215 excessive_deduction_depth
= false;
16218 /* We can't free this if a pending_template entry or last_error_tinst_level
16219 is pointing at it. */
16220 if (last_pending_template
== old_last_pend
16221 && last_error_tinst_level
== old_error_tinst
)
16227 /* Adjust types before performing type deduction, as described in
16228 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16229 sections are symmetric. PARM is the type of a function parameter
16230 or the return type of the conversion function. ARG is the type of
16231 the argument passed to the call, or the type of the value
16232 initialized with the result of the conversion function.
16233 ARG_EXPR is the original argument expression, which may be null. */
16236 maybe_adjust_types_for_deduction (unification_kind_t strict
,
16250 /* Swap PARM and ARG throughout the remainder of this
16251 function; the handling is precisely symmetric since PARM
16252 will initialize ARG rather than vice versa. */
16260 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16261 too, but here handle it by stripping the reference from PARM
16262 rather than by adding it to ARG. */
16263 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16264 && TYPE_REF_IS_RVALUE (*parm
)
16265 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16266 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16267 && TREE_CODE (*arg
) == REFERENCE_TYPE
16268 && !TYPE_REF_IS_RVALUE (*arg
))
16269 *parm
= TREE_TYPE (*parm
);
16270 /* Nothing else to do in this case. */
16274 gcc_unreachable ();
16277 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16279 /* [temp.deduct.call]
16281 If P is not a reference type:
16283 --If A is an array type, the pointer type produced by the
16284 array-to-pointer standard conversion (_conv.array_) is
16285 used in place of A for type deduction; otherwise,
16287 --If A is a function type, the pointer type produced by
16288 the function-to-pointer standard conversion
16289 (_conv.func_) is used in place of A for type deduction;
16292 --If A is a cv-qualified type, the top level
16293 cv-qualifiers of A's type are ignored for type
16295 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16296 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16297 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16298 *arg
= build_pointer_type (*arg
);
16300 *arg
= TYPE_MAIN_VARIANT (*arg
);
16303 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16304 of the form T&&, where T is a template parameter, and the argument
16305 is an lvalue, T is deduced as A& */
16306 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16307 && TYPE_REF_IS_RVALUE (*parm
)
16308 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16309 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16310 && (arg_expr
? real_lvalue_p (arg_expr
)
16311 /* try_one_overload doesn't provide an arg_expr, but
16312 functions are always lvalues. */
16313 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16314 *arg
= build_reference_type (*arg
);
16316 /* [temp.deduct.call]
16318 If P is a cv-qualified type, the top level cv-qualifiers
16319 of P's type are ignored for type deduction. If P is a
16320 reference type, the type referred to by P is used for
16322 *parm
= TYPE_MAIN_VARIANT (*parm
);
16323 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16325 *parm
= TREE_TYPE (*parm
);
16326 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16329 /* DR 322. For conversion deduction, remove a reference type on parm
16330 too (which has been swapped into ARG). */
16331 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16332 *arg
= TREE_TYPE (*arg
);
16337 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16338 template which does contain any deducible template parameters; check if
16339 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16340 unify_one_argument. */
16343 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16344 int flags
, bool explain_p
)
16349 type
= TREE_TYPE (arg
);
16353 if (same_type_p (parm
, type
))
16354 return unify_success (explain_p
);
16356 if (strict
== DEDUCE_CONV
)
16358 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16359 explain_p
? tf_warning_or_error
: tf_none
))
16360 return unify_success (explain_p
);
16362 else if (strict
!= DEDUCE_EXACT
)
16364 if (can_convert_arg (parm
, type
,
16365 TYPE_P (arg
) ? NULL_TREE
: arg
,
16366 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16367 return unify_success (explain_p
);
16370 if (strict
== DEDUCE_EXACT
)
16371 return unify_type_mismatch (explain_p
, parm
, arg
);
16373 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16376 static bool uses_deducible_template_parms (tree type
);
16378 /* Returns true iff the expression EXPR is one from which a template
16379 argument can be deduced. In other words, if it's an undecorated
16380 use of a template non-type parameter. */
16383 deducible_expression (tree expr
)
16385 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16388 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16389 deducible way; that is, if it has a max value of <PARM> - 1. */
16392 deducible_array_bound (tree domain
)
16394 if (domain
== NULL_TREE
)
16397 tree max
= TYPE_MAX_VALUE (domain
);
16398 if (TREE_CODE (max
) != MINUS_EXPR
)
16401 return deducible_expression (TREE_OPERAND (max
, 0));
16404 /* Returns true iff the template arguments ARGS use a template parameter
16405 in a deducible way. */
16408 deducible_template_args (tree args
)
16410 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16413 tree elt
= TREE_VEC_ELT (args
, i
);
16414 if (ARGUMENT_PACK_P (elt
))
16415 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16418 if (PACK_EXPANSION_P (elt
))
16419 elt
= PACK_EXPANSION_PATTERN (elt
);
16420 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16422 else if (TYPE_P (elt
))
16423 deducible
= uses_deducible_template_parms (elt
);
16425 deducible
= deducible_expression (elt
);
16433 /* Returns true iff TYPE contains any deducible references to template
16434 parameters, as per 14.8.2.5. */
16437 uses_deducible_template_parms (tree type
)
16439 if (PACK_EXPANSION_P (type
))
16440 type
= PACK_EXPANSION_PATTERN (type
);
16447 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16448 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16454 if (POINTER_TYPE_P (type
))
16455 return uses_deducible_template_parms (TREE_TYPE (type
));
16457 /* T[integer-constant ]
16459 if (TREE_CODE (type
) == ARRAY_TYPE
)
16460 return (uses_deducible_template_parms (TREE_TYPE (type
))
16461 || deducible_array_bound (TYPE_DOMAIN (type
)));
16473 if (TYPE_PTRMEM_P (type
))
16474 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16475 || (uses_deducible_template_parms
16476 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16478 /* template-name <T> (where template-name refers to a class template)
16479 template-name <i> (where template-name refers to a class template) */
16480 if (CLASS_TYPE_P (type
)
16481 && CLASSTYPE_TEMPLATE_INFO (type
)
16482 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16483 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16484 (CLASSTYPE_TI_ARGS (type
)));
16489 if (TREE_CODE (type
) == FUNCTION_TYPE
16490 || TREE_CODE (type
) == METHOD_TYPE
)
16492 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16494 tree parm
= TYPE_ARG_TYPES (type
);
16495 if (TREE_CODE (type
) == METHOD_TYPE
)
16496 parm
= TREE_CHAIN (parm
);
16497 for (; parm
; parm
= TREE_CHAIN (parm
))
16498 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16505 /* Subroutine of type_unification_real and unify_pack_expansion to
16506 handle unification of a single P/A pair. Parameters are as
16507 for those functions. */
16510 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16511 int subr
, unification_kind_t strict
, int flags
,
16514 tree arg_expr
= NULL_TREE
;
16517 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16518 return unify_invalid (explain_p
);
16519 if (arg
== unknown_type_node
)
16520 /* We can't deduce anything from this, but we might get all the
16521 template args from other function args. */
16522 return unify_success (explain_p
);
16524 /* Implicit conversions (Clause 4) will be performed on a function
16525 argument to convert it to the type of the corresponding function
16526 parameter if the parameter type contains no template-parameters that
16527 participate in template argument deduction. */
16528 if (TYPE_P (parm
) && !uses_template_parms (parm
))
16529 /* For function parameters that contain no template-parameters at all,
16530 we have historically checked for convertibility in order to shortcut
16531 consideration of this candidate. */
16532 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
16534 else if (strict
== DEDUCE_CALL
16535 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16536 /* For function parameters with only non-deducible template parameters,
16538 return unify_success (explain_p
);
16543 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16544 | UNIFY_ALLOW_MORE_CV_QUAL
16545 | UNIFY_ALLOW_DERIVED
);
16549 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16553 arg_strict
= UNIFY_ALLOW_NONE
;
16557 gcc_unreachable ();
16560 /* We only do these transformations if this is the top-level
16561 parameter_type_list in a call or declaration matching; in other
16562 situations (nested function declarators, template argument lists) we
16563 won't be comparing a type to an expression, and we don't do any type
16569 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16570 if (type_unknown_p (arg
))
16572 /* [temp.deduct.type] A template-argument can be
16573 deduced from a pointer to function or pointer
16574 to member function argument if the set of
16575 overloaded functions does not contain function
16576 templates and at most one of a set of
16577 overloaded functions provides a unique
16580 if (resolve_overloaded_unification
16581 (tparms
, targs
, parm
, arg
, strict
,
16582 arg_strict
, explain_p
))
16583 return unify_success (explain_p
);
16584 return unify_overload_resolution_failure (explain_p
, arg
);
16588 arg
= unlowered_expr_type (arg
);
16589 if (arg
== error_mark_node
)
16590 return unify_invalid (explain_p
);
16594 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16597 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16598 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
16599 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16601 /* For deduction from an init-list we need the actual list. */
16602 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16604 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16607 /* Most parms like fn_type_unification.
16609 If SUBR is 1, we're being called recursively (to unify the
16610 arguments of a function or method parameter of a function
16613 CHECKS is a pointer to a vector of access checks encountered while
16614 substituting default template arguments. */
16617 type_unification_real (tree tparms
,
16621 unsigned int xnargs
,
16623 unification_kind_t strict
,
16625 vec
<deferred_access_check
, va_gc
> **checks
,
16630 int ntparms
= TREE_VEC_LENGTH (tparms
);
16631 int saw_undeduced
= 0;
16634 unsigned int nargs
;
16637 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16638 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16639 gcc_assert (ntparms
> 0);
16641 /* Reset the number of non-defaulted template arguments contained
16643 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16651 while (parms
&& parms
!= void_list_node
16654 parm
= TREE_VALUE (parms
);
16656 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16657 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16658 /* For a function parameter pack that occurs at the end of the
16659 parameter-declaration-list, the type A of each remaining
16660 argument of the call is compared with the type P of the
16661 declarator-id of the function parameter pack. */
16664 parms
= TREE_CHAIN (parms
);
16666 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16667 /* For a function parameter pack that does not occur at the
16668 end of the parameter-declaration-list, the type of the
16669 parameter pack is a non-deduced context. */
16675 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16681 && parms
!= void_list_node
16682 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16684 /* Unify the remaining arguments with the pack expansion type. */
16686 tree parmvec
= make_tree_vec (1);
16688 /* Allocate a TREE_VEC and copy in all of the arguments */
16689 argvec
= make_tree_vec (nargs
- ia
);
16690 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
16691 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
16693 /* Copy the parameter into parmvec. */
16694 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
16695 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
16696 /*subr=*/subr
, explain_p
))
16699 /* Advance to the end of the list of parameters. */
16700 parms
= TREE_CHAIN (parms
);
16703 /* Fail if we've reached the end of the parm list, and more args
16704 are present, and the parm list isn't variadic. */
16705 if (ia
< nargs
&& parms
== void_list_node
)
16706 return unify_too_many_arguments (explain_p
, nargs
, ia
);
16707 /* Fail if parms are left and they don't have default values and
16708 they aren't all deduced as empty packs (c++/57397). This is
16709 consistent with sufficient_parms_p. */
16710 if (parms
&& parms
!= void_list_node
16711 && TREE_PURPOSE (parms
) == NULL_TREE
)
16713 unsigned int count
= nargs
;
16718 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
16721 p
= TREE_CHAIN (p
);
16723 while (p
&& p
!= void_list_node
);
16724 if (count
!= nargs
)
16725 return unify_too_few_arguments (explain_p
, ia
, count
,
16731 tsubst_flags_t complain
= (explain_p
16732 ? tf_warning_or_error
16735 for (i
= 0; i
< ntparms
; i
++)
16737 tree targ
= TREE_VEC_ELT (targs
, i
);
16738 tree tparm
= TREE_VEC_ELT (tparms
, i
);
16740 /* Clear the "incomplete" flags on all argument packs now so that
16741 substituting them into later default arguments works. */
16742 if (targ
&& ARGUMENT_PACK_P (targ
))
16744 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
16745 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
16748 if (targ
|| tparm
== error_mark_node
)
16750 tparm
= TREE_VALUE (tparm
);
16752 /* If this is an undeduced nontype parameter that depends on
16753 a type parameter, try another pass; its type may have been
16754 deduced from a later argument than the one from which
16755 this parameter can be deduced. */
16756 if (TREE_CODE (tparm
) == PARM_DECL
16757 && uses_template_parms (TREE_TYPE (tparm
))
16758 && !saw_undeduced
++)
16761 /* Core issue #226 (C++0x) [temp.deduct]:
16763 If a template argument has not been deduced, its
16764 default template argument, if any, is used.
16766 When we are in C++98 mode, TREE_PURPOSE will either
16767 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16768 to explicitly check cxx_dialect here. */
16769 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
16771 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16772 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
16773 reopen_deferring_access_checks (*checks
);
16774 location_t save_loc
= input_location
;
16776 input_location
= DECL_SOURCE_LOCATION (parm
);
16777 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
16778 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
16780 input_location
= save_loc
;
16781 *checks
= get_deferred_access_checks ();
16782 pop_deferring_access_checks ();
16783 if (arg
== error_mark_node
)
16787 TREE_VEC_ELT (targs
, i
) = arg
;
16788 /* The position of the first default template argument,
16789 is also the number of non-defaulted arguments in TARGS.
16791 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16792 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
16797 /* If the type parameter is a parameter pack, then it will
16798 be deduced to an empty parameter pack. */
16799 if (template_parameter_pack_p (tparm
))
16803 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
16805 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
16806 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
16807 TREE_CONSTANT (arg
) = 1;
16810 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16812 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
16814 TREE_VEC_ELT (targs
, i
) = arg
;
16818 return unify_parameter_deduction_failure (explain_p
, tparm
);
16821 #ifdef ENABLE_CHECKING
16822 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16823 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
16826 return unify_success (explain_p
);
16829 /* Subroutine of type_unification_real. Args are like the variables
16830 at the call site. ARG is an overloaded function (or template-id);
16831 we try deducing template args from each of the overloads, and if
16832 only one succeeds, we go with that. Modifies TARGS and returns
16833 true on success. */
16836 resolve_overloaded_unification (tree tparms
,
16840 unification_kind_t strict
,
16844 tree tempargs
= copy_node (targs
);
16846 tree goodfn
= NULL_TREE
;
16849 if (TREE_CODE (arg
) == ADDR_EXPR
)
16851 arg
= TREE_OPERAND (arg
, 0);
16857 if (TREE_CODE (arg
) == COMPONENT_REF
)
16858 /* Handle `&x' where `x' is some static or non-static member
16860 arg
= TREE_OPERAND (arg
, 1);
16862 if (TREE_CODE (arg
) == OFFSET_REF
)
16863 arg
= TREE_OPERAND (arg
, 1);
16865 /* Strip baselink information. */
16866 if (BASELINK_P (arg
))
16867 arg
= BASELINK_FUNCTIONS (arg
);
16869 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
16871 /* If we got some explicit template args, we need to plug them into
16872 the affected templates before we try to unify, in case the
16873 explicit args will completely resolve the templates in question. */
16876 tree expl_subargs
= TREE_OPERAND (arg
, 1);
16877 arg
= TREE_OPERAND (arg
, 0);
16879 for (; arg
; arg
= OVL_NEXT (arg
))
16881 tree fn
= OVL_CURRENT (arg
);
16882 tree subargs
, elem
;
16884 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16887 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16888 expl_subargs
, NULL_TREE
, tf_none
,
16889 /*require_all_args=*/true,
16890 /*use_default_args=*/true);
16891 if (subargs
!= error_mark_node
16892 && !any_dependent_template_arguments_p (subargs
))
16894 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
16895 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16896 elem
, strict
, sub_strict
, addr_p
, explain_p
)
16897 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
16906 /* If no templates (or more than one) are fully resolved by the
16907 explicit arguments, this template-id is a non-deduced context; it
16908 could still be OK if we deduce all template arguments for the
16909 enclosing call through other arguments. */
16913 else if (TREE_CODE (arg
) != OVERLOAD
16914 && TREE_CODE (arg
) != FUNCTION_DECL
)
16915 /* If ARG is, for example, "(0, &f)" then its type will be unknown
16916 -- but the deduction does not succeed because the expression is
16917 not just the function on its own. */
16920 for (; arg
; arg
= OVL_NEXT (arg
))
16921 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16922 TREE_TYPE (OVL_CURRENT (arg
)),
16923 strict
, sub_strict
, addr_p
, explain_p
)
16924 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
16926 goodfn
= OVL_CURRENT (arg
);
16930 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16931 to function or pointer to member function argument if the set of
16932 overloaded functions does not contain function templates and at most
16933 one of a set of overloaded functions provides a unique match.
16935 So if we found multiple possibilities, we return success but don't
16936 deduce anything. */
16940 int i
= TREE_VEC_LENGTH (targs
);
16942 if (TREE_VEC_ELT (tempargs
, i
))
16944 tree old
= TREE_VEC_ELT (targs
, i
);
16945 tree new_
= TREE_VEC_ELT (tempargs
, i
);
16946 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
16947 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
16948 /* Don't forget explicit template arguments in a pack. */
16949 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
16950 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
16951 TREE_VEC_ELT (targs
, i
) = new_
;
16960 /* Core DR 115: In contexts where deduction is done and fails, or in
16961 contexts where deduction is not done, if a template argument list is
16962 specified and it, along with any default template arguments, identifies
16963 a single function template specialization, then the template-id is an
16964 lvalue for the function template specialization. */
16967 resolve_nondeduced_context (tree orig_expr
)
16969 tree expr
, offset
, baselink
;
16972 if (!type_unknown_p (orig_expr
))
16977 offset
= NULL_TREE
;
16978 baselink
= NULL_TREE
;
16980 if (TREE_CODE (expr
) == ADDR_EXPR
)
16982 expr
= TREE_OPERAND (expr
, 0);
16985 if (TREE_CODE (expr
) == OFFSET_REF
)
16988 expr
= TREE_OPERAND (expr
, 1);
16990 if (BASELINK_P (expr
))
16993 expr
= BASELINK_FUNCTIONS (expr
);
16996 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
16999 tree goodfn
= NULL_TREE
;
17001 /* If we got some explicit template args, we need to plug them into
17002 the affected templates before we try to unify, in case the
17003 explicit args will completely resolve the templates in question. */
17005 tree expl_subargs
= TREE_OPERAND (expr
, 1);
17006 tree arg
= TREE_OPERAND (expr
, 0);
17007 tree badfn
= NULL_TREE
;
17008 tree badargs
= NULL_TREE
;
17010 for (; arg
; arg
= OVL_NEXT (arg
))
17012 tree fn
= OVL_CURRENT (arg
);
17013 tree subargs
, elem
;
17015 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17018 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17019 expl_subargs
, NULL_TREE
, tf_none
,
17020 /*require_all_args=*/true,
17021 /*use_default_args=*/true);
17022 if (subargs
!= error_mark_node
17023 && !any_dependent_template_arguments_p (subargs
))
17025 elem
= instantiate_template (fn
, subargs
, tf_none
);
17026 if (elem
== error_mark_node
)
17031 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17040 mark_used (goodfn
);
17043 expr
= build_baselink (BASELINK_BINFO (baselink
),
17044 BASELINK_ACCESS_BINFO (baselink
),
17045 expr
, BASELINK_OPTYPE (baselink
));
17049 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17050 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17053 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17056 else if (good
== 0 && badargs
)
17057 /* There were no good options and at least one bad one, so let the
17058 user know what the problem is. */
17059 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17064 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17065 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17066 different overloads deduce different arguments for a given parm.
17067 ADDR_P is true if the expression for which deduction is being
17068 performed was of the form "& fn" rather than simply "fn".
17070 Returns 1 on success. */
17073 try_one_overload (tree tparms
,
17078 unification_kind_t strict
,
17087 if (arg
== error_mark_node
)
17090 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17091 to function or pointer to member function argument if the set of
17092 overloaded functions does not contain function templates and at most
17093 one of a set of overloaded functions provides a unique match.
17095 So if this is a template, just return success. */
17097 if (uses_template_parms (arg
))
17100 if (TREE_CODE (arg
) == METHOD_TYPE
)
17101 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
17103 arg
= build_pointer_type (arg
);
17105 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
17107 /* We don't copy orig_targs for this because if we have already deduced
17108 some template args from previous args, unify would complain when we
17109 try to deduce a template parameter for the same argument, even though
17110 there isn't really a conflict. */
17111 nargs
= TREE_VEC_LENGTH (targs
);
17112 tempargs
= make_tree_vec (nargs
);
17114 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
17117 /* First make sure we didn't deduce anything that conflicts with
17118 explicitly specified args. */
17119 for (i
= nargs
; i
--; )
17121 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17122 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
17126 else if (uses_template_parms (elt
))
17127 /* Since we're unifying against ourselves, we will fill in
17128 template args used in the function parm list with our own
17129 template parms. Discard them. */
17130 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
17131 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
17135 for (i
= nargs
; i
--; )
17137 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17140 TREE_VEC_ELT (targs
, i
) = elt
;
17146 /* PARM is a template class (perhaps with unbound template
17147 parameters). ARG is a fully instantiated type. If ARG can be
17148 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
17149 TARGS are as for unify. */
17152 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
17155 tree copy_of_targs
;
17157 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
17158 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
17159 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
17162 /* We need to make a new template argument vector for the call to
17163 unify. If we used TARGS, we'd clutter it up with the result of
17164 the attempted unification, even if this class didn't work out.
17165 We also don't want to commit ourselves to all the unifications
17166 we've already done, since unification is supposed to be done on
17167 an argument-by-argument basis. In other words, consider the
17168 following pathological case:
17170 template <int I, int J, int K>
17173 template <int I, int J>
17174 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
17176 template <int I, int J, int K>
17177 void f(S<I, J, K>, S<I, I, I>);
17186 Now, by the time we consider the unification involving `s2', we
17187 already know that we must have `f<0, 0, 0>'. But, even though
17188 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17189 because there are two ways to unify base classes of S<0, 1, 2>
17190 with S<I, I, I>. If we kept the already deduced knowledge, we
17191 would reject the possibility I=1. */
17192 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
17194 /* If unification failed, we're done. */
17195 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
17196 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
17202 /* Given a template type PARM and a class type ARG, find the unique
17203 base type in ARG that is an instance of PARM. We do not examine
17204 ARG itself; only its base-classes. If there is not exactly one
17205 appropriate base class, return NULL_TREE. PARM may be the type of
17206 a partial specialization, as well as a plain template type. Used
17209 static enum template_base_result
17210 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
17211 bool explain_p
, tree
*result
)
17213 tree rval
= NULL_TREE
;
17216 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
17218 binfo
= TYPE_BINFO (complete_type (arg
));
17221 /* The type could not be completed. */
17222 *result
= NULL_TREE
;
17223 return tbr_incomplete_type
;
17226 /* Walk in inheritance graph order. The search order is not
17227 important, and this avoids multiple walks of virtual bases. */
17228 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
17230 tree r
= try_class_unification (tparms
, targs
, parm
,
17231 BINFO_TYPE (binfo
), explain_p
);
17235 /* If there is more than one satisfactory baseclass, then:
17239 If they yield more than one possible deduced A, the type
17243 if (rval
&& !same_type_p (r
, rval
))
17245 *result
= NULL_TREE
;
17246 return tbr_ambiguous_baseclass
;
17254 return tbr_success
;
17257 /* Returns the level of DECL, which declares a template parameter. */
17260 template_decl_level (tree decl
)
17262 switch (TREE_CODE (decl
))
17265 case TEMPLATE_DECL
:
17266 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
17269 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
17272 gcc_unreachable ();
17277 /* Decide whether ARG can be unified with PARM, considering only the
17278 cv-qualifiers of each type, given STRICT as documented for unify.
17279 Returns nonzero iff the unification is OK on that basis. */
17282 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17284 int arg_quals
= cp_type_quals (arg
);
17285 int parm_quals
= cp_type_quals (parm
);
17287 /* DR 1584: cv-qualification of a deduced function type is
17288 ignored; see 8.3.5 [dcl.fct]. */
17289 if (TREE_CODE (arg
) == FUNCTION_TYPE
)
17292 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17293 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17295 /* Although a CVR qualifier is ignored when being applied to a
17296 substituted template parameter ([8.3.2]/1 for example), that
17297 does not allow us to unify "const T" with "int&" because both
17298 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17299 It is ok when we're allowing additional CV qualifiers
17300 at the outer level [14.8.2.1]/3,1st bullet. */
17301 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17302 || TREE_CODE (arg
) == FUNCTION_TYPE
17303 || TREE_CODE (arg
) == METHOD_TYPE
)
17304 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17307 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17308 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17312 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17313 && (arg_quals
& parm_quals
) != parm_quals
)
17316 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17317 && (parm_quals
& arg_quals
) != arg_quals
)
17323 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17325 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17327 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17328 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17329 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17331 *index
= TEMPLATE_TYPE_IDX (parm
);
17332 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17336 *index
= TEMPLATE_PARM_IDX (parm
);
17337 *level
= TEMPLATE_PARM_LEVEL (parm
);
17341 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17343 if (unify (TP, TA, P, A, S, EP)) \
17347 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17348 expansion at the end of PACKED_PARMS. Returns 0 if the type
17349 deduction succeeds, 1 otherwise. STRICT is the same as in
17350 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17351 call argument list. We'll need to adjust the arguments to make them
17352 types. SUBR tells us if this is from a recursive call to
17353 type_unification_real, or for comparing two template argument
17357 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17358 tree packed_args
, unification_kind_t strict
,
17359 bool subr
, bool explain_p
)
17362 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17363 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17364 tree pack
, packs
= NULL_TREE
;
17365 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17367 packed_args
= expand_template_argument_pack (packed_args
);
17369 int len
= TREE_VEC_LENGTH (packed_args
);
17371 /* Determine the parameter packs we will be deducing from the
17372 pattern, and record their current deductions. */
17373 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17374 pack
; pack
= TREE_CHAIN (pack
))
17376 tree parm_pack
= TREE_VALUE (pack
);
17379 /* Determine the index and level of this parameter pack. */
17380 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17382 /* Keep track of the parameter packs and their corresponding
17384 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17385 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17388 /* Loop through all of the arguments that have not yet been
17389 unified and unify each with the pattern. */
17390 for (i
= start
; i
< len
; i
++)
17393 bool any_explicit
= false;
17394 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17396 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17397 or the element of its argument pack at the current index if
17398 this argument was explicitly specified. */
17399 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17403 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17406 if (TREE_VALUE (pack
)
17407 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17408 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17410 any_explicit
= true;
17411 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17413 TMPL_ARG (targs
, level
, idx
) = arg
;
17416 /* If we had explicit template arguments, substitute them into the
17417 pattern before deduction. */
17420 /* Some arguments might still be unspecified or dependent. */
17422 ++processing_template_decl
;
17423 dependent
= any_dependent_template_arguments_p (targs
);
17425 --processing_template_decl
;
17426 parm
= tsubst (pattern
, targs
,
17427 explain_p
? tf_warning_or_error
: tf_none
,
17430 --processing_template_decl
;
17431 if (parm
== error_mark_node
)
17437 /* Unify the pattern with the current argument. */
17438 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17439 LOOKUP_IMPLICIT
, explain_p
))
17442 /* For each parameter pack, collect the deduced value. */
17443 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17446 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17448 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17449 TMPL_ARG (targs
, level
, idx
);
17453 /* Verify that the results of unification with the parameter packs
17454 produce results consistent with what we've seen before, and make
17455 the deduced argument packs available. */
17456 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17458 tree old_pack
= TREE_VALUE (pack
);
17459 tree new_args
= TREE_TYPE (pack
);
17460 int i
, len
= TREE_VEC_LENGTH (new_args
);
17462 bool nondeduced_p
= false;
17464 /* By default keep the original deduced argument pack.
17465 If necessary, more specific code is going to update the
17466 resulting deduced argument later down in this function. */
17467 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17468 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17470 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17471 actually deduce anything. */
17472 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17473 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17474 nondeduced_p
= true;
17478 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17480 /* If we had fewer function args than explicit template args,
17481 just use the explicits. */
17482 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17483 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17484 if (len
< explicit_len
)
17485 new_args
= explicit_args
;
17491 /* Build the deduced *_ARGUMENT_PACK. */
17492 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17494 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17495 TREE_TYPE (result
) =
17496 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17497 TREE_CONSTANT (result
) = 1;
17500 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17502 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17504 /* Note the deduced argument packs for this parameter
17506 TMPL_ARG (targs
, level
, idx
) = result
;
17508 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17509 && (ARGUMENT_PACK_ARGS (old_pack
)
17510 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17512 /* We only had the explicitly-provided arguments before, but
17513 now we have a complete set of arguments. */
17514 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17516 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17517 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17518 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17522 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17523 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17525 if (!comp_template_args_with_info (old_args
, new_args
,
17526 &bad_old_arg
, &bad_new_arg
))
17527 /* Inconsistent unification of this parameter pack. */
17528 return unify_parameter_pack_inconsistent (explain_p
,
17534 return unify_success (explain_p
);
17537 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17538 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17539 parameters and return value are as for unify. */
17542 unify_array_domain (tree tparms
, tree targs
,
17543 tree parm_dom
, tree arg_dom
,
17551 /* Our representation of array types uses "N - 1" as the
17552 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17553 not an integer constant. We cannot unify arbitrarily
17554 complex expressions, so we eliminate the MINUS_EXPRs
17556 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17557 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17560 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17561 parm_max
= TREE_OPERAND (parm_max
, 0);
17563 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17564 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17567 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17568 trying to unify the type of a variable with the type
17569 of a template parameter. For example:
17571 template <unsigned int N>
17572 void f (char (&) [N]);
17579 Here, the type of the ARG will be "int [g(i)]", and
17580 may be a SAVE_EXPR, etc. */
17581 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17582 return unify_vla_arg (explain_p
, arg_dom
);
17583 arg_max
= TREE_OPERAND (arg_max
, 0);
17586 /* If only one of the bounds used a MINUS_EXPR, compensate
17587 by adding one to the other bound. */
17588 if (parm_cst
&& !arg_cst
)
17589 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17593 else if (arg_cst
&& !parm_cst
)
17594 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17599 return unify (tparms
, targs
, parm_max
, arg_max
,
17600 UNIFY_ALLOW_INTEGER
, explain_p
);
17603 /* Deduce the value of template parameters. TPARMS is the (innermost)
17604 set of template parameters to a template. TARGS is the bindings
17605 for those template parameters, as determined thus far; TARGS may
17606 include template arguments for outer levels of template parameters
17607 as well. PARM is a parameter to a template function, or a
17608 subcomponent of that parameter; ARG is the corresponding argument.
17609 This function attempts to match PARM with ARG in a manner
17610 consistent with the existing assignments in TARGS. If more values
17611 are deduced, then TARGS is updated.
17613 Returns 0 if the type deduction succeeds, 1 otherwise. The
17614 parameter STRICT is a bitwise or of the following flags:
17617 Require an exact match between PARM and ARG.
17618 UNIFY_ALLOW_MORE_CV_QUAL:
17619 Allow the deduced ARG to be more cv-qualified (by qualification
17620 conversion) than ARG.
17621 UNIFY_ALLOW_LESS_CV_QUAL:
17622 Allow the deduced ARG to be less cv-qualified than ARG.
17623 UNIFY_ALLOW_DERIVED:
17624 Allow the deduced ARG to be a template base class of ARG,
17625 or a pointer to a template base class of the type pointed to by
17627 UNIFY_ALLOW_INTEGER:
17628 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17629 case for more information.
17630 UNIFY_ALLOW_OUTER_LEVEL:
17631 This is the outermost level of a deduction. Used to determine validity
17632 of qualification conversions. A valid qualification conversion must
17633 have const qualified pointers leading up to the inner type which
17634 requires additional CV quals, except at the outer level, where const
17635 is not required [conv.qual]. It would be normal to set this flag in
17636 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17637 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17638 This is the outermost level of a deduction, and PARM can be more CV
17639 qualified at this point.
17640 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17641 This is the outermost level of a deduction, and PARM can be less CV
17642 qualified at this point. */
17645 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
17651 int strict_in
= strict
;
17653 /* I don't think this will do the right thing with respect to types.
17654 But the only case I've seen it in so far has been array bounds, where
17655 signedness is the only information lost, and I think that will be
17657 while (TREE_CODE (parm
) == NOP_EXPR
)
17658 parm
= TREE_OPERAND (parm
, 0);
17660 if (arg
== error_mark_node
)
17661 return unify_invalid (explain_p
);
17662 if (arg
== unknown_type_node
17663 || arg
== init_list_type_node
)
17664 /* We can't deduce anything from this, but we might get all the
17665 template args from other function args. */
17666 return unify_success (explain_p
);
17668 /* If PARM uses template parameters, then we can't bail out here,
17669 even if ARG == PARM, since we won't record unifications for the
17670 template parameters. We might need them if we're trying to
17671 figure out which of two things is more specialized. */
17672 if (arg
== parm
&& !uses_template_parms (parm
))
17673 return unify_success (explain_p
);
17675 /* Handle init lists early, so the rest of the function can assume
17676 we're dealing with a type. */
17677 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
17681 tree orig_parm
= parm
;
17683 /* Replace T with std::initializer_list<T> for deduction. */
17684 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17685 && flag_deduce_init_list
)
17686 parm
= listify (parm
);
17688 if (!is_std_init_list (parm
)
17689 && TREE_CODE (parm
) != ARRAY_TYPE
)
17690 /* We can only deduce from an initializer list argument if the
17691 parameter is std::initializer_list or an array; otherwise this
17692 is a non-deduced context. */
17693 return unify_success (explain_p
);
17695 if (TREE_CODE (parm
) == ARRAY_TYPE
)
17696 elttype
= TREE_TYPE (parm
);
17698 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
17700 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
17702 int elt_strict
= strict
;
17704 if (elt
== error_mark_node
)
17705 return unify_invalid (explain_p
);
17707 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
17709 tree type
= TREE_TYPE (elt
);
17710 /* It should only be possible to get here for a call. */
17711 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
17712 elt_strict
|= maybe_adjust_types_for_deduction
17713 (DEDUCE_CALL
, &elttype
, &type
, elt
);
17717 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
17721 if (TREE_CODE (parm
) == ARRAY_TYPE
17722 && deducible_array_bound (TYPE_DOMAIN (parm
)))
17724 /* Also deduce from the length of the initializer list. */
17725 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
17726 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
17727 if (idx
== error_mark_node
)
17728 return unify_invalid (explain_p
);
17729 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17733 /* If the std::initializer_list<T> deduction worked, replace the
17734 deduced A with std::initializer_list<A>. */
17735 if (orig_parm
!= parm
)
17737 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
17738 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17739 targ
= listify (targ
);
17740 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
17742 return unify_success (explain_p
);
17745 /* Immediately reject some pairs that won't unify because of
17746 cv-qualification mismatches. */
17747 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17749 /* It is the elements of the array which hold the cv quals of an array
17750 type, and the elements might be template type parms. We'll check
17751 when we recurse. */
17752 && TREE_CODE (arg
) != ARRAY_TYPE
17753 /* We check the cv-qualifiers when unifying with template type
17754 parameters below. We want to allow ARG `const T' to unify with
17755 PARM `T' for example, when computing which of two templates
17756 is more specialized, for example. */
17757 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
17758 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
17759 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17761 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
17762 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
17763 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
17764 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
17765 strict
&= ~UNIFY_ALLOW_DERIVED
;
17766 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17767 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
17769 switch (TREE_CODE (parm
))
17771 case TYPENAME_TYPE
:
17773 case UNBOUND_CLASS_TEMPLATE
:
17774 /* In a type which contains a nested-name-specifier, template
17775 argument values cannot be deduced for template parameters used
17776 within the nested-name-specifier. */
17777 return unify_success (explain_p
);
17779 case TEMPLATE_TYPE_PARM
:
17780 case TEMPLATE_TEMPLATE_PARM
:
17781 case BOUND_TEMPLATE_TEMPLATE_PARM
:
17782 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17783 if (error_operand_p (tparm
))
17784 return unify_invalid (explain_p
);
17786 if (TEMPLATE_TYPE_LEVEL (parm
)
17787 != template_decl_level (tparm
))
17788 /* The PARM is not one we're trying to unify. Just check
17789 to see if it matches ARG. */
17791 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17792 && (is_auto (parm
) ? is_auto (arg
)
17793 : same_type_p (parm
, arg
)))
17794 return unify_success (explain_p
);
17796 return unify_type_mismatch (explain_p
, parm
, arg
);
17798 idx
= TEMPLATE_TYPE_IDX (parm
);
17799 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17800 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
17801 if (error_operand_p (tparm
))
17802 return unify_invalid (explain_p
);
17804 /* Check for mixed types and values. */
17805 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17806 && TREE_CODE (tparm
) != TYPE_DECL
)
17807 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17808 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
17809 gcc_unreachable ();
17811 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17813 /* ARG must be constructed from a template class or a template
17814 template parameter. */
17815 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
17816 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
17817 return unify_template_deduction_failure (explain_p
, parm
, arg
);
17819 tree parmvec
= TYPE_TI_ARGS (parm
);
17820 /* An alias template name is never deduced. */
17821 if (TYPE_ALIAS_P (arg
))
17822 arg
= strip_typedefs (arg
);
17823 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
17824 tree full_argvec
= add_to_template_args (targs
, argvec
);
17826 = DECL_INNERMOST_TEMPLATE_PARMS
17827 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
17829 int parm_variadic_p
= 0;
17831 /* The resolution to DR150 makes clear that default
17832 arguments for an N-argument may not be used to bind T
17833 to a template template parameter with fewer than N
17834 parameters. It is not safe to permit the binding of
17835 default arguments as an extension, as that may change
17836 the meaning of a conforming program. Consider:
17838 struct Dense { static const unsigned int dim = 1; };
17840 template <template <typename> class View,
17842 void operator+(float, View<Block> const&);
17844 template <typename Block,
17845 unsigned int Dim = Block::dim>
17846 struct Lvalue_proxy { operator float() const; };
17850 Lvalue_proxy<Dense> p;
17855 Here, if Lvalue_proxy is permitted to bind to View, then
17856 the global operator+ will be used; if they are not, the
17857 Lvalue_proxy will be converted to float. */
17858 if (coerce_template_parms (parm_parms
,
17860 TYPE_TI_TEMPLATE (parm
),
17862 ? tf_warning_or_error
17864 /*require_all_args=*/true,
17865 /*use_default_args=*/false)
17866 == error_mark_node
)
17869 /* Deduce arguments T, i from TT<T> or TT<i>.
17870 We check each element of PARMVEC and ARGVEC individually
17871 rather than the whole TREE_VEC since they can have
17872 different number of elements. */
17874 parmvec
= expand_template_argument_pack (parmvec
);
17875 argvec
= expand_template_argument_pack (argvec
);
17877 len
= TREE_VEC_LENGTH (parmvec
);
17879 /* Check if the parameters end in a pack, making them
17882 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
17883 parm_variadic_p
= 1;
17885 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17886 /* If the template argument list of P contains a pack
17887 expansion that is not the last template argument, the
17888 entire template argument list is a non-deduced
17890 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
17891 return unify_success (explain_p
);
17893 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
17894 return unify_too_few_arguments (explain_p
,
17895 TREE_VEC_LENGTH (argvec
), len
);
17897 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17899 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17900 TREE_VEC_ELT (parmvec
, i
),
17901 TREE_VEC_ELT (argvec
, i
),
17902 UNIFY_ALLOW_NONE
, explain_p
);
17905 if (parm_variadic_p
17906 && unify_pack_expansion (tparms
, targs
,
17909 /*subr=*/true, explain_p
))
17912 arg
= TYPE_TI_TEMPLATE (arg
);
17914 /* Fall through to deduce template name. */
17917 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17918 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17920 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
17922 /* Simple cases: Value already set, does match or doesn't. */
17923 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
17924 return unify_success (explain_p
);
17926 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17930 /* If PARM is `const T' and ARG is only `int', we don't have
17931 a match unless we are allowing additional qualification.
17932 If ARG is `const int' and PARM is just `T' that's OK;
17933 that binds `const int' to `T'. */
17934 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
17936 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17938 /* Consider the case where ARG is `const volatile int' and
17939 PARM is `const T'. Then, T should be `volatile int'. */
17940 arg
= cp_build_qualified_type_real
17941 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
17942 if (arg
== error_mark_node
)
17943 return unify_invalid (explain_p
);
17945 /* Simple cases: Value already set, does match or doesn't. */
17946 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
17947 return unify_success (explain_p
);
17949 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17951 /* Make sure that ARG is not a variable-sized array. (Note
17952 that were talking about variable-sized arrays (like
17953 `int[n]'), rather than arrays of unknown size (like
17954 `int[]').) We'll get very confused by such a type since
17955 the bound of the array is not constant, and therefore
17956 not mangleable. Besides, such types are not allowed in
17957 ISO C++, so we can do as we please here. We do allow
17958 them for 'auto' deduction, since that isn't ABI-exposed. */
17959 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
17960 return unify_vla_arg (explain_p
, arg
);
17962 /* Strip typedefs as in convert_template_argument. */
17963 arg
= canonicalize_type_argument (arg
, tf_none
);
17966 /* If ARG is a parameter pack or an expansion, we cannot unify
17967 against it unless PARM is also a parameter pack. */
17968 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
17969 && !template_parameter_pack_p (parm
))
17970 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
17972 /* If the argument deduction results is a METHOD_TYPE,
17973 then there is a problem.
17974 METHOD_TYPE doesn't map to any real C++ type the result of
17975 the deduction can not be of that type. */
17976 if (TREE_CODE (arg
) == METHOD_TYPE
)
17977 return unify_method_type_error (explain_p
, arg
);
17979 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
17980 return unify_success (explain_p
);
17982 case TEMPLATE_PARM_INDEX
:
17983 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17984 if (error_operand_p (tparm
))
17985 return unify_invalid (explain_p
);
17987 if (TEMPLATE_PARM_LEVEL (parm
)
17988 != template_decl_level (tparm
))
17990 /* The PARM is not one we're trying to unify. Just check
17991 to see if it matches ARG. */
17992 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
17993 && cp_tree_equal (parm
, arg
));
17995 unify_expression_unequal (explain_p
, parm
, arg
);
17999 idx
= TEMPLATE_PARM_IDX (parm
);
18000 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18004 int x
= !cp_tree_equal (targ
, arg
);
18006 unify_inconsistency (explain_p
, parm
, targ
, arg
);
18010 /* [temp.deduct.type] If, in the declaration of a function template
18011 with a non-type template-parameter, the non-type
18012 template-parameter is used in an expression in the function
18013 parameter-list and, if the corresponding template-argument is
18014 deduced, the template-argument type shall match the type of the
18015 template-parameter exactly, except that a template-argument
18016 deduced from an array bound may be of any integral type.
18017 The non-type parameter might use already deduced type parameters. */
18018 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
18019 if (!TREE_TYPE (arg
))
18020 /* Template-parameter dependent expression. Just accept it for now.
18021 It will later be processed in convert_template_argument. */
18023 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18025 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18026 && CP_INTEGRAL_TYPE_P (tparm
))
18027 /* Convert the ARG to the type of PARM; the deduced non-type
18028 template argument must exactly match the types of the
18029 corresponding parameter. */
18030 arg
= fold (build_nop (tparm
, arg
));
18031 else if (uses_template_parms (tparm
))
18032 /* We haven't deduced the type of this parameter yet. Try again
18034 return unify_success (explain_p
);
18036 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18038 /* If ARG is a parameter pack or an expansion, we cannot unify
18039 against it unless PARM is also a parameter pack. */
18040 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18041 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18042 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18044 arg
= strip_typedefs_expr (arg
);
18045 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18046 return unify_success (explain_p
);
18050 /* A pointer-to-member constant can be unified only with
18051 another constant. */
18052 if (TREE_CODE (arg
) != PTRMEM_CST
)
18053 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18055 /* Just unify the class member. It would be useless (and possibly
18056 wrong, depending on the strict flags) to unify also
18057 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18058 arg refer to the same variable, even if through different
18059 classes. For instance:
18061 struct A { int x; };
18064 Unification of &A::x and &B::x must succeed. */
18065 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18066 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18071 if (!TYPE_PTR_P (arg
))
18072 return unify_type_mismatch (explain_p
, parm
, arg
);
18074 /* [temp.deduct.call]
18076 A can be another pointer or pointer to member type that can
18077 be converted to the deduced A via a qualification
18078 conversion (_conv.qual_).
18080 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18081 This will allow for additional cv-qualification of the
18082 pointed-to types if appropriate. */
18084 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18085 /* The derived-to-base conversion only persists through one
18086 level of pointers. */
18087 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
18089 return unify (tparms
, targs
, TREE_TYPE (parm
),
18090 TREE_TYPE (arg
), strict
, explain_p
);
18093 case REFERENCE_TYPE
:
18094 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
18095 return unify_type_mismatch (explain_p
, parm
, arg
);
18096 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18097 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18100 if (TREE_CODE (arg
) != ARRAY_TYPE
)
18101 return unify_type_mismatch (explain_p
, parm
, arg
);
18102 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
18103 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
18104 return unify_type_mismatch (explain_p
, parm
, arg
);
18105 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18106 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18107 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
18108 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18109 TYPE_DOMAIN (arg
), explain_p
);
18110 return unify_success (explain_p
);
18117 case ENUMERAL_TYPE
:
18120 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18121 return unify_type_mismatch (explain_p
, parm
, arg
);
18123 /* We have already checked cv-qualification at the top of the
18125 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
18126 return unify_type_mismatch (explain_p
, parm
, arg
);
18128 /* As far as unification is concerned, this wins. Later checks
18129 will invalidate it if necessary. */
18130 return unify_success (explain_p
);
18132 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
18133 /* Type INTEGER_CST can come from ordinary constant template args. */
18135 while (TREE_CODE (arg
) == NOP_EXPR
)
18136 arg
= TREE_OPERAND (arg
, 0);
18138 if (TREE_CODE (arg
) != INTEGER_CST
)
18139 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18140 return (tree_int_cst_equal (parm
, arg
)
18141 ? unify_success (explain_p
)
18142 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
18146 int i
, len
, argslen
;
18147 int parm_variadic_p
= 0;
18149 if (TREE_CODE (arg
) != TREE_VEC
)
18150 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18152 len
= TREE_VEC_LENGTH (parm
);
18153 argslen
= TREE_VEC_LENGTH (arg
);
18155 /* Check for pack expansions in the parameters. */
18156 for (i
= 0; i
< len
; ++i
)
18158 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
18161 /* We can unify against something with a trailing
18163 parm_variadic_p
= 1;
18165 /* [temp.deduct.type]/9: If the template argument list of
18166 P contains a pack expansion that is not the last
18167 template argument, the entire template argument list
18168 is a non-deduced context. */
18169 return unify_success (explain_p
);
18173 /* If we don't have enough arguments to satisfy the parameters
18174 (not counting the pack expression at the end), or we have
18175 too many arguments for a parameter list that doesn't end in
18176 a pack expression, we can't unify. */
18177 if (parm_variadic_p
18178 ? argslen
< len
- parm_variadic_p
18180 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
18182 /* Unify all of the parameters that precede the (optional)
18183 pack expression. */
18184 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18186 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18187 TREE_VEC_ELT (parm
, i
),
18188 TREE_VEC_ELT (arg
, i
),
18189 UNIFY_ALLOW_NONE
, explain_p
);
18191 if (parm_variadic_p
)
18192 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
18194 /*subr=*/true, explain_p
);
18195 return unify_success (explain_p
);
18200 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18201 return unify_type_mismatch (explain_p
, parm
, arg
);
18203 if (TYPE_PTRMEMFUNC_P (parm
))
18205 if (!TYPE_PTRMEMFUNC_P (arg
))
18206 return unify_type_mismatch (explain_p
, parm
, arg
);
18208 return unify (tparms
, targs
,
18209 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
18210 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
18211 strict
, explain_p
);
18213 else if (TYPE_PTRMEMFUNC_P (arg
))
18214 return unify_type_mismatch (explain_p
, parm
, arg
);
18216 if (CLASSTYPE_TEMPLATE_INFO (parm
))
18218 tree t
= NULL_TREE
;
18220 if (strict_in
& UNIFY_ALLOW_DERIVED
)
18222 /* First, we try to unify the PARM and ARG directly. */
18223 t
= try_class_unification (tparms
, targs
,
18224 parm
, arg
, explain_p
);
18228 /* Fallback to the special case allowed in
18229 [temp.deduct.call]:
18231 If P is a class, and P has the form
18232 template-id, then A can be a derived class of
18233 the deduced A. Likewise, if P is a pointer to
18234 a class of the form template-id, A can be a
18235 pointer to a derived class pointed to by the
18237 enum template_base_result r
;
18238 r
= get_template_base (tparms
, targs
, parm
, arg
,
18242 return unify_no_common_base (explain_p
, r
, parm
, arg
);
18245 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
18246 && (CLASSTYPE_TI_TEMPLATE (parm
)
18247 == CLASSTYPE_TI_TEMPLATE (arg
)))
18248 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18249 Then, we should unify `int' and `U'. */
18252 /* There's no chance of unification succeeding. */
18253 return unify_type_mismatch (explain_p
, parm
, arg
);
18255 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
18256 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
18258 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
18259 return unify_type_mismatch (explain_p
, parm
, arg
);
18260 return unify_success (explain_p
);
18263 case FUNCTION_TYPE
:
18265 unsigned int nargs
;
18270 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18271 return unify_type_mismatch (explain_p
, parm
, arg
);
18273 /* CV qualifications for methods can never be deduced, they must
18274 match exactly. We need to check them explicitly here,
18275 because type_unification_real treats them as any other
18276 cv-qualified parameter. */
18277 if (TREE_CODE (parm
) == METHOD_TYPE
18278 && (!check_cv_quals_for_unify
18280 class_of_this_parm (arg
),
18281 class_of_this_parm (parm
))))
18282 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18284 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18285 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18287 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18288 args
= XALLOCAVEC (tree
, nargs
);
18289 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18290 a
!= NULL_TREE
&& a
!= void_list_node
;
18291 a
= TREE_CHAIN (a
), ++i
)
18292 args
[i
] = TREE_VALUE (a
);
18295 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18296 args
, nargs
, 1, DEDUCE_EXACT
,
18297 LOOKUP_NORMAL
, NULL
, explain_p
);
18301 /* Unify a pointer to member with a pointer to member function, which
18302 deduces the type of the member as a function type. */
18303 if (TYPE_PTRMEMFUNC_P (arg
))
18305 /* Check top-level cv qualifiers */
18306 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18307 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18309 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18310 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18311 UNIFY_ALLOW_NONE
, explain_p
);
18313 /* Determine the type of the function we are unifying against. */
18314 tree fntype
= static_fn_type (arg
);
18316 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18319 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18320 return unify_type_mismatch (explain_p
, parm
, arg
);
18321 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18322 TYPE_OFFSET_BASETYPE (arg
),
18323 UNIFY_ALLOW_NONE
, explain_p
);
18324 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18325 strict
, explain_p
);
18328 if (DECL_TEMPLATE_PARM_P (parm
))
18329 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18330 if (arg
!= integral_constant_value (parm
))
18331 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18332 return unify_success (explain_p
);
18335 case TEMPLATE_DECL
:
18336 /* Matched cases are handled by the ARG == PARM test above. */
18337 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18340 /* A non-type template parameter that is a variable should be a
18341 an integral constant, in which case, it whould have been
18342 folded into its (constant) value. So we should not be getting
18343 a variable here. */
18344 gcc_unreachable ();
18346 case TYPE_ARGUMENT_PACK
:
18347 case NONTYPE_ARGUMENT_PACK
:
18348 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18349 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18352 case DECLTYPE_TYPE
:
18353 case UNDERLYING_TYPE
:
18354 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18355 or UNDERLYING_TYPE nodes. */
18356 return unify_success (explain_p
);
18359 /* Unification fails if we hit an error node. */
18360 return unify_invalid (explain_p
);
18363 if (REFERENCE_REF_P (parm
))
18364 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18365 strict
, explain_p
);
18369 /* An unresolved overload is a nondeduced context. */
18370 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18371 return unify_success (explain_p
);
18372 gcc_assert (EXPR_P (parm
));
18374 /* We must be looking at an expression. This can happen with
18378 void foo(S<I>, S<I + 2>);
18380 This is a "nondeduced context":
18384 The nondeduced contexts are:
18386 --A type that is a template-id in which one or more of
18387 the template-arguments is an expression that references
18388 a template-parameter.
18390 In these cases, we assume deduction succeeded, but don't
18391 actually infer any unifications. */
18393 if (!uses_template_parms (parm
)
18394 && !template_args_equal (parm
, arg
))
18395 return unify_expression_unequal (explain_p
, parm
, arg
);
18397 return unify_success (explain_p
);
18400 #undef RECUR_AND_CHECK_FAILURE
18402 /* Note that DECL can be defined in this translation unit, if
18406 mark_definable (tree decl
)
18409 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18410 FOR_EACH_CLONE (clone
, decl
)
18411 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18414 /* Called if RESULT is explicitly instantiated, or is a member of an
18415 explicitly instantiated class. */
18418 mark_decl_instantiated (tree result
, int extern_p
)
18420 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18422 /* If this entity has already been written out, it's too late to
18423 make any modifications. */
18424 if (TREE_ASM_WRITTEN (result
))
18427 /* For anonymous namespace we don't need to do anything. */
18428 if (decl_anon_ns_mem_p (result
))
18430 gcc_assert (!TREE_PUBLIC (result
));
18434 if (TREE_CODE (result
) != FUNCTION_DECL
)
18435 /* The TREE_PUBLIC flag for function declarations will have been
18436 set correctly by tsubst. */
18437 TREE_PUBLIC (result
) = 1;
18439 /* This might have been set by an earlier implicit instantiation. */
18440 DECL_COMDAT (result
) = 0;
18443 DECL_NOT_REALLY_EXTERN (result
) = 0;
18446 mark_definable (result
);
18447 mark_needed (result
);
18448 /* Always make artificials weak. */
18449 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18450 comdat_linkage (result
);
18451 /* For WIN32 we also want to put explicit instantiations in
18452 linkonce sections. */
18453 else if (TREE_PUBLIC (result
))
18454 maybe_make_one_only (result
);
18457 /* If EXTERN_P, then this function will not be emitted -- unless
18458 followed by an explicit instantiation, at which point its linkage
18459 will be adjusted. If !EXTERN_P, then this function will be
18460 emitted here. In neither circumstance do we want
18461 import_export_decl to adjust the linkage. */
18462 DECL_INTERFACE_KNOWN (result
) = 1;
18465 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18466 important template arguments. If any are missing, we check whether
18467 they're important by using error_mark_node for substituting into any
18468 args that were used for partial ordering (the ones between ARGS and END)
18469 and seeing if it bubbles up. */
18472 check_undeduced_parms (tree targs
, tree args
, tree end
)
18474 bool found
= false;
18476 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18477 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18480 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18484 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18485 if (substed
== error_mark_node
)
18491 /* Given two function templates PAT1 and PAT2, return:
18493 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18494 -1 if PAT2 is more specialized than PAT1.
18495 0 if neither is more specialized.
18497 LEN indicates the number of parameters we should consider
18498 (defaulted parameters should not be considered).
18500 The 1998 std underspecified function template partial ordering, and
18501 DR214 addresses the issue. We take pairs of arguments, one from
18502 each of the templates, and deduce them against each other. One of
18503 the templates will be more specialized if all the *other*
18504 template's arguments deduce against its arguments and at least one
18505 of its arguments *does* *not* deduce against the other template's
18506 corresponding argument. Deduction is done as for class templates.
18507 The arguments used in deduction have reference and top level cv
18508 qualifiers removed. Iff both arguments were originally reference
18509 types *and* deduction succeeds in both directions, an lvalue reference
18510 wins against an rvalue reference and otherwise the template
18511 with the more cv-qualified argument wins for that pairing (if
18512 neither is more cv-qualified, they both are equal). Unlike regular
18513 deduction, after all the arguments have been deduced in this way,
18514 we do *not* verify the deduced template argument values can be
18515 substituted into non-deduced contexts.
18517 The logic can be a bit confusing here, because we look at deduce1 and
18518 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18519 can find template arguments for pat1 to make arg1 look like arg2, that
18520 means that arg2 is at least as specialized as arg1. */
18523 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18525 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18526 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18527 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18528 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18529 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18530 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18531 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18532 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18533 tree origs1
, origs2
;
18534 bool lose1
= false;
18535 bool lose2
= false;
18537 /* Remove the this parameter from non-static member functions. If
18538 one is a non-static member function and the other is not a static
18539 member function, remove the first parameter from that function
18540 also. This situation occurs for operator functions where we
18541 locate both a member function (with this pointer) and non-member
18542 operator (with explicit first operand). */
18543 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18545 len
--; /* LEN is the number of significant arguments for DECL1 */
18546 args1
= TREE_CHAIN (args1
);
18547 if (!DECL_STATIC_FUNCTION_P (decl2
))
18548 args2
= TREE_CHAIN (args2
);
18550 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18552 args2
= TREE_CHAIN (args2
);
18553 if (!DECL_STATIC_FUNCTION_P (decl1
))
18556 args1
= TREE_CHAIN (args1
);
18560 /* If only one is a conversion operator, they are unordered. */
18561 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18564 /* Consider the return type for a conversion function */
18565 if (DECL_CONV_FN_P (decl1
))
18567 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18568 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18572 processing_template_decl
++;
18578 /* Stop when an ellipsis is seen. */
18579 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18581 tree arg1
= TREE_VALUE (args1
);
18582 tree arg2
= TREE_VALUE (args2
);
18583 int deduce1
, deduce2
;
18589 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18590 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18592 /* When both arguments are pack expansions, we need only
18593 unify the patterns themselves. */
18594 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18595 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18597 /* This is the last comparison we need to do. */
18601 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18603 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18604 arg1
= TREE_TYPE (arg1
);
18605 quals1
= cp_type_quals (arg1
);
18608 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18610 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18611 arg2
= TREE_TYPE (arg2
);
18612 quals2
= cp_type_quals (arg2
);
18615 arg1
= TYPE_MAIN_VARIANT (arg1
);
18616 arg2
= TYPE_MAIN_VARIANT (arg2
);
18618 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
18620 int i
, len2
= list_length (args2
);
18621 tree parmvec
= make_tree_vec (1);
18622 tree argvec
= make_tree_vec (len2
);
18625 /* Setup the parameter vector, which contains only ARG1. */
18626 TREE_VEC_ELT (parmvec
, 0) = arg1
;
18628 /* Setup the argument vector, which contains the remaining
18630 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
18631 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18633 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
18634 argvec
, DEDUCE_EXACT
,
18635 /*subr=*/true, /*explain_p=*/false)
18638 /* We cannot deduce in the other direction, because ARG1 is
18639 a pack expansion but ARG2 is not. */
18642 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18644 int i
, len1
= list_length (args1
);
18645 tree parmvec
= make_tree_vec (1);
18646 tree argvec
= make_tree_vec (len1
);
18649 /* Setup the parameter vector, which contains only ARG1. */
18650 TREE_VEC_ELT (parmvec
, 0) = arg2
;
18652 /* Setup the argument vector, which contains the remaining
18654 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
18655 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18657 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
18658 argvec
, DEDUCE_EXACT
,
18659 /*subr=*/true, /*explain_p=*/false)
18662 /* We cannot deduce in the other direction, because ARG2 is
18663 a pack expansion but ARG1 is not.*/
18669 /* The normal case, where neither argument is a pack
18671 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
18672 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18674 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
18675 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18679 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18680 arg2, then arg2 is not as specialized as arg1. */
18686 /* "If, for a given type, deduction succeeds in both directions
18687 (i.e., the types are identical after the transformations above)
18688 and both P and A were reference types (before being replaced with
18689 the type referred to above):
18690 - if the type from the argument template was an lvalue reference and
18691 the type from the parameter template was not, the argument type is
18692 considered to be more specialized than the other; otherwise,
18693 - if the type from the argument template is more cv-qualified
18694 than the type from the parameter template (as described above),
18695 the argument type is considered to be more specialized than the other;
18697 - neither type is more specialized than the other." */
18699 if (deduce1
&& deduce2
)
18701 if (ref1
&& ref2
&& ref1
!= ref2
)
18708 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
18710 if ((quals1
& quals2
) == quals2
)
18712 if ((quals1
& quals2
) == quals1
)
18717 if (lose1
&& lose2
)
18718 /* We've failed to deduce something in either direction.
18719 These must be unordered. */
18722 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18723 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18724 /* We have already processed all of the arguments in our
18725 handing of the pack expansion type. */
18728 args1
= TREE_CHAIN (args1
);
18729 args2
= TREE_CHAIN (args2
);
18732 /* "In most cases, all template parameters must have values in order for
18733 deduction to succeed, but for partial ordering purposes a template
18734 parameter may remain without a value provided it is not used in the
18735 types being used for partial ordering."
18737 Thus, if we are missing any of the targs1 we need to substitute into
18738 origs1, then pat2 is not as specialized as pat1. This can happen when
18739 there is a nondeduced context. */
18740 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
18742 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
18745 processing_template_decl
--;
18747 /* All things being equal, if the next argument is a pack expansion
18748 for one function but not for the other, prefer the
18749 non-variadic function. FIXME this is bogus; see c++/41958. */
18751 && args1
&& TREE_VALUE (args1
)
18752 && args2
&& TREE_VALUE (args2
))
18754 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
18755 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
18758 if (lose1
== lose2
)
18766 /* Determine which of two partial specializations of TMPL is more
18769 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
18770 to the first partial specialization. The TREE_VALUE is the
18771 innermost set of template parameters for the partial
18772 specialization. PAT2 is similar, but for the second template.
18774 Return 1 if the first partial specialization is more specialized;
18775 -1 if the second is more specialized; 0 if neither is more
18778 See [temp.class.order] for information about determining which of
18779 two templates is more specialized. */
18782 more_specialized_class (tree tmpl
, tree pat1
, tree pat2
)
18787 bool any_deductions
= false;
18789 tmpl1
= TREE_TYPE (pat1
);
18790 tmpl2
= TREE_TYPE (pat2
);
18792 /* Just like what happens for functions, if we are ordering between
18793 different class template specializations, we may encounter dependent
18794 types in the arguments, and we need our dependency check functions
18795 to behave correctly. */
18796 ++processing_template_decl
;
18797 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat1
),
18798 CLASSTYPE_TI_ARGS (tmpl1
),
18799 CLASSTYPE_TI_ARGS (tmpl2
));
18803 any_deductions
= true;
18806 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat2
),
18807 CLASSTYPE_TI_ARGS (tmpl2
),
18808 CLASSTYPE_TI_ARGS (tmpl1
));
18812 any_deductions
= true;
18814 --processing_template_decl
;
18816 /* In the case of a tie where at least one of the class templates
18817 has a parameter pack at the end, the template with the most
18818 non-packed parameters wins. */
18821 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
18822 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
18824 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
18825 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
18826 int len1
= TREE_VEC_LENGTH (args1
);
18827 int len2
= TREE_VEC_LENGTH (args2
);
18829 /* We don't count the pack expansion at the end. */
18830 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
18832 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
18837 else if (len1
< len2
)
18844 /* Return the template arguments that will produce the function signature
18845 DECL from the function template FN, with the explicit template
18846 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
18847 also match. Return NULL_TREE if no satisfactory arguments could be
18851 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
18853 int ntparms
= DECL_NTPARMS (fn
);
18854 tree targs
= make_tree_vec (ntparms
);
18855 tree decl_type
= TREE_TYPE (decl
);
18856 tree decl_arg_types
;
18858 unsigned int nargs
, ix
;
18861 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
18863 /* Never do unification on the 'this' parameter. */
18864 decl_arg_types
= skip_artificial_parms_for (decl
,
18865 TYPE_ARG_TYPES (decl_type
));
18867 nargs
= list_length (decl_arg_types
);
18868 args
= XALLOCAVEC (tree
, nargs
);
18869 for (arg
= decl_arg_types
, ix
= 0;
18870 arg
!= NULL_TREE
&& arg
!= void_list_node
;
18871 arg
= TREE_CHAIN (arg
), ++ix
)
18872 args
[ix
] = TREE_VALUE (arg
);
18874 if (fn_type_unification (fn
, explicit_args
, targs
,
18876 (check_rettype
|| DECL_CONV_FN_P (fn
)
18877 ? TREE_TYPE (decl_type
) : NULL_TREE
),
18878 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
18880 == error_mark_node
)
18886 /* Return the innermost template arguments that, when applied to a partial
18887 specialization of TMPL whose innermost template parameters are
18888 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
18891 For example, suppose we have:
18893 template <class T, class U> struct S {};
18894 template <class T> struct S<T*, int> {};
18896 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
18897 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
18898 int}. The resulting vector will be {double}, indicating that `T'
18899 is bound to `double'. */
18902 get_class_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
18904 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
18906 tree innermost_deduced_args
;
18908 innermost_deduced_args
= make_tree_vec (ntparms
);
18909 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18911 deduced_args
= copy_node (args
);
18912 SET_TMPL_ARGS_LEVEL (deduced_args
,
18913 TMPL_ARGS_DEPTH (deduced_args
),
18914 innermost_deduced_args
);
18917 deduced_args
= innermost_deduced_args
;
18919 if (unify (tparms
, deduced_args
,
18920 INNERMOST_TEMPLATE_ARGS (spec_args
),
18921 INNERMOST_TEMPLATE_ARGS (args
),
18922 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
18925 for (i
= 0; i
< ntparms
; ++i
)
18926 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
18929 /* Verify that nondeduced template arguments agree with the type
18930 obtained from argument deduction.
18934 struct A { typedef int X; };
18935 template <class T, class U> struct C {};
18936 template <class T> struct C<T, typename T::X> {};
18938 Then with the instantiation `C<A, int>', we can deduce that
18939 `T' is `A' but unify () does not check whether `typename T::X'
18941 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
18942 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18944 tf_none
, false, false);
18945 if (spec_args
== error_mark_node
18946 /* We only need to check the innermost arguments; the other
18947 arguments will always agree. */
18948 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
18949 INNERMOST_TEMPLATE_ARGS (args
)))
18952 /* Now that we have bindings for all of the template arguments,
18953 ensure that the arguments deduced for the template template
18954 parameters have compatible template parameter lists. See the use
18955 of template_template_parm_bindings_ok_p in fn_type_unification
18956 for more information. */
18957 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
18960 return deduced_args
;
18963 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
18964 Return the TREE_LIST node with the most specialized template, if
18965 any. If there is no most specialized template, the error_mark_node
18968 Note that this function does not look at, or modify, the
18969 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
18970 returned is one of the elements of INSTANTIATIONS, callers may
18971 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
18972 and retrieve it from the value returned. */
18975 most_specialized_instantiation (tree templates
)
18979 ++processing_template_decl
;
18982 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
18986 if (get_bindings (TREE_VALUE (champ
),
18987 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18988 NULL_TREE
, /*check_ret=*/true))
18991 if (get_bindings (TREE_VALUE (fn
),
18992 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18993 NULL_TREE
, /*check_ret=*/true))
19000 /* Equally specialized, move to next function. If there
19001 is no next function, nothing's most specialized. */
19002 fn
= TREE_CHAIN (fn
);
19010 /* Now verify that champ is better than everything earlier in the
19011 instantiation list. */
19012 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
19013 if (get_bindings (TREE_VALUE (champ
),
19014 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
19015 NULL_TREE
, /*check_ret=*/true)
19016 || !get_bindings (TREE_VALUE (fn
),
19017 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19018 NULL_TREE
, /*check_ret=*/true))
19024 processing_template_decl
--;
19027 return error_mark_node
;
19032 /* If DECL is a specialization of some template, return the most
19033 general such template. Otherwise, returns NULL_TREE.
19035 For example, given:
19037 template <class T> struct S { template <class U> void f(U); };
19039 if TMPL is `template <class U> void S<int>::f(U)' this will return
19040 the full template. This function will not trace past partial
19041 specializations, however. For example, given in addition:
19043 template <class T> struct S<T*> { template <class U> void f(U); };
19045 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19046 `template <class T> template <class U> S<T*>::f(U)'. */
19049 most_general_template (tree decl
)
19051 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19053 if (tree tinfo
= get_template_info (decl
))
19054 decl
= TI_TEMPLATE (tinfo
);
19055 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19056 template friend, or a FIELD_DECL for a capture pack. */
19057 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19061 /* Look for more and more general templates. */
19062 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
19064 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
19065 (See cp-tree.h for details.) */
19066 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
19069 if (CLASS_TYPE_P (TREE_TYPE (decl
))
19070 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
19073 /* Stop if we run into an explicitly specialized class template. */
19074 if (!DECL_NAMESPACE_SCOPE_P (decl
)
19075 && DECL_CONTEXT (decl
)
19076 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
19079 decl
= DECL_TI_TEMPLATE (decl
);
19085 /* Return the most specialized of the class template partial
19086 specializations which can produce TYPE, a specialization of some class
19087 template. The value returned is actually a TREE_LIST; the TREE_TYPE is
19088 a _TYPE node corresponding to the partial specialization, while the
19089 TREE_PURPOSE is the set of template arguments that must be
19090 substituted into the TREE_TYPE in order to generate TYPE.
19092 If the choice of partial specialization is ambiguous, a diagnostic
19093 is issued, and the error_mark_node is returned. If there are no
19094 partial specializations matching TYPE, then NULL_TREE is
19095 returned, indicating that the primary template should be used. */
19098 most_specialized_class (tree type
, tsubst_flags_t complain
)
19100 tree list
= NULL_TREE
;
19105 tree outer_args
= NULL_TREE
;
19107 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
19108 tree main_tmpl
= most_general_template (tmpl
);
19109 tree args
= CLASSTYPE_TI_ARGS (type
);
19111 /* For determining which partial specialization to use, only the
19112 innermost args are interesting. */
19113 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19115 outer_args
= strip_innermost_template_args (args
, 1);
19116 args
= INNERMOST_TEMPLATE_ARGS (args
);
19119 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
19121 tree partial_spec_args
;
19123 tree spec_tmpl
= TREE_VALUE (t
);
19124 tree orig_parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19126 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
19128 ++processing_template_decl
;
19132 /* Discard the outer levels of args, and then substitute in the
19133 template args from the enclosing class. */
19134 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
19135 partial_spec_args
= tsubst_template_args
19136 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
19138 /* And the same for the partial specialization TEMPLATE_DECL. */
19139 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
19142 partial_spec_args
=
19143 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19146 /*require_all_args=*/true,
19147 /*use_default_args=*/true);
19149 --processing_template_decl
;
19151 if (partial_spec_args
== error_mark_node
)
19152 return error_mark_node
;
19153 if (spec_tmpl
== error_mark_node
)
19154 return error_mark_node
;
19156 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19157 spec_args
= get_class_bindings (tmpl
, parms
,
19163 spec_args
= add_to_template_args (outer_args
, spec_args
);
19164 list
= tree_cons (spec_args
, orig_parms
, list
);
19165 TREE_TYPE (list
) = TREE_TYPE (t
);
19172 ambiguous_p
= false;
19175 t
= TREE_CHAIN (t
);
19176 for (; t
; t
= TREE_CHAIN (t
))
19178 fate
= more_specialized_class (tmpl
, champ
, t
);
19185 t
= TREE_CHAIN (t
);
19188 ambiguous_p
= true;
19197 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
19199 fate
= more_specialized_class (tmpl
, champ
, t
);
19202 ambiguous_p
= true;
19210 char *spaces
= NULL
;
19211 if (!(complain
& tf_error
))
19212 return error_mark_node
;
19213 error ("ambiguous class template instantiation for %q#T", type
);
19214 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
19215 for (t
= list
; t
; t
= TREE_CHAIN (t
))
19217 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
19218 spaces
= spaces
? spaces
: get_spaces (str
);
19221 return error_mark_node
;
19227 /* Explicitly instantiate DECL. */
19230 do_decl_instantiation (tree decl
, tree storage
)
19232 tree result
= NULL_TREE
;
19235 if (!decl
|| decl
== error_mark_node
)
19236 /* An error occurred, for which grokdeclarator has already issued
19237 an appropriate message. */
19239 else if (! DECL_LANG_SPECIFIC (decl
))
19241 error ("explicit instantiation of non-template %q#D", decl
);
19245 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
19246 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
19248 if (VAR_P (decl
) && !var_templ
)
19250 /* There is an asymmetry here in the way VAR_DECLs and
19251 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19252 the latter, the DECL we get back will be marked as a
19253 template instantiation, and the appropriate
19254 DECL_TEMPLATE_INFO will be set up. This does not happen for
19255 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19256 should handle VAR_DECLs as it currently handles
19258 if (!DECL_CLASS_SCOPE_P (decl
))
19260 error ("%qD is not a static data member of a class template", decl
);
19263 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
19264 if (!result
|| !VAR_P (result
))
19266 error ("no matching template for %qD found", decl
);
19269 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
19271 error ("type %qT for explicit instantiation %qD does not match "
19272 "declared type %qT", TREE_TYPE (result
), decl
,
19277 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
19279 error ("explicit instantiation of %q#D", decl
);
19285 /* Check for various error cases. Note that if the explicit
19286 instantiation is valid the RESULT will currently be marked as an
19287 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19288 until we get here. */
19290 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19292 /* DR 259 [temp.spec].
19294 Both an explicit instantiation and a declaration of an explicit
19295 specialization shall not appear in a program unless the explicit
19296 instantiation follows a declaration of the explicit specialization.
19298 For a given set of template parameters, if an explicit
19299 instantiation of a template appears after a declaration of an
19300 explicit specialization for that template, the explicit
19301 instantiation has no effect. */
19304 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19308 No program shall explicitly instantiate any template more
19311 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19312 the first instantiation was `extern' and the second is not,
19313 and EXTERN_P for the opposite case. */
19314 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19315 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19316 /* If an "extern" explicit instantiation follows an ordinary
19317 explicit instantiation, the template is instantiated. */
19321 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19323 error ("no matching template for %qD found", result
);
19326 else if (!DECL_TEMPLATE_INFO (result
))
19328 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19332 if (storage
== NULL_TREE
)
19334 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19336 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19337 pedwarn (input_location
, OPT_Wpedantic
,
19338 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19343 error ("storage class %qD applied to template instantiation", storage
);
19345 check_explicit_instantiation_namespace (result
);
19346 mark_decl_instantiated (result
, extern_p
);
19348 instantiate_decl (result
, /*defer_ok=*/1,
19349 /*expl_inst_class_mem_p=*/false);
19353 mark_class_instantiated (tree t
, int extern_p
)
19355 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19356 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19357 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19358 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19361 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19362 rest_of_type_compilation (t
, 1);
19366 /* Called from do_type_instantiation through binding_table_foreach to
19367 do recursive instantiation for the type bound in ENTRY. */
19369 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19371 tree storage
= *(tree
*) data
;
19373 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19374 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19375 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19378 /* Called from do_type_instantiation to instantiate a member
19379 (a member function or a static member variable) of an
19380 explicitly instantiated class template. */
19382 instantiate_class_member (tree decl
, int extern_p
)
19384 mark_decl_instantiated (decl
, extern_p
);
19386 instantiate_decl (decl
, /*defer_ok=*/1,
19387 /*expl_inst_class_mem_p=*/true);
19390 /* Perform an explicit instantiation of template class T. STORAGE, if
19391 non-null, is the RID for extern, inline or static. COMPLAIN is
19392 nonzero if this is called from the parser, zero if called recursively,
19393 since the standard is unclear (as detailed below). */
19396 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19401 int previous_instantiation_extern_p
= 0;
19403 if (TREE_CODE (t
) == TYPE_DECL
)
19406 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19409 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19411 error ("explicit instantiation of non-class template %qD", tmpl
);
19413 error ("explicit instantiation of non-template type %qT", t
);
19419 if (!COMPLETE_TYPE_P (t
))
19421 if (complain
& tf_error
)
19422 error ("explicit instantiation of %q#T before definition of template",
19427 if (storage
!= NULL_TREE
)
19429 if (!in_system_header_at (input_location
))
19431 if (storage
== ridpointers
[(int) RID_EXTERN
])
19433 if (cxx_dialect
== cxx98
)
19434 pedwarn (input_location
, OPT_Wpedantic
,
19435 "ISO C++ 1998 forbids the use of %<extern%> on "
19436 "explicit instantiations");
19439 pedwarn (input_location
, OPT_Wpedantic
,
19440 "ISO C++ forbids the use of %qE"
19441 " on explicit instantiations", storage
);
19444 if (storage
== ridpointers
[(int) RID_INLINE
])
19446 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19448 else if (storage
== ridpointers
[(int) RID_STATIC
])
19452 error ("storage class %qD applied to template instantiation",
19458 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19460 /* DR 259 [temp.spec].
19462 Both an explicit instantiation and a declaration of an explicit
19463 specialization shall not appear in a program unless the explicit
19464 instantiation follows a declaration of the explicit specialization.
19466 For a given set of template parameters, if an explicit
19467 instantiation of a template appears after a declaration of an
19468 explicit specialization for that template, the explicit
19469 instantiation has no effect. */
19472 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19476 No program shall explicitly instantiate any template more
19479 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19480 instantiation was `extern'. If EXTERN_P then the second is.
19481 These cases are OK. */
19482 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19484 if (!previous_instantiation_extern_p
&& !extern_p
19485 && (complain
& tf_error
))
19486 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19488 /* If we've already instantiated the template, just return now. */
19489 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19493 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19494 mark_class_instantiated (t
, extern_p
);
19502 /* In contrast to implicit instantiation, where only the
19503 declarations, and not the definitions, of members are
19504 instantiated, we have here:
19508 The explicit instantiation of a class template specialization
19509 implies the instantiation of all of its members not
19510 previously explicitly specialized in the translation unit
19511 containing the explicit instantiation.
19513 Of course, we can't instantiate member template classes, since
19514 we don't have any arguments for them. Note that the standard
19515 is unclear on whether the instantiation of the members are
19516 *explicit* instantiations or not. However, the most natural
19517 interpretation is that it should be an explicit instantiation. */
19520 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19521 if (TREE_CODE (tmp
) == FUNCTION_DECL
19522 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19523 instantiate_class_member (tmp
, extern_p
);
19525 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19526 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19527 instantiate_class_member (tmp
, extern_p
);
19529 if (CLASSTYPE_NESTED_UTDS (t
))
19530 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19531 bt_instantiate_type_proc
, &storage
);
19535 /* Given a function DECL, which is a specialization of TMPL, modify
19536 DECL to be a re-instantiation of TMPL with the same template
19537 arguments. TMPL should be the template into which tsubst'ing
19538 should occur for DECL, not the most general template.
19540 One reason for doing this is a scenario like this:
19543 void f(const T&, int i);
19545 void g() { f(3, 7); }
19548 void f(const T& t, const int i) { }
19550 Note that when the template is first instantiated, with
19551 instantiate_template, the resulting DECL will have no name for the
19552 first parameter, and the wrong type for the second. So, when we go
19553 to instantiate the DECL, we regenerate it. */
19556 regenerate_decl_from_template (tree decl
, tree tmpl
)
19558 /* The arguments used to instantiate DECL, from the most general
19563 args
= DECL_TI_ARGS (decl
);
19564 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19566 /* Make sure that we can see identifiers, and compute access
19568 push_access_scope (decl
);
19570 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19578 args_depth
= TMPL_ARGS_DEPTH (args
);
19579 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19580 if (args_depth
> parms_depth
)
19581 args
= get_innermost_template_args (args
, parms_depth
);
19583 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19584 args
, tf_error
, NULL_TREE
,
19585 /*defer_ok*/false);
19586 if (specs
&& specs
!= error_mark_node
)
19587 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19590 /* Merge parameter declarations. */
19591 decl_parm
= skip_artificial_parms_for (decl
,
19592 DECL_ARGUMENTS (decl
));
19594 = skip_artificial_parms_for (code_pattern
,
19595 DECL_ARGUMENTS (code_pattern
));
19596 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
19601 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19602 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
19603 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
19605 parm_type
= type_decays_to (parm_type
);
19606 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19607 TREE_TYPE (decl_parm
) = parm_type
;
19608 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19609 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19611 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19612 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19614 decl_parm
= DECL_CHAIN (decl_parm
);
19615 pattern_parm
= DECL_CHAIN (pattern_parm
);
19617 /* Merge any parameters that match with the function parameter
19619 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
19622 tree expanded_types
;
19623 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19624 the parameters in this function parameter pack. */
19625 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
19626 args
, tf_error
, NULL_TREE
);
19627 len
= TREE_VEC_LENGTH (expanded_types
);
19628 for (i
= 0; i
< len
; i
++)
19633 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19634 /* Rename the parameter to include the index. */
19635 DECL_NAME (decl_parm
) =
19636 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
19637 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
19638 parm_type
= type_decays_to (parm_type
);
19639 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19640 TREE_TYPE (decl_parm
) = parm_type
;
19641 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19642 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19644 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19645 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19647 decl_parm
= DECL_CHAIN (decl_parm
);
19650 /* Merge additional specifiers from the CODE_PATTERN. */
19651 if (DECL_DECLARED_INLINE_P (code_pattern
)
19652 && !DECL_DECLARED_INLINE_P (decl
))
19653 DECL_DECLARED_INLINE_P (decl
) = 1;
19655 else if (VAR_P (decl
))
19657 DECL_INITIAL (decl
) =
19658 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
19659 tf_error
, DECL_TI_TEMPLATE (decl
),
19660 /*integral_constant_expression_p=*/false);
19661 if (VAR_HAD_UNKNOWN_BOUND (decl
))
19662 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
19663 tf_error
, DECL_TI_TEMPLATE (decl
));
19666 gcc_unreachable ();
19668 pop_access_scope (decl
);
19671 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19672 substituted to get DECL. */
19675 template_for_substitution (tree decl
)
19677 tree tmpl
= DECL_TI_TEMPLATE (decl
);
19679 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19680 for the instantiation. This is not always the most general
19681 template. Consider, for example:
19684 struct S { template <class U> void f();
19685 template <> void f<int>(); };
19687 and an instantiation of S<double>::f<int>. We want TD to be the
19688 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19689 while (/* An instantiation cannot have a definition, so we need a
19690 more general template. */
19691 DECL_TEMPLATE_INSTANTIATION (tmpl
)
19692 /* We must also deal with friend templates. Given:
19694 template <class T> struct S {
19695 template <class U> friend void f() {};
19698 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19699 so far as the language is concerned, but that's still
19700 where we get the pattern for the instantiation from. On
19701 other hand, if the definition comes outside the class, say:
19703 template <class T> struct S {
19704 template <class U> friend void f();
19706 template <class U> friend void f() {}
19708 we don't need to look any further. That's what the check for
19709 DECL_INITIAL is for. */
19710 || (TREE_CODE (decl
) == FUNCTION_DECL
19711 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
19712 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
19714 /* The present template, TD, should not be a definition. If it
19715 were a definition, we should be using it! Note that we
19716 cannot restructure the loop to just keep going until we find
19717 a template with a definition, since that might go too far if
19718 a specialization was declared, but not defined. */
19719 gcc_assert (!VAR_P (decl
)
19720 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
19722 /* Fetch the more general template. */
19723 tmpl
= DECL_TI_TEMPLATE (tmpl
);
19729 /* Returns true if we need to instantiate this template instance even if we
19730 know we aren't going to emit it.. */
19733 always_instantiate_p (tree decl
)
19735 /* We always instantiate inline functions so that we can inline them. An
19736 explicit instantiation declaration prohibits implicit instantiation of
19737 non-inline functions. With high levels of optimization, we would
19738 normally inline non-inline functions -- but we're not allowed to do
19739 that for "extern template" functions. Therefore, we check
19740 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19741 return ((TREE_CODE (decl
) == FUNCTION_DECL
19742 && (DECL_DECLARED_INLINE_P (decl
)
19743 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
19744 /* And we need to instantiate static data members so that
19745 their initializers are available in integral constant
19748 && decl_maybe_constant_var_p (decl
)));
19751 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19752 instantiate it now, modifying TREE_TYPE (fn). */
19755 maybe_instantiate_noexcept (tree fn
)
19757 tree fntype
, spec
, noex
, clone
;
19759 /* Don't instantiate a noexcept-specification from template context. */
19760 if (processing_template_decl
)
19763 if (DECL_CLONED_FUNCTION_P (fn
))
19764 fn
= DECL_CLONED_FUNCTION (fn
);
19765 fntype
= TREE_TYPE (fn
);
19766 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
19768 if (!spec
|| !TREE_PURPOSE (spec
))
19771 noex
= TREE_PURPOSE (spec
);
19773 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
19775 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
19776 spec
= get_defaulted_eh_spec (fn
);
19777 else if (push_tinst_level (fn
))
19779 push_access_scope (fn
);
19780 push_deferring_access_checks (dk_no_deferred
);
19781 input_location
= DECL_SOURCE_LOCATION (fn
);
19782 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
19783 DEFERRED_NOEXCEPT_ARGS (noex
),
19784 tf_warning_or_error
, fn
,
19785 /*function_p=*/false,
19786 /*integral_constant_expression_p=*/true);
19787 pop_deferring_access_checks ();
19788 pop_access_scope (fn
);
19789 pop_tinst_level ();
19790 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
19791 if (spec
== error_mark_node
)
19792 spec
= noexcept_false_spec
;
19795 spec
= noexcept_false_spec
;
19797 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
19800 FOR_EACH_CLONE (clone
, fn
)
19802 if (TREE_TYPE (clone
) == fntype
)
19803 TREE_TYPE (clone
) = TREE_TYPE (fn
);
19805 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
19809 /* Produce the definition of D, a _DECL generated from a template. If
19810 DEFER_OK is nonzero, then we don't have to actually do the
19811 instantiation now; we just have to do it sometime. Normally it is
19812 an error if this is an explicit instantiation but D is undefined.
19813 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
19814 explicitly instantiated class template. */
19817 instantiate_decl (tree d
, int defer_ok
,
19818 bool expl_inst_class_mem_p
)
19820 tree tmpl
= DECL_TI_TEMPLATE (d
);
19827 bool pattern_defined
;
19828 location_t saved_loc
= input_location
;
19829 int saved_unevaluated_operand
= cp_unevaluated_operand
;
19830 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
19836 /* This function should only be used to instantiate templates for
19837 functions and static member variables. */
19838 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
19840 /* Variables are never deferred; if instantiation is required, they
19841 are instantiated right away. That allows for better code in the
19842 case that an expression refers to the value of the variable --
19843 if the variable has a constant value the referring expression can
19844 take advantage of that fact. */
19846 || DECL_DECLARED_CONSTEXPR_P (d
))
19849 /* Don't instantiate cloned functions. Instead, instantiate the
19850 functions they cloned. */
19851 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
19852 d
= DECL_CLONED_FUNCTION (d
);
19854 if (DECL_TEMPLATE_INSTANTIATED (d
)
19855 || (TREE_CODE (d
) == FUNCTION_DECL
19856 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
19857 || DECL_TEMPLATE_SPECIALIZATION (d
))
19858 /* D has already been instantiated or explicitly specialized, so
19859 there's nothing for us to do here.
19861 It might seem reasonable to check whether or not D is an explicit
19862 instantiation, and, if so, stop here. But when an explicit
19863 instantiation is deferred until the end of the compilation,
19864 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
19865 the instantiation. */
19868 /* Check to see whether we know that this template will be
19869 instantiated in some other file, as with "extern template"
19871 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
19873 /* In general, we do not instantiate such templates. */
19874 if (external_p
&& !always_instantiate_p (d
))
19877 gen_tmpl
= most_general_template (tmpl
);
19878 gen_args
= DECL_TI_ARGS (d
);
19880 if (tmpl
!= gen_tmpl
)
19881 /* We should already have the extra args. */
19882 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
19883 == TMPL_ARGS_DEPTH (gen_args
));
19884 /* And what's in the hash table should match D. */
19885 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
19886 || spec
== NULL_TREE
);
19888 /* This needs to happen before any tsubsting. */
19889 if (! push_tinst_level (d
))
19892 timevar_push (TV_TEMPLATE_INST
);
19894 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
19895 for the instantiation. */
19896 td
= template_for_substitution (d
);
19897 code_pattern
= DECL_TEMPLATE_RESULT (td
);
19899 /* We should never be trying to instantiate a member of a class
19900 template or partial specialization. */
19901 gcc_assert (d
!= code_pattern
);
19903 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
19904 || DECL_TEMPLATE_SPECIALIZATION (td
))
19905 /* In the case of a friend template whose definition is provided
19906 outside the class, we may have too many arguments. Drop the
19907 ones we don't need. The same is true for specializations. */
19908 args
= get_innermost_template_args
19909 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
19913 if (TREE_CODE (d
) == FUNCTION_DECL
)
19915 deleted_p
= DECL_DELETED_FN (code_pattern
);
19916 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
19917 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
19923 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
19926 /* We may be in the middle of deferred access check. Disable it now. */
19927 push_deferring_access_checks (dk_no_deferred
);
19929 /* Unless an explicit instantiation directive has already determined
19930 the linkage of D, remember that a definition is available for
19932 if (pattern_defined
19933 && !DECL_INTERFACE_KNOWN (d
)
19934 && !DECL_NOT_REALLY_EXTERN (d
))
19935 mark_definable (d
);
19937 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
19938 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
19939 input_location
= DECL_SOURCE_LOCATION (d
);
19941 /* If D is a member of an explicitly instantiated class template,
19942 and no definition is available, treat it like an implicit
19944 if (!pattern_defined
&& expl_inst_class_mem_p
19945 && DECL_EXPLICIT_INSTANTIATION (d
))
19947 /* Leave linkage flags alone on instantiations with anonymous
19949 if (TREE_PUBLIC (d
))
19951 DECL_NOT_REALLY_EXTERN (d
) = 0;
19952 DECL_INTERFACE_KNOWN (d
) = 0;
19954 SET_DECL_IMPLICIT_INSTANTIATION (d
);
19957 /* Defer all other templates, unless we have been explicitly
19958 forbidden from doing so. */
19959 if (/* If there is no definition, we cannot instantiate the
19962 /* If it's OK to postpone instantiation, do so. */
19964 /* If this is a static data member that will be defined
19965 elsewhere, we don't want to instantiate the entire data
19966 member, but we do want to instantiate the initializer so that
19967 we can substitute that elsewhere. */
19968 || (external_p
&& VAR_P (d
))
19969 /* Handle here a deleted function too, avoid generating
19970 its body (c++/61080). */
19973 /* The definition of the static data member is now required so
19974 we must substitute the initializer. */
19976 && !DECL_INITIAL (d
)
19977 && DECL_INITIAL (code_pattern
))
19981 bool const_init
= false;
19982 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
19984 ns
= decl_namespace_context (d
);
19985 push_nested_namespace (ns
);
19987 push_nested_class (DECL_CONTEXT (d
));
19988 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
19990 tf_warning_or_error
, NULL_TREE
,
19991 /*integral_constant_expression_p=*/false);
19992 /* Make sure the initializer is still constant, in case of
19993 circular dependency (template/instantiate6.C). */
19995 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
19996 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
19997 /*asmspec_tree=*/NULL_TREE
,
19998 LOOKUP_ONLYCONVERTING
);
20000 pop_nested_class ();
20001 pop_nested_namespace (ns
);
20004 /* We restore the source position here because it's used by
20005 add_pending_template. */
20006 input_location
= saved_loc
;
20008 if (at_eof
&& !pattern_defined
20009 && DECL_EXPLICIT_INSTANTIATION (d
)
20010 && DECL_NOT_REALLY_EXTERN (d
))
20013 The definition of a non-exported function template, a
20014 non-exported member function template, or a non-exported
20015 member function or static data member of a class template
20016 shall be present in every translation unit in which it is
20017 explicitly instantiated. */
20018 permerror (input_location
, "explicit instantiation of %qD "
20019 "but no definition available", d
);
20021 /* If we're in unevaluated context, we just wanted to get the
20022 constant value; this isn't an odr use, so don't queue
20023 a full instantiation. */
20024 if (cp_unevaluated_operand
!= 0)
20026 /* ??? Historically, we have instantiated inline functions, even
20027 when marked as "extern template". */
20028 if (!(external_p
&& VAR_P (d
)))
20029 add_pending_template (d
);
20032 /* Tell the repository that D is available in this translation unit
20033 -- and see if it is supposed to be instantiated here. */
20034 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
20036 /* In a PCH file, despite the fact that the repository hasn't
20037 requested instantiation in the PCH it is still possible that
20038 an instantiation will be required in a file that includes the
20041 add_pending_template (d
);
20042 /* Instantiate inline functions so that the inliner can do its
20043 job, even though we'll not be emitting a copy of this
20045 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
20049 fn_context
= decl_function_context (d
);
20050 nested
= (current_function_decl
!= NULL_TREE
);
20052 push_to_top_level ();
20056 push_function_context ();
20057 cp_unevaluated_operand
= 0;
20058 c_inhibit_evaluation_warnings
= 0;
20061 /* Mark D as instantiated so that recursive calls to
20062 instantiate_decl do not try to instantiate it again. */
20063 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
20065 /* Regenerate the declaration in case the template has been modified
20066 by a subsequent redeclaration. */
20067 regenerate_decl_from_template (d
, td
);
20069 /* We already set the file and line above. Reset them now in case
20070 they changed as a result of calling regenerate_decl_from_template. */
20071 input_location
= DECL_SOURCE_LOCATION (d
);
20076 bool const_init
= false;
20078 /* Clear out DECL_RTL; whatever was there before may not be right
20079 since we've reset the type of the declaration. */
20080 SET_DECL_RTL (d
, NULL
);
20081 DECL_IN_AGGR_P (d
) = 0;
20083 /* The initializer is placed in DECL_INITIAL by
20084 regenerate_decl_from_template so we don't need to
20085 push/pop_access_scope again here. Pull it out so that
20086 cp_finish_decl can process it. */
20087 init
= DECL_INITIAL (d
);
20088 DECL_INITIAL (d
) = NULL_TREE
;
20089 DECL_INITIALIZED_P (d
) = 0;
20091 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
20092 initializer. That function will defer actual emission until
20093 we have a chance to determine linkage. */
20094 DECL_EXTERNAL (d
) = 0;
20096 /* Enter the scope of D so that access-checking works correctly. */
20097 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20099 push_nested_class (DECL_CONTEXT (d
));
20101 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20102 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
20105 pop_nested_class ();
20107 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
20108 synthesize_method (d
);
20109 else if (TREE_CODE (d
) == FUNCTION_DECL
)
20111 hash_map
<tree
, tree
> *saved_local_specializations
;
20115 tree block
= NULL_TREE
;
20117 /* Save away the current list, in case we are instantiating one
20118 template from within the body of another. */
20119 saved_local_specializations
= local_specializations
;
20121 /* Set up the list of local specializations. */
20122 local_specializations
= new hash_map
<tree
, tree
>;
20124 /* Set up context. */
20125 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20126 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20127 block
= push_stmt_list ();
20129 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
20131 /* Some typedefs referenced from within the template code need to be
20132 access checked at template instantiation time, i.e now. These
20133 types were added to the template at parsing time. Let's get those
20134 and perform the access checks then. */
20135 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
20138 /* Create substitution entries for the parameters. */
20139 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
20140 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
20141 spec_parm
= DECL_ARGUMENTS (d
);
20142 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
20144 register_local_specialization (spec_parm
, tmpl_parm
);
20145 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
20146 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
20148 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
20150 if (!DECL_PACK_P (tmpl_parm
))
20152 register_local_specialization (spec_parm
, tmpl_parm
);
20153 spec_parm
= DECL_CHAIN (spec_parm
);
20157 /* Register the (value) argument pack as a specialization of
20158 TMPL_PARM, then move on. */
20159 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
20160 register_local_specialization (argpack
, tmpl_parm
);
20163 gcc_assert (!spec_parm
);
20165 /* Substitute into the body of the function. */
20166 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20167 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
20168 tf_warning_or_error
, tmpl
);
20171 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
20172 tf_warning_or_error
, tmpl
,
20173 /*integral_constant_expression_p=*/false);
20175 /* Set the current input_location to the end of the function
20176 so that finish_function knows where we are. */
20178 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
20180 /* Remember if we saw an infinite loop in the template. */
20181 current_function_infinite_loop
20182 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
20185 /* We don't need the local specializations any more. */
20186 delete local_specializations
;
20187 local_specializations
= saved_local_specializations
;
20189 /* Finish the function. */
20190 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20191 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20192 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
20195 d
= finish_function (0);
20196 expand_or_defer_fn (d
);
20199 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20200 cp_check_omp_declare_reduction (d
);
20203 /* We're not deferring instantiation any more. */
20204 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
20207 pop_from_top_level ();
20209 pop_function_context ();
20212 input_location
= saved_loc
;
20213 cp_unevaluated_operand
= saved_unevaluated_operand
;
20214 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20215 pop_deferring_access_checks ();
20216 pop_tinst_level ();
20218 timevar_pop (TV_TEMPLATE_INST
);
20223 /* Run through the list of templates that we wish we could
20224 instantiate, and instantiate any we can. RETRIES is the
20225 number of times we retry pending template instantiation. */
20228 instantiate_pending_templates (int retries
)
20231 location_t saved_loc
= input_location
;
20233 /* Instantiating templates may trigger vtable generation. This in turn
20234 may require further template instantiations. We place a limit here
20235 to avoid infinite loop. */
20236 if (pending_templates
&& retries
>= max_tinst_depth
)
20238 tree decl
= pending_templates
->tinst
->decl
;
20240 error ("template instantiation depth exceeds maximum of %d"
20241 " instantiating %q+D, possibly from virtual table generation"
20242 " (use -ftemplate-depth= to increase the maximum)",
20243 max_tinst_depth
, decl
);
20244 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20245 /* Pretend that we defined it. */
20246 DECL_INITIAL (decl
) = error_mark_node
;
20252 struct pending_template
**t
= &pending_templates
;
20253 struct pending_template
*last
= NULL
;
20257 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
20258 bool complete
= false;
20260 if (TYPE_P (instantiation
))
20264 if (!COMPLETE_TYPE_P (instantiation
))
20266 instantiate_class_template (instantiation
);
20267 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
20268 for (fn
= TYPE_METHODS (instantiation
);
20270 fn
= TREE_CHAIN (fn
))
20271 if (! DECL_ARTIFICIAL (fn
))
20272 instantiate_decl (fn
,
20274 /*expl_inst_class_mem_p=*/false);
20275 if (COMPLETE_TYPE_P (instantiation
))
20279 complete
= COMPLETE_TYPE_P (instantiation
);
20283 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20284 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
20287 = instantiate_decl (instantiation
,
20289 /*expl_inst_class_mem_p=*/false);
20290 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20294 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20295 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20299 /* If INSTANTIATION has been instantiated, then we don't
20300 need to consider it again in the future. */
20308 current_tinst_level
= NULL
;
20310 last_pending_template
= last
;
20312 while (reconsider
);
20314 input_location
= saved_loc
;
20317 /* Substitute ARGVEC into T, which is a list of initializers for
20318 either base class or a non-static data member. The TREE_PURPOSEs
20319 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20320 instantiate_decl. */
20323 tsubst_initializer_list (tree t
, tree argvec
)
20325 tree inits
= NULL_TREE
;
20327 for (; t
; t
= TREE_CHAIN (t
))
20331 tree expanded_bases
= NULL_TREE
;
20332 tree expanded_arguments
= NULL_TREE
;
20335 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20340 /* Expand the base class expansion type into separate base
20342 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20343 tf_warning_or_error
,
20345 if (expanded_bases
== error_mark_node
)
20348 /* We'll be building separate TREE_LISTs of arguments for
20350 len
= TREE_VEC_LENGTH (expanded_bases
);
20351 expanded_arguments
= make_tree_vec (len
);
20352 for (i
= 0; i
< len
; i
++)
20353 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20355 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20356 expand each argument in the TREE_VALUE of t. */
20357 expr
= make_node (EXPR_PACK_EXPANSION
);
20358 PACK_EXPANSION_LOCAL_P (expr
) = true;
20359 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20360 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20362 if (TREE_VALUE (t
) == void_type_node
)
20363 /* VOID_TYPE_NODE is used to indicate
20364 value-initialization. */
20366 for (i
= 0; i
< len
; i
++)
20367 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20371 /* Substitute parameter packs into each argument in the
20373 in_base_initializer
= 1;
20374 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20376 tree expanded_exprs
;
20378 /* Expand the argument. */
20379 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20381 = tsubst_pack_expansion (expr
, argvec
,
20382 tf_warning_or_error
,
20384 if (expanded_exprs
== error_mark_node
)
20387 /* Prepend each of the expanded expressions to the
20388 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20389 for (i
= 0; i
< len
; i
++)
20391 TREE_VEC_ELT (expanded_arguments
, i
) =
20392 tree_cons (NULL_TREE
,
20393 TREE_VEC_ELT (expanded_exprs
, i
),
20394 TREE_VEC_ELT (expanded_arguments
, i
));
20397 in_base_initializer
= 0;
20399 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20400 since we built them backwards. */
20401 for (i
= 0; i
< len
; i
++)
20403 TREE_VEC_ELT (expanded_arguments
, i
) =
20404 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20409 for (i
= 0; i
< len
; ++i
)
20411 if (expanded_bases
)
20413 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20414 decl
= expand_member_init (decl
);
20415 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20420 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20421 tf_warning_or_error
, NULL_TREE
);
20423 decl
= expand_member_init (decl
);
20424 if (decl
&& !DECL_P (decl
))
20425 in_base_initializer
= 1;
20427 init
= TREE_VALUE (t
);
20429 if (init
!= void_type_node
)
20430 init
= tsubst_expr (init
, argvec
,
20431 tf_warning_or_error
, NULL_TREE
,
20432 /*integral_constant_expression_p=*/false);
20433 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20434 /* If we had an initializer but it instantiated to nothing,
20435 value-initialize the object. This will only occur when
20436 the initializer was a pack expansion where the parameter
20437 packs used in that expansion were of length zero. */
20438 init
= void_type_node
;
20439 in_base_initializer
= 0;
20444 init
= build_tree_list (decl
, init
);
20445 TREE_CHAIN (init
) = inits
;
20453 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20456 set_current_access_from_decl (tree decl
)
20458 if (TREE_PRIVATE (decl
))
20459 current_access_specifier
= access_private_node
;
20460 else if (TREE_PROTECTED (decl
))
20461 current_access_specifier
= access_protected_node
;
20463 current_access_specifier
= access_public_node
;
20466 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20467 is the instantiation (which should have been created with
20468 start_enum) and ARGS are the template arguments to use. */
20471 tsubst_enum (tree tag
, tree newtag
, tree args
)
20475 if (SCOPED_ENUM_P (newtag
))
20476 begin_scope (sk_scoped_enum
, newtag
);
20478 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20483 decl
= TREE_VALUE (e
);
20484 /* Note that in a template enum, the TREE_VALUE is the
20485 CONST_DECL, not the corresponding INTEGER_CST. */
20486 value
= tsubst_expr (DECL_INITIAL (decl
),
20487 args
, tf_warning_or_error
, NULL_TREE
,
20488 /*integral_constant_expression_p=*/true);
20490 /* Give this enumeration constant the correct access. */
20491 set_current_access_from_decl (decl
);
20493 /* Actually build the enumerator itself. */
20495 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
20498 if (SCOPED_ENUM_P (newtag
))
20501 finish_enum_value_list (newtag
);
20502 finish_enum (newtag
);
20504 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20505 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20508 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20509 its type -- but without substituting the innermost set of template
20510 arguments. So, innermost set of template parameters will appear in
20514 get_mostly_instantiated_function_type (tree decl
)
20522 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
20523 targs
= DECL_TI_ARGS (decl
);
20524 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
20525 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
20527 /* There should be as many levels of arguments as there are levels
20529 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
20531 fn_type
= TREE_TYPE (tmpl
);
20533 if (parm_depth
== 1)
20534 /* No substitution is necessary. */
20541 /* Replace the innermost level of the TARGS with NULL_TREEs to
20542 let tsubst know not to substitute for those parameters. */
20543 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20544 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
20545 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
20546 TMPL_ARGS_LEVEL (targs
, i
));
20547 SET_TMPL_ARGS_LEVEL (partial_args
,
20548 TMPL_ARGS_DEPTH (targs
),
20549 make_tree_vec (DECL_NTPARMS (tmpl
)));
20551 /* Make sure that we can see identifiers, and compute access
20553 push_access_scope (decl
);
20555 ++processing_template_decl
;
20556 /* Now, do the (partial) substitution to figure out the
20557 appropriate function type. */
20558 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
20559 --processing_template_decl
;
20561 /* Substitute into the template parameters to obtain the real
20562 innermost set of parameters. This step is important if the
20563 innermost set of template parameters contains value
20564 parameters whose types depend on outer template parameters. */
20565 TREE_VEC_LENGTH (partial_args
)--;
20566 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
20568 pop_access_scope (decl
);
20574 /* Return truthvalue if we're processing a template different from
20575 the last one involved in diagnostics. */
20577 problematic_instantiation_changed (void)
20579 return current_tinst_level
!= last_error_tinst_level
;
20582 /* Remember current template involved in diagnostics. */
20584 record_last_problematic_instantiation (void)
20586 last_error_tinst_level
= current_tinst_level
;
20589 struct tinst_level
*
20590 current_instantiation (void)
20592 return current_tinst_level
;
20595 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20596 type. Return zero for ok, nonzero for disallowed. Issue error and
20597 warning messages under control of COMPLAIN. */
20600 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20602 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20604 else if (POINTER_TYPE_P (type
))
20606 else if (TYPE_PTRMEM_P (type
))
20608 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20610 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20612 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20614 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20617 if (complain
& tf_error
)
20619 if (type
== error_mark_node
)
20620 inform (input_location
, "invalid template non-type parameter");
20622 error ("%q#T is not a valid type for a template non-type parameter",
20628 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20629 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20632 dependent_type_p_r (tree type
)
20638 A type is dependent if it is:
20640 -- a template parameter. Template template parameters are types
20641 for us (since TYPE_P holds true for them) so we handle
20643 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20644 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
20646 /* -- a qualified-id with a nested-name-specifier which contains a
20647 class-name that names a dependent type or whose unqualified-id
20648 names a dependent type. */
20649 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20651 /* -- a cv-qualified type where the cv-unqualified type is
20653 type
= TYPE_MAIN_VARIANT (type
);
20654 /* -- a compound type constructed from any dependent type. */
20655 if (TYPE_PTRMEM_P (type
))
20656 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
20657 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
20659 else if (TYPE_PTR_P (type
)
20660 || TREE_CODE (type
) == REFERENCE_TYPE
)
20661 return dependent_type_p (TREE_TYPE (type
));
20662 else if (TREE_CODE (type
) == FUNCTION_TYPE
20663 || TREE_CODE (type
) == METHOD_TYPE
)
20667 if (dependent_type_p (TREE_TYPE (type
)))
20669 for (arg_type
= TYPE_ARG_TYPES (type
);
20671 arg_type
= TREE_CHAIN (arg_type
))
20672 if (dependent_type_p (TREE_VALUE (arg_type
)))
20676 /* -- an array type constructed from any dependent type or whose
20677 size is specified by a constant expression that is
20680 We checked for type- and value-dependence of the bounds in
20681 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20682 if (TREE_CODE (type
) == ARRAY_TYPE
)
20684 if (TYPE_DOMAIN (type
)
20685 && dependent_type_p (TYPE_DOMAIN (type
)))
20687 return dependent_type_p (TREE_TYPE (type
));
20690 /* -- a template-id in which either the template name is a template
20692 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20694 /* ... or any of the template arguments is a dependent type or
20695 an expression that is type-dependent or value-dependent. */
20696 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
20697 && (any_dependent_template_arguments_p
20698 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
20701 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20702 dependent; if the argument of the `typeof' expression is not
20703 type-dependent, then it should already been have resolved. */
20704 if (TREE_CODE (type
) == TYPEOF_TYPE
20705 || TREE_CODE (type
) == DECLTYPE_TYPE
20706 || TREE_CODE (type
) == UNDERLYING_TYPE
)
20709 /* A template argument pack is dependent if any of its packed
20711 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
20713 tree args
= ARGUMENT_PACK_ARGS (type
);
20714 int i
, len
= TREE_VEC_LENGTH (args
);
20715 for (i
= 0; i
< len
; ++i
)
20716 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20720 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20721 be template parameters. */
20722 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
20725 /* The standard does not specifically mention types that are local
20726 to template functions or local classes, but they should be
20727 considered dependent too. For example:
20729 template <int I> void f() {
20734 The size of `E' cannot be known until the value of `I' has been
20735 determined. Therefore, `E' must be considered dependent. */
20736 scope
= TYPE_CONTEXT (type
);
20737 if (scope
&& TYPE_P (scope
))
20738 return dependent_type_p (scope
);
20739 /* Don't use type_dependent_expression_p here, as it can lead
20740 to infinite recursion trying to determine whether a lambda
20741 nested in a lambda is dependent (c++/47687). */
20742 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
20743 && DECL_LANG_SPECIFIC (scope
)
20744 && DECL_TEMPLATE_INFO (scope
)
20745 && (any_dependent_template_arguments_p
20746 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
20749 /* Other types are non-dependent. */
20753 /* Returns TRUE if TYPE is dependent, in the sense of
20754 [temp.dep.type]. Note that a NULL type is considered dependent. */
20757 dependent_type_p (tree type
)
20759 /* If there are no template parameters in scope, then there can't be
20760 any dependent types. */
20761 if (!processing_template_decl
)
20763 /* If we are not processing a template, then nobody should be
20764 providing us with a dependent type. */
20766 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
20770 /* If the type is NULL, we have not computed a type for the entity
20771 in question; in that case, the type is dependent. */
20775 /* Erroneous types can be considered non-dependent. */
20776 if (type
== error_mark_node
)
20779 /* If we have not already computed the appropriate value for TYPE,
20781 if (!TYPE_DEPENDENT_P_VALID (type
))
20783 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
20784 TYPE_DEPENDENT_P_VALID (type
) = 1;
20787 return TYPE_DEPENDENT_P (type
);
20790 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
20791 lookup. In other words, a dependent type that is not the current
20795 dependent_scope_p (tree scope
)
20797 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
20798 && !currently_open_class (scope
));
20801 /* T is a SCOPE_REF; return whether we need to consider it
20802 instantiation-dependent so that we can check access at instantiation
20803 time even though we know which member it resolves to. */
20806 instantiation_dependent_scope_ref_p (tree t
)
20808 if (DECL_P (TREE_OPERAND (t
, 1))
20809 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
20810 && accessible_in_template_p (TREE_OPERAND (t
, 0),
20811 TREE_OPERAND (t
, 1)))
20817 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
20818 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
20821 /* Note that this predicate is not appropriate for general expressions;
20822 only constant expressions (that satisfy potential_constant_expression)
20823 can be tested for value dependence. */
20826 value_dependent_expression_p (tree expression
)
20828 if (!processing_template_decl
)
20831 /* A name declared with a dependent type. */
20832 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
20835 switch (TREE_CODE (expression
))
20837 case IDENTIFIER_NODE
:
20838 /* A name that has not been looked up -- must be dependent. */
20841 case TEMPLATE_PARM_INDEX
:
20842 /* A non-type template parm. */
20846 /* A non-type template parm. */
20847 if (DECL_TEMPLATE_PARM_P (expression
))
20849 return value_dependent_expression_p (DECL_INITIAL (expression
));
20852 /* A constant with literal type and is initialized
20853 with an expression that is value-dependent.
20855 Note that a non-dependent parenthesized initializer will have
20856 already been replaced with its constant value, so if we see
20857 a TREE_LIST it must be dependent. */
20858 if (DECL_INITIAL (expression
)
20859 && decl_constant_var_p (expression
)
20860 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
20861 || value_dependent_expression_p (DECL_INITIAL (expression
))))
20865 case DYNAMIC_CAST_EXPR
:
20866 case STATIC_CAST_EXPR
:
20867 case CONST_CAST_EXPR
:
20868 case REINTERPRET_CAST_EXPR
:
20870 /* These expressions are value-dependent if the type to which
20871 the cast occurs is dependent or the expression being casted
20872 is value-dependent. */
20874 tree type
= TREE_TYPE (expression
);
20876 if (dependent_type_p (type
))
20879 /* A functional cast has a list of operands. */
20880 expression
= TREE_OPERAND (expression
, 0);
20883 /* If there are no operands, it must be an expression such
20884 as "int()". This should not happen for aggregate types
20885 because it would form non-constant expressions. */
20886 gcc_assert (cxx_dialect
>= cxx11
20887 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
20892 if (TREE_CODE (expression
) == TREE_LIST
)
20893 return any_value_dependent_elements_p (expression
);
20895 return value_dependent_expression_p (expression
);
20899 if (SIZEOF_EXPR_TYPE_P (expression
))
20900 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
20904 /* A `sizeof' expression is value-dependent if the operand is
20905 type-dependent or is a pack expansion. */
20906 expression
= TREE_OPERAND (expression
, 0);
20907 if (PACK_EXPANSION_P (expression
))
20909 else if (TYPE_P (expression
))
20910 return dependent_type_p (expression
);
20911 return instantiation_dependent_expression_p (expression
);
20913 case AT_ENCODE_EXPR
:
20914 /* An 'encode' expression is value-dependent if the operand is
20916 expression
= TREE_OPERAND (expression
, 0);
20917 return dependent_type_p (expression
);
20919 case NOEXCEPT_EXPR
:
20920 expression
= TREE_OPERAND (expression
, 0);
20921 return instantiation_dependent_expression_p (expression
);
20924 /* All instantiation-dependent expressions should also be considered
20925 value-dependent. */
20926 return instantiation_dependent_scope_ref_p (expression
);
20928 case COMPONENT_REF
:
20929 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
20930 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
20932 case NONTYPE_ARGUMENT_PACK
:
20933 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
20934 is value-dependent. */
20936 tree values
= ARGUMENT_PACK_ARGS (expression
);
20937 int i
, len
= TREE_VEC_LENGTH (values
);
20939 for (i
= 0; i
< len
; ++i
)
20940 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
20948 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
20949 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
20950 || (type2
? dependent_type_p (type2
) : false));
20954 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20955 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
20958 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20959 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
20963 tree op
= TREE_OPERAND (expression
, 0);
20964 return (value_dependent_expression_p (op
)
20965 || has_value_dependent_address (op
));
20970 tree fn
= get_callee_fndecl (expression
);
20972 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
20974 nargs
= call_expr_nargs (expression
);
20975 for (i
= 0; i
< nargs
; ++i
)
20977 tree op
= CALL_EXPR_ARG (expression
, i
);
20978 /* In a call to a constexpr member function, look through the
20979 implicit ADDR_EXPR on the object argument so that it doesn't
20980 cause the call to be considered value-dependent. We also
20981 look through it in potential_constant_expression. */
20982 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
20983 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
20984 && TREE_CODE (op
) == ADDR_EXPR
)
20985 op
= TREE_OPERAND (op
, 0);
20986 if (value_dependent_expression_p (op
))
20992 case TEMPLATE_ID_EXPR
:
20993 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
20995 return type_dependent_expression_p (expression
);
21001 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
21002 if (value_dependent_expression_p (val
))
21008 /* Treat a GNU statement expression as dependent to avoid crashing
21009 under fold_non_dependent_expr; it can't be constant. */
21013 /* A constant expression is value-dependent if any subexpression is
21014 value-dependent. */
21015 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
21017 case tcc_reference
:
21019 case tcc_comparison
:
21021 case tcc_expression
:
21024 int i
, len
= cp_tree_operand_length (expression
);
21026 for (i
= 0; i
< len
; i
++)
21028 tree t
= TREE_OPERAND (expression
, i
);
21030 /* In some cases, some of the operands may be missing.l
21031 (For example, in the case of PREDECREMENT_EXPR, the
21032 amount to increment by may be missing.) That doesn't
21033 make the expression dependent. */
21034 if (t
&& value_dependent_expression_p (t
))
21045 /* The expression is not value-dependent. */
21049 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
21050 [temp.dep.expr]. Note that an expression with no type is
21051 considered dependent. Other parts of the compiler arrange for an
21052 expression with type-dependent subexpressions to have no type, so
21053 this function doesn't have to be fully recursive. */
21056 type_dependent_expression_p (tree expression
)
21058 if (!processing_template_decl
)
21061 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
21064 /* An unresolved name is always dependent. */
21065 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
21068 /* Some expression forms are never type-dependent. */
21069 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
21070 || TREE_CODE (expression
) == SIZEOF_EXPR
21071 || TREE_CODE (expression
) == ALIGNOF_EXPR
21072 || TREE_CODE (expression
) == AT_ENCODE_EXPR
21073 || TREE_CODE (expression
) == NOEXCEPT_EXPR
21074 || TREE_CODE (expression
) == TRAIT_EXPR
21075 || TREE_CODE (expression
) == TYPEID_EXPR
21076 || TREE_CODE (expression
) == DELETE_EXPR
21077 || TREE_CODE (expression
) == VEC_DELETE_EXPR
21078 || TREE_CODE (expression
) == THROW_EXPR
)
21081 /* The types of these expressions depends only on the type to which
21082 the cast occurs. */
21083 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
21084 || TREE_CODE (expression
) == STATIC_CAST_EXPR
21085 || TREE_CODE (expression
) == CONST_CAST_EXPR
21086 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
21087 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
21088 || TREE_CODE (expression
) == CAST_EXPR
)
21089 return dependent_type_p (TREE_TYPE (expression
));
21091 /* The types of these expressions depends only on the type created
21092 by the expression. */
21093 if (TREE_CODE (expression
) == NEW_EXPR
21094 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
21096 /* For NEW_EXPR tree nodes created inside a template, either
21097 the object type itself or a TREE_LIST may appear as the
21099 tree type
= TREE_OPERAND (expression
, 1);
21100 if (TREE_CODE (type
) == TREE_LIST
)
21101 /* This is an array type. We need to check array dimensions
21103 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
21104 || value_dependent_expression_p
21105 (TREE_OPERAND (TREE_VALUE (type
), 1));
21107 return dependent_type_p (type
);
21110 if (TREE_CODE (expression
) == SCOPE_REF
)
21112 tree scope
= TREE_OPERAND (expression
, 0);
21113 tree name
= TREE_OPERAND (expression
, 1);
21115 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
21116 contains an identifier associated by name lookup with one or more
21117 declarations declared with a dependent type, or...a
21118 nested-name-specifier or qualified-id that names a member of an
21119 unknown specialization. */
21120 return (type_dependent_expression_p (name
)
21121 || dependent_scope_p (scope
));
21124 if (TREE_CODE (expression
) == FUNCTION_DECL
21125 && DECL_LANG_SPECIFIC (expression
)
21126 && DECL_TEMPLATE_INFO (expression
)
21127 && (any_dependent_template_arguments_p
21128 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
21131 if (TREE_CODE (expression
) == TEMPLATE_DECL
21132 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
21135 if (TREE_CODE (expression
) == STMT_EXPR
)
21136 expression
= stmt_expr_value_expr (expression
);
21138 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
21143 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
21145 if (type_dependent_expression_p (elt
))
21151 /* A static data member of the current instantiation with incomplete
21152 array type is type-dependent, as the definition and specializations
21153 can have different bounds. */
21154 if (VAR_P (expression
)
21155 && DECL_CLASS_SCOPE_P (expression
)
21156 && dependent_type_p (DECL_CONTEXT (expression
))
21157 && VAR_HAD_UNKNOWN_BOUND (expression
))
21160 /* An array of unknown bound depending on a variadic parameter, eg:
21162 template<typename... Args>
21163 void foo (Args... args)
21165 int arr[] = { args... };
21168 template<int... vals>
21171 int arr[] = { vals... };
21174 If the array has no length and has an initializer, it must be that
21175 we couldn't determine its length in cp_complete_array_type because
21176 it is dependent. */
21177 if (VAR_P (expression
)
21178 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
21179 && !TYPE_DOMAIN (TREE_TYPE (expression
))
21180 && DECL_INITIAL (expression
))
21183 if (TREE_TYPE (expression
) == unknown_type_node
)
21185 if (TREE_CODE (expression
) == ADDR_EXPR
)
21186 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
21187 if (TREE_CODE (expression
) == COMPONENT_REF
21188 || TREE_CODE (expression
) == OFFSET_REF
)
21190 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21192 expression
= TREE_OPERAND (expression
, 1);
21193 if (identifier_p (expression
))
21196 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21197 if (TREE_CODE (expression
) == SCOPE_REF
)
21200 /* Always dependent, on the number of arguments if nothing else. */
21201 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
21204 if (BASELINK_P (expression
))
21206 if (BASELINK_OPTYPE (expression
)
21207 && dependent_type_p (BASELINK_OPTYPE (expression
)))
21209 expression
= BASELINK_FUNCTIONS (expression
);
21212 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
21214 if (any_dependent_template_arguments_p
21215 (TREE_OPERAND (expression
, 1)))
21217 expression
= TREE_OPERAND (expression
, 0);
21219 gcc_assert (TREE_CODE (expression
) == OVERLOAD
21220 || TREE_CODE (expression
) == FUNCTION_DECL
);
21224 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
21226 expression
= OVL_NEXT (expression
);
21231 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
21233 return (dependent_type_p (TREE_TYPE (expression
)));
21236 /* walk_tree callback function for instantiation_dependent_expression_p,
21237 below. Returns non-zero if a dependent subexpression is found. */
21240 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
21245 /* We don't have to worry about decltype currently because decltype
21246 of an instantiation-dependent expr is a dependent type. This
21247 might change depending on the resolution of DR 1172. */
21248 *walk_subtrees
= false;
21251 enum tree_code code
= TREE_CODE (*tp
);
21254 /* Don't treat an argument list as dependent just because it has no
21262 /* A constant with a dependent initializer is dependent. */
21263 if (value_dependent_expression_p (*tp
))
21267 case TEMPLATE_PARM_INDEX
:
21270 /* Handle expressions with type operands. */
21274 case AT_ENCODE_EXPR
:
21276 tree op
= TREE_OPERAND (*tp
, 0);
21277 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
21278 op
= TREE_TYPE (op
);
21281 if (dependent_type_p (op
))
21285 *walk_subtrees
= false;
21293 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21294 || (TRAIT_EXPR_TYPE2 (*tp
)
21295 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21297 *walk_subtrees
= false;
21300 case COMPONENT_REF
:
21301 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21302 /* In a template, finish_class_member_access_expr creates a
21303 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21304 type-dependent, so that we can check access control at
21305 instantiation time (PR 42277). See also Core issue 1273. */
21310 if (instantiation_dependent_scope_ref_p (*tp
))
21315 /* Treat statement-expressions as dependent. */
21323 if (type_dependent_expression_p (*tp
))
21329 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21330 sense defined by the ABI:
21332 "An expression is instantiation-dependent if it is type-dependent
21333 or value-dependent, or it has a subexpression that is type-dependent
21334 or value-dependent." */
21337 instantiation_dependent_expression_p (tree expression
)
21341 if (!processing_template_decl
)
21344 if (expression
== error_mark_node
)
21347 result
= cp_walk_tree_without_duplicates (&expression
,
21348 instantiation_dependent_r
, NULL
);
21349 return result
!= NULL_TREE
;
21352 /* Like type_dependent_expression_p, but it also works while not processing
21353 a template definition, i.e. during substitution or mangling. */
21356 type_dependent_expression_p_push (tree expr
)
21359 ++processing_template_decl
;
21360 b
= type_dependent_expression_p (expr
);
21361 --processing_template_decl
;
21365 /* Returns TRUE if ARGS contains a type-dependent expression. */
21368 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21373 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21375 if (type_dependent_expression_p (arg
))
21381 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21382 expressions) contains any type-dependent expressions. */
21385 any_type_dependent_elements_p (const_tree list
)
21387 for (; list
; list
= TREE_CHAIN (list
))
21388 if (type_dependent_expression_p (TREE_VALUE (list
)))
21394 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21395 expressions) contains any value-dependent expressions. */
21398 any_value_dependent_elements_p (const_tree list
)
21400 for (; list
; list
= TREE_CHAIN (list
))
21401 if (value_dependent_expression_p (TREE_VALUE (list
)))
21407 /* Returns TRUE if the ARG (a template argument) is dependent. */
21410 dependent_template_arg_p (tree arg
)
21412 if (!processing_template_decl
)
21415 /* Assume a template argument that was wrongly written by the user
21416 is dependent. This is consistent with what
21417 any_dependent_template_arguments_p [that calls this function]
21419 if (!arg
|| arg
== error_mark_node
)
21422 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21423 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21425 if (TREE_CODE (arg
) == TEMPLATE_DECL
21426 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21427 return dependent_template_p (arg
);
21428 else if (ARGUMENT_PACK_P (arg
))
21430 tree args
= ARGUMENT_PACK_ARGS (arg
);
21431 int i
, len
= TREE_VEC_LENGTH (args
);
21432 for (i
= 0; i
< len
; ++i
)
21434 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21440 else if (TYPE_P (arg
))
21441 return dependent_type_p (arg
);
21443 return (type_dependent_expression_p (arg
)
21444 || value_dependent_expression_p (arg
));
21447 /* Returns true if ARGS (a collection of template arguments) contains
21448 any types that require structural equality testing. */
21451 any_template_arguments_need_structural_equality_p (tree args
)
21458 if (args
== error_mark_node
)
21461 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21463 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21464 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21466 tree arg
= TREE_VEC_ELT (level
, j
);
21467 tree packed_args
= NULL_TREE
;
21470 if (ARGUMENT_PACK_P (arg
))
21472 /* Look inside the argument pack. */
21473 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21474 len
= TREE_VEC_LENGTH (packed_args
);
21477 for (k
= 0; k
< len
; ++k
)
21480 arg
= TREE_VEC_ELT (packed_args
, k
);
21482 if (error_operand_p (arg
))
21484 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21486 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21488 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21489 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21498 /* Returns true if ARGS (a collection of template arguments) contains
21499 any dependent arguments. */
21502 any_dependent_template_arguments_p (const_tree args
)
21509 if (args
== error_mark_node
)
21512 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21514 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21515 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21516 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21523 /* Returns TRUE if the template TMPL is dependent. */
21526 dependent_template_p (tree tmpl
)
21528 if (TREE_CODE (tmpl
) == OVERLOAD
)
21532 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21534 tmpl
= OVL_NEXT (tmpl
);
21539 /* Template template parameters are dependent. */
21540 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21541 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21543 /* So are names that have not been looked up. */
21544 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21546 /* So are member templates of dependent classes. */
21547 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21548 return dependent_type_p (DECL_CONTEXT (tmpl
));
21552 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21555 dependent_template_id_p (tree tmpl
, tree args
)
21557 return (dependent_template_p (tmpl
)
21558 || any_dependent_template_arguments_p (args
));
21561 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21565 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21569 if (!processing_template_decl
)
21572 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21574 tree decl
= TREE_VEC_ELT (declv
, i
);
21575 tree init
= TREE_VEC_ELT (initv
, i
);
21576 tree cond
= TREE_VEC_ELT (condv
, i
);
21577 tree incr
= TREE_VEC_ELT (incrv
, i
);
21579 if (type_dependent_expression_p (decl
))
21582 if (init
&& type_dependent_expression_p (init
))
21585 if (type_dependent_expression_p (cond
))
21588 if (COMPARISON_CLASS_P (cond
)
21589 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21590 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21593 if (TREE_CODE (incr
) == MODOP_EXPR
)
21595 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21596 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21599 else if (type_dependent_expression_p (incr
))
21601 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21603 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21605 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
21607 tree t
= TREE_OPERAND (incr
, 1);
21608 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
21609 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
21618 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21619 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21620 no such TYPE can be found. Note that this function peers inside
21621 uninstantiated templates and therefore should be used only in
21622 extremely limited situations. ONLY_CURRENT_P restricts this
21623 peering to the currently open classes hierarchy (which is required
21624 when comparing types). */
21627 resolve_typename_type (tree type
, bool only_current_p
)
21636 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
21638 scope
= TYPE_CONTEXT (type
);
21639 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21640 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21641 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21642 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21643 identifier of the TYPENAME_TYPE anymore.
21644 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21645 TYPENAME_TYPE instead, we avoid messing up with a possible
21646 typedef variant case. */
21647 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
21649 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21650 it first before we can figure out what NAME refers to. */
21651 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21653 if (TYPENAME_IS_RESOLVING_P (scope
))
21654 /* Given a class template A with a dependent base with nested type C,
21655 typedef typename A::C::C C will land us here, as trying to resolve
21656 the initial A::C leads to the local C typedef, which leads back to
21657 A::C::C. So we break the recursion now. */
21660 scope
= resolve_typename_type (scope
, only_current_p
);
21662 /* If we don't know what SCOPE refers to, then we cannot resolve the
21664 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21666 /* If the SCOPE is a template type parameter, we have no way of
21667 resolving the name. */
21668 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
21670 /* If the SCOPE is not the current instantiation, there's no reason
21671 to look inside it. */
21672 if (only_current_p
&& !currently_open_class (scope
))
21674 /* If this is a typedef, we don't want to look inside (c++/11987). */
21675 if (typedef_variant_p (type
))
21677 /* If SCOPE isn't the template itself, it will not have a valid
21678 TYPE_FIELDS list. */
21679 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
21680 /* scope is either the template itself or a compatible instantiation
21681 like X<T>, so look up the name in the original template. */
21682 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
21684 /* scope is a partial instantiation, so we can't do the lookup or we
21685 will lose the template arguments. */
21687 /* Enter the SCOPE so that name lookup will be resolved as if we
21688 were in the class definition. In particular, SCOPE will no
21689 longer be considered a dependent type. */
21690 pushed_scope
= push_scope (scope
);
21691 /* Look up the declaration. */
21692 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
21693 tf_warning_or_error
);
21695 result
= NULL_TREE
;
21697 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21698 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21701 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
21702 && TREE_CODE (decl
) == TYPE_DECL
)
21704 result
= TREE_TYPE (decl
);
21705 if (result
== error_mark_node
)
21706 result
= NULL_TREE
;
21708 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
21709 && DECL_CLASS_TEMPLATE_P (decl
))
21713 /* Obtain the template and the arguments. */
21714 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
21715 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
21716 /* Instantiate the template. */
21717 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
21718 /*entering_scope=*/0,
21719 tf_error
| tf_user
);
21720 if (result
== error_mark_node
)
21721 result
= NULL_TREE
;
21724 /* Leave the SCOPE. */
21726 pop_scope (pushed_scope
);
21728 /* If we failed to resolve it, return the original typename. */
21732 /* If lookup found a typename type, resolve that too. */
21733 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
21735 /* Ill-formed programs can cause infinite recursion here, so we
21736 must catch that. */
21737 TYPENAME_IS_RESOLVING_P (type
) = 1;
21738 result
= resolve_typename_type (result
, only_current_p
);
21739 TYPENAME_IS_RESOLVING_P (type
) = 0;
21742 /* Qualify the resulting type. */
21743 quals
= cp_type_quals (type
);
21745 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
21750 /* EXPR is an expression which is not type-dependent. Return a proxy
21751 for EXPR that can be used to compute the types of larger
21752 expressions containing EXPR. */
21755 build_non_dependent_expr (tree expr
)
21759 #ifdef ENABLE_CHECKING
21760 /* Try to get a constant value for all non-dependent expressions in
21761 order to expose bugs in *_dependent_expression_p and constexpr. */
21762 if (cxx_dialect
>= cxx11
)
21763 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
21766 /* Preserve OVERLOADs; the functions must be available to resolve
21769 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
21770 inner_expr
= stmt_expr_value_expr (inner_expr
);
21771 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
21772 inner_expr
= TREE_OPERAND (inner_expr
, 0);
21773 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
21774 inner_expr
= TREE_OPERAND (inner_expr
, 1);
21775 if (is_overloaded_fn (inner_expr
)
21776 || TREE_CODE (inner_expr
) == OFFSET_REF
)
21778 /* There is no need to return a proxy for a variable. */
21781 /* Preserve string constants; conversions from string constants to
21782 "char *" are allowed, even though normally a "const char *"
21783 cannot be used to initialize a "char *". */
21784 if (TREE_CODE (expr
) == STRING_CST
)
21786 /* Preserve void and arithmetic constants, as an optimization -- there is no
21787 reason to create a new node. */
21788 if (TREE_CODE (expr
) == VOID_CST
21789 || TREE_CODE (expr
) == INTEGER_CST
21790 || TREE_CODE (expr
) == REAL_CST
)
21792 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
21793 There is at least one place where we want to know that a
21794 particular expression is a throw-expression: when checking a ?:
21795 expression, there are special rules if the second or third
21796 argument is a throw-expression. */
21797 if (TREE_CODE (expr
) == THROW_EXPR
)
21800 /* Don't wrap an initializer list, we need to be able to look inside. */
21801 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
21804 /* Don't wrap a dummy object, we need to be able to test for it. */
21805 if (is_dummy_object (expr
))
21808 if (TREE_CODE (expr
) == COND_EXPR
)
21809 return build3 (COND_EXPR
,
21811 TREE_OPERAND (expr
, 0),
21812 (TREE_OPERAND (expr
, 1)
21813 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
21814 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
21815 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
21816 if (TREE_CODE (expr
) == COMPOUND_EXPR
21817 && !COMPOUND_EXPR_OVERLOADED (expr
))
21818 return build2 (COMPOUND_EXPR
,
21820 TREE_OPERAND (expr
, 0),
21821 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
21823 /* If the type is unknown, it can't really be non-dependent */
21824 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
21826 /* Otherwise, build a NON_DEPENDENT_EXPR. */
21827 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
21830 /* ARGS is a vector of expressions as arguments to a function call.
21831 Replace the arguments with equivalent non-dependent expressions.
21832 This modifies ARGS in place. */
21835 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
21840 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
21842 tree newarg
= build_non_dependent_expr (arg
);
21844 (*args
)[ix
] = newarg
;
21848 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
21849 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
21853 make_auto_1 (tree name
)
21855 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
21856 TYPE_NAME (au
) = build_decl (input_location
,
21857 TYPE_DECL
, name
, au
);
21858 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
21859 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
21860 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
21861 TYPE_NAME (au
), NULL_TREE
);
21862 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
21863 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
21864 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
21870 make_decltype_auto (void)
21872 return make_auto_1 (get_identifier ("decltype(auto)"));
21878 return make_auto_1 (get_identifier ("auto"));
21881 /* Given type ARG, return std::initializer_list<ARG>. */
21886 tree std_init_list
= namespace_binding
21887 (get_identifier ("initializer_list"), std_node
);
21889 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
21891 error ("deducing from brace-enclosed initializer list requires "
21892 "#include <initializer_list>");
21893 return error_mark_node
;
21895 argvec
= make_tree_vec (1);
21896 TREE_VEC_ELT (argvec
, 0) = arg
;
21897 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
21898 NULL_TREE
, 0, tf_warning_or_error
);
21901 /* Replace auto in TYPE with std::initializer_list<auto>. */
21904 listify_autos (tree type
, tree auto_node
)
21906 tree init_auto
= listify (auto_node
);
21907 tree argvec
= make_tree_vec (1);
21908 TREE_VEC_ELT (argvec
, 0) = init_auto
;
21909 if (processing_template_decl
)
21910 argvec
= add_to_template_args (current_template_args (), argvec
);
21911 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21914 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
21915 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
21918 do_auto_deduction (tree type
, tree init
, tree auto_node
)
21922 if (init
== error_mark_node
)
21923 return error_mark_node
;
21925 if (type_dependent_expression_p (init
))
21926 /* Defining a subset of type-dependent expressions that we can deduce
21927 from ahead of time isn't worth the trouble. */
21930 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
21931 with either a new invented type template parameter U or, if the
21932 initializer is a braced-init-list (8.5.4), with
21933 std::initializer_list<U>. */
21934 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
21935 type
= listify_autos (type
, auto_node
);
21937 init
= resolve_nondeduced_context (init
);
21939 targs
= make_tree_vec (1);
21940 if (AUTO_IS_DECLTYPE (auto_node
))
21942 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
21943 && !REF_PARENTHESIZED_P (init
)));
21944 TREE_VEC_ELT (targs
, 0)
21945 = finish_decltype_type (init
, id
, tf_warning_or_error
);
21946 if (type
!= auto_node
)
21948 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
21949 return error_mark_node
;
21954 tree parms
= build_tree_list (NULL_TREE
, type
);
21955 tree tparms
= make_tree_vec (1);
21958 TREE_VEC_ELT (tparms
, 0)
21959 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
21960 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
21961 DEDUCE_CALL
, LOOKUP_NORMAL
,
21962 NULL
, /*explain_p=*/false);
21965 if (processing_template_decl
)
21966 /* Try again at instantiation time. */
21968 if (type
&& type
!= error_mark_node
)
21969 /* If type is error_mark_node a diagnostic must have been
21970 emitted by now. Also, having a mention to '<type error>'
21971 in the diagnostic is not really useful to the user. */
21973 if (cfun
&& auto_node
== current_function_auto_return_pattern
21974 && LAMBDA_FUNCTION_P (current_function_decl
))
21975 error ("unable to deduce lambda return type from %qE", init
);
21977 error ("unable to deduce %qT from %qE", type
, init
);
21979 return error_mark_node
;
21983 /* If the list of declarators contains more than one declarator, the type
21984 of each declared variable is determined as described above. If the
21985 type deduced for the template parameter U is not the same in each
21986 deduction, the program is ill-formed. */
21987 if (TREE_TYPE (auto_node
)
21988 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
21990 if (cfun
&& auto_node
== current_function_auto_return_pattern
21991 && LAMBDA_FUNCTION_P (current_function_decl
))
21992 error ("inconsistent types %qT and %qT deduced for "
21993 "lambda return type", TREE_TYPE (auto_node
),
21994 TREE_VEC_ELT (targs
, 0));
21996 error ("inconsistent deduction for %qT: %qT and then %qT",
21997 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
21998 return error_mark_node
;
22000 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
22002 if (processing_template_decl
)
22003 targs
= add_to_template_args (current_template_args (), targs
);
22004 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
22007 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
22011 splice_late_return_type (tree type
, tree late_return_type
)
22015 if (late_return_type
== NULL_TREE
)
22017 argvec
= make_tree_vec (1);
22018 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
22019 if (processing_template_parmlist
)
22020 /* For a late-specified return type in a template type-parameter, we
22021 need to add a dummy argument level for its parmlist. */
22022 argvec
= add_to_template_args
22023 (make_tree_vec (processing_template_parmlist
), argvec
);
22024 if (current_template_parms
)
22025 argvec
= add_to_template_args (current_template_args (), argvec
);
22026 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22029 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
22030 'decltype(auto)'. */
22033 is_auto (const_tree type
)
22035 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22036 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
22037 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
22043 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
22044 a use of `auto'. Returns NULL_TREE otherwise. */
22047 type_uses_auto (tree type
)
22049 return find_type_usage (type
, is_auto
);
22052 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
22053 'decltype(auto)' or a concept. */
22056 is_auto_or_concept (const_tree type
)
22058 return is_auto (type
); // or concept
22061 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
22062 a concept identifier) iff TYPE contains a use of a generic type. Returns
22063 NULL_TREE otherwise. */
22066 type_uses_auto_or_concept (tree type
)
22068 return find_type_usage (type
, is_auto_or_concept
);
22072 /* For a given template T, return the vector of typedefs referenced
22073 in T for which access check is needed at T instantiation time.
22074 T is either a FUNCTION_DECL or a RECORD_TYPE.
22075 Those typedefs were added to T by the function
22076 append_type_to_template_for_access_check. */
22078 vec
<qualified_typedef_usage_t
, va_gc
> *
22079 get_types_needing_access_check (tree t
)
22082 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
22084 if (!t
|| t
== error_mark_node
)
22087 if (!(ti
= get_template_info (t
)))
22090 if (CLASS_TYPE_P (t
)
22091 || TREE_CODE (t
) == FUNCTION_DECL
)
22093 if (!TI_TEMPLATE (ti
))
22096 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
22102 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
22103 tied to T. That list of typedefs will be access checked at
22104 T instantiation time.
22105 T is either a FUNCTION_DECL or a RECORD_TYPE.
22106 TYPE_DECL is a TYPE_DECL node representing a typedef.
22107 SCOPE is the scope through which TYPE_DECL is accessed.
22108 LOCATION is the location of the usage point of TYPE_DECL.
22110 This function is a subroutine of
22111 append_type_to_template_for_access_check. */
22114 append_type_to_template_for_access_check_1 (tree t
,
22117 location_t location
)
22119 qualified_typedef_usage_t typedef_usage
;
22122 if (!t
|| t
== error_mark_node
)
22125 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
22126 || CLASS_TYPE_P (t
))
22128 && TREE_CODE (type_decl
) == TYPE_DECL
22131 if (!(ti
= get_template_info (t
)))
22134 gcc_assert (TI_TEMPLATE (ti
));
22136 typedef_usage
.typedef_decl
= type_decl
;
22137 typedef_usage
.context
= scope
;
22138 typedef_usage
.locus
= location
;
22140 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
22143 /* Append TYPE_DECL to the template TEMPL.
22144 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
22145 At TEMPL instanciation time, TYPE_DECL will be checked to see
22146 if it can be accessed through SCOPE.
22147 LOCATION is the location of the usage point of TYPE_DECL.
22149 e.g. consider the following code snippet:
22156 template<class U> struct S
22158 C::myint mi; // <-- usage point of the typedef C::myint
22163 At S<char> instantiation time, we need to check the access of C::myint
22164 In other words, we need to check the access of the myint typedef through
22165 the C scope. For that purpose, this function will add the myint typedef
22166 and the scope C through which its being accessed to a list of typedefs
22167 tied to the template S. That list will be walked at template instantiation
22168 time and access check performed on each typedefs it contains.
22169 Note that this particular code snippet should yield an error because
22170 myint is private to C. */
22173 append_type_to_template_for_access_check (tree templ
,
22176 location_t location
)
22178 qualified_typedef_usage_t
*iter
;
22181 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
22183 /* Make sure we don't append the type to the template twice. */
22184 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
22185 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
22188 append_type_to_template_for_access_check_1 (templ
, type_decl
,
22192 /* Convert the generic type parameters in PARM that match the types given in the
22193 range [START_IDX, END_IDX) from the current_template_parms into generic type
22197 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
22199 tree current
= current_template_parms
;
22200 int depth
= TMPL_PARMS_DEPTH (current
);
22201 current
= INNERMOST_TEMPLATE_PARMS (current
);
22202 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
22204 for (int i
= 0; i
< start_idx
; ++i
)
22205 TREE_VEC_ELT (replacement
, i
)
22206 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22208 for (int i
= start_idx
; i
< end_idx
; ++i
)
22210 /* Create a distinct parameter pack type from the current parm and add it
22211 to the replacement args to tsubst below into the generic function
22214 tree o
= TREE_TYPE (TREE_VALUE
22215 (TREE_VEC_ELT (current
, i
)));
22216 tree t
= copy_type (o
);
22217 TEMPLATE_TYPE_PARM_INDEX (t
)
22218 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
22220 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
22221 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
22222 TYPE_MAIN_VARIANT (t
) = t
;
22223 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
22224 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
22225 TREE_VEC_ELT (replacement
, i
) = t
;
22226 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
22229 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
22230 TREE_VEC_ELT (replacement
, i
)
22231 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22233 /* If there are more levels then build up the replacement with the outer
22236 replacement
= add_to_template_args (template_parms_to_args
22237 (TREE_CHAIN (current_template_parms
)),
22240 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
22244 /* Set up the hash tables for template instantiations. */
22247 init_template_processing (void)
22249 decl_specializations
= htab_create_ggc (37,
22250 hash_specialization
,
22251 eq_specializations
,
22253 type_specializations
= htab_create_ggc (37,
22254 hash_specialization
,
22255 eq_specializations
,
22259 /* Print stats about the template hash tables for -fstats. */
22262 print_template_statistics (void)
22264 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
22265 "%f collisions\n", (long) htab_size (decl_specializations
),
22266 (long) htab_elements (decl_specializations
),
22267 htab_collisions (decl_specializations
));
22268 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
22269 "%f collisions\n", (long) htab_size (type_specializations
),
22270 (long) htab_elements (type_specializations
),
22271 htab_collisions (type_specializations
));
22274 #include "gt-cp-pt.h"