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 (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2312 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2314 if (cxx_dialect
< cxx14
)
2315 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2316 "variable templates only available with "
2317 "-std=c++14 or -std=gnu++14");
2319 // Namespace-scope variable templates should have a template header.
2322 if (template_header_count
> wanted
)
2324 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2325 "too many template headers for %D (should be %d)",
2327 if (warned
&& CLASS_TYPE_P (ctx
)
2328 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2329 inform (DECL_SOURCE_LOCATION (decl
),
2330 "members of an explicitly specialized class are defined "
2331 "without a template header");
2335 /* Check to see if the function just declared, as indicated in
2336 DECLARATOR, and in DECL, is a specialization of a function
2337 template. We may also discover that the declaration is an explicit
2338 instantiation at this point.
2340 Returns DECL, or an equivalent declaration that should be used
2341 instead if all goes well. Issues an error message if something is
2342 amiss. Returns error_mark_node if the error is not easily
2345 FLAGS is a bitmask consisting of the following flags:
2347 2: The function has a definition.
2348 4: The function is a friend.
2350 The TEMPLATE_COUNT is the number of references to qualifying
2351 template classes that appeared in the name of the function. For
2354 template <class T> struct S { void f(); };
2357 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2358 classes are not counted in the TEMPLATE_COUNT, so that in
2360 template <class T> struct S {};
2361 template <> struct S<int> { void f(); }
2362 template <> void S<int>::f();
2364 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2365 invalid; there should be no template <>.)
2367 If the function is a specialization, it is marked as such via
2368 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2369 is set up correctly, and it is added to the list of specializations
2370 for that template. */
2373 check_explicit_specialization (tree declarator
,
2378 int have_def
= flags
& 2;
2379 int is_friend
= flags
& 4;
2380 int specialization
= 0;
2381 int explicit_instantiation
= 0;
2382 int member_specialization
= 0;
2383 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2384 tree dname
= DECL_NAME (decl
);
2389 if (!processing_specialization
)
2392 tsk
= tsk_excessive_parms
;
2395 tsk
= current_tmpl_spec_kind (template_count
);
2400 if (processing_specialization
)
2403 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2405 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2408 /* This could be something like:
2410 template <class T> void f(T);
2411 class S { friend void f<>(int); } */
2415 /* This case handles bogus declarations like template <>
2416 template <class T> void f<int>(); */
2418 error ("template-id %qD in declaration of primary template",
2425 case tsk_invalid_member_spec
:
2426 /* The error has already been reported in
2427 check_specialization_scope. */
2428 return error_mark_node
;
2430 case tsk_invalid_expl_inst
:
2431 error ("template parameter list used in explicit instantiation");
2437 error ("definition provided for explicit instantiation");
2439 explicit_instantiation
= 1;
2442 case tsk_excessive_parms
:
2443 case tsk_insufficient_parms
:
2444 if (tsk
== tsk_excessive_parms
)
2445 error ("too many template parameter lists in declaration of %qD",
2447 else if (template_header_count
)
2448 error("too few template parameter lists in declaration of %qD", decl
);
2450 error("explicit specialization of %qD must be introduced by "
2451 "%<template <>%>", decl
);
2455 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2456 /* In cases like template<> constexpr bool v = true;
2457 We'll give an error in check_template_variable. */
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 ("non-type 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
) = (TREE_PUBLIC (decl
)
2817 && DECL_DECLARED_INLINE_P (decl
));
2818 else if (TREE_CODE (decl
) == VAR_DECL
)
2819 DECL_COMDAT (decl
) = false;
2821 /* Register this specialization so that we can find it
2823 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2825 /* A 'structor should already have clones. */
2826 gcc_assert (decl
== error_mark_node
2827 || variable_template_p (tmpl
)
2828 || !(DECL_CONSTRUCTOR_P (decl
)
2829 || DECL_DESTRUCTOR_P (decl
))
2830 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
2837 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2838 parameters. These are represented in the same format used for
2839 DECL_TEMPLATE_PARMS. */
2842 comp_template_parms (const_tree parms1
, const_tree parms2
)
2847 if (parms1
== parms2
)
2850 for (p1
= parms1
, p2
= parms2
;
2851 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2852 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2854 tree t1
= TREE_VALUE (p1
);
2855 tree t2
= TREE_VALUE (p2
);
2858 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2859 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2861 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2864 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2866 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2867 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2869 /* If either of the template parameters are invalid, assume
2870 they match for the sake of error recovery. */
2871 if (error_operand_p (parm1
) || error_operand_p (parm2
))
2874 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2877 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2878 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2879 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2881 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2886 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2887 /* One set of parameters has more parameters lists than the
2894 /* Determine whether PARM is a parameter pack. */
2897 template_parameter_pack_p (const_tree parm
)
2899 /* Determine if we have a non-type template parameter pack. */
2900 if (TREE_CODE (parm
) == PARM_DECL
)
2901 return (DECL_TEMPLATE_PARM_P (parm
)
2902 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2903 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2904 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2906 /* If this is a list of template parameters, we could get a
2907 TYPE_DECL or a TEMPLATE_DECL. */
2908 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2909 parm
= TREE_TYPE (parm
);
2911 /* Otherwise it must be a type template parameter. */
2912 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2913 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2914 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2917 /* Determine if T is a function parameter pack. */
2920 function_parameter_pack_p (const_tree t
)
2922 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2923 return DECL_PACK_P (t
);
2927 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2928 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2931 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2933 if (! primary_func_tmpl_inst
2934 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2935 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2938 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2941 /* Return true iff the function parameter PARAM_DECL was expanded
2942 from the function parameter pack PACK. */
2945 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2947 if (DECL_ARTIFICIAL (param_decl
)
2948 || !function_parameter_pack_p (pack
))
2951 /* The parameter pack and its pack arguments have the same
2953 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2956 /* Determine whether ARGS describes a variadic template args list,
2957 i.e., one that is terminated by a template argument pack. */
2960 template_args_variadic_p (tree args
)
2965 if (args
== NULL_TREE
)
2968 args
= INNERMOST_TEMPLATE_ARGS (args
);
2969 nargs
= TREE_VEC_LENGTH (args
);
2974 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2976 return ARGUMENT_PACK_P (last_parm
);
2979 /* Generate a new name for the parameter pack name NAME (an
2980 IDENTIFIER_NODE) that incorporates its */
2983 make_ith_pack_parameter_name (tree name
, int i
)
2985 /* Munge the name to include the parameter index. */
2986 #define NUMBUF_LEN 128
2987 char numbuf
[NUMBUF_LEN
];
2991 if (name
== NULL_TREE
)
2993 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2994 newname_len
= IDENTIFIER_LENGTH (name
)
2995 + strlen (numbuf
) + 2;
2996 newname
= (char*)alloca (newname_len
);
2997 snprintf (newname
, newname_len
,
2998 "%s#%i", IDENTIFIER_POINTER (name
), i
);
2999 return get_identifier (newname
);
3002 /* Return true if T is a primary function, class or alias template
3006 primary_template_instantiation_p (const_tree t
)
3011 if (TREE_CODE (t
) == FUNCTION_DECL
)
3012 return DECL_LANG_SPECIFIC (t
)
3013 && DECL_TEMPLATE_INSTANTIATION (t
)
3014 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3015 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3016 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3017 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3018 else if (alias_template_specialization_p (t
))
3023 /* Return true if PARM is a template template parameter. */
3026 template_template_parameter_p (const_tree parm
)
3028 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3031 /* Return true iff PARM is a DECL representing a type template
3035 template_type_parameter_p (const_tree parm
)
3038 && (TREE_CODE (parm
) == TYPE_DECL
3039 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3040 && DECL_TEMPLATE_PARM_P (parm
));
3043 /* Return the template parameters of T if T is a
3044 primary template instantiation, NULL otherwise. */
3047 get_primary_template_innermost_parameters (const_tree t
)
3049 tree parms
= NULL
, template_info
= NULL
;
3051 if ((template_info
= get_template_info (t
))
3052 && primary_template_instantiation_p (t
))
3053 parms
= INNERMOST_TEMPLATE_PARMS
3054 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3059 /* Return the template parameters of the LEVELth level from the full list
3060 of template parameters PARMS. */
3063 get_template_parms_at_level (tree parms
, int level
)
3067 || TREE_CODE (parms
) != TREE_LIST
3068 || level
> TMPL_PARMS_DEPTH (parms
))
3071 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3072 if (TMPL_PARMS_DEPTH (p
) == level
)
3078 /* Returns the template arguments of T if T is a template instantiation,
3082 get_template_innermost_arguments (const_tree t
)
3084 tree args
= NULL
, template_info
= NULL
;
3086 if ((template_info
= get_template_info (t
))
3087 && TI_ARGS (template_info
))
3088 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3093 /* Return the argument pack elements of T if T is a template argument pack,
3097 get_template_argument_pack_elems (const_tree t
)
3099 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3100 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3103 return ARGUMENT_PACK_ARGS (t
);
3106 /* Structure used to track the progress of find_parameter_packs_r. */
3107 struct find_parameter_pack_data
3109 /* TREE_LIST that will contain all of the parameter packs found by
3111 tree
* parameter_packs
;
3113 /* Set of AST nodes that have been visited by the traversal. */
3114 hash_set
<tree
> *visited
;
3117 /* Identifies all of the argument packs that occur in a template
3118 argument and appends them to the TREE_LIST inside DATA, which is a
3119 find_parameter_pack_data structure. This is a subroutine of
3120 make_pack_expansion and uses_parameter_packs. */
3122 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3125 struct find_parameter_pack_data
* ppd
=
3126 (struct find_parameter_pack_data
*)data
;
3127 bool parameter_pack_p
= false;
3129 /* Handle type aliases/typedefs. */
3130 if (TYPE_ALIAS_P (t
))
3132 if (TYPE_TEMPLATE_INFO (t
))
3133 cp_walk_tree (&TYPE_TI_ARGS (t
),
3134 &find_parameter_packs_r
,
3140 /* Identify whether this is a parameter pack or not. */
3141 switch (TREE_CODE (t
))
3143 case TEMPLATE_PARM_INDEX
:
3144 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3145 parameter_pack_p
= true;
3148 case TEMPLATE_TYPE_PARM
:
3149 t
= TYPE_MAIN_VARIANT (t
);
3150 case TEMPLATE_TEMPLATE_PARM
:
3151 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3152 parameter_pack_p
= true;
3157 if (DECL_PACK_P (t
))
3159 /* We don't want to walk into the type of a PARM_DECL,
3160 because we don't want to see the type parameter pack. */
3162 parameter_pack_p
= true;
3166 /* Look through a lambda capture proxy to the field pack. */
3168 if (DECL_HAS_VALUE_EXPR_P (t
))
3170 tree v
= DECL_VALUE_EXPR (t
);
3172 &find_parameter_packs_r
,
3179 parameter_pack_p
= true;
3182 /* Not a parameter pack. */
3186 if (parameter_pack_p
)
3188 /* Add this parameter pack to the list. */
3189 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3193 cp_walk_tree (&TYPE_CONTEXT (t
),
3194 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3196 /* This switch statement will return immediately if we don't find a
3198 switch (TREE_CODE (t
))
3200 case TEMPLATE_PARM_INDEX
:
3203 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3204 /* Check the template itself. */
3205 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3206 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3207 /* Check the template arguments. */
3208 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3213 case TEMPLATE_TYPE_PARM
:
3214 case TEMPLATE_TEMPLATE_PARM
:
3221 if (TYPE_PTRMEMFUNC_P (t
))
3227 if (TYPE_TEMPLATE_INFO (t
))
3228 cp_walk_tree (&TYPE_TI_ARGS (t
),
3229 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3236 cp_walk_tree (&TREE_TYPE (t
),
3237 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3241 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3246 case TYPE_PACK_EXPANSION
:
3247 case EXPR_PACK_EXPANSION
:
3252 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3257 case IDENTIFIER_NODE
:
3258 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3270 /* Determines if the expression or type T uses any parameter packs. */
3272 uses_parameter_packs (tree t
)
3274 tree parameter_packs
= NULL_TREE
;
3275 struct find_parameter_pack_data ppd
;
3276 ppd
.parameter_packs
= ¶meter_packs
;
3277 ppd
.visited
= new hash_set
<tree
>;
3278 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3280 return parameter_packs
!= NULL_TREE
;
3283 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3284 representation a base-class initializer into a parameter pack
3285 expansion. If all goes well, the resulting node will be an
3286 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3289 make_pack_expansion (tree arg
)
3292 tree parameter_packs
= NULL_TREE
;
3293 bool for_types
= false;
3294 struct find_parameter_pack_data ppd
;
3296 if (!arg
|| arg
== error_mark_node
)
3299 if (TREE_CODE (arg
) == TREE_LIST
)
3301 /* The only time we will see a TREE_LIST here is for a base
3302 class initializer. In this case, the TREE_PURPOSE will be a
3303 _TYPE node (representing the base class expansion we're
3304 initializing) and the TREE_VALUE will be a TREE_LIST
3305 containing the initialization arguments.
3307 The resulting expansion looks somewhat different from most
3308 expansions. Rather than returning just one _EXPANSION, we
3309 return a TREE_LIST whose TREE_PURPOSE is a
3310 TYPE_PACK_EXPANSION containing the bases that will be
3311 initialized. The TREE_VALUE will be identical to the
3312 original TREE_VALUE, which is a list of arguments that will
3313 be passed to each base. We do not introduce any new pack
3314 expansion nodes into the TREE_VALUE (although it is possible
3315 that some already exist), because the TREE_PURPOSE and
3316 TREE_VALUE all need to be expanded together with the same
3317 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3318 resulting TREE_PURPOSE will mention the parameter packs in
3319 both the bases and the arguments to the bases. */
3322 tree parameter_packs
= NULL_TREE
;
3324 /* Determine which parameter packs will be used by the base
3326 ppd
.visited
= new hash_set
<tree
>;
3327 ppd
.parameter_packs
= ¶meter_packs
;
3328 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3331 if (parameter_packs
== NULL_TREE
)
3333 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3335 return error_mark_node
;
3338 if (TREE_VALUE (arg
) != void_type_node
)
3340 /* Collect the sets of parameter packs used in each of the
3341 initialization arguments. */
3342 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3344 /* Determine which parameter packs will be expanded in this
3346 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3353 /* Create the pack expansion type for the base type. */
3354 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3355 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3356 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3358 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3359 they will rarely be compared to anything. */
3360 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3362 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3365 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3368 /* Build the PACK_EXPANSION_* node. */
3370 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3371 : make_node (EXPR_PACK_EXPANSION
);
3372 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3373 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3375 /* Propagate type and const-expression information. */
3376 TREE_TYPE (result
) = TREE_TYPE (arg
);
3377 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3380 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3381 they will rarely be compared to anything. */
3382 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3384 /* Determine which parameter packs will be expanded. */
3385 ppd
.parameter_packs
= ¶meter_packs
;
3386 ppd
.visited
= new hash_set
<tree
>;
3387 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3390 /* Make sure we found some parameter packs. */
3391 if (parameter_packs
== NULL_TREE
)
3394 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3396 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3397 return error_mark_node
;
3399 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3401 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3406 /* Checks T for any "bare" parameter packs, which have not yet been
3407 expanded, and issues an error if any are found. This operation can
3408 only be done on full expressions or types (e.g., an expression
3409 statement, "if" condition, etc.), because we could have expressions like:
3411 foo(f(g(h(args)))...)
3413 where "args" is a parameter pack. check_for_bare_parameter_packs
3414 should not be called for the subexpressions args, h(args),
3415 g(h(args)), or f(g(h(args))), because we would produce erroneous
3418 Returns TRUE and emits an error if there were bare parameter packs,
3419 returns FALSE otherwise. */
3421 check_for_bare_parameter_packs (tree t
)
3423 tree parameter_packs
= NULL_TREE
;
3424 struct find_parameter_pack_data ppd
;
3426 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3429 if (TREE_CODE (t
) == TYPE_DECL
)
3432 ppd
.parameter_packs
= ¶meter_packs
;
3433 ppd
.visited
= new hash_set
<tree
>;
3434 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3437 if (parameter_packs
)
3439 error ("parameter packs not expanded with %<...%>:");
3440 while (parameter_packs
)
3442 tree pack
= TREE_VALUE (parameter_packs
);
3443 tree name
= NULL_TREE
;
3445 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3446 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3447 name
= TYPE_NAME (pack
);
3448 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3449 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3451 name
= DECL_NAME (pack
);
3454 inform (input_location
, " %qD", name
);
3456 inform (input_location
, " <anonymous>");
3458 parameter_packs
= TREE_CHAIN (parameter_packs
);
3467 /* Expand any parameter packs that occur in the template arguments in
3470 expand_template_argument_pack (tree args
)
3472 tree result_args
= NULL_TREE
;
3473 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3474 int num_result_args
= -1;
3475 int non_default_args_count
= -1;
3477 /* First, determine if we need to expand anything, and the number of
3478 slots we'll need. */
3479 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3481 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3482 if (arg
== NULL_TREE
)
3484 if (ARGUMENT_PACK_P (arg
))
3486 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3487 if (num_result_args
< 0)
3488 num_result_args
= in_arg
+ num_packed
;
3490 num_result_args
+= num_packed
;
3494 if (num_result_args
>= 0)
3499 /* If no expansion is necessary, we're done. */
3500 if (num_result_args
< 0)
3503 /* Expand arguments. */
3504 result_args
= make_tree_vec (num_result_args
);
3505 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3506 non_default_args_count
=
3507 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3508 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3510 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3511 if (ARGUMENT_PACK_P (arg
))
3513 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3514 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3515 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3516 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3517 if (non_default_args_count
> 0)
3518 non_default_args_count
+= num_packed
- 1;
3522 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3526 if (non_default_args_count
>= 0)
3527 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3531 /* Checks if DECL shadows a template parameter.
3533 [temp.local]: A template-parameter shall not be redeclared within its
3534 scope (including nested scopes).
3536 Emits an error and returns TRUE if the DECL shadows a parameter,
3537 returns FALSE otherwise. */
3540 check_template_shadow (tree decl
)
3544 /* If we're not in a template, we can't possibly shadow a template
3546 if (!current_template_parms
)
3549 /* Figure out what we're shadowing. */
3550 if (TREE_CODE (decl
) == OVERLOAD
)
3551 decl
= OVL_CURRENT (decl
);
3552 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3554 /* If there's no previous binding for this name, we're not shadowing
3555 anything, let alone a template parameter. */
3559 /* If we're not shadowing a template parameter, we're done. Note
3560 that OLDDECL might be an OVERLOAD (or perhaps even an
3561 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3563 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3566 /* We check for decl != olddecl to avoid bogus errors for using a
3567 name inside a class. We check TPFI to avoid duplicate errors for
3568 inline member templates. */
3570 || (DECL_TEMPLATE_PARM_P (decl
)
3571 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3574 /* Don't complain about the injected class name, as we've already
3575 complained about the class itself. */
3576 if (DECL_SELF_REFERENCE_P (decl
))
3579 error ("declaration of %q+#D", decl
);
3580 error (" shadows template parm %q+#D", olddecl
);
3584 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3585 ORIG_LEVEL, DECL, and TYPE. */
3588 build_template_parm_index (int index
,
3594 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3595 TEMPLATE_PARM_IDX (t
) = index
;
3596 TEMPLATE_PARM_LEVEL (t
) = level
;
3597 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3598 TEMPLATE_PARM_DECL (t
) = decl
;
3599 TREE_TYPE (t
) = type
;
3600 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3601 TREE_READONLY (t
) = TREE_READONLY (decl
);
3606 /* Find the canonical type parameter for the given template type
3607 parameter. Returns the canonical type parameter, which may be TYPE
3608 if no such parameter existed. */
3611 canonical_type_parameter (tree type
)
3614 int idx
= TEMPLATE_TYPE_IDX (type
);
3615 if (!canonical_template_parms
)
3616 vec_alloc (canonical_template_parms
, idx
+1);
3618 while (canonical_template_parms
->length () <= (unsigned)idx
)
3619 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3621 list
= (*canonical_template_parms
)[idx
];
3622 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3623 list
= TREE_CHAIN (list
);
3626 return TREE_VALUE (list
);
3629 (*canonical_template_parms
)[idx
]
3630 = tree_cons (NULL_TREE
, type
,
3631 (*canonical_template_parms
)[idx
]);
3636 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3637 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3638 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3639 new one is created. */
3642 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3643 tsubst_flags_t complain
)
3645 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3646 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3647 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3648 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3650 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3653 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3654 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3655 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3656 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3657 DECL_ARTIFICIAL (decl
) = 1;
3658 SET_DECL_TEMPLATE_PARM_P (decl
);
3660 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3661 TEMPLATE_PARM_LEVEL (index
) - levels
,
3662 TEMPLATE_PARM_ORIG_LEVEL (index
),
3664 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3665 TEMPLATE_PARM_PARAMETER_PACK (t
)
3666 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3668 /* Template template parameters need this. */
3669 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3670 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3671 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3675 return TEMPLATE_PARM_DESCENDANTS (index
);
3678 /* Process information from new template parameter PARM and append it
3679 to the LIST being built. This new parameter is a non-type
3680 parameter iff IS_NON_TYPE is true. This new parameter is a
3681 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3685 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3686 bool is_non_type
, bool is_parameter_pack
)
3692 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3693 defval
= TREE_PURPOSE (parm
);
3697 tree p
= tree_last (list
);
3699 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3702 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3703 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3705 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3713 parm
= TREE_VALUE (parm
);
3715 SET_DECL_TEMPLATE_PARM_P (parm
);
3717 if (TREE_TYPE (parm
) != error_mark_node
)
3721 The top-level cv-qualifiers on the template-parameter are
3722 ignored when determining its type. */
3723 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3724 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3725 TREE_TYPE (parm
) = error_mark_node
;
3726 else if (uses_parameter_packs (TREE_TYPE (parm
))
3727 && !is_parameter_pack
3728 /* If we're in a nested template parameter list, the template
3729 template parameter could be a parameter pack. */
3730 && processing_template_parmlist
== 1)
3732 /* This template parameter is not a parameter pack, but it
3733 should be. Complain about "bare" parameter packs. */
3734 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3736 /* Recover by calling this a parameter pack. */
3737 is_parameter_pack
= true;
3741 /* A template parameter is not modifiable. */
3742 TREE_CONSTANT (parm
) = 1;
3743 TREE_READONLY (parm
) = 1;
3744 decl
= build_decl (parm_loc
,
3745 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3746 TREE_CONSTANT (decl
) = 1;
3747 TREE_READONLY (decl
) = 1;
3748 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3749 = build_template_parm_index (idx
, processing_template_decl
,
3750 processing_template_decl
,
3751 decl
, TREE_TYPE (parm
));
3753 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3754 = is_parameter_pack
;
3759 parm
= TREE_VALUE (TREE_VALUE (parm
));
3761 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3763 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3764 /* This is for distinguishing between real templates and template
3765 template parameters */
3766 TREE_TYPE (parm
) = t
;
3767 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3772 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3773 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3774 decl
= build_decl (parm_loc
,
3775 TYPE_DECL
, parm
, t
);
3778 TYPE_NAME (t
) = decl
;
3779 TYPE_STUB_DECL (t
) = decl
;
3781 TEMPLATE_TYPE_PARM_INDEX (t
)
3782 = build_template_parm_index (idx
, processing_template_decl
,
3783 processing_template_decl
,
3784 decl
, TREE_TYPE (parm
));
3785 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3786 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3788 DECL_ARTIFICIAL (decl
) = 1;
3789 SET_DECL_TEMPLATE_PARM_P (decl
);
3791 parm
= build_tree_list (defval
, parm
);
3792 return chainon (list
, parm
);
3795 /* The end of a template parameter list has been reached. Process the
3796 tree list into a parameter vector, converting each parameter into a more
3797 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3801 end_template_parm_list (tree parms
)
3805 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3807 current_template_parms
3808 = tree_cons (size_int (processing_template_decl
),
3809 saved_parmlist
, current_template_parms
);
3811 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3813 next
= TREE_CHAIN (parm
);
3814 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3815 TREE_CHAIN (parm
) = NULL_TREE
;
3818 --processing_template_parmlist
;
3820 return saved_parmlist
;
3823 /* end_template_decl is called after a template declaration is seen. */
3826 end_template_decl (void)
3828 reset_specialization ();
3830 if (! processing_template_decl
)
3833 /* This matches the pushlevel in begin_template_parm_list. */
3836 --processing_template_decl
;
3837 current_template_parms
= TREE_CHAIN (current_template_parms
);
3840 /* Takes a TREE_LIST representing a template parameter and convert it
3841 into an argument suitable to be passed to the type substitution
3842 functions. Note that If the TREE_LIST contains an error_mark
3843 node, the returned argument is error_mark_node. */
3846 template_parm_to_arg (tree t
)
3850 || TREE_CODE (t
) != TREE_LIST
)
3853 if (error_operand_p (TREE_VALUE (t
)))
3854 return error_mark_node
;
3858 if (TREE_CODE (t
) == TYPE_DECL
3859 || TREE_CODE (t
) == TEMPLATE_DECL
)
3863 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3865 /* Turn this argument into a TYPE_ARGUMENT_PACK
3866 with a single element, which expands T. */
3867 tree vec
= make_tree_vec (1);
3868 #ifdef ENABLE_CHECKING
3869 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3870 (vec
, TREE_VEC_LENGTH (vec
));
3872 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3874 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3875 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3880 t
= DECL_INITIAL (t
);
3882 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3884 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3885 with a single element, which expands T. */
3886 tree vec
= make_tree_vec (1);
3887 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3888 #ifdef ENABLE_CHECKING
3889 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3890 (vec
, TREE_VEC_LENGTH (vec
));
3892 t
= convert_from_reference (t
);
3893 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3895 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3896 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3897 TREE_TYPE (t
) = type
;
3900 t
= convert_from_reference (t
);
3905 /* Given a set of template parameters, return them as a set of template
3906 arguments. The template parameters are represented as a TREE_VEC, in
3907 the form documented in cp-tree.h for template arguments. */
3910 template_parms_to_args (tree parms
)
3913 tree args
= NULL_TREE
;
3914 int length
= TMPL_PARMS_DEPTH (parms
);
3917 /* If there is only one level of template parameters, we do not
3918 create a TREE_VEC of TREE_VECs. Instead, we return a single
3919 TREE_VEC containing the arguments. */
3921 args
= make_tree_vec (length
);
3923 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3925 tree a
= copy_node (TREE_VALUE (header
));
3928 TREE_TYPE (a
) = NULL_TREE
;
3929 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3930 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3932 #ifdef ENABLE_CHECKING
3933 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3937 TREE_VEC_ELT (args
, --l
) = a
;
3942 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3943 /* This can happen for template parms of a template template
3946 template<template<class T, class U> class TT> struct S;
3948 Consider the level of the parms of TT; T and U both have
3949 level 2; TT has no template parm of level 1. So in this case
3950 the first element of full_template_args is NULL_TREE. If we
3951 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3952 of 2. This will make tsubst wrongly consider that T and U
3953 have level 1. Instead, let's create a dummy vector as the
3954 first element of full_template_args so that TMPL_ARGS_DEPTH
3955 returns the correct depth for args. */
3956 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3960 /* Within the declaration of a template, return the currently active
3961 template parameters as an argument TREE_VEC. */
3964 current_template_args (void)
3966 return template_parms_to_args (current_template_parms
);
3969 /* Update the declared TYPE by doing any lookups which were thought to be
3970 dependent, but are not now that we know the SCOPE of the declarator. */
3973 maybe_update_decl_type (tree orig_type
, tree scope
)
3975 tree type
= orig_type
;
3977 if (type
== NULL_TREE
)
3980 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3981 type
= TREE_TYPE (type
);
3983 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3984 && dependent_type_p (type
)
3985 /* Don't bother building up the args in this case. */
3986 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3988 /* tsubst in the args corresponding to the template parameters,
3989 including auto if present. Most things will be unchanged, but
3990 make_typename_type and tsubst_qualified_id will resolve
3991 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3992 tree args
= current_template_args ();
3993 tree auto_node
= type_uses_auto (type
);
3997 tree auto_vec
= make_tree_vec (1);
3998 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
3999 args
= add_to_template_args (args
, auto_vec
);
4001 pushed
= push_scope (scope
);
4002 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4007 if (type
== error_mark_node
)
4010 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4012 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4015 type
= TYPE_NAME (type
);
4020 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4021 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
4022 a member template. Used by push_template_decl below. */
4025 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4027 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4028 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4029 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4030 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4031 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4036 struct template_parm_data
4038 /* The level of the template parameters we are currently
4042 /* The index of the specialization argument we are currently
4046 /* An array whose size is the number of template parameters. The
4047 elements are nonzero if the parameter has been used in any one
4048 of the arguments processed so far. */
4051 /* An array whose size is the number of template arguments. The
4052 elements are nonzero if the argument makes use of template
4053 parameters of this level. */
4054 int* arg_uses_template_parms
;
4057 /* Subroutine of push_template_decl used to see if each template
4058 parameter in a partial specialization is used in the explicit
4059 argument list. If T is of the LEVEL given in DATA (which is
4060 treated as a template_parm_data*), then DATA->PARMS is marked
4064 mark_template_parm (tree t
, void* data
)
4068 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4070 template_parm_level_and_index (t
, &level
, &idx
);
4072 if (level
== tpd
->level
)
4074 tpd
->parms
[idx
] = 1;
4075 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4078 /* Return zero so that for_each_template_parm will continue the
4079 traversal of the tree; we want to mark *every* template parm. */
4083 /* Process the partial specialization DECL. */
4086 process_partial_specialization (tree decl
)
4088 tree type
= TREE_TYPE (decl
);
4089 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4090 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4091 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4092 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4095 int nargs
= TREE_VEC_LENGTH (inner_args
);
4098 bool did_error_intro
= false;
4099 struct template_parm_data tpd
;
4100 struct template_parm_data tpd2
;
4102 gcc_assert (current_template_parms
);
4104 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4105 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4107 /* We check that each of the template parameters given in the
4108 partial specialization is used in the argument list to the
4109 specialization. For example:
4111 template <class T> struct S;
4112 template <class T> struct S<T*>;
4114 The second declaration is OK because `T*' uses the template
4115 parameter T, whereas
4117 template <class T> struct S<int>;
4119 is no good. Even trickier is:
4130 The S2<T> declaration is actually invalid; it is a
4131 full-specialization. Of course,
4134 struct S2<T (*)(U)>;
4136 or some such would have been OK. */
4137 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4138 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4139 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4141 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4142 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4143 for (i
= 0; i
< nargs
; ++i
)
4145 tpd
.current_arg
= i
;
4146 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4147 &mark_template_parm
,
4150 /*include_nondeduced_p=*/false);
4152 for (i
= 0; i
< ntparms
; ++i
)
4153 if (tpd
.parms
[i
] == 0)
4155 /* One of the template parms was not used in a deduced context in the
4157 if (!did_error_intro
)
4159 error ("template parameters not deducible in "
4160 "partial specialization:");
4161 did_error_intro
= true;
4164 inform (input_location
, " %qD",
4165 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4168 if (did_error_intro
)
4169 return error_mark_node
;
4171 /* [temp.class.spec]
4173 The argument list of the specialization shall not be identical to
4174 the implicit argument list of the primary template. */
4175 if (comp_template_args
4177 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4179 error ("partial specialization %qT does not specialize any template arguments", type
);
4181 /* A partial specialization that replaces multiple parameters of the
4182 primary template with a pack expansion is less specialized for those
4184 if (nargs
< DECL_NTPARMS (maintmpl
))
4186 error ("partial specialization is not more specialized than the "
4187 "primary template because it replaces multiple parameters "
4188 "with a pack expansion");
4189 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4193 /* [temp.class.spec]
4195 A partially specialized non-type argument expression shall not
4196 involve template parameters of the partial specialization except
4197 when the argument expression is a simple identifier.
4199 The type of a template parameter corresponding to a specialized
4200 non-type argument shall not be dependent on a parameter of the
4203 Also, we verify that pack expansions only occur at the
4204 end of the argument list. */
4205 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4207 for (i
= 0; i
< nargs
; ++i
)
4209 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4210 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4211 tree packed_args
= NULL_TREE
;
4214 if (ARGUMENT_PACK_P (arg
))
4216 /* Extract the arguments from the argument pack. We'll be
4217 iterating over these in the following loop. */
4218 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4219 len
= TREE_VEC_LENGTH (packed_args
);
4222 for (j
= 0; j
< len
; j
++)
4225 /* Get the Jth argument in the parameter pack. */
4226 arg
= TREE_VEC_ELT (packed_args
, j
);
4228 if (PACK_EXPANSION_P (arg
))
4230 /* Pack expansions must come at the end of the
4232 if ((packed_args
&& j
< len
- 1)
4233 || (!packed_args
&& i
< nargs
- 1))
4235 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4236 error ("parameter pack argument %qE must be at the "
4237 "end of the template argument list", arg
);
4239 error ("parameter pack argument %qT must be at the "
4240 "end of the template argument list", arg
);
4244 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4245 /* We only care about the pattern. */
4246 arg
= PACK_EXPANSION_PATTERN (arg
);
4248 if (/* These first two lines are the `non-type' bit. */
4250 && TREE_CODE (arg
) != TEMPLATE_DECL
4251 /* This next two lines are the `argument expression is not just a
4252 simple identifier' condition and also the `specialized
4253 non-type argument' bit. */
4254 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4255 && !(REFERENCE_REF_P (arg
)
4256 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4258 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4259 || (packed_args
&& uses_template_parms (arg
)))
4260 error ("template argument %qE involves template parameter(s)",
4264 /* Look at the corresponding template parameter,
4265 marking which template parameters its type depends
4267 tree type
= TREE_TYPE (parm
);
4271 /* We haven't yet initialized TPD2. Do so now. */
4272 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4273 /* The number of parameters here is the number in the
4274 main template, which, as checked in the assertion
4276 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4278 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4281 /* Mark the template parameters. But this time, we're
4282 looking for the template parameters of the main
4283 template, not in the specialization. */
4284 tpd2
.current_arg
= i
;
4285 tpd2
.arg_uses_template_parms
[i
] = 0;
4286 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4287 for_each_template_parm (type
,
4288 &mark_template_parm
,
4291 /*include_nondeduced_p=*/false);
4293 if (tpd2
.arg_uses_template_parms
[i
])
4295 /* The type depended on some template parameters.
4296 If they are fully specialized in the
4297 specialization, that's OK. */
4300 for (j
= 0; j
< nargs
; ++j
)
4301 if (tpd2
.parms
[j
] != 0
4302 && tpd
.arg_uses_template_parms
[j
])
4305 error_n (input_location
, count
,
4306 "type %qT of template argument %qE depends "
4307 "on a template parameter",
4308 "type %qT of template argument %qE depends "
4309 "on template parameters",
4318 /* We should only get here once. */
4319 gcc_assert (!COMPLETE_TYPE_P (type
));
4321 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4322 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4323 TREE_TYPE (tmpl
) = type
;
4324 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4325 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4326 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4327 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4329 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4330 = tree_cons (specargs
, tmpl
,
4331 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4332 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4334 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4335 inst
= TREE_CHAIN (inst
))
4337 tree inst_type
= TREE_VALUE (inst
);
4338 if (COMPLETE_TYPE_P (inst_type
)
4339 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4341 tree spec
= most_specialized_class (inst_type
, tf_none
);
4342 if (spec
&& TREE_TYPE (spec
) == type
)
4343 permerror (input_location
,
4344 "partial specialization of %qT after instantiation "
4345 "of %qT", type
, inst_type
);
4352 /* PARM is a template parameter of some form; return the corresponding
4353 TEMPLATE_PARM_INDEX. */
4356 get_template_parm_index (tree parm
)
4358 if (TREE_CODE (parm
) == PARM_DECL
4359 || TREE_CODE (parm
) == CONST_DECL
)
4360 parm
= DECL_INITIAL (parm
);
4361 else if (TREE_CODE (parm
) == TYPE_DECL
4362 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4363 parm
= TREE_TYPE (parm
);
4364 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4365 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4366 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4367 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4371 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4372 parameter packs used by the template parameter PARM. */
4375 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4377 /* A type parm can't refer to another parm. */
4378 if (TREE_CODE (parm
) == TYPE_DECL
)
4380 else if (TREE_CODE (parm
) == PARM_DECL
)
4382 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4387 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4389 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4390 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4391 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4394 /* PARM is a template parameter pack. Return any parameter packs used in
4395 its type or the type of any of its template parameters. If there are
4396 any such packs, it will be instantiated into a fixed template parameter
4397 list by partial instantiation rather than be fully deduced. */
4400 fixed_parameter_pack_p (tree parm
)
4402 /* This can only be true in a member template. */
4403 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4405 /* This can only be true for a parameter pack. */
4406 if (!template_parameter_pack_p (parm
))
4408 /* A type parm can't refer to another parm. */
4409 if (TREE_CODE (parm
) == TYPE_DECL
)
4412 tree parameter_packs
= NULL_TREE
;
4413 struct find_parameter_pack_data ppd
;
4414 ppd
.parameter_packs
= ¶meter_packs
;
4415 ppd
.visited
= new hash_set
<tree
>;
4417 fixed_parameter_pack_p_1 (parm
, &ppd
);
4420 return parameter_packs
;
4423 /* Check that a template declaration's use of default arguments and
4424 parameter packs is not invalid. Here, PARMS are the template
4425 parameters. IS_PRIMARY is true if DECL is the thing declared by
4426 a primary template. IS_PARTIAL is true if DECL is a partial
4429 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4430 declaration (but not a definition); 1 indicates a declaration, 2
4431 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4432 emitted for extraneous default arguments.
4434 Returns TRUE if there were no errors found, FALSE otherwise. */
4437 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4438 bool is_partial
, int is_friend_decl
)
4441 int last_level_to_check
;
4443 bool no_errors
= true;
4447 A default template-argument shall not be specified in a
4448 function template declaration or a function template definition, nor
4449 in the template-parameter-list of the definition of a member of a
4452 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4453 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4454 /* You can't have a function template declaration in a local
4455 scope, nor you can you define a member of a class template in a
4459 if (TREE_CODE (decl
) == TYPE_DECL
4461 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4462 /* A lambda doesn't have an explicit declaration; don't complain
4463 about the parms of the enclosing class. */
4466 if (current_class_type
4467 && !TYPE_BEING_DEFINED (current_class_type
)
4468 && DECL_LANG_SPECIFIC (decl
)
4469 && DECL_DECLARES_FUNCTION_P (decl
)
4470 /* If this is either a friend defined in the scope of the class
4471 or a member function. */
4472 && (DECL_FUNCTION_MEMBER_P (decl
)
4473 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4474 : DECL_FRIEND_CONTEXT (decl
)
4475 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4477 /* And, if it was a member function, it really was defined in
4478 the scope of the class. */
4479 && (!DECL_FUNCTION_MEMBER_P (decl
)
4480 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4481 /* We already checked these parameters when the template was
4482 declared, so there's no need to do it again now. This function
4483 was defined in class scope, but we're processing its body now
4484 that the class is complete. */
4487 /* Core issue 226 (C++0x only): the following only applies to class
4490 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4494 If a template-parameter has a default template-argument, all
4495 subsequent template-parameters shall have a default
4496 template-argument supplied. */
4497 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4499 tree inner_parms
= TREE_VALUE (parm_level
);
4500 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4501 int seen_def_arg_p
= 0;
4504 for (i
= 0; i
< ntparms
; ++i
)
4506 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4508 if (parm
== error_mark_node
)
4511 if (TREE_PURPOSE (parm
))
4513 else if (seen_def_arg_p
4514 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4516 error ("no default argument for %qD", TREE_VALUE (parm
));
4517 /* For better subsequent error-recovery, we indicate that
4518 there should have been a default argument. */
4519 TREE_PURPOSE (parm
) = error_mark_node
;
4522 else if (!is_partial
4524 /* Don't complain about an enclosing partial
4526 && parm_level
== parms
4527 && TREE_CODE (decl
) == TYPE_DECL
4529 && template_parameter_pack_p (TREE_VALUE (parm
))
4530 /* A fixed parameter pack will be partially
4531 instantiated into a fixed length list. */
4532 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4534 /* A primary class template can only have one
4535 parameter pack, at the end of the template
4538 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4539 error ("parameter pack %qE must be at the end of the"
4540 " template parameter list", TREE_VALUE (parm
));
4542 error ("parameter pack %qT must be at the end of the"
4543 " template parameter list",
4544 TREE_TYPE (TREE_VALUE (parm
)));
4546 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4554 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4558 /* For an ordinary class template, default template arguments are
4559 allowed at the innermost level, e.g.:
4560 template <class T = int>
4562 but, in a partial specialization, they're not allowed even
4563 there, as we have in [temp.class.spec]:
4565 The template parameter list of a specialization shall not
4566 contain default template argument values.
4568 So, for a partial specialization, or for a function template
4569 (in C++98/C++03), we look at all of them. */
4572 /* But, for a primary class template that is not a partial
4573 specialization we look at all template parameters except the
4575 parms
= TREE_CHAIN (parms
);
4577 /* Figure out what error message to issue. */
4578 if (is_friend_decl
== 2)
4579 msg
= G_("default template arguments may not be used in function template "
4580 "friend re-declaration");
4581 else if (is_friend_decl
)
4582 msg
= G_("default template arguments may not be used in function template "
4583 "friend declarations");
4584 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4585 msg
= G_("default template arguments may not be used in function templates "
4586 "without -std=c++11 or -std=gnu++11");
4587 else if (is_partial
)
4588 msg
= G_("default template arguments may not be used in "
4589 "partial specializations");
4591 msg
= G_("default argument for template parameter for class enclosing %qD");
4593 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4594 /* If we're inside a class definition, there's no need to
4595 examine the parameters to the class itself. On the one
4596 hand, they will be checked when the class is defined, and,
4597 on the other, default arguments are valid in things like:
4598 template <class T = double>
4599 struct S { template <class U> void f(U); };
4600 Here the default argument for `S' has no bearing on the
4601 declaration of `f'. */
4602 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4604 /* Check everything. */
4605 last_level_to_check
= 0;
4607 for (parm_level
= parms
;
4608 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4609 parm_level
= TREE_CHAIN (parm_level
))
4611 tree inner_parms
= TREE_VALUE (parm_level
);
4615 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4616 for (i
= 0; i
< ntparms
; ++i
)
4618 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4621 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4626 if (is_friend_decl
== 2)
4633 /* Clear out the default argument so that we are not
4635 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4639 /* At this point, if we're still interested in issuing messages,
4640 they must apply to classes surrounding the object declared. */
4642 msg
= G_("default argument for template parameter for class "
4649 /* Worker for push_template_decl_real, called via
4650 for_each_template_parm. DATA is really an int, indicating the
4651 level of the parameters we are interested in. If T is a template
4652 parameter of that level, return nonzero. */
4655 template_parm_this_level_p (tree t
, void* data
)
4657 int this_level
= *(int *)data
;
4660 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4661 level
= TEMPLATE_PARM_LEVEL (t
);
4663 level
= TEMPLATE_TYPE_LEVEL (t
);
4664 return level
== this_level
;
4667 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4668 parameters given by current_template_args, or reuses a
4669 previously existing one, if appropriate. Returns the DECL, or an
4670 equivalent one, if it is replaced via a call to duplicate_decls.
4672 If IS_FRIEND is true, DECL is a friend declaration. */
4675 push_template_decl_real (tree decl
, bool is_friend
)
4683 int new_template_p
= 0;
4684 /* True if the template is a member template, in the sense of
4686 bool member_template_p
= false;
4688 if (decl
== error_mark_node
|| !current_template_parms
)
4689 return error_mark_node
;
4691 /* See if this is a partial specialization. */
4692 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4693 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4694 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4696 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4700 /* For a friend, we want the context of the friend function, not
4701 the type of which it is a friend. */
4702 ctx
= CP_DECL_CONTEXT (decl
);
4703 else if (CP_DECL_CONTEXT (decl
)
4704 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4705 /* In the case of a virtual function, we want the class in which
4707 ctx
= CP_DECL_CONTEXT (decl
);
4709 /* Otherwise, if we're currently defining some class, the DECL
4710 is assumed to be a member of the class. */
4711 ctx
= current_scope ();
4713 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4716 if (!DECL_CONTEXT (decl
))
4717 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4719 /* See if this is a primary template. */
4720 if (is_friend
&& ctx
4721 && uses_template_parms_level (ctx
, processing_template_decl
))
4722 /* A friend template that specifies a class context, i.e.
4723 template <typename T> friend void A<T>::f();
4726 else if (TREE_CODE (decl
) == TYPE_DECL
4727 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4730 is_primary
= template_parm_scope_p ();
4734 if (DECL_CLASS_SCOPE_P (decl
))
4735 member_template_p
= true;
4736 if (TREE_CODE (decl
) == TYPE_DECL
4737 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4739 error ("template class without a name");
4740 return error_mark_node
;
4742 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4744 if (member_template_p
)
4746 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
4747 error ("member template %qD may not have virt-specifiers", decl
);
4749 if (DECL_DESTRUCTOR_P (decl
))
4753 A destructor shall not be a member template. */
4754 error ("destructor %qD declared as member template", decl
);
4755 return error_mark_node
;
4757 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4758 && (!prototype_p (TREE_TYPE (decl
))
4759 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4760 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4761 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4762 == void_list_node
)))
4764 /* [basic.stc.dynamic.allocation]
4766 An allocation function can be a function
4767 template. ... Template allocation functions shall
4768 have two or more parameters. */
4769 error ("invalid template declaration of %qD", decl
);
4770 return error_mark_node
;
4773 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4774 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4776 else if (TREE_CODE (decl
) == TYPE_DECL
4777 && TYPE_DECL_ALIAS_P (decl
))
4778 /* alias-declaration */
4779 gcc_assert (!DECL_ARTIFICIAL (decl
));
4780 else if (VAR_P (decl
))
4781 /* C++14 variable template. */;
4784 error ("template declaration of %q#D", decl
);
4785 return error_mark_node
;
4789 /* Check to see that the rules regarding the use of default
4790 arguments are not being violated. */
4791 check_default_tmpl_args (decl
, current_template_parms
,
4792 is_primary
, is_partial
, /*is_friend_decl=*/0);
4794 /* Ensure that there are no parameter packs in the type of this
4795 declaration that have not been expanded. */
4796 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4798 /* Check each of the arguments individually to see if there are
4799 any bare parameter packs. */
4800 tree type
= TREE_TYPE (decl
);
4801 tree arg
= DECL_ARGUMENTS (decl
);
4802 tree argtype
= TYPE_ARG_TYPES (type
);
4804 while (arg
&& argtype
)
4806 if (!DECL_PACK_P (arg
)
4807 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4809 /* This is a PARM_DECL that contains unexpanded parameter
4810 packs. We have already complained about this in the
4811 check_for_bare_parameter_packs call, so just replace
4812 these types with ERROR_MARK_NODE. */
4813 TREE_TYPE (arg
) = error_mark_node
;
4814 TREE_VALUE (argtype
) = error_mark_node
;
4817 arg
= DECL_CHAIN (arg
);
4818 argtype
= TREE_CHAIN (argtype
);
4821 /* Check for bare parameter packs in the return type and the
4822 exception specifiers. */
4823 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4824 /* Errors were already issued, set return type to int
4825 as the frontend doesn't expect error_mark_node as
4827 TREE_TYPE (type
) = integer_type_node
;
4828 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4829 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4831 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4832 && TYPE_DECL_ALIAS_P (decl
))
4833 ? DECL_ORIGINAL_TYPE (decl
)
4834 : TREE_TYPE (decl
)))
4836 TREE_TYPE (decl
) = error_mark_node
;
4837 return error_mark_node
;
4841 return process_partial_specialization (decl
);
4843 args
= current_template_args ();
4846 || TREE_CODE (ctx
) == FUNCTION_DECL
4847 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4848 || (TREE_CODE (decl
) == TYPE_DECL
4849 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4850 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4852 if (DECL_LANG_SPECIFIC (decl
)
4853 && DECL_TEMPLATE_INFO (decl
)
4854 && DECL_TI_TEMPLATE (decl
))
4855 tmpl
= DECL_TI_TEMPLATE (decl
);
4856 /* If DECL is a TYPE_DECL for a class-template, then there won't
4857 be DECL_LANG_SPECIFIC. The information equivalent to
4858 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4859 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4860 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4861 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4863 /* Since a template declaration already existed for this
4864 class-type, we must be redeclaring it here. Make sure
4865 that the redeclaration is valid. */
4866 redeclare_class_template (TREE_TYPE (decl
),
4867 current_template_parms
);
4868 /* We don't need to create a new TEMPLATE_DECL; just use the
4869 one we already had. */
4870 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4874 tmpl
= build_template_decl (decl
, current_template_parms
,
4878 if (DECL_LANG_SPECIFIC (decl
)
4879 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4881 /* A specialization of a member template of a template
4883 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4884 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4885 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4891 tree a
, t
, current
, parms
;
4893 tree tinfo
= get_template_info (decl
);
4897 error ("template definition of non-template %q#D", decl
);
4898 return error_mark_node
;
4901 tmpl
= TI_TEMPLATE (tinfo
);
4903 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4904 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4905 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4906 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4910 /* The declaration is a specialization of a member
4911 template, declared outside the class. Therefore, the
4912 innermost template arguments will be NULL, so we
4913 replace them with the arguments determined by the
4914 earlier call to check_explicit_specialization. */
4915 args
= DECL_TI_ARGS (decl
);
4918 = build_template_decl (decl
, current_template_parms
,
4920 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4921 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4922 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4923 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4924 DECL_TEMPLATE_INFO (new_tmpl
)
4925 = build_template_info (tmpl
, args
);
4927 register_specialization (new_tmpl
,
4928 most_general_template (tmpl
),
4934 /* Make sure the template headers we got make sense. */
4936 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4937 i
= TMPL_PARMS_DEPTH (parms
);
4938 if (TMPL_ARGS_DEPTH (args
) != i
)
4940 error ("expected %d levels of template parms for %q#D, got %d",
4941 i
, decl
, TMPL_ARGS_DEPTH (args
));
4942 DECL_INTERFACE_KNOWN (decl
) = 1;
4943 return error_mark_node
;
4946 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4948 a
= TMPL_ARGS_LEVEL (args
, i
);
4949 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4951 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4953 if (current
== decl
)
4954 error ("got %d template parameters for %q#D",
4955 TREE_VEC_LENGTH (a
), decl
);
4957 error ("got %d template parameters for %q#T",
4958 TREE_VEC_LENGTH (a
), current
);
4959 error (" but %d required", TREE_VEC_LENGTH (t
));
4960 /* Avoid crash in import_export_decl. */
4961 DECL_INTERFACE_KNOWN (decl
) = 1;
4962 return error_mark_node
;
4965 if (current
== decl
)
4967 else if (current
== NULL_TREE
)
4968 /* Can happen in erroneous input. */
4971 current
= get_containing_scope (current
);
4974 /* Check that the parms are used in the appropriate qualifying scopes
4975 in the declarator. */
4976 if (!comp_template_args
4978 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4981 template arguments to %qD do not match original template %qD",
4982 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4983 if (!uses_template_parms (TI_ARGS (tinfo
)))
4984 inform (input_location
, "use template<> for an explicit specialization");
4985 /* Avoid crash in import_export_decl. */
4986 DECL_INTERFACE_KNOWN (decl
) = 1;
4987 return error_mark_node
;
4991 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4992 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4994 /* Push template declarations for global functions and types. Note
4995 that we do not try to push a global template friend declared in a
4996 template class; such a thing may well depend on the template
4997 parameters of the class. */
4998 if (new_template_p
&& !ctx
4999 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5001 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5002 if (tmpl
== error_mark_node
)
5003 return error_mark_node
;
5005 /* Hide template friend classes that haven't been declared yet. */
5006 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5008 DECL_ANTICIPATED (tmpl
) = 1;
5009 DECL_FRIEND_P (tmpl
) = 1;
5015 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5018 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5019 if (DECL_CONV_FN_P (tmpl
))
5021 int depth
= TMPL_PARMS_DEPTH (parms
);
5023 /* It is a conversion operator. See if the type converted to
5024 depends on innermost template operands. */
5026 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5028 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5031 /* Give template template parms a DECL_CONTEXT of the template
5032 for which they are a parameter. */
5033 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5034 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5036 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5037 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5038 DECL_CONTEXT (parm
) = tmpl
;
5042 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5043 back to its most general template. If TMPL is a specialization,
5044 ARGS may only have the innermost set of arguments. Add the missing
5045 argument levels if necessary. */
5046 if (DECL_TEMPLATE_INFO (tmpl
))
5047 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5049 info
= build_template_info (tmpl
, args
);
5051 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5052 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5055 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5056 retrofit_lang_decl (decl
);
5057 if (DECL_LANG_SPECIFIC (decl
))
5058 DECL_TEMPLATE_INFO (decl
) = info
;
5061 if (flag_implicit_templates
5063 && TREE_PUBLIC (decl
)
5064 && VAR_OR_FUNCTION_DECL_P (decl
))
5065 /* Set DECL_COMDAT on template instantiations; if we force
5066 them to be emitted by explicit instantiation or -frepo,
5067 mark_needed will tell cgraph to do the right thing. */
5068 DECL_COMDAT (decl
) = true;
5070 return DECL_TEMPLATE_RESULT (tmpl
);
5074 push_template_decl (tree decl
)
5076 return push_template_decl_real (decl
, false);
5079 /* FN is an inheriting constructor that inherits from the constructor
5080 template INHERITED; turn FN into a constructor template with a matching
5084 add_inherited_template_parms (tree fn
, tree inherited
)
5087 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5088 inner_parms
= copy_node (inner_parms
);
5090 = tree_cons (size_int (processing_template_decl
+ 1),
5091 inner_parms
, current_template_parms
);
5092 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5093 tree args
= template_parms_to_args (parms
);
5094 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5095 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5096 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5097 DECL_ARTIFICIAL (tmpl
) = true;
5098 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5102 /* Called when a class template TYPE is redeclared with the indicated
5103 template PARMS, e.g.:
5105 template <class T> struct S;
5106 template <class T> struct S {}; */
5109 redeclare_class_template (tree type
, tree parms
)
5115 if (!TYPE_TEMPLATE_INFO (type
))
5117 error ("%qT is not a template type", type
);
5121 tmpl
= TYPE_TI_TEMPLATE (type
);
5122 if (!PRIMARY_TEMPLATE_P (tmpl
))
5123 /* The type is nested in some template class. Nothing to worry
5124 about here; there are no new template parameters for the nested
5130 error ("template specifiers not specified in declaration of %qD",
5135 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5136 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5138 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5140 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5141 "redeclared with %d template parameter",
5142 "redeclared with %d template parameters",
5143 TREE_VEC_LENGTH (parms
));
5144 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5145 "previous declaration %q+D used %d template parameter",
5146 "previous declaration %q+D used %d template parameters",
5147 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5151 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5158 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5159 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5162 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5163 if (error_operand_p (tmpl_parm
))
5166 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5167 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5168 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5170 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5172 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5173 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5174 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5175 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5176 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5177 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5178 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5179 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5180 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5182 error ("template parameter %q+#D", tmpl_parm
);
5183 error ("redeclared here as %q#D", parm
);
5187 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5189 /* We have in [temp.param]:
5191 A template-parameter may not be given default arguments
5192 by two different declarations in the same scope. */
5193 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5194 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5195 "original definition appeared here");
5199 if (parm_default
!= NULL_TREE
)
5200 /* Update the previous template parameters (which are the ones
5201 that will really count) with the new default value. */
5202 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5203 else if (tmpl_default
!= NULL_TREE
)
5204 /* Update the new parameters, too; they'll be used as the
5205 parameters for any members. */
5206 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5212 /* Simplify EXPR if it is a non-dependent expression. Returns the
5213 (possibly simplified) expression. */
5216 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5218 if (expr
== NULL_TREE
)
5221 /* If we're in a template, but EXPR isn't value dependent, simplify
5222 it. We're supposed to treat:
5224 template <typename T> void f(T[1 + 1]);
5225 template <typename T> void f(T[2]);
5227 as two declarations of the same function, for example. */
5228 if (processing_template_decl
5229 && !instantiation_dependent_expression_p (expr
)
5230 && potential_constant_expression (expr
))
5232 HOST_WIDE_INT saved_processing_template_decl
;
5234 saved_processing_template_decl
= processing_template_decl
;
5235 processing_template_decl
= 0;
5236 expr
= tsubst_copy_and_build (expr
,
5239 /*in_decl=*/NULL_TREE
,
5240 /*function_p=*/false,
5241 /*integral_constant_expression_p=*/true);
5242 processing_template_decl
= saved_processing_template_decl
;
5248 fold_non_dependent_expr (tree expr
)
5250 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5253 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5254 template declaration, or a TYPE_DECL for an alias declaration. */
5257 alias_type_or_template_p (tree t
)
5261 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5264 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5265 || DECL_ALIAS_TEMPLATE_P (t
));
5268 /* Return TRUE iff is a specialization of an alias template. */
5271 alias_template_specialization_p (const_tree t
)
5277 && TYPE_TEMPLATE_INFO (t
)
5278 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5279 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5282 /* Return the number of innermost template parameters in TMPL. */
5285 num_innermost_template_parms (tree tmpl
)
5287 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5288 return TREE_VEC_LENGTH (parms
);
5291 /* Return either TMPL or another template that it is equivalent to under DR
5292 1286: An alias that just changes the name of a template is equivalent to
5293 the other template. */
5296 get_underlying_template (tree tmpl
)
5298 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5299 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5301 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5302 if (TYPE_TEMPLATE_INFO (result
))
5304 tree sub
= TYPE_TI_TEMPLATE (result
);
5305 if (PRIMARY_TEMPLATE_P (sub
)
5306 && (num_innermost_template_parms (tmpl
)
5307 == num_innermost_template_parms (sub
)))
5309 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5310 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5311 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5313 /* The alias type is equivalent to the pattern of the
5314 underlying template, so strip the alias. */
5324 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5325 must be a function or a pointer-to-function type, as specified
5326 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5327 and check that the resulting function has external linkage. */
5330 convert_nontype_argument_function (tree type
, tree expr
,
5331 tsubst_flags_t complain
)
5335 linkage_kind linkage
;
5337 fn
= instantiate_type (type
, fns
, tf_none
);
5338 if (fn
== error_mark_node
)
5339 return error_mark_node
;
5342 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5343 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5344 if (BASELINK_P (fn_no_ptr
))
5345 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5347 /* [temp.arg.nontype]/1
5349 A template-argument for a non-type, non-template template-parameter
5352 -- the address of an object or function with external [C++11: or
5353 internal] linkage. */
5355 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5357 if (complain
& tf_error
)
5359 error ("%qE is not a valid template argument for type %qT",
5361 if (TYPE_PTR_P (type
))
5362 error ("it must be the address of a function with "
5363 "external linkage");
5365 error ("it must be the name of a function with "
5366 "external linkage");
5371 linkage
= decl_linkage (fn_no_ptr
);
5372 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5374 if (complain
& tf_error
)
5376 if (cxx_dialect
>= cxx11
)
5377 error ("%qE is not a valid template argument for type %qT "
5378 "because %qD has no linkage",
5379 expr
, type
, fn_no_ptr
);
5381 error ("%qE is not a valid template argument for type %qT "
5382 "because %qD does not have external linkage",
5383 expr
, type
, fn_no_ptr
);
5391 /* Subroutine of convert_nontype_argument.
5392 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5393 Emit an error otherwise. */
5396 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5397 tsubst_flags_t complain
)
5400 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5402 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5404 if (processing_template_decl
5405 && TREE_CODE (expr
) == ADDR_EXPR
5406 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5408 if (complain
& tf_error
)
5410 error ("%qE is not a valid template argument for type %qT",
5412 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5417 /* Returns TRUE iff the address of OP is value-dependent.
5419 14.6.2.4 [temp.dep.temp]:
5420 A non-integral non-type template-argument is dependent if its type is
5421 dependent or it has either of the following forms
5424 and contains a nested-name-specifier which specifies a class-name that
5425 names a dependent type.
5427 We generalize this to just say that the address of a member of a
5428 dependent class is value-dependent; the above doesn't cover the
5429 address of a static data member named with an unqualified-id. */
5432 has_value_dependent_address (tree op
)
5434 /* We could use get_inner_reference here, but there's no need;
5435 this is only relevant for template non-type arguments, which
5436 can only be expressed as &id-expression. */
5439 tree ctx
= CP_DECL_CONTEXT (op
);
5440 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5447 /* The next set of functions are used for providing helpful explanatory
5448 diagnostics for failed overload resolution. Their messages should be
5449 indented by two spaces for consistency with the messages in
5453 unify_success (bool /*explain_p*/)
5459 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5462 inform (input_location
,
5463 " couldn't deduce template parameter %qD", parm
);
5468 unify_invalid (bool /*explain_p*/)
5474 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5477 inform (input_location
,
5478 " types %qT and %qT have incompatible cv-qualifiers",
5484 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5487 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5492 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5495 inform (input_location
,
5496 " template parameter %qD is not a parameter pack, but "
5503 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5506 inform (input_location
,
5507 " template argument %qE does not match "
5508 "pointer-to-member constant %qE",
5514 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5517 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5522 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5525 inform (input_location
,
5526 " inconsistent parameter pack deduction with %qT and %qT",
5532 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5537 inform (input_location
,
5538 " deduced conflicting types for parameter %qT (%qT and %qT)",
5539 parm
, first
, second
);
5541 inform (input_location
,
5542 " deduced conflicting values for non-type parameter "
5543 "%qE (%qE and %qE)", parm
, first
, second
);
5549 unify_vla_arg (bool explain_p
, tree arg
)
5552 inform (input_location
,
5553 " variable-sized array type %qT is not "
5554 "a valid template argument",
5560 unify_method_type_error (bool explain_p
, tree arg
)
5563 inform (input_location
,
5564 " member function type %qT is not a valid template argument",
5570 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
5575 inform_n (input_location
, wanted
,
5576 " candidate expects at least %d argument, %d provided",
5577 " candidate expects at least %d arguments, %d provided",
5580 inform_n (input_location
, wanted
,
5581 " candidate expects %d argument, %d provided",
5582 " candidate expects %d arguments, %d provided",
5589 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5591 return unify_arity (explain_p
, have
, wanted
);
5595 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
5596 bool least_p
= false)
5598 return unify_arity (explain_p
, have
, wanted
, least_p
);
5602 unify_arg_conversion (bool explain_p
, tree to_type
,
5603 tree from_type
, tree arg
)
5606 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5607 " cannot convert %qE (type %qT) to type %qT",
5608 arg
, from_type
, to_type
);
5613 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5614 tree parm
, tree arg
)
5619 case tbr_ambiguous_baseclass
:
5620 inform (input_location
, " %qT is an ambiguous base class of %qT",
5624 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5631 unify_inconsistent_template_template_parameters (bool explain_p
)
5634 inform (input_location
,
5635 " template parameters of a template template argument are "
5636 "inconsistent with other deduced template arguments");
5641 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5644 inform (input_location
,
5645 " can't deduce a template for %qT from non-template type %qT",
5651 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5654 inform (input_location
,
5655 " template argument %qE does not match %qD", arg
, parm
);
5660 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5663 inform (input_location
,
5664 " could not resolve address from overloaded function %qE",
5669 /* Attempt to convert the non-type template parameter EXPR to the
5670 indicated TYPE. If the conversion is successful, return the
5671 converted value. If the conversion is unsuccessful, return
5672 NULL_TREE if we issued an error message, or error_mark_node if we
5673 did not. We issue error messages for out-and-out bad template
5674 parameters, but not simply because the conversion failed, since we
5675 might be just trying to do argument deduction. Both TYPE and EXPR
5676 must be non-dependent.
5678 The conversion follows the special rules described in
5679 [temp.arg.nontype], and it is much more strict than an implicit
5682 This function is called twice for each template argument (see
5683 lookup_template_class for a more accurate description of this
5684 problem). This means that we need to handle expressions which
5685 are not valid in a C++ source, but can be created from the
5686 first call (for instance, casts to perform conversions). These
5687 hacks can go away after we fix the double coercion problem. */
5690 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5694 /* Detect immediately string literals as invalid non-type argument.
5695 This special-case is not needed for correctness (we would easily
5696 catch this later), but only to provide better diagnostic for this
5697 common user mistake. As suggested by DR 100, we do not mention
5698 linkage issues in the diagnostic as this is not the point. */
5699 /* FIXME we're making this OK. */
5700 if (TREE_CODE (expr
) == STRING_CST
)
5702 if (complain
& tf_error
)
5703 error ("%qE is not a valid template argument for type %qT "
5704 "because string literals can never be used in this context",
5709 /* Add the ADDR_EXPR now for the benefit of
5710 value_dependent_expression_p. */
5711 if (TYPE_PTROBV_P (type
)
5712 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5714 expr
= decay_conversion (expr
, complain
);
5715 if (expr
== error_mark_node
)
5716 return error_mark_node
;
5719 /* If we are in a template, EXPR may be non-dependent, but still
5720 have a syntactic, rather than semantic, form. For example, EXPR
5721 might be a SCOPE_REF, rather than the VAR_DECL to which the
5722 SCOPE_REF refers. Preserving the qualifying scope is necessary
5723 so that access checking can be performed when the template is
5724 instantiated -- but here we need the resolved form so that we can
5725 convert the argument. */
5726 if (TYPE_REF_OBJ_P (type
)
5727 && has_value_dependent_address (expr
))
5728 /* If we want the address and it's value-dependent, don't fold. */;
5729 else if (!type_unknown_p (expr
))
5730 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5731 if (error_operand_p (expr
))
5732 return error_mark_node
;
5733 expr_type
= TREE_TYPE (expr
);
5734 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5735 expr
= mark_lvalue_use (expr
);
5737 expr
= mark_rvalue_use (expr
);
5739 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5740 to a non-type argument of "nullptr". */
5741 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5742 expr
= convert (type
, expr
);
5744 /* In C++11, integral or enumeration non-type template arguments can be
5745 arbitrary constant expressions. Pointer and pointer to
5746 member arguments can be general constant expressions that evaluate
5747 to a null value, but otherwise still need to be of a specific form. */
5748 if (cxx_dialect
>= cxx11
)
5750 if (TREE_CODE (expr
) == PTRMEM_CST
)
5751 /* A PTRMEM_CST is already constant, and a valid template
5752 argument for a parameter of pointer to member type, we just want
5753 to leave it in that form rather than lower it to a
5755 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5756 expr
= maybe_constant_value (expr
);
5757 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5759 tree folded
= maybe_constant_value (expr
);
5760 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5761 : null_member_pointer_value_p (folded
))
5766 /* HACK: Due to double coercion, we can get a
5767 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5768 which is the tree that we built on the first call (see
5769 below when coercing to reference to object or to reference to
5770 function). We just strip everything and get to the arg.
5771 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5773 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5775 tree probe_type
, probe
= expr
;
5776 if (REFERENCE_REF_P (probe
))
5777 probe
= TREE_OPERAND (probe
, 0);
5778 probe_type
= TREE_TYPE (probe
);
5779 if (TREE_CODE (probe
) == NOP_EXPR
)
5781 /* ??? Maybe we could use convert_from_reference here, but we
5782 would need to relax its constraints because the NOP_EXPR
5783 could actually change the type to something more cv-qualified,
5784 and this is not folded by convert_from_reference. */
5785 tree addr
= TREE_OPERAND (probe
, 0);
5786 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5787 && TREE_CODE (addr
) == ADDR_EXPR
5788 && TYPE_PTR_P (TREE_TYPE (addr
))
5789 && (same_type_ignoring_top_level_qualifiers_p
5790 (TREE_TYPE (probe_type
),
5791 TREE_TYPE (TREE_TYPE (addr
)))))
5793 expr
= TREE_OPERAND (addr
, 0);
5794 expr_type
= TREE_TYPE (probe_type
);
5799 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5800 parameter is a pointer to object, through decay and
5801 qualification conversion. Let's strip everything. */
5802 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5806 if (TREE_CODE (probe
) == ADDR_EXPR
5807 && TYPE_PTR_P (TREE_TYPE (probe
)))
5809 /* Skip the ADDR_EXPR only if it is part of the decay for
5810 an array. Otherwise, it is part of the original argument
5811 in the source code. */
5812 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5813 probe
= TREE_OPERAND (probe
, 0);
5815 expr_type
= TREE_TYPE (expr
);
5819 /* [temp.arg.nontype]/5, bullet 1
5821 For a non-type template-parameter of integral or enumeration type,
5822 integral promotions (_conv.prom_) and integral conversions
5823 (_conv.integral_) are applied. */
5824 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5826 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5827 t
= maybe_constant_value (t
);
5828 if (t
!= error_mark_node
)
5831 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5832 return error_mark_node
;
5834 /* Notice that there are constant expressions like '4 % 0' which
5835 do not fold into integer constants. */
5836 if (TREE_CODE (expr
) != INTEGER_CST
)
5838 if (complain
& tf_error
)
5840 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5841 if (processing_template_decl
5842 && !require_potential_constant_expression (expr
))
5844 expr
= cxx_constant_value (expr
);
5845 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5846 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
5847 "in template argument for type %qT ", type
);
5848 if (expr
== error_mark_node
)
5850 /* else cxx_constant_value complained but gave us
5851 a real constant, so go ahead. */
5852 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5858 /* Avoid typedef problems. */
5859 if (TREE_TYPE (expr
) != type
)
5860 expr
= fold_convert (type
, expr
);
5862 /* [temp.arg.nontype]/5, bullet 2
5864 For a non-type template-parameter of type pointer to object,
5865 qualification conversions (_conv.qual_) and the array-to-pointer
5866 conversion (_conv.array_) are applied. */
5867 else if (TYPE_PTROBV_P (type
))
5869 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5871 A template-argument for a non-type, non-template template-parameter
5872 shall be one of: [...]
5874 -- the name of a non-type template-parameter;
5875 -- the address of an object or function with external linkage, [...]
5876 expressed as "& id-expression" where the & is optional if the name
5877 refers to a function or array, or if the corresponding
5878 template-parameter is a reference.
5880 Here, we do not care about functions, as they are invalid anyway
5881 for a parameter of type pointer-to-object. */
5883 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5884 /* Non-type template parameters are OK. */
5886 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5887 /* Null pointer values are OK in C++11. */;
5888 else if (TREE_CODE (expr
) != ADDR_EXPR
5889 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5893 if (complain
& tf_error
)
5894 error ("%qD is not a valid template argument "
5895 "because %qD is a variable, not the address of "
5896 "a variable", expr
, expr
);
5899 if (POINTER_TYPE_P (expr_type
))
5901 if (complain
& tf_error
)
5902 error ("%qE is not a valid template argument for %qT "
5903 "because it is not the address of a variable",
5907 /* Other values, like integer constants, might be valid
5908 non-type arguments of some other type. */
5909 return error_mark_node
;
5915 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5916 ? TREE_OPERAND (expr
, 0) : expr
);
5919 if (complain
& tf_error
)
5920 error ("%qE is not a valid template argument of type %qT "
5921 "because %qE is not a variable", expr
, type
, decl
);
5924 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5926 if (complain
& tf_error
)
5927 error ("%qE is not a valid template argument of type %qT "
5928 "because %qD does not have external linkage",
5932 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
5934 if (complain
& tf_error
)
5935 error ("%qE is not a valid template argument of type %qT "
5936 "because %qD has no linkage", expr
, type
, decl
);
5941 expr
= decay_conversion (expr
, complain
);
5942 if (expr
== error_mark_node
)
5943 return error_mark_node
;
5945 expr
= perform_qualification_conversions (type
, expr
);
5946 if (expr
== error_mark_node
)
5947 return error_mark_node
;
5949 /* [temp.arg.nontype]/5, bullet 3
5951 For a non-type template-parameter of type reference to object, no
5952 conversions apply. The type referred to by the reference may be more
5953 cv-qualified than the (otherwise identical) type of the
5954 template-argument. The template-parameter is bound directly to the
5955 template-argument, which must be an lvalue. */
5956 else if (TYPE_REF_OBJ_P (type
))
5958 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5960 return error_mark_node
;
5962 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5964 if (complain
& tf_error
)
5965 error ("%qE is not a valid template argument for type %qT "
5966 "because of conflicts in cv-qualification", expr
, type
);
5970 if (!real_lvalue_p (expr
))
5972 if (complain
& tf_error
)
5973 error ("%qE is not a valid template argument for type %qT "
5974 "because it is not an lvalue", expr
, type
);
5978 /* [temp.arg.nontype]/1
5980 A template-argument for a non-type, non-template template-parameter
5981 shall be one of: [...]
5983 -- the address of an object or function with external linkage. */
5984 if (INDIRECT_REF_P (expr
)
5985 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5987 expr
= TREE_OPERAND (expr
, 0);
5990 if (complain
& tf_error
)
5991 error ("%q#D is not a valid template argument for type %qT "
5992 "because a reference variable does not have a constant "
5993 "address", expr
, type
);
6000 if (complain
& tf_error
)
6001 error ("%qE is not a valid template argument for type %qT "
6002 "because it is not an object with external linkage",
6007 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
6009 if (complain
& tf_error
)
6010 error ("%qE is not a valid template argument for type %qT "
6011 "because object %qD has not external linkage",
6016 expr
= build_nop (type
, build_address (expr
));
6018 /* [temp.arg.nontype]/5, bullet 4
6020 For a non-type template-parameter of type pointer to function, only
6021 the function-to-pointer conversion (_conv.func_) is applied. If the
6022 template-argument represents a set of overloaded functions (or a
6023 pointer to such), the matching function is selected from the set
6025 else if (TYPE_PTRFN_P (type
))
6027 /* If the argument is a template-id, we might not have enough
6028 context information to decay the pointer. */
6029 if (!type_unknown_p (expr_type
))
6031 expr
= decay_conversion (expr
, complain
);
6032 if (expr
== error_mark_node
)
6033 return error_mark_node
;
6036 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6037 /* Null pointer values are OK in C++11. */
6038 return perform_qualification_conversions (type
, expr
);
6040 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6041 if (!expr
|| expr
== error_mark_node
)
6044 /* [temp.arg.nontype]/5, bullet 5
6046 For a non-type template-parameter of type reference to function, no
6047 conversions apply. If the template-argument represents a set of
6048 overloaded functions, the matching function is selected from the set
6050 else if (TYPE_REFFN_P (type
))
6052 if (TREE_CODE (expr
) == ADDR_EXPR
)
6054 if (complain
& tf_error
)
6056 error ("%qE is not a valid template argument for type %qT "
6057 "because it is a pointer", expr
, type
);
6058 inform (input_location
, "try using %qE instead",
6059 TREE_OPERAND (expr
, 0));
6064 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6065 if (!expr
|| expr
== error_mark_node
)
6068 expr
= build_nop (type
, build_address (expr
));
6070 /* [temp.arg.nontype]/5, bullet 6
6072 For a non-type template-parameter of type pointer to member function,
6073 no conversions apply. If the template-argument represents a set of
6074 overloaded member functions, the matching member function is selected
6075 from the set (_over.over_). */
6076 else if (TYPE_PTRMEMFUNC_P (type
))
6078 expr
= instantiate_type (type
, expr
, tf_none
);
6079 if (expr
== error_mark_node
)
6080 return error_mark_node
;
6082 /* [temp.arg.nontype] bullet 1 says the pointer to member
6083 expression must be a pointer-to-member constant. */
6084 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6085 return error_mark_node
;
6087 /* There is no way to disable standard conversions in
6088 resolve_address_of_overloaded_function (called by
6089 instantiate_type). It is possible that the call succeeded by
6090 converting &B::I to &D::I (where B is a base of D), so we need
6091 to reject this conversion here.
6093 Actually, even if there was a way to disable standard conversions,
6094 it would still be better to reject them here so that we can
6095 provide a superior diagnostic. */
6096 if (!same_type_p (TREE_TYPE (expr
), type
))
6098 if (complain
& tf_error
)
6100 error ("%qE is not a valid template argument for type %qT "
6101 "because it is of type %qT", expr
, type
,
6103 /* If we are just one standard conversion off, explain. */
6104 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6105 inform (input_location
,
6106 "standard conversions are not allowed in this context");
6111 /* [temp.arg.nontype]/5, bullet 7
6113 For a non-type template-parameter of type pointer to data member,
6114 qualification conversions (_conv.qual_) are applied. */
6115 else if (TYPE_PTRDATAMEM_P (type
))
6117 /* [temp.arg.nontype] bullet 1 says the pointer to member
6118 expression must be a pointer-to-member constant. */
6119 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6120 return error_mark_node
;
6122 expr
= perform_qualification_conversions (type
, expr
);
6123 if (expr
== error_mark_node
)
6126 else if (NULLPTR_TYPE_P (type
))
6128 if (expr
!= nullptr_node
)
6130 if (complain
& tf_error
)
6131 error ("%qE is not a valid template argument for type %qT "
6132 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6137 /* A template non-type parameter must be one of the above. */
6141 /* Sanity check: did we actually convert the argument to the
6143 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6144 (type
, TREE_TYPE (expr
)));
6148 /* Subroutine of coerce_template_template_parms, which returns 1 if
6149 PARM_PARM and ARG_PARM match using the rule for the template
6150 parameters of template template parameters. Both PARM and ARG are
6151 template parameters; the rest of the arguments are the same as for
6152 coerce_template_template_parms.
6155 coerce_template_template_parm (tree parm
,
6157 tsubst_flags_t complain
,
6161 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6162 || parm
== NULL_TREE
|| error_operand_p (parm
))
6165 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6168 switch (TREE_CODE (parm
))
6171 /* We encounter instantiations of templates like
6172 template <template <template <class> class> class TT>
6175 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6176 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6178 if (!coerce_template_template_parms
6179 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6185 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6186 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6187 /* Argument is a parameter pack but parameter is not. */
6192 /* The tsubst call is used to handle cases such as
6194 template <int> class C {};
6195 template <class T, template <T> class TT> class D {};
6198 i.e. the parameter list of TT depends on earlier parameters. */
6199 if (!uses_template_parms (TREE_TYPE (arg
))
6201 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6205 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6206 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6207 /* Argument is a parameter pack but parameter is not. */
6220 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6221 template template parameters. Both PARM_PARMS and ARG_PARMS are
6222 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6225 Consider the example:
6226 template <class T> class A;
6227 template<template <class U> class TT> class B;
6229 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6230 the parameters to A, and OUTER_ARGS contains A. */
6233 coerce_template_template_parms (tree parm_parms
,
6235 tsubst_flags_t complain
,
6239 int nparms
, nargs
, i
;
6243 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6244 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6246 nparms
= TREE_VEC_LENGTH (parm_parms
);
6247 nargs
= TREE_VEC_LENGTH (arg_parms
);
6249 /* Determine whether we have a parameter pack at the end of the
6250 template template parameter's template parameter list. */
6251 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6253 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6255 if (error_operand_p (parm
))
6258 switch (TREE_CODE (parm
))
6262 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6267 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6277 && !(variadic_p
&& nargs
>= nparms
- 1))
6280 /* Check all of the template parameters except the parameter pack at
6281 the end (if any). */
6282 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6284 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6285 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6288 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6289 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6291 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6299 /* Check each of the template parameters in the template
6300 argument against the template parameter pack at the end of
6301 the template template parameter. */
6302 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6305 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6307 for (; i
< nargs
; ++i
)
6309 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6312 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6314 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6323 /* Verifies that the deduced template arguments (in TARGS) for the
6324 template template parameters (in TPARMS) represent valid bindings,
6325 by comparing the template parameter list of each template argument
6326 to the template parameter list of its corresponding template
6327 template parameter, in accordance with DR150. This
6328 routine can only be called after all template arguments have been
6329 deduced. It will return TRUE if all of the template template
6330 parameter bindings are okay, FALSE otherwise. */
6332 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6334 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6337 /* We're dealing with template parms in this process. */
6338 ++processing_template_decl
;
6340 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6342 for (i
= 0; i
< ntparms
; ++i
)
6344 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6345 tree targ
= TREE_VEC_ELT (targs
, i
);
6347 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6349 tree packed_args
= NULL_TREE
;
6352 if (ARGUMENT_PACK_P (targ
))
6354 /* Look inside the argument pack. */
6355 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6356 len
= TREE_VEC_LENGTH (packed_args
);
6359 for (idx
= 0; idx
< len
; ++idx
)
6361 tree targ_parms
= NULL_TREE
;
6364 /* Extract the next argument from the argument
6366 targ
= TREE_VEC_ELT (packed_args
, idx
);
6368 if (PACK_EXPANSION_P (targ
))
6369 /* Look at the pattern of the pack expansion. */
6370 targ
= PACK_EXPANSION_PATTERN (targ
);
6372 /* Extract the template parameters from the template
6374 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6375 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6376 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6377 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6379 /* Verify that we can coerce the template template
6380 parameters from the template argument to the template
6381 parameter. This requires an exact match. */
6383 && !coerce_template_template_parms
6384 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6399 --processing_template_decl
;
6403 /* Since type attributes aren't mangled, we need to strip them from
6404 template type arguments. */
6407 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6410 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6412 mv
= TYPE_MAIN_VARIANT (arg
);
6413 arg
= strip_typedefs (arg
);
6414 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6415 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6417 if (complain
& tf_warning
)
6418 warning (0, "ignoring attributes on template argument %qT", arg
);
6419 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6420 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6425 /* Convert the indicated template ARG as necessary to match the
6426 indicated template PARM. Returns the converted ARG, or
6427 error_mark_node if the conversion was unsuccessful. Error and
6428 warning messages are issued under control of COMPLAIN. This
6429 conversion is for the Ith parameter in the parameter list. ARGS is
6430 the full set of template arguments deduced so far. */
6433 convert_template_argument (tree parm
,
6436 tsubst_flags_t complain
,
6442 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6444 if (TREE_CODE (arg
) == TREE_LIST
6445 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6447 /* The template argument was the name of some
6448 member function. That's usually
6449 invalid, but static members are OK. In any
6450 case, grab the underlying fields/functions
6451 and issue an error later if required. */
6452 orig_arg
= TREE_VALUE (arg
);
6453 TREE_TYPE (arg
) = unknown_type_node
;
6458 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6459 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6460 || requires_tmpl_type
);
6462 /* When determining whether an argument pack expansion is a template,
6463 look at the pattern. */
6464 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6465 arg
= PACK_EXPANSION_PATTERN (arg
);
6467 /* Deal with an injected-class-name used as a template template arg. */
6468 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6470 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6471 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6473 if (cxx_dialect
>= cxx11
)
6474 /* OK under DR 1004. */;
6475 else if (complain
& tf_warning_or_error
)
6476 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6477 " used as template template argument", TYPE_NAME (arg
));
6478 else if (flag_pedantic_errors
)
6486 ((TREE_CODE (arg
) == TEMPLATE_DECL
6487 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6488 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6489 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6490 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6493 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6494 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6495 arg
= TYPE_STUB_DECL (arg
);
6497 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6499 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6500 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6502 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6504 if (complain
& tf_error
)
6505 error ("invalid use of destructor %qE as a type", orig_arg
);
6506 return error_mark_node
;
6509 permerror (input_location
,
6510 "to refer to a type member of a template parameter, "
6511 "use %<typename %E%>", orig_arg
);
6513 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6514 TREE_OPERAND (arg
, 1),
6520 if (is_type
!= requires_type
)
6524 if (complain
& tf_error
)
6526 error ("type/value mismatch at argument %d in template "
6527 "parameter list for %qD",
6530 inform (input_location
,
6531 " expected a constant of type %qT, got %qT",
6533 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6534 else if (requires_tmpl_type
)
6535 inform (input_location
,
6536 " expected a class template, got %qE", orig_arg
);
6538 inform (input_location
,
6539 " expected a type, got %qE", orig_arg
);
6542 return error_mark_node
;
6544 if (is_tmpl_type
^ requires_tmpl_type
)
6546 if (in_decl
&& (complain
& tf_error
))
6548 error ("type/value mismatch at argument %d in template "
6549 "parameter list for %qD",
6552 inform (input_location
,
6553 " expected a type, got %qT", DECL_NAME (arg
));
6555 inform (input_location
,
6556 " expected a class template, got %qT", orig_arg
);
6558 return error_mark_node
;
6563 if (requires_tmpl_type
)
6565 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6567 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6568 /* The number of argument required is not known yet.
6569 Just accept it for now. */
6570 val
= TREE_TYPE (arg
);
6573 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6576 /* Strip alias templates that are equivalent to another
6578 arg
= get_underlying_template (arg
);
6579 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6581 if (coerce_template_template_parms (parmparm
, argparm
,
6587 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6589 if (val
!= error_mark_node
)
6591 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6592 val
= TREE_TYPE (val
);
6593 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6594 val
= make_pack_expansion (val
);
6599 if (in_decl
&& (complain
& tf_error
))
6601 error ("type/value mismatch at argument %d in "
6602 "template parameter list for %qD",
6604 inform (input_location
,
6605 " expected a template of type %qD, got %qT",
6609 val
= error_mark_node
;
6615 /* We only form one instance of each template specialization.
6616 Therefore, if we use a non-canonical variant (i.e., a
6617 typedef), any future messages referring to the type will use
6618 the typedef, which is confusing if those future uses do not
6619 themselves also use the typedef. */
6621 val
= canonicalize_type_argument (val
, complain
);
6625 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6627 if (invalid_nontype_parm_type_p (t
, complain
))
6628 return error_mark_node
;
6630 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6632 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6636 /* Not sure if this is reachable, but it doesn't hurt
6638 error ("type mismatch in nontype parameter pack");
6639 val
= error_mark_node
;
6642 else if (!dependent_template_arg_p (orig_arg
)
6643 && !uses_template_parms (t
))
6644 /* We used to call digest_init here. However, digest_init
6645 will report errors, which we don't want when complain
6646 is zero. More importantly, digest_init will try too
6647 hard to convert things: for example, `0' should not be
6648 converted to pointer type at this point according to
6649 the standard. Accepting this is not merely an
6650 extension, since deciding whether or not these
6651 conversions can occur is part of determining which
6652 function template to call, or whether a given explicit
6653 argument specification is valid. */
6654 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6656 val
= strip_typedefs_expr (orig_arg
);
6658 if (val
== NULL_TREE
)
6659 val
= error_mark_node
;
6660 else if (val
== error_mark_node
&& (complain
& tf_error
))
6661 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6663 if (TREE_CODE (val
) == SCOPE_REF
)
6665 /* Strip typedefs from the SCOPE_REF. */
6666 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6667 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6669 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6670 QUALIFIED_NAME_IS_TEMPLATE (val
));
6677 /* Coerces the remaining template arguments in INNER_ARGS (from
6678 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6679 Returns the coerced argument pack. PARM_IDX is the position of this
6680 parameter in the template parameter list. ARGS is the original
6681 template argument list. */
6683 coerce_template_parameter_pack (tree parms
,
6691 tsubst_flags_t complain
)
6693 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6694 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6697 tree packed_parms
= NULL_TREE
;
6699 if (arg_idx
> nargs
)
6702 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6704 /* When the template parameter is a non-type template parameter pack
6705 or template template parameter pack whose type or template
6706 parameters use parameter packs, we know exactly how many arguments
6707 we are looking for. Build a vector of the instantiated decls for
6708 these template parameters in PACKED_PARMS. */
6709 /* We can't use make_pack_expansion here because it would interpret a
6710 _DECL as a use rather than a declaration. */
6711 tree decl
= TREE_VALUE (parm
);
6712 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6713 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6714 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6715 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6717 TREE_VEC_LENGTH (args
)--;
6718 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6719 TREE_VEC_LENGTH (args
)++;
6721 if (packed_parms
== error_mark_node
)
6722 return error_mark_node
;
6724 /* If we're doing a partial instantiation of a member template,
6725 verify that all of the types used for the non-type
6726 template parameter pack are, in fact, valid for non-type
6727 template parameters. */
6729 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6731 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6732 for (j
= 0; j
< len
; ++j
)
6734 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6735 if (invalid_nontype_parm_type_p (t
, complain
))
6736 return error_mark_node
;
6740 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6743 packed_args
= make_tree_vec (nargs
- arg_idx
);
6745 /* Convert the remaining arguments, which will be a part of the
6746 parameter pack "parm". */
6747 for (; arg_idx
< nargs
; ++arg_idx
)
6749 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6750 tree actual_parm
= TREE_VALUE (parm
);
6751 int pack_idx
= arg_idx
- parm_idx
;
6755 /* Once we've packed as many args as we have types, stop. */
6756 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6758 else if (PACK_EXPANSION_P (arg
))
6759 /* We don't know how many args we have yet, just
6760 use the unconverted ones for now. */
6763 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6766 if (arg
== error_mark_node
)
6768 if (complain
& tf_error
)
6769 error ("template argument %d is invalid", arg_idx
+ 1);
6772 arg
= convert_template_argument (actual_parm
,
6773 arg
, new_args
, complain
, parm_idx
,
6775 if (arg
== error_mark_node
)
6777 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6780 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6781 && TREE_VEC_LENGTH (packed_args
) > 0)
6783 if (complain
& tf_error
)
6784 error ("wrong number of template arguments (%d, should be %d)",
6785 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6786 return error_mark_node
;
6789 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6790 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6791 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6794 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6795 TREE_TYPE (argument_pack
)
6796 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6797 TREE_CONSTANT (argument_pack
) = 1;
6800 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6801 #ifdef ENABLE_CHECKING
6802 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6803 TREE_VEC_LENGTH (packed_args
));
6805 return argument_pack
;
6808 /* Returns the number of pack expansions in the template argument vector
6812 pack_expansion_args_count (tree args
)
6817 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6819 tree elt
= TREE_VEC_ELT (args
, i
);
6820 if (elt
&& PACK_EXPANSION_P (elt
))
6826 /* Convert all template arguments to their appropriate types, and
6827 return a vector containing the innermost resulting template
6828 arguments. If any error occurs, return error_mark_node. Error and
6829 warning messages are issued under control of COMPLAIN.
6831 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6832 for arguments not specified in ARGS. Otherwise, if
6833 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6834 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6835 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6839 coerce_template_parms (tree parms
,
6842 tsubst_flags_t complain
,
6843 bool require_all_args
,
6844 bool use_default_args
)
6846 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6847 tree orig_inner_args
;
6850 tree new_inner_args
;
6851 int saved_unevaluated_operand
;
6852 int saved_inhibit_evaluation_warnings
;
6854 /* When used as a boolean value, indicates whether this is a
6855 variadic template parameter list. Since it's an int, we can also
6856 subtract it from nparms to get the number of non-variadic
6859 int variadic_args_p
= 0;
6860 int post_variadic_parms
= 0;
6862 /* Likewise for parameters with default arguments. */
6865 if (args
== error_mark_node
)
6866 return error_mark_node
;
6868 nparms
= TREE_VEC_LENGTH (parms
);
6870 /* Determine if there are any parameter packs or default arguments. */
6871 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6873 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6875 ++post_variadic_parms
;
6876 if (template_parameter_pack_p (TREE_VALUE (parm
)))
6878 if (TREE_PURPOSE (parm
))
6882 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6883 /* If there are no parameters that follow a parameter pack, we need to
6884 expand any argument packs so that we can deduce a parameter pack from
6885 some non-packed args followed by an argument pack, as in variadic85.C.
6886 If there are such parameters, we need to leave argument packs intact
6887 so the arguments are assigned properly. This can happen when dealing
6888 with a nested class inside a partial specialization of a class
6889 template, as in variadic92.C, or when deducing a template parameter pack
6890 from a sub-declarator, as in variadic114.C. */
6891 if (!post_variadic_parms
)
6892 inner_args
= expand_template_argument_pack (inner_args
);
6894 /* Count any pack expansion args. */
6895 variadic_args_p
= pack_expansion_args_count (inner_args
);
6897 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6898 if ((nargs
> nparms
&& !variadic_p
)
6899 || (nargs
< nparms
- variadic_p
6902 && (!use_default_args
6903 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6904 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6906 if (complain
& tf_error
)
6908 if (variadic_p
|| default_p
)
6910 nparms
-= variadic_p
+ default_p
;
6911 error ("wrong number of template arguments "
6912 "(%d, should be at least %d)", nargs
, nparms
);
6915 error ("wrong number of template arguments "
6916 "(%d, should be %d)", nargs
, nparms
);
6919 inform (input_location
, "provided for %q+D", in_decl
);
6922 return error_mark_node
;
6924 /* We can't pass a pack expansion to a non-pack parameter of an alias
6925 template (DR 1430). */
6926 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
6928 && nargs
- variadic_args_p
< nparms
- variadic_p
)
6930 if (complain
& tf_error
)
6932 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
6934 tree arg
= TREE_VEC_ELT (inner_args
, i
);
6935 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6937 if (PACK_EXPANSION_P (arg
)
6938 && !template_parameter_pack_p (parm
))
6940 error ("pack expansion argument for non-pack parameter "
6941 "%qD of alias template %qD", parm
, in_decl
);
6942 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
6949 return error_mark_node
;
6952 /* We need to evaluate the template arguments, even though this
6953 template-id may be nested within a "sizeof". */
6954 saved_unevaluated_operand
= cp_unevaluated_operand
;
6955 cp_unevaluated_operand
= 0;
6956 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6957 c_inhibit_evaluation_warnings
= 0;
6958 new_inner_args
= make_tree_vec (nparms
);
6959 new_args
= add_outermost_template_args (args
, new_inner_args
);
6960 int pack_adjust
= 0;
6961 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6966 /* Get the Ith template parameter. */
6967 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6969 if (parm
== error_mark_node
)
6971 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6975 /* Calculate the next argument. */
6976 if (arg_idx
< nargs
)
6977 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6981 if (template_parameter_pack_p (TREE_VALUE (parm
))
6982 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6984 /* Some arguments will be placed in the
6985 template parameter pack PARM. */
6986 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6987 inner_args
, arg_idx
,
6991 if (arg
== NULL_TREE
)
6993 /* We don't know how many args we have yet, just use the
6994 unconverted (and still packed) ones for now. */
6995 new_inner_args
= orig_inner_args
;
7000 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7002 /* Store this argument. */
7003 if (arg
== error_mark_node
)
7006 /* We are done with all of the arguments. */
7011 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7012 arg_idx
+= pack_adjust
;
7019 if (PACK_EXPANSION_P (arg
))
7021 /* "If every valid specialization of a variadic template
7022 requires an empty template parameter pack, the template is
7023 ill-formed, no diagnostic required." So check that the
7024 pattern works with this parameter. */
7025 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7026 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7030 if (conv
== error_mark_node
)
7032 inform (input_location
, "so any instantiation with a "
7033 "non-empty parameter pack would be ill-formed");
7036 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7037 /* Recover from missing typename. */
7038 TREE_VEC_ELT (inner_args
, arg_idx
)
7039 = make_pack_expansion (conv
);
7041 /* We don't know how many args we have yet, just
7042 use the unconverted ones for now. */
7043 new_inner_args
= inner_args
;
7048 else if (require_all_args
)
7050 /* There must be a default arg in this case. */
7051 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7053 /* The position of the first default template argument,
7054 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7056 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7057 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7058 arg_idx
- pack_adjust
);
7063 if (arg
== error_mark_node
)
7065 if (complain
& tf_error
)
7066 error ("template argument %d is invalid", arg_idx
+ 1);
7069 /* This only occurs if there was an error in the template
7070 parameter list itself (which we would already have
7071 reported) that we are trying to recover from, e.g., a class
7072 template with a parameter list such as
7073 template<typename..., typename>. */
7076 arg
= convert_template_argument (TREE_VALUE (parm
),
7077 arg
, new_args
, complain
,
7080 if (arg
== error_mark_node
)
7082 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7084 cp_unevaluated_operand
= saved_unevaluated_operand
;
7085 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7087 if (variadic_p
&& arg_idx
< nargs
)
7089 if (complain
& tf_error
)
7091 error ("wrong number of template arguments "
7092 "(%d, should be %d)", nargs
, arg_idx
);
7094 error ("provided for %q+D", in_decl
);
7096 return error_mark_node
;
7100 return error_mark_node
;
7102 #ifdef ENABLE_CHECKING
7103 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7104 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7105 TREE_VEC_LENGTH (new_inner_args
));
7108 return new_inner_args
;
7111 /* Like coerce_template_parms. If PARMS represents all template
7112 parameters levels, this function returns a vector of vectors
7113 representing all the resulting argument levels. Note that in this
7114 case, only the innermost arguments are coerced because the
7115 outermost ones are supposed to have been coerced already.
7117 Otherwise, if PARMS represents only (the innermost) vector of
7118 parameters, this function returns a vector containing just the
7119 innermost resulting arguments. */
7122 coerce_innermost_template_parms (tree parms
,
7125 tsubst_flags_t complain
,
7126 bool require_all_args
,
7127 bool use_default_args
)
7129 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7130 int args_depth
= TMPL_ARGS_DEPTH (args
);
7133 if (parms_depth
> 1)
7135 coerced_args
= make_tree_vec (parms_depth
);
7139 for (level
= parms
, cur_depth
= parms_depth
;
7140 parms_depth
> 0 && level
!= NULL_TREE
;
7141 level
= TREE_CHAIN (level
), --cur_depth
)
7144 if (cur_depth
== args_depth
)
7145 l
= coerce_template_parms (TREE_VALUE (level
),
7146 args
, in_decl
, complain
,
7150 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7152 if (l
== error_mark_node
)
7153 return error_mark_node
;
7155 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7159 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7160 args
, in_decl
, complain
,
7163 return coerced_args
;
7166 /* Returns 1 if template args OT and NT are equivalent. */
7169 template_args_equal (tree ot
, tree nt
)
7173 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7176 if (TREE_CODE (nt
) == TREE_VEC
)
7177 /* For member templates */
7178 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7179 else if (PACK_EXPANSION_P (ot
))
7180 return (PACK_EXPANSION_P (nt
)
7181 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7182 PACK_EXPANSION_PATTERN (nt
))
7183 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7184 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7185 else if (ARGUMENT_PACK_P (ot
))
7190 if (!ARGUMENT_PACK_P (nt
))
7193 opack
= ARGUMENT_PACK_ARGS (ot
);
7194 npack
= ARGUMENT_PACK_ARGS (nt
);
7195 len
= TREE_VEC_LENGTH (opack
);
7196 if (TREE_VEC_LENGTH (npack
) != len
)
7198 for (i
= 0; i
< len
; ++i
)
7199 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7200 TREE_VEC_ELT (npack
, i
)))
7204 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7206 /* We get here probably because we are in the middle of substituting
7207 into the pattern of a pack expansion. In that case the
7208 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7209 interested in. So we want to use the initial pack argument for
7211 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7212 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7213 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7214 return template_args_equal (ot
, nt
);
7216 else if (TYPE_P (nt
))
7217 return TYPE_P (ot
) && same_type_p (ot
, nt
);
7218 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7221 return cp_tree_equal (ot
, nt
);
7224 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7225 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7226 NEWARG_PTR with the offending arguments if they are non-NULL. */
7229 comp_template_args_with_info (tree oldargs
, tree newargs
,
7230 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7234 if (oldargs
== newargs
)
7237 if (!oldargs
|| !newargs
)
7240 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7243 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7245 tree nt
= TREE_VEC_ELT (newargs
, i
);
7246 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7248 if (! template_args_equal (ot
, nt
))
7250 if (oldarg_ptr
!= NULL
)
7252 if (newarg_ptr
!= NULL
)
7260 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7261 of template arguments. Returns 0 otherwise. */
7264 comp_template_args (tree oldargs
, tree newargs
)
7266 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7270 add_pending_template (tree d
)
7272 tree ti
= (TYPE_P (d
)
7273 ? CLASSTYPE_TEMPLATE_INFO (d
)
7274 : DECL_TEMPLATE_INFO (d
));
7275 struct pending_template
*pt
;
7278 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7281 /* We are called both from instantiate_decl, where we've already had a
7282 tinst_level pushed, and instantiate_template, where we haven't.
7284 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7287 push_tinst_level (d
);
7289 pt
= ggc_alloc
<pending_template
> ();
7291 pt
->tinst
= current_tinst_level
;
7292 if (last_pending_template
)
7293 last_pending_template
->next
= pt
;
7295 pending_templates
= pt
;
7297 last_pending_template
= pt
;
7299 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7306 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7307 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7308 documentation for TEMPLATE_ID_EXPR. */
7311 lookup_template_function (tree fns
, tree arglist
)
7315 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7316 return error_mark_node
;
7318 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7320 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7322 error ("%q#D is not a function template", fns
);
7323 return error_mark_node
;
7326 if (BASELINK_P (fns
))
7328 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7330 BASELINK_FUNCTIONS (fns
),
7335 type
= TREE_TYPE (fns
);
7336 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7337 type
= unknown_type_node
;
7339 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7342 /* Within the scope of a template class S<T>, the name S gets bound
7343 (in build_self_reference) to a TYPE_DECL for the class, not a
7344 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7345 or one of its enclosing classes, and that type is a template,
7346 return the associated TEMPLATE_DECL. Otherwise, the original
7349 Also handle the case when DECL is a TREE_LIST of ambiguous
7350 injected-class-names from different bases. */
7353 maybe_get_template_decl_from_type_decl (tree decl
)
7355 if (decl
== NULL_TREE
)
7358 /* DR 176: A lookup that finds an injected-class-name (10.2
7359 [class.member.lookup]) can result in an ambiguity in certain cases
7360 (for example, if it is found in more than one base class). If all of
7361 the injected-class-names that are found refer to specializations of
7362 the same class template, and if the name is followed by a
7363 template-argument-list, the reference refers to the class template
7364 itself and not a specialization thereof, and is not ambiguous. */
7365 if (TREE_CODE (decl
) == TREE_LIST
)
7367 tree t
, tmpl
= NULL_TREE
;
7368 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7370 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7373 else if (tmpl
!= elt
)
7376 if (tmpl
&& t
== NULL_TREE
)
7382 return (decl
!= NULL_TREE
7383 && DECL_SELF_REFERENCE_P (decl
)
7384 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7385 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7388 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7389 parameters, find the desired type.
7391 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7393 IN_DECL, if non-NULL, is the template declaration we are trying to
7396 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7397 the class we are looking up.
7399 Issue error and warning messages under control of COMPLAIN.
7401 If the template class is really a local class in a template
7402 function, then the FUNCTION_CONTEXT is the function in which it is
7405 ??? Note that this function is currently called *twice* for each
7406 template-id: the first time from the parser, while creating the
7407 incomplete type (finish_template_type), and the second type during the
7408 real instantiation (instantiate_template_class). This is surely something
7409 that we want to avoid. It also causes some problems with argument
7410 coercion (see convert_nontype_argument for more information on this). */
7413 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7414 int entering_scope
, tsubst_flags_t complain
)
7416 tree templ
= NULL_TREE
, parmlist
;
7423 if (identifier_p (d1
))
7425 tree value
= innermost_non_namespace_value (d1
);
7426 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7431 push_decl_namespace (context
);
7432 templ
= lookup_name (d1
);
7433 templ
= maybe_get_template_decl_from_type_decl (templ
);
7435 pop_decl_namespace ();
7438 context
= DECL_CONTEXT (templ
);
7440 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7442 tree type
= TREE_TYPE (d1
);
7444 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7445 an implicit typename for the second A. Deal with it. */
7446 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7447 type
= TREE_TYPE (type
);
7449 if (CLASSTYPE_TEMPLATE_INFO (type
))
7451 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7452 d1
= DECL_NAME (templ
);
7455 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7456 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7458 templ
= TYPE_TI_TEMPLATE (d1
);
7459 d1
= DECL_NAME (templ
);
7461 else if (DECL_TYPE_TEMPLATE_P (d1
))
7464 d1
= DECL_NAME (templ
);
7465 context
= DECL_CONTEXT (templ
);
7467 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7470 d1
= DECL_NAME (templ
);
7473 /* Issue an error message if we didn't find a template. */
7476 if (complain
& tf_error
)
7477 error ("%qT is not a template", d1
);
7478 return error_mark_node
;
7481 if (TREE_CODE (templ
) != TEMPLATE_DECL
7482 /* Make sure it's a user visible template, if it was named by
7484 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7485 && !PRIMARY_TEMPLATE_P (templ
)))
7487 if (complain
& tf_error
)
7489 error ("non-template type %qT used as a template", d1
);
7491 error ("for template declaration %q+D", in_decl
);
7493 return error_mark_node
;
7496 complain
&= ~tf_user
;
7498 /* An alias that just changes the name of a template is equivalent to the
7499 other template, so if any of the arguments are pack expansions, strip
7500 the alias to avoid problems with a pack expansion passed to a non-pack
7501 alias template parameter (DR 1430). */
7502 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7503 templ
= get_underlying_template (templ
);
7505 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7507 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7508 template arguments */
7514 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7516 /* Consider an example where a template template parameter declared as
7518 template <class T, class U = std::allocator<T> > class TT
7520 The template parameter level of T and U are one level larger than
7521 of TT. To proper process the default argument of U, say when an
7522 instantiation `TT<int>' is seen, we need to build the full
7523 arguments containing {int} as the innermost level. Outer levels,
7524 available when not appearing as default template argument, can be
7525 obtained from the arguments of the enclosing template.
7527 Suppose that TT is later substituted with std::vector. The above
7528 instantiation is `TT<int, std::allocator<T> >' with TT at
7529 level 1, and T at level 2, while the template arguments at level 1
7530 becomes {std::vector} and the inner level 2 is {int}. */
7532 outer
= DECL_CONTEXT (templ
);
7534 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7535 else if (current_template_parms
)
7536 /* This is an argument of the current template, so we haven't set
7537 DECL_CONTEXT yet. */
7538 outer
= current_template_args ();
7541 arglist
= add_to_template_args (outer
, arglist
);
7543 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7545 /*require_all_args=*/true,
7546 /*use_default_args=*/true);
7547 if (arglist2
== error_mark_node
7548 || (!uses_template_parms (arglist2
)
7549 && check_instantiated_args (templ
, arglist2
, complain
)))
7550 return error_mark_node
;
7552 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7557 tree template_type
= TREE_TYPE (templ
);
7560 tree found
= NULL_TREE
;
7563 int is_dependent_type
;
7564 int use_partial_inst_tmpl
= false;
7566 if (template_type
== error_mark_node
)
7567 /* An error occurred while building the template TEMPL, and a
7568 diagnostic has most certainly been emitted for that
7569 already. Let's propagate that error. */
7570 return error_mark_node
;
7572 gen_tmpl
= most_general_template (templ
);
7573 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7574 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7575 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7577 if (arg_depth
== 1 && parm_depth
> 1)
7579 /* We've been given an incomplete set of template arguments.
7582 template <class T> struct S1 {
7583 template <class U> struct S2 {};
7584 template <class U> struct S2<U*> {};
7587 we will be called with an ARGLIST of `U*', but the
7588 TEMPLATE will be `template <class T> template
7589 <class U> struct S1<T>::S2'. We must fill in the missing
7592 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7594 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7597 /* Now we should have enough arguments. */
7598 gcc_assert (parm_depth
== arg_depth
);
7600 /* From here on, we're only interested in the most general
7603 /* Calculate the BOUND_ARGS. These will be the args that are
7604 actually tsubst'd into the definition to create the
7608 /* We have multiple levels of arguments to coerce, at once. */
7610 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7612 tree bound_args
= make_tree_vec (parm_depth
);
7614 for (i
= saved_depth
,
7615 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7616 i
> 0 && t
!= NULL_TREE
;
7617 --i
, t
= TREE_CHAIN (t
))
7620 if (i
== saved_depth
)
7621 a
= coerce_template_parms (TREE_VALUE (t
),
7624 /*require_all_args=*/true,
7625 /*use_default_args=*/true);
7627 /* Outer levels should have already been coerced. */
7628 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7630 /* Don't process further if one of the levels fails. */
7631 if (a
== error_mark_node
)
7633 /* Restore the ARGLIST to its full size. */
7634 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7635 return error_mark_node
;
7638 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7640 /* We temporarily reduce the length of the ARGLIST so
7641 that coerce_template_parms will see only the arguments
7642 corresponding to the template parameters it is
7644 TREE_VEC_LENGTH (arglist
)--;
7647 /* Restore the ARGLIST to its full size. */
7648 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7650 arglist
= bound_args
;
7654 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7655 INNERMOST_TEMPLATE_ARGS (arglist
),
7658 /*require_all_args=*/true,
7659 /*use_default_args=*/true);
7661 if (arglist
== error_mark_node
)
7662 /* We were unable to bind the arguments. */
7663 return error_mark_node
;
7665 /* In the scope of a template class, explicit references to the
7666 template class refer to the type of the template, not any
7667 instantiation of it. For example, in:
7669 template <class T> class C { void f(C<T>); }
7671 the `C<T>' is just the same as `C'. Outside of the
7672 class, however, such a reference is an instantiation. */
7674 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7675 || currently_open_class (template_type
))
7676 /* comp_template_args is expensive, check it last. */
7677 && comp_template_args (TYPE_TI_ARGS (template_type
),
7679 return template_type
;
7681 /* If we already have this specialization, return it. */
7682 elt
.tmpl
= gen_tmpl
;
7684 hash
= hash_specialization (&elt
);
7685 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7691 is_dependent_type
= uses_template_parms (arglist
);
7693 /* If the deduced arguments are invalid, then the binding
7695 if (!is_dependent_type
7696 && check_instantiated_args (gen_tmpl
,
7697 INNERMOST_TEMPLATE_ARGS (arglist
),
7699 return error_mark_node
;
7701 if (!is_dependent_type
7702 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7703 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7704 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7706 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7707 DECL_NAME (gen_tmpl
),
7708 /*tag_scope=*/ts_global
);
7712 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7714 if (context
== error_mark_node
)
7715 return error_mark_node
;
7718 context
= global_namespace
;
7720 /* Create the type. */
7721 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7723 /* The user referred to a specialization of an alias
7724 template represented by GEN_TMPL.
7726 [temp.alias]/2 says:
7728 When a template-id refers to the specialization of an
7729 alias template, it is equivalent to the associated
7730 type obtained by substitution of its
7731 template-arguments for the template-parameters in the
7732 type-id of the alias template. */
7734 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7735 /* Note that the call above (by indirectly calling
7736 register_specialization in tsubst_decl) registers the
7737 TYPE_DECL representing the specialization of the alias
7738 template. So next time someone substitutes ARGLIST for
7739 the template parms into the alias template (GEN_TMPL),
7740 she'll get that TYPE_DECL back. */
7742 if (t
== error_mark_node
)
7745 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7747 if (!is_dependent_type
)
7749 set_current_access_from_decl (TYPE_NAME (template_type
));
7750 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7751 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7752 arglist
, complain
, in_decl
),
7753 SCOPED_ENUM_P (template_type
), NULL
);
7755 if (t
== error_mark_node
)
7760 /* We don't want to call start_enum for this type, since
7761 the values for the enumeration constants may involve
7762 template parameters. And, no one should be interested
7763 in the enumeration constants for such a type. */
7764 t
= cxx_make_type (ENUMERAL_TYPE
);
7765 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7767 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7768 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7769 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7771 else if (CLASS_TYPE_P (template_type
))
7773 t
= make_class_type (TREE_CODE (template_type
));
7774 CLASSTYPE_DECLARED_CLASS (t
)
7775 = CLASSTYPE_DECLARED_CLASS (template_type
);
7776 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7777 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7779 /* A local class. Make sure the decl gets registered properly. */
7780 if (context
== current_function_decl
)
7781 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7783 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7784 /* This instantiation is another name for the primary
7785 template type. Set the TYPE_CANONICAL field
7787 TYPE_CANONICAL (t
) = template_type
;
7788 else if (any_template_arguments_need_structural_equality_p (arglist
))
7789 /* Some of the template arguments require structural
7790 equality testing, so this template class requires
7791 structural equality testing. */
7792 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7797 /* If we called start_enum or pushtag above, this information
7798 will already be set up. */
7801 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7803 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7804 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7805 DECL_SOURCE_LOCATION (type_decl
)
7806 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7809 type_decl
= TYPE_NAME (t
);
7811 if (CLASS_TYPE_P (template_type
))
7813 TREE_PRIVATE (type_decl
)
7814 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7815 TREE_PROTECTED (type_decl
)
7816 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7817 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7819 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7820 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7824 if (OVERLOAD_TYPE_P (t
)
7825 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7828 = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (template_type
)))
7830 if (!TREE_CHAIN (attributes
))
7831 TYPE_ATTRIBUTES (t
) = attributes
;
7834 = build_tree_list (TREE_PURPOSE (attributes
),
7835 TREE_VALUE (attributes
));
7839 /* Let's consider the explicit specialization of a member
7840 of a class template specialization that is implicitly instantiated,
7845 template<class U> struct M {}; //#0
7850 struct S<int>::M<char> //#1
7854 [temp.expl.spec]/4 says this is valid.
7856 In this case, when we write:
7859 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7862 When we encounter #1, we want to store the partial instantiation
7863 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7865 For all cases other than this "explicit specialization of member of a
7866 class template", we just want to store the most general template into
7867 the CLASSTYPE_TI_TEMPLATE of M.
7869 This case of "explicit specialization of member of a class template"
7871 1/ the enclosing class is an instantiation of, and therefore not
7872 the same as, the context of the most general template, and
7873 2/ we aren't looking at the partial instantiation itself, i.e.
7874 the innermost arguments are not the same as the innermost parms of
7875 the most general template.
7877 So it's only when 1/ and 2/ happens that we want to use the partial
7878 instantiation of the member template in lieu of its most general
7881 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7882 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7883 /* the enclosing class must be an instantiation... */
7884 && CLASS_TYPE_P (context
)
7885 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7887 tree partial_inst_args
;
7888 TREE_VEC_LENGTH (arglist
)--;
7889 ++processing_template_decl
;
7891 tsubst (INNERMOST_TEMPLATE_ARGS
7892 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7893 arglist
, complain
, NULL_TREE
);
7894 --processing_template_decl
;
7895 TREE_VEC_LENGTH (arglist
)++;
7896 use_partial_inst_tmpl
=
7897 /*...and we must not be looking at the partial instantiation
7899 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7903 if (!use_partial_inst_tmpl
)
7904 /* This case is easy; there are no member templates involved. */
7908 /* This is a full instantiation of a member template. Find
7909 the partial instantiation of which this is an instance. */
7911 /* Temporarily reduce by one the number of levels in the ARGLIST
7912 so as to avoid comparing the last set of arguments. */
7913 TREE_VEC_LENGTH (arglist
)--;
7914 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7915 TREE_VEC_LENGTH (arglist
)++;
7916 /* FOUND is either a proper class type, or an alias
7917 template specialization. In the later case, it's a
7918 TYPE_DECL, resulting from the substituting of arguments
7919 for parameters in the TYPE_DECL of the alias template
7920 done earlier. So be careful while getting the template
7922 found
= TREE_CODE (found
) == TYPE_DECL
7923 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7924 : CLASSTYPE_TI_TEMPLATE (found
);
7927 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7930 slot
= htab_find_slot_with_hash (type_specializations
,
7931 &elt
, hash
, INSERT
);
7932 entry
= ggc_alloc
<spec_entry
> ();
7936 /* Note this use of the partial instantiation so we can check it
7937 later in maybe_process_partial_specialization. */
7938 DECL_TEMPLATE_INSTANTIATIONS (found
)
7939 = tree_cons (arglist
, t
,
7940 DECL_TEMPLATE_INSTANTIATIONS (found
));
7942 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
7943 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7944 /* Now that the type has been registered on the instantiations
7945 list, we set up the enumerators. Because the enumeration
7946 constants may involve the enumeration type itself, we make
7947 sure to register the type first, and then create the
7948 constants. That way, doing tsubst_expr for the enumeration
7949 constants won't result in recursive calls here; we'll find
7950 the instantiation and exit above. */
7951 tsubst_enum (template_type
, t
, arglist
);
7953 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7954 /* If the type makes use of template parameters, the
7955 code that generates debugging information will crash. */
7956 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
7958 /* Possibly limit visibility based on template args. */
7959 TREE_PUBLIC (type_decl
) = 1;
7960 determine_visibility (type_decl
);
7962 inherit_targ_abi_tags (t
);
7968 /* Wrapper for lookup_template_class_1. */
7971 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7972 int entering_scope
, tsubst_flags_t complain
)
7975 timevar_push (TV_TEMPLATE_INST
);
7976 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7977 entering_scope
, complain
);
7978 timevar_pop (TV_TEMPLATE_INST
);
7982 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST.
7983 If the ARGLIST refers to any template parameters, the type of the
7984 expression is the unknown_type_node since the template-id could
7985 refer to an explicit or partial specialization. */
7988 lookup_template_variable (tree templ
, tree arglist
)
7991 if (uses_template_parms (arglist
))
7992 type
= unknown_type_node
;
7994 type
= TREE_TYPE (templ
);
7995 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8003 /* True when we should also visit template parameters that occur in
8004 non-deduced contexts. */
8005 bool include_nondeduced_p
;
8006 hash_set
<tree
> *visited
;
8009 /* Called from for_each_template_parm via walk_tree. */
8012 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8015 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8016 tree_fn_t fn
= pfd
->fn
;
8017 void *data
= pfd
->data
;
8020 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8021 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8022 pfd
->include_nondeduced_p
))
8023 return error_mark_node
;
8025 switch (TREE_CODE (t
))
8028 if (TYPE_PTRMEMFUNC_P (t
))
8034 if (!TYPE_TEMPLATE_INFO (t
))
8036 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8037 fn
, data
, pfd
->visited
,
8038 pfd
->include_nondeduced_p
))
8039 return error_mark_node
;
8043 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8044 fn
, data
, pfd
->visited
,
8045 pfd
->include_nondeduced_p
)
8046 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8047 fn
, data
, pfd
->visited
,
8048 pfd
->include_nondeduced_p
))
8049 return error_mark_node
;
8053 /* Since we're not going to walk subtrees, we have to do this
8055 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8056 pfd
->visited
, pfd
->include_nondeduced_p
))
8057 return error_mark_node
;
8061 /* Check the return type. */
8062 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8063 pfd
->include_nondeduced_p
))
8064 return error_mark_node
;
8066 /* Check the parameter types. Since default arguments are not
8067 instantiated until they are needed, the TYPE_ARG_TYPES may
8068 contain expressions that involve template parameters. But,
8069 no-one should be looking at them yet. And, once they're
8070 instantiated, they don't contain template parameters, so
8071 there's no point in looking at them then, either. */
8075 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8076 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8077 pfd
->visited
, pfd
->include_nondeduced_p
))
8078 return error_mark_node
;
8080 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8081 want walk_tree walking into them itself. */
8087 case UNDERLYING_TYPE
:
8088 if (pfd
->include_nondeduced_p
8089 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
8091 pfd
->include_nondeduced_p
))
8092 return error_mark_node
;
8097 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8098 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8099 pfd
->visited
, pfd
->include_nondeduced_p
))
8100 return error_mark_node
;
8105 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8106 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8107 pfd
->visited
, pfd
->include_nondeduced_p
))
8108 return error_mark_node
;
8109 if (DECL_CONTEXT (t
)
8110 && pfd
->include_nondeduced_p
8111 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8112 pfd
->visited
, pfd
->include_nondeduced_p
))
8113 return error_mark_node
;
8116 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8117 /* Record template parameters such as `T' inside `TT<T>'. */
8118 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8119 pfd
->include_nondeduced_p
))
8120 return error_mark_node
;
8123 case TEMPLATE_TEMPLATE_PARM
:
8124 case TEMPLATE_TYPE_PARM
:
8125 case TEMPLATE_PARM_INDEX
:
8126 if (fn
&& (*fn
)(t
, data
))
8127 return error_mark_node
;
8129 return error_mark_node
;
8133 /* A template template parameter is encountered. */
8134 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8135 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8136 pfd
->include_nondeduced_p
))
8137 return error_mark_node
;
8139 /* Already substituted template template parameter */
8145 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8147 pfd
->include_nondeduced_p
))
8148 return error_mark_node
;
8152 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8153 && pfd
->include_nondeduced_p
8154 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8155 (TREE_TYPE (t
)), fn
, data
,
8156 pfd
->visited
, pfd
->include_nondeduced_p
))
8157 return error_mark_node
;
8162 /* If there's no type, then this thing must be some expression
8163 involving template parameters. */
8164 if (!fn
&& !TREE_TYPE (t
))
8165 return error_mark_node
;
8170 case IMPLICIT_CONV_EXPR
:
8171 case REINTERPRET_CAST_EXPR
:
8172 case CONST_CAST_EXPR
:
8173 case STATIC_CAST_EXPR
:
8174 case DYNAMIC_CAST_EXPR
:
8178 case PSEUDO_DTOR_EXPR
:
8180 return error_mark_node
;
8187 /* We didn't find any template parameters we liked. */
8191 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8192 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8193 call FN with the parameter and the DATA.
8194 If FN returns nonzero, the iteration is terminated, and
8195 for_each_template_parm returns 1. Otherwise, the iteration
8196 continues. If FN never returns a nonzero value, the value
8197 returned by for_each_template_parm is 0. If FN is NULL, it is
8198 considered to be the function which always returns 1.
8200 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8201 parameters that occur in non-deduced contexts. When false, only
8202 visits those template parameters that can be deduced. */
8205 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8206 hash_set
<tree
> *visited
,
8207 bool include_nondeduced_p
)
8209 struct pair_fn_data pfd
;
8215 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8217 /* Walk the tree. (Conceptually, we would like to walk without
8218 duplicates, but for_each_template_parm_r recursively calls
8219 for_each_template_parm, so we would need to reorganize a fair
8220 bit to use walk_tree_without_duplicates, so we keep our own
8223 pfd
.visited
= visited
;
8225 pfd
.visited
= new hash_set
<tree
>;
8226 result
= cp_walk_tree (&t
,
8227 for_each_template_parm_r
,
8229 pfd
.visited
) != NULL_TREE
;
8241 /* Returns true if T depends on any template parameter. */
8244 uses_template_parms (tree t
)
8247 int saved_processing_template_decl
;
8249 saved_processing_template_decl
= processing_template_decl
;
8250 if (!saved_processing_template_decl
)
8251 processing_template_decl
= 1;
8253 dependent_p
= dependent_type_p (t
);
8254 else if (TREE_CODE (t
) == TREE_VEC
)
8255 dependent_p
= any_dependent_template_arguments_p (t
);
8256 else if (TREE_CODE (t
) == TREE_LIST
)
8257 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8258 || uses_template_parms (TREE_CHAIN (t
)));
8259 else if (TREE_CODE (t
) == TYPE_DECL
)
8260 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8263 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8264 || TREE_CODE (t
) == OVERLOAD
8267 || TREE_CODE (t
) == TRAIT_EXPR
8268 || TREE_CODE (t
) == CONSTRUCTOR
8269 || CONSTANT_CLASS_P (t
))
8270 dependent_p
= (type_dependent_expression_p (t
)
8271 || value_dependent_expression_p (t
));
8274 gcc_assert (t
== error_mark_node
);
8275 dependent_p
= false;
8278 processing_template_decl
= saved_processing_template_decl
;
8283 /* Returns true iff current_function_decl is an incompletely instantiated
8284 template. Useful instead of processing_template_decl because the latter
8285 is set to 0 during fold_non_dependent_expr. */
8288 in_template_function (void)
8290 tree fn
= current_function_decl
;
8292 ++processing_template_decl
;
8293 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8294 && DECL_TEMPLATE_INFO (fn
)
8295 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8296 --processing_template_decl
;
8300 /* Returns true if T depends on any template parameter with level LEVEL. */
8303 uses_template_parms_level (tree t
, int level
)
8305 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8306 /*include_nondeduced_p=*/true);
8309 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8310 ill-formed translation unit, i.e. a variable or function that isn't
8311 usable in a constant expression. */
8314 neglectable_inst_p (tree d
)
8317 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8318 : decl_maybe_constant_var_p (d
)));
8321 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8322 neglectable and instantiated from within an erroneous instantiation. */
8325 limit_bad_template_recursion (tree decl
)
8327 struct tinst_level
*lev
= current_tinst_level
;
8328 int errs
= errorcount
+ sorrycount
;
8329 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8332 for (; lev
; lev
= lev
->next
)
8333 if (neglectable_inst_p (lev
->decl
))
8336 return (lev
&& errs
> lev
->errors
);
8339 static int tinst_depth
;
8340 extern int max_tinst_depth
;
8343 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8345 /* We're starting to instantiate D; record the template instantiation context
8346 for diagnostics and to restore it later. */
8349 push_tinst_level (tree d
)
8351 struct tinst_level
*new_level
;
8353 if (tinst_depth
>= max_tinst_depth
)
8355 last_error_tinst_level
= current_tinst_level
;
8356 if (TREE_CODE (d
) == TREE_LIST
)
8357 error ("template instantiation depth exceeds maximum of %d (use "
8358 "-ftemplate-depth= to increase the maximum) substituting %qS",
8359 max_tinst_depth
, d
);
8361 error ("template instantiation depth exceeds maximum of %d (use "
8362 "-ftemplate-depth= to increase the maximum) instantiating %qD",
8363 max_tinst_depth
, d
);
8365 print_instantiation_context ();
8370 /* If the current instantiation caused problems, don't let it instantiate
8371 anything else. Do allow deduction substitution and decls usable in
8372 constant expressions. */
8373 if (limit_bad_template_recursion (d
))
8376 new_level
= ggc_alloc
<tinst_level
> ();
8377 new_level
->decl
= d
;
8378 new_level
->locus
= input_location
;
8379 new_level
->errors
= errorcount
+sorrycount
;
8380 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8381 new_level
->next
= current_tinst_level
;
8382 current_tinst_level
= new_level
;
8385 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8386 depth_reached
= tinst_depth
;
8391 /* We're done instantiating this template; return to the instantiation
8395 pop_tinst_level (void)
8397 /* Restore the filename and line number stashed away when we started
8398 this instantiation. */
8399 input_location
= current_tinst_level
->locus
;
8400 current_tinst_level
= current_tinst_level
->next
;
8404 /* We're instantiating a deferred template; restore the template
8405 instantiation context in which the instantiation was requested, which
8406 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8409 reopen_tinst_level (struct tinst_level
*level
)
8411 struct tinst_level
*t
;
8414 for (t
= level
; t
; t
= t
->next
)
8417 current_tinst_level
= level
;
8419 if (current_tinst_level
)
8420 current_tinst_level
->errors
= errorcount
+sorrycount
;
8424 /* Returns the TINST_LEVEL which gives the original instantiation
8427 struct tinst_level
*
8428 outermost_tinst_level (void)
8430 struct tinst_level
*level
= current_tinst_level
;
8433 level
= level
->next
;
8437 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8438 vector of template arguments, as for tsubst.
8440 Returns an appropriate tsubst'd friend declaration. */
8443 tsubst_friend_function (tree decl
, tree args
)
8447 if (TREE_CODE (decl
) == FUNCTION_DECL
8448 && DECL_TEMPLATE_INSTANTIATION (decl
)
8449 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8450 /* This was a friend declared with an explicit template
8451 argument list, e.g.:
8455 to indicate that f was a template instantiation, not a new
8456 function declaration. Now, we have to figure out what
8457 instantiation of what template. */
8459 tree template_id
, arglist
, fns
;
8462 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8464 /* Friend functions are looked up in the containing namespace scope.
8465 We must enter that scope, to avoid finding member functions of the
8466 current class with same name. */
8467 push_nested_namespace (ns
);
8468 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8469 tf_warning_or_error
, NULL_TREE
,
8470 /*integral_constant_expression_p=*/false);
8471 pop_nested_namespace (ns
);
8472 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8473 tf_warning_or_error
, NULL_TREE
);
8474 template_id
= lookup_template_function (fns
, arglist
);
8476 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8477 tmpl
= determine_specialization (template_id
, new_friend
,
8479 /*need_member_template=*/0,
8480 TREE_VEC_LENGTH (args
),
8482 return instantiate_template (tmpl
, new_args
, tf_error
);
8485 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8487 /* The NEW_FRIEND will look like an instantiation, to the
8488 compiler, but is not an instantiation from the point of view of
8489 the language. For example, we might have had:
8491 template <class T> struct S {
8492 template <class U> friend void f(T, U);
8495 Then, in S<int>, template <class U> void f(int, U) is not an
8496 instantiation of anything. */
8497 if (new_friend
== error_mark_node
)
8498 return error_mark_node
;
8500 DECL_USE_TEMPLATE (new_friend
) = 0;
8501 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8503 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8504 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8505 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8508 /* The mangled name for the NEW_FRIEND is incorrect. The function
8509 is not a template instantiation and should not be mangled like
8510 one. Therefore, we forget the mangling here; we'll recompute it
8511 later if we need it. */
8512 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8514 SET_DECL_RTL (new_friend
, NULL
);
8515 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8518 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8521 tree new_friend_template_info
;
8522 tree new_friend_result_template_info
;
8524 int new_friend_is_defn
;
8526 /* We must save some information from NEW_FRIEND before calling
8527 duplicate decls since that function will free NEW_FRIEND if
8529 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8530 new_friend_is_defn
=
8531 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8532 (template_for_substitution (new_friend
)))
8534 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8536 /* This declaration is a `primary' template. */
8537 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8539 new_friend_result_template_info
8540 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8543 new_friend_result_template_info
= NULL_TREE
;
8545 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8546 if (new_friend_is_defn
)
8547 DECL_INITIAL (new_friend
) = error_mark_node
;
8549 /* Inside pushdecl_namespace_level, we will push into the
8550 current namespace. However, the friend function should go
8551 into the namespace of the template. */
8552 ns
= decl_namespace_context (new_friend
);
8553 push_nested_namespace (ns
);
8554 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8555 pop_nested_namespace (ns
);
8557 if (old_decl
== error_mark_node
)
8558 return error_mark_node
;
8560 if (old_decl
!= new_friend
)
8562 /* This new friend declaration matched an existing
8563 declaration. For example, given:
8565 template <class T> void f(T);
8566 template <class U> class C {
8567 template <class T> friend void f(T) {}
8570 the friend declaration actually provides the definition
8571 of `f', once C has been instantiated for some type. So,
8572 old_decl will be the out-of-class template declaration,
8573 while new_friend is the in-class definition.
8575 But, if `f' was called before this point, the
8576 instantiation of `f' will have DECL_TI_ARGS corresponding
8577 to `T' but not to `U', references to which might appear
8578 in the definition of `f'. Previously, the most general
8579 template for an instantiation of `f' was the out-of-class
8580 version; now it is the in-class version. Therefore, we
8581 run through all specialization of `f', adding to their
8582 DECL_TI_ARGS appropriately. In particular, they need a
8583 new set of outer arguments, corresponding to the
8584 arguments for this class instantiation.
8586 The same situation can arise with something like this:
8589 template <class T> class C {
8593 when `C<int>' is instantiated. Now, `f(int)' is defined
8596 if (!new_friend_is_defn
)
8597 /* On the other hand, if the in-class declaration does
8598 *not* provide a definition, then we don't want to alter
8599 existing definitions. We can just leave everything
8604 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8605 tree new_args
= TI_ARGS (new_friend_template_info
);
8607 /* Overwrite whatever template info was there before, if
8608 any, with the new template information pertaining to
8610 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8612 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8614 /* We should have called reregister_specialization in
8616 gcc_assert (retrieve_specialization (new_template
,
8620 /* Instantiate it if the global has already been used. */
8621 if (DECL_ODR_USED (old_decl
))
8622 instantiate_decl (old_decl
, /*defer_ok=*/true,
8623 /*expl_inst_class_mem_p=*/false);
8629 /* Indicate that the old function template is a partial
8631 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8632 = new_friend_result_template_info
;
8634 gcc_assert (new_template
8635 == most_general_template (new_template
));
8636 gcc_assert (new_template
!= old_decl
);
8638 /* Reassign any specializations already in the hash table
8639 to the new more general template, and add the
8640 additional template args. */
8641 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8645 tree spec
= TREE_VALUE (t
);
8648 elt
.tmpl
= old_decl
;
8649 elt
.args
= DECL_TI_ARGS (spec
);
8650 elt
.spec
= NULL_TREE
;
8652 htab_remove_elt (decl_specializations
, &elt
);
8655 = add_outermost_template_args (new_args
,
8656 DECL_TI_ARGS (spec
));
8658 register_specialization
8659 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8662 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8666 /* The information from NEW_FRIEND has been merged into OLD_DECL
8667 by duplicate_decls. */
8668 new_friend
= old_decl
;
8673 tree context
= DECL_CONTEXT (new_friend
);
8677 template <class T> class C {
8678 template <class U> friend void C1<U>::f (); // case 1
8679 friend void C2<T>::f (); // case 2
8681 we only need to make sure CONTEXT is a complete type for
8682 case 2. To distinguish between the two cases, we note that
8683 CONTEXT of case 1 remains dependent type after tsubst while
8684 this isn't true for case 2. */
8685 ++processing_template_decl
;
8686 dependent_p
= dependent_type_p (context
);
8687 --processing_template_decl
;
8690 && !complete_type_or_else (context
, NULL_TREE
))
8691 return error_mark_node
;
8693 if (COMPLETE_TYPE_P (context
))
8695 tree fn
= new_friend
;
8696 /* do_friend adds the TEMPLATE_DECL for any member friend
8697 template even if it isn't a member template, i.e.
8698 template <class T> friend A<T>::f();
8699 Look through it in that case. */
8700 if (TREE_CODE (fn
) == TEMPLATE_DECL
8701 && !PRIMARY_TEMPLATE_P (fn
))
8702 fn
= DECL_TEMPLATE_RESULT (fn
);
8703 /* Check to see that the declaration is really present, and,
8704 possibly obtain an improved declaration. */
8705 fn
= check_classfn (context
, fn
, NULL_TREE
);
8715 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8716 template arguments, as for tsubst.
8718 Returns an appropriate tsubst'd friend type or error_mark_node on
8722 tsubst_friend_class (tree friend_tmpl
, tree args
)
8728 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8730 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8731 return TREE_TYPE (t
);
8734 context
= CP_DECL_CONTEXT (friend_tmpl
);
8736 if (context
!= global_namespace
)
8738 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8739 push_nested_namespace (context
);
8741 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8744 /* Look for a class template declaration. We look for hidden names
8745 because two friend declarations of the same template are the
8746 same. For example, in:
8749 template <typename> friend class F;
8751 template <typename> struct B {
8752 template <typename> friend class F;
8755 both F templates are the same. */
8756 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8757 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8759 /* But, if we don't find one, it might be because we're in a
8760 situation like this:
8768 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8769 for `S<int>', not the TEMPLATE_DECL. */
8770 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8772 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8773 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8776 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8778 /* The friend template has already been declared. Just
8779 check to see that the declarations match, and install any new
8780 default parameters. We must tsubst the default parameters,
8781 of course. We only need the innermost template parameters
8782 because that is all that redeclare_class_template will look
8784 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8785 > TMPL_ARGS_DEPTH (args
))
8788 location_t saved_input_location
;
8789 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8790 args
, tf_warning_or_error
);
8792 saved_input_location
= input_location
;
8793 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8794 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8795 input_location
= saved_input_location
;
8799 friend_type
= TREE_TYPE (tmpl
);
8803 /* The friend template has not already been declared. In this
8804 case, the instantiation of the template class will cause the
8805 injection of this template into the global scope. */
8806 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8807 if (tmpl
== error_mark_node
)
8808 return error_mark_node
;
8810 /* The new TMPL is not an instantiation of anything, so we
8811 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8812 the new type because that is supposed to be the corresponding
8813 template decl, i.e., TMPL. */
8814 DECL_USE_TEMPLATE (tmpl
) = 0;
8815 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8816 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8817 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8818 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8820 /* Inject this template into the global scope. */
8821 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8824 if (context
!= global_namespace
)
8826 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8827 pop_nested_namespace (context
);
8829 pop_nested_class ();
8835 /* Returns zero if TYPE cannot be completed later due to circularity.
8836 Otherwise returns one. */
8839 can_complete_type_without_circularity (tree type
)
8841 if (type
== NULL_TREE
|| type
== error_mark_node
)
8843 else if (COMPLETE_TYPE_P (type
))
8845 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8846 return can_complete_type_without_circularity (TREE_TYPE (type
));
8847 else if (CLASS_TYPE_P (type
)
8848 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8854 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
8856 /* Apply any attributes which had to be deferred until instantiation
8857 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8858 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8861 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8862 tree args
, tsubst_flags_t complain
, tree in_decl
)
8864 tree last_dep
= NULL_TREE
;
8868 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8869 if (ATTR_IS_DEPENDENT (t
))
8872 attributes
= copy_list (attributes
);
8876 if (DECL_P (*decl_p
))
8878 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8880 p
= &DECL_ATTRIBUTES (*decl_p
);
8883 p
= &TYPE_ATTRIBUTES (*decl_p
);
8887 tree late_attrs
= NULL_TREE
;
8888 tree
*q
= &late_attrs
;
8890 for (*p
= attributes
; *p
; )
8893 if (ATTR_IS_DEPENDENT (t
))
8895 *p
= TREE_CHAIN (t
);
8896 TREE_CHAIN (t
) = NULL_TREE
;
8897 if ((flag_openmp
|| flag_cilkplus
)
8898 && is_attribute_p ("omp declare simd",
8899 get_attribute_name (t
))
8902 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
8903 clauses
= tsubst_omp_clauses (clauses
, true, args
,
8905 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
8906 clauses
= finish_omp_clauses (clauses
);
8907 tree parms
= DECL_ARGUMENTS (*decl_p
);
8909 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
8911 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
8913 TREE_VALUE (t
) = NULL_TREE
;
8915 /* If the first attribute argument is an identifier, don't
8916 pass it through tsubst. Attributes like mode, format,
8917 cleanup and several target specific attributes expect it
8919 else if (attribute_takes_identifier_p (get_attribute_name (t
))
8923 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8925 /*integral_constant_expression_p=*/false);
8926 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8928 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8933 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8934 /*integral_constant_expression_p=*/false);
8936 q
= &TREE_CHAIN (t
);
8939 p
= &TREE_CHAIN (t
);
8942 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8946 /* Perform (or defer) access check for typedefs that were referenced
8947 from within the template TMPL code.
8948 This is a subroutine of instantiate_decl and instantiate_class_template.
8949 TMPL is the template to consider and TARGS is the list of arguments of
8953 perform_typedefs_access_check (tree tmpl
, tree targs
)
8955 location_t saved_location
;
8957 qualified_typedef_usage_t
*iter
;
8960 || (!CLASS_TYPE_P (tmpl
)
8961 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8964 saved_location
= input_location
;
8965 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8967 tree type_decl
= iter
->typedef_decl
;
8968 tree type_scope
= iter
->context
;
8970 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8973 if (uses_template_parms (type_decl
))
8974 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8975 if (uses_template_parms (type_scope
))
8976 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8978 /* Make access check error messages point to the location
8979 of the use of the typedef. */
8980 input_location
= iter
->locus
;
8981 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8982 type_decl
, type_decl
,
8983 tf_warning_or_error
);
8985 input_location
= saved_location
;
8989 instantiate_class_template_1 (tree type
)
8991 tree templ
, args
, pattern
, t
, member
;
8995 unsigned int saved_maximum_field_alignment
;
8998 if (type
== error_mark_node
)
8999 return error_mark_node
;
9001 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9002 || uses_template_parms (type
))
9005 /* Figure out which template is being instantiated. */
9006 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9007 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9009 /* Determine what specialization of the original template to
9011 t
= most_specialized_class (type
, tf_warning_or_error
);
9012 if (t
== error_mark_node
)
9014 TYPE_BEING_DEFINED (type
) = 1;
9015 return error_mark_node
;
9019 /* This TYPE is actually an instantiation of a partial
9020 specialization. We replace the innermost set of ARGS with
9021 the arguments appropriate for substitution. For example,
9024 template <class T> struct S {};
9025 template <class T> struct S<T*> {};
9027 and supposing that we are instantiating S<int*>, ARGS will
9028 presently be {int*} -- but we need {int}. */
9029 pattern
= TREE_TYPE (t
);
9030 args
= TREE_PURPOSE (t
);
9034 pattern
= TREE_TYPE (templ
);
9035 args
= CLASSTYPE_TI_ARGS (type
);
9038 /* If the template we're instantiating is incomplete, then clearly
9039 there's nothing we can do. */
9040 if (!COMPLETE_TYPE_P (pattern
))
9043 /* If we've recursively instantiated too many templates, stop. */
9044 if (! push_tinst_level (type
))
9047 /* Now we're really doing the instantiation. Mark the type as in
9048 the process of being defined. */
9049 TYPE_BEING_DEFINED (type
) = 1;
9051 /* We may be in the middle of deferred access check. Disable
9053 push_deferring_access_checks (dk_no_deferred
);
9055 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9056 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9057 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9058 fn_context
= error_mark_node
;
9060 push_to_top_level ();
9061 /* Use #pragma pack from the template context. */
9062 saved_maximum_field_alignment
= maximum_field_alignment
;
9063 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9065 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9067 /* Set the input location to the most specialized template definition.
9068 This is needed if tsubsting causes an error. */
9069 typedecl
= TYPE_MAIN_DECL (pattern
);
9070 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9071 DECL_SOURCE_LOCATION (typedecl
);
9073 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9074 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9075 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9076 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9077 if (ANON_AGGR_TYPE_P (pattern
))
9078 SET_ANON_AGGR_TYPE_P (type
);
9079 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9081 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9082 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9083 /* Adjust visibility for template arguments. */
9084 determine_visibility (TYPE_MAIN_DECL (type
));
9086 if (CLASS_TYPE_P (type
))
9087 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9089 pbinfo
= TYPE_BINFO (pattern
);
9091 /* We should never instantiate a nested class before its enclosing
9092 class; we need to look up the nested class by name before we can
9093 instantiate it, and that lookup should instantiate the enclosing
9095 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9096 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9098 base_list
= NULL_TREE
;
9099 if (BINFO_N_BASE_BINFOS (pbinfo
))
9105 /* We must enter the scope containing the type, as that is where
9106 the accessibility of types named in dependent bases are
9108 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9110 /* Substitute into each of the bases to determine the actual
9112 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9115 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9116 tree expanded_bases
= NULL_TREE
;
9119 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9122 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9123 args
, tf_error
, NULL_TREE
);
9124 if (expanded_bases
== error_mark_node
)
9127 len
= TREE_VEC_LENGTH (expanded_bases
);
9130 for (idx
= 0; idx
< len
; idx
++)
9133 /* Extract the already-expanded base class. */
9134 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9136 /* Substitute to figure out the base class. */
9137 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9140 if (base
== error_mark_node
)
9143 base_list
= tree_cons (access
, base
, base_list
);
9144 if (BINFO_VIRTUAL_P (pbase_binfo
))
9145 TREE_TYPE (base_list
) = integer_type_node
;
9149 /* The list is now in reverse order; correct that. */
9150 base_list
= nreverse (base_list
);
9153 pop_scope (pushed_scope
);
9155 /* Now call xref_basetypes to set up all the base-class
9157 xref_basetypes (type
, base_list
);
9159 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9160 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9161 args
, tf_error
, NULL_TREE
);
9162 fixup_attribute_variants (type
);
9164 /* Now that our base classes are set up, enter the scope of the
9165 class, so that name lookups into base classes, etc. will work
9166 correctly. This is precisely analogous to what we do in
9167 begin_class_definition when defining an ordinary non-template
9168 class, except we also need to push the enclosing classes. */
9169 push_nested_class (type
);
9171 /* Now members are processed in the order of declaration. */
9172 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9173 member
; member
= TREE_CHAIN (member
))
9175 tree t
= TREE_VALUE (member
);
9177 if (TREE_PURPOSE (member
))
9181 /* Build new CLASSTYPE_NESTED_UTDS. */
9184 bool class_template_p
;
9186 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9187 && TYPE_LANG_SPECIFIC (t
)
9188 && CLASSTYPE_IS_TEMPLATE (t
));
9189 /* If the member is a class template, then -- even after
9190 substitution -- there may be dependent types in the
9191 template argument list for the class. We increment
9192 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9193 that function will assume that no types are dependent
9194 when outside of a template. */
9195 if (class_template_p
)
9196 ++processing_template_decl
;
9197 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9198 if (class_template_p
)
9199 --processing_template_decl
;
9200 if (newtag
== error_mark_node
)
9203 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9205 tree name
= TYPE_IDENTIFIER (t
);
9207 if (class_template_p
)
9208 /* Unfortunately, lookup_template_class sets
9209 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9210 instantiation (i.e., for the type of a member
9211 template class nested within a template class.)
9212 This behavior is required for
9213 maybe_process_partial_specialization to work
9214 correctly, but is not accurate in this case;
9215 the TAG is not an instantiation of anything.
9216 (The corresponding TEMPLATE_DECL is an
9217 instantiation, but the TYPE is not.) */
9218 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9220 /* Now, we call pushtag to put this NEWTAG into the scope of
9221 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9222 pushtag calling push_template_decl. We don't have to do
9223 this for enums because it will already have been done in
9226 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9227 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9230 else if (DECL_DECLARES_FUNCTION_P (t
))
9232 /* Build new TYPE_METHODS. */
9235 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9236 ++processing_template_decl
;
9237 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9238 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9239 --processing_template_decl
;
9240 set_current_access_from_decl (r
);
9241 finish_member_declaration (r
);
9242 /* Instantiate members marked with attribute used. */
9243 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9245 if (TREE_CODE (r
) == FUNCTION_DECL
9246 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9247 cp_check_omp_declare_reduction (r
);
9249 else if (DECL_CLASS_TEMPLATE_P (t
)
9250 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9251 /* A closure type for a lambda in a default argument for a
9252 member template. Ignore it; it will be instantiated with
9253 the default argument. */;
9256 /* Build new TYPE_FIELDS. */
9257 if (TREE_CODE (t
) == STATIC_ASSERT
)
9261 ++c_inhibit_evaluation_warnings
;
9263 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9264 tf_warning_or_error
, NULL_TREE
,
9265 /*integral_constant_expression_p=*/true);
9266 --c_inhibit_evaluation_warnings
;
9268 finish_static_assert (condition
,
9269 STATIC_ASSERT_MESSAGE (t
),
9270 STATIC_ASSERT_SOURCE_LOCATION (t
),
9273 else if (TREE_CODE (t
) != CONST_DECL
)
9276 tree vec
= NULL_TREE
;
9279 /* The file and line for this declaration, to
9280 assist in error message reporting. Since we
9281 called push_tinst_level above, we don't need to
9283 input_location
= DECL_SOURCE_LOCATION (t
);
9285 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9286 ++processing_template_decl
;
9287 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9288 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9289 --processing_template_decl
;
9291 if (TREE_CODE (r
) == TREE_VEC
)
9293 /* A capture pack became multiple fields. */
9295 len
= TREE_VEC_LENGTH (vec
);
9298 for (int i
= 0; i
< len
; ++i
)
9301 r
= TREE_VEC_ELT (vec
, i
);
9306 [t]he initialization (and any associated
9307 side-effects) of a static data member does
9308 not occur unless the static data member is
9309 itself used in a way that requires the
9310 definition of the static data member to
9313 Therefore, we do not substitute into the
9314 initialized for the static data member here. */
9315 finish_static_data_member_decl
9318 /*init_const_expr_p=*/false,
9319 /*asmspec_tree=*/NULL_TREE
,
9321 /* Instantiate members marked with attribute used. */
9322 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9325 else if (TREE_CODE (r
) == FIELD_DECL
)
9327 /* Determine whether R has a valid type and can be
9328 completed later. If R is invalid, then its type
9329 is replaced by error_mark_node. */
9330 tree rtype
= TREE_TYPE (r
);
9331 if (can_complete_type_without_circularity (rtype
))
9332 complete_type (rtype
);
9334 if (!COMPLETE_TYPE_P (rtype
))
9336 cxx_incomplete_type_error (r
, rtype
);
9337 TREE_TYPE (r
) = error_mark_node
;
9341 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9342 such a thing will already have been added to the field
9343 list by tsubst_enum in finish_member_declaration in the
9344 CLASSTYPE_NESTED_UTDS case above. */
9345 if (!(TREE_CODE (r
) == TYPE_DECL
9346 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9347 && DECL_ARTIFICIAL (r
)))
9349 set_current_access_from_decl (r
);
9350 finish_member_declaration (r
);
9358 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9359 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9361 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9363 tree friend_type
= t
;
9364 bool adjust_processing_template_decl
= false;
9366 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9368 /* template <class T> friend class C; */
9369 friend_type
= tsubst_friend_class (friend_type
, args
);
9370 adjust_processing_template_decl
= true;
9372 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9374 /* template <class T> friend class C::D; */
9375 friend_type
= tsubst (friend_type
, args
,
9376 tf_warning_or_error
, NULL_TREE
);
9377 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9378 friend_type
= TREE_TYPE (friend_type
);
9379 adjust_processing_template_decl
= true;
9381 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9382 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9384 /* This could be either
9388 when dependent_type_p is false or
9390 template <class U> friend class T::C;
9393 friend_type
= tsubst (friend_type
, args
,
9394 tf_warning_or_error
, NULL_TREE
);
9395 /* Bump processing_template_decl for correct
9396 dependent_type_p calculation. */
9397 ++processing_template_decl
;
9398 if (dependent_type_p (friend_type
))
9399 adjust_processing_template_decl
= true;
9400 --processing_template_decl
;
9402 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9403 && hidden_name_p (TYPE_NAME (friend_type
)))
9407 where C hasn't been declared yet. Let's lookup name
9408 from namespace scope directly, bypassing any name that
9409 come from dependent base class. */
9410 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9412 /* The call to xref_tag_from_type does injection for friend
9414 push_nested_namespace (ns
);
9416 xref_tag_from_type (friend_type
, NULL_TREE
,
9417 /*tag_scope=*/ts_current
);
9418 pop_nested_namespace (ns
);
9420 else if (uses_template_parms (friend_type
))
9421 /* friend class C<T>; */
9422 friend_type
= tsubst (friend_type
, args
,
9423 tf_warning_or_error
, NULL_TREE
);
9428 where C is already declared or
9430 friend class C<int>;
9432 We don't have to do anything in these cases. */
9434 if (adjust_processing_template_decl
)
9435 /* Trick make_friend_class into realizing that the friend
9436 we're adding is a template, not an ordinary class. It's
9437 important that we use make_friend_class since it will
9438 perform some error-checking and output cross-reference
9440 ++processing_template_decl
;
9442 if (friend_type
!= error_mark_node
)
9443 make_friend_class (type
, friend_type
, /*complain=*/false);
9445 if (adjust_processing_template_decl
)
9446 --processing_template_decl
;
9450 /* Build new DECL_FRIENDLIST. */
9453 /* The file and line for this declaration, to
9454 assist in error message reporting. Since we
9455 called push_tinst_level above, we don't need to
9457 input_location
= DECL_SOURCE_LOCATION (t
);
9459 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9461 ++processing_template_decl
;
9462 push_deferring_access_checks (dk_no_check
);
9465 r
= tsubst_friend_function (t
, args
);
9466 add_friend (type
, r
, /*complain=*/false);
9467 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9469 pop_deferring_access_checks ();
9470 --processing_template_decl
;
9476 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9478 tree decl
= lambda_function (type
);
9481 if (!DECL_TEMPLATE_INFO (decl
)
9482 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9483 instantiate_decl (decl
, false, false);
9485 /* We need to instantiate the capture list from the template
9486 after we've instantiated the closure members, but before we
9487 consider adding the conversion op. Also keep any captures
9488 that may have been added during instantiation of the op(). */
9489 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9491 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9492 args
, tf_warning_or_error
, NULL_TREE
,
9495 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9496 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9498 maybe_add_lambda_conv_op (type
);
9501 gcc_assert (errorcount
);
9504 /* Set the file and line number information to whatever is given for
9505 the class itself. This puts error messages involving generated
9506 implicit functions at a predictable point, and the same point
9507 that would be used for non-template classes. */
9508 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9510 unreverse_member_declarations (type
);
9511 finish_struct_1 (type
);
9512 TYPE_BEING_DEFINED (type
) = 0;
9514 /* We don't instantiate default arguments for member functions. 14.7.1:
9516 The implicit instantiation of a class template specialization causes
9517 the implicit instantiation of the declarations, but not of the
9518 definitions or default arguments, of the class member functions,
9519 member classes, static data members and member templates.... */
9521 /* Some typedefs referenced from within the template code need to be access
9522 checked at template instantiation time, i.e now. These types were
9523 added to the template at parsing time. Let's get those and perform
9524 the access checks then. */
9525 perform_typedefs_access_check (pattern
, args
);
9526 perform_deferred_access_checks (tf_warning_or_error
);
9527 pop_nested_class ();
9528 maximum_field_alignment
= saved_maximum_field_alignment
;
9530 pop_from_top_level ();
9531 pop_deferring_access_checks ();
9534 /* The vtable for a template class can be emitted in any translation
9535 unit in which the class is instantiated. When there is no key
9536 method, however, finish_struct_1 will already have added TYPE to
9537 the keyed_classes list. */
9538 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9539 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9544 /* Wrapper for instantiate_class_template_1. */
9547 instantiate_class_template (tree type
)
9550 timevar_push (TV_TEMPLATE_INST
);
9551 ret
= instantiate_class_template_1 (type
);
9552 timevar_pop (TV_TEMPLATE_INST
);
9557 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9563 else if (TYPE_P (t
))
9564 r
= tsubst (t
, args
, complain
, in_decl
);
9567 if (!(complain
& tf_warning
))
9568 ++c_inhibit_evaluation_warnings
;
9569 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9570 /*integral_constant_expression_p=*/true);
9571 if (!(complain
& tf_warning
))
9572 --c_inhibit_evaluation_warnings
;
9577 /* Given a function parameter pack TMPL_PARM and some function parameters
9578 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9579 and set *SPEC_P to point at the next point in the list. */
9582 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9584 /* Collect all of the extra "packed" parameters into an
9588 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9589 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9590 tree spec_parm
= *spec_p
;
9593 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9595 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9598 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9599 parmvec
= make_tree_vec (len
);
9600 parmtypevec
= make_tree_vec (len
);
9601 spec_parm
= *spec_p
;
9602 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9604 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9605 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9608 /* Build the argument packs. */
9609 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9610 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9611 TREE_TYPE (argpack
) = argtypepack
;
9612 *spec_p
= spec_parm
;
9617 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9618 NONTYPE_ARGUMENT_PACK. */
9621 make_fnparm_pack (tree spec_parm
)
9623 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9626 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9630 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9632 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9633 if (i
>= TREE_VEC_LENGTH (vec
))
9635 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9639 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9642 make_argument_pack_select (tree arg_pack
, unsigned index
)
9644 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9646 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9647 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9652 /* This is a subroutine of tsubst_pack_expansion.
9654 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9655 mechanism to store the (non complete list of) arguments of the
9656 substitution and return a non substituted pack expansion, in order
9657 to wait for when we have enough arguments to really perform the
9661 use_pack_expansion_extra_args_p (tree parm_packs
,
9665 /* If one pack has an expansion and another pack has a normal
9666 argument or if one pack has an empty argument and an another
9667 one hasn't then tsubst_pack_expansion cannot perform the
9668 substitution and need to fall back on the
9669 PACK_EXPANSION_EXTRA mechanism. */
9670 if (parm_packs
== NULL_TREE
)
9672 else if (has_empty_arg
)
9675 bool has_expansion_arg
= false;
9676 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9678 bool has_non_expansion_arg
= false;
9679 for (tree parm_pack
= parm_packs
;
9681 parm_pack
= TREE_CHAIN (parm_pack
))
9683 tree arg
= TREE_VALUE (parm_pack
);
9685 if (argument_pack_element_is_expansion_p (arg
, i
))
9686 has_expansion_arg
= true;
9688 has_non_expansion_arg
= true;
9691 if (has_expansion_arg
&& has_non_expansion_arg
)
9697 /* [temp.variadic]/6 says that:
9699 The instantiation of a pack expansion [...]
9700 produces a list E1,E2, ..., En, where N is the number of elements
9701 in the pack expansion parameters.
9703 This subroutine of tsubst_pack_expansion produces one of these Ei.
9705 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9706 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9707 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9708 INDEX is the index 'i' of the element Ei to produce. ARGS,
9709 COMPLAIN, and IN_DECL are the same parameters as for the
9710 tsubst_pack_expansion function.
9712 The function returns the resulting Ei upon successful completion,
9715 Note that this function possibly modifies the ARGS parameter, so
9716 it's the responsibility of the caller to restore it. */
9719 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9722 tree args
/* This parm gets
9724 tsubst_flags_t complain
,
9728 bool ith_elem_is_expansion
= false;
9730 /* For each parameter pack, change the substitution of the parameter
9731 pack to the ith argument in its argument pack, then expand the
9733 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9735 tree parm
= TREE_PURPOSE (pack
);
9736 tree arg_pack
= TREE_VALUE (pack
);
9737 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9739 ith_elem_is_expansion
|=
9740 argument_pack_element_is_expansion_p (arg_pack
, index
);
9742 /* Select the Ith argument from the pack. */
9743 if (TREE_CODE (parm
) == PARM_DECL
9744 || TREE_CODE (parm
) == FIELD_DECL
)
9748 aps
= make_argument_pack_select (arg_pack
, index
);
9750 register_local_specialization (aps
, parm
);
9753 aps
= retrieve_local_specialization (parm
);
9758 template_parm_level_and_index (parm
, &level
, &idx
);
9762 aps
= make_argument_pack_select (arg_pack
, index
);
9763 /* Update the corresponding argument. */
9764 TMPL_ARG (args
, level
, idx
) = aps
;
9767 /* Re-use the ARGUMENT_PACK_SELECT. */
9768 aps
= TMPL_ARG (args
, level
, idx
);
9770 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9773 /* Substitute into the PATTERN with the (possibly altered)
9775 if (pattern
== in_decl
)
9776 /* Expanding a fixed parameter pack from
9777 coerce_template_parameter_pack. */
9778 t
= tsubst_decl (pattern
, args
, complain
);
9779 else if (!TYPE_P (pattern
))
9780 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9781 /*integral_constant_expression_p=*/false);
9783 t
= tsubst (pattern
, args
, complain
, in_decl
);
9785 /* If the Ith argument pack element is a pack expansion, then
9786 the Ith element resulting from the substituting is going to
9787 be a pack expansion as well. */
9788 if (ith_elem_is_expansion
)
9789 t
= make_pack_expansion (t
);
9794 /* Substitute ARGS into T, which is an pack expansion
9795 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9796 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9797 (if only a partial substitution could be performed) or
9798 ERROR_MARK_NODE if there was an error. */
9800 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9804 tree pack
, packs
= NULL_TREE
;
9805 bool unsubstituted_packs
= false;
9808 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
9809 bool need_local_specializations
= false;
9812 gcc_assert (PACK_EXPANSION_P (t
));
9813 pattern
= PACK_EXPANSION_PATTERN (t
);
9815 /* Add in any args remembered from an earlier partial instantiation. */
9816 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9818 levels
= TMPL_ARGS_DEPTH (args
);
9820 /* Determine the argument packs that will instantiate the parameter
9821 packs used in the expansion expression. While we're at it,
9822 compute the number of arguments to be expanded and make sure it
9824 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9825 pack
= TREE_CHAIN (pack
))
9827 tree parm_pack
= TREE_VALUE (pack
);
9828 tree arg_pack
= NULL_TREE
;
9829 tree orig_arg
= NULL_TREE
;
9832 if (TREE_CODE (parm_pack
) == BASES
)
9834 if (BASES_DIRECT (parm_pack
))
9835 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9836 args
, complain
, in_decl
, false));
9838 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9839 args
, complain
, in_decl
, false));
9841 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9843 if (PACK_EXPANSION_LOCAL_P (t
))
9844 arg_pack
= retrieve_local_specialization (parm_pack
);
9847 /* We can't rely on local_specializations for a parameter
9848 name used later in a function declaration (such as in a
9849 late-specified return type). Even if it exists, it might
9850 have the wrong value for a recursive call. Just make a
9851 dummy decl, since it's only used for its type. */
9852 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9853 if (arg_pack
&& DECL_PACK_P (arg_pack
))
9854 /* Partial instantiation of the parm_pack, we can't build
9855 up an argument pack yet. */
9856 arg_pack
= NULL_TREE
;
9858 arg_pack
= make_fnparm_pack (arg_pack
);
9859 need_local_specializations
= true;
9862 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
9863 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
9867 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9869 if (level
<= levels
)
9870 arg_pack
= TMPL_ARG (args
, level
, idx
);
9873 orig_arg
= arg_pack
;
9874 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9875 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9877 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9878 /* This can only happen if we forget to expand an argument
9879 pack somewhere else. Just return an error, silently. */
9881 result
= make_tree_vec (1);
9882 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9889 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9891 /* Don't bother trying to do a partial substitution with
9892 incomplete packs; we'll try again after deduction. */
9893 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9898 else if (len
!= my_len
)
9900 if (!(complain
& tf_error
))
9901 /* Fail quietly. */;
9902 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9903 error ("mismatched argument pack lengths while expanding "
9907 error ("mismatched argument pack lengths while expanding "
9910 return error_mark_node
;
9913 /* Keep track of the parameter packs and their corresponding
9915 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9916 TREE_TYPE (packs
) = orig_arg
;
9920 /* We can't substitute for this parameter pack. We use a flag as
9921 well as the missing_level counter because function parameter
9922 packs don't have a level. */
9923 unsubstituted_packs
= true;
9927 /* If the expansion is just T..., return the matching argument pack. */
9928 if (!unsubstituted_packs
9929 && TREE_PURPOSE (packs
) == pattern
)
9930 return ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
9932 /* We cannot expand this expansion expression, because we don't have
9933 all of the argument packs we need. */
9934 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9936 /* We got some full packs, but we can't substitute them in until we
9937 have values for all the packs. So remember these until then. */
9939 t
= make_pack_expansion (pattern
);
9940 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9943 else if (unsubstituted_packs
)
9945 /* There were no real arguments, we're just replacing a parameter
9946 pack with another version of itself. Substitute into the
9947 pattern and return a PACK_EXPANSION_*. The caller will need to
9949 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9950 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9951 /*integral_constant_expression_p=*/false);
9953 t
= tsubst (pattern
, args
, complain
, in_decl
);
9954 t
= make_pack_expansion (t
);
9958 gcc_assert (len
>= 0);
9960 if (need_local_specializations
)
9962 /* We're in a late-specified return type, so create our own local
9963 specializations map; the current map is either NULL or (in the
9964 case of recursive unification) might have bindings that we don't
9965 want to use or alter. */
9966 saved_local_specializations
= local_specializations
;
9967 local_specializations
= new hash_map
<tree
, tree
>;
9970 /* For each argument in each argument pack, substitute into the
9972 result
= make_tree_vec (len
);
9973 for (i
= 0; i
< len
; ++i
)
9975 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9979 TREE_VEC_ELT (result
, i
) = t
;
9980 if (t
== error_mark_node
)
9982 result
= error_mark_node
;
9987 /* Update ARGS to restore the substitution from parameter packs to
9988 their argument packs. */
9989 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9991 tree parm
= TREE_PURPOSE (pack
);
9993 if (TREE_CODE (parm
) == PARM_DECL
9994 || TREE_CODE (parm
) == FIELD_DECL
)
9995 register_local_specialization (TREE_TYPE (pack
), parm
);
10000 if (TREE_VALUE (pack
) == NULL_TREE
)
10003 template_parm_level_and_index (parm
, &level
, &idx
);
10005 /* Update the corresponding argument. */
10006 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10007 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10010 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10014 if (need_local_specializations
)
10016 delete local_specializations
;
10017 local_specializations
= saved_local_specializations
;
10023 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10024 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10025 parameter packs; all parms generated from a function parameter pack will
10026 have the same DECL_PARM_INDEX. */
10029 get_pattern_parm (tree parm
, tree tmpl
)
10031 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10034 if (DECL_ARTIFICIAL (parm
))
10036 for (patparm
= DECL_ARGUMENTS (pattern
);
10037 patparm
; patparm
= DECL_CHAIN (patparm
))
10038 if (DECL_ARTIFICIAL (patparm
)
10039 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10044 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10045 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10046 gcc_assert (DECL_PARM_INDEX (patparm
)
10047 == DECL_PARM_INDEX (parm
));
10053 /* Substitute ARGS into the vector or list of template arguments T. */
10056 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10059 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10062 if (t
== error_mark_node
)
10063 return error_mark_node
;
10065 len
= TREE_VEC_LENGTH (t
);
10066 elts
= XALLOCAVEC (tree
, len
);
10068 for (i
= 0; i
< len
; i
++)
10070 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10073 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10074 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10075 else if (PACK_EXPANSION_P (orig_arg
))
10077 /* Substitute into an expansion expression. */
10078 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10080 if (TREE_CODE (new_arg
) == TREE_VEC
)
10081 /* Add to the expanded length adjustment the number of
10082 expanded arguments. We subtract one from this
10083 measurement, because the argument pack expression
10084 itself is already counted as 1 in
10085 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10086 the argument pack is empty. */
10087 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10089 else if (ARGUMENT_PACK_P (orig_arg
))
10091 /* Substitute into each of the arguments. */
10092 new_arg
= TYPE_P (orig_arg
)
10093 ? cxx_make_type (TREE_CODE (orig_arg
))
10094 : make_node (TREE_CODE (orig_arg
));
10096 SET_ARGUMENT_PACK_ARGS (
10098 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10099 args
, complain
, in_decl
));
10101 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10102 new_arg
= error_mark_node
;
10104 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10105 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10106 complain
, in_decl
);
10107 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10109 if (TREE_TYPE (new_arg
) == error_mark_node
)
10110 new_arg
= error_mark_node
;
10114 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10116 if (new_arg
== error_mark_node
)
10117 return error_mark_node
;
10120 if (new_arg
!= orig_arg
)
10127 /* Make space for the expanded arguments coming from template
10129 t
= make_tree_vec (len
+ expanded_len_adjust
);
10130 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10131 arguments for a member template.
10132 In that case each TREE_VEC in ORIG_T represents a level of template
10133 arguments, and ORIG_T won't carry any non defaulted argument count.
10134 It will rather be the nested TREE_VECs that will carry one.
10135 In other words, ORIG_T carries a non defaulted argument count only
10136 if it doesn't contain any nested TREE_VEC. */
10137 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10139 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10140 count
+= expanded_len_adjust
;
10141 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10143 for (i
= 0, out
= 0; i
< len
; i
++)
10145 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10146 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10147 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10151 /* Now expand the template argument pack "in place". */
10152 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10153 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10157 TREE_VEC_ELT (t
, out
) = elts
[i
];
10165 /* Return the result of substituting ARGS into the template parameters
10166 given by PARMS. If there are m levels of ARGS and m + n levels of
10167 PARMS, then the result will contain n levels of PARMS. For
10168 example, if PARMS is `template <class T> template <class U>
10169 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10170 result will be `template <int*, double, class V>'. */
10173 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10175 tree r
= NULL_TREE
;
10178 /* When substituting into a template, we must set
10179 PROCESSING_TEMPLATE_DECL as the template parameters may be
10180 dependent if they are based on one-another, and the dependency
10181 predicates are short-circuit outside of templates. */
10182 ++processing_template_decl
;
10184 for (new_parms
= &r
;
10185 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10186 new_parms
= &(TREE_CHAIN (*new_parms
)),
10187 parms
= TREE_CHAIN (parms
))
10190 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10193 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10197 if (parms
== error_mark_node
)
10200 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10202 if (tuple
== error_mark_node
)
10205 TREE_VEC_ELT (new_vec
, i
) =
10206 tsubst_template_parm (tuple
, args
, complain
);
10210 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10211 - TMPL_ARGS_DEPTH (args
)),
10212 new_vec
, NULL_TREE
);
10215 --processing_template_decl
;
10220 /* Return the result of substituting ARGS into one template parameter
10221 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10222 parameter and which TREE_PURPOSE is the default argument of the
10223 template parameter. */
10226 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10228 tree default_value
, parm_decl
;
10230 if (args
== NULL_TREE
10232 || t
== error_mark_node
)
10235 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10237 default_value
= TREE_PURPOSE (t
);
10238 parm_decl
= TREE_VALUE (t
);
10240 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10241 if (TREE_CODE (parm_decl
) == PARM_DECL
10242 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10243 parm_decl
= error_mark_node
;
10244 default_value
= tsubst_template_arg (default_value
, args
,
10245 complain
, NULL_TREE
);
10247 return build_tree_list (default_value
, parm_decl
);
10250 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10251 type T. If T is not an aggregate or enumeration type, it is
10252 handled as if by tsubst. IN_DECL is as for tsubst. If
10253 ENTERING_SCOPE is nonzero, T is the context for a template which
10254 we are presently tsubst'ing. Return the substituted value. */
10257 tsubst_aggr_type (tree t
,
10259 tsubst_flags_t complain
,
10261 int entering_scope
)
10263 if (t
== NULL_TREE
)
10266 switch (TREE_CODE (t
))
10269 if (TYPE_PTRMEMFUNC_P (t
))
10270 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10272 /* Else fall through. */
10273 case ENUMERAL_TYPE
:
10275 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10280 int saved_unevaluated_operand
;
10281 int saved_inhibit_evaluation_warnings
;
10283 /* In "sizeof(X<I>)" we need to evaluate "I". */
10284 saved_unevaluated_operand
= cp_unevaluated_operand
;
10285 cp_unevaluated_operand
= 0;
10286 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10287 c_inhibit_evaluation_warnings
= 0;
10289 /* First, determine the context for the type we are looking
10291 context
= TYPE_CONTEXT (t
);
10292 if (context
&& TYPE_P (context
))
10294 context
= tsubst_aggr_type (context
, args
, complain
,
10295 in_decl
, /*entering_scope=*/1);
10296 /* If context is a nested class inside a class template,
10297 it may still need to be instantiated (c++/33959). */
10298 context
= complete_type (context
);
10301 /* Then, figure out what arguments are appropriate for the
10302 type we are trying to find. For example, given:
10304 template <class T> struct S;
10305 template <class T, class U> void f(T, U) { S<U> su; }
10307 and supposing that we are instantiating f<int, double>,
10308 then our ARGS will be {int, double}, but, when looking up
10309 S we only want {double}. */
10310 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10311 complain
, in_decl
);
10312 if (argvec
== error_mark_node
)
10313 r
= error_mark_node
;
10316 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10317 entering_scope
, complain
);
10318 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10321 cp_unevaluated_operand
= saved_unevaluated_operand
;
10322 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10327 /* This is not a template type, so there's nothing to do. */
10331 return tsubst (t
, args
, complain
, in_decl
);
10335 /* Substitute into the default argument ARG (a default argument for
10336 FN), which has the indicated TYPE. */
10339 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10341 tree saved_class_ptr
= NULL_TREE
;
10342 tree saved_class_ref
= NULL_TREE
;
10343 int errs
= errorcount
+ sorrycount
;
10345 /* This can happen in invalid code. */
10346 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10349 /* This default argument came from a template. Instantiate the
10350 default argument here, not in tsubst. In the case of
10359 we must be careful to do name lookup in the scope of S<T>,
10360 rather than in the current class. */
10361 push_access_scope (fn
);
10362 /* The "this" pointer is not valid in a default argument. */
10365 saved_class_ptr
= current_class_ptr
;
10366 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10367 saved_class_ref
= current_class_ref
;
10368 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10371 push_deferring_access_checks(dk_no_deferred
);
10372 /* The default argument expression may cause implicitly defined
10373 member functions to be synthesized, which will result in garbage
10374 collection. We must treat this situation as if we were within
10375 the body of function so as to avoid collecting live data on the
10378 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10379 complain
, NULL_TREE
,
10380 /*integral_constant_expression_p=*/false);
10382 pop_deferring_access_checks();
10384 /* Restore the "this" pointer. */
10387 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10388 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10391 if (errorcount
+sorrycount
> errs
10392 && (complain
& tf_warning_or_error
))
10393 inform (input_location
,
10394 " when instantiating default argument for call to %D", fn
);
10396 /* Make sure the default argument is reasonable. */
10397 arg
= check_default_argument (type
, arg
, complain
);
10399 pop_access_scope (fn
);
10404 /* Substitute into all the default arguments for FN. */
10407 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10412 tmpl_args
= DECL_TI_ARGS (fn
);
10414 /* If this function is not yet instantiated, we certainly don't need
10415 its default arguments. */
10416 if (uses_template_parms (tmpl_args
))
10418 /* Don't do this again for clones. */
10419 if (DECL_CLONED_FUNCTION_P (fn
))
10422 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10424 arg
= TREE_CHAIN (arg
))
10425 if (TREE_PURPOSE (arg
))
10426 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10428 TREE_PURPOSE (arg
),
10432 /* Substitute the ARGS into the T, which is a _DECL. Return the
10433 result of the substitution. Issue error and warning messages under
10434 control of COMPLAIN. */
10437 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10439 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10440 location_t saved_loc
;
10441 tree r
= NULL_TREE
;
10443 hashval_t hash
= 0;
10445 /* Set the filename and linenumber to improve error-reporting. */
10446 saved_loc
= input_location
;
10447 input_location
= DECL_SOURCE_LOCATION (t
);
10449 switch (TREE_CODE (t
))
10451 case TEMPLATE_DECL
:
10453 /* We can get here when processing a member function template,
10454 member class template, or template template parameter. */
10455 tree decl
= DECL_TEMPLATE_RESULT (t
);
10460 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10462 /* Template template parameter is treated here. */
10463 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10464 if (new_type
== error_mark_node
)
10465 RETURN (error_mark_node
);
10466 /* If we get a real template back, return it. This can happen in
10467 the context of most_specialized_class. */
10468 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10472 DECL_CHAIN (r
) = NULL_TREE
;
10473 TREE_TYPE (r
) = new_type
;
10474 DECL_TEMPLATE_RESULT (r
)
10475 = build_decl (DECL_SOURCE_LOCATION (decl
),
10476 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10477 DECL_TEMPLATE_PARMS (r
)
10478 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10480 TYPE_NAME (new_type
) = r
;
10484 /* We might already have an instance of this template.
10485 The ARGS are for the surrounding class type, so the
10486 full args contain the tsubst'd args for the context,
10487 plus the innermost args from the template decl. */
10488 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10489 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10490 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10491 /* Because this is a template, the arguments will still be
10492 dependent, even after substitution. If
10493 PROCESSING_TEMPLATE_DECL is not set, the dependency
10494 predicates will short-circuit. */
10495 ++processing_template_decl
;
10496 full_args
= tsubst_template_args (tmpl_args
, args
,
10497 complain
, in_decl
);
10498 --processing_template_decl
;
10499 if (full_args
== error_mark_node
)
10500 RETURN (error_mark_node
);
10502 /* If this is a default template template argument,
10503 tsubst might not have changed anything. */
10504 if (full_args
== tmpl_args
)
10507 hash
= hash_tmpl_and_args (t
, full_args
);
10508 spec
= retrieve_specialization (t
, full_args
, hash
);
10509 if (spec
!= NULL_TREE
)
10515 /* Make a new template decl. It will be similar to the
10516 original, but will record the current template arguments.
10517 We also create a new function declaration, which is just
10518 like the old one, but points to this new template, rather
10519 than the old one. */
10521 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10522 DECL_CHAIN (r
) = NULL_TREE
;
10524 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10526 if (TREE_CODE (decl
) == TYPE_DECL
10527 && !TYPE_DECL_ALIAS_P (decl
))
10530 ++processing_template_decl
;
10531 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10532 --processing_template_decl
;
10533 if (new_type
== error_mark_node
)
10534 RETURN (error_mark_node
);
10536 TREE_TYPE (r
) = new_type
;
10537 /* For a partial specialization, we need to keep pointing to
10538 the primary template. */
10539 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10540 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10541 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10542 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10543 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10548 ++processing_template_decl
;
10549 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10550 --processing_template_decl
;
10551 if (new_decl
== error_mark_node
)
10552 RETURN (error_mark_node
);
10554 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10555 DECL_TI_TEMPLATE (new_decl
) = r
;
10556 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10557 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10558 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10561 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10562 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10563 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10565 /* The template parameters for this new template are all the
10566 template parameters for the old template, except the
10567 outermost level of parameters. */
10568 DECL_TEMPLATE_PARMS (r
)
10569 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10572 if (PRIMARY_TEMPLATE_P (t
))
10573 DECL_PRIMARY_TEMPLATE (r
) = r
;
10575 if (TREE_CODE (decl
) != TYPE_DECL
&& TREE_CODE (decl
) != VAR_DECL
)
10576 /* Record this non-type partial instantiation. */
10577 register_specialization (r
, t
,
10578 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10583 case FUNCTION_DECL
:
10586 tree argvec
= NULL_TREE
;
10594 /* Nobody should be tsubst'ing into non-template functions. */
10595 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10597 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10602 /* If T is not dependent, just return it. We have to
10603 increment PROCESSING_TEMPLATE_DECL because
10604 value_dependent_expression_p assumes that nothing is
10605 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10606 ++processing_template_decl
;
10607 dependent_p
= value_dependent_expression_p (t
);
10608 --processing_template_decl
;
10612 /* Calculate the most general template of which R is a
10613 specialization, and the complete set of arguments used to
10615 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10616 argvec
= tsubst_template_args (DECL_TI_ARGS
10617 (DECL_TEMPLATE_RESULT
10618 (DECL_TI_TEMPLATE (t
))),
10619 args
, complain
, in_decl
);
10620 if (argvec
== error_mark_node
)
10621 RETURN (error_mark_node
);
10623 /* Check to see if we already have this specialization. */
10624 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10625 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10633 /* We can see more levels of arguments than parameters if
10634 there was a specialization of a member template, like
10637 template <class T> struct S { template <class U> void f(); }
10638 template <> template <class U> void S<int>::f(U);
10640 Here, we'll be substituting into the specialization,
10641 because that's where we can find the code we actually
10642 want to generate, but we'll have enough arguments for
10643 the most general template.
10645 We also deal with the peculiar case:
10647 template <class T> struct S {
10648 template <class U> friend void f();
10650 template <class U> void f() {}
10652 template void f<double>();
10654 Here, the ARGS for the instantiation of will be {int,
10655 double}. But, we only need as many ARGS as there are
10656 levels of template parameters in CODE_PATTERN. We are
10657 careful not to get fooled into reducing the ARGS in
10660 template <class T> struct S { template <class U> void f(U); }
10661 template <class T> template <> void S<T>::f(int) {}
10663 which we can spot because the pattern will be a
10664 specialization in this case. */
10665 args_depth
= TMPL_ARGS_DEPTH (args
);
10667 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10668 if (args_depth
> parms_depth
10669 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10670 args
= get_innermost_template_args (args
, parms_depth
);
10674 /* This special case arises when we have something like this:
10676 template <class T> struct S {
10677 friend void f<int>(int, double);
10680 Here, the DECL_TI_TEMPLATE for the friend declaration
10681 will be an IDENTIFIER_NODE. We are being called from
10682 tsubst_friend_function, and we want only to create a
10683 new decl (R) with appropriate types so that we can call
10684 determine_specialization. */
10685 gen_tmpl
= NULL_TREE
;
10688 if (DECL_CLASS_SCOPE_P (t
))
10690 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10694 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10695 complain
, t
, /*entering_scope=*/1);
10700 ctx
= DECL_CONTEXT (t
);
10702 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10703 if (type
== error_mark_node
)
10704 RETURN (error_mark_node
);
10706 /* If we hit excessive deduction depth, the type is bogus even if
10707 it isn't error_mark_node, so don't build a decl. */
10708 if (excessive_deduction_depth
)
10709 RETURN (error_mark_node
);
10711 /* We do NOT check for matching decls pushed separately at this
10712 point, as they may not represent instantiations of this
10713 template, and in any case are considered separate under the
10716 DECL_USE_TEMPLATE (r
) = 0;
10717 TREE_TYPE (r
) = type
;
10718 /* Clear out the mangled name and RTL for the instantiation. */
10719 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10720 SET_DECL_RTL (r
, NULL
);
10721 /* Leave DECL_INITIAL set on deleted instantiations. */
10722 if (!DECL_DELETED_FN (r
))
10723 DECL_INITIAL (r
) = NULL_TREE
;
10724 DECL_CONTEXT (r
) = ctx
;
10726 /* OpenMP UDRs have the only argument a reference to the declared
10727 type. We want to diagnose if the declared type is a reference,
10728 which is invalid, but as references to references are usually
10729 quietly merged, diagnose it here. */
10730 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10733 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10734 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10735 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10736 error_at (DECL_SOURCE_LOCATION (t
),
10737 "reference type %qT in "
10738 "%<#pragma omp declare reduction%>", argtype
);
10739 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10740 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10744 if (member
&& DECL_CONV_FN_P (r
))
10745 /* Type-conversion operator. Reconstruct the name, in
10746 case it's the name of one of the template's parameters. */
10747 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10749 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10751 DECL_RESULT (r
) = NULL_TREE
;
10753 TREE_STATIC (r
) = 0;
10754 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10755 DECL_EXTERNAL (r
) = 1;
10756 /* If this is an instantiation of a function with internal
10757 linkage, we already know what object file linkage will be
10758 assigned to the instantiation. */
10759 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10760 DECL_DEFER_OUTPUT (r
) = 0;
10761 DECL_CHAIN (r
) = NULL_TREE
;
10762 DECL_PENDING_INLINE_INFO (r
) = 0;
10763 DECL_PENDING_INLINE_P (r
) = 0;
10764 DECL_SAVED_TREE (r
) = NULL_TREE
;
10765 DECL_STRUCT_FUNCTION (r
) = NULL
;
10767 /* We'll re-clone as appropriate in instantiate_template. */
10768 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10770 /* If we aren't complaining now, return on error before we register
10771 the specialization so that we'll complain eventually. */
10772 if ((complain
& tf_error
) == 0
10773 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10774 && !grok_op_properties (r
, /*complain=*/false))
10775 RETURN (error_mark_node
);
10777 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10778 this in the special friend case mentioned above where
10779 GEN_TMPL is NULL. */
10782 DECL_TEMPLATE_INFO (r
)
10783 = build_template_info (gen_tmpl
, argvec
);
10784 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10787 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10789 /* We instantiated this while substituting into
10790 the type earlier (template/friend54.C). */
10793 /* We're not supposed to instantiate default arguments
10794 until they are called, for a template. But, for a
10797 template <class T> void f ()
10798 { extern void g(int i = T()); }
10800 we should do the substitution when the template is
10801 instantiated. We handle the member function case in
10802 instantiate_class_template since the default arguments
10803 might refer to other members of the class. */
10805 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10806 && !uses_template_parms (argvec
))
10807 tsubst_default_arguments (r
, complain
);
10810 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10812 /* Copy the list of befriending classes. */
10813 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10815 friends
= &TREE_CHAIN (*friends
))
10817 *friends
= copy_node (*friends
);
10818 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10823 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10825 maybe_retrofit_in_chrg (r
);
10826 if (DECL_CONSTRUCTOR_P (r
))
10827 grok_ctor_properties (ctx
, r
);
10828 if (DECL_INHERITED_CTOR_BASE (r
))
10829 deduce_inheriting_ctor (r
);
10830 /* If this is an instantiation of a member template, clone it.
10831 If it isn't, that'll be handled by
10832 clone_constructors_and_destructors. */
10833 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10834 clone_function_decl (r
, /*update_method_vec_p=*/0);
10836 else if ((complain
& tf_error
) != 0
10837 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10838 && !grok_op_properties (r
, /*complain=*/true))
10839 RETURN (error_mark_node
);
10841 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10842 SET_DECL_FRIEND_CONTEXT (r
,
10843 tsubst (DECL_FRIEND_CONTEXT (t
),
10844 args
, complain
, in_decl
));
10846 /* Possibly limit visibility based on template args. */
10847 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10848 if (DECL_VISIBILITY_SPECIFIED (t
))
10850 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10851 DECL_ATTRIBUTES (r
)
10852 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10854 determine_visibility (r
);
10855 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10856 && !processing_template_decl
)
10857 defaulted_late_check (r
);
10859 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10860 args
, complain
, in_decl
);
10866 tree type
= NULL_TREE
;
10868 tree expanded_types
= NULL_TREE
;
10869 tree prev_r
= NULL_TREE
;
10870 tree first_r
= NULL_TREE
;
10872 if (DECL_PACK_P (t
))
10874 /* If there is a local specialization that isn't a
10875 parameter pack, it means that we're doing a "simple"
10876 substitution from inside tsubst_pack_expansion. Just
10877 return the local specialization (which will be a single
10879 tree spec
= retrieve_local_specialization (t
);
10881 && TREE_CODE (spec
) == PARM_DECL
10882 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10885 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10886 the parameters in this function parameter pack. */
10887 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10888 complain
, in_decl
);
10889 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10891 len
= TREE_VEC_LENGTH (expanded_types
);
10893 /* Zero-length parameter packs are boring. Just substitute
10896 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10901 /* All we did was update the type. Make a note of that. */
10902 type
= expanded_types
;
10903 expanded_types
= NULL_TREE
;
10907 /* Loop through all of the parameters we'll build. When T is
10908 a function parameter pack, LEN is the number of expanded
10909 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10911 for (i
= 0; i
< len
; ++i
)
10915 if (DECL_TEMPLATE_PARM_P (t
))
10916 SET_DECL_TEMPLATE_PARM_P (r
);
10918 if (expanded_types
)
10919 /* We're on the Ith parameter of the function parameter
10922 /* Get the Ith type. */
10923 type
= TREE_VEC_ELT (expanded_types
, i
);
10925 /* Rename the parameter to include the index. */
10927 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10930 /* We're dealing with a normal parameter. */
10931 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10933 type
= type_decays_to (type
);
10934 TREE_TYPE (r
) = type
;
10935 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10937 if (DECL_INITIAL (r
))
10939 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10940 DECL_INITIAL (r
) = TREE_TYPE (r
);
10942 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10943 complain
, in_decl
);
10946 DECL_CONTEXT (r
) = NULL_TREE
;
10948 if (!DECL_TEMPLATE_PARM_P (r
))
10949 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10951 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10952 args
, complain
, in_decl
);
10954 /* Keep track of the first new parameter we
10955 generate. That's what will be returned to the
10960 /* Build a proper chain of parameters when substituting
10961 into a function parameter pack. */
10963 DECL_CHAIN (prev_r
) = r
;
10966 /* If cp_unevaluated_operand is set, we're just looking for a
10967 single dummy parameter, so don't keep going. */
10968 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10969 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10970 complain
, DECL_CHAIN (t
));
10972 /* FIRST_R contains the start of the chain we've built. */
10979 tree type
= NULL_TREE
;
10980 tree vec
= NULL_TREE
;
10981 tree expanded_types
= NULL_TREE
;
10984 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
10986 /* This field is a lambda capture pack. Return a TREE_VEC of
10987 the expanded fields to instantiate_class_template_1 and
10988 store them in the specializations hash table as a
10989 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
10990 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10991 complain
, in_decl
);
10992 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10994 len
= TREE_VEC_LENGTH (expanded_types
);
10995 vec
= make_tree_vec (len
);
10999 /* All we did was update the type. Make a note of that. */
11000 type
= expanded_types
;
11001 expanded_types
= NULL_TREE
;
11005 for (int i
= 0; i
< len
; ++i
)
11008 if (expanded_types
)
11010 type
= TREE_VEC_ELT (expanded_types
, i
);
11012 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11015 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11017 if (type
== error_mark_node
)
11018 RETURN (error_mark_node
);
11019 TREE_TYPE (r
) = type
;
11020 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11022 if (DECL_C_BIT_FIELD (r
))
11023 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11024 non-bit-fields DECL_INITIAL is a non-static data member
11025 initializer, which gets deferred instantiation. */
11027 = tsubst_expr (DECL_INITIAL (t
), args
,
11029 /*integral_constant_expression_p=*/true);
11030 else if (DECL_INITIAL (t
))
11032 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11033 NSDMI in perform_member_init. Still set DECL_INITIAL
11034 so that we know there is one. */
11035 DECL_INITIAL (r
) = void_node
;
11036 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11037 retrofit_lang_decl (r
);
11038 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11040 /* We don't have to set DECL_CONTEXT here; it is set by
11041 finish_member_declaration. */
11042 DECL_CHAIN (r
) = NULL_TREE
;
11044 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11045 args
, complain
, in_decl
);
11048 TREE_VEC_ELT (vec
, i
) = r
;
11054 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11055 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11056 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11057 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11058 TREE_TYPE (pack
) = tpack
;
11059 register_specialization (pack
, t
, args
, false, 0);
11065 /* We reach here only for member using decls. We also need to check
11066 uses_template_parms because DECL_DEPENDENT_P is not set for a
11067 using-declaration that designates a member of the current
11068 instantiation (c++/53549). */
11069 if (DECL_DEPENDENT_P (t
)
11070 || uses_template_parms (USING_DECL_SCOPE (t
)))
11072 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11073 complain
, in_decl
);
11074 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11075 r
= do_class_using_decl (inst_scope
, name
);
11077 r
= error_mark_node
;
11080 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11081 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11087 DECL_CHAIN (r
) = NULL_TREE
;
11094 tree argvec
= NULL_TREE
;
11095 tree gen_tmpl
= NULL_TREE
;
11097 tree tmpl
= NULL_TREE
;
11099 tree type
= NULL_TREE
;
11102 if (TREE_TYPE (t
) == error_mark_node
)
11103 RETURN (error_mark_node
);
11105 if (TREE_CODE (t
) == TYPE_DECL
11106 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11108 /* If this is the canonical decl, we don't have to
11109 mess with instantiations, and often we can't (for
11110 typename, template type parms and such). Note that
11111 TYPE_NAME is not correct for the above test if
11112 we've copied the type for a typedef. */
11113 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11114 if (type
== error_mark_node
)
11115 RETURN (error_mark_node
);
11116 r
= TYPE_NAME (type
);
11120 /* Check to see if we already have the specialization we
11123 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11125 /* T is a static data member or namespace-scope entity.
11126 We have to substitute into namespace-scope variables
11127 (even though such entities are never templates) because
11130 template <class T> void f() { extern T t; }
11132 where the entity referenced is not known until
11133 instantiation time. */
11135 ctx
= DECL_CONTEXT (t
);
11136 if (DECL_CLASS_SCOPE_P (t
))
11138 ctx
= tsubst_aggr_type (ctx
, args
,
11140 in_decl
, /*entering_scope=*/1);
11141 /* If CTX is unchanged, then T is in fact the
11142 specialization we want. That situation occurs when
11143 referencing a static data member within in its own
11144 class. We can use pointer equality, rather than
11145 same_type_p, because DECL_CONTEXT is always
11147 if (ctx
== DECL_CONTEXT (t
)
11148 /* ... unless T is a member template; in which
11149 case our caller can be willing to create a
11150 specialization of that template represented
11152 && !(DECL_TI_TEMPLATE (t
)
11153 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
11159 tmpl
= DECL_TI_TEMPLATE (t
);
11160 gen_tmpl
= most_general_template (tmpl
);
11161 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11162 if (argvec
== error_mark_node
)
11163 RETURN (error_mark_node
);
11164 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11165 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11170 /* A local variable. */
11172 /* Subsequent calls to pushdecl will fill this in. */
11174 spec
= retrieve_local_specialization (t
);
11176 /* If we already have the specialization we need, there is
11177 nothing more to do. */
11184 /* Create a new node for the specialization we need. */
11186 if (type
== NULL_TREE
)
11188 if (is_typedef_decl (t
))
11189 type
= DECL_ORIGINAL_TYPE (t
);
11191 type
= TREE_TYPE (t
);
11193 && VAR_HAD_UNKNOWN_BOUND (t
)
11194 && type
!= error_mark_node
)
11195 type
= strip_array_domain (type
);
11196 type
= tsubst (type
, args
, complain
, in_decl
);
11200 /* Even if the original location is out of scope, the
11201 newly substituted one is not. */
11202 DECL_DEAD_FOR_LOCAL (r
) = 0;
11203 DECL_INITIALIZED_P (r
) = 0;
11204 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11205 if (type
== error_mark_node
)
11206 RETURN (error_mark_node
);
11207 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11209 /* It may seem that this case cannot occur, since:
11214 declares a function, not a variable. However:
11217 template <typename T> void g() { T t; }
11218 template void g<f>();
11220 is an attempt to declare a variable with function
11222 error ("variable %qD has function type",
11223 /* R is not yet sufficiently initialized, so we
11224 just use its name. */
11226 RETURN (error_mark_node
);
11228 type
= complete_type (type
);
11229 /* Wait until cp_finish_decl to set this again, to handle
11230 circular dependency (template/instantiate6.C). */
11231 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11232 type
= check_var_type (DECL_NAME (r
), type
);
11234 if (DECL_HAS_VALUE_EXPR_P (t
))
11236 tree ve
= DECL_VALUE_EXPR (t
);
11237 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11238 /*constant_expression_p=*/false);
11239 if (REFERENCE_REF_P (ve
))
11241 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11242 ve
= TREE_OPERAND (ve
, 0);
11244 SET_DECL_VALUE_EXPR (r
, ve
);
11246 if (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
11247 set_decl_tls_model (r
, decl_tls_model (t
));
11249 else if (DECL_SELF_REFERENCE_P (t
))
11250 SET_DECL_SELF_REFERENCE_P (r
);
11251 TREE_TYPE (r
) = type
;
11252 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11253 DECL_CONTEXT (r
) = ctx
;
11254 /* Clear out the mangled name and RTL for the instantiation. */
11255 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11256 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11257 SET_DECL_RTL (r
, NULL
);
11258 /* The initializer must not be expanded until it is required;
11259 see [temp.inst]. */
11260 DECL_INITIAL (r
) = NULL_TREE
;
11261 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11262 SET_DECL_RTL (r
, NULL
);
11263 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11266 /* Possibly limit visibility based on template args. */
11267 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11268 if (DECL_VISIBILITY_SPECIFIED (t
))
11270 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11271 DECL_ATTRIBUTES (r
)
11272 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11274 determine_visibility (r
);
11279 /* A static data member declaration is always marked
11280 external when it is declared in-class, even if an
11281 initializer is present. We mimic the non-template
11282 processing here. */
11283 DECL_EXTERNAL (r
) = 1;
11285 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11286 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11287 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11289 else if (!cp_unevaluated_operand
)
11290 register_local_specialization (r
, t
);
11292 DECL_CHAIN (r
) = NULL_TREE
;
11294 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11296 args
, complain
, in_decl
);
11298 /* Preserve a typedef that names a type. */
11299 if (is_typedef_decl (r
))
11301 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11302 set_underlying_type (r
);
11305 layout_decl (r
, 0);
11310 gcc_unreachable ();
11315 /* Restore the file and line information. */
11316 input_location
= saved_loc
;
11321 /* Substitute into the ARG_TYPES of a function type.
11322 If END is a TREE_CHAIN, leave it and any following types
11326 tsubst_arg_types (tree arg_types
,
11329 tsubst_flags_t complain
,
11332 tree remaining_arg_types
;
11333 tree type
= NULL_TREE
;
11335 tree expanded_args
= NULL_TREE
;
11338 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11341 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11342 args
, end
, complain
, in_decl
);
11343 if (remaining_arg_types
== error_mark_node
)
11344 return error_mark_node
;
11346 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11348 /* For a pack expansion, perform substitution on the
11349 entire expression. Later on, we'll handle the arguments
11351 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11352 args
, complain
, in_decl
);
11354 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11355 /* So that we'll spin through the parameters, one by one. */
11356 i
= TREE_VEC_LENGTH (expanded_args
);
11359 /* We only partially substituted into the parameter
11360 pack. Our type is TYPE_PACK_EXPANSION. */
11361 type
= expanded_args
;
11362 expanded_args
= NULL_TREE
;
11370 type
= TREE_VEC_ELT (expanded_args
, i
);
11372 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11374 if (type
== error_mark_node
)
11375 return error_mark_node
;
11376 if (VOID_TYPE_P (type
))
11378 if (complain
& tf_error
)
11380 error ("invalid parameter type %qT", type
);
11382 error ("in declaration %q+D", in_decl
);
11384 return error_mark_node
;
11387 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11388 return error_mark_node
;
11390 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11391 top-level qualifiers as required. */
11392 type
= cv_unqualified (type_decays_to (type
));
11394 /* We do not substitute into default arguments here. The standard
11395 mandates that they be instantiated only when needed, which is
11396 done in build_over_call. */
11397 default_arg
= TREE_PURPOSE (arg_types
);
11399 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11401 /* We've instantiated a template before its default arguments
11402 have been parsed. This can happen for a nested template
11403 class, and is not an error unless we require the default
11404 argument in a call of this function. */
11405 remaining_arg_types
=
11406 tree_cons (default_arg
, type
, remaining_arg_types
);
11407 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11410 remaining_arg_types
=
11411 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11414 return remaining_arg_types
;
11417 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11418 *not* handle the exception-specification for FNTYPE, because the
11419 initial substitution of explicitly provided template parameters
11420 during argument deduction forbids substitution into the
11421 exception-specification:
11425 All references in the function type of the function template to the
11426 corresponding template parameters are replaced by the specified tem-
11427 plate argument values. If a substitution in a template parameter or
11428 in the function type of the function template results in an invalid
11429 type, type deduction fails. [Note: The equivalent substitution in
11430 exception specifications is done only when the function is instanti-
11431 ated, at which point a program is ill-formed if the substitution
11432 results in an invalid type.] */
11435 tsubst_function_type (tree t
,
11437 tsubst_flags_t complain
,
11441 tree arg_types
= NULL_TREE
;
11444 /* The TYPE_CONTEXT is not used for function/method types. */
11445 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11447 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
11449 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
11451 if (late_return_type_p
)
11453 /* Substitute the argument types. */
11454 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11455 complain
, in_decl
);
11456 if (arg_types
== error_mark_node
)
11457 return error_mark_node
;
11459 tree save_ccp
= current_class_ptr
;
11460 tree save_ccr
= current_class_ref
;
11461 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
11462 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
11463 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
11466 /* DR 1207: 'this' is in scope in the trailing return type. */
11467 inject_this_parameter (this_type
, cp_type_quals (this_type
));
11470 /* Substitute the return type. */
11471 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11475 current_class_ptr
= save_ccp
;
11476 current_class_ref
= save_ccr
;
11480 /* Substitute the return type. */
11481 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11483 if (return_type
== error_mark_node
)
11484 return error_mark_node
;
11485 /* DR 486 clarifies that creation of a function type with an
11486 invalid return type is a deduction failure. */
11487 if (TREE_CODE (return_type
) == ARRAY_TYPE
11488 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11490 if (complain
& tf_error
)
11492 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11493 error ("function returning an array");
11495 error ("function returning a function");
11497 return error_mark_node
;
11500 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11501 return error_mark_node
;
11503 if (!late_return_type_p
)
11505 /* Substitute the argument types. */
11506 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11507 complain
, in_decl
);
11508 if (arg_types
== error_mark_node
)
11509 return error_mark_node
;
11512 /* Construct a new type node and return it. */
11513 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11515 fntype
= build_function_type (return_type
, arg_types
);
11516 fntype
= apply_memfn_quals (fntype
,
11517 type_memfn_quals (t
),
11518 type_memfn_rqual (t
));
11522 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11523 /* Don't pick up extra function qualifiers from the basetype. */
11524 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11525 if (! MAYBE_CLASS_TYPE_P (r
))
11529 Type deduction may fail for any of the following
11532 -- Attempting to create "pointer to member of T" when T
11533 is not a class type. */
11534 if (complain
& tf_error
)
11535 error ("creating pointer to member function of non-class type %qT",
11537 return error_mark_node
;
11540 fntype
= build_method_type_directly (r
, return_type
,
11541 TREE_CHAIN (arg_types
));
11542 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11544 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11546 if (late_return_type_p
)
11547 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
11552 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11553 ARGS into that specification, and return the substituted
11554 specification. If there is no specification, return NULL_TREE. */
11557 tsubst_exception_specification (tree fntype
,
11559 tsubst_flags_t complain
,
11566 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11567 new_specs
= NULL_TREE
;
11568 if (specs
&& TREE_PURPOSE (specs
))
11570 /* A noexcept-specifier. */
11571 tree expr
= TREE_PURPOSE (specs
);
11572 if (TREE_CODE (expr
) == INTEGER_CST
)
11576 /* Defer instantiation of noexcept-specifiers to avoid
11577 excessive instantiations (c++/49107). */
11578 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11579 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11581 /* We already partially instantiated this member template,
11582 so combine the new args with the old. */
11583 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11584 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11585 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11586 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11590 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11591 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11595 new_specs
= tsubst_copy_and_build
11596 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11597 /*integral_constant_expression_p=*/true);
11598 new_specs
= build_noexcept_spec (new_specs
, complain
);
11602 if (! TREE_VALUE (specs
))
11609 tree expanded_specs
= NULL_TREE
;
11611 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11613 /* Expand the pack expansion type. */
11614 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11618 if (expanded_specs
== error_mark_node
)
11619 return error_mark_node
;
11620 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11621 len
= TREE_VEC_LENGTH (expanded_specs
);
11624 /* We're substituting into a member template, so
11625 we got a TYPE_PACK_EXPANSION back. Add that
11626 expansion and move on. */
11627 gcc_assert (TREE_CODE (expanded_specs
)
11628 == TYPE_PACK_EXPANSION
);
11629 new_specs
= add_exception_specifier (new_specs
,
11632 specs
= TREE_CHAIN (specs
);
11637 for (i
= 0; i
< len
; ++i
)
11639 if (expanded_specs
)
11640 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11642 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11643 if (spec
== error_mark_node
)
11645 new_specs
= add_exception_specifier (new_specs
, spec
,
11649 specs
= TREE_CHAIN (specs
);
11655 /* Take the tree structure T and replace template parameters used
11656 therein with the argument vector ARGS. IN_DECL is an associated
11657 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11658 Issue error and warning messages under control of COMPLAIN. Note
11659 that we must be relatively non-tolerant of extensions here, in
11660 order to preserve conformance; if we allow substitutions that
11661 should not be allowed, we may allow argument deductions that should
11662 not succeed, and therefore report ambiguous overload situations
11663 where there are none. In theory, we could allow the substitution,
11664 but indicate that it should have failed, and allow our caller to
11665 make sure that the right thing happens, but we don't try to do this
11668 This function is used for dealing with types, decls and the like;
11669 for expressions, use tsubst_expr or tsubst_copy. */
11672 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11674 enum tree_code code
;
11675 tree type
, r
= NULL_TREE
;
11677 if (t
== NULL_TREE
|| t
== error_mark_node
11678 || t
== integer_type_node
11679 || t
== void_type_node
11680 || t
== char_type_node
11681 || t
== unknown_type_node
11682 || TREE_CODE (t
) == NAMESPACE_DECL
11683 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11687 return tsubst_decl (t
, args
, complain
);
11689 if (args
== NULL_TREE
)
11692 code
= TREE_CODE (t
);
11694 if (code
== IDENTIFIER_NODE
)
11695 type
= IDENTIFIER_TYPE_VALUE (t
);
11697 type
= TREE_TYPE (t
);
11699 gcc_assert (type
!= unknown_type_node
);
11701 /* Reuse typedefs. We need to do this to handle dependent attributes,
11702 such as attribute aligned. */
11704 && typedef_variant_p (t
))
11706 tree decl
= TYPE_NAME (t
);
11708 if (alias_template_specialization_p (t
))
11710 /* DECL represents an alias template and we want to
11712 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11713 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11714 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11716 else if (DECL_CLASS_SCOPE_P (decl
)
11717 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11718 && uses_template_parms (DECL_CONTEXT (decl
)))
11720 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11721 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11722 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11724 else if (DECL_FUNCTION_SCOPE_P (decl
)
11725 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11726 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11727 r
= retrieve_local_specialization (decl
);
11729 /* The typedef is from a non-template context. */
11735 r
= cp_build_qualified_type_real
11736 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11737 complain
| tf_ignore_bad_quals
);
11742 /* We don't have an instantiation yet, so drop the typedef. */
11743 int quals
= cp_type_quals (t
);
11744 t
= DECL_ORIGINAL_TYPE (decl
);
11745 t
= cp_build_qualified_type_real (t
, quals
,
11746 complain
| tf_ignore_bad_quals
);
11751 && code
!= TYPENAME_TYPE
11752 && code
!= TEMPLATE_TYPE_PARM
11753 && code
!= IDENTIFIER_NODE
11754 && code
!= FUNCTION_TYPE
11755 && code
!= METHOD_TYPE
)
11756 type
= tsubst (type
, args
, complain
, in_decl
);
11757 if (type
== error_mark_node
)
11758 return error_mark_node
;
11764 case ENUMERAL_TYPE
:
11765 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11766 /*entering_scope=*/0);
11769 case IDENTIFIER_NODE
:
11780 if (t
== integer_type_node
)
11783 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11784 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11788 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11790 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11791 /*integral_constant_expression_p=*/false);
11793 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11795 if (TREE_CODE (max
) == NOP_EXPR
11796 && TREE_SIDE_EFFECTS (omax
)
11797 && !TREE_TYPE (max
))
11798 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11800 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11801 with TREE_SIDE_EFFECTS that indicates this is not an integral
11802 constant expression. */
11803 if (processing_template_decl
11804 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11806 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11807 TREE_SIDE_EFFECTS (max
) = 1;
11810 return compute_array_index_type (NULL_TREE
, max
, complain
);
11813 case TEMPLATE_TYPE_PARM
:
11814 case TEMPLATE_TEMPLATE_PARM
:
11815 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11816 case TEMPLATE_PARM_INDEX
:
11821 tree arg
= NULL_TREE
;
11825 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11826 template_parm_level_and_index (t
, &level
, &idx
);
11828 levels
= TMPL_ARGS_DEPTH (args
);
11829 if (level
<= levels
)
11831 arg
= TMPL_ARG (args
, level
, idx
);
11833 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11835 /* See through ARGUMENT_PACK_SELECT arguments. */
11836 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11837 /* If the selected argument is an expansion E, that most
11838 likely means we were called from
11839 gen_elem_of_pack_expansion_instantiation during the
11840 substituting of pack an argument pack (which Ith
11841 element is a pack expansion, where I is
11842 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11843 In this case, the Ith element resulting from this
11844 substituting is going to be a pack expansion, which
11845 pattern is the pattern of E. Let's return the
11847 gen_elem_of_pack_expansion_instantiation will
11848 build the resulting pack expansion from it. */
11849 if (PACK_EXPANSION_P (arg
))
11851 /* Make sure we aren't throwing away arg info. */
11852 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
11853 arg
= PACK_EXPANSION_PATTERN (arg
);
11858 if (arg
== error_mark_node
)
11859 return error_mark_node
;
11860 else if (arg
!= NULL_TREE
)
11862 if (ARGUMENT_PACK_P (arg
))
11863 /* If ARG is an argument pack, we don't actually want to
11864 perform a substitution here, because substitutions
11865 for argument packs are only done
11866 element-by-element. We can get to this point when
11867 substituting the type of a non-type template
11868 parameter pack, when that type actually contains
11869 template parameter packs from an outer template, e.g.,
11871 template<typename... Types> struct A {
11872 template<Types... Values> struct B { };
11876 if (code
== TEMPLATE_TYPE_PARM
)
11879 gcc_assert (TYPE_P (arg
));
11881 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11883 return cp_build_qualified_type_real
11884 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11886 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11888 /* We are processing a type constructed from a
11889 template template parameter. */
11890 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11891 args
, complain
, in_decl
);
11892 if (argvec
== error_mark_node
)
11893 return error_mark_node
;
11895 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11896 || TREE_CODE (arg
) == TEMPLATE_DECL
11897 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11899 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11900 /* Consider this code:
11902 template <template <class> class Template>
11904 template <class Arg> using Bind = Template<Arg>;
11907 template <template <class> class Template, class Arg>
11908 using Instantiate = Template<Arg>; //#0
11910 template <template <class> class Template,
11913 Instantiate<Internal<Template>::template Bind,
11916 When #1 is parsed, the
11917 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11918 parameter `Template' in #0 matches the
11919 UNBOUND_CLASS_TEMPLATE representing the argument
11920 `Internal<Template>::template Bind'; We then want
11921 to assemble the type `Bind<Argument>' that can't
11922 be fully created right now, because
11923 `Internal<Template>' not being complete, the Bind
11924 template cannot be looked up in that context. So
11925 we need to "store" `Bind<Argument>' for later
11926 when the context of Bind becomes complete. Let's
11927 store that in a TYPENAME_TYPE. */
11928 return make_typename_type (TYPE_CONTEXT (arg
),
11929 build_nt (TEMPLATE_ID_EXPR
,
11930 TYPE_IDENTIFIER (arg
),
11935 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11936 are resolving nested-types in the signature of a
11937 member function templates. Otherwise ARG is a
11938 TEMPLATE_DECL and is the real template to be
11940 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11941 arg
= TYPE_NAME (arg
);
11943 r
= lookup_template_class (arg
,
11945 DECL_CONTEXT (arg
),
11946 /*entering_scope=*/0,
11948 return cp_build_qualified_type_real
11949 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
11952 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11953 return convert_from_reference (unshare_expr (arg
));
11957 /* This can happen during the attempted tsubst'ing in
11958 unify. This means that we don't yet have any information
11959 about the template parameter in question. */
11962 /* Early in template argument deduction substitution, we don't
11963 want to reduce the level of 'auto', or it will be confused
11964 with a normal template parm in subsequent deduction. */
11965 if (is_auto (t
) && (complain
& tf_partial
))
11968 /* If we get here, we must have been looking at a parm for a
11969 more deeply nested template. Make a new version of this
11970 template parameter, but with a lower level. */
11973 case TEMPLATE_TYPE_PARM
:
11974 case TEMPLATE_TEMPLATE_PARM
:
11975 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11976 if (cp_type_quals (t
))
11978 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11979 r
= cp_build_qualified_type_real
11980 (r
, cp_type_quals (t
),
11981 complain
| (code
== TEMPLATE_TYPE_PARM
11982 ? tf_ignore_bad_quals
: 0));
11987 TEMPLATE_TYPE_PARM_INDEX (r
)
11988 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11989 r
, levels
, args
, complain
);
11990 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11991 TYPE_MAIN_VARIANT (r
) = r
;
11992 TYPE_POINTER_TO (r
) = NULL_TREE
;
11993 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11995 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11996 /* We have reduced the level of the template
11997 template parameter, but not the levels of its
11998 template parameters, so canonical_type_parameter
11999 will not be able to find the canonical template
12000 template parameter for this level. Thus, we
12001 require structural equality checking to compare
12002 TEMPLATE_TEMPLATE_PARMs. */
12003 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12004 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12005 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12007 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12009 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12011 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12012 complain
, in_decl
);
12013 if (argvec
== error_mark_node
)
12014 return error_mark_node
;
12016 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
12017 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
12022 case TEMPLATE_PARM_INDEX
:
12023 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
12027 gcc_unreachable ();
12035 tree purpose
, value
, chain
;
12037 if (t
== void_list_node
)
12040 purpose
= TREE_PURPOSE (t
);
12043 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
12044 if (purpose
== error_mark_node
)
12045 return error_mark_node
;
12047 value
= TREE_VALUE (t
);
12050 value
= tsubst (value
, args
, complain
, in_decl
);
12051 if (value
== error_mark_node
)
12052 return error_mark_node
;
12054 chain
= TREE_CHAIN (t
);
12055 if (chain
&& chain
!= void_type_node
)
12057 chain
= tsubst (chain
, args
, complain
, in_decl
);
12058 if (chain
== error_mark_node
)
12059 return error_mark_node
;
12061 if (purpose
== TREE_PURPOSE (t
)
12062 && value
== TREE_VALUE (t
)
12063 && chain
== TREE_CHAIN (t
))
12065 return hash_tree_cons (purpose
, value
, chain
);
12069 /* We should never be tsubsting a binfo. */
12070 gcc_unreachable ();
12073 /* A vector of template arguments. */
12074 gcc_assert (!type
);
12075 return tsubst_template_args (t
, args
, complain
, in_decl
);
12078 case REFERENCE_TYPE
:
12080 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12085 Type deduction may fail for any of the following
12088 -- Attempting to create a pointer to reference type.
12089 -- Attempting to create a reference to a reference type or
12090 a reference to void.
12092 Core issue 106 says that creating a reference to a reference
12093 during instantiation is no longer a cause for failure. We
12094 only enforce this check in strict C++98 mode. */
12095 if ((TREE_CODE (type
) == REFERENCE_TYPE
12096 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12097 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12099 static location_t last_loc
;
12101 /* We keep track of the last time we issued this error
12102 message to avoid spewing a ton of messages during a
12103 single bad template instantiation. */
12104 if (complain
& tf_error
12105 && last_loc
!= input_location
)
12107 if (VOID_TYPE_P (type
))
12108 error ("forming reference to void");
12109 else if (code
== POINTER_TYPE
)
12110 error ("forming pointer to reference type %qT", type
);
12112 error ("forming reference to reference type %qT", type
);
12113 last_loc
= input_location
;
12116 return error_mark_node
;
12118 else if (TREE_CODE (type
) == FUNCTION_TYPE
12119 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12120 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12122 if (complain
& tf_error
)
12124 if (code
== POINTER_TYPE
)
12125 error ("forming pointer to qualified function type %qT",
12128 error ("forming reference to qualified function type %qT",
12131 return error_mark_node
;
12133 else if (code
== POINTER_TYPE
)
12135 r
= build_pointer_type (type
);
12136 if (TREE_CODE (type
) == METHOD_TYPE
)
12137 r
= build_ptrmemfunc_type (r
);
12139 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12140 /* In C++0x, during template argument substitution, when there is an
12141 attempt to create a reference to a reference type, reference
12142 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12144 "If a template-argument for a template-parameter T names a type
12145 that is a reference to a type A, an attempt to create the type
12146 'lvalue reference to cv T' creates the type 'lvalue reference to
12147 A,' while an attempt to create the type type rvalue reference to
12148 cv T' creates the type T"
12150 r
= cp_build_reference_type
12152 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12154 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12155 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12157 if (cxx_dialect
>= cxx14
12158 && !(TREE_CODE (t
) == REFERENCE_TYPE
&& REFERENCE_VLA_OK (t
))
12159 && array_of_runtime_bound_p (type
)
12160 && (flag_iso
|| warn_vla
> 0))
12162 if (complain
& tf_warning_or_error
)
12164 (input_location
, OPT_Wvla
,
12165 code
== REFERENCE_TYPE
12166 ? G_("cannot declare reference to array of runtime bound")
12167 : G_("cannot declare pointer to array of runtime bound"));
12169 r
= error_mark_node
;
12172 if (r
!= error_mark_node
)
12173 /* Will this ever be needed for TYPE_..._TO values? */
12180 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12181 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12185 Type deduction may fail for any of the following
12188 -- Attempting to create "pointer to member of T" when T
12189 is not a class type. */
12190 if (complain
& tf_error
)
12191 error ("creating pointer to member of non-class type %qT", r
);
12192 return error_mark_node
;
12194 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12196 if (complain
& tf_error
)
12197 error ("creating pointer to member reference type %qT", type
);
12198 return error_mark_node
;
12200 if (VOID_TYPE_P (type
))
12202 if (complain
& tf_error
)
12203 error ("creating pointer to member of type void");
12204 return error_mark_node
;
12206 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12207 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12209 /* The type of the implicit object parameter gets its
12210 cv-qualifiers from the FUNCTION_TYPE. */
12213 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12214 type_memfn_rqual (type
));
12215 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12216 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12220 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12224 case FUNCTION_TYPE
:
12229 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12230 if (fntype
== error_mark_node
)
12231 return error_mark_node
;
12233 /* Substitute the exception specification. */
12234 specs
= tsubst_exception_specification (t
, args
, complain
,
12235 in_decl
, /*defer_ok*/true);
12236 if (specs
== error_mark_node
)
12237 return error_mark_node
;
12239 fntype
= build_exception_variant (fntype
, specs
);
12244 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12245 if (domain
== error_mark_node
)
12246 return error_mark_node
;
12248 /* As an optimization, we avoid regenerating the array type if
12249 it will obviously be the same as T. */
12250 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12253 /* These checks should match the ones in create_array_type_for_decl.
12257 The deduction may fail for any of the following reasons:
12259 -- Attempting to create an array with an element type that
12260 is void, a function type, or a reference type, or [DR337]
12261 an abstract class type. */
12262 if (VOID_TYPE_P (type
)
12263 || TREE_CODE (type
) == FUNCTION_TYPE
12264 || (TREE_CODE (type
) == ARRAY_TYPE
12265 && TYPE_DOMAIN (type
) == NULL_TREE
)
12266 || TREE_CODE (type
) == REFERENCE_TYPE
)
12268 if (complain
& tf_error
)
12269 error ("creating array of %qT", type
);
12270 return error_mark_node
;
12273 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12274 return error_mark_node
;
12276 r
= build_cplus_array_type (type
, domain
);
12278 if (TYPE_USER_ALIGN (t
))
12280 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12281 TYPE_USER_ALIGN (r
) = 1;
12287 case TYPENAME_TYPE
:
12289 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12290 in_decl
, /*entering_scope=*/1);
12291 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12292 complain
, in_decl
);
12294 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12295 return error_mark_node
;
12297 if (!MAYBE_CLASS_TYPE_P (ctx
))
12299 if (complain
& tf_error
)
12300 error ("%qT is not a class, struct, or union type", ctx
);
12301 return error_mark_node
;
12303 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12305 /* Normally, make_typename_type does not require that the CTX
12306 have complete type in order to allow things like:
12308 template <class T> struct S { typename S<T>::X Y; };
12310 But, such constructs have already been resolved by this
12311 point, so here CTX really should have complete type, unless
12312 it's a partial instantiation. */
12313 ctx
= complete_type (ctx
);
12314 if (!COMPLETE_TYPE_P (ctx
))
12316 if (complain
& tf_error
)
12317 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12318 return error_mark_node
;
12322 f
= make_typename_type (ctx
, f
, typename_type
,
12323 complain
| tf_keep_type_decl
);
12324 if (f
== error_mark_node
)
12326 if (TREE_CODE (f
) == TYPE_DECL
)
12328 complain
|= tf_ignore_bad_quals
;
12332 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12334 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12336 if (complain
& tf_error
)
12337 error ("%qT resolves to %qT, which is not an enumeration type",
12340 return error_mark_node
;
12342 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12344 if (complain
& tf_error
)
12345 error ("%qT resolves to %qT, which is is not a class type",
12348 return error_mark_node
;
12352 return cp_build_qualified_type_real
12353 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12356 case UNBOUND_CLASS_TEMPLATE
:
12358 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12359 in_decl
, /*entering_scope=*/1);
12360 tree name
= TYPE_IDENTIFIER (t
);
12361 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12363 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12364 return error_mark_node
;
12367 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12368 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12375 ++cp_unevaluated_operand
;
12376 ++c_inhibit_evaluation_warnings
;
12378 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12380 /*integral_constant_expression_p=*/false);
12382 --cp_unevaluated_operand
;
12383 --c_inhibit_evaluation_warnings
;
12385 type
= finish_typeof (type
);
12386 return cp_build_qualified_type_real (type
,
12388 | cp_type_quals (type
),
12392 case DECLTYPE_TYPE
:
12396 ++cp_unevaluated_operand
;
12397 ++c_inhibit_evaluation_warnings
;
12399 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12400 complain
|tf_decltype
, in_decl
,
12401 /*function_p*/false,
12402 /*integral_constant_expression*/false);
12404 --cp_unevaluated_operand
;
12405 --c_inhibit_evaluation_warnings
;
12407 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12408 type
= lambda_capture_field_type (type
,
12409 DECLTYPE_FOR_INIT_CAPTURE (t
));
12410 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12411 type
= lambda_proxy_type (type
);
12414 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12415 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12417 /* In a template ~id could be either a complement expression
12418 or an unqualified-id naming a destructor; if instantiating
12419 it produces an expression, it's not an id-expression or
12422 type
= finish_decltype_type (type
, id
, complain
);
12424 return cp_build_qualified_type_real (type
,
12426 | cp_type_quals (type
),
12430 case UNDERLYING_TYPE
:
12432 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12433 complain
, in_decl
);
12434 return finish_underlying_type (type
);
12437 case TYPE_ARGUMENT_PACK
:
12438 case NONTYPE_ARGUMENT_PACK
:
12440 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12442 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12446 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12448 /* For template nontype argument packs, also substitute into
12450 if (code
== NONTYPE_ARGUMENT_PACK
)
12451 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12470 /* We should use one of the expression tsubsts for these codes. */
12471 gcc_unreachable ();
12474 sorry ("use of %qs in template", get_tree_code_name (code
));
12475 return error_mark_node
;
12479 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12480 type of the expression on the left-hand side of the "." or "->"
12484 tsubst_baselink (tree baselink
, tree object_type
,
12485 tree args
, tsubst_flags_t complain
, tree in_decl
)
12488 tree qualifying_scope
;
12491 tree template_args
= 0;
12492 bool template_id_p
= false;
12493 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12495 /* A baselink indicates a function from a base class. Both the
12496 BASELINK_ACCESS_BINFO and the base class referenced may
12497 indicate bases of the template class, rather than the
12498 instantiated class. In addition, lookups that were not
12499 ambiguous before may be ambiguous now. Therefore, we perform
12500 the lookup again. */
12501 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12502 qualifying_scope
= tsubst (qualifying_scope
, args
,
12503 complain
, in_decl
);
12504 fns
= BASELINK_FUNCTIONS (baselink
);
12505 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12506 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12508 template_id_p
= true;
12509 template_args
= TREE_OPERAND (fns
, 1);
12510 fns
= TREE_OPERAND (fns
, 0);
12512 template_args
= tsubst_template_args (template_args
, args
,
12513 complain
, in_decl
);
12515 name
= DECL_NAME (get_first_fn (fns
));
12516 if (IDENTIFIER_TYPENAME_P (name
))
12517 name
= mangle_conv_op_name_for_type (optype
);
12518 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12520 return error_mark_node
;
12522 /* If lookup found a single function, mark it as used at this
12523 point. (If it lookup found multiple functions the one selected
12524 later by overload resolution will be marked as used at that
12526 if (BASELINK_P (baselink
))
12527 fns
= BASELINK_FUNCTIONS (baselink
);
12528 if (!template_id_p
&& !really_overloaded_fn (fns
))
12529 mark_used (OVL_CURRENT (fns
));
12531 /* Add back the template arguments, if present. */
12532 if (BASELINK_P (baselink
) && template_id_p
)
12533 BASELINK_FUNCTIONS (baselink
)
12534 = build_nt (TEMPLATE_ID_EXPR
,
12535 BASELINK_FUNCTIONS (baselink
),
12537 /* Update the conversion operator type. */
12538 BASELINK_OPTYPE (baselink
) = optype
;
12541 object_type
= current_class_type
;
12544 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12550 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12551 true if the qualified-id will be a postfix-expression in-and-of
12552 itself; false if more of the postfix-expression follows the
12553 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12557 tsubst_qualified_id (tree qualified_id
, tree args
,
12558 tsubst_flags_t complain
, tree in_decl
,
12559 bool done
, bool address_p
)
12565 tree template_args
;
12566 location_t loc
= UNKNOWN_LOCATION
;
12568 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12570 /* Figure out what name to look up. */
12571 name
= TREE_OPERAND (qualified_id
, 1);
12572 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12574 is_template
= true;
12575 loc
= EXPR_LOCATION (name
);
12576 template_args
= TREE_OPERAND (name
, 1);
12578 template_args
= tsubst_template_args (template_args
, args
,
12579 complain
, in_decl
);
12580 name
= TREE_OPERAND (name
, 0);
12584 is_template
= false;
12585 template_args
= NULL_TREE
;
12588 /* Substitute into the qualifying scope. When there are no ARGS, we
12589 are just trying to simplify a non-dependent expression. In that
12590 case the qualifying scope may be dependent, and, in any case,
12591 substituting will not help. */
12592 scope
= TREE_OPERAND (qualified_id
, 0);
12595 scope
= tsubst (scope
, args
, complain
, in_decl
);
12596 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12601 if (dependent_scope_p (scope
))
12604 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12605 return build_qualified_name (NULL_TREE
, scope
, expr
,
12606 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12609 if (!BASELINK_P (name
) && !DECL_P (expr
))
12611 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12613 /* A BIT_NOT_EXPR is used to represent a destructor. */
12614 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12616 error ("qualifying type %qT does not match destructor name ~%qT",
12617 scope
, TREE_OPERAND (expr
, 0));
12618 expr
= error_mark_node
;
12621 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12622 /*is_type_p=*/0, false);
12625 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12626 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12627 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12629 if (complain
& tf_error
)
12631 error ("dependent-name %qE is parsed as a non-type, but "
12632 "instantiation yields a type", qualified_id
);
12633 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12635 return error_mark_node
;
12641 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12643 /* Remember that there was a reference to this entity. */
12647 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12649 if (complain
& tf_error
)
12650 qualified_name_lookup_error (scope
,
12651 TREE_OPERAND (qualified_id
, 1),
12652 expr
, input_location
);
12653 return error_mark_node
;
12657 expr
= lookup_template_function (expr
, template_args
);
12659 if (expr
== error_mark_node
&& complain
& tf_error
)
12660 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12661 expr
, input_location
);
12662 else if (TYPE_P (scope
))
12664 expr
= (adjust_result_of_qualified_name_lookup
12665 (expr
, scope
, current_nonlambda_class_type ()));
12666 expr
= (finish_qualified_id_expr
12667 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12668 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12669 /*template_arg_p=*/false, complain
));
12672 /* Expressions do not generally have reference type. */
12673 if (TREE_CODE (expr
) != SCOPE_REF
12674 /* However, if we're about to form a pointer-to-member, we just
12675 want the referenced member referenced. */
12676 && TREE_CODE (expr
) != OFFSET_REF
)
12677 expr
= convert_from_reference (expr
);
12682 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
12683 initializer, DECL is the substituted VAR_DECL. Other arguments are as
12687 tsubst_init (tree init
, tree decl
, tree args
,
12688 tsubst_flags_t complain
, tree in_decl
)
12693 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
12697 /* If we had an initializer but it
12698 instantiated to nothing,
12699 value-initialize the object. This will
12700 only occur when the initializer was a
12701 pack expansion where the parameter packs
12702 used in that expansion were of length
12704 init
= build_value_init (TREE_TYPE (decl
),
12706 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12707 init
= get_target_expr_sfinae (init
, complain
);
12713 /* Like tsubst, but deals with expressions. This function just replaces
12714 template parms; to finish processing the resultant expression, use
12715 tsubst_copy_and_build or tsubst_expr. */
12718 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12720 enum tree_code code
;
12723 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12726 code
= TREE_CODE (t
);
12731 r
= retrieve_local_specialization (t
);
12733 if (r
== NULL_TREE
)
12735 /* We get here for a use of 'this' in an NSDMI. */
12736 if (DECL_NAME (t
) == this_identifier
12737 && current_function_decl
12738 && DECL_CONSTRUCTOR_P (current_function_decl
))
12739 return current_class_ptr
;
12741 /* This can happen for a parameter name used later in a function
12742 declaration (such as in a late-specified return type). Just
12743 make a dummy decl, since it's only used for its type. */
12744 gcc_assert (cp_unevaluated_operand
!= 0);
12745 r
= tsubst_decl (t
, args
, complain
);
12746 /* Give it the template pattern as its context; its true context
12747 hasn't been instantiated yet and this is good enough for
12749 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12752 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12753 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12762 if (DECL_TEMPLATE_PARM_P (t
))
12763 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12764 /* There is no need to substitute into namespace-scope
12766 if (DECL_NAMESPACE_SCOPE_P (t
))
12768 /* If ARGS is NULL, then T is known to be non-dependent. */
12769 if (args
== NULL_TREE
)
12770 return integral_constant_value (t
);
12772 /* Unfortunately, we cannot just call lookup_name here.
12775 template <int I> int f() {
12777 struct S { void g() { E e = a; } };
12780 When we instantiate f<7>::S::g(), say, lookup_name is not
12781 clever enough to find f<7>::a. */
12783 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12784 /*entering_scope=*/0);
12786 for (v
= TYPE_VALUES (enum_type
);
12788 v
= TREE_CHAIN (v
))
12789 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12790 return TREE_VALUE (v
);
12792 /* We didn't find the name. That should never happen; if
12793 name-lookup found it during preliminary parsing, we
12794 should find it again here during instantiation. */
12795 gcc_unreachable ();
12800 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12802 /* Check for a local specialization set up by
12803 tsubst_pack_expansion. */
12804 if (tree r
= retrieve_local_specialization (t
))
12806 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12807 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12811 /* When retrieving a capture pack from a generic lambda, remove the
12812 lambda call op's own template argument list from ARGS. Only the
12813 template arguments active for the closure type should be used to
12814 retrieve the pack specialization. */
12815 if (LAMBDA_FUNCTION_P (current_function_decl
)
12816 && (template_class_depth (DECL_CONTEXT (t
))
12817 != TMPL_ARGS_DEPTH (args
)))
12818 args
= strip_innermost_template_args (args
, 1);
12820 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12821 tsubst_decl put in the hash table. */
12822 return retrieve_specialization (t
, args
, 0);
12825 if (DECL_CONTEXT (t
))
12829 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12830 /*entering_scope=*/1);
12831 if (ctx
!= DECL_CONTEXT (t
))
12833 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12836 if (complain
& tf_error
)
12837 error ("using invalid field %qD", t
);
12838 return error_mark_node
;
12847 case FUNCTION_DECL
:
12848 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12849 r
= tsubst (t
, args
, complain
, in_decl
);
12850 else if (local_variable_p (t
))
12852 r
= retrieve_local_specialization (t
);
12853 if (r
== NULL_TREE
)
12855 /* First try name lookup to find the instantiation. */
12856 r
= lookup_name (DECL_NAME (t
));
12859 /* Make sure that the one we found is the one we want. */
12860 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
12861 complain
, in_decl
);
12862 if (ctx
!= DECL_CONTEXT (r
))
12870 /* This can happen for a variable used in a
12871 late-specified return type of a local lambda, or for a
12872 local static or constant. Building a new VAR_DECL
12873 should be OK in all those cases. */
12874 r
= tsubst_decl (t
, args
, complain
);
12875 if (decl_maybe_constant_var_p (r
))
12877 /* We can't call cp_finish_decl, so handle the
12878 initializer by hand. */
12879 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
12880 complain
, in_decl
);
12881 if (!processing_template_decl
)
12882 init
= maybe_constant_init (init
);
12883 if (processing_template_decl
12884 ? potential_constant_expression (init
)
12885 : reduced_constant_expression_p (init
))
12886 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
12887 = TREE_CONSTANT (r
) = true;
12888 DECL_INITIAL (r
) = init
;
12890 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
12891 || decl_constant_var_p (r
)
12892 || errorcount
|| sorrycount
);
12893 if (!processing_template_decl
)
12895 if (TREE_STATIC (r
))
12896 rest_of_decl_compilation (r
, toplevel_bindings_p (),
12898 else if (decl_constant_var_p (r
))
12899 /* A use of a local constant decays to its value.
12900 FIXME update for core DR 696. */
12901 r
= integral_constant_value (r
);
12904 /* Remember this for subsequent uses. */
12905 if (local_specializations
)
12906 register_local_specialization (r
, t
);
12914 case NAMESPACE_DECL
:
12918 /* An OVERLOAD will always be a non-dependent overload set; an
12919 overload set from function scope will just be represented with an
12920 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12921 gcc_assert (!uses_template_parms (t
));
12925 return tsubst_baselink (t
, current_nonlambda_class_type (),
12926 args
, complain
, in_decl
);
12928 case TEMPLATE_DECL
:
12929 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12930 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12931 args
, complain
, in_decl
);
12932 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12933 return tsubst (t
, args
, complain
, in_decl
);
12934 else if (DECL_CLASS_SCOPE_P (t
)
12935 && uses_template_parms (DECL_CONTEXT (t
)))
12937 /* Template template argument like the following example need
12940 template <template <class> class TT> struct C {};
12941 template <class T> struct D {
12942 template <class U> struct E {};
12947 We are processing the template argument `E' in #1 for
12948 the template instantiation #2. Originally, `E' is a
12949 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12950 have to substitute this with one having context `D<int>'. */
12952 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12953 return lookup_field (context
, DECL_NAME(t
), 0, false);
12956 /* Ordinary template template argument. */
12960 case REINTERPRET_CAST_EXPR
:
12961 case CONST_CAST_EXPR
:
12962 case STATIC_CAST_EXPR
:
12963 case DYNAMIC_CAST_EXPR
:
12964 case IMPLICIT_CONV_EXPR
:
12968 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12969 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12970 return build1 (code
, type
, op0
);
12974 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12977 tree expanded
, op
= TREE_OPERAND (t
, 0);
12980 if (SIZEOF_EXPR_TYPE_P (t
))
12981 op
= TREE_TYPE (op
);
12983 ++cp_unevaluated_operand
;
12984 ++c_inhibit_evaluation_warnings
;
12985 /* We only want to compute the number of arguments. */
12986 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12987 --cp_unevaluated_operand
;
12988 --c_inhibit_evaluation_warnings
;
12990 if (TREE_CODE (expanded
) == TREE_VEC
)
12991 len
= TREE_VEC_LENGTH (expanded
);
12993 if (expanded
== error_mark_node
)
12994 return error_mark_node
;
12995 else if (PACK_EXPANSION_P (expanded
)
12996 || (TREE_CODE (expanded
) == TREE_VEC
12998 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13000 if (TREE_CODE (expanded
) == TREE_VEC
)
13001 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13003 if (TYPE_P (expanded
))
13004 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13005 complain
& tf_error
);
13007 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13008 complain
& tf_error
);
13011 return build_int_cst (size_type_node
, len
);
13013 if (SIZEOF_EXPR_TYPE_P (t
))
13015 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13016 args
, complain
, in_decl
);
13017 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13018 r
= build1 (SIZEOF_EXPR
,
13019 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13020 SIZEOF_EXPR_TYPE_P (r
) = 1;
13027 case TRUTH_NOT_EXPR
:
13030 case UNARY_PLUS_EXPR
: /* Unary + */
13032 case AT_ENCODE_EXPR
:
13036 case REALPART_EXPR
:
13037 case IMAGPART_EXPR
:
13040 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13041 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13042 return build1 (code
, type
, op0
);
13045 case COMPONENT_REF
:
13050 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13051 name
= TREE_OPERAND (t
, 1);
13052 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13054 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13055 complain
, in_decl
);
13056 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13058 else if (TREE_CODE (name
) == SCOPE_REF
13059 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13061 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13062 complain
, in_decl
);
13063 name
= TREE_OPERAND (name
, 1);
13064 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13065 complain
, in_decl
);
13066 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13067 name
= build_qualified_name (/*type=*/NULL_TREE
,
13069 /*template_p=*/false);
13071 else if (BASELINK_P (name
))
13072 name
= tsubst_baselink (name
,
13073 non_reference (TREE_TYPE (object
)),
13077 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13078 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13084 case TRUNC_DIV_EXPR
:
13085 case CEIL_DIV_EXPR
:
13086 case FLOOR_DIV_EXPR
:
13087 case ROUND_DIV_EXPR
:
13088 case EXACT_DIV_EXPR
:
13092 case TRUNC_MOD_EXPR
:
13093 case FLOOR_MOD_EXPR
:
13094 case TRUTH_ANDIF_EXPR
:
13095 case TRUTH_ORIF_EXPR
:
13096 case TRUTH_AND_EXPR
:
13097 case TRUTH_OR_EXPR
:
13110 case COMPOUND_EXPR
:
13113 case PREDECREMENT_EXPR
:
13114 case PREINCREMENT_EXPR
:
13115 case POSTDECREMENT_EXPR
:
13116 case POSTINCREMENT_EXPR
:
13118 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13119 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13120 return build_nt (code
, op0
, op1
);
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 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13128 QUALIFIED_NAME_IS_TEMPLATE (t
));
13133 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13134 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13135 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13140 int n
= VL_EXP_OPERAND_LENGTH (t
);
13141 tree result
= build_vl_exp (CALL_EXPR
, n
);
13143 for (i
= 0; i
< n
; i
++)
13144 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13145 complain
, in_decl
);
13151 case PSEUDO_DTOR_EXPR
:
13152 case VEC_PERM_EXPR
:
13154 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13155 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13156 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13157 r
= build_nt (code
, op0
, op1
, op2
);
13158 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13164 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13165 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13166 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13167 r
= build_nt (code
, op0
, op1
, op2
);
13168 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13174 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13175 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13176 r
= build_nt (code
, op0
, op1
);
13177 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13178 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13182 case TEMPLATE_ID_EXPR
:
13184 /* Substituted template arguments */
13185 tree fn
= TREE_OPERAND (t
, 0);
13186 tree targs
= TREE_OPERAND (t
, 1);
13188 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13190 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13192 return lookup_template_function (fn
, targs
);
13197 tree purpose
, value
, chain
;
13199 if (t
== void_list_node
)
13202 purpose
= TREE_PURPOSE (t
);
13204 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13205 value
= TREE_VALUE (t
);
13207 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13208 chain
= TREE_CHAIN (t
);
13209 if (chain
&& chain
!= void_type_node
)
13210 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13211 if (purpose
== TREE_PURPOSE (t
)
13212 && value
== TREE_VALUE (t
)
13213 && chain
== TREE_CHAIN (t
))
13215 return tree_cons (purpose
, value
, chain
);
13220 case ENUMERAL_TYPE
:
13222 case TEMPLATE_TYPE_PARM
:
13223 case TEMPLATE_TEMPLATE_PARM
:
13224 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13225 case TEMPLATE_PARM_INDEX
:
13227 case REFERENCE_TYPE
:
13229 case FUNCTION_TYPE
:
13232 case TYPENAME_TYPE
:
13233 case UNBOUND_CLASS_TEMPLATE
:
13235 case DECLTYPE_TYPE
:
13237 return tsubst (t
, args
, complain
, in_decl
);
13241 /* Fall through. */
13242 case IDENTIFIER_NODE
:
13243 if (IDENTIFIER_TYPENAME_P (t
))
13245 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13246 return mangle_conv_op_name_for_type (new_type
);
13252 /* This is handled by tsubst_copy_and_build. */
13253 gcc_unreachable ();
13257 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13258 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13259 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13262 case CLEANUP_POINT_EXPR
:
13263 /* We shouldn't have built any of these during initial template
13264 generation. Instead, they should be built during instantiation
13265 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13266 gcc_unreachable ();
13270 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13271 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13272 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13273 r
= build2 (code
, type
, op0
, op1
);
13274 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13275 mark_used (TREE_OPERAND (r
, 1));
13279 case EXPR_PACK_EXPANSION
:
13280 error ("invalid use of pack expansion expression");
13281 return error_mark_node
;
13283 case NONTYPE_ARGUMENT_PACK
:
13284 error ("use %<...%> to expand argument pack");
13285 return error_mark_node
;
13288 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
13296 /* Instantiate any typedefs in the type. */
13297 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13298 r
= fold_convert (type
, t
);
13299 gcc_assert (TREE_CODE (r
) == code
);
13304 /* These can sometimes show up in a partial instantiation, but never
13305 involve template parms. */
13306 gcc_assert (!uses_template_parms (t
));
13310 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13311 gcc_checking_assert (false);
13316 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13319 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13320 tree args
, tsubst_flags_t complain
, tree in_decl
)
13322 tree new_clauses
= NULL
, nc
, oc
;
13324 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13326 nc
= copy_node (oc
);
13327 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13330 switch (OMP_CLAUSE_CODE (nc
))
13332 case OMP_CLAUSE_LASTPRIVATE
:
13333 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13335 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13336 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13337 in_decl
, /*integral_constant_expression_p=*/false);
13338 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13339 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13342 case OMP_CLAUSE_PRIVATE
:
13343 case OMP_CLAUSE_SHARED
:
13344 case OMP_CLAUSE_FIRSTPRIVATE
:
13345 case OMP_CLAUSE_COPYIN
:
13346 case OMP_CLAUSE_COPYPRIVATE
:
13347 case OMP_CLAUSE_IF
:
13348 case OMP_CLAUSE_NUM_THREADS
:
13349 case OMP_CLAUSE_SCHEDULE
:
13350 case OMP_CLAUSE_COLLAPSE
:
13351 case OMP_CLAUSE_FINAL
:
13352 case OMP_CLAUSE_DEPEND
:
13353 case OMP_CLAUSE_FROM
:
13354 case OMP_CLAUSE_TO
:
13355 case OMP_CLAUSE_UNIFORM
:
13356 case OMP_CLAUSE_MAP
:
13357 case OMP_CLAUSE_DEVICE
:
13358 case OMP_CLAUSE_DIST_SCHEDULE
:
13359 case OMP_CLAUSE_NUM_TEAMS
:
13360 case OMP_CLAUSE_THREAD_LIMIT
:
13361 case OMP_CLAUSE_SAFELEN
:
13362 case OMP_CLAUSE_SIMDLEN
:
13363 OMP_CLAUSE_OPERAND (nc
, 0)
13364 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13365 in_decl
, /*integral_constant_expression_p=*/false);
13367 case OMP_CLAUSE_REDUCTION
:
13368 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13370 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13371 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13373 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13374 complain
, in_decl
);
13375 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13376 = build_qualified_name (NULL_TREE
, scope
,
13377 TREE_OPERAND (placeholder
, 1),
13381 gcc_assert (identifier_p (placeholder
));
13383 OMP_CLAUSE_OPERAND (nc
, 0)
13384 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13385 in_decl
, /*integral_constant_expression_p=*/false);
13387 case OMP_CLAUSE_LINEAR
:
13388 case OMP_CLAUSE_ALIGNED
:
13389 OMP_CLAUSE_OPERAND (nc
, 0)
13390 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13391 in_decl
, /*integral_constant_expression_p=*/false);
13392 OMP_CLAUSE_OPERAND (nc
, 1)
13393 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13394 in_decl
, /*integral_constant_expression_p=*/false);
13397 case OMP_CLAUSE_NOWAIT
:
13398 case OMP_CLAUSE_ORDERED
:
13399 case OMP_CLAUSE_DEFAULT
:
13400 case OMP_CLAUSE_UNTIED
:
13401 case OMP_CLAUSE_MERGEABLE
:
13402 case OMP_CLAUSE_INBRANCH
:
13403 case OMP_CLAUSE_NOTINBRANCH
:
13404 case OMP_CLAUSE_PROC_BIND
:
13405 case OMP_CLAUSE_FOR
:
13406 case OMP_CLAUSE_PARALLEL
:
13407 case OMP_CLAUSE_SECTIONS
:
13408 case OMP_CLAUSE_TASKGROUP
:
13411 gcc_unreachable ();
13415 new_clauses
= nreverse (new_clauses
);
13417 new_clauses
= finish_omp_clauses (new_clauses
);
13418 return new_clauses
;
13421 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13424 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13427 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13429 tree purpose
, value
, chain
;
13434 if (TREE_CODE (t
) != TREE_LIST
)
13435 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13436 /*function_p=*/false,
13437 /*integral_constant_expression_p=*/false);
13439 if (t
== void_list_node
)
13442 purpose
= TREE_PURPOSE (t
);
13444 purpose
= RECUR (purpose
);
13445 value
= TREE_VALUE (t
);
13448 if (TREE_CODE (value
) != LABEL_DECL
)
13449 value
= RECUR (value
);
13452 value
= lookup_label (DECL_NAME (value
));
13453 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13454 TREE_USED (value
) = 1;
13457 chain
= TREE_CHAIN (t
);
13458 if (chain
&& chain
!= void_type_node
)
13459 chain
= RECUR (chain
);
13460 return tree_cons (purpose
, value
, chain
);
13464 /* Substitute one OMP_FOR iterator. */
13467 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13468 tree condv
, tree incrv
, tree
*clauses
,
13469 tree args
, tsubst_flags_t complain
, tree in_decl
,
13470 bool integral_constant_expression_p
)
13472 #define RECUR(NODE) \
13473 tsubst_expr ((NODE), args, complain, in_decl, \
13474 integral_constant_expression_p)
13475 tree decl
, init
, cond
, incr
;
13477 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13478 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13479 decl
= TREE_OPERAND (init
, 0);
13480 init
= TREE_OPERAND (init
, 1);
13481 tree decl_expr
= NULL_TREE
;
13482 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13484 /* We need to jump through some hoops to handle declarations in the
13485 for-init-statement, since we might need to handle auto deduction,
13486 but we need to keep control of initialization. */
13488 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13489 decl
= tsubst_decl (decl
, args
, complain
);
13492 decl
= RECUR (decl
);
13493 init
= RECUR (init
);
13495 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13496 if (auto_node
&& init
)
13498 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13500 gcc_assert (!type_dependent_expression_p (decl
));
13502 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13506 /* Declare the variable, but don't let that initialize it. */
13507 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13508 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13510 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13513 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13514 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13515 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13517 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13518 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
13519 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
13520 NOP_EXPR
, rhs
, complain
);
13523 incr
= RECUR (incr
);
13524 TREE_VEC_ELT (declv
, i
) = decl
;
13525 TREE_VEC_ELT (initv
, i
) = init
;
13526 TREE_VEC_ELT (condv
, i
) = cond
;
13527 TREE_VEC_ELT (incrv
, i
) = incr
;
13533 /* Declare and initialize the variable. */
13540 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13542 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13543 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13544 && OMP_CLAUSE_DECL (c
) == decl
)
13546 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13547 && OMP_CLAUSE_DECL (c
) == decl
)
13548 error ("iteration variable %qD should not be firstprivate", decl
);
13549 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13550 && OMP_CLAUSE_DECL (c
) == decl
)
13551 error ("iteration variable %qD should not be reduction", decl
);
13555 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13556 OMP_CLAUSE_DECL (c
) = decl
;
13557 c
= finish_omp_clauses (c
);
13560 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13565 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13566 if (COMPARISON_CLASS_P (cond
))
13568 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
13569 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
13570 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
13573 cond
= RECUR (cond
);
13574 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13575 switch (TREE_CODE (incr
))
13577 case PREINCREMENT_EXPR
:
13578 case PREDECREMENT_EXPR
:
13579 case POSTINCREMENT_EXPR
:
13580 case POSTDECREMENT_EXPR
:
13581 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13582 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13585 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13586 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13588 tree rhs
= TREE_OPERAND (incr
, 1);
13589 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13590 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13591 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13592 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13593 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13597 incr
= RECUR (incr
);
13600 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13601 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13603 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13604 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13605 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13606 TREE_TYPE (decl
), lhs
,
13607 RECUR (TREE_OPERAND (incr
, 2))));
13609 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13610 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13611 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13613 tree rhs
= TREE_OPERAND (incr
, 2);
13614 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13615 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13616 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13617 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13618 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13622 incr
= RECUR (incr
);
13625 incr
= RECUR (incr
);
13629 TREE_VEC_ELT (declv
, i
) = decl
;
13630 TREE_VEC_ELT (initv
, i
) = init
;
13631 TREE_VEC_ELT (condv
, i
) = cond
;
13632 TREE_VEC_ELT (incrv
, i
) = incr
;
13636 /* Like tsubst_copy for expressions, etc. but also does semantic
13640 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13641 bool integral_constant_expression_p
)
13643 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13644 #define RECUR(NODE) \
13645 tsubst_expr ((NODE), args, complain, in_decl, \
13646 integral_constant_expression_p)
13652 if (t
== NULL_TREE
|| t
== error_mark_node
)
13655 loc
= input_location
;
13656 if (EXPR_HAS_LOCATION (t
))
13657 input_location
= EXPR_LOCATION (t
);
13658 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13659 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13661 switch (TREE_CODE (t
))
13663 case STATEMENT_LIST
:
13665 tree_stmt_iterator i
;
13666 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13667 RECUR (tsi_stmt (i
));
13671 case CTOR_INITIALIZER
:
13672 finish_mem_initializers (tsubst_initializer_list
13673 (TREE_OPERAND (t
, 0), args
));
13677 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13681 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13682 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13683 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13685 finish_expr_stmt (tmp
);
13689 do_using_directive (USING_STMT_NAMESPACE (t
));
13694 tree decl
, pattern_decl
;
13697 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13698 if (TREE_CODE (decl
) == LABEL_DECL
)
13699 finish_label_decl (DECL_NAME (decl
));
13700 else if (TREE_CODE (decl
) == USING_DECL
)
13702 tree scope
= USING_DECL_SCOPE (decl
);
13703 tree name
= DECL_NAME (decl
);
13706 scope
= tsubst (scope
, args
, complain
, in_decl
);
13707 decl
= lookup_qualified_name (scope
, name
,
13708 /*is_type_p=*/false,
13709 /*complain=*/false);
13710 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13711 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13713 do_local_using_decl (decl
, scope
, name
);
13715 else if (DECL_PACK_P (decl
))
13717 /* Don't build up decls for a variadic capture proxy, we'll
13718 instantiate the elements directly as needed. */
13723 init
= DECL_INITIAL (decl
);
13724 decl
= tsubst (decl
, args
, complain
, in_decl
);
13725 if (decl
!= error_mark_node
)
13727 /* By marking the declaration as instantiated, we avoid
13728 trying to instantiate it. Since instantiate_decl can't
13729 handle local variables, and since we've already done
13730 all that needs to be done, that's the right thing to
13733 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13735 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13736 /* Anonymous aggregates are a special case. */
13737 finish_anon_union (decl
);
13738 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13740 DECL_CONTEXT (decl
) = current_function_decl
;
13741 if (DECL_NAME (decl
) == this_identifier
)
13743 tree lam
= DECL_CONTEXT (current_function_decl
);
13744 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13745 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13747 insert_capture_proxy (decl
);
13749 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13750 /* We already did a pushtag. */;
13751 else if (TREE_CODE (decl
) == FUNCTION_DECL
13752 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
13753 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
13755 DECL_CONTEXT (decl
) = NULL_TREE
;
13757 DECL_CONTEXT (decl
) = current_function_decl
;
13758 cp_check_omp_declare_reduction (decl
);
13762 int const_init
= false;
13763 maybe_push_decl (decl
);
13765 && DECL_PRETTY_FUNCTION_P (decl
))
13767 /* For __PRETTY_FUNCTION__ we have to adjust the
13769 const char *const name
13770 = cxx_printable_name (current_function_decl
, 2);
13771 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
13774 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
13777 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13779 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13788 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13789 RECUR (FOR_INIT_STMT (t
));
13790 finish_for_init_stmt (stmt
);
13791 tmp
= RECUR (FOR_COND (t
));
13792 finish_for_cond (tmp
, stmt
, false);
13793 tmp
= RECUR (FOR_EXPR (t
));
13794 finish_for_expr (tmp
, stmt
);
13795 RECUR (FOR_BODY (t
));
13796 finish_for_stmt (stmt
);
13799 case RANGE_FOR_STMT
:
13802 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13803 decl
= RANGE_FOR_DECL (t
);
13804 decl
= tsubst (decl
, args
, complain
, in_decl
);
13805 maybe_push_decl (decl
);
13806 expr
= RECUR (RANGE_FOR_EXPR (t
));
13807 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
13808 RECUR (RANGE_FOR_BODY (t
));
13809 finish_for_stmt (stmt
);
13814 stmt
= begin_while_stmt ();
13815 tmp
= RECUR (WHILE_COND (t
));
13816 finish_while_stmt_cond (tmp
, stmt
, false);
13817 RECUR (WHILE_BODY (t
));
13818 finish_while_stmt (stmt
);
13822 stmt
= begin_do_stmt ();
13823 RECUR (DO_BODY (t
));
13824 finish_do_body (stmt
);
13825 tmp
= RECUR (DO_COND (t
));
13826 finish_do_stmt (tmp
, stmt
, false);
13830 stmt
= begin_if_stmt ();
13831 tmp
= RECUR (IF_COND (t
));
13832 finish_if_stmt_cond (tmp
, stmt
);
13833 RECUR (THEN_CLAUSE (t
));
13834 finish_then_clause (stmt
);
13836 if (ELSE_CLAUSE (t
))
13838 begin_else_clause (stmt
);
13839 RECUR (ELSE_CLAUSE (t
));
13840 finish_else_clause (stmt
);
13843 finish_if_stmt (stmt
);
13847 if (BIND_EXPR_BODY_BLOCK (t
))
13848 stmt
= begin_function_body ();
13850 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13851 ? BCS_TRY_BLOCK
: 0);
13853 RECUR (BIND_EXPR_BODY (t
));
13855 if (BIND_EXPR_BODY_BLOCK (t
))
13856 finish_function_body (stmt
);
13858 finish_compound_stmt (stmt
);
13862 finish_break_stmt ();
13865 case CONTINUE_STMT
:
13866 finish_continue_stmt ();
13870 stmt
= begin_switch_stmt ();
13871 tmp
= RECUR (SWITCH_STMT_COND (t
));
13872 finish_switch_cond (tmp
, stmt
);
13873 RECUR (SWITCH_STMT_BODY (t
));
13874 finish_switch_stmt (stmt
);
13877 case CASE_LABEL_EXPR
:
13879 tree low
= RECUR (CASE_LOW (t
));
13880 tree high
= RECUR (CASE_HIGH (t
));
13881 finish_case_label (EXPR_LOCATION (t
), low
, high
);
13887 tree decl
= LABEL_EXPR_LABEL (t
);
13890 label
= finish_label_stmt (DECL_NAME (decl
));
13891 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13892 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13897 tmp
= GOTO_DESTINATION (t
);
13898 if (TREE_CODE (tmp
) != LABEL_DECL
)
13899 /* Computed goto's must be tsubst'd into. On the other hand,
13900 non-computed gotos must not be; the identifier in question
13901 will have no binding. */
13904 tmp
= DECL_NAME (tmp
);
13905 finish_goto_stmt (tmp
);
13910 tree string
= RECUR (ASM_STRING (t
));
13911 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
13912 complain
, in_decl
);
13913 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
13914 complain
, in_decl
);
13915 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
13916 complain
, in_decl
);
13917 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
13918 complain
, in_decl
);
13919 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
13921 tree asm_expr
= tmp
;
13922 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13923 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13924 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13931 stmt
= begin_try_block ();
13932 RECUR (TRY_STMTS (t
));
13933 finish_cleanup_try_block (stmt
);
13934 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13938 tree compound_stmt
= NULL_TREE
;
13940 if (FN_TRY_BLOCK_P (t
))
13941 stmt
= begin_function_try_block (&compound_stmt
);
13943 stmt
= begin_try_block ();
13945 RECUR (TRY_STMTS (t
));
13947 if (FN_TRY_BLOCK_P (t
))
13948 finish_function_try_block (stmt
);
13950 finish_try_block (stmt
);
13952 RECUR (TRY_HANDLERS (t
));
13953 if (FN_TRY_BLOCK_P (t
))
13954 finish_function_handler_sequence (stmt
, compound_stmt
);
13956 finish_handler_sequence (stmt
);
13962 tree decl
= HANDLER_PARMS (t
);
13966 decl
= tsubst (decl
, args
, complain
, in_decl
);
13967 /* Prevent instantiate_decl from trying to instantiate
13968 this variable. We've already done all that needs to be
13970 if (decl
!= error_mark_node
)
13971 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13973 stmt
= begin_handler ();
13974 finish_handler_parms (decl
, stmt
);
13975 RECUR (HANDLER_BODY (t
));
13976 finish_handler (stmt
);
13981 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13982 if (CLASS_TYPE_P (tmp
))
13984 /* Local classes are not independent templates; they are
13985 instantiated along with their containing function. And this
13986 way we don't have to deal with pushing out of one local class
13987 to instantiate a member of another local class. */
13989 /* Closures are handled by the LAMBDA_EXPR. */
13990 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13991 complete_type (tmp
);
13992 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13993 if (!DECL_ARTIFICIAL (fn
))
13994 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13998 case STATIC_ASSERT
:
14002 ++c_inhibit_evaluation_warnings
;
14004 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
14007 /*integral_constant_expression_p=*/true);
14008 --c_inhibit_evaluation_warnings
;
14010 finish_static_assert (condition
,
14011 STATIC_ASSERT_MESSAGE (t
),
14012 STATIC_ASSERT_SOURCE_LOCATION (t
),
14013 /*member_p=*/false);
14018 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
14019 args
, complain
, in_decl
);
14020 stmt
= begin_omp_parallel ();
14021 RECUR (OMP_PARALLEL_BODY (t
));
14022 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
14023 = OMP_PARALLEL_COMBINED (t
);
14027 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
14028 args
, complain
, in_decl
);
14029 stmt
= begin_omp_task ();
14030 RECUR (OMP_TASK_BODY (t
));
14031 finish_omp_task (tmp
, stmt
);
14038 case OMP_DISTRIBUTE
:
14040 tree clauses
, body
, pre_body
;
14041 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
14042 tree incrv
= NULL_TREE
;
14045 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
14046 args
, complain
, in_decl
);
14047 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14049 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14050 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14051 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14052 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14055 stmt
= begin_omp_structured_block ();
14057 pre_body
= push_stmt_list ();
14058 RECUR (OMP_FOR_PRE_BODY (t
));
14059 pre_body
= pop_stmt_list (pre_body
);
14061 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14062 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14063 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14064 &clauses
, args
, complain
, in_decl
,
14065 integral_constant_expression_p
);
14067 body
= push_stmt_list ();
14068 RECUR (OMP_FOR_BODY (t
));
14069 body
= pop_stmt_list (body
);
14071 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14072 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14073 condv
, incrv
, body
, pre_body
, clauses
);
14076 t
= make_node (TREE_CODE (t
));
14077 TREE_TYPE (t
) = void_type_node
;
14078 OMP_FOR_BODY (t
) = body
;
14079 OMP_FOR_PRE_BODY (t
) = pre_body
;
14080 OMP_FOR_CLAUSES (t
) = clauses
;
14081 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14085 add_stmt (finish_omp_structured_block (stmt
));
14092 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14093 args
, complain
, in_decl
);
14094 stmt
= push_stmt_list ();
14095 RECUR (OMP_BODY (t
));
14096 stmt
= pop_stmt_list (stmt
);
14099 OMP_BODY (t
) = stmt
;
14100 OMP_CLAUSES (t
) = tmp
;
14104 case OMP_TARGET_DATA
:
14106 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14107 args
, complain
, in_decl
);
14108 keep_next_level (true);
14109 stmt
= begin_omp_structured_block ();
14111 RECUR (OMP_BODY (t
));
14112 stmt
= finish_omp_structured_block (stmt
);
14115 OMP_BODY (t
) = stmt
;
14116 OMP_CLAUSES (t
) = tmp
;
14120 case OMP_TARGET_UPDATE
:
14121 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14122 args
, complain
, in_decl
);
14124 OMP_CLAUSES (t
) = tmp
;
14131 case OMP_TASKGROUP
:
14133 stmt
= push_stmt_list ();
14134 RECUR (OMP_BODY (t
));
14135 stmt
= pop_stmt_list (stmt
);
14138 OMP_BODY (t
) = stmt
;
14143 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14144 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14146 tree op1
= TREE_OPERAND (t
, 1);
14147 tree rhs1
= NULL_TREE
;
14149 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14151 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14152 op1
= TREE_OPERAND (op1
, 1);
14154 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14155 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14156 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14157 NULL_TREE
, NULL_TREE
, rhs1
,
14158 OMP_ATOMIC_SEQ_CST (t
));
14162 tree op1
= TREE_OPERAND (t
, 1);
14163 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14164 tree rhs1
= NULL_TREE
;
14165 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14166 enum tree_code opcode
= NOP_EXPR
;
14167 if (code
== OMP_ATOMIC_READ
)
14169 v
= RECUR (TREE_OPERAND (op1
, 0));
14170 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14172 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14173 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14175 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14176 v
= RECUR (TREE_OPERAND (op1
, 0));
14177 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14178 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14180 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14181 op11
= TREE_OPERAND (op11
, 1);
14183 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14184 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14185 opcode
= TREE_CODE (op11
);
14186 if (opcode
== MODIFY_EXPR
)
14192 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14193 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14195 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14196 OMP_ATOMIC_SEQ_CST (t
));
14200 case TRANSACTION_EXPR
:
14203 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14204 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14206 if (TRANSACTION_EXPR_IS_STMT (t
))
14208 tree body
= TRANSACTION_EXPR_BODY (t
);
14209 tree noex
= NULL_TREE
;
14210 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14212 noex
= MUST_NOT_THROW_COND (body
);
14213 if (noex
== NULL_TREE
)
14214 noex
= boolean_true_node
;
14215 body
= TREE_OPERAND (body
, 0);
14217 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14219 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14223 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14224 RECUR (TRANSACTION_EXPR_BODY (t
)),
14231 case MUST_NOT_THROW_EXPR
:
14233 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14234 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14235 RETURN (build_must_not_throw_expr (op0
, cond
));
14238 case EXPR_PACK_EXPANSION
:
14239 error ("invalid use of pack expansion expression");
14240 RETURN (error_mark_node
);
14242 case NONTYPE_ARGUMENT_PACK
:
14243 error ("use %<...%> to expand argument pack");
14244 RETURN (error_mark_node
);
14246 case CILK_SPAWN_STMT
:
14247 cfun
->calls_cilk_spawn
= 1;
14248 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
14250 case CILK_SYNC_STMT
:
14251 RETURN (build_cilk_sync ());
14253 case COMPOUND_EXPR
:
14254 tmp
= RECUR (TREE_OPERAND (t
, 0));
14255 if (tmp
== NULL_TREE
)
14256 /* If the first operand was a statement, we're done with it. */
14257 RETURN (RECUR (TREE_OPERAND (t
, 1)));
14258 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
14259 RECUR (TREE_OPERAND (t
, 1)),
14262 case ANNOTATE_EXPR
:
14263 tmp
= RECUR (TREE_OPERAND (t
, 0));
14264 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
14265 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
14268 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
14270 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14271 /*function_p=*/false,
14272 integral_constant_expression_p
));
14275 RETURN (NULL_TREE
);
14277 input_location
= loc
;
14283 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14284 function. For description of the body see comment above
14285 cp_parser_omp_declare_reduction_exprs. */
14288 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14290 if (t
== NULL_TREE
|| t
== error_mark_node
)
14293 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14295 tree_stmt_iterator tsi
;
14298 memset (stmts
, 0, sizeof stmts
);
14299 for (i
= 0, tsi
= tsi_start (t
);
14300 i
< 7 && !tsi_end_p (tsi
);
14301 i
++, tsi_next (&tsi
))
14302 stmts
[i
] = tsi_stmt (tsi
);
14303 gcc_assert (tsi_end_p (tsi
));
14307 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14308 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14309 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14310 args
, complain
, in_decl
);
14311 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14312 args
, complain
, in_decl
);
14313 DECL_CONTEXT (omp_out
) = current_function_decl
;
14314 DECL_CONTEXT (omp_in
) = current_function_decl
;
14315 keep_next_level (true);
14316 tree block
= begin_omp_structured_block ();
14317 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14318 block
= finish_omp_structured_block (block
);
14319 block
= maybe_cleanup_point_expr_void (block
);
14320 add_decl_expr (omp_out
);
14321 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14322 TREE_NO_WARNING (omp_out
) = 1;
14323 add_decl_expr (omp_in
);
14324 finish_expr_stmt (block
);
14328 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14329 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14330 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14331 args
, complain
, in_decl
);
14332 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14333 args
, complain
, in_decl
);
14334 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14335 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14336 keep_next_level (true);
14337 tree block
= begin_omp_structured_block ();
14338 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14339 block
= finish_omp_structured_block (block
);
14340 block
= maybe_cleanup_point_expr_void (block
);
14341 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14342 add_decl_expr (omp_priv
);
14343 add_decl_expr (omp_orig
);
14344 finish_expr_stmt (block
);
14346 add_decl_expr (omp_orig
);
14350 /* T is a postfix-expression that is not being used in a function
14351 call. Return the substituted version of T. */
14354 tsubst_non_call_postfix_expression (tree t
, tree args
,
14355 tsubst_flags_t complain
,
14358 if (TREE_CODE (t
) == SCOPE_REF
)
14359 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14360 /*done=*/false, /*address_p=*/false);
14362 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14363 /*function_p=*/false,
14364 /*integral_constant_expression_p=*/false);
14369 /* Sentinel to disable certain warnings during template substitution. */
14371 struct warning_sentinel
{
14374 warning_sentinel(int& flag
, bool suppress
=true)
14375 : flag(flag
), val(flag
) { if (suppress
) flag
= 0; }
14376 ~warning_sentinel() { flag
= val
; }
14379 /* Like tsubst but deals with expressions and performs semantic
14380 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14383 tsubst_copy_and_build (tree t
,
14385 tsubst_flags_t complain
,
14388 bool integral_constant_expression_p
)
14390 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14391 #define RECUR(NODE) \
14392 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14393 /*function_p=*/false, \
14394 integral_constant_expression_p)
14399 if (t
== NULL_TREE
|| t
== error_mark_node
)
14402 loc
= input_location
;
14403 if (EXPR_HAS_LOCATION (t
))
14404 input_location
= EXPR_LOCATION (t
);
14406 /* N3276 decltype magic only applies to calls at the top level or on the
14407 right side of a comma. */
14408 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14409 complain
&= ~tf_decltype
;
14411 switch (TREE_CODE (t
))
14415 /* Fall through. */
14416 case IDENTIFIER_NODE
:
14420 bool non_integral_constant_expression_p
;
14421 const char *error_msg
;
14423 if (IDENTIFIER_TYPENAME_P (t
))
14425 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14426 t
= mangle_conv_op_name_for_type (new_type
);
14429 /* Look up the name. */
14430 decl
= lookup_name (t
);
14432 /* By convention, expressions use ERROR_MARK_NODE to indicate
14433 failure, not NULL_TREE. */
14434 if (decl
== NULL_TREE
)
14435 decl
= error_mark_node
;
14437 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14439 integral_constant_expression_p
,
14440 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14441 &non_integral_constant_expression_p
,
14442 /*template_p=*/false,
14444 /*address_p=*/false,
14445 /*template_arg_p=*/false,
14450 if (!function_p
&& identifier_p (decl
))
14452 if (complain
& tf_error
)
14453 unqualified_name_lookup_error (decl
);
14454 decl
= error_mark_node
;
14459 case TEMPLATE_ID_EXPR
:
14462 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14463 tree targs
= TREE_OPERAND (t
, 1);
14466 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14468 if (TREE_CODE (templ
) == COMPONENT_REF
)
14470 object
= TREE_OPERAND (templ
, 0);
14471 templ
= TREE_OPERAND (templ
, 1);
14474 object
= NULL_TREE
;
14475 templ
= lookup_template_function (templ
, targs
);
14478 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14479 object
, templ
, NULL_TREE
));
14481 RETURN (baselink_for_fns (templ
));
14486 tree r
= RECUR (TREE_OPERAND (t
, 0));
14488 if (REFERENCE_REF_P (t
))
14490 /* A type conversion to reference type will be enclosed in
14491 such an indirect ref, but the substitution of the cast
14492 will have also added such an indirect ref. */
14493 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14494 r
= convert_from_reference (r
);
14497 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14498 complain
|decltype_flag
);
14504 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14505 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14506 RETURN (build_nop (type
, op0
));
14509 case IMPLICIT_CONV_EXPR
:
14511 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14512 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14513 int flags
= LOOKUP_IMPLICIT
;
14514 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14515 flags
= LOOKUP_NORMAL
;
14516 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14522 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14523 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14524 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
14528 case REINTERPRET_CAST_EXPR
:
14529 case CONST_CAST_EXPR
:
14530 case DYNAMIC_CAST_EXPR
:
14531 case STATIC_CAST_EXPR
:
14534 tree op
, r
= NULL_TREE
;
14536 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14537 if (integral_constant_expression_p
14538 && !cast_valid_in_integral_constant_expression_p (type
))
14540 if (complain
& tf_error
)
14541 error ("a cast to a type other than an integral or "
14542 "enumeration type cannot appear in a constant-expression");
14543 RETURN (error_mark_node
);
14546 op
= RECUR (TREE_OPERAND (t
, 0));
14548 warning_sentinel
s(warn_useless_cast
);
14549 switch (TREE_CODE (t
))
14552 r
= build_functional_cast (type
, op
, complain
);
14554 case REINTERPRET_CAST_EXPR
:
14555 r
= build_reinterpret_cast (type
, op
, complain
);
14557 case CONST_CAST_EXPR
:
14558 r
= build_const_cast (type
, op
, complain
);
14560 case DYNAMIC_CAST_EXPR
:
14561 r
= build_dynamic_cast (type
, op
, complain
);
14563 case STATIC_CAST_EXPR
:
14564 r
= build_static_cast (type
, op
, complain
);
14567 gcc_unreachable ();
14573 case POSTDECREMENT_EXPR
:
14574 case POSTINCREMENT_EXPR
:
14575 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14576 args
, complain
, in_decl
);
14577 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14578 complain
|decltype_flag
));
14580 case PREDECREMENT_EXPR
:
14581 case PREINCREMENT_EXPR
:
14585 case TRUTH_NOT_EXPR
:
14586 case UNARY_PLUS_EXPR
: /* Unary + */
14587 case REALPART_EXPR
:
14588 case IMAGPART_EXPR
:
14589 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14590 RECUR (TREE_OPERAND (t
, 0)),
14591 complain
|decltype_flag
));
14593 case FIX_TRUNC_EXPR
:
14594 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14598 op1
= TREE_OPERAND (t
, 0);
14599 if (TREE_CODE (op1
) == LABEL_DECL
)
14600 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14601 EXPR_LOCATION (op1
)));
14602 if (TREE_CODE (op1
) == SCOPE_REF
)
14603 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14604 /*done=*/true, /*address_p=*/true);
14606 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14608 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14609 complain
|decltype_flag
));
14614 case TRUNC_DIV_EXPR
:
14615 case CEIL_DIV_EXPR
:
14616 case FLOOR_DIV_EXPR
:
14617 case ROUND_DIV_EXPR
:
14618 case EXACT_DIV_EXPR
:
14622 case TRUNC_MOD_EXPR
:
14623 case FLOOR_MOD_EXPR
:
14624 case TRUTH_ANDIF_EXPR
:
14625 case TRUTH_ORIF_EXPR
:
14626 case TRUTH_AND_EXPR
:
14627 case TRUTH_OR_EXPR
:
14643 warning_sentinel
s1(warn_type_limits
);
14644 warning_sentinel
s2(warn_div_by_zero
);
14645 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14646 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14647 tree r
= build_x_binary_op
14648 (input_location
, TREE_CODE (t
),
14650 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14652 : TREE_CODE (TREE_OPERAND (t
, 0))),
14654 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14656 : TREE_CODE (TREE_OPERAND (t
, 1))),
14658 complain
|decltype_flag
);
14659 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14660 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14665 case POINTER_PLUS_EXPR
:
14667 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14668 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14669 return fold_build_pointer_plus (op0
, op1
);
14673 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14674 /*address_p=*/false));
14676 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14677 args
, complain
, in_decl
);
14678 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14679 RECUR (TREE_OPERAND (t
, 1)),
14680 complain
|decltype_flag
));
14682 case ARRAY_NOTATION_REF
:
14684 tree start_index
, length
, stride
;
14685 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14686 args
, complain
, in_decl
);
14687 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14688 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14689 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14690 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14691 length
, stride
, TREE_TYPE (op1
)));
14694 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14695 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14702 op1
= TREE_OPERAND (t
, 0);
14703 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14704 op1
= TREE_TYPE (op1
);
14707 /* When there are no ARGS, we are trying to evaluate a
14708 non-dependent expression from the parser. Trying to do
14709 the substitutions may not work. */
14711 op1
= TREE_TYPE (op1
);
14715 ++cp_unevaluated_operand
;
14716 ++c_inhibit_evaluation_warnings
;
14718 op1
= tsubst (op1
, args
, complain
, in_decl
);
14720 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14721 /*function_p=*/false,
14722 /*integral_constant_expression_p=*/
14724 --cp_unevaluated_operand
;
14725 --c_inhibit_evaluation_warnings
;
14728 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14729 complain
& tf_error
);
14731 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14732 complain
& tf_error
);
14733 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14735 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14737 if (!processing_template_decl
&& TYPE_P (op1
))
14739 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14740 build1 (NOP_EXPR
, op1
, error_mark_node
));
14741 SIZEOF_EXPR_TYPE_P (r
) = 1;
14744 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14745 TREE_SIDE_EFFECTS (r
) = 0;
14746 TREE_READONLY (r
) = 1;
14748 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14753 case AT_ENCODE_EXPR
:
14755 op1
= TREE_OPERAND (t
, 0);
14756 ++cp_unevaluated_operand
;
14757 ++c_inhibit_evaluation_warnings
;
14758 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14759 /*function_p=*/false,
14760 /*integral_constant_expression_p=*/false);
14761 --cp_unevaluated_operand
;
14762 --c_inhibit_evaluation_warnings
;
14763 RETURN (objc_build_encode_expr (op1
));
14766 case NOEXCEPT_EXPR
:
14767 op1
= TREE_OPERAND (t
, 0);
14768 ++cp_unevaluated_operand
;
14769 ++c_inhibit_evaluation_warnings
;
14770 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14771 /*function_p=*/false,
14772 /*integral_constant_expression_p=*/false);
14773 --cp_unevaluated_operand
;
14774 --c_inhibit_evaluation_warnings
;
14775 RETURN (finish_noexcept_expr (op1
, complain
));
14779 warning_sentinel
s(warn_div_by_zero
);
14780 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
14781 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
14782 tree r
= build_x_modify_expr
14783 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
14784 complain
|decltype_flag
);
14785 /* TREE_NO_WARNING must be set if either the expression was
14786 parenthesized or it uses an operator such as >>= rather
14787 than plain assignment. In the former case, it was already
14788 set and must be copied. In the latter case,
14789 build_x_modify_expr sets it and it must not be reset
14791 if (TREE_NO_WARNING (t
))
14792 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14798 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14799 args
, complain
, in_decl
);
14800 /* Remember that there was a reference to this entity. */
14803 RETURN (build_x_arrow (input_location
, op1
, complain
));
14807 tree placement
= RECUR (TREE_OPERAND (t
, 0));
14808 tree init
= RECUR (TREE_OPERAND (t
, 3));
14809 vec
<tree
, va_gc
> *placement_vec
;
14810 vec
<tree
, va_gc
> *init_vec
;
14813 if (placement
== NULL_TREE
)
14814 placement_vec
= NULL
;
14817 placement_vec
= make_tree_vector ();
14818 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
14819 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
14822 /* If there was an initializer in the original tree, but it
14823 instantiated to an empty list, then we should pass a
14824 non-NULL empty vector to tell build_new that it was an
14825 empty initializer() rather than no initializer. This can
14826 only happen when the initializer is a pack expansion whose
14827 parameter packs are of length zero. */
14828 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
14832 init_vec
= make_tree_vector ();
14833 if (init
== void_node
)
14834 gcc_assert (init_vec
!= NULL
);
14837 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
14838 vec_safe_push (init_vec
, TREE_VALUE (init
));
14842 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14843 tree op2
= RECUR (TREE_OPERAND (t
, 2));
14844 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
14845 NEW_EXPR_USE_GLOBAL (t
),
14848 if (placement_vec
!= NULL
)
14849 release_tree_vector (placement_vec
);
14850 if (init_vec
!= NULL
)
14851 release_tree_vector (init_vec
);
14858 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14859 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14860 RETURN (delete_sanity (op0
, op1
,
14861 DELETE_EXPR_USE_VEC (t
),
14862 DELETE_EXPR_USE_GLOBAL (t
),
14866 case COMPOUND_EXPR
:
14868 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
14869 complain
& ~tf_decltype
, in_decl
,
14870 /*function_p=*/false,
14871 integral_constant_expression_p
);
14872 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
14874 RECUR (TREE_OPERAND (t
, 1)),
14875 complain
|decltype_flag
));
14881 vec
<tree
, va_gc
> *call_args
;
14882 unsigned int nargs
, i
;
14887 function
= CALL_EXPR_FN (t
);
14888 /* When we parsed the expression, we determined whether or
14889 not Koenig lookup should be performed. */
14890 koenig_p
= KOENIG_LOOKUP_P (t
);
14891 if (TREE_CODE (function
) == SCOPE_REF
)
14893 qualified_p
= true;
14894 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
14896 /*address_p=*/false);
14898 else if (koenig_p
&& identifier_p (function
))
14900 /* Do nothing; calling tsubst_copy_and_build on an identifier
14901 would incorrectly perform unqualified lookup again.
14903 Note that we can also have an IDENTIFIER_NODE if the earlier
14904 unqualified lookup found a member function; in that case
14905 koenig_p will be false and we do want to do the lookup
14906 again to find the instantiated member function.
14908 FIXME but doing that causes c++/15272, so we need to stop
14909 using IDENTIFIER_NODE in that situation. */
14910 qualified_p
= false;
14914 if (TREE_CODE (function
) == COMPONENT_REF
)
14916 tree op
= TREE_OPERAND (function
, 1);
14918 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
14919 || (BASELINK_P (op
)
14920 && BASELINK_QUALIFIED_P (op
)));
14923 qualified_p
= false;
14925 if (TREE_CODE (function
) == ADDR_EXPR
14926 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
14927 /* Avoid error about taking the address of a constructor. */
14928 function
= TREE_OPERAND (function
, 0);
14930 function
= tsubst_copy_and_build (function
, args
, complain
,
14933 integral_constant_expression_p
);
14935 if (BASELINK_P (function
))
14936 qualified_p
= true;
14939 nargs
= call_expr_nargs (t
);
14940 call_args
= make_tree_vector ();
14941 for (i
= 0; i
< nargs
; ++i
)
14943 tree arg
= CALL_EXPR_ARG (t
, i
);
14945 if (!PACK_EXPANSION_P (arg
))
14946 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
14949 /* Expand the pack expansion and push each entry onto
14951 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
14952 if (TREE_CODE (arg
) == TREE_VEC
)
14954 unsigned int len
, j
;
14956 len
= TREE_VEC_LENGTH (arg
);
14957 for (j
= 0; j
< len
; ++j
)
14959 tree value
= TREE_VEC_ELT (arg
, j
);
14960 if (value
!= NULL_TREE
)
14961 value
= convert_from_reference (value
);
14962 vec_safe_push (call_args
, value
);
14967 /* A partial substitution. Add one entry. */
14968 vec_safe_push (call_args
, arg
);
14973 /* We do not perform argument-dependent lookup if normal
14974 lookup finds a non-function, in accordance with the
14975 expected resolution of DR 218. */
14977 && ((is_overloaded_fn (function
)
14978 /* If lookup found a member function, the Koenig lookup is
14979 not appropriate, even if an unqualified-name was used
14980 to denote the function. */
14981 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14982 || identifier_p (function
))
14983 /* Only do this when substitution turns a dependent call
14984 into a non-dependent call. */
14985 && type_dependent_expression_p_push (t
)
14986 && !any_type_dependent_arguments_p (call_args
))
14987 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
14989 if (identifier_p (function
)
14990 && !any_type_dependent_arguments_p (call_args
))
14992 if (koenig_p
&& (complain
& tf_warning_or_error
))
14994 /* For backwards compatibility and good diagnostics, try
14995 the unqualified lookup again if we aren't in SFINAE
14997 tree unq
= (tsubst_copy_and_build
14998 (function
, args
, complain
, in_decl
, true,
14999 integral_constant_expression_p
));
15000 if (unq
== error_mark_node
)
15001 RETURN (error_mark_node
);
15003 if (unq
!= function
)
15006 if (INDIRECT_REF_P (fn
))
15007 fn
= TREE_OPERAND (fn
, 0);
15008 if (TREE_CODE (fn
) == COMPONENT_REF
)
15009 fn
= TREE_OPERAND (fn
, 1);
15010 if (is_overloaded_fn (fn
))
15011 fn
= get_first_fn (fn
);
15012 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
15013 "%qD was not declared in this scope, "
15014 "and no declarations were found by "
15015 "argument-dependent lookup at the point "
15016 "of instantiation", function
))
15019 /* Can't say anything more. */;
15020 else if (DECL_CLASS_SCOPE_P (fn
))
15022 location_t loc
= EXPR_LOC_OR_LOC (t
,
15025 "declarations in dependent base %qT are "
15026 "not found by unqualified lookup",
15027 DECL_CLASS_CONTEXT (fn
));
15028 if (current_class_ptr
)
15030 "use %<this->%D%> instead", function
);
15033 "use %<%T::%D%> instead",
15034 current_class_name
, function
);
15037 inform (0, "%q+D declared here, later in the "
15038 "translation unit", fn
);
15043 if (identifier_p (function
))
15045 if (complain
& tf_error
)
15046 unqualified_name_lookup_error (function
);
15047 release_tree_vector (call_args
);
15048 RETURN (error_mark_node
);
15052 /* Remember that there was a reference to this entity. */
15053 if (DECL_P (function
))
15054 mark_used (function
);
15056 /* Put back tf_decltype for the actual call. */
15057 complain
|= decltype_flag
;
15059 if (TREE_CODE (function
) == OFFSET_REF
)
15060 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
15062 else if (TREE_CODE (function
) == COMPONENT_REF
)
15064 tree instance
= TREE_OPERAND (function
, 0);
15065 tree fn
= TREE_OPERAND (function
, 1);
15067 if (processing_template_decl
15068 && (type_dependent_expression_p (instance
)
15069 || (!BASELINK_P (fn
)
15070 && TREE_CODE (fn
) != FIELD_DECL
)
15071 || type_dependent_expression_p (fn
)
15072 || any_type_dependent_arguments_p (call_args
)))
15073 ret
= build_nt_call_vec (function
, call_args
);
15074 else if (!BASELINK_P (fn
))
15075 ret
= finish_call_expr (function
, &call_args
,
15076 /*disallow_virtual=*/false,
15077 /*koenig_p=*/false,
15080 ret
= (build_new_method_call
15082 &call_args
, NULL_TREE
,
15083 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15088 ret
= finish_call_expr (function
, &call_args
,
15089 /*disallow_virtual=*/qualified_p
,
15093 release_tree_vector (call_args
);
15100 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15103 if (TREE_CODE (cond
) == INTEGER_CST
)
15105 if (integer_zerop (cond
))
15107 ++c_inhibit_evaluation_warnings
;
15108 exp1
= RECUR (TREE_OPERAND (t
, 1));
15109 --c_inhibit_evaluation_warnings
;
15110 exp2
= RECUR (TREE_OPERAND (t
, 2));
15114 exp1
= RECUR (TREE_OPERAND (t
, 1));
15115 ++c_inhibit_evaluation_warnings
;
15116 exp2
= RECUR (TREE_OPERAND (t
, 2));
15117 --c_inhibit_evaluation_warnings
;
15122 exp1
= RECUR (TREE_OPERAND (t
, 1));
15123 exp2
= RECUR (TREE_OPERAND (t
, 2));
15126 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15127 cond
, exp1
, exp2
, complain
));
15130 case PSEUDO_DTOR_EXPR
:
15132 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15133 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15134 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15135 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15141 tree purpose
, value
, chain
;
15143 if (t
== void_list_node
)
15146 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15147 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15149 /* We have pack expansions, so expand those and
15150 create a new list out of it. */
15151 tree purposevec
= NULL_TREE
;
15152 tree valuevec
= NULL_TREE
;
15156 /* Expand the argument expressions. */
15157 if (TREE_PURPOSE (t
))
15158 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15159 complain
, in_decl
);
15160 if (TREE_VALUE (t
))
15161 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15162 complain
, in_decl
);
15164 /* Build the rest of the list. */
15165 chain
= TREE_CHAIN (t
);
15166 if (chain
&& chain
!= void_type_node
)
15167 chain
= RECUR (chain
);
15169 /* Determine the number of arguments. */
15170 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15172 len
= TREE_VEC_LENGTH (purposevec
);
15173 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15175 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15176 len
= TREE_VEC_LENGTH (valuevec
);
15179 /* Since we only performed a partial substitution into
15180 the argument pack, we only RETURN (a single list
15182 if (purposevec
== TREE_PURPOSE (t
)
15183 && valuevec
== TREE_VALUE (t
)
15184 && chain
== TREE_CHAIN (t
))
15187 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15190 /* Convert the argument vectors into a TREE_LIST */
15194 /* Grab the Ith values. */
15196 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15199 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15202 /* Build the list (backwards). */
15203 chain
= tree_cons (purpose
, value
, chain
);
15209 purpose
= TREE_PURPOSE (t
);
15211 purpose
= RECUR (purpose
);
15212 value
= TREE_VALUE (t
);
15214 value
= RECUR (value
);
15215 chain
= TREE_CHAIN (t
);
15216 if (chain
&& chain
!= void_type_node
)
15217 chain
= RECUR (chain
);
15218 if (purpose
== TREE_PURPOSE (t
)
15219 && value
== TREE_VALUE (t
)
15220 && chain
== TREE_CHAIN (t
))
15222 RETURN (tree_cons (purpose
, value
, chain
));
15225 case COMPONENT_REF
:
15232 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15233 args
, complain
, in_decl
);
15234 /* Remember that there was a reference to this entity. */
15235 if (DECL_P (object
))
15236 mark_used (object
);
15237 object_type
= TREE_TYPE (object
);
15239 member
= TREE_OPERAND (t
, 1);
15240 if (BASELINK_P (member
))
15241 member
= tsubst_baselink (member
,
15242 non_reference (TREE_TYPE (object
)),
15243 args
, complain
, in_decl
);
15245 member
= tsubst_copy (member
, args
, complain
, in_decl
);
15246 if (member
== error_mark_node
)
15247 RETURN (error_mark_node
);
15249 if (type_dependent_expression_p (object
))
15250 /* We can't do much here. */;
15251 else if (!CLASS_TYPE_P (object_type
))
15253 if (scalarish_type_p (object_type
))
15255 tree s
= NULL_TREE
;
15256 tree dtor
= member
;
15258 if (TREE_CODE (dtor
) == SCOPE_REF
)
15260 s
= TREE_OPERAND (dtor
, 0);
15261 dtor
= TREE_OPERAND (dtor
, 1);
15263 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
15265 dtor
= TREE_OPERAND (dtor
, 0);
15267 RETURN (finish_pseudo_destructor_expr
15268 (object
, s
, dtor
, input_location
));
15272 else if (TREE_CODE (member
) == SCOPE_REF
15273 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
15275 /* Lookup the template functions now that we know what the
15277 tree scope
= TREE_OPERAND (member
, 0);
15278 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
15279 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
15280 member
= lookup_qualified_name (scope
, tmpl
,
15281 /*is_type_p=*/false,
15282 /*complain=*/false);
15283 if (BASELINK_P (member
))
15285 BASELINK_FUNCTIONS (member
)
15286 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
15288 member
= (adjust_result_of_qualified_name_lookup
15289 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15294 qualified_name_lookup_error (scope
, tmpl
, member
,
15296 RETURN (error_mark_node
);
15299 else if (TREE_CODE (member
) == SCOPE_REF
15300 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15301 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15303 if (complain
& tf_error
)
15305 if (TYPE_P (TREE_OPERAND (member
, 0)))
15306 error ("%qT is not a class or namespace",
15307 TREE_OPERAND (member
, 0));
15309 error ("%qD is not a class or namespace",
15310 TREE_OPERAND (member
, 0));
15312 RETURN (error_mark_node
);
15314 else if (TREE_CODE (member
) == FIELD_DECL
)
15316 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15317 if (TREE_CODE (r
) == COMPONENT_REF
)
15318 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15322 r
= finish_class_member_access_expr (object
, member
,
15323 /*template_p=*/false,
15325 if (TREE_CODE (r
) == COMPONENT_REF
)
15326 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15331 RETURN (build_throw
15332 (RECUR (TREE_OPERAND (t
, 0))));
15336 vec
<constructor_elt
, va_gc
> *n
;
15337 constructor_elt
*ce
;
15338 unsigned HOST_WIDE_INT idx
;
15339 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15340 bool process_index_p
;
15342 bool need_copy_p
= false;
15345 if (type
== error_mark_node
)
15346 RETURN (error_mark_node
);
15348 /* digest_init will do the wrong thing if we let it. */
15349 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15352 /* We do not want to process the index of aggregate
15353 initializers as they are identifier nodes which will be
15354 looked up by digest_init. */
15355 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15357 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15358 newlen
= vec_safe_length (n
);
15359 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15361 if (ce
->index
&& process_index_p
15362 /* An identifier index is looked up in the type
15363 being initialized, not the current scope. */
15364 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15365 ce
->index
= RECUR (ce
->index
);
15367 if (PACK_EXPANSION_P (ce
->value
))
15369 /* Substitute into the pack expansion. */
15370 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15373 if (ce
->value
== error_mark_node
15374 || PACK_EXPANSION_P (ce
->value
))
15376 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15377 /* Just move the argument into place. */
15378 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15381 /* Update the length of the final CONSTRUCTOR
15382 arguments vector, and note that we will need to
15384 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15385 need_copy_p
= true;
15389 ce
->value
= RECUR (ce
->value
);
15394 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15396 vec_alloc (n
, newlen
);
15397 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15399 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15401 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15402 for (i
= 0; i
< len
; ++i
)
15403 CONSTRUCTOR_APPEND_ELT (n
, 0,
15404 TREE_VEC_ELT (ce
->value
, i
));
15407 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15411 r
= build_constructor (init_list_type_node
, n
);
15412 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15414 if (TREE_HAS_CONSTRUCTOR (t
))
15415 RETURN (finish_compound_literal (type
, r
, complain
));
15417 TREE_TYPE (r
) = type
;
15423 tree operand_0
= TREE_OPERAND (t
, 0);
15424 if (TYPE_P (operand_0
))
15426 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15427 RETURN (get_typeid (operand_0
, complain
));
15431 operand_0
= RECUR (operand_0
);
15432 RETURN (build_typeid (operand_0
, complain
));
15439 else if (DECL_PACK_P (t
))
15441 /* We don't build decls for an instantiation of a
15442 variadic capture proxy, we instantiate the elements
15444 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15445 return RECUR (DECL_VALUE_EXPR (t
));
15451 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15453 && !processing_template_decl
15454 && !cp_unevaluated_operand
15455 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
15456 && DECL_THREAD_LOCAL_P (r
))
15458 if (tree wrap
= get_tls_wrapper_fn (r
))
15459 /* Replace an evaluated use of the thread_local variable with
15460 a call to its wrapper. */
15461 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
15464 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15465 /* If the original type was a reference, we'll be wrapped in
15466 the appropriate INDIRECT_REF. */
15467 r
= convert_from_reference (r
);
15473 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15474 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15475 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
15478 case OFFSETOF_EXPR
:
15479 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
15480 EXPR_LOCATION (t
)));
15484 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15485 complain
, in_decl
);
15487 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15489 type2
= tsubst (type2
, args
, complain
, in_decl
);
15491 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15496 tree old_stmt_expr
= cur_stmt_expr
;
15497 tree stmt_expr
= begin_stmt_expr ();
15499 cur_stmt_expr
= stmt_expr
;
15500 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15501 integral_constant_expression_p
);
15502 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15503 cur_stmt_expr
= old_stmt_expr
;
15505 /* If the resulting list of expression statement is empty,
15506 fold it further into void_node. */
15507 if (empty_expr_stmt_p (stmt_expr
))
15508 stmt_expr
= void_node
;
15510 RETURN (stmt_expr
);
15515 tree r
= build_lambda_expr ();
15517 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15518 LAMBDA_EXPR_CLOSURE (r
) = type
;
15519 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15521 LAMBDA_EXPR_LOCATION (r
)
15522 = LAMBDA_EXPR_LOCATION (t
);
15523 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15524 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15525 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15526 LAMBDA_EXPR_DISCRIMINATOR (r
)
15527 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15528 /* For a function scope, we want to use tsubst so that we don't
15529 complain about referring to an auto function before its return
15530 type has been deduced. Otherwise, we want to use tsubst_copy so
15531 that we look up the existing field/parameter/variable rather
15532 than build a new one. */
15533 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15534 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15535 scope
= tsubst (scope
, args
, complain
, in_decl
);
15536 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15538 /* Look up the parameter we want directly, as tsubst_copy
15539 doesn't do what we need. */
15540 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15541 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15542 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15543 parm
= DECL_CHAIN (parm
);
15545 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15546 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15547 DECL_CONTEXT (scope
) = fn
;
15550 scope
= RECUR (scope
);
15551 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15552 LAMBDA_EXPR_RETURN_TYPE (r
)
15553 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15555 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15556 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15558 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15559 determine_visibility (TYPE_NAME (type
));
15560 /* Now that we know visibility, instantiate the type so we have a
15561 declaration of the op() for later calls to lambda_function. */
15562 complete_type (type
);
15564 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15566 RETURN (build_lambda_object (r
));
15570 /* We can get here for a constant initializer of non-dependent type.
15571 FIXME stop folding in cp_parser_initializer_clause. */
15573 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15578 case TRANSACTION_EXPR
:
15579 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15580 integral_constant_expression_p
));
15583 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15585 case VEC_PERM_EXPR
:
15587 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15588 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15589 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15590 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
15595 /* Handle Objective-C++ constructs, if appropriate. */
15598 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15599 in_decl
, /*function_p=*/false);
15603 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15609 input_location
= loc
;
15613 /* Verify that the instantiated ARGS are valid. For type arguments,
15614 make sure that the type's linkage is ok. For non-type arguments,
15615 make sure they are constants if they are integral or enumerations.
15616 Emit an error under control of COMPLAIN, and return TRUE on error. */
15619 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15621 if (dependent_template_arg_p (t
))
15623 if (ARGUMENT_PACK_P (t
))
15625 tree vec
= ARGUMENT_PACK_ARGS (t
);
15626 int len
= TREE_VEC_LENGTH (vec
);
15627 bool result
= false;
15630 for (i
= 0; i
< len
; ++i
)
15631 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15635 else if (TYPE_P (t
))
15637 /* [basic.link]: A name with no linkage (notably, the name
15638 of a class or enumeration declared in a local scope)
15639 shall not be used to declare an entity with linkage.
15640 This implies that names with no linkage cannot be used as
15643 DR 757 relaxes this restriction for C++0x. */
15644 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15645 : no_linkage_check (t
, /*relaxed_p=*/false));
15649 /* DR 488 makes use of a type with no linkage cause
15650 type deduction to fail. */
15651 if (complain
& tf_error
)
15653 if (TYPE_ANONYMOUS_P (nt
))
15654 error ("%qT is/uses anonymous type", t
);
15656 error ("template argument for %qD uses local type %qT",
15661 /* In order to avoid all sorts of complications, we do not
15662 allow variably-modified types as template arguments. */
15663 else if (variably_modified_type_p (t
, NULL_TREE
))
15665 if (complain
& tf_error
)
15666 error ("%qT is a variably modified type", t
);
15670 /* Class template and alias template arguments should be OK. */
15671 else if (DECL_TYPE_TEMPLATE_P (t
))
15673 /* A non-type argument of integral or enumerated type must be a
15675 else if (TREE_TYPE (t
)
15676 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15677 && !TREE_CONSTANT (t
))
15679 if (complain
& tf_error
)
15680 error ("integral expression %qE is not constant", t
);
15687 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15689 int ix
, len
= DECL_NTPARMS (tmpl
);
15690 bool result
= false;
15692 for (ix
= 0; ix
!= len
; ix
++)
15694 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15697 if (result
&& (complain
& tf_error
))
15698 error (" trying to instantiate %qD", tmpl
);
15702 /* We're out of SFINAE context now, so generate diagnostics for the access
15703 errors we saw earlier when instantiating D from TMPL and ARGS. */
15706 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15708 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15709 tree type
= TREE_TYPE (pattern
);
15710 location_t loc
= input_location
;
15712 push_access_scope (d
);
15713 push_deferring_access_checks (dk_no_deferred
);
15714 input_location
= DECL_SOURCE_LOCATION (pattern
);
15715 tsubst (type
, args
, tf_warning_or_error
, d
);
15716 input_location
= loc
;
15717 pop_deferring_access_checks ();
15718 pop_access_scope (d
);
15721 /* Instantiate the indicated variable, function, or alias template TMPL with
15722 the template arguments in TARG_PTR. */
15725 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15727 tree targ_ptr
= orig_args
;
15731 bool access_ok
= true;
15733 if (tmpl
== error_mark_node
)
15734 return error_mark_node
;
15736 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15738 /* If this function is a clone, handle it specially. */
15739 if (DECL_CLONED_FUNCTION_P (tmpl
))
15744 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15745 DECL_CLONED_FUNCTION. */
15746 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
15747 targ_ptr
, complain
);
15748 if (spec
== error_mark_node
)
15749 return error_mark_node
;
15751 /* Look for the clone. */
15752 FOR_EACH_CLONE (clone
, spec
)
15753 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
15755 /* We should always have found the clone by now. */
15756 gcc_unreachable ();
15760 if (targ_ptr
== error_mark_node
)
15761 return error_mark_node
;
15763 /* Check to see if we already have this specialization. */
15764 gen_tmpl
= most_general_template (tmpl
);
15765 if (tmpl
!= gen_tmpl
)
15766 /* The TMPL is a partial instantiation. To get a full set of
15767 arguments we must add the arguments used to perform the
15768 partial instantiation. */
15769 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
15772 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15773 but it doesn't seem to be on the hot path. */
15774 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
15776 gcc_assert (tmpl
== gen_tmpl
15777 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
15779 || fndecl
== NULL_TREE
);
15781 if (spec
!= NULL_TREE
)
15783 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
15785 if (complain
& tf_error
)
15786 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
15787 return error_mark_node
;
15792 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
15794 return error_mark_node
;
15796 /* We are building a FUNCTION_DECL, during which the access of its
15797 parameters and return types have to be checked. However this
15798 FUNCTION_DECL which is the desired context for access checking
15799 is not built yet. We solve this chicken-and-egg problem by
15800 deferring all checks until we have the FUNCTION_DECL. */
15801 push_deferring_access_checks (dk_deferred
);
15803 /* Instantiation of the function happens in the context of the function
15804 template, not the context of the overload resolution we're doing. */
15805 push_to_top_level ();
15806 /* If there are dependent arguments, e.g. because we're doing partial
15807 ordering, make sure processing_template_decl stays set. */
15808 if (uses_template_parms (targ_ptr
))
15809 ++processing_template_decl
;
15810 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15812 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
15813 complain
, gen_tmpl
);
15814 push_nested_class (ctx
);
15816 /* Substitute template parameters to obtain the specialization. */
15817 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
15818 targ_ptr
, complain
, gen_tmpl
);
15819 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15820 pop_nested_class ();
15821 pop_from_top_level ();
15823 if (fndecl
== error_mark_node
)
15825 pop_deferring_access_checks ();
15826 return error_mark_node
;
15829 /* The DECL_TI_TEMPLATE should always be the immediate parent
15830 template, not the most general template. */
15831 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
15833 /* Now we know the specialization, compute access previously
15835 push_access_scope (fndecl
);
15836 if (!perform_deferred_access_checks (complain
))
15838 pop_access_scope (fndecl
);
15839 pop_deferring_access_checks ();
15841 /* If we've just instantiated the main entry point for a function,
15842 instantiate all the alternate entry points as well. We do this
15843 by cloning the instantiation of the main entry point, not by
15844 instantiating the template clones. */
15845 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
15846 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
15850 if (!(complain
& tf_error
))
15852 /* Remember to reinstantiate when we're out of SFINAE so the user
15853 can see the errors. */
15854 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
15856 return error_mark_node
;
15861 /* Wrapper for instantiate_template_1. */
15864 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15867 timevar_push (TV_TEMPLATE_INST
);
15868 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
15869 timevar_pop (TV_TEMPLATE_INST
);
15873 /* Instantiate the alias template TMPL with ARGS. Also push a template
15874 instantiation level, which instantiate_template doesn't do because
15875 functions and variables have sufficient context established by the
15879 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
15881 struct pending_template
*old_last_pend
= last_pending_template
;
15882 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15883 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
15884 return error_mark_node
;
15885 tree tinst
= build_tree_list (tmpl
, args
);
15886 if (!push_tinst_level (tinst
))
15889 return error_mark_node
;
15893 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
15894 args
, tmpl
, complain
,
15895 /*require_all_args=*/true,
15896 /*use_default_args=*/true);
15898 tree r
= instantiate_template (tmpl
, args
, complain
);
15899 pop_tinst_level ();
15900 /* We can't free this if a pending_template entry or last_error_tinst_level
15901 is pointing at it. */
15902 if (last_pending_template
== old_last_pend
15903 && last_error_tinst_level
== old_error_tinst
)
15909 /* PARM is a template parameter pack for FN. Returns true iff
15910 PARM is used in a deducible way in the argument list of FN. */
15913 pack_deducible_p (tree parm
, tree fn
)
15915 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
15916 for (; t
; t
= TREE_CHAIN (t
))
15918 tree type
= TREE_VALUE (t
);
15920 if (!PACK_EXPANSION_P (type
))
15922 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
15923 packs
; packs
= TREE_CHAIN (packs
))
15924 if (template_args_equal (TREE_VALUE (packs
), parm
))
15926 /* The template parameter pack is used in a function parameter
15927 pack. If this is the end of the parameter list, the
15928 template parameter pack is deducible. */
15929 if (TREE_CHAIN (t
) == void_list_node
)
15932 /* Otherwise, not. Well, it could be deduced from
15933 a non-pack parameter, but doing so would end up with
15934 a deduction mismatch, so don't bother. */
15938 /* The template parameter pack isn't used in any function parameter
15939 packs, but it might be used deeper, e.g. tuple<Args...>. */
15943 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
15944 NARGS elements of the arguments that are being used when calling
15945 it. TARGS is a vector into which the deduced template arguments
15948 Returns either a FUNCTION_DECL for the matching specialization of FN or
15949 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
15950 true, diagnostics will be printed to explain why it failed.
15952 If FN is a conversion operator, or we are trying to produce a specific
15953 specialization, RETURN_TYPE is the return type desired.
15955 The EXPLICIT_TARGS are explicit template arguments provided via a
15958 The parameter STRICT is one of:
15961 We are deducing arguments for a function call, as in
15962 [temp.deduct.call].
15965 We are deducing arguments for a conversion function, as in
15966 [temp.deduct.conv].
15969 We are deducing arguments when doing an explicit instantiation
15970 as in [temp.explicit], when determining an explicit specialization
15971 as in [temp.expl.spec], or when taking the address of a function
15972 template, as in [temp.deduct.funcaddr]. */
15975 fn_type_unification (tree fn
,
15976 tree explicit_targs
,
15979 unsigned int nargs
,
15981 unification_kind_t strict
,
15988 tree decl
= NULL_TREE
;
15989 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
15991 static int deduction_depth
;
15992 struct pending_template
*old_last_pend
= last_pending_template
;
15993 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15994 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
15996 tree r
= error_mark_node
;
15999 complain
|= tf_decltype
;
16001 /* In C++0x, it's possible to have a function template whose type depends
16002 on itself recursively. This is most obvious with decltype, but can also
16003 occur with enumeration scope (c++/48969). So we need to catch infinite
16004 recursion and reject the substitution at deduction time; this function
16005 will return error_mark_node for any repeated substitution.
16007 This also catches excessive recursion such as when f<N> depends on
16008 f<N-1> across all integers, and returns error_mark_node for all the
16009 substitutions back up to the initial one.
16011 This is, of course, not reentrant. */
16012 if (excessive_deduction_depth
)
16013 return error_mark_node
;
16014 tinst
= build_tree_list (fn
, NULL_TREE
);
16017 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
16019 fntype
= TREE_TYPE (fn
);
16020 if (explicit_targs
)
16024 The specified template arguments must match the template
16025 parameters in kind (i.e., type, nontype, template), and there
16026 must not be more arguments than there are parameters;
16027 otherwise type deduction fails.
16029 Nontype arguments must match the types of the corresponding
16030 nontype template parameters, or must be convertible to the
16031 types of the corresponding nontype parameters as specified in
16032 _temp.arg.nontype_, otherwise type deduction fails.
16034 All references in the function type of the function template
16035 to the corresponding template parameters are replaced by the
16036 specified template argument values. If a substitution in a
16037 template parameter or in the function type of the function
16038 template results in an invalid type, type deduction fails. */
16039 int i
, len
= TREE_VEC_LENGTH (tparms
);
16040 location_t loc
= input_location
;
16041 bool incomplete
= false;
16043 /* Adjust any explicit template arguments before entering the
16044 substitution context. */
16046 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
16048 /*require_all_args=*/false,
16049 /*use_default_args=*/false));
16050 if (explicit_targs
== error_mark_node
)
16053 /* Substitute the explicit args into the function type. This is
16054 necessary so that, for instance, explicitly declared function
16055 arguments can match null pointed constants. If we were given
16056 an incomplete set of explicit args, we must not do semantic
16057 processing during substitution as we could create partial
16059 for (i
= 0; i
< len
; i
++)
16061 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16062 bool parameter_pack
= false;
16063 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
16065 /* Dig out the actual parm. */
16066 if (TREE_CODE (parm
) == TYPE_DECL
16067 || TREE_CODE (parm
) == TEMPLATE_DECL
)
16069 parm
= TREE_TYPE (parm
);
16070 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
16072 else if (TREE_CODE (parm
) == PARM_DECL
)
16074 parm
= DECL_INITIAL (parm
);
16075 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16078 if (!parameter_pack
&& targ
== NULL_TREE
)
16079 /* No explicit argument for this template parameter. */
16082 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16084 /* Mark the argument pack as "incomplete". We could
16085 still deduce more arguments during unification.
16086 We remove this mark in type_unification_real. */
16089 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16090 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16091 = ARGUMENT_PACK_ARGS (targ
);
16094 /* We have some incomplete argument packs. */
16099 TREE_VALUE (tinst
) = explicit_targs
;
16100 if (!push_tinst_level (tinst
))
16102 excessive_deduction_depth
= true;
16105 processing_template_decl
+= incomplete
;
16106 input_location
= DECL_SOURCE_LOCATION (fn
);
16107 /* Ignore any access checks; we'll see them again in
16108 instantiate_template and they might have the wrong
16109 access path at this point. */
16110 push_deferring_access_checks (dk_deferred
);
16111 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16112 complain
| tf_partial
, NULL_TREE
);
16113 pop_deferring_access_checks ();
16114 input_location
= loc
;
16115 processing_template_decl
-= incomplete
;
16116 pop_tinst_level ();
16118 if (fntype
== error_mark_node
)
16121 /* Place the explicitly specified arguments in TARGS. */
16122 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16123 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16126 /* Never do unification on the 'this' parameter. */
16127 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16133 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16134 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16135 new_args
[0] = return_type
;
16136 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16141 /* We allow incomplete unification without an error message here
16142 because the standard doesn't seem to explicitly prohibit it. Our
16143 callers must be ready to deal with unification failures in any
16146 TREE_VALUE (tinst
) = targs
;
16147 /* If we aren't explaining yet, push tinst context so we can see where
16148 any errors (e.g. from class instantiations triggered by instantiation
16149 of default template arguments) come from. If we are explaining, this
16150 context is redundant. */
16151 if (!explain_p
&& !push_tinst_level (tinst
))
16153 excessive_deduction_depth
= true;
16157 /* type_unification_real will pass back any access checks from default
16158 template argument substitution. */
16159 vec
<deferred_access_check
, va_gc
> *checks
;
16162 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16163 targs
, parms
, args
, nargs
, /*subr=*/0,
16164 strict
, flags
, &checks
, explain_p
);
16166 pop_tinst_level ();
16170 /* Now that we have bindings for all of the template arguments,
16171 ensure that the arguments deduced for the template template
16172 parameters have compatible template parameter lists. We cannot
16173 check this property before we have deduced all template
16174 arguments, because the template parameter types of a template
16175 template parameter might depend on prior template parameters
16176 deduced after the template template parameter. The following
16177 ill-formed example illustrates this issue:
16179 template<typename T, template<T> class C> void f(C<5>, T);
16181 template<int N> struct X {};
16184 f(X<5>(), 5l); // error: template argument deduction fails
16187 The template parameter list of 'C' depends on the template type
16188 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16189 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16190 time that we deduce 'C'. */
16191 if (!template_template_parm_bindings_ok_p
16192 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
16194 unify_inconsistent_template_template_parameters (explain_p
);
16198 /* All is well so far. Now, check:
16202 When all template arguments have been deduced, all uses of
16203 template parameters in nondeduced contexts are replaced with
16204 the corresponding deduced argument values. If the
16205 substitution results in an invalid type, as described above,
16206 type deduction fails. */
16207 TREE_VALUE (tinst
) = targs
;
16208 if (!push_tinst_level (tinst
))
16210 excessive_deduction_depth
= true;
16214 /* Also collect access checks from the instantiation. */
16215 reopen_deferring_access_checks (checks
);
16217 decl
= instantiate_template (fn
, targs
, complain
);
16219 checks
= get_deferred_access_checks ();
16220 pop_deferring_access_checks ();
16222 pop_tinst_level ();
16224 if (decl
== error_mark_node
)
16227 /* Now perform any access checks encountered during substitution. */
16228 push_access_scope (decl
);
16229 ok
= perform_access_checks (checks
, complain
);
16230 pop_access_scope (decl
);
16234 /* If we're looking for an exact match, check that what we got
16235 is indeed an exact match. It might not be if some template
16236 parameters are used in non-deduced contexts. But don't check
16237 for an exact match if we have dependent template arguments;
16238 in that case we're doing partial ordering, and we already know
16239 that we have two candidates that will provide the actual type. */
16240 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
16242 tree substed
= TREE_TYPE (decl
);
16246 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
16248 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
16249 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
16250 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
16252 unify_type_mismatch (explain_p
, args
[i
],
16253 TREE_VALUE (sarg
));
16262 if (excessive_deduction_depth
)
16264 if (deduction_depth
== 0)
16265 /* Reset once we're all the way out. */
16266 excessive_deduction_depth
= false;
16269 /* We can't free this if a pending_template entry or last_error_tinst_level
16270 is pointing at it. */
16271 if (last_pending_template
== old_last_pend
16272 && last_error_tinst_level
== old_error_tinst
)
16278 /* Adjust types before performing type deduction, as described in
16279 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16280 sections are symmetric. PARM is the type of a function parameter
16281 or the return type of the conversion function. ARG is the type of
16282 the argument passed to the call, or the type of the value
16283 initialized with the result of the conversion function.
16284 ARG_EXPR is the original argument expression, which may be null. */
16287 maybe_adjust_types_for_deduction (unification_kind_t strict
,
16301 /* Swap PARM and ARG throughout the remainder of this
16302 function; the handling is precisely symmetric since PARM
16303 will initialize ARG rather than vice versa. */
16311 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16312 too, but here handle it by stripping the reference from PARM
16313 rather than by adding it to ARG. */
16314 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16315 && TYPE_REF_IS_RVALUE (*parm
)
16316 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16317 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16318 && TREE_CODE (*arg
) == REFERENCE_TYPE
16319 && !TYPE_REF_IS_RVALUE (*arg
))
16320 *parm
= TREE_TYPE (*parm
);
16321 /* Nothing else to do in this case. */
16325 gcc_unreachable ();
16328 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16330 /* [temp.deduct.call]
16332 If P is not a reference type:
16334 --If A is an array type, the pointer type produced by the
16335 array-to-pointer standard conversion (_conv.array_) is
16336 used in place of A for type deduction; otherwise,
16338 --If A is a function type, the pointer type produced by
16339 the function-to-pointer standard conversion
16340 (_conv.func_) is used in place of A for type deduction;
16343 --If A is a cv-qualified type, the top level
16344 cv-qualifiers of A's type are ignored for type
16346 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16347 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16348 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16349 *arg
= build_pointer_type (*arg
);
16351 *arg
= TYPE_MAIN_VARIANT (*arg
);
16354 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16355 of the form T&&, where T is a template parameter, and the argument
16356 is an lvalue, T is deduced as A& */
16357 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16358 && TYPE_REF_IS_RVALUE (*parm
)
16359 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16360 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16361 && (arg_expr
? real_lvalue_p (arg_expr
)
16362 /* try_one_overload doesn't provide an arg_expr, but
16363 functions are always lvalues. */
16364 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16365 *arg
= build_reference_type (*arg
);
16367 /* [temp.deduct.call]
16369 If P is a cv-qualified type, the top level cv-qualifiers
16370 of P's type are ignored for type deduction. If P is a
16371 reference type, the type referred to by P is used for
16373 *parm
= TYPE_MAIN_VARIANT (*parm
);
16374 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16376 *parm
= TREE_TYPE (*parm
);
16377 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16380 /* DR 322. For conversion deduction, remove a reference type on parm
16381 too (which has been swapped into ARG). */
16382 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16383 *arg
= TREE_TYPE (*arg
);
16388 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16389 template which does contain any deducible template parameters; check if
16390 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16391 unify_one_argument. */
16394 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16395 int flags
, bool explain_p
)
16400 type
= TREE_TYPE (arg
);
16404 if (same_type_p (parm
, type
))
16405 return unify_success (explain_p
);
16407 if (strict
== DEDUCE_CONV
)
16409 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16410 explain_p
? tf_warning_or_error
: tf_none
))
16411 return unify_success (explain_p
);
16413 else if (strict
!= DEDUCE_EXACT
)
16415 if (can_convert_arg (parm
, type
,
16416 TYPE_P (arg
) ? NULL_TREE
: arg
,
16417 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16418 return unify_success (explain_p
);
16421 if (strict
== DEDUCE_EXACT
)
16422 return unify_type_mismatch (explain_p
, parm
, arg
);
16424 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16427 static bool uses_deducible_template_parms (tree type
);
16429 /* Returns true iff the expression EXPR is one from which a template
16430 argument can be deduced. In other words, if it's an undecorated
16431 use of a template non-type parameter. */
16434 deducible_expression (tree expr
)
16436 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16439 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16440 deducible way; that is, if it has a max value of <PARM> - 1. */
16443 deducible_array_bound (tree domain
)
16445 if (domain
== NULL_TREE
)
16448 tree max
= TYPE_MAX_VALUE (domain
);
16449 if (TREE_CODE (max
) != MINUS_EXPR
)
16452 return deducible_expression (TREE_OPERAND (max
, 0));
16455 /* Returns true iff the template arguments ARGS use a template parameter
16456 in a deducible way. */
16459 deducible_template_args (tree args
)
16461 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16464 tree elt
= TREE_VEC_ELT (args
, i
);
16465 if (ARGUMENT_PACK_P (elt
))
16466 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16469 if (PACK_EXPANSION_P (elt
))
16470 elt
= PACK_EXPANSION_PATTERN (elt
);
16471 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16473 else if (TYPE_P (elt
))
16474 deducible
= uses_deducible_template_parms (elt
);
16476 deducible
= deducible_expression (elt
);
16484 /* Returns true iff TYPE contains any deducible references to template
16485 parameters, as per 14.8.2.5. */
16488 uses_deducible_template_parms (tree type
)
16490 if (PACK_EXPANSION_P (type
))
16491 type
= PACK_EXPANSION_PATTERN (type
);
16498 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16499 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16505 if (POINTER_TYPE_P (type
))
16506 return uses_deducible_template_parms (TREE_TYPE (type
));
16508 /* T[integer-constant ]
16510 if (TREE_CODE (type
) == ARRAY_TYPE
)
16511 return (uses_deducible_template_parms (TREE_TYPE (type
))
16512 || deducible_array_bound (TYPE_DOMAIN (type
)));
16524 if (TYPE_PTRMEM_P (type
))
16525 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16526 || (uses_deducible_template_parms
16527 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16529 /* template-name <T> (where template-name refers to a class template)
16530 template-name <i> (where template-name refers to a class template) */
16531 if (CLASS_TYPE_P (type
)
16532 && CLASSTYPE_TEMPLATE_INFO (type
)
16533 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16534 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16535 (CLASSTYPE_TI_ARGS (type
)));
16540 if (TREE_CODE (type
) == FUNCTION_TYPE
16541 || TREE_CODE (type
) == METHOD_TYPE
)
16543 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16545 tree parm
= TYPE_ARG_TYPES (type
);
16546 if (TREE_CODE (type
) == METHOD_TYPE
)
16547 parm
= TREE_CHAIN (parm
);
16548 for (; parm
; parm
= TREE_CHAIN (parm
))
16549 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16556 /* Subroutine of type_unification_real and unify_pack_expansion to
16557 handle unification of a single P/A pair. Parameters are as
16558 for those functions. */
16561 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16562 int subr
, unification_kind_t strict
, int flags
,
16565 tree arg_expr
= NULL_TREE
;
16568 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16569 return unify_invalid (explain_p
);
16570 if (arg
== unknown_type_node
)
16571 /* We can't deduce anything from this, but we might get all the
16572 template args from other function args. */
16573 return unify_success (explain_p
);
16575 /* Implicit conversions (Clause 4) will be performed on a function
16576 argument to convert it to the type of the corresponding function
16577 parameter if the parameter type contains no template-parameters that
16578 participate in template argument deduction. */
16579 if (TYPE_P (parm
) && !uses_template_parms (parm
))
16580 /* For function parameters that contain no template-parameters at all,
16581 we have historically checked for convertibility in order to shortcut
16582 consideration of this candidate. */
16583 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
16585 else if (strict
== DEDUCE_CALL
16586 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16587 /* For function parameters with only non-deducible template parameters,
16589 return unify_success (explain_p
);
16594 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16595 | UNIFY_ALLOW_MORE_CV_QUAL
16596 | UNIFY_ALLOW_DERIVED
);
16600 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16604 arg_strict
= UNIFY_ALLOW_NONE
;
16608 gcc_unreachable ();
16611 /* We only do these transformations if this is the top-level
16612 parameter_type_list in a call or declaration matching; in other
16613 situations (nested function declarators, template argument lists) we
16614 won't be comparing a type to an expression, and we don't do any type
16620 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16621 if (type_unknown_p (arg
))
16623 /* [temp.deduct.type] A template-argument can be
16624 deduced from a pointer to function or pointer
16625 to member function argument if the set of
16626 overloaded functions does not contain function
16627 templates and at most one of a set of
16628 overloaded functions provides a unique
16631 if (resolve_overloaded_unification
16632 (tparms
, targs
, parm
, arg
, strict
,
16633 arg_strict
, explain_p
))
16634 return unify_success (explain_p
);
16635 return unify_overload_resolution_failure (explain_p
, arg
);
16639 arg
= unlowered_expr_type (arg
);
16640 if (arg
== error_mark_node
)
16641 return unify_invalid (explain_p
);
16645 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16648 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16649 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
16650 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16652 /* For deduction from an init-list we need the actual list. */
16653 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16655 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16658 /* Most parms like fn_type_unification.
16660 If SUBR is 1, we're being called recursively (to unify the
16661 arguments of a function or method parameter of a function
16664 CHECKS is a pointer to a vector of access checks encountered while
16665 substituting default template arguments. */
16668 type_unification_real (tree tparms
,
16672 unsigned int xnargs
,
16674 unification_kind_t strict
,
16676 vec
<deferred_access_check
, va_gc
> **checks
,
16681 int ntparms
= TREE_VEC_LENGTH (tparms
);
16682 int saw_undeduced
= 0;
16685 unsigned int nargs
;
16688 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16689 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16690 gcc_assert (ntparms
> 0);
16692 /* Reset the number of non-defaulted template arguments contained
16694 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16702 while (parms
&& parms
!= void_list_node
16705 parm
= TREE_VALUE (parms
);
16707 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16708 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16709 /* For a function parameter pack that occurs at the end of the
16710 parameter-declaration-list, the type A of each remaining
16711 argument of the call is compared with the type P of the
16712 declarator-id of the function parameter pack. */
16715 parms
= TREE_CHAIN (parms
);
16717 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16718 /* For a function parameter pack that does not occur at the
16719 end of the parameter-declaration-list, the type of the
16720 parameter pack is a non-deduced context. */
16726 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16732 && parms
!= void_list_node
16733 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16735 /* Unify the remaining arguments with the pack expansion type. */
16737 tree parmvec
= make_tree_vec (1);
16739 /* Allocate a TREE_VEC and copy in all of the arguments */
16740 argvec
= make_tree_vec (nargs
- ia
);
16741 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
16742 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
16744 /* Copy the parameter into parmvec. */
16745 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
16746 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
16747 /*subr=*/subr
, explain_p
))
16750 /* Advance to the end of the list of parameters. */
16751 parms
= TREE_CHAIN (parms
);
16754 /* Fail if we've reached the end of the parm list, and more args
16755 are present, and the parm list isn't variadic. */
16756 if (ia
< nargs
&& parms
== void_list_node
)
16757 return unify_too_many_arguments (explain_p
, nargs
, ia
);
16758 /* Fail if parms are left and they don't have default values and
16759 they aren't all deduced as empty packs (c++/57397). This is
16760 consistent with sufficient_parms_p. */
16761 if (parms
&& parms
!= void_list_node
16762 && TREE_PURPOSE (parms
) == NULL_TREE
)
16764 unsigned int count
= nargs
;
16769 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
16772 p
= TREE_CHAIN (p
);
16774 while (p
&& p
!= void_list_node
);
16775 if (count
!= nargs
)
16776 return unify_too_few_arguments (explain_p
, ia
, count
,
16782 tsubst_flags_t complain
= (explain_p
16783 ? tf_warning_or_error
16786 for (i
= 0; i
< ntparms
; i
++)
16788 tree targ
= TREE_VEC_ELT (targs
, i
);
16789 tree tparm
= TREE_VEC_ELT (tparms
, i
);
16791 /* Clear the "incomplete" flags on all argument packs now so that
16792 substituting them into later default arguments works. */
16793 if (targ
&& ARGUMENT_PACK_P (targ
))
16795 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
16796 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
16799 if (targ
|| tparm
== error_mark_node
)
16801 tparm
= TREE_VALUE (tparm
);
16803 /* If this is an undeduced nontype parameter that depends on
16804 a type parameter, try another pass; its type may have been
16805 deduced from a later argument than the one from which
16806 this parameter can be deduced. */
16807 if (TREE_CODE (tparm
) == PARM_DECL
16808 && uses_template_parms (TREE_TYPE (tparm
))
16809 && !saw_undeduced
++)
16812 /* Core issue #226 (C++0x) [temp.deduct]:
16814 If a template argument has not been deduced, its
16815 default template argument, if any, is used.
16817 When we are in C++98 mode, TREE_PURPOSE will either
16818 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16819 to explicitly check cxx_dialect here. */
16820 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
16822 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16823 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
16824 reopen_deferring_access_checks (*checks
);
16825 location_t save_loc
= input_location
;
16827 input_location
= DECL_SOURCE_LOCATION (parm
);
16828 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
16829 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
16831 input_location
= save_loc
;
16832 *checks
= get_deferred_access_checks ();
16833 pop_deferring_access_checks ();
16834 if (arg
== error_mark_node
)
16838 TREE_VEC_ELT (targs
, i
) = arg
;
16839 /* The position of the first default template argument,
16840 is also the number of non-defaulted arguments in TARGS.
16842 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16843 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
16848 /* If the type parameter is a parameter pack, then it will
16849 be deduced to an empty parameter pack. */
16850 if (template_parameter_pack_p (tparm
))
16854 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
16856 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
16857 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
16858 TREE_CONSTANT (arg
) = 1;
16861 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16863 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
16865 TREE_VEC_ELT (targs
, i
) = arg
;
16869 return unify_parameter_deduction_failure (explain_p
, tparm
);
16872 #ifdef ENABLE_CHECKING
16873 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16874 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
16877 return unify_success (explain_p
);
16880 /* Subroutine of type_unification_real. Args are like the variables
16881 at the call site. ARG is an overloaded function (or template-id);
16882 we try deducing template args from each of the overloads, and if
16883 only one succeeds, we go with that. Modifies TARGS and returns
16884 true on success. */
16887 resolve_overloaded_unification (tree tparms
,
16891 unification_kind_t strict
,
16895 tree tempargs
= copy_node (targs
);
16897 tree goodfn
= NULL_TREE
;
16900 if (TREE_CODE (arg
) == ADDR_EXPR
)
16902 arg
= TREE_OPERAND (arg
, 0);
16908 if (TREE_CODE (arg
) == COMPONENT_REF
)
16909 /* Handle `&x' where `x' is some static or non-static member
16911 arg
= TREE_OPERAND (arg
, 1);
16913 if (TREE_CODE (arg
) == OFFSET_REF
)
16914 arg
= TREE_OPERAND (arg
, 1);
16916 /* Strip baselink information. */
16917 if (BASELINK_P (arg
))
16918 arg
= BASELINK_FUNCTIONS (arg
);
16920 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
16922 /* If we got some explicit template args, we need to plug them into
16923 the affected templates before we try to unify, in case the
16924 explicit args will completely resolve the templates in question. */
16927 tree expl_subargs
= TREE_OPERAND (arg
, 1);
16928 arg
= TREE_OPERAND (arg
, 0);
16930 for (; arg
; arg
= OVL_NEXT (arg
))
16932 tree fn
= OVL_CURRENT (arg
);
16933 tree subargs
, elem
;
16935 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16938 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16939 expl_subargs
, NULL_TREE
, tf_none
,
16940 /*require_all_args=*/true,
16941 /*use_default_args=*/true);
16942 if (subargs
!= error_mark_node
16943 && !any_dependent_template_arguments_p (subargs
))
16945 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
16946 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16947 elem
, strict
, sub_strict
, addr_p
, explain_p
)
16948 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
16957 /* If no templates (or more than one) are fully resolved by the
16958 explicit arguments, this template-id is a non-deduced context; it
16959 could still be OK if we deduce all template arguments for the
16960 enclosing call through other arguments. */
16964 else if (TREE_CODE (arg
) != OVERLOAD
16965 && TREE_CODE (arg
) != FUNCTION_DECL
)
16966 /* If ARG is, for example, "(0, &f)" then its type will be unknown
16967 -- but the deduction does not succeed because the expression is
16968 not just the function on its own. */
16971 for (; arg
; arg
= OVL_NEXT (arg
))
16972 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16973 TREE_TYPE (OVL_CURRENT (arg
)),
16974 strict
, sub_strict
, addr_p
, explain_p
)
16975 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
16977 goodfn
= OVL_CURRENT (arg
);
16981 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16982 to function or pointer to member function argument if the set of
16983 overloaded functions does not contain function templates and at most
16984 one of a set of overloaded functions provides a unique match.
16986 So if we found multiple possibilities, we return success but don't
16987 deduce anything. */
16991 int i
= TREE_VEC_LENGTH (targs
);
16993 if (TREE_VEC_ELT (tempargs
, i
))
16995 tree old
= TREE_VEC_ELT (targs
, i
);
16996 tree new_
= TREE_VEC_ELT (tempargs
, i
);
16997 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
16998 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
16999 /* Don't forget explicit template arguments in a pack. */
17000 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
17001 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
17002 TREE_VEC_ELT (targs
, i
) = new_
;
17011 /* Core DR 115: In contexts where deduction is done and fails, or in
17012 contexts where deduction is not done, if a template argument list is
17013 specified and it, along with any default template arguments, identifies
17014 a single function template specialization, then the template-id is an
17015 lvalue for the function template specialization. */
17018 resolve_nondeduced_context (tree orig_expr
)
17020 tree expr
, offset
, baselink
;
17023 if (!type_unknown_p (orig_expr
))
17028 offset
= NULL_TREE
;
17029 baselink
= NULL_TREE
;
17031 if (TREE_CODE (expr
) == ADDR_EXPR
)
17033 expr
= TREE_OPERAND (expr
, 0);
17036 if (TREE_CODE (expr
) == OFFSET_REF
)
17039 expr
= TREE_OPERAND (expr
, 1);
17041 if (BASELINK_P (expr
))
17044 expr
= BASELINK_FUNCTIONS (expr
);
17047 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
17050 tree goodfn
= NULL_TREE
;
17052 /* If we got some explicit template args, we need to plug them into
17053 the affected templates before we try to unify, in case the
17054 explicit args will completely resolve the templates in question. */
17056 tree expl_subargs
= TREE_OPERAND (expr
, 1);
17057 tree arg
= TREE_OPERAND (expr
, 0);
17058 tree badfn
= NULL_TREE
;
17059 tree badargs
= NULL_TREE
;
17061 for (; arg
; arg
= OVL_NEXT (arg
))
17063 tree fn
= OVL_CURRENT (arg
);
17064 tree subargs
, elem
;
17066 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17069 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17070 expl_subargs
, NULL_TREE
, tf_none
,
17071 /*require_all_args=*/true,
17072 /*use_default_args=*/true);
17073 if (subargs
!= error_mark_node
17074 && !any_dependent_template_arguments_p (subargs
))
17076 elem
= instantiate_template (fn
, subargs
, tf_none
);
17077 if (elem
== error_mark_node
)
17082 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17091 mark_used (goodfn
);
17094 expr
= build_baselink (BASELINK_BINFO (baselink
),
17095 BASELINK_ACCESS_BINFO (baselink
),
17096 expr
, BASELINK_OPTYPE (baselink
));
17100 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17101 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17104 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17107 else if (good
== 0 && badargs
)
17108 /* There were no good options and at least one bad one, so let the
17109 user know what the problem is. */
17110 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17115 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17116 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17117 different overloads deduce different arguments for a given parm.
17118 ADDR_P is true if the expression for which deduction is being
17119 performed was of the form "& fn" rather than simply "fn".
17121 Returns 1 on success. */
17124 try_one_overload (tree tparms
,
17129 unification_kind_t strict
,
17138 if (arg
== error_mark_node
)
17141 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17142 to function or pointer to member function argument if the set of
17143 overloaded functions does not contain function templates and at most
17144 one of a set of overloaded functions provides a unique match.
17146 So if this is a template, just return success. */
17148 if (uses_template_parms (arg
))
17151 if (TREE_CODE (arg
) == METHOD_TYPE
)
17152 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
17154 arg
= build_pointer_type (arg
);
17156 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
17158 /* We don't copy orig_targs for this because if we have already deduced
17159 some template args from previous args, unify would complain when we
17160 try to deduce a template parameter for the same argument, even though
17161 there isn't really a conflict. */
17162 nargs
= TREE_VEC_LENGTH (targs
);
17163 tempargs
= make_tree_vec (nargs
);
17165 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
17168 /* First make sure we didn't deduce anything that conflicts with
17169 explicitly specified args. */
17170 for (i
= nargs
; i
--; )
17172 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17173 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
17177 else if (uses_template_parms (elt
))
17178 /* Since we're unifying against ourselves, we will fill in
17179 template args used in the function parm list with our own
17180 template parms. Discard them. */
17181 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
17182 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
17186 for (i
= nargs
; i
--; )
17188 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17191 TREE_VEC_ELT (targs
, i
) = elt
;
17197 /* PARM is a template class (perhaps with unbound template
17198 parameters). ARG is a fully instantiated type. If ARG can be
17199 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
17200 TARGS are as for unify. */
17203 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
17206 tree copy_of_targs
;
17208 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
17209 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
17210 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
17213 /* We need to make a new template argument vector for the call to
17214 unify. If we used TARGS, we'd clutter it up with the result of
17215 the attempted unification, even if this class didn't work out.
17216 We also don't want to commit ourselves to all the unifications
17217 we've already done, since unification is supposed to be done on
17218 an argument-by-argument basis. In other words, consider the
17219 following pathological case:
17221 template <int I, int J, int K>
17224 template <int I, int J>
17225 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
17227 template <int I, int J, int K>
17228 void f(S<I, J, K>, S<I, I, I>);
17237 Now, by the time we consider the unification involving `s2', we
17238 already know that we must have `f<0, 0, 0>'. But, even though
17239 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17240 because there are two ways to unify base classes of S<0, 1, 2>
17241 with S<I, I, I>. If we kept the already deduced knowledge, we
17242 would reject the possibility I=1. */
17243 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
17245 /* If unification failed, we're done. */
17246 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
17247 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
17253 /* Given a template type PARM and a class type ARG, find the unique
17254 base type in ARG that is an instance of PARM. We do not examine
17255 ARG itself; only its base-classes. If there is not exactly one
17256 appropriate base class, return NULL_TREE. PARM may be the type of
17257 a partial specialization, as well as a plain template type. Used
17260 static enum template_base_result
17261 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
17262 bool explain_p
, tree
*result
)
17264 tree rval
= NULL_TREE
;
17267 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
17269 binfo
= TYPE_BINFO (complete_type (arg
));
17272 /* The type could not be completed. */
17273 *result
= NULL_TREE
;
17274 return tbr_incomplete_type
;
17277 /* Walk in inheritance graph order. The search order is not
17278 important, and this avoids multiple walks of virtual bases. */
17279 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
17281 tree r
= try_class_unification (tparms
, targs
, parm
,
17282 BINFO_TYPE (binfo
), explain_p
);
17286 /* If there is more than one satisfactory baseclass, then:
17290 If they yield more than one possible deduced A, the type
17294 if (rval
&& !same_type_p (r
, rval
))
17296 *result
= NULL_TREE
;
17297 return tbr_ambiguous_baseclass
;
17305 return tbr_success
;
17308 /* Returns the level of DECL, which declares a template parameter. */
17311 template_decl_level (tree decl
)
17313 switch (TREE_CODE (decl
))
17316 case TEMPLATE_DECL
:
17317 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
17320 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
17323 gcc_unreachable ();
17328 /* Decide whether ARG can be unified with PARM, considering only the
17329 cv-qualifiers of each type, given STRICT as documented for unify.
17330 Returns nonzero iff the unification is OK on that basis. */
17333 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17335 int arg_quals
= cp_type_quals (arg
);
17336 int parm_quals
= cp_type_quals (parm
);
17338 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17339 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17341 /* Although a CVR qualifier is ignored when being applied to a
17342 substituted template parameter ([8.3.2]/1 for example), that
17343 does not allow us to unify "const T" with "int&" because both
17344 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17345 It is ok when we're allowing additional CV qualifiers
17346 at the outer level [14.8.2.1]/3,1st bullet. */
17347 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17348 || TREE_CODE (arg
) == FUNCTION_TYPE
17349 || TREE_CODE (arg
) == METHOD_TYPE
)
17350 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17353 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17354 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17358 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17359 && (arg_quals
& parm_quals
) != parm_quals
)
17362 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17363 && (parm_quals
& arg_quals
) != arg_quals
)
17369 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17371 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17373 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17374 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17375 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17377 *index
= TEMPLATE_TYPE_IDX (parm
);
17378 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17382 *index
= TEMPLATE_PARM_IDX (parm
);
17383 *level
= TEMPLATE_PARM_LEVEL (parm
);
17387 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17389 if (unify (TP, TA, P, A, S, EP)) \
17393 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17394 expansion at the end of PACKED_PARMS. Returns 0 if the type
17395 deduction succeeds, 1 otherwise. STRICT is the same as in
17396 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17397 call argument list. We'll need to adjust the arguments to make them
17398 types. SUBR tells us if this is from a recursive call to
17399 type_unification_real, or for comparing two template argument
17403 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17404 tree packed_args
, unification_kind_t strict
,
17405 bool subr
, bool explain_p
)
17408 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17409 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17410 tree pack
, packs
= NULL_TREE
;
17411 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17413 packed_args
= expand_template_argument_pack (packed_args
);
17415 int len
= TREE_VEC_LENGTH (packed_args
);
17417 /* Determine the parameter packs we will be deducing from the
17418 pattern, and record their current deductions. */
17419 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17420 pack
; pack
= TREE_CHAIN (pack
))
17422 tree parm_pack
= TREE_VALUE (pack
);
17425 /* Determine the index and level of this parameter pack. */
17426 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17428 /* Keep track of the parameter packs and their corresponding
17430 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17431 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17434 /* Loop through all of the arguments that have not yet been
17435 unified and unify each with the pattern. */
17436 for (i
= start
; i
< len
; i
++)
17439 bool any_explicit
= false;
17440 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17442 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17443 or the element of its argument pack at the current index if
17444 this argument was explicitly specified. */
17445 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17449 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17452 if (TREE_VALUE (pack
)
17453 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17454 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17456 any_explicit
= true;
17457 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17459 TMPL_ARG (targs
, level
, idx
) = arg
;
17462 /* If we had explicit template arguments, substitute them into the
17463 pattern before deduction. */
17466 /* Some arguments might still be unspecified or dependent. */
17468 ++processing_template_decl
;
17469 dependent
= any_dependent_template_arguments_p (targs
);
17471 --processing_template_decl
;
17472 parm
= tsubst (pattern
, targs
,
17473 explain_p
? tf_warning_or_error
: tf_none
,
17476 --processing_template_decl
;
17477 if (parm
== error_mark_node
)
17483 /* Unify the pattern with the current argument. */
17484 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17485 LOOKUP_IMPLICIT
, explain_p
))
17488 /* For each parameter pack, collect the deduced value. */
17489 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17492 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17494 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17495 TMPL_ARG (targs
, level
, idx
);
17499 /* Verify that the results of unification with the parameter packs
17500 produce results consistent with what we've seen before, and make
17501 the deduced argument packs available. */
17502 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17504 tree old_pack
= TREE_VALUE (pack
);
17505 tree new_args
= TREE_TYPE (pack
);
17506 int i
, len
= TREE_VEC_LENGTH (new_args
);
17508 bool nondeduced_p
= false;
17510 /* By default keep the original deduced argument pack.
17511 If necessary, more specific code is going to update the
17512 resulting deduced argument later down in this function. */
17513 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17514 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17516 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17517 actually deduce anything. */
17518 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17519 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17520 nondeduced_p
= true;
17524 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17526 /* If we had fewer function args than explicit template args,
17527 just use the explicits. */
17528 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17529 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17530 if (len
< explicit_len
)
17531 new_args
= explicit_args
;
17537 /* Build the deduced *_ARGUMENT_PACK. */
17538 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17540 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17541 TREE_TYPE (result
) =
17542 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17543 TREE_CONSTANT (result
) = 1;
17546 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17548 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17550 /* Note the deduced argument packs for this parameter
17552 TMPL_ARG (targs
, level
, idx
) = result
;
17554 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17555 && (ARGUMENT_PACK_ARGS (old_pack
)
17556 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17558 /* We only had the explicitly-provided arguments before, but
17559 now we have a complete set of arguments. */
17560 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17562 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17563 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17564 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17568 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17569 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17571 if (!comp_template_args_with_info (old_args
, new_args
,
17572 &bad_old_arg
, &bad_new_arg
))
17573 /* Inconsistent unification of this parameter pack. */
17574 return unify_parameter_pack_inconsistent (explain_p
,
17580 return unify_success (explain_p
);
17583 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17584 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17585 parameters and return value are as for unify. */
17588 unify_array_domain (tree tparms
, tree targs
,
17589 tree parm_dom
, tree arg_dom
,
17597 /* Our representation of array types uses "N - 1" as the
17598 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17599 not an integer constant. We cannot unify arbitrarily
17600 complex expressions, so we eliminate the MINUS_EXPRs
17602 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17603 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17606 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17607 parm_max
= TREE_OPERAND (parm_max
, 0);
17609 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17610 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17613 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17614 trying to unify the type of a variable with the type
17615 of a template parameter. For example:
17617 template <unsigned int N>
17618 void f (char (&) [N]);
17625 Here, the type of the ARG will be "int [g(i)]", and
17626 may be a SAVE_EXPR, etc. */
17627 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17628 return unify_vla_arg (explain_p
, arg_dom
);
17629 arg_max
= TREE_OPERAND (arg_max
, 0);
17632 /* If only one of the bounds used a MINUS_EXPR, compensate
17633 by adding one to the other bound. */
17634 if (parm_cst
&& !arg_cst
)
17635 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17639 else if (arg_cst
&& !parm_cst
)
17640 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17645 return unify (tparms
, targs
, parm_max
, arg_max
,
17646 UNIFY_ALLOW_INTEGER
, explain_p
);
17649 /* Deduce the value of template parameters. TPARMS is the (innermost)
17650 set of template parameters to a template. TARGS is the bindings
17651 for those template parameters, as determined thus far; TARGS may
17652 include template arguments for outer levels of template parameters
17653 as well. PARM is a parameter to a template function, or a
17654 subcomponent of that parameter; ARG is the corresponding argument.
17655 This function attempts to match PARM with ARG in a manner
17656 consistent with the existing assignments in TARGS. If more values
17657 are deduced, then TARGS is updated.
17659 Returns 0 if the type deduction succeeds, 1 otherwise. The
17660 parameter STRICT is a bitwise or of the following flags:
17663 Require an exact match between PARM and ARG.
17664 UNIFY_ALLOW_MORE_CV_QUAL:
17665 Allow the deduced ARG to be more cv-qualified (by qualification
17666 conversion) than ARG.
17667 UNIFY_ALLOW_LESS_CV_QUAL:
17668 Allow the deduced ARG to be less cv-qualified than ARG.
17669 UNIFY_ALLOW_DERIVED:
17670 Allow the deduced ARG to be a template base class of ARG,
17671 or a pointer to a template base class of the type pointed to by
17673 UNIFY_ALLOW_INTEGER:
17674 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17675 case for more information.
17676 UNIFY_ALLOW_OUTER_LEVEL:
17677 This is the outermost level of a deduction. Used to determine validity
17678 of qualification conversions. A valid qualification conversion must
17679 have const qualified pointers leading up to the inner type which
17680 requires additional CV quals, except at the outer level, where const
17681 is not required [conv.qual]. It would be normal to set this flag in
17682 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17683 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17684 This is the outermost level of a deduction, and PARM can be more CV
17685 qualified at this point.
17686 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17687 This is the outermost level of a deduction, and PARM can be less CV
17688 qualified at this point. */
17691 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
17697 int strict_in
= strict
;
17699 /* I don't think this will do the right thing with respect to types.
17700 But the only case I've seen it in so far has been array bounds, where
17701 signedness is the only information lost, and I think that will be
17703 while (TREE_CODE (parm
) == NOP_EXPR
)
17704 parm
= TREE_OPERAND (parm
, 0);
17706 if (arg
== error_mark_node
)
17707 return unify_invalid (explain_p
);
17708 if (arg
== unknown_type_node
17709 || arg
== init_list_type_node
)
17710 /* We can't deduce anything from this, but we might get all the
17711 template args from other function args. */
17712 return unify_success (explain_p
);
17714 /* If PARM uses template parameters, then we can't bail out here,
17715 even if ARG == PARM, since we won't record unifications for the
17716 template parameters. We might need them if we're trying to
17717 figure out which of two things is more specialized. */
17718 if (arg
== parm
&& !uses_template_parms (parm
))
17719 return unify_success (explain_p
);
17721 /* Handle init lists early, so the rest of the function can assume
17722 we're dealing with a type. */
17723 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
17727 tree orig_parm
= parm
;
17729 /* Replace T with std::initializer_list<T> for deduction. */
17730 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17731 && flag_deduce_init_list
)
17732 parm
= listify (parm
);
17734 if (!is_std_init_list (parm
)
17735 && TREE_CODE (parm
) != ARRAY_TYPE
)
17736 /* We can only deduce from an initializer list argument if the
17737 parameter is std::initializer_list or an array; otherwise this
17738 is a non-deduced context. */
17739 return unify_success (explain_p
);
17741 if (TREE_CODE (parm
) == ARRAY_TYPE
)
17742 elttype
= TREE_TYPE (parm
);
17744 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
17746 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
17748 int elt_strict
= strict
;
17750 if (elt
== error_mark_node
)
17751 return unify_invalid (explain_p
);
17753 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
17755 tree type
= TREE_TYPE (elt
);
17756 /* It should only be possible to get here for a call. */
17757 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
17758 elt_strict
|= maybe_adjust_types_for_deduction
17759 (DEDUCE_CALL
, &elttype
, &type
, elt
);
17763 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
17767 if (TREE_CODE (parm
) == ARRAY_TYPE
17768 && deducible_array_bound (TYPE_DOMAIN (parm
)))
17770 /* Also deduce from the length of the initializer list. */
17771 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
17772 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
17773 if (idx
== error_mark_node
)
17774 return unify_invalid (explain_p
);
17775 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17779 /* If the std::initializer_list<T> deduction worked, replace the
17780 deduced A with std::initializer_list<A>. */
17781 if (orig_parm
!= parm
)
17783 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
17784 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17785 targ
= listify (targ
);
17786 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
17788 return unify_success (explain_p
);
17791 /* Immediately reject some pairs that won't unify because of
17792 cv-qualification mismatches. */
17793 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17795 /* It is the elements of the array which hold the cv quals of an array
17796 type, and the elements might be template type parms. We'll check
17797 when we recurse. */
17798 && TREE_CODE (arg
) != ARRAY_TYPE
17799 /* We check the cv-qualifiers when unifying with template type
17800 parameters below. We want to allow ARG `const T' to unify with
17801 PARM `T' for example, when computing which of two templates
17802 is more specialized, for example. */
17803 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
17804 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
17805 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17807 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
17808 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
17809 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
17810 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
17811 strict
&= ~UNIFY_ALLOW_DERIVED
;
17812 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17813 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
17815 switch (TREE_CODE (parm
))
17817 case TYPENAME_TYPE
:
17819 case UNBOUND_CLASS_TEMPLATE
:
17820 /* In a type which contains a nested-name-specifier, template
17821 argument values cannot be deduced for template parameters used
17822 within the nested-name-specifier. */
17823 return unify_success (explain_p
);
17825 case TEMPLATE_TYPE_PARM
:
17826 case TEMPLATE_TEMPLATE_PARM
:
17827 case BOUND_TEMPLATE_TEMPLATE_PARM
:
17828 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17829 if (error_operand_p (tparm
))
17830 return unify_invalid (explain_p
);
17832 if (TEMPLATE_TYPE_LEVEL (parm
)
17833 != template_decl_level (tparm
))
17834 /* The PARM is not one we're trying to unify. Just check
17835 to see if it matches ARG. */
17837 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17838 && (is_auto (parm
) ? is_auto (arg
)
17839 : same_type_p (parm
, arg
)))
17840 return unify_success (explain_p
);
17842 return unify_type_mismatch (explain_p
, parm
, arg
);
17844 idx
= TEMPLATE_TYPE_IDX (parm
);
17845 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17846 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
17847 if (error_operand_p (tparm
))
17848 return unify_invalid (explain_p
);
17850 /* Check for mixed types and values. */
17851 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17852 && TREE_CODE (tparm
) != TYPE_DECL
)
17853 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17854 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
17855 gcc_unreachable ();
17857 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17859 /* ARG must be constructed from a template class or a template
17860 template parameter. */
17861 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
17862 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
17863 return unify_template_deduction_failure (explain_p
, parm
, arg
);
17865 tree parmvec
= TYPE_TI_ARGS (parm
);
17866 /* An alias template name is never deduced. */
17867 if (TYPE_ALIAS_P (arg
))
17868 arg
= strip_typedefs (arg
);
17869 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
17870 tree full_argvec
= add_to_template_args (targs
, argvec
);
17872 = DECL_INNERMOST_TEMPLATE_PARMS
17873 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
17875 int parm_variadic_p
= 0;
17877 /* The resolution to DR150 makes clear that default
17878 arguments for an N-argument may not be used to bind T
17879 to a template template parameter with fewer than N
17880 parameters. It is not safe to permit the binding of
17881 default arguments as an extension, as that may change
17882 the meaning of a conforming program. Consider:
17884 struct Dense { static const unsigned int dim = 1; };
17886 template <template <typename> class View,
17888 void operator+(float, View<Block> const&);
17890 template <typename Block,
17891 unsigned int Dim = Block::dim>
17892 struct Lvalue_proxy { operator float() const; };
17896 Lvalue_proxy<Dense> p;
17901 Here, if Lvalue_proxy is permitted to bind to View, then
17902 the global operator+ will be used; if they are not, the
17903 Lvalue_proxy will be converted to float. */
17904 if (coerce_template_parms (parm_parms
,
17906 TYPE_TI_TEMPLATE (parm
),
17908 ? tf_warning_or_error
17910 /*require_all_args=*/true,
17911 /*use_default_args=*/false)
17912 == error_mark_node
)
17915 /* Deduce arguments T, i from TT<T> or TT<i>.
17916 We check each element of PARMVEC and ARGVEC individually
17917 rather than the whole TREE_VEC since they can have
17918 different number of elements. */
17920 parmvec
= expand_template_argument_pack (parmvec
);
17921 argvec
= expand_template_argument_pack (argvec
);
17923 len
= TREE_VEC_LENGTH (parmvec
);
17925 /* Check if the parameters end in a pack, making them
17928 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
17929 parm_variadic_p
= 1;
17931 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17932 /* If the template argument list of P contains a pack
17933 expansion that is not the last template argument, the
17934 entire template argument list is a non-deduced
17936 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
17937 return unify_success (explain_p
);
17939 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
17940 return unify_too_few_arguments (explain_p
,
17941 TREE_VEC_LENGTH (argvec
), len
);
17943 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17945 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17946 TREE_VEC_ELT (parmvec
, i
),
17947 TREE_VEC_ELT (argvec
, i
),
17948 UNIFY_ALLOW_NONE
, explain_p
);
17951 if (parm_variadic_p
17952 && unify_pack_expansion (tparms
, targs
,
17955 /*subr=*/true, explain_p
))
17958 arg
= TYPE_TI_TEMPLATE (arg
);
17960 /* Fall through to deduce template name. */
17963 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17964 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17966 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
17968 /* Simple cases: Value already set, does match or doesn't. */
17969 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
17970 return unify_success (explain_p
);
17972 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17976 /* If PARM is `const T' and ARG is only `int', we don't have
17977 a match unless we are allowing additional qualification.
17978 If ARG is `const int' and PARM is just `T' that's OK;
17979 that binds `const int' to `T'. */
17980 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
17982 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17984 /* Consider the case where ARG is `const volatile int' and
17985 PARM is `const T'. Then, T should be `volatile int'. */
17986 arg
= cp_build_qualified_type_real
17987 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
17988 if (arg
== error_mark_node
)
17989 return unify_invalid (explain_p
);
17991 /* Simple cases: Value already set, does match or doesn't. */
17992 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
17993 return unify_success (explain_p
);
17995 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17997 /* Make sure that ARG is not a variable-sized array. (Note
17998 that were talking about variable-sized arrays (like
17999 `int[n]'), rather than arrays of unknown size (like
18000 `int[]').) We'll get very confused by such a type since
18001 the bound of the array is not constant, and therefore
18002 not mangleable. Besides, such types are not allowed in
18003 ISO C++, so we can do as we please here. We do allow
18004 them for 'auto' deduction, since that isn't ABI-exposed. */
18005 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
18006 return unify_vla_arg (explain_p
, arg
);
18008 /* Strip typedefs as in convert_template_argument. */
18009 arg
= canonicalize_type_argument (arg
, tf_none
);
18012 /* If ARG is a parameter pack or an expansion, we cannot unify
18013 against it unless PARM is also a parameter pack. */
18014 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18015 && !template_parameter_pack_p (parm
))
18016 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18018 /* If the argument deduction results is a METHOD_TYPE,
18019 then there is a problem.
18020 METHOD_TYPE doesn't map to any real C++ type the result of
18021 the deduction can not be of that type. */
18022 if (TREE_CODE (arg
) == METHOD_TYPE
)
18023 return unify_method_type_error (explain_p
, arg
);
18025 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18026 return unify_success (explain_p
);
18028 case TEMPLATE_PARM_INDEX
:
18029 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
18030 if (error_operand_p (tparm
))
18031 return unify_invalid (explain_p
);
18033 if (TEMPLATE_PARM_LEVEL (parm
)
18034 != template_decl_level (tparm
))
18036 /* The PARM is not one we're trying to unify. Just check
18037 to see if it matches ARG. */
18038 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
18039 && cp_tree_equal (parm
, arg
));
18041 unify_expression_unequal (explain_p
, parm
, arg
);
18045 idx
= TEMPLATE_PARM_IDX (parm
);
18046 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18050 int x
= !cp_tree_equal (targ
, arg
);
18052 unify_inconsistency (explain_p
, parm
, targ
, arg
);
18056 /* [temp.deduct.type] If, in the declaration of a function template
18057 with a non-type template-parameter, the non-type
18058 template-parameter is used in an expression in the function
18059 parameter-list and, if the corresponding template-argument is
18060 deduced, the template-argument type shall match the type of the
18061 template-parameter exactly, except that a template-argument
18062 deduced from an array bound may be of any integral type.
18063 The non-type parameter might use already deduced type parameters. */
18064 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
18065 if (!TREE_TYPE (arg
))
18066 /* Template-parameter dependent expression. Just accept it for now.
18067 It will later be processed in convert_template_argument. */
18069 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18071 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18072 && CP_INTEGRAL_TYPE_P (tparm
))
18073 /* Convert the ARG to the type of PARM; the deduced non-type
18074 template argument must exactly match the types of the
18075 corresponding parameter. */
18076 arg
= fold (build_nop (tparm
, arg
));
18077 else if (uses_template_parms (tparm
))
18078 /* We haven't deduced the type of this parameter yet. Try again
18080 return unify_success (explain_p
);
18082 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18084 /* If ARG is a parameter pack or an expansion, we cannot unify
18085 against it unless PARM is also a parameter pack. */
18086 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18087 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18088 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18090 arg
= strip_typedefs_expr (arg
);
18091 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18092 return unify_success (explain_p
);
18096 /* A pointer-to-member constant can be unified only with
18097 another constant. */
18098 if (TREE_CODE (arg
) != PTRMEM_CST
)
18099 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18101 /* Just unify the class member. It would be useless (and possibly
18102 wrong, depending on the strict flags) to unify also
18103 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18104 arg refer to the same variable, even if through different
18105 classes. For instance:
18107 struct A { int x; };
18110 Unification of &A::x and &B::x must succeed. */
18111 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18112 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18117 if (!TYPE_PTR_P (arg
))
18118 return unify_type_mismatch (explain_p
, parm
, arg
);
18120 /* [temp.deduct.call]
18122 A can be another pointer or pointer to member type that can
18123 be converted to the deduced A via a qualification
18124 conversion (_conv.qual_).
18126 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18127 This will allow for additional cv-qualification of the
18128 pointed-to types if appropriate. */
18130 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18131 /* The derived-to-base conversion only persists through one
18132 level of pointers. */
18133 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
18135 return unify (tparms
, targs
, TREE_TYPE (parm
),
18136 TREE_TYPE (arg
), strict
, explain_p
);
18139 case REFERENCE_TYPE
:
18140 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
18141 return unify_type_mismatch (explain_p
, parm
, arg
);
18142 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18143 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18146 if (TREE_CODE (arg
) != ARRAY_TYPE
)
18147 return unify_type_mismatch (explain_p
, parm
, arg
);
18148 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
18149 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
18150 return unify_type_mismatch (explain_p
, parm
, arg
);
18151 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18152 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18153 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
18154 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18155 TYPE_DOMAIN (arg
), explain_p
);
18156 return unify_success (explain_p
);
18163 case ENUMERAL_TYPE
:
18166 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18167 return unify_type_mismatch (explain_p
, parm
, arg
);
18169 /* We have already checked cv-qualification at the top of the
18171 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
18172 return unify_type_mismatch (explain_p
, parm
, arg
);
18174 /* As far as unification is concerned, this wins. Later checks
18175 will invalidate it if necessary. */
18176 return unify_success (explain_p
);
18178 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
18179 /* Type INTEGER_CST can come from ordinary constant template args. */
18181 while (TREE_CODE (arg
) == NOP_EXPR
)
18182 arg
= TREE_OPERAND (arg
, 0);
18184 if (TREE_CODE (arg
) != INTEGER_CST
)
18185 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18186 return (tree_int_cst_equal (parm
, arg
)
18187 ? unify_success (explain_p
)
18188 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
18192 int i
, len
, argslen
;
18193 int parm_variadic_p
= 0;
18195 if (TREE_CODE (arg
) != TREE_VEC
)
18196 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18198 len
= TREE_VEC_LENGTH (parm
);
18199 argslen
= TREE_VEC_LENGTH (arg
);
18201 /* Check for pack expansions in the parameters. */
18202 for (i
= 0; i
< len
; ++i
)
18204 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
18207 /* We can unify against something with a trailing
18209 parm_variadic_p
= 1;
18211 /* [temp.deduct.type]/9: If the template argument list of
18212 P contains a pack expansion that is not the last
18213 template argument, the entire template argument list
18214 is a non-deduced context. */
18215 return unify_success (explain_p
);
18219 /* If we don't have enough arguments to satisfy the parameters
18220 (not counting the pack expression at the end), or we have
18221 too many arguments for a parameter list that doesn't end in
18222 a pack expression, we can't unify. */
18223 if (parm_variadic_p
18224 ? argslen
< len
- parm_variadic_p
18226 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
18228 /* Unify all of the parameters that precede the (optional)
18229 pack expression. */
18230 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18232 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18233 TREE_VEC_ELT (parm
, i
),
18234 TREE_VEC_ELT (arg
, i
),
18235 UNIFY_ALLOW_NONE
, explain_p
);
18237 if (parm_variadic_p
)
18238 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
18240 /*subr=*/true, explain_p
);
18241 return unify_success (explain_p
);
18246 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18247 return unify_type_mismatch (explain_p
, parm
, arg
);
18249 if (TYPE_PTRMEMFUNC_P (parm
))
18251 if (!TYPE_PTRMEMFUNC_P (arg
))
18252 return unify_type_mismatch (explain_p
, parm
, arg
);
18254 return unify (tparms
, targs
,
18255 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
18256 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
18257 strict
, explain_p
);
18259 else if (TYPE_PTRMEMFUNC_P (arg
))
18260 return unify_type_mismatch (explain_p
, parm
, arg
);
18262 if (CLASSTYPE_TEMPLATE_INFO (parm
))
18264 tree t
= NULL_TREE
;
18266 if (strict_in
& UNIFY_ALLOW_DERIVED
)
18268 /* First, we try to unify the PARM and ARG directly. */
18269 t
= try_class_unification (tparms
, targs
,
18270 parm
, arg
, explain_p
);
18274 /* Fallback to the special case allowed in
18275 [temp.deduct.call]:
18277 If P is a class, and P has the form
18278 template-id, then A can be a derived class of
18279 the deduced A. Likewise, if P is a pointer to
18280 a class of the form template-id, A can be a
18281 pointer to a derived class pointed to by the
18283 enum template_base_result r
;
18284 r
= get_template_base (tparms
, targs
, parm
, arg
,
18288 return unify_no_common_base (explain_p
, r
, parm
, arg
);
18291 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
18292 && (CLASSTYPE_TI_TEMPLATE (parm
)
18293 == CLASSTYPE_TI_TEMPLATE (arg
)))
18294 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18295 Then, we should unify `int' and `U'. */
18298 /* There's no chance of unification succeeding. */
18299 return unify_type_mismatch (explain_p
, parm
, arg
);
18301 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
18302 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
18304 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
18305 return unify_type_mismatch (explain_p
, parm
, arg
);
18306 return unify_success (explain_p
);
18309 case FUNCTION_TYPE
:
18311 unsigned int nargs
;
18316 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18317 return unify_type_mismatch (explain_p
, parm
, arg
);
18319 /* CV qualifications for methods can never be deduced, they must
18320 match exactly. We need to check them explicitly here,
18321 because type_unification_real treats them as any other
18322 cv-qualified parameter. */
18323 if (TREE_CODE (parm
) == METHOD_TYPE
18324 && (!check_cv_quals_for_unify
18326 class_of_this_parm (arg
),
18327 class_of_this_parm (parm
))))
18328 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18330 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18331 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18333 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18334 args
= XALLOCAVEC (tree
, nargs
);
18335 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18336 a
!= NULL_TREE
&& a
!= void_list_node
;
18337 a
= TREE_CHAIN (a
), ++i
)
18338 args
[i
] = TREE_VALUE (a
);
18341 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18342 args
, nargs
, 1, DEDUCE_EXACT
,
18343 LOOKUP_NORMAL
, NULL
, explain_p
);
18347 /* Unify a pointer to member with a pointer to member function, which
18348 deduces the type of the member as a function type. */
18349 if (TYPE_PTRMEMFUNC_P (arg
))
18351 /* Check top-level cv qualifiers */
18352 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18353 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18355 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18356 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18357 UNIFY_ALLOW_NONE
, explain_p
);
18359 /* Determine the type of the function we are unifying against. */
18360 tree fntype
= static_fn_type (arg
);
18362 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18365 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18366 return unify_type_mismatch (explain_p
, parm
, arg
);
18367 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18368 TYPE_OFFSET_BASETYPE (arg
),
18369 UNIFY_ALLOW_NONE
, explain_p
);
18370 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18371 strict
, explain_p
);
18374 if (DECL_TEMPLATE_PARM_P (parm
))
18375 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18376 if (arg
!= integral_constant_value (parm
))
18377 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18378 return unify_success (explain_p
);
18381 case TEMPLATE_DECL
:
18382 /* Matched cases are handled by the ARG == PARM test above. */
18383 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18386 /* A non-type template parameter that is a variable should be a
18387 an integral constant, in which case, it whould have been
18388 folded into its (constant) value. So we should not be getting
18389 a variable here. */
18390 gcc_unreachable ();
18392 case TYPE_ARGUMENT_PACK
:
18393 case NONTYPE_ARGUMENT_PACK
:
18394 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18395 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18398 case DECLTYPE_TYPE
:
18399 case UNDERLYING_TYPE
:
18400 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18401 or UNDERLYING_TYPE nodes. */
18402 return unify_success (explain_p
);
18405 /* Unification fails if we hit an error node. */
18406 return unify_invalid (explain_p
);
18409 if (REFERENCE_REF_P (parm
))
18410 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18411 strict
, explain_p
);
18415 /* An unresolved overload is a nondeduced context. */
18416 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18417 return unify_success (explain_p
);
18418 gcc_assert (EXPR_P (parm
));
18420 /* We must be looking at an expression. This can happen with
18424 void foo(S<I>, S<I + 2>);
18426 This is a "nondeduced context":
18430 The nondeduced contexts are:
18432 --A type that is a template-id in which one or more of
18433 the template-arguments is an expression that references
18434 a template-parameter.
18436 In these cases, we assume deduction succeeded, but don't
18437 actually infer any unifications. */
18439 if (!uses_template_parms (parm
)
18440 && !template_args_equal (parm
, arg
))
18441 return unify_expression_unequal (explain_p
, parm
, arg
);
18443 return unify_success (explain_p
);
18446 #undef RECUR_AND_CHECK_FAILURE
18448 /* Note that DECL can be defined in this translation unit, if
18452 mark_definable (tree decl
)
18455 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18456 FOR_EACH_CLONE (clone
, decl
)
18457 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18460 /* Called if RESULT is explicitly instantiated, or is a member of an
18461 explicitly instantiated class. */
18464 mark_decl_instantiated (tree result
, int extern_p
)
18466 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18468 /* If this entity has already been written out, it's too late to
18469 make any modifications. */
18470 if (TREE_ASM_WRITTEN (result
))
18473 /* For anonymous namespace we don't need to do anything. */
18474 if (decl_anon_ns_mem_p (result
))
18476 gcc_assert (!TREE_PUBLIC (result
));
18480 if (TREE_CODE (result
) != FUNCTION_DECL
)
18481 /* The TREE_PUBLIC flag for function declarations will have been
18482 set correctly by tsubst. */
18483 TREE_PUBLIC (result
) = 1;
18485 /* This might have been set by an earlier implicit instantiation. */
18486 DECL_COMDAT (result
) = 0;
18489 DECL_NOT_REALLY_EXTERN (result
) = 0;
18492 mark_definable (result
);
18493 mark_needed (result
);
18494 /* Always make artificials weak. */
18495 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18496 comdat_linkage (result
);
18497 /* For WIN32 we also want to put explicit instantiations in
18498 linkonce sections. */
18499 else if (TREE_PUBLIC (result
))
18500 maybe_make_one_only (result
);
18503 /* If EXTERN_P, then this function will not be emitted -- unless
18504 followed by an explicit instantiation, at which point its linkage
18505 will be adjusted. If !EXTERN_P, then this function will be
18506 emitted here. In neither circumstance do we want
18507 import_export_decl to adjust the linkage. */
18508 DECL_INTERFACE_KNOWN (result
) = 1;
18511 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18512 important template arguments. If any are missing, we check whether
18513 they're important by using error_mark_node for substituting into any
18514 args that were used for partial ordering (the ones between ARGS and END)
18515 and seeing if it bubbles up. */
18518 check_undeduced_parms (tree targs
, tree args
, tree end
)
18520 bool found
= false;
18522 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18523 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18526 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18530 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18531 if (substed
== error_mark_node
)
18537 /* Given two function templates PAT1 and PAT2, return:
18539 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18540 -1 if PAT2 is more specialized than PAT1.
18541 0 if neither is more specialized.
18543 LEN indicates the number of parameters we should consider
18544 (defaulted parameters should not be considered).
18546 The 1998 std underspecified function template partial ordering, and
18547 DR214 addresses the issue. We take pairs of arguments, one from
18548 each of the templates, and deduce them against each other. One of
18549 the templates will be more specialized if all the *other*
18550 template's arguments deduce against its arguments and at least one
18551 of its arguments *does* *not* deduce against the other template's
18552 corresponding argument. Deduction is done as for class templates.
18553 The arguments used in deduction have reference and top level cv
18554 qualifiers removed. Iff both arguments were originally reference
18555 types *and* deduction succeeds in both directions, an lvalue reference
18556 wins against an rvalue reference and otherwise the template
18557 with the more cv-qualified argument wins for that pairing (if
18558 neither is more cv-qualified, they both are equal). Unlike regular
18559 deduction, after all the arguments have been deduced in this way,
18560 we do *not* verify the deduced template argument values can be
18561 substituted into non-deduced contexts.
18563 The logic can be a bit confusing here, because we look at deduce1 and
18564 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18565 can find template arguments for pat1 to make arg1 look like arg2, that
18566 means that arg2 is at least as specialized as arg1. */
18569 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18571 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18572 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18573 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18574 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18575 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18576 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18577 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18578 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18579 tree origs1
, origs2
;
18580 bool lose1
= false;
18581 bool lose2
= false;
18583 /* Remove the this parameter from non-static member functions. If
18584 one is a non-static member function and the other is not a static
18585 member function, remove the first parameter from that function
18586 also. This situation occurs for operator functions where we
18587 locate both a member function (with this pointer) and non-member
18588 operator (with explicit first operand). */
18589 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18591 len
--; /* LEN is the number of significant arguments for DECL1 */
18592 args1
= TREE_CHAIN (args1
);
18593 if (!DECL_STATIC_FUNCTION_P (decl2
))
18594 args2
= TREE_CHAIN (args2
);
18596 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18598 args2
= TREE_CHAIN (args2
);
18599 if (!DECL_STATIC_FUNCTION_P (decl1
))
18602 args1
= TREE_CHAIN (args1
);
18606 /* If only one is a conversion operator, they are unordered. */
18607 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18610 /* Consider the return type for a conversion function */
18611 if (DECL_CONV_FN_P (decl1
))
18613 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18614 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18618 processing_template_decl
++;
18624 /* Stop when an ellipsis is seen. */
18625 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18627 tree arg1
= TREE_VALUE (args1
);
18628 tree arg2
= TREE_VALUE (args2
);
18629 int deduce1
, deduce2
;
18635 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18636 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18638 /* When both arguments are pack expansions, we need only
18639 unify the patterns themselves. */
18640 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18641 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18643 /* This is the last comparison we need to do. */
18647 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18649 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18650 arg1
= TREE_TYPE (arg1
);
18651 quals1
= cp_type_quals (arg1
);
18654 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18656 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18657 arg2
= TREE_TYPE (arg2
);
18658 quals2
= cp_type_quals (arg2
);
18661 arg1
= TYPE_MAIN_VARIANT (arg1
);
18662 arg2
= TYPE_MAIN_VARIANT (arg2
);
18664 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
18666 int i
, len2
= list_length (args2
);
18667 tree parmvec
= make_tree_vec (1);
18668 tree argvec
= make_tree_vec (len2
);
18671 /* Setup the parameter vector, which contains only ARG1. */
18672 TREE_VEC_ELT (parmvec
, 0) = arg1
;
18674 /* Setup the argument vector, which contains the remaining
18676 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
18677 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18679 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
18680 argvec
, DEDUCE_EXACT
,
18681 /*subr=*/true, /*explain_p=*/false)
18684 /* We cannot deduce in the other direction, because ARG1 is
18685 a pack expansion but ARG2 is not. */
18688 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18690 int i
, len1
= list_length (args1
);
18691 tree parmvec
= make_tree_vec (1);
18692 tree argvec
= make_tree_vec (len1
);
18695 /* Setup the parameter vector, which contains only ARG1. */
18696 TREE_VEC_ELT (parmvec
, 0) = arg2
;
18698 /* Setup the argument vector, which contains the remaining
18700 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
18701 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18703 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
18704 argvec
, DEDUCE_EXACT
,
18705 /*subr=*/true, /*explain_p=*/false)
18708 /* We cannot deduce in the other direction, because ARG2 is
18709 a pack expansion but ARG1 is not.*/
18715 /* The normal case, where neither argument is a pack
18717 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
18718 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18720 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
18721 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18725 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18726 arg2, then arg2 is not as specialized as arg1. */
18732 /* "If, for a given type, deduction succeeds in both directions
18733 (i.e., the types are identical after the transformations above)
18734 and both P and A were reference types (before being replaced with
18735 the type referred to above):
18736 - if the type from the argument template was an lvalue reference and
18737 the type from the parameter template was not, the argument type is
18738 considered to be more specialized than the other; otherwise,
18739 - if the type from the argument template is more cv-qualified
18740 than the type from the parameter template (as described above),
18741 the argument type is considered to be more specialized than the other;
18743 - neither type is more specialized than the other." */
18745 if (deduce1
&& deduce2
)
18747 if (ref1
&& ref2
&& ref1
!= ref2
)
18754 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
18756 if ((quals1
& quals2
) == quals2
)
18758 if ((quals1
& quals2
) == quals1
)
18763 if (lose1
&& lose2
)
18764 /* We've failed to deduce something in either direction.
18765 These must be unordered. */
18768 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18769 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18770 /* We have already processed all of the arguments in our
18771 handing of the pack expansion type. */
18774 args1
= TREE_CHAIN (args1
);
18775 args2
= TREE_CHAIN (args2
);
18778 /* "In most cases, all template parameters must have values in order for
18779 deduction to succeed, but for partial ordering purposes a template
18780 parameter may remain without a value provided it is not used in the
18781 types being used for partial ordering."
18783 Thus, if we are missing any of the targs1 we need to substitute into
18784 origs1, then pat2 is not as specialized as pat1. This can happen when
18785 there is a nondeduced context. */
18786 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
18788 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
18791 processing_template_decl
--;
18793 /* All things being equal, if the next argument is a pack expansion
18794 for one function but not for the other, prefer the
18795 non-variadic function. FIXME this is bogus; see c++/41958. */
18797 && args1
&& TREE_VALUE (args1
)
18798 && args2
&& TREE_VALUE (args2
))
18800 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
18801 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
18804 if (lose1
== lose2
)
18812 /* Determine which of two partial specializations of TMPL is more
18815 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
18816 to the first partial specialization. The TREE_VALUE is the
18817 innermost set of template parameters for the partial
18818 specialization. PAT2 is similar, but for the second template.
18820 Return 1 if the first partial specialization is more specialized;
18821 -1 if the second is more specialized; 0 if neither is more
18824 See [temp.class.order] for information about determining which of
18825 two templates is more specialized. */
18828 more_specialized_class (tree tmpl
, tree pat1
, tree pat2
)
18833 bool any_deductions
= false;
18835 tmpl1
= TREE_TYPE (pat1
);
18836 tmpl2
= TREE_TYPE (pat2
);
18838 /* Just like what happens for functions, if we are ordering between
18839 different class template specializations, we may encounter dependent
18840 types in the arguments, and we need our dependency check functions
18841 to behave correctly. */
18842 ++processing_template_decl
;
18843 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat1
),
18844 CLASSTYPE_TI_ARGS (tmpl1
),
18845 CLASSTYPE_TI_ARGS (tmpl2
));
18849 any_deductions
= true;
18852 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat2
),
18853 CLASSTYPE_TI_ARGS (tmpl2
),
18854 CLASSTYPE_TI_ARGS (tmpl1
));
18858 any_deductions
= true;
18860 --processing_template_decl
;
18862 /* In the case of a tie where at least one of the class templates
18863 has a parameter pack at the end, the template with the most
18864 non-packed parameters wins. */
18867 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
18868 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
18870 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
18871 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
18872 int len1
= TREE_VEC_LENGTH (args1
);
18873 int len2
= TREE_VEC_LENGTH (args2
);
18875 /* We don't count the pack expansion at the end. */
18876 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
18878 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
18883 else if (len1
< len2
)
18890 /* Return the template arguments that will produce the function signature
18891 DECL from the function template FN, with the explicit template
18892 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
18893 also match. Return NULL_TREE if no satisfactory arguments could be
18897 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
18899 int ntparms
= DECL_NTPARMS (fn
);
18900 tree targs
= make_tree_vec (ntparms
);
18901 tree decl_type
= TREE_TYPE (decl
);
18902 tree decl_arg_types
;
18904 unsigned int nargs
, ix
;
18907 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
18909 /* Never do unification on the 'this' parameter. */
18910 decl_arg_types
= skip_artificial_parms_for (decl
,
18911 TYPE_ARG_TYPES (decl_type
));
18913 nargs
= list_length (decl_arg_types
);
18914 args
= XALLOCAVEC (tree
, nargs
);
18915 for (arg
= decl_arg_types
, ix
= 0;
18916 arg
!= NULL_TREE
&& arg
!= void_list_node
;
18917 arg
= TREE_CHAIN (arg
), ++ix
)
18918 args
[ix
] = TREE_VALUE (arg
);
18920 if (fn_type_unification (fn
, explicit_args
, targs
,
18922 (check_rettype
|| DECL_CONV_FN_P (fn
)
18923 ? TREE_TYPE (decl_type
) : NULL_TREE
),
18924 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
18926 == error_mark_node
)
18932 /* Return the innermost template arguments that, when applied to a partial
18933 specialization of TMPL whose innermost template parameters are
18934 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
18937 For example, suppose we have:
18939 template <class T, class U> struct S {};
18940 template <class T> struct S<T*, int> {};
18942 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
18943 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
18944 int}. The resulting vector will be {double}, indicating that `T'
18945 is bound to `double'. */
18948 get_class_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
18950 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
18952 tree innermost_deduced_args
;
18954 innermost_deduced_args
= make_tree_vec (ntparms
);
18955 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18957 deduced_args
= copy_node (args
);
18958 SET_TMPL_ARGS_LEVEL (deduced_args
,
18959 TMPL_ARGS_DEPTH (deduced_args
),
18960 innermost_deduced_args
);
18963 deduced_args
= innermost_deduced_args
;
18965 if (unify (tparms
, deduced_args
,
18966 INNERMOST_TEMPLATE_ARGS (spec_args
),
18967 INNERMOST_TEMPLATE_ARGS (args
),
18968 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
18971 for (i
= 0; i
< ntparms
; ++i
)
18972 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
18975 /* Verify that nondeduced template arguments agree with the type
18976 obtained from argument deduction.
18980 struct A { typedef int X; };
18981 template <class T, class U> struct C {};
18982 template <class T> struct C<T, typename T::X> {};
18984 Then with the instantiation `C<A, int>', we can deduce that
18985 `T' is `A' but unify () does not check whether `typename T::X'
18987 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
18988 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18990 tf_none
, false, false);
18991 if (spec_args
== error_mark_node
18992 /* We only need to check the innermost arguments; the other
18993 arguments will always agree. */
18994 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
18995 INNERMOST_TEMPLATE_ARGS (args
)))
18998 /* Now that we have bindings for all of the template arguments,
18999 ensure that the arguments deduced for the template template
19000 parameters have compatible template parameter lists. See the use
19001 of template_template_parm_bindings_ok_p in fn_type_unification
19002 for more information. */
19003 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
19006 return deduced_args
;
19009 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
19010 Return the TREE_LIST node with the most specialized template, if
19011 any. If there is no most specialized template, the error_mark_node
19014 Note that this function does not look at, or modify, the
19015 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
19016 returned is one of the elements of INSTANTIATIONS, callers may
19017 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
19018 and retrieve it from the value returned. */
19021 most_specialized_instantiation (tree templates
)
19025 ++processing_template_decl
;
19028 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
19032 if (get_bindings (TREE_VALUE (champ
),
19033 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
19034 NULL_TREE
, /*check_ret=*/true))
19037 if (get_bindings (TREE_VALUE (fn
),
19038 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19039 NULL_TREE
, /*check_ret=*/true))
19046 /* Equally specialized, move to next function. If there
19047 is no next function, nothing's most specialized. */
19048 fn
= TREE_CHAIN (fn
);
19056 /* Now verify that champ is better than everything earlier in the
19057 instantiation list. */
19058 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
19059 if (get_bindings (TREE_VALUE (champ
),
19060 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
19061 NULL_TREE
, /*check_ret=*/true)
19062 || !get_bindings (TREE_VALUE (fn
),
19063 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19064 NULL_TREE
, /*check_ret=*/true))
19070 processing_template_decl
--;
19073 return error_mark_node
;
19078 /* If DECL is a specialization of some template, return the most
19079 general such template. Otherwise, returns NULL_TREE.
19081 For example, given:
19083 template <class T> struct S { template <class U> void f(U); };
19085 if TMPL is `template <class U> void S<int>::f(U)' this will return
19086 the full template. This function will not trace past partial
19087 specializations, however. For example, given in addition:
19089 template <class T> struct S<T*> { template <class U> void f(U); };
19091 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19092 `template <class T> template <class U> S<T*>::f(U)'. */
19095 most_general_template (tree decl
)
19097 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19099 if (tree tinfo
= get_template_info (decl
))
19100 decl
= TI_TEMPLATE (tinfo
);
19101 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19102 template friend, or a FIELD_DECL for a capture pack. */
19103 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19107 /* Look for more and more general templates. */
19108 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
19110 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
19111 (See cp-tree.h for details.) */
19112 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
19115 if (CLASS_TYPE_P (TREE_TYPE (decl
))
19116 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
19119 /* Stop if we run into an explicitly specialized class template. */
19120 if (!DECL_NAMESPACE_SCOPE_P (decl
)
19121 && DECL_CONTEXT (decl
)
19122 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
19125 decl
= DECL_TI_TEMPLATE (decl
);
19131 /* Return the most specialized of the class template partial
19132 specializations which can produce TYPE, a specialization of some class
19133 template. The value returned is actually a TREE_LIST; the TREE_TYPE is
19134 a _TYPE node corresponding to the partial specialization, while the
19135 TREE_PURPOSE is the set of template arguments that must be
19136 substituted into the TREE_TYPE in order to generate TYPE.
19138 If the choice of partial specialization is ambiguous, a diagnostic
19139 is issued, and the error_mark_node is returned. If there are no
19140 partial specializations matching TYPE, then NULL_TREE is
19141 returned, indicating that the primary template should be used. */
19144 most_specialized_class (tree type
, tsubst_flags_t complain
)
19146 tree list
= NULL_TREE
;
19151 tree outer_args
= NULL_TREE
;
19153 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
19154 tree main_tmpl
= most_general_template (tmpl
);
19155 tree args
= CLASSTYPE_TI_ARGS (type
);
19157 /* For determining which partial specialization to use, only the
19158 innermost args are interesting. */
19159 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19161 outer_args
= strip_innermost_template_args (args
, 1);
19162 args
= INNERMOST_TEMPLATE_ARGS (args
);
19165 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
19167 tree partial_spec_args
;
19169 tree spec_tmpl
= TREE_VALUE (t
);
19170 tree orig_parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19172 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
19174 ++processing_template_decl
;
19178 /* Discard the outer levels of args, and then substitute in the
19179 template args from the enclosing class. */
19180 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
19181 partial_spec_args
= tsubst_template_args
19182 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
19184 /* And the same for the partial specialization TEMPLATE_DECL. */
19185 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
19188 partial_spec_args
=
19189 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19192 /*require_all_args=*/true,
19193 /*use_default_args=*/true);
19195 --processing_template_decl
;
19197 if (partial_spec_args
== error_mark_node
)
19198 return error_mark_node
;
19199 if (spec_tmpl
== error_mark_node
)
19200 return error_mark_node
;
19202 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19203 spec_args
= get_class_bindings (tmpl
, parms
,
19209 spec_args
= add_to_template_args (outer_args
, spec_args
);
19210 list
= tree_cons (spec_args
, orig_parms
, list
);
19211 TREE_TYPE (list
) = TREE_TYPE (t
);
19218 ambiguous_p
= false;
19221 t
= TREE_CHAIN (t
);
19222 for (; t
; t
= TREE_CHAIN (t
))
19224 fate
= more_specialized_class (tmpl
, champ
, t
);
19231 t
= TREE_CHAIN (t
);
19234 ambiguous_p
= true;
19243 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
19245 fate
= more_specialized_class (tmpl
, champ
, t
);
19248 ambiguous_p
= true;
19256 char *spaces
= NULL
;
19257 if (!(complain
& tf_error
))
19258 return error_mark_node
;
19259 error ("ambiguous class template instantiation for %q#T", type
);
19260 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
19261 for (t
= list
; t
; t
= TREE_CHAIN (t
))
19263 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
19264 spaces
= spaces
? spaces
: get_spaces (str
);
19267 return error_mark_node
;
19273 /* Explicitly instantiate DECL. */
19276 do_decl_instantiation (tree decl
, tree storage
)
19278 tree result
= NULL_TREE
;
19281 if (!decl
|| decl
== error_mark_node
)
19282 /* An error occurred, for which grokdeclarator has already issued
19283 an appropriate message. */
19285 else if (! DECL_LANG_SPECIFIC (decl
))
19287 error ("explicit instantiation of non-template %q#D", decl
);
19291 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
19292 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
19294 if (VAR_P (decl
) && !var_templ
)
19296 /* There is an asymmetry here in the way VAR_DECLs and
19297 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19298 the latter, the DECL we get back will be marked as a
19299 template instantiation, and the appropriate
19300 DECL_TEMPLATE_INFO will be set up. This does not happen for
19301 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19302 should handle VAR_DECLs as it currently handles
19304 if (!DECL_CLASS_SCOPE_P (decl
))
19306 error ("%qD is not a static data member of a class template", decl
);
19309 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
19310 if (!result
|| !VAR_P (result
))
19312 error ("no matching template for %qD found", decl
);
19315 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
19317 error ("type %qT for explicit instantiation %qD does not match "
19318 "declared type %qT", TREE_TYPE (result
), decl
,
19323 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
19325 error ("explicit instantiation of %q#D", decl
);
19331 /* Check for various error cases. Note that if the explicit
19332 instantiation is valid the RESULT will currently be marked as an
19333 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19334 until we get here. */
19336 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19338 /* DR 259 [temp.spec].
19340 Both an explicit instantiation and a declaration of an explicit
19341 specialization shall not appear in a program unless the explicit
19342 instantiation follows a declaration of the explicit specialization.
19344 For a given set of template parameters, if an explicit
19345 instantiation of a template appears after a declaration of an
19346 explicit specialization for that template, the explicit
19347 instantiation has no effect. */
19350 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19354 No program shall explicitly instantiate any template more
19357 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19358 the first instantiation was `extern' and the second is not,
19359 and EXTERN_P for the opposite case. */
19360 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19361 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19362 /* If an "extern" explicit instantiation follows an ordinary
19363 explicit instantiation, the template is instantiated. */
19367 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19369 error ("no matching template for %qD found", result
);
19372 else if (!DECL_TEMPLATE_INFO (result
))
19374 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19378 if (storage
== NULL_TREE
)
19380 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19382 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19383 pedwarn (input_location
, OPT_Wpedantic
,
19384 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19389 error ("storage class %qD applied to template instantiation", storage
);
19391 check_explicit_instantiation_namespace (result
);
19392 mark_decl_instantiated (result
, extern_p
);
19394 instantiate_decl (result
, /*defer_ok=*/1,
19395 /*expl_inst_class_mem_p=*/false);
19399 mark_class_instantiated (tree t
, int extern_p
)
19401 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19402 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19403 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19404 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19407 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19408 rest_of_type_compilation (t
, 1);
19412 /* Called from do_type_instantiation through binding_table_foreach to
19413 do recursive instantiation for the type bound in ENTRY. */
19415 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19417 tree storage
= *(tree
*) data
;
19419 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19420 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19421 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19424 /* Called from do_type_instantiation to instantiate a member
19425 (a member function or a static member variable) of an
19426 explicitly instantiated class template. */
19428 instantiate_class_member (tree decl
, int extern_p
)
19430 mark_decl_instantiated (decl
, extern_p
);
19432 instantiate_decl (decl
, /*defer_ok=*/1,
19433 /*expl_inst_class_mem_p=*/true);
19436 /* Perform an explicit instantiation of template class T. STORAGE, if
19437 non-null, is the RID for extern, inline or static. COMPLAIN is
19438 nonzero if this is called from the parser, zero if called recursively,
19439 since the standard is unclear (as detailed below). */
19442 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19447 int previous_instantiation_extern_p
= 0;
19449 if (TREE_CODE (t
) == TYPE_DECL
)
19452 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19455 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19457 error ("explicit instantiation of non-class template %qD", tmpl
);
19459 error ("explicit instantiation of non-template type %qT", t
);
19465 if (!COMPLETE_TYPE_P (t
))
19467 if (complain
& tf_error
)
19468 error ("explicit instantiation of %q#T before definition of template",
19473 if (storage
!= NULL_TREE
)
19475 if (!in_system_header_at (input_location
))
19477 if (storage
== ridpointers
[(int) RID_EXTERN
])
19479 if (cxx_dialect
== cxx98
)
19480 pedwarn (input_location
, OPT_Wpedantic
,
19481 "ISO C++ 1998 forbids the use of %<extern%> on "
19482 "explicit instantiations");
19485 pedwarn (input_location
, OPT_Wpedantic
,
19486 "ISO C++ forbids the use of %qE"
19487 " on explicit instantiations", storage
);
19490 if (storage
== ridpointers
[(int) RID_INLINE
])
19492 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19494 else if (storage
== ridpointers
[(int) RID_STATIC
])
19498 error ("storage class %qD applied to template instantiation",
19504 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19506 /* DR 259 [temp.spec].
19508 Both an explicit instantiation and a declaration of an explicit
19509 specialization shall not appear in a program unless the explicit
19510 instantiation follows a declaration of the explicit specialization.
19512 For a given set of template parameters, if an explicit
19513 instantiation of a template appears after a declaration of an
19514 explicit specialization for that template, the explicit
19515 instantiation has no effect. */
19518 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19522 No program shall explicitly instantiate any template more
19525 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19526 instantiation was `extern'. If EXTERN_P then the second is.
19527 These cases are OK. */
19528 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19530 if (!previous_instantiation_extern_p
&& !extern_p
19531 && (complain
& tf_error
))
19532 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19534 /* If we've already instantiated the template, just return now. */
19535 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19539 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19540 mark_class_instantiated (t
, extern_p
);
19548 /* In contrast to implicit instantiation, where only the
19549 declarations, and not the definitions, of members are
19550 instantiated, we have here:
19554 The explicit instantiation of a class template specialization
19555 implies the instantiation of all of its members not
19556 previously explicitly specialized in the translation unit
19557 containing the explicit instantiation.
19559 Of course, we can't instantiate member template classes, since
19560 we don't have any arguments for them. Note that the standard
19561 is unclear on whether the instantiation of the members are
19562 *explicit* instantiations or not. However, the most natural
19563 interpretation is that it should be an explicit instantiation. */
19566 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19567 if (TREE_CODE (tmp
) == FUNCTION_DECL
19568 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19569 instantiate_class_member (tmp
, extern_p
);
19571 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19572 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19573 instantiate_class_member (tmp
, extern_p
);
19575 if (CLASSTYPE_NESTED_UTDS (t
))
19576 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19577 bt_instantiate_type_proc
, &storage
);
19581 /* Given a function DECL, which is a specialization of TMPL, modify
19582 DECL to be a re-instantiation of TMPL with the same template
19583 arguments. TMPL should be the template into which tsubst'ing
19584 should occur for DECL, not the most general template.
19586 One reason for doing this is a scenario like this:
19589 void f(const T&, int i);
19591 void g() { f(3, 7); }
19594 void f(const T& t, const int i) { }
19596 Note that when the template is first instantiated, with
19597 instantiate_template, the resulting DECL will have no name for the
19598 first parameter, and the wrong type for the second. So, when we go
19599 to instantiate the DECL, we regenerate it. */
19602 regenerate_decl_from_template (tree decl
, tree tmpl
)
19604 /* The arguments used to instantiate DECL, from the most general
19609 args
= DECL_TI_ARGS (decl
);
19610 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19612 /* Make sure that we can see identifiers, and compute access
19614 push_access_scope (decl
);
19616 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19624 args_depth
= TMPL_ARGS_DEPTH (args
);
19625 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19626 if (args_depth
> parms_depth
)
19627 args
= get_innermost_template_args (args
, parms_depth
);
19629 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19630 args
, tf_error
, NULL_TREE
,
19631 /*defer_ok*/false);
19632 if (specs
&& specs
!= error_mark_node
)
19633 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19636 /* Merge parameter declarations. */
19637 decl_parm
= skip_artificial_parms_for (decl
,
19638 DECL_ARGUMENTS (decl
));
19640 = skip_artificial_parms_for (code_pattern
,
19641 DECL_ARGUMENTS (code_pattern
));
19642 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
19647 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19648 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
19649 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
19651 parm_type
= type_decays_to (parm_type
);
19652 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19653 TREE_TYPE (decl_parm
) = parm_type
;
19654 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19655 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19657 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19658 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19660 decl_parm
= DECL_CHAIN (decl_parm
);
19661 pattern_parm
= DECL_CHAIN (pattern_parm
);
19663 /* Merge any parameters that match with the function parameter
19665 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
19668 tree expanded_types
;
19669 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19670 the parameters in this function parameter pack. */
19671 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
19672 args
, tf_error
, NULL_TREE
);
19673 len
= TREE_VEC_LENGTH (expanded_types
);
19674 for (i
= 0; i
< len
; i
++)
19679 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19680 /* Rename the parameter to include the index. */
19681 DECL_NAME (decl_parm
) =
19682 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
19683 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
19684 parm_type
= type_decays_to (parm_type
);
19685 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19686 TREE_TYPE (decl_parm
) = parm_type
;
19687 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19688 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19690 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19691 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19693 decl_parm
= DECL_CHAIN (decl_parm
);
19696 /* Merge additional specifiers from the CODE_PATTERN. */
19697 if (DECL_DECLARED_INLINE_P (code_pattern
)
19698 && !DECL_DECLARED_INLINE_P (decl
))
19699 DECL_DECLARED_INLINE_P (decl
) = 1;
19701 else if (VAR_P (decl
))
19703 DECL_INITIAL (decl
) =
19704 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
19705 tf_error
, DECL_TI_TEMPLATE (decl
),
19706 /*integral_constant_expression_p=*/false);
19707 if (VAR_HAD_UNKNOWN_BOUND (decl
))
19708 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
19709 tf_error
, DECL_TI_TEMPLATE (decl
));
19712 gcc_unreachable ();
19714 pop_access_scope (decl
);
19717 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19718 substituted to get DECL. */
19721 template_for_substitution (tree decl
)
19723 tree tmpl
= DECL_TI_TEMPLATE (decl
);
19725 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19726 for the instantiation. This is not always the most general
19727 template. Consider, for example:
19730 struct S { template <class U> void f();
19731 template <> void f<int>(); };
19733 and an instantiation of S<double>::f<int>. We want TD to be the
19734 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19735 while (/* An instantiation cannot have a definition, so we need a
19736 more general template. */
19737 DECL_TEMPLATE_INSTANTIATION (tmpl
)
19738 /* We must also deal with friend templates. Given:
19740 template <class T> struct S {
19741 template <class U> friend void f() {};
19744 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19745 so far as the language is concerned, but that's still
19746 where we get the pattern for the instantiation from. On
19747 other hand, if the definition comes outside the class, say:
19749 template <class T> struct S {
19750 template <class U> friend void f();
19752 template <class U> friend void f() {}
19754 we don't need to look any further. That's what the check for
19755 DECL_INITIAL is for. */
19756 || (TREE_CODE (decl
) == FUNCTION_DECL
19757 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
19758 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
19760 /* The present template, TD, should not be a definition. If it
19761 were a definition, we should be using it! Note that we
19762 cannot restructure the loop to just keep going until we find
19763 a template with a definition, since that might go too far if
19764 a specialization was declared, but not defined. */
19766 /* Fetch the more general template. */
19767 tmpl
= DECL_TI_TEMPLATE (tmpl
);
19773 /* Returns true if we need to instantiate this template instance even if we
19774 know we aren't going to emit it.. */
19777 always_instantiate_p (tree decl
)
19779 /* We always instantiate inline functions so that we can inline them. An
19780 explicit instantiation declaration prohibits implicit instantiation of
19781 non-inline functions. With high levels of optimization, we would
19782 normally inline non-inline functions -- but we're not allowed to do
19783 that for "extern template" functions. Therefore, we check
19784 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19785 return ((TREE_CODE (decl
) == FUNCTION_DECL
19786 && (DECL_DECLARED_INLINE_P (decl
)
19787 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
19788 /* And we need to instantiate static data members so that
19789 their initializers are available in integral constant
19792 && decl_maybe_constant_var_p (decl
)));
19795 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19796 instantiate it now, modifying TREE_TYPE (fn). */
19799 maybe_instantiate_noexcept (tree fn
)
19801 tree fntype
, spec
, noex
, clone
;
19803 /* Don't instantiate a noexcept-specification from template context. */
19804 if (processing_template_decl
)
19807 if (DECL_CLONED_FUNCTION_P (fn
))
19808 fn
= DECL_CLONED_FUNCTION (fn
);
19809 fntype
= TREE_TYPE (fn
);
19810 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
19812 if (!spec
|| !TREE_PURPOSE (spec
))
19815 noex
= TREE_PURPOSE (spec
);
19817 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
19819 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
19820 spec
= get_defaulted_eh_spec (fn
);
19821 else if (push_tinst_level (fn
))
19823 push_access_scope (fn
);
19824 push_deferring_access_checks (dk_no_deferred
);
19825 input_location
= DECL_SOURCE_LOCATION (fn
);
19826 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
19827 DEFERRED_NOEXCEPT_ARGS (noex
),
19828 tf_warning_or_error
, fn
,
19829 /*function_p=*/false,
19830 /*integral_constant_expression_p=*/true);
19831 pop_deferring_access_checks ();
19832 pop_access_scope (fn
);
19833 pop_tinst_level ();
19834 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
19835 if (spec
== error_mark_node
)
19836 spec
= noexcept_false_spec
;
19839 spec
= noexcept_false_spec
;
19841 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
19844 FOR_EACH_CLONE (clone
, fn
)
19846 if (TREE_TYPE (clone
) == fntype
)
19847 TREE_TYPE (clone
) = TREE_TYPE (fn
);
19849 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
19853 /* Produce the definition of D, a _DECL generated from a template. If
19854 DEFER_OK is nonzero, then we don't have to actually do the
19855 instantiation now; we just have to do it sometime. Normally it is
19856 an error if this is an explicit instantiation but D is undefined.
19857 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
19858 explicitly instantiated class template. */
19861 instantiate_decl (tree d
, int defer_ok
,
19862 bool expl_inst_class_mem_p
)
19864 tree tmpl
= DECL_TI_TEMPLATE (d
);
19871 bool pattern_defined
;
19872 location_t saved_loc
= input_location
;
19873 int saved_unevaluated_operand
= cp_unevaluated_operand
;
19874 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
19880 /* This function should only be used to instantiate templates for
19881 functions and static member variables. */
19882 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
19884 /* Variables are never deferred; if instantiation is required, they
19885 are instantiated right away. That allows for better code in the
19886 case that an expression refers to the value of the variable --
19887 if the variable has a constant value the referring expression can
19888 take advantage of that fact. */
19890 || DECL_DECLARED_CONSTEXPR_P (d
))
19893 /* Don't instantiate cloned functions. Instead, instantiate the
19894 functions they cloned. */
19895 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
19896 d
= DECL_CLONED_FUNCTION (d
);
19898 if (DECL_TEMPLATE_INSTANTIATED (d
)
19899 || (TREE_CODE (d
) == FUNCTION_DECL
19900 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
19901 || DECL_TEMPLATE_SPECIALIZATION (d
))
19902 /* D has already been instantiated or explicitly specialized, so
19903 there's nothing for us to do here.
19905 It might seem reasonable to check whether or not D is an explicit
19906 instantiation, and, if so, stop here. But when an explicit
19907 instantiation is deferred until the end of the compilation,
19908 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
19909 the instantiation. */
19912 /* Check to see whether we know that this template will be
19913 instantiated in some other file, as with "extern template"
19915 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
19917 /* In general, we do not instantiate such templates. */
19918 if (external_p
&& !always_instantiate_p (d
))
19921 gen_tmpl
= most_general_template (tmpl
);
19922 gen_args
= DECL_TI_ARGS (d
);
19924 if (tmpl
!= gen_tmpl
)
19925 /* We should already have the extra args. */
19926 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
19927 == TMPL_ARGS_DEPTH (gen_args
));
19928 /* And what's in the hash table should match D. */
19929 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
19930 || spec
== NULL_TREE
);
19932 /* This needs to happen before any tsubsting. */
19933 if (! push_tinst_level (d
))
19936 timevar_push (TV_TEMPLATE_INST
);
19938 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
19939 for the instantiation. */
19940 td
= template_for_substitution (d
);
19941 code_pattern
= DECL_TEMPLATE_RESULT (td
);
19943 /* We should never be trying to instantiate a member of a class
19944 template or partial specialization. */
19945 gcc_assert (d
!= code_pattern
);
19947 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
19948 || DECL_TEMPLATE_SPECIALIZATION (td
))
19949 /* In the case of a friend template whose definition is provided
19950 outside the class, we may have too many arguments. Drop the
19951 ones we don't need. The same is true for specializations. */
19952 args
= get_innermost_template_args
19953 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
19957 if (TREE_CODE (d
) == FUNCTION_DECL
)
19959 deleted_p
= DECL_DELETED_FN (code_pattern
);
19960 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
19961 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
19967 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
19970 /* We may be in the middle of deferred access check. Disable it now. */
19971 push_deferring_access_checks (dk_no_deferred
);
19973 /* Unless an explicit instantiation directive has already determined
19974 the linkage of D, remember that a definition is available for
19976 if (pattern_defined
19977 && !DECL_INTERFACE_KNOWN (d
)
19978 && !DECL_NOT_REALLY_EXTERN (d
))
19979 mark_definable (d
);
19981 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
19982 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
19983 input_location
= DECL_SOURCE_LOCATION (d
);
19985 /* If D is a member of an explicitly instantiated class template,
19986 and no definition is available, treat it like an implicit
19988 if (!pattern_defined
&& expl_inst_class_mem_p
19989 && DECL_EXPLICIT_INSTANTIATION (d
))
19991 /* Leave linkage flags alone on instantiations with anonymous
19993 if (TREE_PUBLIC (d
))
19995 DECL_NOT_REALLY_EXTERN (d
) = 0;
19996 DECL_INTERFACE_KNOWN (d
) = 0;
19998 SET_DECL_IMPLICIT_INSTANTIATION (d
);
20001 /* Defer all other templates, unless we have been explicitly
20002 forbidden from doing so. */
20003 if (/* If there is no definition, we cannot instantiate the
20006 /* If it's OK to postpone instantiation, do so. */
20008 /* If this is a static data member that will be defined
20009 elsewhere, we don't want to instantiate the entire data
20010 member, but we do want to instantiate the initializer so that
20011 we can substitute that elsewhere. */
20012 || (external_p
&& VAR_P (d
))
20013 /* Handle here a deleted function too, avoid generating
20014 its body (c++/61080). */
20017 /* The definition of the static data member is now required so
20018 we must substitute the initializer. */
20020 && !DECL_INITIAL (d
)
20021 && DECL_INITIAL (code_pattern
))
20025 bool const_init
= false;
20026 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20028 ns
= decl_namespace_context (d
);
20029 push_nested_namespace (ns
);
20031 push_nested_class (DECL_CONTEXT (d
));
20032 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
20034 tf_warning_or_error
, NULL_TREE
,
20035 /*integral_constant_expression_p=*/false);
20036 /* If instantiating the initializer involved instantiating this
20037 again, don't call cp_finish_decl twice. */
20038 if (!DECL_INITIAL (d
))
20040 /* Make sure the initializer is still constant, in case of
20041 circular dependency (template/instantiate6.C). */
20043 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20044 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
20045 /*asmspec_tree=*/NULL_TREE
,
20046 LOOKUP_ONLYCONVERTING
);
20049 pop_nested_class ();
20050 pop_nested_namespace (ns
);
20053 /* We restore the source position here because it's used by
20054 add_pending_template. */
20055 input_location
= saved_loc
;
20057 if (at_eof
&& !pattern_defined
20058 && DECL_EXPLICIT_INSTANTIATION (d
)
20059 && DECL_NOT_REALLY_EXTERN (d
))
20062 The definition of a non-exported function template, a
20063 non-exported member function template, or a non-exported
20064 member function or static data member of a class template
20065 shall be present in every translation unit in which it is
20066 explicitly instantiated. */
20067 permerror (input_location
, "explicit instantiation of %qD "
20068 "but no definition available", d
);
20070 /* If we're in unevaluated context, we just wanted to get the
20071 constant value; this isn't an odr use, so don't queue
20072 a full instantiation. */
20073 if (cp_unevaluated_operand
!= 0)
20075 /* ??? Historically, we have instantiated inline functions, even
20076 when marked as "extern template". */
20077 if (!(external_p
&& VAR_P (d
)))
20078 add_pending_template (d
);
20081 /* Tell the repository that D is available in this translation unit
20082 -- and see if it is supposed to be instantiated here. */
20083 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
20085 /* In a PCH file, despite the fact that the repository hasn't
20086 requested instantiation in the PCH it is still possible that
20087 an instantiation will be required in a file that includes the
20090 add_pending_template (d
);
20091 /* Instantiate inline functions so that the inliner can do its
20092 job, even though we'll not be emitting a copy of this
20094 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
20098 fn_context
= decl_function_context (d
);
20099 nested
= (current_function_decl
!= NULL_TREE
);
20101 push_to_top_level ();
20105 push_function_context ();
20106 cp_unevaluated_operand
= 0;
20107 c_inhibit_evaluation_warnings
= 0;
20110 /* Mark D as instantiated so that recursive calls to
20111 instantiate_decl do not try to instantiate it again. */
20112 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
20114 /* Regenerate the declaration in case the template has been modified
20115 by a subsequent redeclaration. */
20116 regenerate_decl_from_template (d
, td
);
20118 /* We already set the file and line above. Reset them now in case
20119 they changed as a result of calling regenerate_decl_from_template. */
20120 input_location
= DECL_SOURCE_LOCATION (d
);
20125 bool const_init
= false;
20127 /* Clear out DECL_RTL; whatever was there before may not be right
20128 since we've reset the type of the declaration. */
20129 SET_DECL_RTL (d
, NULL
);
20130 DECL_IN_AGGR_P (d
) = 0;
20132 /* The initializer is placed in DECL_INITIAL by
20133 regenerate_decl_from_template so we don't need to
20134 push/pop_access_scope again here. Pull it out so that
20135 cp_finish_decl can process it. */
20136 init
= DECL_INITIAL (d
);
20137 DECL_INITIAL (d
) = NULL_TREE
;
20138 DECL_INITIALIZED_P (d
) = 0;
20140 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
20141 initializer. That function will defer actual emission until
20142 we have a chance to determine linkage. */
20143 DECL_EXTERNAL (d
) = 0;
20145 /* Enter the scope of D so that access-checking works correctly. */
20146 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20148 push_nested_class (DECL_CONTEXT (d
));
20150 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20151 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
20154 pop_nested_class ();
20156 if (variable_template_p (td
))
20157 note_variable_template_instantiation (d
);
20159 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
20160 synthesize_method (d
);
20161 else if (TREE_CODE (d
) == FUNCTION_DECL
)
20163 hash_map
<tree
, tree
> *saved_local_specializations
;
20167 tree block
= NULL_TREE
;
20169 /* Save away the current list, in case we are instantiating one
20170 template from within the body of another. */
20171 saved_local_specializations
= local_specializations
;
20173 /* Set up the list of local specializations. */
20174 local_specializations
= new hash_map
<tree
, tree
>;
20176 /* Set up context. */
20177 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20178 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20179 block
= push_stmt_list ();
20181 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
20183 /* Some typedefs referenced from within the template code need to be
20184 access checked at template instantiation time, i.e now. These
20185 types were added to the template at parsing time. Let's get those
20186 and perform the access checks then. */
20187 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
20190 /* Create substitution entries for the parameters. */
20191 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
20192 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
20193 spec_parm
= DECL_ARGUMENTS (d
);
20194 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
20196 register_local_specialization (spec_parm
, tmpl_parm
);
20197 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
20198 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
20200 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
20202 if (!DECL_PACK_P (tmpl_parm
))
20204 register_local_specialization (spec_parm
, tmpl_parm
);
20205 spec_parm
= DECL_CHAIN (spec_parm
);
20209 /* Register the (value) argument pack as a specialization of
20210 TMPL_PARM, then move on. */
20211 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
20212 register_local_specialization (argpack
, tmpl_parm
);
20215 gcc_assert (!spec_parm
);
20217 /* Substitute into the body of the function. */
20218 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20219 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
20220 tf_warning_or_error
, tmpl
);
20223 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
20224 tf_warning_or_error
, tmpl
,
20225 /*integral_constant_expression_p=*/false);
20227 /* Set the current input_location to the end of the function
20228 so that finish_function knows where we are. */
20230 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
20232 /* Remember if we saw an infinite loop in the template. */
20233 current_function_infinite_loop
20234 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
20237 /* We don't need the local specializations any more. */
20238 delete local_specializations
;
20239 local_specializations
= saved_local_specializations
;
20241 /* Finish the function. */
20242 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20243 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20244 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
20247 d
= finish_function (0);
20248 expand_or_defer_fn (d
);
20251 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20252 cp_check_omp_declare_reduction (d
);
20255 /* We're not deferring instantiation any more. */
20256 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
20259 pop_from_top_level ();
20261 pop_function_context ();
20264 input_location
= saved_loc
;
20265 cp_unevaluated_operand
= saved_unevaluated_operand
;
20266 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20267 pop_deferring_access_checks ();
20268 pop_tinst_level ();
20270 timevar_pop (TV_TEMPLATE_INST
);
20275 /* Run through the list of templates that we wish we could
20276 instantiate, and instantiate any we can. RETRIES is the
20277 number of times we retry pending template instantiation. */
20280 instantiate_pending_templates (int retries
)
20283 location_t saved_loc
= input_location
;
20285 /* Instantiating templates may trigger vtable generation. This in turn
20286 may require further template instantiations. We place a limit here
20287 to avoid infinite loop. */
20288 if (pending_templates
&& retries
>= max_tinst_depth
)
20290 tree decl
= pending_templates
->tinst
->decl
;
20292 error ("template instantiation depth exceeds maximum of %d"
20293 " instantiating %q+D, possibly from virtual table generation"
20294 " (use -ftemplate-depth= to increase the maximum)",
20295 max_tinst_depth
, decl
);
20296 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20297 /* Pretend that we defined it. */
20298 DECL_INITIAL (decl
) = error_mark_node
;
20304 struct pending_template
**t
= &pending_templates
;
20305 struct pending_template
*last
= NULL
;
20309 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
20310 bool complete
= false;
20312 if (TYPE_P (instantiation
))
20316 if (!COMPLETE_TYPE_P (instantiation
))
20318 instantiate_class_template (instantiation
);
20319 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
20320 for (fn
= TYPE_METHODS (instantiation
);
20322 fn
= TREE_CHAIN (fn
))
20323 if (! DECL_ARTIFICIAL (fn
))
20324 instantiate_decl (fn
,
20326 /*expl_inst_class_mem_p=*/false);
20327 if (COMPLETE_TYPE_P (instantiation
))
20331 complete
= COMPLETE_TYPE_P (instantiation
);
20335 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20336 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
20339 = instantiate_decl (instantiation
,
20341 /*expl_inst_class_mem_p=*/false);
20342 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20346 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20347 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20351 /* If INSTANTIATION has been instantiated, then we don't
20352 need to consider it again in the future. */
20360 current_tinst_level
= NULL
;
20362 last_pending_template
= last
;
20364 while (reconsider
);
20366 input_location
= saved_loc
;
20369 /* Substitute ARGVEC into T, which is a list of initializers for
20370 either base class or a non-static data member. The TREE_PURPOSEs
20371 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20372 instantiate_decl. */
20375 tsubst_initializer_list (tree t
, tree argvec
)
20377 tree inits
= NULL_TREE
;
20379 for (; t
; t
= TREE_CHAIN (t
))
20383 tree expanded_bases
= NULL_TREE
;
20384 tree expanded_arguments
= NULL_TREE
;
20387 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20392 /* Expand the base class expansion type into separate base
20394 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20395 tf_warning_or_error
,
20397 if (expanded_bases
== error_mark_node
)
20400 /* We'll be building separate TREE_LISTs of arguments for
20402 len
= TREE_VEC_LENGTH (expanded_bases
);
20403 expanded_arguments
= make_tree_vec (len
);
20404 for (i
= 0; i
< len
; i
++)
20405 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20407 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20408 expand each argument in the TREE_VALUE of t. */
20409 expr
= make_node (EXPR_PACK_EXPANSION
);
20410 PACK_EXPANSION_LOCAL_P (expr
) = true;
20411 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20412 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20414 if (TREE_VALUE (t
) == void_type_node
)
20415 /* VOID_TYPE_NODE is used to indicate
20416 value-initialization. */
20418 for (i
= 0; i
< len
; i
++)
20419 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20423 /* Substitute parameter packs into each argument in the
20425 in_base_initializer
= 1;
20426 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20428 tree expanded_exprs
;
20430 /* Expand the argument. */
20431 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20433 = tsubst_pack_expansion (expr
, argvec
,
20434 tf_warning_or_error
,
20436 if (expanded_exprs
== error_mark_node
)
20439 /* Prepend each of the expanded expressions to the
20440 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20441 for (i
= 0; i
< len
; i
++)
20443 TREE_VEC_ELT (expanded_arguments
, i
) =
20444 tree_cons (NULL_TREE
,
20445 TREE_VEC_ELT (expanded_exprs
, i
),
20446 TREE_VEC_ELT (expanded_arguments
, i
));
20449 in_base_initializer
= 0;
20451 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20452 since we built them backwards. */
20453 for (i
= 0; i
< len
; i
++)
20455 TREE_VEC_ELT (expanded_arguments
, i
) =
20456 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20461 for (i
= 0; i
< len
; ++i
)
20463 if (expanded_bases
)
20465 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20466 decl
= expand_member_init (decl
);
20467 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20472 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20473 tf_warning_or_error
, NULL_TREE
);
20475 decl
= expand_member_init (decl
);
20476 if (decl
&& !DECL_P (decl
))
20477 in_base_initializer
= 1;
20479 init
= TREE_VALUE (t
);
20481 if (init
!= void_type_node
)
20482 init
= tsubst_expr (init
, argvec
,
20483 tf_warning_or_error
, NULL_TREE
,
20484 /*integral_constant_expression_p=*/false);
20485 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20486 /* If we had an initializer but it instantiated to nothing,
20487 value-initialize the object. This will only occur when
20488 the initializer was a pack expansion where the parameter
20489 packs used in that expansion were of length zero. */
20490 init
= void_type_node
;
20491 in_base_initializer
= 0;
20496 init
= build_tree_list (decl
, init
);
20497 TREE_CHAIN (init
) = inits
;
20505 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20508 set_current_access_from_decl (tree decl
)
20510 if (TREE_PRIVATE (decl
))
20511 current_access_specifier
= access_private_node
;
20512 else if (TREE_PROTECTED (decl
))
20513 current_access_specifier
= access_protected_node
;
20515 current_access_specifier
= access_public_node
;
20518 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20519 is the instantiation (which should have been created with
20520 start_enum) and ARGS are the template arguments to use. */
20523 tsubst_enum (tree tag
, tree newtag
, tree args
)
20527 if (SCOPED_ENUM_P (newtag
))
20528 begin_scope (sk_scoped_enum
, newtag
);
20530 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20535 decl
= TREE_VALUE (e
);
20536 /* Note that in a template enum, the TREE_VALUE is the
20537 CONST_DECL, not the corresponding INTEGER_CST. */
20538 value
= tsubst_expr (DECL_INITIAL (decl
),
20539 args
, tf_warning_or_error
, NULL_TREE
,
20540 /*integral_constant_expression_p=*/true);
20542 /* Give this enumeration constant the correct access. */
20543 set_current_access_from_decl (decl
);
20545 /* Actually build the enumerator itself. */
20547 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
20550 if (SCOPED_ENUM_P (newtag
))
20553 finish_enum_value_list (newtag
);
20554 finish_enum (newtag
);
20556 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20557 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20560 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20561 its type -- but without substituting the innermost set of template
20562 arguments. So, innermost set of template parameters will appear in
20566 get_mostly_instantiated_function_type (tree decl
)
20574 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
20575 targs
= DECL_TI_ARGS (decl
);
20576 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
20577 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
20579 /* There should be as many levels of arguments as there are levels
20581 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
20583 fn_type
= TREE_TYPE (tmpl
);
20585 if (parm_depth
== 1)
20586 /* No substitution is necessary. */
20593 /* Replace the innermost level of the TARGS with NULL_TREEs to
20594 let tsubst know not to substitute for those parameters. */
20595 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20596 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
20597 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
20598 TMPL_ARGS_LEVEL (targs
, i
));
20599 SET_TMPL_ARGS_LEVEL (partial_args
,
20600 TMPL_ARGS_DEPTH (targs
),
20601 make_tree_vec (DECL_NTPARMS (tmpl
)));
20603 /* Make sure that we can see identifiers, and compute access
20605 push_access_scope (decl
);
20607 ++processing_template_decl
;
20608 /* Now, do the (partial) substitution to figure out the
20609 appropriate function type. */
20610 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
20611 --processing_template_decl
;
20613 /* Substitute into the template parameters to obtain the real
20614 innermost set of parameters. This step is important if the
20615 innermost set of template parameters contains value
20616 parameters whose types depend on outer template parameters. */
20617 TREE_VEC_LENGTH (partial_args
)--;
20618 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
20620 pop_access_scope (decl
);
20626 /* Return truthvalue if we're processing a template different from
20627 the last one involved in diagnostics. */
20629 problematic_instantiation_changed (void)
20631 return current_tinst_level
!= last_error_tinst_level
;
20634 /* Remember current template involved in diagnostics. */
20636 record_last_problematic_instantiation (void)
20638 last_error_tinst_level
= current_tinst_level
;
20641 struct tinst_level
*
20642 current_instantiation (void)
20644 return current_tinst_level
;
20647 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20648 type. Return zero for ok, nonzero for disallowed. Issue error and
20649 warning messages under control of COMPLAIN. */
20652 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20654 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20656 else if (POINTER_TYPE_P (type
))
20658 else if (TYPE_PTRMEM_P (type
))
20660 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20662 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20664 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20666 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20669 if (complain
& tf_error
)
20671 if (type
== error_mark_node
)
20672 inform (input_location
, "invalid template non-type parameter");
20674 error ("%q#T is not a valid type for a template non-type parameter",
20680 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20681 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20684 dependent_type_p_r (tree type
)
20690 A type is dependent if it is:
20692 -- a template parameter. Template template parameters are types
20693 for us (since TYPE_P holds true for them) so we handle
20695 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20696 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
20698 /* -- a qualified-id with a nested-name-specifier which contains a
20699 class-name that names a dependent type or whose unqualified-id
20700 names a dependent type. */
20701 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20703 /* -- a cv-qualified type where the cv-unqualified type is
20705 type
= TYPE_MAIN_VARIANT (type
);
20706 /* -- a compound type constructed from any dependent type. */
20707 if (TYPE_PTRMEM_P (type
))
20708 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
20709 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
20711 else if (TYPE_PTR_P (type
)
20712 || TREE_CODE (type
) == REFERENCE_TYPE
)
20713 return dependent_type_p (TREE_TYPE (type
));
20714 else if (TREE_CODE (type
) == FUNCTION_TYPE
20715 || TREE_CODE (type
) == METHOD_TYPE
)
20719 if (dependent_type_p (TREE_TYPE (type
)))
20721 for (arg_type
= TYPE_ARG_TYPES (type
);
20723 arg_type
= TREE_CHAIN (arg_type
))
20724 if (dependent_type_p (TREE_VALUE (arg_type
)))
20728 /* -- an array type constructed from any dependent type or whose
20729 size is specified by a constant expression that is
20732 We checked for type- and value-dependence of the bounds in
20733 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20734 if (TREE_CODE (type
) == ARRAY_TYPE
)
20736 if (TYPE_DOMAIN (type
)
20737 && dependent_type_p (TYPE_DOMAIN (type
)))
20739 return dependent_type_p (TREE_TYPE (type
));
20742 /* -- a template-id in which either the template name is a template
20744 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20746 /* ... or any of the template arguments is a dependent type or
20747 an expression that is type-dependent or value-dependent. */
20748 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
20749 && (any_dependent_template_arguments_p
20750 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
20753 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20754 dependent; if the argument of the `typeof' expression is not
20755 type-dependent, then it should already been have resolved. */
20756 if (TREE_CODE (type
) == TYPEOF_TYPE
20757 || TREE_CODE (type
) == DECLTYPE_TYPE
20758 || TREE_CODE (type
) == UNDERLYING_TYPE
)
20761 /* A template argument pack is dependent if any of its packed
20763 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
20765 tree args
= ARGUMENT_PACK_ARGS (type
);
20766 int i
, len
= TREE_VEC_LENGTH (args
);
20767 for (i
= 0; i
< len
; ++i
)
20768 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20772 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20773 be template parameters. */
20774 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
20777 /* The standard does not specifically mention types that are local
20778 to template functions or local classes, but they should be
20779 considered dependent too. For example:
20781 template <int I> void f() {
20786 The size of `E' cannot be known until the value of `I' has been
20787 determined. Therefore, `E' must be considered dependent. */
20788 scope
= TYPE_CONTEXT (type
);
20789 if (scope
&& TYPE_P (scope
))
20790 return dependent_type_p (scope
);
20791 /* Don't use type_dependent_expression_p here, as it can lead
20792 to infinite recursion trying to determine whether a lambda
20793 nested in a lambda is dependent (c++/47687). */
20794 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
20795 && DECL_LANG_SPECIFIC (scope
)
20796 && DECL_TEMPLATE_INFO (scope
)
20797 && (any_dependent_template_arguments_p
20798 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
20801 /* Other types are non-dependent. */
20805 /* Returns TRUE if TYPE is dependent, in the sense of
20806 [temp.dep.type]. Note that a NULL type is considered dependent. */
20809 dependent_type_p (tree type
)
20811 /* If there are no template parameters in scope, then there can't be
20812 any dependent types. */
20813 if (!processing_template_decl
)
20815 /* If we are not processing a template, then nobody should be
20816 providing us with a dependent type. */
20818 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
20822 /* If the type is NULL, we have not computed a type for the entity
20823 in question; in that case, the type is dependent. */
20827 /* Erroneous types can be considered non-dependent. */
20828 if (type
== error_mark_node
)
20831 /* If we have not already computed the appropriate value for TYPE,
20833 if (!TYPE_DEPENDENT_P_VALID (type
))
20835 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
20836 TYPE_DEPENDENT_P_VALID (type
) = 1;
20839 return TYPE_DEPENDENT_P (type
);
20842 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
20843 lookup. In other words, a dependent type that is not the current
20847 dependent_scope_p (tree scope
)
20849 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
20850 && !currently_open_class (scope
));
20853 /* T is a SCOPE_REF; return whether we need to consider it
20854 instantiation-dependent so that we can check access at instantiation
20855 time even though we know which member it resolves to. */
20858 instantiation_dependent_scope_ref_p (tree t
)
20860 if (DECL_P (TREE_OPERAND (t
, 1))
20861 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
20862 && accessible_in_template_p (TREE_OPERAND (t
, 0),
20863 TREE_OPERAND (t
, 1)))
20869 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
20870 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
20873 /* Note that this predicate is not appropriate for general expressions;
20874 only constant expressions (that satisfy potential_constant_expression)
20875 can be tested for value dependence. */
20878 value_dependent_expression_p (tree expression
)
20880 if (!processing_template_decl
)
20883 /* A name declared with a dependent type. */
20884 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
20887 switch (TREE_CODE (expression
))
20889 case IDENTIFIER_NODE
:
20890 /* A name that has not been looked up -- must be dependent. */
20893 case TEMPLATE_PARM_INDEX
:
20894 /* A non-type template parm. */
20898 /* A non-type template parm. */
20899 if (DECL_TEMPLATE_PARM_P (expression
))
20901 return value_dependent_expression_p (DECL_INITIAL (expression
));
20904 /* A constant with literal type and is initialized
20905 with an expression that is value-dependent.
20907 Note that a non-dependent parenthesized initializer will have
20908 already been replaced with its constant value, so if we see
20909 a TREE_LIST it must be dependent. */
20910 if (DECL_INITIAL (expression
)
20911 && decl_constant_var_p (expression
)
20912 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
20913 || value_dependent_expression_p (DECL_INITIAL (expression
))))
20917 case DYNAMIC_CAST_EXPR
:
20918 case STATIC_CAST_EXPR
:
20919 case CONST_CAST_EXPR
:
20920 case REINTERPRET_CAST_EXPR
:
20922 /* These expressions are value-dependent if the type to which
20923 the cast occurs is dependent or the expression being casted
20924 is value-dependent. */
20926 tree type
= TREE_TYPE (expression
);
20928 if (dependent_type_p (type
))
20931 /* A functional cast has a list of operands. */
20932 expression
= TREE_OPERAND (expression
, 0);
20935 /* If there are no operands, it must be an expression such
20936 as "int()". This should not happen for aggregate types
20937 because it would form non-constant expressions. */
20938 gcc_assert (cxx_dialect
>= cxx11
20939 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
20944 if (TREE_CODE (expression
) == TREE_LIST
)
20945 return any_value_dependent_elements_p (expression
);
20947 return value_dependent_expression_p (expression
);
20951 if (SIZEOF_EXPR_TYPE_P (expression
))
20952 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
20956 /* A `sizeof' expression is value-dependent if the operand is
20957 type-dependent or is a pack expansion. */
20958 expression
= TREE_OPERAND (expression
, 0);
20959 if (PACK_EXPANSION_P (expression
))
20961 else if (TYPE_P (expression
))
20962 return dependent_type_p (expression
);
20963 return instantiation_dependent_expression_p (expression
);
20965 case AT_ENCODE_EXPR
:
20966 /* An 'encode' expression is value-dependent if the operand is
20968 expression
= TREE_OPERAND (expression
, 0);
20969 return dependent_type_p (expression
);
20971 case NOEXCEPT_EXPR
:
20972 expression
= TREE_OPERAND (expression
, 0);
20973 return instantiation_dependent_expression_p (expression
);
20976 /* All instantiation-dependent expressions should also be considered
20977 value-dependent. */
20978 return instantiation_dependent_scope_ref_p (expression
);
20980 case COMPONENT_REF
:
20981 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
20982 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
20984 case NONTYPE_ARGUMENT_PACK
:
20985 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
20986 is value-dependent. */
20988 tree values
= ARGUMENT_PACK_ARGS (expression
);
20989 int i
, len
= TREE_VEC_LENGTH (values
);
20991 for (i
= 0; i
< len
; ++i
)
20992 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
21000 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
21001 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
21002 || (type2
? dependent_type_p (type2
) : false));
21006 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21007 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
21010 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21011 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
21015 tree op
= TREE_OPERAND (expression
, 0);
21016 return (value_dependent_expression_p (op
)
21017 || has_value_dependent_address (op
));
21022 tree fn
= get_callee_fndecl (expression
);
21024 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
21026 nargs
= call_expr_nargs (expression
);
21027 for (i
= 0; i
< nargs
; ++i
)
21029 tree op
= CALL_EXPR_ARG (expression
, i
);
21030 /* In a call to a constexpr member function, look through the
21031 implicit ADDR_EXPR on the object argument so that it doesn't
21032 cause the call to be considered value-dependent. We also
21033 look through it in potential_constant_expression. */
21034 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
21035 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
21036 && TREE_CODE (op
) == ADDR_EXPR
)
21037 op
= TREE_OPERAND (op
, 0);
21038 if (value_dependent_expression_p (op
))
21044 case TEMPLATE_ID_EXPR
:
21045 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
21047 return type_dependent_expression_p (expression
);
21053 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
21054 if (value_dependent_expression_p (val
))
21060 /* Treat a GNU statement expression as dependent to avoid crashing
21061 under fold_non_dependent_expr; it can't be constant. */
21065 /* A constant expression is value-dependent if any subexpression is
21066 value-dependent. */
21067 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
21069 case tcc_reference
:
21071 case tcc_comparison
:
21073 case tcc_expression
:
21076 int i
, len
= cp_tree_operand_length (expression
);
21078 for (i
= 0; i
< len
; i
++)
21080 tree t
= TREE_OPERAND (expression
, i
);
21082 /* In some cases, some of the operands may be missing.l
21083 (For example, in the case of PREDECREMENT_EXPR, the
21084 amount to increment by may be missing.) That doesn't
21085 make the expression dependent. */
21086 if (t
&& value_dependent_expression_p (t
))
21097 /* The expression is not value-dependent. */
21101 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
21102 [temp.dep.expr]. Note that an expression with no type is
21103 considered dependent. Other parts of the compiler arrange for an
21104 expression with type-dependent subexpressions to have no type, so
21105 this function doesn't have to be fully recursive. */
21108 type_dependent_expression_p (tree expression
)
21110 if (!processing_template_decl
)
21113 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
21116 /* An unresolved name is always dependent. */
21117 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
21120 /* Some expression forms are never type-dependent. */
21121 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
21122 || TREE_CODE (expression
) == SIZEOF_EXPR
21123 || TREE_CODE (expression
) == ALIGNOF_EXPR
21124 || TREE_CODE (expression
) == AT_ENCODE_EXPR
21125 || TREE_CODE (expression
) == NOEXCEPT_EXPR
21126 || TREE_CODE (expression
) == TRAIT_EXPR
21127 || TREE_CODE (expression
) == TYPEID_EXPR
21128 || TREE_CODE (expression
) == DELETE_EXPR
21129 || TREE_CODE (expression
) == VEC_DELETE_EXPR
21130 || TREE_CODE (expression
) == THROW_EXPR
)
21133 /* The types of these expressions depends only on the type to which
21134 the cast occurs. */
21135 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
21136 || TREE_CODE (expression
) == STATIC_CAST_EXPR
21137 || TREE_CODE (expression
) == CONST_CAST_EXPR
21138 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
21139 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
21140 || TREE_CODE (expression
) == CAST_EXPR
)
21141 return dependent_type_p (TREE_TYPE (expression
));
21143 /* The types of these expressions depends only on the type created
21144 by the expression. */
21145 if (TREE_CODE (expression
) == NEW_EXPR
21146 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
21148 /* For NEW_EXPR tree nodes created inside a template, either
21149 the object type itself or a TREE_LIST may appear as the
21151 tree type
= TREE_OPERAND (expression
, 1);
21152 if (TREE_CODE (type
) == TREE_LIST
)
21153 /* This is an array type. We need to check array dimensions
21155 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
21156 || value_dependent_expression_p
21157 (TREE_OPERAND (TREE_VALUE (type
), 1));
21159 return dependent_type_p (type
);
21162 if (TREE_CODE (expression
) == SCOPE_REF
)
21164 tree scope
= TREE_OPERAND (expression
, 0);
21165 tree name
= TREE_OPERAND (expression
, 1);
21167 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
21168 contains an identifier associated by name lookup with one or more
21169 declarations declared with a dependent type, or...a
21170 nested-name-specifier or qualified-id that names a member of an
21171 unknown specialization. */
21172 return (type_dependent_expression_p (name
)
21173 || dependent_scope_p (scope
));
21176 if (TREE_CODE (expression
) == FUNCTION_DECL
21177 && DECL_LANG_SPECIFIC (expression
)
21178 && DECL_TEMPLATE_INFO (expression
)
21179 && (any_dependent_template_arguments_p
21180 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
21183 if (TREE_CODE (expression
) == TEMPLATE_DECL
21184 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
21187 if (TREE_CODE (expression
) == STMT_EXPR
)
21188 expression
= stmt_expr_value_expr (expression
);
21190 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
21195 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
21197 if (type_dependent_expression_p (elt
))
21203 /* A static data member of the current instantiation with incomplete
21204 array type is type-dependent, as the definition and specializations
21205 can have different bounds. */
21206 if (VAR_P (expression
)
21207 && DECL_CLASS_SCOPE_P (expression
)
21208 && dependent_type_p (DECL_CONTEXT (expression
))
21209 && VAR_HAD_UNKNOWN_BOUND (expression
))
21212 /* An array of unknown bound depending on a variadic parameter, eg:
21214 template<typename... Args>
21215 void foo (Args... args)
21217 int arr[] = { args... };
21220 template<int... vals>
21223 int arr[] = { vals... };
21226 If the array has no length and has an initializer, it must be that
21227 we couldn't determine its length in cp_complete_array_type because
21228 it is dependent. */
21229 if (VAR_P (expression
)
21230 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
21231 && !TYPE_DOMAIN (TREE_TYPE (expression
))
21232 && DECL_INITIAL (expression
))
21235 if (TREE_TYPE (expression
) == unknown_type_node
)
21237 if (TREE_CODE (expression
) == ADDR_EXPR
)
21238 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
21239 if (TREE_CODE (expression
) == COMPONENT_REF
21240 || TREE_CODE (expression
) == OFFSET_REF
)
21242 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21244 expression
= TREE_OPERAND (expression
, 1);
21245 if (identifier_p (expression
))
21248 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21249 if (TREE_CODE (expression
) == SCOPE_REF
)
21252 /* Always dependent, on the number of arguments if nothing else. */
21253 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
21256 if (BASELINK_P (expression
))
21258 if (BASELINK_OPTYPE (expression
)
21259 && dependent_type_p (BASELINK_OPTYPE (expression
)))
21261 expression
= BASELINK_FUNCTIONS (expression
);
21264 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
21266 if (any_dependent_template_arguments_p
21267 (TREE_OPERAND (expression
, 1)))
21269 expression
= TREE_OPERAND (expression
, 0);
21271 gcc_assert (TREE_CODE (expression
) == OVERLOAD
21272 || TREE_CODE (expression
) == FUNCTION_DECL
);
21276 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
21278 expression
= OVL_NEXT (expression
);
21283 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
21285 return (dependent_type_p (TREE_TYPE (expression
)));
21288 /* walk_tree callback function for instantiation_dependent_expression_p,
21289 below. Returns non-zero if a dependent subexpression is found. */
21292 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
21297 /* We don't have to worry about decltype currently because decltype
21298 of an instantiation-dependent expr is a dependent type. This
21299 might change depending on the resolution of DR 1172. */
21300 *walk_subtrees
= false;
21303 enum tree_code code
= TREE_CODE (*tp
);
21306 /* Don't treat an argument list as dependent just because it has no
21314 /* A constant with a dependent initializer is dependent. */
21315 if (value_dependent_expression_p (*tp
))
21319 case TEMPLATE_PARM_INDEX
:
21322 /* Handle expressions with type operands. */
21326 case AT_ENCODE_EXPR
:
21328 tree op
= TREE_OPERAND (*tp
, 0);
21329 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
21330 op
= TREE_TYPE (op
);
21333 if (dependent_type_p (op
))
21337 *walk_subtrees
= false;
21345 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21346 || (TRAIT_EXPR_TYPE2 (*tp
)
21347 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21349 *walk_subtrees
= false;
21352 case COMPONENT_REF
:
21353 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21354 /* In a template, finish_class_member_access_expr creates a
21355 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21356 type-dependent, so that we can check access control at
21357 instantiation time (PR 42277). See also Core issue 1273. */
21362 if (instantiation_dependent_scope_ref_p (*tp
))
21367 /* Treat statement-expressions as dependent. */
21375 if (type_dependent_expression_p (*tp
))
21381 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21382 sense defined by the ABI:
21384 "An expression is instantiation-dependent if it is type-dependent
21385 or value-dependent, or it has a subexpression that is type-dependent
21386 or value-dependent." */
21389 instantiation_dependent_expression_p (tree expression
)
21393 if (!processing_template_decl
)
21396 if (expression
== error_mark_node
)
21399 result
= cp_walk_tree_without_duplicates (&expression
,
21400 instantiation_dependent_r
, NULL
);
21401 return result
!= NULL_TREE
;
21404 /* Like type_dependent_expression_p, but it also works while not processing
21405 a template definition, i.e. during substitution or mangling. */
21408 type_dependent_expression_p_push (tree expr
)
21411 ++processing_template_decl
;
21412 b
= type_dependent_expression_p (expr
);
21413 --processing_template_decl
;
21417 /* Returns TRUE if ARGS contains a type-dependent expression. */
21420 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21425 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21427 if (type_dependent_expression_p (arg
))
21433 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21434 expressions) contains any type-dependent expressions. */
21437 any_type_dependent_elements_p (const_tree list
)
21439 for (; list
; list
= TREE_CHAIN (list
))
21440 if (type_dependent_expression_p (TREE_VALUE (list
)))
21446 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21447 expressions) contains any value-dependent expressions. */
21450 any_value_dependent_elements_p (const_tree list
)
21452 for (; list
; list
= TREE_CHAIN (list
))
21453 if (value_dependent_expression_p (TREE_VALUE (list
)))
21459 /* Returns TRUE if the ARG (a template argument) is dependent. */
21462 dependent_template_arg_p (tree arg
)
21464 if (!processing_template_decl
)
21467 /* Assume a template argument that was wrongly written by the user
21468 is dependent. This is consistent with what
21469 any_dependent_template_arguments_p [that calls this function]
21471 if (!arg
|| arg
== error_mark_node
)
21474 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21475 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21477 if (TREE_CODE (arg
) == TEMPLATE_DECL
21478 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21479 return dependent_template_p (arg
);
21480 else if (ARGUMENT_PACK_P (arg
))
21482 tree args
= ARGUMENT_PACK_ARGS (arg
);
21483 int i
, len
= TREE_VEC_LENGTH (args
);
21484 for (i
= 0; i
< len
; ++i
)
21486 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21492 else if (TYPE_P (arg
))
21493 return dependent_type_p (arg
);
21495 return (type_dependent_expression_p (arg
)
21496 || value_dependent_expression_p (arg
));
21499 /* Returns true if ARGS (a collection of template arguments) contains
21500 any types that require structural equality testing. */
21503 any_template_arguments_need_structural_equality_p (tree args
)
21510 if (args
== error_mark_node
)
21513 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21515 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21516 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21518 tree arg
= TREE_VEC_ELT (level
, j
);
21519 tree packed_args
= NULL_TREE
;
21522 if (ARGUMENT_PACK_P (arg
))
21524 /* Look inside the argument pack. */
21525 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21526 len
= TREE_VEC_LENGTH (packed_args
);
21529 for (k
= 0; k
< len
; ++k
)
21532 arg
= TREE_VEC_ELT (packed_args
, k
);
21534 if (error_operand_p (arg
))
21536 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21538 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21540 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21541 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21550 /* Returns true if ARGS (a collection of template arguments) contains
21551 any dependent arguments. */
21554 any_dependent_template_arguments_p (const_tree args
)
21561 if (args
== error_mark_node
)
21564 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21566 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21567 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21568 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21575 /* Returns TRUE if the template TMPL is dependent. */
21578 dependent_template_p (tree tmpl
)
21580 if (TREE_CODE (tmpl
) == OVERLOAD
)
21584 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21586 tmpl
= OVL_NEXT (tmpl
);
21591 /* Template template parameters are dependent. */
21592 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21593 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21595 /* So are names that have not been looked up. */
21596 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21598 /* So are member templates of dependent classes. */
21599 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21600 return dependent_type_p (DECL_CONTEXT (tmpl
));
21604 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21607 dependent_template_id_p (tree tmpl
, tree args
)
21609 return (dependent_template_p (tmpl
)
21610 || any_dependent_template_arguments_p (args
));
21613 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21617 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21621 if (!processing_template_decl
)
21624 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21626 tree decl
= TREE_VEC_ELT (declv
, i
);
21627 tree init
= TREE_VEC_ELT (initv
, i
);
21628 tree cond
= TREE_VEC_ELT (condv
, i
);
21629 tree incr
= TREE_VEC_ELT (incrv
, i
);
21631 if (type_dependent_expression_p (decl
))
21634 if (init
&& type_dependent_expression_p (init
))
21637 if (type_dependent_expression_p (cond
))
21640 if (COMPARISON_CLASS_P (cond
)
21641 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21642 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21645 if (TREE_CODE (incr
) == MODOP_EXPR
)
21647 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21648 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21651 else if (type_dependent_expression_p (incr
))
21653 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21655 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21657 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
21659 tree t
= TREE_OPERAND (incr
, 1);
21660 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
21661 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
21670 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21671 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21672 no such TYPE can be found. Note that this function peers inside
21673 uninstantiated templates and therefore should be used only in
21674 extremely limited situations. ONLY_CURRENT_P restricts this
21675 peering to the currently open classes hierarchy (which is required
21676 when comparing types). */
21679 resolve_typename_type (tree type
, bool only_current_p
)
21688 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
21690 scope
= TYPE_CONTEXT (type
);
21691 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21692 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21693 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21694 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21695 identifier of the TYPENAME_TYPE anymore.
21696 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21697 TYPENAME_TYPE instead, we avoid messing up with a possible
21698 typedef variant case. */
21699 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
21701 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21702 it first before we can figure out what NAME refers to. */
21703 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21705 if (TYPENAME_IS_RESOLVING_P (scope
))
21706 /* Given a class template A with a dependent base with nested type C,
21707 typedef typename A::C::C C will land us here, as trying to resolve
21708 the initial A::C leads to the local C typedef, which leads back to
21709 A::C::C. So we break the recursion now. */
21712 scope
= resolve_typename_type (scope
, only_current_p
);
21714 /* If we don't know what SCOPE refers to, then we cannot resolve the
21716 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21718 /* If the SCOPE is a template type parameter, we have no way of
21719 resolving the name. */
21720 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
21722 /* If the SCOPE is not the current instantiation, there's no reason
21723 to look inside it. */
21724 if (only_current_p
&& !currently_open_class (scope
))
21726 /* If this is a typedef, we don't want to look inside (c++/11987). */
21727 if (typedef_variant_p (type
))
21729 /* If SCOPE isn't the template itself, it will not have a valid
21730 TYPE_FIELDS list. */
21731 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
21732 /* scope is either the template itself or a compatible instantiation
21733 like X<T>, so look up the name in the original template. */
21734 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
21736 /* scope is a partial instantiation, so we can't do the lookup or we
21737 will lose the template arguments. */
21739 /* Enter the SCOPE so that name lookup will be resolved as if we
21740 were in the class definition. In particular, SCOPE will no
21741 longer be considered a dependent type. */
21742 pushed_scope
= push_scope (scope
);
21743 /* Look up the declaration. */
21744 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
21745 tf_warning_or_error
);
21747 result
= NULL_TREE
;
21749 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21750 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21753 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
21754 && TREE_CODE (decl
) == TYPE_DECL
)
21756 result
= TREE_TYPE (decl
);
21757 if (result
== error_mark_node
)
21758 result
= NULL_TREE
;
21760 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
21761 && DECL_CLASS_TEMPLATE_P (decl
))
21765 /* Obtain the template and the arguments. */
21766 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
21767 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
21768 /* Instantiate the template. */
21769 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
21770 /*entering_scope=*/0,
21771 tf_error
| tf_user
);
21772 if (result
== error_mark_node
)
21773 result
= NULL_TREE
;
21776 /* Leave the SCOPE. */
21778 pop_scope (pushed_scope
);
21780 /* If we failed to resolve it, return the original typename. */
21784 /* If lookup found a typename type, resolve that too. */
21785 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
21787 /* Ill-formed programs can cause infinite recursion here, so we
21788 must catch that. */
21789 TYPENAME_IS_RESOLVING_P (type
) = 1;
21790 result
= resolve_typename_type (result
, only_current_p
);
21791 TYPENAME_IS_RESOLVING_P (type
) = 0;
21794 /* Qualify the resulting type. */
21795 quals
= cp_type_quals (type
);
21797 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
21802 /* EXPR is an expression which is not type-dependent. Return a proxy
21803 for EXPR that can be used to compute the types of larger
21804 expressions containing EXPR. */
21807 build_non_dependent_expr (tree expr
)
21811 #ifdef ENABLE_CHECKING
21812 /* Try to get a constant value for all non-dependent expressions in
21813 order to expose bugs in *_dependent_expression_p and constexpr. */
21814 if (cxx_dialect
>= cxx11
)
21815 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
21818 /* Preserve OVERLOADs; the functions must be available to resolve
21821 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
21822 inner_expr
= stmt_expr_value_expr (inner_expr
);
21823 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
21824 inner_expr
= TREE_OPERAND (inner_expr
, 0);
21825 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
21826 inner_expr
= TREE_OPERAND (inner_expr
, 1);
21827 if (is_overloaded_fn (inner_expr
)
21828 || TREE_CODE (inner_expr
) == OFFSET_REF
)
21830 /* There is no need to return a proxy for a variable. */
21833 /* Preserve string constants; conversions from string constants to
21834 "char *" are allowed, even though normally a "const char *"
21835 cannot be used to initialize a "char *". */
21836 if (TREE_CODE (expr
) == STRING_CST
)
21838 /* Preserve void and arithmetic constants, as an optimization -- there is no
21839 reason to create a new node. */
21840 if (TREE_CODE (expr
) == VOID_CST
21841 || TREE_CODE (expr
) == INTEGER_CST
21842 || TREE_CODE (expr
) == REAL_CST
)
21844 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
21845 There is at least one place where we want to know that a
21846 particular expression is a throw-expression: when checking a ?:
21847 expression, there are special rules if the second or third
21848 argument is a throw-expression. */
21849 if (TREE_CODE (expr
) == THROW_EXPR
)
21852 /* Don't wrap an initializer list, we need to be able to look inside. */
21853 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
21856 /* Don't wrap a dummy object, we need to be able to test for it. */
21857 if (is_dummy_object (expr
))
21860 if (TREE_CODE (expr
) == COND_EXPR
)
21861 return build3 (COND_EXPR
,
21863 TREE_OPERAND (expr
, 0),
21864 (TREE_OPERAND (expr
, 1)
21865 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
21866 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
21867 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
21868 if (TREE_CODE (expr
) == COMPOUND_EXPR
21869 && !COMPOUND_EXPR_OVERLOADED (expr
))
21870 return build2 (COMPOUND_EXPR
,
21872 TREE_OPERAND (expr
, 0),
21873 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
21875 /* If the type is unknown, it can't really be non-dependent */
21876 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
21878 /* Otherwise, build a NON_DEPENDENT_EXPR. */
21879 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
21882 /* ARGS is a vector of expressions as arguments to a function call.
21883 Replace the arguments with equivalent non-dependent expressions.
21884 This modifies ARGS in place. */
21887 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
21892 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
21894 tree newarg
= build_non_dependent_expr (arg
);
21896 (*args
)[ix
] = newarg
;
21900 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
21901 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
21905 make_auto_1 (tree name
)
21907 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
21908 TYPE_NAME (au
) = build_decl (input_location
,
21909 TYPE_DECL
, name
, au
);
21910 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
21911 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
21912 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
21913 TYPE_NAME (au
), NULL_TREE
);
21914 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
21915 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
21916 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
21922 make_decltype_auto (void)
21924 return make_auto_1 (get_identifier ("decltype(auto)"));
21930 return make_auto_1 (get_identifier ("auto"));
21933 /* Given type ARG, return std::initializer_list<ARG>. */
21938 tree std_init_list
= namespace_binding
21939 (get_identifier ("initializer_list"), std_node
);
21941 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
21943 error ("deducing from brace-enclosed initializer list requires "
21944 "#include <initializer_list>");
21945 return error_mark_node
;
21947 argvec
= make_tree_vec (1);
21948 TREE_VEC_ELT (argvec
, 0) = arg
;
21949 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
21950 NULL_TREE
, 0, tf_warning_or_error
);
21953 /* Replace auto in TYPE with std::initializer_list<auto>. */
21956 listify_autos (tree type
, tree auto_node
)
21958 tree init_auto
= listify (auto_node
);
21959 tree argvec
= make_tree_vec (1);
21960 TREE_VEC_ELT (argvec
, 0) = init_auto
;
21961 if (processing_template_decl
)
21962 argvec
= add_to_template_args (current_template_args (), argvec
);
21963 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21966 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
21967 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
21970 do_auto_deduction (tree type
, tree init
, tree auto_node
)
21974 if (init
== error_mark_node
)
21975 return error_mark_node
;
21977 if (type_dependent_expression_p (init
))
21978 /* Defining a subset of type-dependent expressions that we can deduce
21979 from ahead of time isn't worth the trouble. */
21982 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
21983 with either a new invented type template parameter U or, if the
21984 initializer is a braced-init-list (8.5.4), with
21985 std::initializer_list<U>. */
21986 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
21987 type
= listify_autos (type
, auto_node
);
21989 init
= resolve_nondeduced_context (init
);
21991 targs
= make_tree_vec (1);
21992 if (AUTO_IS_DECLTYPE (auto_node
))
21994 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
21995 && !REF_PARENTHESIZED_P (init
)));
21996 TREE_VEC_ELT (targs
, 0)
21997 = finish_decltype_type (init
, id
, tf_warning_or_error
);
21998 if (type
!= auto_node
)
22000 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
22001 return error_mark_node
;
22006 tree parms
= build_tree_list (NULL_TREE
, type
);
22007 tree tparms
= make_tree_vec (1);
22010 TREE_VEC_ELT (tparms
, 0)
22011 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
22012 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
22013 DEDUCE_CALL
, LOOKUP_NORMAL
,
22014 NULL
, /*explain_p=*/false);
22017 if (processing_template_decl
)
22018 /* Try again at instantiation time. */
22020 if (type
&& type
!= error_mark_node
)
22021 /* If type is error_mark_node a diagnostic must have been
22022 emitted by now. Also, having a mention to '<type error>'
22023 in the diagnostic is not really useful to the user. */
22025 if (cfun
&& auto_node
== current_function_auto_return_pattern
22026 && LAMBDA_FUNCTION_P (current_function_decl
))
22027 error ("unable to deduce lambda return type from %qE", init
);
22029 error ("unable to deduce %qT from %qE", type
, init
);
22031 return error_mark_node
;
22035 /* If the list of declarators contains more than one declarator, the type
22036 of each declared variable is determined as described above. If the
22037 type deduced for the template parameter U is not the same in each
22038 deduction, the program is ill-formed. */
22039 if (TREE_TYPE (auto_node
)
22040 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
22042 if (cfun
&& auto_node
== current_function_auto_return_pattern
22043 && LAMBDA_FUNCTION_P (current_function_decl
))
22044 error ("inconsistent types %qT and %qT deduced for "
22045 "lambda return type", TREE_TYPE (auto_node
),
22046 TREE_VEC_ELT (targs
, 0));
22048 error ("inconsistent deduction for %qT: %qT and then %qT",
22049 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
22050 return error_mark_node
;
22052 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
22054 if (processing_template_decl
)
22055 targs
= add_to_template_args (current_template_args (), targs
);
22056 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
22059 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
22063 splice_late_return_type (tree type
, tree late_return_type
)
22067 if (late_return_type
== NULL_TREE
)
22069 argvec
= make_tree_vec (1);
22070 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
22071 if (processing_template_parmlist
)
22072 /* For a late-specified return type in a template type-parameter, we
22073 need to add a dummy argument level for its parmlist. */
22074 argvec
= add_to_template_args
22075 (make_tree_vec (processing_template_parmlist
), argvec
);
22076 if (current_template_parms
)
22077 argvec
= add_to_template_args (current_template_args (), argvec
);
22078 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22081 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
22082 'decltype(auto)'. */
22085 is_auto (const_tree type
)
22087 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22088 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
22089 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
22095 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
22096 a use of `auto'. Returns NULL_TREE otherwise. */
22099 type_uses_auto (tree type
)
22101 return find_type_usage (type
, is_auto
);
22104 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
22105 'decltype(auto)' or a concept. */
22108 is_auto_or_concept (const_tree type
)
22110 return is_auto (type
); // or concept
22113 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
22114 a concept identifier) iff TYPE contains a use of a generic type. Returns
22115 NULL_TREE otherwise. */
22118 type_uses_auto_or_concept (tree type
)
22120 return find_type_usage (type
, is_auto_or_concept
);
22124 /* For a given template T, return the vector of typedefs referenced
22125 in T for which access check is needed at T instantiation time.
22126 T is either a FUNCTION_DECL or a RECORD_TYPE.
22127 Those typedefs were added to T by the function
22128 append_type_to_template_for_access_check. */
22130 vec
<qualified_typedef_usage_t
, va_gc
> *
22131 get_types_needing_access_check (tree t
)
22134 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
22136 if (!t
|| t
== error_mark_node
)
22139 if (!(ti
= get_template_info (t
)))
22142 if (CLASS_TYPE_P (t
)
22143 || TREE_CODE (t
) == FUNCTION_DECL
)
22145 if (!TI_TEMPLATE (ti
))
22148 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
22154 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
22155 tied to T. That list of typedefs will be access checked at
22156 T instantiation time.
22157 T is either a FUNCTION_DECL or a RECORD_TYPE.
22158 TYPE_DECL is a TYPE_DECL node representing a typedef.
22159 SCOPE is the scope through which TYPE_DECL is accessed.
22160 LOCATION is the location of the usage point of TYPE_DECL.
22162 This function is a subroutine of
22163 append_type_to_template_for_access_check. */
22166 append_type_to_template_for_access_check_1 (tree t
,
22169 location_t location
)
22171 qualified_typedef_usage_t typedef_usage
;
22174 if (!t
|| t
== error_mark_node
)
22177 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
22178 || CLASS_TYPE_P (t
))
22180 && TREE_CODE (type_decl
) == TYPE_DECL
22183 if (!(ti
= get_template_info (t
)))
22186 gcc_assert (TI_TEMPLATE (ti
));
22188 typedef_usage
.typedef_decl
= type_decl
;
22189 typedef_usage
.context
= scope
;
22190 typedef_usage
.locus
= location
;
22192 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
22195 /* Append TYPE_DECL to the template TEMPL.
22196 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
22197 At TEMPL instanciation time, TYPE_DECL will be checked to see
22198 if it can be accessed through SCOPE.
22199 LOCATION is the location of the usage point of TYPE_DECL.
22201 e.g. consider the following code snippet:
22208 template<class U> struct S
22210 C::myint mi; // <-- usage point of the typedef C::myint
22215 At S<char> instantiation time, we need to check the access of C::myint
22216 In other words, we need to check the access of the myint typedef through
22217 the C scope. For that purpose, this function will add the myint typedef
22218 and the scope C through which its being accessed to a list of typedefs
22219 tied to the template S. That list will be walked at template instantiation
22220 time and access check performed on each typedefs it contains.
22221 Note that this particular code snippet should yield an error because
22222 myint is private to C. */
22225 append_type_to_template_for_access_check (tree templ
,
22228 location_t location
)
22230 qualified_typedef_usage_t
*iter
;
22233 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
22235 /* Make sure we don't append the type to the template twice. */
22236 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
22237 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
22240 append_type_to_template_for_access_check_1 (templ
, type_decl
,
22244 /* Convert the generic type parameters in PARM that match the types given in the
22245 range [START_IDX, END_IDX) from the current_template_parms into generic type
22249 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
22251 tree current
= current_template_parms
;
22252 int depth
= TMPL_PARMS_DEPTH (current
);
22253 current
= INNERMOST_TEMPLATE_PARMS (current
);
22254 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
22256 for (int i
= 0; i
< start_idx
; ++i
)
22257 TREE_VEC_ELT (replacement
, i
)
22258 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22260 for (int i
= start_idx
; i
< end_idx
; ++i
)
22262 /* Create a distinct parameter pack type from the current parm and add it
22263 to the replacement args to tsubst below into the generic function
22266 tree o
= TREE_TYPE (TREE_VALUE
22267 (TREE_VEC_ELT (current
, i
)));
22268 tree t
= copy_type (o
);
22269 TEMPLATE_TYPE_PARM_INDEX (t
)
22270 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
22272 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
22273 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
22274 TYPE_MAIN_VARIANT (t
) = t
;
22275 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
22276 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
22277 TREE_VEC_ELT (replacement
, i
) = t
;
22278 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
22281 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
22282 TREE_VEC_ELT (replacement
, i
)
22283 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22285 /* If there are more levels then build up the replacement with the outer
22288 replacement
= add_to_template_args (template_parms_to_args
22289 (TREE_CHAIN (current_template_parms
)),
22292 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
22296 /* Set up the hash tables for template instantiations. */
22299 init_template_processing (void)
22301 decl_specializations
= htab_create_ggc (37,
22302 hash_specialization
,
22303 eq_specializations
,
22305 type_specializations
= htab_create_ggc (37,
22306 hash_specialization
,
22307 eq_specializations
,
22311 /* Print stats about the template hash tables for -fstats. */
22314 print_template_statistics (void)
22316 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
22317 "%f collisions\n", (long) htab_size (decl_specializations
),
22318 (long) htab_elements (decl_specializations
),
22319 htab_collisions (decl_specializations
));
22320 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
22321 "%f collisions\n", (long) htab_size (type_specializations
),
22322 (long) htab_elements (type_specializations
),
22323 htab_collisions (type_specializations
));
22326 #include "gt-cp-pt.h"