1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2014 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
29 #include "coretypes.h"
32 #include "stringpool.h"
35 #include "stor-layout.h"
39 #include "c-family/c-common.h"
40 #include "c-family/c-objc.h"
41 #include "cp-objcp-common.h"
42 #include "tree-inline.h"
46 #include "tree-iterator.h"
47 #include "type-utils.h"
50 /* The type of functions taking a tree, and some additional data, and
52 typedef int (*tree_fn_t
) (tree
, void*);
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the work. */
57 struct GTY ((chain_next ("%h.next"))) pending_template
{
58 struct pending_template
*next
;
59 struct tinst_level
*tinst
;
62 static GTY(()) struct pending_template
*pending_templates
;
63 static GTY(()) struct pending_template
*last_pending_template
;
65 int processing_template_parmlist
;
66 static int template_header_count
;
68 static GTY(()) tree saved_trees
;
69 static vec
<int> inline_parm_levels
;
71 static GTY(()) struct tinst_level
*current_tinst_level
;
73 static GTY(()) tree saved_access_scope
;
75 /* Live only within one (recursive) call to tsubst_expr. We use
76 this to pass the statement expression node from the STMT_EXPR
77 to the EXPR_STMT that is its result. */
78 static tree cur_stmt_expr
;
80 /* True if we've recursed into fn_type_unification too many times. */
81 static bool excessive_deduction_depth
;
83 typedef struct GTY(()) spec_entry
90 static GTY ((param_is (spec_entry
)))
91 htab_t decl_specializations
;
93 static GTY ((param_is (spec_entry
)))
94 htab_t type_specializations
;
96 /* Contains canonical template parameter types. The vector is indexed by
97 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
98 TREE_LIST, whose TREE_VALUEs contain the canonical template
99 parameters of various types and levels. */
100 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
102 #define UNIFY_ALLOW_NONE 0
103 #define UNIFY_ALLOW_MORE_CV_QUAL 1
104 #define UNIFY_ALLOW_LESS_CV_QUAL 2
105 #define UNIFY_ALLOW_DERIVED 4
106 #define UNIFY_ALLOW_INTEGER 8
107 #define UNIFY_ALLOW_OUTER_LEVEL 16
108 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
109 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
111 enum template_base_result
{
113 tbr_ambiguous_baseclass
,
117 static void push_access_scope (tree
);
118 static void pop_access_scope (tree
);
119 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
120 unification_kind_t
, int,
122 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
123 unification_kind_t
, int, bool, bool);
124 static int unify (tree
, tree
, tree
, tree
, int, bool);
125 static void add_pending_template (tree
);
126 static tree
reopen_tinst_level (struct tinst_level
*);
127 static tree
tsubst_initializer_list (tree
, tree
);
128 static tree
get_class_bindings (tree
, tree
, tree
, tree
);
129 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
131 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
133 static void tsubst_enum (tree
, tree
, tree
);
134 static tree
add_to_template_args (tree
, tree
);
135 static tree
add_outermost_template_args (tree
, tree
);
136 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
137 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
139 static int type_unification_real (tree
, tree
, tree
, const tree
*,
140 unsigned int, int, unification_kind_t
, int,
141 vec
<deferred_access_check
, va_gc
> **,
143 static void note_template_header (int);
144 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
145 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
146 static tree
convert_template_argument (tree
, tree
, tree
,
147 tsubst_flags_t
, int, tree
);
148 static int for_each_template_parm (tree
, tree_fn_t
, void*,
149 hash_set
<tree
> *, bool);
150 static tree
expand_template_argument_pack (tree
);
151 static tree
build_template_parm_index (int, int, int, tree
, tree
);
152 static bool inline_needs_template_parms (tree
, bool);
153 static void push_inline_template_parms_recursive (tree
, int);
154 static tree
retrieve_local_specialization (tree
);
155 static void register_local_specialization (tree
, tree
);
156 static hashval_t
hash_specialization (const void *p
);
157 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
158 static int mark_template_parm (tree
, void *);
159 static int template_parm_this_level_p (tree
, void *);
160 static tree
tsubst_friend_function (tree
, tree
);
161 static tree
tsubst_friend_class (tree
, tree
);
162 static int can_complete_type_without_circularity (tree
);
163 static tree
get_bindings (tree
, tree
, tree
, bool);
164 static int template_decl_level (tree
);
165 static int check_cv_quals_for_unify (int, tree
, tree
);
166 static void template_parm_level_and_index (tree
, int*, int*);
167 static int unify_pack_expansion (tree
, tree
, tree
,
168 tree
, unification_kind_t
, bool, bool);
169 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
170 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
171 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
172 static void regenerate_decl_from_template (tree
, tree
);
173 static tree
most_specialized_class (tree
, tsubst_flags_t
);
174 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
175 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
176 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
177 static bool check_specialization_scope (void);
178 static tree
process_partial_specialization (tree
);
179 static void set_current_access_from_decl (tree
);
180 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
182 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
183 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
185 static bool template_template_parm_bindings_ok_p (tree
, tree
);
186 static int template_args_equal (tree
, tree
);
187 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
188 static tree
for_each_template_parm_r (tree
*, int *, void *);
189 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
190 static void copy_default_args_to_explicit_spec (tree
);
191 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
192 static bool dependent_template_arg_p (tree
);
193 static bool any_template_arguments_need_structural_equality_p (tree
);
194 static bool dependent_type_p_r (tree
);
195 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
196 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
197 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
198 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
199 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
200 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
202 static tree
listify (tree
);
203 static tree
listify_autos (tree
, tree
);
204 static tree
template_parm_to_arg (tree t
);
205 static tree
current_template_args (void);
206 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
207 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
209 /* Make the current scope suitable for access checking when we are
210 processing T. T can be FUNCTION_DECL for instantiated function
211 template, VAR_DECL for static member variable, or TYPE_DECL for
212 alias template (needed by instantiate_decl). */
215 push_access_scope (tree t
)
217 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
218 || TREE_CODE (t
) == TYPE_DECL
);
220 if (DECL_FRIEND_CONTEXT (t
))
221 push_nested_class (DECL_FRIEND_CONTEXT (t
));
222 else if (DECL_CLASS_SCOPE_P (t
))
223 push_nested_class (DECL_CONTEXT (t
));
225 push_to_top_level ();
227 if (TREE_CODE (t
) == FUNCTION_DECL
)
229 saved_access_scope
= tree_cons
230 (NULL_TREE
, current_function_decl
, saved_access_scope
);
231 current_function_decl
= t
;
235 /* Restore the scope set up by push_access_scope. T is the node we
239 pop_access_scope (tree t
)
241 if (TREE_CODE (t
) == FUNCTION_DECL
)
243 current_function_decl
= TREE_VALUE (saved_access_scope
);
244 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
247 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
250 pop_from_top_level ();
253 /* Do any processing required when DECL (a member template
254 declaration) is finished. Returns the TEMPLATE_DECL corresponding
255 to DECL, unless it is a specialization, in which case the DECL
256 itself is returned. */
259 finish_member_template_decl (tree decl
)
261 if (decl
== error_mark_node
)
262 return error_mark_node
;
264 gcc_assert (DECL_P (decl
));
266 if (TREE_CODE (decl
) == TYPE_DECL
)
270 type
= TREE_TYPE (decl
);
271 if (type
== error_mark_node
)
272 return error_mark_node
;
273 if (MAYBE_CLASS_TYPE_P (type
)
274 && CLASSTYPE_TEMPLATE_INFO (type
)
275 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
277 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
278 check_member_template (tmpl
);
283 else if (TREE_CODE (decl
) == FIELD_DECL
)
284 error ("data member %qD cannot be a member template", decl
);
285 else if (DECL_TEMPLATE_INFO (decl
))
287 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
289 check_member_template (DECL_TI_TEMPLATE (decl
));
290 return DECL_TI_TEMPLATE (decl
);
296 error ("invalid member template declaration %qD", decl
);
298 return error_mark_node
;
301 /* Create a template info node. */
304 build_template_info (tree template_decl
, tree template_args
)
306 tree result
= make_node (TEMPLATE_INFO
);
307 TI_TEMPLATE (result
) = template_decl
;
308 TI_ARGS (result
) = template_args
;
312 /* Return the template info node corresponding to T, whatever T is. */
315 get_template_info (const_tree t
)
317 tree tinfo
= NULL_TREE
;
319 if (!t
|| t
== error_mark_node
)
322 if (TREE_CODE (t
) == NAMESPACE_DECL
)
325 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
326 tinfo
= DECL_TEMPLATE_INFO (t
);
328 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
331 if (OVERLOAD_TYPE_P (t
))
332 tinfo
= TYPE_TEMPLATE_INFO (t
);
333 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
334 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
339 /* Returns the template nesting level of the indicated class TYPE.
349 A<T>::B<U> has depth two, while A<T> has depth one.
350 Both A<T>::B<int> and A<int>::B<U> have depth one, if
351 they are instantiations, not specializations.
353 This function is guaranteed to return 0 if passed NULL_TREE so
354 that, for example, `template_class_depth (current_class_type)' is
358 template_class_depth (tree type
)
363 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
364 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
365 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
367 tree tinfo
= get_template_info (type
);
369 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
370 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
377 /* Subroutine of maybe_begin_member_template_processing.
378 Returns true if processing DECL needs us to push template parms. */
381 inline_needs_template_parms (tree decl
, bool nsdmi
)
383 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
386 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
387 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
390 /* Subroutine of maybe_begin_member_template_processing.
391 Push the template parms in PARMS, starting from LEVELS steps into the
392 chain, and ending at the beginning, since template parms are listed
396 push_inline_template_parms_recursive (tree parmlist
, int levels
)
398 tree parms
= TREE_VALUE (parmlist
);
402 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
404 ++processing_template_decl
;
405 current_template_parms
406 = tree_cons (size_int (processing_template_decl
),
407 parms
, current_template_parms
);
408 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
410 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
412 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
414 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
416 if (error_operand_p (parm
))
419 gcc_assert (DECL_P (parm
));
421 switch (TREE_CODE (parm
))
430 /* Make a CONST_DECL as is done in process_template_parm.
431 It is ugly that we recreate this here; the original
432 version built in process_template_parm is no longer
434 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
435 CONST_DECL
, DECL_NAME (parm
),
437 DECL_ARTIFICIAL (decl
) = 1;
438 TREE_CONSTANT (decl
) = 1;
439 TREE_READONLY (decl
) = 1;
440 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
441 SET_DECL_TEMPLATE_PARM_P (decl
);
452 /* Restore the template parameter context for a member template, a
453 friend template defined in a class definition, or a non-template
454 member of template class. */
457 maybe_begin_member_template_processing (tree decl
)
461 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
465 tree ctx
= DECL_CONTEXT (decl
);
466 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
467 /* Disregard full specializations (c++/60999). */
468 && uses_template_parms (ctx
)
469 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
472 if (inline_needs_template_parms (decl
, nsdmi
))
474 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
475 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
477 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
480 parms
= TREE_CHAIN (parms
);
483 push_inline_template_parms_recursive (parms
, levels
);
486 /* Remember how many levels of template parameters we pushed so that
487 we can pop them later. */
488 inline_parm_levels
.safe_push (levels
);
491 /* Undo the effects of maybe_begin_member_template_processing. */
494 maybe_end_member_template_processing (void)
499 if (inline_parm_levels
.length () == 0)
502 last
= inline_parm_levels
.pop ();
503 for (i
= 0; i
< last
; ++i
)
505 --processing_template_decl
;
506 current_template_parms
= TREE_CHAIN (current_template_parms
);
511 /* Return a new template argument vector which contains all of ARGS,
512 but has as its innermost set of arguments the EXTRA_ARGS. */
515 add_to_template_args (tree args
, tree extra_args
)
522 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
525 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
526 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
528 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
529 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
531 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
532 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
537 /* Like add_to_template_args, but only the outermost ARGS are added to
538 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
539 (EXTRA_ARGS) levels are added. This function is used to combine
540 the template arguments from a partial instantiation with the
541 template arguments used to attain the full instantiation from the
542 partial instantiation. */
545 add_outermost_template_args (tree args
, tree extra_args
)
549 /* If there are more levels of EXTRA_ARGS than there are ARGS,
550 something very fishy is going on. */
551 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
553 /* If *all* the new arguments will be the EXTRA_ARGS, just return
555 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
558 /* For the moment, we make ARGS look like it contains fewer levels. */
559 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
561 new_args
= add_to_template_args (args
, extra_args
);
563 /* Now, we restore ARGS to its full dimensions. */
564 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
569 /* Return the N levels of innermost template arguments from the ARGS. */
572 get_innermost_template_args (tree args
, int n
)
580 /* If N is 1, just return the innermost set of template arguments. */
582 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
584 /* If we're not removing anything, just return the arguments we were
586 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
587 gcc_assert (extra_levels
>= 0);
588 if (extra_levels
== 0)
591 /* Make a new set of arguments, not containing the outer arguments. */
592 new_args
= make_tree_vec (n
);
593 for (i
= 1; i
<= n
; ++i
)
594 SET_TMPL_ARGS_LEVEL (new_args
, i
,
595 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
600 /* The inverse of get_innermost_template_args: Return all but the innermost
601 EXTRA_LEVELS levels of template arguments from the ARGS. */
604 strip_innermost_template_args (tree args
, int extra_levels
)
607 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
612 /* If N is 1, just return the outermost set of template arguments. */
614 return TMPL_ARGS_LEVEL (args
, 1);
616 /* If we're not removing anything, just return the arguments we were
618 gcc_assert (extra_levels
>= 0);
619 if (extra_levels
== 0)
622 /* Make a new set of arguments, not containing the inner arguments. */
623 new_args
= make_tree_vec (n
);
624 for (i
= 1; i
<= n
; ++i
)
625 SET_TMPL_ARGS_LEVEL (new_args
, i
,
626 TMPL_ARGS_LEVEL (args
, i
));
631 /* We've got a template header coming up; push to a new level for storing
635 begin_template_parm_list (void)
637 /* We use a non-tag-transparent scope here, which causes pushtag to
638 put tags in this scope, rather than in the enclosing class or
639 namespace scope. This is the right thing, since we want
640 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
641 global template class, push_template_decl handles putting the
642 TEMPLATE_DECL into top-level scope. For a nested template class,
645 template <class T> struct S1 {
646 template <class T> struct S2 {};
649 pushtag contains special code to call pushdecl_with_scope on the
650 TEMPLATE_DECL for S2. */
651 begin_scope (sk_template_parms
, NULL
);
652 ++processing_template_decl
;
653 ++processing_template_parmlist
;
654 note_template_header (0);
657 /* This routine is called when a specialization is declared. If it is
658 invalid to declare a specialization here, an error is reported and
659 false is returned, otherwise this routine will return true. */
662 check_specialization_scope (void)
664 tree scope
= current_scope ();
668 An explicit specialization shall be declared in the namespace of
669 which the template is a member, or, for member templates, in the
670 namespace of which the enclosing class or enclosing class
671 template is a member. An explicit specialization of a member
672 function, member class or static data member of a class template
673 shall be declared in the namespace of which the class template
675 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
677 error ("explicit specialization in non-namespace scope %qD", scope
);
683 In an explicit specialization declaration for a member of a class
684 template or a member template that appears in namespace scope,
685 the member template and some of its enclosing class templates may
686 remain unspecialized, except that the declaration shall not
687 explicitly specialize a class member template if its enclosing
688 class templates are not explicitly specialized as well. */
689 if (current_template_parms
)
691 error ("enclosing class templates are not explicitly specialized");
698 /* We've just seen template <>. */
701 begin_specialization (void)
703 begin_scope (sk_template_spec
, NULL
);
704 note_template_header (1);
705 return check_specialization_scope ();
708 /* Called at then end of processing a declaration preceded by
712 end_specialization (void)
715 reset_specialization ();
718 /* Any template <>'s that we have seen thus far are not referring to a
719 function specialization. */
722 reset_specialization (void)
724 processing_specialization
= 0;
725 template_header_count
= 0;
728 /* We've just seen a template header. If SPECIALIZATION is nonzero,
729 it was of the form template <>. */
732 note_template_header (int specialization
)
734 processing_specialization
= specialization
;
735 template_header_count
++;
738 /* We're beginning an explicit instantiation. */
741 begin_explicit_instantiation (void)
743 gcc_assert (!processing_explicit_instantiation
);
744 processing_explicit_instantiation
= true;
749 end_explicit_instantiation (void)
751 gcc_assert (processing_explicit_instantiation
);
752 processing_explicit_instantiation
= false;
755 /* An explicit specialization or partial specialization of TMPL is being
756 declared. Check that the namespace in which the specialization is
757 occurring is permissible. Returns false iff it is invalid to
758 specialize TMPL in the current namespace. */
761 check_specialization_namespace (tree tmpl
)
763 tree tpl_ns
= decl_namespace_context (tmpl
);
767 An explicit specialization shall be declared in the namespace of
768 which the template is a member, or, for member templates, in the
769 namespace of which the enclosing class or enclosing class
770 template is a member. An explicit specialization of a member
771 function, member class or static data member of a class template
772 shall be declared in the namespace of which the class template is
774 if (current_scope() != DECL_CONTEXT (tmpl
)
775 && !at_namespace_scope_p ())
777 error ("specialization of %qD must appear at namespace scope", tmpl
);
780 if (is_associated_namespace (current_namespace
, tpl_ns
))
781 /* Same or super-using namespace. */
785 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
786 permerror (input_location
, " from definition of %q+#D", tmpl
);
791 /* SPEC is an explicit instantiation. Check that it is valid to
792 perform this explicit instantiation in the current namespace. */
795 check_explicit_instantiation_namespace (tree spec
)
799 /* DR 275: An explicit instantiation shall appear in an enclosing
800 namespace of its template. */
801 ns
= decl_namespace_context (spec
);
802 if (!is_ancestor (current_namespace
, ns
))
803 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
804 "(which does not enclose namespace %qD)",
805 spec
, current_namespace
, ns
);
808 /* The TYPE is being declared. If it is a template type, that means it
809 is a partial specialization. Do appropriate error-checking. */
812 maybe_process_partial_specialization (tree type
)
816 if (type
== error_mark_node
)
817 return error_mark_node
;
819 /* A lambda that appears in specialization context is not itself a
821 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
824 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
826 error ("name of class shadows template template parameter %qD",
828 return error_mark_node
;
831 context
= TYPE_CONTEXT (type
);
833 if (TYPE_ALIAS_P (type
))
835 if (TYPE_TEMPLATE_INFO (type
)
836 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
837 error ("specialization of alias template %qD",
838 TYPE_TI_TEMPLATE (type
));
840 error ("explicit specialization of non-template %qT", type
);
841 return error_mark_node
;
843 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
845 /* This is for ordinary explicit specialization and partial
846 specialization of a template class such as:
848 template <> class C<int>;
852 template <class T> class C<T*>;
854 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
856 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
857 && !COMPLETE_TYPE_P (type
))
859 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
))
860 && !at_namespace_scope_p ())
861 return error_mark_node
;
862 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
863 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
864 if (processing_template_decl
)
866 if (push_template_decl (TYPE_MAIN_DECL (type
))
868 return error_mark_node
;
871 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
872 error ("specialization of %qT after instantiation", type
);
873 else if (errorcount
&& !processing_specialization
874 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
875 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
876 /* Trying to define a specialization either without a template<> header
877 or in an inappropriate place. We've already given an error, so just
878 bail now so we don't actually define the specialization. */
879 return error_mark_node
;
881 else if (CLASS_TYPE_P (type
)
882 && !CLASSTYPE_USE_TEMPLATE (type
)
883 && CLASSTYPE_TEMPLATE_INFO (type
)
884 && context
&& CLASS_TYPE_P (context
)
885 && CLASSTYPE_TEMPLATE_INFO (context
))
887 /* This is for an explicit specialization of member class
888 template according to [temp.expl.spec/18]:
890 template <> template <class U> class C<int>::D;
892 The context `C<int>' must be an implicit instantiation.
893 Otherwise this is just a member class template declared
896 template <> class C<int> { template <class U> class D; };
897 template <> template <class U> class C<int>::D;
899 In the first case, `C<int>::D' is a specialization of `C<T>::D'
900 while in the second case, `C<int>::D' is a primary template
901 and `C<T>::D' may not exist. */
903 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
904 && !COMPLETE_TYPE_P (type
))
907 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
909 if (current_namespace
910 != decl_namespace_context (tmpl
))
912 permerror (input_location
, "specializing %q#T in different namespace", type
);
913 permerror (input_location
, " from definition of %q+#D", tmpl
);
916 /* Check for invalid specialization after instantiation:
918 template <> template <> class C<int>::D<int>;
919 template <> template <class U> class C<int>::D; */
921 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
922 t
; t
= TREE_CHAIN (t
))
924 tree inst
= TREE_VALUE (t
);
925 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
926 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
928 /* We already have a full specialization of this partial
929 instantiation, or a full specialization has been
930 looked up but not instantiated. Reassign it to the
931 new member specialization template. */
936 elt
.tmpl
= most_general_template (tmpl
);
937 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
940 htab_remove_elt (type_specializations
, &elt
);
943 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
945 slot
= htab_find_slot (type_specializations
, &elt
, INSERT
);
946 entry
= ggc_alloc
<spec_entry
> ();
951 /* But if we've had an implicit instantiation, that's a
952 problem ([temp.expl.spec]/6). */
953 error ("specialization %qT after instantiation %qT",
957 /* Mark TYPE as a specialization. And as a result, we only
958 have one level of template argument for the innermost
960 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
961 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
962 CLASSTYPE_TI_ARGS (type
)
963 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
966 else if (processing_specialization
)
968 /* Someday C++0x may allow for enum template specialization. */
969 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
970 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
971 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
972 "of %qD not allowed by ISO C++", type
);
975 error ("explicit specialization of non-template %qT", type
);
976 return error_mark_node
;
983 /* Returns nonzero if we can optimize the retrieval of specializations
984 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
985 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
988 optimize_specialization_lookup_p (tree tmpl
)
990 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
991 && DECL_CLASS_SCOPE_P (tmpl
)
992 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
994 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
995 /* The optimized lookup depends on the fact that the
996 template arguments for the member function template apply
997 purely to the containing class, which is not true if the
998 containing class is an explicit or partial
1000 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1001 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1002 && !DECL_CONV_FN_P (tmpl
)
1003 /* It is possible to have a template that is not a member
1004 template and is not a member of a template class:
1006 template <typename T>
1007 struct S { friend A::f(); };
1009 Here, the friend function is a template, but the context does
1010 not have template information. The optimized lookup relies
1011 on having ARGS be the template arguments for both the class
1012 and the function template. */
1013 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1016 /* Retrieve the specialization (in the sense of [temp.spec] - a
1017 specialization is either an instantiation or an explicit
1018 specialization) of TMPL for the given template ARGS. If there is
1019 no such specialization, return NULL_TREE. The ARGS are a vector of
1020 arguments, or a vector of vectors of arguments, in the case of
1021 templates with more than one level of parameters.
1023 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1024 then we search for a partial specialization matching ARGS. This
1025 parameter is ignored if TMPL is not a class template.
1027 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1028 result is a NONTYPE_ARGUMENT_PACK. */
1031 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1033 if (tmpl
== NULL_TREE
)
1036 if (args
== error_mark_node
)
1039 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1040 || TREE_CODE (tmpl
) == FIELD_DECL
);
1042 /* There should be as many levels of arguments as there are
1043 levels of parameters. */
1044 gcc_assert (TMPL_ARGS_DEPTH (args
)
1045 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1046 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1047 : template_class_depth (DECL_CONTEXT (tmpl
))));
1049 if (optimize_specialization_lookup_p (tmpl
))
1051 tree class_template
;
1052 tree class_specialization
;
1053 vec
<tree
, va_gc
> *methods
;
1057 /* The template arguments actually apply to the containing
1058 class. Find the class specialization with those
1060 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1061 class_specialization
1062 = retrieve_specialization (class_template
, args
, 0);
1063 if (!class_specialization
)
1065 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1066 for the specialization. */
1067 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1070 /* Iterate through the methods with the indicated name, looking
1071 for the one that has an instance of TMPL. */
1072 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1073 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1075 tree fn
= OVL_CURRENT (fns
);
1076 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1077 /* using-declarations can add base methods to the method vec,
1078 and we don't want those here. */
1079 && DECL_CONTEXT (fn
) == class_specialization
)
1088 htab_t specializations
;
1092 elt
.spec
= NULL_TREE
;
1094 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1095 specializations
= type_specializations
;
1097 specializations
= decl_specializations
;
1100 hash
= hash_specialization (&elt
);
1101 found
= (spec_entry
*) htab_find_with_hash (specializations
, &elt
, hash
);
1109 /* Like retrieve_specialization, but for local declarations. */
1112 retrieve_local_specialization (tree tmpl
)
1114 if (local_specializations
== NULL
)
1117 tree
*slot
= local_specializations
->get (tmpl
);
1118 return slot
? *slot
: NULL_TREE
;
1121 /* Returns nonzero iff DECL is a specialization of TMPL. */
1124 is_specialization_of (tree decl
, tree tmpl
)
1128 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1132 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1138 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1140 for (t
= TREE_TYPE (decl
);
1142 t
= CLASSTYPE_USE_TEMPLATE (t
)
1143 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1144 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1151 /* Returns nonzero iff DECL is a specialization of friend declaration
1152 FRIEND_DECL according to [temp.friend]. */
1155 is_specialization_of_friend (tree decl
, tree friend_decl
)
1157 bool need_template
= true;
1160 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1161 || TREE_CODE (decl
) == TYPE_DECL
);
1163 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1164 of a template class, we want to check if DECL is a specialization
1166 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1167 && DECL_TEMPLATE_INFO (friend_decl
)
1168 && !DECL_USE_TEMPLATE (friend_decl
))
1170 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1171 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1172 need_template
= false;
1174 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1175 && !PRIMARY_TEMPLATE_P (friend_decl
))
1176 need_template
= false;
1178 /* There is nothing to do if this is not a template friend. */
1179 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1182 if (is_specialization_of (decl
, friend_decl
))
1186 A member of a class template may be declared to be a friend of a
1187 non-template class. In this case, the corresponding member of
1188 every specialization of the class template is a friend of the
1189 class granting friendship.
1191 For example, given a template friend declaration
1193 template <class T> friend void A<T>::f();
1195 the member function below is considered a friend
1197 template <> struct A<int> {
1201 For this type of template friend, TEMPLATE_DEPTH below will be
1202 nonzero. To determine if DECL is a friend of FRIEND, we first
1203 check if the enclosing class is a specialization of another. */
1205 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1207 && DECL_CLASS_SCOPE_P (decl
)
1208 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1209 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1211 /* Next, we check the members themselves. In order to handle
1212 a few tricky cases, such as when FRIEND_DECL's are
1214 template <class T> friend void A<T>::g(T t);
1215 template <class T> template <T t> friend void A<T>::h();
1219 void A<int>::g(int);
1220 template <int> void A<int>::h();
1222 we need to figure out ARGS, the template arguments from
1223 the context of DECL. This is required for template substitution
1224 of `T' in the function parameter of `g' and template parameter
1225 of `h' in the above examples. Here ARGS corresponds to `int'. */
1227 tree context
= DECL_CONTEXT (decl
);
1228 tree args
= NULL_TREE
;
1229 int current_depth
= 0;
1231 while (current_depth
< template_depth
)
1233 if (CLASSTYPE_TEMPLATE_INFO (context
))
1235 if (current_depth
== 0)
1236 args
= TYPE_TI_ARGS (context
);
1238 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1241 context
= TYPE_CONTEXT (context
);
1244 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1249 tree friend_args_type
;
1250 tree decl_args_type
;
1252 /* Make sure that both DECL and FRIEND_DECL are templates or
1254 is_template
= DECL_TEMPLATE_INFO (decl
)
1255 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1256 if (need_template
^ is_template
)
1258 else if (is_template
)
1260 /* If both are templates, check template parameter list. */
1262 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1264 if (!comp_template_parms
1265 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1269 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1272 decl_type
= TREE_TYPE (decl
);
1274 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1275 tf_none
, NULL_TREE
);
1276 if (friend_type
== error_mark_node
)
1279 /* Check if return types match. */
1280 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1283 /* Check if function parameter types match, ignoring the
1284 `this' parameter. */
1285 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1286 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1287 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1288 friend_args_type
= TREE_CHAIN (friend_args_type
);
1289 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1290 decl_args_type
= TREE_CHAIN (decl_args_type
);
1292 return compparms (decl_args_type
, friend_args_type
);
1296 /* DECL is a TYPE_DECL */
1298 tree decl_type
= TREE_TYPE (decl
);
1300 /* Make sure that both DECL and FRIEND_DECL are templates or
1303 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1304 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1306 if (need_template
^ is_template
)
1308 else if (is_template
)
1311 /* If both are templates, check the name of the two
1312 TEMPLATE_DECL's first because is_friend didn't. */
1313 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1314 != DECL_NAME (friend_decl
))
1317 /* Now check template parameter list. */
1319 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1321 return comp_template_parms
1322 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1326 return (DECL_NAME (decl
)
1327 == DECL_NAME (friend_decl
));
1333 /* Register the specialization SPEC as a specialization of TMPL with
1334 the indicated ARGS. IS_FRIEND indicates whether the specialization
1335 is actually just a friend declaration. Returns SPEC, or an
1336 equivalent prior declaration, if available.
1338 We also store instantiations of field packs in the hash table, even
1339 though they are not themselves templates, to make lookup easier. */
1342 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1349 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1350 || (TREE_CODE (tmpl
) == FIELD_DECL
1351 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1353 if (TREE_CODE (spec
) == FUNCTION_DECL
1354 && uses_template_parms (DECL_TI_ARGS (spec
)))
1355 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1356 register it; we want the corresponding TEMPLATE_DECL instead.
1357 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1358 the more obvious `uses_template_parms (spec)' to avoid problems
1359 with default function arguments. In particular, given
1360 something like this:
1362 template <class T> void f(T t1, T t = T())
1364 the default argument expression is not substituted for in an
1365 instantiation unless and until it is actually needed. */
1368 if (optimize_specialization_lookup_p (tmpl
))
1369 /* We don't put these specializations in the hash table, but we might
1370 want to give an error about a mismatch. */
1371 fn
= retrieve_specialization (tmpl
, args
, 0);
1379 hash
= hash_specialization (&elt
);
1382 htab_find_slot_with_hash (decl_specializations
, &elt
, hash
, INSERT
);
1384 fn
= ((spec_entry
*) *slot
)->spec
;
1389 /* We can sometimes try to re-register a specialization that we've
1390 already got. In particular, regenerate_decl_from_template calls
1391 duplicate_decls which will update the specialization list. But,
1392 we'll still get called again here anyhow. It's more convenient
1393 to simply allow this than to try to prevent it. */
1396 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1398 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1400 if (DECL_ODR_USED (fn
)
1401 || DECL_EXPLICIT_INSTANTIATION (fn
))
1403 error ("specialization of %qD after instantiation",
1405 return error_mark_node
;
1410 /* This situation should occur only if the first
1411 specialization is an implicit instantiation, the
1412 second is an explicit specialization, and the
1413 implicit instantiation has not yet been used. That
1414 situation can occur if we have implicitly
1415 instantiated a member function and then specialized
1418 We can also wind up here if a friend declaration that
1419 looked like an instantiation turns out to be a
1422 template <class T> void foo(T);
1423 class S { friend void foo<>(int) };
1424 template <> void foo(int);
1426 We transform the existing DECL in place so that any
1427 pointers to it become pointers to the updated
1430 If there was a definition for the template, but not
1431 for the specialization, we want this to look as if
1432 there were no definition, and vice versa. */
1433 DECL_INITIAL (fn
) = NULL_TREE
;
1434 duplicate_decls (spec
, fn
, is_friend
);
1435 /* The call to duplicate_decls will have applied
1438 An explicit specialization of a function template
1439 is inline only if it is explicitly declared to be,
1440 and independently of whether its function template
1443 to the primary function; now copy the inline bits to
1444 the various clones. */
1445 FOR_EACH_CLONE (clone
, fn
)
1447 DECL_DECLARED_INLINE_P (clone
)
1448 = DECL_DECLARED_INLINE_P (fn
);
1449 DECL_SOURCE_LOCATION (clone
)
1450 = DECL_SOURCE_LOCATION (fn
);
1451 DECL_DELETED_FN (clone
)
1452 = DECL_DELETED_FN (fn
);
1454 check_specialization_namespace (tmpl
);
1459 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1461 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1462 /* Dup decl failed, but this is a new definition. Set the
1463 line number so any errors match this new
1465 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1471 return duplicate_decls (spec
, fn
, is_friend
);
1473 /* A specialization must be declared in the same namespace as the
1474 template it is specializing. */
1475 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1476 && !check_specialization_namespace (tmpl
))
1477 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1479 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1481 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1482 gcc_assert (tmpl
&& args
&& spec
);
1485 if (TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1486 && PRIMARY_TEMPLATE_P (tmpl
)
1487 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1488 /* TMPL is a forward declaration of a template function; keep a list
1489 of all specializations in case we need to reassign them to a friend
1490 template later in tsubst_friend_function. */
1491 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1492 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1498 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1499 TMPL and ARGS members, ignores SPEC. */
1501 int comparing_specializations
;
1504 eq_specializations (const void *p1
, const void *p2
)
1506 const spec_entry
*e1
= (const spec_entry
*)p1
;
1507 const spec_entry
*e2
= (const spec_entry
*)p2
;
1510 ++comparing_specializations
;
1511 equal
= (e1
->tmpl
== e2
->tmpl
1512 && comp_template_args (e1
->args
, e2
->args
));
1513 --comparing_specializations
;
1518 /* Returns a hash for a template TMPL and template arguments ARGS. */
1521 hash_tmpl_and_args (tree tmpl
, tree args
)
1523 hashval_t val
= DECL_UID (tmpl
);
1524 return iterative_hash_template_arg (args
, val
);
1527 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1531 hash_specialization (const void *p
)
1533 const spec_entry
*e
= (const spec_entry
*)p
;
1534 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1537 /* Recursively calculate a hash value for a template argument ARG, for use
1538 in the hash tables of template specializations. */
1541 iterative_hash_template_arg (tree arg
, hashval_t val
)
1543 unsigned HOST_WIDE_INT i
;
1544 enum tree_code code
;
1547 if (arg
== NULL_TREE
)
1548 return iterative_hash_object (arg
, val
);
1553 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1554 /* We can get one of these when re-hashing a previous entry in the middle
1555 of substituting into a pack expansion. Just look through it. */
1556 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1558 code
= TREE_CODE (arg
);
1559 tclass
= TREE_CODE_CLASS (code
);
1561 val
= iterative_hash_object (code
, val
);
1568 case IDENTIFIER_NODE
:
1569 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1573 int i
, len
= TREE_VEC_LENGTH (arg
);
1574 for (i
= 0; i
< len
; ++i
)
1575 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1579 case TYPE_PACK_EXPANSION
:
1580 case EXPR_PACK_EXPANSION
:
1581 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1582 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1584 case TYPE_ARGUMENT_PACK
:
1585 case NONTYPE_ARGUMENT_PACK
:
1586 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1589 for (; arg
; arg
= TREE_CHAIN (arg
))
1590 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1594 for (; arg
; arg
= OVL_NEXT (arg
))
1595 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1601 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1603 val
= iterative_hash_template_arg (field
, val
);
1604 val
= iterative_hash_template_arg (value
, val
);
1610 if (!DECL_ARTIFICIAL (arg
))
1612 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1613 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1615 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1618 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1621 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1622 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1624 case TEMPLATE_PARM_INDEX
:
1625 val
= iterative_hash_template_arg
1626 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1627 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1628 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1631 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1632 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1633 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1636 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1638 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1642 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1643 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1644 val
= iterative_hash_object (code
, val
);
1645 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1648 /* A lambda can't appear in a template arg, but don't crash on
1650 gcc_assert (seen_error ());
1654 case IMPLICIT_CONV_EXPR
:
1655 case STATIC_CAST_EXPR
:
1656 case REINTERPRET_CAST_EXPR
:
1657 case CONST_CAST_EXPR
:
1658 case DYNAMIC_CAST_EXPR
:
1660 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1661 /* Now hash operands as usual. */
1671 if (TYPE_CANONICAL (arg
))
1672 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1674 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1675 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1676 /* Otherwise just compare the types during lookup. */
1679 case tcc_declaration
:
1681 return iterative_hash_expr (arg
, val
);
1684 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1686 unsigned n
= cp_tree_operand_length (arg
);
1687 for (i
= 0; i
< n
; ++i
)
1688 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1696 /* Unregister the specialization SPEC as a specialization of TMPL.
1697 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1698 if the SPEC was listed as a specialization of TMPL.
1700 Note that SPEC has been ggc_freed, so we can't look inside it. */
1703 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1708 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1709 elt
.args
= TI_ARGS (tinfo
);
1710 elt
.spec
= NULL_TREE
;
1712 entry
= (spec_entry
*) htab_find (decl_specializations
, &elt
);
1715 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1716 gcc_assert (new_spec
!= NULL_TREE
);
1717 entry
->spec
= new_spec
;
1724 /* Like register_specialization, but for local declarations. We are
1725 registering SPEC, an instantiation of TMPL. */
1728 register_local_specialization (tree spec
, tree tmpl
)
1730 local_specializations
->put (tmpl
, spec
);
1733 /* TYPE is a class type. Returns true if TYPE is an explicitly
1734 specialized class. */
1737 explicit_class_specialization_p (tree type
)
1739 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1741 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1744 /* Print the list of functions at FNS, going through all the overloads
1745 for each element of the list. Alternatively, FNS can not be a
1746 TREE_LIST, in which case it will be printed together with all the
1749 MORE and *STR should respectively be FALSE and NULL when the function
1750 is called from the outside. They are used internally on recursive
1751 calls. print_candidates manages the two parameters and leaves NULL
1752 in *STR when it ends. */
1755 print_candidates_1 (tree fns
, bool more
, const char **str
)
1758 char *spaces
= NULL
;
1760 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1761 if (TREE_CODE (fn
) == TREE_LIST
)
1763 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1764 print_candidates_1 (TREE_VALUE (fn2
),
1765 TREE_CHAIN (fn2
) || more
, str
);
1769 tree cand
= OVL_CURRENT (fn
);
1772 /* Pick the prefix string. */
1773 if (!more
&& !OVL_NEXT (fns
))
1775 inform (DECL_SOURCE_LOCATION (cand
),
1776 "candidate is: %#D", cand
);
1780 *str
= _("candidates are:");
1781 spaces
= get_spaces (*str
);
1783 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1784 *str
= spaces
? spaces
: *str
;
1794 /* Print the list of candidate FNS in an error message. FNS can also
1795 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1798 print_candidates (tree fns
)
1800 const char *str
= NULL
;
1801 print_candidates_1 (fns
, false, &str
);
1802 gcc_assert (str
== NULL
);
1805 /* Returns the template (one of the functions given by TEMPLATE_ID)
1806 which can be specialized to match the indicated DECL with the
1807 explicit template args given in TEMPLATE_ID. The DECL may be
1808 NULL_TREE if none is available. In that case, the functions in
1809 TEMPLATE_ID are non-members.
1811 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1812 specialization of a member template.
1814 The TEMPLATE_COUNT is the number of references to qualifying
1815 template classes that appeared in the name of the function. See
1816 check_explicit_specialization for a more accurate description.
1818 TSK indicates what kind of template declaration (if any) is being
1819 declared. TSK_TEMPLATE indicates that the declaration given by
1820 DECL, though a FUNCTION_DECL, has template parameters, and is
1821 therefore a template function.
1823 The template args (those explicitly specified and those deduced)
1824 are output in a newly created vector *TARGS_OUT.
1826 If it is impossible to determine the result, an error message is
1827 issued. The error_mark_node is returned to indicate failure. */
1830 determine_specialization (tree template_id
,
1833 int need_member_template
,
1839 tree explicit_targs
;
1840 tree candidates
= NULL_TREE
;
1841 /* A TREE_LIST of templates of which DECL may be a specialization.
1842 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1843 corresponding TREE_PURPOSE is the set of template arguments that,
1844 when used to instantiate the template, would produce a function
1845 with the signature of DECL. */
1846 tree templates
= NULL_TREE
;
1848 cp_binding_level
*b
;
1850 *targs_out
= NULL_TREE
;
1852 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1853 return error_mark_node
;
1855 /* We shouldn't be specializing a member template of an
1856 unspecialized class template; we already gave an error in
1857 check_specialization_scope, now avoid crashing. */
1858 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
1859 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
1861 gcc_assert (errorcount
);
1862 return error_mark_node
;
1865 fns
= TREE_OPERAND (template_id
, 0);
1866 explicit_targs
= TREE_OPERAND (template_id
, 1);
1868 if (fns
== error_mark_node
)
1869 return error_mark_node
;
1871 /* Check for baselinks. */
1872 if (BASELINK_P (fns
))
1873 fns
= BASELINK_FUNCTIONS (fns
);
1875 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
1877 error ("%qD is not a function template", fns
);
1878 return error_mark_node
;
1880 else if (VAR_P (decl
) && !variable_template_p (fns
))
1882 error ("%qD is not a variable template", fns
);
1883 return error_mark_node
;
1886 /* Count the number of template headers specified for this
1889 for (b
= current_binding_level
;
1890 b
->kind
== sk_template_parms
;
1894 if (variable_template_p (fns
))
1895 templates
= tree_cons (explicit_targs
, fns
, templates
);
1896 else for (; fns
; fns
= OVL_NEXT (fns
))
1898 tree fn
= OVL_CURRENT (fns
);
1900 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1902 tree decl_arg_types
;
1906 /* In case of explicit specialization, we need to check if
1907 the number of template headers appearing in the specialization
1908 is correct. This is usually done in check_explicit_specialization,
1909 but the check done there cannot be exhaustive when specializing
1910 member functions. Consider the following code:
1912 template <> void A<int>::f(int);
1913 template <> template <> void A<int>::f(int);
1915 Assuming that A<int> is not itself an explicit specialization
1916 already, the first line specializes "f" which is a non-template
1917 member function, whilst the second line specializes "f" which
1918 is a template member function. So both lines are syntactically
1919 correct, and check_explicit_specialization does not reject
1922 Here, we can do better, as we are matching the specialization
1923 against the declarations. We count the number of template
1924 headers, and we check if they match TEMPLATE_COUNT + 1
1925 (TEMPLATE_COUNT is the number of qualifying template classes,
1926 plus there must be another header for the member template
1929 Notice that if header_count is zero, this is not a
1930 specialization but rather a template instantiation, so there
1931 is no check we can perform here. */
1932 if (header_count
&& header_count
!= template_count
+ 1)
1935 /* Check that the number of template arguments at the
1936 innermost level for DECL is the same as for FN. */
1937 if (current_binding_level
->kind
== sk_template_parms
1938 && !current_binding_level
->explicit_spec_p
1939 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1940 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1941 (current_template_parms
))))
1944 /* DECL might be a specialization of FN. */
1945 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1946 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1948 /* For a non-static member function, we need to make sure
1949 that the const qualification is the same. Since
1950 get_bindings does not try to merge the "this" parameter,
1951 we must do the comparison explicitly. */
1952 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1953 && !same_type_p (TREE_VALUE (fn_arg_types
),
1954 TREE_VALUE (decl_arg_types
)))
1957 /* Skip the "this" parameter and, for constructors of
1958 classes with virtual bases, the VTT parameter. A
1959 full specialization of a constructor will have a VTT
1960 parameter, but a template never will. */
1962 = skip_artificial_parms_for (decl
, decl_arg_types
);
1964 = skip_artificial_parms_for (fn
, fn_arg_types
);
1966 /* Function templates cannot be specializations; there are
1967 no partial specializations of functions. Therefore, if
1968 the type of DECL does not match FN, there is no
1970 if (tsk
== tsk_template
)
1972 if (compparms (fn_arg_types
, decl_arg_types
))
1973 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1977 /* See whether this function might be a specialization of this
1978 template. Suppress access control because we might be trying
1979 to make this specialization a friend, and we have already done
1980 access control for the declaration of the specialization. */
1981 push_deferring_access_checks (dk_no_check
);
1982 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1983 pop_deferring_access_checks ();
1986 /* We cannot deduce template arguments that when used to
1987 specialize TMPL will produce DECL. */
1990 /* Make sure that the deduced arguments actually work. */
1991 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
1992 if (insttype
== error_mark_node
)
1995 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
1996 if (!compparms (fn_arg_types
, decl_arg_types
))
1999 /* Save this template, and the arguments deduced. */
2000 templates
= tree_cons (targs
, fn
, templates
);
2002 else if (need_member_template
)
2003 /* FN is an ordinary member function, and we need a
2004 specialization of a member template. */
2006 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2007 /* We can get IDENTIFIER_NODEs here in certain erroneous
2010 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2011 /* This is just an ordinary non-member function. Nothing can
2012 be a specialization of that. */
2014 else if (DECL_ARTIFICIAL (fn
))
2015 /* Cannot specialize functions that are created implicitly. */
2019 tree decl_arg_types
;
2021 /* This is an ordinary member function. However, since
2022 we're here, we can assume its enclosing class is a
2023 template class. For example,
2025 template <typename T> struct S { void f(); };
2026 template <> void S<int>::f() {}
2028 Here, S<int>::f is a non-template, but S<int> is a
2029 template class. If FN has the same type as DECL, we
2030 might be in business. */
2032 if (!DECL_TEMPLATE_INFO (fn
))
2033 /* Its enclosing class is an explicit specialization
2034 of a template class. This is not a candidate. */
2037 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2038 TREE_TYPE (TREE_TYPE (fn
))))
2039 /* The return types differ. */
2042 /* Adjust the type of DECL in case FN is a static member. */
2043 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2044 if (DECL_STATIC_FUNCTION_P (fn
)
2045 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2046 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2048 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2051 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2055 if (templates
&& TREE_CHAIN (templates
))
2061 It is possible for a specialization with a given function
2062 signature to be instantiated from more than one function
2063 template. In such cases, explicit specification of the
2064 template arguments must be used to uniquely identify the
2065 function template specialization being specialized.
2067 Note that here, there's no suggestion that we're supposed to
2068 determine which of the candidate templates is most
2069 specialized. However, we, also have:
2073 Partial ordering of overloaded function template
2074 declarations is used in the following contexts to select
2075 the function template to which a function template
2076 specialization refers:
2078 -- when an explicit specialization refers to a function
2081 So, we do use the partial ordering rules, at least for now.
2082 This extension can only serve to make invalid programs valid,
2083 so it's safe. And, there is strong anecdotal evidence that
2084 the committee intended the partial ordering rules to apply;
2085 the EDG front end has that behavior, and John Spicer claims
2086 that the committee simply forgot to delete the wording in
2087 [temp.expl.spec]. */
2088 tree tmpl
= most_specialized_instantiation (templates
);
2089 if (tmpl
!= error_mark_node
)
2092 TREE_CHAIN (templates
) = NULL_TREE
;
2096 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2098 error ("template-id %qD for %q+D does not match any template "
2099 "declaration", template_id
, decl
);
2100 if (header_count
&& header_count
!= template_count
+ 1)
2101 inform (input_location
, "saw %d %<template<>%>, need %d for "
2102 "specializing a member function template",
2103 header_count
, template_count
+ 1);
2104 return error_mark_node
;
2106 else if ((templates
&& TREE_CHAIN (templates
))
2107 || (candidates
&& TREE_CHAIN (candidates
))
2108 || (templates
&& candidates
))
2110 error ("ambiguous template specialization %qD for %q+D",
2112 candidates
= chainon (candidates
, templates
);
2113 print_candidates (candidates
);
2114 return error_mark_node
;
2117 /* We have one, and exactly one, match. */
2120 tree fn
= TREE_VALUE (candidates
);
2121 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2122 /* DECL is a re-declaration or partial instantiation of a template
2124 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2126 /* It was a specialization of an ordinary member function in a
2128 return DECL_TI_TEMPLATE (fn
);
2131 /* It was a specialization of a template. */
2132 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2133 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2135 *targs_out
= copy_node (targs
);
2136 SET_TMPL_ARGS_LEVEL (*targs_out
,
2137 TMPL_ARGS_DEPTH (*targs_out
),
2138 TREE_PURPOSE (templates
));
2141 *targs_out
= TREE_PURPOSE (templates
);
2142 return TREE_VALUE (templates
);
2145 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2146 but with the default argument values filled in from those in the
2150 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2153 tree new_spec_types
;
2158 if (spec_types
== void_list_node
)
2159 return void_list_node
;
2161 /* Substitute into the rest of the list. */
2163 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2164 TREE_CHAIN (tmpl_types
));
2166 /* Add the default argument for this parameter. */
2167 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2168 TREE_VALUE (spec_types
),
2172 /* DECL is an explicit specialization. Replicate default arguments
2173 from the template it specializes. (That way, code like:
2175 template <class T> void f(T = 3);
2176 template <> void f(double);
2179 works, as required.) An alternative approach would be to look up
2180 the correct default arguments at the call-site, but this approach
2181 is consistent with how implicit instantiations are handled. */
2184 copy_default_args_to_explicit_spec (tree decl
)
2189 tree new_spec_types
;
2193 tree object_type
= NULL_TREE
;
2194 tree in_charge
= NULL_TREE
;
2195 tree vtt
= NULL_TREE
;
2197 /* See if there's anything we need to do. */
2198 tmpl
= DECL_TI_TEMPLATE (decl
);
2199 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2200 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2201 if (TREE_PURPOSE (t
))
2206 old_type
= TREE_TYPE (decl
);
2207 spec_types
= TYPE_ARG_TYPES (old_type
);
2209 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2211 /* Remove the this pointer, but remember the object's type for
2213 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2214 spec_types
= TREE_CHAIN (spec_types
);
2215 tmpl_types
= TREE_CHAIN (tmpl_types
);
2217 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2219 /* DECL may contain more parameters than TMPL due to the extra
2220 in-charge parameter in constructors and destructors. */
2221 in_charge
= spec_types
;
2222 spec_types
= TREE_CHAIN (spec_types
);
2224 if (DECL_HAS_VTT_PARM_P (decl
))
2227 spec_types
= TREE_CHAIN (spec_types
);
2231 /* Compute the merged default arguments. */
2233 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2235 /* Compute the new FUNCTION_TYPE. */
2239 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2244 /* Put the in-charge parameter back. */
2245 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2246 TREE_VALUE (in_charge
),
2249 new_type
= build_method_type_directly (object_type
,
2250 TREE_TYPE (old_type
),
2254 new_type
= build_function_type (TREE_TYPE (old_type
),
2256 new_type
= cp_build_type_attribute_variant (new_type
,
2257 TYPE_ATTRIBUTES (old_type
));
2258 new_type
= build_exception_variant (new_type
,
2259 TYPE_RAISES_EXCEPTIONS (old_type
));
2261 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2262 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2264 TREE_TYPE (decl
) = new_type
;
2267 /* Return the number of template headers we expect to see for a definition
2268 or specialization of CTYPE or one of its non-template members. */
2271 num_template_headers_for_class (tree ctype
)
2273 int num_templates
= 0;
2275 while (ctype
&& CLASS_TYPE_P (ctype
))
2277 /* You're supposed to have one `template <...>' for every
2278 template class, but you don't need one for a full
2279 specialization. For example:
2281 template <class T> struct S{};
2282 template <> struct S<int> { void f(); };
2283 void S<int>::f () {}
2285 is correct; there shouldn't be a `template <>' for the
2286 definition of `S<int>::f'. */
2287 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2288 /* If CTYPE does not have template information of any
2289 kind, then it is not a template, nor is it nested
2290 within a template. */
2292 if (explicit_class_specialization_p (ctype
))
2294 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2297 ctype
= TYPE_CONTEXT (ctype
);
2300 return num_templates
;
2303 /* Do a simple sanity check on the template headers that precede the
2304 variable declaration DECL. */
2307 check_template_variable (tree decl
)
2309 tree ctx
= CP_DECL_CONTEXT (decl
);
2310 int wanted
= num_template_headers_for_class (ctx
);
2311 if (!TYPE_P (ctx
) || !CLASSTYPE_TEMPLATE_INFO (ctx
))
2313 if (cxx_dialect
< cxx1y
)
2314 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2315 "variable templates only available with "
2316 "-std=c++1y or -std=gnu++1y");
2318 // Namespace-scope variable templates should have a template header.
2321 if (template_header_count
> wanted
)
2323 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2324 "too many template headers for %D (should be %d)",
2326 if (warned
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2327 inform (DECL_SOURCE_LOCATION (decl
),
2328 "members of an explicitly specialized class are defined "
2329 "without a template header");
2333 /* Check to see if the function just declared, as indicated in
2334 DECLARATOR, and in DECL, is a specialization of a function
2335 template. We may also discover that the declaration is an explicit
2336 instantiation at this point.
2338 Returns DECL, or an equivalent declaration that should be used
2339 instead if all goes well. Issues an error message if something is
2340 amiss. Returns error_mark_node if the error is not easily
2343 FLAGS is a bitmask consisting of the following flags:
2345 2: The function has a definition.
2346 4: The function is a friend.
2348 The TEMPLATE_COUNT is the number of references to qualifying
2349 template classes that appeared in the name of the function. For
2352 template <class T> struct S { void f(); };
2355 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2356 classes are not counted in the TEMPLATE_COUNT, so that in
2358 template <class T> struct S {};
2359 template <> struct S<int> { void f(); }
2360 template <> void S<int>::f();
2362 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2363 invalid; there should be no template <>.)
2365 If the function is a specialization, it is marked as such via
2366 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2367 is set up correctly, and it is added to the list of specializations
2368 for that template. */
2371 check_explicit_specialization (tree declarator
,
2376 int have_def
= flags
& 2;
2377 int is_friend
= flags
& 4;
2378 int specialization
= 0;
2379 int explicit_instantiation
= 0;
2380 int member_specialization
= 0;
2381 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2382 tree dname
= DECL_NAME (decl
);
2387 if (!processing_specialization
)
2390 tsk
= tsk_excessive_parms
;
2393 tsk
= current_tmpl_spec_kind (template_count
);
2398 if (processing_specialization
)
2401 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2403 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2406 /* This could be something like:
2408 template <class T> void f(T);
2409 class S { friend void f<>(int); } */
2413 /* This case handles bogus declarations like template <>
2414 template <class T> void f<int>(); */
2416 error ("template-id %qD in declaration of primary template",
2423 case tsk_invalid_member_spec
:
2424 /* The error has already been reported in
2425 check_specialization_scope. */
2426 return error_mark_node
;
2428 case tsk_invalid_expl_inst
:
2429 error ("template parameter list used in explicit instantiation");
2435 error ("definition provided for explicit instantiation");
2437 explicit_instantiation
= 1;
2440 case tsk_excessive_parms
:
2441 case tsk_insufficient_parms
:
2442 if (tsk
== tsk_excessive_parms
)
2443 error ("too many template parameter lists in declaration of %qD",
2445 else if (template_header_count
)
2446 error("too few template parameter lists in declaration of %qD", decl
);
2448 error("explicit specialization of %qD must be introduced by "
2449 "%<template <>%>", decl
);
2453 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2455 // In cases like template<> constexpr bool v = true;
2456 error ("%qD is not a template variable", dname
);
2460 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2462 member_specialization
= 1;
2468 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2470 /* This case handles bogus declarations like template <>
2471 template <class T> void f<int>(); */
2473 if (uses_template_parms (declarator
))
2474 error ("function template partial specialization %qD "
2475 "is not allowed", declarator
);
2477 error ("template-id %qD in declaration of primary template",
2482 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2483 /* This is a specialization of a member template, without
2484 specialization the containing class. Something like:
2486 template <class T> struct S {
2487 template <class U> void f (U);
2489 template <> template <class U> void S<int>::f(U) {}
2491 That's a specialization -- but of the entire template. */
2499 if ((specialization
|| member_specialization
)
2500 /* This doesn't apply to variable templates. */
2501 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2502 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2504 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2505 for (; t
; t
= TREE_CHAIN (t
))
2506 if (TREE_PURPOSE (t
))
2508 permerror (input_location
,
2509 "default argument specified in explicit specialization");
2514 if (specialization
|| member_specialization
|| explicit_instantiation
)
2516 tree tmpl
= NULL_TREE
;
2517 tree targs
= NULL_TREE
;
2519 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2520 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2524 gcc_assert (identifier_p (declarator
));
2529 /* If there is no class context, the explicit instantiation
2530 must be at namespace scope. */
2531 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2533 /* Find the namespace binding, using the declaration
2535 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2537 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2539 error ("%qD is not a template function", dname
);
2540 fns
= error_mark_node
;
2544 tree fn
= OVL_CURRENT (fns
);
2545 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2546 CP_DECL_CONTEXT (fn
)))
2547 error ("%qD is not declared in %qD",
2548 decl
, current_namespace
);
2552 declarator
= lookup_template_function (fns
, NULL_TREE
);
2555 if (declarator
== error_mark_node
)
2556 return error_mark_node
;
2558 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2560 if (!explicit_instantiation
)
2561 /* A specialization in class scope. This is invalid,
2562 but the error will already have been flagged by
2563 check_specialization_scope. */
2564 return error_mark_node
;
2567 /* It's not valid to write an explicit instantiation in
2570 class C { template void f(); }
2572 This case is caught by the parser. However, on
2575 template class C { void f(); };
2577 (which is invalid) we can get here. The error will be
2584 else if (ctype
!= NULL_TREE
2585 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2587 // Ignore variable templates.
2591 /* Find the list of functions in ctype that have the same
2592 name as the declared function. */
2593 tree name
= TREE_OPERAND (declarator
, 0);
2594 tree fns
= NULL_TREE
;
2597 if (constructor_name_p (name
, ctype
))
2599 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2601 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2602 : !CLASSTYPE_DESTRUCTORS (ctype
))
2604 /* From [temp.expl.spec]:
2606 If such an explicit specialization for the member
2607 of a class template names an implicitly-declared
2608 special member function (clause _special_), the
2609 program is ill-formed.
2611 Similar language is found in [temp.explicit]. */
2612 error ("specialization of implicitly-declared special member function");
2613 return error_mark_node
;
2616 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2619 if (!DECL_CONV_FN_P (decl
))
2621 idx
= lookup_fnfields_1 (ctype
, name
);
2623 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2627 vec
<tree
, va_gc
> *methods
;
2630 /* For a type-conversion operator, we cannot do a
2631 name-based lookup. We might be looking for `operator
2632 int' which will be a specialization of `operator T'.
2633 So, we find *all* the conversion operators, and then
2634 select from them. */
2637 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2639 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2640 methods
->iterate (idx
, &ovl
);
2643 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2644 /* There are no more conversion functions. */
2647 /* Glue all these conversion functions together
2648 with those we already have. */
2649 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2650 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2654 if (fns
== NULL_TREE
)
2656 error ("no member function %qD declared in %qT", name
, ctype
);
2657 return error_mark_node
;
2660 TREE_OPERAND (declarator
, 0) = fns
;
2663 /* Figure out what exactly is being specialized at this point.
2664 Note that for an explicit instantiation, even one for a
2665 member function, we cannot tell apriori whether the
2666 instantiation is for a member template, or just a member
2667 function of a template class. Even if a member template is
2668 being instantiated, the member template arguments may be
2669 elided if they can be deduced from the rest of the
2671 tmpl
= determine_specialization (declarator
, decl
,
2673 member_specialization
,
2677 if (!tmpl
|| tmpl
== error_mark_node
)
2678 /* We couldn't figure out what this declaration was
2680 return error_mark_node
;
2683 tree gen_tmpl
= most_general_template (tmpl
);
2685 if (explicit_instantiation
)
2687 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2688 is done by do_decl_instantiation later. */
2690 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2691 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2693 if (arg_depth
> parm_depth
)
2695 /* If TMPL is not the most general template (for
2696 example, if TMPL is a friend template that is
2697 injected into namespace scope), then there will
2698 be too many levels of TARGS. Remove some of them
2703 new_targs
= make_tree_vec (parm_depth
);
2704 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2705 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2706 = TREE_VEC_ELT (targs
, i
);
2710 return instantiate_template (tmpl
, targs
, tf_error
);
2713 /* If we thought that the DECL was a member function, but it
2714 turns out to be specializing a static member function,
2715 make DECL a static member function as well. */
2716 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2717 && DECL_STATIC_FUNCTION_P (tmpl
)
2718 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2719 revert_static_member_fn (decl
);
2721 /* If this is a specialization of a member template of a
2722 template class, we want to return the TEMPLATE_DECL, not
2723 the specialization of it. */
2724 if (tsk
== tsk_template
)
2726 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2727 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2728 DECL_INITIAL (result
) = NULL_TREE
;
2732 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2733 DECL_SOURCE_LOCATION (result
)
2734 = DECL_SOURCE_LOCATION (decl
);
2735 /* We want to use the argument list specified in the
2736 definition, not in the original declaration. */
2737 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2738 for (parm
= DECL_ARGUMENTS (result
); parm
;
2739 parm
= DECL_CHAIN (parm
))
2740 DECL_CONTEXT (parm
) = result
;
2742 return register_specialization (tmpl
, gen_tmpl
, targs
,
2746 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2747 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2749 /* Inherit default function arguments from the template
2750 DECL is specializing. */
2751 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2752 copy_default_args_to_explicit_spec (decl
);
2754 /* This specialization has the same protection as the
2755 template it specializes. */
2756 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2757 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2759 /* 7.1.1-1 [dcl.stc]
2761 A storage-class-specifier shall not be specified in an
2762 explicit specialization...
2764 The parser rejects these, so unless action is taken here,
2765 explicit function specializations will always appear with
2768 The action recommended by the C++ CWG in response to C++
2769 defect report 605 is to make the storage class and linkage
2770 of the explicit specialization match the templated function:
2772 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2774 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2776 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2777 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2779 /* This specialization has the same linkage and visibility as
2780 the function template it specializes. */
2781 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2782 if (! TREE_PUBLIC (decl
))
2784 DECL_INTERFACE_KNOWN (decl
) = 1;
2785 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2787 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2788 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2790 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2791 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2795 /* If DECL is a friend declaration, declared using an
2796 unqualified name, the namespace associated with DECL may
2797 have been set incorrectly. For example, in:
2799 template <typename T> void f(T);
2801 struct S { friend void f<int>(int); }
2804 we will have set the DECL_CONTEXT for the friend
2805 declaration to N, rather than to the global namespace. */
2806 if (DECL_NAMESPACE_SCOPE_P (decl
))
2807 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2809 if (is_friend
&& !have_def
)
2810 /* This is not really a declaration of a specialization.
2811 It's just the name of an instantiation. But, it's not
2812 a request for an instantiation, either. */
2813 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2814 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
2815 /* A specialization is not necessarily COMDAT. */
2816 DECL_COMDAT (decl
) = DECL_DECLARED_INLINE_P (decl
);
2817 else if (TREE_CODE (decl
) == VAR_DECL
)
2818 DECL_COMDAT (decl
) = false;
2820 /* Register this specialization so that we can find it
2822 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2824 /* A 'structor should already have clones. */
2825 gcc_assert (decl
== error_mark_node
2826 || variable_template_p (tmpl
)
2827 || !(DECL_CONSTRUCTOR_P (decl
)
2828 || DECL_DESTRUCTOR_P (decl
))
2829 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
2836 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2837 parameters. These are represented in the same format used for
2838 DECL_TEMPLATE_PARMS. */
2841 comp_template_parms (const_tree parms1
, const_tree parms2
)
2846 if (parms1
== parms2
)
2849 for (p1
= parms1
, p2
= parms2
;
2850 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2851 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2853 tree t1
= TREE_VALUE (p1
);
2854 tree t2
= TREE_VALUE (p2
);
2857 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2858 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2860 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2863 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2865 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2866 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2868 /* If either of the template parameters are invalid, assume
2869 they match for the sake of error recovery. */
2870 if (error_operand_p (parm1
) || error_operand_p (parm2
))
2873 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2876 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2877 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2878 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2880 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2885 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2886 /* One set of parameters has more parameters lists than the
2893 /* Determine whether PARM is a parameter pack. */
2896 template_parameter_pack_p (const_tree parm
)
2898 /* Determine if we have a non-type template parameter pack. */
2899 if (TREE_CODE (parm
) == PARM_DECL
)
2900 return (DECL_TEMPLATE_PARM_P (parm
)
2901 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2902 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2903 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2905 /* If this is a list of template parameters, we could get a
2906 TYPE_DECL or a TEMPLATE_DECL. */
2907 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2908 parm
= TREE_TYPE (parm
);
2910 /* Otherwise it must be a type template parameter. */
2911 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2912 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2913 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2916 /* Determine if T is a function parameter pack. */
2919 function_parameter_pack_p (const_tree t
)
2921 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2922 return DECL_PACK_P (t
);
2926 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2927 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2930 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2932 if (! primary_func_tmpl_inst
2933 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2934 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2937 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2940 /* Return true iff the function parameter PARAM_DECL was expanded
2941 from the function parameter pack PACK. */
2944 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2946 if (DECL_ARTIFICIAL (param_decl
)
2947 || !function_parameter_pack_p (pack
))
2950 /* The parameter pack and its pack arguments have the same
2952 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2955 /* Determine whether ARGS describes a variadic template args list,
2956 i.e., one that is terminated by a template argument pack. */
2959 template_args_variadic_p (tree args
)
2964 if (args
== NULL_TREE
)
2967 args
= INNERMOST_TEMPLATE_ARGS (args
);
2968 nargs
= TREE_VEC_LENGTH (args
);
2973 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2975 return ARGUMENT_PACK_P (last_parm
);
2978 /* Generate a new name for the parameter pack name NAME (an
2979 IDENTIFIER_NODE) that incorporates its */
2982 make_ith_pack_parameter_name (tree name
, int i
)
2984 /* Munge the name to include the parameter index. */
2985 #define NUMBUF_LEN 128
2986 char numbuf
[NUMBUF_LEN
];
2990 if (name
== NULL_TREE
)
2992 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2993 newname_len
= IDENTIFIER_LENGTH (name
)
2994 + strlen (numbuf
) + 2;
2995 newname
= (char*)alloca (newname_len
);
2996 snprintf (newname
, newname_len
,
2997 "%s#%i", IDENTIFIER_POINTER (name
), i
);
2998 return get_identifier (newname
);
3001 /* Return true if T is a primary function, class or alias template
3005 primary_template_instantiation_p (const_tree t
)
3010 if (TREE_CODE (t
) == FUNCTION_DECL
)
3011 return DECL_LANG_SPECIFIC (t
)
3012 && DECL_TEMPLATE_INSTANTIATION (t
)
3013 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3014 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3015 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3016 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3017 else if (alias_template_specialization_p (t
))
3022 /* Return true if PARM is a template template parameter. */
3025 template_template_parameter_p (const_tree parm
)
3027 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3030 /* Return true iff PARM is a DECL representing a type template
3034 template_type_parameter_p (const_tree parm
)
3037 && (TREE_CODE (parm
) == TYPE_DECL
3038 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3039 && DECL_TEMPLATE_PARM_P (parm
));
3042 /* Return the template parameters of T if T is a
3043 primary template instantiation, NULL otherwise. */
3046 get_primary_template_innermost_parameters (const_tree t
)
3048 tree parms
= NULL
, template_info
= NULL
;
3050 if ((template_info
= get_template_info (t
))
3051 && primary_template_instantiation_p (t
))
3052 parms
= INNERMOST_TEMPLATE_PARMS
3053 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3058 /* Return the template parameters of the LEVELth level from the full list
3059 of template parameters PARMS. */
3062 get_template_parms_at_level (tree parms
, int level
)
3066 || TREE_CODE (parms
) != TREE_LIST
3067 || level
> TMPL_PARMS_DEPTH (parms
))
3070 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3071 if (TMPL_PARMS_DEPTH (p
) == level
)
3077 /* Returns the template arguments of T if T is a template instantiation,
3081 get_template_innermost_arguments (const_tree t
)
3083 tree args
= NULL
, template_info
= NULL
;
3085 if ((template_info
= get_template_info (t
))
3086 && TI_ARGS (template_info
))
3087 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3092 /* Return the argument pack elements of T if T is a template argument pack,
3096 get_template_argument_pack_elems (const_tree t
)
3098 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3099 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3102 return ARGUMENT_PACK_ARGS (t
);
3105 /* Structure used to track the progress of find_parameter_packs_r. */
3106 struct find_parameter_pack_data
3108 /* TREE_LIST that will contain all of the parameter packs found by
3110 tree
* parameter_packs
;
3112 /* Set of AST nodes that have been visited by the traversal. */
3113 hash_set
<tree
> *visited
;
3116 /* Identifies all of the argument packs that occur in a template
3117 argument and appends them to the TREE_LIST inside DATA, which is a
3118 find_parameter_pack_data structure. This is a subroutine of
3119 make_pack_expansion and uses_parameter_packs. */
3121 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3124 struct find_parameter_pack_data
* ppd
=
3125 (struct find_parameter_pack_data
*)data
;
3126 bool parameter_pack_p
= false;
3128 /* Handle type aliases/typedefs. */
3129 if (TYPE_ALIAS_P (t
))
3131 if (TYPE_TEMPLATE_INFO (t
))
3132 cp_walk_tree (&TYPE_TI_ARGS (t
),
3133 &find_parameter_packs_r
,
3139 /* Identify whether this is a parameter pack or not. */
3140 switch (TREE_CODE (t
))
3142 case TEMPLATE_PARM_INDEX
:
3143 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3144 parameter_pack_p
= true;
3147 case TEMPLATE_TYPE_PARM
:
3148 t
= TYPE_MAIN_VARIANT (t
);
3149 case TEMPLATE_TEMPLATE_PARM
:
3150 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3151 parameter_pack_p
= true;
3156 if (DECL_PACK_P (t
))
3158 /* We don't want to walk into the type of a PARM_DECL,
3159 because we don't want to see the type parameter pack. */
3161 parameter_pack_p
= true;
3165 /* Look through a lambda capture proxy to the field pack. */
3167 if (DECL_HAS_VALUE_EXPR_P (t
))
3169 tree v
= DECL_VALUE_EXPR (t
);
3171 &find_parameter_packs_r
,
3178 parameter_pack_p
= true;
3181 /* Not a parameter pack. */
3185 if (parameter_pack_p
)
3187 /* Add this parameter pack to the list. */
3188 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3192 cp_walk_tree (&TYPE_CONTEXT (t
),
3193 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3195 /* This switch statement will return immediately if we don't find a
3197 switch (TREE_CODE (t
))
3199 case TEMPLATE_PARM_INDEX
:
3202 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3203 /* Check the template itself. */
3204 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3205 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3206 /* Check the template arguments. */
3207 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3212 case TEMPLATE_TYPE_PARM
:
3213 case TEMPLATE_TEMPLATE_PARM
:
3220 if (TYPE_PTRMEMFUNC_P (t
))
3226 if (TYPE_TEMPLATE_INFO (t
))
3227 cp_walk_tree (&TYPE_TI_ARGS (t
),
3228 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3235 cp_walk_tree (&TREE_TYPE (t
),
3236 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3240 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3245 case TYPE_PACK_EXPANSION
:
3246 case EXPR_PACK_EXPANSION
:
3251 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3256 case IDENTIFIER_NODE
:
3257 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3269 /* Determines if the expression or type T uses any parameter packs. */
3271 uses_parameter_packs (tree t
)
3273 tree parameter_packs
= NULL_TREE
;
3274 struct find_parameter_pack_data ppd
;
3275 ppd
.parameter_packs
= ¶meter_packs
;
3276 ppd
.visited
= new hash_set
<tree
>;
3277 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3279 return parameter_packs
!= NULL_TREE
;
3282 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3283 representation a base-class initializer into a parameter pack
3284 expansion. If all goes well, the resulting node will be an
3285 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3288 make_pack_expansion (tree arg
)
3291 tree parameter_packs
= NULL_TREE
;
3292 bool for_types
= false;
3293 struct find_parameter_pack_data ppd
;
3295 if (!arg
|| arg
== error_mark_node
)
3298 if (TREE_CODE (arg
) == TREE_LIST
)
3300 /* The only time we will see a TREE_LIST here is for a base
3301 class initializer. In this case, the TREE_PURPOSE will be a
3302 _TYPE node (representing the base class expansion we're
3303 initializing) and the TREE_VALUE will be a TREE_LIST
3304 containing the initialization arguments.
3306 The resulting expansion looks somewhat different from most
3307 expansions. Rather than returning just one _EXPANSION, we
3308 return a TREE_LIST whose TREE_PURPOSE is a
3309 TYPE_PACK_EXPANSION containing the bases that will be
3310 initialized. The TREE_VALUE will be identical to the
3311 original TREE_VALUE, which is a list of arguments that will
3312 be passed to each base. We do not introduce any new pack
3313 expansion nodes into the TREE_VALUE (although it is possible
3314 that some already exist), because the TREE_PURPOSE and
3315 TREE_VALUE all need to be expanded together with the same
3316 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3317 resulting TREE_PURPOSE will mention the parameter packs in
3318 both the bases and the arguments to the bases. */
3321 tree parameter_packs
= NULL_TREE
;
3323 /* Determine which parameter packs will be used by the base
3325 ppd
.visited
= new hash_set
<tree
>;
3326 ppd
.parameter_packs
= ¶meter_packs
;
3327 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3330 if (parameter_packs
== NULL_TREE
)
3332 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3334 return error_mark_node
;
3337 if (TREE_VALUE (arg
) != void_type_node
)
3339 /* Collect the sets of parameter packs used in each of the
3340 initialization arguments. */
3341 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3343 /* Determine which parameter packs will be expanded in this
3345 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3352 /* Create the pack expansion type for the base type. */
3353 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3354 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3355 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3357 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3358 they will rarely be compared to anything. */
3359 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3361 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3364 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3367 /* Build the PACK_EXPANSION_* node. */
3369 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3370 : make_node (EXPR_PACK_EXPANSION
);
3371 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3372 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3374 /* Propagate type and const-expression information. */
3375 TREE_TYPE (result
) = TREE_TYPE (arg
);
3376 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3379 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3380 they will rarely be compared to anything. */
3381 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3383 /* Determine which parameter packs will be expanded. */
3384 ppd
.parameter_packs
= ¶meter_packs
;
3385 ppd
.visited
= new hash_set
<tree
>;
3386 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3389 /* Make sure we found some parameter packs. */
3390 if (parameter_packs
== NULL_TREE
)
3393 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3395 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3396 return error_mark_node
;
3398 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3400 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3405 /* Checks T for any "bare" parameter packs, which have not yet been
3406 expanded, and issues an error if any are found. This operation can
3407 only be done on full expressions or types (e.g., an expression
3408 statement, "if" condition, etc.), because we could have expressions like:
3410 foo(f(g(h(args)))...)
3412 where "args" is a parameter pack. check_for_bare_parameter_packs
3413 should not be called for the subexpressions args, h(args),
3414 g(h(args)), or f(g(h(args))), because we would produce erroneous
3417 Returns TRUE and emits an error if there were bare parameter packs,
3418 returns FALSE otherwise. */
3420 check_for_bare_parameter_packs (tree t
)
3422 tree parameter_packs
= NULL_TREE
;
3423 struct find_parameter_pack_data ppd
;
3425 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3428 if (TREE_CODE (t
) == TYPE_DECL
)
3431 ppd
.parameter_packs
= ¶meter_packs
;
3432 ppd
.visited
= new hash_set
<tree
>;
3433 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3436 if (parameter_packs
)
3438 error ("parameter packs not expanded with %<...%>:");
3439 while (parameter_packs
)
3441 tree pack
= TREE_VALUE (parameter_packs
);
3442 tree name
= NULL_TREE
;
3444 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3445 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3446 name
= TYPE_NAME (pack
);
3447 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3448 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3450 name
= DECL_NAME (pack
);
3453 inform (input_location
, " %qD", name
);
3455 inform (input_location
, " <anonymous>");
3457 parameter_packs
= TREE_CHAIN (parameter_packs
);
3466 /* Expand any parameter packs that occur in the template arguments in
3469 expand_template_argument_pack (tree args
)
3471 tree result_args
= NULL_TREE
;
3472 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3473 int num_result_args
= -1;
3474 int non_default_args_count
= -1;
3476 /* First, determine if we need to expand anything, and the number of
3477 slots we'll need. */
3478 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3480 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3481 if (arg
== NULL_TREE
)
3483 if (ARGUMENT_PACK_P (arg
))
3485 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3486 if (num_result_args
< 0)
3487 num_result_args
= in_arg
+ num_packed
;
3489 num_result_args
+= num_packed
;
3493 if (num_result_args
>= 0)
3498 /* If no expansion is necessary, we're done. */
3499 if (num_result_args
< 0)
3502 /* Expand arguments. */
3503 result_args
= make_tree_vec (num_result_args
);
3504 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3505 non_default_args_count
=
3506 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3507 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3509 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3510 if (ARGUMENT_PACK_P (arg
))
3512 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3513 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3514 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3515 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3516 if (non_default_args_count
> 0)
3517 non_default_args_count
+= num_packed
- 1;
3521 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3525 if (non_default_args_count
>= 0)
3526 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3530 /* Checks if DECL shadows a template parameter.
3532 [temp.local]: A template-parameter shall not be redeclared within its
3533 scope (including nested scopes).
3535 Emits an error and returns TRUE if the DECL shadows a parameter,
3536 returns FALSE otherwise. */
3539 check_template_shadow (tree decl
)
3543 /* If we're not in a template, we can't possibly shadow a template
3545 if (!current_template_parms
)
3548 /* Figure out what we're shadowing. */
3549 if (TREE_CODE (decl
) == OVERLOAD
)
3550 decl
= OVL_CURRENT (decl
);
3551 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3553 /* If there's no previous binding for this name, we're not shadowing
3554 anything, let alone a template parameter. */
3558 /* If we're not shadowing a template parameter, we're done. Note
3559 that OLDDECL might be an OVERLOAD (or perhaps even an
3560 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3562 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3565 /* We check for decl != olddecl to avoid bogus errors for using a
3566 name inside a class. We check TPFI to avoid duplicate errors for
3567 inline member templates. */
3569 || (DECL_TEMPLATE_PARM_P (decl
)
3570 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3573 /* Don't complain about the injected class name, as we've already
3574 complained about the class itself. */
3575 if (DECL_SELF_REFERENCE_P (decl
))
3578 error ("declaration of %q+#D", decl
);
3579 error (" shadows template parm %q+#D", olddecl
);
3583 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3584 ORIG_LEVEL, DECL, and TYPE. */
3587 build_template_parm_index (int index
,
3593 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3594 TEMPLATE_PARM_IDX (t
) = index
;
3595 TEMPLATE_PARM_LEVEL (t
) = level
;
3596 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3597 TEMPLATE_PARM_DECL (t
) = decl
;
3598 TREE_TYPE (t
) = type
;
3599 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3600 TREE_READONLY (t
) = TREE_READONLY (decl
);
3605 /* Find the canonical type parameter for the given template type
3606 parameter. Returns the canonical type parameter, which may be TYPE
3607 if no such parameter existed. */
3610 canonical_type_parameter (tree type
)
3613 int idx
= TEMPLATE_TYPE_IDX (type
);
3614 if (!canonical_template_parms
)
3615 vec_alloc (canonical_template_parms
, idx
+1);
3617 while (canonical_template_parms
->length () <= (unsigned)idx
)
3618 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3620 list
= (*canonical_template_parms
)[idx
];
3621 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3622 list
= TREE_CHAIN (list
);
3625 return TREE_VALUE (list
);
3628 (*canonical_template_parms
)[idx
]
3629 = tree_cons (NULL_TREE
, type
,
3630 (*canonical_template_parms
)[idx
]);
3635 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3636 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3637 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3638 new one is created. */
3641 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3642 tsubst_flags_t complain
)
3644 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3645 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3646 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3647 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3649 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3652 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3653 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3654 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3655 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3656 DECL_ARTIFICIAL (decl
) = 1;
3657 SET_DECL_TEMPLATE_PARM_P (decl
);
3659 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3660 TEMPLATE_PARM_LEVEL (index
) - levels
,
3661 TEMPLATE_PARM_ORIG_LEVEL (index
),
3663 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3664 TEMPLATE_PARM_PARAMETER_PACK (t
)
3665 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3667 /* Template template parameters need this. */
3668 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3669 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3670 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3674 return TEMPLATE_PARM_DESCENDANTS (index
);
3677 /* Process information from new template parameter PARM and append it
3678 to the LIST being built. This new parameter is a non-type
3679 parameter iff IS_NON_TYPE is true. This new parameter is a
3680 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3684 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3685 bool is_non_type
, bool is_parameter_pack
)
3691 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3692 defval
= TREE_PURPOSE (parm
);
3696 tree p
= tree_last (list
);
3698 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3701 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3702 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3704 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3712 parm
= TREE_VALUE (parm
);
3714 SET_DECL_TEMPLATE_PARM_P (parm
);
3716 if (TREE_TYPE (parm
) != error_mark_node
)
3720 The top-level cv-qualifiers on the template-parameter are
3721 ignored when determining its type. */
3722 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3723 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3724 TREE_TYPE (parm
) = error_mark_node
;
3725 else if (uses_parameter_packs (TREE_TYPE (parm
))
3726 && !is_parameter_pack
3727 /* If we're in a nested template parameter list, the template
3728 template parameter could be a parameter pack. */
3729 && processing_template_parmlist
== 1)
3731 /* This template parameter is not a parameter pack, but it
3732 should be. Complain about "bare" parameter packs. */
3733 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3735 /* Recover by calling this a parameter pack. */
3736 is_parameter_pack
= true;
3740 /* A template parameter is not modifiable. */
3741 TREE_CONSTANT (parm
) = 1;
3742 TREE_READONLY (parm
) = 1;
3743 decl
= build_decl (parm_loc
,
3744 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3745 TREE_CONSTANT (decl
) = 1;
3746 TREE_READONLY (decl
) = 1;
3747 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3748 = build_template_parm_index (idx
, processing_template_decl
,
3749 processing_template_decl
,
3750 decl
, TREE_TYPE (parm
));
3752 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3753 = is_parameter_pack
;
3758 parm
= TREE_VALUE (TREE_VALUE (parm
));
3760 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3762 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3763 /* This is for distinguishing between real templates and template
3764 template parameters */
3765 TREE_TYPE (parm
) = t
;
3766 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3771 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3772 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3773 decl
= build_decl (parm_loc
,
3774 TYPE_DECL
, parm
, t
);
3777 TYPE_NAME (t
) = decl
;
3778 TYPE_STUB_DECL (t
) = decl
;
3780 TEMPLATE_TYPE_PARM_INDEX (t
)
3781 = build_template_parm_index (idx
, processing_template_decl
,
3782 processing_template_decl
,
3783 decl
, TREE_TYPE (parm
));
3784 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3785 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3787 DECL_ARTIFICIAL (decl
) = 1;
3788 SET_DECL_TEMPLATE_PARM_P (decl
);
3790 parm
= build_tree_list (defval
, parm
);
3791 return chainon (list
, parm
);
3794 /* The end of a template parameter list has been reached. Process the
3795 tree list into a parameter vector, converting each parameter into a more
3796 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3800 end_template_parm_list (tree parms
)
3804 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3806 current_template_parms
3807 = tree_cons (size_int (processing_template_decl
),
3808 saved_parmlist
, current_template_parms
);
3810 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3812 next
= TREE_CHAIN (parm
);
3813 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3814 TREE_CHAIN (parm
) = NULL_TREE
;
3817 --processing_template_parmlist
;
3819 return saved_parmlist
;
3822 /* end_template_decl is called after a template declaration is seen. */
3825 end_template_decl (void)
3827 reset_specialization ();
3829 if (! processing_template_decl
)
3832 /* This matches the pushlevel in begin_template_parm_list. */
3835 --processing_template_decl
;
3836 current_template_parms
= TREE_CHAIN (current_template_parms
);
3839 /* Takes a TREE_LIST representing a template parameter and convert it
3840 into an argument suitable to be passed to the type substitution
3841 functions. Note that If the TREE_LIST contains an error_mark
3842 node, the returned argument is error_mark_node. */
3845 template_parm_to_arg (tree t
)
3849 || TREE_CODE (t
) != TREE_LIST
)
3852 if (error_operand_p (TREE_VALUE (t
)))
3853 return error_mark_node
;
3857 if (TREE_CODE (t
) == TYPE_DECL
3858 || TREE_CODE (t
) == TEMPLATE_DECL
)
3862 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3864 /* Turn this argument into a TYPE_ARGUMENT_PACK
3865 with a single element, which expands T. */
3866 tree vec
= make_tree_vec (1);
3867 #ifdef ENABLE_CHECKING
3868 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3869 (vec
, TREE_VEC_LENGTH (vec
));
3871 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3873 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3874 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3879 t
= DECL_INITIAL (t
);
3881 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3883 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3884 with a single element, which expands T. */
3885 tree vec
= make_tree_vec (1);
3886 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3887 #ifdef ENABLE_CHECKING
3888 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3889 (vec
, TREE_VEC_LENGTH (vec
));
3891 t
= convert_from_reference (t
);
3892 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3894 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3895 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3896 TREE_TYPE (t
) = type
;
3899 t
= convert_from_reference (t
);
3904 /* Given a set of template parameters, return them as a set of template
3905 arguments. The template parameters are represented as a TREE_VEC, in
3906 the form documented in cp-tree.h for template arguments. */
3909 template_parms_to_args (tree parms
)
3912 tree args
= NULL_TREE
;
3913 int length
= TMPL_PARMS_DEPTH (parms
);
3916 /* If there is only one level of template parameters, we do not
3917 create a TREE_VEC of TREE_VECs. Instead, we return a single
3918 TREE_VEC containing the arguments. */
3920 args
= make_tree_vec (length
);
3922 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3924 tree a
= copy_node (TREE_VALUE (header
));
3927 TREE_TYPE (a
) = NULL_TREE
;
3928 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3929 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3931 #ifdef ENABLE_CHECKING
3932 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3936 TREE_VEC_ELT (args
, --l
) = a
;
3941 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3942 /* This can happen for template parms of a template template
3945 template<template<class T, class U> class TT> struct S;
3947 Consider the level of the parms of TT; T and U both have
3948 level 2; TT has no template parm of level 1. So in this case
3949 the first element of full_template_args is NULL_TREE. If we
3950 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3951 of 2. This will make tsubst wrongly consider that T and U
3952 have level 1. Instead, let's create a dummy vector as the
3953 first element of full_template_args so that TMPL_ARGS_DEPTH
3954 returns the correct depth for args. */
3955 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3959 /* Within the declaration of a template, return the currently active
3960 template parameters as an argument TREE_VEC. */
3963 current_template_args (void)
3965 return template_parms_to_args (current_template_parms
);
3968 /* Update the declared TYPE by doing any lookups which were thought to be
3969 dependent, but are not now that we know the SCOPE of the declarator. */
3972 maybe_update_decl_type (tree orig_type
, tree scope
)
3974 tree type
= orig_type
;
3976 if (type
== NULL_TREE
)
3979 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3980 type
= TREE_TYPE (type
);
3982 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3983 && dependent_type_p (type
)
3984 /* Don't bother building up the args in this case. */
3985 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3987 /* tsubst in the args corresponding to the template parameters,
3988 including auto if present. Most things will be unchanged, but
3989 make_typename_type and tsubst_qualified_id will resolve
3990 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3991 tree args
= current_template_args ();
3992 tree auto_node
= type_uses_auto (type
);
3996 tree auto_vec
= make_tree_vec (1);
3997 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
3998 args
= add_to_template_args (args
, auto_vec
);
4000 pushed
= push_scope (scope
);
4001 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4006 if (type
== error_mark_node
)
4009 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4011 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4014 type
= TYPE_NAME (type
);
4019 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4020 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
4021 a member template. Used by push_template_decl below. */
4024 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4026 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4027 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4028 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4029 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4030 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4035 struct template_parm_data
4037 /* The level of the template parameters we are currently
4041 /* The index of the specialization argument we are currently
4045 /* An array whose size is the number of template parameters. The
4046 elements are nonzero if the parameter has been used in any one
4047 of the arguments processed so far. */
4050 /* An array whose size is the number of template arguments. The
4051 elements are nonzero if the argument makes use of template
4052 parameters of this level. */
4053 int* arg_uses_template_parms
;
4056 /* Subroutine of push_template_decl used to see if each template
4057 parameter in a partial specialization is used in the explicit
4058 argument list. If T is of the LEVEL given in DATA (which is
4059 treated as a template_parm_data*), then DATA->PARMS is marked
4063 mark_template_parm (tree t
, void* data
)
4067 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4069 template_parm_level_and_index (t
, &level
, &idx
);
4071 if (level
== tpd
->level
)
4073 tpd
->parms
[idx
] = 1;
4074 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4077 /* Return zero so that for_each_template_parm will continue the
4078 traversal of the tree; we want to mark *every* template parm. */
4082 /* Process the partial specialization DECL. */
4085 process_partial_specialization (tree decl
)
4087 tree type
= TREE_TYPE (decl
);
4088 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4089 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4090 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4091 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4094 int nargs
= TREE_VEC_LENGTH (inner_args
);
4097 bool did_error_intro
= false;
4098 struct template_parm_data tpd
;
4099 struct template_parm_data tpd2
;
4101 gcc_assert (current_template_parms
);
4103 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4104 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4106 /* We check that each of the template parameters given in the
4107 partial specialization is used in the argument list to the
4108 specialization. For example:
4110 template <class T> struct S;
4111 template <class T> struct S<T*>;
4113 The second declaration is OK because `T*' uses the template
4114 parameter T, whereas
4116 template <class T> struct S<int>;
4118 is no good. Even trickier is:
4129 The S2<T> declaration is actually invalid; it is a
4130 full-specialization. Of course,
4133 struct S2<T (*)(U)>;
4135 or some such would have been OK. */
4136 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4137 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4138 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4140 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4141 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4142 for (i
= 0; i
< nargs
; ++i
)
4144 tpd
.current_arg
= i
;
4145 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4146 &mark_template_parm
,
4149 /*include_nondeduced_p=*/false);
4151 for (i
= 0; i
< ntparms
; ++i
)
4152 if (tpd
.parms
[i
] == 0)
4154 /* One of the template parms was not used in a deduced context in the
4156 if (!did_error_intro
)
4158 error ("template parameters not deducible in "
4159 "partial specialization:");
4160 did_error_intro
= true;
4163 inform (input_location
, " %qD",
4164 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4167 if (did_error_intro
)
4168 return error_mark_node
;
4170 /* [temp.class.spec]
4172 The argument list of the specialization shall not be identical to
4173 the implicit argument list of the primary template. */
4174 if (comp_template_args
4176 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4178 error ("partial specialization %qT does not specialize any template arguments", type
);
4180 /* A partial specialization that replaces multiple parameters of the
4181 primary template with a pack expansion is less specialized for those
4183 if (nargs
< DECL_NTPARMS (maintmpl
))
4185 error ("partial specialization is not more specialized than the "
4186 "primary template because it replaces multiple parameters "
4187 "with a pack expansion");
4188 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4192 /* [temp.class.spec]
4194 A partially specialized non-type argument expression shall not
4195 involve template parameters of the partial specialization except
4196 when the argument expression is a simple identifier.
4198 The type of a template parameter corresponding to a specialized
4199 non-type argument shall not be dependent on a parameter of the
4202 Also, we verify that pack expansions only occur at the
4203 end of the argument list. */
4204 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4206 for (i
= 0; i
< nargs
; ++i
)
4208 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4209 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4210 tree packed_args
= NULL_TREE
;
4213 if (ARGUMENT_PACK_P (arg
))
4215 /* Extract the arguments from the argument pack. We'll be
4216 iterating over these in the following loop. */
4217 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4218 len
= TREE_VEC_LENGTH (packed_args
);
4221 for (j
= 0; j
< len
; j
++)
4224 /* Get the Jth argument in the parameter pack. */
4225 arg
= TREE_VEC_ELT (packed_args
, j
);
4227 if (PACK_EXPANSION_P (arg
))
4229 /* Pack expansions must come at the end of the
4231 if ((packed_args
&& j
< len
- 1)
4232 || (!packed_args
&& i
< nargs
- 1))
4234 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4235 error ("parameter pack argument %qE must be at the "
4236 "end of the template argument list", arg
);
4238 error ("parameter pack argument %qT must be at the "
4239 "end of the template argument list", arg
);
4243 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4244 /* We only care about the pattern. */
4245 arg
= PACK_EXPANSION_PATTERN (arg
);
4247 if (/* These first two lines are the `non-type' bit. */
4249 && TREE_CODE (arg
) != TEMPLATE_DECL
4250 /* This next two lines are the `argument expression is not just a
4251 simple identifier' condition and also the `specialized
4252 non-type argument' bit. */
4253 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4254 && !(REFERENCE_REF_P (arg
)
4255 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4257 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4258 || (packed_args
&& uses_template_parms (arg
)))
4259 error ("template argument %qE involves template parameter(s)",
4263 /* Look at the corresponding template parameter,
4264 marking which template parameters its type depends
4266 tree type
= TREE_TYPE (parm
);
4270 /* We haven't yet initialized TPD2. Do so now. */
4271 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4272 /* The number of parameters here is the number in the
4273 main template, which, as checked in the assertion
4275 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4277 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4280 /* Mark the template parameters. But this time, we're
4281 looking for the template parameters of the main
4282 template, not in the specialization. */
4283 tpd2
.current_arg
= i
;
4284 tpd2
.arg_uses_template_parms
[i
] = 0;
4285 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4286 for_each_template_parm (type
,
4287 &mark_template_parm
,
4290 /*include_nondeduced_p=*/false);
4292 if (tpd2
.arg_uses_template_parms
[i
])
4294 /* The type depended on some template parameters.
4295 If they are fully specialized in the
4296 specialization, that's OK. */
4299 for (j
= 0; j
< nargs
; ++j
)
4300 if (tpd2
.parms
[j
] != 0
4301 && tpd
.arg_uses_template_parms
[j
])
4304 error_n (input_location
, count
,
4305 "type %qT of template argument %qE depends "
4306 "on a template parameter",
4307 "type %qT of template argument %qE depends "
4308 "on template parameters",
4317 /* We should only get here once. */
4318 gcc_assert (!COMPLETE_TYPE_P (type
));
4320 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4321 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4322 TREE_TYPE (tmpl
) = type
;
4323 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4324 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4325 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4326 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4328 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4329 = tree_cons (specargs
, tmpl
,
4330 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4331 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4333 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4334 inst
= TREE_CHAIN (inst
))
4336 tree inst_type
= TREE_VALUE (inst
);
4337 if (COMPLETE_TYPE_P (inst_type
)
4338 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4340 tree spec
= most_specialized_class (inst_type
, tf_none
);
4341 if (spec
&& TREE_TYPE (spec
) == type
)
4342 permerror (input_location
,
4343 "partial specialization of %qT after instantiation "
4344 "of %qT", type
, inst_type
);
4351 /* PARM is a template parameter of some form; return the corresponding
4352 TEMPLATE_PARM_INDEX. */
4355 get_template_parm_index (tree parm
)
4357 if (TREE_CODE (parm
) == PARM_DECL
4358 || TREE_CODE (parm
) == CONST_DECL
)
4359 parm
= DECL_INITIAL (parm
);
4360 else if (TREE_CODE (parm
) == TYPE_DECL
4361 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4362 parm
= TREE_TYPE (parm
);
4363 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4364 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4365 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4366 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4370 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4371 parameter packs used by the template parameter PARM. */
4374 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4376 /* A type parm can't refer to another parm. */
4377 if (TREE_CODE (parm
) == TYPE_DECL
)
4379 else if (TREE_CODE (parm
) == PARM_DECL
)
4381 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4386 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4388 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4389 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4390 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4393 /* PARM is a template parameter pack. Return any parameter packs used in
4394 its type or the type of any of its template parameters. If there are
4395 any such packs, it will be instantiated into a fixed template parameter
4396 list by partial instantiation rather than be fully deduced. */
4399 fixed_parameter_pack_p (tree parm
)
4401 /* This can only be true in a member template. */
4402 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4404 /* This can only be true for a parameter pack. */
4405 if (!template_parameter_pack_p (parm
))
4407 /* A type parm can't refer to another parm. */
4408 if (TREE_CODE (parm
) == TYPE_DECL
)
4411 tree parameter_packs
= NULL_TREE
;
4412 struct find_parameter_pack_data ppd
;
4413 ppd
.parameter_packs
= ¶meter_packs
;
4414 ppd
.visited
= new hash_set
<tree
>;
4416 fixed_parameter_pack_p_1 (parm
, &ppd
);
4419 return parameter_packs
;
4422 /* Check that a template declaration's use of default arguments and
4423 parameter packs is not invalid. Here, PARMS are the template
4424 parameters. IS_PRIMARY is true if DECL is the thing declared by
4425 a primary template. IS_PARTIAL is true if DECL is a partial
4428 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4429 declaration (but not a definition); 1 indicates a declaration, 2
4430 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4431 emitted for extraneous default arguments.
4433 Returns TRUE if there were no errors found, FALSE otherwise. */
4436 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4437 bool is_partial
, int is_friend_decl
)
4440 int last_level_to_check
;
4442 bool no_errors
= true;
4446 A default template-argument shall not be specified in a
4447 function template declaration or a function template definition, nor
4448 in the template-parameter-list of the definition of a member of a
4451 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4452 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4453 /* You can't have a function template declaration in a local
4454 scope, nor you can you define a member of a class template in a
4458 if (TREE_CODE (decl
) == TYPE_DECL
4460 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4461 /* A lambda doesn't have an explicit declaration; don't complain
4462 about the parms of the enclosing class. */
4465 if (current_class_type
4466 && !TYPE_BEING_DEFINED (current_class_type
)
4467 && DECL_LANG_SPECIFIC (decl
)
4468 && DECL_DECLARES_FUNCTION_P (decl
)
4469 /* If this is either a friend defined in the scope of the class
4470 or a member function. */
4471 && (DECL_FUNCTION_MEMBER_P (decl
)
4472 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4473 : DECL_FRIEND_CONTEXT (decl
)
4474 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4476 /* And, if it was a member function, it really was defined in
4477 the scope of the class. */
4478 && (!DECL_FUNCTION_MEMBER_P (decl
)
4479 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4480 /* We already checked these parameters when the template was
4481 declared, so there's no need to do it again now. This function
4482 was defined in class scope, but we're processing its body now
4483 that the class is complete. */
4486 /* Core issue 226 (C++0x only): the following only applies to class
4489 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4493 If a template-parameter has a default template-argument, all
4494 subsequent template-parameters shall have a default
4495 template-argument supplied. */
4496 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4498 tree inner_parms
= TREE_VALUE (parm_level
);
4499 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4500 int seen_def_arg_p
= 0;
4503 for (i
= 0; i
< ntparms
; ++i
)
4505 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4507 if (parm
== error_mark_node
)
4510 if (TREE_PURPOSE (parm
))
4512 else if (seen_def_arg_p
4513 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4515 error ("no default argument for %qD", TREE_VALUE (parm
));
4516 /* For better subsequent error-recovery, we indicate that
4517 there should have been a default argument. */
4518 TREE_PURPOSE (parm
) = error_mark_node
;
4521 else if (!is_partial
4523 /* Don't complain about an enclosing partial
4525 && parm_level
== parms
4526 && TREE_CODE (decl
) == TYPE_DECL
4528 && template_parameter_pack_p (TREE_VALUE (parm
))
4529 /* A fixed parameter pack will be partially
4530 instantiated into a fixed length list. */
4531 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4533 /* A primary class template can only have one
4534 parameter pack, at the end of the template
4537 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4538 error ("parameter pack %qE must be at the end of the"
4539 " template parameter list", TREE_VALUE (parm
));
4541 error ("parameter pack %qT must be at the end of the"
4542 " template parameter list",
4543 TREE_TYPE (TREE_VALUE (parm
)));
4545 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4553 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4557 /* For an ordinary class template, default template arguments are
4558 allowed at the innermost level, e.g.:
4559 template <class T = int>
4561 but, in a partial specialization, they're not allowed even
4562 there, as we have in [temp.class.spec]:
4564 The template parameter list of a specialization shall not
4565 contain default template argument values.
4567 So, for a partial specialization, or for a function template
4568 (in C++98/C++03), we look at all of them. */
4571 /* But, for a primary class template that is not a partial
4572 specialization we look at all template parameters except the
4574 parms
= TREE_CHAIN (parms
);
4576 /* Figure out what error message to issue. */
4577 if (is_friend_decl
== 2)
4578 msg
= G_("default template arguments may not be used in function template "
4579 "friend re-declaration");
4580 else if (is_friend_decl
)
4581 msg
= G_("default template arguments may not be used in function template "
4582 "friend declarations");
4583 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4584 msg
= G_("default template arguments may not be used in function templates "
4585 "without -std=c++11 or -std=gnu++11");
4586 else if (is_partial
)
4587 msg
= G_("default template arguments may not be used in "
4588 "partial specializations");
4590 msg
= G_("default argument for template parameter for class enclosing %qD");
4592 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4593 /* If we're inside a class definition, there's no need to
4594 examine the parameters to the class itself. On the one
4595 hand, they will be checked when the class is defined, and,
4596 on the other, default arguments are valid in things like:
4597 template <class T = double>
4598 struct S { template <class U> void f(U); };
4599 Here the default argument for `S' has no bearing on the
4600 declaration of `f'. */
4601 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4603 /* Check everything. */
4604 last_level_to_check
= 0;
4606 for (parm_level
= parms
;
4607 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4608 parm_level
= TREE_CHAIN (parm_level
))
4610 tree inner_parms
= TREE_VALUE (parm_level
);
4614 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4615 for (i
= 0; i
< ntparms
; ++i
)
4617 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4620 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4625 if (is_friend_decl
== 2)
4632 /* Clear out the default argument so that we are not
4634 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4638 /* At this point, if we're still interested in issuing messages,
4639 they must apply to classes surrounding the object declared. */
4641 msg
= G_("default argument for template parameter for class "
4648 /* Worker for push_template_decl_real, called via
4649 for_each_template_parm. DATA is really an int, indicating the
4650 level of the parameters we are interested in. If T is a template
4651 parameter of that level, return nonzero. */
4654 template_parm_this_level_p (tree t
, void* data
)
4656 int this_level
= *(int *)data
;
4659 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4660 level
= TEMPLATE_PARM_LEVEL (t
);
4662 level
= TEMPLATE_TYPE_LEVEL (t
);
4663 return level
== this_level
;
4666 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4667 parameters given by current_template_args, or reuses a
4668 previously existing one, if appropriate. Returns the DECL, or an
4669 equivalent one, if it is replaced via a call to duplicate_decls.
4671 If IS_FRIEND is true, DECL is a friend declaration. */
4674 push_template_decl_real (tree decl
, bool is_friend
)
4682 int new_template_p
= 0;
4683 /* True if the template is a member template, in the sense of
4685 bool member_template_p
= false;
4687 if (decl
== error_mark_node
|| !current_template_parms
)
4688 return error_mark_node
;
4690 /* See if this is a partial specialization. */
4691 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4692 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4693 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4695 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4699 /* For a friend, we want the context of the friend function, not
4700 the type of which it is a friend. */
4701 ctx
= CP_DECL_CONTEXT (decl
);
4702 else if (CP_DECL_CONTEXT (decl
)
4703 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4704 /* In the case of a virtual function, we want the class in which
4706 ctx
= CP_DECL_CONTEXT (decl
);
4708 /* Otherwise, if we're currently defining some class, the DECL
4709 is assumed to be a member of the class. */
4710 ctx
= current_scope ();
4712 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4715 if (!DECL_CONTEXT (decl
))
4716 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4718 /* See if this is a primary template. */
4719 if (is_friend
&& ctx
4720 && uses_template_parms_level (ctx
, processing_template_decl
))
4721 /* A friend template that specifies a class context, i.e.
4722 template <typename T> friend void A<T>::f();
4726 is_primary
= template_parm_scope_p ();
4730 if (DECL_CLASS_SCOPE_P (decl
))
4731 member_template_p
= true;
4732 if (TREE_CODE (decl
) == TYPE_DECL
4733 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4735 error ("template class without a name");
4736 return error_mark_node
;
4738 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4740 if (DECL_DESTRUCTOR_P (decl
))
4744 A destructor shall not be a member template. */
4745 error ("destructor %qD declared as member template", decl
);
4746 return error_mark_node
;
4748 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4749 && (!prototype_p (TREE_TYPE (decl
))
4750 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4751 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4752 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4753 == void_list_node
)))
4755 /* [basic.stc.dynamic.allocation]
4757 An allocation function can be a function
4758 template. ... Template allocation functions shall
4759 have two or more parameters. */
4760 error ("invalid template declaration of %qD", decl
);
4761 return error_mark_node
;
4764 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4765 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4767 else if (TREE_CODE (decl
) == TYPE_DECL
4768 && TYPE_DECL_ALIAS_P (decl
))
4769 /* alias-declaration */
4770 gcc_assert (!DECL_ARTIFICIAL (decl
));
4771 else if (VAR_P (decl
))
4773 if (!DECL_DECLARED_CONSTEXPR_P (decl
))
4775 sorry ("template declaration of non-constexpr variable %qD",
4777 return error_mark_node
;
4782 error ("template declaration of %q#D", decl
);
4783 return error_mark_node
;
4787 /* Check to see that the rules regarding the use of default
4788 arguments are not being violated. */
4789 check_default_tmpl_args (decl
, current_template_parms
,
4790 is_primary
, is_partial
, /*is_friend_decl=*/0);
4792 /* Ensure that there are no parameter packs in the type of this
4793 declaration that have not been expanded. */
4794 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4796 /* Check each of the arguments individually to see if there are
4797 any bare parameter packs. */
4798 tree type
= TREE_TYPE (decl
);
4799 tree arg
= DECL_ARGUMENTS (decl
);
4800 tree argtype
= TYPE_ARG_TYPES (type
);
4802 while (arg
&& argtype
)
4804 if (!DECL_PACK_P (arg
)
4805 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4807 /* This is a PARM_DECL that contains unexpanded parameter
4808 packs. We have already complained about this in the
4809 check_for_bare_parameter_packs call, so just replace
4810 these types with ERROR_MARK_NODE. */
4811 TREE_TYPE (arg
) = error_mark_node
;
4812 TREE_VALUE (argtype
) = error_mark_node
;
4815 arg
= DECL_CHAIN (arg
);
4816 argtype
= TREE_CHAIN (argtype
);
4819 /* Check for bare parameter packs in the return type and the
4820 exception specifiers. */
4821 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4822 /* Errors were already issued, set return type to int
4823 as the frontend doesn't expect error_mark_node as
4825 TREE_TYPE (type
) = integer_type_node
;
4826 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4827 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4829 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4830 && TYPE_DECL_ALIAS_P (decl
))
4831 ? DECL_ORIGINAL_TYPE (decl
)
4832 : TREE_TYPE (decl
)))
4834 TREE_TYPE (decl
) = error_mark_node
;
4835 return error_mark_node
;
4839 return process_partial_specialization (decl
);
4841 args
= current_template_args ();
4844 || TREE_CODE (ctx
) == FUNCTION_DECL
4845 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4846 || (TREE_CODE (decl
) == TYPE_DECL
4847 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4848 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4850 if (DECL_LANG_SPECIFIC (decl
)
4851 && DECL_TEMPLATE_INFO (decl
)
4852 && DECL_TI_TEMPLATE (decl
))
4853 tmpl
= DECL_TI_TEMPLATE (decl
);
4854 /* If DECL is a TYPE_DECL for a class-template, then there won't
4855 be DECL_LANG_SPECIFIC. The information equivalent to
4856 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4857 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4858 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4859 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4861 /* Since a template declaration already existed for this
4862 class-type, we must be redeclaring it here. Make sure
4863 that the redeclaration is valid. */
4864 redeclare_class_template (TREE_TYPE (decl
),
4865 current_template_parms
);
4866 /* We don't need to create a new TEMPLATE_DECL; just use the
4867 one we already had. */
4868 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4872 tmpl
= build_template_decl (decl
, current_template_parms
,
4876 if (DECL_LANG_SPECIFIC (decl
)
4877 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4879 /* A specialization of a member template of a template
4881 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4882 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4883 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4889 tree a
, t
, current
, parms
;
4891 tree tinfo
= get_template_info (decl
);
4895 error ("template definition of non-template %q#D", decl
);
4896 return error_mark_node
;
4899 tmpl
= TI_TEMPLATE (tinfo
);
4901 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4902 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4903 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4904 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4908 /* The declaration is a specialization of a member
4909 template, declared outside the class. Therefore, the
4910 innermost template arguments will be NULL, so we
4911 replace them with the arguments determined by the
4912 earlier call to check_explicit_specialization. */
4913 args
= DECL_TI_ARGS (decl
);
4916 = build_template_decl (decl
, current_template_parms
,
4918 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4919 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4920 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4921 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4922 DECL_TEMPLATE_INFO (new_tmpl
)
4923 = build_template_info (tmpl
, args
);
4925 register_specialization (new_tmpl
,
4926 most_general_template (tmpl
),
4932 /* Make sure the template headers we got make sense. */
4934 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4935 i
= TMPL_PARMS_DEPTH (parms
);
4936 if (TMPL_ARGS_DEPTH (args
) != i
)
4938 error ("expected %d levels of template parms for %q#D, got %d",
4939 i
, decl
, TMPL_ARGS_DEPTH (args
));
4940 DECL_INTERFACE_KNOWN (decl
) = 1;
4941 return error_mark_node
;
4944 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4946 a
= TMPL_ARGS_LEVEL (args
, i
);
4947 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4949 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4951 if (current
== decl
)
4952 error ("got %d template parameters for %q#D",
4953 TREE_VEC_LENGTH (a
), decl
);
4955 error ("got %d template parameters for %q#T",
4956 TREE_VEC_LENGTH (a
), current
);
4957 error (" but %d required", TREE_VEC_LENGTH (t
));
4958 /* Avoid crash in import_export_decl. */
4959 DECL_INTERFACE_KNOWN (decl
) = 1;
4960 return error_mark_node
;
4963 if (current
== decl
)
4965 else if (current
== NULL_TREE
)
4966 /* Can happen in erroneous input. */
4969 current
= get_containing_scope (current
);
4972 /* Check that the parms are used in the appropriate qualifying scopes
4973 in the declarator. */
4974 if (!comp_template_args
4976 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4979 template arguments to %qD do not match original template %qD",
4980 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4981 if (!uses_template_parms (TI_ARGS (tinfo
)))
4982 inform (input_location
, "use template<> for an explicit specialization");
4983 /* Avoid crash in import_export_decl. */
4984 DECL_INTERFACE_KNOWN (decl
) = 1;
4985 return error_mark_node
;
4989 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4990 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4992 /* Push template declarations for global functions and types. Note
4993 that we do not try to push a global template friend declared in a
4994 template class; such a thing may well depend on the template
4995 parameters of the class. */
4996 if (new_template_p
&& !ctx
4997 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
4999 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5000 if (tmpl
== error_mark_node
)
5001 return error_mark_node
;
5003 /* Hide template friend classes that haven't been declared yet. */
5004 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5006 DECL_ANTICIPATED (tmpl
) = 1;
5007 DECL_FRIEND_P (tmpl
) = 1;
5013 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5016 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5017 if (DECL_CONV_FN_P (tmpl
))
5019 int depth
= TMPL_PARMS_DEPTH (parms
);
5021 /* It is a conversion operator. See if the type converted to
5022 depends on innermost template operands. */
5024 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5026 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5029 /* Give template template parms a DECL_CONTEXT of the template
5030 for which they are a parameter. */
5031 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5032 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5034 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5035 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5036 DECL_CONTEXT (parm
) = tmpl
;
5040 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5041 back to its most general template. If TMPL is a specialization,
5042 ARGS may only have the innermost set of arguments. Add the missing
5043 argument levels if necessary. */
5044 if (DECL_TEMPLATE_INFO (tmpl
))
5045 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5047 info
= build_template_info (tmpl
, args
);
5049 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5050 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5053 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5054 retrofit_lang_decl (decl
);
5055 if (DECL_LANG_SPECIFIC (decl
))
5056 DECL_TEMPLATE_INFO (decl
) = info
;
5059 if (flag_implicit_templates
5061 && VAR_OR_FUNCTION_DECL_P (decl
))
5062 /* Set DECL_COMDAT on template instantiations; if we force
5063 them to be emitted by explicit instantiation or -frepo,
5064 mark_needed will tell cgraph to do the right thing. */
5065 DECL_COMDAT (decl
) = true;
5067 return DECL_TEMPLATE_RESULT (tmpl
);
5071 push_template_decl (tree decl
)
5073 return push_template_decl_real (decl
, false);
5076 /* FN is an inheriting constructor that inherits from the constructor
5077 template INHERITED; turn FN into a constructor template with a matching
5081 add_inherited_template_parms (tree fn
, tree inherited
)
5084 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5085 inner_parms
= copy_node (inner_parms
);
5087 = tree_cons (size_int (processing_template_decl
+ 1),
5088 inner_parms
, current_template_parms
);
5089 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5090 tree args
= template_parms_to_args (parms
);
5091 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5092 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5093 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5094 DECL_ARTIFICIAL (tmpl
) = true;
5095 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5099 /* Called when a class template TYPE is redeclared with the indicated
5100 template PARMS, e.g.:
5102 template <class T> struct S;
5103 template <class T> struct S {}; */
5106 redeclare_class_template (tree type
, tree parms
)
5112 if (!TYPE_TEMPLATE_INFO (type
))
5114 error ("%qT is not a template type", type
);
5118 tmpl
= TYPE_TI_TEMPLATE (type
);
5119 if (!PRIMARY_TEMPLATE_P (tmpl
))
5120 /* The type is nested in some template class. Nothing to worry
5121 about here; there are no new template parameters for the nested
5127 error ("template specifiers not specified in declaration of %qD",
5132 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5133 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5135 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5137 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5138 "redeclared with %d template parameter",
5139 "redeclared with %d template parameters",
5140 TREE_VEC_LENGTH (parms
));
5141 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5142 "previous declaration %q+D used %d template parameter",
5143 "previous declaration %q+D used %d template parameters",
5144 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5148 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5155 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5156 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5159 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5160 if (error_operand_p (tmpl_parm
))
5163 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5164 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5165 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5167 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5169 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5170 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5171 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5172 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5173 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5174 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5175 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5176 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5177 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5179 error ("template parameter %q+#D", tmpl_parm
);
5180 error ("redeclared here as %q#D", parm
);
5184 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5186 /* We have in [temp.param]:
5188 A template-parameter may not be given default arguments
5189 by two different declarations in the same scope. */
5190 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5191 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5192 "original definition appeared here");
5196 if (parm_default
!= NULL_TREE
)
5197 /* Update the previous template parameters (which are the ones
5198 that will really count) with the new default value. */
5199 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5200 else if (tmpl_default
!= NULL_TREE
)
5201 /* Update the new parameters, too; they'll be used as the
5202 parameters for any members. */
5203 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5209 /* Simplify EXPR if it is a non-dependent expression. Returns the
5210 (possibly simplified) expression. */
5213 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5215 if (expr
== NULL_TREE
)
5218 /* If we're in a template, but EXPR isn't value dependent, simplify
5219 it. We're supposed to treat:
5221 template <typename T> void f(T[1 + 1]);
5222 template <typename T> void f(T[2]);
5224 as two declarations of the same function, for example. */
5225 if (processing_template_decl
5226 && !instantiation_dependent_expression_p (expr
)
5227 && potential_constant_expression (expr
))
5229 HOST_WIDE_INT saved_processing_template_decl
;
5231 saved_processing_template_decl
= processing_template_decl
;
5232 processing_template_decl
= 0;
5233 expr
= tsubst_copy_and_build (expr
,
5236 /*in_decl=*/NULL_TREE
,
5237 /*function_p=*/false,
5238 /*integral_constant_expression_p=*/true);
5239 processing_template_decl
= saved_processing_template_decl
;
5245 fold_non_dependent_expr (tree expr
)
5247 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5250 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5251 template declaration, or a TYPE_DECL for an alias declaration. */
5254 alias_type_or_template_p (tree t
)
5258 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5261 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5262 || DECL_ALIAS_TEMPLATE_P (t
));
5265 /* Return TRUE iff is a specialization of an alias template. */
5268 alias_template_specialization_p (const_tree t
)
5274 && TYPE_TEMPLATE_INFO (t
)
5275 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5276 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5279 /* Return the number of innermost template parameters in TMPL. */
5282 num_innermost_template_parms (tree tmpl
)
5284 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5285 return TREE_VEC_LENGTH (parms
);
5288 /* Return either TMPL or another template that it is equivalent to under DR
5289 1286: An alias that just changes the name of a template is equivalent to
5290 the other template. */
5293 get_underlying_template (tree tmpl
)
5295 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5296 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5298 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5299 if (TYPE_TEMPLATE_INFO (result
))
5301 tree sub
= TYPE_TI_TEMPLATE (result
);
5302 if (PRIMARY_TEMPLATE_P (sub
)
5303 && (num_innermost_template_parms (tmpl
)
5304 == num_innermost_template_parms (sub
)))
5306 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5307 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5308 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5310 /* The alias type is equivalent to the pattern of the
5311 underlying template, so strip the alias. */
5321 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5322 must be a function or a pointer-to-function type, as specified
5323 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5324 and check that the resulting function has external linkage. */
5327 convert_nontype_argument_function (tree type
, tree expr
,
5328 tsubst_flags_t complain
)
5332 linkage_kind linkage
;
5334 fn
= instantiate_type (type
, fns
, tf_none
);
5335 if (fn
== error_mark_node
)
5336 return error_mark_node
;
5339 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5340 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5341 if (BASELINK_P (fn_no_ptr
))
5342 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5344 /* [temp.arg.nontype]/1
5346 A template-argument for a non-type, non-template template-parameter
5349 -- the address of an object or function with external [C++11: or
5350 internal] linkage. */
5352 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5354 if (complain
& tf_error
)
5356 error ("%qE is not a valid template argument for type %qT",
5358 if (TYPE_PTR_P (type
))
5359 error ("it must be the address of a function with "
5360 "external linkage");
5362 error ("it must be the name of a function with "
5363 "external linkage");
5368 linkage
= decl_linkage (fn_no_ptr
);
5369 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5371 if (complain
& tf_error
)
5373 if (cxx_dialect
>= cxx11
)
5374 error ("%qE is not a valid template argument for type %qT "
5375 "because %qD has no linkage",
5376 expr
, type
, fn_no_ptr
);
5378 error ("%qE is not a valid template argument for type %qT "
5379 "because %qD does not have external linkage",
5380 expr
, type
, fn_no_ptr
);
5388 /* Subroutine of convert_nontype_argument.
5389 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5390 Emit an error otherwise. */
5393 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5394 tsubst_flags_t complain
)
5397 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5399 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5401 if (processing_template_decl
5402 && TREE_CODE (expr
) == ADDR_EXPR
5403 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5405 if (complain
& tf_error
)
5407 error ("%qE is not a valid template argument for type %qT",
5409 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5414 /* Returns TRUE iff the address of OP is value-dependent.
5416 14.6.2.4 [temp.dep.temp]:
5417 A non-integral non-type template-argument is dependent if its type is
5418 dependent or it has either of the following forms
5421 and contains a nested-name-specifier which specifies a class-name that
5422 names a dependent type.
5424 We generalize this to just say that the address of a member of a
5425 dependent class is value-dependent; the above doesn't cover the
5426 address of a static data member named with an unqualified-id. */
5429 has_value_dependent_address (tree op
)
5431 /* We could use get_inner_reference here, but there's no need;
5432 this is only relevant for template non-type arguments, which
5433 can only be expressed as &id-expression. */
5436 tree ctx
= CP_DECL_CONTEXT (op
);
5437 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5444 /* The next set of functions are used for providing helpful explanatory
5445 diagnostics for failed overload resolution. Their messages should be
5446 indented by two spaces for consistency with the messages in
5450 unify_success (bool /*explain_p*/)
5456 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5459 inform (input_location
,
5460 " couldn't deduce template parameter %qD", parm
);
5465 unify_invalid (bool /*explain_p*/)
5471 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5474 inform (input_location
,
5475 " types %qT and %qT have incompatible cv-qualifiers",
5481 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5484 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5489 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5492 inform (input_location
,
5493 " template parameter %qD is not a parameter pack, but "
5500 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5503 inform (input_location
,
5504 " template argument %qE does not match "
5505 "pointer-to-member constant %qE",
5511 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5514 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5519 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5522 inform (input_location
,
5523 " inconsistent parameter pack deduction with %qT and %qT",
5529 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5534 inform (input_location
,
5535 " deduced conflicting types for parameter %qT (%qT and %qT)",
5536 parm
, first
, second
);
5538 inform (input_location
,
5539 " deduced conflicting values for non-type parameter "
5540 "%qE (%qE and %qE)", parm
, first
, second
);
5546 unify_vla_arg (bool explain_p
, tree arg
)
5549 inform (input_location
,
5550 " variable-sized array type %qT is not "
5551 "a valid template argument",
5557 unify_method_type_error (bool explain_p
, tree arg
)
5560 inform (input_location
,
5561 " member function type %qT is not a valid template argument",
5567 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
5572 inform_n (input_location
, wanted
,
5573 " candidate expects at least %d argument, %d provided",
5574 " candidate expects at least %d arguments, %d provided",
5577 inform_n (input_location
, wanted
,
5578 " candidate expects %d argument, %d provided",
5579 " candidate expects %d arguments, %d provided",
5586 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5588 return unify_arity (explain_p
, have
, wanted
);
5592 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
5593 bool least_p
= false)
5595 return unify_arity (explain_p
, have
, wanted
, least_p
);
5599 unify_arg_conversion (bool explain_p
, tree to_type
,
5600 tree from_type
, tree arg
)
5603 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5604 " cannot convert %qE (type %qT) to type %qT",
5605 arg
, from_type
, to_type
);
5610 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5611 tree parm
, tree arg
)
5616 case tbr_ambiguous_baseclass
:
5617 inform (input_location
, " %qT is an ambiguous base class of %qT",
5621 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5628 unify_inconsistent_template_template_parameters (bool explain_p
)
5631 inform (input_location
,
5632 " template parameters of a template template argument are "
5633 "inconsistent with other deduced template arguments");
5638 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5641 inform (input_location
,
5642 " can't deduce a template for %qT from non-template type %qT",
5648 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5651 inform (input_location
,
5652 " template argument %qE does not match %qD", arg
, parm
);
5657 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5660 inform (input_location
,
5661 " could not resolve address from overloaded function %qE",
5666 /* Attempt to convert the non-type template parameter EXPR to the
5667 indicated TYPE. If the conversion is successful, return the
5668 converted value. If the conversion is unsuccessful, return
5669 NULL_TREE if we issued an error message, or error_mark_node if we
5670 did not. We issue error messages for out-and-out bad template
5671 parameters, but not simply because the conversion failed, since we
5672 might be just trying to do argument deduction. Both TYPE and EXPR
5673 must be non-dependent.
5675 The conversion follows the special rules described in
5676 [temp.arg.nontype], and it is much more strict than an implicit
5679 This function is called twice for each template argument (see
5680 lookup_template_class for a more accurate description of this
5681 problem). This means that we need to handle expressions which
5682 are not valid in a C++ source, but can be created from the
5683 first call (for instance, casts to perform conversions). These
5684 hacks can go away after we fix the double coercion problem. */
5687 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5691 /* Detect immediately string literals as invalid non-type argument.
5692 This special-case is not needed for correctness (we would easily
5693 catch this later), but only to provide better diagnostic for this
5694 common user mistake. As suggested by DR 100, we do not mention
5695 linkage issues in the diagnostic as this is not the point. */
5696 /* FIXME we're making this OK. */
5697 if (TREE_CODE (expr
) == STRING_CST
)
5699 if (complain
& tf_error
)
5700 error ("%qE is not a valid template argument for type %qT "
5701 "because string literals can never be used in this context",
5706 /* Add the ADDR_EXPR now for the benefit of
5707 value_dependent_expression_p. */
5708 if (TYPE_PTROBV_P (type
)
5709 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5711 expr
= decay_conversion (expr
, complain
);
5712 if (expr
== error_mark_node
)
5713 return error_mark_node
;
5716 /* If we are in a template, EXPR may be non-dependent, but still
5717 have a syntactic, rather than semantic, form. For example, EXPR
5718 might be a SCOPE_REF, rather than the VAR_DECL to which the
5719 SCOPE_REF refers. Preserving the qualifying scope is necessary
5720 so that access checking can be performed when the template is
5721 instantiated -- but here we need the resolved form so that we can
5722 convert the argument. */
5723 if (TYPE_REF_OBJ_P (type
)
5724 && has_value_dependent_address (expr
))
5725 /* If we want the address and it's value-dependent, don't fold. */;
5726 else if (!type_unknown_p (expr
))
5727 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5728 if (error_operand_p (expr
))
5729 return error_mark_node
;
5730 expr_type
= TREE_TYPE (expr
);
5731 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5732 expr
= mark_lvalue_use (expr
);
5734 expr
= mark_rvalue_use (expr
);
5736 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5737 to a non-type argument of "nullptr". */
5738 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5739 expr
= convert (type
, expr
);
5741 /* In C++11, integral or enumeration non-type template arguments can be
5742 arbitrary constant expressions. Pointer and pointer to
5743 member arguments can be general constant expressions that evaluate
5744 to a null value, but otherwise still need to be of a specific form. */
5745 if (cxx_dialect
>= cxx11
)
5747 if (TREE_CODE (expr
) == PTRMEM_CST
)
5748 /* A PTRMEM_CST is already constant, and a valid template
5749 argument for a parameter of pointer to member type, we just want
5750 to leave it in that form rather than lower it to a
5752 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5753 expr
= maybe_constant_value (expr
);
5754 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5756 tree folded
= maybe_constant_value (expr
);
5757 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5758 : null_member_pointer_value_p (folded
))
5763 /* HACK: Due to double coercion, we can get a
5764 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5765 which is the tree that we built on the first call (see
5766 below when coercing to reference to object or to reference to
5767 function). We just strip everything and get to the arg.
5768 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5770 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5772 tree probe_type
, probe
= expr
;
5773 if (REFERENCE_REF_P (probe
))
5774 probe
= TREE_OPERAND (probe
, 0);
5775 probe_type
= TREE_TYPE (probe
);
5776 if (TREE_CODE (probe
) == NOP_EXPR
)
5778 /* ??? Maybe we could use convert_from_reference here, but we
5779 would need to relax its constraints because the NOP_EXPR
5780 could actually change the type to something more cv-qualified,
5781 and this is not folded by convert_from_reference. */
5782 tree addr
= TREE_OPERAND (probe
, 0);
5783 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5784 && TREE_CODE (addr
) == ADDR_EXPR
5785 && TYPE_PTR_P (TREE_TYPE (addr
))
5786 && (same_type_ignoring_top_level_qualifiers_p
5787 (TREE_TYPE (probe_type
),
5788 TREE_TYPE (TREE_TYPE (addr
)))))
5790 expr
= TREE_OPERAND (addr
, 0);
5791 expr_type
= TREE_TYPE (probe_type
);
5796 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5797 parameter is a pointer to object, through decay and
5798 qualification conversion. Let's strip everything. */
5799 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5803 if (TREE_CODE (probe
) == ADDR_EXPR
5804 && TYPE_PTR_P (TREE_TYPE (probe
)))
5806 /* Skip the ADDR_EXPR only if it is part of the decay for
5807 an array. Otherwise, it is part of the original argument
5808 in the source code. */
5809 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5810 probe
= TREE_OPERAND (probe
, 0);
5812 expr_type
= TREE_TYPE (expr
);
5816 /* [temp.arg.nontype]/5, bullet 1
5818 For a non-type template-parameter of integral or enumeration type,
5819 integral promotions (_conv.prom_) and integral conversions
5820 (_conv.integral_) are applied. */
5821 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5823 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5824 t
= maybe_constant_value (t
);
5825 if (t
!= error_mark_node
)
5828 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5829 return error_mark_node
;
5831 /* Notice that there are constant expressions like '4 % 0' which
5832 do not fold into integer constants. */
5833 if (TREE_CODE (expr
) != INTEGER_CST
)
5835 if (complain
& tf_error
)
5837 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5838 if (processing_template_decl
5839 && !require_potential_constant_expression (expr
))
5841 expr
= cxx_constant_value (expr
);
5842 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5843 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
5844 "in template argument for type %qT ", type
);
5845 if (expr
== error_mark_node
)
5847 /* else cxx_constant_value complained but gave us
5848 a real constant, so go ahead. */
5849 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5855 /* Avoid typedef problems. */
5856 if (TREE_TYPE (expr
) != type
)
5857 expr
= fold_convert (type
, expr
);
5859 /* [temp.arg.nontype]/5, bullet 2
5861 For a non-type template-parameter of type pointer to object,
5862 qualification conversions (_conv.qual_) and the array-to-pointer
5863 conversion (_conv.array_) are applied. */
5864 else if (TYPE_PTROBV_P (type
))
5866 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5868 A template-argument for a non-type, non-template template-parameter
5869 shall be one of: [...]
5871 -- the name of a non-type template-parameter;
5872 -- the address of an object or function with external linkage, [...]
5873 expressed as "& id-expression" where the & is optional if the name
5874 refers to a function or array, or if the corresponding
5875 template-parameter is a reference.
5877 Here, we do not care about functions, as they are invalid anyway
5878 for a parameter of type pointer-to-object. */
5880 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5881 /* Non-type template parameters are OK. */
5883 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5884 /* Null pointer values are OK in C++11. */;
5885 else if (TREE_CODE (expr
) != ADDR_EXPR
5886 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5890 if (complain
& tf_error
)
5891 error ("%qD is not a valid template argument "
5892 "because %qD is a variable, not the address of "
5893 "a variable", expr
, expr
);
5896 if (POINTER_TYPE_P (expr_type
))
5898 if (complain
& tf_error
)
5899 error ("%qE is not a valid template argument for %qT "
5900 "because it is not the address of a variable",
5904 /* Other values, like integer constants, might be valid
5905 non-type arguments of some other type. */
5906 return error_mark_node
;
5912 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5913 ? TREE_OPERAND (expr
, 0) : expr
);
5916 if (complain
& tf_error
)
5917 error ("%qE is not a valid template argument of type %qT "
5918 "because %qE is not a variable", expr
, type
, decl
);
5921 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5923 if (complain
& tf_error
)
5924 error ("%qE is not a valid template argument of type %qT "
5925 "because %qD does not have external linkage",
5929 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
5931 if (complain
& tf_error
)
5932 error ("%qE is not a valid template argument of type %qT "
5933 "because %qD has no linkage", expr
, type
, decl
);
5938 expr
= decay_conversion (expr
, complain
);
5939 if (expr
== error_mark_node
)
5940 return error_mark_node
;
5942 expr
= perform_qualification_conversions (type
, expr
);
5943 if (expr
== error_mark_node
)
5944 return error_mark_node
;
5946 /* [temp.arg.nontype]/5, bullet 3
5948 For a non-type template-parameter of type reference to object, no
5949 conversions apply. The type referred to by the reference may be more
5950 cv-qualified than the (otherwise identical) type of the
5951 template-argument. The template-parameter is bound directly to the
5952 template-argument, which must be an lvalue. */
5953 else if (TYPE_REF_OBJ_P (type
))
5955 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5957 return error_mark_node
;
5959 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5961 if (complain
& tf_error
)
5962 error ("%qE is not a valid template argument for type %qT "
5963 "because of conflicts in cv-qualification", expr
, type
);
5967 if (!real_lvalue_p (expr
))
5969 if (complain
& tf_error
)
5970 error ("%qE is not a valid template argument for type %qT "
5971 "because it is not an lvalue", expr
, type
);
5975 /* [temp.arg.nontype]/1
5977 A template-argument for a non-type, non-template template-parameter
5978 shall be one of: [...]
5980 -- the address of an object or function with external linkage. */
5981 if (INDIRECT_REF_P (expr
)
5982 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5984 expr
= TREE_OPERAND (expr
, 0);
5987 if (complain
& tf_error
)
5988 error ("%q#D is not a valid template argument for type %qT "
5989 "because a reference variable does not have a constant "
5990 "address", expr
, type
);
5997 if (complain
& tf_error
)
5998 error ("%qE is not a valid template argument for type %qT "
5999 "because it is not an object with external linkage",
6004 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
6006 if (complain
& tf_error
)
6007 error ("%qE is not a valid template argument for type %qT "
6008 "because object %qD has not external linkage",
6013 expr
= build_nop (type
, build_address (expr
));
6015 /* [temp.arg.nontype]/5, bullet 4
6017 For a non-type template-parameter of type pointer to function, only
6018 the function-to-pointer conversion (_conv.func_) is applied. If the
6019 template-argument represents a set of overloaded functions (or a
6020 pointer to such), the matching function is selected from the set
6022 else if (TYPE_PTRFN_P (type
))
6024 /* If the argument is a template-id, we might not have enough
6025 context information to decay the pointer. */
6026 if (!type_unknown_p (expr_type
))
6028 expr
= decay_conversion (expr
, complain
);
6029 if (expr
== error_mark_node
)
6030 return error_mark_node
;
6033 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6034 /* Null pointer values are OK in C++11. */
6035 return perform_qualification_conversions (type
, expr
);
6037 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6038 if (!expr
|| expr
== error_mark_node
)
6041 /* [temp.arg.nontype]/5, bullet 5
6043 For a non-type template-parameter of type reference to function, no
6044 conversions apply. If the template-argument represents a set of
6045 overloaded functions, the matching function is selected from the set
6047 else if (TYPE_REFFN_P (type
))
6049 if (TREE_CODE (expr
) == ADDR_EXPR
)
6051 if (complain
& tf_error
)
6053 error ("%qE is not a valid template argument for type %qT "
6054 "because it is a pointer", expr
, type
);
6055 inform (input_location
, "try using %qE instead",
6056 TREE_OPERAND (expr
, 0));
6061 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6062 if (!expr
|| expr
== error_mark_node
)
6065 expr
= build_nop (type
, build_address (expr
));
6067 /* [temp.arg.nontype]/5, bullet 6
6069 For a non-type template-parameter of type pointer to member function,
6070 no conversions apply. If the template-argument represents a set of
6071 overloaded member functions, the matching member function is selected
6072 from the set (_over.over_). */
6073 else if (TYPE_PTRMEMFUNC_P (type
))
6075 expr
= instantiate_type (type
, expr
, tf_none
);
6076 if (expr
== error_mark_node
)
6077 return error_mark_node
;
6079 /* [temp.arg.nontype] bullet 1 says the pointer to member
6080 expression must be a pointer-to-member constant. */
6081 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6082 return error_mark_node
;
6084 /* There is no way to disable standard conversions in
6085 resolve_address_of_overloaded_function (called by
6086 instantiate_type). It is possible that the call succeeded by
6087 converting &B::I to &D::I (where B is a base of D), so we need
6088 to reject this conversion here.
6090 Actually, even if there was a way to disable standard conversions,
6091 it would still be better to reject them here so that we can
6092 provide a superior diagnostic. */
6093 if (!same_type_p (TREE_TYPE (expr
), type
))
6095 if (complain
& tf_error
)
6097 error ("%qE is not a valid template argument for type %qT "
6098 "because it is of type %qT", expr
, type
,
6100 /* If we are just one standard conversion off, explain. */
6101 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6102 inform (input_location
,
6103 "standard conversions are not allowed in this context");
6108 /* [temp.arg.nontype]/5, bullet 7
6110 For a non-type template-parameter of type pointer to data member,
6111 qualification conversions (_conv.qual_) are applied. */
6112 else if (TYPE_PTRDATAMEM_P (type
))
6114 /* [temp.arg.nontype] bullet 1 says the pointer to member
6115 expression must be a pointer-to-member constant. */
6116 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6117 return error_mark_node
;
6119 expr
= perform_qualification_conversions (type
, expr
);
6120 if (expr
== error_mark_node
)
6123 else if (NULLPTR_TYPE_P (type
))
6125 if (expr
!= nullptr_node
)
6127 if (complain
& tf_error
)
6128 error ("%qE is not a valid template argument for type %qT "
6129 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6134 /* A template non-type parameter must be one of the above. */
6138 /* Sanity check: did we actually convert the argument to the
6140 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6141 (type
, TREE_TYPE (expr
)));
6145 /* Subroutine of coerce_template_template_parms, which returns 1 if
6146 PARM_PARM and ARG_PARM match using the rule for the template
6147 parameters of template template parameters. Both PARM and ARG are
6148 template parameters; the rest of the arguments are the same as for
6149 coerce_template_template_parms.
6152 coerce_template_template_parm (tree parm
,
6154 tsubst_flags_t complain
,
6158 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6159 || parm
== NULL_TREE
|| error_operand_p (parm
))
6162 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6165 switch (TREE_CODE (parm
))
6168 /* We encounter instantiations of templates like
6169 template <template <template <class> class> class TT>
6172 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6173 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6175 if (!coerce_template_template_parms
6176 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6182 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6183 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6184 /* Argument is a parameter pack but parameter is not. */
6189 /* The tsubst call is used to handle cases such as
6191 template <int> class C {};
6192 template <class T, template <T> class TT> class D {};
6195 i.e. the parameter list of TT depends on earlier parameters. */
6196 if (!uses_template_parms (TREE_TYPE (arg
))
6198 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6202 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6203 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6204 /* Argument is a parameter pack but parameter is not. */
6217 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6218 template template parameters. Both PARM_PARMS and ARG_PARMS are
6219 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6222 Consider the example:
6223 template <class T> class A;
6224 template<template <class U> class TT> class B;
6226 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6227 the parameters to A, and OUTER_ARGS contains A. */
6230 coerce_template_template_parms (tree parm_parms
,
6232 tsubst_flags_t complain
,
6236 int nparms
, nargs
, i
;
6240 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6241 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6243 nparms
= TREE_VEC_LENGTH (parm_parms
);
6244 nargs
= TREE_VEC_LENGTH (arg_parms
);
6246 /* Determine whether we have a parameter pack at the end of the
6247 template template parameter's template parameter list. */
6248 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6250 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6252 if (error_operand_p (parm
))
6255 switch (TREE_CODE (parm
))
6259 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6264 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6274 && !(variadic_p
&& nargs
>= nparms
- 1))
6277 /* Check all of the template parameters except the parameter pack at
6278 the end (if any). */
6279 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6281 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6282 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6285 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6286 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6288 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6296 /* Check each of the template parameters in the template
6297 argument against the template parameter pack at the end of
6298 the template template parameter. */
6299 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6302 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6304 for (; i
< nargs
; ++i
)
6306 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6309 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6311 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6320 /* Verifies that the deduced template arguments (in TARGS) for the
6321 template template parameters (in TPARMS) represent valid bindings,
6322 by comparing the template parameter list of each template argument
6323 to the template parameter list of its corresponding template
6324 template parameter, in accordance with DR150. This
6325 routine can only be called after all template arguments have been
6326 deduced. It will return TRUE if all of the template template
6327 parameter bindings are okay, FALSE otherwise. */
6329 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6331 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6334 /* We're dealing with template parms in this process. */
6335 ++processing_template_decl
;
6337 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6339 for (i
= 0; i
< ntparms
; ++i
)
6341 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6342 tree targ
= TREE_VEC_ELT (targs
, i
);
6344 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6346 tree packed_args
= NULL_TREE
;
6349 if (ARGUMENT_PACK_P (targ
))
6351 /* Look inside the argument pack. */
6352 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6353 len
= TREE_VEC_LENGTH (packed_args
);
6356 for (idx
= 0; idx
< len
; ++idx
)
6358 tree targ_parms
= NULL_TREE
;
6361 /* Extract the next argument from the argument
6363 targ
= TREE_VEC_ELT (packed_args
, idx
);
6365 if (PACK_EXPANSION_P (targ
))
6366 /* Look at the pattern of the pack expansion. */
6367 targ
= PACK_EXPANSION_PATTERN (targ
);
6369 /* Extract the template parameters from the template
6371 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6372 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6373 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6374 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6376 /* Verify that we can coerce the template template
6377 parameters from the template argument to the template
6378 parameter. This requires an exact match. */
6380 && !coerce_template_template_parms
6381 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6396 --processing_template_decl
;
6400 /* Since type attributes aren't mangled, we need to strip them from
6401 template type arguments. */
6404 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6407 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6409 mv
= TYPE_MAIN_VARIANT (arg
);
6410 arg
= strip_typedefs (arg
);
6411 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6412 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6414 if (complain
& tf_warning
)
6415 warning (0, "ignoring attributes on template argument %qT", arg
);
6416 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6417 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6422 /* Convert the indicated template ARG as necessary to match the
6423 indicated template PARM. Returns the converted ARG, or
6424 error_mark_node if the conversion was unsuccessful. Error and
6425 warning messages are issued under control of COMPLAIN. This
6426 conversion is for the Ith parameter in the parameter list. ARGS is
6427 the full set of template arguments deduced so far. */
6430 convert_template_argument (tree parm
,
6433 tsubst_flags_t complain
,
6439 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6441 if (TREE_CODE (arg
) == TREE_LIST
6442 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6444 /* The template argument was the name of some
6445 member function. That's usually
6446 invalid, but static members are OK. In any
6447 case, grab the underlying fields/functions
6448 and issue an error later if required. */
6449 orig_arg
= TREE_VALUE (arg
);
6450 TREE_TYPE (arg
) = unknown_type_node
;
6455 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6456 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6457 || requires_tmpl_type
);
6459 /* When determining whether an argument pack expansion is a template,
6460 look at the pattern. */
6461 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6462 arg
= PACK_EXPANSION_PATTERN (arg
);
6464 /* Deal with an injected-class-name used as a template template arg. */
6465 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6467 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6468 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6470 if (cxx_dialect
>= cxx11
)
6471 /* OK under DR 1004. */;
6472 else if (complain
& tf_warning_or_error
)
6473 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6474 " used as template template argument", TYPE_NAME (arg
));
6475 else if (flag_pedantic_errors
)
6483 ((TREE_CODE (arg
) == TEMPLATE_DECL
6484 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6485 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6486 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6487 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6490 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6491 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6492 arg
= TYPE_STUB_DECL (arg
);
6494 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6496 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6497 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6499 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6501 if (complain
& tf_error
)
6502 error ("invalid use of destructor %qE as a type", orig_arg
);
6503 return error_mark_node
;
6506 permerror (input_location
,
6507 "to refer to a type member of a template parameter, "
6508 "use %<typename %E%>", orig_arg
);
6510 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6511 TREE_OPERAND (arg
, 1),
6517 if (is_type
!= requires_type
)
6521 if (complain
& tf_error
)
6523 error ("type/value mismatch at argument %d in template "
6524 "parameter list for %qD",
6527 inform (input_location
,
6528 " expected a constant of type %qT, got %qT",
6530 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6531 else if (requires_tmpl_type
)
6532 inform (input_location
,
6533 " expected a class template, got %qE", orig_arg
);
6535 inform (input_location
,
6536 " expected a type, got %qE", orig_arg
);
6539 return error_mark_node
;
6541 if (is_tmpl_type
^ requires_tmpl_type
)
6543 if (in_decl
&& (complain
& tf_error
))
6545 error ("type/value mismatch at argument %d in template "
6546 "parameter list for %qD",
6549 inform (input_location
,
6550 " expected a type, got %qT", DECL_NAME (arg
));
6552 inform (input_location
,
6553 " expected a class template, got %qT", orig_arg
);
6555 return error_mark_node
;
6560 if (requires_tmpl_type
)
6562 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6564 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6565 /* The number of argument required is not known yet.
6566 Just accept it for now. */
6567 val
= TREE_TYPE (arg
);
6570 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6573 /* Strip alias templates that are equivalent to another
6575 arg
= get_underlying_template (arg
);
6576 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6578 if (coerce_template_template_parms (parmparm
, argparm
,
6584 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6586 if (val
!= error_mark_node
)
6588 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6589 val
= TREE_TYPE (val
);
6590 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6591 val
= make_pack_expansion (val
);
6596 if (in_decl
&& (complain
& tf_error
))
6598 error ("type/value mismatch at argument %d in "
6599 "template parameter list for %qD",
6601 inform (input_location
,
6602 " expected a template of type %qD, got %qT",
6606 val
= error_mark_node
;
6612 /* We only form one instance of each template specialization.
6613 Therefore, if we use a non-canonical variant (i.e., a
6614 typedef), any future messages referring to the type will use
6615 the typedef, which is confusing if those future uses do not
6616 themselves also use the typedef. */
6618 val
= canonicalize_type_argument (val
, complain
);
6622 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6624 if (invalid_nontype_parm_type_p (t
, complain
))
6625 return error_mark_node
;
6627 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6629 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6633 /* Not sure if this is reachable, but it doesn't hurt
6635 error ("type mismatch in nontype parameter pack");
6636 val
= error_mark_node
;
6639 else if (!dependent_template_arg_p (orig_arg
)
6640 && !uses_template_parms (t
))
6641 /* We used to call digest_init here. However, digest_init
6642 will report errors, which we don't want when complain
6643 is zero. More importantly, digest_init will try too
6644 hard to convert things: for example, `0' should not be
6645 converted to pointer type at this point according to
6646 the standard. Accepting this is not merely an
6647 extension, since deciding whether or not these
6648 conversions can occur is part of determining which
6649 function template to call, or whether a given explicit
6650 argument specification is valid. */
6651 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6653 val
= strip_typedefs_expr (orig_arg
);
6655 if (val
== NULL_TREE
)
6656 val
= error_mark_node
;
6657 else if (val
== error_mark_node
&& (complain
& tf_error
))
6658 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6660 if (TREE_CODE (val
) == SCOPE_REF
)
6662 /* Strip typedefs from the SCOPE_REF. */
6663 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6664 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6666 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6667 QUALIFIED_NAME_IS_TEMPLATE (val
));
6674 /* Coerces the remaining template arguments in INNER_ARGS (from
6675 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6676 Returns the coerced argument pack. PARM_IDX is the position of this
6677 parameter in the template parameter list. ARGS is the original
6678 template argument list. */
6680 coerce_template_parameter_pack (tree parms
,
6688 tsubst_flags_t complain
)
6690 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6691 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6694 tree packed_parms
= NULL_TREE
;
6696 if (arg_idx
> nargs
)
6699 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6701 /* When the template parameter is a non-type template parameter pack
6702 or template template parameter pack whose type or template
6703 parameters use parameter packs, we know exactly how many arguments
6704 we are looking for. Build a vector of the instantiated decls for
6705 these template parameters in PACKED_PARMS. */
6706 /* We can't use make_pack_expansion here because it would interpret a
6707 _DECL as a use rather than a declaration. */
6708 tree decl
= TREE_VALUE (parm
);
6709 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6710 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6711 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6712 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6714 TREE_VEC_LENGTH (args
)--;
6715 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6716 TREE_VEC_LENGTH (args
)++;
6718 if (packed_parms
== error_mark_node
)
6719 return error_mark_node
;
6721 /* If we're doing a partial instantiation of a member template,
6722 verify that all of the types used for the non-type
6723 template parameter pack are, in fact, valid for non-type
6724 template parameters. */
6726 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6728 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6729 for (j
= 0; j
< len
; ++j
)
6731 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6732 if (invalid_nontype_parm_type_p (t
, complain
))
6733 return error_mark_node
;
6737 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6740 packed_args
= make_tree_vec (nargs
- arg_idx
);
6742 /* Convert the remaining arguments, which will be a part of the
6743 parameter pack "parm". */
6744 for (; arg_idx
< nargs
; ++arg_idx
)
6746 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6747 tree actual_parm
= TREE_VALUE (parm
);
6748 int pack_idx
= arg_idx
- parm_idx
;
6752 /* Once we've packed as many args as we have types, stop. */
6753 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6755 else if (PACK_EXPANSION_P (arg
))
6756 /* We don't know how many args we have yet, just
6757 use the unconverted ones for now. */
6760 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6763 if (arg
== error_mark_node
)
6765 if (complain
& tf_error
)
6766 error ("template argument %d is invalid", arg_idx
+ 1);
6769 arg
= convert_template_argument (actual_parm
,
6770 arg
, new_args
, complain
, parm_idx
,
6772 if (arg
== error_mark_node
)
6774 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6777 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6778 && TREE_VEC_LENGTH (packed_args
) > 0)
6780 if (complain
& tf_error
)
6781 error ("wrong number of template arguments (%d, should be %d)",
6782 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6783 return error_mark_node
;
6786 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6787 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6788 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6791 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6792 TREE_TYPE (argument_pack
)
6793 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6794 TREE_CONSTANT (argument_pack
) = 1;
6797 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6798 #ifdef ENABLE_CHECKING
6799 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6800 TREE_VEC_LENGTH (packed_args
));
6802 return argument_pack
;
6805 /* Returns the number of pack expansions in the template argument vector
6809 pack_expansion_args_count (tree args
)
6814 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6816 tree elt
= TREE_VEC_ELT (args
, i
);
6817 if (elt
&& PACK_EXPANSION_P (elt
))
6823 /* Convert all template arguments to their appropriate types, and
6824 return a vector containing the innermost resulting template
6825 arguments. If any error occurs, return error_mark_node. Error and
6826 warning messages are issued under control of COMPLAIN.
6828 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6829 for arguments not specified in ARGS. Otherwise, if
6830 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6831 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6832 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6836 coerce_template_parms (tree parms
,
6839 tsubst_flags_t complain
,
6840 bool require_all_args
,
6841 bool use_default_args
)
6843 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6844 tree orig_inner_args
;
6847 tree new_inner_args
;
6848 int saved_unevaluated_operand
;
6849 int saved_inhibit_evaluation_warnings
;
6851 /* When used as a boolean value, indicates whether this is a
6852 variadic template parameter list. Since it's an int, we can also
6853 subtract it from nparms to get the number of non-variadic
6856 int variadic_args_p
= 0;
6857 int post_variadic_parms
= 0;
6859 if (args
== error_mark_node
)
6860 return error_mark_node
;
6862 nparms
= TREE_VEC_LENGTH (parms
);
6864 /* Determine if there are any parameter packs. */
6865 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6867 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
6869 ++post_variadic_parms
;
6870 if (template_parameter_pack_p (tparm
))
6874 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6875 /* If there are no parameters that follow a parameter pack, we need to
6876 expand any argument packs so that we can deduce a parameter pack from
6877 some non-packed args followed by an argument pack, as in variadic85.C.
6878 If there are such parameters, we need to leave argument packs intact
6879 so the arguments are assigned properly. This can happen when dealing
6880 with a nested class inside a partial specialization of a class
6881 template, as in variadic92.C, or when deducing a template parameter pack
6882 from a sub-declarator, as in variadic114.C. */
6883 if (!post_variadic_parms
)
6884 inner_args
= expand_template_argument_pack (inner_args
);
6886 /* Count any pack expansion args. */
6887 variadic_args_p
= pack_expansion_args_count (inner_args
);
6889 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6890 if ((nargs
> nparms
&& !variadic_p
)
6891 || (nargs
< nparms
- variadic_p
6894 && (!use_default_args
6895 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6896 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6898 if (complain
& tf_error
)
6902 nparms
-= variadic_p
;
6903 error ("wrong number of template arguments "
6904 "(%d, should be %d or more)", nargs
, nparms
);
6907 error ("wrong number of template arguments "
6908 "(%d, should be %d)", nargs
, nparms
);
6911 error ("provided for %q+D", in_decl
);
6914 return error_mark_node
;
6916 /* We can't pass a pack expansion to a non-pack parameter of an alias
6917 template (DR 1430). */
6918 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
6920 && nargs
- variadic_args_p
< nparms
- variadic_p
)
6922 if (complain
& tf_error
)
6924 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
6926 tree arg
= TREE_VEC_ELT (inner_args
, i
);
6927 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6929 if (PACK_EXPANSION_P (arg
)
6930 && !template_parameter_pack_p (parm
))
6932 error ("pack expansion argument for non-pack parameter "
6933 "%qD of alias template %qD", parm
, in_decl
);
6934 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
6941 return error_mark_node
;
6944 /* We need to evaluate the template arguments, even though this
6945 template-id may be nested within a "sizeof". */
6946 saved_unevaluated_operand
= cp_unevaluated_operand
;
6947 cp_unevaluated_operand
= 0;
6948 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6949 c_inhibit_evaluation_warnings
= 0;
6950 new_inner_args
= make_tree_vec (nparms
);
6951 new_args
= add_outermost_template_args (args
, new_inner_args
);
6952 int pack_adjust
= 0;
6953 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6958 /* Get the Ith template parameter. */
6959 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6961 if (parm
== error_mark_node
)
6963 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6967 /* Calculate the next argument. */
6968 if (arg_idx
< nargs
)
6969 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6973 if (template_parameter_pack_p (TREE_VALUE (parm
))
6974 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6976 /* Some arguments will be placed in the
6977 template parameter pack PARM. */
6978 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6979 inner_args
, arg_idx
,
6983 if (arg
== NULL_TREE
)
6985 /* We don't know how many args we have yet, just use the
6986 unconverted (and still packed) ones for now. */
6987 new_inner_args
= orig_inner_args
;
6992 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
6994 /* Store this argument. */
6995 if (arg
== error_mark_node
)
6998 /* We are done with all of the arguments. */
7003 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7004 arg_idx
+= pack_adjust
;
7011 if (PACK_EXPANSION_P (arg
))
7013 /* "If every valid specialization of a variadic template
7014 requires an empty template parameter pack, the template is
7015 ill-formed, no diagnostic required." So check that the
7016 pattern works with this parameter. */
7017 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7018 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7022 if (conv
== error_mark_node
)
7024 inform (input_location
, "so any instantiation with a "
7025 "non-empty parameter pack would be ill-formed");
7028 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7029 /* Recover from missing typename. */
7030 TREE_VEC_ELT (inner_args
, arg_idx
)
7031 = make_pack_expansion (conv
);
7033 /* We don't know how many args we have yet, just
7034 use the unconverted ones for now. */
7035 new_inner_args
= inner_args
;
7040 else if (require_all_args
)
7042 /* There must be a default arg in this case. */
7043 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7045 /* The position of the first default template argument,
7046 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7048 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7049 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7050 arg_idx
- pack_adjust
);
7055 if (arg
== error_mark_node
)
7057 if (complain
& tf_error
)
7058 error ("template argument %d is invalid", arg_idx
+ 1);
7061 /* This only occurs if there was an error in the template
7062 parameter list itself (which we would already have
7063 reported) that we are trying to recover from, e.g., a class
7064 template with a parameter list such as
7065 template<typename..., typename>. */
7068 arg
= convert_template_argument (TREE_VALUE (parm
),
7069 arg
, new_args
, complain
,
7072 if (arg
== error_mark_node
)
7074 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7076 cp_unevaluated_operand
= saved_unevaluated_operand
;
7077 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7079 if (variadic_p
&& arg_idx
< nargs
)
7081 if (complain
& tf_error
)
7083 error ("wrong number of template arguments "
7084 "(%d, should be %d)", nargs
, arg_idx
);
7086 error ("provided for %q+D", in_decl
);
7088 return error_mark_node
;
7092 return error_mark_node
;
7094 #ifdef ENABLE_CHECKING
7095 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7096 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7097 TREE_VEC_LENGTH (new_inner_args
));
7100 return new_inner_args
;
7103 /* Like coerce_template_parms. If PARMS represents all template
7104 parameters levels, this function returns a vector of vectors
7105 representing all the resulting argument levels. Note that in this
7106 case, only the innermost arguments are coerced because the
7107 outermost ones are supposed to have been coerced already.
7109 Otherwise, if PARMS represents only (the innermost) vector of
7110 parameters, this function returns a vector containing just the
7111 innermost resulting arguments. */
7114 coerce_innermost_template_parms (tree parms
,
7117 tsubst_flags_t complain
,
7118 bool require_all_args
,
7119 bool use_default_args
)
7121 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7122 int args_depth
= TMPL_ARGS_DEPTH (args
);
7125 if (parms_depth
> 1)
7127 coerced_args
= make_tree_vec (parms_depth
);
7131 for (level
= parms
, cur_depth
= parms_depth
;
7132 parms_depth
> 0 && level
!= NULL_TREE
;
7133 level
= TREE_CHAIN (level
), --cur_depth
)
7136 if (cur_depth
== args_depth
)
7137 l
= coerce_template_parms (TREE_VALUE (level
),
7138 args
, in_decl
, complain
,
7142 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7144 if (l
== error_mark_node
)
7145 return error_mark_node
;
7147 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7151 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7152 args
, in_decl
, complain
,
7155 return coerced_args
;
7158 /* Returns 1 if template args OT and NT are equivalent. */
7161 template_args_equal (tree ot
, tree nt
)
7165 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7168 if (TREE_CODE (nt
) == TREE_VEC
)
7169 /* For member templates */
7170 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7171 else if (PACK_EXPANSION_P (ot
))
7172 return (PACK_EXPANSION_P (nt
)
7173 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7174 PACK_EXPANSION_PATTERN (nt
))
7175 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7176 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7177 else if (ARGUMENT_PACK_P (ot
))
7182 if (!ARGUMENT_PACK_P (nt
))
7185 opack
= ARGUMENT_PACK_ARGS (ot
);
7186 npack
= ARGUMENT_PACK_ARGS (nt
);
7187 len
= TREE_VEC_LENGTH (opack
);
7188 if (TREE_VEC_LENGTH (npack
) != len
)
7190 for (i
= 0; i
< len
; ++i
)
7191 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7192 TREE_VEC_ELT (npack
, i
)))
7196 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7198 /* We get here probably because we are in the middle of substituting
7199 into the pattern of a pack expansion. In that case the
7200 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7201 interested in. So we want to use the initial pack argument for
7203 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7204 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7205 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7206 return template_args_equal (ot
, nt
);
7208 else if (TYPE_P (nt
))
7209 return TYPE_P (ot
) && same_type_p (ot
, nt
);
7210 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7213 return cp_tree_equal (ot
, nt
);
7216 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7217 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7218 NEWARG_PTR with the offending arguments if they are non-NULL. */
7221 comp_template_args_with_info (tree oldargs
, tree newargs
,
7222 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7226 if (oldargs
== newargs
)
7229 if (!oldargs
|| !newargs
)
7232 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7235 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7237 tree nt
= TREE_VEC_ELT (newargs
, i
);
7238 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7240 if (! template_args_equal (ot
, nt
))
7242 if (oldarg_ptr
!= NULL
)
7244 if (newarg_ptr
!= NULL
)
7252 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7253 of template arguments. Returns 0 otherwise. */
7256 comp_template_args (tree oldargs
, tree newargs
)
7258 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7262 add_pending_template (tree d
)
7264 tree ti
= (TYPE_P (d
)
7265 ? CLASSTYPE_TEMPLATE_INFO (d
)
7266 : DECL_TEMPLATE_INFO (d
));
7267 struct pending_template
*pt
;
7270 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7273 /* We are called both from instantiate_decl, where we've already had a
7274 tinst_level pushed, and instantiate_template, where we haven't.
7276 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7279 push_tinst_level (d
);
7281 pt
= ggc_alloc
<pending_template
> ();
7283 pt
->tinst
= current_tinst_level
;
7284 if (last_pending_template
)
7285 last_pending_template
->next
= pt
;
7287 pending_templates
= pt
;
7289 last_pending_template
= pt
;
7291 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7298 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7299 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7300 documentation for TEMPLATE_ID_EXPR. */
7303 lookup_template_function (tree fns
, tree arglist
)
7307 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7308 return error_mark_node
;
7310 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7312 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7314 error ("%q#D is not a function template", fns
);
7315 return error_mark_node
;
7318 if (BASELINK_P (fns
))
7320 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7322 BASELINK_FUNCTIONS (fns
),
7327 type
= TREE_TYPE (fns
);
7328 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7329 type
= unknown_type_node
;
7331 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7334 /* Within the scope of a template class S<T>, the name S gets bound
7335 (in build_self_reference) to a TYPE_DECL for the class, not a
7336 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7337 or one of its enclosing classes, and that type is a template,
7338 return the associated TEMPLATE_DECL. Otherwise, the original
7341 Also handle the case when DECL is a TREE_LIST of ambiguous
7342 injected-class-names from different bases. */
7345 maybe_get_template_decl_from_type_decl (tree decl
)
7347 if (decl
== NULL_TREE
)
7350 /* DR 176: A lookup that finds an injected-class-name (10.2
7351 [class.member.lookup]) can result in an ambiguity in certain cases
7352 (for example, if it is found in more than one base class). If all of
7353 the injected-class-names that are found refer to specializations of
7354 the same class template, and if the name is followed by a
7355 template-argument-list, the reference refers to the class template
7356 itself and not a specialization thereof, and is not ambiguous. */
7357 if (TREE_CODE (decl
) == TREE_LIST
)
7359 tree t
, tmpl
= NULL_TREE
;
7360 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7362 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7365 else if (tmpl
!= elt
)
7368 if (tmpl
&& t
== NULL_TREE
)
7374 return (decl
!= NULL_TREE
7375 && DECL_SELF_REFERENCE_P (decl
)
7376 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7377 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7380 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7381 parameters, find the desired type.
7383 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7385 IN_DECL, if non-NULL, is the template declaration we are trying to
7388 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7389 the class we are looking up.
7391 Issue error and warning messages under control of COMPLAIN.
7393 If the template class is really a local class in a template
7394 function, then the FUNCTION_CONTEXT is the function in which it is
7397 ??? Note that this function is currently called *twice* for each
7398 template-id: the first time from the parser, while creating the
7399 incomplete type (finish_template_type), and the second type during the
7400 real instantiation (instantiate_template_class). This is surely something
7401 that we want to avoid. It also causes some problems with argument
7402 coercion (see convert_nontype_argument for more information on this). */
7405 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7406 int entering_scope
, tsubst_flags_t complain
)
7408 tree templ
= NULL_TREE
, parmlist
;
7415 if (identifier_p (d1
))
7417 tree value
= innermost_non_namespace_value (d1
);
7418 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7423 push_decl_namespace (context
);
7424 templ
= lookup_name (d1
);
7425 templ
= maybe_get_template_decl_from_type_decl (templ
);
7427 pop_decl_namespace ();
7430 context
= DECL_CONTEXT (templ
);
7432 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7434 tree type
= TREE_TYPE (d1
);
7436 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7437 an implicit typename for the second A. Deal with it. */
7438 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7439 type
= TREE_TYPE (type
);
7441 if (CLASSTYPE_TEMPLATE_INFO (type
))
7443 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7444 d1
= DECL_NAME (templ
);
7447 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7448 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7450 templ
= TYPE_TI_TEMPLATE (d1
);
7451 d1
= DECL_NAME (templ
);
7453 else if (DECL_TYPE_TEMPLATE_P (d1
))
7456 d1
= DECL_NAME (templ
);
7457 context
= DECL_CONTEXT (templ
);
7459 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7462 d1
= DECL_NAME (templ
);
7465 /* Issue an error message if we didn't find a template. */
7468 if (complain
& tf_error
)
7469 error ("%qT is not a template", d1
);
7470 return error_mark_node
;
7473 if (TREE_CODE (templ
) != TEMPLATE_DECL
7474 /* Make sure it's a user visible template, if it was named by
7476 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7477 && !PRIMARY_TEMPLATE_P (templ
)))
7479 if (complain
& tf_error
)
7481 error ("non-template type %qT used as a template", d1
);
7483 error ("for template declaration %q+D", in_decl
);
7485 return error_mark_node
;
7488 complain
&= ~tf_user
;
7490 /* An alias that just changes the name of a template is equivalent to the
7491 other template, so if any of the arguments are pack expansions, strip
7492 the alias to avoid problems with a pack expansion passed to a non-pack
7493 alias template parameter (DR 1430). */
7494 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7495 templ
= get_underlying_template (templ
);
7497 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7499 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7500 template arguments */
7506 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7508 /* Consider an example where a template template parameter declared as
7510 template <class T, class U = std::allocator<T> > class TT
7512 The template parameter level of T and U are one level larger than
7513 of TT. To proper process the default argument of U, say when an
7514 instantiation `TT<int>' is seen, we need to build the full
7515 arguments containing {int} as the innermost level. Outer levels,
7516 available when not appearing as default template argument, can be
7517 obtained from the arguments of the enclosing template.
7519 Suppose that TT is later substituted with std::vector. The above
7520 instantiation is `TT<int, std::allocator<T> >' with TT at
7521 level 1, and T at level 2, while the template arguments at level 1
7522 becomes {std::vector} and the inner level 2 is {int}. */
7524 outer
= DECL_CONTEXT (templ
);
7526 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7527 else if (current_template_parms
)
7528 /* This is an argument of the current template, so we haven't set
7529 DECL_CONTEXT yet. */
7530 outer
= current_template_args ();
7533 arglist
= add_to_template_args (outer
, arglist
);
7535 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7537 /*require_all_args=*/true,
7538 /*use_default_args=*/true);
7539 if (arglist2
== error_mark_node
7540 || (!uses_template_parms (arglist2
)
7541 && check_instantiated_args (templ
, arglist2
, complain
)))
7542 return error_mark_node
;
7544 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7549 tree template_type
= TREE_TYPE (templ
);
7552 tree found
= NULL_TREE
;
7555 int is_dependent_type
;
7556 int use_partial_inst_tmpl
= false;
7558 if (template_type
== error_mark_node
)
7559 /* An error occurred while building the template TEMPL, and a
7560 diagnostic has most certainly been emitted for that
7561 already. Let's propagate that error. */
7562 return error_mark_node
;
7564 gen_tmpl
= most_general_template (templ
);
7565 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7566 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7567 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7569 if (arg_depth
== 1 && parm_depth
> 1)
7571 /* We've been given an incomplete set of template arguments.
7574 template <class T> struct S1 {
7575 template <class U> struct S2 {};
7576 template <class U> struct S2<U*> {};
7579 we will be called with an ARGLIST of `U*', but the
7580 TEMPLATE will be `template <class T> template
7581 <class U> struct S1<T>::S2'. We must fill in the missing
7584 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7586 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7589 /* Now we should have enough arguments. */
7590 gcc_assert (parm_depth
== arg_depth
);
7592 /* From here on, we're only interested in the most general
7595 /* Calculate the BOUND_ARGS. These will be the args that are
7596 actually tsubst'd into the definition to create the
7600 /* We have multiple levels of arguments to coerce, at once. */
7602 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7604 tree bound_args
= make_tree_vec (parm_depth
);
7606 for (i
= saved_depth
,
7607 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7608 i
> 0 && t
!= NULL_TREE
;
7609 --i
, t
= TREE_CHAIN (t
))
7612 if (i
== saved_depth
)
7613 a
= coerce_template_parms (TREE_VALUE (t
),
7616 /*require_all_args=*/true,
7617 /*use_default_args=*/true);
7619 /* Outer levels should have already been coerced. */
7620 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7622 /* Don't process further if one of the levels fails. */
7623 if (a
== error_mark_node
)
7625 /* Restore the ARGLIST to its full size. */
7626 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7627 return error_mark_node
;
7630 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7632 /* We temporarily reduce the length of the ARGLIST so
7633 that coerce_template_parms will see only the arguments
7634 corresponding to the template parameters it is
7636 TREE_VEC_LENGTH (arglist
)--;
7639 /* Restore the ARGLIST to its full size. */
7640 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7642 arglist
= bound_args
;
7646 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7647 INNERMOST_TEMPLATE_ARGS (arglist
),
7650 /*require_all_args=*/true,
7651 /*use_default_args=*/true);
7653 if (arglist
== error_mark_node
)
7654 /* We were unable to bind the arguments. */
7655 return error_mark_node
;
7657 /* In the scope of a template class, explicit references to the
7658 template class refer to the type of the template, not any
7659 instantiation of it. For example, in:
7661 template <class T> class C { void f(C<T>); }
7663 the `C<T>' is just the same as `C'. Outside of the
7664 class, however, such a reference is an instantiation. */
7666 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7667 || currently_open_class (template_type
))
7668 /* comp_template_args is expensive, check it last. */
7669 && comp_template_args (TYPE_TI_ARGS (template_type
),
7671 return template_type
;
7673 /* If we already have this specialization, return it. */
7674 elt
.tmpl
= gen_tmpl
;
7676 hash
= hash_specialization (&elt
);
7677 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7683 is_dependent_type
= uses_template_parms (arglist
);
7685 /* If the deduced arguments are invalid, then the binding
7687 if (!is_dependent_type
7688 && check_instantiated_args (gen_tmpl
,
7689 INNERMOST_TEMPLATE_ARGS (arglist
),
7691 return error_mark_node
;
7693 if (!is_dependent_type
7694 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7695 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7696 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7698 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7699 DECL_NAME (gen_tmpl
),
7700 /*tag_scope=*/ts_global
);
7704 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7706 if (context
== error_mark_node
)
7707 return error_mark_node
;
7710 context
= global_namespace
;
7712 /* Create the type. */
7713 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7715 /* The user referred to a specialization of an alias
7716 template represented by GEN_TMPL.
7718 [temp.alias]/2 says:
7720 When a template-id refers to the specialization of an
7721 alias template, it is equivalent to the associated
7722 type obtained by substitution of its
7723 template-arguments for the template-parameters in the
7724 type-id of the alias template. */
7726 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7727 /* Note that the call above (by indirectly calling
7728 register_specialization in tsubst_decl) registers the
7729 TYPE_DECL representing the specialization of the alias
7730 template. So next time someone substitutes ARGLIST for
7731 the template parms into the alias template (GEN_TMPL),
7732 she'll get that TYPE_DECL back. */
7734 if (t
== error_mark_node
)
7737 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7739 if (!is_dependent_type
)
7741 set_current_access_from_decl (TYPE_NAME (template_type
));
7742 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7743 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7744 arglist
, complain
, in_decl
),
7745 SCOPED_ENUM_P (template_type
), NULL
);
7747 if (t
== error_mark_node
)
7752 /* We don't want to call start_enum for this type, since
7753 the values for the enumeration constants may involve
7754 template parameters. And, no one should be interested
7755 in the enumeration constants for such a type. */
7756 t
= cxx_make_type (ENUMERAL_TYPE
);
7757 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7759 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7760 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7761 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7763 else if (CLASS_TYPE_P (template_type
))
7765 t
= make_class_type (TREE_CODE (template_type
));
7766 CLASSTYPE_DECLARED_CLASS (t
)
7767 = CLASSTYPE_DECLARED_CLASS (template_type
);
7768 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7769 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7771 /* A local class. Make sure the decl gets registered properly. */
7772 if (context
== current_function_decl
)
7773 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7775 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7776 /* This instantiation is another name for the primary
7777 template type. Set the TYPE_CANONICAL field
7779 TYPE_CANONICAL (t
) = template_type
;
7780 else if (any_template_arguments_need_structural_equality_p (arglist
))
7781 /* Some of the template arguments require structural
7782 equality testing, so this template class requires
7783 structural equality testing. */
7784 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7789 /* If we called start_enum or pushtag above, this information
7790 will already be set up. */
7793 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7795 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7796 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7797 DECL_SOURCE_LOCATION (type_decl
)
7798 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7801 type_decl
= TYPE_NAME (t
);
7803 if (CLASS_TYPE_P (template_type
))
7805 TREE_PRIVATE (type_decl
)
7806 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7807 TREE_PROTECTED (type_decl
)
7808 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7809 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7811 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7812 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7816 if (OVERLOAD_TYPE_P (t
)
7817 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7819 = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (template_type
)))
7820 TYPE_ATTRIBUTES (t
) = attributes
;
7822 /* Let's consider the explicit specialization of a member
7823 of a class template specialization that is implicitly instantiated,
7828 template<class U> struct M {}; //#0
7833 struct S<int>::M<char> //#1
7837 [temp.expl.spec]/4 says this is valid.
7839 In this case, when we write:
7842 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7845 When we encounter #1, we want to store the partial instantiation
7846 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7848 For all cases other than this "explicit specialization of member of a
7849 class template", we just want to store the most general template into
7850 the CLASSTYPE_TI_TEMPLATE of M.
7852 This case of "explicit specialization of member of a class template"
7854 1/ the enclosing class is an instantiation of, and therefore not
7855 the same as, the context of the most general template, and
7856 2/ we aren't looking at the partial instantiation itself, i.e.
7857 the innermost arguments are not the same as the innermost parms of
7858 the most general template.
7860 So it's only when 1/ and 2/ happens that we want to use the partial
7861 instantiation of the member template in lieu of its most general
7864 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7865 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7866 /* the enclosing class must be an instantiation... */
7867 && CLASS_TYPE_P (context
)
7868 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7870 tree partial_inst_args
;
7871 TREE_VEC_LENGTH (arglist
)--;
7872 ++processing_template_decl
;
7874 tsubst (INNERMOST_TEMPLATE_ARGS
7875 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7876 arglist
, complain
, NULL_TREE
);
7877 --processing_template_decl
;
7878 TREE_VEC_LENGTH (arglist
)++;
7879 use_partial_inst_tmpl
=
7880 /*...and we must not be looking at the partial instantiation
7882 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7886 if (!use_partial_inst_tmpl
)
7887 /* This case is easy; there are no member templates involved. */
7891 /* This is a full instantiation of a member template. Find
7892 the partial instantiation of which this is an instance. */
7894 /* Temporarily reduce by one the number of levels in the ARGLIST
7895 so as to avoid comparing the last set of arguments. */
7896 TREE_VEC_LENGTH (arglist
)--;
7897 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7898 TREE_VEC_LENGTH (arglist
)++;
7899 /* FOUND is either a proper class type, or an alias
7900 template specialization. In the later case, it's a
7901 TYPE_DECL, resulting from the substituting of arguments
7902 for parameters in the TYPE_DECL of the alias template
7903 done earlier. So be careful while getting the template
7905 found
= TREE_CODE (found
) == TYPE_DECL
7906 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7907 : CLASSTYPE_TI_TEMPLATE (found
);
7910 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7913 slot
= htab_find_slot_with_hash (type_specializations
,
7914 &elt
, hash
, INSERT
);
7915 entry
= ggc_alloc
<spec_entry
> ();
7919 /* Note this use of the partial instantiation so we can check it
7920 later in maybe_process_partial_specialization. */
7921 DECL_TEMPLATE_INSTANTIATIONS (found
)
7922 = tree_cons (arglist
, t
,
7923 DECL_TEMPLATE_INSTANTIATIONS (found
));
7925 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
7926 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7927 /* Now that the type has been registered on the instantiations
7928 list, we set up the enumerators. Because the enumeration
7929 constants may involve the enumeration type itself, we make
7930 sure to register the type first, and then create the
7931 constants. That way, doing tsubst_expr for the enumeration
7932 constants won't result in recursive calls here; we'll find
7933 the instantiation and exit above. */
7934 tsubst_enum (template_type
, t
, arglist
);
7936 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7937 /* If the type makes use of template parameters, the
7938 code that generates debugging information will crash. */
7939 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
7941 /* Possibly limit visibility based on template args. */
7942 TREE_PUBLIC (type_decl
) = 1;
7943 determine_visibility (type_decl
);
7949 /* Wrapper for lookup_template_class_1. */
7952 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7953 int entering_scope
, tsubst_flags_t complain
)
7956 timevar_push (TV_TEMPLATE_INST
);
7957 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7958 entering_scope
, complain
);
7959 timevar_pop (TV_TEMPLATE_INST
);
7963 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST. */
7966 lookup_template_variable (tree templ
, tree arglist
)
7968 return build2 (TEMPLATE_ID_EXPR
, TREE_TYPE (templ
), templ
, arglist
);
7975 /* True when we should also visit template parameters that occur in
7976 non-deduced contexts. */
7977 bool include_nondeduced_p
;
7978 hash_set
<tree
> *visited
;
7981 /* Called from for_each_template_parm via walk_tree. */
7984 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
7987 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
7988 tree_fn_t fn
= pfd
->fn
;
7989 void *data
= pfd
->data
;
7992 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
7993 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
7994 pfd
->include_nondeduced_p
))
7995 return error_mark_node
;
7997 switch (TREE_CODE (t
))
8000 if (TYPE_PTRMEMFUNC_P (t
))
8006 if (!TYPE_TEMPLATE_INFO (t
))
8008 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8009 fn
, data
, pfd
->visited
,
8010 pfd
->include_nondeduced_p
))
8011 return error_mark_node
;
8015 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8016 fn
, data
, pfd
->visited
,
8017 pfd
->include_nondeduced_p
)
8018 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8019 fn
, data
, pfd
->visited
,
8020 pfd
->include_nondeduced_p
))
8021 return error_mark_node
;
8025 /* Since we're not going to walk subtrees, we have to do this
8027 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8028 pfd
->visited
, pfd
->include_nondeduced_p
))
8029 return error_mark_node
;
8033 /* Check the return type. */
8034 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8035 pfd
->include_nondeduced_p
))
8036 return error_mark_node
;
8038 /* Check the parameter types. Since default arguments are not
8039 instantiated until they are needed, the TYPE_ARG_TYPES may
8040 contain expressions that involve template parameters. But,
8041 no-one should be looking at them yet. And, once they're
8042 instantiated, they don't contain template parameters, so
8043 there's no point in looking at them then, either. */
8047 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8048 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8049 pfd
->visited
, pfd
->include_nondeduced_p
))
8050 return error_mark_node
;
8052 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8053 want walk_tree walking into them itself. */
8059 case UNDERLYING_TYPE
:
8060 if (pfd
->include_nondeduced_p
8061 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
8063 pfd
->include_nondeduced_p
))
8064 return error_mark_node
;
8069 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8070 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8071 pfd
->visited
, pfd
->include_nondeduced_p
))
8072 return error_mark_node
;
8077 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8078 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8079 pfd
->visited
, pfd
->include_nondeduced_p
))
8080 return error_mark_node
;
8081 if (DECL_CONTEXT (t
)
8082 && pfd
->include_nondeduced_p
8083 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8084 pfd
->visited
, pfd
->include_nondeduced_p
))
8085 return error_mark_node
;
8088 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8089 /* Record template parameters such as `T' inside `TT<T>'. */
8090 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8091 pfd
->include_nondeduced_p
))
8092 return error_mark_node
;
8095 case TEMPLATE_TEMPLATE_PARM
:
8096 case TEMPLATE_TYPE_PARM
:
8097 case TEMPLATE_PARM_INDEX
:
8098 if (fn
&& (*fn
)(t
, data
))
8099 return error_mark_node
;
8101 return error_mark_node
;
8105 /* A template template parameter is encountered. */
8106 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8107 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8108 pfd
->include_nondeduced_p
))
8109 return error_mark_node
;
8111 /* Already substituted template template parameter */
8117 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8119 pfd
->include_nondeduced_p
))
8120 return error_mark_node
;
8124 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8125 && pfd
->include_nondeduced_p
8126 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8127 (TREE_TYPE (t
)), fn
, data
,
8128 pfd
->visited
, pfd
->include_nondeduced_p
))
8129 return error_mark_node
;
8134 /* If there's no type, then this thing must be some expression
8135 involving template parameters. */
8136 if (!fn
&& !TREE_TYPE (t
))
8137 return error_mark_node
;
8142 case IMPLICIT_CONV_EXPR
:
8143 case REINTERPRET_CAST_EXPR
:
8144 case CONST_CAST_EXPR
:
8145 case STATIC_CAST_EXPR
:
8146 case DYNAMIC_CAST_EXPR
:
8150 case PSEUDO_DTOR_EXPR
:
8152 return error_mark_node
;
8159 /* We didn't find any template parameters we liked. */
8163 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8164 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8165 call FN with the parameter and the DATA.
8166 If FN returns nonzero, the iteration is terminated, and
8167 for_each_template_parm returns 1. Otherwise, the iteration
8168 continues. If FN never returns a nonzero value, the value
8169 returned by for_each_template_parm is 0. If FN is NULL, it is
8170 considered to be the function which always returns 1.
8172 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8173 parameters that occur in non-deduced contexts. When false, only
8174 visits those template parameters that can be deduced. */
8177 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8178 hash_set
<tree
> *visited
,
8179 bool include_nondeduced_p
)
8181 struct pair_fn_data pfd
;
8187 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8189 /* Walk the tree. (Conceptually, we would like to walk without
8190 duplicates, but for_each_template_parm_r recursively calls
8191 for_each_template_parm, so we would need to reorganize a fair
8192 bit to use walk_tree_without_duplicates, so we keep our own
8195 pfd
.visited
= visited
;
8197 pfd
.visited
= new hash_set
<tree
>;
8198 result
= cp_walk_tree (&t
,
8199 for_each_template_parm_r
,
8201 pfd
.visited
) != NULL_TREE
;
8213 /* Returns true if T depends on any template parameter. */
8216 uses_template_parms (tree t
)
8219 int saved_processing_template_decl
;
8221 saved_processing_template_decl
= processing_template_decl
;
8222 if (!saved_processing_template_decl
)
8223 processing_template_decl
= 1;
8225 dependent_p
= dependent_type_p (t
);
8226 else if (TREE_CODE (t
) == TREE_VEC
)
8227 dependent_p
= any_dependent_template_arguments_p (t
);
8228 else if (TREE_CODE (t
) == TREE_LIST
)
8229 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8230 || uses_template_parms (TREE_CHAIN (t
)));
8231 else if (TREE_CODE (t
) == TYPE_DECL
)
8232 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8235 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8236 || TREE_CODE (t
) == OVERLOAD
8239 || TREE_CODE (t
) == TRAIT_EXPR
8240 || TREE_CODE (t
) == CONSTRUCTOR
8241 || CONSTANT_CLASS_P (t
))
8242 dependent_p
= (type_dependent_expression_p (t
)
8243 || value_dependent_expression_p (t
));
8246 gcc_assert (t
== error_mark_node
);
8247 dependent_p
= false;
8250 processing_template_decl
= saved_processing_template_decl
;
8255 /* Returns true iff current_function_decl is an incompletely instantiated
8256 template. Useful instead of processing_template_decl because the latter
8257 is set to 0 during fold_non_dependent_expr. */
8260 in_template_function (void)
8262 tree fn
= current_function_decl
;
8264 ++processing_template_decl
;
8265 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8266 && DECL_TEMPLATE_INFO (fn
)
8267 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8268 --processing_template_decl
;
8272 /* Returns true if T depends on any template parameter with level LEVEL. */
8275 uses_template_parms_level (tree t
, int level
)
8277 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8278 /*include_nondeduced_p=*/true);
8281 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8282 ill-formed translation unit, i.e. a variable or function that isn't
8283 usable in a constant expression. */
8286 neglectable_inst_p (tree d
)
8289 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8290 : decl_maybe_constant_var_p (d
)));
8293 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8294 neglectable and instantiated from within an erroneous instantiation. */
8297 limit_bad_template_recursion (tree decl
)
8299 struct tinst_level
*lev
= current_tinst_level
;
8300 int errs
= errorcount
+ sorrycount
;
8301 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8304 for (; lev
; lev
= lev
->next
)
8305 if (neglectable_inst_p (lev
->decl
))
8308 return (lev
&& errs
> lev
->errors
);
8311 static int tinst_depth
;
8312 extern int max_tinst_depth
;
8315 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8317 /* We're starting to instantiate D; record the template instantiation context
8318 for diagnostics and to restore it later. */
8321 push_tinst_level (tree d
)
8323 struct tinst_level
*new_level
;
8325 if (tinst_depth
>= max_tinst_depth
)
8327 last_error_tinst_level
= current_tinst_level
;
8328 if (TREE_CODE (d
) == TREE_LIST
)
8329 error ("template instantiation depth exceeds maximum of %d (use "
8330 "-ftemplate-depth= to increase the maximum) substituting %qS",
8331 max_tinst_depth
, d
);
8333 error ("template instantiation depth exceeds maximum of %d (use "
8334 "-ftemplate-depth= to increase the maximum) instantiating %qD",
8335 max_tinst_depth
, d
);
8337 print_instantiation_context ();
8342 /* If the current instantiation caused problems, don't let it instantiate
8343 anything else. Do allow deduction substitution and decls usable in
8344 constant expressions. */
8345 if (limit_bad_template_recursion (d
))
8348 new_level
= ggc_alloc
<tinst_level
> ();
8349 new_level
->decl
= d
;
8350 new_level
->locus
= input_location
;
8351 new_level
->errors
= errorcount
+sorrycount
;
8352 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8353 new_level
->next
= current_tinst_level
;
8354 current_tinst_level
= new_level
;
8357 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8358 depth_reached
= tinst_depth
;
8363 /* We're done instantiating this template; return to the instantiation
8367 pop_tinst_level (void)
8369 /* Restore the filename and line number stashed away when we started
8370 this instantiation. */
8371 input_location
= current_tinst_level
->locus
;
8372 current_tinst_level
= current_tinst_level
->next
;
8376 /* We're instantiating a deferred template; restore the template
8377 instantiation context in which the instantiation was requested, which
8378 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8381 reopen_tinst_level (struct tinst_level
*level
)
8383 struct tinst_level
*t
;
8386 for (t
= level
; t
; t
= t
->next
)
8389 current_tinst_level
= level
;
8391 if (current_tinst_level
)
8392 current_tinst_level
->errors
= errorcount
+sorrycount
;
8396 /* Returns the TINST_LEVEL which gives the original instantiation
8399 struct tinst_level
*
8400 outermost_tinst_level (void)
8402 struct tinst_level
*level
= current_tinst_level
;
8405 level
= level
->next
;
8409 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8410 vector of template arguments, as for tsubst.
8412 Returns an appropriate tsubst'd friend declaration. */
8415 tsubst_friend_function (tree decl
, tree args
)
8419 if (TREE_CODE (decl
) == FUNCTION_DECL
8420 && DECL_TEMPLATE_INSTANTIATION (decl
)
8421 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8422 /* This was a friend declared with an explicit template
8423 argument list, e.g.:
8427 to indicate that f was a template instantiation, not a new
8428 function declaration. Now, we have to figure out what
8429 instantiation of what template. */
8431 tree template_id
, arglist
, fns
;
8434 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8436 /* Friend functions are looked up in the containing namespace scope.
8437 We must enter that scope, to avoid finding member functions of the
8438 current class with same name. */
8439 push_nested_namespace (ns
);
8440 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8441 tf_warning_or_error
, NULL_TREE
,
8442 /*integral_constant_expression_p=*/false);
8443 pop_nested_namespace (ns
);
8444 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8445 tf_warning_or_error
, NULL_TREE
);
8446 template_id
= lookup_template_function (fns
, arglist
);
8448 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8449 tmpl
= determine_specialization (template_id
, new_friend
,
8451 /*need_member_template=*/0,
8452 TREE_VEC_LENGTH (args
),
8454 return instantiate_template (tmpl
, new_args
, tf_error
);
8457 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8459 /* The NEW_FRIEND will look like an instantiation, to the
8460 compiler, but is not an instantiation from the point of view of
8461 the language. For example, we might have had:
8463 template <class T> struct S {
8464 template <class U> friend void f(T, U);
8467 Then, in S<int>, template <class U> void f(int, U) is not an
8468 instantiation of anything. */
8469 if (new_friend
== error_mark_node
)
8470 return error_mark_node
;
8472 DECL_USE_TEMPLATE (new_friend
) = 0;
8473 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8475 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8476 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8477 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8480 /* The mangled name for the NEW_FRIEND is incorrect. The function
8481 is not a template instantiation and should not be mangled like
8482 one. Therefore, we forget the mangling here; we'll recompute it
8483 later if we need it. */
8484 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8486 SET_DECL_RTL (new_friend
, NULL
);
8487 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8490 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8493 tree new_friend_template_info
;
8494 tree new_friend_result_template_info
;
8496 int new_friend_is_defn
;
8498 /* We must save some information from NEW_FRIEND before calling
8499 duplicate decls since that function will free NEW_FRIEND if
8501 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8502 new_friend_is_defn
=
8503 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8504 (template_for_substitution (new_friend
)))
8506 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8508 /* This declaration is a `primary' template. */
8509 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8511 new_friend_result_template_info
8512 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8515 new_friend_result_template_info
= NULL_TREE
;
8517 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8518 if (new_friend_is_defn
)
8519 DECL_INITIAL (new_friend
) = error_mark_node
;
8521 /* Inside pushdecl_namespace_level, we will push into the
8522 current namespace. However, the friend function should go
8523 into the namespace of the template. */
8524 ns
= decl_namespace_context (new_friend
);
8525 push_nested_namespace (ns
);
8526 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8527 pop_nested_namespace (ns
);
8529 if (old_decl
== error_mark_node
)
8530 return error_mark_node
;
8532 if (old_decl
!= new_friend
)
8534 /* This new friend declaration matched an existing
8535 declaration. For example, given:
8537 template <class T> void f(T);
8538 template <class U> class C {
8539 template <class T> friend void f(T) {}
8542 the friend declaration actually provides the definition
8543 of `f', once C has been instantiated for some type. So,
8544 old_decl will be the out-of-class template declaration,
8545 while new_friend is the in-class definition.
8547 But, if `f' was called before this point, the
8548 instantiation of `f' will have DECL_TI_ARGS corresponding
8549 to `T' but not to `U', references to which might appear
8550 in the definition of `f'. Previously, the most general
8551 template for an instantiation of `f' was the out-of-class
8552 version; now it is the in-class version. Therefore, we
8553 run through all specialization of `f', adding to their
8554 DECL_TI_ARGS appropriately. In particular, they need a
8555 new set of outer arguments, corresponding to the
8556 arguments for this class instantiation.
8558 The same situation can arise with something like this:
8561 template <class T> class C {
8565 when `C<int>' is instantiated. Now, `f(int)' is defined
8568 if (!new_friend_is_defn
)
8569 /* On the other hand, if the in-class declaration does
8570 *not* provide a definition, then we don't want to alter
8571 existing definitions. We can just leave everything
8576 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8577 tree new_args
= TI_ARGS (new_friend_template_info
);
8579 /* Overwrite whatever template info was there before, if
8580 any, with the new template information pertaining to
8582 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8584 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8586 /* We should have called reregister_specialization in
8588 gcc_assert (retrieve_specialization (new_template
,
8592 /* Instantiate it if the global has already been used. */
8593 if (DECL_ODR_USED (old_decl
))
8594 instantiate_decl (old_decl
, /*defer_ok=*/true,
8595 /*expl_inst_class_mem_p=*/false);
8601 /* Indicate that the old function template is a partial
8603 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8604 = new_friend_result_template_info
;
8606 gcc_assert (new_template
8607 == most_general_template (new_template
));
8608 gcc_assert (new_template
!= old_decl
);
8610 /* Reassign any specializations already in the hash table
8611 to the new more general template, and add the
8612 additional template args. */
8613 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8617 tree spec
= TREE_VALUE (t
);
8620 elt
.tmpl
= old_decl
;
8621 elt
.args
= DECL_TI_ARGS (spec
);
8622 elt
.spec
= NULL_TREE
;
8624 htab_remove_elt (decl_specializations
, &elt
);
8627 = add_outermost_template_args (new_args
,
8628 DECL_TI_ARGS (spec
));
8630 register_specialization
8631 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8634 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8638 /* The information from NEW_FRIEND has been merged into OLD_DECL
8639 by duplicate_decls. */
8640 new_friend
= old_decl
;
8645 tree context
= DECL_CONTEXT (new_friend
);
8649 template <class T> class C {
8650 template <class U> friend void C1<U>::f (); // case 1
8651 friend void C2<T>::f (); // case 2
8653 we only need to make sure CONTEXT is a complete type for
8654 case 2. To distinguish between the two cases, we note that
8655 CONTEXT of case 1 remains dependent type after tsubst while
8656 this isn't true for case 2. */
8657 ++processing_template_decl
;
8658 dependent_p
= dependent_type_p (context
);
8659 --processing_template_decl
;
8662 && !complete_type_or_else (context
, NULL_TREE
))
8663 return error_mark_node
;
8665 if (COMPLETE_TYPE_P (context
))
8667 tree fn
= new_friend
;
8668 /* do_friend adds the TEMPLATE_DECL for any member friend
8669 template even if it isn't a member template, i.e.
8670 template <class T> friend A<T>::f();
8671 Look through it in that case. */
8672 if (TREE_CODE (fn
) == TEMPLATE_DECL
8673 && !PRIMARY_TEMPLATE_P (fn
))
8674 fn
= DECL_TEMPLATE_RESULT (fn
);
8675 /* Check to see that the declaration is really present, and,
8676 possibly obtain an improved declaration. */
8677 fn
= check_classfn (context
, fn
, NULL_TREE
);
8687 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8688 template arguments, as for tsubst.
8690 Returns an appropriate tsubst'd friend type or error_mark_node on
8694 tsubst_friend_class (tree friend_tmpl
, tree args
)
8700 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8702 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8703 return TREE_TYPE (t
);
8706 context
= CP_DECL_CONTEXT (friend_tmpl
);
8708 if (context
!= global_namespace
)
8710 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8711 push_nested_namespace (context
);
8713 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8716 /* Look for a class template declaration. We look for hidden names
8717 because two friend declarations of the same template are the
8718 same. For example, in:
8721 template <typename> friend class F;
8723 template <typename> struct B {
8724 template <typename> friend class F;
8727 both F templates are the same. */
8728 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8729 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8731 /* But, if we don't find one, it might be because we're in a
8732 situation like this:
8740 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8741 for `S<int>', not the TEMPLATE_DECL. */
8742 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8744 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8745 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8748 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8750 /* The friend template has already been declared. Just
8751 check to see that the declarations match, and install any new
8752 default parameters. We must tsubst the default parameters,
8753 of course. We only need the innermost template parameters
8754 because that is all that redeclare_class_template will look
8756 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8757 > TMPL_ARGS_DEPTH (args
))
8760 location_t saved_input_location
;
8761 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8762 args
, tf_warning_or_error
);
8764 saved_input_location
= input_location
;
8765 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8766 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8767 input_location
= saved_input_location
;
8771 friend_type
= TREE_TYPE (tmpl
);
8775 /* The friend template has not already been declared. In this
8776 case, the instantiation of the template class will cause the
8777 injection of this template into the global scope. */
8778 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8779 if (tmpl
== error_mark_node
)
8780 return error_mark_node
;
8782 /* The new TMPL is not an instantiation of anything, so we
8783 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8784 the new type because that is supposed to be the corresponding
8785 template decl, i.e., TMPL. */
8786 DECL_USE_TEMPLATE (tmpl
) = 0;
8787 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8788 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8789 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8790 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8792 /* Inject this template into the global scope. */
8793 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8796 if (context
!= global_namespace
)
8798 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8799 pop_nested_namespace (context
);
8801 pop_nested_class ();
8807 /* Returns zero if TYPE cannot be completed later due to circularity.
8808 Otherwise returns one. */
8811 can_complete_type_without_circularity (tree type
)
8813 if (type
== NULL_TREE
|| type
== error_mark_node
)
8815 else if (COMPLETE_TYPE_P (type
))
8817 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8818 return can_complete_type_without_circularity (TREE_TYPE (type
));
8819 else if (CLASS_TYPE_P (type
)
8820 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8826 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
8828 /* Apply any attributes which had to be deferred until instantiation
8829 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8830 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8833 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8834 tree args
, tsubst_flags_t complain
, tree in_decl
)
8836 tree last_dep
= NULL_TREE
;
8840 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8841 if (ATTR_IS_DEPENDENT (t
))
8844 attributes
= copy_list (attributes
);
8848 if (DECL_P (*decl_p
))
8850 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8852 p
= &DECL_ATTRIBUTES (*decl_p
);
8855 p
= &TYPE_ATTRIBUTES (*decl_p
);
8859 tree late_attrs
= NULL_TREE
;
8860 tree
*q
= &late_attrs
;
8862 for (*p
= attributes
; *p
; )
8865 if (ATTR_IS_DEPENDENT (t
))
8867 *p
= TREE_CHAIN (t
);
8868 TREE_CHAIN (t
) = NULL_TREE
;
8869 if ((flag_openmp
|| flag_cilkplus
)
8870 && is_attribute_p ("omp declare simd",
8871 get_attribute_name (t
))
8874 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
8875 clauses
= tsubst_omp_clauses (clauses
, true, args
,
8877 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
8878 clauses
= finish_omp_clauses (clauses
);
8879 tree parms
= DECL_ARGUMENTS (*decl_p
);
8881 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
8883 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
8885 TREE_VALUE (t
) = NULL_TREE
;
8887 /* If the first attribute argument is an identifier, don't
8888 pass it through tsubst. Attributes like mode, format,
8889 cleanup and several target specific attributes expect it
8891 else if (attribute_takes_identifier_p (get_attribute_name (t
))
8895 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8897 /*integral_constant_expression_p=*/false);
8898 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8900 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8905 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8906 /*integral_constant_expression_p=*/false);
8908 q
= &TREE_CHAIN (t
);
8911 p
= &TREE_CHAIN (t
);
8914 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8918 /* Perform (or defer) access check for typedefs that were referenced
8919 from within the template TMPL code.
8920 This is a subroutine of instantiate_decl and instantiate_class_template.
8921 TMPL is the template to consider and TARGS is the list of arguments of
8925 perform_typedefs_access_check (tree tmpl
, tree targs
)
8927 location_t saved_location
;
8929 qualified_typedef_usage_t
*iter
;
8932 || (!CLASS_TYPE_P (tmpl
)
8933 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8936 saved_location
= input_location
;
8937 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8939 tree type_decl
= iter
->typedef_decl
;
8940 tree type_scope
= iter
->context
;
8942 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8945 if (uses_template_parms (type_decl
))
8946 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8947 if (uses_template_parms (type_scope
))
8948 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8950 /* Make access check error messages point to the location
8951 of the use of the typedef. */
8952 input_location
= iter
->locus
;
8953 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8954 type_decl
, type_decl
,
8955 tf_warning_or_error
);
8957 input_location
= saved_location
;
8961 instantiate_class_template_1 (tree type
)
8963 tree templ
, args
, pattern
, t
, member
;
8967 unsigned int saved_maximum_field_alignment
;
8970 if (type
== error_mark_node
)
8971 return error_mark_node
;
8973 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8974 || uses_template_parms (type
))
8977 /* Figure out which template is being instantiated. */
8978 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8979 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8981 /* Determine what specialization of the original template to
8983 t
= most_specialized_class (type
, tf_warning_or_error
);
8984 if (t
== error_mark_node
)
8986 TYPE_BEING_DEFINED (type
) = 1;
8987 return error_mark_node
;
8991 /* This TYPE is actually an instantiation of a partial
8992 specialization. We replace the innermost set of ARGS with
8993 the arguments appropriate for substitution. For example,
8996 template <class T> struct S {};
8997 template <class T> struct S<T*> {};
8999 and supposing that we are instantiating S<int*>, ARGS will
9000 presently be {int*} -- but we need {int}. */
9001 pattern
= TREE_TYPE (t
);
9002 args
= TREE_PURPOSE (t
);
9006 pattern
= TREE_TYPE (templ
);
9007 args
= CLASSTYPE_TI_ARGS (type
);
9010 /* If the template we're instantiating is incomplete, then clearly
9011 there's nothing we can do. */
9012 if (!COMPLETE_TYPE_P (pattern
))
9015 /* If we've recursively instantiated too many templates, stop. */
9016 if (! push_tinst_level (type
))
9019 /* Now we're really doing the instantiation. Mark the type as in
9020 the process of being defined. */
9021 TYPE_BEING_DEFINED (type
) = 1;
9023 /* We may be in the middle of deferred access check. Disable
9025 push_deferring_access_checks (dk_no_deferred
);
9027 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9028 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9029 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9030 fn_context
= error_mark_node
;
9032 push_to_top_level ();
9033 /* Use #pragma pack from the template context. */
9034 saved_maximum_field_alignment
= maximum_field_alignment
;
9035 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9037 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9039 /* Set the input location to the most specialized template definition.
9040 This is needed if tsubsting causes an error. */
9041 typedecl
= TYPE_MAIN_DECL (pattern
);
9042 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9043 DECL_SOURCE_LOCATION (typedecl
);
9045 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9046 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9047 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9048 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9049 if (ANON_AGGR_TYPE_P (pattern
))
9050 SET_ANON_AGGR_TYPE_P (type
);
9051 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9053 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9054 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9055 /* Adjust visibility for template arguments. */
9056 determine_visibility (TYPE_MAIN_DECL (type
));
9058 if (CLASS_TYPE_P (type
))
9059 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9061 pbinfo
= TYPE_BINFO (pattern
);
9063 /* We should never instantiate a nested class before its enclosing
9064 class; we need to look up the nested class by name before we can
9065 instantiate it, and that lookup should instantiate the enclosing
9067 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9068 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9070 base_list
= NULL_TREE
;
9071 if (BINFO_N_BASE_BINFOS (pbinfo
))
9077 /* We must enter the scope containing the type, as that is where
9078 the accessibility of types named in dependent bases are
9080 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9082 /* Substitute into each of the bases to determine the actual
9084 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9087 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9088 tree expanded_bases
= NULL_TREE
;
9091 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9094 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9095 args
, tf_error
, NULL_TREE
);
9096 if (expanded_bases
== error_mark_node
)
9099 len
= TREE_VEC_LENGTH (expanded_bases
);
9102 for (idx
= 0; idx
< len
; idx
++)
9105 /* Extract the already-expanded base class. */
9106 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9108 /* Substitute to figure out the base class. */
9109 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9112 if (base
== error_mark_node
)
9115 base_list
= tree_cons (access
, base
, base_list
);
9116 if (BINFO_VIRTUAL_P (pbase_binfo
))
9117 TREE_TYPE (base_list
) = integer_type_node
;
9121 /* The list is now in reverse order; correct that. */
9122 base_list
= nreverse (base_list
);
9125 pop_scope (pushed_scope
);
9127 /* Now call xref_basetypes to set up all the base-class
9129 xref_basetypes (type
, base_list
);
9131 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9132 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9133 args
, tf_error
, NULL_TREE
);
9134 fixup_attribute_variants (type
);
9136 /* Now that our base classes are set up, enter the scope of the
9137 class, so that name lookups into base classes, etc. will work
9138 correctly. This is precisely analogous to what we do in
9139 begin_class_definition when defining an ordinary non-template
9140 class, except we also need to push the enclosing classes. */
9141 push_nested_class (type
);
9143 /* Now members are processed in the order of declaration. */
9144 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9145 member
; member
= TREE_CHAIN (member
))
9147 tree t
= TREE_VALUE (member
);
9149 if (TREE_PURPOSE (member
))
9153 /* Build new CLASSTYPE_NESTED_UTDS. */
9156 bool class_template_p
;
9158 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9159 && TYPE_LANG_SPECIFIC (t
)
9160 && CLASSTYPE_IS_TEMPLATE (t
));
9161 /* If the member is a class template, then -- even after
9162 substitution -- there may be dependent types in the
9163 template argument list for the class. We increment
9164 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9165 that function will assume that no types are dependent
9166 when outside of a template. */
9167 if (class_template_p
)
9168 ++processing_template_decl
;
9169 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9170 if (class_template_p
)
9171 --processing_template_decl
;
9172 if (newtag
== error_mark_node
)
9175 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9177 tree name
= TYPE_IDENTIFIER (t
);
9179 if (class_template_p
)
9180 /* Unfortunately, lookup_template_class sets
9181 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9182 instantiation (i.e., for the type of a member
9183 template class nested within a template class.)
9184 This behavior is required for
9185 maybe_process_partial_specialization to work
9186 correctly, but is not accurate in this case;
9187 the TAG is not an instantiation of anything.
9188 (The corresponding TEMPLATE_DECL is an
9189 instantiation, but the TYPE is not.) */
9190 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9192 /* Now, we call pushtag to put this NEWTAG into the scope of
9193 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9194 pushtag calling push_template_decl. We don't have to do
9195 this for enums because it will already have been done in
9198 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9199 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9202 else if (DECL_DECLARES_FUNCTION_P (t
))
9204 /* Build new TYPE_METHODS. */
9207 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9208 ++processing_template_decl
;
9209 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9210 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9211 --processing_template_decl
;
9212 set_current_access_from_decl (r
);
9213 finish_member_declaration (r
);
9214 /* Instantiate members marked with attribute used. */
9215 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9217 if (TREE_CODE (r
) == FUNCTION_DECL
9218 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9219 cp_check_omp_declare_reduction (r
);
9223 /* Build new TYPE_FIELDS. */
9224 if (TREE_CODE (t
) == STATIC_ASSERT
)
9228 ++c_inhibit_evaluation_warnings
;
9230 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9231 tf_warning_or_error
, NULL_TREE
,
9232 /*integral_constant_expression_p=*/true);
9233 --c_inhibit_evaluation_warnings
;
9235 finish_static_assert (condition
,
9236 STATIC_ASSERT_MESSAGE (t
),
9237 STATIC_ASSERT_SOURCE_LOCATION (t
),
9240 else if (TREE_CODE (t
) != CONST_DECL
)
9243 tree vec
= NULL_TREE
;
9246 /* The file and line for this declaration, to
9247 assist in error message reporting. Since we
9248 called push_tinst_level above, we don't need to
9250 input_location
= DECL_SOURCE_LOCATION (t
);
9252 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9253 ++processing_template_decl
;
9254 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9255 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9256 --processing_template_decl
;
9258 if (TREE_CODE (r
) == TREE_VEC
)
9260 /* A capture pack became multiple fields. */
9262 len
= TREE_VEC_LENGTH (vec
);
9265 for (int i
= 0; i
< len
; ++i
)
9268 r
= TREE_VEC_ELT (vec
, i
);
9273 [t]he initialization (and any associated
9274 side-effects) of a static data member does
9275 not occur unless the static data member is
9276 itself used in a way that requires the
9277 definition of the static data member to
9280 Therefore, we do not substitute into the
9281 initialized for the static data member here. */
9282 finish_static_data_member_decl
9285 /*init_const_expr_p=*/false,
9286 /*asmspec_tree=*/NULL_TREE
,
9288 /* Instantiate members marked with attribute used. */
9289 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9292 else if (TREE_CODE (r
) == FIELD_DECL
)
9294 /* Determine whether R has a valid type and can be
9295 completed later. If R is invalid, then its type
9296 is replaced by error_mark_node. */
9297 tree rtype
= TREE_TYPE (r
);
9298 if (can_complete_type_without_circularity (rtype
))
9299 complete_type (rtype
);
9301 if (!COMPLETE_TYPE_P (rtype
))
9303 cxx_incomplete_type_error (r
, rtype
);
9304 TREE_TYPE (r
) = error_mark_node
;
9308 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9309 such a thing will already have been added to the field
9310 list by tsubst_enum in finish_member_declaration in the
9311 CLASSTYPE_NESTED_UTDS case above. */
9312 if (!(TREE_CODE (r
) == TYPE_DECL
9313 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9314 && DECL_ARTIFICIAL (r
)))
9316 set_current_access_from_decl (r
);
9317 finish_member_declaration (r
);
9325 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9326 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9328 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9330 tree friend_type
= t
;
9331 bool adjust_processing_template_decl
= false;
9333 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9335 /* template <class T> friend class C; */
9336 friend_type
= tsubst_friend_class (friend_type
, args
);
9337 adjust_processing_template_decl
= true;
9339 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9341 /* template <class T> friend class C::D; */
9342 friend_type
= tsubst (friend_type
, args
,
9343 tf_warning_or_error
, NULL_TREE
);
9344 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9345 friend_type
= TREE_TYPE (friend_type
);
9346 adjust_processing_template_decl
= true;
9348 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9349 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9351 /* This could be either
9355 when dependent_type_p is false or
9357 template <class U> friend class T::C;
9360 friend_type
= tsubst (friend_type
, args
,
9361 tf_warning_or_error
, NULL_TREE
);
9362 /* Bump processing_template_decl for correct
9363 dependent_type_p calculation. */
9364 ++processing_template_decl
;
9365 if (dependent_type_p (friend_type
))
9366 adjust_processing_template_decl
= true;
9367 --processing_template_decl
;
9369 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9370 && hidden_name_p (TYPE_NAME (friend_type
)))
9374 where C hasn't been declared yet. Let's lookup name
9375 from namespace scope directly, bypassing any name that
9376 come from dependent base class. */
9377 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9379 /* The call to xref_tag_from_type does injection for friend
9381 push_nested_namespace (ns
);
9383 xref_tag_from_type (friend_type
, NULL_TREE
,
9384 /*tag_scope=*/ts_current
);
9385 pop_nested_namespace (ns
);
9387 else if (uses_template_parms (friend_type
))
9388 /* friend class C<T>; */
9389 friend_type
= tsubst (friend_type
, args
,
9390 tf_warning_or_error
, NULL_TREE
);
9395 where C is already declared or
9397 friend class C<int>;
9399 We don't have to do anything in these cases. */
9401 if (adjust_processing_template_decl
)
9402 /* Trick make_friend_class into realizing that the friend
9403 we're adding is a template, not an ordinary class. It's
9404 important that we use make_friend_class since it will
9405 perform some error-checking and output cross-reference
9407 ++processing_template_decl
;
9409 if (friend_type
!= error_mark_node
)
9410 make_friend_class (type
, friend_type
, /*complain=*/false);
9412 if (adjust_processing_template_decl
)
9413 --processing_template_decl
;
9417 /* Build new DECL_FRIENDLIST. */
9420 /* The file and line for this declaration, to
9421 assist in error message reporting. Since we
9422 called push_tinst_level above, we don't need to
9424 input_location
= DECL_SOURCE_LOCATION (t
);
9426 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9428 ++processing_template_decl
;
9429 push_deferring_access_checks (dk_no_check
);
9432 r
= tsubst_friend_function (t
, args
);
9433 add_friend (type
, r
, /*complain=*/false);
9434 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9436 pop_deferring_access_checks ();
9437 --processing_template_decl
;
9443 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9445 tree decl
= lambda_function (type
);
9448 if (!DECL_TEMPLATE_INFO (decl
)
9449 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9450 instantiate_decl (decl
, false, false);
9452 /* We need to instantiate the capture list from the template
9453 after we've instantiated the closure members, but before we
9454 consider adding the conversion op. Also keep any captures
9455 that may have been added during instantiation of the op(). */
9456 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9458 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9459 args
, tf_warning_or_error
, NULL_TREE
,
9462 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9463 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9465 maybe_add_lambda_conv_op (type
);
9468 gcc_assert (errorcount
);
9471 /* Set the file and line number information to whatever is given for
9472 the class itself. This puts error messages involving generated
9473 implicit functions at a predictable point, and the same point
9474 that would be used for non-template classes. */
9475 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9477 unreverse_member_declarations (type
);
9478 finish_struct_1 (type
);
9479 TYPE_BEING_DEFINED (type
) = 0;
9481 /* We don't instantiate default arguments for member functions. 14.7.1:
9483 The implicit instantiation of a class template specialization causes
9484 the implicit instantiation of the declarations, but not of the
9485 definitions or default arguments, of the class member functions,
9486 member classes, static data members and member templates.... */
9488 /* Some typedefs referenced from within the template code need to be access
9489 checked at template instantiation time, i.e now. These types were
9490 added to the template at parsing time. Let's get those and perform
9491 the access checks then. */
9492 perform_typedefs_access_check (pattern
, args
);
9493 perform_deferred_access_checks (tf_warning_or_error
);
9494 pop_nested_class ();
9495 maximum_field_alignment
= saved_maximum_field_alignment
;
9497 pop_from_top_level ();
9498 pop_deferring_access_checks ();
9501 /* The vtable for a template class can be emitted in any translation
9502 unit in which the class is instantiated. When there is no key
9503 method, however, finish_struct_1 will already have added TYPE to
9504 the keyed_classes list. */
9505 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9506 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9511 /* Wrapper for instantiate_class_template_1. */
9514 instantiate_class_template (tree type
)
9517 timevar_push (TV_TEMPLATE_INST
);
9518 ret
= instantiate_class_template_1 (type
);
9519 timevar_pop (TV_TEMPLATE_INST
);
9524 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9530 else if (TYPE_P (t
))
9531 r
= tsubst (t
, args
, complain
, in_decl
);
9534 if (!(complain
& tf_warning
))
9535 ++c_inhibit_evaluation_warnings
;
9536 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9537 /*integral_constant_expression_p=*/true);
9538 if (!(complain
& tf_warning
))
9539 --c_inhibit_evaluation_warnings
;
9544 /* Given a function parameter pack TMPL_PARM and some function parameters
9545 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9546 and set *SPEC_P to point at the next point in the list. */
9549 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9551 /* Collect all of the extra "packed" parameters into an
9555 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9556 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9557 tree spec_parm
= *spec_p
;
9560 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9562 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9565 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9566 parmvec
= make_tree_vec (len
);
9567 parmtypevec
= make_tree_vec (len
);
9568 spec_parm
= *spec_p
;
9569 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9571 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9572 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9575 /* Build the argument packs. */
9576 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9577 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9578 TREE_TYPE (argpack
) = argtypepack
;
9579 *spec_p
= spec_parm
;
9584 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9585 NONTYPE_ARGUMENT_PACK. */
9588 make_fnparm_pack (tree spec_parm
)
9590 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9593 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9597 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9599 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9600 if (i
>= TREE_VEC_LENGTH (vec
))
9602 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9606 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9609 make_argument_pack_select (tree arg_pack
, unsigned index
)
9611 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9613 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9614 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9619 /* This is a subroutine of tsubst_pack_expansion.
9621 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9622 mechanism to store the (non complete list of) arguments of the
9623 substitution and return a non substituted pack expansion, in order
9624 to wait for when we have enough arguments to really perform the
9628 use_pack_expansion_extra_args_p (tree parm_packs
,
9632 /* If one pack has an expansion and another pack has a normal
9633 argument or if one pack has an empty argument and an another
9634 one hasn't then tsubst_pack_expansion cannot perform the
9635 substitution and need to fall back on the
9636 PACK_EXPANSION_EXTRA mechanism. */
9637 if (parm_packs
== NULL_TREE
)
9639 else if (has_empty_arg
)
9642 bool has_expansion_arg
= false;
9643 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9645 bool has_non_expansion_arg
= false;
9646 for (tree parm_pack
= parm_packs
;
9648 parm_pack
= TREE_CHAIN (parm_pack
))
9650 tree arg
= TREE_VALUE (parm_pack
);
9652 if (argument_pack_element_is_expansion_p (arg
, i
))
9653 has_expansion_arg
= true;
9655 has_non_expansion_arg
= true;
9658 if (has_expansion_arg
&& has_non_expansion_arg
)
9664 /* [temp.variadic]/6 says that:
9666 The instantiation of a pack expansion [...]
9667 produces a list E1,E2, ..., En, where N is the number of elements
9668 in the pack expansion parameters.
9670 This subroutine of tsubst_pack_expansion produces one of these Ei.
9672 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9673 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9674 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9675 INDEX is the index 'i' of the element Ei to produce. ARGS,
9676 COMPLAIN, and IN_DECL are the same parameters as for the
9677 tsubst_pack_expansion function.
9679 The function returns the resulting Ei upon successful completion,
9682 Note that this function possibly modifies the ARGS parameter, so
9683 it's the responsibility of the caller to restore it. */
9686 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9689 tree args
/* This parm gets
9691 tsubst_flags_t complain
,
9695 bool ith_elem_is_expansion
= false;
9697 /* For each parameter pack, change the substitution of the parameter
9698 pack to the ith argument in its argument pack, then expand the
9700 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9702 tree parm
= TREE_PURPOSE (pack
);
9703 tree arg_pack
= TREE_VALUE (pack
);
9704 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9706 ith_elem_is_expansion
|=
9707 argument_pack_element_is_expansion_p (arg_pack
, index
);
9709 /* Select the Ith argument from the pack. */
9710 if (TREE_CODE (parm
) == PARM_DECL
9711 || TREE_CODE (parm
) == FIELD_DECL
)
9715 aps
= make_argument_pack_select (arg_pack
, index
);
9717 register_local_specialization (aps
, parm
);
9720 aps
= retrieve_local_specialization (parm
);
9725 template_parm_level_and_index (parm
, &level
, &idx
);
9729 aps
= make_argument_pack_select (arg_pack
, index
);
9730 /* Update the corresponding argument. */
9731 TMPL_ARG (args
, level
, idx
) = aps
;
9734 /* Re-use the ARGUMENT_PACK_SELECT. */
9735 aps
= TMPL_ARG (args
, level
, idx
);
9737 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9740 /* Substitute into the PATTERN with the (possibly altered)
9742 if (pattern
== in_decl
)
9743 /* Expanding a fixed parameter pack from
9744 coerce_template_parameter_pack. */
9745 t
= tsubst_decl (pattern
, args
, complain
);
9746 else if (!TYPE_P (pattern
))
9747 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9748 /*integral_constant_expression_p=*/false);
9750 t
= tsubst (pattern
, args
, complain
, in_decl
);
9752 /* If the Ith argument pack element is a pack expansion, then
9753 the Ith element resulting from the substituting is going to
9754 be a pack expansion as well. */
9755 if (ith_elem_is_expansion
)
9756 t
= make_pack_expansion (t
);
9761 /* Substitute ARGS into T, which is an pack expansion
9762 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9763 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9764 (if only a partial substitution could be performed) or
9765 ERROR_MARK_NODE if there was an error. */
9767 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9771 tree pack
, packs
= NULL_TREE
;
9772 bool unsubstituted_packs
= false;
9775 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
9776 bool need_local_specializations
= false;
9779 gcc_assert (PACK_EXPANSION_P (t
));
9780 pattern
= PACK_EXPANSION_PATTERN (t
);
9782 /* Add in any args remembered from an earlier partial instantiation. */
9783 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9785 levels
= TMPL_ARGS_DEPTH (args
);
9787 /* Determine the argument packs that will instantiate the parameter
9788 packs used in the expansion expression. While we're at it,
9789 compute the number of arguments to be expanded and make sure it
9791 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9792 pack
= TREE_CHAIN (pack
))
9794 tree parm_pack
= TREE_VALUE (pack
);
9795 tree arg_pack
= NULL_TREE
;
9796 tree orig_arg
= NULL_TREE
;
9799 if (TREE_CODE (parm_pack
) == BASES
)
9801 if (BASES_DIRECT (parm_pack
))
9802 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9803 args
, complain
, in_decl
, false));
9805 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9806 args
, complain
, in_decl
, false));
9808 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9810 if (PACK_EXPANSION_LOCAL_P (t
))
9811 arg_pack
= retrieve_local_specialization (parm_pack
);
9814 /* We can't rely on local_specializations for a parameter
9815 name used later in a function declaration (such as in a
9816 late-specified return type). Even if it exists, it might
9817 have the wrong value for a recursive call. Just make a
9818 dummy decl, since it's only used for its type. */
9819 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9820 if (arg_pack
&& DECL_PACK_P (arg_pack
))
9821 /* Partial instantiation of the parm_pack, we can't build
9822 up an argument pack yet. */
9823 arg_pack
= NULL_TREE
;
9825 arg_pack
= make_fnparm_pack (arg_pack
);
9826 need_local_specializations
= true;
9829 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
9830 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
9834 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9836 if (level
<= levels
)
9837 arg_pack
= TMPL_ARG (args
, level
, idx
);
9840 orig_arg
= arg_pack
;
9841 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9842 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9844 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9845 /* This can only happen if we forget to expand an argument
9846 pack somewhere else. Just return an error, silently. */
9848 result
= make_tree_vec (1);
9849 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9856 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9858 /* Don't bother trying to do a partial substitution with
9859 incomplete packs; we'll try again after deduction. */
9860 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9865 else if (len
!= my_len
)
9867 if (!(complain
& tf_error
))
9868 /* Fail quietly. */;
9869 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9870 error ("mismatched argument pack lengths while expanding "
9874 error ("mismatched argument pack lengths while expanding "
9877 return error_mark_node
;
9880 /* Keep track of the parameter packs and their corresponding
9882 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9883 TREE_TYPE (packs
) = orig_arg
;
9887 /* We can't substitute for this parameter pack. We use a flag as
9888 well as the missing_level counter because function parameter
9889 packs don't have a level. */
9890 unsubstituted_packs
= true;
9894 /* We cannot expand this expansion expression, because we don't have
9895 all of the argument packs we need. */
9896 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9898 /* We got some full packs, but we can't substitute them in until we
9899 have values for all the packs. So remember these until then. */
9901 t
= make_pack_expansion (pattern
);
9902 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9905 else if (unsubstituted_packs
)
9907 /* There were no real arguments, we're just replacing a parameter
9908 pack with another version of itself. Substitute into the
9909 pattern and return a PACK_EXPANSION_*. The caller will need to
9911 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9912 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9913 /*integral_constant_expression_p=*/false);
9915 t
= tsubst (pattern
, args
, complain
, in_decl
);
9916 t
= make_pack_expansion (t
);
9920 gcc_assert (len
>= 0);
9922 if (need_local_specializations
)
9924 /* We're in a late-specified return type, so create our own local
9925 specializations map; the current map is either NULL or (in the
9926 case of recursive unification) might have bindings that we don't
9927 want to use or alter. */
9928 saved_local_specializations
= local_specializations
;
9929 local_specializations
= new hash_map
<tree
, tree
>;
9932 /* For each argument in each argument pack, substitute into the
9934 result
= make_tree_vec (len
);
9935 for (i
= 0; i
< len
; ++i
)
9937 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9941 TREE_VEC_ELT (result
, i
) = t
;
9942 if (t
== error_mark_node
)
9944 result
= error_mark_node
;
9949 /* Update ARGS to restore the substitution from parameter packs to
9950 their argument packs. */
9951 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9953 tree parm
= TREE_PURPOSE (pack
);
9955 if (TREE_CODE (parm
) == PARM_DECL
9956 || TREE_CODE (parm
) == FIELD_DECL
)
9957 register_local_specialization (TREE_TYPE (pack
), parm
);
9962 if (TREE_VALUE (pack
) == NULL_TREE
)
9965 template_parm_level_and_index (parm
, &level
, &idx
);
9967 /* Update the corresponding argument. */
9968 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9969 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9972 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9976 if (need_local_specializations
)
9978 delete local_specializations
;
9979 local_specializations
= saved_local_specializations
;
9985 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
9986 TMPL. We do this using DECL_PARM_INDEX, which should work even with
9987 parameter packs; all parms generated from a function parameter pack will
9988 have the same DECL_PARM_INDEX. */
9991 get_pattern_parm (tree parm
, tree tmpl
)
9993 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9996 if (DECL_ARTIFICIAL (parm
))
9998 for (patparm
= DECL_ARGUMENTS (pattern
);
9999 patparm
; patparm
= DECL_CHAIN (patparm
))
10000 if (DECL_ARTIFICIAL (patparm
)
10001 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10006 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10007 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10008 gcc_assert (DECL_PARM_INDEX (patparm
)
10009 == DECL_PARM_INDEX (parm
));
10015 /* Substitute ARGS into the vector or list of template arguments T. */
10018 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10021 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10024 if (t
== error_mark_node
)
10025 return error_mark_node
;
10027 len
= TREE_VEC_LENGTH (t
);
10028 elts
= XALLOCAVEC (tree
, len
);
10030 for (i
= 0; i
< len
; i
++)
10032 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10035 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10036 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10037 else if (PACK_EXPANSION_P (orig_arg
))
10039 /* Substitute into an expansion expression. */
10040 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10042 if (TREE_CODE (new_arg
) == TREE_VEC
)
10043 /* Add to the expanded length adjustment the number of
10044 expanded arguments. We subtract one from this
10045 measurement, because the argument pack expression
10046 itself is already counted as 1 in
10047 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10048 the argument pack is empty. */
10049 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10051 else if (ARGUMENT_PACK_P (orig_arg
))
10053 /* Substitute into each of the arguments. */
10054 new_arg
= TYPE_P (orig_arg
)
10055 ? cxx_make_type (TREE_CODE (orig_arg
))
10056 : make_node (TREE_CODE (orig_arg
));
10058 SET_ARGUMENT_PACK_ARGS (
10060 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10061 args
, complain
, in_decl
));
10063 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10064 new_arg
= error_mark_node
;
10066 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10067 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10068 complain
, in_decl
);
10069 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10071 if (TREE_TYPE (new_arg
) == error_mark_node
)
10072 new_arg
= error_mark_node
;
10076 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10078 if (new_arg
== error_mark_node
)
10079 return error_mark_node
;
10082 if (new_arg
!= orig_arg
)
10089 /* Make space for the expanded arguments coming from template
10091 t
= make_tree_vec (len
+ expanded_len_adjust
);
10092 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10093 arguments for a member template.
10094 In that case each TREE_VEC in ORIG_T represents a level of template
10095 arguments, and ORIG_T won't carry any non defaulted argument count.
10096 It will rather be the nested TREE_VECs that will carry one.
10097 In other words, ORIG_T carries a non defaulted argument count only
10098 if it doesn't contain any nested TREE_VEC. */
10099 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10101 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10102 count
+= expanded_len_adjust
;
10103 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10105 for (i
= 0, out
= 0; i
< len
; i
++)
10107 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10108 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10109 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10113 /* Now expand the template argument pack "in place". */
10114 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10115 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10119 TREE_VEC_ELT (t
, out
) = elts
[i
];
10127 /* Return the result of substituting ARGS into the template parameters
10128 given by PARMS. If there are m levels of ARGS and m + n levels of
10129 PARMS, then the result will contain n levels of PARMS. For
10130 example, if PARMS is `template <class T> template <class U>
10131 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10132 result will be `template <int*, double, class V>'. */
10135 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10137 tree r
= NULL_TREE
;
10140 /* When substituting into a template, we must set
10141 PROCESSING_TEMPLATE_DECL as the template parameters may be
10142 dependent if they are based on one-another, and the dependency
10143 predicates are short-circuit outside of templates. */
10144 ++processing_template_decl
;
10146 for (new_parms
= &r
;
10147 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10148 new_parms
= &(TREE_CHAIN (*new_parms
)),
10149 parms
= TREE_CHAIN (parms
))
10152 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10155 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10159 if (parms
== error_mark_node
)
10162 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10164 if (tuple
== error_mark_node
)
10167 TREE_VEC_ELT (new_vec
, i
) =
10168 tsubst_template_parm (tuple
, args
, complain
);
10172 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10173 - TMPL_ARGS_DEPTH (args
)),
10174 new_vec
, NULL_TREE
);
10177 --processing_template_decl
;
10182 /* Return the result of substituting ARGS into one template parameter
10183 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10184 parameter and which TREE_PURPOSE is the default argument of the
10185 template parameter. */
10188 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10190 tree default_value
, parm_decl
;
10192 if (args
== NULL_TREE
10194 || t
== error_mark_node
)
10197 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10199 default_value
= TREE_PURPOSE (t
);
10200 parm_decl
= TREE_VALUE (t
);
10202 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10203 if (TREE_CODE (parm_decl
) == PARM_DECL
10204 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10205 parm_decl
= error_mark_node
;
10206 default_value
= tsubst_template_arg (default_value
, args
,
10207 complain
, NULL_TREE
);
10209 return build_tree_list (default_value
, parm_decl
);
10212 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10213 type T. If T is not an aggregate or enumeration type, it is
10214 handled as if by tsubst. IN_DECL is as for tsubst. If
10215 ENTERING_SCOPE is nonzero, T is the context for a template which
10216 we are presently tsubst'ing. Return the substituted value. */
10219 tsubst_aggr_type (tree t
,
10221 tsubst_flags_t complain
,
10223 int entering_scope
)
10225 if (t
== NULL_TREE
)
10228 switch (TREE_CODE (t
))
10231 if (TYPE_PTRMEMFUNC_P (t
))
10232 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10234 /* Else fall through. */
10235 case ENUMERAL_TYPE
:
10237 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10242 int saved_unevaluated_operand
;
10243 int saved_inhibit_evaluation_warnings
;
10245 /* In "sizeof(X<I>)" we need to evaluate "I". */
10246 saved_unevaluated_operand
= cp_unevaluated_operand
;
10247 cp_unevaluated_operand
= 0;
10248 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10249 c_inhibit_evaluation_warnings
= 0;
10251 /* First, determine the context for the type we are looking
10253 context
= TYPE_CONTEXT (t
);
10254 if (context
&& TYPE_P (context
))
10256 context
= tsubst_aggr_type (context
, args
, complain
,
10257 in_decl
, /*entering_scope=*/1);
10258 /* If context is a nested class inside a class template,
10259 it may still need to be instantiated (c++/33959). */
10260 context
= complete_type (context
);
10263 /* Then, figure out what arguments are appropriate for the
10264 type we are trying to find. For example, given:
10266 template <class T> struct S;
10267 template <class T, class U> void f(T, U) { S<U> su; }
10269 and supposing that we are instantiating f<int, double>,
10270 then our ARGS will be {int, double}, but, when looking up
10271 S we only want {double}. */
10272 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10273 complain
, in_decl
);
10274 if (argvec
== error_mark_node
)
10275 r
= error_mark_node
;
10278 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10279 entering_scope
, complain
);
10280 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10283 cp_unevaluated_operand
= saved_unevaluated_operand
;
10284 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10289 /* This is not a template type, so there's nothing to do. */
10293 return tsubst (t
, args
, complain
, in_decl
);
10297 /* Substitute into the default argument ARG (a default argument for
10298 FN), which has the indicated TYPE. */
10301 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10303 tree saved_class_ptr
= NULL_TREE
;
10304 tree saved_class_ref
= NULL_TREE
;
10305 int errs
= errorcount
+ sorrycount
;
10307 /* This can happen in invalid code. */
10308 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10311 /* This default argument came from a template. Instantiate the
10312 default argument here, not in tsubst. In the case of
10321 we must be careful to do name lookup in the scope of S<T>,
10322 rather than in the current class. */
10323 push_access_scope (fn
);
10324 /* The "this" pointer is not valid in a default argument. */
10327 saved_class_ptr
= current_class_ptr
;
10328 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10329 saved_class_ref
= current_class_ref
;
10330 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10333 push_deferring_access_checks(dk_no_deferred
);
10334 /* The default argument expression may cause implicitly defined
10335 member functions to be synthesized, which will result in garbage
10336 collection. We must treat this situation as if we were within
10337 the body of function so as to avoid collecting live data on the
10340 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10341 complain
, NULL_TREE
,
10342 /*integral_constant_expression_p=*/false);
10344 pop_deferring_access_checks();
10346 /* Restore the "this" pointer. */
10349 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10350 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10353 if (errorcount
+sorrycount
> errs
10354 && (complain
& tf_warning_or_error
))
10355 inform (input_location
,
10356 " when instantiating default argument for call to %D", fn
);
10358 /* Make sure the default argument is reasonable. */
10359 arg
= check_default_argument (type
, arg
, complain
);
10361 pop_access_scope (fn
);
10366 /* Substitute into all the default arguments for FN. */
10369 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10374 tmpl_args
= DECL_TI_ARGS (fn
);
10376 /* If this function is not yet instantiated, we certainly don't need
10377 its default arguments. */
10378 if (uses_template_parms (tmpl_args
))
10380 /* Don't do this again for clones. */
10381 if (DECL_CLONED_FUNCTION_P (fn
))
10384 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10386 arg
= TREE_CHAIN (arg
))
10387 if (TREE_PURPOSE (arg
))
10388 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10390 TREE_PURPOSE (arg
),
10394 /* Substitute the ARGS into the T, which is a _DECL. Return the
10395 result of the substitution. Issue error and warning messages under
10396 control of COMPLAIN. */
10399 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10401 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10402 location_t saved_loc
;
10403 tree r
= NULL_TREE
;
10405 hashval_t hash
= 0;
10407 /* Set the filename and linenumber to improve error-reporting. */
10408 saved_loc
= input_location
;
10409 input_location
= DECL_SOURCE_LOCATION (t
);
10411 switch (TREE_CODE (t
))
10413 case TEMPLATE_DECL
:
10415 /* We can get here when processing a member function template,
10416 member class template, or template template parameter. */
10417 tree decl
= DECL_TEMPLATE_RESULT (t
);
10422 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10424 /* Template template parameter is treated here. */
10425 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10426 if (new_type
== error_mark_node
)
10427 RETURN (error_mark_node
);
10428 /* If we get a real template back, return it. This can happen in
10429 the context of most_specialized_class. */
10430 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10434 DECL_CHAIN (r
) = NULL_TREE
;
10435 TREE_TYPE (r
) = new_type
;
10436 DECL_TEMPLATE_RESULT (r
)
10437 = build_decl (DECL_SOURCE_LOCATION (decl
),
10438 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10439 DECL_TEMPLATE_PARMS (r
)
10440 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10442 TYPE_NAME (new_type
) = r
;
10446 /* We might already have an instance of this template.
10447 The ARGS are for the surrounding class type, so the
10448 full args contain the tsubst'd args for the context,
10449 plus the innermost args from the template decl. */
10450 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10451 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10452 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10453 /* Because this is a template, the arguments will still be
10454 dependent, even after substitution. If
10455 PROCESSING_TEMPLATE_DECL is not set, the dependency
10456 predicates will short-circuit. */
10457 ++processing_template_decl
;
10458 full_args
= tsubst_template_args (tmpl_args
, args
,
10459 complain
, in_decl
);
10460 --processing_template_decl
;
10461 if (full_args
== error_mark_node
)
10462 RETURN (error_mark_node
);
10464 /* If this is a default template template argument,
10465 tsubst might not have changed anything. */
10466 if (full_args
== tmpl_args
)
10469 hash
= hash_tmpl_and_args (t
, full_args
);
10470 spec
= retrieve_specialization (t
, full_args
, hash
);
10471 if (spec
!= NULL_TREE
)
10477 /* Make a new template decl. It will be similar to the
10478 original, but will record the current template arguments.
10479 We also create a new function declaration, which is just
10480 like the old one, but points to this new template, rather
10481 than the old one. */
10483 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10484 DECL_CHAIN (r
) = NULL_TREE
;
10486 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10488 if (TREE_CODE (decl
) == TYPE_DECL
10489 && !TYPE_DECL_ALIAS_P (decl
))
10492 ++processing_template_decl
;
10493 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10494 --processing_template_decl
;
10495 if (new_type
== error_mark_node
)
10496 RETURN (error_mark_node
);
10498 TREE_TYPE (r
) = new_type
;
10499 /* For a partial specialization, we need to keep pointing to
10500 the primary template. */
10501 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10502 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10503 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10504 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10505 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10510 ++processing_template_decl
;
10511 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10512 --processing_template_decl
;
10513 if (new_decl
== error_mark_node
)
10514 RETURN (error_mark_node
);
10516 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10517 DECL_TI_TEMPLATE (new_decl
) = r
;
10518 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10519 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10520 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10523 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10524 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10525 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10527 /* The template parameters for this new template are all the
10528 template parameters for the old template, except the
10529 outermost level of parameters. */
10530 DECL_TEMPLATE_PARMS (r
)
10531 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10534 if (PRIMARY_TEMPLATE_P (t
))
10535 DECL_PRIMARY_TEMPLATE (r
) = r
;
10537 if (TREE_CODE (decl
) != TYPE_DECL
&& TREE_CODE (decl
) != VAR_DECL
)
10538 /* Record this non-type partial instantiation. */
10539 register_specialization (r
, t
,
10540 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10545 case FUNCTION_DECL
:
10548 tree argvec
= NULL_TREE
;
10556 /* Nobody should be tsubst'ing into non-template functions. */
10557 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10559 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10564 /* If T is not dependent, just return it. We have to
10565 increment PROCESSING_TEMPLATE_DECL because
10566 value_dependent_expression_p assumes that nothing is
10567 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10568 ++processing_template_decl
;
10569 dependent_p
= value_dependent_expression_p (t
);
10570 --processing_template_decl
;
10574 /* Calculate the most general template of which R is a
10575 specialization, and the complete set of arguments used to
10577 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10578 argvec
= tsubst_template_args (DECL_TI_ARGS
10579 (DECL_TEMPLATE_RESULT
10580 (DECL_TI_TEMPLATE (t
))),
10581 args
, complain
, in_decl
);
10582 if (argvec
== error_mark_node
)
10583 RETURN (error_mark_node
);
10585 /* Check to see if we already have this specialization. */
10586 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10587 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10595 /* We can see more levels of arguments than parameters if
10596 there was a specialization of a member template, like
10599 template <class T> struct S { template <class U> void f(); }
10600 template <> template <class U> void S<int>::f(U);
10602 Here, we'll be substituting into the specialization,
10603 because that's where we can find the code we actually
10604 want to generate, but we'll have enough arguments for
10605 the most general template.
10607 We also deal with the peculiar case:
10609 template <class T> struct S {
10610 template <class U> friend void f();
10612 template <class U> void f() {}
10614 template void f<double>();
10616 Here, the ARGS for the instantiation of will be {int,
10617 double}. But, we only need as many ARGS as there are
10618 levels of template parameters in CODE_PATTERN. We are
10619 careful not to get fooled into reducing the ARGS in
10622 template <class T> struct S { template <class U> void f(U); }
10623 template <class T> template <> void S<T>::f(int) {}
10625 which we can spot because the pattern will be a
10626 specialization in this case. */
10627 args_depth
= TMPL_ARGS_DEPTH (args
);
10629 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10630 if (args_depth
> parms_depth
10631 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10632 args
= get_innermost_template_args (args
, parms_depth
);
10636 /* This special case arises when we have something like this:
10638 template <class T> struct S {
10639 friend void f<int>(int, double);
10642 Here, the DECL_TI_TEMPLATE for the friend declaration
10643 will be an IDENTIFIER_NODE. We are being called from
10644 tsubst_friend_function, and we want only to create a
10645 new decl (R) with appropriate types so that we can call
10646 determine_specialization. */
10647 gen_tmpl
= NULL_TREE
;
10650 if (DECL_CLASS_SCOPE_P (t
))
10652 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10656 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10657 complain
, t
, /*entering_scope=*/1);
10662 ctx
= DECL_CONTEXT (t
);
10664 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10665 if (type
== error_mark_node
)
10666 RETURN (error_mark_node
);
10668 /* If we hit excessive deduction depth, the type is bogus even if
10669 it isn't error_mark_node, so don't build a decl. */
10670 if (excessive_deduction_depth
)
10671 RETURN (error_mark_node
);
10673 /* We do NOT check for matching decls pushed separately at this
10674 point, as they may not represent instantiations of this
10675 template, and in any case are considered separate under the
10678 DECL_USE_TEMPLATE (r
) = 0;
10679 TREE_TYPE (r
) = type
;
10680 /* Clear out the mangled name and RTL for the instantiation. */
10681 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10682 SET_DECL_RTL (r
, NULL
);
10683 /* Leave DECL_INITIAL set on deleted instantiations. */
10684 if (!DECL_DELETED_FN (r
))
10685 DECL_INITIAL (r
) = NULL_TREE
;
10686 DECL_CONTEXT (r
) = ctx
;
10688 /* OpenMP UDRs have the only argument a reference to the declared
10689 type. We want to diagnose if the declared type is a reference,
10690 which is invalid, but as references to references are usually
10691 quietly merged, diagnose it here. */
10692 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10695 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10696 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10697 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10698 error_at (DECL_SOURCE_LOCATION (t
),
10699 "reference type %qT in "
10700 "%<#pragma omp declare reduction%>", argtype
);
10701 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10702 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10706 if (member
&& DECL_CONV_FN_P (r
))
10707 /* Type-conversion operator. Reconstruct the name, in
10708 case it's the name of one of the template's parameters. */
10709 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10711 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10713 DECL_RESULT (r
) = NULL_TREE
;
10715 TREE_STATIC (r
) = 0;
10716 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10717 DECL_EXTERNAL (r
) = 1;
10718 /* If this is an instantiation of a function with internal
10719 linkage, we already know what object file linkage will be
10720 assigned to the instantiation. */
10721 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10722 DECL_DEFER_OUTPUT (r
) = 0;
10723 DECL_CHAIN (r
) = NULL_TREE
;
10724 DECL_PENDING_INLINE_INFO (r
) = 0;
10725 DECL_PENDING_INLINE_P (r
) = 0;
10726 DECL_SAVED_TREE (r
) = NULL_TREE
;
10727 DECL_STRUCT_FUNCTION (r
) = NULL
;
10729 /* We'll re-clone as appropriate in instantiate_template. */
10730 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10732 /* If we aren't complaining now, return on error before we register
10733 the specialization so that we'll complain eventually. */
10734 if ((complain
& tf_error
) == 0
10735 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10736 && !grok_op_properties (r
, /*complain=*/false))
10737 RETURN (error_mark_node
);
10739 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10740 this in the special friend case mentioned above where
10741 GEN_TMPL is NULL. */
10744 DECL_TEMPLATE_INFO (r
)
10745 = build_template_info (gen_tmpl
, argvec
);
10746 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10749 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10751 /* We instantiated this while substituting into
10752 the type earlier (template/friend54.C). */
10755 /* We're not supposed to instantiate default arguments
10756 until they are called, for a template. But, for a
10759 template <class T> void f ()
10760 { extern void g(int i = T()); }
10762 we should do the substitution when the template is
10763 instantiated. We handle the member function case in
10764 instantiate_class_template since the default arguments
10765 might refer to other members of the class. */
10767 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10768 && !uses_template_parms (argvec
))
10769 tsubst_default_arguments (r
, complain
);
10772 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10774 /* Copy the list of befriending classes. */
10775 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10777 friends
= &TREE_CHAIN (*friends
))
10779 *friends
= copy_node (*friends
);
10780 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10785 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10787 maybe_retrofit_in_chrg (r
);
10788 if (DECL_CONSTRUCTOR_P (r
))
10789 grok_ctor_properties (ctx
, r
);
10790 if (DECL_INHERITED_CTOR_BASE (r
))
10791 deduce_inheriting_ctor (r
);
10792 /* If this is an instantiation of a member template, clone it.
10793 If it isn't, that'll be handled by
10794 clone_constructors_and_destructors. */
10795 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10796 clone_function_decl (r
, /*update_method_vec_p=*/0);
10798 else if ((complain
& tf_error
) != 0
10799 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10800 && !grok_op_properties (r
, /*complain=*/true))
10801 RETURN (error_mark_node
);
10803 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10804 SET_DECL_FRIEND_CONTEXT (r
,
10805 tsubst (DECL_FRIEND_CONTEXT (t
),
10806 args
, complain
, in_decl
));
10808 /* Possibly limit visibility based on template args. */
10809 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10810 if (DECL_VISIBILITY_SPECIFIED (t
))
10812 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10813 DECL_ATTRIBUTES (r
)
10814 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10816 determine_visibility (r
);
10817 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10818 && !processing_template_decl
)
10819 defaulted_late_check (r
);
10821 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10822 args
, complain
, in_decl
);
10828 tree type
= NULL_TREE
;
10830 tree expanded_types
= NULL_TREE
;
10831 tree prev_r
= NULL_TREE
;
10832 tree first_r
= NULL_TREE
;
10834 if (DECL_PACK_P (t
))
10836 /* If there is a local specialization that isn't a
10837 parameter pack, it means that we're doing a "simple"
10838 substitution from inside tsubst_pack_expansion. Just
10839 return the local specialization (which will be a single
10841 tree spec
= retrieve_local_specialization (t
);
10843 && TREE_CODE (spec
) == PARM_DECL
10844 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10847 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10848 the parameters in this function parameter pack. */
10849 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10850 complain
, in_decl
);
10851 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10853 len
= TREE_VEC_LENGTH (expanded_types
);
10855 /* Zero-length parameter packs are boring. Just substitute
10858 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10863 /* All we did was update the type. Make a note of that. */
10864 type
= expanded_types
;
10865 expanded_types
= NULL_TREE
;
10869 /* Loop through all of the parameters we'll build. When T is
10870 a function parameter pack, LEN is the number of expanded
10871 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10873 for (i
= 0; i
< len
; ++i
)
10877 if (DECL_TEMPLATE_PARM_P (t
))
10878 SET_DECL_TEMPLATE_PARM_P (r
);
10880 if (expanded_types
)
10881 /* We're on the Ith parameter of the function parameter
10884 /* Get the Ith type. */
10885 type
= TREE_VEC_ELT (expanded_types
, i
);
10887 /* Rename the parameter to include the index. */
10889 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10892 /* We're dealing with a normal parameter. */
10893 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10895 type
= type_decays_to (type
);
10896 TREE_TYPE (r
) = type
;
10897 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10899 if (DECL_INITIAL (r
))
10901 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10902 DECL_INITIAL (r
) = TREE_TYPE (r
);
10904 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10905 complain
, in_decl
);
10908 DECL_CONTEXT (r
) = NULL_TREE
;
10910 if (!DECL_TEMPLATE_PARM_P (r
))
10911 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10913 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10914 args
, complain
, in_decl
);
10916 /* Keep track of the first new parameter we
10917 generate. That's what will be returned to the
10922 /* Build a proper chain of parameters when substituting
10923 into a function parameter pack. */
10925 DECL_CHAIN (prev_r
) = r
;
10928 /* If cp_unevaluated_operand is set, we're just looking for a
10929 single dummy parameter, so don't keep going. */
10930 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10931 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10932 complain
, DECL_CHAIN (t
));
10934 /* FIRST_R contains the start of the chain we've built. */
10941 tree type
= NULL_TREE
;
10942 tree vec
= NULL_TREE
;
10943 tree expanded_types
= NULL_TREE
;
10946 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
10948 /* This field is a lambda capture pack. Return a TREE_VEC of
10949 the expanded fields to instantiate_class_template_1 and
10950 store them in the specializations hash table as a
10951 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
10952 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10953 complain
, in_decl
);
10954 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10956 len
= TREE_VEC_LENGTH (expanded_types
);
10957 vec
= make_tree_vec (len
);
10961 /* All we did was update the type. Make a note of that. */
10962 type
= expanded_types
;
10963 expanded_types
= NULL_TREE
;
10967 for (int i
= 0; i
< len
; ++i
)
10970 if (expanded_types
)
10972 type
= TREE_VEC_ELT (expanded_types
, i
);
10974 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10977 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10979 if (type
== error_mark_node
)
10980 RETURN (error_mark_node
);
10981 TREE_TYPE (r
) = type
;
10982 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10984 if (DECL_C_BIT_FIELD (r
))
10985 /* For bit-fields, DECL_INITIAL gives the number of bits. For
10986 non-bit-fields DECL_INITIAL is a non-static data member
10987 initializer, which gets deferred instantiation. */
10989 = tsubst_expr (DECL_INITIAL (t
), args
,
10991 /*integral_constant_expression_p=*/true);
10992 else if (DECL_INITIAL (t
))
10994 /* Set up DECL_TEMPLATE_INFO so that we can get at the
10995 NSDMI in perform_member_init. Still set DECL_INITIAL
10996 so that we know there is one. */
10997 DECL_INITIAL (r
) = void_node
;
10998 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
10999 retrofit_lang_decl (r
);
11000 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11002 /* We don't have to set DECL_CONTEXT here; it is set by
11003 finish_member_declaration. */
11004 DECL_CHAIN (r
) = NULL_TREE
;
11006 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11007 args
, complain
, in_decl
);
11010 TREE_VEC_ELT (vec
, i
) = r
;
11016 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11017 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11018 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11019 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11020 TREE_TYPE (pack
) = tpack
;
11021 register_specialization (pack
, t
, args
, false, 0);
11027 /* We reach here only for member using decls. We also need to check
11028 uses_template_parms because DECL_DEPENDENT_P is not set for a
11029 using-declaration that designates a member of the current
11030 instantiation (c++/53549). */
11031 if (DECL_DEPENDENT_P (t
)
11032 || uses_template_parms (USING_DECL_SCOPE (t
)))
11034 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11035 complain
, in_decl
);
11036 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11037 r
= do_class_using_decl (inst_scope
, name
);
11039 r
= error_mark_node
;
11042 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11043 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11049 DECL_CHAIN (r
) = NULL_TREE
;
11056 tree argvec
= NULL_TREE
;
11057 tree gen_tmpl
= NULL_TREE
;
11059 tree tmpl
= NULL_TREE
;
11061 tree type
= NULL_TREE
;
11064 if (TREE_TYPE (t
) == error_mark_node
)
11065 RETURN (error_mark_node
);
11067 if (TREE_CODE (t
) == TYPE_DECL
11068 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11070 /* If this is the canonical decl, we don't have to
11071 mess with instantiations, and often we can't (for
11072 typename, template type parms and such). Note that
11073 TYPE_NAME is not correct for the above test if
11074 we've copied the type for a typedef. */
11075 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11076 if (type
== error_mark_node
)
11077 RETURN (error_mark_node
);
11078 r
= TYPE_NAME (type
);
11082 /* Check to see if we already have the specialization we
11085 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11087 /* T is a static data member or namespace-scope entity.
11088 We have to substitute into namespace-scope variables
11089 (even though such entities are never templates) because
11092 template <class T> void f() { extern T t; }
11094 where the entity referenced is not known until
11095 instantiation time. */
11097 ctx
= DECL_CONTEXT (t
);
11098 if (DECL_CLASS_SCOPE_P (t
))
11100 ctx
= tsubst_aggr_type (ctx
, args
,
11102 in_decl
, /*entering_scope=*/1);
11103 /* If CTX is unchanged, then T is in fact the
11104 specialization we want. That situation occurs when
11105 referencing a static data member within in its own
11106 class. We can use pointer equality, rather than
11107 same_type_p, because DECL_CONTEXT is always
11109 if (ctx
== DECL_CONTEXT (t
)
11110 && (TREE_CODE (t
) != TYPE_DECL
11111 /* ... unless T is a member template; in which
11112 case our caller can be willing to create a
11113 specialization of that template represented
11115 || !(DECL_TI_TEMPLATE (t
)
11116 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))))
11122 tmpl
= DECL_TI_TEMPLATE (t
);
11123 gen_tmpl
= most_general_template (tmpl
);
11124 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11125 if (argvec
== error_mark_node
)
11126 RETURN (error_mark_node
);
11127 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11128 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11133 /* A local variable. */
11135 /* Subsequent calls to pushdecl will fill this in. */
11137 spec
= retrieve_local_specialization (t
);
11139 /* If we already have the specialization we need, there is
11140 nothing more to do. */
11147 /* Create a new node for the specialization we need. */
11149 if (type
== NULL_TREE
)
11151 if (is_typedef_decl (t
))
11152 type
= DECL_ORIGINAL_TYPE (t
);
11154 type
= TREE_TYPE (t
);
11156 && VAR_HAD_UNKNOWN_BOUND (t
)
11157 && type
!= error_mark_node
)
11158 type
= strip_array_domain (type
);
11159 type
= tsubst (type
, args
, complain
, in_decl
);
11163 /* Even if the original location is out of scope, the
11164 newly substituted one is not. */
11165 DECL_DEAD_FOR_LOCAL (r
) = 0;
11166 DECL_INITIALIZED_P (r
) = 0;
11167 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11168 if (type
== error_mark_node
)
11169 RETURN (error_mark_node
);
11170 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11172 /* It may seem that this case cannot occur, since:
11177 declares a function, not a variable. However:
11180 template <typename T> void g() { T t; }
11181 template void g<f>();
11183 is an attempt to declare a variable with function
11185 error ("variable %qD has function type",
11186 /* R is not yet sufficiently initialized, so we
11187 just use its name. */
11189 RETURN (error_mark_node
);
11191 type
= complete_type (type
);
11192 /* Wait until cp_finish_decl to set this again, to handle
11193 circular dependency (template/instantiate6.C). */
11194 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11195 type
= check_var_type (DECL_NAME (r
), type
);
11197 if (DECL_HAS_VALUE_EXPR_P (t
))
11199 tree ve
= DECL_VALUE_EXPR (t
);
11200 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11201 /*constant_expression_p=*/false);
11202 if (REFERENCE_REF_P (ve
))
11204 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11205 ve
= TREE_OPERAND (ve
, 0);
11207 SET_DECL_VALUE_EXPR (r
, ve
);
11210 else if (DECL_SELF_REFERENCE_P (t
))
11211 SET_DECL_SELF_REFERENCE_P (r
);
11212 TREE_TYPE (r
) = type
;
11213 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11214 DECL_CONTEXT (r
) = ctx
;
11215 /* Clear out the mangled name and RTL for the instantiation. */
11216 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11217 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11218 SET_DECL_RTL (r
, NULL
);
11219 /* The initializer must not be expanded until it is required;
11220 see [temp.inst]. */
11221 DECL_INITIAL (r
) = NULL_TREE
;
11222 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11223 SET_DECL_RTL (r
, NULL
);
11224 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11227 /* Possibly limit visibility based on template args. */
11228 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11229 if (DECL_VISIBILITY_SPECIFIED (t
))
11231 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11232 DECL_ATTRIBUTES (r
)
11233 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11235 determine_visibility (r
);
11240 /* A static data member declaration is always marked
11241 external when it is declared in-class, even if an
11242 initializer is present. We mimic the non-template
11243 processing here. */
11244 DECL_EXTERNAL (r
) = 1;
11246 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11247 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11248 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11250 else if (!cp_unevaluated_operand
)
11251 register_local_specialization (r
, t
);
11253 DECL_CHAIN (r
) = NULL_TREE
;
11255 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11257 args
, complain
, in_decl
);
11259 /* Preserve a typedef that names a type. */
11260 if (is_typedef_decl (r
))
11262 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11263 set_underlying_type (r
);
11266 layout_decl (r
, 0);
11271 gcc_unreachable ();
11276 /* Restore the file and line information. */
11277 input_location
= saved_loc
;
11282 /* Substitute into the ARG_TYPES of a function type.
11283 If END is a TREE_CHAIN, leave it and any following types
11287 tsubst_arg_types (tree arg_types
,
11290 tsubst_flags_t complain
,
11293 tree remaining_arg_types
;
11294 tree type
= NULL_TREE
;
11296 tree expanded_args
= NULL_TREE
;
11299 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11302 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11303 args
, end
, complain
, in_decl
);
11304 if (remaining_arg_types
== error_mark_node
)
11305 return error_mark_node
;
11307 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11309 /* For a pack expansion, perform substitution on the
11310 entire expression. Later on, we'll handle the arguments
11312 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11313 args
, complain
, in_decl
);
11315 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11316 /* So that we'll spin through the parameters, one by one. */
11317 i
= TREE_VEC_LENGTH (expanded_args
);
11320 /* We only partially substituted into the parameter
11321 pack. Our type is TYPE_PACK_EXPANSION. */
11322 type
= expanded_args
;
11323 expanded_args
= NULL_TREE
;
11331 type
= TREE_VEC_ELT (expanded_args
, i
);
11333 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11335 if (type
== error_mark_node
)
11336 return error_mark_node
;
11337 if (VOID_TYPE_P (type
))
11339 if (complain
& tf_error
)
11341 error ("invalid parameter type %qT", type
);
11343 error ("in declaration %q+D", in_decl
);
11345 return error_mark_node
;
11348 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11349 return error_mark_node
;
11351 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11352 top-level qualifiers as required. */
11353 type
= cv_unqualified (type_decays_to (type
));
11355 /* We do not substitute into default arguments here. The standard
11356 mandates that they be instantiated only when needed, which is
11357 done in build_over_call. */
11358 default_arg
= TREE_PURPOSE (arg_types
);
11360 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11362 /* We've instantiated a template before its default arguments
11363 have been parsed. This can happen for a nested template
11364 class, and is not an error unless we require the default
11365 argument in a call of this function. */
11366 remaining_arg_types
=
11367 tree_cons (default_arg
, type
, remaining_arg_types
);
11368 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11371 remaining_arg_types
=
11372 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11375 return remaining_arg_types
;
11378 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11379 *not* handle the exception-specification for FNTYPE, because the
11380 initial substitution of explicitly provided template parameters
11381 during argument deduction forbids substitution into the
11382 exception-specification:
11386 All references in the function type of the function template to the
11387 corresponding template parameters are replaced by the specified tem-
11388 plate argument values. If a substitution in a template parameter or
11389 in the function type of the function template results in an invalid
11390 type, type deduction fails. [Note: The equivalent substitution in
11391 exception specifications is done only when the function is instanti-
11392 ated, at which point a program is ill-formed if the substitution
11393 results in an invalid type.] */
11396 tsubst_function_type (tree t
,
11398 tsubst_flags_t complain
,
11402 tree arg_types
= NULL_TREE
;
11405 /* The TYPE_CONTEXT is not used for function/method types. */
11406 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11408 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
11410 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
11412 if (late_return_type_p
)
11414 /* Substitute the argument types. */
11415 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11416 complain
, in_decl
);
11417 if (arg_types
== error_mark_node
)
11418 return error_mark_node
;
11420 tree save_ccp
= current_class_ptr
;
11421 tree save_ccr
= current_class_ref
;
11422 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
11423 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
11424 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
11427 /* DR 1207: 'this' is in scope in the trailing return type. */
11428 inject_this_parameter (this_type
, cp_type_quals (this_type
));
11431 /* Substitute the return type. */
11432 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11436 current_class_ptr
= save_ccp
;
11437 current_class_ref
= save_ccr
;
11441 /* Substitute the return type. */
11442 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11444 if (return_type
== error_mark_node
)
11445 return error_mark_node
;
11446 /* DR 486 clarifies that creation of a function type with an
11447 invalid return type is a deduction failure. */
11448 if (TREE_CODE (return_type
) == ARRAY_TYPE
11449 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11451 if (complain
& tf_error
)
11453 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11454 error ("function returning an array");
11456 error ("function returning a function");
11458 return error_mark_node
;
11461 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11462 return error_mark_node
;
11464 if (!late_return_type_p
)
11466 /* Substitute the argument types. */
11467 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11468 complain
, in_decl
);
11469 if (arg_types
== error_mark_node
)
11470 return error_mark_node
;
11473 /* Construct a new type node and return it. */
11474 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11476 fntype
= build_function_type (return_type
, arg_types
);
11477 fntype
= apply_memfn_quals (fntype
,
11478 type_memfn_quals (t
),
11479 type_memfn_rqual (t
));
11483 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11484 /* Don't pick up extra function qualifiers from the basetype. */
11485 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11486 if (! MAYBE_CLASS_TYPE_P (r
))
11490 Type deduction may fail for any of the following
11493 -- Attempting to create "pointer to member of T" when T
11494 is not a class type. */
11495 if (complain
& tf_error
)
11496 error ("creating pointer to member function of non-class type %qT",
11498 return error_mark_node
;
11501 fntype
= build_method_type_directly (r
, return_type
,
11502 TREE_CHAIN (arg_types
));
11503 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11505 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11507 if (late_return_type_p
)
11508 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
11513 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11514 ARGS into that specification, and return the substituted
11515 specification. If there is no specification, return NULL_TREE. */
11518 tsubst_exception_specification (tree fntype
,
11520 tsubst_flags_t complain
,
11527 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11528 new_specs
= NULL_TREE
;
11529 if (specs
&& TREE_PURPOSE (specs
))
11531 /* A noexcept-specifier. */
11532 tree expr
= TREE_PURPOSE (specs
);
11533 if (TREE_CODE (expr
) == INTEGER_CST
)
11537 /* Defer instantiation of noexcept-specifiers to avoid
11538 excessive instantiations (c++/49107). */
11539 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11540 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11542 /* We already partially instantiated this member template,
11543 so combine the new args with the old. */
11544 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11545 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11546 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11547 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11551 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11552 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11556 new_specs
= tsubst_copy_and_build
11557 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11558 /*integral_constant_expression_p=*/true);
11559 new_specs
= build_noexcept_spec (new_specs
, complain
);
11563 if (! TREE_VALUE (specs
))
11570 tree expanded_specs
= NULL_TREE
;
11572 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11574 /* Expand the pack expansion type. */
11575 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11579 if (expanded_specs
== error_mark_node
)
11580 return error_mark_node
;
11581 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11582 len
= TREE_VEC_LENGTH (expanded_specs
);
11585 /* We're substituting into a member template, so
11586 we got a TYPE_PACK_EXPANSION back. Add that
11587 expansion and move on. */
11588 gcc_assert (TREE_CODE (expanded_specs
)
11589 == TYPE_PACK_EXPANSION
);
11590 new_specs
= add_exception_specifier (new_specs
,
11593 specs
= TREE_CHAIN (specs
);
11598 for (i
= 0; i
< len
; ++i
)
11600 if (expanded_specs
)
11601 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11603 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11604 if (spec
== error_mark_node
)
11606 new_specs
= add_exception_specifier (new_specs
, spec
,
11610 specs
= TREE_CHAIN (specs
);
11616 /* Take the tree structure T and replace template parameters used
11617 therein with the argument vector ARGS. IN_DECL is an associated
11618 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11619 Issue error and warning messages under control of COMPLAIN. Note
11620 that we must be relatively non-tolerant of extensions here, in
11621 order to preserve conformance; if we allow substitutions that
11622 should not be allowed, we may allow argument deductions that should
11623 not succeed, and therefore report ambiguous overload situations
11624 where there are none. In theory, we could allow the substitution,
11625 but indicate that it should have failed, and allow our caller to
11626 make sure that the right thing happens, but we don't try to do this
11629 This function is used for dealing with types, decls and the like;
11630 for expressions, use tsubst_expr or tsubst_copy. */
11633 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11635 enum tree_code code
;
11636 tree type
, r
= NULL_TREE
;
11638 if (t
== NULL_TREE
|| t
== error_mark_node
11639 || t
== integer_type_node
11640 || t
== void_type_node
11641 || t
== char_type_node
11642 || t
== unknown_type_node
11643 || TREE_CODE (t
) == NAMESPACE_DECL
11644 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11648 return tsubst_decl (t
, args
, complain
);
11650 if (args
== NULL_TREE
)
11653 code
= TREE_CODE (t
);
11655 if (code
== IDENTIFIER_NODE
)
11656 type
= IDENTIFIER_TYPE_VALUE (t
);
11658 type
= TREE_TYPE (t
);
11660 gcc_assert (type
!= unknown_type_node
);
11662 /* Reuse typedefs. We need to do this to handle dependent attributes,
11663 such as attribute aligned. */
11665 && typedef_variant_p (t
))
11667 tree decl
= TYPE_NAME (t
);
11669 if (alias_template_specialization_p (t
))
11671 /* DECL represents an alias template and we want to
11673 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11674 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11675 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11677 else if (DECL_CLASS_SCOPE_P (decl
)
11678 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11679 && uses_template_parms (DECL_CONTEXT (decl
)))
11681 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11682 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11683 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11685 else if (DECL_FUNCTION_SCOPE_P (decl
)
11686 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11687 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11688 r
= retrieve_local_specialization (decl
);
11690 /* The typedef is from a non-template context. */
11696 r
= cp_build_qualified_type_real
11697 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11698 complain
| tf_ignore_bad_quals
);
11703 /* We don't have an instantiation yet, so drop the typedef. */
11704 int quals
= cp_type_quals (t
);
11705 t
= DECL_ORIGINAL_TYPE (decl
);
11706 t
= cp_build_qualified_type_real (t
, quals
,
11707 complain
| tf_ignore_bad_quals
);
11712 && code
!= TYPENAME_TYPE
11713 && code
!= TEMPLATE_TYPE_PARM
11714 && code
!= IDENTIFIER_NODE
11715 && code
!= FUNCTION_TYPE
11716 && code
!= METHOD_TYPE
)
11717 type
= tsubst (type
, args
, complain
, in_decl
);
11718 if (type
== error_mark_node
)
11719 return error_mark_node
;
11725 case ENUMERAL_TYPE
:
11726 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11727 /*entering_scope=*/0);
11730 case IDENTIFIER_NODE
:
11741 if (t
== integer_type_node
)
11744 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11745 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11749 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11751 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11752 /*integral_constant_expression_p=*/false);
11754 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11756 if (TREE_CODE (max
) == NOP_EXPR
11757 && TREE_SIDE_EFFECTS (omax
)
11758 && !TREE_TYPE (max
))
11759 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11761 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11762 with TREE_SIDE_EFFECTS that indicates this is not an integral
11763 constant expression. */
11764 if (processing_template_decl
11765 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11767 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11768 TREE_SIDE_EFFECTS (max
) = 1;
11771 return compute_array_index_type (NULL_TREE
, max
, complain
);
11774 case TEMPLATE_TYPE_PARM
:
11775 case TEMPLATE_TEMPLATE_PARM
:
11776 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11777 case TEMPLATE_PARM_INDEX
:
11782 tree arg
= NULL_TREE
;
11786 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11787 template_parm_level_and_index (t
, &level
, &idx
);
11789 levels
= TMPL_ARGS_DEPTH (args
);
11790 if (level
<= levels
)
11792 arg
= TMPL_ARG (args
, level
, idx
);
11794 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11796 /* See through ARGUMENT_PACK_SELECT arguments. */
11797 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11798 /* If the selected argument is an expansion E, that most
11799 likely means we were called from
11800 gen_elem_of_pack_expansion_instantiation during the
11801 substituting of pack an argument pack (which Ith
11802 element is a pack expansion, where I is
11803 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11804 In this case, the Ith element resulting from this
11805 substituting is going to be a pack expansion, which
11806 pattern is the pattern of E. Let's return the
11808 gen_elem_of_pack_expansion_instantiation will
11809 build the resulting pack expansion from it. */
11810 if (PACK_EXPANSION_P (arg
))
11811 arg
= PACK_EXPANSION_PATTERN (arg
);
11815 if (arg
== error_mark_node
)
11816 return error_mark_node
;
11817 else if (arg
!= NULL_TREE
)
11819 if (ARGUMENT_PACK_P (arg
))
11820 /* If ARG is an argument pack, we don't actually want to
11821 perform a substitution here, because substitutions
11822 for argument packs are only done
11823 element-by-element. We can get to this point when
11824 substituting the type of a non-type template
11825 parameter pack, when that type actually contains
11826 template parameter packs from an outer template, e.g.,
11828 template<typename... Types> struct A {
11829 template<Types... Values> struct B { };
11833 if (code
== TEMPLATE_TYPE_PARM
)
11836 gcc_assert (TYPE_P (arg
));
11838 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11840 return cp_build_qualified_type_real
11841 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11843 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11845 /* We are processing a type constructed from a
11846 template template parameter. */
11847 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11848 args
, complain
, in_decl
);
11849 if (argvec
== error_mark_node
)
11850 return error_mark_node
;
11852 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11853 || TREE_CODE (arg
) == TEMPLATE_DECL
11854 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11856 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11857 /* Consider this code:
11859 template <template <class> class Template>
11861 template <class Arg> using Bind = Template<Arg>;
11864 template <template <class> class Template, class Arg>
11865 using Instantiate = Template<Arg>; //#0
11867 template <template <class> class Template,
11870 Instantiate<Internal<Template>::template Bind,
11873 When #1 is parsed, the
11874 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11875 parameter `Template' in #0 matches the
11876 UNBOUND_CLASS_TEMPLATE representing the argument
11877 `Internal<Template>::template Bind'; We then want
11878 to assemble the type `Bind<Argument>' that can't
11879 be fully created right now, because
11880 `Internal<Template>' not being complete, the Bind
11881 template cannot be looked up in that context. So
11882 we need to "store" `Bind<Argument>' for later
11883 when the context of Bind becomes complete. Let's
11884 store that in a TYPENAME_TYPE. */
11885 return make_typename_type (TYPE_CONTEXT (arg
),
11886 build_nt (TEMPLATE_ID_EXPR
,
11887 TYPE_IDENTIFIER (arg
),
11892 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11893 are resolving nested-types in the signature of a
11894 member function templates. Otherwise ARG is a
11895 TEMPLATE_DECL and is the real template to be
11897 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11898 arg
= TYPE_NAME (arg
);
11900 r
= lookup_template_class (arg
,
11902 DECL_CONTEXT (arg
),
11903 /*entering_scope=*/0,
11905 return cp_build_qualified_type_real
11906 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
11909 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11910 return convert_from_reference (unshare_expr (arg
));
11914 /* This can happen during the attempted tsubst'ing in
11915 unify. This means that we don't yet have any information
11916 about the template parameter in question. */
11919 /* Early in template argument deduction substitution, we don't
11920 want to reduce the level of 'auto', or it will be confused
11921 with a normal template parm in subsequent deduction. */
11922 if (is_auto (t
) && (complain
& tf_partial
))
11925 /* If we get here, we must have been looking at a parm for a
11926 more deeply nested template. Make a new version of this
11927 template parameter, but with a lower level. */
11930 case TEMPLATE_TYPE_PARM
:
11931 case TEMPLATE_TEMPLATE_PARM
:
11932 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11933 if (cp_type_quals (t
))
11935 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11936 r
= cp_build_qualified_type_real
11937 (r
, cp_type_quals (t
),
11938 complain
| (code
== TEMPLATE_TYPE_PARM
11939 ? tf_ignore_bad_quals
: 0));
11944 TEMPLATE_TYPE_PARM_INDEX (r
)
11945 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11946 r
, levels
, args
, complain
);
11947 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11948 TYPE_MAIN_VARIANT (r
) = r
;
11949 TYPE_POINTER_TO (r
) = NULL_TREE
;
11950 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11952 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11953 /* We have reduced the level of the template
11954 template parameter, but not the levels of its
11955 template parameters, so canonical_type_parameter
11956 will not be able to find the canonical template
11957 template parameter for this level. Thus, we
11958 require structural equality checking to compare
11959 TEMPLATE_TEMPLATE_PARMs. */
11960 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11961 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11962 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11964 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11966 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11968 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11969 complain
, in_decl
);
11970 if (argvec
== error_mark_node
)
11971 return error_mark_node
;
11973 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11974 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
11979 case TEMPLATE_PARM_INDEX
:
11980 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
11984 gcc_unreachable ();
11992 tree purpose
, value
, chain
;
11994 if (t
== void_list_node
)
11997 purpose
= TREE_PURPOSE (t
);
12000 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
12001 if (purpose
== error_mark_node
)
12002 return error_mark_node
;
12004 value
= TREE_VALUE (t
);
12007 value
= tsubst (value
, args
, complain
, in_decl
);
12008 if (value
== error_mark_node
)
12009 return error_mark_node
;
12011 chain
= TREE_CHAIN (t
);
12012 if (chain
&& chain
!= void_type_node
)
12014 chain
= tsubst (chain
, args
, complain
, in_decl
);
12015 if (chain
== error_mark_node
)
12016 return error_mark_node
;
12018 if (purpose
== TREE_PURPOSE (t
)
12019 && value
== TREE_VALUE (t
)
12020 && chain
== TREE_CHAIN (t
))
12022 return hash_tree_cons (purpose
, value
, chain
);
12026 /* We should never be tsubsting a binfo. */
12027 gcc_unreachable ();
12030 /* A vector of template arguments. */
12031 gcc_assert (!type
);
12032 return tsubst_template_args (t
, args
, complain
, in_decl
);
12035 case REFERENCE_TYPE
:
12037 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12042 Type deduction may fail for any of the following
12045 -- Attempting to create a pointer to reference type.
12046 -- Attempting to create a reference to a reference type or
12047 a reference to void.
12049 Core issue 106 says that creating a reference to a reference
12050 during instantiation is no longer a cause for failure. We
12051 only enforce this check in strict C++98 mode. */
12052 if ((TREE_CODE (type
) == REFERENCE_TYPE
12053 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12054 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12056 static location_t last_loc
;
12058 /* We keep track of the last time we issued this error
12059 message to avoid spewing a ton of messages during a
12060 single bad template instantiation. */
12061 if (complain
& tf_error
12062 && last_loc
!= input_location
)
12064 if (VOID_TYPE_P (type
))
12065 error ("forming reference to void");
12066 else if (code
== POINTER_TYPE
)
12067 error ("forming pointer to reference type %qT", type
);
12069 error ("forming reference to reference type %qT", type
);
12070 last_loc
= input_location
;
12073 return error_mark_node
;
12075 else if (TREE_CODE (type
) == FUNCTION_TYPE
12076 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12077 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12079 if (complain
& tf_error
)
12081 if (code
== POINTER_TYPE
)
12082 error ("forming pointer to qualified function type %qT",
12085 error ("forming reference to qualified function type %qT",
12088 return error_mark_node
;
12090 else if (code
== POINTER_TYPE
)
12092 r
= build_pointer_type (type
);
12093 if (TREE_CODE (type
) == METHOD_TYPE
)
12094 r
= build_ptrmemfunc_type (r
);
12096 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12097 /* In C++0x, during template argument substitution, when there is an
12098 attempt to create a reference to a reference type, reference
12099 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12101 "If a template-argument for a template-parameter T names a type
12102 that is a reference to a type A, an attempt to create the type
12103 'lvalue reference to cv T' creates the type 'lvalue reference to
12104 A,' while an attempt to create the type type rvalue reference to
12105 cv T' creates the type T"
12107 r
= cp_build_reference_type
12109 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12111 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12112 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12114 if (cxx_dialect
>= cxx1y
12115 && !(TREE_CODE (t
) == REFERENCE_TYPE
&& REFERENCE_VLA_OK (t
))
12116 && array_of_runtime_bound_p (type
)
12117 && (flag_iso
|| warn_vla
> 0))
12119 if (complain
& tf_warning_or_error
)
12121 (input_location
, OPT_Wvla
,
12122 code
== REFERENCE_TYPE
12123 ? G_("cannot declare reference to array of runtime bound")
12124 : G_("cannot declare pointer to array of runtime bound"));
12126 r
= error_mark_node
;
12129 if (r
!= error_mark_node
)
12130 /* Will this ever be needed for TYPE_..._TO values? */
12137 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12138 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12142 Type deduction may fail for any of the following
12145 -- Attempting to create "pointer to member of T" when T
12146 is not a class type. */
12147 if (complain
& tf_error
)
12148 error ("creating pointer to member of non-class type %qT", r
);
12149 return error_mark_node
;
12151 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12153 if (complain
& tf_error
)
12154 error ("creating pointer to member reference type %qT", type
);
12155 return error_mark_node
;
12157 if (VOID_TYPE_P (type
))
12159 if (complain
& tf_error
)
12160 error ("creating pointer to member of type void");
12161 return error_mark_node
;
12163 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12164 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12166 /* The type of the implicit object parameter gets its
12167 cv-qualifiers from the FUNCTION_TYPE. */
12170 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12171 type_memfn_rqual (type
));
12172 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12173 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12177 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12181 case FUNCTION_TYPE
:
12186 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12187 if (fntype
== error_mark_node
)
12188 return error_mark_node
;
12190 /* Substitute the exception specification. */
12191 specs
= tsubst_exception_specification (t
, args
, complain
,
12192 in_decl
, /*defer_ok*/true);
12193 if (specs
== error_mark_node
)
12194 return error_mark_node
;
12196 fntype
= build_exception_variant (fntype
, specs
);
12201 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12202 if (domain
== error_mark_node
)
12203 return error_mark_node
;
12205 /* As an optimization, we avoid regenerating the array type if
12206 it will obviously be the same as T. */
12207 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12210 /* These checks should match the ones in create_array_type_for_decl.
12214 The deduction may fail for any of the following reasons:
12216 -- Attempting to create an array with an element type that
12217 is void, a function type, or a reference type, or [DR337]
12218 an abstract class type. */
12219 if (VOID_TYPE_P (type
)
12220 || TREE_CODE (type
) == FUNCTION_TYPE
12221 || (TREE_CODE (type
) == ARRAY_TYPE
12222 && TYPE_DOMAIN (type
) == NULL_TREE
)
12223 || TREE_CODE (type
) == REFERENCE_TYPE
)
12225 if (complain
& tf_error
)
12226 error ("creating array of %qT", type
);
12227 return error_mark_node
;
12230 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12231 return error_mark_node
;
12233 r
= build_cplus_array_type (type
, domain
);
12235 if (TYPE_USER_ALIGN (t
))
12237 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12238 TYPE_USER_ALIGN (r
) = 1;
12244 case TYPENAME_TYPE
:
12246 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12247 in_decl
, /*entering_scope=*/1);
12248 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12249 complain
, in_decl
);
12251 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12252 return error_mark_node
;
12254 if (!MAYBE_CLASS_TYPE_P (ctx
))
12256 if (complain
& tf_error
)
12257 error ("%qT is not a class, struct, or union type", ctx
);
12258 return error_mark_node
;
12260 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12262 /* Normally, make_typename_type does not require that the CTX
12263 have complete type in order to allow things like:
12265 template <class T> struct S { typename S<T>::X Y; };
12267 But, such constructs have already been resolved by this
12268 point, so here CTX really should have complete type, unless
12269 it's a partial instantiation. */
12270 ctx
= complete_type (ctx
);
12271 if (!COMPLETE_TYPE_P (ctx
))
12273 if (complain
& tf_error
)
12274 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12275 return error_mark_node
;
12279 f
= make_typename_type (ctx
, f
, typename_type
,
12280 complain
| tf_keep_type_decl
);
12281 if (f
== error_mark_node
)
12283 if (TREE_CODE (f
) == TYPE_DECL
)
12285 complain
|= tf_ignore_bad_quals
;
12289 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12291 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12293 if (complain
& tf_error
)
12294 error ("%qT resolves to %qT, which is not an enumeration type",
12297 return error_mark_node
;
12299 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12301 if (complain
& tf_error
)
12302 error ("%qT resolves to %qT, which is is not a class type",
12305 return error_mark_node
;
12309 return cp_build_qualified_type_real
12310 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12313 case UNBOUND_CLASS_TEMPLATE
:
12315 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12316 in_decl
, /*entering_scope=*/1);
12317 tree name
= TYPE_IDENTIFIER (t
);
12318 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12320 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12321 return error_mark_node
;
12324 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12325 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12332 ++cp_unevaluated_operand
;
12333 ++c_inhibit_evaluation_warnings
;
12335 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12337 /*integral_constant_expression_p=*/false);
12339 --cp_unevaluated_operand
;
12340 --c_inhibit_evaluation_warnings
;
12342 type
= finish_typeof (type
);
12343 return cp_build_qualified_type_real (type
,
12345 | cp_type_quals (type
),
12349 case DECLTYPE_TYPE
:
12353 ++cp_unevaluated_operand
;
12354 ++c_inhibit_evaluation_warnings
;
12356 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12357 complain
|tf_decltype
, in_decl
,
12358 /*function_p*/false,
12359 /*integral_constant_expression*/false);
12361 --cp_unevaluated_operand
;
12362 --c_inhibit_evaluation_warnings
;
12364 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12365 type
= lambda_capture_field_type (type
,
12366 DECLTYPE_FOR_INIT_CAPTURE (t
));
12367 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12368 type
= lambda_proxy_type (type
);
12371 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12372 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12374 /* In a template ~id could be either a complement expression
12375 or an unqualified-id naming a destructor; if instantiating
12376 it produces an expression, it's not an id-expression or
12379 type
= finish_decltype_type (type
, id
, complain
);
12381 return cp_build_qualified_type_real (type
,
12383 | cp_type_quals (type
),
12387 case UNDERLYING_TYPE
:
12389 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12390 complain
, in_decl
);
12391 return finish_underlying_type (type
);
12394 case TYPE_ARGUMENT_PACK
:
12395 case NONTYPE_ARGUMENT_PACK
:
12397 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12399 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12403 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12405 /* For template nontype argument packs, also substitute into
12407 if (code
== NONTYPE_ARGUMENT_PACK
)
12408 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12427 /* We should use one of the expression tsubsts for these codes. */
12428 gcc_unreachable ();
12431 sorry ("use of %qs in template", get_tree_code_name (code
));
12432 return error_mark_node
;
12436 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12437 type of the expression on the left-hand side of the "." or "->"
12441 tsubst_baselink (tree baselink
, tree object_type
,
12442 tree args
, tsubst_flags_t complain
, tree in_decl
)
12445 tree qualifying_scope
;
12448 tree template_args
= 0;
12449 bool template_id_p
= false;
12450 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12452 /* A baselink indicates a function from a base class. Both the
12453 BASELINK_ACCESS_BINFO and the base class referenced may
12454 indicate bases of the template class, rather than the
12455 instantiated class. In addition, lookups that were not
12456 ambiguous before may be ambiguous now. Therefore, we perform
12457 the lookup again. */
12458 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12459 qualifying_scope
= tsubst (qualifying_scope
, args
,
12460 complain
, in_decl
);
12461 fns
= BASELINK_FUNCTIONS (baselink
);
12462 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12463 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12465 template_id_p
= true;
12466 template_args
= TREE_OPERAND (fns
, 1);
12467 fns
= TREE_OPERAND (fns
, 0);
12469 template_args
= tsubst_template_args (template_args
, args
,
12470 complain
, in_decl
);
12472 name
= DECL_NAME (get_first_fn (fns
));
12473 if (IDENTIFIER_TYPENAME_P (name
))
12474 name
= mangle_conv_op_name_for_type (optype
);
12475 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12477 return error_mark_node
;
12479 /* If lookup found a single function, mark it as used at this
12480 point. (If it lookup found multiple functions the one selected
12481 later by overload resolution will be marked as used at that
12483 if (BASELINK_P (baselink
))
12484 fns
= BASELINK_FUNCTIONS (baselink
);
12485 if (!template_id_p
&& !really_overloaded_fn (fns
))
12486 mark_used (OVL_CURRENT (fns
));
12488 /* Add back the template arguments, if present. */
12489 if (BASELINK_P (baselink
) && template_id_p
)
12490 BASELINK_FUNCTIONS (baselink
)
12491 = build_nt (TEMPLATE_ID_EXPR
,
12492 BASELINK_FUNCTIONS (baselink
),
12494 /* Update the conversion operator type. */
12495 BASELINK_OPTYPE (baselink
) = optype
;
12498 object_type
= current_class_type
;
12501 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12507 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12508 true if the qualified-id will be a postfix-expression in-and-of
12509 itself; false if more of the postfix-expression follows the
12510 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12514 tsubst_qualified_id (tree qualified_id
, tree args
,
12515 tsubst_flags_t complain
, tree in_decl
,
12516 bool done
, bool address_p
)
12522 tree template_args
;
12523 location_t loc
= UNKNOWN_LOCATION
;
12525 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12527 /* Figure out what name to look up. */
12528 name
= TREE_OPERAND (qualified_id
, 1);
12529 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12531 is_template
= true;
12532 loc
= EXPR_LOCATION (name
);
12533 template_args
= TREE_OPERAND (name
, 1);
12535 template_args
= tsubst_template_args (template_args
, args
,
12536 complain
, in_decl
);
12537 name
= TREE_OPERAND (name
, 0);
12541 is_template
= false;
12542 template_args
= NULL_TREE
;
12545 /* Substitute into the qualifying scope. When there are no ARGS, we
12546 are just trying to simplify a non-dependent expression. In that
12547 case the qualifying scope may be dependent, and, in any case,
12548 substituting will not help. */
12549 scope
= TREE_OPERAND (qualified_id
, 0);
12552 scope
= tsubst (scope
, args
, complain
, in_decl
);
12553 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12558 if (dependent_scope_p (scope
))
12561 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12562 return build_qualified_name (NULL_TREE
, scope
, expr
,
12563 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12566 if (!BASELINK_P (name
) && !DECL_P (expr
))
12568 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12570 /* A BIT_NOT_EXPR is used to represent a destructor. */
12571 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12573 error ("qualifying type %qT does not match destructor name ~%qT",
12574 scope
, TREE_OPERAND (expr
, 0));
12575 expr
= error_mark_node
;
12578 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12579 /*is_type_p=*/0, false);
12582 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12583 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12584 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12586 if (complain
& tf_error
)
12588 error ("dependent-name %qE is parsed as a non-type, but "
12589 "instantiation yields a type", qualified_id
);
12590 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12592 return error_mark_node
;
12598 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12600 /* Remember that there was a reference to this entity. */
12604 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12606 if (complain
& tf_error
)
12607 qualified_name_lookup_error (scope
,
12608 TREE_OPERAND (qualified_id
, 1),
12609 expr
, input_location
);
12610 return error_mark_node
;
12614 expr
= lookup_template_function (expr
, template_args
);
12616 if (expr
== error_mark_node
&& complain
& tf_error
)
12617 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12618 expr
, input_location
);
12619 else if (TYPE_P (scope
))
12621 expr
= (adjust_result_of_qualified_name_lookup
12622 (expr
, scope
, current_nonlambda_class_type ()));
12623 expr
= (finish_qualified_id_expr
12624 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12625 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12626 /*template_arg_p=*/false, complain
));
12629 /* Expressions do not generally have reference type. */
12630 if (TREE_CODE (expr
) != SCOPE_REF
12631 /* However, if we're about to form a pointer-to-member, we just
12632 want the referenced member referenced. */
12633 && TREE_CODE (expr
) != OFFSET_REF
)
12634 expr
= convert_from_reference (expr
);
12639 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
12640 initializer, DECL is the substituted VAR_DECL. Other arguments are as
12644 tsubst_init (tree init
, tree decl
, tree args
,
12645 tsubst_flags_t complain
, tree in_decl
)
12650 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
12654 /* If we had an initializer but it
12655 instantiated to nothing,
12656 value-initialize the object. This will
12657 only occur when the initializer was a
12658 pack expansion where the parameter packs
12659 used in that expansion were of length
12661 init
= build_value_init (TREE_TYPE (decl
),
12663 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12664 init
= get_target_expr_sfinae (init
, complain
);
12670 /* Like tsubst, but deals with expressions. This function just replaces
12671 template parms; to finish processing the resultant expression, use
12672 tsubst_copy_and_build or tsubst_expr. */
12675 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12677 enum tree_code code
;
12680 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12683 code
= TREE_CODE (t
);
12688 r
= retrieve_local_specialization (t
);
12690 if (r
== NULL_TREE
)
12692 /* We get here for a use of 'this' in an NSDMI. */
12693 if (DECL_NAME (t
) == this_identifier
12694 && current_function_decl
12695 && DECL_CONSTRUCTOR_P (current_function_decl
))
12696 return current_class_ptr
;
12698 /* This can happen for a parameter name used later in a function
12699 declaration (such as in a late-specified return type). Just
12700 make a dummy decl, since it's only used for its type. */
12701 gcc_assert (cp_unevaluated_operand
!= 0);
12702 r
= tsubst_decl (t
, args
, complain
);
12703 /* Give it the template pattern as its context; its true context
12704 hasn't been instantiated yet and this is good enough for
12706 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12709 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12710 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12719 if (DECL_TEMPLATE_PARM_P (t
))
12720 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12721 /* There is no need to substitute into namespace-scope
12723 if (DECL_NAMESPACE_SCOPE_P (t
))
12725 /* If ARGS is NULL, then T is known to be non-dependent. */
12726 if (args
== NULL_TREE
)
12727 return integral_constant_value (t
);
12729 /* Unfortunately, we cannot just call lookup_name here.
12732 template <int I> int f() {
12734 struct S { void g() { E e = a; } };
12737 When we instantiate f<7>::S::g(), say, lookup_name is not
12738 clever enough to find f<7>::a. */
12740 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12741 /*entering_scope=*/0);
12743 for (v
= TYPE_VALUES (enum_type
);
12745 v
= TREE_CHAIN (v
))
12746 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12747 return TREE_VALUE (v
);
12749 /* We didn't find the name. That should never happen; if
12750 name-lookup found it during preliminary parsing, we
12751 should find it again here during instantiation. */
12752 gcc_unreachable ();
12757 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12759 /* Check for a local specialization set up by
12760 tsubst_pack_expansion. */
12761 if (tree r
= retrieve_local_specialization (t
))
12763 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12764 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12768 /* When retrieving a capture pack from a generic lambda, remove the
12769 lambda call op's own template argument list from ARGS. Only the
12770 template arguments active for the closure type should be used to
12771 retrieve the pack specialization. */
12772 if (LAMBDA_FUNCTION_P (current_function_decl
)
12773 && (template_class_depth (DECL_CONTEXT (t
))
12774 != TMPL_ARGS_DEPTH (args
)))
12775 args
= strip_innermost_template_args (args
, 1);
12777 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12778 tsubst_decl put in the hash table. */
12779 return retrieve_specialization (t
, args
, 0);
12782 if (DECL_CONTEXT (t
))
12786 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12787 /*entering_scope=*/1);
12788 if (ctx
!= DECL_CONTEXT (t
))
12790 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12793 if (complain
& tf_error
)
12794 error ("using invalid field %qD", t
);
12795 return error_mark_node
;
12804 case FUNCTION_DECL
:
12805 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12806 r
= tsubst (t
, args
, complain
, in_decl
);
12807 else if (local_variable_p (t
))
12809 r
= retrieve_local_specialization (t
);
12810 if (r
== NULL_TREE
)
12812 /* First try name lookup to find the instantiation. */
12813 r
= lookup_name (DECL_NAME (t
));
12816 /* Make sure that the one we found is the one we want. */
12817 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
12818 complain
, in_decl
);
12819 if (ctx
!= DECL_CONTEXT (r
))
12827 /* This can happen for a variable used in a
12828 late-specified return type of a local lambda, or for a
12829 local static or constant. Building a new VAR_DECL
12830 should be OK in all those cases. */
12831 r
= tsubst_decl (t
, args
, complain
);
12832 if (decl_maybe_constant_var_p (r
))
12834 /* We can't call cp_finish_decl, so handle the
12835 initializer by hand. */
12836 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
12837 complain
, in_decl
);
12838 if (!processing_template_decl
)
12839 init
= maybe_constant_init (init
);
12840 if (processing_template_decl
12841 ? potential_constant_expression (init
)
12842 : reduced_constant_expression_p (init
))
12843 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
12844 = TREE_CONSTANT (r
) = true;
12845 DECL_INITIAL (r
) = init
;
12847 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
12848 || decl_constant_var_p (r
)
12849 || errorcount
|| sorrycount
);
12850 if (!processing_template_decl
)
12852 if (TREE_STATIC (r
))
12853 rest_of_decl_compilation (r
, toplevel_bindings_p (),
12855 else if (decl_constant_var_p (r
))
12856 /* A use of a local constant decays to its value.
12857 FIXME update for core DR 696. */
12858 r
= integral_constant_value (r
);
12861 /* Remember this for subsequent uses. */
12862 if (local_specializations
)
12863 register_local_specialization (r
, t
);
12871 case NAMESPACE_DECL
:
12875 /* An OVERLOAD will always be a non-dependent overload set; an
12876 overload set from function scope will just be represented with an
12877 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12878 gcc_assert (!uses_template_parms (t
));
12882 return tsubst_baselink (t
, current_nonlambda_class_type (),
12883 args
, complain
, in_decl
);
12885 case TEMPLATE_DECL
:
12886 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12887 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12888 args
, complain
, in_decl
);
12889 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12890 return tsubst (t
, args
, complain
, in_decl
);
12891 else if (DECL_CLASS_SCOPE_P (t
)
12892 && uses_template_parms (DECL_CONTEXT (t
)))
12894 /* Template template argument like the following example need
12897 template <template <class> class TT> struct C {};
12898 template <class T> struct D {
12899 template <class U> struct E {};
12904 We are processing the template argument `E' in #1 for
12905 the template instantiation #2. Originally, `E' is a
12906 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12907 have to substitute this with one having context `D<int>'. */
12909 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12910 return lookup_field (context
, DECL_NAME(t
), 0, false);
12913 /* Ordinary template template argument. */
12917 case REINTERPRET_CAST_EXPR
:
12918 case CONST_CAST_EXPR
:
12919 case STATIC_CAST_EXPR
:
12920 case DYNAMIC_CAST_EXPR
:
12921 case IMPLICIT_CONV_EXPR
:
12925 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12926 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12927 return build1 (code
, type
, op0
);
12931 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12934 tree expanded
, op
= TREE_OPERAND (t
, 0);
12937 if (SIZEOF_EXPR_TYPE_P (t
))
12938 op
= TREE_TYPE (op
);
12940 ++cp_unevaluated_operand
;
12941 ++c_inhibit_evaluation_warnings
;
12942 /* We only want to compute the number of arguments. */
12943 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12944 --cp_unevaluated_operand
;
12945 --c_inhibit_evaluation_warnings
;
12947 if (TREE_CODE (expanded
) == TREE_VEC
)
12948 len
= TREE_VEC_LENGTH (expanded
);
12950 if (expanded
== error_mark_node
)
12951 return error_mark_node
;
12952 else if (PACK_EXPANSION_P (expanded
)
12953 || (TREE_CODE (expanded
) == TREE_VEC
12955 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12957 if (TREE_CODE (expanded
) == TREE_VEC
)
12958 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12960 if (TYPE_P (expanded
))
12961 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12962 complain
& tf_error
);
12964 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12965 complain
& tf_error
);
12968 return build_int_cst (size_type_node
, len
);
12970 if (SIZEOF_EXPR_TYPE_P (t
))
12972 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
12973 args
, complain
, in_decl
);
12974 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
12975 r
= build1 (SIZEOF_EXPR
,
12976 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
12977 SIZEOF_EXPR_TYPE_P (r
) = 1;
12984 case TRUTH_NOT_EXPR
:
12987 case UNARY_PLUS_EXPR
: /* Unary + */
12989 case AT_ENCODE_EXPR
:
12993 case REALPART_EXPR
:
12994 case IMAGPART_EXPR
:
12997 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12998 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12999 return build1 (code
, type
, op0
);
13002 case COMPONENT_REF
:
13007 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13008 name
= TREE_OPERAND (t
, 1);
13009 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13011 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13012 complain
, in_decl
);
13013 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13015 else if (TREE_CODE (name
) == SCOPE_REF
13016 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13018 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13019 complain
, in_decl
);
13020 name
= TREE_OPERAND (name
, 1);
13021 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13022 complain
, in_decl
);
13023 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13024 name
= build_qualified_name (/*type=*/NULL_TREE
,
13026 /*template_p=*/false);
13028 else if (BASELINK_P (name
))
13029 name
= tsubst_baselink (name
,
13030 non_reference (TREE_TYPE (object
)),
13034 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13035 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13041 case TRUNC_DIV_EXPR
:
13042 case CEIL_DIV_EXPR
:
13043 case FLOOR_DIV_EXPR
:
13044 case ROUND_DIV_EXPR
:
13045 case EXACT_DIV_EXPR
:
13049 case TRUNC_MOD_EXPR
:
13050 case FLOOR_MOD_EXPR
:
13051 case TRUTH_ANDIF_EXPR
:
13052 case TRUTH_ORIF_EXPR
:
13053 case TRUTH_AND_EXPR
:
13054 case TRUTH_OR_EXPR
:
13067 case COMPOUND_EXPR
:
13070 case PREDECREMENT_EXPR
:
13071 case PREINCREMENT_EXPR
:
13072 case POSTDECREMENT_EXPR
:
13073 case POSTINCREMENT_EXPR
:
13075 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13076 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13077 return build_nt (code
, op0
, op1
);
13082 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13083 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13084 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13085 QUALIFIED_NAME_IS_TEMPLATE (t
));
13090 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13091 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13092 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13097 int n
= VL_EXP_OPERAND_LENGTH (t
);
13098 tree result
= build_vl_exp (CALL_EXPR
, n
);
13100 for (i
= 0; i
< n
; i
++)
13101 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13102 complain
, in_decl
);
13108 case PSEUDO_DTOR_EXPR
:
13109 case VEC_PERM_EXPR
:
13111 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13112 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13113 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13114 r
= build_nt (code
, op0
, op1
, op2
);
13115 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13121 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13122 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13123 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13124 r
= build_nt (code
, op0
, op1
, op2
);
13125 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13131 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13132 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13133 r
= build_nt (code
, op0
, op1
);
13134 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13135 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13139 case TEMPLATE_ID_EXPR
:
13141 /* Substituted template arguments */
13142 tree fn
= TREE_OPERAND (t
, 0);
13143 tree targs
= TREE_OPERAND (t
, 1);
13145 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13147 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13149 return lookup_template_function (fn
, targs
);
13154 tree purpose
, value
, chain
;
13156 if (t
== void_list_node
)
13159 purpose
= TREE_PURPOSE (t
);
13161 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13162 value
= TREE_VALUE (t
);
13164 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13165 chain
= TREE_CHAIN (t
);
13166 if (chain
&& chain
!= void_type_node
)
13167 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13168 if (purpose
== TREE_PURPOSE (t
)
13169 && value
== TREE_VALUE (t
)
13170 && chain
== TREE_CHAIN (t
))
13172 return tree_cons (purpose
, value
, chain
);
13177 case ENUMERAL_TYPE
:
13179 case TEMPLATE_TYPE_PARM
:
13180 case TEMPLATE_TEMPLATE_PARM
:
13181 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13182 case TEMPLATE_PARM_INDEX
:
13184 case REFERENCE_TYPE
:
13186 case FUNCTION_TYPE
:
13189 case TYPENAME_TYPE
:
13190 case UNBOUND_CLASS_TEMPLATE
:
13192 case DECLTYPE_TYPE
:
13194 return tsubst (t
, args
, complain
, in_decl
);
13198 /* Fall through. */
13199 case IDENTIFIER_NODE
:
13200 if (IDENTIFIER_TYPENAME_P (t
))
13202 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13203 return mangle_conv_op_name_for_type (new_type
);
13209 /* This is handled by tsubst_copy_and_build. */
13210 gcc_unreachable ();
13214 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13215 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13216 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13219 case CLEANUP_POINT_EXPR
:
13220 /* We shouldn't have built any of these during initial template
13221 generation. Instead, they should be built during instantiation
13222 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13223 gcc_unreachable ();
13227 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13228 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13229 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13230 r
= build2 (code
, type
, op0
, op1
);
13231 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13232 mark_used (TREE_OPERAND (r
, 1));
13236 case EXPR_PACK_EXPANSION
:
13237 error ("invalid use of pack expansion expression");
13238 return error_mark_node
;
13240 case NONTYPE_ARGUMENT_PACK
:
13241 error ("use %<...%> to expand argument pack");
13242 return error_mark_node
;
13245 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
13253 /* Instantiate any typedefs in the type. */
13254 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13255 r
= fold_convert (type
, t
);
13256 gcc_assert (TREE_CODE (r
) == code
);
13261 /* These can sometimes show up in a partial instantiation, but never
13262 involve template parms. */
13263 gcc_assert (!uses_template_parms (t
));
13267 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13268 gcc_checking_assert (false);
13273 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13276 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13277 tree args
, tsubst_flags_t complain
, tree in_decl
)
13279 tree new_clauses
= NULL
, nc
, oc
;
13281 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13283 nc
= copy_node (oc
);
13284 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13287 switch (OMP_CLAUSE_CODE (nc
))
13289 case OMP_CLAUSE_LASTPRIVATE
:
13290 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13292 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13293 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13294 in_decl
, /*integral_constant_expression_p=*/false);
13295 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13296 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13299 case OMP_CLAUSE_PRIVATE
:
13300 case OMP_CLAUSE_SHARED
:
13301 case OMP_CLAUSE_FIRSTPRIVATE
:
13302 case OMP_CLAUSE_COPYIN
:
13303 case OMP_CLAUSE_COPYPRIVATE
:
13304 case OMP_CLAUSE_IF
:
13305 case OMP_CLAUSE_NUM_THREADS
:
13306 case OMP_CLAUSE_SCHEDULE
:
13307 case OMP_CLAUSE_COLLAPSE
:
13308 case OMP_CLAUSE_FINAL
:
13309 case OMP_CLAUSE_DEPEND
:
13310 case OMP_CLAUSE_FROM
:
13311 case OMP_CLAUSE_TO
:
13312 case OMP_CLAUSE_UNIFORM
:
13313 case OMP_CLAUSE_MAP
:
13314 case OMP_CLAUSE_DEVICE
:
13315 case OMP_CLAUSE_DIST_SCHEDULE
:
13316 case OMP_CLAUSE_NUM_TEAMS
:
13317 case OMP_CLAUSE_THREAD_LIMIT
:
13318 case OMP_CLAUSE_SAFELEN
:
13319 case OMP_CLAUSE_SIMDLEN
:
13320 OMP_CLAUSE_OPERAND (nc
, 0)
13321 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13322 in_decl
, /*integral_constant_expression_p=*/false);
13324 case OMP_CLAUSE_REDUCTION
:
13325 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13327 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13328 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13330 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13331 complain
, in_decl
);
13332 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13333 = build_qualified_name (NULL_TREE
, scope
,
13334 TREE_OPERAND (placeholder
, 1),
13338 gcc_assert (identifier_p (placeholder
));
13340 OMP_CLAUSE_OPERAND (nc
, 0)
13341 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13342 in_decl
, /*integral_constant_expression_p=*/false);
13344 case OMP_CLAUSE_LINEAR
:
13345 case OMP_CLAUSE_ALIGNED
:
13346 OMP_CLAUSE_OPERAND (nc
, 0)
13347 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13348 in_decl
, /*integral_constant_expression_p=*/false);
13349 OMP_CLAUSE_OPERAND (nc
, 1)
13350 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13351 in_decl
, /*integral_constant_expression_p=*/false);
13354 case OMP_CLAUSE_NOWAIT
:
13355 case OMP_CLAUSE_ORDERED
:
13356 case OMP_CLAUSE_DEFAULT
:
13357 case OMP_CLAUSE_UNTIED
:
13358 case OMP_CLAUSE_MERGEABLE
:
13359 case OMP_CLAUSE_INBRANCH
:
13360 case OMP_CLAUSE_NOTINBRANCH
:
13361 case OMP_CLAUSE_PROC_BIND
:
13362 case OMP_CLAUSE_FOR
:
13363 case OMP_CLAUSE_PARALLEL
:
13364 case OMP_CLAUSE_SECTIONS
:
13365 case OMP_CLAUSE_TASKGROUP
:
13368 gcc_unreachable ();
13372 new_clauses
= nreverse (new_clauses
);
13374 new_clauses
= finish_omp_clauses (new_clauses
);
13375 return new_clauses
;
13378 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13381 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13384 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13386 tree purpose
, value
, chain
;
13391 if (TREE_CODE (t
) != TREE_LIST
)
13392 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13393 /*function_p=*/false,
13394 /*integral_constant_expression_p=*/false);
13396 if (t
== void_list_node
)
13399 purpose
= TREE_PURPOSE (t
);
13401 purpose
= RECUR (purpose
);
13402 value
= TREE_VALUE (t
);
13405 if (TREE_CODE (value
) != LABEL_DECL
)
13406 value
= RECUR (value
);
13409 value
= lookup_label (DECL_NAME (value
));
13410 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13411 TREE_USED (value
) = 1;
13414 chain
= TREE_CHAIN (t
);
13415 if (chain
&& chain
!= void_type_node
)
13416 chain
= RECUR (chain
);
13417 return tree_cons (purpose
, value
, chain
);
13421 /* Substitute one OMP_FOR iterator. */
13424 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13425 tree condv
, tree incrv
, tree
*clauses
,
13426 tree args
, tsubst_flags_t complain
, tree in_decl
,
13427 bool integral_constant_expression_p
)
13429 #define RECUR(NODE) \
13430 tsubst_expr ((NODE), args, complain, in_decl, \
13431 integral_constant_expression_p)
13432 tree decl
, init
, cond
, incr
;
13434 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13435 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13436 decl
= TREE_OPERAND (init
, 0);
13437 init
= TREE_OPERAND (init
, 1);
13438 tree decl_expr
= NULL_TREE
;
13439 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13441 /* We need to jump through some hoops to handle declarations in the
13442 for-init-statement, since we might need to handle auto deduction,
13443 but we need to keep control of initialization. */
13445 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13446 decl
= tsubst_decl (decl
, args
, complain
);
13449 decl
= RECUR (decl
);
13450 init
= RECUR (init
);
13452 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13453 if (auto_node
&& init
)
13455 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13457 gcc_assert (!type_dependent_expression_p (decl
));
13459 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13463 /* Declare the variable, but don't let that initialize it. */
13464 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13465 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13467 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13470 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13471 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13472 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13474 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13475 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
13476 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
13477 NOP_EXPR
, rhs
, complain
);
13480 incr
= RECUR (incr
);
13481 TREE_VEC_ELT (declv
, i
) = decl
;
13482 TREE_VEC_ELT (initv
, i
) = init
;
13483 TREE_VEC_ELT (condv
, i
) = cond
;
13484 TREE_VEC_ELT (incrv
, i
) = incr
;
13490 /* Declare and initialize the variable. */
13497 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13499 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13500 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13501 && OMP_CLAUSE_DECL (c
) == decl
)
13503 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13504 && OMP_CLAUSE_DECL (c
) == decl
)
13505 error ("iteration variable %qD should not be firstprivate", decl
);
13506 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13507 && OMP_CLAUSE_DECL (c
) == decl
)
13508 error ("iteration variable %qD should not be reduction", decl
);
13512 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13513 OMP_CLAUSE_DECL (c
) = decl
;
13514 c
= finish_omp_clauses (c
);
13517 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13522 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13523 if (COMPARISON_CLASS_P (cond
))
13525 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
13526 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
13527 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
13530 cond
= RECUR (cond
);
13531 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13532 switch (TREE_CODE (incr
))
13534 case PREINCREMENT_EXPR
:
13535 case PREDECREMENT_EXPR
:
13536 case POSTINCREMENT_EXPR
:
13537 case POSTDECREMENT_EXPR
:
13538 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13539 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13542 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13543 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13545 tree rhs
= TREE_OPERAND (incr
, 1);
13546 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13547 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13548 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13549 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13550 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13554 incr
= RECUR (incr
);
13557 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13558 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13560 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13561 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13562 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13563 TREE_TYPE (decl
), lhs
,
13564 RECUR (TREE_OPERAND (incr
, 2))));
13566 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13567 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13568 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13570 tree rhs
= TREE_OPERAND (incr
, 2);
13571 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13572 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13573 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13574 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13575 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13579 incr
= RECUR (incr
);
13582 incr
= RECUR (incr
);
13586 TREE_VEC_ELT (declv
, i
) = decl
;
13587 TREE_VEC_ELT (initv
, i
) = init
;
13588 TREE_VEC_ELT (condv
, i
) = cond
;
13589 TREE_VEC_ELT (incrv
, i
) = incr
;
13593 /* Like tsubst_copy for expressions, etc. but also does semantic
13597 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13598 bool integral_constant_expression_p
)
13600 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13601 #define RECUR(NODE) \
13602 tsubst_expr ((NODE), args, complain, in_decl, \
13603 integral_constant_expression_p)
13609 if (t
== NULL_TREE
|| t
== error_mark_node
)
13612 loc
= input_location
;
13613 if (EXPR_HAS_LOCATION (t
))
13614 input_location
= EXPR_LOCATION (t
);
13615 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13616 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13618 switch (TREE_CODE (t
))
13620 case STATEMENT_LIST
:
13622 tree_stmt_iterator i
;
13623 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13624 RECUR (tsi_stmt (i
));
13628 case CTOR_INITIALIZER
:
13629 finish_mem_initializers (tsubst_initializer_list
13630 (TREE_OPERAND (t
, 0), args
));
13634 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13638 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13639 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13640 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13642 finish_expr_stmt (tmp
);
13646 do_using_directive (USING_STMT_NAMESPACE (t
));
13651 tree decl
, pattern_decl
;
13654 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13655 if (TREE_CODE (decl
) == LABEL_DECL
)
13656 finish_label_decl (DECL_NAME (decl
));
13657 else if (TREE_CODE (decl
) == USING_DECL
)
13659 tree scope
= USING_DECL_SCOPE (decl
);
13660 tree name
= DECL_NAME (decl
);
13663 scope
= tsubst (scope
, args
, complain
, in_decl
);
13664 decl
= lookup_qualified_name (scope
, name
,
13665 /*is_type_p=*/false,
13666 /*complain=*/false);
13667 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13668 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13670 do_local_using_decl (decl
, scope
, name
);
13672 else if (DECL_PACK_P (decl
))
13674 /* Don't build up decls for a variadic capture proxy, we'll
13675 instantiate the elements directly as needed. */
13680 init
= DECL_INITIAL (decl
);
13681 decl
= tsubst (decl
, args
, complain
, in_decl
);
13682 if (decl
!= error_mark_node
)
13684 /* By marking the declaration as instantiated, we avoid
13685 trying to instantiate it. Since instantiate_decl can't
13686 handle local variables, and since we've already done
13687 all that needs to be done, that's the right thing to
13690 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13692 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13693 /* Anonymous aggregates are a special case. */
13694 finish_anon_union (decl
);
13695 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13697 DECL_CONTEXT (decl
) = current_function_decl
;
13698 if (DECL_NAME (decl
) == this_identifier
)
13700 tree lam
= DECL_CONTEXT (current_function_decl
);
13701 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13702 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13704 insert_capture_proxy (decl
);
13706 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13707 /* We already did a pushtag. */;
13708 else if (TREE_CODE (decl
) == FUNCTION_DECL
13709 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
13710 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
13712 DECL_CONTEXT (decl
) = NULL_TREE
;
13714 DECL_CONTEXT (decl
) = current_function_decl
;
13715 cp_check_omp_declare_reduction (decl
);
13719 int const_init
= false;
13720 maybe_push_decl (decl
);
13722 && DECL_PRETTY_FUNCTION_P (decl
))
13724 /* For __PRETTY_FUNCTION__ we have to adjust the
13726 const char *const name
13727 = cxx_printable_name (current_function_decl
, 2);
13728 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
13731 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
13734 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13736 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13745 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13746 RECUR (FOR_INIT_STMT (t
));
13747 finish_for_init_stmt (stmt
);
13748 tmp
= RECUR (FOR_COND (t
));
13749 finish_for_cond (tmp
, stmt
, false);
13750 tmp
= RECUR (FOR_EXPR (t
));
13751 finish_for_expr (tmp
, stmt
);
13752 RECUR (FOR_BODY (t
));
13753 finish_for_stmt (stmt
);
13756 case RANGE_FOR_STMT
:
13759 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13760 decl
= RANGE_FOR_DECL (t
);
13761 decl
= tsubst (decl
, args
, complain
, in_decl
);
13762 maybe_push_decl (decl
);
13763 expr
= RECUR (RANGE_FOR_EXPR (t
));
13764 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
13765 RECUR (RANGE_FOR_BODY (t
));
13766 finish_for_stmt (stmt
);
13771 stmt
= begin_while_stmt ();
13772 tmp
= RECUR (WHILE_COND (t
));
13773 finish_while_stmt_cond (tmp
, stmt
, false);
13774 RECUR (WHILE_BODY (t
));
13775 finish_while_stmt (stmt
);
13779 stmt
= begin_do_stmt ();
13780 RECUR (DO_BODY (t
));
13781 finish_do_body (stmt
);
13782 tmp
= RECUR (DO_COND (t
));
13783 finish_do_stmt (tmp
, stmt
, false);
13787 stmt
= begin_if_stmt ();
13788 tmp
= RECUR (IF_COND (t
));
13789 finish_if_stmt_cond (tmp
, stmt
);
13790 RECUR (THEN_CLAUSE (t
));
13791 finish_then_clause (stmt
);
13793 if (ELSE_CLAUSE (t
))
13795 begin_else_clause (stmt
);
13796 RECUR (ELSE_CLAUSE (t
));
13797 finish_else_clause (stmt
);
13800 finish_if_stmt (stmt
);
13804 if (BIND_EXPR_BODY_BLOCK (t
))
13805 stmt
= begin_function_body ();
13807 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13808 ? BCS_TRY_BLOCK
: 0);
13810 RECUR (BIND_EXPR_BODY (t
));
13812 if (BIND_EXPR_BODY_BLOCK (t
))
13813 finish_function_body (stmt
);
13815 finish_compound_stmt (stmt
);
13819 finish_break_stmt ();
13822 case CONTINUE_STMT
:
13823 finish_continue_stmt ();
13827 stmt
= begin_switch_stmt ();
13828 tmp
= RECUR (SWITCH_STMT_COND (t
));
13829 finish_switch_cond (tmp
, stmt
);
13830 RECUR (SWITCH_STMT_BODY (t
));
13831 finish_switch_stmt (stmt
);
13834 case CASE_LABEL_EXPR
:
13836 tree low
= RECUR (CASE_LOW (t
));
13837 tree high
= RECUR (CASE_HIGH (t
));
13838 finish_case_label (EXPR_LOCATION (t
), low
, high
);
13844 tree decl
= LABEL_EXPR_LABEL (t
);
13847 label
= finish_label_stmt (DECL_NAME (decl
));
13848 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13849 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13854 tmp
= GOTO_DESTINATION (t
);
13855 if (TREE_CODE (tmp
) != LABEL_DECL
)
13856 /* Computed goto's must be tsubst'd into. On the other hand,
13857 non-computed gotos must not be; the identifier in question
13858 will have no binding. */
13861 tmp
= DECL_NAME (tmp
);
13862 finish_goto_stmt (tmp
);
13867 tree string
= RECUR (ASM_STRING (t
));
13868 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
13869 complain
, in_decl
);
13870 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
13871 complain
, in_decl
);
13872 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
13873 complain
, in_decl
);
13874 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
13875 complain
, in_decl
);
13876 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
13878 tree asm_expr
= tmp
;
13879 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13880 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13881 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13888 stmt
= begin_try_block ();
13889 RECUR (TRY_STMTS (t
));
13890 finish_cleanup_try_block (stmt
);
13891 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13895 tree compound_stmt
= NULL_TREE
;
13897 if (FN_TRY_BLOCK_P (t
))
13898 stmt
= begin_function_try_block (&compound_stmt
);
13900 stmt
= begin_try_block ();
13902 RECUR (TRY_STMTS (t
));
13904 if (FN_TRY_BLOCK_P (t
))
13905 finish_function_try_block (stmt
);
13907 finish_try_block (stmt
);
13909 RECUR (TRY_HANDLERS (t
));
13910 if (FN_TRY_BLOCK_P (t
))
13911 finish_function_handler_sequence (stmt
, compound_stmt
);
13913 finish_handler_sequence (stmt
);
13919 tree decl
= HANDLER_PARMS (t
);
13923 decl
= tsubst (decl
, args
, complain
, in_decl
);
13924 /* Prevent instantiate_decl from trying to instantiate
13925 this variable. We've already done all that needs to be
13927 if (decl
!= error_mark_node
)
13928 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13930 stmt
= begin_handler ();
13931 finish_handler_parms (decl
, stmt
);
13932 RECUR (HANDLER_BODY (t
));
13933 finish_handler (stmt
);
13938 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13939 if (CLASS_TYPE_P (tmp
))
13941 /* Local classes are not independent templates; they are
13942 instantiated along with their containing function. And this
13943 way we don't have to deal with pushing out of one local class
13944 to instantiate a member of another local class. */
13946 /* Closures are handled by the LAMBDA_EXPR. */
13947 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13948 complete_type (tmp
);
13949 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13950 if (!DECL_ARTIFICIAL (fn
))
13951 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13955 case STATIC_ASSERT
:
13959 ++c_inhibit_evaluation_warnings
;
13961 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13964 /*integral_constant_expression_p=*/true);
13965 --c_inhibit_evaluation_warnings
;
13967 finish_static_assert (condition
,
13968 STATIC_ASSERT_MESSAGE (t
),
13969 STATIC_ASSERT_SOURCE_LOCATION (t
),
13970 /*member_p=*/false);
13975 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
13976 args
, complain
, in_decl
);
13977 stmt
= begin_omp_parallel ();
13978 RECUR (OMP_PARALLEL_BODY (t
));
13979 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
13980 = OMP_PARALLEL_COMBINED (t
);
13984 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
13985 args
, complain
, in_decl
);
13986 stmt
= begin_omp_task ();
13987 RECUR (OMP_TASK_BODY (t
));
13988 finish_omp_task (tmp
, stmt
);
13994 case OMP_DISTRIBUTE
:
13996 tree clauses
, body
, pre_body
;
13997 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
13998 tree incrv
= NULL_TREE
;
14001 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
14002 args
, complain
, in_decl
);
14003 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14005 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14006 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14007 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14008 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14011 stmt
= begin_omp_structured_block ();
14013 pre_body
= push_stmt_list ();
14014 RECUR (OMP_FOR_PRE_BODY (t
));
14015 pre_body
= pop_stmt_list (pre_body
);
14017 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14018 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14019 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14020 &clauses
, args
, complain
, in_decl
,
14021 integral_constant_expression_p
);
14023 body
= push_stmt_list ();
14024 RECUR (OMP_FOR_BODY (t
));
14025 body
= pop_stmt_list (body
);
14027 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14028 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14029 condv
, incrv
, body
, pre_body
, clauses
);
14032 t
= make_node (TREE_CODE (t
));
14033 TREE_TYPE (t
) = void_type_node
;
14034 OMP_FOR_BODY (t
) = body
;
14035 OMP_FOR_PRE_BODY (t
) = pre_body
;
14036 OMP_FOR_CLAUSES (t
) = clauses
;
14037 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14041 add_stmt (finish_omp_structured_block (stmt
));
14048 case OMP_TARGET_DATA
:
14050 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14051 args
, complain
, in_decl
);
14052 stmt
= push_stmt_list ();
14053 RECUR (OMP_BODY (t
));
14054 stmt
= pop_stmt_list (stmt
);
14057 OMP_BODY (t
) = stmt
;
14058 OMP_CLAUSES (t
) = tmp
;
14062 case OMP_TARGET_UPDATE
:
14063 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14064 args
, complain
, in_decl
);
14066 OMP_CLAUSES (t
) = tmp
;
14073 case OMP_TASKGROUP
:
14075 stmt
= push_stmt_list ();
14076 RECUR (OMP_BODY (t
));
14077 stmt
= pop_stmt_list (stmt
);
14080 OMP_BODY (t
) = stmt
;
14085 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14086 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14088 tree op1
= TREE_OPERAND (t
, 1);
14089 tree rhs1
= NULL_TREE
;
14091 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14093 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14094 op1
= TREE_OPERAND (op1
, 1);
14096 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14097 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14098 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14099 NULL_TREE
, NULL_TREE
, rhs1
,
14100 OMP_ATOMIC_SEQ_CST (t
));
14104 tree op1
= TREE_OPERAND (t
, 1);
14105 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14106 tree rhs1
= NULL_TREE
;
14107 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14108 enum tree_code opcode
= NOP_EXPR
;
14109 if (code
== OMP_ATOMIC_READ
)
14111 v
= RECUR (TREE_OPERAND (op1
, 0));
14112 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14114 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14115 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14117 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14118 v
= RECUR (TREE_OPERAND (op1
, 0));
14119 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14120 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14122 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14123 op11
= TREE_OPERAND (op11
, 1);
14125 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14126 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14127 opcode
= TREE_CODE (op11
);
14128 if (opcode
== MODIFY_EXPR
)
14134 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14135 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14137 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14138 OMP_ATOMIC_SEQ_CST (t
));
14142 case TRANSACTION_EXPR
:
14145 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14146 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14148 if (TRANSACTION_EXPR_IS_STMT (t
))
14150 tree body
= TRANSACTION_EXPR_BODY (t
);
14151 tree noex
= NULL_TREE
;
14152 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14154 noex
= MUST_NOT_THROW_COND (body
);
14155 if (noex
== NULL_TREE
)
14156 noex
= boolean_true_node
;
14157 body
= TREE_OPERAND (body
, 0);
14159 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14161 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14165 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14166 RECUR (TRANSACTION_EXPR_BODY (t
)),
14173 case MUST_NOT_THROW_EXPR
:
14175 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14176 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14177 RETURN (build_must_not_throw_expr (op0
, cond
));
14180 case EXPR_PACK_EXPANSION
:
14181 error ("invalid use of pack expansion expression");
14182 RETURN (error_mark_node
);
14184 case NONTYPE_ARGUMENT_PACK
:
14185 error ("use %<...%> to expand argument pack");
14186 RETURN (error_mark_node
);
14188 case CILK_SPAWN_STMT
:
14189 cfun
->calls_cilk_spawn
= 1;
14190 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
14192 case CILK_SYNC_STMT
:
14193 RETURN (build_cilk_sync ());
14195 case COMPOUND_EXPR
:
14196 tmp
= RECUR (TREE_OPERAND (t
, 0));
14197 if (tmp
== NULL_TREE
)
14198 /* If the first operand was a statement, we're done with it. */
14199 RETURN (RECUR (TREE_OPERAND (t
, 1)));
14200 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
14201 RECUR (TREE_OPERAND (t
, 1)),
14204 case ANNOTATE_EXPR
:
14205 tmp
= RECUR (TREE_OPERAND (t
, 0));
14206 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
14207 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
14210 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
14212 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14213 /*function_p=*/false,
14214 integral_constant_expression_p
));
14217 RETURN (NULL_TREE
);
14219 input_location
= loc
;
14225 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14226 function. For description of the body see comment above
14227 cp_parser_omp_declare_reduction_exprs. */
14230 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14232 if (t
== NULL_TREE
|| t
== error_mark_node
)
14235 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14237 tree_stmt_iterator tsi
;
14240 memset (stmts
, 0, sizeof stmts
);
14241 for (i
= 0, tsi
= tsi_start (t
);
14242 i
< 7 && !tsi_end_p (tsi
);
14243 i
++, tsi_next (&tsi
))
14244 stmts
[i
] = tsi_stmt (tsi
);
14245 gcc_assert (tsi_end_p (tsi
));
14249 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14250 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14251 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14252 args
, complain
, in_decl
);
14253 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14254 args
, complain
, in_decl
);
14255 DECL_CONTEXT (omp_out
) = current_function_decl
;
14256 DECL_CONTEXT (omp_in
) = current_function_decl
;
14257 keep_next_level (true);
14258 tree block
= begin_omp_structured_block ();
14259 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14260 block
= finish_omp_structured_block (block
);
14261 block
= maybe_cleanup_point_expr_void (block
);
14262 add_decl_expr (omp_out
);
14263 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14264 TREE_NO_WARNING (omp_out
) = 1;
14265 add_decl_expr (omp_in
);
14266 finish_expr_stmt (block
);
14270 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14271 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14272 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14273 args
, complain
, in_decl
);
14274 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14275 args
, complain
, in_decl
);
14276 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14277 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14278 keep_next_level (true);
14279 tree block
= begin_omp_structured_block ();
14280 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14281 block
= finish_omp_structured_block (block
);
14282 block
= maybe_cleanup_point_expr_void (block
);
14283 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14284 add_decl_expr (omp_priv
);
14285 add_decl_expr (omp_orig
);
14286 finish_expr_stmt (block
);
14288 add_decl_expr (omp_orig
);
14292 /* T is a postfix-expression that is not being used in a function
14293 call. Return the substituted version of T. */
14296 tsubst_non_call_postfix_expression (tree t
, tree args
,
14297 tsubst_flags_t complain
,
14300 if (TREE_CODE (t
) == SCOPE_REF
)
14301 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14302 /*done=*/false, /*address_p=*/false);
14304 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14305 /*function_p=*/false,
14306 /*integral_constant_expression_p=*/false);
14311 /* Sentinel to disable certain warnings during template substitution. */
14313 struct warning_sentinel
{
14316 warning_sentinel(int& flag
, bool suppress
=true)
14317 : flag(flag
), val(flag
) { if (suppress
) flag
= 0; }
14318 ~warning_sentinel() { flag
= val
; }
14321 /* Like tsubst but deals with expressions and performs semantic
14322 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14325 tsubst_copy_and_build (tree t
,
14327 tsubst_flags_t complain
,
14330 bool integral_constant_expression_p
)
14332 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14333 #define RECUR(NODE) \
14334 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14335 /*function_p=*/false, \
14336 integral_constant_expression_p)
14341 if (t
== NULL_TREE
|| t
== error_mark_node
)
14344 loc
= input_location
;
14345 if (EXPR_HAS_LOCATION (t
))
14346 input_location
= EXPR_LOCATION (t
);
14348 /* N3276 decltype magic only applies to calls at the top level or on the
14349 right side of a comma. */
14350 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14351 complain
&= ~tf_decltype
;
14353 switch (TREE_CODE (t
))
14357 /* Fall through. */
14358 case IDENTIFIER_NODE
:
14362 bool non_integral_constant_expression_p
;
14363 const char *error_msg
;
14365 if (IDENTIFIER_TYPENAME_P (t
))
14367 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14368 t
= mangle_conv_op_name_for_type (new_type
);
14371 /* Look up the name. */
14372 decl
= lookup_name (t
);
14374 /* By convention, expressions use ERROR_MARK_NODE to indicate
14375 failure, not NULL_TREE. */
14376 if (decl
== NULL_TREE
)
14377 decl
= error_mark_node
;
14379 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14381 integral_constant_expression_p
,
14382 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14383 &non_integral_constant_expression_p
,
14384 /*template_p=*/false,
14386 /*address_p=*/false,
14387 /*template_arg_p=*/false,
14392 if (!function_p
&& identifier_p (decl
))
14394 if (complain
& tf_error
)
14395 unqualified_name_lookup_error (decl
);
14396 decl
= error_mark_node
;
14401 case TEMPLATE_ID_EXPR
:
14404 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14405 tree targs
= TREE_OPERAND (t
, 1);
14408 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14410 if (TREE_CODE (templ
) == COMPONENT_REF
)
14412 object
= TREE_OPERAND (templ
, 0);
14413 templ
= TREE_OPERAND (templ
, 1);
14416 object
= NULL_TREE
;
14417 templ
= lookup_template_function (templ
, targs
);
14420 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14421 object
, templ
, NULL_TREE
));
14423 RETURN (baselink_for_fns (templ
));
14428 tree r
= RECUR (TREE_OPERAND (t
, 0));
14430 if (REFERENCE_REF_P (t
))
14432 /* A type conversion to reference type will be enclosed in
14433 such an indirect ref, but the substitution of the cast
14434 will have also added such an indirect ref. */
14435 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14436 r
= convert_from_reference (r
);
14439 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14440 complain
|decltype_flag
);
14446 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14447 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14448 RETURN (build_nop (type
, op0
));
14451 case IMPLICIT_CONV_EXPR
:
14453 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14454 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14455 int flags
= LOOKUP_IMPLICIT
;
14456 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14457 flags
= LOOKUP_NORMAL
;
14458 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14464 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14465 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14466 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
14470 case REINTERPRET_CAST_EXPR
:
14471 case CONST_CAST_EXPR
:
14472 case DYNAMIC_CAST_EXPR
:
14473 case STATIC_CAST_EXPR
:
14476 tree op
, r
= NULL_TREE
;
14478 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14479 if (integral_constant_expression_p
14480 && !cast_valid_in_integral_constant_expression_p (type
))
14482 if (complain
& tf_error
)
14483 error ("a cast to a type other than an integral or "
14484 "enumeration type cannot appear in a constant-expression");
14485 RETURN (error_mark_node
);
14488 op
= RECUR (TREE_OPERAND (t
, 0));
14490 warning_sentinel
s(warn_useless_cast
);
14491 switch (TREE_CODE (t
))
14494 r
= build_functional_cast (type
, op
, complain
);
14496 case REINTERPRET_CAST_EXPR
:
14497 r
= build_reinterpret_cast (type
, op
, complain
);
14499 case CONST_CAST_EXPR
:
14500 r
= build_const_cast (type
, op
, complain
);
14502 case DYNAMIC_CAST_EXPR
:
14503 r
= build_dynamic_cast (type
, op
, complain
);
14505 case STATIC_CAST_EXPR
:
14506 r
= build_static_cast (type
, op
, complain
);
14509 gcc_unreachable ();
14515 case POSTDECREMENT_EXPR
:
14516 case POSTINCREMENT_EXPR
:
14517 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14518 args
, complain
, in_decl
);
14519 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14520 complain
|decltype_flag
));
14522 case PREDECREMENT_EXPR
:
14523 case PREINCREMENT_EXPR
:
14527 case TRUTH_NOT_EXPR
:
14528 case UNARY_PLUS_EXPR
: /* Unary + */
14529 case REALPART_EXPR
:
14530 case IMAGPART_EXPR
:
14531 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14532 RECUR (TREE_OPERAND (t
, 0)),
14533 complain
|decltype_flag
));
14535 case FIX_TRUNC_EXPR
:
14536 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14540 op1
= TREE_OPERAND (t
, 0);
14541 if (TREE_CODE (op1
) == LABEL_DECL
)
14542 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14543 EXPR_LOCATION (op1
)));
14544 if (TREE_CODE (op1
) == SCOPE_REF
)
14545 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14546 /*done=*/true, /*address_p=*/true);
14548 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14550 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14551 complain
|decltype_flag
));
14556 case TRUNC_DIV_EXPR
:
14557 case CEIL_DIV_EXPR
:
14558 case FLOOR_DIV_EXPR
:
14559 case ROUND_DIV_EXPR
:
14560 case EXACT_DIV_EXPR
:
14564 case TRUNC_MOD_EXPR
:
14565 case FLOOR_MOD_EXPR
:
14566 case TRUTH_ANDIF_EXPR
:
14567 case TRUTH_ORIF_EXPR
:
14568 case TRUTH_AND_EXPR
:
14569 case TRUTH_OR_EXPR
:
14585 warning_sentinel
s1(warn_type_limits
);
14586 warning_sentinel
s2(warn_div_by_zero
);
14587 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14588 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14589 tree r
= build_x_binary_op
14590 (input_location
, TREE_CODE (t
),
14592 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14594 : TREE_CODE (TREE_OPERAND (t
, 0))),
14596 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14598 : TREE_CODE (TREE_OPERAND (t
, 1))),
14600 complain
|decltype_flag
);
14601 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14602 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14607 case POINTER_PLUS_EXPR
:
14609 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14610 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14611 return fold_build_pointer_plus (op0
, op1
);
14615 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14616 /*address_p=*/false));
14618 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14619 args
, complain
, in_decl
);
14620 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14621 RECUR (TREE_OPERAND (t
, 1)),
14622 complain
|decltype_flag
));
14624 case ARRAY_NOTATION_REF
:
14626 tree start_index
, length
, stride
;
14627 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14628 args
, complain
, in_decl
);
14629 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14630 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14631 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14632 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14633 length
, stride
, TREE_TYPE (op1
)));
14636 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14637 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14644 op1
= TREE_OPERAND (t
, 0);
14645 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14646 op1
= TREE_TYPE (op1
);
14649 /* When there are no ARGS, we are trying to evaluate a
14650 non-dependent expression from the parser. Trying to do
14651 the substitutions may not work. */
14653 op1
= TREE_TYPE (op1
);
14657 ++cp_unevaluated_operand
;
14658 ++c_inhibit_evaluation_warnings
;
14660 op1
= tsubst (op1
, args
, complain
, in_decl
);
14662 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14663 /*function_p=*/false,
14664 /*integral_constant_expression_p=*/
14666 --cp_unevaluated_operand
;
14667 --c_inhibit_evaluation_warnings
;
14670 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14671 complain
& tf_error
);
14673 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14674 complain
& tf_error
);
14675 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14677 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14679 if (!processing_template_decl
&& TYPE_P (op1
))
14681 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14682 build1 (NOP_EXPR
, op1
, error_mark_node
));
14683 SIZEOF_EXPR_TYPE_P (r
) = 1;
14686 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14687 TREE_SIDE_EFFECTS (r
) = 0;
14688 TREE_READONLY (r
) = 1;
14690 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14695 case AT_ENCODE_EXPR
:
14697 op1
= TREE_OPERAND (t
, 0);
14698 ++cp_unevaluated_operand
;
14699 ++c_inhibit_evaluation_warnings
;
14700 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14701 /*function_p=*/false,
14702 /*integral_constant_expression_p=*/false);
14703 --cp_unevaluated_operand
;
14704 --c_inhibit_evaluation_warnings
;
14705 RETURN (objc_build_encode_expr (op1
));
14708 case NOEXCEPT_EXPR
:
14709 op1
= TREE_OPERAND (t
, 0);
14710 ++cp_unevaluated_operand
;
14711 ++c_inhibit_evaluation_warnings
;
14712 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14713 /*function_p=*/false,
14714 /*integral_constant_expression_p=*/false);
14715 --cp_unevaluated_operand
;
14716 --c_inhibit_evaluation_warnings
;
14717 RETURN (finish_noexcept_expr (op1
, complain
));
14721 warning_sentinel
s(warn_div_by_zero
);
14722 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
14723 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
14724 tree r
= build_x_modify_expr
14725 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
14726 complain
|decltype_flag
);
14727 /* TREE_NO_WARNING must be set if either the expression was
14728 parenthesized or it uses an operator such as >>= rather
14729 than plain assignment. In the former case, it was already
14730 set and must be copied. In the latter case,
14731 build_x_modify_expr sets it and it must not be reset
14733 if (TREE_NO_WARNING (t
))
14734 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14740 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14741 args
, complain
, in_decl
);
14742 /* Remember that there was a reference to this entity. */
14745 RETURN (build_x_arrow (input_location
, op1
, complain
));
14749 tree placement
= RECUR (TREE_OPERAND (t
, 0));
14750 tree init
= RECUR (TREE_OPERAND (t
, 3));
14751 vec
<tree
, va_gc
> *placement_vec
;
14752 vec
<tree
, va_gc
> *init_vec
;
14755 if (placement
== NULL_TREE
)
14756 placement_vec
= NULL
;
14759 placement_vec
= make_tree_vector ();
14760 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
14761 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
14764 /* If there was an initializer in the original tree, but it
14765 instantiated to an empty list, then we should pass a
14766 non-NULL empty vector to tell build_new that it was an
14767 empty initializer() rather than no initializer. This can
14768 only happen when the initializer is a pack expansion whose
14769 parameter packs are of length zero. */
14770 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
14774 init_vec
= make_tree_vector ();
14775 if (init
== void_node
)
14776 gcc_assert (init_vec
!= NULL
);
14779 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
14780 vec_safe_push (init_vec
, TREE_VALUE (init
));
14784 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14785 tree op2
= RECUR (TREE_OPERAND (t
, 2));
14786 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
14787 NEW_EXPR_USE_GLOBAL (t
),
14790 if (placement_vec
!= NULL
)
14791 release_tree_vector (placement_vec
);
14792 if (init_vec
!= NULL
)
14793 release_tree_vector (init_vec
);
14800 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14801 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14802 RETURN (delete_sanity (op0
, op1
,
14803 DELETE_EXPR_USE_VEC (t
),
14804 DELETE_EXPR_USE_GLOBAL (t
),
14808 case COMPOUND_EXPR
:
14810 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
14811 complain
& ~tf_decltype
, in_decl
,
14812 /*function_p=*/false,
14813 integral_constant_expression_p
);
14814 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
14816 RECUR (TREE_OPERAND (t
, 1)),
14817 complain
|decltype_flag
));
14823 vec
<tree
, va_gc
> *call_args
;
14824 unsigned int nargs
, i
;
14829 function
= CALL_EXPR_FN (t
);
14830 /* When we parsed the expression, we determined whether or
14831 not Koenig lookup should be performed. */
14832 koenig_p
= KOENIG_LOOKUP_P (t
);
14833 if (TREE_CODE (function
) == SCOPE_REF
)
14835 qualified_p
= true;
14836 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
14838 /*address_p=*/false);
14840 else if (koenig_p
&& identifier_p (function
))
14842 /* Do nothing; calling tsubst_copy_and_build on an identifier
14843 would incorrectly perform unqualified lookup again.
14845 Note that we can also have an IDENTIFIER_NODE if the earlier
14846 unqualified lookup found a member function; in that case
14847 koenig_p will be false and we do want to do the lookup
14848 again to find the instantiated member function.
14850 FIXME but doing that causes c++/15272, so we need to stop
14851 using IDENTIFIER_NODE in that situation. */
14852 qualified_p
= false;
14856 if (TREE_CODE (function
) == COMPONENT_REF
)
14858 tree op
= TREE_OPERAND (function
, 1);
14860 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
14861 || (BASELINK_P (op
)
14862 && BASELINK_QUALIFIED_P (op
)));
14865 qualified_p
= false;
14867 if (TREE_CODE (function
) == ADDR_EXPR
14868 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
14869 /* Avoid error about taking the address of a constructor. */
14870 function
= TREE_OPERAND (function
, 0);
14872 function
= tsubst_copy_and_build (function
, args
, complain
,
14875 integral_constant_expression_p
);
14877 if (BASELINK_P (function
))
14878 qualified_p
= true;
14881 nargs
= call_expr_nargs (t
);
14882 call_args
= make_tree_vector ();
14883 for (i
= 0; i
< nargs
; ++i
)
14885 tree arg
= CALL_EXPR_ARG (t
, i
);
14887 if (!PACK_EXPANSION_P (arg
))
14888 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
14891 /* Expand the pack expansion and push each entry onto
14893 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
14894 if (TREE_CODE (arg
) == TREE_VEC
)
14896 unsigned int len
, j
;
14898 len
= TREE_VEC_LENGTH (arg
);
14899 for (j
= 0; j
< len
; ++j
)
14901 tree value
= TREE_VEC_ELT (arg
, j
);
14902 if (value
!= NULL_TREE
)
14903 value
= convert_from_reference (value
);
14904 vec_safe_push (call_args
, value
);
14909 /* A partial substitution. Add one entry. */
14910 vec_safe_push (call_args
, arg
);
14915 /* We do not perform argument-dependent lookup if normal
14916 lookup finds a non-function, in accordance with the
14917 expected resolution of DR 218. */
14919 && ((is_overloaded_fn (function
)
14920 /* If lookup found a member function, the Koenig lookup is
14921 not appropriate, even if an unqualified-name was used
14922 to denote the function. */
14923 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14924 || identifier_p (function
))
14925 /* Only do this when substitution turns a dependent call
14926 into a non-dependent call. */
14927 && type_dependent_expression_p_push (t
)
14928 && !any_type_dependent_arguments_p (call_args
))
14929 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
14931 if (identifier_p (function
)
14932 && !any_type_dependent_arguments_p (call_args
))
14934 if (koenig_p
&& (complain
& tf_warning_or_error
))
14936 /* For backwards compatibility and good diagnostics, try
14937 the unqualified lookup again if we aren't in SFINAE
14939 tree unq
= (tsubst_copy_and_build
14940 (function
, args
, complain
, in_decl
, true,
14941 integral_constant_expression_p
));
14942 if (unq
== error_mark_node
)
14943 RETURN (error_mark_node
);
14945 if (unq
!= function
)
14948 if (INDIRECT_REF_P (fn
))
14949 fn
= TREE_OPERAND (fn
, 0);
14950 if (TREE_CODE (fn
) == COMPONENT_REF
)
14951 fn
= TREE_OPERAND (fn
, 1);
14952 if (is_overloaded_fn (fn
))
14953 fn
= get_first_fn (fn
);
14954 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
14955 "%qD was not declared in this scope, "
14956 "and no declarations were found by "
14957 "argument-dependent lookup at the point "
14958 "of instantiation", function
))
14961 /* Can't say anything more. */;
14962 else if (DECL_CLASS_SCOPE_P (fn
))
14964 location_t loc
= EXPR_LOC_OR_LOC (t
,
14967 "declarations in dependent base %qT are "
14968 "not found by unqualified lookup",
14969 DECL_CLASS_CONTEXT (fn
));
14970 if (current_class_ptr
)
14972 "use %<this->%D%> instead", function
);
14975 "use %<%T::%D%> instead",
14976 current_class_name
, function
);
14979 inform (0, "%q+D declared here, later in the "
14980 "translation unit", fn
);
14985 if (identifier_p (function
))
14987 if (complain
& tf_error
)
14988 unqualified_name_lookup_error (function
);
14989 release_tree_vector (call_args
);
14990 RETURN (error_mark_node
);
14994 /* Remember that there was a reference to this entity. */
14995 if (DECL_P (function
))
14996 mark_used (function
);
14998 /* Put back tf_decltype for the actual call. */
14999 complain
|= decltype_flag
;
15001 if (TREE_CODE (function
) == OFFSET_REF
)
15002 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
15004 else if (TREE_CODE (function
) == COMPONENT_REF
)
15006 tree instance
= TREE_OPERAND (function
, 0);
15007 tree fn
= TREE_OPERAND (function
, 1);
15009 if (processing_template_decl
15010 && (type_dependent_expression_p (instance
)
15011 || (!BASELINK_P (fn
)
15012 && TREE_CODE (fn
) != FIELD_DECL
)
15013 || type_dependent_expression_p (fn
)
15014 || any_type_dependent_arguments_p (call_args
)))
15015 ret
= build_nt_call_vec (function
, call_args
);
15016 else if (!BASELINK_P (fn
))
15017 ret
= finish_call_expr (function
, &call_args
,
15018 /*disallow_virtual=*/false,
15019 /*koenig_p=*/false,
15022 ret
= (build_new_method_call
15024 &call_args
, NULL_TREE
,
15025 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15030 ret
= finish_call_expr (function
, &call_args
,
15031 /*disallow_virtual=*/qualified_p
,
15035 release_tree_vector (call_args
);
15042 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15045 if (TREE_CODE (cond
) == INTEGER_CST
)
15047 if (integer_zerop (cond
))
15049 ++c_inhibit_evaluation_warnings
;
15050 exp1
= RECUR (TREE_OPERAND (t
, 1));
15051 --c_inhibit_evaluation_warnings
;
15052 exp2
= RECUR (TREE_OPERAND (t
, 2));
15056 exp1
= RECUR (TREE_OPERAND (t
, 1));
15057 ++c_inhibit_evaluation_warnings
;
15058 exp2
= RECUR (TREE_OPERAND (t
, 2));
15059 --c_inhibit_evaluation_warnings
;
15064 exp1
= RECUR (TREE_OPERAND (t
, 1));
15065 exp2
= RECUR (TREE_OPERAND (t
, 2));
15068 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15069 cond
, exp1
, exp2
, complain
));
15072 case PSEUDO_DTOR_EXPR
:
15074 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15075 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15076 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15077 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15083 tree purpose
, value
, chain
;
15085 if (t
== void_list_node
)
15088 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15089 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15091 /* We have pack expansions, so expand those and
15092 create a new list out of it. */
15093 tree purposevec
= NULL_TREE
;
15094 tree valuevec
= NULL_TREE
;
15098 /* Expand the argument expressions. */
15099 if (TREE_PURPOSE (t
))
15100 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15101 complain
, in_decl
);
15102 if (TREE_VALUE (t
))
15103 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15104 complain
, in_decl
);
15106 /* Build the rest of the list. */
15107 chain
= TREE_CHAIN (t
);
15108 if (chain
&& chain
!= void_type_node
)
15109 chain
= RECUR (chain
);
15111 /* Determine the number of arguments. */
15112 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15114 len
= TREE_VEC_LENGTH (purposevec
);
15115 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15117 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15118 len
= TREE_VEC_LENGTH (valuevec
);
15121 /* Since we only performed a partial substitution into
15122 the argument pack, we only RETURN (a single list
15124 if (purposevec
== TREE_PURPOSE (t
)
15125 && valuevec
== TREE_VALUE (t
)
15126 && chain
== TREE_CHAIN (t
))
15129 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15132 /* Convert the argument vectors into a TREE_LIST */
15136 /* Grab the Ith values. */
15138 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15141 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15144 /* Build the list (backwards). */
15145 chain
= tree_cons (purpose
, value
, chain
);
15151 purpose
= TREE_PURPOSE (t
);
15153 purpose
= RECUR (purpose
);
15154 value
= TREE_VALUE (t
);
15156 value
= RECUR (value
);
15157 chain
= TREE_CHAIN (t
);
15158 if (chain
&& chain
!= void_type_node
)
15159 chain
= RECUR (chain
);
15160 if (purpose
== TREE_PURPOSE (t
)
15161 && value
== TREE_VALUE (t
)
15162 && chain
== TREE_CHAIN (t
))
15164 RETURN (tree_cons (purpose
, value
, chain
));
15167 case COMPONENT_REF
:
15174 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15175 args
, complain
, in_decl
);
15176 /* Remember that there was a reference to this entity. */
15177 if (DECL_P (object
))
15178 mark_used (object
);
15179 object_type
= TREE_TYPE (object
);
15181 member
= TREE_OPERAND (t
, 1);
15182 if (BASELINK_P (member
))
15183 member
= tsubst_baselink (member
,
15184 non_reference (TREE_TYPE (object
)),
15185 args
, complain
, in_decl
);
15187 member
= tsubst_copy (member
, args
, complain
, in_decl
);
15188 if (member
== error_mark_node
)
15189 RETURN (error_mark_node
);
15191 if (type_dependent_expression_p (object
))
15192 /* We can't do much here. */;
15193 else if (!CLASS_TYPE_P (object_type
))
15195 if (scalarish_type_p (object_type
))
15197 tree s
= NULL_TREE
;
15198 tree dtor
= member
;
15200 if (TREE_CODE (dtor
) == SCOPE_REF
)
15202 s
= TREE_OPERAND (dtor
, 0);
15203 dtor
= TREE_OPERAND (dtor
, 1);
15205 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
15207 dtor
= TREE_OPERAND (dtor
, 0);
15209 RETURN (finish_pseudo_destructor_expr
15210 (object
, s
, dtor
, input_location
));
15214 else if (TREE_CODE (member
) == SCOPE_REF
15215 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
15217 /* Lookup the template functions now that we know what the
15219 tree scope
= TREE_OPERAND (member
, 0);
15220 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
15221 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
15222 member
= lookup_qualified_name (scope
, tmpl
,
15223 /*is_type_p=*/false,
15224 /*complain=*/false);
15225 if (BASELINK_P (member
))
15227 BASELINK_FUNCTIONS (member
)
15228 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
15230 member
= (adjust_result_of_qualified_name_lookup
15231 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15236 qualified_name_lookup_error (scope
, tmpl
, member
,
15238 RETURN (error_mark_node
);
15241 else if (TREE_CODE (member
) == SCOPE_REF
15242 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15243 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15245 if (complain
& tf_error
)
15247 if (TYPE_P (TREE_OPERAND (member
, 0)))
15248 error ("%qT is not a class or namespace",
15249 TREE_OPERAND (member
, 0));
15251 error ("%qD is not a class or namespace",
15252 TREE_OPERAND (member
, 0));
15254 RETURN (error_mark_node
);
15256 else if (TREE_CODE (member
) == FIELD_DECL
)
15258 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15259 if (TREE_CODE (r
) == COMPONENT_REF
)
15260 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15264 r
= finish_class_member_access_expr (object
, member
,
15265 /*template_p=*/false,
15267 if (TREE_CODE (r
) == COMPONENT_REF
)
15268 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15273 RETURN (build_throw
15274 (RECUR (TREE_OPERAND (t
, 0))));
15278 vec
<constructor_elt
, va_gc
> *n
;
15279 constructor_elt
*ce
;
15280 unsigned HOST_WIDE_INT idx
;
15281 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15282 bool process_index_p
;
15284 bool need_copy_p
= false;
15287 if (type
== error_mark_node
)
15288 RETURN (error_mark_node
);
15290 /* digest_init will do the wrong thing if we let it. */
15291 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15294 /* We do not want to process the index of aggregate
15295 initializers as they are identifier nodes which will be
15296 looked up by digest_init. */
15297 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15299 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15300 newlen
= vec_safe_length (n
);
15301 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15303 if (ce
->index
&& process_index_p
15304 /* An identifier index is looked up in the type
15305 being initialized, not the current scope. */
15306 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15307 ce
->index
= RECUR (ce
->index
);
15309 if (PACK_EXPANSION_P (ce
->value
))
15311 /* Substitute into the pack expansion. */
15312 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15315 if (ce
->value
== error_mark_node
15316 || PACK_EXPANSION_P (ce
->value
))
15318 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15319 /* Just move the argument into place. */
15320 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15323 /* Update the length of the final CONSTRUCTOR
15324 arguments vector, and note that we will need to
15326 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15327 need_copy_p
= true;
15331 ce
->value
= RECUR (ce
->value
);
15336 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15338 vec_alloc (n
, newlen
);
15339 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15341 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15343 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15344 for (i
= 0; i
< len
; ++i
)
15345 CONSTRUCTOR_APPEND_ELT (n
, 0,
15346 TREE_VEC_ELT (ce
->value
, i
));
15349 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15353 r
= build_constructor (init_list_type_node
, n
);
15354 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15356 if (TREE_HAS_CONSTRUCTOR (t
))
15357 RETURN (finish_compound_literal (type
, r
, complain
));
15359 TREE_TYPE (r
) = type
;
15365 tree operand_0
= TREE_OPERAND (t
, 0);
15366 if (TYPE_P (operand_0
))
15368 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15369 RETURN (get_typeid (operand_0
, complain
));
15373 operand_0
= RECUR (operand_0
);
15374 RETURN (build_typeid (operand_0
, complain
));
15381 else if (DECL_PACK_P (t
))
15383 /* We don't build decls for an instantiation of a
15384 variadic capture proxy, we instantiate the elements
15386 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15387 return RECUR (DECL_VALUE_EXPR (t
));
15393 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15395 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15396 /* If the original type was a reference, we'll be wrapped in
15397 the appropriate INDIRECT_REF. */
15398 r
= convert_from_reference (r
);
15404 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15405 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15406 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
15409 case OFFSETOF_EXPR
:
15410 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0))));
15414 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15415 complain
, in_decl
);
15417 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15419 type2
= tsubst (type2
, args
, complain
, in_decl
);
15421 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15426 tree old_stmt_expr
= cur_stmt_expr
;
15427 tree stmt_expr
= begin_stmt_expr ();
15429 cur_stmt_expr
= stmt_expr
;
15430 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15431 integral_constant_expression_p
);
15432 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15433 cur_stmt_expr
= old_stmt_expr
;
15435 /* If the resulting list of expression statement is empty,
15436 fold it further into void_node. */
15437 if (empty_expr_stmt_p (stmt_expr
))
15438 stmt_expr
= void_node
;
15440 RETURN (stmt_expr
);
15445 tree r
= build_lambda_expr ();
15447 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15448 LAMBDA_EXPR_CLOSURE (r
) = type
;
15449 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15451 LAMBDA_EXPR_LOCATION (r
)
15452 = LAMBDA_EXPR_LOCATION (t
);
15453 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15454 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15455 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15456 LAMBDA_EXPR_DISCRIMINATOR (r
)
15457 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15458 /* For a function scope, we want to use tsubst so that we don't
15459 complain about referring to an auto function before its return
15460 type has been deduced. Otherwise, we want to use tsubst_copy so
15461 that we look up the existing field/parameter/variable rather
15462 than build a new one. */
15463 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15464 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15465 scope
= tsubst (scope
, args
, complain
, in_decl
);
15466 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15468 /* Look up the parameter we want directly, as tsubst_copy
15469 doesn't do what we need. */
15470 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15471 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15472 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15473 parm
= DECL_CHAIN (parm
);
15475 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15476 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15477 DECL_CONTEXT (scope
) = fn
;
15480 scope
= RECUR (scope
);
15481 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15482 LAMBDA_EXPR_RETURN_TYPE (r
)
15483 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15485 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15486 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15488 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15489 determine_visibility (TYPE_NAME (type
));
15490 /* Now that we know visibility, instantiate the type so we have a
15491 declaration of the op() for later calls to lambda_function. */
15492 complete_type (type
);
15494 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15496 RETURN (build_lambda_object (r
));
15500 /* We can get here for a constant initializer of non-dependent type.
15501 FIXME stop folding in cp_parser_initializer_clause. */
15503 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15508 case TRANSACTION_EXPR
:
15509 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15510 integral_constant_expression_p
));
15513 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15515 case VEC_PERM_EXPR
:
15517 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15518 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15519 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15520 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
15525 /* Handle Objective-C++ constructs, if appropriate. */
15528 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15529 in_decl
, /*function_p=*/false);
15533 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15539 input_location
= loc
;
15543 /* Verify that the instantiated ARGS are valid. For type arguments,
15544 make sure that the type's linkage is ok. For non-type arguments,
15545 make sure they are constants if they are integral or enumerations.
15546 Emit an error under control of COMPLAIN, and return TRUE on error. */
15549 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15551 if (dependent_template_arg_p (t
))
15553 if (ARGUMENT_PACK_P (t
))
15555 tree vec
= ARGUMENT_PACK_ARGS (t
);
15556 int len
= TREE_VEC_LENGTH (vec
);
15557 bool result
= false;
15560 for (i
= 0; i
< len
; ++i
)
15561 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15565 else if (TYPE_P (t
))
15567 /* [basic.link]: A name with no linkage (notably, the name
15568 of a class or enumeration declared in a local scope)
15569 shall not be used to declare an entity with linkage.
15570 This implies that names with no linkage cannot be used as
15573 DR 757 relaxes this restriction for C++0x. */
15574 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15575 : no_linkage_check (t
, /*relaxed_p=*/false));
15579 /* DR 488 makes use of a type with no linkage cause
15580 type deduction to fail. */
15581 if (complain
& tf_error
)
15583 if (TYPE_ANONYMOUS_P (nt
))
15584 error ("%qT is/uses anonymous type", t
);
15586 error ("template argument for %qD uses local type %qT",
15591 /* In order to avoid all sorts of complications, we do not
15592 allow variably-modified types as template arguments. */
15593 else if (variably_modified_type_p (t
, NULL_TREE
))
15595 if (complain
& tf_error
)
15596 error ("%qT is a variably modified type", t
);
15600 /* Class template and alias template arguments should be OK. */
15601 else if (DECL_TYPE_TEMPLATE_P (t
))
15603 /* A non-type argument of integral or enumerated type must be a
15605 else if (TREE_TYPE (t
)
15606 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15607 && !TREE_CONSTANT (t
))
15609 if (complain
& tf_error
)
15610 error ("integral expression %qE is not constant", t
);
15617 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15619 int ix
, len
= DECL_NTPARMS (tmpl
);
15620 bool result
= false;
15622 for (ix
= 0; ix
!= len
; ix
++)
15624 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15627 if (result
&& (complain
& tf_error
))
15628 error (" trying to instantiate %qD", tmpl
);
15632 /* We're out of SFINAE context now, so generate diagnostics for the access
15633 errors we saw earlier when instantiating D from TMPL and ARGS. */
15636 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15638 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15639 tree type
= TREE_TYPE (pattern
);
15640 location_t loc
= input_location
;
15642 push_access_scope (d
);
15643 push_deferring_access_checks (dk_no_deferred
);
15644 input_location
= DECL_SOURCE_LOCATION (pattern
);
15645 tsubst (type
, args
, tf_warning_or_error
, d
);
15646 input_location
= loc
;
15647 pop_deferring_access_checks ();
15648 pop_access_scope (d
);
15651 /* Instantiate the indicated variable, function, or alias template TMPL with
15652 the template arguments in TARG_PTR. */
15655 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15657 tree targ_ptr
= orig_args
;
15661 bool access_ok
= true;
15663 if (tmpl
== error_mark_node
)
15664 return error_mark_node
;
15666 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15668 /* If this function is a clone, handle it specially. */
15669 if (DECL_CLONED_FUNCTION_P (tmpl
))
15674 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15675 DECL_CLONED_FUNCTION. */
15676 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
15677 targ_ptr
, complain
);
15678 if (spec
== error_mark_node
)
15679 return error_mark_node
;
15681 /* Look for the clone. */
15682 FOR_EACH_CLONE (clone
, spec
)
15683 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
15685 /* We should always have found the clone by now. */
15686 gcc_unreachable ();
15690 if (targ_ptr
== error_mark_node
)
15691 return error_mark_node
;
15693 /* Check to see if we already have this specialization. */
15694 gen_tmpl
= most_general_template (tmpl
);
15695 if (tmpl
!= gen_tmpl
)
15696 /* The TMPL is a partial instantiation. To get a full set of
15697 arguments we must add the arguments used to perform the
15698 partial instantiation. */
15699 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
15702 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15703 but it doesn't seem to be on the hot path. */
15704 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
15706 gcc_assert (tmpl
== gen_tmpl
15707 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
15709 || fndecl
== NULL_TREE
);
15711 if (spec
!= NULL_TREE
)
15713 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
15715 if (complain
& tf_error
)
15716 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
15717 return error_mark_node
;
15722 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
15724 return error_mark_node
;
15726 /* We are building a FUNCTION_DECL, during which the access of its
15727 parameters and return types have to be checked. However this
15728 FUNCTION_DECL which is the desired context for access checking
15729 is not built yet. We solve this chicken-and-egg problem by
15730 deferring all checks until we have the FUNCTION_DECL. */
15731 push_deferring_access_checks (dk_deferred
);
15733 /* Instantiation of the function happens in the context of the function
15734 template, not the context of the overload resolution we're doing. */
15735 push_to_top_level ();
15736 /* If there are dependent arguments, e.g. because we're doing partial
15737 ordering, make sure processing_template_decl stays set. */
15738 if (uses_template_parms (targ_ptr
))
15739 ++processing_template_decl
;
15740 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15742 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
15743 complain
, gen_tmpl
);
15744 push_nested_class (ctx
);
15746 /* Substitute template parameters to obtain the specialization. */
15747 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
15748 targ_ptr
, complain
, gen_tmpl
);
15749 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15750 pop_nested_class ();
15751 pop_from_top_level ();
15753 if (fndecl
== error_mark_node
)
15755 pop_deferring_access_checks ();
15756 return error_mark_node
;
15759 /* The DECL_TI_TEMPLATE should always be the immediate parent
15760 template, not the most general template. */
15761 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
15763 /* Now we know the specialization, compute access previously
15765 push_access_scope (fndecl
);
15766 if (!perform_deferred_access_checks (complain
))
15768 pop_access_scope (fndecl
);
15769 pop_deferring_access_checks ();
15771 /* If we've just instantiated the main entry point for a function,
15772 instantiate all the alternate entry points as well. We do this
15773 by cloning the instantiation of the main entry point, not by
15774 instantiating the template clones. */
15775 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
15776 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
15780 if (!(complain
& tf_error
))
15782 /* Remember to reinstantiate when we're out of SFINAE so the user
15783 can see the errors. */
15784 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
15786 return error_mark_node
;
15791 /* Wrapper for instantiate_template_1. */
15794 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15797 timevar_push (TV_TEMPLATE_INST
);
15798 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
15799 timevar_pop (TV_TEMPLATE_INST
);
15803 /* Instantiate the alias template TMPL with ARGS. Also push a template
15804 instantiation level, which instantiate_template doesn't do because
15805 functions and variables have sufficient context established by the
15809 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
15811 struct pending_template
*old_last_pend
= last_pending_template
;
15812 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15813 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
15814 return error_mark_node
;
15815 tree tinst
= build_tree_list (tmpl
, args
);
15816 if (!push_tinst_level (tinst
))
15819 return error_mark_node
;
15823 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
15824 args
, tmpl
, complain
,
15825 /*require_all_args=*/true,
15826 /*use_default_args=*/true);
15828 tree r
= instantiate_template (tmpl
, args
, complain
);
15829 pop_tinst_level ();
15830 /* We can't free this if a pending_template entry or last_error_tinst_level
15831 is pointing at it. */
15832 if (last_pending_template
== old_last_pend
15833 && last_error_tinst_level
== old_error_tinst
)
15839 /* PARM is a template parameter pack for FN. Returns true iff
15840 PARM is used in a deducible way in the argument list of FN. */
15843 pack_deducible_p (tree parm
, tree fn
)
15845 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
15846 for (; t
; t
= TREE_CHAIN (t
))
15848 tree type
= TREE_VALUE (t
);
15850 if (!PACK_EXPANSION_P (type
))
15852 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
15853 packs
; packs
= TREE_CHAIN (packs
))
15854 if (template_args_equal (TREE_VALUE (packs
), parm
))
15856 /* The template parameter pack is used in a function parameter
15857 pack. If this is the end of the parameter list, the
15858 template parameter pack is deducible. */
15859 if (TREE_CHAIN (t
) == void_list_node
)
15862 /* Otherwise, not. Well, it could be deduced from
15863 a non-pack parameter, but doing so would end up with
15864 a deduction mismatch, so don't bother. */
15868 /* The template parameter pack isn't used in any function parameter
15869 packs, but it might be used deeper, e.g. tuple<Args...>. */
15873 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
15874 NARGS elements of the arguments that are being used when calling
15875 it. TARGS is a vector into which the deduced template arguments
15878 Returns either a FUNCTION_DECL for the matching specialization of FN or
15879 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
15880 true, diagnostics will be printed to explain why it failed.
15882 If FN is a conversion operator, or we are trying to produce a specific
15883 specialization, RETURN_TYPE is the return type desired.
15885 The EXPLICIT_TARGS are explicit template arguments provided via a
15888 The parameter STRICT is one of:
15891 We are deducing arguments for a function call, as in
15892 [temp.deduct.call].
15895 We are deducing arguments for a conversion function, as in
15896 [temp.deduct.conv].
15899 We are deducing arguments when doing an explicit instantiation
15900 as in [temp.explicit], when determining an explicit specialization
15901 as in [temp.expl.spec], or when taking the address of a function
15902 template, as in [temp.deduct.funcaddr]. */
15905 fn_type_unification (tree fn
,
15906 tree explicit_targs
,
15909 unsigned int nargs
,
15911 unification_kind_t strict
,
15918 tree decl
= NULL_TREE
;
15919 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
15921 static int deduction_depth
;
15922 struct pending_template
*old_last_pend
= last_pending_template
;
15923 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15924 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
15926 tree r
= error_mark_node
;
15929 complain
|= tf_decltype
;
15931 /* In C++0x, it's possible to have a function template whose type depends
15932 on itself recursively. This is most obvious with decltype, but can also
15933 occur with enumeration scope (c++/48969). So we need to catch infinite
15934 recursion and reject the substitution at deduction time; this function
15935 will return error_mark_node for any repeated substitution.
15937 This also catches excessive recursion such as when f<N> depends on
15938 f<N-1> across all integers, and returns error_mark_node for all the
15939 substitutions back up to the initial one.
15941 This is, of course, not reentrant. */
15942 if (excessive_deduction_depth
)
15943 return error_mark_node
;
15944 tinst
= build_tree_list (fn
, NULL_TREE
);
15947 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
15949 fntype
= TREE_TYPE (fn
);
15950 if (explicit_targs
)
15954 The specified template arguments must match the template
15955 parameters in kind (i.e., type, nontype, template), and there
15956 must not be more arguments than there are parameters;
15957 otherwise type deduction fails.
15959 Nontype arguments must match the types of the corresponding
15960 nontype template parameters, or must be convertible to the
15961 types of the corresponding nontype parameters as specified in
15962 _temp.arg.nontype_, otherwise type deduction fails.
15964 All references in the function type of the function template
15965 to the corresponding template parameters are replaced by the
15966 specified template argument values. If a substitution in a
15967 template parameter or in the function type of the function
15968 template results in an invalid type, type deduction fails. */
15969 int i
, len
= TREE_VEC_LENGTH (tparms
);
15970 location_t loc
= input_location
;
15971 bool incomplete
= false;
15973 /* Adjust any explicit template arguments before entering the
15974 substitution context. */
15976 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
15978 /*require_all_args=*/false,
15979 /*use_default_args=*/false));
15980 if (explicit_targs
== error_mark_node
)
15983 /* Substitute the explicit args into the function type. This is
15984 necessary so that, for instance, explicitly declared function
15985 arguments can match null pointed constants. If we were given
15986 an incomplete set of explicit args, we must not do semantic
15987 processing during substitution as we could create partial
15989 for (i
= 0; i
< len
; i
++)
15991 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15992 bool parameter_pack
= false;
15993 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
15995 /* Dig out the actual parm. */
15996 if (TREE_CODE (parm
) == TYPE_DECL
15997 || TREE_CODE (parm
) == TEMPLATE_DECL
)
15999 parm
= TREE_TYPE (parm
);
16000 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
16002 else if (TREE_CODE (parm
) == PARM_DECL
)
16004 parm
= DECL_INITIAL (parm
);
16005 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16008 if (!parameter_pack
&& targ
== NULL_TREE
)
16009 /* No explicit argument for this template parameter. */
16012 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16014 /* Mark the argument pack as "incomplete". We could
16015 still deduce more arguments during unification.
16016 We remove this mark in type_unification_real. */
16019 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16020 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16021 = ARGUMENT_PACK_ARGS (targ
);
16024 /* We have some incomplete argument packs. */
16029 TREE_VALUE (tinst
) = explicit_targs
;
16030 if (!push_tinst_level (tinst
))
16032 excessive_deduction_depth
= true;
16035 processing_template_decl
+= incomplete
;
16036 input_location
= DECL_SOURCE_LOCATION (fn
);
16037 /* Ignore any access checks; we'll see them again in
16038 instantiate_template and they might have the wrong
16039 access path at this point. */
16040 push_deferring_access_checks (dk_deferred
);
16041 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16042 complain
| tf_partial
, NULL_TREE
);
16043 pop_deferring_access_checks ();
16044 input_location
= loc
;
16045 processing_template_decl
-= incomplete
;
16046 pop_tinst_level ();
16048 if (fntype
== error_mark_node
)
16051 /* Place the explicitly specified arguments in TARGS. */
16052 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16053 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16056 /* Never do unification on the 'this' parameter. */
16057 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16063 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16064 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16065 new_args
[0] = return_type
;
16066 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16071 /* We allow incomplete unification without an error message here
16072 because the standard doesn't seem to explicitly prohibit it. Our
16073 callers must be ready to deal with unification failures in any
16076 TREE_VALUE (tinst
) = targs
;
16077 /* If we aren't explaining yet, push tinst context so we can see where
16078 any errors (e.g. from class instantiations triggered by instantiation
16079 of default template arguments) come from. If we are explaining, this
16080 context is redundant. */
16081 if (!explain_p
&& !push_tinst_level (tinst
))
16083 excessive_deduction_depth
= true;
16087 /* type_unification_real will pass back any access checks from default
16088 template argument substitution. */
16089 vec
<deferred_access_check
, va_gc
> *checks
;
16092 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16093 targs
, parms
, args
, nargs
, /*subr=*/0,
16094 strict
, flags
, &checks
, explain_p
);
16096 pop_tinst_level ();
16100 /* Now that we have bindings for all of the template arguments,
16101 ensure that the arguments deduced for the template template
16102 parameters have compatible template parameter lists. We cannot
16103 check this property before we have deduced all template
16104 arguments, because the template parameter types of a template
16105 template parameter might depend on prior template parameters
16106 deduced after the template template parameter. The following
16107 ill-formed example illustrates this issue:
16109 template<typename T, template<T> class C> void f(C<5>, T);
16111 template<int N> struct X {};
16114 f(X<5>(), 5l); // error: template argument deduction fails
16117 The template parameter list of 'C' depends on the template type
16118 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16119 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16120 time that we deduce 'C'. */
16121 if (!template_template_parm_bindings_ok_p
16122 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
16124 unify_inconsistent_template_template_parameters (explain_p
);
16128 /* All is well so far. Now, check:
16132 When all template arguments have been deduced, all uses of
16133 template parameters in nondeduced contexts are replaced with
16134 the corresponding deduced argument values. If the
16135 substitution results in an invalid type, as described above,
16136 type deduction fails. */
16137 TREE_VALUE (tinst
) = targs
;
16138 if (!push_tinst_level (tinst
))
16140 excessive_deduction_depth
= true;
16144 /* Also collect access checks from the instantiation. */
16145 reopen_deferring_access_checks (checks
);
16147 decl
= instantiate_template (fn
, targs
, complain
);
16149 checks
= get_deferred_access_checks ();
16150 pop_deferring_access_checks ();
16152 pop_tinst_level ();
16154 if (decl
== error_mark_node
)
16157 /* Now perform any access checks encountered during substitution. */
16158 push_access_scope (decl
);
16159 ok
= perform_access_checks (checks
, complain
);
16160 pop_access_scope (decl
);
16164 /* If we're looking for an exact match, check that what we got
16165 is indeed an exact match. It might not be if some template
16166 parameters are used in non-deduced contexts. But don't check
16167 for an exact match if we have dependent template arguments;
16168 in that case we're doing partial ordering, and we already know
16169 that we have two candidates that will provide the actual type. */
16170 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
16172 tree substed
= TREE_TYPE (decl
);
16176 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
16178 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
16179 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
16180 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
16182 unify_type_mismatch (explain_p
, args
[i
],
16183 TREE_VALUE (sarg
));
16192 if (excessive_deduction_depth
)
16194 if (deduction_depth
== 0)
16195 /* Reset once we're all the way out. */
16196 excessive_deduction_depth
= false;
16199 /* We can't free this if a pending_template entry or last_error_tinst_level
16200 is pointing at it. */
16201 if (last_pending_template
== old_last_pend
16202 && last_error_tinst_level
== old_error_tinst
)
16208 /* Adjust types before performing type deduction, as described in
16209 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16210 sections are symmetric. PARM is the type of a function parameter
16211 or the return type of the conversion function. ARG is the type of
16212 the argument passed to the call, or the type of the value
16213 initialized with the result of the conversion function.
16214 ARG_EXPR is the original argument expression, which may be null. */
16217 maybe_adjust_types_for_deduction (unification_kind_t strict
,
16231 /* Swap PARM and ARG throughout the remainder of this
16232 function; the handling is precisely symmetric since PARM
16233 will initialize ARG rather than vice versa. */
16241 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16242 too, but here handle it by stripping the reference from PARM
16243 rather than by adding it to ARG. */
16244 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16245 && TYPE_REF_IS_RVALUE (*parm
)
16246 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16247 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16248 && TREE_CODE (*arg
) == REFERENCE_TYPE
16249 && !TYPE_REF_IS_RVALUE (*arg
))
16250 *parm
= TREE_TYPE (*parm
);
16251 /* Nothing else to do in this case. */
16255 gcc_unreachable ();
16258 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16260 /* [temp.deduct.call]
16262 If P is not a reference type:
16264 --If A is an array type, the pointer type produced by the
16265 array-to-pointer standard conversion (_conv.array_) is
16266 used in place of A for type deduction; otherwise,
16268 --If A is a function type, the pointer type produced by
16269 the function-to-pointer standard conversion
16270 (_conv.func_) is used in place of A for type deduction;
16273 --If A is a cv-qualified type, the top level
16274 cv-qualifiers of A's type are ignored for type
16276 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16277 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16278 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16279 *arg
= build_pointer_type (*arg
);
16281 *arg
= TYPE_MAIN_VARIANT (*arg
);
16284 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16285 of the form T&&, where T is a template parameter, and the argument
16286 is an lvalue, T is deduced as A& */
16287 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16288 && TYPE_REF_IS_RVALUE (*parm
)
16289 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16290 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16291 && (arg_expr
? real_lvalue_p (arg_expr
)
16292 /* try_one_overload doesn't provide an arg_expr, but
16293 functions are always lvalues. */
16294 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16295 *arg
= build_reference_type (*arg
);
16297 /* [temp.deduct.call]
16299 If P is a cv-qualified type, the top level cv-qualifiers
16300 of P's type are ignored for type deduction. If P is a
16301 reference type, the type referred to by P is used for
16303 *parm
= TYPE_MAIN_VARIANT (*parm
);
16304 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16306 *parm
= TREE_TYPE (*parm
);
16307 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16310 /* DR 322. For conversion deduction, remove a reference type on parm
16311 too (which has been swapped into ARG). */
16312 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16313 *arg
= TREE_TYPE (*arg
);
16318 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16319 template which does contain any deducible template parameters; check if
16320 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16321 unify_one_argument. */
16324 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16325 int flags
, bool explain_p
)
16330 type
= TREE_TYPE (arg
);
16334 if (same_type_p (parm
, type
))
16335 return unify_success (explain_p
);
16337 if (strict
== DEDUCE_CONV
)
16339 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16340 explain_p
? tf_warning_or_error
: tf_none
))
16341 return unify_success (explain_p
);
16343 else if (strict
!= DEDUCE_EXACT
)
16345 if (can_convert_arg (parm
, type
,
16346 TYPE_P (arg
) ? NULL_TREE
: arg
,
16347 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16348 return unify_success (explain_p
);
16351 if (strict
== DEDUCE_EXACT
)
16352 return unify_type_mismatch (explain_p
, parm
, arg
);
16354 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16357 static bool uses_deducible_template_parms (tree type
);
16359 /* Returns true iff the expression EXPR is one from which a template
16360 argument can be deduced. In other words, if it's an undecorated
16361 use of a template non-type parameter. */
16364 deducible_expression (tree expr
)
16366 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16369 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16370 deducible way; that is, if it has a max value of <PARM> - 1. */
16373 deducible_array_bound (tree domain
)
16375 if (domain
== NULL_TREE
)
16378 tree max
= TYPE_MAX_VALUE (domain
);
16379 if (TREE_CODE (max
) != MINUS_EXPR
)
16382 return deducible_expression (TREE_OPERAND (max
, 0));
16385 /* Returns true iff the template arguments ARGS use a template parameter
16386 in a deducible way. */
16389 deducible_template_args (tree args
)
16391 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16394 tree elt
= TREE_VEC_ELT (args
, i
);
16395 if (ARGUMENT_PACK_P (elt
))
16396 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16399 if (PACK_EXPANSION_P (elt
))
16400 elt
= PACK_EXPANSION_PATTERN (elt
);
16401 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16403 else if (TYPE_P (elt
))
16404 deducible
= uses_deducible_template_parms (elt
);
16406 deducible
= deducible_expression (elt
);
16414 /* Returns true iff TYPE contains any deducible references to template
16415 parameters, as per 14.8.2.5. */
16418 uses_deducible_template_parms (tree type
)
16420 if (PACK_EXPANSION_P (type
))
16421 type
= PACK_EXPANSION_PATTERN (type
);
16428 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16429 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16435 if (POINTER_TYPE_P (type
))
16436 return uses_deducible_template_parms (TREE_TYPE (type
));
16438 /* T[integer-constant ]
16440 if (TREE_CODE (type
) == ARRAY_TYPE
)
16441 return (uses_deducible_template_parms (TREE_TYPE (type
))
16442 || deducible_array_bound (TYPE_DOMAIN (type
)));
16454 if (TYPE_PTRMEM_P (type
))
16455 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16456 || (uses_deducible_template_parms
16457 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16459 /* template-name <T> (where template-name refers to a class template)
16460 template-name <i> (where template-name refers to a class template) */
16461 if (CLASS_TYPE_P (type
)
16462 && CLASSTYPE_TEMPLATE_INFO (type
)
16463 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16464 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16465 (CLASSTYPE_TI_ARGS (type
)));
16470 if (TREE_CODE (type
) == FUNCTION_TYPE
16471 || TREE_CODE (type
) == METHOD_TYPE
)
16473 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16475 tree parm
= TYPE_ARG_TYPES (type
);
16476 if (TREE_CODE (type
) == METHOD_TYPE
)
16477 parm
= TREE_CHAIN (parm
);
16478 for (; parm
; parm
= TREE_CHAIN (parm
))
16479 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16486 /* Subroutine of type_unification_real and unify_pack_expansion to
16487 handle unification of a single P/A pair. Parameters are as
16488 for those functions. */
16491 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16492 int subr
, unification_kind_t strict
, int flags
,
16495 tree arg_expr
= NULL_TREE
;
16498 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16499 return unify_invalid (explain_p
);
16500 if (arg
== unknown_type_node
)
16501 /* We can't deduce anything from this, but we might get all the
16502 template args from other function args. */
16503 return unify_success (explain_p
);
16505 /* Implicit conversions (Clause 4) will be performed on a function
16506 argument to convert it to the type of the corresponding function
16507 parameter if the parameter type contains no template-parameters that
16508 participate in template argument deduction. */
16509 if (TYPE_P (parm
) && !uses_template_parms (parm
))
16510 /* For function parameters that contain no template-parameters at all,
16511 we have historically checked for convertibility in order to shortcut
16512 consideration of this candidate. */
16513 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
16515 else if (strict
== DEDUCE_CALL
16516 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16517 /* For function parameters with only non-deducible template parameters,
16519 return unify_success (explain_p
);
16524 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16525 | UNIFY_ALLOW_MORE_CV_QUAL
16526 | UNIFY_ALLOW_DERIVED
);
16530 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16534 arg_strict
= UNIFY_ALLOW_NONE
;
16538 gcc_unreachable ();
16541 /* We only do these transformations if this is the top-level
16542 parameter_type_list in a call or declaration matching; in other
16543 situations (nested function declarators, template argument lists) we
16544 won't be comparing a type to an expression, and we don't do any type
16550 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16551 if (type_unknown_p (arg
))
16553 /* [temp.deduct.type] A template-argument can be
16554 deduced from a pointer to function or pointer
16555 to member function argument if the set of
16556 overloaded functions does not contain function
16557 templates and at most one of a set of
16558 overloaded functions provides a unique
16561 if (resolve_overloaded_unification
16562 (tparms
, targs
, parm
, arg
, strict
,
16563 arg_strict
, explain_p
))
16564 return unify_success (explain_p
);
16565 return unify_overload_resolution_failure (explain_p
, arg
);
16569 arg
= unlowered_expr_type (arg
);
16570 if (arg
== error_mark_node
)
16571 return unify_invalid (explain_p
);
16575 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16578 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16579 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
16580 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16582 /* For deduction from an init-list we need the actual list. */
16583 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16585 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16588 /* Most parms like fn_type_unification.
16590 If SUBR is 1, we're being called recursively (to unify the
16591 arguments of a function or method parameter of a function
16594 CHECKS is a pointer to a vector of access checks encountered while
16595 substituting default template arguments. */
16598 type_unification_real (tree tparms
,
16602 unsigned int xnargs
,
16604 unification_kind_t strict
,
16606 vec
<deferred_access_check
, va_gc
> **checks
,
16611 int ntparms
= TREE_VEC_LENGTH (tparms
);
16612 int saw_undeduced
= 0;
16615 unsigned int nargs
;
16618 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16619 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16620 gcc_assert (ntparms
> 0);
16622 /* Reset the number of non-defaulted template arguments contained
16624 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16632 while (parms
&& parms
!= void_list_node
16635 parm
= TREE_VALUE (parms
);
16637 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16638 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16639 /* For a function parameter pack that occurs at the end of the
16640 parameter-declaration-list, the type A of each remaining
16641 argument of the call is compared with the type P of the
16642 declarator-id of the function parameter pack. */
16645 parms
= TREE_CHAIN (parms
);
16647 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16648 /* For a function parameter pack that does not occur at the
16649 end of the parameter-declaration-list, the type of the
16650 parameter pack is a non-deduced context. */
16656 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16662 && parms
!= void_list_node
16663 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16665 /* Unify the remaining arguments with the pack expansion type. */
16667 tree parmvec
= make_tree_vec (1);
16669 /* Allocate a TREE_VEC and copy in all of the arguments */
16670 argvec
= make_tree_vec (nargs
- ia
);
16671 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
16672 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
16674 /* Copy the parameter into parmvec. */
16675 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
16676 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
16677 /*subr=*/subr
, explain_p
))
16680 /* Advance to the end of the list of parameters. */
16681 parms
= TREE_CHAIN (parms
);
16684 /* Fail if we've reached the end of the parm list, and more args
16685 are present, and the parm list isn't variadic. */
16686 if (ia
< nargs
&& parms
== void_list_node
)
16687 return unify_too_many_arguments (explain_p
, nargs
, ia
);
16688 /* Fail if parms are left and they don't have default values and
16689 they aren't all deduced as empty packs (c++/57397). This is
16690 consistent with sufficient_parms_p. */
16691 if (parms
&& parms
!= void_list_node
16692 && TREE_PURPOSE (parms
) == NULL_TREE
)
16694 unsigned int count
= nargs
;
16699 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
16702 p
= TREE_CHAIN (p
);
16704 while (p
&& p
!= void_list_node
);
16705 if (count
!= nargs
)
16706 return unify_too_few_arguments (explain_p
, ia
, count
,
16712 tsubst_flags_t complain
= (explain_p
16713 ? tf_warning_or_error
16716 for (i
= 0; i
< ntparms
; i
++)
16718 tree targ
= TREE_VEC_ELT (targs
, i
);
16719 tree tparm
= TREE_VEC_ELT (tparms
, i
);
16721 /* Clear the "incomplete" flags on all argument packs now so that
16722 substituting them into later default arguments works. */
16723 if (targ
&& ARGUMENT_PACK_P (targ
))
16725 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
16726 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
16729 if (targ
|| tparm
== error_mark_node
)
16731 tparm
= TREE_VALUE (tparm
);
16733 /* If this is an undeduced nontype parameter that depends on
16734 a type parameter, try another pass; its type may have been
16735 deduced from a later argument than the one from which
16736 this parameter can be deduced. */
16737 if (TREE_CODE (tparm
) == PARM_DECL
16738 && uses_template_parms (TREE_TYPE (tparm
))
16739 && !saw_undeduced
++)
16742 /* Core issue #226 (C++0x) [temp.deduct]:
16744 If a template argument has not been deduced, its
16745 default template argument, if any, is used.
16747 When we are in C++98 mode, TREE_PURPOSE will either
16748 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16749 to explicitly check cxx_dialect here. */
16750 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
16752 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16753 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
16754 reopen_deferring_access_checks (*checks
);
16755 location_t save_loc
= input_location
;
16757 input_location
= DECL_SOURCE_LOCATION (parm
);
16758 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
16759 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
16761 input_location
= save_loc
;
16762 *checks
= get_deferred_access_checks ();
16763 pop_deferring_access_checks ();
16764 if (arg
== error_mark_node
)
16768 TREE_VEC_ELT (targs
, i
) = arg
;
16769 /* The position of the first default template argument,
16770 is also the number of non-defaulted arguments in TARGS.
16772 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16773 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
16778 /* If the type parameter is a parameter pack, then it will
16779 be deduced to an empty parameter pack. */
16780 if (template_parameter_pack_p (tparm
))
16784 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
16786 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
16787 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
16788 TREE_CONSTANT (arg
) = 1;
16791 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16793 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
16795 TREE_VEC_ELT (targs
, i
) = arg
;
16799 return unify_parameter_deduction_failure (explain_p
, tparm
);
16802 #ifdef ENABLE_CHECKING
16803 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16804 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
16807 return unify_success (explain_p
);
16810 /* Subroutine of type_unification_real. Args are like the variables
16811 at the call site. ARG is an overloaded function (or template-id);
16812 we try deducing template args from each of the overloads, and if
16813 only one succeeds, we go with that. Modifies TARGS and returns
16814 true on success. */
16817 resolve_overloaded_unification (tree tparms
,
16821 unification_kind_t strict
,
16825 tree tempargs
= copy_node (targs
);
16827 tree goodfn
= NULL_TREE
;
16830 if (TREE_CODE (arg
) == ADDR_EXPR
)
16832 arg
= TREE_OPERAND (arg
, 0);
16838 if (TREE_CODE (arg
) == COMPONENT_REF
)
16839 /* Handle `&x' where `x' is some static or non-static member
16841 arg
= TREE_OPERAND (arg
, 1);
16843 if (TREE_CODE (arg
) == OFFSET_REF
)
16844 arg
= TREE_OPERAND (arg
, 1);
16846 /* Strip baselink information. */
16847 if (BASELINK_P (arg
))
16848 arg
= BASELINK_FUNCTIONS (arg
);
16850 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
16852 /* If we got some explicit template args, we need to plug them into
16853 the affected templates before we try to unify, in case the
16854 explicit args will completely resolve the templates in question. */
16857 tree expl_subargs
= TREE_OPERAND (arg
, 1);
16858 arg
= TREE_OPERAND (arg
, 0);
16860 for (; arg
; arg
= OVL_NEXT (arg
))
16862 tree fn
= OVL_CURRENT (arg
);
16863 tree subargs
, elem
;
16865 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16868 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16869 expl_subargs
, NULL_TREE
, tf_none
,
16870 /*require_all_args=*/true,
16871 /*use_default_args=*/true);
16872 if (subargs
!= error_mark_node
16873 && !any_dependent_template_arguments_p (subargs
))
16875 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
16876 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16877 elem
, strict
, sub_strict
, addr_p
, explain_p
)
16878 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
16887 /* If no templates (or more than one) are fully resolved by the
16888 explicit arguments, this template-id is a non-deduced context; it
16889 could still be OK if we deduce all template arguments for the
16890 enclosing call through other arguments. */
16894 else if (TREE_CODE (arg
) != OVERLOAD
16895 && TREE_CODE (arg
) != FUNCTION_DECL
)
16896 /* If ARG is, for example, "(0, &f)" then its type will be unknown
16897 -- but the deduction does not succeed because the expression is
16898 not just the function on its own. */
16901 for (; arg
; arg
= OVL_NEXT (arg
))
16902 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16903 TREE_TYPE (OVL_CURRENT (arg
)),
16904 strict
, sub_strict
, addr_p
, explain_p
)
16905 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
16907 goodfn
= OVL_CURRENT (arg
);
16911 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16912 to function or pointer to member function argument if the set of
16913 overloaded functions does not contain function templates and at most
16914 one of a set of overloaded functions provides a unique match.
16916 So if we found multiple possibilities, we return success but don't
16917 deduce anything. */
16921 int i
= TREE_VEC_LENGTH (targs
);
16923 if (TREE_VEC_ELT (tempargs
, i
))
16925 tree old
= TREE_VEC_ELT (targs
, i
);
16926 tree new_
= TREE_VEC_ELT (tempargs
, i
);
16927 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
16928 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
16929 /* Don't forget explicit template arguments in a pack. */
16930 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
16931 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
16932 TREE_VEC_ELT (targs
, i
) = new_
;
16941 /* Core DR 115: In contexts where deduction is done and fails, or in
16942 contexts where deduction is not done, if a template argument list is
16943 specified and it, along with any default template arguments, identifies
16944 a single function template specialization, then the template-id is an
16945 lvalue for the function template specialization. */
16948 resolve_nondeduced_context (tree orig_expr
)
16950 tree expr
, offset
, baselink
;
16953 if (!type_unknown_p (orig_expr
))
16958 offset
= NULL_TREE
;
16959 baselink
= NULL_TREE
;
16961 if (TREE_CODE (expr
) == ADDR_EXPR
)
16963 expr
= TREE_OPERAND (expr
, 0);
16966 if (TREE_CODE (expr
) == OFFSET_REF
)
16969 expr
= TREE_OPERAND (expr
, 1);
16971 if (BASELINK_P (expr
))
16974 expr
= BASELINK_FUNCTIONS (expr
);
16977 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
16980 tree goodfn
= NULL_TREE
;
16982 /* If we got some explicit template args, we need to plug them into
16983 the affected templates before we try to unify, in case the
16984 explicit args will completely resolve the templates in question. */
16986 tree expl_subargs
= TREE_OPERAND (expr
, 1);
16987 tree arg
= TREE_OPERAND (expr
, 0);
16988 tree badfn
= NULL_TREE
;
16989 tree badargs
= NULL_TREE
;
16991 for (; arg
; arg
= OVL_NEXT (arg
))
16993 tree fn
= OVL_CURRENT (arg
);
16994 tree subargs
, elem
;
16996 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16999 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17000 expl_subargs
, NULL_TREE
, tf_none
,
17001 /*require_all_args=*/true,
17002 /*use_default_args=*/true);
17003 if (subargs
!= error_mark_node
17004 && !any_dependent_template_arguments_p (subargs
))
17006 elem
= instantiate_template (fn
, subargs
, tf_none
);
17007 if (elem
== error_mark_node
)
17012 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17021 mark_used (goodfn
);
17024 expr
= build_baselink (BASELINK_BINFO (baselink
),
17025 BASELINK_ACCESS_BINFO (baselink
),
17026 expr
, BASELINK_OPTYPE (baselink
));
17030 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17031 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17034 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17037 else if (good
== 0 && badargs
)
17038 /* There were no good options and at least one bad one, so let the
17039 user know what the problem is. */
17040 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17045 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17046 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17047 different overloads deduce different arguments for a given parm.
17048 ADDR_P is true if the expression for which deduction is being
17049 performed was of the form "& fn" rather than simply "fn".
17051 Returns 1 on success. */
17054 try_one_overload (tree tparms
,
17059 unification_kind_t strict
,
17068 if (arg
== error_mark_node
)
17071 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17072 to function or pointer to member function argument if the set of
17073 overloaded functions does not contain function templates and at most
17074 one of a set of overloaded functions provides a unique match.
17076 So if this is a template, just return success. */
17078 if (uses_template_parms (arg
))
17081 if (TREE_CODE (arg
) == METHOD_TYPE
)
17082 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
17084 arg
= build_pointer_type (arg
);
17086 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
17088 /* We don't copy orig_targs for this because if we have already deduced
17089 some template args from previous args, unify would complain when we
17090 try to deduce a template parameter for the same argument, even though
17091 there isn't really a conflict. */
17092 nargs
= TREE_VEC_LENGTH (targs
);
17093 tempargs
= make_tree_vec (nargs
);
17095 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
17098 /* First make sure we didn't deduce anything that conflicts with
17099 explicitly specified args. */
17100 for (i
= nargs
; i
--; )
17102 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17103 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
17107 else if (uses_template_parms (elt
))
17108 /* Since we're unifying against ourselves, we will fill in
17109 template args used in the function parm list with our own
17110 template parms. Discard them. */
17111 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
17112 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
17116 for (i
= nargs
; i
--; )
17118 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17121 TREE_VEC_ELT (targs
, i
) = elt
;
17127 /* PARM is a template class (perhaps with unbound template
17128 parameters). ARG is a fully instantiated type. If ARG can be
17129 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
17130 TARGS are as for unify. */
17133 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
17136 tree copy_of_targs
;
17138 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
17139 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
17140 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
17143 /* We need to make a new template argument vector for the call to
17144 unify. If we used TARGS, we'd clutter it up with the result of
17145 the attempted unification, even if this class didn't work out.
17146 We also don't want to commit ourselves to all the unifications
17147 we've already done, since unification is supposed to be done on
17148 an argument-by-argument basis. In other words, consider the
17149 following pathological case:
17151 template <int I, int J, int K>
17154 template <int I, int J>
17155 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
17157 template <int I, int J, int K>
17158 void f(S<I, J, K>, S<I, I, I>);
17167 Now, by the time we consider the unification involving `s2', we
17168 already know that we must have `f<0, 0, 0>'. But, even though
17169 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17170 because there are two ways to unify base classes of S<0, 1, 2>
17171 with S<I, I, I>. If we kept the already deduced knowledge, we
17172 would reject the possibility I=1. */
17173 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
17175 /* If unification failed, we're done. */
17176 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
17177 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
17183 /* Given a template type PARM and a class type ARG, find the unique
17184 base type in ARG that is an instance of PARM. We do not examine
17185 ARG itself; only its base-classes. If there is not exactly one
17186 appropriate base class, return NULL_TREE. PARM may be the type of
17187 a partial specialization, as well as a plain template type. Used
17190 static enum template_base_result
17191 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
17192 bool explain_p
, tree
*result
)
17194 tree rval
= NULL_TREE
;
17197 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
17199 binfo
= TYPE_BINFO (complete_type (arg
));
17202 /* The type could not be completed. */
17203 *result
= NULL_TREE
;
17204 return tbr_incomplete_type
;
17207 /* Walk in inheritance graph order. The search order is not
17208 important, and this avoids multiple walks of virtual bases. */
17209 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
17211 tree r
= try_class_unification (tparms
, targs
, parm
,
17212 BINFO_TYPE (binfo
), explain_p
);
17216 /* If there is more than one satisfactory baseclass, then:
17220 If they yield more than one possible deduced A, the type
17224 if (rval
&& !same_type_p (r
, rval
))
17226 *result
= NULL_TREE
;
17227 return tbr_ambiguous_baseclass
;
17235 return tbr_success
;
17238 /* Returns the level of DECL, which declares a template parameter. */
17241 template_decl_level (tree decl
)
17243 switch (TREE_CODE (decl
))
17246 case TEMPLATE_DECL
:
17247 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
17250 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
17253 gcc_unreachable ();
17258 /* Decide whether ARG can be unified with PARM, considering only the
17259 cv-qualifiers of each type, given STRICT as documented for unify.
17260 Returns nonzero iff the unification is OK on that basis. */
17263 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17265 int arg_quals
= cp_type_quals (arg
);
17266 int parm_quals
= cp_type_quals (parm
);
17268 /* DR 1584: cv-qualification of a deduced function type is
17269 ignored; see 8.3.5 [dcl.fct]. */
17270 if (TREE_CODE (arg
) == FUNCTION_TYPE
)
17273 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17274 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17276 /* Although a CVR qualifier is ignored when being applied to a
17277 substituted template parameter ([8.3.2]/1 for example), that
17278 does not allow us to unify "const T" with "int&" because both
17279 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17280 It is ok when we're allowing additional CV qualifiers
17281 at the outer level [14.8.2.1]/3,1st bullet. */
17282 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17283 || TREE_CODE (arg
) == FUNCTION_TYPE
17284 || TREE_CODE (arg
) == METHOD_TYPE
)
17285 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17288 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17289 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17293 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17294 && (arg_quals
& parm_quals
) != parm_quals
)
17297 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17298 && (parm_quals
& arg_quals
) != arg_quals
)
17304 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17306 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17308 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17309 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17310 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17312 *index
= TEMPLATE_TYPE_IDX (parm
);
17313 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17317 *index
= TEMPLATE_PARM_IDX (parm
);
17318 *level
= TEMPLATE_PARM_LEVEL (parm
);
17322 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17324 if (unify (TP, TA, P, A, S, EP)) \
17328 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17329 expansion at the end of PACKED_PARMS. Returns 0 if the type
17330 deduction succeeds, 1 otherwise. STRICT is the same as in
17331 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17332 call argument list. We'll need to adjust the arguments to make them
17333 types. SUBR tells us if this is from a recursive call to
17334 type_unification_real, or for comparing two template argument
17338 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17339 tree packed_args
, unification_kind_t strict
,
17340 bool subr
, bool explain_p
)
17343 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17344 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17345 tree pack
, packs
= NULL_TREE
;
17346 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17348 packed_args
= expand_template_argument_pack (packed_args
);
17350 int len
= TREE_VEC_LENGTH (packed_args
);
17352 /* Determine the parameter packs we will be deducing from the
17353 pattern, and record their current deductions. */
17354 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17355 pack
; pack
= TREE_CHAIN (pack
))
17357 tree parm_pack
= TREE_VALUE (pack
);
17360 /* Determine the index and level of this parameter pack. */
17361 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17363 /* Keep track of the parameter packs and their corresponding
17365 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17366 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17369 /* Loop through all of the arguments that have not yet been
17370 unified and unify each with the pattern. */
17371 for (i
= start
; i
< len
; i
++)
17374 bool any_explicit
= false;
17375 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17377 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17378 or the element of its argument pack at the current index if
17379 this argument was explicitly specified. */
17380 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17384 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17387 if (TREE_VALUE (pack
)
17388 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17389 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17391 any_explicit
= true;
17392 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17394 TMPL_ARG (targs
, level
, idx
) = arg
;
17397 /* If we had explicit template arguments, substitute them into the
17398 pattern before deduction. */
17401 /* Some arguments might still be unspecified or dependent. */
17403 ++processing_template_decl
;
17404 dependent
= any_dependent_template_arguments_p (targs
);
17406 --processing_template_decl
;
17407 parm
= tsubst (pattern
, targs
,
17408 explain_p
? tf_warning_or_error
: tf_none
,
17411 --processing_template_decl
;
17412 if (parm
== error_mark_node
)
17418 /* Unify the pattern with the current argument. */
17419 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17420 LOOKUP_IMPLICIT
, explain_p
))
17423 /* For each parameter pack, collect the deduced value. */
17424 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17427 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17429 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17430 TMPL_ARG (targs
, level
, idx
);
17434 /* Verify that the results of unification with the parameter packs
17435 produce results consistent with what we've seen before, and make
17436 the deduced argument packs available. */
17437 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17439 tree old_pack
= TREE_VALUE (pack
);
17440 tree new_args
= TREE_TYPE (pack
);
17441 int i
, len
= TREE_VEC_LENGTH (new_args
);
17443 bool nondeduced_p
= false;
17445 /* By default keep the original deduced argument pack.
17446 If necessary, more specific code is going to update the
17447 resulting deduced argument later down in this function. */
17448 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17449 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17451 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17452 actually deduce anything. */
17453 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17454 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17455 nondeduced_p
= true;
17459 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17461 /* If we had fewer function args than explicit template args,
17462 just use the explicits. */
17463 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17464 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17465 if (len
< explicit_len
)
17466 new_args
= explicit_args
;
17472 /* Build the deduced *_ARGUMENT_PACK. */
17473 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17475 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17476 TREE_TYPE (result
) =
17477 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17478 TREE_CONSTANT (result
) = 1;
17481 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17483 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17485 /* Note the deduced argument packs for this parameter
17487 TMPL_ARG (targs
, level
, idx
) = result
;
17489 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17490 && (ARGUMENT_PACK_ARGS (old_pack
)
17491 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17493 /* We only had the explicitly-provided arguments before, but
17494 now we have a complete set of arguments. */
17495 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17497 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17498 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17499 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17503 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17504 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17506 if (!comp_template_args_with_info (old_args
, new_args
,
17507 &bad_old_arg
, &bad_new_arg
))
17508 /* Inconsistent unification of this parameter pack. */
17509 return unify_parameter_pack_inconsistent (explain_p
,
17515 return unify_success (explain_p
);
17518 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17519 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17520 parameters and return value are as for unify. */
17523 unify_array_domain (tree tparms
, tree targs
,
17524 tree parm_dom
, tree arg_dom
,
17532 /* Our representation of array types uses "N - 1" as the
17533 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17534 not an integer constant. We cannot unify arbitrarily
17535 complex expressions, so we eliminate the MINUS_EXPRs
17537 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17538 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17541 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17542 parm_max
= TREE_OPERAND (parm_max
, 0);
17544 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17545 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17548 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17549 trying to unify the type of a variable with the type
17550 of a template parameter. For example:
17552 template <unsigned int N>
17553 void f (char (&) [N]);
17560 Here, the type of the ARG will be "int [g(i)]", and
17561 may be a SAVE_EXPR, etc. */
17562 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17563 return unify_vla_arg (explain_p
, arg_dom
);
17564 arg_max
= TREE_OPERAND (arg_max
, 0);
17567 /* If only one of the bounds used a MINUS_EXPR, compensate
17568 by adding one to the other bound. */
17569 if (parm_cst
&& !arg_cst
)
17570 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17574 else if (arg_cst
&& !parm_cst
)
17575 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17580 return unify (tparms
, targs
, parm_max
, arg_max
,
17581 UNIFY_ALLOW_INTEGER
, explain_p
);
17584 /* Deduce the value of template parameters. TPARMS is the (innermost)
17585 set of template parameters to a template. TARGS is the bindings
17586 for those template parameters, as determined thus far; TARGS may
17587 include template arguments for outer levels of template parameters
17588 as well. PARM is a parameter to a template function, or a
17589 subcomponent of that parameter; ARG is the corresponding argument.
17590 This function attempts to match PARM with ARG in a manner
17591 consistent with the existing assignments in TARGS. If more values
17592 are deduced, then TARGS is updated.
17594 Returns 0 if the type deduction succeeds, 1 otherwise. The
17595 parameter STRICT is a bitwise or of the following flags:
17598 Require an exact match between PARM and ARG.
17599 UNIFY_ALLOW_MORE_CV_QUAL:
17600 Allow the deduced ARG to be more cv-qualified (by qualification
17601 conversion) than ARG.
17602 UNIFY_ALLOW_LESS_CV_QUAL:
17603 Allow the deduced ARG to be less cv-qualified than ARG.
17604 UNIFY_ALLOW_DERIVED:
17605 Allow the deduced ARG to be a template base class of ARG,
17606 or a pointer to a template base class of the type pointed to by
17608 UNIFY_ALLOW_INTEGER:
17609 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17610 case for more information.
17611 UNIFY_ALLOW_OUTER_LEVEL:
17612 This is the outermost level of a deduction. Used to determine validity
17613 of qualification conversions. A valid qualification conversion must
17614 have const qualified pointers leading up to the inner type which
17615 requires additional CV quals, except at the outer level, where const
17616 is not required [conv.qual]. It would be normal to set this flag in
17617 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17618 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17619 This is the outermost level of a deduction, and PARM can be more CV
17620 qualified at this point.
17621 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17622 This is the outermost level of a deduction, and PARM can be less CV
17623 qualified at this point. */
17626 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
17632 int strict_in
= strict
;
17634 /* I don't think this will do the right thing with respect to types.
17635 But the only case I've seen it in so far has been array bounds, where
17636 signedness is the only information lost, and I think that will be
17638 while (TREE_CODE (parm
) == NOP_EXPR
)
17639 parm
= TREE_OPERAND (parm
, 0);
17641 if (arg
== error_mark_node
)
17642 return unify_invalid (explain_p
);
17643 if (arg
== unknown_type_node
17644 || arg
== init_list_type_node
)
17645 /* We can't deduce anything from this, but we might get all the
17646 template args from other function args. */
17647 return unify_success (explain_p
);
17649 /* If PARM uses template parameters, then we can't bail out here,
17650 even if ARG == PARM, since we won't record unifications for the
17651 template parameters. We might need them if we're trying to
17652 figure out which of two things is more specialized. */
17653 if (arg
== parm
&& !uses_template_parms (parm
))
17654 return unify_success (explain_p
);
17656 /* Handle init lists early, so the rest of the function can assume
17657 we're dealing with a type. */
17658 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
17662 tree orig_parm
= parm
;
17664 /* Replace T with std::initializer_list<T> for deduction. */
17665 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17666 && flag_deduce_init_list
)
17667 parm
= listify (parm
);
17669 if (!is_std_init_list (parm
)
17670 && TREE_CODE (parm
) != ARRAY_TYPE
)
17671 /* We can only deduce from an initializer list argument if the
17672 parameter is std::initializer_list or an array; otherwise this
17673 is a non-deduced context. */
17674 return unify_success (explain_p
);
17676 if (TREE_CODE (parm
) == ARRAY_TYPE
)
17677 elttype
= TREE_TYPE (parm
);
17679 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
17681 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
17683 int elt_strict
= strict
;
17685 if (elt
== error_mark_node
)
17686 return unify_invalid (explain_p
);
17688 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
17690 tree type
= TREE_TYPE (elt
);
17691 /* It should only be possible to get here for a call. */
17692 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
17693 elt_strict
|= maybe_adjust_types_for_deduction
17694 (DEDUCE_CALL
, &elttype
, &type
, elt
);
17698 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
17702 if (TREE_CODE (parm
) == ARRAY_TYPE
17703 && deducible_array_bound (TYPE_DOMAIN (parm
)))
17705 /* Also deduce from the length of the initializer list. */
17706 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
17707 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
17708 if (idx
== error_mark_node
)
17709 return unify_invalid (explain_p
);
17710 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17714 /* If the std::initializer_list<T> deduction worked, replace the
17715 deduced A with std::initializer_list<A>. */
17716 if (orig_parm
!= parm
)
17718 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
17719 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17720 targ
= listify (targ
);
17721 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
17723 return unify_success (explain_p
);
17726 /* Immediately reject some pairs that won't unify because of
17727 cv-qualification mismatches. */
17728 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17730 /* It is the elements of the array which hold the cv quals of an array
17731 type, and the elements might be template type parms. We'll check
17732 when we recurse. */
17733 && TREE_CODE (arg
) != ARRAY_TYPE
17734 /* We check the cv-qualifiers when unifying with template type
17735 parameters below. We want to allow ARG `const T' to unify with
17736 PARM `T' for example, when computing which of two templates
17737 is more specialized, for example. */
17738 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
17739 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
17740 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17742 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
17743 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
17744 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
17745 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
17746 strict
&= ~UNIFY_ALLOW_DERIVED
;
17747 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17748 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
17750 switch (TREE_CODE (parm
))
17752 case TYPENAME_TYPE
:
17754 case UNBOUND_CLASS_TEMPLATE
:
17755 /* In a type which contains a nested-name-specifier, template
17756 argument values cannot be deduced for template parameters used
17757 within the nested-name-specifier. */
17758 return unify_success (explain_p
);
17760 case TEMPLATE_TYPE_PARM
:
17761 case TEMPLATE_TEMPLATE_PARM
:
17762 case BOUND_TEMPLATE_TEMPLATE_PARM
:
17763 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17764 if (error_operand_p (tparm
))
17765 return unify_invalid (explain_p
);
17767 if (TEMPLATE_TYPE_LEVEL (parm
)
17768 != template_decl_level (tparm
))
17769 /* The PARM is not one we're trying to unify. Just check
17770 to see if it matches ARG. */
17772 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17773 && (is_auto (parm
) ? is_auto (arg
)
17774 : same_type_p (parm
, arg
)))
17775 return unify_success (explain_p
);
17777 return unify_type_mismatch (explain_p
, parm
, arg
);
17779 idx
= TEMPLATE_TYPE_IDX (parm
);
17780 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17781 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
17782 if (error_operand_p (tparm
))
17783 return unify_invalid (explain_p
);
17785 /* Check for mixed types and values. */
17786 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17787 && TREE_CODE (tparm
) != TYPE_DECL
)
17788 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17789 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
17790 gcc_unreachable ();
17792 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17794 /* ARG must be constructed from a template class or a template
17795 template parameter. */
17796 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
17797 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
17798 return unify_template_deduction_failure (explain_p
, parm
, arg
);
17800 tree parmvec
= TYPE_TI_ARGS (parm
);
17801 /* An alias template name is never deduced. */
17802 if (TYPE_ALIAS_P (arg
))
17803 arg
= strip_typedefs (arg
);
17804 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
17805 tree full_argvec
= add_to_template_args (targs
, argvec
);
17807 = DECL_INNERMOST_TEMPLATE_PARMS
17808 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
17810 int parm_variadic_p
= 0;
17812 /* The resolution to DR150 makes clear that default
17813 arguments for an N-argument may not be used to bind T
17814 to a template template parameter with fewer than N
17815 parameters. It is not safe to permit the binding of
17816 default arguments as an extension, as that may change
17817 the meaning of a conforming program. Consider:
17819 struct Dense { static const unsigned int dim = 1; };
17821 template <template <typename> class View,
17823 void operator+(float, View<Block> const&);
17825 template <typename Block,
17826 unsigned int Dim = Block::dim>
17827 struct Lvalue_proxy { operator float() const; };
17831 Lvalue_proxy<Dense> p;
17836 Here, if Lvalue_proxy is permitted to bind to View, then
17837 the global operator+ will be used; if they are not, the
17838 Lvalue_proxy will be converted to float. */
17839 if (coerce_template_parms (parm_parms
,
17841 TYPE_TI_TEMPLATE (parm
),
17843 ? tf_warning_or_error
17845 /*require_all_args=*/true,
17846 /*use_default_args=*/false)
17847 == error_mark_node
)
17850 /* Deduce arguments T, i from TT<T> or TT<i>.
17851 We check each element of PARMVEC and ARGVEC individually
17852 rather than the whole TREE_VEC since they can have
17853 different number of elements. */
17855 parmvec
= expand_template_argument_pack (parmvec
);
17856 argvec
= expand_template_argument_pack (argvec
);
17858 len
= TREE_VEC_LENGTH (parmvec
);
17860 /* Check if the parameters end in a pack, making them
17863 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
17864 parm_variadic_p
= 1;
17866 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17867 /* If the template argument list of P contains a pack
17868 expansion that is not the last template argument, the
17869 entire template argument list is a non-deduced
17871 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
17872 return unify_success (explain_p
);
17874 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
17875 return unify_too_few_arguments (explain_p
,
17876 TREE_VEC_LENGTH (argvec
), len
);
17878 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17880 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17881 TREE_VEC_ELT (parmvec
, i
),
17882 TREE_VEC_ELT (argvec
, i
),
17883 UNIFY_ALLOW_NONE
, explain_p
);
17886 if (parm_variadic_p
17887 && unify_pack_expansion (tparms
, targs
,
17890 /*subr=*/true, explain_p
))
17893 arg
= TYPE_TI_TEMPLATE (arg
);
17895 /* Fall through to deduce template name. */
17898 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17899 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17901 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
17903 /* Simple cases: Value already set, does match or doesn't. */
17904 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
17905 return unify_success (explain_p
);
17907 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17911 /* If PARM is `const T' and ARG is only `int', we don't have
17912 a match unless we are allowing additional qualification.
17913 If ARG is `const int' and PARM is just `T' that's OK;
17914 that binds `const int' to `T'. */
17915 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
17917 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17919 /* Consider the case where ARG is `const volatile int' and
17920 PARM is `const T'. Then, T should be `volatile int'. */
17921 arg
= cp_build_qualified_type_real
17922 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
17923 if (arg
== error_mark_node
)
17924 return unify_invalid (explain_p
);
17926 /* Simple cases: Value already set, does match or doesn't. */
17927 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
17928 return unify_success (explain_p
);
17930 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17932 /* Make sure that ARG is not a variable-sized array. (Note
17933 that were talking about variable-sized arrays (like
17934 `int[n]'), rather than arrays of unknown size (like
17935 `int[]').) We'll get very confused by such a type since
17936 the bound of the array is not constant, and therefore
17937 not mangleable. Besides, such types are not allowed in
17938 ISO C++, so we can do as we please here. We do allow
17939 them for 'auto' deduction, since that isn't ABI-exposed. */
17940 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
17941 return unify_vla_arg (explain_p
, arg
);
17943 /* Strip typedefs as in convert_template_argument. */
17944 arg
= canonicalize_type_argument (arg
, tf_none
);
17947 /* If ARG is a parameter pack or an expansion, we cannot unify
17948 against it unless PARM is also a parameter pack. */
17949 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
17950 && !template_parameter_pack_p (parm
))
17951 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
17953 /* If the argument deduction results is a METHOD_TYPE,
17954 then there is a problem.
17955 METHOD_TYPE doesn't map to any real C++ type the result of
17956 the deduction can not be of that type. */
17957 if (TREE_CODE (arg
) == METHOD_TYPE
)
17958 return unify_method_type_error (explain_p
, arg
);
17960 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
17961 return unify_success (explain_p
);
17963 case TEMPLATE_PARM_INDEX
:
17964 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17965 if (error_operand_p (tparm
))
17966 return unify_invalid (explain_p
);
17968 if (TEMPLATE_PARM_LEVEL (parm
)
17969 != template_decl_level (tparm
))
17971 /* The PARM is not one we're trying to unify. Just check
17972 to see if it matches ARG. */
17973 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
17974 && cp_tree_equal (parm
, arg
));
17976 unify_expression_unequal (explain_p
, parm
, arg
);
17980 idx
= TEMPLATE_PARM_IDX (parm
);
17981 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17985 int x
= !cp_tree_equal (targ
, arg
);
17987 unify_inconsistency (explain_p
, parm
, targ
, arg
);
17991 /* [temp.deduct.type] If, in the declaration of a function template
17992 with a non-type template-parameter, the non-type
17993 template-parameter is used in an expression in the function
17994 parameter-list and, if the corresponding template-argument is
17995 deduced, the template-argument type shall match the type of the
17996 template-parameter exactly, except that a template-argument
17997 deduced from an array bound may be of any integral type.
17998 The non-type parameter might use already deduced type parameters. */
17999 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
18000 if (!TREE_TYPE (arg
))
18001 /* Template-parameter dependent expression. Just accept it for now.
18002 It will later be processed in convert_template_argument. */
18004 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18006 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18007 && CP_INTEGRAL_TYPE_P (tparm
))
18008 /* Convert the ARG to the type of PARM; the deduced non-type
18009 template argument must exactly match the types of the
18010 corresponding parameter. */
18011 arg
= fold (build_nop (tparm
, arg
));
18012 else if (uses_template_parms (tparm
))
18013 /* We haven't deduced the type of this parameter yet. Try again
18015 return unify_success (explain_p
);
18017 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18019 /* If ARG is a parameter pack or an expansion, we cannot unify
18020 against it unless PARM is also a parameter pack. */
18021 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18022 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18023 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18025 arg
= strip_typedefs_expr (arg
);
18026 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18027 return unify_success (explain_p
);
18031 /* A pointer-to-member constant can be unified only with
18032 another constant. */
18033 if (TREE_CODE (arg
) != PTRMEM_CST
)
18034 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18036 /* Just unify the class member. It would be useless (and possibly
18037 wrong, depending on the strict flags) to unify also
18038 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18039 arg refer to the same variable, even if through different
18040 classes. For instance:
18042 struct A { int x; };
18045 Unification of &A::x and &B::x must succeed. */
18046 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18047 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18052 if (!TYPE_PTR_P (arg
))
18053 return unify_type_mismatch (explain_p
, parm
, arg
);
18055 /* [temp.deduct.call]
18057 A can be another pointer or pointer to member type that can
18058 be converted to the deduced A via a qualification
18059 conversion (_conv.qual_).
18061 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18062 This will allow for additional cv-qualification of the
18063 pointed-to types if appropriate. */
18065 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18066 /* The derived-to-base conversion only persists through one
18067 level of pointers. */
18068 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
18070 return unify (tparms
, targs
, TREE_TYPE (parm
),
18071 TREE_TYPE (arg
), strict
, explain_p
);
18074 case REFERENCE_TYPE
:
18075 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
18076 return unify_type_mismatch (explain_p
, parm
, arg
);
18077 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18078 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18081 if (TREE_CODE (arg
) != ARRAY_TYPE
)
18082 return unify_type_mismatch (explain_p
, parm
, arg
);
18083 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
18084 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
18085 return unify_type_mismatch (explain_p
, parm
, arg
);
18086 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18087 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18088 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
18089 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18090 TYPE_DOMAIN (arg
), explain_p
);
18091 return unify_success (explain_p
);
18098 case ENUMERAL_TYPE
:
18101 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18102 return unify_type_mismatch (explain_p
, parm
, arg
);
18104 /* We have already checked cv-qualification at the top of the
18106 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
18107 return unify_type_mismatch (explain_p
, parm
, arg
);
18109 /* As far as unification is concerned, this wins. Later checks
18110 will invalidate it if necessary. */
18111 return unify_success (explain_p
);
18113 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
18114 /* Type INTEGER_CST can come from ordinary constant template args. */
18116 while (TREE_CODE (arg
) == NOP_EXPR
)
18117 arg
= TREE_OPERAND (arg
, 0);
18119 if (TREE_CODE (arg
) != INTEGER_CST
)
18120 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18121 return (tree_int_cst_equal (parm
, arg
)
18122 ? unify_success (explain_p
)
18123 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
18127 int i
, len
, argslen
;
18128 int parm_variadic_p
= 0;
18130 if (TREE_CODE (arg
) != TREE_VEC
)
18131 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18133 len
= TREE_VEC_LENGTH (parm
);
18134 argslen
= TREE_VEC_LENGTH (arg
);
18136 /* Check for pack expansions in the parameters. */
18137 for (i
= 0; i
< len
; ++i
)
18139 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
18142 /* We can unify against something with a trailing
18144 parm_variadic_p
= 1;
18146 /* [temp.deduct.type]/9: If the template argument list of
18147 P contains a pack expansion that is not the last
18148 template argument, the entire template argument list
18149 is a non-deduced context. */
18150 return unify_success (explain_p
);
18154 /* If we don't have enough arguments to satisfy the parameters
18155 (not counting the pack expression at the end), or we have
18156 too many arguments for a parameter list that doesn't end in
18157 a pack expression, we can't unify. */
18158 if (parm_variadic_p
18159 ? argslen
< len
- parm_variadic_p
18161 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
18163 /* Unify all of the parameters that precede the (optional)
18164 pack expression. */
18165 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18167 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18168 TREE_VEC_ELT (parm
, i
),
18169 TREE_VEC_ELT (arg
, i
),
18170 UNIFY_ALLOW_NONE
, explain_p
);
18172 if (parm_variadic_p
)
18173 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
18175 /*subr=*/true, explain_p
);
18176 return unify_success (explain_p
);
18181 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18182 return unify_type_mismatch (explain_p
, parm
, arg
);
18184 if (TYPE_PTRMEMFUNC_P (parm
))
18186 if (!TYPE_PTRMEMFUNC_P (arg
))
18187 return unify_type_mismatch (explain_p
, parm
, arg
);
18189 return unify (tparms
, targs
,
18190 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
18191 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
18192 strict
, explain_p
);
18194 else if (TYPE_PTRMEMFUNC_P (arg
))
18195 return unify_type_mismatch (explain_p
, parm
, arg
);
18197 if (CLASSTYPE_TEMPLATE_INFO (parm
))
18199 tree t
= NULL_TREE
;
18201 if (strict_in
& UNIFY_ALLOW_DERIVED
)
18203 /* First, we try to unify the PARM and ARG directly. */
18204 t
= try_class_unification (tparms
, targs
,
18205 parm
, arg
, explain_p
);
18209 /* Fallback to the special case allowed in
18210 [temp.deduct.call]:
18212 If P is a class, and P has the form
18213 template-id, then A can be a derived class of
18214 the deduced A. Likewise, if P is a pointer to
18215 a class of the form template-id, A can be a
18216 pointer to a derived class pointed to by the
18218 enum template_base_result r
;
18219 r
= get_template_base (tparms
, targs
, parm
, arg
,
18223 return unify_no_common_base (explain_p
, r
, parm
, arg
);
18226 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
18227 && (CLASSTYPE_TI_TEMPLATE (parm
)
18228 == CLASSTYPE_TI_TEMPLATE (arg
)))
18229 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18230 Then, we should unify `int' and `U'. */
18233 /* There's no chance of unification succeeding. */
18234 return unify_type_mismatch (explain_p
, parm
, arg
);
18236 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
18237 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
18239 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
18240 return unify_type_mismatch (explain_p
, parm
, arg
);
18241 return unify_success (explain_p
);
18244 case FUNCTION_TYPE
:
18246 unsigned int nargs
;
18251 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18252 return unify_type_mismatch (explain_p
, parm
, arg
);
18254 /* CV qualifications for methods can never be deduced, they must
18255 match exactly. We need to check them explicitly here,
18256 because type_unification_real treats them as any other
18257 cv-qualified parameter. */
18258 if (TREE_CODE (parm
) == METHOD_TYPE
18259 && (!check_cv_quals_for_unify
18261 class_of_this_parm (arg
),
18262 class_of_this_parm (parm
))))
18263 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18265 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18266 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18268 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18269 args
= XALLOCAVEC (tree
, nargs
);
18270 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18271 a
!= NULL_TREE
&& a
!= void_list_node
;
18272 a
= TREE_CHAIN (a
), ++i
)
18273 args
[i
] = TREE_VALUE (a
);
18276 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18277 args
, nargs
, 1, DEDUCE_EXACT
,
18278 LOOKUP_NORMAL
, NULL
, explain_p
);
18282 /* Unify a pointer to member with a pointer to member function, which
18283 deduces the type of the member as a function type. */
18284 if (TYPE_PTRMEMFUNC_P (arg
))
18286 /* Check top-level cv qualifiers */
18287 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18288 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18290 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18291 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18292 UNIFY_ALLOW_NONE
, explain_p
);
18294 /* Determine the type of the function we are unifying against. */
18295 tree fntype
= static_fn_type (arg
);
18297 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18300 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18301 return unify_type_mismatch (explain_p
, parm
, arg
);
18302 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18303 TYPE_OFFSET_BASETYPE (arg
),
18304 UNIFY_ALLOW_NONE
, explain_p
);
18305 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18306 strict
, explain_p
);
18309 if (DECL_TEMPLATE_PARM_P (parm
))
18310 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18311 if (arg
!= integral_constant_value (parm
))
18312 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18313 return unify_success (explain_p
);
18316 case TEMPLATE_DECL
:
18317 /* Matched cases are handled by the ARG == PARM test above. */
18318 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18321 /* A non-type template parameter that is a variable should be a
18322 an integral constant, in which case, it whould have been
18323 folded into its (constant) value. So we should not be getting
18324 a variable here. */
18325 gcc_unreachable ();
18327 case TYPE_ARGUMENT_PACK
:
18328 case NONTYPE_ARGUMENT_PACK
:
18329 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18330 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18333 case DECLTYPE_TYPE
:
18334 case UNDERLYING_TYPE
:
18335 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18336 or UNDERLYING_TYPE nodes. */
18337 return unify_success (explain_p
);
18340 /* Unification fails if we hit an error node. */
18341 return unify_invalid (explain_p
);
18344 if (REFERENCE_REF_P (parm
))
18345 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18346 strict
, explain_p
);
18350 /* An unresolved overload is a nondeduced context. */
18351 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18352 return unify_success (explain_p
);
18353 gcc_assert (EXPR_P (parm
));
18355 /* We must be looking at an expression. This can happen with
18359 void foo(S<I>, S<I + 2>);
18361 This is a "nondeduced context":
18365 The nondeduced contexts are:
18367 --A type that is a template-id in which one or more of
18368 the template-arguments is an expression that references
18369 a template-parameter.
18371 In these cases, we assume deduction succeeded, but don't
18372 actually infer any unifications. */
18374 if (!uses_template_parms (parm
)
18375 && !template_args_equal (parm
, arg
))
18376 return unify_expression_unequal (explain_p
, parm
, arg
);
18378 return unify_success (explain_p
);
18381 #undef RECUR_AND_CHECK_FAILURE
18383 /* Note that DECL can be defined in this translation unit, if
18387 mark_definable (tree decl
)
18390 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18391 FOR_EACH_CLONE (clone
, decl
)
18392 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18395 /* Called if RESULT is explicitly instantiated, or is a member of an
18396 explicitly instantiated class. */
18399 mark_decl_instantiated (tree result
, int extern_p
)
18401 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18403 /* If this entity has already been written out, it's too late to
18404 make any modifications. */
18405 if (TREE_ASM_WRITTEN (result
))
18408 /* For anonymous namespace we don't need to do anything. */
18409 if (decl_anon_ns_mem_p (result
))
18411 gcc_assert (!TREE_PUBLIC (result
));
18415 if (TREE_CODE (result
) != FUNCTION_DECL
)
18416 /* The TREE_PUBLIC flag for function declarations will have been
18417 set correctly by tsubst. */
18418 TREE_PUBLIC (result
) = 1;
18420 /* This might have been set by an earlier implicit instantiation. */
18421 DECL_COMDAT (result
) = 0;
18424 DECL_NOT_REALLY_EXTERN (result
) = 0;
18427 mark_definable (result
);
18428 mark_needed (result
);
18429 /* Always make artificials weak. */
18430 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18431 comdat_linkage (result
);
18432 /* For WIN32 we also want to put explicit instantiations in
18433 linkonce sections. */
18434 else if (TREE_PUBLIC (result
))
18435 maybe_make_one_only (result
);
18438 /* If EXTERN_P, then this function will not be emitted -- unless
18439 followed by an explicit instantiation, at which point its linkage
18440 will be adjusted. If !EXTERN_P, then this function will be
18441 emitted here. In neither circumstance do we want
18442 import_export_decl to adjust the linkage. */
18443 DECL_INTERFACE_KNOWN (result
) = 1;
18446 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18447 important template arguments. If any are missing, we check whether
18448 they're important by using error_mark_node for substituting into any
18449 args that were used for partial ordering (the ones between ARGS and END)
18450 and seeing if it bubbles up. */
18453 check_undeduced_parms (tree targs
, tree args
, tree end
)
18455 bool found
= false;
18457 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18458 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18461 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18465 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18466 if (substed
== error_mark_node
)
18472 /* Given two function templates PAT1 and PAT2, return:
18474 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18475 -1 if PAT2 is more specialized than PAT1.
18476 0 if neither is more specialized.
18478 LEN indicates the number of parameters we should consider
18479 (defaulted parameters should not be considered).
18481 The 1998 std underspecified function template partial ordering, and
18482 DR214 addresses the issue. We take pairs of arguments, one from
18483 each of the templates, and deduce them against each other. One of
18484 the templates will be more specialized if all the *other*
18485 template's arguments deduce against its arguments and at least one
18486 of its arguments *does* *not* deduce against the other template's
18487 corresponding argument. Deduction is done as for class templates.
18488 The arguments used in deduction have reference and top level cv
18489 qualifiers removed. Iff both arguments were originally reference
18490 types *and* deduction succeeds in both directions, an lvalue reference
18491 wins against an rvalue reference and otherwise the template
18492 with the more cv-qualified argument wins for that pairing (if
18493 neither is more cv-qualified, they both are equal). Unlike regular
18494 deduction, after all the arguments have been deduced in this way,
18495 we do *not* verify the deduced template argument values can be
18496 substituted into non-deduced contexts.
18498 The logic can be a bit confusing here, because we look at deduce1 and
18499 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18500 can find template arguments for pat1 to make arg1 look like arg2, that
18501 means that arg2 is at least as specialized as arg1. */
18504 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18506 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18507 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18508 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18509 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18510 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18511 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18512 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18513 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18514 tree origs1
, origs2
;
18515 bool lose1
= false;
18516 bool lose2
= false;
18518 /* Remove the this parameter from non-static member functions. If
18519 one is a non-static member function and the other is not a static
18520 member function, remove the first parameter from that function
18521 also. This situation occurs for operator functions where we
18522 locate both a member function (with this pointer) and non-member
18523 operator (with explicit first operand). */
18524 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18526 len
--; /* LEN is the number of significant arguments for DECL1 */
18527 args1
= TREE_CHAIN (args1
);
18528 if (!DECL_STATIC_FUNCTION_P (decl2
))
18529 args2
= TREE_CHAIN (args2
);
18531 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18533 args2
= TREE_CHAIN (args2
);
18534 if (!DECL_STATIC_FUNCTION_P (decl1
))
18537 args1
= TREE_CHAIN (args1
);
18541 /* If only one is a conversion operator, they are unordered. */
18542 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18545 /* Consider the return type for a conversion function */
18546 if (DECL_CONV_FN_P (decl1
))
18548 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18549 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18553 processing_template_decl
++;
18559 /* Stop when an ellipsis is seen. */
18560 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18562 tree arg1
= TREE_VALUE (args1
);
18563 tree arg2
= TREE_VALUE (args2
);
18564 int deduce1
, deduce2
;
18570 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18571 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18573 /* When both arguments are pack expansions, we need only
18574 unify the patterns themselves. */
18575 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18576 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18578 /* This is the last comparison we need to do. */
18582 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18584 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18585 arg1
= TREE_TYPE (arg1
);
18586 quals1
= cp_type_quals (arg1
);
18589 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18591 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18592 arg2
= TREE_TYPE (arg2
);
18593 quals2
= cp_type_quals (arg2
);
18596 arg1
= TYPE_MAIN_VARIANT (arg1
);
18597 arg2
= TYPE_MAIN_VARIANT (arg2
);
18599 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
18601 int i
, len2
= list_length (args2
);
18602 tree parmvec
= make_tree_vec (1);
18603 tree argvec
= make_tree_vec (len2
);
18606 /* Setup the parameter vector, which contains only ARG1. */
18607 TREE_VEC_ELT (parmvec
, 0) = arg1
;
18609 /* Setup the argument vector, which contains the remaining
18611 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
18612 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18614 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
18615 argvec
, DEDUCE_EXACT
,
18616 /*subr=*/true, /*explain_p=*/false)
18619 /* We cannot deduce in the other direction, because ARG1 is
18620 a pack expansion but ARG2 is not. */
18623 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18625 int i
, len1
= list_length (args1
);
18626 tree parmvec
= make_tree_vec (1);
18627 tree argvec
= make_tree_vec (len1
);
18630 /* Setup the parameter vector, which contains only ARG1. */
18631 TREE_VEC_ELT (parmvec
, 0) = arg2
;
18633 /* Setup the argument vector, which contains the remaining
18635 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
18636 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18638 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
18639 argvec
, DEDUCE_EXACT
,
18640 /*subr=*/true, /*explain_p=*/false)
18643 /* We cannot deduce in the other direction, because ARG2 is
18644 a pack expansion but ARG1 is not.*/
18650 /* The normal case, where neither argument is a pack
18652 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
18653 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18655 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
18656 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18660 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18661 arg2, then arg2 is not as specialized as arg1. */
18667 /* "If, for a given type, deduction succeeds in both directions
18668 (i.e., the types are identical after the transformations above)
18669 and both P and A were reference types (before being replaced with
18670 the type referred to above):
18671 - if the type from the argument template was an lvalue reference and
18672 the type from the parameter template was not, the argument type is
18673 considered to be more specialized than the other; otherwise,
18674 - if the type from the argument template is more cv-qualified
18675 than the type from the parameter template (as described above),
18676 the argument type is considered to be more specialized than the other;
18678 - neither type is more specialized than the other." */
18680 if (deduce1
&& deduce2
)
18682 if (ref1
&& ref2
&& ref1
!= ref2
)
18689 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
18691 if ((quals1
& quals2
) == quals2
)
18693 if ((quals1
& quals2
) == quals1
)
18698 if (lose1
&& lose2
)
18699 /* We've failed to deduce something in either direction.
18700 These must be unordered. */
18703 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18704 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18705 /* We have already processed all of the arguments in our
18706 handing of the pack expansion type. */
18709 args1
= TREE_CHAIN (args1
);
18710 args2
= TREE_CHAIN (args2
);
18713 /* "In most cases, all template parameters must have values in order for
18714 deduction to succeed, but for partial ordering purposes a template
18715 parameter may remain without a value provided it is not used in the
18716 types being used for partial ordering."
18718 Thus, if we are missing any of the targs1 we need to substitute into
18719 origs1, then pat2 is not as specialized as pat1. This can happen when
18720 there is a nondeduced context. */
18721 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
18723 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
18726 processing_template_decl
--;
18728 /* All things being equal, if the next argument is a pack expansion
18729 for one function but not for the other, prefer the
18730 non-variadic function. FIXME this is bogus; see c++/41958. */
18732 && args1
&& TREE_VALUE (args1
)
18733 && args2
&& TREE_VALUE (args2
))
18735 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
18736 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
18739 if (lose1
== lose2
)
18747 /* Determine which of two partial specializations of TMPL is more
18750 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
18751 to the first partial specialization. The TREE_VALUE is the
18752 innermost set of template parameters for the partial
18753 specialization. PAT2 is similar, but for the second template.
18755 Return 1 if the first partial specialization is more specialized;
18756 -1 if the second is more specialized; 0 if neither is more
18759 See [temp.class.order] for information about determining which of
18760 two templates is more specialized. */
18763 more_specialized_class (tree tmpl
, tree pat1
, tree pat2
)
18768 bool any_deductions
= false;
18770 tmpl1
= TREE_TYPE (pat1
);
18771 tmpl2
= TREE_TYPE (pat2
);
18773 /* Just like what happens for functions, if we are ordering between
18774 different class template specializations, we may encounter dependent
18775 types in the arguments, and we need our dependency check functions
18776 to behave correctly. */
18777 ++processing_template_decl
;
18778 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat1
),
18779 CLASSTYPE_TI_ARGS (tmpl1
),
18780 CLASSTYPE_TI_ARGS (tmpl2
));
18784 any_deductions
= true;
18787 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat2
),
18788 CLASSTYPE_TI_ARGS (tmpl2
),
18789 CLASSTYPE_TI_ARGS (tmpl1
));
18793 any_deductions
= true;
18795 --processing_template_decl
;
18797 /* In the case of a tie where at least one of the class templates
18798 has a parameter pack at the end, the template with the most
18799 non-packed parameters wins. */
18802 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
18803 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
18805 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
18806 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
18807 int len1
= TREE_VEC_LENGTH (args1
);
18808 int len2
= TREE_VEC_LENGTH (args2
);
18810 /* We don't count the pack expansion at the end. */
18811 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
18813 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
18818 else if (len1
< len2
)
18825 /* Return the template arguments that will produce the function signature
18826 DECL from the function template FN, with the explicit template
18827 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
18828 also match. Return NULL_TREE if no satisfactory arguments could be
18832 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
18834 int ntparms
= DECL_NTPARMS (fn
);
18835 tree targs
= make_tree_vec (ntparms
);
18836 tree decl_type
= TREE_TYPE (decl
);
18837 tree decl_arg_types
;
18839 unsigned int nargs
, ix
;
18842 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
18844 /* Never do unification on the 'this' parameter. */
18845 decl_arg_types
= skip_artificial_parms_for (decl
,
18846 TYPE_ARG_TYPES (decl_type
));
18848 nargs
= list_length (decl_arg_types
);
18849 args
= XALLOCAVEC (tree
, nargs
);
18850 for (arg
= decl_arg_types
, ix
= 0;
18851 arg
!= NULL_TREE
&& arg
!= void_list_node
;
18852 arg
= TREE_CHAIN (arg
), ++ix
)
18853 args
[ix
] = TREE_VALUE (arg
);
18855 if (fn_type_unification (fn
, explicit_args
, targs
,
18857 (check_rettype
|| DECL_CONV_FN_P (fn
)
18858 ? TREE_TYPE (decl_type
) : NULL_TREE
),
18859 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
18861 == error_mark_node
)
18867 /* Return the innermost template arguments that, when applied to a partial
18868 specialization of TMPL whose innermost template parameters are
18869 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
18872 For example, suppose we have:
18874 template <class T, class U> struct S {};
18875 template <class T> struct S<T*, int> {};
18877 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
18878 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
18879 int}. The resulting vector will be {double}, indicating that `T'
18880 is bound to `double'. */
18883 get_class_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
18885 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
18887 tree innermost_deduced_args
;
18889 innermost_deduced_args
= make_tree_vec (ntparms
);
18890 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18892 deduced_args
= copy_node (args
);
18893 SET_TMPL_ARGS_LEVEL (deduced_args
,
18894 TMPL_ARGS_DEPTH (deduced_args
),
18895 innermost_deduced_args
);
18898 deduced_args
= innermost_deduced_args
;
18900 if (unify (tparms
, deduced_args
,
18901 INNERMOST_TEMPLATE_ARGS (spec_args
),
18902 INNERMOST_TEMPLATE_ARGS (args
),
18903 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
18906 for (i
= 0; i
< ntparms
; ++i
)
18907 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
18910 /* Verify that nondeduced template arguments agree with the type
18911 obtained from argument deduction.
18915 struct A { typedef int X; };
18916 template <class T, class U> struct C {};
18917 template <class T> struct C<T, typename T::X> {};
18919 Then with the instantiation `C<A, int>', we can deduce that
18920 `T' is `A' but unify () does not check whether `typename T::X'
18922 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
18923 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18925 tf_none
, false, false);
18926 if (spec_args
== error_mark_node
18927 /* We only need to check the innermost arguments; the other
18928 arguments will always agree. */
18929 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
18930 INNERMOST_TEMPLATE_ARGS (args
)))
18933 /* Now that we have bindings for all of the template arguments,
18934 ensure that the arguments deduced for the template template
18935 parameters have compatible template parameter lists. See the use
18936 of template_template_parm_bindings_ok_p in fn_type_unification
18937 for more information. */
18938 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
18941 return deduced_args
;
18944 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
18945 Return the TREE_LIST node with the most specialized template, if
18946 any. If there is no most specialized template, the error_mark_node
18949 Note that this function does not look at, or modify, the
18950 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
18951 returned is one of the elements of INSTANTIATIONS, callers may
18952 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
18953 and retrieve it from the value returned. */
18956 most_specialized_instantiation (tree templates
)
18960 ++processing_template_decl
;
18963 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
18967 if (get_bindings (TREE_VALUE (champ
),
18968 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18969 NULL_TREE
, /*check_ret=*/true))
18972 if (get_bindings (TREE_VALUE (fn
),
18973 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18974 NULL_TREE
, /*check_ret=*/true))
18981 /* Equally specialized, move to next function. If there
18982 is no next function, nothing's most specialized. */
18983 fn
= TREE_CHAIN (fn
);
18991 /* Now verify that champ is better than everything earlier in the
18992 instantiation list. */
18993 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
18994 if (get_bindings (TREE_VALUE (champ
),
18995 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18996 NULL_TREE
, /*check_ret=*/true)
18997 || !get_bindings (TREE_VALUE (fn
),
18998 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18999 NULL_TREE
, /*check_ret=*/true))
19005 processing_template_decl
--;
19008 return error_mark_node
;
19013 /* If DECL is a specialization of some template, return the most
19014 general such template. Otherwise, returns NULL_TREE.
19016 For example, given:
19018 template <class T> struct S { template <class U> void f(U); };
19020 if TMPL is `template <class U> void S<int>::f(U)' this will return
19021 the full template. This function will not trace past partial
19022 specializations, however. For example, given in addition:
19024 template <class T> struct S<T*> { template <class U> void f(U); };
19026 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19027 `template <class T> template <class U> S<T*>::f(U)'. */
19030 most_general_template (tree decl
)
19032 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19034 if (tree tinfo
= get_template_info (decl
))
19035 decl
= TI_TEMPLATE (tinfo
);
19036 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19037 template friend, or a FIELD_DECL for a capture pack. */
19038 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19042 /* Look for more and more general templates. */
19043 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
19045 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
19046 (See cp-tree.h for details.) */
19047 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
19050 if (CLASS_TYPE_P (TREE_TYPE (decl
))
19051 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
19054 /* Stop if we run into an explicitly specialized class template. */
19055 if (!DECL_NAMESPACE_SCOPE_P (decl
)
19056 && DECL_CONTEXT (decl
)
19057 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
19060 decl
= DECL_TI_TEMPLATE (decl
);
19066 /* Return the most specialized of the class template partial
19067 specializations which can produce TYPE, a specialization of some class
19068 template. The value returned is actually a TREE_LIST; the TREE_TYPE is
19069 a _TYPE node corresponding to the partial specialization, while the
19070 TREE_PURPOSE is the set of template arguments that must be
19071 substituted into the TREE_TYPE in order to generate TYPE.
19073 If the choice of partial specialization is ambiguous, a diagnostic
19074 is issued, and the error_mark_node is returned. If there are no
19075 partial specializations matching TYPE, then NULL_TREE is
19076 returned, indicating that the primary template should be used. */
19079 most_specialized_class (tree type
, tsubst_flags_t complain
)
19081 tree list
= NULL_TREE
;
19086 tree outer_args
= NULL_TREE
;
19088 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
19089 tree main_tmpl
= most_general_template (tmpl
);
19090 tree args
= CLASSTYPE_TI_ARGS (type
);
19092 /* For determining which partial specialization to use, only the
19093 innermost args are interesting. */
19094 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19096 outer_args
= strip_innermost_template_args (args
, 1);
19097 args
= INNERMOST_TEMPLATE_ARGS (args
);
19100 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
19102 tree partial_spec_args
;
19104 tree spec_tmpl
= TREE_VALUE (t
);
19105 tree orig_parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19107 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
19109 ++processing_template_decl
;
19113 /* Discard the outer levels of args, and then substitute in the
19114 template args from the enclosing class. */
19115 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
19116 partial_spec_args
= tsubst_template_args
19117 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
19119 /* And the same for the partial specialization TEMPLATE_DECL. */
19120 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
19123 partial_spec_args
=
19124 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19127 /*require_all_args=*/true,
19128 /*use_default_args=*/true);
19130 --processing_template_decl
;
19132 if (partial_spec_args
== error_mark_node
)
19133 return error_mark_node
;
19134 if (spec_tmpl
== error_mark_node
)
19135 return error_mark_node
;
19137 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19138 spec_args
= get_class_bindings (tmpl
, parms
,
19144 spec_args
= add_to_template_args (outer_args
, spec_args
);
19145 list
= tree_cons (spec_args
, orig_parms
, list
);
19146 TREE_TYPE (list
) = TREE_TYPE (t
);
19153 ambiguous_p
= false;
19156 t
= TREE_CHAIN (t
);
19157 for (; t
; t
= TREE_CHAIN (t
))
19159 fate
= more_specialized_class (tmpl
, champ
, t
);
19166 t
= TREE_CHAIN (t
);
19169 ambiguous_p
= true;
19178 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
19180 fate
= more_specialized_class (tmpl
, champ
, t
);
19183 ambiguous_p
= true;
19191 char *spaces
= NULL
;
19192 if (!(complain
& tf_error
))
19193 return error_mark_node
;
19194 error ("ambiguous class template instantiation for %q#T", type
);
19195 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
19196 for (t
= list
; t
; t
= TREE_CHAIN (t
))
19198 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
19199 spaces
= spaces
? spaces
: get_spaces (str
);
19202 return error_mark_node
;
19208 /* Explicitly instantiate DECL. */
19211 do_decl_instantiation (tree decl
, tree storage
)
19213 tree result
= NULL_TREE
;
19216 if (!decl
|| decl
== error_mark_node
)
19217 /* An error occurred, for which grokdeclarator has already issued
19218 an appropriate message. */
19220 else if (! DECL_LANG_SPECIFIC (decl
))
19222 error ("explicit instantiation of non-template %q#D", decl
);
19226 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
19227 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
19229 if (VAR_P (decl
) && !var_templ
)
19231 /* There is an asymmetry here in the way VAR_DECLs and
19232 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19233 the latter, the DECL we get back will be marked as a
19234 template instantiation, and the appropriate
19235 DECL_TEMPLATE_INFO will be set up. This does not happen for
19236 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19237 should handle VAR_DECLs as it currently handles
19239 if (!DECL_CLASS_SCOPE_P (decl
))
19241 error ("%qD is not a static data member of a class template", decl
);
19244 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
19245 if (!result
|| !VAR_P (result
))
19247 error ("no matching template for %qD found", decl
);
19250 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
19252 error ("type %qT for explicit instantiation %qD does not match "
19253 "declared type %qT", TREE_TYPE (result
), decl
,
19258 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
19260 error ("explicit instantiation of %q#D", decl
);
19266 /* Check for various error cases. Note that if the explicit
19267 instantiation is valid the RESULT will currently be marked as an
19268 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19269 until we get here. */
19271 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19273 /* DR 259 [temp.spec].
19275 Both an explicit instantiation and a declaration of an explicit
19276 specialization shall not appear in a program unless the explicit
19277 instantiation follows a declaration of the explicit specialization.
19279 For a given set of template parameters, if an explicit
19280 instantiation of a template appears after a declaration of an
19281 explicit specialization for that template, the explicit
19282 instantiation has no effect. */
19285 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19289 No program shall explicitly instantiate any template more
19292 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19293 the first instantiation was `extern' and the second is not,
19294 and EXTERN_P for the opposite case. */
19295 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19296 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19297 /* If an "extern" explicit instantiation follows an ordinary
19298 explicit instantiation, the template is instantiated. */
19302 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19304 error ("no matching template for %qD found", result
);
19307 else if (!DECL_TEMPLATE_INFO (result
))
19309 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19313 if (storage
== NULL_TREE
)
19315 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19317 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19318 pedwarn (input_location
, OPT_Wpedantic
,
19319 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19324 error ("storage class %qD applied to template instantiation", storage
);
19326 check_explicit_instantiation_namespace (result
);
19327 mark_decl_instantiated (result
, extern_p
);
19329 instantiate_decl (result
, /*defer_ok=*/1,
19330 /*expl_inst_class_mem_p=*/false);
19334 mark_class_instantiated (tree t
, int extern_p
)
19336 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19337 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19338 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19339 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19342 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19343 rest_of_type_compilation (t
, 1);
19347 /* Called from do_type_instantiation through binding_table_foreach to
19348 do recursive instantiation for the type bound in ENTRY. */
19350 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19352 tree storage
= *(tree
*) data
;
19354 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19355 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19356 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19359 /* Called from do_type_instantiation to instantiate a member
19360 (a member function or a static member variable) of an
19361 explicitly instantiated class template. */
19363 instantiate_class_member (tree decl
, int extern_p
)
19365 mark_decl_instantiated (decl
, extern_p
);
19367 instantiate_decl (decl
, /*defer_ok=*/1,
19368 /*expl_inst_class_mem_p=*/true);
19371 /* Perform an explicit instantiation of template class T. STORAGE, if
19372 non-null, is the RID for extern, inline or static. COMPLAIN is
19373 nonzero if this is called from the parser, zero if called recursively,
19374 since the standard is unclear (as detailed below). */
19377 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19382 int previous_instantiation_extern_p
= 0;
19384 if (TREE_CODE (t
) == TYPE_DECL
)
19387 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19390 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19392 error ("explicit instantiation of non-class template %qD", tmpl
);
19394 error ("explicit instantiation of non-template type %qT", t
);
19400 if (!COMPLETE_TYPE_P (t
))
19402 if (complain
& tf_error
)
19403 error ("explicit instantiation of %q#T before definition of template",
19408 if (storage
!= NULL_TREE
)
19410 if (!in_system_header_at (input_location
))
19412 if (storage
== ridpointers
[(int) RID_EXTERN
])
19414 if (cxx_dialect
== cxx98
)
19415 pedwarn (input_location
, OPT_Wpedantic
,
19416 "ISO C++ 1998 forbids the use of %<extern%> on "
19417 "explicit instantiations");
19420 pedwarn (input_location
, OPT_Wpedantic
,
19421 "ISO C++ forbids the use of %qE"
19422 " on explicit instantiations", storage
);
19425 if (storage
== ridpointers
[(int) RID_INLINE
])
19427 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19429 else if (storage
== ridpointers
[(int) RID_STATIC
])
19433 error ("storage class %qD applied to template instantiation",
19439 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19441 /* DR 259 [temp.spec].
19443 Both an explicit instantiation and a declaration of an explicit
19444 specialization shall not appear in a program unless the explicit
19445 instantiation follows a declaration of the explicit specialization.
19447 For a given set of template parameters, if an explicit
19448 instantiation of a template appears after a declaration of an
19449 explicit specialization for that template, the explicit
19450 instantiation has no effect. */
19453 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19457 No program shall explicitly instantiate any template more
19460 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19461 instantiation was `extern'. If EXTERN_P then the second is.
19462 These cases are OK. */
19463 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19465 if (!previous_instantiation_extern_p
&& !extern_p
19466 && (complain
& tf_error
))
19467 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19469 /* If we've already instantiated the template, just return now. */
19470 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19474 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19475 mark_class_instantiated (t
, extern_p
);
19483 /* In contrast to implicit instantiation, where only the
19484 declarations, and not the definitions, of members are
19485 instantiated, we have here:
19489 The explicit instantiation of a class template specialization
19490 implies the instantiation of all of its members not
19491 previously explicitly specialized in the translation unit
19492 containing the explicit instantiation.
19494 Of course, we can't instantiate member template classes, since
19495 we don't have any arguments for them. Note that the standard
19496 is unclear on whether the instantiation of the members are
19497 *explicit* instantiations or not. However, the most natural
19498 interpretation is that it should be an explicit instantiation. */
19501 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19502 if (TREE_CODE (tmp
) == FUNCTION_DECL
19503 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19504 instantiate_class_member (tmp
, extern_p
);
19506 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19507 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19508 instantiate_class_member (tmp
, extern_p
);
19510 if (CLASSTYPE_NESTED_UTDS (t
))
19511 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19512 bt_instantiate_type_proc
, &storage
);
19516 /* Given a function DECL, which is a specialization of TMPL, modify
19517 DECL to be a re-instantiation of TMPL with the same template
19518 arguments. TMPL should be the template into which tsubst'ing
19519 should occur for DECL, not the most general template.
19521 One reason for doing this is a scenario like this:
19524 void f(const T&, int i);
19526 void g() { f(3, 7); }
19529 void f(const T& t, const int i) { }
19531 Note that when the template is first instantiated, with
19532 instantiate_template, the resulting DECL will have no name for the
19533 first parameter, and the wrong type for the second. So, when we go
19534 to instantiate the DECL, we regenerate it. */
19537 regenerate_decl_from_template (tree decl
, tree tmpl
)
19539 /* The arguments used to instantiate DECL, from the most general
19544 args
= DECL_TI_ARGS (decl
);
19545 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19547 /* Make sure that we can see identifiers, and compute access
19549 push_access_scope (decl
);
19551 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19559 args_depth
= TMPL_ARGS_DEPTH (args
);
19560 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19561 if (args_depth
> parms_depth
)
19562 args
= get_innermost_template_args (args
, parms_depth
);
19564 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19565 args
, tf_error
, NULL_TREE
,
19566 /*defer_ok*/false);
19567 if (specs
&& specs
!= error_mark_node
)
19568 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19571 /* Merge parameter declarations. */
19572 decl_parm
= skip_artificial_parms_for (decl
,
19573 DECL_ARGUMENTS (decl
));
19575 = skip_artificial_parms_for (code_pattern
,
19576 DECL_ARGUMENTS (code_pattern
));
19577 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
19582 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19583 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
19584 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
19586 parm_type
= type_decays_to (parm_type
);
19587 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19588 TREE_TYPE (decl_parm
) = parm_type
;
19589 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19590 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19592 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19593 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19595 decl_parm
= DECL_CHAIN (decl_parm
);
19596 pattern_parm
= DECL_CHAIN (pattern_parm
);
19598 /* Merge any parameters that match with the function parameter
19600 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
19603 tree expanded_types
;
19604 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19605 the parameters in this function parameter pack. */
19606 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
19607 args
, tf_error
, NULL_TREE
);
19608 len
= TREE_VEC_LENGTH (expanded_types
);
19609 for (i
= 0; i
< len
; i
++)
19614 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19615 /* Rename the parameter to include the index. */
19616 DECL_NAME (decl_parm
) =
19617 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
19618 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
19619 parm_type
= type_decays_to (parm_type
);
19620 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19621 TREE_TYPE (decl_parm
) = parm_type
;
19622 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19623 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19625 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19626 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19628 decl_parm
= DECL_CHAIN (decl_parm
);
19631 /* Merge additional specifiers from the CODE_PATTERN. */
19632 if (DECL_DECLARED_INLINE_P (code_pattern
)
19633 && !DECL_DECLARED_INLINE_P (decl
))
19634 DECL_DECLARED_INLINE_P (decl
) = 1;
19636 else if (VAR_P (decl
))
19638 DECL_INITIAL (decl
) =
19639 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
19640 tf_error
, DECL_TI_TEMPLATE (decl
),
19641 /*integral_constant_expression_p=*/false);
19642 if (VAR_HAD_UNKNOWN_BOUND (decl
))
19643 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
19644 tf_error
, DECL_TI_TEMPLATE (decl
));
19647 gcc_unreachable ();
19649 pop_access_scope (decl
);
19652 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19653 substituted to get DECL. */
19656 template_for_substitution (tree decl
)
19658 tree tmpl
= DECL_TI_TEMPLATE (decl
);
19660 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19661 for the instantiation. This is not always the most general
19662 template. Consider, for example:
19665 struct S { template <class U> void f();
19666 template <> void f<int>(); };
19668 and an instantiation of S<double>::f<int>. We want TD to be the
19669 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19670 while (/* An instantiation cannot have a definition, so we need a
19671 more general template. */
19672 DECL_TEMPLATE_INSTANTIATION (tmpl
)
19673 /* We must also deal with friend templates. Given:
19675 template <class T> struct S {
19676 template <class U> friend void f() {};
19679 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19680 so far as the language is concerned, but that's still
19681 where we get the pattern for the instantiation from. On
19682 other hand, if the definition comes outside the class, say:
19684 template <class T> struct S {
19685 template <class U> friend void f();
19687 template <class U> friend void f() {}
19689 we don't need to look any further. That's what the check for
19690 DECL_INITIAL is for. */
19691 || (TREE_CODE (decl
) == FUNCTION_DECL
19692 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
19693 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
19695 /* The present template, TD, should not be a definition. If it
19696 were a definition, we should be using it! Note that we
19697 cannot restructure the loop to just keep going until we find
19698 a template with a definition, since that might go too far if
19699 a specialization was declared, but not defined. */
19700 gcc_assert (!VAR_P (decl
)
19701 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
19703 /* Fetch the more general template. */
19704 tmpl
= DECL_TI_TEMPLATE (tmpl
);
19710 /* Returns true if we need to instantiate this template instance even if we
19711 know we aren't going to emit it.. */
19714 always_instantiate_p (tree decl
)
19716 /* We always instantiate inline functions so that we can inline them. An
19717 explicit instantiation declaration prohibits implicit instantiation of
19718 non-inline functions. With high levels of optimization, we would
19719 normally inline non-inline functions -- but we're not allowed to do
19720 that for "extern template" functions. Therefore, we check
19721 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19722 return ((TREE_CODE (decl
) == FUNCTION_DECL
19723 && (DECL_DECLARED_INLINE_P (decl
)
19724 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
19725 /* And we need to instantiate static data members so that
19726 their initializers are available in integral constant
19729 && decl_maybe_constant_var_p (decl
)));
19732 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19733 instantiate it now, modifying TREE_TYPE (fn). */
19736 maybe_instantiate_noexcept (tree fn
)
19738 tree fntype
, spec
, noex
, clone
;
19740 /* Don't instantiate a noexcept-specification from template context. */
19741 if (processing_template_decl
)
19744 if (DECL_CLONED_FUNCTION_P (fn
))
19745 fn
= DECL_CLONED_FUNCTION (fn
);
19746 fntype
= TREE_TYPE (fn
);
19747 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
19749 if (!spec
|| !TREE_PURPOSE (spec
))
19752 noex
= TREE_PURPOSE (spec
);
19754 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
19756 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
19757 spec
= get_defaulted_eh_spec (fn
);
19758 else if (push_tinst_level (fn
))
19760 push_access_scope (fn
);
19761 push_deferring_access_checks (dk_no_deferred
);
19762 input_location
= DECL_SOURCE_LOCATION (fn
);
19763 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
19764 DEFERRED_NOEXCEPT_ARGS (noex
),
19765 tf_warning_or_error
, fn
,
19766 /*function_p=*/false,
19767 /*integral_constant_expression_p=*/true);
19768 pop_deferring_access_checks ();
19769 pop_access_scope (fn
);
19770 pop_tinst_level ();
19771 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
19772 if (spec
== error_mark_node
)
19773 spec
= noexcept_false_spec
;
19776 spec
= noexcept_false_spec
;
19778 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
19781 FOR_EACH_CLONE (clone
, fn
)
19783 if (TREE_TYPE (clone
) == fntype
)
19784 TREE_TYPE (clone
) = TREE_TYPE (fn
);
19786 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
19790 /* Produce the definition of D, a _DECL generated from a template. If
19791 DEFER_OK is nonzero, then we don't have to actually do the
19792 instantiation now; we just have to do it sometime. Normally it is
19793 an error if this is an explicit instantiation but D is undefined.
19794 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
19795 explicitly instantiated class template. */
19798 instantiate_decl (tree d
, int defer_ok
,
19799 bool expl_inst_class_mem_p
)
19801 tree tmpl
= DECL_TI_TEMPLATE (d
);
19808 bool pattern_defined
;
19809 location_t saved_loc
= input_location
;
19810 int saved_unevaluated_operand
= cp_unevaluated_operand
;
19811 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
19817 /* This function should only be used to instantiate templates for
19818 functions and static member variables. */
19819 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
19821 /* Variables are never deferred; if instantiation is required, they
19822 are instantiated right away. That allows for better code in the
19823 case that an expression refers to the value of the variable --
19824 if the variable has a constant value the referring expression can
19825 take advantage of that fact. */
19827 || DECL_DECLARED_CONSTEXPR_P (d
))
19830 /* Don't instantiate cloned functions. Instead, instantiate the
19831 functions they cloned. */
19832 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
19833 d
= DECL_CLONED_FUNCTION (d
);
19835 if (DECL_TEMPLATE_INSTANTIATED (d
)
19836 || (TREE_CODE (d
) == FUNCTION_DECL
19837 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
19838 || DECL_TEMPLATE_SPECIALIZATION (d
))
19839 /* D has already been instantiated or explicitly specialized, so
19840 there's nothing for us to do here.
19842 It might seem reasonable to check whether or not D is an explicit
19843 instantiation, and, if so, stop here. But when an explicit
19844 instantiation is deferred until the end of the compilation,
19845 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
19846 the instantiation. */
19849 /* Check to see whether we know that this template will be
19850 instantiated in some other file, as with "extern template"
19852 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
19854 /* In general, we do not instantiate such templates. */
19855 if (external_p
&& !always_instantiate_p (d
))
19858 gen_tmpl
= most_general_template (tmpl
);
19859 gen_args
= DECL_TI_ARGS (d
);
19861 if (tmpl
!= gen_tmpl
)
19862 /* We should already have the extra args. */
19863 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
19864 == TMPL_ARGS_DEPTH (gen_args
));
19865 /* And what's in the hash table should match D. */
19866 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
19867 || spec
== NULL_TREE
);
19869 /* This needs to happen before any tsubsting. */
19870 if (! push_tinst_level (d
))
19873 timevar_push (TV_TEMPLATE_INST
);
19875 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
19876 for the instantiation. */
19877 td
= template_for_substitution (d
);
19878 code_pattern
= DECL_TEMPLATE_RESULT (td
);
19880 /* We should never be trying to instantiate a member of a class
19881 template or partial specialization. */
19882 gcc_assert (d
!= code_pattern
);
19884 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
19885 || DECL_TEMPLATE_SPECIALIZATION (td
))
19886 /* In the case of a friend template whose definition is provided
19887 outside the class, we may have too many arguments. Drop the
19888 ones we don't need. The same is true for specializations. */
19889 args
= get_innermost_template_args
19890 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
19894 if (TREE_CODE (d
) == FUNCTION_DECL
)
19896 deleted_p
= DECL_DELETED_FN (code_pattern
);
19897 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
19898 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
19904 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
19907 /* We may be in the middle of deferred access check. Disable it now. */
19908 push_deferring_access_checks (dk_no_deferred
);
19910 /* Unless an explicit instantiation directive has already determined
19911 the linkage of D, remember that a definition is available for
19913 if (pattern_defined
19914 && !DECL_INTERFACE_KNOWN (d
)
19915 && !DECL_NOT_REALLY_EXTERN (d
))
19916 mark_definable (d
);
19918 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
19919 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
19920 input_location
= DECL_SOURCE_LOCATION (d
);
19922 /* If D is a member of an explicitly instantiated class template,
19923 and no definition is available, treat it like an implicit
19925 if (!pattern_defined
&& expl_inst_class_mem_p
19926 && DECL_EXPLICIT_INSTANTIATION (d
))
19928 /* Leave linkage flags alone on instantiations with anonymous
19930 if (TREE_PUBLIC (d
))
19932 DECL_NOT_REALLY_EXTERN (d
) = 0;
19933 DECL_INTERFACE_KNOWN (d
) = 0;
19935 SET_DECL_IMPLICIT_INSTANTIATION (d
);
19938 /* Defer all other templates, unless we have been explicitly
19939 forbidden from doing so. */
19940 if (/* If there is no definition, we cannot instantiate the
19943 /* If it's OK to postpone instantiation, do so. */
19945 /* If this is a static data member that will be defined
19946 elsewhere, we don't want to instantiate the entire data
19947 member, but we do want to instantiate the initializer so that
19948 we can substitute that elsewhere. */
19949 || (external_p
&& VAR_P (d
))
19950 /* Handle here a deleted function too, avoid generating
19951 its body (c++/61080). */
19954 /* The definition of the static data member is now required so
19955 we must substitute the initializer. */
19957 && !DECL_INITIAL (d
)
19958 && DECL_INITIAL (code_pattern
))
19962 bool const_init
= false;
19963 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
19965 ns
= decl_namespace_context (d
);
19966 push_nested_namespace (ns
);
19968 push_nested_class (DECL_CONTEXT (d
));
19969 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
19971 tf_warning_or_error
, NULL_TREE
,
19972 /*integral_constant_expression_p=*/false);
19973 /* Make sure the initializer is still constant, in case of
19974 circular dependency (template/instantiate6.C). */
19976 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
19977 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
19978 /*asmspec_tree=*/NULL_TREE
,
19979 LOOKUP_ONLYCONVERTING
);
19981 pop_nested_class ();
19982 pop_nested_namespace (ns
);
19985 /* We restore the source position here because it's used by
19986 add_pending_template. */
19987 input_location
= saved_loc
;
19989 if (at_eof
&& !pattern_defined
19990 && DECL_EXPLICIT_INSTANTIATION (d
)
19991 && DECL_NOT_REALLY_EXTERN (d
))
19994 The definition of a non-exported function template, a
19995 non-exported member function template, or a non-exported
19996 member function or static data member of a class template
19997 shall be present in every translation unit in which it is
19998 explicitly instantiated. */
19999 permerror (input_location
, "explicit instantiation of %qD "
20000 "but no definition available", d
);
20002 /* If we're in unevaluated context, we just wanted to get the
20003 constant value; this isn't an odr use, so don't queue
20004 a full instantiation. */
20005 if (cp_unevaluated_operand
!= 0)
20007 /* ??? Historically, we have instantiated inline functions, even
20008 when marked as "extern template". */
20009 if (!(external_p
&& VAR_P (d
)))
20010 add_pending_template (d
);
20013 /* Tell the repository that D is available in this translation unit
20014 -- and see if it is supposed to be instantiated here. */
20015 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
20017 /* In a PCH file, despite the fact that the repository hasn't
20018 requested instantiation in the PCH it is still possible that
20019 an instantiation will be required in a file that includes the
20022 add_pending_template (d
);
20023 /* Instantiate inline functions so that the inliner can do its
20024 job, even though we'll not be emitting a copy of this
20026 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
20030 fn_context
= decl_function_context (d
);
20031 nested
= (current_function_decl
!= NULL_TREE
);
20033 push_to_top_level ();
20037 push_function_context ();
20038 cp_unevaluated_operand
= 0;
20039 c_inhibit_evaluation_warnings
= 0;
20042 /* Mark D as instantiated so that recursive calls to
20043 instantiate_decl do not try to instantiate it again. */
20044 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
20046 /* Regenerate the declaration in case the template has been modified
20047 by a subsequent redeclaration. */
20048 regenerate_decl_from_template (d
, td
);
20050 /* We already set the file and line above. Reset them now in case
20051 they changed as a result of calling regenerate_decl_from_template. */
20052 input_location
= DECL_SOURCE_LOCATION (d
);
20057 bool const_init
= false;
20059 /* Clear out DECL_RTL; whatever was there before may not be right
20060 since we've reset the type of the declaration. */
20061 SET_DECL_RTL (d
, NULL
);
20062 DECL_IN_AGGR_P (d
) = 0;
20064 /* The initializer is placed in DECL_INITIAL by
20065 regenerate_decl_from_template so we don't need to
20066 push/pop_access_scope again here. Pull it out so that
20067 cp_finish_decl can process it. */
20068 init
= DECL_INITIAL (d
);
20069 DECL_INITIAL (d
) = NULL_TREE
;
20070 DECL_INITIALIZED_P (d
) = 0;
20072 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
20073 initializer. That function will defer actual emission until
20074 we have a chance to determine linkage. */
20075 DECL_EXTERNAL (d
) = 0;
20077 /* Enter the scope of D so that access-checking works correctly. */
20078 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20080 push_nested_class (DECL_CONTEXT (d
));
20082 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20083 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
20086 pop_nested_class ();
20088 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
20089 synthesize_method (d
);
20090 else if (TREE_CODE (d
) == FUNCTION_DECL
)
20092 hash_map
<tree
, tree
> *saved_local_specializations
;
20096 tree block
= NULL_TREE
;
20098 /* Save away the current list, in case we are instantiating one
20099 template from within the body of another. */
20100 saved_local_specializations
= local_specializations
;
20102 /* Set up the list of local specializations. */
20103 local_specializations
= new hash_map
<tree
, tree
>;
20105 /* Set up context. */
20106 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20107 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20108 block
= push_stmt_list ();
20110 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
20112 /* Some typedefs referenced from within the template code need to be
20113 access checked at template instantiation time, i.e now. These
20114 types were added to the template at parsing time. Let's get those
20115 and perform the access checks then. */
20116 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
20119 /* Create substitution entries for the parameters. */
20120 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
20121 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
20122 spec_parm
= DECL_ARGUMENTS (d
);
20123 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
20125 register_local_specialization (spec_parm
, tmpl_parm
);
20126 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
20127 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
20129 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
20131 if (!DECL_PACK_P (tmpl_parm
))
20133 register_local_specialization (spec_parm
, tmpl_parm
);
20134 spec_parm
= DECL_CHAIN (spec_parm
);
20138 /* Register the (value) argument pack as a specialization of
20139 TMPL_PARM, then move on. */
20140 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
20141 register_local_specialization (argpack
, tmpl_parm
);
20144 gcc_assert (!spec_parm
);
20146 /* Substitute into the body of the function. */
20147 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20148 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
20149 tf_warning_or_error
, tmpl
);
20152 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
20153 tf_warning_or_error
, tmpl
,
20154 /*integral_constant_expression_p=*/false);
20156 /* Set the current input_location to the end of the function
20157 so that finish_function knows where we are. */
20159 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
20161 /* Remember if we saw an infinite loop in the template. */
20162 current_function_infinite_loop
20163 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
20166 /* We don't need the local specializations any more. */
20167 delete local_specializations
;
20168 local_specializations
= saved_local_specializations
;
20170 /* Finish the function. */
20171 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20172 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20173 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
20176 d
= finish_function (0);
20177 expand_or_defer_fn (d
);
20180 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20181 cp_check_omp_declare_reduction (d
);
20184 /* We're not deferring instantiation any more. */
20185 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
20188 pop_from_top_level ();
20190 pop_function_context ();
20193 input_location
= saved_loc
;
20194 cp_unevaluated_operand
= saved_unevaluated_operand
;
20195 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20196 pop_deferring_access_checks ();
20197 pop_tinst_level ();
20199 timevar_pop (TV_TEMPLATE_INST
);
20204 /* Run through the list of templates that we wish we could
20205 instantiate, and instantiate any we can. RETRIES is the
20206 number of times we retry pending template instantiation. */
20209 instantiate_pending_templates (int retries
)
20212 location_t saved_loc
= input_location
;
20214 /* Instantiating templates may trigger vtable generation. This in turn
20215 may require further template instantiations. We place a limit here
20216 to avoid infinite loop. */
20217 if (pending_templates
&& retries
>= max_tinst_depth
)
20219 tree decl
= pending_templates
->tinst
->decl
;
20221 error ("template instantiation depth exceeds maximum of %d"
20222 " instantiating %q+D, possibly from virtual table generation"
20223 " (use -ftemplate-depth= to increase the maximum)",
20224 max_tinst_depth
, decl
);
20225 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20226 /* Pretend that we defined it. */
20227 DECL_INITIAL (decl
) = error_mark_node
;
20233 struct pending_template
**t
= &pending_templates
;
20234 struct pending_template
*last
= NULL
;
20238 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
20239 bool complete
= false;
20241 if (TYPE_P (instantiation
))
20245 if (!COMPLETE_TYPE_P (instantiation
))
20247 instantiate_class_template (instantiation
);
20248 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
20249 for (fn
= TYPE_METHODS (instantiation
);
20251 fn
= TREE_CHAIN (fn
))
20252 if (! DECL_ARTIFICIAL (fn
))
20253 instantiate_decl (fn
,
20255 /*expl_inst_class_mem_p=*/false);
20256 if (COMPLETE_TYPE_P (instantiation
))
20260 complete
= COMPLETE_TYPE_P (instantiation
);
20264 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20265 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
20268 = instantiate_decl (instantiation
,
20270 /*expl_inst_class_mem_p=*/false);
20271 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20275 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20276 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20280 /* If INSTANTIATION has been instantiated, then we don't
20281 need to consider it again in the future. */
20289 current_tinst_level
= NULL
;
20291 last_pending_template
= last
;
20293 while (reconsider
);
20295 input_location
= saved_loc
;
20298 /* Substitute ARGVEC into T, which is a list of initializers for
20299 either base class or a non-static data member. The TREE_PURPOSEs
20300 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20301 instantiate_decl. */
20304 tsubst_initializer_list (tree t
, tree argvec
)
20306 tree inits
= NULL_TREE
;
20308 for (; t
; t
= TREE_CHAIN (t
))
20312 tree expanded_bases
= NULL_TREE
;
20313 tree expanded_arguments
= NULL_TREE
;
20316 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20321 /* Expand the base class expansion type into separate base
20323 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20324 tf_warning_or_error
,
20326 if (expanded_bases
== error_mark_node
)
20329 /* We'll be building separate TREE_LISTs of arguments for
20331 len
= TREE_VEC_LENGTH (expanded_bases
);
20332 expanded_arguments
= make_tree_vec (len
);
20333 for (i
= 0; i
< len
; i
++)
20334 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20336 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20337 expand each argument in the TREE_VALUE of t. */
20338 expr
= make_node (EXPR_PACK_EXPANSION
);
20339 PACK_EXPANSION_LOCAL_P (expr
) = true;
20340 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20341 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20343 if (TREE_VALUE (t
) == void_type_node
)
20344 /* VOID_TYPE_NODE is used to indicate
20345 value-initialization. */
20347 for (i
= 0; i
< len
; i
++)
20348 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20352 /* Substitute parameter packs into each argument in the
20354 in_base_initializer
= 1;
20355 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20357 tree expanded_exprs
;
20359 /* Expand the argument. */
20360 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20362 = tsubst_pack_expansion (expr
, argvec
,
20363 tf_warning_or_error
,
20365 if (expanded_exprs
== error_mark_node
)
20368 /* Prepend each of the expanded expressions to the
20369 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20370 for (i
= 0; i
< len
; i
++)
20372 TREE_VEC_ELT (expanded_arguments
, i
) =
20373 tree_cons (NULL_TREE
,
20374 TREE_VEC_ELT (expanded_exprs
, i
),
20375 TREE_VEC_ELT (expanded_arguments
, i
));
20378 in_base_initializer
= 0;
20380 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20381 since we built them backwards. */
20382 for (i
= 0; i
< len
; i
++)
20384 TREE_VEC_ELT (expanded_arguments
, i
) =
20385 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20390 for (i
= 0; i
< len
; ++i
)
20392 if (expanded_bases
)
20394 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20395 decl
= expand_member_init (decl
);
20396 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20401 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20402 tf_warning_or_error
, NULL_TREE
);
20404 decl
= expand_member_init (decl
);
20405 if (decl
&& !DECL_P (decl
))
20406 in_base_initializer
= 1;
20408 init
= TREE_VALUE (t
);
20410 if (init
!= void_type_node
)
20411 init
= tsubst_expr (init
, argvec
,
20412 tf_warning_or_error
, NULL_TREE
,
20413 /*integral_constant_expression_p=*/false);
20414 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20415 /* If we had an initializer but it instantiated to nothing,
20416 value-initialize the object. This will only occur when
20417 the initializer was a pack expansion where the parameter
20418 packs used in that expansion were of length zero. */
20419 init
= void_type_node
;
20420 in_base_initializer
= 0;
20425 init
= build_tree_list (decl
, init
);
20426 TREE_CHAIN (init
) = inits
;
20434 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20437 set_current_access_from_decl (tree decl
)
20439 if (TREE_PRIVATE (decl
))
20440 current_access_specifier
= access_private_node
;
20441 else if (TREE_PROTECTED (decl
))
20442 current_access_specifier
= access_protected_node
;
20444 current_access_specifier
= access_public_node
;
20447 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20448 is the instantiation (which should have been created with
20449 start_enum) and ARGS are the template arguments to use. */
20452 tsubst_enum (tree tag
, tree newtag
, tree args
)
20456 if (SCOPED_ENUM_P (newtag
))
20457 begin_scope (sk_scoped_enum
, newtag
);
20459 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20464 decl
= TREE_VALUE (e
);
20465 /* Note that in a template enum, the TREE_VALUE is the
20466 CONST_DECL, not the corresponding INTEGER_CST. */
20467 value
= tsubst_expr (DECL_INITIAL (decl
),
20468 args
, tf_warning_or_error
, NULL_TREE
,
20469 /*integral_constant_expression_p=*/true);
20471 /* Give this enumeration constant the correct access. */
20472 set_current_access_from_decl (decl
);
20474 /* Actually build the enumerator itself. */
20476 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
20479 if (SCOPED_ENUM_P (newtag
))
20482 finish_enum_value_list (newtag
);
20483 finish_enum (newtag
);
20485 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20486 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20489 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20490 its type -- but without substituting the innermost set of template
20491 arguments. So, innermost set of template parameters will appear in
20495 get_mostly_instantiated_function_type (tree decl
)
20503 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
20504 targs
= DECL_TI_ARGS (decl
);
20505 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
20506 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
20508 /* There should be as many levels of arguments as there are levels
20510 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
20512 fn_type
= TREE_TYPE (tmpl
);
20514 if (parm_depth
== 1)
20515 /* No substitution is necessary. */
20522 /* Replace the innermost level of the TARGS with NULL_TREEs to
20523 let tsubst know not to substitute for those parameters. */
20524 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20525 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
20526 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
20527 TMPL_ARGS_LEVEL (targs
, i
));
20528 SET_TMPL_ARGS_LEVEL (partial_args
,
20529 TMPL_ARGS_DEPTH (targs
),
20530 make_tree_vec (DECL_NTPARMS (tmpl
)));
20532 /* Make sure that we can see identifiers, and compute access
20534 push_access_scope (decl
);
20536 ++processing_template_decl
;
20537 /* Now, do the (partial) substitution to figure out the
20538 appropriate function type. */
20539 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
20540 --processing_template_decl
;
20542 /* Substitute into the template parameters to obtain the real
20543 innermost set of parameters. This step is important if the
20544 innermost set of template parameters contains value
20545 parameters whose types depend on outer template parameters. */
20546 TREE_VEC_LENGTH (partial_args
)--;
20547 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
20549 pop_access_scope (decl
);
20555 /* Return truthvalue if we're processing a template different from
20556 the last one involved in diagnostics. */
20558 problematic_instantiation_changed (void)
20560 return current_tinst_level
!= last_error_tinst_level
;
20563 /* Remember current template involved in diagnostics. */
20565 record_last_problematic_instantiation (void)
20567 last_error_tinst_level
= current_tinst_level
;
20570 struct tinst_level
*
20571 current_instantiation (void)
20573 return current_tinst_level
;
20576 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20577 type. Return zero for ok, nonzero for disallowed. Issue error and
20578 warning messages under control of COMPLAIN. */
20581 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20583 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20585 else if (POINTER_TYPE_P (type
))
20587 else if (TYPE_PTRMEM_P (type
))
20589 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20591 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20593 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20595 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20598 if (complain
& tf_error
)
20600 if (type
== error_mark_node
)
20601 inform (input_location
, "invalid template non-type parameter");
20603 error ("%q#T is not a valid type for a template non-type parameter",
20609 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20610 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20613 dependent_type_p_r (tree type
)
20619 A type is dependent if it is:
20621 -- a template parameter. Template template parameters are types
20622 for us (since TYPE_P holds true for them) so we handle
20624 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20625 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
20627 /* -- a qualified-id with a nested-name-specifier which contains a
20628 class-name that names a dependent type or whose unqualified-id
20629 names a dependent type. */
20630 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20632 /* -- a cv-qualified type where the cv-unqualified type is
20634 type
= TYPE_MAIN_VARIANT (type
);
20635 /* -- a compound type constructed from any dependent type. */
20636 if (TYPE_PTRMEM_P (type
))
20637 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
20638 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
20640 else if (TYPE_PTR_P (type
)
20641 || TREE_CODE (type
) == REFERENCE_TYPE
)
20642 return dependent_type_p (TREE_TYPE (type
));
20643 else if (TREE_CODE (type
) == FUNCTION_TYPE
20644 || TREE_CODE (type
) == METHOD_TYPE
)
20648 if (dependent_type_p (TREE_TYPE (type
)))
20650 for (arg_type
= TYPE_ARG_TYPES (type
);
20652 arg_type
= TREE_CHAIN (arg_type
))
20653 if (dependent_type_p (TREE_VALUE (arg_type
)))
20657 /* -- an array type constructed from any dependent type or whose
20658 size is specified by a constant expression that is
20661 We checked for type- and value-dependence of the bounds in
20662 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20663 if (TREE_CODE (type
) == ARRAY_TYPE
)
20665 if (TYPE_DOMAIN (type
)
20666 && dependent_type_p (TYPE_DOMAIN (type
)))
20668 return dependent_type_p (TREE_TYPE (type
));
20671 /* -- a template-id in which either the template name is a template
20673 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20675 /* ... or any of the template arguments is a dependent type or
20676 an expression that is type-dependent or value-dependent. */
20677 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
20678 && (any_dependent_template_arguments_p
20679 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
20682 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20683 dependent; if the argument of the `typeof' expression is not
20684 type-dependent, then it should already been have resolved. */
20685 if (TREE_CODE (type
) == TYPEOF_TYPE
20686 || TREE_CODE (type
) == DECLTYPE_TYPE
20687 || TREE_CODE (type
) == UNDERLYING_TYPE
)
20690 /* A template argument pack is dependent if any of its packed
20692 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
20694 tree args
= ARGUMENT_PACK_ARGS (type
);
20695 int i
, len
= TREE_VEC_LENGTH (args
);
20696 for (i
= 0; i
< len
; ++i
)
20697 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20701 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20702 be template parameters. */
20703 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
20706 /* The standard does not specifically mention types that are local
20707 to template functions or local classes, but they should be
20708 considered dependent too. For example:
20710 template <int I> void f() {
20715 The size of `E' cannot be known until the value of `I' has been
20716 determined. Therefore, `E' must be considered dependent. */
20717 scope
= TYPE_CONTEXT (type
);
20718 if (scope
&& TYPE_P (scope
))
20719 return dependent_type_p (scope
);
20720 /* Don't use type_dependent_expression_p here, as it can lead
20721 to infinite recursion trying to determine whether a lambda
20722 nested in a lambda is dependent (c++/47687). */
20723 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
20724 && DECL_LANG_SPECIFIC (scope
)
20725 && DECL_TEMPLATE_INFO (scope
)
20726 && (any_dependent_template_arguments_p
20727 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
20730 /* Other types are non-dependent. */
20734 /* Returns TRUE if TYPE is dependent, in the sense of
20735 [temp.dep.type]. Note that a NULL type is considered dependent. */
20738 dependent_type_p (tree type
)
20740 /* If there are no template parameters in scope, then there can't be
20741 any dependent types. */
20742 if (!processing_template_decl
)
20744 /* If we are not processing a template, then nobody should be
20745 providing us with a dependent type. */
20747 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
20751 /* If the type is NULL, we have not computed a type for the entity
20752 in question; in that case, the type is dependent. */
20756 /* Erroneous types can be considered non-dependent. */
20757 if (type
== error_mark_node
)
20760 /* If we have not already computed the appropriate value for TYPE,
20762 if (!TYPE_DEPENDENT_P_VALID (type
))
20764 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
20765 TYPE_DEPENDENT_P_VALID (type
) = 1;
20768 return TYPE_DEPENDENT_P (type
);
20771 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
20772 lookup. In other words, a dependent type that is not the current
20776 dependent_scope_p (tree scope
)
20778 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
20779 && !currently_open_class (scope
));
20782 /* T is a SCOPE_REF; return whether we need to consider it
20783 instantiation-dependent so that we can check access at instantiation
20784 time even though we know which member it resolves to. */
20787 instantiation_dependent_scope_ref_p (tree t
)
20789 if (DECL_P (TREE_OPERAND (t
, 1))
20790 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
20791 && accessible_in_template_p (TREE_OPERAND (t
, 0),
20792 TREE_OPERAND (t
, 1)))
20798 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
20799 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
20802 /* Note that this predicate is not appropriate for general expressions;
20803 only constant expressions (that satisfy potential_constant_expression)
20804 can be tested for value dependence. */
20807 value_dependent_expression_p (tree expression
)
20809 if (!processing_template_decl
)
20812 /* A name declared with a dependent type. */
20813 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
20816 switch (TREE_CODE (expression
))
20818 case IDENTIFIER_NODE
:
20819 /* A name that has not been looked up -- must be dependent. */
20822 case TEMPLATE_PARM_INDEX
:
20823 /* A non-type template parm. */
20827 /* A non-type template parm. */
20828 if (DECL_TEMPLATE_PARM_P (expression
))
20830 return value_dependent_expression_p (DECL_INITIAL (expression
));
20833 /* A constant with literal type and is initialized
20834 with an expression that is value-dependent.
20836 Note that a non-dependent parenthesized initializer will have
20837 already been replaced with its constant value, so if we see
20838 a TREE_LIST it must be dependent. */
20839 if (DECL_INITIAL (expression
)
20840 && decl_constant_var_p (expression
)
20841 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
20842 || value_dependent_expression_p (DECL_INITIAL (expression
))))
20846 case DYNAMIC_CAST_EXPR
:
20847 case STATIC_CAST_EXPR
:
20848 case CONST_CAST_EXPR
:
20849 case REINTERPRET_CAST_EXPR
:
20851 /* These expressions are value-dependent if the type to which
20852 the cast occurs is dependent or the expression being casted
20853 is value-dependent. */
20855 tree type
= TREE_TYPE (expression
);
20857 if (dependent_type_p (type
))
20860 /* A functional cast has a list of operands. */
20861 expression
= TREE_OPERAND (expression
, 0);
20864 /* If there are no operands, it must be an expression such
20865 as "int()". This should not happen for aggregate types
20866 because it would form non-constant expressions. */
20867 gcc_assert (cxx_dialect
>= cxx11
20868 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
20873 if (TREE_CODE (expression
) == TREE_LIST
)
20874 return any_value_dependent_elements_p (expression
);
20876 return value_dependent_expression_p (expression
);
20880 if (SIZEOF_EXPR_TYPE_P (expression
))
20881 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
20885 /* A `sizeof' expression is value-dependent if the operand is
20886 type-dependent or is a pack expansion. */
20887 expression
= TREE_OPERAND (expression
, 0);
20888 if (PACK_EXPANSION_P (expression
))
20890 else if (TYPE_P (expression
))
20891 return dependent_type_p (expression
);
20892 return instantiation_dependent_expression_p (expression
);
20894 case AT_ENCODE_EXPR
:
20895 /* An 'encode' expression is value-dependent if the operand is
20897 expression
= TREE_OPERAND (expression
, 0);
20898 return dependent_type_p (expression
);
20900 case NOEXCEPT_EXPR
:
20901 expression
= TREE_OPERAND (expression
, 0);
20902 return instantiation_dependent_expression_p (expression
);
20905 /* All instantiation-dependent expressions should also be considered
20906 value-dependent. */
20907 return instantiation_dependent_scope_ref_p (expression
);
20909 case COMPONENT_REF
:
20910 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
20911 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
20913 case NONTYPE_ARGUMENT_PACK
:
20914 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
20915 is value-dependent. */
20917 tree values
= ARGUMENT_PACK_ARGS (expression
);
20918 int i
, len
= TREE_VEC_LENGTH (values
);
20920 for (i
= 0; i
< len
; ++i
)
20921 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
20929 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
20930 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
20931 || (type2
? dependent_type_p (type2
) : false));
20935 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20936 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
20939 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20940 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
20944 tree op
= TREE_OPERAND (expression
, 0);
20945 return (value_dependent_expression_p (op
)
20946 || has_value_dependent_address (op
));
20951 tree fn
= get_callee_fndecl (expression
);
20953 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
20955 nargs
= call_expr_nargs (expression
);
20956 for (i
= 0; i
< nargs
; ++i
)
20958 tree op
= CALL_EXPR_ARG (expression
, i
);
20959 /* In a call to a constexpr member function, look through the
20960 implicit ADDR_EXPR on the object argument so that it doesn't
20961 cause the call to be considered value-dependent. We also
20962 look through it in potential_constant_expression. */
20963 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
20964 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
20965 && TREE_CODE (op
) == ADDR_EXPR
)
20966 op
= TREE_OPERAND (op
, 0);
20967 if (value_dependent_expression_p (op
))
20973 case TEMPLATE_ID_EXPR
:
20974 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
20976 return type_dependent_expression_p (expression
);
20982 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
20983 if (value_dependent_expression_p (val
))
20989 /* Treat a GNU statement expression as dependent to avoid crashing
20990 under fold_non_dependent_expr; it can't be constant. */
20994 /* A constant expression is value-dependent if any subexpression is
20995 value-dependent. */
20996 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
20998 case tcc_reference
:
21000 case tcc_comparison
:
21002 case tcc_expression
:
21005 int i
, len
= cp_tree_operand_length (expression
);
21007 for (i
= 0; i
< len
; i
++)
21009 tree t
= TREE_OPERAND (expression
, i
);
21011 /* In some cases, some of the operands may be missing.l
21012 (For example, in the case of PREDECREMENT_EXPR, the
21013 amount to increment by may be missing.) That doesn't
21014 make the expression dependent. */
21015 if (t
&& value_dependent_expression_p (t
))
21026 /* The expression is not value-dependent. */
21030 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
21031 [temp.dep.expr]. Note that an expression with no type is
21032 considered dependent. Other parts of the compiler arrange for an
21033 expression with type-dependent subexpressions to have no type, so
21034 this function doesn't have to be fully recursive. */
21037 type_dependent_expression_p (tree expression
)
21039 if (!processing_template_decl
)
21042 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
21045 /* An unresolved name is always dependent. */
21046 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
21049 /* Some expression forms are never type-dependent. */
21050 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
21051 || TREE_CODE (expression
) == SIZEOF_EXPR
21052 || TREE_CODE (expression
) == ALIGNOF_EXPR
21053 || TREE_CODE (expression
) == AT_ENCODE_EXPR
21054 || TREE_CODE (expression
) == NOEXCEPT_EXPR
21055 || TREE_CODE (expression
) == TRAIT_EXPR
21056 || TREE_CODE (expression
) == TYPEID_EXPR
21057 || TREE_CODE (expression
) == DELETE_EXPR
21058 || TREE_CODE (expression
) == VEC_DELETE_EXPR
21059 || TREE_CODE (expression
) == THROW_EXPR
)
21062 /* The types of these expressions depends only on the type to which
21063 the cast occurs. */
21064 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
21065 || TREE_CODE (expression
) == STATIC_CAST_EXPR
21066 || TREE_CODE (expression
) == CONST_CAST_EXPR
21067 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
21068 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
21069 || TREE_CODE (expression
) == CAST_EXPR
)
21070 return dependent_type_p (TREE_TYPE (expression
));
21072 /* The types of these expressions depends only on the type created
21073 by the expression. */
21074 if (TREE_CODE (expression
) == NEW_EXPR
21075 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
21077 /* For NEW_EXPR tree nodes created inside a template, either
21078 the object type itself or a TREE_LIST may appear as the
21080 tree type
= TREE_OPERAND (expression
, 1);
21081 if (TREE_CODE (type
) == TREE_LIST
)
21082 /* This is an array type. We need to check array dimensions
21084 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
21085 || value_dependent_expression_p
21086 (TREE_OPERAND (TREE_VALUE (type
), 1));
21088 return dependent_type_p (type
);
21091 if (TREE_CODE (expression
) == SCOPE_REF
)
21093 tree scope
= TREE_OPERAND (expression
, 0);
21094 tree name
= TREE_OPERAND (expression
, 1);
21096 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
21097 contains an identifier associated by name lookup with one or more
21098 declarations declared with a dependent type, or...a
21099 nested-name-specifier or qualified-id that names a member of an
21100 unknown specialization. */
21101 return (type_dependent_expression_p (name
)
21102 || dependent_scope_p (scope
));
21105 if (TREE_CODE (expression
) == FUNCTION_DECL
21106 && DECL_LANG_SPECIFIC (expression
)
21107 && DECL_TEMPLATE_INFO (expression
)
21108 && (any_dependent_template_arguments_p
21109 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
21112 if (TREE_CODE (expression
) == TEMPLATE_DECL
21113 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
21116 if (TREE_CODE (expression
) == STMT_EXPR
)
21117 expression
= stmt_expr_value_expr (expression
);
21119 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
21124 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
21126 if (type_dependent_expression_p (elt
))
21132 /* A static data member of the current instantiation with incomplete
21133 array type is type-dependent, as the definition and specializations
21134 can have different bounds. */
21135 if (VAR_P (expression
)
21136 && DECL_CLASS_SCOPE_P (expression
)
21137 && dependent_type_p (DECL_CONTEXT (expression
))
21138 && VAR_HAD_UNKNOWN_BOUND (expression
))
21141 /* An array of unknown bound depending on a variadic parameter, eg:
21143 template<typename... Args>
21144 void foo (Args... args)
21146 int arr[] = { args... };
21149 template<int... vals>
21152 int arr[] = { vals... };
21155 If the array has no length and has an initializer, it must be that
21156 we couldn't determine its length in cp_complete_array_type because
21157 it is dependent. */
21158 if (VAR_P (expression
)
21159 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
21160 && !TYPE_DOMAIN (TREE_TYPE (expression
))
21161 && DECL_INITIAL (expression
))
21164 if (TREE_TYPE (expression
) == unknown_type_node
)
21166 if (TREE_CODE (expression
) == ADDR_EXPR
)
21167 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
21168 if (TREE_CODE (expression
) == COMPONENT_REF
21169 || TREE_CODE (expression
) == OFFSET_REF
)
21171 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21173 expression
= TREE_OPERAND (expression
, 1);
21174 if (identifier_p (expression
))
21177 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21178 if (TREE_CODE (expression
) == SCOPE_REF
)
21181 /* Always dependent, on the number of arguments if nothing else. */
21182 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
21185 if (BASELINK_P (expression
))
21187 if (BASELINK_OPTYPE (expression
)
21188 && dependent_type_p (BASELINK_OPTYPE (expression
)))
21190 expression
= BASELINK_FUNCTIONS (expression
);
21193 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
21195 if (any_dependent_template_arguments_p
21196 (TREE_OPERAND (expression
, 1)))
21198 expression
= TREE_OPERAND (expression
, 0);
21200 gcc_assert (TREE_CODE (expression
) == OVERLOAD
21201 || TREE_CODE (expression
) == FUNCTION_DECL
);
21205 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
21207 expression
= OVL_NEXT (expression
);
21212 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
21214 return (dependent_type_p (TREE_TYPE (expression
)));
21217 /* walk_tree callback function for instantiation_dependent_expression_p,
21218 below. Returns non-zero if a dependent subexpression is found. */
21221 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
21226 /* We don't have to worry about decltype currently because decltype
21227 of an instantiation-dependent expr is a dependent type. This
21228 might change depending on the resolution of DR 1172. */
21229 *walk_subtrees
= false;
21232 enum tree_code code
= TREE_CODE (*tp
);
21235 /* Don't treat an argument list as dependent just because it has no
21243 /* A constant with a dependent initializer is dependent. */
21244 if (value_dependent_expression_p (*tp
))
21248 case TEMPLATE_PARM_INDEX
:
21251 /* Handle expressions with type operands. */
21255 case AT_ENCODE_EXPR
:
21257 tree op
= TREE_OPERAND (*tp
, 0);
21258 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
21259 op
= TREE_TYPE (op
);
21262 if (dependent_type_p (op
))
21266 *walk_subtrees
= false;
21274 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21275 || (TRAIT_EXPR_TYPE2 (*tp
)
21276 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21278 *walk_subtrees
= false;
21281 case COMPONENT_REF
:
21282 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21283 /* In a template, finish_class_member_access_expr creates a
21284 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21285 type-dependent, so that we can check access control at
21286 instantiation time (PR 42277). See also Core issue 1273. */
21291 if (instantiation_dependent_scope_ref_p (*tp
))
21296 /* Treat statement-expressions as dependent. */
21304 if (type_dependent_expression_p (*tp
))
21310 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21311 sense defined by the ABI:
21313 "An expression is instantiation-dependent if it is type-dependent
21314 or value-dependent, or it has a subexpression that is type-dependent
21315 or value-dependent." */
21318 instantiation_dependent_expression_p (tree expression
)
21322 if (!processing_template_decl
)
21325 if (expression
== error_mark_node
)
21328 result
= cp_walk_tree_without_duplicates (&expression
,
21329 instantiation_dependent_r
, NULL
);
21330 return result
!= NULL_TREE
;
21333 /* Like type_dependent_expression_p, but it also works while not processing
21334 a template definition, i.e. during substitution or mangling. */
21337 type_dependent_expression_p_push (tree expr
)
21340 ++processing_template_decl
;
21341 b
= type_dependent_expression_p (expr
);
21342 --processing_template_decl
;
21346 /* Returns TRUE if ARGS contains a type-dependent expression. */
21349 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21354 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21356 if (type_dependent_expression_p (arg
))
21362 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21363 expressions) contains any type-dependent expressions. */
21366 any_type_dependent_elements_p (const_tree list
)
21368 for (; list
; list
= TREE_CHAIN (list
))
21369 if (type_dependent_expression_p (TREE_VALUE (list
)))
21375 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21376 expressions) contains any value-dependent expressions. */
21379 any_value_dependent_elements_p (const_tree list
)
21381 for (; list
; list
= TREE_CHAIN (list
))
21382 if (value_dependent_expression_p (TREE_VALUE (list
)))
21388 /* Returns TRUE if the ARG (a template argument) is dependent. */
21391 dependent_template_arg_p (tree arg
)
21393 if (!processing_template_decl
)
21396 /* Assume a template argument that was wrongly written by the user
21397 is dependent. This is consistent with what
21398 any_dependent_template_arguments_p [that calls this function]
21400 if (!arg
|| arg
== error_mark_node
)
21403 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21404 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21406 if (TREE_CODE (arg
) == TEMPLATE_DECL
21407 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21408 return dependent_template_p (arg
);
21409 else if (ARGUMENT_PACK_P (arg
))
21411 tree args
= ARGUMENT_PACK_ARGS (arg
);
21412 int i
, len
= TREE_VEC_LENGTH (args
);
21413 for (i
= 0; i
< len
; ++i
)
21415 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21421 else if (TYPE_P (arg
))
21422 return dependent_type_p (arg
);
21424 return (type_dependent_expression_p (arg
)
21425 || value_dependent_expression_p (arg
));
21428 /* Returns true if ARGS (a collection of template arguments) contains
21429 any types that require structural equality testing. */
21432 any_template_arguments_need_structural_equality_p (tree args
)
21439 if (args
== error_mark_node
)
21442 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21444 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21445 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21447 tree arg
= TREE_VEC_ELT (level
, j
);
21448 tree packed_args
= NULL_TREE
;
21451 if (ARGUMENT_PACK_P (arg
))
21453 /* Look inside the argument pack. */
21454 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21455 len
= TREE_VEC_LENGTH (packed_args
);
21458 for (k
= 0; k
< len
; ++k
)
21461 arg
= TREE_VEC_ELT (packed_args
, k
);
21463 if (error_operand_p (arg
))
21465 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21467 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21469 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21470 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21479 /* Returns true if ARGS (a collection of template arguments) contains
21480 any dependent arguments. */
21483 any_dependent_template_arguments_p (const_tree args
)
21490 if (args
== error_mark_node
)
21493 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21495 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21496 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21497 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21504 /* Returns TRUE if the template TMPL is dependent. */
21507 dependent_template_p (tree tmpl
)
21509 if (TREE_CODE (tmpl
) == OVERLOAD
)
21513 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21515 tmpl
= OVL_NEXT (tmpl
);
21520 /* Template template parameters are dependent. */
21521 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21522 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21524 /* So are names that have not been looked up. */
21525 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21527 /* So are member templates of dependent classes. */
21528 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21529 return dependent_type_p (DECL_CONTEXT (tmpl
));
21533 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21536 dependent_template_id_p (tree tmpl
, tree args
)
21538 return (dependent_template_p (tmpl
)
21539 || any_dependent_template_arguments_p (args
));
21542 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21546 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21550 if (!processing_template_decl
)
21553 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21555 tree decl
= TREE_VEC_ELT (declv
, i
);
21556 tree init
= TREE_VEC_ELT (initv
, i
);
21557 tree cond
= TREE_VEC_ELT (condv
, i
);
21558 tree incr
= TREE_VEC_ELT (incrv
, i
);
21560 if (type_dependent_expression_p (decl
))
21563 if (init
&& type_dependent_expression_p (init
))
21566 if (type_dependent_expression_p (cond
))
21569 if (COMPARISON_CLASS_P (cond
)
21570 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21571 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21574 if (TREE_CODE (incr
) == MODOP_EXPR
)
21576 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21577 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21580 else if (type_dependent_expression_p (incr
))
21582 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21584 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21586 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
21588 tree t
= TREE_OPERAND (incr
, 1);
21589 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
21590 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
21599 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21600 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21601 no such TYPE can be found. Note that this function peers inside
21602 uninstantiated templates and therefore should be used only in
21603 extremely limited situations. ONLY_CURRENT_P restricts this
21604 peering to the currently open classes hierarchy (which is required
21605 when comparing types). */
21608 resolve_typename_type (tree type
, bool only_current_p
)
21617 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
21619 scope
= TYPE_CONTEXT (type
);
21620 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21621 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21622 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21623 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21624 identifier of the TYPENAME_TYPE anymore.
21625 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21626 TYPENAME_TYPE instead, we avoid messing up with a possible
21627 typedef variant case. */
21628 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
21630 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21631 it first before we can figure out what NAME refers to. */
21632 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21634 if (TYPENAME_IS_RESOLVING_P (scope
))
21635 /* Given a class template A with a dependent base with nested type C,
21636 typedef typename A::C::C C will land us here, as trying to resolve
21637 the initial A::C leads to the local C typedef, which leads back to
21638 A::C::C. So we break the recursion now. */
21641 scope
= resolve_typename_type (scope
, only_current_p
);
21643 /* If we don't know what SCOPE refers to, then we cannot resolve the
21645 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21647 /* If the SCOPE is a template type parameter, we have no way of
21648 resolving the name. */
21649 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
21651 /* If the SCOPE is not the current instantiation, there's no reason
21652 to look inside it. */
21653 if (only_current_p
&& !currently_open_class (scope
))
21655 /* If this is a typedef, we don't want to look inside (c++/11987). */
21656 if (typedef_variant_p (type
))
21658 /* If SCOPE isn't the template itself, it will not have a valid
21659 TYPE_FIELDS list. */
21660 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
21661 /* scope is either the template itself or a compatible instantiation
21662 like X<T>, so look up the name in the original template. */
21663 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
21665 /* scope is a partial instantiation, so we can't do the lookup or we
21666 will lose the template arguments. */
21668 /* Enter the SCOPE so that name lookup will be resolved as if we
21669 were in the class definition. In particular, SCOPE will no
21670 longer be considered a dependent type. */
21671 pushed_scope
= push_scope (scope
);
21672 /* Look up the declaration. */
21673 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
21674 tf_warning_or_error
);
21676 result
= NULL_TREE
;
21678 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21679 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21682 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
21683 && TREE_CODE (decl
) == TYPE_DECL
)
21685 result
= TREE_TYPE (decl
);
21686 if (result
== error_mark_node
)
21687 result
= NULL_TREE
;
21689 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
21690 && DECL_CLASS_TEMPLATE_P (decl
))
21694 /* Obtain the template and the arguments. */
21695 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
21696 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
21697 /* Instantiate the template. */
21698 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
21699 /*entering_scope=*/0,
21700 tf_error
| tf_user
);
21701 if (result
== error_mark_node
)
21702 result
= NULL_TREE
;
21705 /* Leave the SCOPE. */
21707 pop_scope (pushed_scope
);
21709 /* If we failed to resolve it, return the original typename. */
21713 /* If lookup found a typename type, resolve that too. */
21714 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
21716 /* Ill-formed programs can cause infinite recursion here, so we
21717 must catch that. */
21718 TYPENAME_IS_RESOLVING_P (type
) = 1;
21719 result
= resolve_typename_type (result
, only_current_p
);
21720 TYPENAME_IS_RESOLVING_P (type
) = 0;
21723 /* Qualify the resulting type. */
21724 quals
= cp_type_quals (type
);
21726 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
21731 /* EXPR is an expression which is not type-dependent. Return a proxy
21732 for EXPR that can be used to compute the types of larger
21733 expressions containing EXPR. */
21736 build_non_dependent_expr (tree expr
)
21740 #ifdef ENABLE_CHECKING
21741 /* Try to get a constant value for all non-dependent expressions in
21742 order to expose bugs in *_dependent_expression_p and constexpr. */
21743 if (cxx_dialect
>= cxx11
)
21744 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
21747 /* Preserve OVERLOADs; the functions must be available to resolve
21750 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
21751 inner_expr
= stmt_expr_value_expr (inner_expr
);
21752 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
21753 inner_expr
= TREE_OPERAND (inner_expr
, 0);
21754 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
21755 inner_expr
= TREE_OPERAND (inner_expr
, 1);
21756 if (is_overloaded_fn (inner_expr
)
21757 || TREE_CODE (inner_expr
) == OFFSET_REF
)
21759 /* There is no need to return a proxy for a variable. */
21762 /* Preserve string constants; conversions from string constants to
21763 "char *" are allowed, even though normally a "const char *"
21764 cannot be used to initialize a "char *". */
21765 if (TREE_CODE (expr
) == STRING_CST
)
21767 /* Preserve void and arithmetic constants, as an optimization -- there is no
21768 reason to create a new node. */
21769 if (TREE_CODE (expr
) == VOID_CST
21770 || TREE_CODE (expr
) == INTEGER_CST
21771 || TREE_CODE (expr
) == REAL_CST
)
21773 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
21774 There is at least one place where we want to know that a
21775 particular expression is a throw-expression: when checking a ?:
21776 expression, there are special rules if the second or third
21777 argument is a throw-expression. */
21778 if (TREE_CODE (expr
) == THROW_EXPR
)
21781 /* Don't wrap an initializer list, we need to be able to look inside. */
21782 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
21785 /* Don't wrap a dummy object, we need to be able to test for it. */
21786 if (is_dummy_object (expr
))
21789 if (TREE_CODE (expr
) == COND_EXPR
)
21790 return build3 (COND_EXPR
,
21792 TREE_OPERAND (expr
, 0),
21793 (TREE_OPERAND (expr
, 1)
21794 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
21795 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
21796 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
21797 if (TREE_CODE (expr
) == COMPOUND_EXPR
21798 && !COMPOUND_EXPR_OVERLOADED (expr
))
21799 return build2 (COMPOUND_EXPR
,
21801 TREE_OPERAND (expr
, 0),
21802 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
21804 /* If the type is unknown, it can't really be non-dependent */
21805 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
21807 /* Otherwise, build a NON_DEPENDENT_EXPR. */
21808 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
21811 /* ARGS is a vector of expressions as arguments to a function call.
21812 Replace the arguments with equivalent non-dependent expressions.
21813 This modifies ARGS in place. */
21816 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
21821 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
21823 tree newarg
= build_non_dependent_expr (arg
);
21825 (*args
)[ix
] = newarg
;
21829 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
21830 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
21834 make_auto_1 (tree name
)
21836 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
21837 TYPE_NAME (au
) = build_decl (input_location
,
21838 TYPE_DECL
, name
, au
);
21839 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
21840 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
21841 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
21842 TYPE_NAME (au
), NULL_TREE
);
21843 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
21844 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
21845 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
21851 make_decltype_auto (void)
21853 return make_auto_1 (get_identifier ("decltype(auto)"));
21859 return make_auto_1 (get_identifier ("auto"));
21862 /* Given type ARG, return std::initializer_list<ARG>. */
21867 tree std_init_list
= namespace_binding
21868 (get_identifier ("initializer_list"), std_node
);
21870 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
21872 error ("deducing from brace-enclosed initializer list requires "
21873 "#include <initializer_list>");
21874 return error_mark_node
;
21876 argvec
= make_tree_vec (1);
21877 TREE_VEC_ELT (argvec
, 0) = arg
;
21878 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
21879 NULL_TREE
, 0, tf_warning_or_error
);
21882 /* Replace auto in TYPE with std::initializer_list<auto>. */
21885 listify_autos (tree type
, tree auto_node
)
21887 tree init_auto
= listify (auto_node
);
21888 tree argvec
= make_tree_vec (1);
21889 TREE_VEC_ELT (argvec
, 0) = init_auto
;
21890 if (processing_template_decl
)
21891 argvec
= add_to_template_args (current_template_args (), argvec
);
21892 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21895 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
21896 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
21899 do_auto_deduction (tree type
, tree init
, tree auto_node
)
21903 if (init
== error_mark_node
)
21904 return error_mark_node
;
21906 if (type_dependent_expression_p (init
))
21907 /* Defining a subset of type-dependent expressions that we can deduce
21908 from ahead of time isn't worth the trouble. */
21911 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
21912 with either a new invented type template parameter U or, if the
21913 initializer is a braced-init-list (8.5.4), with
21914 std::initializer_list<U>. */
21915 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
21916 type
= listify_autos (type
, auto_node
);
21918 init
= resolve_nondeduced_context (init
);
21920 targs
= make_tree_vec (1);
21921 if (AUTO_IS_DECLTYPE (auto_node
))
21923 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
21924 && !REF_PARENTHESIZED_P (init
)));
21925 TREE_VEC_ELT (targs
, 0)
21926 = finish_decltype_type (init
, id
, tf_warning_or_error
);
21927 if (type
!= auto_node
)
21929 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
21930 return error_mark_node
;
21935 tree parms
= build_tree_list (NULL_TREE
, type
);
21936 tree tparms
= make_tree_vec (1);
21939 TREE_VEC_ELT (tparms
, 0)
21940 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
21941 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
21942 DEDUCE_CALL
, LOOKUP_NORMAL
,
21943 NULL
, /*explain_p=*/false);
21946 if (processing_template_decl
)
21947 /* Try again at instantiation time. */
21949 if (type
&& type
!= error_mark_node
)
21950 /* If type is error_mark_node a diagnostic must have been
21951 emitted by now. Also, having a mention to '<type error>'
21952 in the diagnostic is not really useful to the user. */
21954 if (cfun
&& auto_node
== current_function_auto_return_pattern
21955 && LAMBDA_FUNCTION_P (current_function_decl
))
21956 error ("unable to deduce lambda return type from %qE", init
);
21958 error ("unable to deduce %qT from %qE", type
, init
);
21960 return error_mark_node
;
21964 /* If the list of declarators contains more than one declarator, the type
21965 of each declared variable is determined as described above. If the
21966 type deduced for the template parameter U is not the same in each
21967 deduction, the program is ill-formed. */
21968 if (TREE_TYPE (auto_node
)
21969 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
21971 if (cfun
&& auto_node
== current_function_auto_return_pattern
21972 && LAMBDA_FUNCTION_P (current_function_decl
))
21973 error ("inconsistent types %qT and %qT deduced for "
21974 "lambda return type", TREE_TYPE (auto_node
),
21975 TREE_VEC_ELT (targs
, 0));
21977 error ("inconsistent deduction for %qT: %qT and then %qT",
21978 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
21979 return error_mark_node
;
21981 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
21983 if (processing_template_decl
)
21984 targs
= add_to_template_args (current_template_args (), targs
);
21985 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
21988 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
21992 splice_late_return_type (tree type
, tree late_return_type
)
21996 if (late_return_type
== NULL_TREE
)
21998 argvec
= make_tree_vec (1);
21999 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
22000 if (processing_template_parmlist
)
22001 /* For a late-specified return type in a template type-parameter, we
22002 need to add a dummy argument level for its parmlist. */
22003 argvec
= add_to_template_args
22004 (make_tree_vec (processing_template_parmlist
), argvec
);
22005 if (current_template_parms
)
22006 argvec
= add_to_template_args (current_template_args (), argvec
);
22007 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22010 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
22011 'decltype(auto)'. */
22014 is_auto (const_tree type
)
22016 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22017 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
22018 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
22024 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
22025 a use of `auto'. Returns NULL_TREE otherwise. */
22028 type_uses_auto (tree type
)
22030 return find_type_usage (type
, is_auto
);
22033 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
22034 'decltype(auto)' or a concept. */
22037 is_auto_or_concept (const_tree type
)
22039 return is_auto (type
); // or concept
22042 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
22043 a concept identifier) iff TYPE contains a use of a generic type. Returns
22044 NULL_TREE otherwise. */
22047 type_uses_auto_or_concept (tree type
)
22049 return find_type_usage (type
, is_auto_or_concept
);
22053 /* For a given template T, return the vector of typedefs referenced
22054 in T for which access check is needed at T instantiation time.
22055 T is either a FUNCTION_DECL or a RECORD_TYPE.
22056 Those typedefs were added to T by the function
22057 append_type_to_template_for_access_check. */
22059 vec
<qualified_typedef_usage_t
, va_gc
> *
22060 get_types_needing_access_check (tree t
)
22063 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
22065 if (!t
|| t
== error_mark_node
)
22068 if (!(ti
= get_template_info (t
)))
22071 if (CLASS_TYPE_P (t
)
22072 || TREE_CODE (t
) == FUNCTION_DECL
)
22074 if (!TI_TEMPLATE (ti
))
22077 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
22083 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
22084 tied to T. That list of typedefs will be access checked at
22085 T instantiation time.
22086 T is either a FUNCTION_DECL or a RECORD_TYPE.
22087 TYPE_DECL is a TYPE_DECL node representing a typedef.
22088 SCOPE is the scope through which TYPE_DECL is accessed.
22089 LOCATION is the location of the usage point of TYPE_DECL.
22091 This function is a subroutine of
22092 append_type_to_template_for_access_check. */
22095 append_type_to_template_for_access_check_1 (tree t
,
22098 location_t location
)
22100 qualified_typedef_usage_t typedef_usage
;
22103 if (!t
|| t
== error_mark_node
)
22106 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
22107 || CLASS_TYPE_P (t
))
22109 && TREE_CODE (type_decl
) == TYPE_DECL
22112 if (!(ti
= get_template_info (t
)))
22115 gcc_assert (TI_TEMPLATE (ti
));
22117 typedef_usage
.typedef_decl
= type_decl
;
22118 typedef_usage
.context
= scope
;
22119 typedef_usage
.locus
= location
;
22121 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
22124 /* Append TYPE_DECL to the template TEMPL.
22125 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
22126 At TEMPL instanciation time, TYPE_DECL will be checked to see
22127 if it can be accessed through SCOPE.
22128 LOCATION is the location of the usage point of TYPE_DECL.
22130 e.g. consider the following code snippet:
22137 template<class U> struct S
22139 C::myint mi; // <-- usage point of the typedef C::myint
22144 At S<char> instantiation time, we need to check the access of C::myint
22145 In other words, we need to check the access of the myint typedef through
22146 the C scope. For that purpose, this function will add the myint typedef
22147 and the scope C through which its being accessed to a list of typedefs
22148 tied to the template S. That list will be walked at template instantiation
22149 time and access check performed on each typedefs it contains.
22150 Note that this particular code snippet should yield an error because
22151 myint is private to C. */
22154 append_type_to_template_for_access_check (tree templ
,
22157 location_t location
)
22159 qualified_typedef_usage_t
*iter
;
22162 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
22164 /* Make sure we don't append the type to the template twice. */
22165 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
22166 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
22169 append_type_to_template_for_access_check_1 (templ
, type_decl
,
22173 /* Convert the generic type parameters in PARM that match the types given in the
22174 range [START_IDX, END_IDX) from the current_template_parms into generic type
22178 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
22180 tree current
= current_template_parms
;
22181 int depth
= TMPL_PARMS_DEPTH (current
);
22182 current
= INNERMOST_TEMPLATE_PARMS (current
);
22183 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
22185 for (int i
= 0; i
< start_idx
; ++i
)
22186 TREE_VEC_ELT (replacement
, i
)
22187 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22189 for (int i
= start_idx
; i
< end_idx
; ++i
)
22191 /* Create a distinct parameter pack type from the current parm and add it
22192 to the replacement args to tsubst below into the generic function
22195 tree o
= TREE_TYPE (TREE_VALUE
22196 (TREE_VEC_ELT (current
, i
)));
22197 tree t
= copy_type (o
);
22198 TEMPLATE_TYPE_PARM_INDEX (t
)
22199 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
22201 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
22202 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
22203 TYPE_MAIN_VARIANT (t
) = t
;
22204 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
22205 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
22206 TREE_VEC_ELT (replacement
, i
) = t
;
22207 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
22210 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
22211 TREE_VEC_ELT (replacement
, i
)
22212 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22214 /* If there are more levels then build up the replacement with the outer
22217 replacement
= add_to_template_args (template_parms_to_args
22218 (TREE_CHAIN (current_template_parms
)),
22221 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
22225 /* Set up the hash tables for template instantiations. */
22228 init_template_processing (void)
22230 decl_specializations
= htab_create_ggc (37,
22231 hash_specialization
,
22232 eq_specializations
,
22234 type_specializations
= htab_create_ggc (37,
22235 hash_specialization
,
22236 eq_specializations
,
22240 /* Print stats about the template hash tables for -fstats. */
22243 print_template_statistics (void)
22245 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
22246 "%f collisions\n", (long) htab_size (decl_specializations
),
22247 (long) htab_elements (decl_specializations
),
22248 htab_collisions (decl_specializations
));
22249 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
22250 "%f collisions\n", (long) htab_size (type_specializations
),
22251 (long) htab_elements (type_specializations
),
22252 htab_collisions (type_specializations
));
22255 #include "gt-cp-pt.h"