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 (DECL_DESTRUCTOR_P (decl
))
4744 A destructor shall not be a member template. */
4745 error ("destructor %qD declared as member template", decl
);
4746 return error_mark_node
;
4748 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4749 && (!prototype_p (TREE_TYPE (decl
))
4750 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4751 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4752 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4753 == void_list_node
)))
4755 /* [basic.stc.dynamic.allocation]
4757 An allocation function can be a function
4758 template. ... Template allocation functions shall
4759 have two or more parameters. */
4760 error ("invalid template declaration of %qD", decl
);
4761 return error_mark_node
;
4764 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4765 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4767 else if (TREE_CODE (decl
) == TYPE_DECL
4768 && TYPE_DECL_ALIAS_P (decl
))
4769 /* alias-declaration */
4770 gcc_assert (!DECL_ARTIFICIAL (decl
));
4771 else if (VAR_P (decl
))
4773 if (!DECL_DECLARED_CONSTEXPR_P (decl
))
4775 sorry ("template declaration of non-constexpr variable %qD",
4777 return error_mark_node
;
4782 error ("template declaration of %q#D", decl
);
4783 return error_mark_node
;
4787 /* Check to see that the rules regarding the use of default
4788 arguments are not being violated. */
4789 check_default_tmpl_args (decl
, current_template_parms
,
4790 is_primary
, is_partial
, /*is_friend_decl=*/0);
4792 /* Ensure that there are no parameter packs in the type of this
4793 declaration that have not been expanded. */
4794 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4796 /* Check each of the arguments individually to see if there are
4797 any bare parameter packs. */
4798 tree type
= TREE_TYPE (decl
);
4799 tree arg
= DECL_ARGUMENTS (decl
);
4800 tree argtype
= TYPE_ARG_TYPES (type
);
4802 while (arg
&& argtype
)
4804 if (!DECL_PACK_P (arg
)
4805 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4807 /* This is a PARM_DECL that contains unexpanded parameter
4808 packs. We have already complained about this in the
4809 check_for_bare_parameter_packs call, so just replace
4810 these types with ERROR_MARK_NODE. */
4811 TREE_TYPE (arg
) = error_mark_node
;
4812 TREE_VALUE (argtype
) = error_mark_node
;
4815 arg
= DECL_CHAIN (arg
);
4816 argtype
= TREE_CHAIN (argtype
);
4819 /* Check for bare parameter packs in the return type and the
4820 exception specifiers. */
4821 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4822 /* Errors were already issued, set return type to int
4823 as the frontend doesn't expect error_mark_node as
4825 TREE_TYPE (type
) = integer_type_node
;
4826 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4827 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4829 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4830 && TYPE_DECL_ALIAS_P (decl
))
4831 ? DECL_ORIGINAL_TYPE (decl
)
4832 : TREE_TYPE (decl
)))
4834 TREE_TYPE (decl
) = error_mark_node
;
4835 return error_mark_node
;
4839 return process_partial_specialization (decl
);
4841 args
= current_template_args ();
4844 || TREE_CODE (ctx
) == FUNCTION_DECL
4845 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4846 || (TREE_CODE (decl
) == TYPE_DECL
4847 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4848 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4850 if (DECL_LANG_SPECIFIC (decl
)
4851 && DECL_TEMPLATE_INFO (decl
)
4852 && DECL_TI_TEMPLATE (decl
))
4853 tmpl
= DECL_TI_TEMPLATE (decl
);
4854 /* If DECL is a TYPE_DECL for a class-template, then there won't
4855 be DECL_LANG_SPECIFIC. The information equivalent to
4856 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4857 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4858 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4859 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4861 /* Since a template declaration already existed for this
4862 class-type, we must be redeclaring it here. Make sure
4863 that the redeclaration is valid. */
4864 redeclare_class_template (TREE_TYPE (decl
),
4865 current_template_parms
);
4866 /* We don't need to create a new TEMPLATE_DECL; just use the
4867 one we already had. */
4868 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4872 tmpl
= build_template_decl (decl
, current_template_parms
,
4876 if (DECL_LANG_SPECIFIC (decl
)
4877 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4879 /* A specialization of a member template of a template
4881 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4882 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4883 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4889 tree a
, t
, current
, parms
;
4891 tree tinfo
= get_template_info (decl
);
4895 error ("template definition of non-template %q#D", decl
);
4896 return error_mark_node
;
4899 tmpl
= TI_TEMPLATE (tinfo
);
4901 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4902 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4903 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4904 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4908 /* The declaration is a specialization of a member
4909 template, declared outside the class. Therefore, the
4910 innermost template arguments will be NULL, so we
4911 replace them with the arguments determined by the
4912 earlier call to check_explicit_specialization. */
4913 args
= DECL_TI_ARGS (decl
);
4916 = build_template_decl (decl
, current_template_parms
,
4918 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4919 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4920 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4921 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4922 DECL_TEMPLATE_INFO (new_tmpl
)
4923 = build_template_info (tmpl
, args
);
4925 register_specialization (new_tmpl
,
4926 most_general_template (tmpl
),
4932 /* Make sure the template headers we got make sense. */
4934 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4935 i
= TMPL_PARMS_DEPTH (parms
);
4936 if (TMPL_ARGS_DEPTH (args
) != i
)
4938 error ("expected %d levels of template parms for %q#D, got %d",
4939 i
, decl
, TMPL_ARGS_DEPTH (args
));
4940 DECL_INTERFACE_KNOWN (decl
) = 1;
4941 return error_mark_node
;
4944 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4946 a
= TMPL_ARGS_LEVEL (args
, i
);
4947 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4949 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4951 if (current
== decl
)
4952 error ("got %d template parameters for %q#D",
4953 TREE_VEC_LENGTH (a
), decl
);
4955 error ("got %d template parameters for %q#T",
4956 TREE_VEC_LENGTH (a
), current
);
4957 error (" but %d required", TREE_VEC_LENGTH (t
));
4958 /* Avoid crash in import_export_decl. */
4959 DECL_INTERFACE_KNOWN (decl
) = 1;
4960 return error_mark_node
;
4963 if (current
== decl
)
4965 else if (current
== NULL_TREE
)
4966 /* Can happen in erroneous input. */
4969 current
= get_containing_scope (current
);
4972 /* Check that the parms are used in the appropriate qualifying scopes
4973 in the declarator. */
4974 if (!comp_template_args
4976 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4979 template arguments to %qD do not match original template %qD",
4980 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4981 if (!uses_template_parms (TI_ARGS (tinfo
)))
4982 inform (input_location
, "use template<> for an explicit specialization");
4983 /* Avoid crash in import_export_decl. */
4984 DECL_INTERFACE_KNOWN (decl
) = 1;
4985 return error_mark_node
;
4989 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4990 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4992 /* Push template declarations for global functions and types. Note
4993 that we do not try to push a global template friend declared in a
4994 template class; such a thing may well depend on the template
4995 parameters of the class. */
4996 if (new_template_p
&& !ctx
4997 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
4999 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5000 if (tmpl
== error_mark_node
)
5001 return error_mark_node
;
5003 /* Hide template friend classes that haven't been declared yet. */
5004 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5006 DECL_ANTICIPATED (tmpl
) = 1;
5007 DECL_FRIEND_P (tmpl
) = 1;
5013 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5016 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5017 if (DECL_CONV_FN_P (tmpl
))
5019 int depth
= TMPL_PARMS_DEPTH (parms
);
5021 /* It is a conversion operator. See if the type converted to
5022 depends on innermost template operands. */
5024 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5026 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5029 /* Give template template parms a DECL_CONTEXT of the template
5030 for which they are a parameter. */
5031 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5032 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5034 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5035 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5036 DECL_CONTEXT (parm
) = tmpl
;
5040 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5041 back to its most general template. If TMPL is a specialization,
5042 ARGS may only have the innermost set of arguments. Add the missing
5043 argument levels if necessary. */
5044 if (DECL_TEMPLATE_INFO (tmpl
))
5045 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5047 info
= build_template_info (tmpl
, args
);
5049 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5050 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5053 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5054 retrofit_lang_decl (decl
);
5055 if (DECL_LANG_SPECIFIC (decl
))
5056 DECL_TEMPLATE_INFO (decl
) = info
;
5059 if (flag_implicit_templates
5061 && VAR_OR_FUNCTION_DECL_P (decl
))
5062 /* Set DECL_COMDAT on template instantiations; if we force
5063 them to be emitted by explicit instantiation or -frepo,
5064 mark_needed will tell cgraph to do the right thing. */
5065 DECL_COMDAT (decl
) = true;
5067 return DECL_TEMPLATE_RESULT (tmpl
);
5071 push_template_decl (tree decl
)
5073 return push_template_decl_real (decl
, false);
5076 /* FN is an inheriting constructor that inherits from the constructor
5077 template INHERITED; turn FN into a constructor template with a matching
5081 add_inherited_template_parms (tree fn
, tree inherited
)
5084 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5085 inner_parms
= copy_node (inner_parms
);
5087 = tree_cons (size_int (processing_template_decl
+ 1),
5088 inner_parms
, current_template_parms
);
5089 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5090 tree args
= template_parms_to_args (parms
);
5091 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5092 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5093 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5094 DECL_ARTIFICIAL (tmpl
) = true;
5095 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5099 /* Called when a class template TYPE is redeclared with the indicated
5100 template PARMS, e.g.:
5102 template <class T> struct S;
5103 template <class T> struct S {}; */
5106 redeclare_class_template (tree type
, tree parms
)
5112 if (!TYPE_TEMPLATE_INFO (type
))
5114 error ("%qT is not a template type", type
);
5118 tmpl
= TYPE_TI_TEMPLATE (type
);
5119 if (!PRIMARY_TEMPLATE_P (tmpl
))
5120 /* The type is nested in some template class. Nothing to worry
5121 about here; there are no new template parameters for the nested
5127 error ("template specifiers not specified in declaration of %qD",
5132 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5133 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5135 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5137 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5138 "redeclared with %d template parameter",
5139 "redeclared with %d template parameters",
5140 TREE_VEC_LENGTH (parms
));
5141 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5142 "previous declaration %q+D used %d template parameter",
5143 "previous declaration %q+D used %d template parameters",
5144 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5148 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5155 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5156 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5159 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5160 if (error_operand_p (tmpl_parm
))
5163 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5164 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5165 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5167 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5169 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5170 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5171 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5172 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5173 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5174 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5175 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5176 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5177 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5179 error ("template parameter %q+#D", tmpl_parm
);
5180 error ("redeclared here as %q#D", parm
);
5184 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5186 /* We have in [temp.param]:
5188 A template-parameter may not be given default arguments
5189 by two different declarations in the same scope. */
5190 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5191 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5192 "original definition appeared here");
5196 if (parm_default
!= NULL_TREE
)
5197 /* Update the previous template parameters (which are the ones
5198 that will really count) with the new default value. */
5199 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5200 else if (tmpl_default
!= NULL_TREE
)
5201 /* Update the new parameters, too; they'll be used as the
5202 parameters for any members. */
5203 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5209 /* Simplify EXPR if it is a non-dependent expression. Returns the
5210 (possibly simplified) expression. */
5213 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5215 if (expr
== NULL_TREE
)
5218 /* If we're in a template, but EXPR isn't value dependent, simplify
5219 it. We're supposed to treat:
5221 template <typename T> void f(T[1 + 1]);
5222 template <typename T> void f(T[2]);
5224 as two declarations of the same function, for example. */
5225 if (processing_template_decl
5226 && !instantiation_dependent_expression_p (expr
)
5227 && potential_constant_expression (expr
))
5229 HOST_WIDE_INT saved_processing_template_decl
;
5231 saved_processing_template_decl
= processing_template_decl
;
5232 processing_template_decl
= 0;
5233 expr
= tsubst_copy_and_build (expr
,
5236 /*in_decl=*/NULL_TREE
,
5237 /*function_p=*/false,
5238 /*integral_constant_expression_p=*/true);
5239 processing_template_decl
= saved_processing_template_decl
;
5245 fold_non_dependent_expr (tree expr
)
5247 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5250 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5251 template declaration, or a TYPE_DECL for an alias declaration. */
5254 alias_type_or_template_p (tree t
)
5258 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5261 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5262 || DECL_ALIAS_TEMPLATE_P (t
));
5265 /* Return TRUE iff is a specialization of an alias template. */
5268 alias_template_specialization_p (const_tree t
)
5274 && TYPE_TEMPLATE_INFO (t
)
5275 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5276 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5279 /* Return the number of innermost template parameters in TMPL. */
5282 num_innermost_template_parms (tree tmpl
)
5284 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5285 return TREE_VEC_LENGTH (parms
);
5288 /* Return either TMPL or another template that it is equivalent to under DR
5289 1286: An alias that just changes the name of a template is equivalent to
5290 the other template. */
5293 get_underlying_template (tree tmpl
)
5295 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5296 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5298 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5299 if (TYPE_TEMPLATE_INFO (result
))
5301 tree sub
= TYPE_TI_TEMPLATE (result
);
5302 if (PRIMARY_TEMPLATE_P (sub
)
5303 && (num_innermost_template_parms (tmpl
)
5304 == num_innermost_template_parms (sub
)))
5306 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5307 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5308 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5310 /* The alias type is equivalent to the pattern of the
5311 underlying template, so strip the alias. */
5321 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5322 must be a function or a pointer-to-function type, as specified
5323 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5324 and check that the resulting function has external linkage. */
5327 convert_nontype_argument_function (tree type
, tree expr
,
5328 tsubst_flags_t complain
)
5332 linkage_kind linkage
;
5334 fn
= instantiate_type (type
, fns
, tf_none
);
5335 if (fn
== error_mark_node
)
5336 return error_mark_node
;
5339 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5340 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5341 if (BASELINK_P (fn_no_ptr
))
5342 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5344 /* [temp.arg.nontype]/1
5346 A template-argument for a non-type, non-template template-parameter
5349 -- the address of an object or function with external [C++11: or
5350 internal] linkage. */
5352 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5354 if (complain
& tf_error
)
5356 error ("%qE is not a valid template argument for type %qT",
5358 if (TYPE_PTR_P (type
))
5359 error ("it must be the address of a function with "
5360 "external linkage");
5362 error ("it must be the name of a function with "
5363 "external linkage");
5368 linkage
= decl_linkage (fn_no_ptr
);
5369 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5371 if (complain
& tf_error
)
5373 if (cxx_dialect
>= cxx11
)
5374 error ("%qE is not a valid template argument for type %qT "
5375 "because %qD has no linkage",
5376 expr
, type
, fn_no_ptr
);
5378 error ("%qE is not a valid template argument for type %qT "
5379 "because %qD does not have external linkage",
5380 expr
, type
, fn_no_ptr
);
5388 /* Subroutine of convert_nontype_argument.
5389 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5390 Emit an error otherwise. */
5393 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5394 tsubst_flags_t complain
)
5397 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5399 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5401 if (processing_template_decl
5402 && TREE_CODE (expr
) == ADDR_EXPR
5403 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5405 if (complain
& tf_error
)
5407 error ("%qE is not a valid template argument for type %qT",
5409 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5414 /* Returns TRUE iff the address of OP is value-dependent.
5416 14.6.2.4 [temp.dep.temp]:
5417 A non-integral non-type template-argument is dependent if its type is
5418 dependent or it has either of the following forms
5421 and contains a nested-name-specifier which specifies a class-name that
5422 names a dependent type.
5424 We generalize this to just say that the address of a member of a
5425 dependent class is value-dependent; the above doesn't cover the
5426 address of a static data member named with an unqualified-id. */
5429 has_value_dependent_address (tree op
)
5431 /* We could use get_inner_reference here, but there's no need;
5432 this is only relevant for template non-type arguments, which
5433 can only be expressed as &id-expression. */
5436 tree ctx
= CP_DECL_CONTEXT (op
);
5437 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5444 /* The next set of functions are used for providing helpful explanatory
5445 diagnostics for failed overload resolution. Their messages should be
5446 indented by two spaces for consistency with the messages in
5450 unify_success (bool /*explain_p*/)
5456 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5459 inform (input_location
,
5460 " couldn't deduce template parameter %qD", parm
);
5465 unify_invalid (bool /*explain_p*/)
5471 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5474 inform (input_location
,
5475 " types %qT and %qT have incompatible cv-qualifiers",
5481 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5484 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5489 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5492 inform (input_location
,
5493 " template parameter %qD is not a parameter pack, but "
5500 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5503 inform (input_location
,
5504 " template argument %qE does not match "
5505 "pointer-to-member constant %qE",
5511 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5514 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5519 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5522 inform (input_location
,
5523 " inconsistent parameter pack deduction with %qT and %qT",
5529 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5534 inform (input_location
,
5535 " deduced conflicting types for parameter %qT (%qT and %qT)",
5536 parm
, first
, second
);
5538 inform (input_location
,
5539 " deduced conflicting values for non-type parameter "
5540 "%qE (%qE and %qE)", parm
, first
, second
);
5546 unify_vla_arg (bool explain_p
, tree arg
)
5549 inform (input_location
,
5550 " variable-sized array type %qT is not "
5551 "a valid template argument",
5557 unify_method_type_error (bool explain_p
, tree arg
)
5560 inform (input_location
,
5561 " member function type %qT is not a valid template argument",
5567 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
5572 inform_n (input_location
, wanted
,
5573 " candidate expects at least %d argument, %d provided",
5574 " candidate expects at least %d arguments, %d provided",
5577 inform_n (input_location
, wanted
,
5578 " candidate expects %d argument, %d provided",
5579 " candidate expects %d arguments, %d provided",
5586 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5588 return unify_arity (explain_p
, have
, wanted
);
5592 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
5593 bool least_p
= false)
5595 return unify_arity (explain_p
, have
, wanted
, least_p
);
5599 unify_arg_conversion (bool explain_p
, tree to_type
,
5600 tree from_type
, tree arg
)
5603 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5604 " cannot convert %qE (type %qT) to type %qT",
5605 arg
, from_type
, to_type
);
5610 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5611 tree parm
, tree arg
)
5616 case tbr_ambiguous_baseclass
:
5617 inform (input_location
, " %qT is an ambiguous base class of %qT",
5621 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5628 unify_inconsistent_template_template_parameters (bool explain_p
)
5631 inform (input_location
,
5632 " template parameters of a template template argument are "
5633 "inconsistent with other deduced template arguments");
5638 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5641 inform (input_location
,
5642 " can't deduce a template for %qT from non-template type %qT",
5648 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5651 inform (input_location
,
5652 " template argument %qE does not match %qD", arg
, parm
);
5657 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5660 inform (input_location
,
5661 " could not resolve address from overloaded function %qE",
5666 /* Attempt to convert the non-type template parameter EXPR to the
5667 indicated TYPE. If the conversion is successful, return the
5668 converted value. If the conversion is unsuccessful, return
5669 NULL_TREE if we issued an error message, or error_mark_node if we
5670 did not. We issue error messages for out-and-out bad template
5671 parameters, but not simply because the conversion failed, since we
5672 might be just trying to do argument deduction. Both TYPE and EXPR
5673 must be non-dependent.
5675 The conversion follows the special rules described in
5676 [temp.arg.nontype], and it is much more strict than an implicit
5679 This function is called twice for each template argument (see
5680 lookup_template_class for a more accurate description of this
5681 problem). This means that we need to handle expressions which
5682 are not valid in a C++ source, but can be created from the
5683 first call (for instance, casts to perform conversions). These
5684 hacks can go away after we fix the double coercion problem. */
5687 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5691 /* Detect immediately string literals as invalid non-type argument.
5692 This special-case is not needed for correctness (we would easily
5693 catch this later), but only to provide better diagnostic for this
5694 common user mistake. As suggested by DR 100, we do not mention
5695 linkage issues in the diagnostic as this is not the point. */
5696 /* FIXME we're making this OK. */
5697 if (TREE_CODE (expr
) == STRING_CST
)
5699 if (complain
& tf_error
)
5700 error ("%qE is not a valid template argument for type %qT "
5701 "because string literals can never be used in this context",
5706 /* Add the ADDR_EXPR now for the benefit of
5707 value_dependent_expression_p. */
5708 if (TYPE_PTROBV_P (type
)
5709 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5711 expr
= decay_conversion (expr
, complain
);
5712 if (expr
== error_mark_node
)
5713 return error_mark_node
;
5716 /* If we are in a template, EXPR may be non-dependent, but still
5717 have a syntactic, rather than semantic, form. For example, EXPR
5718 might be a SCOPE_REF, rather than the VAR_DECL to which the
5719 SCOPE_REF refers. Preserving the qualifying scope is necessary
5720 so that access checking can be performed when the template is
5721 instantiated -- but here we need the resolved form so that we can
5722 convert the argument. */
5723 if (TYPE_REF_OBJ_P (type
)
5724 && has_value_dependent_address (expr
))
5725 /* If we want the address and it's value-dependent, don't fold. */;
5726 else if (!type_unknown_p (expr
))
5727 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5728 if (error_operand_p (expr
))
5729 return error_mark_node
;
5730 expr_type
= TREE_TYPE (expr
);
5731 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5732 expr
= mark_lvalue_use (expr
);
5734 expr
= mark_rvalue_use (expr
);
5736 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5737 to a non-type argument of "nullptr". */
5738 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5739 expr
= convert (type
, expr
);
5741 /* In C++11, integral or enumeration non-type template arguments can be
5742 arbitrary constant expressions. Pointer and pointer to
5743 member arguments can be general constant expressions that evaluate
5744 to a null value, but otherwise still need to be of a specific form. */
5745 if (cxx_dialect
>= cxx11
)
5747 if (TREE_CODE (expr
) == PTRMEM_CST
)
5748 /* A PTRMEM_CST is already constant, and a valid template
5749 argument for a parameter of pointer to member type, we just want
5750 to leave it in that form rather than lower it to a
5752 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5753 expr
= maybe_constant_value (expr
);
5754 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5756 tree folded
= maybe_constant_value (expr
);
5757 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5758 : null_member_pointer_value_p (folded
))
5763 /* HACK: Due to double coercion, we can get a
5764 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5765 which is the tree that we built on the first call (see
5766 below when coercing to reference to object or to reference to
5767 function). We just strip everything and get to the arg.
5768 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5770 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5772 tree probe_type
, probe
= expr
;
5773 if (REFERENCE_REF_P (probe
))
5774 probe
= TREE_OPERAND (probe
, 0);
5775 probe_type
= TREE_TYPE (probe
);
5776 if (TREE_CODE (probe
) == NOP_EXPR
)
5778 /* ??? Maybe we could use convert_from_reference here, but we
5779 would need to relax its constraints because the NOP_EXPR
5780 could actually change the type to something more cv-qualified,
5781 and this is not folded by convert_from_reference. */
5782 tree addr
= TREE_OPERAND (probe
, 0);
5783 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5784 && TREE_CODE (addr
) == ADDR_EXPR
5785 && TYPE_PTR_P (TREE_TYPE (addr
))
5786 && (same_type_ignoring_top_level_qualifiers_p
5787 (TREE_TYPE (probe_type
),
5788 TREE_TYPE (TREE_TYPE (addr
)))))
5790 expr
= TREE_OPERAND (addr
, 0);
5791 expr_type
= TREE_TYPE (probe_type
);
5796 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5797 parameter is a pointer to object, through decay and
5798 qualification conversion. Let's strip everything. */
5799 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5803 if (TREE_CODE (probe
) == ADDR_EXPR
5804 && TYPE_PTR_P (TREE_TYPE (probe
)))
5806 /* Skip the ADDR_EXPR only if it is part of the decay for
5807 an array. Otherwise, it is part of the original argument
5808 in the source code. */
5809 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5810 probe
= TREE_OPERAND (probe
, 0);
5812 expr_type
= TREE_TYPE (expr
);
5816 /* [temp.arg.nontype]/5, bullet 1
5818 For a non-type template-parameter of integral or enumeration type,
5819 integral promotions (_conv.prom_) and integral conversions
5820 (_conv.integral_) are applied. */
5821 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5823 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5824 t
= maybe_constant_value (t
);
5825 if (t
!= error_mark_node
)
5828 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5829 return error_mark_node
;
5831 /* Notice that there are constant expressions like '4 % 0' which
5832 do not fold into integer constants. */
5833 if (TREE_CODE (expr
) != INTEGER_CST
)
5835 if (complain
& tf_error
)
5837 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5838 if (processing_template_decl
5839 && !require_potential_constant_expression (expr
))
5841 expr
= cxx_constant_value (expr
);
5842 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5843 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
5844 "in template argument for type %qT ", type
);
5845 if (expr
== error_mark_node
)
5847 /* else cxx_constant_value complained but gave us
5848 a real constant, so go ahead. */
5849 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5855 /* Avoid typedef problems. */
5856 if (TREE_TYPE (expr
) != type
)
5857 expr
= fold_convert (type
, expr
);
5859 /* [temp.arg.nontype]/5, bullet 2
5861 For a non-type template-parameter of type pointer to object,
5862 qualification conversions (_conv.qual_) and the array-to-pointer
5863 conversion (_conv.array_) are applied. */
5864 else if (TYPE_PTROBV_P (type
))
5866 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5868 A template-argument for a non-type, non-template template-parameter
5869 shall be one of: [...]
5871 -- the name of a non-type template-parameter;
5872 -- the address of an object or function with external linkage, [...]
5873 expressed as "& id-expression" where the & is optional if the name
5874 refers to a function or array, or if the corresponding
5875 template-parameter is a reference.
5877 Here, we do not care about functions, as they are invalid anyway
5878 for a parameter of type pointer-to-object. */
5880 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5881 /* Non-type template parameters are OK. */
5883 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5884 /* Null pointer values are OK in C++11. */;
5885 else if (TREE_CODE (expr
) != ADDR_EXPR
5886 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5890 if (complain
& tf_error
)
5891 error ("%qD is not a valid template argument "
5892 "because %qD is a variable, not the address of "
5893 "a variable", expr
, expr
);
5896 if (POINTER_TYPE_P (expr_type
))
5898 if (complain
& tf_error
)
5899 error ("%qE is not a valid template argument for %qT "
5900 "because it is not the address of a variable",
5904 /* Other values, like integer constants, might be valid
5905 non-type arguments of some other type. */
5906 return error_mark_node
;
5912 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5913 ? TREE_OPERAND (expr
, 0) : expr
);
5916 if (complain
& tf_error
)
5917 error ("%qE is not a valid template argument of type %qT "
5918 "because %qE is not a variable", expr
, type
, decl
);
5921 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5923 if (complain
& tf_error
)
5924 error ("%qE is not a valid template argument of type %qT "
5925 "because %qD does not have external linkage",
5929 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
5931 if (complain
& tf_error
)
5932 error ("%qE is not a valid template argument of type %qT "
5933 "because %qD has no linkage", expr
, type
, decl
);
5938 expr
= decay_conversion (expr
, complain
);
5939 if (expr
== error_mark_node
)
5940 return error_mark_node
;
5942 expr
= perform_qualification_conversions (type
, expr
);
5943 if (expr
== error_mark_node
)
5944 return error_mark_node
;
5946 /* [temp.arg.nontype]/5, bullet 3
5948 For a non-type template-parameter of type reference to object, no
5949 conversions apply. The type referred to by the reference may be more
5950 cv-qualified than the (otherwise identical) type of the
5951 template-argument. The template-parameter is bound directly to the
5952 template-argument, which must be an lvalue. */
5953 else if (TYPE_REF_OBJ_P (type
))
5955 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5957 return error_mark_node
;
5959 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5961 if (complain
& tf_error
)
5962 error ("%qE is not a valid template argument for type %qT "
5963 "because of conflicts in cv-qualification", expr
, type
);
5967 if (!real_lvalue_p (expr
))
5969 if (complain
& tf_error
)
5970 error ("%qE is not a valid template argument for type %qT "
5971 "because it is not an lvalue", expr
, type
);
5975 /* [temp.arg.nontype]/1
5977 A template-argument for a non-type, non-template template-parameter
5978 shall be one of: [...]
5980 -- the address of an object or function with external linkage. */
5981 if (INDIRECT_REF_P (expr
)
5982 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5984 expr
= TREE_OPERAND (expr
, 0);
5987 if (complain
& tf_error
)
5988 error ("%q#D is not a valid template argument for type %qT "
5989 "because a reference variable does not have a constant "
5990 "address", expr
, type
);
5997 if (complain
& tf_error
)
5998 error ("%qE is not a valid template argument for type %qT "
5999 "because it is not an object with external linkage",
6004 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
6006 if (complain
& tf_error
)
6007 error ("%qE is not a valid template argument for type %qT "
6008 "because object %qD has not external linkage",
6013 expr
= build_nop (type
, build_address (expr
));
6015 /* [temp.arg.nontype]/5, bullet 4
6017 For a non-type template-parameter of type pointer to function, only
6018 the function-to-pointer conversion (_conv.func_) is applied. If the
6019 template-argument represents a set of overloaded functions (or a
6020 pointer to such), the matching function is selected from the set
6022 else if (TYPE_PTRFN_P (type
))
6024 /* If the argument is a template-id, we might not have enough
6025 context information to decay the pointer. */
6026 if (!type_unknown_p (expr_type
))
6028 expr
= decay_conversion (expr
, complain
);
6029 if (expr
== error_mark_node
)
6030 return error_mark_node
;
6033 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6034 /* Null pointer values are OK in C++11. */
6035 return perform_qualification_conversions (type
, expr
);
6037 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6038 if (!expr
|| expr
== error_mark_node
)
6041 /* [temp.arg.nontype]/5, bullet 5
6043 For a non-type template-parameter of type reference to function, no
6044 conversions apply. If the template-argument represents a set of
6045 overloaded functions, the matching function is selected from the set
6047 else if (TYPE_REFFN_P (type
))
6049 if (TREE_CODE (expr
) == ADDR_EXPR
)
6051 if (complain
& tf_error
)
6053 error ("%qE is not a valid template argument for type %qT "
6054 "because it is a pointer", expr
, type
);
6055 inform (input_location
, "try using %qE instead",
6056 TREE_OPERAND (expr
, 0));
6061 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6062 if (!expr
|| expr
== error_mark_node
)
6065 expr
= build_nop (type
, build_address (expr
));
6067 /* [temp.arg.nontype]/5, bullet 6
6069 For a non-type template-parameter of type pointer to member function,
6070 no conversions apply. If the template-argument represents a set of
6071 overloaded member functions, the matching member function is selected
6072 from the set (_over.over_). */
6073 else if (TYPE_PTRMEMFUNC_P (type
))
6075 expr
= instantiate_type (type
, expr
, tf_none
);
6076 if (expr
== error_mark_node
)
6077 return error_mark_node
;
6079 /* [temp.arg.nontype] bullet 1 says the pointer to member
6080 expression must be a pointer-to-member constant. */
6081 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6082 return error_mark_node
;
6084 /* There is no way to disable standard conversions in
6085 resolve_address_of_overloaded_function (called by
6086 instantiate_type). It is possible that the call succeeded by
6087 converting &B::I to &D::I (where B is a base of D), so we need
6088 to reject this conversion here.
6090 Actually, even if there was a way to disable standard conversions,
6091 it would still be better to reject them here so that we can
6092 provide a superior diagnostic. */
6093 if (!same_type_p (TREE_TYPE (expr
), type
))
6095 if (complain
& tf_error
)
6097 error ("%qE is not a valid template argument for type %qT "
6098 "because it is of type %qT", expr
, type
,
6100 /* If we are just one standard conversion off, explain. */
6101 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6102 inform (input_location
,
6103 "standard conversions are not allowed in this context");
6108 /* [temp.arg.nontype]/5, bullet 7
6110 For a non-type template-parameter of type pointer to data member,
6111 qualification conversions (_conv.qual_) are applied. */
6112 else if (TYPE_PTRDATAMEM_P (type
))
6114 /* [temp.arg.nontype] bullet 1 says the pointer to member
6115 expression must be a pointer-to-member constant. */
6116 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6117 return error_mark_node
;
6119 expr
= perform_qualification_conversions (type
, expr
);
6120 if (expr
== error_mark_node
)
6123 else if (NULLPTR_TYPE_P (type
))
6125 if (expr
!= nullptr_node
)
6127 if (complain
& tf_error
)
6128 error ("%qE is not a valid template argument for type %qT "
6129 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6134 /* A template non-type parameter must be one of the above. */
6138 /* Sanity check: did we actually convert the argument to the
6140 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6141 (type
, TREE_TYPE (expr
)));
6145 /* Subroutine of coerce_template_template_parms, which returns 1 if
6146 PARM_PARM and ARG_PARM match using the rule for the template
6147 parameters of template template parameters. Both PARM and ARG are
6148 template parameters; the rest of the arguments are the same as for
6149 coerce_template_template_parms.
6152 coerce_template_template_parm (tree parm
,
6154 tsubst_flags_t complain
,
6158 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6159 || parm
== NULL_TREE
|| error_operand_p (parm
))
6162 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6165 switch (TREE_CODE (parm
))
6168 /* We encounter instantiations of templates like
6169 template <template <template <class> class> class TT>
6172 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6173 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6175 if (!coerce_template_template_parms
6176 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6182 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6183 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6184 /* Argument is a parameter pack but parameter is not. */
6189 /* The tsubst call is used to handle cases such as
6191 template <int> class C {};
6192 template <class T, template <T> class TT> class D {};
6195 i.e. the parameter list of TT depends on earlier parameters. */
6196 if (!uses_template_parms (TREE_TYPE (arg
))
6198 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6202 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6203 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6204 /* Argument is a parameter pack but parameter is not. */
6217 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6218 template template parameters. Both PARM_PARMS and ARG_PARMS are
6219 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6222 Consider the example:
6223 template <class T> class A;
6224 template<template <class U> class TT> class B;
6226 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6227 the parameters to A, and OUTER_ARGS contains A. */
6230 coerce_template_template_parms (tree parm_parms
,
6232 tsubst_flags_t complain
,
6236 int nparms
, nargs
, i
;
6240 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6241 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6243 nparms
= TREE_VEC_LENGTH (parm_parms
);
6244 nargs
= TREE_VEC_LENGTH (arg_parms
);
6246 /* Determine whether we have a parameter pack at the end of the
6247 template template parameter's template parameter list. */
6248 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6250 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6252 if (error_operand_p (parm
))
6255 switch (TREE_CODE (parm
))
6259 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6264 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6274 && !(variadic_p
&& nargs
>= nparms
- 1))
6277 /* Check all of the template parameters except the parameter pack at
6278 the end (if any). */
6279 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6281 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6282 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6285 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6286 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6288 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6296 /* Check each of the template parameters in the template
6297 argument against the template parameter pack at the end of
6298 the template template parameter. */
6299 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6302 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6304 for (; i
< nargs
; ++i
)
6306 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6309 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6311 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6320 /* Verifies that the deduced template arguments (in TARGS) for the
6321 template template parameters (in TPARMS) represent valid bindings,
6322 by comparing the template parameter list of each template argument
6323 to the template parameter list of its corresponding template
6324 template parameter, in accordance with DR150. This
6325 routine can only be called after all template arguments have been
6326 deduced. It will return TRUE if all of the template template
6327 parameter bindings are okay, FALSE otherwise. */
6329 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6331 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6334 /* We're dealing with template parms in this process. */
6335 ++processing_template_decl
;
6337 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6339 for (i
= 0; i
< ntparms
; ++i
)
6341 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6342 tree targ
= TREE_VEC_ELT (targs
, i
);
6344 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6346 tree packed_args
= NULL_TREE
;
6349 if (ARGUMENT_PACK_P (targ
))
6351 /* Look inside the argument pack. */
6352 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6353 len
= TREE_VEC_LENGTH (packed_args
);
6356 for (idx
= 0; idx
< len
; ++idx
)
6358 tree targ_parms
= NULL_TREE
;
6361 /* Extract the next argument from the argument
6363 targ
= TREE_VEC_ELT (packed_args
, idx
);
6365 if (PACK_EXPANSION_P (targ
))
6366 /* Look at the pattern of the pack expansion. */
6367 targ
= PACK_EXPANSION_PATTERN (targ
);
6369 /* Extract the template parameters from the template
6371 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6372 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6373 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6374 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6376 /* Verify that we can coerce the template template
6377 parameters from the template argument to the template
6378 parameter. This requires an exact match. */
6380 && !coerce_template_template_parms
6381 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6396 --processing_template_decl
;
6400 /* Since type attributes aren't mangled, we need to strip them from
6401 template type arguments. */
6404 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6407 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6409 mv
= TYPE_MAIN_VARIANT (arg
);
6410 arg
= strip_typedefs (arg
);
6411 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6412 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6414 if (complain
& tf_warning
)
6415 warning (0, "ignoring attributes on template argument %qT", arg
);
6416 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6417 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6422 /* Convert the indicated template ARG as necessary to match the
6423 indicated template PARM. Returns the converted ARG, or
6424 error_mark_node if the conversion was unsuccessful. Error and
6425 warning messages are issued under control of COMPLAIN. This
6426 conversion is for the Ith parameter in the parameter list. ARGS is
6427 the full set of template arguments deduced so far. */
6430 convert_template_argument (tree parm
,
6433 tsubst_flags_t complain
,
6439 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6441 if (TREE_CODE (arg
) == TREE_LIST
6442 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6444 /* The template argument was the name of some
6445 member function. That's usually
6446 invalid, but static members are OK. In any
6447 case, grab the underlying fields/functions
6448 and issue an error later if required. */
6449 orig_arg
= TREE_VALUE (arg
);
6450 TREE_TYPE (arg
) = unknown_type_node
;
6455 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6456 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6457 || requires_tmpl_type
);
6459 /* When determining whether an argument pack expansion is a template,
6460 look at the pattern. */
6461 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6462 arg
= PACK_EXPANSION_PATTERN (arg
);
6464 /* Deal with an injected-class-name used as a template template arg. */
6465 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6467 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6468 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6470 if (cxx_dialect
>= cxx11
)
6471 /* OK under DR 1004. */;
6472 else if (complain
& tf_warning_or_error
)
6473 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6474 " used as template template argument", TYPE_NAME (arg
));
6475 else if (flag_pedantic_errors
)
6483 ((TREE_CODE (arg
) == TEMPLATE_DECL
6484 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6485 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6486 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6487 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6490 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6491 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6492 arg
= TYPE_STUB_DECL (arg
);
6494 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6496 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6497 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6499 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6501 if (complain
& tf_error
)
6502 error ("invalid use of destructor %qE as a type", orig_arg
);
6503 return error_mark_node
;
6506 permerror (input_location
,
6507 "to refer to a type member of a template parameter, "
6508 "use %<typename %E%>", orig_arg
);
6510 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6511 TREE_OPERAND (arg
, 1),
6517 if (is_type
!= requires_type
)
6521 if (complain
& tf_error
)
6523 error ("type/value mismatch at argument %d in template "
6524 "parameter list for %qD",
6527 inform (input_location
,
6528 " expected a constant of type %qT, got %qT",
6530 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6531 else if (requires_tmpl_type
)
6532 inform (input_location
,
6533 " expected a class template, got %qE", orig_arg
);
6535 inform (input_location
,
6536 " expected a type, got %qE", orig_arg
);
6539 return error_mark_node
;
6541 if (is_tmpl_type
^ requires_tmpl_type
)
6543 if (in_decl
&& (complain
& tf_error
))
6545 error ("type/value mismatch at argument %d in template "
6546 "parameter list for %qD",
6549 inform (input_location
,
6550 " expected a type, got %qT", DECL_NAME (arg
));
6552 inform (input_location
,
6553 " expected a class template, got %qT", orig_arg
);
6555 return error_mark_node
;
6560 if (requires_tmpl_type
)
6562 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6564 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6565 /* The number of argument required is not known yet.
6566 Just accept it for now. */
6567 val
= TREE_TYPE (arg
);
6570 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6573 /* Strip alias templates that are equivalent to another
6575 arg
= get_underlying_template (arg
);
6576 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6578 if (coerce_template_template_parms (parmparm
, argparm
,
6584 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6586 if (val
!= error_mark_node
)
6588 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6589 val
= TREE_TYPE (val
);
6590 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6591 val
= make_pack_expansion (val
);
6596 if (in_decl
&& (complain
& tf_error
))
6598 error ("type/value mismatch at argument %d in "
6599 "template parameter list for %qD",
6601 inform (input_location
,
6602 " expected a template of type %qD, got %qT",
6606 val
= error_mark_node
;
6612 /* We only form one instance of each template specialization.
6613 Therefore, if we use a non-canonical variant (i.e., a
6614 typedef), any future messages referring to the type will use
6615 the typedef, which is confusing if those future uses do not
6616 themselves also use the typedef. */
6618 val
= canonicalize_type_argument (val
, complain
);
6622 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6624 if (invalid_nontype_parm_type_p (t
, complain
))
6625 return error_mark_node
;
6627 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6629 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6633 /* Not sure if this is reachable, but it doesn't hurt
6635 error ("type mismatch in nontype parameter pack");
6636 val
= error_mark_node
;
6639 else if (!dependent_template_arg_p (orig_arg
)
6640 && !uses_template_parms (t
))
6641 /* We used to call digest_init here. However, digest_init
6642 will report errors, which we don't want when complain
6643 is zero. More importantly, digest_init will try too
6644 hard to convert things: for example, `0' should not be
6645 converted to pointer type at this point according to
6646 the standard. Accepting this is not merely an
6647 extension, since deciding whether or not these
6648 conversions can occur is part of determining which
6649 function template to call, or whether a given explicit
6650 argument specification is valid. */
6651 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6653 val
= strip_typedefs_expr (orig_arg
);
6655 if (val
== NULL_TREE
)
6656 val
= error_mark_node
;
6657 else if (val
== error_mark_node
&& (complain
& tf_error
))
6658 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6660 if (TREE_CODE (val
) == SCOPE_REF
)
6662 /* Strip typedefs from the SCOPE_REF. */
6663 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6664 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6666 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6667 QUALIFIED_NAME_IS_TEMPLATE (val
));
6674 /* Coerces the remaining template arguments in INNER_ARGS (from
6675 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6676 Returns the coerced argument pack. PARM_IDX is the position of this
6677 parameter in the template parameter list. ARGS is the original
6678 template argument list. */
6680 coerce_template_parameter_pack (tree parms
,
6688 tsubst_flags_t complain
)
6690 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6691 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6694 tree packed_parms
= NULL_TREE
;
6696 if (arg_idx
> nargs
)
6699 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6701 /* When the template parameter is a non-type template parameter pack
6702 or template template parameter pack whose type or template
6703 parameters use parameter packs, we know exactly how many arguments
6704 we are looking for. Build a vector of the instantiated decls for
6705 these template parameters in PACKED_PARMS. */
6706 /* We can't use make_pack_expansion here because it would interpret a
6707 _DECL as a use rather than a declaration. */
6708 tree decl
= TREE_VALUE (parm
);
6709 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6710 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6711 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6712 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6714 TREE_VEC_LENGTH (args
)--;
6715 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6716 TREE_VEC_LENGTH (args
)++;
6718 if (packed_parms
== error_mark_node
)
6719 return error_mark_node
;
6721 /* If we're doing a partial instantiation of a member template,
6722 verify that all of the types used for the non-type
6723 template parameter pack are, in fact, valid for non-type
6724 template parameters. */
6726 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6728 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6729 for (j
= 0; j
< len
; ++j
)
6731 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6732 if (invalid_nontype_parm_type_p (t
, complain
))
6733 return error_mark_node
;
6737 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6740 packed_args
= make_tree_vec (nargs
- arg_idx
);
6742 /* Convert the remaining arguments, which will be a part of the
6743 parameter pack "parm". */
6744 for (; arg_idx
< nargs
; ++arg_idx
)
6746 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6747 tree actual_parm
= TREE_VALUE (parm
);
6748 int pack_idx
= arg_idx
- parm_idx
;
6752 /* Once we've packed as many args as we have types, stop. */
6753 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6755 else if (PACK_EXPANSION_P (arg
))
6756 /* We don't know how many args we have yet, just
6757 use the unconverted ones for now. */
6760 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6763 if (arg
== error_mark_node
)
6765 if (complain
& tf_error
)
6766 error ("template argument %d is invalid", arg_idx
+ 1);
6769 arg
= convert_template_argument (actual_parm
,
6770 arg
, new_args
, complain
, parm_idx
,
6772 if (arg
== error_mark_node
)
6774 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6777 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6778 && TREE_VEC_LENGTH (packed_args
) > 0)
6780 if (complain
& tf_error
)
6781 error ("wrong number of template arguments (%d, should be %d)",
6782 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6783 return error_mark_node
;
6786 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6787 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6788 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6791 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6792 TREE_TYPE (argument_pack
)
6793 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6794 TREE_CONSTANT (argument_pack
) = 1;
6797 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6798 #ifdef ENABLE_CHECKING
6799 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6800 TREE_VEC_LENGTH (packed_args
));
6802 return argument_pack
;
6805 /* Returns the number of pack expansions in the template argument vector
6809 pack_expansion_args_count (tree args
)
6814 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6816 tree elt
= TREE_VEC_ELT (args
, i
);
6817 if (elt
&& PACK_EXPANSION_P (elt
))
6823 /* Convert all template arguments to their appropriate types, and
6824 return a vector containing the innermost resulting template
6825 arguments. If any error occurs, return error_mark_node. Error and
6826 warning messages are issued under control of COMPLAIN.
6828 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6829 for arguments not specified in ARGS. Otherwise, if
6830 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6831 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6832 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6836 coerce_template_parms (tree parms
,
6839 tsubst_flags_t complain
,
6840 bool require_all_args
,
6841 bool use_default_args
)
6843 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6844 tree orig_inner_args
;
6847 tree new_inner_args
;
6848 int saved_unevaluated_operand
;
6849 int saved_inhibit_evaluation_warnings
;
6851 /* When used as a boolean value, indicates whether this is a
6852 variadic template parameter list. Since it's an int, we can also
6853 subtract it from nparms to get the number of non-variadic
6856 int variadic_args_p
= 0;
6857 int post_variadic_parms
= 0;
6859 if (args
== error_mark_node
)
6860 return error_mark_node
;
6862 nparms
= TREE_VEC_LENGTH (parms
);
6864 /* Determine if there are any parameter packs. */
6865 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6867 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
6869 ++post_variadic_parms
;
6870 if (template_parameter_pack_p (tparm
))
6874 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6875 /* If there are no parameters that follow a parameter pack, we need to
6876 expand any argument packs so that we can deduce a parameter pack from
6877 some non-packed args followed by an argument pack, as in variadic85.C.
6878 If there are such parameters, we need to leave argument packs intact
6879 so the arguments are assigned properly. This can happen when dealing
6880 with a nested class inside a partial specialization of a class
6881 template, as in variadic92.C, or when deducing a template parameter pack
6882 from a sub-declarator, as in variadic114.C. */
6883 if (!post_variadic_parms
)
6884 inner_args
= expand_template_argument_pack (inner_args
);
6886 /* Count any pack expansion args. */
6887 variadic_args_p
= pack_expansion_args_count (inner_args
);
6889 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6890 if ((nargs
> nparms
&& !variadic_p
)
6891 || (nargs
< nparms
- variadic_p
6894 && (!use_default_args
6895 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6896 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6898 if (complain
& tf_error
)
6902 nparms
-= variadic_p
;
6903 error ("wrong number of template arguments "
6904 "(%d, should be %d or more)", nargs
, nparms
);
6907 error ("wrong number of template arguments "
6908 "(%d, should be %d)", nargs
, nparms
);
6911 error ("provided for %q+D", in_decl
);
6914 return error_mark_node
;
6916 /* We can't pass a pack expansion to a non-pack parameter of an alias
6917 template (DR 1430). */
6918 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
6920 && nargs
- variadic_args_p
< nparms
- variadic_p
)
6922 if (complain
& tf_error
)
6924 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
6926 tree arg
= TREE_VEC_ELT (inner_args
, i
);
6927 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6929 if (PACK_EXPANSION_P (arg
)
6930 && !template_parameter_pack_p (parm
))
6932 error ("pack expansion argument for non-pack parameter "
6933 "%qD of alias template %qD", parm
, in_decl
);
6934 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
6941 return error_mark_node
;
6944 /* We need to evaluate the template arguments, even though this
6945 template-id may be nested within a "sizeof". */
6946 saved_unevaluated_operand
= cp_unevaluated_operand
;
6947 cp_unevaluated_operand
= 0;
6948 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6949 c_inhibit_evaluation_warnings
= 0;
6950 new_inner_args
= make_tree_vec (nparms
);
6951 new_args
= add_outermost_template_args (args
, new_inner_args
);
6952 int pack_adjust
= 0;
6953 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6958 /* Get the Ith template parameter. */
6959 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6961 if (parm
== error_mark_node
)
6963 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6967 /* Calculate the next argument. */
6968 if (arg_idx
< nargs
)
6969 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6973 if (template_parameter_pack_p (TREE_VALUE (parm
))
6974 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6976 /* Some arguments will be placed in the
6977 template parameter pack PARM. */
6978 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6979 inner_args
, arg_idx
,
6983 if (arg
== NULL_TREE
)
6985 /* We don't know how many args we have yet, just use the
6986 unconverted (and still packed) ones for now. */
6987 new_inner_args
= orig_inner_args
;
6992 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
6994 /* Store this argument. */
6995 if (arg
== error_mark_node
)
6998 /* We are done with all of the arguments. */
7003 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7004 arg_idx
+= pack_adjust
;
7011 if (PACK_EXPANSION_P (arg
))
7013 /* "If every valid specialization of a variadic template
7014 requires an empty template parameter pack, the template is
7015 ill-formed, no diagnostic required." So check that the
7016 pattern works with this parameter. */
7017 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7018 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7022 if (conv
== error_mark_node
)
7024 inform (input_location
, "so any instantiation with a "
7025 "non-empty parameter pack would be ill-formed");
7028 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7029 /* Recover from missing typename. */
7030 TREE_VEC_ELT (inner_args
, arg_idx
)
7031 = make_pack_expansion (conv
);
7033 /* We don't know how many args we have yet, just
7034 use the unconverted ones for now. */
7035 new_inner_args
= inner_args
;
7040 else if (require_all_args
)
7042 /* There must be a default arg in this case. */
7043 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7045 /* The position of the first default template argument,
7046 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7048 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7049 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7050 arg_idx
- pack_adjust
);
7055 if (arg
== error_mark_node
)
7057 if (complain
& tf_error
)
7058 error ("template argument %d is invalid", arg_idx
+ 1);
7061 /* This only occurs if there was an error in the template
7062 parameter list itself (which we would already have
7063 reported) that we are trying to recover from, e.g., a class
7064 template with a parameter list such as
7065 template<typename..., typename>. */
7068 arg
= convert_template_argument (TREE_VALUE (parm
),
7069 arg
, new_args
, complain
,
7072 if (arg
== error_mark_node
)
7074 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7076 cp_unevaluated_operand
= saved_unevaluated_operand
;
7077 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7079 if (variadic_p
&& arg_idx
< nargs
)
7081 if (complain
& tf_error
)
7083 error ("wrong number of template arguments "
7084 "(%d, should be %d)", nargs
, arg_idx
);
7086 error ("provided for %q+D", in_decl
);
7088 return error_mark_node
;
7092 return error_mark_node
;
7094 #ifdef ENABLE_CHECKING
7095 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7096 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7097 TREE_VEC_LENGTH (new_inner_args
));
7100 return new_inner_args
;
7103 /* Like coerce_template_parms. If PARMS represents all template
7104 parameters levels, this function returns a vector of vectors
7105 representing all the resulting argument levels. Note that in this
7106 case, only the innermost arguments are coerced because the
7107 outermost ones are supposed to have been coerced already.
7109 Otherwise, if PARMS represents only (the innermost) vector of
7110 parameters, this function returns a vector containing just the
7111 innermost resulting arguments. */
7114 coerce_innermost_template_parms (tree parms
,
7117 tsubst_flags_t complain
,
7118 bool require_all_args
,
7119 bool use_default_args
)
7121 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7122 int args_depth
= TMPL_ARGS_DEPTH (args
);
7125 if (parms_depth
> 1)
7127 coerced_args
= make_tree_vec (parms_depth
);
7131 for (level
= parms
, cur_depth
= parms_depth
;
7132 parms_depth
> 0 && level
!= NULL_TREE
;
7133 level
= TREE_CHAIN (level
), --cur_depth
)
7136 if (cur_depth
== args_depth
)
7137 l
= coerce_template_parms (TREE_VALUE (level
),
7138 args
, in_decl
, complain
,
7142 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7144 if (l
== error_mark_node
)
7145 return error_mark_node
;
7147 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7151 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7152 args
, in_decl
, complain
,
7155 return coerced_args
;
7158 /* Returns 1 if template args OT and NT are equivalent. */
7161 template_args_equal (tree ot
, tree nt
)
7165 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7168 if (TREE_CODE (nt
) == TREE_VEC
)
7169 /* For member templates */
7170 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7171 else if (PACK_EXPANSION_P (ot
))
7172 return (PACK_EXPANSION_P (nt
)
7173 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7174 PACK_EXPANSION_PATTERN (nt
))
7175 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7176 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7177 else if (ARGUMENT_PACK_P (ot
))
7182 if (!ARGUMENT_PACK_P (nt
))
7185 opack
= ARGUMENT_PACK_ARGS (ot
);
7186 npack
= ARGUMENT_PACK_ARGS (nt
);
7187 len
= TREE_VEC_LENGTH (opack
);
7188 if (TREE_VEC_LENGTH (npack
) != len
)
7190 for (i
= 0; i
< len
; ++i
)
7191 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7192 TREE_VEC_ELT (npack
, i
)))
7196 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7198 /* We get here probably because we are in the middle of substituting
7199 into the pattern of a pack expansion. In that case the
7200 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7201 interested in. So we want to use the initial pack argument for
7203 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7204 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7205 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7206 return template_args_equal (ot
, nt
);
7208 else if (TYPE_P (nt
))
7209 return TYPE_P (ot
) && same_type_p (ot
, nt
);
7210 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7213 return cp_tree_equal (ot
, nt
);
7216 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7217 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7218 NEWARG_PTR with the offending arguments if they are non-NULL. */
7221 comp_template_args_with_info (tree oldargs
, tree newargs
,
7222 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7226 if (oldargs
== newargs
)
7229 if (!oldargs
|| !newargs
)
7232 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7235 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7237 tree nt
= TREE_VEC_ELT (newargs
, i
);
7238 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7240 if (! template_args_equal (ot
, nt
))
7242 if (oldarg_ptr
!= NULL
)
7244 if (newarg_ptr
!= NULL
)
7252 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7253 of template arguments. Returns 0 otherwise. */
7256 comp_template_args (tree oldargs
, tree newargs
)
7258 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7262 add_pending_template (tree d
)
7264 tree ti
= (TYPE_P (d
)
7265 ? CLASSTYPE_TEMPLATE_INFO (d
)
7266 : DECL_TEMPLATE_INFO (d
));
7267 struct pending_template
*pt
;
7270 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7273 /* We are called both from instantiate_decl, where we've already had a
7274 tinst_level pushed, and instantiate_template, where we haven't.
7276 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7279 push_tinst_level (d
);
7281 pt
= ggc_alloc
<pending_template
> ();
7283 pt
->tinst
= current_tinst_level
;
7284 if (last_pending_template
)
7285 last_pending_template
->next
= pt
;
7287 pending_templates
= pt
;
7289 last_pending_template
= pt
;
7291 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7298 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7299 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7300 documentation for TEMPLATE_ID_EXPR. */
7303 lookup_template_function (tree fns
, tree arglist
)
7307 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7308 return error_mark_node
;
7310 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7312 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7314 error ("%q#D is not a function template", fns
);
7315 return error_mark_node
;
7318 if (BASELINK_P (fns
))
7320 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7322 BASELINK_FUNCTIONS (fns
),
7327 type
= TREE_TYPE (fns
);
7328 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7329 type
= unknown_type_node
;
7331 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7334 /* Within the scope of a template class S<T>, the name S gets bound
7335 (in build_self_reference) to a TYPE_DECL for the class, not a
7336 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7337 or one of its enclosing classes, and that type is a template,
7338 return the associated TEMPLATE_DECL. Otherwise, the original
7341 Also handle the case when DECL is a TREE_LIST of ambiguous
7342 injected-class-names from different bases. */
7345 maybe_get_template_decl_from_type_decl (tree decl
)
7347 if (decl
== NULL_TREE
)
7350 /* DR 176: A lookup that finds an injected-class-name (10.2
7351 [class.member.lookup]) can result in an ambiguity in certain cases
7352 (for example, if it is found in more than one base class). If all of
7353 the injected-class-names that are found refer to specializations of
7354 the same class template, and if the name is followed by a
7355 template-argument-list, the reference refers to the class template
7356 itself and not a specialization thereof, and is not ambiguous. */
7357 if (TREE_CODE (decl
) == TREE_LIST
)
7359 tree t
, tmpl
= NULL_TREE
;
7360 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7362 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7365 else if (tmpl
!= elt
)
7368 if (tmpl
&& t
== NULL_TREE
)
7374 return (decl
!= NULL_TREE
7375 && DECL_SELF_REFERENCE_P (decl
)
7376 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7377 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7380 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7381 parameters, find the desired type.
7383 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7385 IN_DECL, if non-NULL, is the template declaration we are trying to
7388 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7389 the class we are looking up.
7391 Issue error and warning messages under control of COMPLAIN.
7393 If the template class is really a local class in a template
7394 function, then the FUNCTION_CONTEXT is the function in which it is
7397 ??? Note that this function is currently called *twice* for each
7398 template-id: the first time from the parser, while creating the
7399 incomplete type (finish_template_type), and the second type during the
7400 real instantiation (instantiate_template_class). This is surely something
7401 that we want to avoid. It also causes some problems with argument
7402 coercion (see convert_nontype_argument for more information on this). */
7405 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7406 int entering_scope
, tsubst_flags_t complain
)
7408 tree templ
= NULL_TREE
, parmlist
;
7415 if (identifier_p (d1
))
7417 tree value
= innermost_non_namespace_value (d1
);
7418 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7423 push_decl_namespace (context
);
7424 templ
= lookup_name (d1
);
7425 templ
= maybe_get_template_decl_from_type_decl (templ
);
7427 pop_decl_namespace ();
7430 context
= DECL_CONTEXT (templ
);
7432 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7434 tree type
= TREE_TYPE (d1
);
7436 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7437 an implicit typename for the second A. Deal with it. */
7438 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7439 type
= TREE_TYPE (type
);
7441 if (CLASSTYPE_TEMPLATE_INFO (type
))
7443 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7444 d1
= DECL_NAME (templ
);
7447 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7448 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7450 templ
= TYPE_TI_TEMPLATE (d1
);
7451 d1
= DECL_NAME (templ
);
7453 else if (DECL_TYPE_TEMPLATE_P (d1
))
7456 d1
= DECL_NAME (templ
);
7457 context
= DECL_CONTEXT (templ
);
7459 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7462 d1
= DECL_NAME (templ
);
7465 /* Issue an error message if we didn't find a template. */
7468 if (complain
& tf_error
)
7469 error ("%qT is not a template", d1
);
7470 return error_mark_node
;
7473 if (TREE_CODE (templ
) != TEMPLATE_DECL
7474 /* Make sure it's a user visible template, if it was named by
7476 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7477 && !PRIMARY_TEMPLATE_P (templ
)))
7479 if (complain
& tf_error
)
7481 error ("non-template type %qT used as a template", d1
);
7483 error ("for template declaration %q+D", in_decl
);
7485 return error_mark_node
;
7488 complain
&= ~tf_user
;
7490 /* An alias that just changes the name of a template is equivalent to the
7491 other template, so if any of the arguments are pack expansions, strip
7492 the alias to avoid problems with a pack expansion passed to a non-pack
7493 alias template parameter (DR 1430). */
7494 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7495 templ
= get_underlying_template (templ
);
7497 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7499 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7500 template arguments */
7506 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7508 /* Consider an example where a template template parameter declared as
7510 template <class T, class U = std::allocator<T> > class TT
7512 The template parameter level of T and U are one level larger than
7513 of TT. To proper process the default argument of U, say when an
7514 instantiation `TT<int>' is seen, we need to build the full
7515 arguments containing {int} as the innermost level. Outer levels,
7516 available when not appearing as default template argument, can be
7517 obtained from the arguments of the enclosing template.
7519 Suppose that TT is later substituted with std::vector. The above
7520 instantiation is `TT<int, std::allocator<T> >' with TT at
7521 level 1, and T at level 2, while the template arguments at level 1
7522 becomes {std::vector} and the inner level 2 is {int}. */
7524 outer
= DECL_CONTEXT (templ
);
7526 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7527 else if (current_template_parms
)
7528 /* This is an argument of the current template, so we haven't set
7529 DECL_CONTEXT yet. */
7530 outer
= current_template_args ();
7533 arglist
= add_to_template_args (outer
, arglist
);
7535 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7537 /*require_all_args=*/true,
7538 /*use_default_args=*/true);
7539 if (arglist2
== error_mark_node
7540 || (!uses_template_parms (arglist2
)
7541 && check_instantiated_args (templ
, arglist2
, complain
)))
7542 return error_mark_node
;
7544 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7549 tree template_type
= TREE_TYPE (templ
);
7552 tree found
= NULL_TREE
;
7555 int is_dependent_type
;
7556 int use_partial_inst_tmpl
= false;
7558 if (template_type
== error_mark_node
)
7559 /* An error occurred while building the template TEMPL, and a
7560 diagnostic has most certainly been emitted for that
7561 already. Let's propagate that error. */
7562 return error_mark_node
;
7564 gen_tmpl
= most_general_template (templ
);
7565 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7566 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7567 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7569 if (arg_depth
== 1 && parm_depth
> 1)
7571 /* We've been given an incomplete set of template arguments.
7574 template <class T> struct S1 {
7575 template <class U> struct S2 {};
7576 template <class U> struct S2<U*> {};
7579 we will be called with an ARGLIST of `U*', but the
7580 TEMPLATE will be `template <class T> template
7581 <class U> struct S1<T>::S2'. We must fill in the missing
7584 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7586 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7589 /* Now we should have enough arguments. */
7590 gcc_assert (parm_depth
== arg_depth
);
7592 /* From here on, we're only interested in the most general
7595 /* Calculate the BOUND_ARGS. These will be the args that are
7596 actually tsubst'd into the definition to create the
7600 /* We have multiple levels of arguments to coerce, at once. */
7602 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7604 tree bound_args
= make_tree_vec (parm_depth
);
7606 for (i
= saved_depth
,
7607 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7608 i
> 0 && t
!= NULL_TREE
;
7609 --i
, t
= TREE_CHAIN (t
))
7612 if (i
== saved_depth
)
7613 a
= coerce_template_parms (TREE_VALUE (t
),
7616 /*require_all_args=*/true,
7617 /*use_default_args=*/true);
7619 /* Outer levels should have already been coerced. */
7620 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7622 /* Don't process further if one of the levels fails. */
7623 if (a
== error_mark_node
)
7625 /* Restore the ARGLIST to its full size. */
7626 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7627 return error_mark_node
;
7630 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7632 /* We temporarily reduce the length of the ARGLIST so
7633 that coerce_template_parms will see only the arguments
7634 corresponding to the template parameters it is
7636 TREE_VEC_LENGTH (arglist
)--;
7639 /* Restore the ARGLIST to its full size. */
7640 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7642 arglist
= bound_args
;
7646 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7647 INNERMOST_TEMPLATE_ARGS (arglist
),
7650 /*require_all_args=*/true,
7651 /*use_default_args=*/true);
7653 if (arglist
== error_mark_node
)
7654 /* We were unable to bind the arguments. */
7655 return error_mark_node
;
7657 /* In the scope of a template class, explicit references to the
7658 template class refer to the type of the template, not any
7659 instantiation of it. For example, in:
7661 template <class T> class C { void f(C<T>); }
7663 the `C<T>' is just the same as `C'. Outside of the
7664 class, however, such a reference is an instantiation. */
7666 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7667 || currently_open_class (template_type
))
7668 /* comp_template_args is expensive, check it last. */
7669 && comp_template_args (TYPE_TI_ARGS (template_type
),
7671 return template_type
;
7673 /* If we already have this specialization, return it. */
7674 elt
.tmpl
= gen_tmpl
;
7676 hash
= hash_specialization (&elt
);
7677 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7683 is_dependent_type
= uses_template_parms (arglist
);
7685 /* If the deduced arguments are invalid, then the binding
7687 if (!is_dependent_type
7688 && check_instantiated_args (gen_tmpl
,
7689 INNERMOST_TEMPLATE_ARGS (arglist
),
7691 return error_mark_node
;
7693 if (!is_dependent_type
7694 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7695 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7696 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7698 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7699 DECL_NAME (gen_tmpl
),
7700 /*tag_scope=*/ts_global
);
7704 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7706 if (context
== error_mark_node
)
7707 return error_mark_node
;
7710 context
= global_namespace
;
7712 /* Create the type. */
7713 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7715 /* The user referred to a specialization of an alias
7716 template represented by GEN_TMPL.
7718 [temp.alias]/2 says:
7720 When a template-id refers to the specialization of an
7721 alias template, it is equivalent to the associated
7722 type obtained by substitution of its
7723 template-arguments for the template-parameters in the
7724 type-id of the alias template. */
7726 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7727 /* Note that the call above (by indirectly calling
7728 register_specialization in tsubst_decl) registers the
7729 TYPE_DECL representing the specialization of the alias
7730 template. So next time someone substitutes ARGLIST for
7731 the template parms into the alias template (GEN_TMPL),
7732 she'll get that TYPE_DECL back. */
7734 if (t
== error_mark_node
)
7737 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7739 if (!is_dependent_type
)
7741 set_current_access_from_decl (TYPE_NAME (template_type
));
7742 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7743 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7744 arglist
, complain
, in_decl
),
7745 SCOPED_ENUM_P (template_type
), NULL
);
7747 if (t
== error_mark_node
)
7752 /* We don't want to call start_enum for this type, since
7753 the values for the enumeration constants may involve
7754 template parameters. And, no one should be interested
7755 in the enumeration constants for such a type. */
7756 t
= cxx_make_type (ENUMERAL_TYPE
);
7757 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7759 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7760 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7761 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7763 else if (CLASS_TYPE_P (template_type
))
7765 t
= make_class_type (TREE_CODE (template_type
));
7766 CLASSTYPE_DECLARED_CLASS (t
)
7767 = CLASSTYPE_DECLARED_CLASS (template_type
);
7768 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7769 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7771 /* A local class. Make sure the decl gets registered properly. */
7772 if (context
== current_function_decl
)
7773 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7775 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7776 /* This instantiation is another name for the primary
7777 template type. Set the TYPE_CANONICAL field
7779 TYPE_CANONICAL (t
) = template_type
;
7780 else if (any_template_arguments_need_structural_equality_p (arglist
))
7781 /* Some of the template arguments require structural
7782 equality testing, so this template class requires
7783 structural equality testing. */
7784 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7789 /* If we called start_enum or pushtag above, this information
7790 will already be set up. */
7793 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7795 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7796 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7797 DECL_SOURCE_LOCATION (type_decl
)
7798 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7801 type_decl
= TYPE_NAME (t
);
7803 if (CLASS_TYPE_P (template_type
))
7805 TREE_PRIVATE (type_decl
)
7806 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7807 TREE_PROTECTED (type_decl
)
7808 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7809 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7811 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7812 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7816 /* Let's consider the explicit specialization of a member
7817 of a class template specialization that is implicitly instantiated,
7822 template<class U> struct M {}; //#0
7827 struct S<int>::M<char> //#1
7831 [temp.expl.spec]/4 says this is valid.
7833 In this case, when we write:
7836 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7839 When we encounter #1, we want to store the partial instantiation
7840 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7842 For all cases other than this "explicit specialization of member of a
7843 class template", we just want to store the most general template into
7844 the CLASSTYPE_TI_TEMPLATE of M.
7846 This case of "explicit specialization of member of a class template"
7848 1/ the enclosing class is an instantiation of, and therefore not
7849 the same as, the context of the most general template, and
7850 2/ we aren't looking at the partial instantiation itself, i.e.
7851 the innermost arguments are not the same as the innermost parms of
7852 the most general template.
7854 So it's only when 1/ and 2/ happens that we want to use the partial
7855 instantiation of the member template in lieu of its most general
7858 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7859 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7860 /* the enclosing class must be an instantiation... */
7861 && CLASS_TYPE_P (context
)
7862 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7864 tree partial_inst_args
;
7865 TREE_VEC_LENGTH (arglist
)--;
7866 ++processing_template_decl
;
7868 tsubst (INNERMOST_TEMPLATE_ARGS
7869 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7870 arglist
, complain
, NULL_TREE
);
7871 --processing_template_decl
;
7872 TREE_VEC_LENGTH (arglist
)++;
7873 use_partial_inst_tmpl
=
7874 /*...and we must not be looking at the partial instantiation
7876 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7880 if (!use_partial_inst_tmpl
)
7881 /* This case is easy; there are no member templates involved. */
7885 /* This is a full instantiation of a member template. Find
7886 the partial instantiation of which this is an instance. */
7888 /* Temporarily reduce by one the number of levels in the ARGLIST
7889 so as to avoid comparing the last set of arguments. */
7890 TREE_VEC_LENGTH (arglist
)--;
7891 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7892 TREE_VEC_LENGTH (arglist
)++;
7893 /* FOUND is either a proper class type, or an alias
7894 template specialization. In the later case, it's a
7895 TYPE_DECL, resulting from the substituting of arguments
7896 for parameters in the TYPE_DECL of the alias template
7897 done earlier. So be careful while getting the template
7899 found
= TREE_CODE (found
) == TYPE_DECL
7900 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7901 : CLASSTYPE_TI_TEMPLATE (found
);
7904 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7907 slot
= htab_find_slot_with_hash (type_specializations
,
7908 &elt
, hash
, INSERT
);
7909 entry
= ggc_alloc
<spec_entry
> ();
7913 /* Note this use of the partial instantiation so we can check it
7914 later in maybe_process_partial_specialization. */
7915 DECL_TEMPLATE_INSTANTIATIONS (found
)
7916 = tree_cons (arglist
, t
,
7917 DECL_TEMPLATE_INSTANTIATIONS (found
));
7919 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
7920 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7921 /* Now that the type has been registered on the instantiations
7922 list, we set up the enumerators. Because the enumeration
7923 constants may involve the enumeration type itself, we make
7924 sure to register the type first, and then create the
7925 constants. That way, doing tsubst_expr for the enumeration
7926 constants won't result in recursive calls here; we'll find
7927 the instantiation and exit above. */
7928 tsubst_enum (template_type
, t
, arglist
);
7930 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7931 /* If the type makes use of template parameters, the
7932 code that generates debugging information will crash. */
7933 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
7935 /* Possibly limit visibility based on template args. */
7936 TREE_PUBLIC (type_decl
) = 1;
7937 determine_visibility (type_decl
);
7943 /* Wrapper for lookup_template_class_1. */
7946 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7947 int entering_scope
, tsubst_flags_t complain
)
7950 timevar_push (TV_TEMPLATE_INST
);
7951 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7952 entering_scope
, complain
);
7953 timevar_pop (TV_TEMPLATE_INST
);
7957 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
7960 lookup_template_variable (tree templ
, tree arglist
)
7962 return build2 (TEMPLATE_ID_EXPR
, TREE_TYPE (templ
), templ
, arglist
);
7969 /* True when we should also visit template parameters that occur in
7970 non-deduced contexts. */
7971 bool include_nondeduced_p
;
7972 hash_set
<tree
> *visited
;
7975 /* Called from for_each_template_parm via walk_tree. */
7978 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
7981 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
7982 tree_fn_t fn
= pfd
->fn
;
7983 void *data
= pfd
->data
;
7986 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
7987 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
7988 pfd
->include_nondeduced_p
))
7989 return error_mark_node
;
7991 switch (TREE_CODE (t
))
7994 if (TYPE_PTRMEMFUNC_P (t
))
8000 if (!TYPE_TEMPLATE_INFO (t
))
8002 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8003 fn
, data
, pfd
->visited
,
8004 pfd
->include_nondeduced_p
))
8005 return error_mark_node
;
8009 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8010 fn
, data
, pfd
->visited
,
8011 pfd
->include_nondeduced_p
)
8012 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8013 fn
, data
, pfd
->visited
,
8014 pfd
->include_nondeduced_p
))
8015 return error_mark_node
;
8019 /* Since we're not going to walk subtrees, we have to do this
8021 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8022 pfd
->visited
, pfd
->include_nondeduced_p
))
8023 return error_mark_node
;
8027 /* Check the return type. */
8028 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8029 pfd
->include_nondeduced_p
))
8030 return error_mark_node
;
8032 /* Check the parameter types. Since default arguments are not
8033 instantiated until they are needed, the TYPE_ARG_TYPES may
8034 contain expressions that involve template parameters. But,
8035 no-one should be looking at them yet. And, once they're
8036 instantiated, they don't contain template parameters, so
8037 there's no point in looking at them then, either. */
8041 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8042 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8043 pfd
->visited
, pfd
->include_nondeduced_p
))
8044 return error_mark_node
;
8046 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8047 want walk_tree walking into them itself. */
8053 case UNDERLYING_TYPE
:
8054 if (pfd
->include_nondeduced_p
8055 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
8057 pfd
->include_nondeduced_p
))
8058 return error_mark_node
;
8063 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8064 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8065 pfd
->visited
, pfd
->include_nondeduced_p
))
8066 return error_mark_node
;
8071 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8072 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8073 pfd
->visited
, pfd
->include_nondeduced_p
))
8074 return error_mark_node
;
8075 if (DECL_CONTEXT (t
)
8076 && pfd
->include_nondeduced_p
8077 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8078 pfd
->visited
, pfd
->include_nondeduced_p
))
8079 return error_mark_node
;
8082 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8083 /* Record template parameters such as `T' inside `TT<T>'. */
8084 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8085 pfd
->include_nondeduced_p
))
8086 return error_mark_node
;
8089 case TEMPLATE_TEMPLATE_PARM
:
8090 case TEMPLATE_TYPE_PARM
:
8091 case TEMPLATE_PARM_INDEX
:
8092 if (fn
&& (*fn
)(t
, data
))
8093 return error_mark_node
;
8095 return error_mark_node
;
8099 /* A template template parameter is encountered. */
8100 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8101 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8102 pfd
->include_nondeduced_p
))
8103 return error_mark_node
;
8105 /* Already substituted template template parameter */
8111 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8113 pfd
->include_nondeduced_p
))
8114 return error_mark_node
;
8118 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8119 && pfd
->include_nondeduced_p
8120 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8121 (TREE_TYPE (t
)), fn
, data
,
8122 pfd
->visited
, pfd
->include_nondeduced_p
))
8123 return error_mark_node
;
8128 /* If there's no type, then this thing must be some expression
8129 involving template parameters. */
8130 if (!fn
&& !TREE_TYPE (t
))
8131 return error_mark_node
;
8136 case IMPLICIT_CONV_EXPR
:
8137 case REINTERPRET_CAST_EXPR
:
8138 case CONST_CAST_EXPR
:
8139 case STATIC_CAST_EXPR
:
8140 case DYNAMIC_CAST_EXPR
:
8144 case PSEUDO_DTOR_EXPR
:
8146 return error_mark_node
;
8153 /* We didn't find any template parameters we liked. */
8157 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8158 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8159 call FN with the parameter and the DATA.
8160 If FN returns nonzero, the iteration is terminated, and
8161 for_each_template_parm returns 1. Otherwise, the iteration
8162 continues. If FN never returns a nonzero value, the value
8163 returned by for_each_template_parm is 0. If FN is NULL, it is
8164 considered to be the function which always returns 1.
8166 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8167 parameters that occur in non-deduced contexts. When false, only
8168 visits those template parameters that can be deduced. */
8171 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8172 hash_set
<tree
> *visited
,
8173 bool include_nondeduced_p
)
8175 struct pair_fn_data pfd
;
8181 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8183 /* Walk the tree. (Conceptually, we would like to walk without
8184 duplicates, but for_each_template_parm_r recursively calls
8185 for_each_template_parm, so we would need to reorganize a fair
8186 bit to use walk_tree_without_duplicates, so we keep our own
8189 pfd
.visited
= visited
;
8191 pfd
.visited
= new hash_set
<tree
>;
8192 result
= cp_walk_tree (&t
,
8193 for_each_template_parm_r
,
8195 pfd
.visited
) != NULL_TREE
;
8207 /* Returns true if T depends on any template parameter. */
8210 uses_template_parms (tree t
)
8213 int saved_processing_template_decl
;
8215 saved_processing_template_decl
= processing_template_decl
;
8216 if (!saved_processing_template_decl
)
8217 processing_template_decl
= 1;
8219 dependent_p
= dependent_type_p (t
);
8220 else if (TREE_CODE (t
) == TREE_VEC
)
8221 dependent_p
= any_dependent_template_arguments_p (t
);
8222 else if (TREE_CODE (t
) == TREE_LIST
)
8223 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8224 || uses_template_parms (TREE_CHAIN (t
)));
8225 else if (TREE_CODE (t
) == TYPE_DECL
)
8226 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8229 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8230 || TREE_CODE (t
) == OVERLOAD
8233 || TREE_CODE (t
) == TRAIT_EXPR
8234 || TREE_CODE (t
) == CONSTRUCTOR
8235 || CONSTANT_CLASS_P (t
))
8236 dependent_p
= (type_dependent_expression_p (t
)
8237 || value_dependent_expression_p (t
));
8240 gcc_assert (t
== error_mark_node
);
8241 dependent_p
= false;
8244 processing_template_decl
= saved_processing_template_decl
;
8249 /* Returns true iff current_function_decl is an incompletely instantiated
8250 template. Useful instead of processing_template_decl because the latter
8251 is set to 0 during fold_non_dependent_expr. */
8254 in_template_function (void)
8256 tree fn
= current_function_decl
;
8258 ++processing_template_decl
;
8259 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8260 && DECL_TEMPLATE_INFO (fn
)
8261 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8262 --processing_template_decl
;
8266 /* Returns true if T depends on any template parameter with level LEVEL. */
8269 uses_template_parms_level (tree t
, int level
)
8271 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8272 /*include_nondeduced_p=*/true);
8275 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8276 ill-formed translation unit, i.e. a variable or function that isn't
8277 usable in a constant expression. */
8280 neglectable_inst_p (tree d
)
8283 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8284 : decl_maybe_constant_var_p (d
)));
8287 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8288 neglectable and instantiated from within an erroneous instantiation. */
8291 limit_bad_template_recursion (tree decl
)
8293 struct tinst_level
*lev
= current_tinst_level
;
8294 int errs
= errorcount
+ sorrycount
;
8295 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8298 for (; lev
; lev
= lev
->next
)
8299 if (neglectable_inst_p (lev
->decl
))
8302 return (lev
&& errs
> lev
->errors
);
8305 static int tinst_depth
;
8306 extern int max_tinst_depth
;
8309 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8311 /* We're starting to instantiate D; record the template instantiation context
8312 for diagnostics and to restore it later. */
8315 push_tinst_level (tree d
)
8317 struct tinst_level
*new_level
;
8319 if (tinst_depth
>= max_tinst_depth
)
8321 last_error_tinst_level
= current_tinst_level
;
8322 if (TREE_CODE (d
) == TREE_LIST
)
8323 error ("template instantiation depth exceeds maximum of %d (use "
8324 "-ftemplate-depth= to increase the maximum) substituting %qS",
8325 max_tinst_depth
, d
);
8327 error ("template instantiation depth exceeds maximum of %d (use "
8328 "-ftemplate-depth= to increase the maximum) instantiating %qD",
8329 max_tinst_depth
, d
);
8331 print_instantiation_context ();
8336 /* If the current instantiation caused problems, don't let it instantiate
8337 anything else. Do allow deduction substitution and decls usable in
8338 constant expressions. */
8339 if (limit_bad_template_recursion (d
))
8342 new_level
= ggc_alloc
<tinst_level
> ();
8343 new_level
->decl
= d
;
8344 new_level
->locus
= input_location
;
8345 new_level
->errors
= errorcount
+sorrycount
;
8346 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8347 new_level
->next
= current_tinst_level
;
8348 current_tinst_level
= new_level
;
8351 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8352 depth_reached
= tinst_depth
;
8357 /* We're done instantiating this template; return to the instantiation
8361 pop_tinst_level (void)
8363 /* Restore the filename and line number stashed away when we started
8364 this instantiation. */
8365 input_location
= current_tinst_level
->locus
;
8366 current_tinst_level
= current_tinst_level
->next
;
8370 /* We're instantiating a deferred template; restore the template
8371 instantiation context in which the instantiation was requested, which
8372 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8375 reopen_tinst_level (struct tinst_level
*level
)
8377 struct tinst_level
*t
;
8380 for (t
= level
; t
; t
= t
->next
)
8383 current_tinst_level
= level
;
8385 if (current_tinst_level
)
8386 current_tinst_level
->errors
= errorcount
+sorrycount
;
8390 /* Returns the TINST_LEVEL which gives the original instantiation
8393 struct tinst_level
*
8394 outermost_tinst_level (void)
8396 struct tinst_level
*level
= current_tinst_level
;
8399 level
= level
->next
;
8403 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8404 vector of template arguments, as for tsubst.
8406 Returns an appropriate tsubst'd friend declaration. */
8409 tsubst_friend_function (tree decl
, tree args
)
8413 if (TREE_CODE (decl
) == FUNCTION_DECL
8414 && DECL_TEMPLATE_INSTANTIATION (decl
)
8415 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8416 /* This was a friend declared with an explicit template
8417 argument list, e.g.:
8421 to indicate that f was a template instantiation, not a new
8422 function declaration. Now, we have to figure out what
8423 instantiation of what template. */
8425 tree template_id
, arglist
, fns
;
8428 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8430 /* Friend functions are looked up in the containing namespace scope.
8431 We must enter that scope, to avoid finding member functions of the
8432 current class with same name. */
8433 push_nested_namespace (ns
);
8434 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8435 tf_warning_or_error
, NULL_TREE
,
8436 /*integral_constant_expression_p=*/false);
8437 pop_nested_namespace (ns
);
8438 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8439 tf_warning_or_error
, NULL_TREE
);
8440 template_id
= lookup_template_function (fns
, arglist
);
8442 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8443 tmpl
= determine_specialization (template_id
, new_friend
,
8445 /*need_member_template=*/0,
8446 TREE_VEC_LENGTH (args
),
8448 return instantiate_template (tmpl
, new_args
, tf_error
);
8451 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8453 /* The NEW_FRIEND will look like an instantiation, to the
8454 compiler, but is not an instantiation from the point of view of
8455 the language. For example, we might have had:
8457 template <class T> struct S {
8458 template <class U> friend void f(T, U);
8461 Then, in S<int>, template <class U> void f(int, U) is not an
8462 instantiation of anything. */
8463 if (new_friend
== error_mark_node
)
8464 return error_mark_node
;
8466 DECL_USE_TEMPLATE (new_friend
) = 0;
8467 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8469 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8470 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8471 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8474 /* The mangled name for the NEW_FRIEND is incorrect. The function
8475 is not a template instantiation and should not be mangled like
8476 one. Therefore, we forget the mangling here; we'll recompute it
8477 later if we need it. */
8478 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8480 SET_DECL_RTL (new_friend
, NULL
);
8481 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8484 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8487 tree new_friend_template_info
;
8488 tree new_friend_result_template_info
;
8490 int new_friend_is_defn
;
8492 /* We must save some information from NEW_FRIEND before calling
8493 duplicate decls since that function will free NEW_FRIEND if
8495 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8496 new_friend_is_defn
=
8497 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8498 (template_for_substitution (new_friend
)))
8500 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8502 /* This declaration is a `primary' template. */
8503 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8505 new_friend_result_template_info
8506 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8509 new_friend_result_template_info
= NULL_TREE
;
8511 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8512 if (new_friend_is_defn
)
8513 DECL_INITIAL (new_friend
) = error_mark_node
;
8515 /* Inside pushdecl_namespace_level, we will push into the
8516 current namespace. However, the friend function should go
8517 into the namespace of the template. */
8518 ns
= decl_namespace_context (new_friend
);
8519 push_nested_namespace (ns
);
8520 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8521 pop_nested_namespace (ns
);
8523 if (old_decl
== error_mark_node
)
8524 return error_mark_node
;
8526 if (old_decl
!= new_friend
)
8528 /* This new friend declaration matched an existing
8529 declaration. For example, given:
8531 template <class T> void f(T);
8532 template <class U> class C {
8533 template <class T> friend void f(T) {}
8536 the friend declaration actually provides the definition
8537 of `f', once C has been instantiated for some type. So,
8538 old_decl will be the out-of-class template declaration,
8539 while new_friend is the in-class definition.
8541 But, if `f' was called before this point, the
8542 instantiation of `f' will have DECL_TI_ARGS corresponding
8543 to `T' but not to `U', references to which might appear
8544 in the definition of `f'. Previously, the most general
8545 template for an instantiation of `f' was the out-of-class
8546 version; now it is the in-class version. Therefore, we
8547 run through all specialization of `f', adding to their
8548 DECL_TI_ARGS appropriately. In particular, they need a
8549 new set of outer arguments, corresponding to the
8550 arguments for this class instantiation.
8552 The same situation can arise with something like this:
8555 template <class T> class C {
8559 when `C<int>' is instantiated. Now, `f(int)' is defined
8562 if (!new_friend_is_defn
)
8563 /* On the other hand, if the in-class declaration does
8564 *not* provide a definition, then we don't want to alter
8565 existing definitions. We can just leave everything
8570 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8571 tree new_args
= TI_ARGS (new_friend_template_info
);
8573 /* Overwrite whatever template info was there before, if
8574 any, with the new template information pertaining to
8576 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8578 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8580 /* We should have called reregister_specialization in
8582 gcc_assert (retrieve_specialization (new_template
,
8586 /* Instantiate it if the global has already been used. */
8587 if (DECL_ODR_USED (old_decl
))
8588 instantiate_decl (old_decl
, /*defer_ok=*/true,
8589 /*expl_inst_class_mem_p=*/false);
8595 /* Indicate that the old function template is a partial
8597 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8598 = new_friend_result_template_info
;
8600 gcc_assert (new_template
8601 == most_general_template (new_template
));
8602 gcc_assert (new_template
!= old_decl
);
8604 /* Reassign any specializations already in the hash table
8605 to the new more general template, and add the
8606 additional template args. */
8607 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8611 tree spec
= TREE_VALUE (t
);
8614 elt
.tmpl
= old_decl
;
8615 elt
.args
= DECL_TI_ARGS (spec
);
8616 elt
.spec
= NULL_TREE
;
8618 htab_remove_elt (decl_specializations
, &elt
);
8621 = add_outermost_template_args (new_args
,
8622 DECL_TI_ARGS (spec
));
8624 register_specialization
8625 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8628 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8632 /* The information from NEW_FRIEND has been merged into OLD_DECL
8633 by duplicate_decls. */
8634 new_friend
= old_decl
;
8639 tree context
= DECL_CONTEXT (new_friend
);
8643 template <class T> class C {
8644 template <class U> friend void C1<U>::f (); // case 1
8645 friend void C2<T>::f (); // case 2
8647 we only need to make sure CONTEXT is a complete type for
8648 case 2. To distinguish between the two cases, we note that
8649 CONTEXT of case 1 remains dependent type after tsubst while
8650 this isn't true for case 2. */
8651 ++processing_template_decl
;
8652 dependent_p
= dependent_type_p (context
);
8653 --processing_template_decl
;
8656 && !complete_type_or_else (context
, NULL_TREE
))
8657 return error_mark_node
;
8659 if (COMPLETE_TYPE_P (context
))
8661 tree fn
= new_friend
;
8662 /* do_friend adds the TEMPLATE_DECL for any member friend
8663 template even if it isn't a member template, i.e.
8664 template <class T> friend A<T>::f();
8665 Look through it in that case. */
8666 if (TREE_CODE (fn
) == TEMPLATE_DECL
8667 && !PRIMARY_TEMPLATE_P (fn
))
8668 fn
= DECL_TEMPLATE_RESULT (fn
);
8669 /* Check to see that the declaration is really present, and,
8670 possibly obtain an improved declaration. */
8671 fn
= check_classfn (context
, fn
, NULL_TREE
);
8681 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8682 template arguments, as for tsubst.
8684 Returns an appropriate tsubst'd friend type or error_mark_node on
8688 tsubst_friend_class (tree friend_tmpl
, tree args
)
8694 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8696 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8697 return TREE_TYPE (t
);
8700 context
= CP_DECL_CONTEXT (friend_tmpl
);
8702 if (context
!= global_namespace
)
8704 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8705 push_nested_namespace (context
);
8707 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8710 /* Look for a class template declaration. We look for hidden names
8711 because two friend declarations of the same template are the
8712 same. For example, in:
8715 template <typename> friend class F;
8717 template <typename> struct B {
8718 template <typename> friend class F;
8721 both F templates are the same. */
8722 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8723 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8725 /* But, if we don't find one, it might be because we're in a
8726 situation like this:
8734 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8735 for `S<int>', not the TEMPLATE_DECL. */
8736 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8738 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8739 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8742 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8744 /* The friend template has already been declared. Just
8745 check to see that the declarations match, and install any new
8746 default parameters. We must tsubst the default parameters,
8747 of course. We only need the innermost template parameters
8748 because that is all that redeclare_class_template will look
8750 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8751 > TMPL_ARGS_DEPTH (args
))
8754 location_t saved_input_location
;
8755 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8756 args
, tf_warning_or_error
);
8758 saved_input_location
= input_location
;
8759 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8760 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8761 input_location
= saved_input_location
;
8765 friend_type
= TREE_TYPE (tmpl
);
8769 /* The friend template has not already been declared. In this
8770 case, the instantiation of the template class will cause the
8771 injection of this template into the global scope. */
8772 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8773 if (tmpl
== error_mark_node
)
8774 return error_mark_node
;
8776 /* The new TMPL is not an instantiation of anything, so we
8777 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8778 the new type because that is supposed to be the corresponding
8779 template decl, i.e., TMPL. */
8780 DECL_USE_TEMPLATE (tmpl
) = 0;
8781 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8782 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8783 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8784 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8786 /* Inject this template into the global scope. */
8787 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8790 if (context
!= global_namespace
)
8792 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8793 pop_nested_namespace (context
);
8795 pop_nested_class ();
8801 /* Returns zero if TYPE cannot be completed later due to circularity.
8802 Otherwise returns one. */
8805 can_complete_type_without_circularity (tree type
)
8807 if (type
== NULL_TREE
|| type
== error_mark_node
)
8809 else if (COMPLETE_TYPE_P (type
))
8811 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8812 return can_complete_type_without_circularity (TREE_TYPE (type
));
8813 else if (CLASS_TYPE_P (type
)
8814 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8820 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
8822 /* Apply any attributes which had to be deferred until instantiation
8823 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8824 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8827 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8828 tree args
, tsubst_flags_t complain
, tree in_decl
)
8830 tree last_dep
= NULL_TREE
;
8834 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8835 if (ATTR_IS_DEPENDENT (t
))
8838 attributes
= copy_list (attributes
);
8842 if (DECL_P (*decl_p
))
8844 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8846 p
= &DECL_ATTRIBUTES (*decl_p
);
8849 p
= &TYPE_ATTRIBUTES (*decl_p
);
8853 tree late_attrs
= NULL_TREE
;
8854 tree
*q
= &late_attrs
;
8856 for (*p
= attributes
; *p
; )
8859 if (ATTR_IS_DEPENDENT (t
))
8861 *p
= TREE_CHAIN (t
);
8862 TREE_CHAIN (t
) = NULL_TREE
;
8863 if ((flag_openmp
|| flag_cilkplus
)
8864 && is_attribute_p ("omp declare simd",
8865 get_attribute_name (t
))
8868 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
8869 clauses
= tsubst_omp_clauses (clauses
, true, args
,
8871 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
8872 clauses
= finish_omp_clauses (clauses
);
8873 tree parms
= DECL_ARGUMENTS (*decl_p
);
8875 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
8877 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
8879 TREE_VALUE (t
) = NULL_TREE
;
8881 /* If the first attribute argument is an identifier, don't
8882 pass it through tsubst. Attributes like mode, format,
8883 cleanup and several target specific attributes expect it
8885 else if (attribute_takes_identifier_p (get_attribute_name (t
))
8889 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8891 /*integral_constant_expression_p=*/false);
8892 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8894 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8899 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8900 /*integral_constant_expression_p=*/false);
8902 q
= &TREE_CHAIN (t
);
8905 p
= &TREE_CHAIN (t
);
8908 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8912 /* Perform (or defer) access check for typedefs that were referenced
8913 from within the template TMPL code.
8914 This is a subroutine of instantiate_decl and instantiate_class_template.
8915 TMPL is the template to consider and TARGS is the list of arguments of
8919 perform_typedefs_access_check (tree tmpl
, tree targs
)
8921 location_t saved_location
;
8923 qualified_typedef_usage_t
*iter
;
8926 || (!CLASS_TYPE_P (tmpl
)
8927 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8930 saved_location
= input_location
;
8931 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8933 tree type_decl
= iter
->typedef_decl
;
8934 tree type_scope
= iter
->context
;
8936 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8939 if (uses_template_parms (type_decl
))
8940 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8941 if (uses_template_parms (type_scope
))
8942 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8944 /* Make access check error messages point to the location
8945 of the use of the typedef. */
8946 input_location
= iter
->locus
;
8947 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8948 type_decl
, type_decl
,
8949 tf_warning_or_error
);
8951 input_location
= saved_location
;
8955 instantiate_class_template_1 (tree type
)
8957 tree templ
, args
, pattern
, t
, member
;
8961 unsigned int saved_maximum_field_alignment
;
8964 if (type
== error_mark_node
)
8965 return error_mark_node
;
8967 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8968 || uses_template_parms (type
))
8971 /* Figure out which template is being instantiated. */
8972 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8973 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8975 /* Determine what specialization of the original template to
8977 t
= most_specialized_class (type
, tf_warning_or_error
);
8978 if (t
== error_mark_node
)
8980 TYPE_BEING_DEFINED (type
) = 1;
8981 return error_mark_node
;
8985 /* This TYPE is actually an instantiation of a partial
8986 specialization. We replace the innermost set of ARGS with
8987 the arguments appropriate for substitution. For example,
8990 template <class T> struct S {};
8991 template <class T> struct S<T*> {};
8993 and supposing that we are instantiating S<int*>, ARGS will
8994 presently be {int*} -- but we need {int}. */
8995 pattern
= TREE_TYPE (t
);
8996 args
= TREE_PURPOSE (t
);
9000 pattern
= TREE_TYPE (templ
);
9001 args
= CLASSTYPE_TI_ARGS (type
);
9004 /* If the template we're instantiating is incomplete, then clearly
9005 there's nothing we can do. */
9006 if (!COMPLETE_TYPE_P (pattern
))
9009 /* If we've recursively instantiated too many templates, stop. */
9010 if (! push_tinst_level (type
))
9013 /* Now we're really doing the instantiation. Mark the type as in
9014 the process of being defined. */
9015 TYPE_BEING_DEFINED (type
) = 1;
9017 /* We may be in the middle of deferred access check. Disable
9019 push_deferring_access_checks (dk_no_deferred
);
9021 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9022 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9023 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9024 fn_context
= error_mark_node
;
9026 push_to_top_level ();
9027 /* Use #pragma pack from the template context. */
9028 saved_maximum_field_alignment
= maximum_field_alignment
;
9029 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9031 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9033 /* Set the input location to the most specialized template definition.
9034 This is needed if tsubsting causes an error. */
9035 typedecl
= TYPE_MAIN_DECL (pattern
);
9036 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9037 DECL_SOURCE_LOCATION (typedecl
);
9039 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9040 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9041 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9042 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9043 if (ANON_AGGR_TYPE_P (pattern
))
9044 SET_ANON_AGGR_TYPE_P (type
);
9045 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9047 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9048 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9049 /* Adjust visibility for template arguments. */
9050 determine_visibility (TYPE_MAIN_DECL (type
));
9052 if (CLASS_TYPE_P (type
))
9053 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9055 pbinfo
= TYPE_BINFO (pattern
);
9057 /* We should never instantiate a nested class before its enclosing
9058 class; we need to look up the nested class by name before we can
9059 instantiate it, and that lookup should instantiate the enclosing
9061 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9062 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9064 base_list
= NULL_TREE
;
9065 if (BINFO_N_BASE_BINFOS (pbinfo
))
9071 /* We must enter the scope containing the type, as that is where
9072 the accessibility of types named in dependent bases are
9074 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9076 /* Substitute into each of the bases to determine the actual
9078 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9081 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9082 tree expanded_bases
= NULL_TREE
;
9085 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9088 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9089 args
, tf_error
, NULL_TREE
);
9090 if (expanded_bases
== error_mark_node
)
9093 len
= TREE_VEC_LENGTH (expanded_bases
);
9096 for (idx
= 0; idx
< len
; idx
++)
9099 /* Extract the already-expanded base class. */
9100 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9102 /* Substitute to figure out the base class. */
9103 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9106 if (base
== error_mark_node
)
9109 base_list
= tree_cons (access
, base
, base_list
);
9110 if (BINFO_VIRTUAL_P (pbase_binfo
))
9111 TREE_TYPE (base_list
) = integer_type_node
;
9115 /* The list is now in reverse order; correct that. */
9116 base_list
= nreverse (base_list
);
9119 pop_scope (pushed_scope
);
9121 /* Now call xref_basetypes to set up all the base-class
9123 xref_basetypes (type
, base_list
);
9125 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9126 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9127 args
, tf_error
, NULL_TREE
);
9128 fixup_attribute_variants (type
);
9130 /* Now that our base classes are set up, enter the scope of the
9131 class, so that name lookups into base classes, etc. will work
9132 correctly. This is precisely analogous to what we do in
9133 begin_class_definition when defining an ordinary non-template
9134 class, except we also need to push the enclosing classes. */
9135 push_nested_class (type
);
9137 /* Now members are processed in the order of declaration. */
9138 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9139 member
; member
= TREE_CHAIN (member
))
9141 tree t
= TREE_VALUE (member
);
9143 if (TREE_PURPOSE (member
))
9147 /* Build new CLASSTYPE_NESTED_UTDS. */
9150 bool class_template_p
;
9152 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9153 && TYPE_LANG_SPECIFIC (t
)
9154 && CLASSTYPE_IS_TEMPLATE (t
));
9155 /* If the member is a class template, then -- even after
9156 substitution -- there may be dependent types in the
9157 template argument list for the class. We increment
9158 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9159 that function will assume that no types are dependent
9160 when outside of a template. */
9161 if (class_template_p
)
9162 ++processing_template_decl
;
9163 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9164 if (class_template_p
)
9165 --processing_template_decl
;
9166 if (newtag
== error_mark_node
)
9169 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9171 tree name
= TYPE_IDENTIFIER (t
);
9173 if (class_template_p
)
9174 /* Unfortunately, lookup_template_class sets
9175 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9176 instantiation (i.e., for the type of a member
9177 template class nested within a template class.)
9178 This behavior is required for
9179 maybe_process_partial_specialization to work
9180 correctly, but is not accurate in this case;
9181 the TAG is not an instantiation of anything.
9182 (The corresponding TEMPLATE_DECL is an
9183 instantiation, but the TYPE is not.) */
9184 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9186 /* Now, we call pushtag to put this NEWTAG into the scope of
9187 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9188 pushtag calling push_template_decl. We don't have to do
9189 this for enums because it will already have been done in
9192 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9193 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9196 else if (DECL_DECLARES_FUNCTION_P (t
))
9198 /* Build new TYPE_METHODS. */
9201 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9202 ++processing_template_decl
;
9203 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9204 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9205 --processing_template_decl
;
9206 set_current_access_from_decl (r
);
9207 finish_member_declaration (r
);
9208 /* Instantiate members marked with attribute used. */
9209 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9211 if (TREE_CODE (r
) == FUNCTION_DECL
9212 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9213 cp_check_omp_declare_reduction (r
);
9217 /* Build new TYPE_FIELDS. */
9218 if (TREE_CODE (t
) == STATIC_ASSERT
)
9222 ++c_inhibit_evaluation_warnings
;
9224 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9225 tf_warning_or_error
, NULL_TREE
,
9226 /*integral_constant_expression_p=*/true);
9227 --c_inhibit_evaluation_warnings
;
9229 finish_static_assert (condition
,
9230 STATIC_ASSERT_MESSAGE (t
),
9231 STATIC_ASSERT_SOURCE_LOCATION (t
),
9234 else if (TREE_CODE (t
) != CONST_DECL
)
9237 tree vec
= NULL_TREE
;
9240 /* The file and line for this declaration, to
9241 assist in error message reporting. Since we
9242 called push_tinst_level above, we don't need to
9244 input_location
= DECL_SOURCE_LOCATION (t
);
9246 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9247 ++processing_template_decl
;
9248 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9249 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9250 --processing_template_decl
;
9252 if (TREE_CODE (r
) == TREE_VEC
)
9254 /* A capture pack became multiple fields. */
9256 len
= TREE_VEC_LENGTH (vec
);
9259 for (int i
= 0; i
< len
; ++i
)
9262 r
= TREE_VEC_ELT (vec
, i
);
9267 [t]he initialization (and any associated
9268 side-effects) of a static data member does
9269 not occur unless the static data member is
9270 itself used in a way that requires the
9271 definition of the static data member to
9274 Therefore, we do not substitute into the
9275 initialized for the static data member here. */
9276 finish_static_data_member_decl
9279 /*init_const_expr_p=*/false,
9280 /*asmspec_tree=*/NULL_TREE
,
9282 /* Instantiate members marked with attribute used. */
9283 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9286 else if (TREE_CODE (r
) == FIELD_DECL
)
9288 /* Determine whether R has a valid type and can be
9289 completed later. If R is invalid, then its type
9290 is replaced by error_mark_node. */
9291 tree rtype
= TREE_TYPE (r
);
9292 if (can_complete_type_without_circularity (rtype
))
9293 complete_type (rtype
);
9295 if (!COMPLETE_TYPE_P (rtype
))
9297 cxx_incomplete_type_error (r
, rtype
);
9298 TREE_TYPE (r
) = error_mark_node
;
9302 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9303 such a thing will already have been added to the field
9304 list by tsubst_enum in finish_member_declaration in the
9305 CLASSTYPE_NESTED_UTDS case above. */
9306 if (!(TREE_CODE (r
) == TYPE_DECL
9307 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9308 && DECL_ARTIFICIAL (r
)))
9310 set_current_access_from_decl (r
);
9311 finish_member_declaration (r
);
9319 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9320 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9322 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9324 tree friend_type
= t
;
9325 bool adjust_processing_template_decl
= false;
9327 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9329 /* template <class T> friend class C; */
9330 friend_type
= tsubst_friend_class (friend_type
, args
);
9331 adjust_processing_template_decl
= true;
9333 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9335 /* template <class T> friend class C::D; */
9336 friend_type
= tsubst (friend_type
, args
,
9337 tf_warning_or_error
, NULL_TREE
);
9338 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9339 friend_type
= TREE_TYPE (friend_type
);
9340 adjust_processing_template_decl
= true;
9342 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9343 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9345 /* This could be either
9349 when dependent_type_p is false or
9351 template <class U> friend class T::C;
9354 friend_type
= tsubst (friend_type
, args
,
9355 tf_warning_or_error
, NULL_TREE
);
9356 /* Bump processing_template_decl for correct
9357 dependent_type_p calculation. */
9358 ++processing_template_decl
;
9359 if (dependent_type_p (friend_type
))
9360 adjust_processing_template_decl
= true;
9361 --processing_template_decl
;
9363 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9364 && hidden_name_p (TYPE_NAME (friend_type
)))
9368 where C hasn't been declared yet. Let's lookup name
9369 from namespace scope directly, bypassing any name that
9370 come from dependent base class. */
9371 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9373 /* The call to xref_tag_from_type does injection for friend
9375 push_nested_namespace (ns
);
9377 xref_tag_from_type (friend_type
, NULL_TREE
,
9378 /*tag_scope=*/ts_current
);
9379 pop_nested_namespace (ns
);
9381 else if (uses_template_parms (friend_type
))
9382 /* friend class C<T>; */
9383 friend_type
= tsubst (friend_type
, args
,
9384 tf_warning_or_error
, NULL_TREE
);
9389 where C is already declared or
9391 friend class C<int>;
9393 We don't have to do anything in these cases. */
9395 if (adjust_processing_template_decl
)
9396 /* Trick make_friend_class into realizing that the friend
9397 we're adding is a template, not an ordinary class. It's
9398 important that we use make_friend_class since it will
9399 perform some error-checking and output cross-reference
9401 ++processing_template_decl
;
9403 if (friend_type
!= error_mark_node
)
9404 make_friend_class (type
, friend_type
, /*complain=*/false);
9406 if (adjust_processing_template_decl
)
9407 --processing_template_decl
;
9411 /* Build new DECL_FRIENDLIST. */
9414 /* The file and line for this declaration, to
9415 assist in error message reporting. Since we
9416 called push_tinst_level above, we don't need to
9418 input_location
= DECL_SOURCE_LOCATION (t
);
9420 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9422 ++processing_template_decl
;
9423 push_deferring_access_checks (dk_no_check
);
9426 r
= tsubst_friend_function (t
, args
);
9427 add_friend (type
, r
, /*complain=*/false);
9428 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9430 pop_deferring_access_checks ();
9431 --processing_template_decl
;
9437 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9439 tree decl
= lambda_function (type
);
9442 if (!DECL_TEMPLATE_INFO (decl
)
9443 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9444 instantiate_decl (decl
, false, false);
9446 /* We need to instantiate the capture list from the template
9447 after we've instantiated the closure members, but before we
9448 consider adding the conversion op. Also keep any captures
9449 that may have been added during instantiation of the op(). */
9450 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9452 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9453 args
, tf_warning_or_error
, NULL_TREE
,
9456 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9457 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9459 maybe_add_lambda_conv_op (type
);
9462 gcc_assert (errorcount
);
9465 /* Set the file and line number information to whatever is given for
9466 the class itself. This puts error messages involving generated
9467 implicit functions at a predictable point, and the same point
9468 that would be used for non-template classes. */
9469 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9471 unreverse_member_declarations (type
);
9472 finish_struct_1 (type
);
9473 TYPE_BEING_DEFINED (type
) = 0;
9475 /* We don't instantiate default arguments for member functions. 14.7.1:
9477 The implicit instantiation of a class template specialization causes
9478 the implicit instantiation of the declarations, but not of the
9479 definitions or default arguments, of the class member functions,
9480 member classes, static data members and member templates.... */
9482 /* Some typedefs referenced from within the template code need to be access
9483 checked at template instantiation time, i.e now. These types were
9484 added to the template at parsing time. Let's get those and perform
9485 the access checks then. */
9486 perform_typedefs_access_check (pattern
, args
);
9487 perform_deferred_access_checks (tf_warning_or_error
);
9488 pop_nested_class ();
9489 maximum_field_alignment
= saved_maximum_field_alignment
;
9491 pop_from_top_level ();
9492 pop_deferring_access_checks ();
9495 /* The vtable for a template class can be emitted in any translation
9496 unit in which the class is instantiated. When there is no key
9497 method, however, finish_struct_1 will already have added TYPE to
9498 the keyed_classes list. */
9499 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9500 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9505 /* Wrapper for instantiate_class_template_1. */
9508 instantiate_class_template (tree type
)
9511 timevar_push (TV_TEMPLATE_INST
);
9512 ret
= instantiate_class_template_1 (type
);
9513 timevar_pop (TV_TEMPLATE_INST
);
9518 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9524 else if (TYPE_P (t
))
9525 r
= tsubst (t
, args
, complain
, in_decl
);
9528 if (!(complain
& tf_warning
))
9529 ++c_inhibit_evaluation_warnings
;
9530 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9531 /*integral_constant_expression_p=*/true);
9532 if (!(complain
& tf_warning
))
9533 --c_inhibit_evaluation_warnings
;
9538 /* Given a function parameter pack TMPL_PARM and some function parameters
9539 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9540 and set *SPEC_P to point at the next point in the list. */
9543 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9545 /* Collect all of the extra "packed" parameters into an
9549 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9550 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9551 tree spec_parm
= *spec_p
;
9554 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9556 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9559 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9560 parmvec
= make_tree_vec (len
);
9561 parmtypevec
= make_tree_vec (len
);
9562 spec_parm
= *spec_p
;
9563 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9565 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9566 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9569 /* Build the argument packs. */
9570 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9571 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9572 TREE_TYPE (argpack
) = argtypepack
;
9573 *spec_p
= spec_parm
;
9578 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9579 NONTYPE_ARGUMENT_PACK. */
9582 make_fnparm_pack (tree spec_parm
)
9584 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9587 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9591 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9593 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9594 if (i
>= TREE_VEC_LENGTH (vec
))
9596 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9600 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9603 make_argument_pack_select (tree arg_pack
, unsigned index
)
9605 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9607 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9608 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9613 /* This is a subroutine of tsubst_pack_expansion.
9615 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9616 mechanism to store the (non complete list of) arguments of the
9617 substitution and return a non substituted pack expansion, in order
9618 to wait for when we have enough arguments to really perform the
9622 use_pack_expansion_extra_args_p (tree parm_packs
,
9626 /* If one pack has an expansion and another pack has a normal
9627 argument or if one pack has an empty argument and an another
9628 one hasn't then tsubst_pack_expansion cannot perform the
9629 substitution and need to fall back on the
9630 PACK_EXPANSION_EXTRA mechanism. */
9631 if (parm_packs
== NULL_TREE
)
9633 else if (has_empty_arg
)
9636 bool has_expansion_arg
= false;
9637 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9639 bool has_non_expansion_arg
= false;
9640 for (tree parm_pack
= parm_packs
;
9642 parm_pack
= TREE_CHAIN (parm_pack
))
9644 tree arg
= TREE_VALUE (parm_pack
);
9646 if (argument_pack_element_is_expansion_p (arg
, i
))
9647 has_expansion_arg
= true;
9649 has_non_expansion_arg
= true;
9652 if (has_expansion_arg
&& has_non_expansion_arg
)
9658 /* [temp.variadic]/6 says that:
9660 The instantiation of a pack expansion [...]
9661 produces a list E1,E2, ..., En, where N is the number of elements
9662 in the pack expansion parameters.
9664 This subroutine of tsubst_pack_expansion produces one of these Ei.
9666 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9667 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9668 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9669 INDEX is the index 'i' of the element Ei to produce. ARGS,
9670 COMPLAIN, and IN_DECL are the same parameters as for the
9671 tsubst_pack_expansion function.
9673 The function returns the resulting Ei upon successful completion,
9676 Note that this function possibly modifies the ARGS parameter, so
9677 it's the responsibility of the caller to restore it. */
9680 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9683 tree args
/* This parm gets
9685 tsubst_flags_t complain
,
9689 bool ith_elem_is_expansion
= false;
9691 /* For each parameter pack, change the substitution of the parameter
9692 pack to the ith argument in its argument pack, then expand the
9694 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9696 tree parm
= TREE_PURPOSE (pack
);
9697 tree arg_pack
= TREE_VALUE (pack
);
9698 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9700 ith_elem_is_expansion
|=
9701 argument_pack_element_is_expansion_p (arg_pack
, index
);
9703 /* Select the Ith argument from the pack. */
9704 if (TREE_CODE (parm
) == PARM_DECL
9705 || TREE_CODE (parm
) == FIELD_DECL
)
9709 aps
= make_argument_pack_select (arg_pack
, index
);
9711 register_local_specialization (aps
, parm
);
9714 aps
= retrieve_local_specialization (parm
);
9719 template_parm_level_and_index (parm
, &level
, &idx
);
9723 aps
= make_argument_pack_select (arg_pack
, index
);
9724 /* Update the corresponding argument. */
9725 TMPL_ARG (args
, level
, idx
) = aps
;
9728 /* Re-use the ARGUMENT_PACK_SELECT. */
9729 aps
= TMPL_ARG (args
, level
, idx
);
9731 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9734 /* Substitute into the PATTERN with the (possibly altered)
9736 if (pattern
== in_decl
)
9737 /* Expanding a fixed parameter pack from
9738 coerce_template_parameter_pack. */
9739 t
= tsubst_decl (pattern
, args
, complain
);
9740 else if (!TYPE_P (pattern
))
9741 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9742 /*integral_constant_expression_p=*/false);
9744 t
= tsubst (pattern
, args
, complain
, in_decl
);
9746 /* If the Ith argument pack element is a pack expansion, then
9747 the Ith element resulting from the substituting is going to
9748 be a pack expansion as well. */
9749 if (ith_elem_is_expansion
)
9750 t
= make_pack_expansion (t
);
9755 /* Substitute ARGS into T, which is an pack expansion
9756 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9757 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9758 (if only a partial substitution could be performed) or
9759 ERROR_MARK_NODE if there was an error. */
9761 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9765 tree pack
, packs
= NULL_TREE
;
9766 bool unsubstituted_packs
= false;
9769 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
9770 bool need_local_specializations
= false;
9773 gcc_assert (PACK_EXPANSION_P (t
));
9774 pattern
= PACK_EXPANSION_PATTERN (t
);
9776 /* Add in any args remembered from an earlier partial instantiation. */
9777 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9779 levels
= TMPL_ARGS_DEPTH (args
);
9781 /* Determine the argument packs that will instantiate the parameter
9782 packs used in the expansion expression. While we're at it,
9783 compute the number of arguments to be expanded and make sure it
9785 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9786 pack
= TREE_CHAIN (pack
))
9788 tree parm_pack
= TREE_VALUE (pack
);
9789 tree arg_pack
= NULL_TREE
;
9790 tree orig_arg
= NULL_TREE
;
9793 if (TREE_CODE (parm_pack
) == BASES
)
9795 if (BASES_DIRECT (parm_pack
))
9796 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9797 args
, complain
, in_decl
, false));
9799 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9800 args
, complain
, in_decl
, false));
9802 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9804 if (PACK_EXPANSION_LOCAL_P (t
))
9805 arg_pack
= retrieve_local_specialization (parm_pack
);
9808 /* We can't rely on local_specializations for a parameter
9809 name used later in a function declaration (such as in a
9810 late-specified return type). Even if it exists, it might
9811 have the wrong value for a recursive call. Just make a
9812 dummy decl, since it's only used for its type. */
9813 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9814 if (arg_pack
&& DECL_PACK_P (arg_pack
))
9815 /* Partial instantiation of the parm_pack, we can't build
9816 up an argument pack yet. */
9817 arg_pack
= NULL_TREE
;
9819 arg_pack
= make_fnparm_pack (arg_pack
);
9820 need_local_specializations
= true;
9823 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
9824 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
9828 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9830 if (level
<= levels
)
9831 arg_pack
= TMPL_ARG (args
, level
, idx
);
9834 orig_arg
= arg_pack
;
9835 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9836 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9838 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9839 /* This can only happen if we forget to expand an argument
9840 pack somewhere else. Just return an error, silently. */
9842 result
= make_tree_vec (1);
9843 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9850 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9852 /* Don't bother trying to do a partial substitution with
9853 incomplete packs; we'll try again after deduction. */
9854 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9859 else if (len
!= my_len
)
9861 if (!(complain
& tf_error
))
9862 /* Fail quietly. */;
9863 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9864 error ("mismatched argument pack lengths while expanding "
9868 error ("mismatched argument pack lengths while expanding "
9871 return error_mark_node
;
9874 /* Keep track of the parameter packs and their corresponding
9876 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9877 TREE_TYPE (packs
) = orig_arg
;
9881 /* We can't substitute for this parameter pack. We use a flag as
9882 well as the missing_level counter because function parameter
9883 packs don't have a level. */
9884 unsubstituted_packs
= true;
9888 /* We cannot expand this expansion expression, because we don't have
9889 all of the argument packs we need. */
9890 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9892 /* We got some full packs, but we can't substitute them in until we
9893 have values for all the packs. So remember these until then. */
9895 t
= make_pack_expansion (pattern
);
9896 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9899 else if (unsubstituted_packs
)
9901 /* There were no real arguments, we're just replacing a parameter
9902 pack with another version of itself. Substitute into the
9903 pattern and return a PACK_EXPANSION_*. The caller will need to
9905 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9906 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9907 /*integral_constant_expression_p=*/false);
9909 t
= tsubst (pattern
, args
, complain
, in_decl
);
9910 t
= make_pack_expansion (t
);
9914 gcc_assert (len
>= 0);
9916 if (need_local_specializations
)
9918 /* We're in a late-specified return type, so create our own local
9919 specializations map; the current map is either NULL or (in the
9920 case of recursive unification) might have bindings that we don't
9921 want to use or alter. */
9922 saved_local_specializations
= local_specializations
;
9923 local_specializations
= new hash_map
<tree
, tree
>;
9926 /* For each argument in each argument pack, substitute into the
9928 result
= make_tree_vec (len
);
9929 for (i
= 0; i
< len
; ++i
)
9931 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9935 TREE_VEC_ELT (result
, i
) = t
;
9936 if (t
== error_mark_node
)
9938 result
= error_mark_node
;
9943 /* Update ARGS to restore the substitution from parameter packs to
9944 their argument packs. */
9945 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9947 tree parm
= TREE_PURPOSE (pack
);
9949 if (TREE_CODE (parm
) == PARM_DECL
9950 || TREE_CODE (parm
) == FIELD_DECL
)
9951 register_local_specialization (TREE_TYPE (pack
), parm
);
9956 if (TREE_VALUE (pack
) == NULL_TREE
)
9959 template_parm_level_and_index (parm
, &level
, &idx
);
9961 /* Update the corresponding argument. */
9962 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9963 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9966 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9970 if (need_local_specializations
)
9972 delete local_specializations
;
9973 local_specializations
= saved_local_specializations
;
9979 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
9980 TMPL. We do this using DECL_PARM_INDEX, which should work even with
9981 parameter packs; all parms generated from a function parameter pack will
9982 have the same DECL_PARM_INDEX. */
9985 get_pattern_parm (tree parm
, tree tmpl
)
9987 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9990 if (DECL_ARTIFICIAL (parm
))
9992 for (patparm
= DECL_ARGUMENTS (pattern
);
9993 patparm
; patparm
= DECL_CHAIN (patparm
))
9994 if (DECL_ARTIFICIAL (patparm
)
9995 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10000 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10001 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10002 gcc_assert (DECL_PARM_INDEX (patparm
)
10003 == DECL_PARM_INDEX (parm
));
10009 /* Substitute ARGS into the vector or list of template arguments T. */
10012 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10015 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10018 if (t
== error_mark_node
)
10019 return error_mark_node
;
10021 len
= TREE_VEC_LENGTH (t
);
10022 elts
= XALLOCAVEC (tree
, len
);
10024 for (i
= 0; i
< len
; i
++)
10026 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10029 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10030 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10031 else if (PACK_EXPANSION_P (orig_arg
))
10033 /* Substitute into an expansion expression. */
10034 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10036 if (TREE_CODE (new_arg
) == TREE_VEC
)
10037 /* Add to the expanded length adjustment the number of
10038 expanded arguments. We subtract one from this
10039 measurement, because the argument pack expression
10040 itself is already counted as 1 in
10041 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10042 the argument pack is empty. */
10043 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10045 else if (ARGUMENT_PACK_P (orig_arg
))
10047 /* Substitute into each of the arguments. */
10048 new_arg
= TYPE_P (orig_arg
)
10049 ? cxx_make_type (TREE_CODE (orig_arg
))
10050 : make_node (TREE_CODE (orig_arg
));
10052 SET_ARGUMENT_PACK_ARGS (
10054 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10055 args
, complain
, in_decl
));
10057 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10058 new_arg
= error_mark_node
;
10060 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10061 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10062 complain
, in_decl
);
10063 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10065 if (TREE_TYPE (new_arg
) == error_mark_node
)
10066 new_arg
= error_mark_node
;
10070 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10072 if (new_arg
== error_mark_node
)
10073 return error_mark_node
;
10076 if (new_arg
!= orig_arg
)
10083 /* Make space for the expanded arguments coming from template
10085 t
= make_tree_vec (len
+ expanded_len_adjust
);
10086 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10087 arguments for a member template.
10088 In that case each TREE_VEC in ORIG_T represents a level of template
10089 arguments, and ORIG_T won't carry any non defaulted argument count.
10090 It will rather be the nested TREE_VECs that will carry one.
10091 In other words, ORIG_T carries a non defaulted argument count only
10092 if it doesn't contain any nested TREE_VEC. */
10093 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10095 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10096 count
+= expanded_len_adjust
;
10097 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10099 for (i
= 0, out
= 0; i
< len
; i
++)
10101 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10102 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10103 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10107 /* Now expand the template argument pack "in place". */
10108 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10109 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10113 TREE_VEC_ELT (t
, out
) = elts
[i
];
10121 /* Return the result of substituting ARGS into the template parameters
10122 given by PARMS. If there are m levels of ARGS and m + n levels of
10123 PARMS, then the result will contain n levels of PARMS. For
10124 example, if PARMS is `template <class T> template <class U>
10125 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10126 result will be `template <int*, double, class V>'. */
10129 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10131 tree r
= NULL_TREE
;
10134 /* When substituting into a template, we must set
10135 PROCESSING_TEMPLATE_DECL as the template parameters may be
10136 dependent if they are based on one-another, and the dependency
10137 predicates are short-circuit outside of templates. */
10138 ++processing_template_decl
;
10140 for (new_parms
= &r
;
10141 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10142 new_parms
= &(TREE_CHAIN (*new_parms
)),
10143 parms
= TREE_CHAIN (parms
))
10146 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10149 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10153 if (parms
== error_mark_node
)
10156 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10158 if (tuple
== error_mark_node
)
10161 TREE_VEC_ELT (new_vec
, i
) =
10162 tsubst_template_parm (tuple
, args
, complain
);
10166 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10167 - TMPL_ARGS_DEPTH (args
)),
10168 new_vec
, NULL_TREE
);
10171 --processing_template_decl
;
10176 /* Return the result of substituting ARGS into one template parameter
10177 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10178 parameter and which TREE_PURPOSE is the default argument of the
10179 template parameter. */
10182 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10184 tree default_value
, parm_decl
;
10186 if (args
== NULL_TREE
10188 || t
== error_mark_node
)
10191 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10193 default_value
= TREE_PURPOSE (t
);
10194 parm_decl
= TREE_VALUE (t
);
10196 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10197 if (TREE_CODE (parm_decl
) == PARM_DECL
10198 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10199 parm_decl
= error_mark_node
;
10200 default_value
= tsubst_template_arg (default_value
, args
,
10201 complain
, NULL_TREE
);
10203 return build_tree_list (default_value
, parm_decl
);
10206 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10207 type T. If T is not an aggregate or enumeration type, it is
10208 handled as if by tsubst. IN_DECL is as for tsubst. If
10209 ENTERING_SCOPE is nonzero, T is the context for a template which
10210 we are presently tsubst'ing. Return the substituted value. */
10213 tsubst_aggr_type (tree t
,
10215 tsubst_flags_t complain
,
10217 int entering_scope
)
10219 if (t
== NULL_TREE
)
10222 switch (TREE_CODE (t
))
10225 if (TYPE_PTRMEMFUNC_P (t
))
10226 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10228 /* Else fall through. */
10229 case ENUMERAL_TYPE
:
10231 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10236 int saved_unevaluated_operand
;
10237 int saved_inhibit_evaluation_warnings
;
10239 /* In "sizeof(X<I>)" we need to evaluate "I". */
10240 saved_unevaluated_operand
= cp_unevaluated_operand
;
10241 cp_unevaluated_operand
= 0;
10242 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10243 c_inhibit_evaluation_warnings
= 0;
10245 /* First, determine the context for the type we are looking
10247 context
= TYPE_CONTEXT (t
);
10248 if (context
&& TYPE_P (context
))
10250 context
= tsubst_aggr_type (context
, args
, complain
,
10251 in_decl
, /*entering_scope=*/1);
10252 /* If context is a nested class inside a class template,
10253 it may still need to be instantiated (c++/33959). */
10254 context
= complete_type (context
);
10257 /* Then, figure out what arguments are appropriate for the
10258 type we are trying to find. For example, given:
10260 template <class T> struct S;
10261 template <class T, class U> void f(T, U) { S<U> su; }
10263 and supposing that we are instantiating f<int, double>,
10264 then our ARGS will be {int, double}, but, when looking up
10265 S we only want {double}. */
10266 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10267 complain
, in_decl
);
10268 if (argvec
== error_mark_node
)
10269 r
= error_mark_node
;
10272 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10273 entering_scope
, complain
);
10274 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10277 cp_unevaluated_operand
= saved_unevaluated_operand
;
10278 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10283 /* This is not a template type, so there's nothing to do. */
10287 return tsubst (t
, args
, complain
, in_decl
);
10291 /* Substitute into the default argument ARG (a default argument for
10292 FN), which has the indicated TYPE. */
10295 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10297 tree saved_class_ptr
= NULL_TREE
;
10298 tree saved_class_ref
= NULL_TREE
;
10299 int errs
= errorcount
+ sorrycount
;
10301 /* This can happen in invalid code. */
10302 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10305 /* This default argument came from a template. Instantiate the
10306 default argument here, not in tsubst. In the case of
10315 we must be careful to do name lookup in the scope of S<T>,
10316 rather than in the current class. */
10317 push_access_scope (fn
);
10318 /* The "this" pointer is not valid in a default argument. */
10321 saved_class_ptr
= current_class_ptr
;
10322 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10323 saved_class_ref
= current_class_ref
;
10324 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10327 push_deferring_access_checks(dk_no_deferred
);
10328 /* The default argument expression may cause implicitly defined
10329 member functions to be synthesized, which will result in garbage
10330 collection. We must treat this situation as if we were within
10331 the body of function so as to avoid collecting live data on the
10334 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10335 complain
, NULL_TREE
,
10336 /*integral_constant_expression_p=*/false);
10338 pop_deferring_access_checks();
10340 /* Restore the "this" pointer. */
10343 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10344 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10347 if (errorcount
+sorrycount
> errs
10348 && (complain
& tf_warning_or_error
))
10349 inform (input_location
,
10350 " when instantiating default argument for call to %D", fn
);
10352 /* Make sure the default argument is reasonable. */
10353 arg
= check_default_argument (type
, arg
, complain
);
10355 pop_access_scope (fn
);
10360 /* Substitute into all the default arguments for FN. */
10363 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10368 tmpl_args
= DECL_TI_ARGS (fn
);
10370 /* If this function is not yet instantiated, we certainly don't need
10371 its default arguments. */
10372 if (uses_template_parms (tmpl_args
))
10374 /* Don't do this again for clones. */
10375 if (DECL_CLONED_FUNCTION_P (fn
))
10378 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10380 arg
= TREE_CHAIN (arg
))
10381 if (TREE_PURPOSE (arg
))
10382 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10384 TREE_PURPOSE (arg
),
10388 /* Substitute the ARGS into the T, which is a _DECL. Return the
10389 result of the substitution. Issue error and warning messages under
10390 control of COMPLAIN. */
10393 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10395 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10396 location_t saved_loc
;
10397 tree r
= NULL_TREE
;
10399 hashval_t hash
= 0;
10401 /* Set the filename and linenumber to improve error-reporting. */
10402 saved_loc
= input_location
;
10403 input_location
= DECL_SOURCE_LOCATION (t
);
10405 switch (TREE_CODE (t
))
10407 case TEMPLATE_DECL
:
10409 /* We can get here when processing a member function template,
10410 member class template, or template template parameter. */
10411 tree decl
= DECL_TEMPLATE_RESULT (t
);
10416 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10418 /* Template template parameter is treated here. */
10419 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10420 if (new_type
== error_mark_node
)
10421 RETURN (error_mark_node
);
10422 /* If we get a real template back, return it. This can happen in
10423 the context of most_specialized_class. */
10424 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10428 DECL_CHAIN (r
) = NULL_TREE
;
10429 TREE_TYPE (r
) = new_type
;
10430 DECL_TEMPLATE_RESULT (r
)
10431 = build_decl (DECL_SOURCE_LOCATION (decl
),
10432 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10433 DECL_TEMPLATE_PARMS (r
)
10434 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10436 TYPE_NAME (new_type
) = r
;
10440 /* We might already have an instance of this template.
10441 The ARGS are for the surrounding class type, so the
10442 full args contain the tsubst'd args for the context,
10443 plus the innermost args from the template decl. */
10444 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10445 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10446 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10447 /* Because this is a template, the arguments will still be
10448 dependent, even after substitution. If
10449 PROCESSING_TEMPLATE_DECL is not set, the dependency
10450 predicates will short-circuit. */
10451 ++processing_template_decl
;
10452 full_args
= tsubst_template_args (tmpl_args
, args
,
10453 complain
, in_decl
);
10454 --processing_template_decl
;
10455 if (full_args
== error_mark_node
)
10456 RETURN (error_mark_node
);
10458 /* If this is a default template template argument,
10459 tsubst might not have changed anything. */
10460 if (full_args
== tmpl_args
)
10463 hash
= hash_tmpl_and_args (t
, full_args
);
10464 spec
= retrieve_specialization (t
, full_args
, hash
);
10465 if (spec
!= NULL_TREE
)
10471 /* Make a new template decl. It will be similar to the
10472 original, but will record the current template arguments.
10473 We also create a new function declaration, which is just
10474 like the old one, but points to this new template, rather
10475 than the old one. */
10477 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10478 DECL_CHAIN (r
) = NULL_TREE
;
10480 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10482 if (TREE_CODE (decl
) == TYPE_DECL
10483 && !TYPE_DECL_ALIAS_P (decl
))
10486 ++processing_template_decl
;
10487 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10488 --processing_template_decl
;
10489 if (new_type
== error_mark_node
)
10490 RETURN (error_mark_node
);
10492 TREE_TYPE (r
) = new_type
;
10493 /* For a partial specialization, we need to keep pointing to
10494 the primary template. */
10495 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10496 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10497 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10498 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10499 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10504 ++processing_template_decl
;
10505 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10506 --processing_template_decl
;
10507 if (new_decl
== error_mark_node
)
10508 RETURN (error_mark_node
);
10510 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10511 DECL_TI_TEMPLATE (new_decl
) = r
;
10512 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10513 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10514 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10517 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10518 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10519 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10521 /* The template parameters for this new template are all the
10522 template parameters for the old template, except the
10523 outermost level of parameters. */
10524 DECL_TEMPLATE_PARMS (r
)
10525 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10528 if (PRIMARY_TEMPLATE_P (t
))
10529 DECL_PRIMARY_TEMPLATE (r
) = r
;
10531 if (TREE_CODE (decl
) != TYPE_DECL
&& TREE_CODE (decl
) != VAR_DECL
)
10532 /* Record this non-type partial instantiation. */
10533 register_specialization (r
, t
,
10534 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10539 case FUNCTION_DECL
:
10542 tree argvec
= NULL_TREE
;
10550 /* Nobody should be tsubst'ing into non-template functions. */
10551 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10553 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10558 /* If T is not dependent, just return it. We have to
10559 increment PROCESSING_TEMPLATE_DECL because
10560 value_dependent_expression_p assumes that nothing is
10561 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10562 ++processing_template_decl
;
10563 dependent_p
= value_dependent_expression_p (t
);
10564 --processing_template_decl
;
10568 /* Calculate the most general template of which R is a
10569 specialization, and the complete set of arguments used to
10571 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10572 argvec
= tsubst_template_args (DECL_TI_ARGS
10573 (DECL_TEMPLATE_RESULT
10574 (DECL_TI_TEMPLATE (t
))),
10575 args
, complain
, in_decl
);
10576 if (argvec
== error_mark_node
)
10577 RETURN (error_mark_node
);
10579 /* Check to see if we already have this specialization. */
10580 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10581 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10589 /* We can see more levels of arguments than parameters if
10590 there was a specialization of a member template, like
10593 template <class T> struct S { template <class U> void f(); }
10594 template <> template <class U> void S<int>::f(U);
10596 Here, we'll be substituting into the specialization,
10597 because that's where we can find the code we actually
10598 want to generate, but we'll have enough arguments for
10599 the most general template.
10601 We also deal with the peculiar case:
10603 template <class T> struct S {
10604 template <class U> friend void f();
10606 template <class U> void f() {}
10608 template void f<double>();
10610 Here, the ARGS for the instantiation of will be {int,
10611 double}. But, we only need as many ARGS as there are
10612 levels of template parameters in CODE_PATTERN. We are
10613 careful not to get fooled into reducing the ARGS in
10616 template <class T> struct S { template <class U> void f(U); }
10617 template <class T> template <> void S<T>::f(int) {}
10619 which we can spot because the pattern will be a
10620 specialization in this case. */
10621 args_depth
= TMPL_ARGS_DEPTH (args
);
10623 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10624 if (args_depth
> parms_depth
10625 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10626 args
= get_innermost_template_args (args
, parms_depth
);
10630 /* This special case arises when we have something like this:
10632 template <class T> struct S {
10633 friend void f<int>(int, double);
10636 Here, the DECL_TI_TEMPLATE for the friend declaration
10637 will be an IDENTIFIER_NODE. We are being called from
10638 tsubst_friend_function, and we want only to create a
10639 new decl (R) with appropriate types so that we can call
10640 determine_specialization. */
10641 gen_tmpl
= NULL_TREE
;
10644 if (DECL_CLASS_SCOPE_P (t
))
10646 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10650 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10651 complain
, t
, /*entering_scope=*/1);
10656 ctx
= DECL_CONTEXT (t
);
10658 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10659 if (type
== error_mark_node
)
10660 RETURN (error_mark_node
);
10662 /* If we hit excessive deduction depth, the type is bogus even if
10663 it isn't error_mark_node, so don't build a decl. */
10664 if (excessive_deduction_depth
)
10665 RETURN (error_mark_node
);
10667 /* We do NOT check for matching decls pushed separately at this
10668 point, as they may not represent instantiations of this
10669 template, and in any case are considered separate under the
10672 DECL_USE_TEMPLATE (r
) = 0;
10673 TREE_TYPE (r
) = type
;
10674 /* Clear out the mangled name and RTL for the instantiation. */
10675 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10676 SET_DECL_RTL (r
, NULL
);
10677 /* Leave DECL_INITIAL set on deleted instantiations. */
10678 if (!DECL_DELETED_FN (r
))
10679 DECL_INITIAL (r
) = NULL_TREE
;
10680 DECL_CONTEXT (r
) = ctx
;
10682 /* OpenMP UDRs have the only argument a reference to the declared
10683 type. We want to diagnose if the declared type is a reference,
10684 which is invalid, but as references to references are usually
10685 quietly merged, diagnose it here. */
10686 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10689 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10690 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10691 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10692 error_at (DECL_SOURCE_LOCATION (t
),
10693 "reference type %qT in "
10694 "%<#pragma omp declare reduction%>", argtype
);
10695 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10696 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10700 if (member
&& DECL_CONV_FN_P (r
))
10701 /* Type-conversion operator. Reconstruct the name, in
10702 case it's the name of one of the template's parameters. */
10703 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10705 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10707 DECL_RESULT (r
) = NULL_TREE
;
10709 TREE_STATIC (r
) = 0;
10710 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10711 DECL_EXTERNAL (r
) = 1;
10712 /* If this is an instantiation of a function with internal
10713 linkage, we already know what object file linkage will be
10714 assigned to the instantiation. */
10715 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10716 DECL_DEFER_OUTPUT (r
) = 0;
10717 DECL_CHAIN (r
) = NULL_TREE
;
10718 DECL_PENDING_INLINE_INFO (r
) = 0;
10719 DECL_PENDING_INLINE_P (r
) = 0;
10720 DECL_SAVED_TREE (r
) = NULL_TREE
;
10721 DECL_STRUCT_FUNCTION (r
) = NULL
;
10723 /* We'll re-clone as appropriate in instantiate_template. */
10724 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10726 /* If we aren't complaining now, return on error before we register
10727 the specialization so that we'll complain eventually. */
10728 if ((complain
& tf_error
) == 0
10729 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10730 && !grok_op_properties (r
, /*complain=*/false))
10731 RETURN (error_mark_node
);
10733 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10734 this in the special friend case mentioned above where
10735 GEN_TMPL is NULL. */
10738 DECL_TEMPLATE_INFO (r
)
10739 = build_template_info (gen_tmpl
, argvec
);
10740 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10743 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10745 /* We instantiated this while substituting into
10746 the type earlier (template/friend54.C). */
10749 /* We're not supposed to instantiate default arguments
10750 until they are called, for a template. But, for a
10753 template <class T> void f ()
10754 { extern void g(int i = T()); }
10756 we should do the substitution when the template is
10757 instantiated. We handle the member function case in
10758 instantiate_class_template since the default arguments
10759 might refer to other members of the class. */
10761 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10762 && !uses_template_parms (argvec
))
10763 tsubst_default_arguments (r
, complain
);
10766 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10768 /* Copy the list of befriending classes. */
10769 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10771 friends
= &TREE_CHAIN (*friends
))
10773 *friends
= copy_node (*friends
);
10774 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10779 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10781 maybe_retrofit_in_chrg (r
);
10782 if (DECL_CONSTRUCTOR_P (r
))
10783 grok_ctor_properties (ctx
, r
);
10784 if (DECL_INHERITED_CTOR_BASE (r
))
10785 deduce_inheriting_ctor (r
);
10786 /* If this is an instantiation of a member template, clone it.
10787 If it isn't, that'll be handled by
10788 clone_constructors_and_destructors. */
10789 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10790 clone_function_decl (r
, /*update_method_vec_p=*/0);
10792 else if ((complain
& tf_error
) != 0
10793 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10794 && !grok_op_properties (r
, /*complain=*/true))
10795 RETURN (error_mark_node
);
10797 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10798 SET_DECL_FRIEND_CONTEXT (r
,
10799 tsubst (DECL_FRIEND_CONTEXT (t
),
10800 args
, complain
, in_decl
));
10802 /* Possibly limit visibility based on template args. */
10803 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10804 if (DECL_VISIBILITY_SPECIFIED (t
))
10806 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10807 DECL_ATTRIBUTES (r
)
10808 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10810 determine_visibility (r
);
10811 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10812 && !processing_template_decl
)
10813 defaulted_late_check (r
);
10815 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10816 args
, complain
, in_decl
);
10822 tree type
= NULL_TREE
;
10824 tree expanded_types
= NULL_TREE
;
10825 tree prev_r
= NULL_TREE
;
10826 tree first_r
= NULL_TREE
;
10828 if (DECL_PACK_P (t
))
10830 /* If there is a local specialization that isn't a
10831 parameter pack, it means that we're doing a "simple"
10832 substitution from inside tsubst_pack_expansion. Just
10833 return the local specialization (which will be a single
10835 tree spec
= retrieve_local_specialization (t
);
10837 && TREE_CODE (spec
) == PARM_DECL
10838 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10841 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10842 the parameters in this function parameter pack. */
10843 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10844 complain
, in_decl
);
10845 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10847 len
= TREE_VEC_LENGTH (expanded_types
);
10849 /* Zero-length parameter packs are boring. Just substitute
10852 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10857 /* All we did was update the type. Make a note of that. */
10858 type
= expanded_types
;
10859 expanded_types
= NULL_TREE
;
10863 /* Loop through all of the parameters we'll build. When T is
10864 a function parameter pack, LEN is the number of expanded
10865 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10867 for (i
= 0; i
< len
; ++i
)
10871 if (DECL_TEMPLATE_PARM_P (t
))
10872 SET_DECL_TEMPLATE_PARM_P (r
);
10874 if (expanded_types
)
10875 /* We're on the Ith parameter of the function parameter
10878 /* Get the Ith type. */
10879 type
= TREE_VEC_ELT (expanded_types
, i
);
10881 /* Rename the parameter to include the index. */
10883 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10886 /* We're dealing with a normal parameter. */
10887 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10889 type
= type_decays_to (type
);
10890 TREE_TYPE (r
) = type
;
10891 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10893 if (DECL_INITIAL (r
))
10895 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10896 DECL_INITIAL (r
) = TREE_TYPE (r
);
10898 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10899 complain
, in_decl
);
10902 DECL_CONTEXT (r
) = NULL_TREE
;
10904 if (!DECL_TEMPLATE_PARM_P (r
))
10905 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10907 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10908 args
, complain
, in_decl
);
10910 /* Keep track of the first new parameter we
10911 generate. That's what will be returned to the
10916 /* Build a proper chain of parameters when substituting
10917 into a function parameter pack. */
10919 DECL_CHAIN (prev_r
) = r
;
10922 /* If cp_unevaluated_operand is set, we're just looking for a
10923 single dummy parameter, so don't keep going. */
10924 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10925 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10926 complain
, DECL_CHAIN (t
));
10928 /* FIRST_R contains the start of the chain we've built. */
10935 tree type
= NULL_TREE
;
10936 tree vec
= NULL_TREE
;
10937 tree expanded_types
= NULL_TREE
;
10940 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
10942 /* This field is a lambda capture pack. Return a TREE_VEC of
10943 the expanded fields to instantiate_class_template_1 and
10944 store them in the specializations hash table as a
10945 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
10946 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10947 complain
, in_decl
);
10948 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10950 len
= TREE_VEC_LENGTH (expanded_types
);
10951 vec
= make_tree_vec (len
);
10955 /* All we did was update the type. Make a note of that. */
10956 type
= expanded_types
;
10957 expanded_types
= NULL_TREE
;
10961 for (int i
= 0; i
< len
; ++i
)
10964 if (expanded_types
)
10966 type
= TREE_VEC_ELT (expanded_types
, i
);
10968 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10971 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10973 if (type
== error_mark_node
)
10974 RETURN (error_mark_node
);
10975 TREE_TYPE (r
) = type
;
10976 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10978 if (DECL_C_BIT_FIELD (r
))
10979 /* For bit-fields, DECL_INITIAL gives the number of bits. For
10980 non-bit-fields DECL_INITIAL is a non-static data member
10981 initializer, which gets deferred instantiation. */
10983 = tsubst_expr (DECL_INITIAL (t
), args
,
10985 /*integral_constant_expression_p=*/true);
10986 else if (DECL_INITIAL (t
))
10988 /* Set up DECL_TEMPLATE_INFO so that we can get at the
10989 NSDMI in perform_member_init. Still set DECL_INITIAL
10990 so that we know there is one. */
10991 DECL_INITIAL (r
) = void_node
;
10992 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
10993 retrofit_lang_decl (r
);
10994 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10996 /* We don't have to set DECL_CONTEXT here; it is set by
10997 finish_member_declaration. */
10998 DECL_CHAIN (r
) = NULL_TREE
;
11000 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11001 args
, complain
, in_decl
);
11004 TREE_VEC_ELT (vec
, i
) = r
;
11010 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11011 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11012 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11013 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11014 TREE_TYPE (pack
) = tpack
;
11015 register_specialization (pack
, t
, args
, false, 0);
11021 /* We reach here only for member using decls. We also need to check
11022 uses_template_parms because DECL_DEPENDENT_P is not set for a
11023 using-declaration that designates a member of the current
11024 instantiation (c++/53549). */
11025 if (DECL_DEPENDENT_P (t
)
11026 || uses_template_parms (USING_DECL_SCOPE (t
)))
11028 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11029 complain
, in_decl
);
11030 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11031 r
= do_class_using_decl (inst_scope
, name
);
11033 r
= error_mark_node
;
11036 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11037 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11043 DECL_CHAIN (r
) = NULL_TREE
;
11050 tree argvec
= NULL_TREE
;
11051 tree gen_tmpl
= NULL_TREE
;
11053 tree tmpl
= NULL_TREE
;
11055 tree type
= NULL_TREE
;
11058 if (TREE_TYPE (t
) == error_mark_node
)
11059 RETURN (error_mark_node
);
11061 if (TREE_CODE (t
) == TYPE_DECL
11062 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11064 /* If this is the canonical decl, we don't have to
11065 mess with instantiations, and often we can't (for
11066 typename, template type parms and such). Note that
11067 TYPE_NAME is not correct for the above test if
11068 we've copied the type for a typedef. */
11069 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11070 if (type
== error_mark_node
)
11071 RETURN (error_mark_node
);
11072 r
= TYPE_NAME (type
);
11076 /* Check to see if we already have the specialization we
11079 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11081 /* T is a static data member or namespace-scope entity.
11082 We have to substitute into namespace-scope variables
11083 (even though such entities are never templates) because
11086 template <class T> void f() { extern T t; }
11088 where the entity referenced is not known until
11089 instantiation time. */
11091 ctx
= DECL_CONTEXT (t
);
11092 if (DECL_CLASS_SCOPE_P (t
))
11094 ctx
= tsubst_aggr_type (ctx
, args
,
11096 in_decl
, /*entering_scope=*/1);
11097 /* If CTX is unchanged, then T is in fact the
11098 specialization we want. That situation occurs when
11099 referencing a static data member within in its own
11100 class. We can use pointer equality, rather than
11101 same_type_p, because DECL_CONTEXT is always
11103 if (ctx
== DECL_CONTEXT (t
)
11104 && (TREE_CODE (t
) != TYPE_DECL
11105 /* ... unless T is a member template; in which
11106 case our caller can be willing to create a
11107 specialization of that template represented
11109 || !(DECL_TI_TEMPLATE (t
)
11110 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))))
11116 tmpl
= DECL_TI_TEMPLATE (t
);
11117 gen_tmpl
= most_general_template (tmpl
);
11118 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11119 if (argvec
== error_mark_node
)
11120 RETURN (error_mark_node
);
11121 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11122 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11127 /* A local variable. */
11129 /* Subsequent calls to pushdecl will fill this in. */
11131 spec
= retrieve_local_specialization (t
);
11133 /* If we already have the specialization we need, there is
11134 nothing more to do. */
11141 /* Create a new node for the specialization we need. */
11143 if (type
== NULL_TREE
)
11145 if (is_typedef_decl (t
))
11146 type
= DECL_ORIGINAL_TYPE (t
);
11148 type
= TREE_TYPE (t
);
11150 && VAR_HAD_UNKNOWN_BOUND (t
)
11151 && type
!= error_mark_node
)
11152 type
= strip_array_domain (type
);
11153 type
= tsubst (type
, args
, complain
, in_decl
);
11157 /* Even if the original location is out of scope, the
11158 newly substituted one is not. */
11159 DECL_DEAD_FOR_LOCAL (r
) = 0;
11160 DECL_INITIALIZED_P (r
) = 0;
11161 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11162 if (type
== error_mark_node
)
11163 RETURN (error_mark_node
);
11164 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11166 /* It may seem that this case cannot occur, since:
11171 declares a function, not a variable. However:
11174 template <typename T> void g() { T t; }
11175 template void g<f>();
11177 is an attempt to declare a variable with function
11179 error ("variable %qD has function type",
11180 /* R is not yet sufficiently initialized, so we
11181 just use its name. */
11183 RETURN (error_mark_node
);
11185 type
= complete_type (type
);
11186 /* Wait until cp_finish_decl to set this again, to handle
11187 circular dependency (template/instantiate6.C). */
11188 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11189 type
= check_var_type (DECL_NAME (r
), type
);
11191 if (DECL_HAS_VALUE_EXPR_P (t
))
11193 tree ve
= DECL_VALUE_EXPR (t
);
11194 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11195 /*constant_expression_p=*/false);
11196 if (REFERENCE_REF_P (ve
))
11198 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11199 ve
= TREE_OPERAND (ve
, 0);
11201 SET_DECL_VALUE_EXPR (r
, ve
);
11204 else if (DECL_SELF_REFERENCE_P (t
))
11205 SET_DECL_SELF_REFERENCE_P (r
);
11206 TREE_TYPE (r
) = type
;
11207 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11208 DECL_CONTEXT (r
) = ctx
;
11209 /* Clear out the mangled name and RTL for the instantiation. */
11210 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11211 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11212 SET_DECL_RTL (r
, NULL
);
11213 /* The initializer must not be expanded until it is required;
11214 see [temp.inst]. */
11215 DECL_INITIAL (r
) = NULL_TREE
;
11216 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11217 SET_DECL_RTL (r
, NULL
);
11218 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11221 /* Possibly limit visibility based on template args. */
11222 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11223 if (DECL_VISIBILITY_SPECIFIED (t
))
11225 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11226 DECL_ATTRIBUTES (r
)
11227 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11229 determine_visibility (r
);
11234 /* A static data member declaration is always marked
11235 external when it is declared in-class, even if an
11236 initializer is present. We mimic the non-template
11237 processing here. */
11238 DECL_EXTERNAL (r
) = 1;
11240 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11241 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11242 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11244 else if (!cp_unevaluated_operand
)
11245 register_local_specialization (r
, t
);
11247 DECL_CHAIN (r
) = NULL_TREE
;
11249 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11251 args
, complain
, in_decl
);
11253 /* Preserve a typedef that names a type. */
11254 if (is_typedef_decl (r
))
11256 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11257 set_underlying_type (r
);
11260 layout_decl (r
, 0);
11265 gcc_unreachable ();
11270 /* Restore the file and line information. */
11271 input_location
= saved_loc
;
11276 /* Substitute into the ARG_TYPES of a function type.
11277 If END is a TREE_CHAIN, leave it and any following types
11281 tsubst_arg_types (tree arg_types
,
11284 tsubst_flags_t complain
,
11287 tree remaining_arg_types
;
11288 tree type
= NULL_TREE
;
11290 tree expanded_args
= NULL_TREE
;
11293 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11296 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11297 args
, end
, complain
, in_decl
);
11298 if (remaining_arg_types
== error_mark_node
)
11299 return error_mark_node
;
11301 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11303 /* For a pack expansion, perform substitution on the
11304 entire expression. Later on, we'll handle the arguments
11306 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11307 args
, complain
, in_decl
);
11309 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11310 /* So that we'll spin through the parameters, one by one. */
11311 i
= TREE_VEC_LENGTH (expanded_args
);
11314 /* We only partially substituted into the parameter
11315 pack. Our type is TYPE_PACK_EXPANSION. */
11316 type
= expanded_args
;
11317 expanded_args
= NULL_TREE
;
11325 type
= TREE_VEC_ELT (expanded_args
, i
);
11327 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11329 if (type
== error_mark_node
)
11330 return error_mark_node
;
11331 if (VOID_TYPE_P (type
))
11333 if (complain
& tf_error
)
11335 error ("invalid parameter type %qT", type
);
11337 error ("in declaration %q+D", in_decl
);
11339 return error_mark_node
;
11342 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11343 return error_mark_node
;
11345 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11346 top-level qualifiers as required. */
11347 type
= cv_unqualified (type_decays_to (type
));
11349 /* We do not substitute into default arguments here. The standard
11350 mandates that they be instantiated only when needed, which is
11351 done in build_over_call. */
11352 default_arg
= TREE_PURPOSE (arg_types
);
11354 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11356 /* We've instantiated a template before its default arguments
11357 have been parsed. This can happen for a nested template
11358 class, and is not an error unless we require the default
11359 argument in a call of this function. */
11360 remaining_arg_types
=
11361 tree_cons (default_arg
, type
, remaining_arg_types
);
11362 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11365 remaining_arg_types
=
11366 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11369 return remaining_arg_types
;
11372 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11373 *not* handle the exception-specification for FNTYPE, because the
11374 initial substitution of explicitly provided template parameters
11375 during argument deduction forbids substitution into the
11376 exception-specification:
11380 All references in the function type of the function template to the
11381 corresponding template parameters are replaced by the specified tem-
11382 plate argument values. If a substitution in a template parameter or
11383 in the function type of the function template results in an invalid
11384 type, type deduction fails. [Note: The equivalent substitution in
11385 exception specifications is done only when the function is instanti-
11386 ated, at which point a program is ill-formed if the substitution
11387 results in an invalid type.] */
11390 tsubst_function_type (tree t
,
11392 tsubst_flags_t complain
,
11396 tree arg_types
= NULL_TREE
;
11399 /* The TYPE_CONTEXT is not used for function/method types. */
11400 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11402 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
11404 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
11406 if (late_return_type_p
)
11408 /* Substitute the argument types. */
11409 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11410 complain
, in_decl
);
11411 if (arg_types
== error_mark_node
)
11412 return error_mark_node
;
11414 tree save_ccp
= current_class_ptr
;
11415 tree save_ccr
= current_class_ref
;
11416 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
11417 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
11418 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
11421 /* DR 1207: 'this' is in scope in the trailing return type. */
11422 inject_this_parameter (this_type
, cp_type_quals (this_type
));
11425 /* Substitute the return type. */
11426 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11430 current_class_ptr
= save_ccp
;
11431 current_class_ref
= save_ccr
;
11435 /* Substitute the return type. */
11436 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11438 if (return_type
== error_mark_node
)
11439 return error_mark_node
;
11440 /* DR 486 clarifies that creation of a function type with an
11441 invalid return type is a deduction failure. */
11442 if (TREE_CODE (return_type
) == ARRAY_TYPE
11443 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11445 if (complain
& tf_error
)
11447 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11448 error ("function returning an array");
11450 error ("function returning a function");
11452 return error_mark_node
;
11455 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11456 return error_mark_node
;
11458 if (!late_return_type_p
)
11460 /* Substitute the argument types. */
11461 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11462 complain
, in_decl
);
11463 if (arg_types
== error_mark_node
)
11464 return error_mark_node
;
11467 /* Construct a new type node and return it. */
11468 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11470 fntype
= build_function_type (return_type
, arg_types
);
11471 fntype
= apply_memfn_quals (fntype
,
11472 type_memfn_quals (t
),
11473 type_memfn_rqual (t
));
11477 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11478 /* Don't pick up extra function qualifiers from the basetype. */
11479 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11480 if (! MAYBE_CLASS_TYPE_P (r
))
11484 Type deduction may fail for any of the following
11487 -- Attempting to create "pointer to member of T" when T
11488 is not a class type. */
11489 if (complain
& tf_error
)
11490 error ("creating pointer to member function of non-class type %qT",
11492 return error_mark_node
;
11495 fntype
= build_method_type_directly (r
, return_type
,
11496 TREE_CHAIN (arg_types
));
11497 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11499 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11501 if (late_return_type_p
)
11502 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
11507 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11508 ARGS into that specification, and return the substituted
11509 specification. If there is no specification, return NULL_TREE. */
11512 tsubst_exception_specification (tree fntype
,
11514 tsubst_flags_t complain
,
11521 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11522 new_specs
= NULL_TREE
;
11523 if (specs
&& TREE_PURPOSE (specs
))
11525 /* A noexcept-specifier. */
11526 tree expr
= TREE_PURPOSE (specs
);
11527 if (TREE_CODE (expr
) == INTEGER_CST
)
11531 /* Defer instantiation of noexcept-specifiers to avoid
11532 excessive instantiations (c++/49107). */
11533 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11534 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11536 /* We already partially instantiated this member template,
11537 so combine the new args with the old. */
11538 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11539 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11540 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11541 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11545 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11546 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11550 new_specs
= tsubst_copy_and_build
11551 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11552 /*integral_constant_expression_p=*/true);
11553 new_specs
= build_noexcept_spec (new_specs
, complain
);
11557 if (! TREE_VALUE (specs
))
11564 tree expanded_specs
= NULL_TREE
;
11566 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11568 /* Expand the pack expansion type. */
11569 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11573 if (expanded_specs
== error_mark_node
)
11574 return error_mark_node
;
11575 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11576 len
= TREE_VEC_LENGTH (expanded_specs
);
11579 /* We're substituting into a member template, so
11580 we got a TYPE_PACK_EXPANSION back. Add that
11581 expansion and move on. */
11582 gcc_assert (TREE_CODE (expanded_specs
)
11583 == TYPE_PACK_EXPANSION
);
11584 new_specs
= add_exception_specifier (new_specs
,
11587 specs
= TREE_CHAIN (specs
);
11592 for (i
= 0; i
< len
; ++i
)
11594 if (expanded_specs
)
11595 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11597 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11598 if (spec
== error_mark_node
)
11600 new_specs
= add_exception_specifier (new_specs
, spec
,
11604 specs
= TREE_CHAIN (specs
);
11610 /* Take the tree structure T and replace template parameters used
11611 therein with the argument vector ARGS. IN_DECL is an associated
11612 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11613 Issue error and warning messages under control of COMPLAIN. Note
11614 that we must be relatively non-tolerant of extensions here, in
11615 order to preserve conformance; if we allow substitutions that
11616 should not be allowed, we may allow argument deductions that should
11617 not succeed, and therefore report ambiguous overload situations
11618 where there are none. In theory, we could allow the substitution,
11619 but indicate that it should have failed, and allow our caller to
11620 make sure that the right thing happens, but we don't try to do this
11623 This function is used for dealing with types, decls and the like;
11624 for expressions, use tsubst_expr or tsubst_copy. */
11627 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11629 enum tree_code code
;
11630 tree type
, r
= NULL_TREE
;
11632 if (t
== NULL_TREE
|| t
== error_mark_node
11633 || t
== integer_type_node
11634 || t
== void_type_node
11635 || t
== char_type_node
11636 || t
== unknown_type_node
11637 || TREE_CODE (t
) == NAMESPACE_DECL
11638 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11642 return tsubst_decl (t
, args
, complain
);
11644 if (args
== NULL_TREE
)
11647 code
= TREE_CODE (t
);
11649 if (code
== IDENTIFIER_NODE
)
11650 type
= IDENTIFIER_TYPE_VALUE (t
);
11652 type
= TREE_TYPE (t
);
11654 gcc_assert (type
!= unknown_type_node
);
11656 /* Reuse typedefs. We need to do this to handle dependent attributes,
11657 such as attribute aligned. */
11659 && typedef_variant_p (t
))
11661 tree decl
= TYPE_NAME (t
);
11663 if (alias_template_specialization_p (t
))
11665 /* DECL represents an alias template and we want to
11667 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11668 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11669 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11671 else if (DECL_CLASS_SCOPE_P (decl
)
11672 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11673 && uses_template_parms (DECL_CONTEXT (decl
)))
11675 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11676 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11677 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11679 else if (DECL_FUNCTION_SCOPE_P (decl
)
11680 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11681 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11682 r
= retrieve_local_specialization (decl
);
11684 /* The typedef is from a non-template context. */
11690 r
= cp_build_qualified_type_real
11691 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11692 complain
| tf_ignore_bad_quals
);
11697 /* We don't have an instantiation yet, so drop the typedef. */
11698 int quals
= cp_type_quals (t
);
11699 t
= DECL_ORIGINAL_TYPE (decl
);
11700 t
= cp_build_qualified_type_real (t
, quals
,
11701 complain
| tf_ignore_bad_quals
);
11706 && code
!= TYPENAME_TYPE
11707 && code
!= TEMPLATE_TYPE_PARM
11708 && code
!= IDENTIFIER_NODE
11709 && code
!= FUNCTION_TYPE
11710 && code
!= METHOD_TYPE
)
11711 type
= tsubst (type
, args
, complain
, in_decl
);
11712 if (type
== error_mark_node
)
11713 return error_mark_node
;
11719 case ENUMERAL_TYPE
:
11720 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11721 /*entering_scope=*/0);
11724 case IDENTIFIER_NODE
:
11735 if (t
== integer_type_node
)
11738 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11739 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11743 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11745 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11746 /*integral_constant_expression_p=*/false);
11748 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11750 if (TREE_CODE (max
) == NOP_EXPR
11751 && TREE_SIDE_EFFECTS (omax
)
11752 && !TREE_TYPE (max
))
11753 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11755 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11756 with TREE_SIDE_EFFECTS that indicates this is not an integral
11757 constant expression. */
11758 if (processing_template_decl
11759 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11761 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11762 TREE_SIDE_EFFECTS (max
) = 1;
11765 return compute_array_index_type (NULL_TREE
, max
, complain
);
11768 case TEMPLATE_TYPE_PARM
:
11769 case TEMPLATE_TEMPLATE_PARM
:
11770 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11771 case TEMPLATE_PARM_INDEX
:
11776 tree arg
= NULL_TREE
;
11780 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11781 template_parm_level_and_index (t
, &level
, &idx
);
11783 levels
= TMPL_ARGS_DEPTH (args
);
11784 if (level
<= levels
)
11786 arg
= TMPL_ARG (args
, level
, idx
);
11788 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11790 /* See through ARGUMENT_PACK_SELECT arguments. */
11791 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11792 /* If the selected argument is an expansion E, that most
11793 likely means we were called from
11794 gen_elem_of_pack_expansion_instantiation during the
11795 substituting of pack an argument pack (which Ith
11796 element is a pack expansion, where I is
11797 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11798 In this case, the Ith element resulting from this
11799 substituting is going to be a pack expansion, which
11800 pattern is the pattern of E. Let's return the
11802 gen_elem_of_pack_expansion_instantiation will
11803 build the resulting pack expansion from it. */
11804 if (PACK_EXPANSION_P (arg
))
11805 arg
= PACK_EXPANSION_PATTERN (arg
);
11809 if (arg
== error_mark_node
)
11810 return error_mark_node
;
11811 else if (arg
!= NULL_TREE
)
11813 if (ARGUMENT_PACK_P (arg
))
11814 /* If ARG is an argument pack, we don't actually want to
11815 perform a substitution here, because substitutions
11816 for argument packs are only done
11817 element-by-element. We can get to this point when
11818 substituting the type of a non-type template
11819 parameter pack, when that type actually contains
11820 template parameter packs from an outer template, e.g.,
11822 template<typename... Types> struct A {
11823 template<Types... Values> struct B { };
11827 if (code
== TEMPLATE_TYPE_PARM
)
11830 gcc_assert (TYPE_P (arg
));
11832 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11834 return cp_build_qualified_type_real
11835 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11837 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11839 /* We are processing a type constructed from a
11840 template template parameter. */
11841 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11842 args
, complain
, in_decl
);
11843 if (argvec
== error_mark_node
)
11844 return error_mark_node
;
11846 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11847 || TREE_CODE (arg
) == TEMPLATE_DECL
11848 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11850 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11851 /* Consider this code:
11853 template <template <class> class Template>
11855 template <class Arg> using Bind = Template<Arg>;
11858 template <template <class> class Template, class Arg>
11859 using Instantiate = Template<Arg>; //#0
11861 template <template <class> class Template,
11864 Instantiate<Internal<Template>::template Bind,
11867 When #1 is parsed, the
11868 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11869 parameter `Template' in #0 matches the
11870 UNBOUND_CLASS_TEMPLATE representing the argument
11871 `Internal<Template>::template Bind'; We then want
11872 to assemble the type `Bind<Argument>' that can't
11873 be fully created right now, because
11874 `Internal<Template>' not being complete, the Bind
11875 template cannot be looked up in that context. So
11876 we need to "store" `Bind<Argument>' for later
11877 when the context of Bind becomes complete. Let's
11878 store that in a TYPENAME_TYPE. */
11879 return make_typename_type (TYPE_CONTEXT (arg
),
11880 build_nt (TEMPLATE_ID_EXPR
,
11881 TYPE_IDENTIFIER (arg
),
11886 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11887 are resolving nested-types in the signature of a
11888 member function templates. Otherwise ARG is a
11889 TEMPLATE_DECL and is the real template to be
11891 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11892 arg
= TYPE_NAME (arg
);
11894 r
= lookup_template_class (arg
,
11896 DECL_CONTEXT (arg
),
11897 /*entering_scope=*/0,
11899 return cp_build_qualified_type_real
11900 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
11903 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11904 return convert_from_reference (unshare_expr (arg
));
11908 /* This can happen during the attempted tsubst'ing in
11909 unify. This means that we don't yet have any information
11910 about the template parameter in question. */
11913 /* Early in template argument deduction substitution, we don't
11914 want to reduce the level of 'auto', or it will be confused
11915 with a normal template parm in subsequent deduction. */
11916 if (is_auto (t
) && (complain
& tf_partial
))
11919 /* If we get here, we must have been looking at a parm for a
11920 more deeply nested template. Make a new version of this
11921 template parameter, but with a lower level. */
11924 case TEMPLATE_TYPE_PARM
:
11925 case TEMPLATE_TEMPLATE_PARM
:
11926 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11927 if (cp_type_quals (t
))
11929 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11930 r
= cp_build_qualified_type_real
11931 (r
, cp_type_quals (t
),
11932 complain
| (code
== TEMPLATE_TYPE_PARM
11933 ? tf_ignore_bad_quals
: 0));
11938 TEMPLATE_TYPE_PARM_INDEX (r
)
11939 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11940 r
, levels
, args
, complain
);
11941 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11942 TYPE_MAIN_VARIANT (r
) = r
;
11943 TYPE_POINTER_TO (r
) = NULL_TREE
;
11944 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11946 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11947 /* We have reduced the level of the template
11948 template parameter, but not the levels of its
11949 template parameters, so canonical_type_parameter
11950 will not be able to find the canonical template
11951 template parameter for this level. Thus, we
11952 require structural equality checking to compare
11953 TEMPLATE_TEMPLATE_PARMs. */
11954 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11955 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11956 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11958 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11960 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11962 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11963 complain
, in_decl
);
11964 if (argvec
== error_mark_node
)
11965 return error_mark_node
;
11967 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11968 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
11973 case TEMPLATE_PARM_INDEX
:
11974 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
11978 gcc_unreachable ();
11986 tree purpose
, value
, chain
;
11988 if (t
== void_list_node
)
11991 purpose
= TREE_PURPOSE (t
);
11994 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
11995 if (purpose
== error_mark_node
)
11996 return error_mark_node
;
11998 value
= TREE_VALUE (t
);
12001 value
= tsubst (value
, args
, complain
, in_decl
);
12002 if (value
== error_mark_node
)
12003 return error_mark_node
;
12005 chain
= TREE_CHAIN (t
);
12006 if (chain
&& chain
!= void_type_node
)
12008 chain
= tsubst (chain
, args
, complain
, in_decl
);
12009 if (chain
== error_mark_node
)
12010 return error_mark_node
;
12012 if (purpose
== TREE_PURPOSE (t
)
12013 && value
== TREE_VALUE (t
)
12014 && chain
== TREE_CHAIN (t
))
12016 return hash_tree_cons (purpose
, value
, chain
);
12020 /* We should never be tsubsting a binfo. */
12021 gcc_unreachable ();
12024 /* A vector of template arguments. */
12025 gcc_assert (!type
);
12026 return tsubst_template_args (t
, args
, complain
, in_decl
);
12029 case REFERENCE_TYPE
:
12031 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12036 Type deduction may fail for any of the following
12039 -- Attempting to create a pointer to reference type.
12040 -- Attempting to create a reference to a reference type or
12041 a reference to void.
12043 Core issue 106 says that creating a reference to a reference
12044 during instantiation is no longer a cause for failure. We
12045 only enforce this check in strict C++98 mode. */
12046 if ((TREE_CODE (type
) == REFERENCE_TYPE
12047 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12048 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12050 static location_t last_loc
;
12052 /* We keep track of the last time we issued this error
12053 message to avoid spewing a ton of messages during a
12054 single bad template instantiation. */
12055 if (complain
& tf_error
12056 && last_loc
!= input_location
)
12058 if (VOID_TYPE_P (type
))
12059 error ("forming reference to void");
12060 else if (code
== POINTER_TYPE
)
12061 error ("forming pointer to reference type %qT", type
);
12063 error ("forming reference to reference type %qT", type
);
12064 last_loc
= input_location
;
12067 return error_mark_node
;
12069 else if (TREE_CODE (type
) == FUNCTION_TYPE
12070 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12071 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12073 if (complain
& tf_error
)
12075 if (code
== POINTER_TYPE
)
12076 error ("forming pointer to qualified function type %qT",
12079 error ("forming reference to qualified function type %qT",
12082 return error_mark_node
;
12084 else if (code
== POINTER_TYPE
)
12086 r
= build_pointer_type (type
);
12087 if (TREE_CODE (type
) == METHOD_TYPE
)
12088 r
= build_ptrmemfunc_type (r
);
12090 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12091 /* In C++0x, during template argument substitution, when there is an
12092 attempt to create a reference to a reference type, reference
12093 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12095 "If a template-argument for a template-parameter T names a type
12096 that is a reference to a type A, an attempt to create the type
12097 'lvalue reference to cv T' creates the type 'lvalue reference to
12098 A,' while an attempt to create the type type rvalue reference to
12099 cv T' creates the type T"
12101 r
= cp_build_reference_type
12103 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12105 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12106 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12108 if (cxx_dialect
>= cxx1y
12109 && !(TREE_CODE (t
) == REFERENCE_TYPE
&& REFERENCE_VLA_OK (t
))
12110 && array_of_runtime_bound_p (type
)
12111 && (flag_iso
|| warn_vla
> 0))
12113 if (complain
& tf_warning_or_error
)
12115 (input_location
, OPT_Wvla
,
12116 code
== REFERENCE_TYPE
12117 ? G_("cannot declare reference to array of runtime bound")
12118 : G_("cannot declare pointer to array of runtime bound"));
12120 r
= error_mark_node
;
12123 if (r
!= error_mark_node
)
12124 /* Will this ever be needed for TYPE_..._TO values? */
12131 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12132 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12136 Type deduction may fail for any of the following
12139 -- Attempting to create "pointer to member of T" when T
12140 is not a class type. */
12141 if (complain
& tf_error
)
12142 error ("creating pointer to member of non-class type %qT", r
);
12143 return error_mark_node
;
12145 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12147 if (complain
& tf_error
)
12148 error ("creating pointer to member reference type %qT", type
);
12149 return error_mark_node
;
12151 if (VOID_TYPE_P (type
))
12153 if (complain
& tf_error
)
12154 error ("creating pointer to member of type void");
12155 return error_mark_node
;
12157 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12158 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12160 /* The type of the implicit object parameter gets its
12161 cv-qualifiers from the FUNCTION_TYPE. */
12164 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12165 type_memfn_rqual (type
));
12166 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12167 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12171 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12175 case FUNCTION_TYPE
:
12180 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12181 if (fntype
== error_mark_node
)
12182 return error_mark_node
;
12184 /* Substitute the exception specification. */
12185 specs
= tsubst_exception_specification (t
, args
, complain
,
12186 in_decl
, /*defer_ok*/true);
12187 if (specs
== error_mark_node
)
12188 return error_mark_node
;
12190 fntype
= build_exception_variant (fntype
, specs
);
12195 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12196 if (domain
== error_mark_node
)
12197 return error_mark_node
;
12199 /* As an optimization, we avoid regenerating the array type if
12200 it will obviously be the same as T. */
12201 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12204 /* These checks should match the ones in create_array_type_for_decl.
12208 The deduction may fail for any of the following reasons:
12210 -- Attempting to create an array with an element type that
12211 is void, a function type, or a reference type, or [DR337]
12212 an abstract class type. */
12213 if (VOID_TYPE_P (type
)
12214 || TREE_CODE (type
) == FUNCTION_TYPE
12215 || (TREE_CODE (type
) == ARRAY_TYPE
12216 && TYPE_DOMAIN (type
) == NULL_TREE
)
12217 || TREE_CODE (type
) == REFERENCE_TYPE
)
12219 if (complain
& tf_error
)
12220 error ("creating array of %qT", type
);
12221 return error_mark_node
;
12224 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12225 return error_mark_node
;
12227 r
= build_cplus_array_type (type
, domain
);
12229 if (TYPE_USER_ALIGN (t
))
12231 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12232 TYPE_USER_ALIGN (r
) = 1;
12238 case TYPENAME_TYPE
:
12240 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12241 in_decl
, /*entering_scope=*/1);
12242 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12243 complain
, in_decl
);
12245 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12246 return error_mark_node
;
12248 if (!MAYBE_CLASS_TYPE_P (ctx
))
12250 if (complain
& tf_error
)
12251 error ("%qT is not a class, struct, or union type", ctx
);
12252 return error_mark_node
;
12254 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12256 /* Normally, make_typename_type does not require that the CTX
12257 have complete type in order to allow things like:
12259 template <class T> struct S { typename S<T>::X Y; };
12261 But, such constructs have already been resolved by this
12262 point, so here CTX really should have complete type, unless
12263 it's a partial instantiation. */
12264 ctx
= complete_type (ctx
);
12265 if (!COMPLETE_TYPE_P (ctx
))
12267 if (complain
& tf_error
)
12268 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12269 return error_mark_node
;
12273 f
= make_typename_type (ctx
, f
, typename_type
,
12274 complain
| tf_keep_type_decl
);
12275 if (f
== error_mark_node
)
12277 if (TREE_CODE (f
) == TYPE_DECL
)
12279 complain
|= tf_ignore_bad_quals
;
12283 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12285 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12287 if (complain
& tf_error
)
12288 error ("%qT resolves to %qT, which is not an enumeration type",
12291 return error_mark_node
;
12293 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12295 if (complain
& tf_error
)
12296 error ("%qT resolves to %qT, which is is not a class type",
12299 return error_mark_node
;
12303 return cp_build_qualified_type_real
12304 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12307 case UNBOUND_CLASS_TEMPLATE
:
12309 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12310 in_decl
, /*entering_scope=*/1);
12311 tree name
= TYPE_IDENTIFIER (t
);
12312 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12314 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12315 return error_mark_node
;
12318 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12319 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12326 ++cp_unevaluated_operand
;
12327 ++c_inhibit_evaluation_warnings
;
12329 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12331 /*integral_constant_expression_p=*/false);
12333 --cp_unevaluated_operand
;
12334 --c_inhibit_evaluation_warnings
;
12336 type
= finish_typeof (type
);
12337 return cp_build_qualified_type_real (type
,
12339 | cp_type_quals (type
),
12343 case DECLTYPE_TYPE
:
12347 ++cp_unevaluated_operand
;
12348 ++c_inhibit_evaluation_warnings
;
12350 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12351 complain
|tf_decltype
, in_decl
,
12352 /*function_p*/false,
12353 /*integral_constant_expression*/false);
12355 --cp_unevaluated_operand
;
12356 --c_inhibit_evaluation_warnings
;
12358 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12359 type
= lambda_capture_field_type (type
,
12360 DECLTYPE_FOR_INIT_CAPTURE (t
));
12361 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12362 type
= lambda_proxy_type (type
);
12365 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12366 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12368 /* In a template ~id could be either a complement expression
12369 or an unqualified-id naming a destructor; if instantiating
12370 it produces an expression, it's not an id-expression or
12373 type
= finish_decltype_type (type
, id
, complain
);
12375 return cp_build_qualified_type_real (type
,
12377 | cp_type_quals (type
),
12381 case UNDERLYING_TYPE
:
12383 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12384 complain
, in_decl
);
12385 return finish_underlying_type (type
);
12388 case TYPE_ARGUMENT_PACK
:
12389 case NONTYPE_ARGUMENT_PACK
:
12391 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12393 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12397 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12399 /* For template nontype argument packs, also substitute into
12401 if (code
== NONTYPE_ARGUMENT_PACK
)
12402 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12421 /* We should use one of the expression tsubsts for these codes. */
12422 gcc_unreachable ();
12425 sorry ("use of %qs in template", get_tree_code_name (code
));
12426 return error_mark_node
;
12430 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12431 type of the expression on the left-hand side of the "." or "->"
12435 tsubst_baselink (tree baselink
, tree object_type
,
12436 tree args
, tsubst_flags_t complain
, tree in_decl
)
12439 tree qualifying_scope
;
12442 tree template_args
= 0;
12443 bool template_id_p
= false;
12444 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12446 /* A baselink indicates a function from a base class. Both the
12447 BASELINK_ACCESS_BINFO and the base class referenced may
12448 indicate bases of the template class, rather than the
12449 instantiated class. In addition, lookups that were not
12450 ambiguous before may be ambiguous now. Therefore, we perform
12451 the lookup again. */
12452 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12453 qualifying_scope
= tsubst (qualifying_scope
, args
,
12454 complain
, in_decl
);
12455 fns
= BASELINK_FUNCTIONS (baselink
);
12456 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12457 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12459 template_id_p
= true;
12460 template_args
= TREE_OPERAND (fns
, 1);
12461 fns
= TREE_OPERAND (fns
, 0);
12463 template_args
= tsubst_template_args (template_args
, args
,
12464 complain
, in_decl
);
12466 name
= DECL_NAME (get_first_fn (fns
));
12467 if (IDENTIFIER_TYPENAME_P (name
))
12468 name
= mangle_conv_op_name_for_type (optype
);
12469 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12471 return error_mark_node
;
12473 /* If lookup found a single function, mark it as used at this
12474 point. (If it lookup found multiple functions the one selected
12475 later by overload resolution will be marked as used at that
12477 if (BASELINK_P (baselink
))
12478 fns
= BASELINK_FUNCTIONS (baselink
);
12479 if (!template_id_p
&& !really_overloaded_fn (fns
))
12480 mark_used (OVL_CURRENT (fns
));
12482 /* Add back the template arguments, if present. */
12483 if (BASELINK_P (baselink
) && template_id_p
)
12484 BASELINK_FUNCTIONS (baselink
)
12485 = build_nt (TEMPLATE_ID_EXPR
,
12486 BASELINK_FUNCTIONS (baselink
),
12488 /* Update the conversion operator type. */
12489 BASELINK_OPTYPE (baselink
) = optype
;
12492 object_type
= current_class_type
;
12495 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12501 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12502 true if the qualified-id will be a postfix-expression in-and-of
12503 itself; false if more of the postfix-expression follows the
12504 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12508 tsubst_qualified_id (tree qualified_id
, tree args
,
12509 tsubst_flags_t complain
, tree in_decl
,
12510 bool done
, bool address_p
)
12516 tree template_args
;
12517 location_t loc
= UNKNOWN_LOCATION
;
12519 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12521 /* Figure out what name to look up. */
12522 name
= TREE_OPERAND (qualified_id
, 1);
12523 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12525 is_template
= true;
12526 loc
= EXPR_LOCATION (name
);
12527 template_args
= TREE_OPERAND (name
, 1);
12529 template_args
= tsubst_template_args (template_args
, args
,
12530 complain
, in_decl
);
12531 name
= TREE_OPERAND (name
, 0);
12535 is_template
= false;
12536 template_args
= NULL_TREE
;
12539 /* Substitute into the qualifying scope. When there are no ARGS, we
12540 are just trying to simplify a non-dependent expression. In that
12541 case the qualifying scope may be dependent, and, in any case,
12542 substituting will not help. */
12543 scope
= TREE_OPERAND (qualified_id
, 0);
12546 scope
= tsubst (scope
, args
, complain
, in_decl
);
12547 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12552 if (dependent_scope_p (scope
))
12555 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12556 return build_qualified_name (NULL_TREE
, scope
, expr
,
12557 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12560 if (!BASELINK_P (name
) && !DECL_P (expr
))
12562 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12564 /* A BIT_NOT_EXPR is used to represent a destructor. */
12565 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12567 error ("qualifying type %qT does not match destructor name ~%qT",
12568 scope
, TREE_OPERAND (expr
, 0));
12569 expr
= error_mark_node
;
12572 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12573 /*is_type_p=*/0, false);
12576 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12577 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12578 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12580 if (complain
& tf_error
)
12582 error ("dependent-name %qE is parsed as a non-type, but "
12583 "instantiation yields a type", qualified_id
);
12584 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12586 return error_mark_node
;
12592 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12594 /* Remember that there was a reference to this entity. */
12598 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12600 if (complain
& tf_error
)
12601 qualified_name_lookup_error (scope
,
12602 TREE_OPERAND (qualified_id
, 1),
12603 expr
, input_location
);
12604 return error_mark_node
;
12608 expr
= lookup_template_function (expr
, template_args
);
12610 if (expr
== error_mark_node
&& complain
& tf_error
)
12611 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12612 expr
, input_location
);
12613 else if (TYPE_P (scope
))
12615 expr
= (adjust_result_of_qualified_name_lookup
12616 (expr
, scope
, current_nonlambda_class_type ()));
12617 expr
= (finish_qualified_id_expr
12618 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12619 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12620 /*template_arg_p=*/false, complain
));
12623 /* Expressions do not generally have reference type. */
12624 if (TREE_CODE (expr
) != SCOPE_REF
12625 /* However, if we're about to form a pointer-to-member, we just
12626 want the referenced member referenced. */
12627 && TREE_CODE (expr
) != OFFSET_REF
)
12628 expr
= convert_from_reference (expr
);
12633 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
12634 initializer, DECL is the substituted VAR_DECL. Other arguments are as
12638 tsubst_init (tree init
, tree decl
, tree args
,
12639 tsubst_flags_t complain
, tree in_decl
)
12644 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
12648 /* If we had an initializer but it
12649 instantiated to nothing,
12650 value-initialize the object. This will
12651 only occur when the initializer was a
12652 pack expansion where the parameter packs
12653 used in that expansion were of length
12655 init
= build_value_init (TREE_TYPE (decl
),
12657 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12658 init
= get_target_expr_sfinae (init
, complain
);
12664 /* Like tsubst, but deals with expressions. This function just replaces
12665 template parms; to finish processing the resultant expression, use
12666 tsubst_copy_and_build or tsubst_expr. */
12669 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12671 enum tree_code code
;
12674 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12677 code
= TREE_CODE (t
);
12682 r
= retrieve_local_specialization (t
);
12684 if (r
== NULL_TREE
)
12686 /* We get here for a use of 'this' in an NSDMI. */
12687 if (DECL_NAME (t
) == this_identifier
12688 && current_function_decl
12689 && DECL_CONSTRUCTOR_P (current_function_decl
))
12690 return current_class_ptr
;
12692 /* This can happen for a parameter name used later in a function
12693 declaration (such as in a late-specified return type). Just
12694 make a dummy decl, since it's only used for its type. */
12695 gcc_assert (cp_unevaluated_operand
!= 0);
12696 r
= tsubst_decl (t
, args
, complain
);
12697 /* Give it the template pattern as its context; its true context
12698 hasn't been instantiated yet and this is good enough for
12700 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12703 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12704 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12713 if (DECL_TEMPLATE_PARM_P (t
))
12714 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12715 /* There is no need to substitute into namespace-scope
12717 if (DECL_NAMESPACE_SCOPE_P (t
))
12719 /* If ARGS is NULL, then T is known to be non-dependent. */
12720 if (args
== NULL_TREE
)
12721 return integral_constant_value (t
);
12723 /* Unfortunately, we cannot just call lookup_name here.
12726 template <int I> int f() {
12728 struct S { void g() { E e = a; } };
12731 When we instantiate f<7>::S::g(), say, lookup_name is not
12732 clever enough to find f<7>::a. */
12734 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12735 /*entering_scope=*/0);
12737 for (v
= TYPE_VALUES (enum_type
);
12739 v
= TREE_CHAIN (v
))
12740 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12741 return TREE_VALUE (v
);
12743 /* We didn't find the name. That should never happen; if
12744 name-lookup found it during preliminary parsing, we
12745 should find it again here during instantiation. */
12746 gcc_unreachable ();
12751 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12753 /* Check for a local specialization set up by
12754 tsubst_pack_expansion. */
12755 if (tree r
= retrieve_local_specialization (t
))
12757 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12758 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12762 /* When retrieving a capture pack from a generic lambda, remove the
12763 lambda call op's own template argument list from ARGS. Only the
12764 template arguments active for the closure type should be used to
12765 retrieve the pack specialization. */
12766 if (LAMBDA_FUNCTION_P (current_function_decl
)
12767 && (template_class_depth (DECL_CONTEXT (t
))
12768 != TMPL_ARGS_DEPTH (args
)))
12769 args
= strip_innermost_template_args (args
, 1);
12771 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12772 tsubst_decl put in the hash table. */
12773 return retrieve_specialization (t
, args
, 0);
12776 if (DECL_CONTEXT (t
))
12780 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12781 /*entering_scope=*/1);
12782 if (ctx
!= DECL_CONTEXT (t
))
12784 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12787 if (complain
& tf_error
)
12788 error ("using invalid field %qD", t
);
12789 return error_mark_node
;
12798 case FUNCTION_DECL
:
12799 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12800 r
= tsubst (t
, args
, complain
, in_decl
);
12801 else if (local_variable_p (t
))
12803 r
= retrieve_local_specialization (t
);
12804 if (r
== NULL_TREE
)
12806 /* First try name lookup to find the instantiation. */
12807 r
= lookup_name (DECL_NAME (t
));
12810 /* Make sure that the one we found is the one we want. */
12811 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
12812 complain
, in_decl
);
12813 if (ctx
!= DECL_CONTEXT (r
))
12821 /* This can happen for a variable used in a
12822 late-specified return type of a local lambda, or for a
12823 local static or constant. Building a new VAR_DECL
12824 should be OK in all those cases. */
12825 r
= tsubst_decl (t
, args
, complain
);
12826 if (decl_maybe_constant_var_p (r
))
12828 /* We can't call cp_finish_decl, so handle the
12829 initializer by hand. */
12830 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
12831 complain
, in_decl
);
12832 if (!processing_template_decl
)
12833 init
= maybe_constant_init (init
);
12834 if (processing_template_decl
12835 ? potential_constant_expression (init
)
12836 : reduced_constant_expression_p (init
))
12837 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
12838 = TREE_CONSTANT (r
) = true;
12839 DECL_INITIAL (r
) = init
;
12841 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
12842 || decl_constant_var_p (r
)
12843 || errorcount
|| sorrycount
);
12844 if (!processing_template_decl
)
12846 if (TREE_STATIC (r
))
12847 rest_of_decl_compilation (r
, toplevel_bindings_p (),
12849 else if (decl_constant_var_p (r
))
12850 /* A use of a local constant decays to its value.
12851 FIXME update for core DR 696. */
12852 r
= integral_constant_value (r
);
12855 /* Remember this for subsequent uses. */
12856 if (local_specializations
)
12857 register_local_specialization (r
, t
);
12865 case NAMESPACE_DECL
:
12869 /* An OVERLOAD will always be a non-dependent overload set; an
12870 overload set from function scope will just be represented with an
12871 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12872 gcc_assert (!uses_template_parms (t
));
12876 return tsubst_baselink (t
, current_nonlambda_class_type (),
12877 args
, complain
, in_decl
);
12879 case TEMPLATE_DECL
:
12880 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12881 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12882 args
, complain
, in_decl
);
12883 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12884 return tsubst (t
, args
, complain
, in_decl
);
12885 else if (DECL_CLASS_SCOPE_P (t
)
12886 && uses_template_parms (DECL_CONTEXT (t
)))
12888 /* Template template argument like the following example need
12891 template <template <class> class TT> struct C {};
12892 template <class T> struct D {
12893 template <class U> struct E {};
12898 We are processing the template argument `E' in #1 for
12899 the template instantiation #2. Originally, `E' is a
12900 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12901 have to substitute this with one having context `D<int>'. */
12903 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12904 return lookup_field (context
, DECL_NAME(t
), 0, false);
12907 /* Ordinary template template argument. */
12911 case REINTERPRET_CAST_EXPR
:
12912 case CONST_CAST_EXPR
:
12913 case STATIC_CAST_EXPR
:
12914 case DYNAMIC_CAST_EXPR
:
12915 case IMPLICIT_CONV_EXPR
:
12919 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12920 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12921 return build1 (code
, type
, op0
);
12925 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12928 tree expanded
, op
= TREE_OPERAND (t
, 0);
12931 if (SIZEOF_EXPR_TYPE_P (t
))
12932 op
= TREE_TYPE (op
);
12934 ++cp_unevaluated_operand
;
12935 ++c_inhibit_evaluation_warnings
;
12936 /* We only want to compute the number of arguments. */
12937 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12938 --cp_unevaluated_operand
;
12939 --c_inhibit_evaluation_warnings
;
12941 if (TREE_CODE (expanded
) == TREE_VEC
)
12942 len
= TREE_VEC_LENGTH (expanded
);
12944 if (expanded
== error_mark_node
)
12945 return error_mark_node
;
12946 else if (PACK_EXPANSION_P (expanded
)
12947 || (TREE_CODE (expanded
) == TREE_VEC
12949 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12951 if (TREE_CODE (expanded
) == TREE_VEC
)
12952 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12954 if (TYPE_P (expanded
))
12955 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12956 complain
& tf_error
);
12958 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12959 complain
& tf_error
);
12962 return build_int_cst (size_type_node
, len
);
12964 if (SIZEOF_EXPR_TYPE_P (t
))
12966 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
12967 args
, complain
, in_decl
);
12968 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
12969 r
= build1 (SIZEOF_EXPR
,
12970 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
12971 SIZEOF_EXPR_TYPE_P (r
) = 1;
12978 case TRUTH_NOT_EXPR
:
12981 case UNARY_PLUS_EXPR
: /* Unary + */
12983 case AT_ENCODE_EXPR
:
12987 case REALPART_EXPR
:
12988 case IMAGPART_EXPR
:
12991 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12992 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12993 return build1 (code
, type
, op0
);
12996 case COMPONENT_REF
:
13001 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13002 name
= TREE_OPERAND (t
, 1);
13003 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13005 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13006 complain
, in_decl
);
13007 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13009 else if (TREE_CODE (name
) == SCOPE_REF
13010 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13012 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13013 complain
, in_decl
);
13014 name
= TREE_OPERAND (name
, 1);
13015 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13016 complain
, in_decl
);
13017 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13018 name
= build_qualified_name (/*type=*/NULL_TREE
,
13020 /*template_p=*/false);
13022 else if (BASELINK_P (name
))
13023 name
= tsubst_baselink (name
,
13024 non_reference (TREE_TYPE (object
)),
13028 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13029 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13035 case TRUNC_DIV_EXPR
:
13036 case CEIL_DIV_EXPR
:
13037 case FLOOR_DIV_EXPR
:
13038 case ROUND_DIV_EXPR
:
13039 case EXACT_DIV_EXPR
:
13043 case TRUNC_MOD_EXPR
:
13044 case FLOOR_MOD_EXPR
:
13045 case TRUTH_ANDIF_EXPR
:
13046 case TRUTH_ORIF_EXPR
:
13047 case TRUTH_AND_EXPR
:
13048 case TRUTH_OR_EXPR
:
13061 case COMPOUND_EXPR
:
13064 case PREDECREMENT_EXPR
:
13065 case PREINCREMENT_EXPR
:
13066 case POSTDECREMENT_EXPR
:
13067 case POSTINCREMENT_EXPR
:
13069 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13070 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13071 return build_nt (code
, op0
, op1
);
13076 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13077 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13078 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13079 QUALIFIED_NAME_IS_TEMPLATE (t
));
13084 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13085 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13086 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13091 int n
= VL_EXP_OPERAND_LENGTH (t
);
13092 tree result
= build_vl_exp (CALL_EXPR
, n
);
13094 for (i
= 0; i
< n
; i
++)
13095 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13096 complain
, in_decl
);
13102 case PSEUDO_DTOR_EXPR
:
13103 case VEC_PERM_EXPR
:
13105 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13106 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13107 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13108 r
= build_nt (code
, op0
, op1
, op2
);
13109 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13115 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13116 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13117 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13118 r
= build_nt (code
, op0
, op1
, op2
);
13119 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13125 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13126 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13127 r
= build_nt (code
, op0
, op1
);
13128 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13129 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13133 case TEMPLATE_ID_EXPR
:
13135 /* Substituted template arguments */
13136 tree fn
= TREE_OPERAND (t
, 0);
13137 tree targs
= TREE_OPERAND (t
, 1);
13139 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13141 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13143 return lookup_template_function (fn
, targs
);
13148 tree purpose
, value
, chain
;
13150 if (t
== void_list_node
)
13153 purpose
= TREE_PURPOSE (t
);
13155 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13156 value
= TREE_VALUE (t
);
13158 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13159 chain
= TREE_CHAIN (t
);
13160 if (chain
&& chain
!= void_type_node
)
13161 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13162 if (purpose
== TREE_PURPOSE (t
)
13163 && value
== TREE_VALUE (t
)
13164 && chain
== TREE_CHAIN (t
))
13166 return tree_cons (purpose
, value
, chain
);
13171 case ENUMERAL_TYPE
:
13173 case TEMPLATE_TYPE_PARM
:
13174 case TEMPLATE_TEMPLATE_PARM
:
13175 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13176 case TEMPLATE_PARM_INDEX
:
13178 case REFERENCE_TYPE
:
13180 case FUNCTION_TYPE
:
13183 case TYPENAME_TYPE
:
13184 case UNBOUND_CLASS_TEMPLATE
:
13186 case DECLTYPE_TYPE
:
13188 return tsubst (t
, args
, complain
, in_decl
);
13192 /* Fall through. */
13193 case IDENTIFIER_NODE
:
13194 if (IDENTIFIER_TYPENAME_P (t
))
13196 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13197 return mangle_conv_op_name_for_type (new_type
);
13203 /* This is handled by tsubst_copy_and_build. */
13204 gcc_unreachable ();
13208 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13209 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13210 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13213 case CLEANUP_POINT_EXPR
:
13214 /* We shouldn't have built any of these during initial template
13215 generation. Instead, they should be built during instantiation
13216 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13217 gcc_unreachable ();
13221 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13222 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13223 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13224 r
= build2 (code
, type
, op0
, op1
);
13225 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13226 mark_used (TREE_OPERAND (r
, 1));
13230 case EXPR_PACK_EXPANSION
:
13231 error ("invalid use of pack expansion expression");
13232 return error_mark_node
;
13234 case NONTYPE_ARGUMENT_PACK
:
13235 error ("use %<...%> to expand argument pack");
13236 return error_mark_node
;
13239 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
13247 /* Instantiate any typedefs in the type. */
13248 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13249 r
= fold_convert (type
, t
);
13250 gcc_assert (TREE_CODE (r
) == code
);
13255 /* These can sometimes show up in a partial instantiation, but never
13256 involve template parms. */
13257 gcc_assert (!uses_template_parms (t
));
13261 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13262 gcc_checking_assert (false);
13267 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13270 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13271 tree args
, tsubst_flags_t complain
, tree in_decl
)
13273 tree new_clauses
= NULL
, nc
, oc
;
13275 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13277 nc
= copy_node (oc
);
13278 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13281 switch (OMP_CLAUSE_CODE (nc
))
13283 case OMP_CLAUSE_LASTPRIVATE
:
13284 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13286 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13287 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13288 in_decl
, /*integral_constant_expression_p=*/false);
13289 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13290 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13293 case OMP_CLAUSE_PRIVATE
:
13294 case OMP_CLAUSE_SHARED
:
13295 case OMP_CLAUSE_FIRSTPRIVATE
:
13296 case OMP_CLAUSE_COPYIN
:
13297 case OMP_CLAUSE_COPYPRIVATE
:
13298 case OMP_CLAUSE_IF
:
13299 case OMP_CLAUSE_NUM_THREADS
:
13300 case OMP_CLAUSE_SCHEDULE
:
13301 case OMP_CLAUSE_COLLAPSE
:
13302 case OMP_CLAUSE_FINAL
:
13303 case OMP_CLAUSE_DEPEND
:
13304 case OMP_CLAUSE_FROM
:
13305 case OMP_CLAUSE_TO
:
13306 case OMP_CLAUSE_UNIFORM
:
13307 case OMP_CLAUSE_MAP
:
13308 case OMP_CLAUSE_DEVICE
:
13309 case OMP_CLAUSE_DIST_SCHEDULE
:
13310 case OMP_CLAUSE_NUM_TEAMS
:
13311 case OMP_CLAUSE_THREAD_LIMIT
:
13312 case OMP_CLAUSE_SAFELEN
:
13313 case OMP_CLAUSE_SIMDLEN
:
13314 OMP_CLAUSE_OPERAND (nc
, 0)
13315 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13316 in_decl
, /*integral_constant_expression_p=*/false);
13318 case OMP_CLAUSE_REDUCTION
:
13319 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13321 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13322 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13324 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13325 complain
, in_decl
);
13326 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13327 = build_qualified_name (NULL_TREE
, scope
,
13328 TREE_OPERAND (placeholder
, 1),
13332 gcc_assert (identifier_p (placeholder
));
13334 OMP_CLAUSE_OPERAND (nc
, 0)
13335 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13336 in_decl
, /*integral_constant_expression_p=*/false);
13338 case OMP_CLAUSE_LINEAR
:
13339 case OMP_CLAUSE_ALIGNED
:
13340 OMP_CLAUSE_OPERAND (nc
, 0)
13341 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13342 in_decl
, /*integral_constant_expression_p=*/false);
13343 OMP_CLAUSE_OPERAND (nc
, 1)
13344 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13345 in_decl
, /*integral_constant_expression_p=*/false);
13348 case OMP_CLAUSE_NOWAIT
:
13349 case OMP_CLAUSE_ORDERED
:
13350 case OMP_CLAUSE_DEFAULT
:
13351 case OMP_CLAUSE_UNTIED
:
13352 case OMP_CLAUSE_MERGEABLE
:
13353 case OMP_CLAUSE_INBRANCH
:
13354 case OMP_CLAUSE_NOTINBRANCH
:
13355 case OMP_CLAUSE_PROC_BIND
:
13356 case OMP_CLAUSE_FOR
:
13357 case OMP_CLAUSE_PARALLEL
:
13358 case OMP_CLAUSE_SECTIONS
:
13359 case OMP_CLAUSE_TASKGROUP
:
13362 gcc_unreachable ();
13366 new_clauses
= nreverse (new_clauses
);
13368 new_clauses
= finish_omp_clauses (new_clauses
);
13369 return new_clauses
;
13372 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13375 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13378 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13380 tree purpose
, value
, chain
;
13385 if (TREE_CODE (t
) != TREE_LIST
)
13386 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13387 /*function_p=*/false,
13388 /*integral_constant_expression_p=*/false);
13390 if (t
== void_list_node
)
13393 purpose
= TREE_PURPOSE (t
);
13395 purpose
= RECUR (purpose
);
13396 value
= TREE_VALUE (t
);
13399 if (TREE_CODE (value
) != LABEL_DECL
)
13400 value
= RECUR (value
);
13403 value
= lookup_label (DECL_NAME (value
));
13404 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13405 TREE_USED (value
) = 1;
13408 chain
= TREE_CHAIN (t
);
13409 if (chain
&& chain
!= void_type_node
)
13410 chain
= RECUR (chain
);
13411 return tree_cons (purpose
, value
, chain
);
13415 /* Substitute one OMP_FOR iterator. */
13418 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13419 tree condv
, tree incrv
, tree
*clauses
,
13420 tree args
, tsubst_flags_t complain
, tree in_decl
,
13421 bool integral_constant_expression_p
)
13423 #define RECUR(NODE) \
13424 tsubst_expr ((NODE), args, complain, in_decl, \
13425 integral_constant_expression_p)
13426 tree decl
, init
, cond
, incr
;
13428 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13429 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13430 decl
= TREE_OPERAND (init
, 0);
13431 init
= TREE_OPERAND (init
, 1);
13432 tree decl_expr
= NULL_TREE
;
13433 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13435 /* We need to jump through some hoops to handle declarations in the
13436 for-init-statement, since we might need to handle auto deduction,
13437 but we need to keep control of initialization. */
13439 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13440 decl
= tsubst_decl (decl
, args
, complain
);
13443 decl
= RECUR (decl
);
13444 init
= RECUR (init
);
13446 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13447 if (auto_node
&& init
)
13449 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13451 gcc_assert (!type_dependent_expression_p (decl
));
13453 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13457 /* Declare the variable, but don't let that initialize it. */
13458 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13459 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13461 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13464 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13465 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13466 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13468 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13469 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
13470 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
13471 NOP_EXPR
, rhs
, complain
);
13474 incr
= RECUR (incr
);
13475 TREE_VEC_ELT (declv
, i
) = decl
;
13476 TREE_VEC_ELT (initv
, i
) = init
;
13477 TREE_VEC_ELT (condv
, i
) = cond
;
13478 TREE_VEC_ELT (incrv
, i
) = incr
;
13484 /* Declare and initialize the variable. */
13491 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13493 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13494 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13495 && OMP_CLAUSE_DECL (c
) == decl
)
13497 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13498 && OMP_CLAUSE_DECL (c
) == decl
)
13499 error ("iteration variable %qD should not be firstprivate", decl
);
13500 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13501 && OMP_CLAUSE_DECL (c
) == decl
)
13502 error ("iteration variable %qD should not be reduction", decl
);
13506 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13507 OMP_CLAUSE_DECL (c
) = decl
;
13508 c
= finish_omp_clauses (c
);
13511 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13516 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13517 if (COMPARISON_CLASS_P (cond
))
13519 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
13520 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
13521 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
13524 cond
= RECUR (cond
);
13525 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13526 switch (TREE_CODE (incr
))
13528 case PREINCREMENT_EXPR
:
13529 case PREDECREMENT_EXPR
:
13530 case POSTINCREMENT_EXPR
:
13531 case POSTDECREMENT_EXPR
:
13532 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13533 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13536 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13537 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13539 tree rhs
= TREE_OPERAND (incr
, 1);
13540 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13541 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13542 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13543 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13544 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13548 incr
= RECUR (incr
);
13551 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13552 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13554 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13555 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13556 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13557 TREE_TYPE (decl
), lhs
,
13558 RECUR (TREE_OPERAND (incr
, 2))));
13560 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13561 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13562 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13564 tree rhs
= TREE_OPERAND (incr
, 2);
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 incr
= RECUR (incr
);
13580 TREE_VEC_ELT (declv
, i
) = decl
;
13581 TREE_VEC_ELT (initv
, i
) = init
;
13582 TREE_VEC_ELT (condv
, i
) = cond
;
13583 TREE_VEC_ELT (incrv
, i
) = incr
;
13587 /* Like tsubst_copy for expressions, etc. but also does semantic
13591 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13592 bool integral_constant_expression_p
)
13594 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13595 #define RECUR(NODE) \
13596 tsubst_expr ((NODE), args, complain, in_decl, \
13597 integral_constant_expression_p)
13603 if (t
== NULL_TREE
|| t
== error_mark_node
)
13606 loc
= input_location
;
13607 if (EXPR_HAS_LOCATION (t
))
13608 input_location
= EXPR_LOCATION (t
);
13609 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13610 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13612 switch (TREE_CODE (t
))
13614 case STATEMENT_LIST
:
13616 tree_stmt_iterator i
;
13617 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13618 RECUR (tsi_stmt (i
));
13622 case CTOR_INITIALIZER
:
13623 finish_mem_initializers (tsubst_initializer_list
13624 (TREE_OPERAND (t
, 0), args
));
13628 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13632 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13633 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13634 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13636 finish_expr_stmt (tmp
);
13640 do_using_directive (USING_STMT_NAMESPACE (t
));
13645 tree decl
, pattern_decl
;
13648 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13649 if (TREE_CODE (decl
) == LABEL_DECL
)
13650 finish_label_decl (DECL_NAME (decl
));
13651 else if (TREE_CODE (decl
) == USING_DECL
)
13653 tree scope
= USING_DECL_SCOPE (decl
);
13654 tree name
= DECL_NAME (decl
);
13657 scope
= tsubst (scope
, args
, complain
, in_decl
);
13658 decl
= lookup_qualified_name (scope
, name
,
13659 /*is_type_p=*/false,
13660 /*complain=*/false);
13661 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13662 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13664 do_local_using_decl (decl
, scope
, name
);
13666 else if (DECL_PACK_P (decl
))
13668 /* Don't build up decls for a variadic capture proxy, we'll
13669 instantiate the elements directly as needed. */
13674 init
= DECL_INITIAL (decl
);
13675 decl
= tsubst (decl
, args
, complain
, in_decl
);
13676 if (decl
!= error_mark_node
)
13678 /* By marking the declaration as instantiated, we avoid
13679 trying to instantiate it. Since instantiate_decl can't
13680 handle local variables, and since we've already done
13681 all that needs to be done, that's the right thing to
13684 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13686 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13687 /* Anonymous aggregates are a special case. */
13688 finish_anon_union (decl
);
13689 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13691 DECL_CONTEXT (decl
) = current_function_decl
;
13692 if (DECL_NAME (decl
) == this_identifier
)
13694 tree lam
= DECL_CONTEXT (current_function_decl
);
13695 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13696 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13698 insert_capture_proxy (decl
);
13700 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13701 /* We already did a pushtag. */;
13702 else if (TREE_CODE (decl
) == FUNCTION_DECL
13703 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
13704 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
13706 DECL_CONTEXT (decl
) = NULL_TREE
;
13708 DECL_CONTEXT (decl
) = current_function_decl
;
13709 cp_check_omp_declare_reduction (decl
);
13713 int const_init
= false;
13714 maybe_push_decl (decl
);
13716 && DECL_PRETTY_FUNCTION_P (decl
))
13718 /* For __PRETTY_FUNCTION__ we have to adjust the
13720 const char *const name
13721 = cxx_printable_name (current_function_decl
, 2);
13722 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
13725 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
13728 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13730 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13739 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13740 RECUR (FOR_INIT_STMT (t
));
13741 finish_for_init_stmt (stmt
);
13742 tmp
= RECUR (FOR_COND (t
));
13743 finish_for_cond (tmp
, stmt
, false);
13744 tmp
= RECUR (FOR_EXPR (t
));
13745 finish_for_expr (tmp
, stmt
);
13746 RECUR (FOR_BODY (t
));
13747 finish_for_stmt (stmt
);
13750 case RANGE_FOR_STMT
:
13753 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13754 decl
= RANGE_FOR_DECL (t
);
13755 decl
= tsubst (decl
, args
, complain
, in_decl
);
13756 maybe_push_decl (decl
);
13757 expr
= RECUR (RANGE_FOR_EXPR (t
));
13758 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
13759 RECUR (RANGE_FOR_BODY (t
));
13760 finish_for_stmt (stmt
);
13765 stmt
= begin_while_stmt ();
13766 tmp
= RECUR (WHILE_COND (t
));
13767 finish_while_stmt_cond (tmp
, stmt
, false);
13768 RECUR (WHILE_BODY (t
));
13769 finish_while_stmt (stmt
);
13773 stmt
= begin_do_stmt ();
13774 RECUR (DO_BODY (t
));
13775 finish_do_body (stmt
);
13776 tmp
= RECUR (DO_COND (t
));
13777 finish_do_stmt (tmp
, stmt
, false);
13781 stmt
= begin_if_stmt ();
13782 tmp
= RECUR (IF_COND (t
));
13783 finish_if_stmt_cond (tmp
, stmt
);
13784 RECUR (THEN_CLAUSE (t
));
13785 finish_then_clause (stmt
);
13787 if (ELSE_CLAUSE (t
))
13789 begin_else_clause (stmt
);
13790 RECUR (ELSE_CLAUSE (t
));
13791 finish_else_clause (stmt
);
13794 finish_if_stmt (stmt
);
13798 if (BIND_EXPR_BODY_BLOCK (t
))
13799 stmt
= begin_function_body ();
13801 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13802 ? BCS_TRY_BLOCK
: 0);
13804 RECUR (BIND_EXPR_BODY (t
));
13806 if (BIND_EXPR_BODY_BLOCK (t
))
13807 finish_function_body (stmt
);
13809 finish_compound_stmt (stmt
);
13813 finish_break_stmt ();
13816 case CONTINUE_STMT
:
13817 finish_continue_stmt ();
13821 stmt
= begin_switch_stmt ();
13822 tmp
= RECUR (SWITCH_STMT_COND (t
));
13823 finish_switch_cond (tmp
, stmt
);
13824 RECUR (SWITCH_STMT_BODY (t
));
13825 finish_switch_stmt (stmt
);
13828 case CASE_LABEL_EXPR
:
13830 tree low
= RECUR (CASE_LOW (t
));
13831 tree high
= RECUR (CASE_HIGH (t
));
13832 finish_case_label (EXPR_LOCATION (t
), low
, high
);
13838 tree decl
= LABEL_EXPR_LABEL (t
);
13841 label
= finish_label_stmt (DECL_NAME (decl
));
13842 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13843 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13848 tmp
= GOTO_DESTINATION (t
);
13849 if (TREE_CODE (tmp
) != LABEL_DECL
)
13850 /* Computed goto's must be tsubst'd into. On the other hand,
13851 non-computed gotos must not be; the identifier in question
13852 will have no binding. */
13855 tmp
= DECL_NAME (tmp
);
13856 finish_goto_stmt (tmp
);
13861 tree string
= RECUR (ASM_STRING (t
));
13862 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
13863 complain
, in_decl
);
13864 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
13865 complain
, in_decl
);
13866 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
13867 complain
, in_decl
);
13868 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
13869 complain
, in_decl
);
13870 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
13872 tree asm_expr
= tmp
;
13873 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13874 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13875 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13882 stmt
= begin_try_block ();
13883 RECUR (TRY_STMTS (t
));
13884 finish_cleanup_try_block (stmt
);
13885 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13889 tree compound_stmt
= NULL_TREE
;
13891 if (FN_TRY_BLOCK_P (t
))
13892 stmt
= begin_function_try_block (&compound_stmt
);
13894 stmt
= begin_try_block ();
13896 RECUR (TRY_STMTS (t
));
13898 if (FN_TRY_BLOCK_P (t
))
13899 finish_function_try_block (stmt
);
13901 finish_try_block (stmt
);
13903 RECUR (TRY_HANDLERS (t
));
13904 if (FN_TRY_BLOCK_P (t
))
13905 finish_function_handler_sequence (stmt
, compound_stmt
);
13907 finish_handler_sequence (stmt
);
13913 tree decl
= HANDLER_PARMS (t
);
13917 decl
= tsubst (decl
, args
, complain
, in_decl
);
13918 /* Prevent instantiate_decl from trying to instantiate
13919 this variable. We've already done all that needs to be
13921 if (decl
!= error_mark_node
)
13922 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13924 stmt
= begin_handler ();
13925 finish_handler_parms (decl
, stmt
);
13926 RECUR (HANDLER_BODY (t
));
13927 finish_handler (stmt
);
13932 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13933 if (CLASS_TYPE_P (tmp
))
13935 /* Local classes are not independent templates; they are
13936 instantiated along with their containing function. And this
13937 way we don't have to deal with pushing out of one local class
13938 to instantiate a member of another local class. */
13940 /* Closures are handled by the LAMBDA_EXPR. */
13941 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13942 complete_type (tmp
);
13943 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13944 if (!DECL_ARTIFICIAL (fn
))
13945 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13949 case STATIC_ASSERT
:
13953 ++c_inhibit_evaluation_warnings
;
13955 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13958 /*integral_constant_expression_p=*/true);
13959 --c_inhibit_evaluation_warnings
;
13961 finish_static_assert (condition
,
13962 STATIC_ASSERT_MESSAGE (t
),
13963 STATIC_ASSERT_SOURCE_LOCATION (t
),
13964 /*member_p=*/false);
13969 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
13970 args
, complain
, in_decl
);
13971 stmt
= begin_omp_parallel ();
13972 RECUR (OMP_PARALLEL_BODY (t
));
13973 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
13974 = OMP_PARALLEL_COMBINED (t
);
13978 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
13979 args
, complain
, in_decl
);
13980 stmt
= begin_omp_task ();
13981 RECUR (OMP_TASK_BODY (t
));
13982 finish_omp_task (tmp
, stmt
);
13988 case OMP_DISTRIBUTE
:
13990 tree clauses
, body
, pre_body
;
13991 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
13992 tree incrv
= NULL_TREE
;
13995 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
13996 args
, complain
, in_decl
);
13997 if (OMP_FOR_INIT (t
) != NULL_TREE
)
13999 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14000 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14001 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14002 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14005 stmt
= begin_omp_structured_block ();
14007 pre_body
= push_stmt_list ();
14008 RECUR (OMP_FOR_PRE_BODY (t
));
14009 pre_body
= pop_stmt_list (pre_body
);
14011 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14012 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14013 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14014 &clauses
, args
, complain
, in_decl
,
14015 integral_constant_expression_p
);
14017 body
= push_stmt_list ();
14018 RECUR (OMP_FOR_BODY (t
));
14019 body
= pop_stmt_list (body
);
14021 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14022 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14023 condv
, incrv
, body
, pre_body
, clauses
);
14026 t
= make_node (TREE_CODE (t
));
14027 TREE_TYPE (t
) = void_type_node
;
14028 OMP_FOR_BODY (t
) = body
;
14029 OMP_FOR_PRE_BODY (t
) = pre_body
;
14030 OMP_FOR_CLAUSES (t
) = clauses
;
14031 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14035 add_stmt (finish_omp_structured_block (stmt
));
14042 case OMP_TARGET_DATA
:
14044 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14045 args
, complain
, in_decl
);
14046 stmt
= push_stmt_list ();
14047 RECUR (OMP_BODY (t
));
14048 stmt
= pop_stmt_list (stmt
);
14051 OMP_BODY (t
) = stmt
;
14052 OMP_CLAUSES (t
) = tmp
;
14056 case OMP_TARGET_UPDATE
:
14057 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14058 args
, complain
, in_decl
);
14060 OMP_CLAUSES (t
) = tmp
;
14067 case OMP_TASKGROUP
:
14069 stmt
= push_stmt_list ();
14070 RECUR (OMP_BODY (t
));
14071 stmt
= pop_stmt_list (stmt
);
14074 OMP_BODY (t
) = stmt
;
14079 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14080 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14082 tree op1
= TREE_OPERAND (t
, 1);
14083 tree rhs1
= NULL_TREE
;
14085 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14087 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14088 op1
= TREE_OPERAND (op1
, 1);
14090 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14091 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14092 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14093 NULL_TREE
, NULL_TREE
, rhs1
,
14094 OMP_ATOMIC_SEQ_CST (t
));
14098 tree op1
= TREE_OPERAND (t
, 1);
14099 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14100 tree rhs1
= NULL_TREE
;
14101 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14102 enum tree_code opcode
= NOP_EXPR
;
14103 if (code
== OMP_ATOMIC_READ
)
14105 v
= RECUR (TREE_OPERAND (op1
, 0));
14106 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14108 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14109 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14111 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14112 v
= RECUR (TREE_OPERAND (op1
, 0));
14113 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14114 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14116 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14117 op11
= TREE_OPERAND (op11
, 1);
14119 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14120 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14121 opcode
= TREE_CODE (op11
);
14122 if (opcode
== MODIFY_EXPR
)
14128 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14129 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14131 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14132 OMP_ATOMIC_SEQ_CST (t
));
14136 case TRANSACTION_EXPR
:
14139 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14140 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14142 if (TRANSACTION_EXPR_IS_STMT (t
))
14144 tree body
= TRANSACTION_EXPR_BODY (t
);
14145 tree noex
= NULL_TREE
;
14146 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14148 noex
= MUST_NOT_THROW_COND (body
);
14149 if (noex
== NULL_TREE
)
14150 noex
= boolean_true_node
;
14151 body
= TREE_OPERAND (body
, 0);
14153 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14155 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14159 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14160 RECUR (TRANSACTION_EXPR_BODY (t
)),
14167 case MUST_NOT_THROW_EXPR
:
14169 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14170 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14171 RETURN (build_must_not_throw_expr (op0
, cond
));
14174 case EXPR_PACK_EXPANSION
:
14175 error ("invalid use of pack expansion expression");
14176 RETURN (error_mark_node
);
14178 case NONTYPE_ARGUMENT_PACK
:
14179 error ("use %<...%> to expand argument pack");
14180 RETURN (error_mark_node
);
14182 case CILK_SPAWN_STMT
:
14183 cfun
->calls_cilk_spawn
= 1;
14184 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
14186 case CILK_SYNC_STMT
:
14187 RETURN (build_cilk_sync ());
14189 case COMPOUND_EXPR
:
14190 tmp
= RECUR (TREE_OPERAND (t
, 0));
14191 if (tmp
== NULL_TREE
)
14192 /* If the first operand was a statement, we're done with it. */
14193 RETURN (RECUR (TREE_OPERAND (t
, 1)));
14194 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
14195 RECUR (TREE_OPERAND (t
, 1)),
14198 case ANNOTATE_EXPR
:
14199 tmp
= RECUR (TREE_OPERAND (t
, 0));
14200 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
14201 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
14204 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
14206 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14207 /*function_p=*/false,
14208 integral_constant_expression_p
));
14211 RETURN (NULL_TREE
);
14213 input_location
= loc
;
14219 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14220 function. For description of the body see comment above
14221 cp_parser_omp_declare_reduction_exprs. */
14224 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14226 if (t
== NULL_TREE
|| t
== error_mark_node
)
14229 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14231 tree_stmt_iterator tsi
;
14234 memset (stmts
, 0, sizeof stmts
);
14235 for (i
= 0, tsi
= tsi_start (t
);
14236 i
< 7 && !tsi_end_p (tsi
);
14237 i
++, tsi_next (&tsi
))
14238 stmts
[i
] = tsi_stmt (tsi
);
14239 gcc_assert (tsi_end_p (tsi
));
14243 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14244 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14245 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14246 args
, complain
, in_decl
);
14247 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14248 args
, complain
, in_decl
);
14249 DECL_CONTEXT (omp_out
) = current_function_decl
;
14250 DECL_CONTEXT (omp_in
) = current_function_decl
;
14251 keep_next_level (true);
14252 tree block
= begin_omp_structured_block ();
14253 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14254 block
= finish_omp_structured_block (block
);
14255 block
= maybe_cleanup_point_expr_void (block
);
14256 add_decl_expr (omp_out
);
14257 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14258 TREE_NO_WARNING (omp_out
) = 1;
14259 add_decl_expr (omp_in
);
14260 finish_expr_stmt (block
);
14264 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14265 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14266 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14267 args
, complain
, in_decl
);
14268 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14269 args
, complain
, in_decl
);
14270 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14271 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14272 keep_next_level (true);
14273 tree block
= begin_omp_structured_block ();
14274 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14275 block
= finish_omp_structured_block (block
);
14276 block
= maybe_cleanup_point_expr_void (block
);
14277 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14278 add_decl_expr (omp_priv
);
14279 add_decl_expr (omp_orig
);
14280 finish_expr_stmt (block
);
14282 add_decl_expr (omp_orig
);
14286 /* T is a postfix-expression that is not being used in a function
14287 call. Return the substituted version of T. */
14290 tsubst_non_call_postfix_expression (tree t
, tree args
,
14291 tsubst_flags_t complain
,
14294 if (TREE_CODE (t
) == SCOPE_REF
)
14295 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14296 /*done=*/false, /*address_p=*/false);
14298 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14299 /*function_p=*/false,
14300 /*integral_constant_expression_p=*/false);
14305 /* Sentinel to disable certain warnings during template substitution. */
14307 struct warning_sentinel
{
14310 warning_sentinel(int& flag
, bool suppress
=true)
14311 : flag(flag
), val(flag
) { if (suppress
) flag
= 0; }
14312 ~warning_sentinel() { flag
= val
; }
14315 /* Like tsubst but deals with expressions and performs semantic
14316 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14319 tsubst_copy_and_build (tree t
,
14321 tsubst_flags_t complain
,
14324 bool integral_constant_expression_p
)
14326 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14327 #define RECUR(NODE) \
14328 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14329 /*function_p=*/false, \
14330 integral_constant_expression_p)
14335 if (t
== NULL_TREE
|| t
== error_mark_node
)
14338 loc
= input_location
;
14339 if (EXPR_HAS_LOCATION (t
))
14340 input_location
= EXPR_LOCATION (t
);
14342 /* N3276 decltype magic only applies to calls at the top level or on the
14343 right side of a comma. */
14344 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14345 complain
&= ~tf_decltype
;
14347 switch (TREE_CODE (t
))
14351 /* Fall through. */
14352 case IDENTIFIER_NODE
:
14356 bool non_integral_constant_expression_p
;
14357 const char *error_msg
;
14359 if (IDENTIFIER_TYPENAME_P (t
))
14361 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14362 t
= mangle_conv_op_name_for_type (new_type
);
14365 /* Look up the name. */
14366 decl
= lookup_name (t
);
14368 /* By convention, expressions use ERROR_MARK_NODE to indicate
14369 failure, not NULL_TREE. */
14370 if (decl
== NULL_TREE
)
14371 decl
= error_mark_node
;
14373 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14375 integral_constant_expression_p
,
14376 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14377 &non_integral_constant_expression_p
,
14378 /*template_p=*/false,
14380 /*address_p=*/false,
14381 /*template_arg_p=*/false,
14386 if (!function_p
&& identifier_p (decl
))
14388 if (complain
& tf_error
)
14389 unqualified_name_lookup_error (decl
);
14390 decl
= error_mark_node
;
14395 case TEMPLATE_ID_EXPR
:
14398 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14399 tree targs
= TREE_OPERAND (t
, 1);
14402 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14404 if (TREE_CODE (templ
) == COMPONENT_REF
)
14406 object
= TREE_OPERAND (templ
, 0);
14407 templ
= TREE_OPERAND (templ
, 1);
14410 object
= NULL_TREE
;
14411 templ
= lookup_template_function (templ
, targs
);
14414 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14415 object
, templ
, NULL_TREE
));
14417 RETURN (baselink_for_fns (templ
));
14422 tree r
= RECUR (TREE_OPERAND (t
, 0));
14424 if (REFERENCE_REF_P (t
))
14426 /* A type conversion to reference type will be enclosed in
14427 such an indirect ref, but the substitution of the cast
14428 will have also added such an indirect ref. */
14429 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14430 r
= convert_from_reference (r
);
14433 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14434 complain
|decltype_flag
);
14440 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14441 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14442 RETURN (build_nop (type
, op0
));
14445 case IMPLICIT_CONV_EXPR
:
14447 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14448 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14449 int flags
= LOOKUP_IMPLICIT
;
14450 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14451 flags
= LOOKUP_NORMAL
;
14452 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14458 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14459 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14460 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
14464 case REINTERPRET_CAST_EXPR
:
14465 case CONST_CAST_EXPR
:
14466 case DYNAMIC_CAST_EXPR
:
14467 case STATIC_CAST_EXPR
:
14470 tree op
, r
= NULL_TREE
;
14472 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14473 if (integral_constant_expression_p
14474 && !cast_valid_in_integral_constant_expression_p (type
))
14476 if (complain
& tf_error
)
14477 error ("a cast to a type other than an integral or "
14478 "enumeration type cannot appear in a constant-expression");
14479 RETURN (error_mark_node
);
14482 op
= RECUR (TREE_OPERAND (t
, 0));
14484 warning_sentinel
s(warn_useless_cast
);
14485 switch (TREE_CODE (t
))
14488 r
= build_functional_cast (type
, op
, complain
);
14490 case REINTERPRET_CAST_EXPR
:
14491 r
= build_reinterpret_cast (type
, op
, complain
);
14493 case CONST_CAST_EXPR
:
14494 r
= build_const_cast (type
, op
, complain
);
14496 case DYNAMIC_CAST_EXPR
:
14497 r
= build_dynamic_cast (type
, op
, complain
);
14499 case STATIC_CAST_EXPR
:
14500 r
= build_static_cast (type
, op
, complain
);
14503 gcc_unreachable ();
14509 case POSTDECREMENT_EXPR
:
14510 case POSTINCREMENT_EXPR
:
14511 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14512 args
, complain
, in_decl
);
14513 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14514 complain
|decltype_flag
));
14516 case PREDECREMENT_EXPR
:
14517 case PREINCREMENT_EXPR
:
14521 case TRUTH_NOT_EXPR
:
14522 case UNARY_PLUS_EXPR
: /* Unary + */
14523 case REALPART_EXPR
:
14524 case IMAGPART_EXPR
:
14525 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14526 RECUR (TREE_OPERAND (t
, 0)),
14527 complain
|decltype_flag
));
14529 case FIX_TRUNC_EXPR
:
14530 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14534 op1
= TREE_OPERAND (t
, 0);
14535 if (TREE_CODE (op1
) == LABEL_DECL
)
14536 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14537 EXPR_LOCATION (op1
)));
14538 if (TREE_CODE (op1
) == SCOPE_REF
)
14539 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14540 /*done=*/true, /*address_p=*/true);
14542 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14544 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14545 complain
|decltype_flag
));
14550 case TRUNC_DIV_EXPR
:
14551 case CEIL_DIV_EXPR
:
14552 case FLOOR_DIV_EXPR
:
14553 case ROUND_DIV_EXPR
:
14554 case EXACT_DIV_EXPR
:
14558 case TRUNC_MOD_EXPR
:
14559 case FLOOR_MOD_EXPR
:
14560 case TRUTH_ANDIF_EXPR
:
14561 case TRUTH_ORIF_EXPR
:
14562 case TRUTH_AND_EXPR
:
14563 case TRUTH_OR_EXPR
:
14579 warning_sentinel
s1(warn_type_limits
);
14580 warning_sentinel
s2(warn_div_by_zero
);
14581 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14582 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14583 tree r
= build_x_binary_op
14584 (input_location
, TREE_CODE (t
),
14586 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14588 : TREE_CODE (TREE_OPERAND (t
, 0))),
14590 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14592 : TREE_CODE (TREE_OPERAND (t
, 1))),
14594 complain
|decltype_flag
);
14595 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14596 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14601 case POINTER_PLUS_EXPR
:
14603 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14604 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14605 return fold_build_pointer_plus (op0
, op1
);
14609 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14610 /*address_p=*/false));
14612 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14613 args
, complain
, in_decl
);
14614 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14615 RECUR (TREE_OPERAND (t
, 1)),
14616 complain
|decltype_flag
));
14618 case ARRAY_NOTATION_REF
:
14620 tree start_index
, length
, stride
;
14621 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14622 args
, complain
, in_decl
);
14623 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14624 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14625 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14626 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14627 length
, stride
, TREE_TYPE (op1
)));
14630 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14631 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14638 op1
= TREE_OPERAND (t
, 0);
14639 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14640 op1
= TREE_TYPE (op1
);
14643 /* When there are no ARGS, we are trying to evaluate a
14644 non-dependent expression from the parser. Trying to do
14645 the substitutions may not work. */
14647 op1
= TREE_TYPE (op1
);
14651 ++cp_unevaluated_operand
;
14652 ++c_inhibit_evaluation_warnings
;
14654 op1
= tsubst (op1
, args
, complain
, in_decl
);
14656 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14657 /*function_p=*/false,
14658 /*integral_constant_expression_p=*/
14660 --cp_unevaluated_operand
;
14661 --c_inhibit_evaluation_warnings
;
14664 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14665 complain
& tf_error
);
14667 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14668 complain
& tf_error
);
14669 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14671 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14673 if (!processing_template_decl
&& TYPE_P (op1
))
14675 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14676 build1 (NOP_EXPR
, op1
, error_mark_node
));
14677 SIZEOF_EXPR_TYPE_P (r
) = 1;
14680 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14681 TREE_SIDE_EFFECTS (r
) = 0;
14682 TREE_READONLY (r
) = 1;
14684 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14689 case AT_ENCODE_EXPR
:
14691 op1
= TREE_OPERAND (t
, 0);
14692 ++cp_unevaluated_operand
;
14693 ++c_inhibit_evaluation_warnings
;
14694 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14695 /*function_p=*/false,
14696 /*integral_constant_expression_p=*/false);
14697 --cp_unevaluated_operand
;
14698 --c_inhibit_evaluation_warnings
;
14699 RETURN (objc_build_encode_expr (op1
));
14702 case NOEXCEPT_EXPR
:
14703 op1
= TREE_OPERAND (t
, 0);
14704 ++cp_unevaluated_operand
;
14705 ++c_inhibit_evaluation_warnings
;
14706 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14707 /*function_p=*/false,
14708 /*integral_constant_expression_p=*/false);
14709 --cp_unevaluated_operand
;
14710 --c_inhibit_evaluation_warnings
;
14711 RETURN (finish_noexcept_expr (op1
, complain
));
14715 warning_sentinel
s(warn_div_by_zero
);
14716 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
14717 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
14718 tree r
= build_x_modify_expr
14719 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
14720 complain
|decltype_flag
);
14721 /* TREE_NO_WARNING must be set if either the expression was
14722 parenthesized or it uses an operator such as >>= rather
14723 than plain assignment. In the former case, it was already
14724 set and must be copied. In the latter case,
14725 build_x_modify_expr sets it and it must not be reset
14727 if (TREE_NO_WARNING (t
))
14728 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14734 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14735 args
, complain
, in_decl
);
14736 /* Remember that there was a reference to this entity. */
14739 RETURN (build_x_arrow (input_location
, op1
, complain
));
14743 tree placement
= RECUR (TREE_OPERAND (t
, 0));
14744 tree init
= RECUR (TREE_OPERAND (t
, 3));
14745 vec
<tree
, va_gc
> *placement_vec
;
14746 vec
<tree
, va_gc
> *init_vec
;
14749 if (placement
== NULL_TREE
)
14750 placement_vec
= NULL
;
14753 placement_vec
= make_tree_vector ();
14754 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
14755 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
14758 /* If there was an initializer in the original tree, but it
14759 instantiated to an empty list, then we should pass a
14760 non-NULL empty vector to tell build_new that it was an
14761 empty initializer() rather than no initializer. This can
14762 only happen when the initializer is a pack expansion whose
14763 parameter packs are of length zero. */
14764 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
14768 init_vec
= make_tree_vector ();
14769 if (init
== void_node
)
14770 gcc_assert (init_vec
!= NULL
);
14773 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
14774 vec_safe_push (init_vec
, TREE_VALUE (init
));
14778 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14779 tree op2
= RECUR (TREE_OPERAND (t
, 2));
14780 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
14781 NEW_EXPR_USE_GLOBAL (t
),
14784 if (placement_vec
!= NULL
)
14785 release_tree_vector (placement_vec
);
14786 if (init_vec
!= NULL
)
14787 release_tree_vector (init_vec
);
14794 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14795 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14796 RETURN (delete_sanity (op0
, op1
,
14797 DELETE_EXPR_USE_VEC (t
),
14798 DELETE_EXPR_USE_GLOBAL (t
),
14802 case COMPOUND_EXPR
:
14804 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
14805 complain
& ~tf_decltype
, in_decl
,
14806 /*function_p=*/false,
14807 integral_constant_expression_p
);
14808 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
14810 RECUR (TREE_OPERAND (t
, 1)),
14811 complain
|decltype_flag
));
14817 vec
<tree
, va_gc
> *call_args
;
14818 unsigned int nargs
, i
;
14823 function
= CALL_EXPR_FN (t
);
14824 /* When we parsed the expression, we determined whether or
14825 not Koenig lookup should be performed. */
14826 koenig_p
= KOENIG_LOOKUP_P (t
);
14827 if (TREE_CODE (function
) == SCOPE_REF
)
14829 qualified_p
= true;
14830 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
14832 /*address_p=*/false);
14834 else if (koenig_p
&& identifier_p (function
))
14836 /* Do nothing; calling tsubst_copy_and_build on an identifier
14837 would incorrectly perform unqualified lookup again.
14839 Note that we can also have an IDENTIFIER_NODE if the earlier
14840 unqualified lookup found a member function; in that case
14841 koenig_p will be false and we do want to do the lookup
14842 again to find the instantiated member function.
14844 FIXME but doing that causes c++/15272, so we need to stop
14845 using IDENTIFIER_NODE in that situation. */
14846 qualified_p
= false;
14850 if (TREE_CODE (function
) == COMPONENT_REF
)
14852 tree op
= TREE_OPERAND (function
, 1);
14854 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
14855 || (BASELINK_P (op
)
14856 && BASELINK_QUALIFIED_P (op
)));
14859 qualified_p
= false;
14861 if (TREE_CODE (function
) == ADDR_EXPR
14862 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
14863 /* Avoid error about taking the address of a constructor. */
14864 function
= TREE_OPERAND (function
, 0);
14866 function
= tsubst_copy_and_build (function
, args
, complain
,
14869 integral_constant_expression_p
);
14871 if (BASELINK_P (function
))
14872 qualified_p
= true;
14875 nargs
= call_expr_nargs (t
);
14876 call_args
= make_tree_vector ();
14877 for (i
= 0; i
< nargs
; ++i
)
14879 tree arg
= CALL_EXPR_ARG (t
, i
);
14881 if (!PACK_EXPANSION_P (arg
))
14882 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
14885 /* Expand the pack expansion and push each entry onto
14887 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
14888 if (TREE_CODE (arg
) == TREE_VEC
)
14890 unsigned int len
, j
;
14892 len
= TREE_VEC_LENGTH (arg
);
14893 for (j
= 0; j
< len
; ++j
)
14895 tree value
= TREE_VEC_ELT (arg
, j
);
14896 if (value
!= NULL_TREE
)
14897 value
= convert_from_reference (value
);
14898 vec_safe_push (call_args
, value
);
14903 /* A partial substitution. Add one entry. */
14904 vec_safe_push (call_args
, arg
);
14909 /* We do not perform argument-dependent lookup if normal
14910 lookup finds a non-function, in accordance with the
14911 expected resolution of DR 218. */
14913 && ((is_overloaded_fn (function
)
14914 /* If lookup found a member function, the Koenig lookup is
14915 not appropriate, even if an unqualified-name was used
14916 to denote the function. */
14917 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14918 || identifier_p (function
))
14919 /* Only do this when substitution turns a dependent call
14920 into a non-dependent call. */
14921 && type_dependent_expression_p_push (t
)
14922 && !any_type_dependent_arguments_p (call_args
))
14923 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
14925 if (identifier_p (function
)
14926 && !any_type_dependent_arguments_p (call_args
))
14928 if (koenig_p
&& (complain
& tf_warning_or_error
))
14930 /* For backwards compatibility and good diagnostics, try
14931 the unqualified lookup again if we aren't in SFINAE
14933 tree unq
= (tsubst_copy_and_build
14934 (function
, args
, complain
, in_decl
, true,
14935 integral_constant_expression_p
));
14936 if (unq
== error_mark_node
)
14937 RETURN (error_mark_node
);
14939 if (unq
!= function
)
14942 if (INDIRECT_REF_P (fn
))
14943 fn
= TREE_OPERAND (fn
, 0);
14944 if (TREE_CODE (fn
) == COMPONENT_REF
)
14945 fn
= TREE_OPERAND (fn
, 1);
14946 if (is_overloaded_fn (fn
))
14947 fn
= get_first_fn (fn
);
14948 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
14949 "%qD was not declared in this scope, "
14950 "and no declarations were found by "
14951 "argument-dependent lookup at the point "
14952 "of instantiation", function
))
14955 /* Can't say anything more. */;
14956 else if (DECL_CLASS_SCOPE_P (fn
))
14958 location_t loc
= EXPR_LOC_OR_LOC (t
,
14961 "declarations in dependent base %qT are "
14962 "not found by unqualified lookup",
14963 DECL_CLASS_CONTEXT (fn
));
14964 if (current_class_ptr
)
14966 "use %<this->%D%> instead", function
);
14969 "use %<%T::%D%> instead",
14970 current_class_name
, function
);
14973 inform (0, "%q+D declared here, later in the "
14974 "translation unit", fn
);
14979 if (identifier_p (function
))
14981 if (complain
& tf_error
)
14982 unqualified_name_lookup_error (function
);
14983 release_tree_vector (call_args
);
14984 RETURN (error_mark_node
);
14988 /* Remember that there was a reference to this entity. */
14989 if (DECL_P (function
))
14990 mark_used (function
);
14992 /* Put back tf_decltype for the actual call. */
14993 complain
|= decltype_flag
;
14995 if (TREE_CODE (function
) == OFFSET_REF
)
14996 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
14998 else if (TREE_CODE (function
) == COMPONENT_REF
)
15000 tree instance
= TREE_OPERAND (function
, 0);
15001 tree fn
= TREE_OPERAND (function
, 1);
15003 if (processing_template_decl
15004 && (type_dependent_expression_p (instance
)
15005 || (!BASELINK_P (fn
)
15006 && TREE_CODE (fn
) != FIELD_DECL
)
15007 || type_dependent_expression_p (fn
)
15008 || any_type_dependent_arguments_p (call_args
)))
15009 ret
= build_nt_call_vec (function
, call_args
);
15010 else if (!BASELINK_P (fn
))
15011 ret
= finish_call_expr (function
, &call_args
,
15012 /*disallow_virtual=*/false,
15013 /*koenig_p=*/false,
15016 ret
= (build_new_method_call
15018 &call_args
, NULL_TREE
,
15019 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15024 ret
= finish_call_expr (function
, &call_args
,
15025 /*disallow_virtual=*/qualified_p
,
15029 release_tree_vector (call_args
);
15036 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15039 if (TREE_CODE (cond
) == INTEGER_CST
)
15041 if (integer_zerop (cond
))
15043 ++c_inhibit_evaluation_warnings
;
15044 exp1
= RECUR (TREE_OPERAND (t
, 1));
15045 --c_inhibit_evaluation_warnings
;
15046 exp2
= RECUR (TREE_OPERAND (t
, 2));
15050 exp1
= RECUR (TREE_OPERAND (t
, 1));
15051 ++c_inhibit_evaluation_warnings
;
15052 exp2
= RECUR (TREE_OPERAND (t
, 2));
15053 --c_inhibit_evaluation_warnings
;
15058 exp1
= RECUR (TREE_OPERAND (t
, 1));
15059 exp2
= RECUR (TREE_OPERAND (t
, 2));
15062 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15063 cond
, exp1
, exp2
, complain
));
15066 case PSEUDO_DTOR_EXPR
:
15068 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15069 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15070 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15071 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15077 tree purpose
, value
, chain
;
15079 if (t
== void_list_node
)
15082 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15083 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15085 /* We have pack expansions, so expand those and
15086 create a new list out of it. */
15087 tree purposevec
= NULL_TREE
;
15088 tree valuevec
= NULL_TREE
;
15092 /* Expand the argument expressions. */
15093 if (TREE_PURPOSE (t
))
15094 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15095 complain
, in_decl
);
15096 if (TREE_VALUE (t
))
15097 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15098 complain
, in_decl
);
15100 /* Build the rest of the list. */
15101 chain
= TREE_CHAIN (t
);
15102 if (chain
&& chain
!= void_type_node
)
15103 chain
= RECUR (chain
);
15105 /* Determine the number of arguments. */
15106 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15108 len
= TREE_VEC_LENGTH (purposevec
);
15109 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15111 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15112 len
= TREE_VEC_LENGTH (valuevec
);
15115 /* Since we only performed a partial substitution into
15116 the argument pack, we only RETURN (a single list
15118 if (purposevec
== TREE_PURPOSE (t
)
15119 && valuevec
== TREE_VALUE (t
)
15120 && chain
== TREE_CHAIN (t
))
15123 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15126 /* Convert the argument vectors into a TREE_LIST */
15130 /* Grab the Ith values. */
15132 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15135 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15138 /* Build the list (backwards). */
15139 chain
= tree_cons (purpose
, value
, chain
);
15145 purpose
= TREE_PURPOSE (t
);
15147 purpose
= RECUR (purpose
);
15148 value
= TREE_VALUE (t
);
15150 value
= RECUR (value
);
15151 chain
= TREE_CHAIN (t
);
15152 if (chain
&& chain
!= void_type_node
)
15153 chain
= RECUR (chain
);
15154 if (purpose
== TREE_PURPOSE (t
)
15155 && value
== TREE_VALUE (t
)
15156 && chain
== TREE_CHAIN (t
))
15158 RETURN (tree_cons (purpose
, value
, chain
));
15161 case COMPONENT_REF
:
15168 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15169 args
, complain
, in_decl
);
15170 /* Remember that there was a reference to this entity. */
15171 if (DECL_P (object
))
15172 mark_used (object
);
15173 object_type
= TREE_TYPE (object
);
15175 member
= TREE_OPERAND (t
, 1);
15176 if (BASELINK_P (member
))
15177 member
= tsubst_baselink (member
,
15178 non_reference (TREE_TYPE (object
)),
15179 args
, complain
, in_decl
);
15181 member
= tsubst_copy (member
, args
, complain
, in_decl
);
15182 if (member
== error_mark_node
)
15183 RETURN (error_mark_node
);
15185 if (type_dependent_expression_p (object
))
15186 /* We can't do much here. */;
15187 else if (!CLASS_TYPE_P (object_type
))
15189 if (scalarish_type_p (object_type
))
15191 tree s
= NULL_TREE
;
15192 tree dtor
= member
;
15194 if (TREE_CODE (dtor
) == SCOPE_REF
)
15196 s
= TREE_OPERAND (dtor
, 0);
15197 dtor
= TREE_OPERAND (dtor
, 1);
15199 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
15201 dtor
= TREE_OPERAND (dtor
, 0);
15203 RETURN (finish_pseudo_destructor_expr
15204 (object
, s
, dtor
, input_location
));
15208 else if (TREE_CODE (member
) == SCOPE_REF
15209 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
15211 /* Lookup the template functions now that we know what the
15213 tree scope
= TREE_OPERAND (member
, 0);
15214 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
15215 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
15216 member
= lookup_qualified_name (scope
, tmpl
,
15217 /*is_type_p=*/false,
15218 /*complain=*/false);
15219 if (BASELINK_P (member
))
15221 BASELINK_FUNCTIONS (member
)
15222 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
15224 member
= (adjust_result_of_qualified_name_lookup
15225 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15230 qualified_name_lookup_error (scope
, tmpl
, member
,
15232 RETURN (error_mark_node
);
15235 else if (TREE_CODE (member
) == SCOPE_REF
15236 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15237 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15239 if (complain
& tf_error
)
15241 if (TYPE_P (TREE_OPERAND (member
, 0)))
15242 error ("%qT is not a class or namespace",
15243 TREE_OPERAND (member
, 0));
15245 error ("%qD is not a class or namespace",
15246 TREE_OPERAND (member
, 0));
15248 RETURN (error_mark_node
);
15250 else if (TREE_CODE (member
) == FIELD_DECL
)
15252 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15253 if (TREE_CODE (r
) == COMPONENT_REF
)
15254 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15258 r
= finish_class_member_access_expr (object
, member
,
15259 /*template_p=*/false,
15261 if (TREE_CODE (r
) == COMPONENT_REF
)
15262 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15267 RETURN (build_throw
15268 (RECUR (TREE_OPERAND (t
, 0))));
15272 vec
<constructor_elt
, va_gc
> *n
;
15273 constructor_elt
*ce
;
15274 unsigned HOST_WIDE_INT idx
;
15275 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15276 bool process_index_p
;
15278 bool need_copy_p
= false;
15281 if (type
== error_mark_node
)
15282 RETURN (error_mark_node
);
15284 /* digest_init will do the wrong thing if we let it. */
15285 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15288 /* We do not want to process the index of aggregate
15289 initializers as they are identifier nodes which will be
15290 looked up by digest_init. */
15291 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15293 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15294 newlen
= vec_safe_length (n
);
15295 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15297 if (ce
->index
&& process_index_p
15298 /* An identifier index is looked up in the type
15299 being initialized, not the current scope. */
15300 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15301 ce
->index
= RECUR (ce
->index
);
15303 if (PACK_EXPANSION_P (ce
->value
))
15305 /* Substitute into the pack expansion. */
15306 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15309 if (ce
->value
== error_mark_node
15310 || PACK_EXPANSION_P (ce
->value
))
15312 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15313 /* Just move the argument into place. */
15314 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15317 /* Update the length of the final CONSTRUCTOR
15318 arguments vector, and note that we will need to
15320 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15321 need_copy_p
= true;
15325 ce
->value
= RECUR (ce
->value
);
15330 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15332 vec_alloc (n
, newlen
);
15333 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15335 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15337 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15338 for (i
= 0; i
< len
; ++i
)
15339 CONSTRUCTOR_APPEND_ELT (n
, 0,
15340 TREE_VEC_ELT (ce
->value
, i
));
15343 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15347 r
= build_constructor (init_list_type_node
, n
);
15348 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15350 if (TREE_HAS_CONSTRUCTOR (t
))
15351 RETURN (finish_compound_literal (type
, r
, complain
));
15353 TREE_TYPE (r
) = type
;
15359 tree operand_0
= TREE_OPERAND (t
, 0);
15360 if (TYPE_P (operand_0
))
15362 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15363 RETURN (get_typeid (operand_0
, complain
));
15367 operand_0
= RECUR (operand_0
);
15368 RETURN (build_typeid (operand_0
, complain
));
15375 else if (DECL_PACK_P (t
))
15377 /* We don't build decls for an instantiation of a
15378 variadic capture proxy, we instantiate the elements
15380 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15381 return RECUR (DECL_VALUE_EXPR (t
));
15387 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15389 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15390 /* If the original type was a reference, we'll be wrapped in
15391 the appropriate INDIRECT_REF. */
15392 r
= convert_from_reference (r
);
15398 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15399 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15400 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
15403 case OFFSETOF_EXPR
:
15404 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0))));
15408 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15409 complain
, in_decl
);
15411 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15413 type2
= tsubst (type2
, args
, complain
, in_decl
);
15415 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15420 tree old_stmt_expr
= cur_stmt_expr
;
15421 tree stmt_expr
= begin_stmt_expr ();
15423 cur_stmt_expr
= stmt_expr
;
15424 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15425 integral_constant_expression_p
);
15426 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15427 cur_stmt_expr
= old_stmt_expr
;
15429 /* If the resulting list of expression statement is empty,
15430 fold it further into void_node. */
15431 if (empty_expr_stmt_p (stmt_expr
))
15432 stmt_expr
= void_node
;
15434 RETURN (stmt_expr
);
15439 tree r
= build_lambda_expr ();
15441 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15442 LAMBDA_EXPR_CLOSURE (r
) = type
;
15443 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15445 LAMBDA_EXPR_LOCATION (r
)
15446 = LAMBDA_EXPR_LOCATION (t
);
15447 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15448 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15449 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15450 LAMBDA_EXPR_DISCRIMINATOR (r
)
15451 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15452 /* For a function scope, we want to use tsubst so that we don't
15453 complain about referring to an auto function before its return
15454 type has been deduced. Otherwise, we want to use tsubst_copy so
15455 that we look up the existing field/parameter/variable rather
15456 than build a new one. */
15457 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15458 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15459 scope
= tsubst (scope
, args
, complain
, in_decl
);
15460 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15462 /* Look up the parameter we want directly, as tsubst_copy
15463 doesn't do what we need. */
15464 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15465 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15466 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15467 parm
= DECL_CHAIN (parm
);
15469 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15470 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15471 DECL_CONTEXT (scope
) = fn
;
15474 scope
= RECUR (scope
);
15475 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15476 LAMBDA_EXPR_RETURN_TYPE (r
)
15477 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15479 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15480 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15482 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15483 determine_visibility (TYPE_NAME (type
));
15484 /* Now that we know visibility, instantiate the type so we have a
15485 declaration of the op() for later calls to lambda_function. */
15486 complete_type (type
);
15488 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15490 RETURN (build_lambda_object (r
));
15494 /* We can get here for a constant initializer of non-dependent type.
15495 FIXME stop folding in cp_parser_initializer_clause. */
15497 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15502 case TRANSACTION_EXPR
:
15503 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15504 integral_constant_expression_p
));
15507 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15509 case VEC_PERM_EXPR
:
15511 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15512 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15513 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15514 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
15519 /* Handle Objective-C++ constructs, if appropriate. */
15522 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15523 in_decl
, /*function_p=*/false);
15527 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15533 input_location
= loc
;
15537 /* Verify that the instantiated ARGS are valid. For type arguments,
15538 make sure that the type's linkage is ok. For non-type arguments,
15539 make sure they are constants if they are integral or enumerations.
15540 Emit an error under control of COMPLAIN, and return TRUE on error. */
15543 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15545 if (dependent_template_arg_p (t
))
15547 if (ARGUMENT_PACK_P (t
))
15549 tree vec
= ARGUMENT_PACK_ARGS (t
);
15550 int len
= TREE_VEC_LENGTH (vec
);
15551 bool result
= false;
15554 for (i
= 0; i
< len
; ++i
)
15555 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15559 else if (TYPE_P (t
))
15561 /* [basic.link]: A name with no linkage (notably, the name
15562 of a class or enumeration declared in a local scope)
15563 shall not be used to declare an entity with linkage.
15564 This implies that names with no linkage cannot be used as
15567 DR 757 relaxes this restriction for C++0x. */
15568 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15569 : no_linkage_check (t
, /*relaxed_p=*/false));
15573 /* DR 488 makes use of a type with no linkage cause
15574 type deduction to fail. */
15575 if (complain
& tf_error
)
15577 if (TYPE_ANONYMOUS_P (nt
))
15578 error ("%qT is/uses anonymous type", t
);
15580 error ("template argument for %qD uses local type %qT",
15585 /* In order to avoid all sorts of complications, we do not
15586 allow variably-modified types as template arguments. */
15587 else if (variably_modified_type_p (t
, NULL_TREE
))
15589 if (complain
& tf_error
)
15590 error ("%qT is a variably modified type", t
);
15594 /* Class template and alias template arguments should be OK. */
15595 else if (DECL_TYPE_TEMPLATE_P (t
))
15597 /* A non-type argument of integral or enumerated type must be a
15599 else if (TREE_TYPE (t
)
15600 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15601 && !TREE_CONSTANT (t
))
15603 if (complain
& tf_error
)
15604 error ("integral expression %qE is not constant", t
);
15611 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15613 int ix
, len
= DECL_NTPARMS (tmpl
);
15614 bool result
= false;
15616 for (ix
= 0; ix
!= len
; ix
++)
15618 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15621 if (result
&& (complain
& tf_error
))
15622 error (" trying to instantiate %qD", tmpl
);
15626 /* We're out of SFINAE context now, so generate diagnostics for the access
15627 errors we saw earlier when instantiating D from TMPL and ARGS. */
15630 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15632 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15633 tree type
= TREE_TYPE (pattern
);
15634 location_t loc
= input_location
;
15636 push_access_scope (d
);
15637 push_deferring_access_checks (dk_no_deferred
);
15638 input_location
= DECL_SOURCE_LOCATION (pattern
);
15639 tsubst (type
, args
, tf_warning_or_error
, d
);
15640 input_location
= loc
;
15641 pop_deferring_access_checks ();
15642 pop_access_scope (d
);
15645 /* Instantiate the indicated variable, function, or alias template TMPL with
15646 the template arguments in TARG_PTR. */
15649 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15651 tree targ_ptr
= orig_args
;
15655 bool access_ok
= true;
15657 if (tmpl
== error_mark_node
)
15658 return error_mark_node
;
15660 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15662 /* If this function is a clone, handle it specially. */
15663 if (DECL_CLONED_FUNCTION_P (tmpl
))
15668 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15669 DECL_CLONED_FUNCTION. */
15670 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
15671 targ_ptr
, complain
);
15672 if (spec
== error_mark_node
)
15673 return error_mark_node
;
15675 /* Look for the clone. */
15676 FOR_EACH_CLONE (clone
, spec
)
15677 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
15679 /* We should always have found the clone by now. */
15680 gcc_unreachable ();
15684 if (targ_ptr
== error_mark_node
)
15685 return error_mark_node
;
15687 /* Check to see if we already have this specialization. */
15688 gen_tmpl
= most_general_template (tmpl
);
15689 if (tmpl
!= gen_tmpl
)
15690 /* The TMPL is a partial instantiation. To get a full set of
15691 arguments we must add the arguments used to perform the
15692 partial instantiation. */
15693 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
15696 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15697 but it doesn't seem to be on the hot path. */
15698 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
15700 gcc_assert (tmpl
== gen_tmpl
15701 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
15703 || fndecl
== NULL_TREE
);
15705 if (spec
!= NULL_TREE
)
15707 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
15709 if (complain
& tf_error
)
15710 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
15711 return error_mark_node
;
15716 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
15718 return error_mark_node
;
15720 /* We are building a FUNCTION_DECL, during which the access of its
15721 parameters and return types have to be checked. However this
15722 FUNCTION_DECL which is the desired context for access checking
15723 is not built yet. We solve this chicken-and-egg problem by
15724 deferring all checks until we have the FUNCTION_DECL. */
15725 push_deferring_access_checks (dk_deferred
);
15727 /* Instantiation of the function happens in the context of the function
15728 template, not the context of the overload resolution we're doing. */
15729 push_to_top_level ();
15730 /* If there are dependent arguments, e.g. because we're doing partial
15731 ordering, make sure processing_template_decl stays set. */
15732 if (uses_template_parms (targ_ptr
))
15733 ++processing_template_decl
;
15734 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15736 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
15737 complain
, gen_tmpl
);
15738 push_nested_class (ctx
);
15740 /* Substitute template parameters to obtain the specialization. */
15741 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
15742 targ_ptr
, complain
, gen_tmpl
);
15743 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15744 pop_nested_class ();
15745 pop_from_top_level ();
15747 if (fndecl
== error_mark_node
)
15749 pop_deferring_access_checks ();
15750 return error_mark_node
;
15753 /* The DECL_TI_TEMPLATE should always be the immediate parent
15754 template, not the most general template. */
15755 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
15757 /* Now we know the specialization, compute access previously
15759 push_access_scope (fndecl
);
15760 if (!perform_deferred_access_checks (complain
))
15762 pop_access_scope (fndecl
);
15763 pop_deferring_access_checks ();
15765 /* If we've just instantiated the main entry point for a function,
15766 instantiate all the alternate entry points as well. We do this
15767 by cloning the instantiation of the main entry point, not by
15768 instantiating the template clones. */
15769 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
15770 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
15774 if (!(complain
& tf_error
))
15776 /* Remember to reinstantiate when we're out of SFINAE so the user
15777 can see the errors. */
15778 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
15780 return error_mark_node
;
15785 /* Wrapper for instantiate_template_1. */
15788 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15791 timevar_push (TV_TEMPLATE_INST
);
15792 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
15793 timevar_pop (TV_TEMPLATE_INST
);
15797 /* Instantiate the alias template TMPL with ARGS. Also push a template
15798 instantiation level, which instantiate_template doesn't do because
15799 functions and variables have sufficient context established by the
15803 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
15805 struct pending_template
*old_last_pend
= last_pending_template
;
15806 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15807 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
15808 return error_mark_node
;
15809 tree tinst
= build_tree_list (tmpl
, args
);
15810 if (!push_tinst_level (tinst
))
15813 return error_mark_node
;
15817 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
15818 args
, tmpl
, complain
,
15819 /*require_all_args=*/true,
15820 /*use_default_args=*/true);
15822 tree r
= instantiate_template (tmpl
, args
, complain
);
15823 pop_tinst_level ();
15824 /* We can't free this if a pending_template entry or last_error_tinst_level
15825 is pointing at it. */
15826 if (last_pending_template
== old_last_pend
15827 && last_error_tinst_level
== old_error_tinst
)
15833 /* PARM is a template parameter pack for FN. Returns true iff
15834 PARM is used in a deducible way in the argument list of FN. */
15837 pack_deducible_p (tree parm
, tree fn
)
15839 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
15840 for (; t
; t
= TREE_CHAIN (t
))
15842 tree type
= TREE_VALUE (t
);
15844 if (!PACK_EXPANSION_P (type
))
15846 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
15847 packs
; packs
= TREE_CHAIN (packs
))
15848 if (template_args_equal (TREE_VALUE (packs
), parm
))
15850 /* The template parameter pack is used in a function parameter
15851 pack. If this is the end of the parameter list, the
15852 template parameter pack is deducible. */
15853 if (TREE_CHAIN (t
) == void_list_node
)
15856 /* Otherwise, not. Well, it could be deduced from
15857 a non-pack parameter, but doing so would end up with
15858 a deduction mismatch, so don't bother. */
15862 /* The template parameter pack isn't used in any function parameter
15863 packs, but it might be used deeper, e.g. tuple<Args...>. */
15867 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
15868 NARGS elements of the arguments that are being used when calling
15869 it. TARGS is a vector into which the deduced template arguments
15872 Returns either a FUNCTION_DECL for the matching specialization of FN or
15873 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
15874 true, diagnostics will be printed to explain why it failed.
15876 If FN is a conversion operator, or we are trying to produce a specific
15877 specialization, RETURN_TYPE is the return type desired.
15879 The EXPLICIT_TARGS are explicit template arguments provided via a
15882 The parameter STRICT is one of:
15885 We are deducing arguments for a function call, as in
15886 [temp.deduct.call].
15889 We are deducing arguments for a conversion function, as in
15890 [temp.deduct.conv].
15893 We are deducing arguments when doing an explicit instantiation
15894 as in [temp.explicit], when determining an explicit specialization
15895 as in [temp.expl.spec], or when taking the address of a function
15896 template, as in [temp.deduct.funcaddr]. */
15899 fn_type_unification (tree fn
,
15900 tree explicit_targs
,
15903 unsigned int nargs
,
15905 unification_kind_t strict
,
15912 tree decl
= NULL_TREE
;
15913 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
15915 static int deduction_depth
;
15916 struct pending_template
*old_last_pend
= last_pending_template
;
15917 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15918 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
15920 tree r
= error_mark_node
;
15923 complain
|= tf_decltype
;
15925 /* In C++0x, it's possible to have a function template whose type depends
15926 on itself recursively. This is most obvious with decltype, but can also
15927 occur with enumeration scope (c++/48969). So we need to catch infinite
15928 recursion and reject the substitution at deduction time; this function
15929 will return error_mark_node for any repeated substitution.
15931 This also catches excessive recursion such as when f<N> depends on
15932 f<N-1> across all integers, and returns error_mark_node for all the
15933 substitutions back up to the initial one.
15935 This is, of course, not reentrant. */
15936 if (excessive_deduction_depth
)
15937 return error_mark_node
;
15938 tinst
= build_tree_list (fn
, NULL_TREE
);
15941 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
15943 fntype
= TREE_TYPE (fn
);
15944 if (explicit_targs
)
15948 The specified template arguments must match the template
15949 parameters in kind (i.e., type, nontype, template), and there
15950 must not be more arguments than there are parameters;
15951 otherwise type deduction fails.
15953 Nontype arguments must match the types of the corresponding
15954 nontype template parameters, or must be convertible to the
15955 types of the corresponding nontype parameters as specified in
15956 _temp.arg.nontype_, otherwise type deduction fails.
15958 All references in the function type of the function template
15959 to the corresponding template parameters are replaced by the
15960 specified template argument values. If a substitution in a
15961 template parameter or in the function type of the function
15962 template results in an invalid type, type deduction fails. */
15963 int i
, len
= TREE_VEC_LENGTH (tparms
);
15964 location_t loc
= input_location
;
15965 bool incomplete
= false;
15967 /* Adjust any explicit template arguments before entering the
15968 substitution context. */
15970 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
15972 /*require_all_args=*/false,
15973 /*use_default_args=*/false));
15974 if (explicit_targs
== error_mark_node
)
15977 /* Substitute the explicit args into the function type. This is
15978 necessary so that, for instance, explicitly declared function
15979 arguments can match null pointed constants. If we were given
15980 an incomplete set of explicit args, we must not do semantic
15981 processing during substitution as we could create partial
15983 for (i
= 0; i
< len
; i
++)
15985 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15986 bool parameter_pack
= false;
15987 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
15989 /* Dig out the actual parm. */
15990 if (TREE_CODE (parm
) == TYPE_DECL
15991 || TREE_CODE (parm
) == TEMPLATE_DECL
)
15993 parm
= TREE_TYPE (parm
);
15994 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
15996 else if (TREE_CODE (parm
) == PARM_DECL
)
15998 parm
= DECL_INITIAL (parm
);
15999 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16002 if (!parameter_pack
&& targ
== NULL_TREE
)
16003 /* No explicit argument for this template parameter. */
16006 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16008 /* Mark the argument pack as "incomplete". We could
16009 still deduce more arguments during unification.
16010 We remove this mark in type_unification_real. */
16013 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16014 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16015 = ARGUMENT_PACK_ARGS (targ
);
16018 /* We have some incomplete argument packs. */
16023 TREE_VALUE (tinst
) = explicit_targs
;
16024 if (!push_tinst_level (tinst
))
16026 excessive_deduction_depth
= true;
16029 processing_template_decl
+= incomplete
;
16030 input_location
= DECL_SOURCE_LOCATION (fn
);
16031 /* Ignore any access checks; we'll see them again in
16032 instantiate_template and they might have the wrong
16033 access path at this point. */
16034 push_deferring_access_checks (dk_deferred
);
16035 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16036 complain
| tf_partial
, NULL_TREE
);
16037 pop_deferring_access_checks ();
16038 input_location
= loc
;
16039 processing_template_decl
-= incomplete
;
16040 pop_tinst_level ();
16042 if (fntype
== error_mark_node
)
16045 /* Place the explicitly specified arguments in TARGS. */
16046 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16047 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16050 /* Never do unification on the 'this' parameter. */
16051 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16057 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16058 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16059 new_args
[0] = return_type
;
16060 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16065 /* We allow incomplete unification without an error message here
16066 because the standard doesn't seem to explicitly prohibit it. Our
16067 callers must be ready to deal with unification failures in any
16070 TREE_VALUE (tinst
) = targs
;
16071 /* If we aren't explaining yet, push tinst context so we can see where
16072 any errors (e.g. from class instantiations triggered by instantiation
16073 of default template arguments) come from. If we are explaining, this
16074 context is redundant. */
16075 if (!explain_p
&& !push_tinst_level (tinst
))
16077 excessive_deduction_depth
= true;
16081 /* type_unification_real will pass back any access checks from default
16082 template argument substitution. */
16083 vec
<deferred_access_check
, va_gc
> *checks
;
16086 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16087 targs
, parms
, args
, nargs
, /*subr=*/0,
16088 strict
, flags
, &checks
, explain_p
);
16090 pop_tinst_level ();
16094 /* Now that we have bindings for all of the template arguments,
16095 ensure that the arguments deduced for the template template
16096 parameters have compatible template parameter lists. We cannot
16097 check this property before we have deduced all template
16098 arguments, because the template parameter types of a template
16099 template parameter might depend on prior template parameters
16100 deduced after the template template parameter. The following
16101 ill-formed example illustrates this issue:
16103 template<typename T, template<T> class C> void f(C<5>, T);
16105 template<int N> struct X {};
16108 f(X<5>(), 5l); // error: template argument deduction fails
16111 The template parameter list of 'C' depends on the template type
16112 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16113 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16114 time that we deduce 'C'. */
16115 if (!template_template_parm_bindings_ok_p
16116 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
16118 unify_inconsistent_template_template_parameters (explain_p
);
16122 /* All is well so far. Now, check:
16126 When all template arguments have been deduced, all uses of
16127 template parameters in nondeduced contexts are replaced with
16128 the corresponding deduced argument values. If the
16129 substitution results in an invalid type, as described above,
16130 type deduction fails. */
16131 TREE_VALUE (tinst
) = targs
;
16132 if (!push_tinst_level (tinst
))
16134 excessive_deduction_depth
= true;
16138 /* Also collect access checks from the instantiation. */
16139 reopen_deferring_access_checks (checks
);
16141 decl
= instantiate_template (fn
, targs
, complain
);
16143 checks
= get_deferred_access_checks ();
16144 pop_deferring_access_checks ();
16146 pop_tinst_level ();
16148 if (decl
== error_mark_node
)
16151 /* Now perform any access checks encountered during substitution. */
16152 push_access_scope (decl
);
16153 ok
= perform_access_checks (checks
, complain
);
16154 pop_access_scope (decl
);
16158 /* If we're looking for an exact match, check that what we got
16159 is indeed an exact match. It might not be if some template
16160 parameters are used in non-deduced contexts. But don't check
16161 for an exact match if we have dependent template arguments;
16162 in that case we're doing partial ordering, and we already know
16163 that we have two candidates that will provide the actual type. */
16164 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
16166 tree substed
= TREE_TYPE (decl
);
16170 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
16172 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
16173 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
16174 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
16176 unify_type_mismatch (explain_p
, args
[i
],
16177 TREE_VALUE (sarg
));
16186 if (excessive_deduction_depth
)
16188 if (deduction_depth
== 0)
16189 /* Reset once we're all the way out. */
16190 excessive_deduction_depth
= false;
16193 /* We can't free this if a pending_template entry or last_error_tinst_level
16194 is pointing at it. */
16195 if (last_pending_template
== old_last_pend
16196 && last_error_tinst_level
== old_error_tinst
)
16202 /* Adjust types before performing type deduction, as described in
16203 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16204 sections are symmetric. PARM is the type of a function parameter
16205 or the return type of the conversion function. ARG is the type of
16206 the argument passed to the call, or the type of the value
16207 initialized with the result of the conversion function.
16208 ARG_EXPR is the original argument expression, which may be null. */
16211 maybe_adjust_types_for_deduction (unification_kind_t strict
,
16225 /* Swap PARM and ARG throughout the remainder of this
16226 function; the handling is precisely symmetric since PARM
16227 will initialize ARG rather than vice versa. */
16235 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16236 too, but here handle it by stripping the reference from PARM
16237 rather than by adding it to ARG. */
16238 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16239 && TYPE_REF_IS_RVALUE (*parm
)
16240 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16241 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16242 && TREE_CODE (*arg
) == REFERENCE_TYPE
16243 && !TYPE_REF_IS_RVALUE (*arg
))
16244 *parm
= TREE_TYPE (*parm
);
16245 /* Nothing else to do in this case. */
16249 gcc_unreachable ();
16252 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16254 /* [temp.deduct.call]
16256 If P is not a reference type:
16258 --If A is an array type, the pointer type produced by the
16259 array-to-pointer standard conversion (_conv.array_) is
16260 used in place of A for type deduction; otherwise,
16262 --If A is a function type, the pointer type produced by
16263 the function-to-pointer standard conversion
16264 (_conv.func_) is used in place of A for type deduction;
16267 --If A is a cv-qualified type, the top level
16268 cv-qualifiers of A's type are ignored for type
16270 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16271 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16272 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16273 *arg
= build_pointer_type (*arg
);
16275 *arg
= TYPE_MAIN_VARIANT (*arg
);
16278 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16279 of the form T&&, where T is a template parameter, and the argument
16280 is an lvalue, T is deduced as A& */
16281 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16282 && TYPE_REF_IS_RVALUE (*parm
)
16283 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16284 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16285 && (arg_expr
? real_lvalue_p (arg_expr
)
16286 /* try_one_overload doesn't provide an arg_expr, but
16287 functions are always lvalues. */
16288 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16289 *arg
= build_reference_type (*arg
);
16291 /* [temp.deduct.call]
16293 If P is a cv-qualified type, the top level cv-qualifiers
16294 of P's type are ignored for type deduction. If P is a
16295 reference type, the type referred to by P is used for
16297 *parm
= TYPE_MAIN_VARIANT (*parm
);
16298 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16300 *parm
= TREE_TYPE (*parm
);
16301 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16304 /* DR 322. For conversion deduction, remove a reference type on parm
16305 too (which has been swapped into ARG). */
16306 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16307 *arg
= TREE_TYPE (*arg
);
16312 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16313 template which does contain any deducible template parameters; check if
16314 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16315 unify_one_argument. */
16318 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16319 int flags
, bool explain_p
)
16324 type
= TREE_TYPE (arg
);
16328 if (same_type_p (parm
, type
))
16329 return unify_success (explain_p
);
16331 if (strict
== DEDUCE_CONV
)
16333 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16334 explain_p
? tf_warning_or_error
: tf_none
))
16335 return unify_success (explain_p
);
16337 else if (strict
!= DEDUCE_EXACT
)
16339 if (can_convert_arg (parm
, type
,
16340 TYPE_P (arg
) ? NULL_TREE
: arg
,
16341 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16342 return unify_success (explain_p
);
16345 if (strict
== DEDUCE_EXACT
)
16346 return unify_type_mismatch (explain_p
, parm
, arg
);
16348 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16351 static bool uses_deducible_template_parms (tree type
);
16353 /* Returns true iff the expression EXPR is one from which a template
16354 argument can be deduced. In other words, if it's an undecorated
16355 use of a template non-type parameter. */
16358 deducible_expression (tree expr
)
16360 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16363 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16364 deducible way; that is, if it has a max value of <PARM> - 1. */
16367 deducible_array_bound (tree domain
)
16369 if (domain
== NULL_TREE
)
16372 tree max
= TYPE_MAX_VALUE (domain
);
16373 if (TREE_CODE (max
) != MINUS_EXPR
)
16376 return deducible_expression (TREE_OPERAND (max
, 0));
16379 /* Returns true iff the template arguments ARGS use a template parameter
16380 in a deducible way. */
16383 deducible_template_args (tree args
)
16385 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16388 tree elt
= TREE_VEC_ELT (args
, i
);
16389 if (ARGUMENT_PACK_P (elt
))
16390 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16393 if (PACK_EXPANSION_P (elt
))
16394 elt
= PACK_EXPANSION_PATTERN (elt
);
16395 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16397 else if (TYPE_P (elt
))
16398 deducible
= uses_deducible_template_parms (elt
);
16400 deducible
= deducible_expression (elt
);
16408 /* Returns true iff TYPE contains any deducible references to template
16409 parameters, as per 14.8.2.5. */
16412 uses_deducible_template_parms (tree type
)
16414 if (PACK_EXPANSION_P (type
))
16415 type
= PACK_EXPANSION_PATTERN (type
);
16422 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16423 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16429 if (POINTER_TYPE_P (type
))
16430 return uses_deducible_template_parms (TREE_TYPE (type
));
16432 /* T[integer-constant ]
16434 if (TREE_CODE (type
) == ARRAY_TYPE
)
16435 return (uses_deducible_template_parms (TREE_TYPE (type
))
16436 || deducible_array_bound (TYPE_DOMAIN (type
)));
16448 if (TYPE_PTRMEM_P (type
))
16449 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16450 || (uses_deducible_template_parms
16451 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16453 /* template-name <T> (where template-name refers to a class template)
16454 template-name <i> (where template-name refers to a class template) */
16455 if (CLASS_TYPE_P (type
)
16456 && CLASSTYPE_TEMPLATE_INFO (type
)
16457 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16458 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16459 (CLASSTYPE_TI_ARGS (type
)));
16464 if (TREE_CODE (type
) == FUNCTION_TYPE
16465 || TREE_CODE (type
) == METHOD_TYPE
)
16467 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16469 tree parm
= TYPE_ARG_TYPES (type
);
16470 if (TREE_CODE (type
) == METHOD_TYPE
)
16471 parm
= TREE_CHAIN (parm
);
16472 for (; parm
; parm
= TREE_CHAIN (parm
))
16473 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16480 /* Subroutine of type_unification_real and unify_pack_expansion to
16481 handle unification of a single P/A pair. Parameters are as
16482 for those functions. */
16485 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16486 int subr
, unification_kind_t strict
, int flags
,
16489 tree arg_expr
= NULL_TREE
;
16492 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16493 return unify_invalid (explain_p
);
16494 if (arg
== unknown_type_node
)
16495 /* We can't deduce anything from this, but we might get all the
16496 template args from other function args. */
16497 return unify_success (explain_p
);
16499 /* Implicit conversions (Clause 4) will be performed on a function
16500 argument to convert it to the type of the corresponding function
16501 parameter if the parameter type contains no template-parameters that
16502 participate in template argument deduction. */
16503 if (TYPE_P (parm
) && !uses_template_parms (parm
))
16504 /* For function parameters that contain no template-parameters at all,
16505 we have historically checked for convertibility in order to shortcut
16506 consideration of this candidate. */
16507 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
16509 else if (strict
== DEDUCE_CALL
16510 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16511 /* For function parameters with only non-deducible template parameters,
16513 return unify_success (explain_p
);
16518 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16519 | UNIFY_ALLOW_MORE_CV_QUAL
16520 | UNIFY_ALLOW_DERIVED
);
16524 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16528 arg_strict
= UNIFY_ALLOW_NONE
;
16532 gcc_unreachable ();
16535 /* We only do these transformations if this is the top-level
16536 parameter_type_list in a call or declaration matching; in other
16537 situations (nested function declarators, template argument lists) we
16538 won't be comparing a type to an expression, and we don't do any type
16544 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16545 if (type_unknown_p (arg
))
16547 /* [temp.deduct.type] A template-argument can be
16548 deduced from a pointer to function or pointer
16549 to member function argument if the set of
16550 overloaded functions does not contain function
16551 templates and at most one of a set of
16552 overloaded functions provides a unique
16555 if (resolve_overloaded_unification
16556 (tparms
, targs
, parm
, arg
, strict
,
16557 arg_strict
, explain_p
))
16558 return unify_success (explain_p
);
16559 return unify_overload_resolution_failure (explain_p
, arg
);
16563 arg
= unlowered_expr_type (arg
);
16564 if (arg
== error_mark_node
)
16565 return unify_invalid (explain_p
);
16569 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16572 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16573 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
16574 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16576 /* For deduction from an init-list we need the actual list. */
16577 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16579 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16582 /* Most parms like fn_type_unification.
16584 If SUBR is 1, we're being called recursively (to unify the
16585 arguments of a function or method parameter of a function
16588 CHECKS is a pointer to a vector of access checks encountered while
16589 substituting default template arguments. */
16592 type_unification_real (tree tparms
,
16596 unsigned int xnargs
,
16598 unification_kind_t strict
,
16600 vec
<deferred_access_check
, va_gc
> **checks
,
16605 int ntparms
= TREE_VEC_LENGTH (tparms
);
16606 int saw_undeduced
= 0;
16609 unsigned int nargs
;
16612 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16613 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16614 gcc_assert (ntparms
> 0);
16616 /* Reset the number of non-defaulted template arguments contained
16618 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16626 while (parms
&& parms
!= void_list_node
16629 parm
= TREE_VALUE (parms
);
16631 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16632 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16633 /* For a function parameter pack that occurs at the end of the
16634 parameter-declaration-list, the type A of each remaining
16635 argument of the call is compared with the type P of the
16636 declarator-id of the function parameter pack. */
16639 parms
= TREE_CHAIN (parms
);
16641 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16642 /* For a function parameter pack that does not occur at the
16643 end of the parameter-declaration-list, the type of the
16644 parameter pack is a non-deduced context. */
16650 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16656 && parms
!= void_list_node
16657 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16659 /* Unify the remaining arguments with the pack expansion type. */
16661 tree parmvec
= make_tree_vec (1);
16663 /* Allocate a TREE_VEC and copy in all of the arguments */
16664 argvec
= make_tree_vec (nargs
- ia
);
16665 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
16666 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
16668 /* Copy the parameter into parmvec. */
16669 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
16670 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
16671 /*subr=*/subr
, explain_p
))
16674 /* Advance to the end of the list of parameters. */
16675 parms
= TREE_CHAIN (parms
);
16678 /* Fail if we've reached the end of the parm list, and more args
16679 are present, and the parm list isn't variadic. */
16680 if (ia
< nargs
&& parms
== void_list_node
)
16681 return unify_too_many_arguments (explain_p
, nargs
, ia
);
16682 /* Fail if parms are left and they don't have default values and
16683 they aren't all deduced as empty packs (c++/57397). This is
16684 consistent with sufficient_parms_p. */
16685 if (parms
&& parms
!= void_list_node
16686 && TREE_PURPOSE (parms
) == NULL_TREE
)
16688 unsigned int count
= nargs
;
16693 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
16696 p
= TREE_CHAIN (p
);
16698 while (p
&& p
!= void_list_node
);
16699 if (count
!= nargs
)
16700 return unify_too_few_arguments (explain_p
, ia
, count
,
16706 tsubst_flags_t complain
= (explain_p
16707 ? tf_warning_or_error
16710 for (i
= 0; i
< ntparms
; i
++)
16712 tree targ
= TREE_VEC_ELT (targs
, i
);
16713 tree tparm
= TREE_VEC_ELT (tparms
, i
);
16715 /* Clear the "incomplete" flags on all argument packs now so that
16716 substituting them into later default arguments works. */
16717 if (targ
&& ARGUMENT_PACK_P (targ
))
16719 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
16720 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
16723 if (targ
|| tparm
== error_mark_node
)
16725 tparm
= TREE_VALUE (tparm
);
16727 /* If this is an undeduced nontype parameter that depends on
16728 a type parameter, try another pass; its type may have been
16729 deduced from a later argument than the one from which
16730 this parameter can be deduced. */
16731 if (TREE_CODE (tparm
) == PARM_DECL
16732 && uses_template_parms (TREE_TYPE (tparm
))
16733 && !saw_undeduced
++)
16736 /* Core issue #226 (C++0x) [temp.deduct]:
16738 If a template argument has not been deduced, its
16739 default template argument, if any, is used.
16741 When we are in C++98 mode, TREE_PURPOSE will either
16742 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16743 to explicitly check cxx_dialect here. */
16744 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
16746 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16747 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
16748 reopen_deferring_access_checks (*checks
);
16749 location_t save_loc
= input_location
;
16751 input_location
= DECL_SOURCE_LOCATION (parm
);
16752 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
16753 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
16755 input_location
= save_loc
;
16756 *checks
= get_deferred_access_checks ();
16757 pop_deferring_access_checks ();
16758 if (arg
== error_mark_node
)
16762 TREE_VEC_ELT (targs
, i
) = arg
;
16763 /* The position of the first default template argument,
16764 is also the number of non-defaulted arguments in TARGS.
16766 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16767 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
16772 /* If the type parameter is a parameter pack, then it will
16773 be deduced to an empty parameter pack. */
16774 if (template_parameter_pack_p (tparm
))
16778 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
16780 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
16781 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
16782 TREE_CONSTANT (arg
) = 1;
16785 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16787 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
16789 TREE_VEC_ELT (targs
, i
) = arg
;
16793 return unify_parameter_deduction_failure (explain_p
, tparm
);
16796 #ifdef ENABLE_CHECKING
16797 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16798 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
16801 return unify_success (explain_p
);
16804 /* Subroutine of type_unification_real. Args are like the variables
16805 at the call site. ARG is an overloaded function (or template-id);
16806 we try deducing template args from each of the overloads, and if
16807 only one succeeds, we go with that. Modifies TARGS and returns
16808 true on success. */
16811 resolve_overloaded_unification (tree tparms
,
16815 unification_kind_t strict
,
16819 tree tempargs
= copy_node (targs
);
16821 tree goodfn
= NULL_TREE
;
16824 if (TREE_CODE (arg
) == ADDR_EXPR
)
16826 arg
= TREE_OPERAND (arg
, 0);
16832 if (TREE_CODE (arg
) == COMPONENT_REF
)
16833 /* Handle `&x' where `x' is some static or non-static member
16835 arg
= TREE_OPERAND (arg
, 1);
16837 if (TREE_CODE (arg
) == OFFSET_REF
)
16838 arg
= TREE_OPERAND (arg
, 1);
16840 /* Strip baselink information. */
16841 if (BASELINK_P (arg
))
16842 arg
= BASELINK_FUNCTIONS (arg
);
16844 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
16846 /* If we got some explicit template args, we need to plug them into
16847 the affected templates before we try to unify, in case the
16848 explicit args will completely resolve the templates in question. */
16851 tree expl_subargs
= TREE_OPERAND (arg
, 1);
16852 arg
= TREE_OPERAND (arg
, 0);
16854 for (; arg
; arg
= OVL_NEXT (arg
))
16856 tree fn
= OVL_CURRENT (arg
);
16857 tree subargs
, elem
;
16859 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16862 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16863 expl_subargs
, NULL_TREE
, tf_none
,
16864 /*require_all_args=*/true,
16865 /*use_default_args=*/true);
16866 if (subargs
!= error_mark_node
16867 && !any_dependent_template_arguments_p (subargs
))
16869 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
16870 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16871 elem
, strict
, sub_strict
, addr_p
, explain_p
)
16872 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
16881 /* If no templates (or more than one) are fully resolved by the
16882 explicit arguments, this template-id is a non-deduced context; it
16883 could still be OK if we deduce all template arguments for the
16884 enclosing call through other arguments. */
16888 else if (TREE_CODE (arg
) != OVERLOAD
16889 && TREE_CODE (arg
) != FUNCTION_DECL
)
16890 /* If ARG is, for example, "(0, &f)" then its type will be unknown
16891 -- but the deduction does not succeed because the expression is
16892 not just the function on its own. */
16895 for (; arg
; arg
= OVL_NEXT (arg
))
16896 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16897 TREE_TYPE (OVL_CURRENT (arg
)),
16898 strict
, sub_strict
, addr_p
, explain_p
)
16899 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
16901 goodfn
= OVL_CURRENT (arg
);
16905 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16906 to function or pointer to member function argument if the set of
16907 overloaded functions does not contain function templates and at most
16908 one of a set of overloaded functions provides a unique match.
16910 So if we found multiple possibilities, we return success but don't
16911 deduce anything. */
16915 int i
= TREE_VEC_LENGTH (targs
);
16917 if (TREE_VEC_ELT (tempargs
, i
))
16919 tree old
= TREE_VEC_ELT (targs
, i
);
16920 tree new_
= TREE_VEC_ELT (tempargs
, i
);
16921 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
16922 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
16923 /* Don't forget explicit template arguments in a pack. */
16924 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
16925 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
16926 TREE_VEC_ELT (targs
, i
) = new_
;
16935 /* Core DR 115: In contexts where deduction is done and fails, or in
16936 contexts where deduction is not done, if a template argument list is
16937 specified and it, along with any default template arguments, identifies
16938 a single function template specialization, then the template-id is an
16939 lvalue for the function template specialization. */
16942 resolve_nondeduced_context (tree orig_expr
)
16944 tree expr
, offset
, baselink
;
16947 if (!type_unknown_p (orig_expr
))
16952 offset
= NULL_TREE
;
16953 baselink
= NULL_TREE
;
16955 if (TREE_CODE (expr
) == ADDR_EXPR
)
16957 expr
= TREE_OPERAND (expr
, 0);
16960 if (TREE_CODE (expr
) == OFFSET_REF
)
16963 expr
= TREE_OPERAND (expr
, 1);
16965 if (BASELINK_P (expr
))
16968 expr
= BASELINK_FUNCTIONS (expr
);
16971 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
16974 tree goodfn
= NULL_TREE
;
16976 /* If we got some explicit template args, we need to plug them into
16977 the affected templates before we try to unify, in case the
16978 explicit args will completely resolve the templates in question. */
16980 tree expl_subargs
= TREE_OPERAND (expr
, 1);
16981 tree arg
= TREE_OPERAND (expr
, 0);
16982 tree badfn
= NULL_TREE
;
16983 tree badargs
= NULL_TREE
;
16985 for (; arg
; arg
= OVL_NEXT (arg
))
16987 tree fn
= OVL_CURRENT (arg
);
16988 tree subargs
, elem
;
16990 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16993 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16994 expl_subargs
, NULL_TREE
, tf_none
,
16995 /*require_all_args=*/true,
16996 /*use_default_args=*/true);
16997 if (subargs
!= error_mark_node
16998 && !any_dependent_template_arguments_p (subargs
))
17000 elem
= instantiate_template (fn
, subargs
, tf_none
);
17001 if (elem
== error_mark_node
)
17006 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17015 mark_used (goodfn
);
17018 expr
= build_baselink (BASELINK_BINFO (baselink
),
17019 BASELINK_ACCESS_BINFO (baselink
),
17020 expr
, BASELINK_OPTYPE (baselink
));
17024 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17025 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17028 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17031 else if (good
== 0 && badargs
)
17032 /* There were no good options and at least one bad one, so let the
17033 user know what the problem is. */
17034 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17039 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17040 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17041 different overloads deduce different arguments for a given parm.
17042 ADDR_P is true if the expression for which deduction is being
17043 performed was of the form "& fn" rather than simply "fn".
17045 Returns 1 on success. */
17048 try_one_overload (tree tparms
,
17053 unification_kind_t strict
,
17062 if (arg
== error_mark_node
)
17065 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17066 to function or pointer to member function argument if the set of
17067 overloaded functions does not contain function templates and at most
17068 one of a set of overloaded functions provides a unique match.
17070 So if this is a template, just return success. */
17072 if (uses_template_parms (arg
))
17075 if (TREE_CODE (arg
) == METHOD_TYPE
)
17076 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
17078 arg
= build_pointer_type (arg
);
17080 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
17082 /* We don't copy orig_targs for this because if we have already deduced
17083 some template args from previous args, unify would complain when we
17084 try to deduce a template parameter for the same argument, even though
17085 there isn't really a conflict. */
17086 nargs
= TREE_VEC_LENGTH (targs
);
17087 tempargs
= make_tree_vec (nargs
);
17089 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
17092 /* First make sure we didn't deduce anything that conflicts with
17093 explicitly specified args. */
17094 for (i
= nargs
; i
--; )
17096 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17097 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
17101 else if (uses_template_parms (elt
))
17102 /* Since we're unifying against ourselves, we will fill in
17103 template args used in the function parm list with our own
17104 template parms. Discard them. */
17105 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
17106 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
17110 for (i
= nargs
; i
--; )
17112 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17115 TREE_VEC_ELT (targs
, i
) = elt
;
17121 /* PARM is a template class (perhaps with unbound template
17122 parameters). ARG is a fully instantiated type. If ARG can be
17123 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
17124 TARGS are as for unify. */
17127 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
17130 tree copy_of_targs
;
17132 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
17133 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
17134 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
17137 /* We need to make a new template argument vector for the call to
17138 unify. If we used TARGS, we'd clutter it up with the result of
17139 the attempted unification, even if this class didn't work out.
17140 We also don't want to commit ourselves to all the unifications
17141 we've already done, since unification is supposed to be done on
17142 an argument-by-argument basis. In other words, consider the
17143 following pathological case:
17145 template <int I, int J, int K>
17148 template <int I, int J>
17149 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
17151 template <int I, int J, int K>
17152 void f(S<I, J, K>, S<I, I, I>);
17161 Now, by the time we consider the unification involving `s2', we
17162 already know that we must have `f<0, 0, 0>'. But, even though
17163 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17164 because there are two ways to unify base classes of S<0, 1, 2>
17165 with S<I, I, I>. If we kept the already deduced knowledge, we
17166 would reject the possibility I=1. */
17167 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
17169 /* If unification failed, we're done. */
17170 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
17171 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
17177 /* Given a template type PARM and a class type ARG, find the unique
17178 base type in ARG that is an instance of PARM. We do not examine
17179 ARG itself; only its base-classes. If there is not exactly one
17180 appropriate base class, return NULL_TREE. PARM may be the type of
17181 a partial specialization, as well as a plain template type. Used
17184 static enum template_base_result
17185 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
17186 bool explain_p
, tree
*result
)
17188 tree rval
= NULL_TREE
;
17191 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
17193 binfo
= TYPE_BINFO (complete_type (arg
));
17196 /* The type could not be completed. */
17197 *result
= NULL_TREE
;
17198 return tbr_incomplete_type
;
17201 /* Walk in inheritance graph order. The search order is not
17202 important, and this avoids multiple walks of virtual bases. */
17203 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
17205 tree r
= try_class_unification (tparms
, targs
, parm
,
17206 BINFO_TYPE (binfo
), explain_p
);
17210 /* If there is more than one satisfactory baseclass, then:
17214 If they yield more than one possible deduced A, the type
17218 if (rval
&& !same_type_p (r
, rval
))
17220 *result
= NULL_TREE
;
17221 return tbr_ambiguous_baseclass
;
17229 return tbr_success
;
17232 /* Returns the level of DECL, which declares a template parameter. */
17235 template_decl_level (tree decl
)
17237 switch (TREE_CODE (decl
))
17240 case TEMPLATE_DECL
:
17241 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
17244 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
17247 gcc_unreachable ();
17252 /* Decide whether ARG can be unified with PARM, considering only the
17253 cv-qualifiers of each type, given STRICT as documented for unify.
17254 Returns nonzero iff the unification is OK on that basis. */
17257 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17259 int arg_quals
= cp_type_quals (arg
);
17260 int parm_quals
= cp_type_quals (parm
);
17262 /* DR 1584: cv-qualification of a deduced function type is
17263 ignored; see 8.3.5 [dcl.fct]. */
17264 if (TREE_CODE (arg
) == FUNCTION_TYPE
)
17267 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17268 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17270 /* Although a CVR qualifier is ignored when being applied to a
17271 substituted template parameter ([8.3.2]/1 for example), that
17272 does not allow us to unify "const T" with "int&" because both
17273 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17274 It is ok when we're allowing additional CV qualifiers
17275 at the outer level [14.8.2.1]/3,1st bullet. */
17276 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17277 || TREE_CODE (arg
) == FUNCTION_TYPE
17278 || TREE_CODE (arg
) == METHOD_TYPE
)
17279 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17282 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17283 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17287 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17288 && (arg_quals
& parm_quals
) != parm_quals
)
17291 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17292 && (parm_quals
& arg_quals
) != arg_quals
)
17298 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17300 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17302 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17303 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17304 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17306 *index
= TEMPLATE_TYPE_IDX (parm
);
17307 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17311 *index
= TEMPLATE_PARM_IDX (parm
);
17312 *level
= TEMPLATE_PARM_LEVEL (parm
);
17316 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17318 if (unify (TP, TA, P, A, S, EP)) \
17322 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17323 expansion at the end of PACKED_PARMS. Returns 0 if the type
17324 deduction succeeds, 1 otherwise. STRICT is the same as in
17325 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17326 call argument list. We'll need to adjust the arguments to make them
17327 types. SUBR tells us if this is from a recursive call to
17328 type_unification_real, or for comparing two template argument
17332 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17333 tree packed_args
, unification_kind_t strict
,
17334 bool subr
, bool explain_p
)
17337 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17338 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17339 tree pack
, packs
= NULL_TREE
;
17340 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17342 packed_args
= expand_template_argument_pack (packed_args
);
17344 int len
= TREE_VEC_LENGTH (packed_args
);
17346 /* Determine the parameter packs we will be deducing from the
17347 pattern, and record their current deductions. */
17348 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17349 pack
; pack
= TREE_CHAIN (pack
))
17351 tree parm_pack
= TREE_VALUE (pack
);
17354 /* Determine the index and level of this parameter pack. */
17355 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17357 /* Keep track of the parameter packs and their corresponding
17359 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17360 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17363 /* Loop through all of the arguments that have not yet been
17364 unified and unify each with the pattern. */
17365 for (i
= start
; i
< len
; i
++)
17368 bool any_explicit
= false;
17369 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17371 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17372 or the element of its argument pack at the current index if
17373 this argument was explicitly specified. */
17374 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17378 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17381 if (TREE_VALUE (pack
)
17382 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17383 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17385 any_explicit
= true;
17386 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17388 TMPL_ARG (targs
, level
, idx
) = arg
;
17391 /* If we had explicit template arguments, substitute them into the
17392 pattern before deduction. */
17395 /* Some arguments might still be unspecified or dependent. */
17397 ++processing_template_decl
;
17398 dependent
= any_dependent_template_arguments_p (targs
);
17400 --processing_template_decl
;
17401 parm
= tsubst (pattern
, targs
,
17402 explain_p
? tf_warning_or_error
: tf_none
,
17405 --processing_template_decl
;
17406 if (parm
== error_mark_node
)
17412 /* Unify the pattern with the current argument. */
17413 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17414 LOOKUP_IMPLICIT
, explain_p
))
17417 /* For each parameter pack, collect the deduced value. */
17418 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17421 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17423 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17424 TMPL_ARG (targs
, level
, idx
);
17428 /* Verify that the results of unification with the parameter packs
17429 produce results consistent with what we've seen before, and make
17430 the deduced argument packs available. */
17431 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17433 tree old_pack
= TREE_VALUE (pack
);
17434 tree new_args
= TREE_TYPE (pack
);
17435 int i
, len
= TREE_VEC_LENGTH (new_args
);
17437 bool nondeduced_p
= false;
17439 /* By default keep the original deduced argument pack.
17440 If necessary, more specific code is going to update the
17441 resulting deduced argument later down in this function. */
17442 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17443 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17445 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17446 actually deduce anything. */
17447 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17448 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17449 nondeduced_p
= true;
17453 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17455 /* If we had fewer function args than explicit template args,
17456 just use the explicits. */
17457 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17458 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17459 if (len
< explicit_len
)
17460 new_args
= explicit_args
;
17466 /* Build the deduced *_ARGUMENT_PACK. */
17467 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17469 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17470 TREE_TYPE (result
) =
17471 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17472 TREE_CONSTANT (result
) = 1;
17475 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17477 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17479 /* Note the deduced argument packs for this parameter
17481 TMPL_ARG (targs
, level
, idx
) = result
;
17483 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17484 && (ARGUMENT_PACK_ARGS (old_pack
)
17485 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17487 /* We only had the explicitly-provided arguments before, but
17488 now we have a complete set of arguments. */
17489 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17491 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17492 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17493 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17497 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17498 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17500 if (!comp_template_args_with_info (old_args
, new_args
,
17501 &bad_old_arg
, &bad_new_arg
))
17502 /* Inconsistent unification of this parameter pack. */
17503 return unify_parameter_pack_inconsistent (explain_p
,
17509 return unify_success (explain_p
);
17512 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17513 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17514 parameters and return value are as for unify. */
17517 unify_array_domain (tree tparms
, tree targs
,
17518 tree parm_dom
, tree arg_dom
,
17526 /* Our representation of array types uses "N - 1" as the
17527 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17528 not an integer constant. We cannot unify arbitrarily
17529 complex expressions, so we eliminate the MINUS_EXPRs
17531 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17532 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17535 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17536 parm_max
= TREE_OPERAND (parm_max
, 0);
17538 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17539 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17542 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17543 trying to unify the type of a variable with the type
17544 of a template parameter. For example:
17546 template <unsigned int N>
17547 void f (char (&) [N]);
17554 Here, the type of the ARG will be "int [g(i)]", and
17555 may be a SAVE_EXPR, etc. */
17556 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17557 return unify_vla_arg (explain_p
, arg_dom
);
17558 arg_max
= TREE_OPERAND (arg_max
, 0);
17561 /* If only one of the bounds used a MINUS_EXPR, compensate
17562 by adding one to the other bound. */
17563 if (parm_cst
&& !arg_cst
)
17564 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17568 else if (arg_cst
&& !parm_cst
)
17569 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17574 return unify (tparms
, targs
, parm_max
, arg_max
,
17575 UNIFY_ALLOW_INTEGER
, explain_p
);
17578 /* Deduce the value of template parameters. TPARMS is the (innermost)
17579 set of template parameters to a template. TARGS is the bindings
17580 for those template parameters, as determined thus far; TARGS may
17581 include template arguments for outer levels of template parameters
17582 as well. PARM is a parameter to a template function, or a
17583 subcomponent of that parameter; ARG is the corresponding argument.
17584 This function attempts to match PARM with ARG in a manner
17585 consistent with the existing assignments in TARGS. If more values
17586 are deduced, then TARGS is updated.
17588 Returns 0 if the type deduction succeeds, 1 otherwise. The
17589 parameter STRICT is a bitwise or of the following flags:
17592 Require an exact match between PARM and ARG.
17593 UNIFY_ALLOW_MORE_CV_QUAL:
17594 Allow the deduced ARG to be more cv-qualified (by qualification
17595 conversion) than ARG.
17596 UNIFY_ALLOW_LESS_CV_QUAL:
17597 Allow the deduced ARG to be less cv-qualified than ARG.
17598 UNIFY_ALLOW_DERIVED:
17599 Allow the deduced ARG to be a template base class of ARG,
17600 or a pointer to a template base class of the type pointed to by
17602 UNIFY_ALLOW_INTEGER:
17603 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17604 case for more information.
17605 UNIFY_ALLOW_OUTER_LEVEL:
17606 This is the outermost level of a deduction. Used to determine validity
17607 of qualification conversions. A valid qualification conversion must
17608 have const qualified pointers leading up to the inner type which
17609 requires additional CV quals, except at the outer level, where const
17610 is not required [conv.qual]. It would be normal to set this flag in
17611 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17612 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17613 This is the outermost level of a deduction, and PARM can be more CV
17614 qualified at this point.
17615 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17616 This is the outermost level of a deduction, and PARM can be less CV
17617 qualified at this point. */
17620 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
17626 int strict_in
= strict
;
17628 /* I don't think this will do the right thing with respect to types.
17629 But the only case I've seen it in so far has been array bounds, where
17630 signedness is the only information lost, and I think that will be
17632 while (TREE_CODE (parm
) == NOP_EXPR
)
17633 parm
= TREE_OPERAND (parm
, 0);
17635 if (arg
== error_mark_node
)
17636 return unify_invalid (explain_p
);
17637 if (arg
== unknown_type_node
17638 || arg
== init_list_type_node
)
17639 /* We can't deduce anything from this, but we might get all the
17640 template args from other function args. */
17641 return unify_success (explain_p
);
17643 /* If PARM uses template parameters, then we can't bail out here,
17644 even if ARG == PARM, since we won't record unifications for the
17645 template parameters. We might need them if we're trying to
17646 figure out which of two things is more specialized. */
17647 if (arg
== parm
&& !uses_template_parms (parm
))
17648 return unify_success (explain_p
);
17650 /* Handle init lists early, so the rest of the function can assume
17651 we're dealing with a type. */
17652 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
17656 tree orig_parm
= parm
;
17658 /* Replace T with std::initializer_list<T> for deduction. */
17659 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17660 && flag_deduce_init_list
)
17661 parm
= listify (parm
);
17663 if (!is_std_init_list (parm
)
17664 && TREE_CODE (parm
) != ARRAY_TYPE
)
17665 /* We can only deduce from an initializer list argument if the
17666 parameter is std::initializer_list or an array; otherwise this
17667 is a non-deduced context. */
17668 return unify_success (explain_p
);
17670 if (TREE_CODE (parm
) == ARRAY_TYPE
)
17671 elttype
= TREE_TYPE (parm
);
17673 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
17675 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
17677 int elt_strict
= strict
;
17679 if (elt
== error_mark_node
)
17680 return unify_invalid (explain_p
);
17682 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
17684 tree type
= TREE_TYPE (elt
);
17685 /* It should only be possible to get here for a call. */
17686 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
17687 elt_strict
|= maybe_adjust_types_for_deduction
17688 (DEDUCE_CALL
, &elttype
, &type
, elt
);
17692 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
17696 if (TREE_CODE (parm
) == ARRAY_TYPE
17697 && deducible_array_bound (TYPE_DOMAIN (parm
)))
17699 /* Also deduce from the length of the initializer list. */
17700 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
17701 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
17702 if (idx
== error_mark_node
)
17703 return unify_invalid (explain_p
);
17704 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17708 /* If the std::initializer_list<T> deduction worked, replace the
17709 deduced A with std::initializer_list<A>. */
17710 if (orig_parm
!= parm
)
17712 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
17713 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17714 targ
= listify (targ
);
17715 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
17717 return unify_success (explain_p
);
17720 /* Immediately reject some pairs that won't unify because of
17721 cv-qualification mismatches. */
17722 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17724 /* It is the elements of the array which hold the cv quals of an array
17725 type, and the elements might be template type parms. We'll check
17726 when we recurse. */
17727 && TREE_CODE (arg
) != ARRAY_TYPE
17728 /* We check the cv-qualifiers when unifying with template type
17729 parameters below. We want to allow ARG `const T' to unify with
17730 PARM `T' for example, when computing which of two templates
17731 is more specialized, for example. */
17732 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
17733 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
17734 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17736 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
17737 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
17738 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
17739 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
17740 strict
&= ~UNIFY_ALLOW_DERIVED
;
17741 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17742 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
17744 switch (TREE_CODE (parm
))
17746 case TYPENAME_TYPE
:
17748 case UNBOUND_CLASS_TEMPLATE
:
17749 /* In a type which contains a nested-name-specifier, template
17750 argument values cannot be deduced for template parameters used
17751 within the nested-name-specifier. */
17752 return unify_success (explain_p
);
17754 case TEMPLATE_TYPE_PARM
:
17755 case TEMPLATE_TEMPLATE_PARM
:
17756 case BOUND_TEMPLATE_TEMPLATE_PARM
:
17757 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17758 if (error_operand_p (tparm
))
17759 return unify_invalid (explain_p
);
17761 if (TEMPLATE_TYPE_LEVEL (parm
)
17762 != template_decl_level (tparm
))
17763 /* The PARM is not one we're trying to unify. Just check
17764 to see if it matches ARG. */
17766 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17767 && (is_auto (parm
) ? is_auto (arg
)
17768 : same_type_p (parm
, arg
)))
17769 return unify_success (explain_p
);
17771 return unify_type_mismatch (explain_p
, parm
, arg
);
17773 idx
= TEMPLATE_TYPE_IDX (parm
);
17774 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17775 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
17776 if (error_operand_p (tparm
))
17777 return unify_invalid (explain_p
);
17779 /* Check for mixed types and values. */
17780 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17781 && TREE_CODE (tparm
) != TYPE_DECL
)
17782 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17783 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
17784 gcc_unreachable ();
17786 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17788 /* ARG must be constructed from a template class or a template
17789 template parameter. */
17790 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
17791 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
17792 return unify_template_deduction_failure (explain_p
, parm
, arg
);
17794 tree parmvec
= TYPE_TI_ARGS (parm
);
17795 /* An alias template name is never deduced. */
17796 if (TYPE_ALIAS_P (arg
))
17797 arg
= strip_typedefs (arg
);
17798 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
17799 tree full_argvec
= add_to_template_args (targs
, argvec
);
17801 = DECL_INNERMOST_TEMPLATE_PARMS
17802 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
17804 int parm_variadic_p
= 0;
17806 /* The resolution to DR150 makes clear that default
17807 arguments for an N-argument may not be used to bind T
17808 to a template template parameter with fewer than N
17809 parameters. It is not safe to permit the binding of
17810 default arguments as an extension, as that may change
17811 the meaning of a conforming program. Consider:
17813 struct Dense { static const unsigned int dim = 1; };
17815 template <template <typename> class View,
17817 void operator+(float, View<Block> const&);
17819 template <typename Block,
17820 unsigned int Dim = Block::dim>
17821 struct Lvalue_proxy { operator float() const; };
17825 Lvalue_proxy<Dense> p;
17830 Here, if Lvalue_proxy is permitted to bind to View, then
17831 the global operator+ will be used; if they are not, the
17832 Lvalue_proxy will be converted to float. */
17833 if (coerce_template_parms (parm_parms
,
17835 TYPE_TI_TEMPLATE (parm
),
17837 ? tf_warning_or_error
17839 /*require_all_args=*/true,
17840 /*use_default_args=*/false)
17841 == error_mark_node
)
17844 /* Deduce arguments T, i from TT<T> or TT<i>.
17845 We check each element of PARMVEC and ARGVEC individually
17846 rather than the whole TREE_VEC since they can have
17847 different number of elements. */
17849 parmvec
= expand_template_argument_pack (parmvec
);
17850 argvec
= expand_template_argument_pack (argvec
);
17852 len
= TREE_VEC_LENGTH (parmvec
);
17854 /* Check if the parameters end in a pack, making them
17857 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
17858 parm_variadic_p
= 1;
17860 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17861 /* If the template argument list of P contains a pack
17862 expansion that is not the last template argument, the
17863 entire template argument list is a non-deduced
17865 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
17866 return unify_success (explain_p
);
17868 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
17869 return unify_too_few_arguments (explain_p
,
17870 TREE_VEC_LENGTH (argvec
), len
);
17872 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17874 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17875 TREE_VEC_ELT (parmvec
, i
),
17876 TREE_VEC_ELT (argvec
, i
),
17877 UNIFY_ALLOW_NONE
, explain_p
);
17880 if (parm_variadic_p
17881 && unify_pack_expansion (tparms
, targs
,
17884 /*subr=*/true, explain_p
))
17887 arg
= TYPE_TI_TEMPLATE (arg
);
17889 /* Fall through to deduce template name. */
17892 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17893 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17895 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
17897 /* Simple cases: Value already set, does match or doesn't. */
17898 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
17899 return unify_success (explain_p
);
17901 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17905 /* If PARM is `const T' and ARG is only `int', we don't have
17906 a match unless we are allowing additional qualification.
17907 If ARG is `const int' and PARM is just `T' that's OK;
17908 that binds `const int' to `T'. */
17909 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
17911 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17913 /* Consider the case where ARG is `const volatile int' and
17914 PARM is `const T'. Then, T should be `volatile int'. */
17915 arg
= cp_build_qualified_type_real
17916 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
17917 if (arg
== error_mark_node
)
17918 return unify_invalid (explain_p
);
17920 /* Simple cases: Value already set, does match or doesn't. */
17921 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
17922 return unify_success (explain_p
);
17924 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17926 /* Make sure that ARG is not a variable-sized array. (Note
17927 that were talking about variable-sized arrays (like
17928 `int[n]'), rather than arrays of unknown size (like
17929 `int[]').) We'll get very confused by such a type since
17930 the bound of the array is not constant, and therefore
17931 not mangleable. Besides, such types are not allowed in
17932 ISO C++, so we can do as we please here. We do allow
17933 them for 'auto' deduction, since that isn't ABI-exposed. */
17934 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
17935 return unify_vla_arg (explain_p
, arg
);
17937 /* Strip typedefs as in convert_template_argument. */
17938 arg
= canonicalize_type_argument (arg
, tf_none
);
17941 /* If ARG is a parameter pack or an expansion, we cannot unify
17942 against it unless PARM is also a parameter pack. */
17943 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
17944 && !template_parameter_pack_p (parm
))
17945 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
17947 /* If the argument deduction results is a METHOD_TYPE,
17948 then there is a problem.
17949 METHOD_TYPE doesn't map to any real C++ type the result of
17950 the deduction can not be of that type. */
17951 if (TREE_CODE (arg
) == METHOD_TYPE
)
17952 return unify_method_type_error (explain_p
, arg
);
17954 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
17955 return unify_success (explain_p
);
17957 case TEMPLATE_PARM_INDEX
:
17958 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17959 if (error_operand_p (tparm
))
17960 return unify_invalid (explain_p
);
17962 if (TEMPLATE_PARM_LEVEL (parm
)
17963 != template_decl_level (tparm
))
17965 /* The PARM is not one we're trying to unify. Just check
17966 to see if it matches ARG. */
17967 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
17968 && cp_tree_equal (parm
, arg
));
17970 unify_expression_unequal (explain_p
, parm
, arg
);
17974 idx
= TEMPLATE_PARM_IDX (parm
);
17975 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17979 int x
= !cp_tree_equal (targ
, arg
);
17981 unify_inconsistency (explain_p
, parm
, targ
, arg
);
17985 /* [temp.deduct.type] If, in the declaration of a function template
17986 with a non-type template-parameter, the non-type
17987 template-parameter is used in an expression in the function
17988 parameter-list and, if the corresponding template-argument is
17989 deduced, the template-argument type shall match the type of the
17990 template-parameter exactly, except that a template-argument
17991 deduced from an array bound may be of any integral type.
17992 The non-type parameter might use already deduced type parameters. */
17993 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
17994 if (!TREE_TYPE (arg
))
17995 /* Template-parameter dependent expression. Just accept it for now.
17996 It will later be processed in convert_template_argument. */
17998 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18000 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18001 && CP_INTEGRAL_TYPE_P (tparm
))
18002 /* Convert the ARG to the type of PARM; the deduced non-type
18003 template argument must exactly match the types of the
18004 corresponding parameter. */
18005 arg
= fold (build_nop (tparm
, arg
));
18006 else if (uses_template_parms (tparm
))
18007 /* We haven't deduced the type of this parameter yet. Try again
18009 return unify_success (explain_p
);
18011 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18013 /* If ARG is a parameter pack or an expansion, we cannot unify
18014 against it unless PARM is also a parameter pack. */
18015 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18016 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18017 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18019 arg
= strip_typedefs_expr (arg
);
18020 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18021 return unify_success (explain_p
);
18025 /* A pointer-to-member constant can be unified only with
18026 another constant. */
18027 if (TREE_CODE (arg
) != PTRMEM_CST
)
18028 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18030 /* Just unify the class member. It would be useless (and possibly
18031 wrong, depending on the strict flags) to unify also
18032 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18033 arg refer to the same variable, even if through different
18034 classes. For instance:
18036 struct A { int x; };
18039 Unification of &A::x and &B::x must succeed. */
18040 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18041 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18046 if (!TYPE_PTR_P (arg
))
18047 return unify_type_mismatch (explain_p
, parm
, arg
);
18049 /* [temp.deduct.call]
18051 A can be another pointer or pointer to member type that can
18052 be converted to the deduced A via a qualification
18053 conversion (_conv.qual_).
18055 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18056 This will allow for additional cv-qualification of the
18057 pointed-to types if appropriate. */
18059 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18060 /* The derived-to-base conversion only persists through one
18061 level of pointers. */
18062 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
18064 return unify (tparms
, targs
, TREE_TYPE (parm
),
18065 TREE_TYPE (arg
), strict
, explain_p
);
18068 case REFERENCE_TYPE
:
18069 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
18070 return unify_type_mismatch (explain_p
, parm
, arg
);
18071 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18072 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18075 if (TREE_CODE (arg
) != ARRAY_TYPE
)
18076 return unify_type_mismatch (explain_p
, parm
, arg
);
18077 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
18078 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
18079 return unify_type_mismatch (explain_p
, parm
, arg
);
18080 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18081 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18082 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
18083 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18084 TYPE_DOMAIN (arg
), explain_p
);
18085 return unify_success (explain_p
);
18092 case ENUMERAL_TYPE
:
18095 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18096 return unify_type_mismatch (explain_p
, parm
, arg
);
18098 /* We have already checked cv-qualification at the top of the
18100 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
18101 return unify_type_mismatch (explain_p
, parm
, arg
);
18103 /* As far as unification is concerned, this wins. Later checks
18104 will invalidate it if necessary. */
18105 return unify_success (explain_p
);
18107 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
18108 /* Type INTEGER_CST can come from ordinary constant template args. */
18110 while (TREE_CODE (arg
) == NOP_EXPR
)
18111 arg
= TREE_OPERAND (arg
, 0);
18113 if (TREE_CODE (arg
) != INTEGER_CST
)
18114 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18115 return (tree_int_cst_equal (parm
, arg
)
18116 ? unify_success (explain_p
)
18117 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
18121 int i
, len
, argslen
;
18122 int parm_variadic_p
= 0;
18124 if (TREE_CODE (arg
) != TREE_VEC
)
18125 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18127 len
= TREE_VEC_LENGTH (parm
);
18128 argslen
= TREE_VEC_LENGTH (arg
);
18130 /* Check for pack expansions in the parameters. */
18131 for (i
= 0; i
< len
; ++i
)
18133 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
18136 /* We can unify against something with a trailing
18138 parm_variadic_p
= 1;
18140 /* [temp.deduct.type]/9: If the template argument list of
18141 P contains a pack expansion that is not the last
18142 template argument, the entire template argument list
18143 is a non-deduced context. */
18144 return unify_success (explain_p
);
18148 /* If we don't have enough arguments to satisfy the parameters
18149 (not counting the pack expression at the end), or we have
18150 too many arguments for a parameter list that doesn't end in
18151 a pack expression, we can't unify. */
18152 if (parm_variadic_p
18153 ? argslen
< len
- parm_variadic_p
18155 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
18157 /* Unify all of the parameters that precede the (optional)
18158 pack expression. */
18159 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18161 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18162 TREE_VEC_ELT (parm
, i
),
18163 TREE_VEC_ELT (arg
, i
),
18164 UNIFY_ALLOW_NONE
, explain_p
);
18166 if (parm_variadic_p
)
18167 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
18169 /*subr=*/true, explain_p
);
18170 return unify_success (explain_p
);
18175 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18176 return unify_type_mismatch (explain_p
, parm
, arg
);
18178 if (TYPE_PTRMEMFUNC_P (parm
))
18180 if (!TYPE_PTRMEMFUNC_P (arg
))
18181 return unify_type_mismatch (explain_p
, parm
, arg
);
18183 return unify (tparms
, targs
,
18184 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
18185 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
18186 strict
, explain_p
);
18188 else if (TYPE_PTRMEMFUNC_P (arg
))
18189 return unify_type_mismatch (explain_p
, parm
, arg
);
18191 if (CLASSTYPE_TEMPLATE_INFO (parm
))
18193 tree t
= NULL_TREE
;
18195 if (strict_in
& UNIFY_ALLOW_DERIVED
)
18197 /* First, we try to unify the PARM and ARG directly. */
18198 t
= try_class_unification (tparms
, targs
,
18199 parm
, arg
, explain_p
);
18203 /* Fallback to the special case allowed in
18204 [temp.deduct.call]:
18206 If P is a class, and P has the form
18207 template-id, then A can be a derived class of
18208 the deduced A. Likewise, if P is a pointer to
18209 a class of the form template-id, A can be a
18210 pointer to a derived class pointed to by the
18212 enum template_base_result r
;
18213 r
= get_template_base (tparms
, targs
, parm
, arg
,
18217 return unify_no_common_base (explain_p
, r
, parm
, arg
);
18220 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
18221 && (CLASSTYPE_TI_TEMPLATE (parm
)
18222 == CLASSTYPE_TI_TEMPLATE (arg
)))
18223 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18224 Then, we should unify `int' and `U'. */
18227 /* There's no chance of unification succeeding. */
18228 return unify_type_mismatch (explain_p
, parm
, arg
);
18230 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
18231 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
18233 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
18234 return unify_type_mismatch (explain_p
, parm
, arg
);
18235 return unify_success (explain_p
);
18238 case FUNCTION_TYPE
:
18240 unsigned int nargs
;
18245 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18246 return unify_type_mismatch (explain_p
, parm
, arg
);
18248 /* CV qualifications for methods can never be deduced, they must
18249 match exactly. We need to check them explicitly here,
18250 because type_unification_real treats them as any other
18251 cv-qualified parameter. */
18252 if (TREE_CODE (parm
) == METHOD_TYPE
18253 && (!check_cv_quals_for_unify
18255 class_of_this_parm (arg
),
18256 class_of_this_parm (parm
))))
18257 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18259 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18260 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18262 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18263 args
= XALLOCAVEC (tree
, nargs
);
18264 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18265 a
!= NULL_TREE
&& a
!= void_list_node
;
18266 a
= TREE_CHAIN (a
), ++i
)
18267 args
[i
] = TREE_VALUE (a
);
18270 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18271 args
, nargs
, 1, DEDUCE_EXACT
,
18272 LOOKUP_NORMAL
, NULL
, explain_p
);
18276 /* Unify a pointer to member with a pointer to member function, which
18277 deduces the type of the member as a function type. */
18278 if (TYPE_PTRMEMFUNC_P (arg
))
18280 /* Check top-level cv qualifiers */
18281 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18282 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18284 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18285 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18286 UNIFY_ALLOW_NONE
, explain_p
);
18288 /* Determine the type of the function we are unifying against. */
18289 tree fntype
= static_fn_type (arg
);
18291 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18294 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18295 return unify_type_mismatch (explain_p
, parm
, arg
);
18296 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18297 TYPE_OFFSET_BASETYPE (arg
),
18298 UNIFY_ALLOW_NONE
, explain_p
);
18299 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18300 strict
, explain_p
);
18303 if (DECL_TEMPLATE_PARM_P (parm
))
18304 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18305 if (arg
!= integral_constant_value (parm
))
18306 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18307 return unify_success (explain_p
);
18310 case TEMPLATE_DECL
:
18311 /* Matched cases are handled by the ARG == PARM test above. */
18312 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18315 /* A non-type template parameter that is a variable should be a
18316 an integral constant, in which case, it whould have been
18317 folded into its (constant) value. So we should not be getting
18318 a variable here. */
18319 gcc_unreachable ();
18321 case TYPE_ARGUMENT_PACK
:
18322 case NONTYPE_ARGUMENT_PACK
:
18323 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18324 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18327 case DECLTYPE_TYPE
:
18328 case UNDERLYING_TYPE
:
18329 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18330 or UNDERLYING_TYPE nodes. */
18331 return unify_success (explain_p
);
18334 /* Unification fails if we hit an error node. */
18335 return unify_invalid (explain_p
);
18338 if (REFERENCE_REF_P (parm
))
18339 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18340 strict
, explain_p
);
18344 /* An unresolved overload is a nondeduced context. */
18345 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18346 return unify_success (explain_p
);
18347 gcc_assert (EXPR_P (parm
));
18349 /* We must be looking at an expression. This can happen with
18353 void foo(S<I>, S<I + 2>);
18355 This is a "nondeduced context":
18359 The nondeduced contexts are:
18361 --A type that is a template-id in which one or more of
18362 the template-arguments is an expression that references
18363 a template-parameter.
18365 In these cases, we assume deduction succeeded, but don't
18366 actually infer any unifications. */
18368 if (!uses_template_parms (parm
)
18369 && !template_args_equal (parm
, arg
))
18370 return unify_expression_unequal (explain_p
, parm
, arg
);
18372 return unify_success (explain_p
);
18375 #undef RECUR_AND_CHECK_FAILURE
18377 /* Note that DECL can be defined in this translation unit, if
18381 mark_definable (tree decl
)
18384 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18385 FOR_EACH_CLONE (clone
, decl
)
18386 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18389 /* Called if RESULT is explicitly instantiated, or is a member of an
18390 explicitly instantiated class. */
18393 mark_decl_instantiated (tree result
, int extern_p
)
18395 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18397 /* If this entity has already been written out, it's too late to
18398 make any modifications. */
18399 if (TREE_ASM_WRITTEN (result
))
18402 /* For anonymous namespace we don't need to do anything. */
18403 if (decl_anon_ns_mem_p (result
))
18405 gcc_assert (!TREE_PUBLIC (result
));
18409 if (TREE_CODE (result
) != FUNCTION_DECL
)
18410 /* The TREE_PUBLIC flag for function declarations will have been
18411 set correctly by tsubst. */
18412 TREE_PUBLIC (result
) = 1;
18414 /* This might have been set by an earlier implicit instantiation. */
18415 DECL_COMDAT (result
) = 0;
18418 DECL_NOT_REALLY_EXTERN (result
) = 0;
18421 mark_definable (result
);
18422 mark_needed (result
);
18423 /* Always make artificials weak. */
18424 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18425 comdat_linkage (result
);
18426 /* For WIN32 we also want to put explicit instantiations in
18427 linkonce sections. */
18428 else if (TREE_PUBLIC (result
))
18429 maybe_make_one_only (result
);
18432 /* If EXTERN_P, then this function will not be emitted -- unless
18433 followed by an explicit instantiation, at which point its linkage
18434 will be adjusted. If !EXTERN_P, then this function will be
18435 emitted here. In neither circumstance do we want
18436 import_export_decl to adjust the linkage. */
18437 DECL_INTERFACE_KNOWN (result
) = 1;
18440 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18441 important template arguments. If any are missing, we check whether
18442 they're important by using error_mark_node for substituting into any
18443 args that were used for partial ordering (the ones between ARGS and END)
18444 and seeing if it bubbles up. */
18447 check_undeduced_parms (tree targs
, tree args
, tree end
)
18449 bool found
= false;
18451 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18452 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18455 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18459 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18460 if (substed
== error_mark_node
)
18466 /* Given two function templates PAT1 and PAT2, return:
18468 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18469 -1 if PAT2 is more specialized than PAT1.
18470 0 if neither is more specialized.
18472 LEN indicates the number of parameters we should consider
18473 (defaulted parameters should not be considered).
18475 The 1998 std underspecified function template partial ordering, and
18476 DR214 addresses the issue. We take pairs of arguments, one from
18477 each of the templates, and deduce them against each other. One of
18478 the templates will be more specialized if all the *other*
18479 template's arguments deduce against its arguments and at least one
18480 of its arguments *does* *not* deduce against the other template's
18481 corresponding argument. Deduction is done as for class templates.
18482 The arguments used in deduction have reference and top level cv
18483 qualifiers removed. Iff both arguments were originally reference
18484 types *and* deduction succeeds in both directions, an lvalue reference
18485 wins against an rvalue reference and otherwise the template
18486 with the more cv-qualified argument wins for that pairing (if
18487 neither is more cv-qualified, they both are equal). Unlike regular
18488 deduction, after all the arguments have been deduced in this way,
18489 we do *not* verify the deduced template argument values can be
18490 substituted into non-deduced contexts.
18492 The logic can be a bit confusing here, because we look at deduce1 and
18493 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18494 can find template arguments for pat1 to make arg1 look like arg2, that
18495 means that arg2 is at least as specialized as arg1. */
18498 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18500 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18501 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18502 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18503 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18504 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18505 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18506 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18507 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18508 tree origs1
, origs2
;
18509 bool lose1
= false;
18510 bool lose2
= false;
18512 /* Remove the this parameter from non-static member functions. If
18513 one is a non-static member function and the other is not a static
18514 member function, remove the first parameter from that function
18515 also. This situation occurs for operator functions where we
18516 locate both a member function (with this pointer) and non-member
18517 operator (with explicit first operand). */
18518 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18520 len
--; /* LEN is the number of significant arguments for DECL1 */
18521 args1
= TREE_CHAIN (args1
);
18522 if (!DECL_STATIC_FUNCTION_P (decl2
))
18523 args2
= TREE_CHAIN (args2
);
18525 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18527 args2
= TREE_CHAIN (args2
);
18528 if (!DECL_STATIC_FUNCTION_P (decl1
))
18531 args1
= TREE_CHAIN (args1
);
18535 /* If only one is a conversion operator, they are unordered. */
18536 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18539 /* Consider the return type for a conversion function */
18540 if (DECL_CONV_FN_P (decl1
))
18542 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18543 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18547 processing_template_decl
++;
18553 /* Stop when an ellipsis is seen. */
18554 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18556 tree arg1
= TREE_VALUE (args1
);
18557 tree arg2
= TREE_VALUE (args2
);
18558 int deduce1
, deduce2
;
18564 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18565 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18567 /* When both arguments are pack expansions, we need only
18568 unify the patterns themselves. */
18569 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18570 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18572 /* This is the last comparison we need to do. */
18576 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18578 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18579 arg1
= TREE_TYPE (arg1
);
18580 quals1
= cp_type_quals (arg1
);
18583 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18585 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18586 arg2
= TREE_TYPE (arg2
);
18587 quals2
= cp_type_quals (arg2
);
18590 arg1
= TYPE_MAIN_VARIANT (arg1
);
18591 arg2
= TYPE_MAIN_VARIANT (arg2
);
18593 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
18595 int i
, len2
= list_length (args2
);
18596 tree parmvec
= make_tree_vec (1);
18597 tree argvec
= make_tree_vec (len2
);
18600 /* Setup the parameter vector, which contains only ARG1. */
18601 TREE_VEC_ELT (parmvec
, 0) = arg1
;
18603 /* Setup the argument vector, which contains the remaining
18605 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
18606 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18608 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
18609 argvec
, DEDUCE_EXACT
,
18610 /*subr=*/true, /*explain_p=*/false)
18613 /* We cannot deduce in the other direction, because ARG1 is
18614 a pack expansion but ARG2 is not. */
18617 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18619 int i
, len1
= list_length (args1
);
18620 tree parmvec
= make_tree_vec (1);
18621 tree argvec
= make_tree_vec (len1
);
18624 /* Setup the parameter vector, which contains only ARG1. */
18625 TREE_VEC_ELT (parmvec
, 0) = arg2
;
18627 /* Setup the argument vector, which contains the remaining
18629 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
18630 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18632 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
18633 argvec
, DEDUCE_EXACT
,
18634 /*subr=*/true, /*explain_p=*/false)
18637 /* We cannot deduce in the other direction, because ARG2 is
18638 a pack expansion but ARG1 is not.*/
18644 /* The normal case, where neither argument is a pack
18646 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
18647 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18649 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
18650 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18654 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18655 arg2, then arg2 is not as specialized as arg1. */
18661 /* "If, for a given type, deduction succeeds in both directions
18662 (i.e., the types are identical after the transformations above)
18663 and both P and A were reference types (before being replaced with
18664 the type referred to above):
18665 - if the type from the argument template was an lvalue reference and
18666 the type from the parameter template was not, the argument type is
18667 considered to be more specialized than the other; otherwise,
18668 - if the type from the argument template is more cv-qualified
18669 than the type from the parameter template (as described above),
18670 the argument type is considered to be more specialized than the other;
18672 - neither type is more specialized than the other." */
18674 if (deduce1
&& deduce2
)
18676 if (ref1
&& ref2
&& ref1
!= ref2
)
18683 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
18685 if ((quals1
& quals2
) == quals2
)
18687 if ((quals1
& quals2
) == quals1
)
18692 if (lose1
&& lose2
)
18693 /* We've failed to deduce something in either direction.
18694 These must be unordered. */
18697 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18698 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18699 /* We have already processed all of the arguments in our
18700 handing of the pack expansion type. */
18703 args1
= TREE_CHAIN (args1
);
18704 args2
= TREE_CHAIN (args2
);
18707 /* "In most cases, all template parameters must have values in order for
18708 deduction to succeed, but for partial ordering purposes a template
18709 parameter may remain without a value provided it is not used in the
18710 types being used for partial ordering."
18712 Thus, if we are missing any of the targs1 we need to substitute into
18713 origs1, then pat2 is not as specialized as pat1. This can happen when
18714 there is a nondeduced context. */
18715 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
18717 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
18720 processing_template_decl
--;
18722 /* All things being equal, if the next argument is a pack expansion
18723 for one function but not for the other, prefer the
18724 non-variadic function. FIXME this is bogus; see c++/41958. */
18726 && args1
&& TREE_VALUE (args1
)
18727 && args2
&& TREE_VALUE (args2
))
18729 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
18730 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
18733 if (lose1
== lose2
)
18741 /* Determine which of two partial specializations of TMPL is more
18744 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
18745 to the first partial specialization. The TREE_VALUE is the
18746 innermost set of template parameters for the partial
18747 specialization. PAT2 is similar, but for the second template.
18749 Return 1 if the first partial specialization is more specialized;
18750 -1 if the second is more specialized; 0 if neither is more
18753 See [temp.class.order] for information about determining which of
18754 two templates is more specialized. */
18757 more_specialized_class (tree tmpl
, tree pat1
, tree pat2
)
18762 bool any_deductions
= false;
18764 tmpl1
= TREE_TYPE (pat1
);
18765 tmpl2
= TREE_TYPE (pat2
);
18767 /* Just like what happens for functions, if we are ordering between
18768 different class template specializations, we may encounter dependent
18769 types in the arguments, and we need our dependency check functions
18770 to behave correctly. */
18771 ++processing_template_decl
;
18772 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat1
),
18773 CLASSTYPE_TI_ARGS (tmpl1
),
18774 CLASSTYPE_TI_ARGS (tmpl2
));
18778 any_deductions
= true;
18781 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat2
),
18782 CLASSTYPE_TI_ARGS (tmpl2
),
18783 CLASSTYPE_TI_ARGS (tmpl1
));
18787 any_deductions
= true;
18789 --processing_template_decl
;
18791 /* In the case of a tie where at least one of the class templates
18792 has a parameter pack at the end, the template with the most
18793 non-packed parameters wins. */
18796 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
18797 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
18799 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
18800 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
18801 int len1
= TREE_VEC_LENGTH (args1
);
18802 int len2
= TREE_VEC_LENGTH (args2
);
18804 /* We don't count the pack expansion at the end. */
18805 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
18807 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
18812 else if (len1
< len2
)
18819 /* Return the template arguments that will produce the function signature
18820 DECL from the function template FN, with the explicit template
18821 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
18822 also match. Return NULL_TREE if no satisfactory arguments could be
18826 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
18828 int ntparms
= DECL_NTPARMS (fn
);
18829 tree targs
= make_tree_vec (ntparms
);
18830 tree decl_type
= TREE_TYPE (decl
);
18831 tree decl_arg_types
;
18833 unsigned int nargs
, ix
;
18836 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
18838 /* Never do unification on the 'this' parameter. */
18839 decl_arg_types
= skip_artificial_parms_for (decl
,
18840 TYPE_ARG_TYPES (decl_type
));
18842 nargs
= list_length (decl_arg_types
);
18843 args
= XALLOCAVEC (tree
, nargs
);
18844 for (arg
= decl_arg_types
, ix
= 0;
18845 arg
!= NULL_TREE
&& arg
!= void_list_node
;
18846 arg
= TREE_CHAIN (arg
), ++ix
)
18847 args
[ix
] = TREE_VALUE (arg
);
18849 if (fn_type_unification (fn
, explicit_args
, targs
,
18851 (check_rettype
|| DECL_CONV_FN_P (fn
)
18852 ? TREE_TYPE (decl_type
) : NULL_TREE
),
18853 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
18855 == error_mark_node
)
18861 /* Return the innermost template arguments that, when applied to a partial
18862 specialization of TMPL whose innermost template parameters are
18863 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
18866 For example, suppose we have:
18868 template <class T, class U> struct S {};
18869 template <class T> struct S<T*, int> {};
18871 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
18872 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
18873 int}. The resulting vector will be {double}, indicating that `T'
18874 is bound to `double'. */
18877 get_class_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
18879 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
18881 tree innermost_deduced_args
;
18883 innermost_deduced_args
= make_tree_vec (ntparms
);
18884 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18886 deduced_args
= copy_node (args
);
18887 SET_TMPL_ARGS_LEVEL (deduced_args
,
18888 TMPL_ARGS_DEPTH (deduced_args
),
18889 innermost_deduced_args
);
18892 deduced_args
= innermost_deduced_args
;
18894 if (unify (tparms
, deduced_args
,
18895 INNERMOST_TEMPLATE_ARGS (spec_args
),
18896 INNERMOST_TEMPLATE_ARGS (args
),
18897 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
18900 for (i
= 0; i
< ntparms
; ++i
)
18901 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
18904 /* Verify that nondeduced template arguments agree with the type
18905 obtained from argument deduction.
18909 struct A { typedef int X; };
18910 template <class T, class U> struct C {};
18911 template <class T> struct C<T, typename T::X> {};
18913 Then with the instantiation `C<A, int>', we can deduce that
18914 `T' is `A' but unify () does not check whether `typename T::X'
18916 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
18917 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18919 tf_none
, false, false);
18920 if (spec_args
== error_mark_node
18921 /* We only need to check the innermost arguments; the other
18922 arguments will always agree. */
18923 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
18924 INNERMOST_TEMPLATE_ARGS (args
)))
18927 /* Now that we have bindings for all of the template arguments,
18928 ensure that the arguments deduced for the template template
18929 parameters have compatible template parameter lists. See the use
18930 of template_template_parm_bindings_ok_p in fn_type_unification
18931 for more information. */
18932 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
18935 return deduced_args
;
18938 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
18939 Return the TREE_LIST node with the most specialized template, if
18940 any. If there is no most specialized template, the error_mark_node
18943 Note that this function does not look at, or modify, the
18944 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
18945 returned is one of the elements of INSTANTIATIONS, callers may
18946 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
18947 and retrieve it from the value returned. */
18950 most_specialized_instantiation (tree templates
)
18954 ++processing_template_decl
;
18957 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
18961 if (get_bindings (TREE_VALUE (champ
),
18962 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18963 NULL_TREE
, /*check_ret=*/true))
18966 if (get_bindings (TREE_VALUE (fn
),
18967 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18968 NULL_TREE
, /*check_ret=*/true))
18975 /* Equally specialized, move to next function. If there
18976 is no next function, nothing's most specialized. */
18977 fn
= TREE_CHAIN (fn
);
18985 /* Now verify that champ is better than everything earlier in the
18986 instantiation list. */
18987 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
18988 if (get_bindings (TREE_VALUE (champ
),
18989 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18990 NULL_TREE
, /*check_ret=*/true)
18991 || !get_bindings (TREE_VALUE (fn
),
18992 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18993 NULL_TREE
, /*check_ret=*/true))
18999 processing_template_decl
--;
19002 return error_mark_node
;
19007 /* If DECL is a specialization of some template, return the most
19008 general such template. Otherwise, returns NULL_TREE.
19010 For example, given:
19012 template <class T> struct S { template <class U> void f(U); };
19014 if TMPL is `template <class U> void S<int>::f(U)' this will return
19015 the full template. This function will not trace past partial
19016 specializations, however. For example, given in addition:
19018 template <class T> struct S<T*> { template <class U> void f(U); };
19020 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19021 `template <class T> template <class U> S<T*>::f(U)'. */
19024 most_general_template (tree decl
)
19026 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19028 if (tree tinfo
= get_template_info (decl
))
19029 decl
= TI_TEMPLATE (tinfo
);
19030 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19031 template friend, or a FIELD_DECL for a capture pack. */
19032 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19036 /* Look for more and more general templates. */
19037 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
19039 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
19040 (See cp-tree.h for details.) */
19041 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
19044 if (CLASS_TYPE_P (TREE_TYPE (decl
))
19045 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
19048 /* Stop if we run into an explicitly specialized class template. */
19049 if (!DECL_NAMESPACE_SCOPE_P (decl
)
19050 && DECL_CONTEXT (decl
)
19051 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
19054 decl
= DECL_TI_TEMPLATE (decl
);
19060 /* Return the most specialized of the class template partial
19061 specializations which can produce TYPE, a specialization of some class
19062 template. The value returned is actually a TREE_LIST; the TREE_TYPE is
19063 a _TYPE node corresponding to the partial specialization, while the
19064 TREE_PURPOSE is the set of template arguments that must be
19065 substituted into the TREE_TYPE in order to generate TYPE.
19067 If the choice of partial specialization is ambiguous, a diagnostic
19068 is issued, and the error_mark_node is returned. If there are no
19069 partial specializations matching TYPE, then NULL_TREE is
19070 returned, indicating that the primary template should be used. */
19073 most_specialized_class (tree type
, tsubst_flags_t complain
)
19075 tree list
= NULL_TREE
;
19080 tree outer_args
= NULL_TREE
;
19082 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
19083 tree main_tmpl
= most_general_template (tmpl
);
19084 tree args
= CLASSTYPE_TI_ARGS (type
);
19086 /* For determining which partial specialization to use, only the
19087 innermost args are interesting. */
19088 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19090 outer_args
= strip_innermost_template_args (args
, 1);
19091 args
= INNERMOST_TEMPLATE_ARGS (args
);
19094 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
19096 tree partial_spec_args
;
19098 tree spec_tmpl
= TREE_VALUE (t
);
19099 tree orig_parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19101 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
19103 ++processing_template_decl
;
19107 /* Discard the outer levels of args, and then substitute in the
19108 template args from the enclosing class. */
19109 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
19110 partial_spec_args
= tsubst_template_args
19111 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
19113 /* And the same for the partial specialization TEMPLATE_DECL. */
19114 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
19117 partial_spec_args
=
19118 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19121 /*require_all_args=*/true,
19122 /*use_default_args=*/true);
19124 --processing_template_decl
;
19126 if (partial_spec_args
== error_mark_node
)
19127 return error_mark_node
;
19128 if (spec_tmpl
== error_mark_node
)
19129 return error_mark_node
;
19131 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19132 spec_args
= get_class_bindings (tmpl
, parms
,
19138 spec_args
= add_to_template_args (outer_args
, spec_args
);
19139 list
= tree_cons (spec_args
, orig_parms
, list
);
19140 TREE_TYPE (list
) = TREE_TYPE (t
);
19147 ambiguous_p
= false;
19150 t
= TREE_CHAIN (t
);
19151 for (; t
; t
= TREE_CHAIN (t
))
19153 fate
= more_specialized_class (tmpl
, champ
, t
);
19160 t
= TREE_CHAIN (t
);
19163 ambiguous_p
= true;
19172 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
19174 fate
= more_specialized_class (tmpl
, champ
, t
);
19177 ambiguous_p
= true;
19185 char *spaces
= NULL
;
19186 if (!(complain
& tf_error
))
19187 return error_mark_node
;
19188 error ("ambiguous class template instantiation for %q#T", type
);
19189 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
19190 for (t
= list
; t
; t
= TREE_CHAIN (t
))
19192 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
19193 spaces
= spaces
? spaces
: get_spaces (str
);
19196 return error_mark_node
;
19202 /* Explicitly instantiate DECL. */
19205 do_decl_instantiation (tree decl
, tree storage
)
19207 tree result
= NULL_TREE
;
19210 if (!decl
|| decl
== error_mark_node
)
19211 /* An error occurred, for which grokdeclarator has already issued
19212 an appropriate message. */
19214 else if (! DECL_LANG_SPECIFIC (decl
))
19216 error ("explicit instantiation of non-template %q#D", decl
);
19220 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
19221 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
19223 if (VAR_P (decl
) && !var_templ
)
19225 /* There is an asymmetry here in the way VAR_DECLs and
19226 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19227 the latter, the DECL we get back will be marked as a
19228 template instantiation, and the appropriate
19229 DECL_TEMPLATE_INFO will be set up. This does not happen for
19230 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19231 should handle VAR_DECLs as it currently handles
19233 if (!DECL_CLASS_SCOPE_P (decl
))
19235 error ("%qD is not a static data member of a class template", decl
);
19238 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
19239 if (!result
|| !VAR_P (result
))
19241 error ("no matching template for %qD found", decl
);
19244 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
19246 error ("type %qT for explicit instantiation %qD does not match "
19247 "declared type %qT", TREE_TYPE (result
), decl
,
19252 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
19254 error ("explicit instantiation of %q#D", decl
);
19260 /* Check for various error cases. Note that if the explicit
19261 instantiation is valid the RESULT will currently be marked as an
19262 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19263 until we get here. */
19265 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19267 /* DR 259 [temp.spec].
19269 Both an explicit instantiation and a declaration of an explicit
19270 specialization shall not appear in a program unless the explicit
19271 instantiation follows a declaration of the explicit specialization.
19273 For a given set of template parameters, if an explicit
19274 instantiation of a template appears after a declaration of an
19275 explicit specialization for that template, the explicit
19276 instantiation has no effect. */
19279 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19283 No program shall explicitly instantiate any template more
19286 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19287 the first instantiation was `extern' and the second is not,
19288 and EXTERN_P for the opposite case. */
19289 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19290 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19291 /* If an "extern" explicit instantiation follows an ordinary
19292 explicit instantiation, the template is instantiated. */
19296 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19298 error ("no matching template for %qD found", result
);
19301 else if (!DECL_TEMPLATE_INFO (result
))
19303 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19307 if (storage
== NULL_TREE
)
19309 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19311 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19312 pedwarn (input_location
, OPT_Wpedantic
,
19313 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19318 error ("storage class %qD applied to template instantiation", storage
);
19320 check_explicit_instantiation_namespace (result
);
19321 mark_decl_instantiated (result
, extern_p
);
19323 instantiate_decl (result
, /*defer_ok=*/1,
19324 /*expl_inst_class_mem_p=*/false);
19328 mark_class_instantiated (tree t
, int extern_p
)
19330 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19331 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19332 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19333 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19336 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19337 rest_of_type_compilation (t
, 1);
19341 /* Called from do_type_instantiation through binding_table_foreach to
19342 do recursive instantiation for the type bound in ENTRY. */
19344 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19346 tree storage
= *(tree
*) data
;
19348 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19349 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19350 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19353 /* Called from do_type_instantiation to instantiate a member
19354 (a member function or a static member variable) of an
19355 explicitly instantiated class template. */
19357 instantiate_class_member (tree decl
, int extern_p
)
19359 mark_decl_instantiated (decl
, extern_p
);
19361 instantiate_decl (decl
, /*defer_ok=*/1,
19362 /*expl_inst_class_mem_p=*/true);
19365 /* Perform an explicit instantiation of template class T. STORAGE, if
19366 non-null, is the RID for extern, inline or static. COMPLAIN is
19367 nonzero if this is called from the parser, zero if called recursively,
19368 since the standard is unclear (as detailed below). */
19371 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19376 int previous_instantiation_extern_p
= 0;
19378 if (TREE_CODE (t
) == TYPE_DECL
)
19381 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19384 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19386 error ("explicit instantiation of non-class template %qD", tmpl
);
19388 error ("explicit instantiation of non-template type %qT", t
);
19394 if (!COMPLETE_TYPE_P (t
))
19396 if (complain
& tf_error
)
19397 error ("explicit instantiation of %q#T before definition of template",
19402 if (storage
!= NULL_TREE
)
19404 if (!in_system_header_at (input_location
))
19406 if (storage
== ridpointers
[(int) RID_EXTERN
])
19408 if (cxx_dialect
== cxx98
)
19409 pedwarn (input_location
, OPT_Wpedantic
,
19410 "ISO C++ 1998 forbids the use of %<extern%> on "
19411 "explicit instantiations");
19414 pedwarn (input_location
, OPT_Wpedantic
,
19415 "ISO C++ forbids the use of %qE"
19416 " on explicit instantiations", storage
);
19419 if (storage
== ridpointers
[(int) RID_INLINE
])
19421 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19423 else if (storage
== ridpointers
[(int) RID_STATIC
])
19427 error ("storage class %qD applied to template instantiation",
19433 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19435 /* DR 259 [temp.spec].
19437 Both an explicit instantiation and a declaration of an explicit
19438 specialization shall not appear in a program unless the explicit
19439 instantiation follows a declaration of the explicit specialization.
19441 For a given set of template parameters, if an explicit
19442 instantiation of a template appears after a declaration of an
19443 explicit specialization for that template, the explicit
19444 instantiation has no effect. */
19447 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19451 No program shall explicitly instantiate any template more
19454 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19455 instantiation was `extern'. If EXTERN_P then the second is.
19456 These cases are OK. */
19457 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19459 if (!previous_instantiation_extern_p
&& !extern_p
19460 && (complain
& tf_error
))
19461 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19463 /* If we've already instantiated the template, just return now. */
19464 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19468 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19469 mark_class_instantiated (t
, extern_p
);
19477 /* In contrast to implicit instantiation, where only the
19478 declarations, and not the definitions, of members are
19479 instantiated, we have here:
19483 The explicit instantiation of a class template specialization
19484 implies the instantiation of all of its members not
19485 previously explicitly specialized in the translation unit
19486 containing the explicit instantiation.
19488 Of course, we can't instantiate member template classes, since
19489 we don't have any arguments for them. Note that the standard
19490 is unclear on whether the instantiation of the members are
19491 *explicit* instantiations or not. However, the most natural
19492 interpretation is that it should be an explicit instantiation. */
19495 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19496 if (TREE_CODE (tmp
) == FUNCTION_DECL
19497 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19498 instantiate_class_member (tmp
, extern_p
);
19500 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19501 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19502 instantiate_class_member (tmp
, extern_p
);
19504 if (CLASSTYPE_NESTED_UTDS (t
))
19505 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19506 bt_instantiate_type_proc
, &storage
);
19510 /* Given a function DECL, which is a specialization of TMPL, modify
19511 DECL to be a re-instantiation of TMPL with the same template
19512 arguments. TMPL should be the template into which tsubst'ing
19513 should occur for DECL, not the most general template.
19515 One reason for doing this is a scenario like this:
19518 void f(const T&, int i);
19520 void g() { f(3, 7); }
19523 void f(const T& t, const int i) { }
19525 Note that when the template is first instantiated, with
19526 instantiate_template, the resulting DECL will have no name for the
19527 first parameter, and the wrong type for the second. So, when we go
19528 to instantiate the DECL, we regenerate it. */
19531 regenerate_decl_from_template (tree decl
, tree tmpl
)
19533 /* The arguments used to instantiate DECL, from the most general
19538 args
= DECL_TI_ARGS (decl
);
19539 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19541 /* Make sure that we can see identifiers, and compute access
19543 push_access_scope (decl
);
19545 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19553 args_depth
= TMPL_ARGS_DEPTH (args
);
19554 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19555 if (args_depth
> parms_depth
)
19556 args
= get_innermost_template_args (args
, parms_depth
);
19558 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19559 args
, tf_error
, NULL_TREE
,
19560 /*defer_ok*/false);
19561 if (specs
&& specs
!= error_mark_node
)
19562 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19565 /* Merge parameter declarations. */
19566 decl_parm
= skip_artificial_parms_for (decl
,
19567 DECL_ARGUMENTS (decl
));
19569 = skip_artificial_parms_for (code_pattern
,
19570 DECL_ARGUMENTS (code_pattern
));
19571 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
19576 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19577 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
19578 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
19580 parm_type
= type_decays_to (parm_type
);
19581 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19582 TREE_TYPE (decl_parm
) = parm_type
;
19583 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19584 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19586 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19587 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19589 decl_parm
= DECL_CHAIN (decl_parm
);
19590 pattern_parm
= DECL_CHAIN (pattern_parm
);
19592 /* Merge any parameters that match with the function parameter
19594 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
19597 tree expanded_types
;
19598 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19599 the parameters in this function parameter pack. */
19600 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
19601 args
, tf_error
, NULL_TREE
);
19602 len
= TREE_VEC_LENGTH (expanded_types
);
19603 for (i
= 0; i
< len
; i
++)
19608 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19609 /* Rename the parameter to include the index. */
19610 DECL_NAME (decl_parm
) =
19611 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
19612 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
19613 parm_type
= type_decays_to (parm_type
);
19614 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19615 TREE_TYPE (decl_parm
) = parm_type
;
19616 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19617 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19619 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19620 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19622 decl_parm
= DECL_CHAIN (decl_parm
);
19625 /* Merge additional specifiers from the CODE_PATTERN. */
19626 if (DECL_DECLARED_INLINE_P (code_pattern
)
19627 && !DECL_DECLARED_INLINE_P (decl
))
19628 DECL_DECLARED_INLINE_P (decl
) = 1;
19630 else if (VAR_P (decl
))
19632 DECL_INITIAL (decl
) =
19633 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
19634 tf_error
, DECL_TI_TEMPLATE (decl
),
19635 /*integral_constant_expression_p=*/false);
19636 if (VAR_HAD_UNKNOWN_BOUND (decl
))
19637 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
19638 tf_error
, DECL_TI_TEMPLATE (decl
));
19641 gcc_unreachable ();
19643 pop_access_scope (decl
);
19646 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19647 substituted to get DECL. */
19650 template_for_substitution (tree decl
)
19652 tree tmpl
= DECL_TI_TEMPLATE (decl
);
19654 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19655 for the instantiation. This is not always the most general
19656 template. Consider, for example:
19659 struct S { template <class U> void f();
19660 template <> void f<int>(); };
19662 and an instantiation of S<double>::f<int>. We want TD to be the
19663 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19664 while (/* An instantiation cannot have a definition, so we need a
19665 more general template. */
19666 DECL_TEMPLATE_INSTANTIATION (tmpl
)
19667 /* We must also deal with friend templates. Given:
19669 template <class T> struct S {
19670 template <class U> friend void f() {};
19673 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19674 so far as the language is concerned, but that's still
19675 where we get the pattern for the instantiation from. On
19676 other hand, if the definition comes outside the class, say:
19678 template <class T> struct S {
19679 template <class U> friend void f();
19681 template <class U> friend void f() {}
19683 we don't need to look any further. That's what the check for
19684 DECL_INITIAL is for. */
19685 || (TREE_CODE (decl
) == FUNCTION_DECL
19686 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
19687 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
19689 /* The present template, TD, should not be a definition. If it
19690 were a definition, we should be using it! Note that we
19691 cannot restructure the loop to just keep going until we find
19692 a template with a definition, since that might go too far if
19693 a specialization was declared, but not defined. */
19694 gcc_assert (!VAR_P (decl
)
19695 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
19697 /* Fetch the more general template. */
19698 tmpl
= DECL_TI_TEMPLATE (tmpl
);
19704 /* Returns true if we need to instantiate this template instance even if we
19705 know we aren't going to emit it.. */
19708 always_instantiate_p (tree decl
)
19710 /* We always instantiate inline functions so that we can inline them. An
19711 explicit instantiation declaration prohibits implicit instantiation of
19712 non-inline functions. With high levels of optimization, we would
19713 normally inline non-inline functions -- but we're not allowed to do
19714 that for "extern template" functions. Therefore, we check
19715 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19716 return ((TREE_CODE (decl
) == FUNCTION_DECL
19717 && (DECL_DECLARED_INLINE_P (decl
)
19718 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
19719 /* And we need to instantiate static data members so that
19720 their initializers are available in integral constant
19723 && decl_maybe_constant_var_p (decl
)));
19726 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19727 instantiate it now, modifying TREE_TYPE (fn). */
19730 maybe_instantiate_noexcept (tree fn
)
19732 tree fntype
, spec
, noex
, clone
;
19734 /* Don't instantiate a noexcept-specification from template context. */
19735 if (processing_template_decl
)
19738 if (DECL_CLONED_FUNCTION_P (fn
))
19739 fn
= DECL_CLONED_FUNCTION (fn
);
19740 fntype
= TREE_TYPE (fn
);
19741 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
19743 if (!spec
|| !TREE_PURPOSE (spec
))
19746 noex
= TREE_PURPOSE (spec
);
19748 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
19750 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
19751 spec
= get_defaulted_eh_spec (fn
);
19752 else if (push_tinst_level (fn
))
19754 push_access_scope (fn
);
19755 push_deferring_access_checks (dk_no_deferred
);
19756 input_location
= DECL_SOURCE_LOCATION (fn
);
19757 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
19758 DEFERRED_NOEXCEPT_ARGS (noex
),
19759 tf_warning_or_error
, fn
,
19760 /*function_p=*/false,
19761 /*integral_constant_expression_p=*/true);
19762 pop_deferring_access_checks ();
19763 pop_access_scope (fn
);
19764 pop_tinst_level ();
19765 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
19766 if (spec
== error_mark_node
)
19767 spec
= noexcept_false_spec
;
19770 spec
= noexcept_false_spec
;
19772 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
19775 FOR_EACH_CLONE (clone
, fn
)
19777 if (TREE_TYPE (clone
) == fntype
)
19778 TREE_TYPE (clone
) = TREE_TYPE (fn
);
19780 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
19784 /* Produce the definition of D, a _DECL generated from a template. If
19785 DEFER_OK is nonzero, then we don't have to actually do the
19786 instantiation now; we just have to do it sometime. Normally it is
19787 an error if this is an explicit instantiation but D is undefined.
19788 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
19789 explicitly instantiated class template. */
19792 instantiate_decl (tree d
, int defer_ok
,
19793 bool expl_inst_class_mem_p
)
19795 tree tmpl
= DECL_TI_TEMPLATE (d
);
19802 bool pattern_defined
;
19803 location_t saved_loc
= input_location
;
19804 int saved_unevaluated_operand
= cp_unevaluated_operand
;
19805 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
19811 /* This function should only be used to instantiate templates for
19812 functions and static member variables. */
19813 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
19815 /* Variables are never deferred; if instantiation is required, they
19816 are instantiated right away. That allows for better code in the
19817 case that an expression refers to the value of the variable --
19818 if the variable has a constant value the referring expression can
19819 take advantage of that fact. */
19821 || DECL_DECLARED_CONSTEXPR_P (d
))
19824 /* Don't instantiate cloned functions. Instead, instantiate the
19825 functions they cloned. */
19826 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
19827 d
= DECL_CLONED_FUNCTION (d
);
19829 if (DECL_TEMPLATE_INSTANTIATED (d
)
19830 || (TREE_CODE (d
) == FUNCTION_DECL
19831 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
19832 || DECL_TEMPLATE_SPECIALIZATION (d
))
19833 /* D has already been instantiated or explicitly specialized, so
19834 there's nothing for us to do here.
19836 It might seem reasonable to check whether or not D is an explicit
19837 instantiation, and, if so, stop here. But when an explicit
19838 instantiation is deferred until the end of the compilation,
19839 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
19840 the instantiation. */
19843 /* Check to see whether we know that this template will be
19844 instantiated in some other file, as with "extern template"
19846 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
19848 /* In general, we do not instantiate such templates. */
19849 if (external_p
&& !always_instantiate_p (d
))
19852 gen_tmpl
= most_general_template (tmpl
);
19853 gen_args
= DECL_TI_ARGS (d
);
19855 if (tmpl
!= gen_tmpl
)
19856 /* We should already have the extra args. */
19857 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
19858 == TMPL_ARGS_DEPTH (gen_args
));
19859 /* And what's in the hash table should match D. */
19860 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
19861 || spec
== NULL_TREE
);
19863 /* This needs to happen before any tsubsting. */
19864 if (! push_tinst_level (d
))
19867 timevar_push (TV_TEMPLATE_INST
);
19869 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
19870 for the instantiation. */
19871 td
= template_for_substitution (d
);
19872 code_pattern
= DECL_TEMPLATE_RESULT (td
);
19874 /* We should never be trying to instantiate a member of a class
19875 template or partial specialization. */
19876 gcc_assert (d
!= code_pattern
);
19878 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
19879 || DECL_TEMPLATE_SPECIALIZATION (td
))
19880 /* In the case of a friend template whose definition is provided
19881 outside the class, we may have too many arguments. Drop the
19882 ones we don't need. The same is true for specializations. */
19883 args
= get_innermost_template_args
19884 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
19888 if (TREE_CODE (d
) == FUNCTION_DECL
)
19890 deleted_p
= DECL_DELETED_FN (code_pattern
);
19891 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
19892 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
19898 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
19901 /* We may be in the middle of deferred access check. Disable it now. */
19902 push_deferring_access_checks (dk_no_deferred
);
19904 /* Unless an explicit instantiation directive has already determined
19905 the linkage of D, remember that a definition is available for
19907 if (pattern_defined
19908 && !DECL_INTERFACE_KNOWN (d
)
19909 && !DECL_NOT_REALLY_EXTERN (d
))
19910 mark_definable (d
);
19912 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
19913 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
19914 input_location
= DECL_SOURCE_LOCATION (d
);
19916 /* If D is a member of an explicitly instantiated class template,
19917 and no definition is available, treat it like an implicit
19919 if (!pattern_defined
&& expl_inst_class_mem_p
19920 && DECL_EXPLICIT_INSTANTIATION (d
))
19922 /* Leave linkage flags alone on instantiations with anonymous
19924 if (TREE_PUBLIC (d
))
19926 DECL_NOT_REALLY_EXTERN (d
) = 0;
19927 DECL_INTERFACE_KNOWN (d
) = 0;
19929 SET_DECL_IMPLICIT_INSTANTIATION (d
);
19932 /* Defer all other templates, unless we have been explicitly
19933 forbidden from doing so. */
19934 if (/* If there is no definition, we cannot instantiate the
19937 /* If it's OK to postpone instantiation, do so. */
19939 /* If this is a static data member that will be defined
19940 elsewhere, we don't want to instantiate the entire data
19941 member, but we do want to instantiate the initializer so that
19942 we can substitute that elsewhere. */
19943 || (external_p
&& VAR_P (d
))
19944 /* Handle here a deleted function too, avoid generating
19945 its body (c++/61080). */
19948 /* The definition of the static data member is now required so
19949 we must substitute the initializer. */
19951 && !DECL_INITIAL (d
)
19952 && DECL_INITIAL (code_pattern
))
19956 bool const_init
= false;
19957 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
19959 ns
= decl_namespace_context (d
);
19960 push_nested_namespace (ns
);
19962 push_nested_class (DECL_CONTEXT (d
));
19963 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
19965 tf_warning_or_error
, NULL_TREE
,
19966 /*integral_constant_expression_p=*/false);
19967 /* Make sure the initializer is still constant, in case of
19968 circular dependency (template/instantiate6.C). */
19970 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
19971 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
19972 /*asmspec_tree=*/NULL_TREE
,
19973 LOOKUP_ONLYCONVERTING
);
19975 pop_nested_class ();
19976 pop_nested_namespace (ns
);
19979 /* We restore the source position here because it's used by
19980 add_pending_template. */
19981 input_location
= saved_loc
;
19983 if (at_eof
&& !pattern_defined
19984 && DECL_EXPLICIT_INSTANTIATION (d
)
19985 && DECL_NOT_REALLY_EXTERN (d
))
19988 The definition of a non-exported function template, a
19989 non-exported member function template, or a non-exported
19990 member function or static data member of a class template
19991 shall be present in every translation unit in which it is
19992 explicitly instantiated. */
19993 permerror (input_location
, "explicit instantiation of %qD "
19994 "but no definition available", d
);
19996 /* If we're in unevaluated context, we just wanted to get the
19997 constant value; this isn't an odr use, so don't queue
19998 a full instantiation. */
19999 if (cp_unevaluated_operand
!= 0)
20001 /* ??? Historically, we have instantiated inline functions, even
20002 when marked as "extern template". */
20003 if (!(external_p
&& VAR_P (d
)))
20004 add_pending_template (d
);
20007 /* Tell the repository that D is available in this translation unit
20008 -- and see if it is supposed to be instantiated here. */
20009 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
20011 /* In a PCH file, despite the fact that the repository hasn't
20012 requested instantiation in the PCH it is still possible that
20013 an instantiation will be required in a file that includes the
20016 add_pending_template (d
);
20017 /* Instantiate inline functions so that the inliner can do its
20018 job, even though we'll not be emitting a copy of this
20020 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
20024 fn_context
= decl_function_context (d
);
20025 nested
= (current_function_decl
!= NULL_TREE
);
20027 push_to_top_level ();
20031 push_function_context ();
20032 cp_unevaluated_operand
= 0;
20033 c_inhibit_evaluation_warnings
= 0;
20036 /* Mark D as instantiated so that recursive calls to
20037 instantiate_decl do not try to instantiate it again. */
20038 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
20040 /* Regenerate the declaration in case the template has been modified
20041 by a subsequent redeclaration. */
20042 regenerate_decl_from_template (d
, td
);
20044 /* We already set the file and line above. Reset them now in case
20045 they changed as a result of calling regenerate_decl_from_template. */
20046 input_location
= DECL_SOURCE_LOCATION (d
);
20051 bool const_init
= false;
20053 /* Clear out DECL_RTL; whatever was there before may not be right
20054 since we've reset the type of the declaration. */
20055 SET_DECL_RTL (d
, NULL
);
20056 DECL_IN_AGGR_P (d
) = 0;
20058 /* The initializer is placed in DECL_INITIAL by
20059 regenerate_decl_from_template so we don't need to
20060 push/pop_access_scope again here. Pull it out so that
20061 cp_finish_decl can process it. */
20062 init
= DECL_INITIAL (d
);
20063 DECL_INITIAL (d
) = NULL_TREE
;
20064 DECL_INITIALIZED_P (d
) = 0;
20066 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
20067 initializer. That function will defer actual emission until
20068 we have a chance to determine linkage. */
20069 DECL_EXTERNAL (d
) = 0;
20071 /* Enter the scope of D so that access-checking works correctly. */
20072 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20074 push_nested_class (DECL_CONTEXT (d
));
20076 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20077 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
20080 pop_nested_class ();
20082 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
20083 synthesize_method (d
);
20084 else if (TREE_CODE (d
) == FUNCTION_DECL
)
20086 hash_map
<tree
, tree
> *saved_local_specializations
;
20090 tree block
= NULL_TREE
;
20092 /* Save away the current list, in case we are instantiating one
20093 template from within the body of another. */
20094 saved_local_specializations
= local_specializations
;
20096 /* Set up the list of local specializations. */
20097 local_specializations
= new hash_map
<tree
, tree
>;
20099 /* Set up context. */
20100 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20101 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20102 block
= push_stmt_list ();
20104 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
20106 /* Some typedefs referenced from within the template code need to be
20107 access checked at template instantiation time, i.e now. These
20108 types were added to the template at parsing time. Let's get those
20109 and perform the access checks then. */
20110 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
20113 /* Create substitution entries for the parameters. */
20114 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
20115 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
20116 spec_parm
= DECL_ARGUMENTS (d
);
20117 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
20119 register_local_specialization (spec_parm
, tmpl_parm
);
20120 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
20121 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
20123 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
20125 if (!DECL_PACK_P (tmpl_parm
))
20127 register_local_specialization (spec_parm
, tmpl_parm
);
20128 spec_parm
= DECL_CHAIN (spec_parm
);
20132 /* Register the (value) argument pack as a specialization of
20133 TMPL_PARM, then move on. */
20134 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
20135 register_local_specialization (argpack
, tmpl_parm
);
20138 gcc_assert (!spec_parm
);
20140 /* Substitute into the body of the function. */
20141 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20142 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
20143 tf_warning_or_error
, tmpl
);
20146 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
20147 tf_warning_or_error
, tmpl
,
20148 /*integral_constant_expression_p=*/false);
20150 /* Set the current input_location to the end of the function
20151 so that finish_function knows where we are. */
20153 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
20155 /* Remember if we saw an infinite loop in the template. */
20156 current_function_infinite_loop
20157 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
20160 /* We don't need the local specializations any more. */
20161 delete local_specializations
;
20162 local_specializations
= saved_local_specializations
;
20164 /* Finish the function. */
20165 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20166 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20167 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
20170 d
= finish_function (0);
20171 expand_or_defer_fn (d
);
20174 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20175 cp_check_omp_declare_reduction (d
);
20178 /* We're not deferring instantiation any more. */
20179 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
20182 pop_from_top_level ();
20184 pop_function_context ();
20187 input_location
= saved_loc
;
20188 cp_unevaluated_operand
= saved_unevaluated_operand
;
20189 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20190 pop_deferring_access_checks ();
20191 pop_tinst_level ();
20193 timevar_pop (TV_TEMPLATE_INST
);
20198 /* Run through the list of templates that we wish we could
20199 instantiate, and instantiate any we can. RETRIES is the
20200 number of times we retry pending template instantiation. */
20203 instantiate_pending_templates (int retries
)
20206 location_t saved_loc
= input_location
;
20208 /* Instantiating templates may trigger vtable generation. This in turn
20209 may require further template instantiations. We place a limit here
20210 to avoid infinite loop. */
20211 if (pending_templates
&& retries
>= max_tinst_depth
)
20213 tree decl
= pending_templates
->tinst
->decl
;
20215 error ("template instantiation depth exceeds maximum of %d"
20216 " instantiating %q+D, possibly from virtual table generation"
20217 " (use -ftemplate-depth= to increase the maximum)",
20218 max_tinst_depth
, decl
);
20219 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20220 /* Pretend that we defined it. */
20221 DECL_INITIAL (decl
) = error_mark_node
;
20227 struct pending_template
**t
= &pending_templates
;
20228 struct pending_template
*last
= NULL
;
20232 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
20233 bool complete
= false;
20235 if (TYPE_P (instantiation
))
20239 if (!COMPLETE_TYPE_P (instantiation
))
20241 instantiate_class_template (instantiation
);
20242 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
20243 for (fn
= TYPE_METHODS (instantiation
);
20245 fn
= TREE_CHAIN (fn
))
20246 if (! DECL_ARTIFICIAL (fn
))
20247 instantiate_decl (fn
,
20249 /*expl_inst_class_mem_p=*/false);
20250 if (COMPLETE_TYPE_P (instantiation
))
20254 complete
= COMPLETE_TYPE_P (instantiation
);
20258 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20259 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
20262 = instantiate_decl (instantiation
,
20264 /*expl_inst_class_mem_p=*/false);
20265 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20269 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20270 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20274 /* If INSTANTIATION has been instantiated, then we don't
20275 need to consider it again in the future. */
20283 current_tinst_level
= NULL
;
20285 last_pending_template
= last
;
20287 while (reconsider
);
20289 input_location
= saved_loc
;
20292 /* Substitute ARGVEC into T, which is a list of initializers for
20293 either base class or a non-static data member. The TREE_PURPOSEs
20294 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20295 instantiate_decl. */
20298 tsubst_initializer_list (tree t
, tree argvec
)
20300 tree inits
= NULL_TREE
;
20302 for (; t
; t
= TREE_CHAIN (t
))
20306 tree expanded_bases
= NULL_TREE
;
20307 tree expanded_arguments
= NULL_TREE
;
20310 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20315 /* Expand the base class expansion type into separate base
20317 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20318 tf_warning_or_error
,
20320 if (expanded_bases
== error_mark_node
)
20323 /* We'll be building separate TREE_LISTs of arguments for
20325 len
= TREE_VEC_LENGTH (expanded_bases
);
20326 expanded_arguments
= make_tree_vec (len
);
20327 for (i
= 0; i
< len
; i
++)
20328 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20330 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20331 expand each argument in the TREE_VALUE of t. */
20332 expr
= make_node (EXPR_PACK_EXPANSION
);
20333 PACK_EXPANSION_LOCAL_P (expr
) = true;
20334 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20335 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20337 if (TREE_VALUE (t
) == void_type_node
)
20338 /* VOID_TYPE_NODE is used to indicate
20339 value-initialization. */
20341 for (i
= 0; i
< len
; i
++)
20342 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20346 /* Substitute parameter packs into each argument in the
20348 in_base_initializer
= 1;
20349 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20351 tree expanded_exprs
;
20353 /* Expand the argument. */
20354 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20356 = tsubst_pack_expansion (expr
, argvec
,
20357 tf_warning_or_error
,
20359 if (expanded_exprs
== error_mark_node
)
20362 /* Prepend each of the expanded expressions to the
20363 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20364 for (i
= 0; i
< len
; i
++)
20366 TREE_VEC_ELT (expanded_arguments
, i
) =
20367 tree_cons (NULL_TREE
,
20368 TREE_VEC_ELT (expanded_exprs
, i
),
20369 TREE_VEC_ELT (expanded_arguments
, i
));
20372 in_base_initializer
= 0;
20374 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20375 since we built them backwards. */
20376 for (i
= 0; i
< len
; i
++)
20378 TREE_VEC_ELT (expanded_arguments
, i
) =
20379 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20384 for (i
= 0; i
< len
; ++i
)
20386 if (expanded_bases
)
20388 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20389 decl
= expand_member_init (decl
);
20390 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20395 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20396 tf_warning_or_error
, NULL_TREE
);
20398 decl
= expand_member_init (decl
);
20399 if (decl
&& !DECL_P (decl
))
20400 in_base_initializer
= 1;
20402 init
= TREE_VALUE (t
);
20404 if (init
!= void_type_node
)
20405 init
= tsubst_expr (init
, argvec
,
20406 tf_warning_or_error
, NULL_TREE
,
20407 /*integral_constant_expression_p=*/false);
20408 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20409 /* If we had an initializer but it instantiated to nothing,
20410 value-initialize the object. This will only occur when
20411 the initializer was a pack expansion where the parameter
20412 packs used in that expansion were of length zero. */
20413 init
= void_type_node
;
20414 in_base_initializer
= 0;
20419 init
= build_tree_list (decl
, init
);
20420 TREE_CHAIN (init
) = inits
;
20428 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20431 set_current_access_from_decl (tree decl
)
20433 if (TREE_PRIVATE (decl
))
20434 current_access_specifier
= access_private_node
;
20435 else if (TREE_PROTECTED (decl
))
20436 current_access_specifier
= access_protected_node
;
20438 current_access_specifier
= access_public_node
;
20441 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20442 is the instantiation (which should have been created with
20443 start_enum) and ARGS are the template arguments to use. */
20446 tsubst_enum (tree tag
, tree newtag
, tree args
)
20450 if (SCOPED_ENUM_P (newtag
))
20451 begin_scope (sk_scoped_enum
, newtag
);
20453 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20458 decl
= TREE_VALUE (e
);
20459 /* Note that in a template enum, the TREE_VALUE is the
20460 CONST_DECL, not the corresponding INTEGER_CST. */
20461 value
= tsubst_expr (DECL_INITIAL (decl
),
20462 args
, tf_warning_or_error
, NULL_TREE
,
20463 /*integral_constant_expression_p=*/true);
20465 /* Give this enumeration constant the correct access. */
20466 set_current_access_from_decl (decl
);
20468 /* Actually build the enumerator itself. */
20470 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
20473 if (SCOPED_ENUM_P (newtag
))
20476 finish_enum_value_list (newtag
);
20477 finish_enum (newtag
);
20479 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20480 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20483 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20484 its type -- but without substituting the innermost set of template
20485 arguments. So, innermost set of template parameters will appear in
20489 get_mostly_instantiated_function_type (tree decl
)
20497 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
20498 targs
= DECL_TI_ARGS (decl
);
20499 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
20500 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
20502 /* There should be as many levels of arguments as there are levels
20504 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
20506 fn_type
= TREE_TYPE (tmpl
);
20508 if (parm_depth
== 1)
20509 /* No substitution is necessary. */
20516 /* Replace the innermost level of the TARGS with NULL_TREEs to
20517 let tsubst know not to substitute for those parameters. */
20518 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20519 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
20520 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
20521 TMPL_ARGS_LEVEL (targs
, i
));
20522 SET_TMPL_ARGS_LEVEL (partial_args
,
20523 TMPL_ARGS_DEPTH (targs
),
20524 make_tree_vec (DECL_NTPARMS (tmpl
)));
20526 /* Make sure that we can see identifiers, and compute access
20528 push_access_scope (decl
);
20530 ++processing_template_decl
;
20531 /* Now, do the (partial) substitution to figure out the
20532 appropriate function type. */
20533 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
20534 --processing_template_decl
;
20536 /* Substitute into the template parameters to obtain the real
20537 innermost set of parameters. This step is important if the
20538 innermost set of template parameters contains value
20539 parameters whose types depend on outer template parameters. */
20540 TREE_VEC_LENGTH (partial_args
)--;
20541 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
20543 pop_access_scope (decl
);
20549 /* Return truthvalue if we're processing a template different from
20550 the last one involved in diagnostics. */
20552 problematic_instantiation_changed (void)
20554 return current_tinst_level
!= last_error_tinst_level
;
20557 /* Remember current template involved in diagnostics. */
20559 record_last_problematic_instantiation (void)
20561 last_error_tinst_level
= current_tinst_level
;
20564 struct tinst_level
*
20565 current_instantiation (void)
20567 return current_tinst_level
;
20570 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20571 type. Return zero for ok, nonzero for disallowed. Issue error and
20572 warning messages under control of COMPLAIN. */
20575 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20577 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20579 else if (POINTER_TYPE_P (type
))
20581 else if (TYPE_PTRMEM_P (type
))
20583 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20585 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20587 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20589 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20592 if (complain
& tf_error
)
20594 if (type
== error_mark_node
)
20595 inform (input_location
, "invalid template non-type parameter");
20597 error ("%q#T is not a valid type for a template non-type parameter",
20603 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20604 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20607 dependent_type_p_r (tree type
)
20613 A type is dependent if it is:
20615 -- a template parameter. Template template parameters are types
20616 for us (since TYPE_P holds true for them) so we handle
20618 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20619 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
20621 /* -- a qualified-id with a nested-name-specifier which contains a
20622 class-name that names a dependent type or whose unqualified-id
20623 names a dependent type. */
20624 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20626 /* -- a cv-qualified type where the cv-unqualified type is
20628 type
= TYPE_MAIN_VARIANT (type
);
20629 /* -- a compound type constructed from any dependent type. */
20630 if (TYPE_PTRMEM_P (type
))
20631 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
20632 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
20634 else if (TYPE_PTR_P (type
)
20635 || TREE_CODE (type
) == REFERENCE_TYPE
)
20636 return dependent_type_p (TREE_TYPE (type
));
20637 else if (TREE_CODE (type
) == FUNCTION_TYPE
20638 || TREE_CODE (type
) == METHOD_TYPE
)
20642 if (dependent_type_p (TREE_TYPE (type
)))
20644 for (arg_type
= TYPE_ARG_TYPES (type
);
20646 arg_type
= TREE_CHAIN (arg_type
))
20647 if (dependent_type_p (TREE_VALUE (arg_type
)))
20651 /* -- an array type constructed from any dependent type or whose
20652 size is specified by a constant expression that is
20655 We checked for type- and value-dependence of the bounds in
20656 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20657 if (TREE_CODE (type
) == ARRAY_TYPE
)
20659 if (TYPE_DOMAIN (type
)
20660 && dependent_type_p (TYPE_DOMAIN (type
)))
20662 return dependent_type_p (TREE_TYPE (type
));
20665 /* -- a template-id in which either the template name is a template
20667 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20669 /* ... or any of the template arguments is a dependent type or
20670 an expression that is type-dependent or value-dependent. */
20671 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
20672 && (any_dependent_template_arguments_p
20673 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
20676 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20677 dependent; if the argument of the `typeof' expression is not
20678 type-dependent, then it should already been have resolved. */
20679 if (TREE_CODE (type
) == TYPEOF_TYPE
20680 || TREE_CODE (type
) == DECLTYPE_TYPE
20681 || TREE_CODE (type
) == UNDERLYING_TYPE
)
20684 /* A template argument pack is dependent if any of its packed
20686 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
20688 tree args
= ARGUMENT_PACK_ARGS (type
);
20689 int i
, len
= TREE_VEC_LENGTH (args
);
20690 for (i
= 0; i
< len
; ++i
)
20691 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20695 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20696 be template parameters. */
20697 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
20700 /* The standard does not specifically mention types that are local
20701 to template functions or local classes, but they should be
20702 considered dependent too. For example:
20704 template <int I> void f() {
20709 The size of `E' cannot be known until the value of `I' has been
20710 determined. Therefore, `E' must be considered dependent. */
20711 scope
= TYPE_CONTEXT (type
);
20712 if (scope
&& TYPE_P (scope
))
20713 return dependent_type_p (scope
);
20714 /* Don't use type_dependent_expression_p here, as it can lead
20715 to infinite recursion trying to determine whether a lambda
20716 nested in a lambda is dependent (c++/47687). */
20717 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
20718 && DECL_LANG_SPECIFIC (scope
)
20719 && DECL_TEMPLATE_INFO (scope
)
20720 && (any_dependent_template_arguments_p
20721 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
20724 /* Other types are non-dependent. */
20728 /* Returns TRUE if TYPE is dependent, in the sense of
20729 [temp.dep.type]. Note that a NULL type is considered dependent. */
20732 dependent_type_p (tree type
)
20734 /* If there are no template parameters in scope, then there can't be
20735 any dependent types. */
20736 if (!processing_template_decl
)
20738 /* If we are not processing a template, then nobody should be
20739 providing us with a dependent type. */
20741 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
20745 /* If the type is NULL, we have not computed a type for the entity
20746 in question; in that case, the type is dependent. */
20750 /* Erroneous types can be considered non-dependent. */
20751 if (type
== error_mark_node
)
20754 /* If we have not already computed the appropriate value for TYPE,
20756 if (!TYPE_DEPENDENT_P_VALID (type
))
20758 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
20759 TYPE_DEPENDENT_P_VALID (type
) = 1;
20762 return TYPE_DEPENDENT_P (type
);
20765 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
20766 lookup. In other words, a dependent type that is not the current
20770 dependent_scope_p (tree scope
)
20772 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
20773 && !currently_open_class (scope
));
20776 /* T is a SCOPE_REF; return whether we need to consider it
20777 instantiation-dependent so that we can check access at instantiation
20778 time even though we know which member it resolves to. */
20781 instantiation_dependent_scope_ref_p (tree t
)
20783 if (DECL_P (TREE_OPERAND (t
, 1))
20784 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
20785 && accessible_in_template_p (TREE_OPERAND (t
, 0),
20786 TREE_OPERAND (t
, 1)))
20792 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
20793 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
20796 /* Note that this predicate is not appropriate for general expressions;
20797 only constant expressions (that satisfy potential_constant_expression)
20798 can be tested for value dependence. */
20801 value_dependent_expression_p (tree expression
)
20803 if (!processing_template_decl
)
20806 /* A name declared with a dependent type. */
20807 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
20810 switch (TREE_CODE (expression
))
20812 case IDENTIFIER_NODE
:
20813 /* A name that has not been looked up -- must be dependent. */
20816 case TEMPLATE_PARM_INDEX
:
20817 /* A non-type template parm. */
20821 /* A non-type template parm. */
20822 if (DECL_TEMPLATE_PARM_P (expression
))
20824 return value_dependent_expression_p (DECL_INITIAL (expression
));
20827 /* A constant with literal type and is initialized
20828 with an expression that is value-dependent.
20830 Note that a non-dependent parenthesized initializer will have
20831 already been replaced with its constant value, so if we see
20832 a TREE_LIST it must be dependent. */
20833 if (DECL_INITIAL (expression
)
20834 && decl_constant_var_p (expression
)
20835 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
20836 || value_dependent_expression_p (DECL_INITIAL (expression
))))
20840 case DYNAMIC_CAST_EXPR
:
20841 case STATIC_CAST_EXPR
:
20842 case CONST_CAST_EXPR
:
20843 case REINTERPRET_CAST_EXPR
:
20845 /* These expressions are value-dependent if the type to which
20846 the cast occurs is dependent or the expression being casted
20847 is value-dependent. */
20849 tree type
= TREE_TYPE (expression
);
20851 if (dependent_type_p (type
))
20854 /* A functional cast has a list of operands. */
20855 expression
= TREE_OPERAND (expression
, 0);
20858 /* If there are no operands, it must be an expression such
20859 as "int()". This should not happen for aggregate types
20860 because it would form non-constant expressions. */
20861 gcc_assert (cxx_dialect
>= cxx11
20862 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
20867 if (TREE_CODE (expression
) == TREE_LIST
)
20868 return any_value_dependent_elements_p (expression
);
20870 return value_dependent_expression_p (expression
);
20874 if (SIZEOF_EXPR_TYPE_P (expression
))
20875 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
20879 /* A `sizeof' expression is value-dependent if the operand is
20880 type-dependent or is a pack expansion. */
20881 expression
= TREE_OPERAND (expression
, 0);
20882 if (PACK_EXPANSION_P (expression
))
20884 else if (TYPE_P (expression
))
20885 return dependent_type_p (expression
);
20886 return instantiation_dependent_expression_p (expression
);
20888 case AT_ENCODE_EXPR
:
20889 /* An 'encode' expression is value-dependent if the operand is
20891 expression
= TREE_OPERAND (expression
, 0);
20892 return dependent_type_p (expression
);
20894 case NOEXCEPT_EXPR
:
20895 expression
= TREE_OPERAND (expression
, 0);
20896 return instantiation_dependent_expression_p (expression
);
20899 /* All instantiation-dependent expressions should also be considered
20900 value-dependent. */
20901 return instantiation_dependent_scope_ref_p (expression
);
20903 case COMPONENT_REF
:
20904 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
20905 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
20907 case NONTYPE_ARGUMENT_PACK
:
20908 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
20909 is value-dependent. */
20911 tree values
= ARGUMENT_PACK_ARGS (expression
);
20912 int i
, len
= TREE_VEC_LENGTH (values
);
20914 for (i
= 0; i
< len
; ++i
)
20915 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
20923 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
20924 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
20925 || (type2
? dependent_type_p (type2
) : false));
20929 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20930 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
20933 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20934 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
20938 tree op
= TREE_OPERAND (expression
, 0);
20939 return (value_dependent_expression_p (op
)
20940 || has_value_dependent_address (op
));
20945 tree fn
= get_callee_fndecl (expression
);
20947 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
20949 nargs
= call_expr_nargs (expression
);
20950 for (i
= 0; i
< nargs
; ++i
)
20952 tree op
= CALL_EXPR_ARG (expression
, i
);
20953 /* In a call to a constexpr member function, look through the
20954 implicit ADDR_EXPR on the object argument so that it doesn't
20955 cause the call to be considered value-dependent. We also
20956 look through it in potential_constant_expression. */
20957 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
20958 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
20959 && TREE_CODE (op
) == ADDR_EXPR
)
20960 op
= TREE_OPERAND (op
, 0);
20961 if (value_dependent_expression_p (op
))
20967 case TEMPLATE_ID_EXPR
:
20968 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
20970 return type_dependent_expression_p (expression
);
20976 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
20977 if (value_dependent_expression_p (val
))
20983 /* Treat a GNU statement expression as dependent to avoid crashing
20984 under fold_non_dependent_expr; it can't be constant. */
20988 /* A constant expression is value-dependent if any subexpression is
20989 value-dependent. */
20990 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
20992 case tcc_reference
:
20994 case tcc_comparison
:
20996 case tcc_expression
:
20999 int i
, len
= cp_tree_operand_length (expression
);
21001 for (i
= 0; i
< len
; i
++)
21003 tree t
= TREE_OPERAND (expression
, i
);
21005 /* In some cases, some of the operands may be missing.l
21006 (For example, in the case of PREDECREMENT_EXPR, the
21007 amount to increment by may be missing.) That doesn't
21008 make the expression dependent. */
21009 if (t
&& value_dependent_expression_p (t
))
21020 /* The expression is not value-dependent. */
21024 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
21025 [temp.dep.expr]. Note that an expression with no type is
21026 considered dependent. Other parts of the compiler arrange for an
21027 expression with type-dependent subexpressions to have no type, so
21028 this function doesn't have to be fully recursive. */
21031 type_dependent_expression_p (tree expression
)
21033 if (!processing_template_decl
)
21036 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
21039 /* An unresolved name is always dependent. */
21040 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
21043 /* Some expression forms are never type-dependent. */
21044 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
21045 || TREE_CODE (expression
) == SIZEOF_EXPR
21046 || TREE_CODE (expression
) == ALIGNOF_EXPR
21047 || TREE_CODE (expression
) == AT_ENCODE_EXPR
21048 || TREE_CODE (expression
) == NOEXCEPT_EXPR
21049 || TREE_CODE (expression
) == TRAIT_EXPR
21050 || TREE_CODE (expression
) == TYPEID_EXPR
21051 || TREE_CODE (expression
) == DELETE_EXPR
21052 || TREE_CODE (expression
) == VEC_DELETE_EXPR
21053 || TREE_CODE (expression
) == THROW_EXPR
)
21056 /* The types of these expressions depends only on the type to which
21057 the cast occurs. */
21058 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
21059 || TREE_CODE (expression
) == STATIC_CAST_EXPR
21060 || TREE_CODE (expression
) == CONST_CAST_EXPR
21061 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
21062 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
21063 || TREE_CODE (expression
) == CAST_EXPR
)
21064 return dependent_type_p (TREE_TYPE (expression
));
21066 /* The types of these expressions depends only on the type created
21067 by the expression. */
21068 if (TREE_CODE (expression
) == NEW_EXPR
21069 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
21071 /* For NEW_EXPR tree nodes created inside a template, either
21072 the object type itself or a TREE_LIST may appear as the
21074 tree type
= TREE_OPERAND (expression
, 1);
21075 if (TREE_CODE (type
) == TREE_LIST
)
21076 /* This is an array type. We need to check array dimensions
21078 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
21079 || value_dependent_expression_p
21080 (TREE_OPERAND (TREE_VALUE (type
), 1));
21082 return dependent_type_p (type
);
21085 if (TREE_CODE (expression
) == SCOPE_REF
)
21087 tree scope
= TREE_OPERAND (expression
, 0);
21088 tree name
= TREE_OPERAND (expression
, 1);
21090 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
21091 contains an identifier associated by name lookup with one or more
21092 declarations declared with a dependent type, or...a
21093 nested-name-specifier or qualified-id that names a member of an
21094 unknown specialization. */
21095 return (type_dependent_expression_p (name
)
21096 || dependent_scope_p (scope
));
21099 if (TREE_CODE (expression
) == FUNCTION_DECL
21100 && DECL_LANG_SPECIFIC (expression
)
21101 && DECL_TEMPLATE_INFO (expression
)
21102 && (any_dependent_template_arguments_p
21103 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
21106 if (TREE_CODE (expression
) == TEMPLATE_DECL
21107 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
21110 if (TREE_CODE (expression
) == STMT_EXPR
)
21111 expression
= stmt_expr_value_expr (expression
);
21113 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
21118 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
21120 if (type_dependent_expression_p (elt
))
21126 /* A static data member of the current instantiation with incomplete
21127 array type is type-dependent, as the definition and specializations
21128 can have different bounds. */
21129 if (VAR_P (expression
)
21130 && DECL_CLASS_SCOPE_P (expression
)
21131 && dependent_type_p (DECL_CONTEXT (expression
))
21132 && VAR_HAD_UNKNOWN_BOUND (expression
))
21135 /* An array of unknown bound depending on a variadic parameter, eg:
21137 template<typename... Args>
21138 void foo (Args... args)
21140 int arr[] = { args... };
21143 template<int... vals>
21146 int arr[] = { vals... };
21149 If the array has no length and has an initializer, it must be that
21150 we couldn't determine its length in cp_complete_array_type because
21151 it is dependent. */
21152 if (VAR_P (expression
)
21153 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
21154 && !TYPE_DOMAIN (TREE_TYPE (expression
))
21155 && DECL_INITIAL (expression
))
21158 if (TREE_TYPE (expression
) == unknown_type_node
)
21160 if (TREE_CODE (expression
) == ADDR_EXPR
)
21161 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
21162 if (TREE_CODE (expression
) == COMPONENT_REF
21163 || TREE_CODE (expression
) == OFFSET_REF
)
21165 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21167 expression
= TREE_OPERAND (expression
, 1);
21168 if (identifier_p (expression
))
21171 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21172 if (TREE_CODE (expression
) == SCOPE_REF
)
21175 /* Always dependent, on the number of arguments if nothing else. */
21176 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
21179 if (BASELINK_P (expression
))
21181 if (BASELINK_OPTYPE (expression
)
21182 && dependent_type_p (BASELINK_OPTYPE (expression
)))
21184 expression
= BASELINK_FUNCTIONS (expression
);
21187 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
21189 if (any_dependent_template_arguments_p
21190 (TREE_OPERAND (expression
, 1)))
21192 expression
= TREE_OPERAND (expression
, 0);
21194 gcc_assert (TREE_CODE (expression
) == OVERLOAD
21195 || TREE_CODE (expression
) == FUNCTION_DECL
);
21199 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
21201 expression
= OVL_NEXT (expression
);
21206 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
21208 return (dependent_type_p (TREE_TYPE (expression
)));
21211 /* walk_tree callback function for instantiation_dependent_expression_p,
21212 below. Returns non-zero if a dependent subexpression is found. */
21215 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
21220 /* We don't have to worry about decltype currently because decltype
21221 of an instantiation-dependent expr is a dependent type. This
21222 might change depending on the resolution of DR 1172. */
21223 *walk_subtrees
= false;
21226 enum tree_code code
= TREE_CODE (*tp
);
21229 /* Don't treat an argument list as dependent just because it has no
21237 /* A constant with a dependent initializer is dependent. */
21238 if (value_dependent_expression_p (*tp
))
21242 case TEMPLATE_PARM_INDEX
:
21245 /* Handle expressions with type operands. */
21249 case AT_ENCODE_EXPR
:
21251 tree op
= TREE_OPERAND (*tp
, 0);
21252 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
21253 op
= TREE_TYPE (op
);
21256 if (dependent_type_p (op
))
21260 *walk_subtrees
= false;
21268 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21269 || (TRAIT_EXPR_TYPE2 (*tp
)
21270 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21272 *walk_subtrees
= false;
21275 case COMPONENT_REF
:
21276 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21277 /* In a template, finish_class_member_access_expr creates a
21278 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21279 type-dependent, so that we can check access control at
21280 instantiation time (PR 42277). See also Core issue 1273. */
21285 if (instantiation_dependent_scope_ref_p (*tp
))
21290 /* Treat statement-expressions as dependent. */
21298 if (type_dependent_expression_p (*tp
))
21304 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21305 sense defined by the ABI:
21307 "An expression is instantiation-dependent if it is type-dependent
21308 or value-dependent, or it has a subexpression that is type-dependent
21309 or value-dependent." */
21312 instantiation_dependent_expression_p (tree expression
)
21316 if (!processing_template_decl
)
21319 if (expression
== error_mark_node
)
21322 result
= cp_walk_tree_without_duplicates (&expression
,
21323 instantiation_dependent_r
, NULL
);
21324 return result
!= NULL_TREE
;
21327 /* Like type_dependent_expression_p, but it also works while not processing
21328 a template definition, i.e. during substitution or mangling. */
21331 type_dependent_expression_p_push (tree expr
)
21334 ++processing_template_decl
;
21335 b
= type_dependent_expression_p (expr
);
21336 --processing_template_decl
;
21340 /* Returns TRUE if ARGS contains a type-dependent expression. */
21343 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21348 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21350 if (type_dependent_expression_p (arg
))
21356 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21357 expressions) contains any type-dependent expressions. */
21360 any_type_dependent_elements_p (const_tree list
)
21362 for (; list
; list
= TREE_CHAIN (list
))
21363 if (type_dependent_expression_p (TREE_VALUE (list
)))
21369 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21370 expressions) contains any value-dependent expressions. */
21373 any_value_dependent_elements_p (const_tree list
)
21375 for (; list
; list
= TREE_CHAIN (list
))
21376 if (value_dependent_expression_p (TREE_VALUE (list
)))
21382 /* Returns TRUE if the ARG (a template argument) is dependent. */
21385 dependent_template_arg_p (tree arg
)
21387 if (!processing_template_decl
)
21390 /* Assume a template argument that was wrongly written by the user
21391 is dependent. This is consistent with what
21392 any_dependent_template_arguments_p [that calls this function]
21394 if (!arg
|| arg
== error_mark_node
)
21397 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21398 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21400 if (TREE_CODE (arg
) == TEMPLATE_DECL
21401 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21402 return dependent_template_p (arg
);
21403 else if (ARGUMENT_PACK_P (arg
))
21405 tree args
= ARGUMENT_PACK_ARGS (arg
);
21406 int i
, len
= TREE_VEC_LENGTH (args
);
21407 for (i
= 0; i
< len
; ++i
)
21409 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21415 else if (TYPE_P (arg
))
21416 return dependent_type_p (arg
);
21418 return (type_dependent_expression_p (arg
)
21419 || value_dependent_expression_p (arg
));
21422 /* Returns true if ARGS (a collection of template arguments) contains
21423 any types that require structural equality testing. */
21426 any_template_arguments_need_structural_equality_p (tree args
)
21433 if (args
== error_mark_node
)
21436 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21438 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21439 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21441 tree arg
= TREE_VEC_ELT (level
, j
);
21442 tree packed_args
= NULL_TREE
;
21445 if (ARGUMENT_PACK_P (arg
))
21447 /* Look inside the argument pack. */
21448 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21449 len
= TREE_VEC_LENGTH (packed_args
);
21452 for (k
= 0; k
< len
; ++k
)
21455 arg
= TREE_VEC_ELT (packed_args
, k
);
21457 if (error_operand_p (arg
))
21459 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21461 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21463 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21464 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21473 /* Returns true if ARGS (a collection of template arguments) contains
21474 any dependent arguments. */
21477 any_dependent_template_arguments_p (const_tree args
)
21484 if (args
== error_mark_node
)
21487 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21489 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21490 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21491 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21498 /* Returns TRUE if the template TMPL is dependent. */
21501 dependent_template_p (tree tmpl
)
21503 if (TREE_CODE (tmpl
) == OVERLOAD
)
21507 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21509 tmpl
= OVL_NEXT (tmpl
);
21514 /* Template template parameters are dependent. */
21515 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21516 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21518 /* So are names that have not been looked up. */
21519 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21521 /* So are member templates of dependent classes. */
21522 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21523 return dependent_type_p (DECL_CONTEXT (tmpl
));
21527 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21530 dependent_template_id_p (tree tmpl
, tree args
)
21532 return (dependent_template_p (tmpl
)
21533 || any_dependent_template_arguments_p (args
));
21536 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21540 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21544 if (!processing_template_decl
)
21547 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21549 tree decl
= TREE_VEC_ELT (declv
, i
);
21550 tree init
= TREE_VEC_ELT (initv
, i
);
21551 tree cond
= TREE_VEC_ELT (condv
, i
);
21552 tree incr
= TREE_VEC_ELT (incrv
, i
);
21554 if (type_dependent_expression_p (decl
))
21557 if (init
&& type_dependent_expression_p (init
))
21560 if (type_dependent_expression_p (cond
))
21563 if (COMPARISON_CLASS_P (cond
)
21564 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21565 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21568 if (TREE_CODE (incr
) == MODOP_EXPR
)
21570 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21571 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21574 else if (type_dependent_expression_p (incr
))
21576 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21578 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21580 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
21582 tree t
= TREE_OPERAND (incr
, 1);
21583 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
21584 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
21593 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21594 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21595 no such TYPE can be found. Note that this function peers inside
21596 uninstantiated templates and therefore should be used only in
21597 extremely limited situations. ONLY_CURRENT_P restricts this
21598 peering to the currently open classes hierarchy (which is required
21599 when comparing types). */
21602 resolve_typename_type (tree type
, bool only_current_p
)
21611 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
21613 scope
= TYPE_CONTEXT (type
);
21614 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21615 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21616 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21617 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21618 identifier of the TYPENAME_TYPE anymore.
21619 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21620 TYPENAME_TYPE instead, we avoid messing up with a possible
21621 typedef variant case. */
21622 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
21624 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21625 it first before we can figure out what NAME refers to. */
21626 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21628 if (TYPENAME_IS_RESOLVING_P (scope
))
21629 /* Given a class template A with a dependent base with nested type C,
21630 typedef typename A::C::C C will land us here, as trying to resolve
21631 the initial A::C leads to the local C typedef, which leads back to
21632 A::C::C. So we break the recursion now. */
21635 scope
= resolve_typename_type (scope
, only_current_p
);
21637 /* If we don't know what SCOPE refers to, then we cannot resolve the
21639 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21641 /* If the SCOPE is a template type parameter, we have no way of
21642 resolving the name. */
21643 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
21645 /* If the SCOPE is not the current instantiation, there's no reason
21646 to look inside it. */
21647 if (only_current_p
&& !currently_open_class (scope
))
21649 /* If this is a typedef, we don't want to look inside (c++/11987). */
21650 if (typedef_variant_p (type
))
21652 /* If SCOPE isn't the template itself, it will not have a valid
21653 TYPE_FIELDS list. */
21654 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
21655 /* scope is either the template itself or a compatible instantiation
21656 like X<T>, so look up the name in the original template. */
21657 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
21659 /* scope is a partial instantiation, so we can't do the lookup or we
21660 will lose the template arguments. */
21662 /* Enter the SCOPE so that name lookup will be resolved as if we
21663 were in the class definition. In particular, SCOPE will no
21664 longer be considered a dependent type. */
21665 pushed_scope
= push_scope (scope
);
21666 /* Look up the declaration. */
21667 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
21668 tf_warning_or_error
);
21670 result
= NULL_TREE
;
21672 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21673 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21676 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
21677 && TREE_CODE (decl
) == TYPE_DECL
)
21679 result
= TREE_TYPE (decl
);
21680 if (result
== error_mark_node
)
21681 result
= NULL_TREE
;
21683 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
21684 && DECL_CLASS_TEMPLATE_P (decl
))
21688 /* Obtain the template and the arguments. */
21689 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
21690 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
21691 /* Instantiate the template. */
21692 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
21693 /*entering_scope=*/0,
21694 tf_error
| tf_user
);
21695 if (result
== error_mark_node
)
21696 result
= NULL_TREE
;
21699 /* Leave the SCOPE. */
21701 pop_scope (pushed_scope
);
21703 /* If we failed to resolve it, return the original typename. */
21707 /* If lookup found a typename type, resolve that too. */
21708 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
21710 /* Ill-formed programs can cause infinite recursion here, so we
21711 must catch that. */
21712 TYPENAME_IS_RESOLVING_P (type
) = 1;
21713 result
= resolve_typename_type (result
, only_current_p
);
21714 TYPENAME_IS_RESOLVING_P (type
) = 0;
21717 /* Qualify the resulting type. */
21718 quals
= cp_type_quals (type
);
21720 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
21725 /* EXPR is an expression which is not type-dependent. Return a proxy
21726 for EXPR that can be used to compute the types of larger
21727 expressions containing EXPR. */
21730 build_non_dependent_expr (tree expr
)
21734 #ifdef ENABLE_CHECKING
21735 /* Try to get a constant value for all non-dependent expressions in
21736 order to expose bugs in *_dependent_expression_p and constexpr. */
21737 if (cxx_dialect
>= cxx11
)
21738 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
21741 /* Preserve OVERLOADs; the functions must be available to resolve
21744 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
21745 inner_expr
= stmt_expr_value_expr (inner_expr
);
21746 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
21747 inner_expr
= TREE_OPERAND (inner_expr
, 0);
21748 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
21749 inner_expr
= TREE_OPERAND (inner_expr
, 1);
21750 if (is_overloaded_fn (inner_expr
)
21751 || TREE_CODE (inner_expr
) == OFFSET_REF
)
21753 /* There is no need to return a proxy for a variable. */
21756 /* Preserve string constants; conversions from string constants to
21757 "char *" are allowed, even though normally a "const char *"
21758 cannot be used to initialize a "char *". */
21759 if (TREE_CODE (expr
) == STRING_CST
)
21761 /* Preserve void and arithmetic constants, as an optimization -- there is no
21762 reason to create a new node. */
21763 if (TREE_CODE (expr
) == VOID_CST
21764 || TREE_CODE (expr
) == INTEGER_CST
21765 || TREE_CODE (expr
) == REAL_CST
)
21767 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
21768 There is at least one place where we want to know that a
21769 particular expression is a throw-expression: when checking a ?:
21770 expression, there are special rules if the second or third
21771 argument is a throw-expression. */
21772 if (TREE_CODE (expr
) == THROW_EXPR
)
21775 /* Don't wrap an initializer list, we need to be able to look inside. */
21776 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
21779 /* Don't wrap a dummy object, we need to be able to test for it. */
21780 if (is_dummy_object (expr
))
21783 if (TREE_CODE (expr
) == COND_EXPR
)
21784 return build3 (COND_EXPR
,
21786 TREE_OPERAND (expr
, 0),
21787 (TREE_OPERAND (expr
, 1)
21788 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
21789 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
21790 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
21791 if (TREE_CODE (expr
) == COMPOUND_EXPR
21792 && !COMPOUND_EXPR_OVERLOADED (expr
))
21793 return build2 (COMPOUND_EXPR
,
21795 TREE_OPERAND (expr
, 0),
21796 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
21798 /* If the type is unknown, it can't really be non-dependent */
21799 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
21801 /* Otherwise, build a NON_DEPENDENT_EXPR. */
21802 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
21805 /* ARGS is a vector of expressions as arguments to a function call.
21806 Replace the arguments with equivalent non-dependent expressions.
21807 This modifies ARGS in place. */
21810 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
21815 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
21817 tree newarg
= build_non_dependent_expr (arg
);
21819 (*args
)[ix
] = newarg
;
21823 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
21824 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
21828 make_auto_1 (tree name
)
21830 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
21831 TYPE_NAME (au
) = build_decl (input_location
,
21832 TYPE_DECL
, name
, au
);
21833 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
21834 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
21835 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
21836 TYPE_NAME (au
), NULL_TREE
);
21837 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
21838 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
21839 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
21845 make_decltype_auto (void)
21847 return make_auto_1 (get_identifier ("decltype(auto)"));
21853 return make_auto_1 (get_identifier ("auto"));
21856 /* Given type ARG, return std::initializer_list<ARG>. */
21861 tree std_init_list
= namespace_binding
21862 (get_identifier ("initializer_list"), std_node
);
21864 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
21866 error ("deducing from brace-enclosed initializer list requires "
21867 "#include <initializer_list>");
21868 return error_mark_node
;
21870 argvec
= make_tree_vec (1);
21871 TREE_VEC_ELT (argvec
, 0) = arg
;
21872 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
21873 NULL_TREE
, 0, tf_warning_or_error
);
21876 /* Replace auto in TYPE with std::initializer_list<auto>. */
21879 listify_autos (tree type
, tree auto_node
)
21881 tree init_auto
= listify (auto_node
);
21882 tree argvec
= make_tree_vec (1);
21883 TREE_VEC_ELT (argvec
, 0) = init_auto
;
21884 if (processing_template_decl
)
21885 argvec
= add_to_template_args (current_template_args (), argvec
);
21886 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21889 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
21890 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
21893 do_auto_deduction (tree type
, tree init
, tree auto_node
)
21897 if (init
== error_mark_node
)
21898 return error_mark_node
;
21900 if (type_dependent_expression_p (init
))
21901 /* Defining a subset of type-dependent expressions that we can deduce
21902 from ahead of time isn't worth the trouble. */
21905 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
21906 with either a new invented type template parameter U or, if the
21907 initializer is a braced-init-list (8.5.4), with
21908 std::initializer_list<U>. */
21909 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
21910 type
= listify_autos (type
, auto_node
);
21912 init
= resolve_nondeduced_context (init
);
21914 targs
= make_tree_vec (1);
21915 if (AUTO_IS_DECLTYPE (auto_node
))
21917 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
21918 && !REF_PARENTHESIZED_P (init
)));
21919 TREE_VEC_ELT (targs
, 0)
21920 = finish_decltype_type (init
, id
, tf_warning_or_error
);
21921 if (type
!= auto_node
)
21923 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
21924 return error_mark_node
;
21929 tree parms
= build_tree_list (NULL_TREE
, type
);
21930 tree tparms
= make_tree_vec (1);
21933 TREE_VEC_ELT (tparms
, 0)
21934 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
21935 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
21936 DEDUCE_CALL
, LOOKUP_NORMAL
,
21937 NULL
, /*explain_p=*/false);
21940 if (processing_template_decl
)
21941 /* Try again at instantiation time. */
21943 if (type
&& type
!= error_mark_node
)
21944 /* If type is error_mark_node a diagnostic must have been
21945 emitted by now. Also, having a mention to '<type error>'
21946 in the diagnostic is not really useful to the user. */
21948 if (cfun
&& auto_node
== current_function_auto_return_pattern
21949 && LAMBDA_FUNCTION_P (current_function_decl
))
21950 error ("unable to deduce lambda return type from %qE", init
);
21952 error ("unable to deduce %qT from %qE", type
, init
);
21954 return error_mark_node
;
21958 /* If the list of declarators contains more than one declarator, the type
21959 of each declared variable is determined as described above. If the
21960 type deduced for the template parameter U is not the same in each
21961 deduction, the program is ill-formed. */
21962 if (TREE_TYPE (auto_node
)
21963 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
21965 if (cfun
&& auto_node
== current_function_auto_return_pattern
21966 && LAMBDA_FUNCTION_P (current_function_decl
))
21967 error ("inconsistent types %qT and %qT deduced for "
21968 "lambda return type", TREE_TYPE (auto_node
),
21969 TREE_VEC_ELT (targs
, 0));
21971 error ("inconsistent deduction for %qT: %qT and then %qT",
21972 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
21973 return error_mark_node
;
21975 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
21977 if (processing_template_decl
)
21978 targs
= add_to_template_args (current_template_args (), targs
);
21979 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
21982 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
21986 splice_late_return_type (tree type
, tree late_return_type
)
21990 if (late_return_type
== NULL_TREE
)
21992 argvec
= make_tree_vec (1);
21993 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
21994 if (processing_template_parmlist
)
21995 /* For a late-specified return type in a template type-parameter, we
21996 need to add a dummy argument level for its parmlist. */
21997 argvec
= add_to_template_args
21998 (make_tree_vec (processing_template_parmlist
), argvec
);
21999 if (current_template_parms
)
22000 argvec
= add_to_template_args (current_template_args (), argvec
);
22001 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22004 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
22005 'decltype(auto)'. */
22008 is_auto (const_tree type
)
22010 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22011 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
22012 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
22018 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
22019 a use of `auto'. Returns NULL_TREE otherwise. */
22022 type_uses_auto (tree type
)
22024 return find_type_usage (type
, is_auto
);
22027 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
22028 'decltype(auto)' or a concept. */
22031 is_auto_or_concept (const_tree type
)
22033 return is_auto (type
); // or concept
22036 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
22037 a concept identifier) iff TYPE contains a use of a generic type. Returns
22038 NULL_TREE otherwise. */
22041 type_uses_auto_or_concept (tree type
)
22043 return find_type_usage (type
, is_auto_or_concept
);
22047 /* For a given template T, return the vector of typedefs referenced
22048 in T for which access check is needed at T instantiation time.
22049 T is either a FUNCTION_DECL or a RECORD_TYPE.
22050 Those typedefs were added to T by the function
22051 append_type_to_template_for_access_check. */
22053 vec
<qualified_typedef_usage_t
, va_gc
> *
22054 get_types_needing_access_check (tree t
)
22057 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
22059 if (!t
|| t
== error_mark_node
)
22062 if (!(ti
= get_template_info (t
)))
22065 if (CLASS_TYPE_P (t
)
22066 || TREE_CODE (t
) == FUNCTION_DECL
)
22068 if (!TI_TEMPLATE (ti
))
22071 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
22077 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
22078 tied to T. That list of typedefs will be access checked at
22079 T instantiation time.
22080 T is either a FUNCTION_DECL or a RECORD_TYPE.
22081 TYPE_DECL is a TYPE_DECL node representing a typedef.
22082 SCOPE is the scope through which TYPE_DECL is accessed.
22083 LOCATION is the location of the usage point of TYPE_DECL.
22085 This function is a subroutine of
22086 append_type_to_template_for_access_check. */
22089 append_type_to_template_for_access_check_1 (tree t
,
22092 location_t location
)
22094 qualified_typedef_usage_t typedef_usage
;
22097 if (!t
|| t
== error_mark_node
)
22100 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
22101 || CLASS_TYPE_P (t
))
22103 && TREE_CODE (type_decl
) == TYPE_DECL
22106 if (!(ti
= get_template_info (t
)))
22109 gcc_assert (TI_TEMPLATE (ti
));
22111 typedef_usage
.typedef_decl
= type_decl
;
22112 typedef_usage
.context
= scope
;
22113 typedef_usage
.locus
= location
;
22115 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
22118 /* Append TYPE_DECL to the template TEMPL.
22119 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
22120 At TEMPL instanciation time, TYPE_DECL will be checked to see
22121 if it can be accessed through SCOPE.
22122 LOCATION is the location of the usage point of TYPE_DECL.
22124 e.g. consider the following code snippet:
22131 template<class U> struct S
22133 C::myint mi; // <-- usage point of the typedef C::myint
22138 At S<char> instantiation time, we need to check the access of C::myint
22139 In other words, we need to check the access of the myint typedef through
22140 the C scope. For that purpose, this function will add the myint typedef
22141 and the scope C through which its being accessed to a list of typedefs
22142 tied to the template S. That list will be walked at template instantiation
22143 time and access check performed on each typedefs it contains.
22144 Note that this particular code snippet should yield an error because
22145 myint is private to C. */
22148 append_type_to_template_for_access_check (tree templ
,
22151 location_t location
)
22153 qualified_typedef_usage_t
*iter
;
22156 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
22158 /* Make sure we don't append the type to the template twice. */
22159 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
22160 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
22163 append_type_to_template_for_access_check_1 (templ
, type_decl
,
22167 /* Convert the generic type parameters in PARM that match the types given in the
22168 range [START_IDX, END_IDX) from the current_template_parms into generic type
22172 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
22174 tree current
= current_template_parms
;
22175 int depth
= TMPL_PARMS_DEPTH (current
);
22176 current
= INNERMOST_TEMPLATE_PARMS (current
);
22177 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
22179 for (int i
= 0; i
< start_idx
; ++i
)
22180 TREE_VEC_ELT (replacement
, i
)
22181 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22183 for (int i
= start_idx
; i
< end_idx
; ++i
)
22185 /* Create a distinct parameter pack type from the current parm and add it
22186 to the replacement args to tsubst below into the generic function
22189 tree o
= TREE_TYPE (TREE_VALUE
22190 (TREE_VEC_ELT (current
, i
)));
22191 tree t
= copy_type (o
);
22192 TEMPLATE_TYPE_PARM_INDEX (t
)
22193 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
22195 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
22196 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
22197 TYPE_MAIN_VARIANT (t
) = t
;
22198 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
22199 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
22200 TREE_VEC_ELT (replacement
, i
) = t
;
22201 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
22204 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
22205 TREE_VEC_ELT (replacement
, i
)
22206 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22208 /* If there are more levels then build up the replacement with the outer
22211 replacement
= add_to_template_args (template_parms_to_args
22212 (TREE_CHAIN (current_template_parms
)),
22215 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
22219 /* Set up the hash tables for template instantiations. */
22222 init_template_processing (void)
22224 decl_specializations
= htab_create_ggc (37,
22225 hash_specialization
,
22226 eq_specializations
,
22228 type_specializations
= htab_create_ggc (37,
22229 hash_specialization
,
22230 eq_specializations
,
22234 /* Print stats about the template hash tables for -fstats. */
22237 print_template_statistics (void)
22239 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
22240 "%f collisions\n", (long) htab_size (decl_specializations
),
22241 (long) htab_elements (decl_specializations
),
22242 htab_collisions (decl_specializations
));
22243 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
22244 "%f collisions\n", (long) htab_size (type_specializations
),
22245 (long) htab_elements (type_specializations
),
22246 htab_collisions (type_specializations
));
22249 #include "gt-cp-pt.h"