1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2014 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
29 #include "coretypes.h"
32 #include "stringpool.h"
35 #include "stor-layout.h"
39 #include "c-family/c-common.h"
40 #include "c-family/c-objc.h"
41 #include "cp-objcp-common.h"
42 #include "tree-inline.h"
46 #include "tree-iterator.h"
47 #include "type-utils.h"
50 /* The type of functions taking a tree, and some additional data, and
52 typedef int (*tree_fn_t
) (tree
, void*);
54 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
55 instantiations have been deferred, either because their definitions
56 were not yet available, or because we were putting off doing the work. */
57 struct GTY ((chain_next ("%h.next"))) pending_template
{
58 struct pending_template
*next
;
59 struct tinst_level
*tinst
;
62 static GTY(()) struct pending_template
*pending_templates
;
63 static GTY(()) struct pending_template
*last_pending_template
;
65 int processing_template_parmlist
;
66 static int template_header_count
;
68 static GTY(()) tree saved_trees
;
69 static vec
<int> inline_parm_levels
;
71 static GTY(()) struct tinst_level
*current_tinst_level
;
73 static GTY(()) tree saved_access_scope
;
75 /* Live only within one (recursive) call to tsubst_expr. We use
76 this to pass the statement expression node from the STMT_EXPR
77 to the EXPR_STMT that is its result. */
78 static tree cur_stmt_expr
;
80 /* True if we've recursed into fn_type_unification too many times. */
81 static bool excessive_deduction_depth
;
83 typedef struct GTY(()) spec_entry
90 static GTY ((param_is (spec_entry
)))
91 htab_t decl_specializations
;
93 static GTY ((param_is (spec_entry
)))
94 htab_t type_specializations
;
96 /* Contains canonical template parameter types. The vector is indexed by
97 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
98 TREE_LIST, whose TREE_VALUEs contain the canonical template
99 parameters of various types and levels. */
100 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
102 #define UNIFY_ALLOW_NONE 0
103 #define UNIFY_ALLOW_MORE_CV_QUAL 1
104 #define UNIFY_ALLOW_LESS_CV_QUAL 2
105 #define UNIFY_ALLOW_DERIVED 4
106 #define UNIFY_ALLOW_INTEGER 8
107 #define UNIFY_ALLOW_OUTER_LEVEL 16
108 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
109 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
111 enum template_base_result
{
113 tbr_ambiguous_baseclass
,
117 static void push_access_scope (tree
);
118 static void pop_access_scope (tree
);
119 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
120 unification_kind_t
, int,
122 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
123 unification_kind_t
, int, bool, bool);
124 static int unify (tree
, tree
, tree
, tree
, int, bool);
125 static void add_pending_template (tree
);
126 static tree
reopen_tinst_level (struct tinst_level
*);
127 static tree
tsubst_initializer_list (tree
, tree
);
128 static tree
get_class_bindings (tree
, tree
, tree
, tree
);
129 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
131 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
133 static void tsubst_enum (tree
, tree
, tree
);
134 static tree
add_to_template_args (tree
, tree
);
135 static tree
add_outermost_template_args (tree
, tree
);
136 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
137 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
139 static int type_unification_real (tree
, tree
, tree
, const tree
*,
140 unsigned int, int, unification_kind_t
, int,
141 vec
<deferred_access_check
, va_gc
> **,
143 static void note_template_header (int);
144 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
145 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
146 static tree
convert_template_argument (tree
, tree
, tree
,
147 tsubst_flags_t
, int, tree
);
148 static int for_each_template_parm (tree
, tree_fn_t
, void*,
149 hash_set
<tree
> *, bool);
150 static tree
expand_template_argument_pack (tree
);
151 static tree
build_template_parm_index (int, int, int, tree
, tree
);
152 static bool inline_needs_template_parms (tree
, bool);
153 static void push_inline_template_parms_recursive (tree
, int);
154 static tree
retrieve_local_specialization (tree
);
155 static void register_local_specialization (tree
, tree
);
156 static hashval_t
hash_specialization (const void *p
);
157 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
158 static int mark_template_parm (tree
, void *);
159 static int template_parm_this_level_p (tree
, void *);
160 static tree
tsubst_friend_function (tree
, tree
);
161 static tree
tsubst_friend_class (tree
, tree
);
162 static int can_complete_type_without_circularity (tree
);
163 static tree
get_bindings (tree
, tree
, tree
, bool);
164 static int template_decl_level (tree
);
165 static int check_cv_quals_for_unify (int, tree
, tree
);
166 static void template_parm_level_and_index (tree
, int*, int*);
167 static int unify_pack_expansion (tree
, tree
, tree
,
168 tree
, unification_kind_t
, bool, bool);
169 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
170 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
171 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
172 static void regenerate_decl_from_template (tree
, tree
);
173 static tree
most_specialized_class (tree
, tsubst_flags_t
);
174 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
175 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
176 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
177 static bool check_specialization_scope (void);
178 static tree
process_partial_specialization (tree
);
179 static void set_current_access_from_decl (tree
);
180 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
182 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
183 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
185 static bool template_template_parm_bindings_ok_p (tree
, tree
);
186 static int template_args_equal (tree
, tree
);
187 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
188 static tree
for_each_template_parm_r (tree
*, int *, void *);
189 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
190 static void copy_default_args_to_explicit_spec (tree
);
191 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
192 static bool dependent_template_arg_p (tree
);
193 static bool any_template_arguments_need_structural_equality_p (tree
);
194 static bool dependent_type_p_r (tree
);
195 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
196 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
197 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
198 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
199 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
200 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
202 static tree
listify (tree
);
203 static tree
listify_autos (tree
, tree
);
204 static tree
template_parm_to_arg (tree t
);
205 static tree
current_template_args (void);
206 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
207 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
209 /* Make the current scope suitable for access checking when we are
210 processing T. T can be FUNCTION_DECL for instantiated function
211 template, VAR_DECL for static member variable, or TYPE_DECL for
212 alias template (needed by instantiate_decl). */
215 push_access_scope (tree t
)
217 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
218 || TREE_CODE (t
) == TYPE_DECL
);
220 if (DECL_FRIEND_CONTEXT (t
))
221 push_nested_class (DECL_FRIEND_CONTEXT (t
));
222 else if (DECL_CLASS_SCOPE_P (t
))
223 push_nested_class (DECL_CONTEXT (t
));
225 push_to_top_level ();
227 if (TREE_CODE (t
) == FUNCTION_DECL
)
229 saved_access_scope
= tree_cons
230 (NULL_TREE
, current_function_decl
, saved_access_scope
);
231 current_function_decl
= t
;
235 /* Restore the scope set up by push_access_scope. T is the node we
239 pop_access_scope (tree t
)
241 if (TREE_CODE (t
) == FUNCTION_DECL
)
243 current_function_decl
= TREE_VALUE (saved_access_scope
);
244 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
247 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
250 pop_from_top_level ();
253 /* Do any processing required when DECL (a member template
254 declaration) is finished. Returns the TEMPLATE_DECL corresponding
255 to DECL, unless it is a specialization, in which case the DECL
256 itself is returned. */
259 finish_member_template_decl (tree decl
)
261 if (decl
== error_mark_node
)
262 return error_mark_node
;
264 gcc_assert (DECL_P (decl
));
266 if (TREE_CODE (decl
) == TYPE_DECL
)
270 type
= TREE_TYPE (decl
);
271 if (type
== error_mark_node
)
272 return error_mark_node
;
273 if (MAYBE_CLASS_TYPE_P (type
)
274 && CLASSTYPE_TEMPLATE_INFO (type
)
275 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
277 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
278 check_member_template (tmpl
);
283 else if (TREE_CODE (decl
) == FIELD_DECL
)
284 error ("data member %qD cannot be a member template", decl
);
285 else if (DECL_TEMPLATE_INFO (decl
))
287 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
289 check_member_template (DECL_TI_TEMPLATE (decl
));
290 return DECL_TI_TEMPLATE (decl
);
296 error ("invalid member template declaration %qD", decl
);
298 return error_mark_node
;
301 /* Create a template info node. */
304 build_template_info (tree template_decl
, tree template_args
)
306 tree result
= make_node (TEMPLATE_INFO
);
307 TI_TEMPLATE (result
) = template_decl
;
308 TI_ARGS (result
) = template_args
;
312 /* Return the template info node corresponding to T, whatever T is. */
315 get_template_info (const_tree t
)
317 tree tinfo
= NULL_TREE
;
319 if (!t
|| t
== error_mark_node
)
322 if (TREE_CODE (t
) == NAMESPACE_DECL
)
325 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
326 tinfo
= DECL_TEMPLATE_INFO (t
);
328 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
331 if (OVERLOAD_TYPE_P (t
))
332 tinfo
= TYPE_TEMPLATE_INFO (t
);
333 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
334 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
339 /* Returns the template nesting level of the indicated class TYPE.
349 A<T>::B<U> has depth two, while A<T> has depth one.
350 Both A<T>::B<int> and A<int>::B<U> have depth one, if
351 they are instantiations, not specializations.
353 This function is guaranteed to return 0 if passed NULL_TREE so
354 that, for example, `template_class_depth (current_class_type)' is
358 template_class_depth (tree type
)
363 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
364 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
365 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
367 tree tinfo
= get_template_info (type
);
369 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
370 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
377 /* Subroutine of maybe_begin_member_template_processing.
378 Returns true if processing DECL needs us to push template parms. */
381 inline_needs_template_parms (tree decl
, bool nsdmi
)
383 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
386 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
387 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
390 /* Subroutine of maybe_begin_member_template_processing.
391 Push the template parms in PARMS, starting from LEVELS steps into the
392 chain, and ending at the beginning, since template parms are listed
396 push_inline_template_parms_recursive (tree parmlist
, int levels
)
398 tree parms
= TREE_VALUE (parmlist
);
402 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
404 ++processing_template_decl
;
405 current_template_parms
406 = tree_cons (size_int (processing_template_decl
),
407 parms
, current_template_parms
);
408 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
410 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
412 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
414 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
416 if (error_operand_p (parm
))
419 gcc_assert (DECL_P (parm
));
421 switch (TREE_CODE (parm
))
430 /* Make a CONST_DECL as is done in process_template_parm.
431 It is ugly that we recreate this here; the original
432 version built in process_template_parm is no longer
434 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
435 CONST_DECL
, DECL_NAME (parm
),
437 DECL_ARTIFICIAL (decl
) = 1;
438 TREE_CONSTANT (decl
) = 1;
439 TREE_READONLY (decl
) = 1;
440 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
441 SET_DECL_TEMPLATE_PARM_P (decl
);
452 /* Restore the template parameter context for a member template, a
453 friend template defined in a class definition, or a non-template
454 member of template class. */
457 maybe_begin_member_template_processing (tree decl
)
461 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
465 tree ctx
= DECL_CONTEXT (decl
);
466 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
467 /* Disregard full specializations (c++/60999). */
468 && uses_template_parms (ctx
)
469 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
472 if (inline_needs_template_parms (decl
, nsdmi
))
474 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
475 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
477 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
480 parms
= TREE_CHAIN (parms
);
483 push_inline_template_parms_recursive (parms
, levels
);
486 /* Remember how many levels of template parameters we pushed so that
487 we can pop them later. */
488 inline_parm_levels
.safe_push (levels
);
491 /* Undo the effects of maybe_begin_member_template_processing. */
494 maybe_end_member_template_processing (void)
499 if (inline_parm_levels
.length () == 0)
502 last
= inline_parm_levels
.pop ();
503 for (i
= 0; i
< last
; ++i
)
505 --processing_template_decl
;
506 current_template_parms
= TREE_CHAIN (current_template_parms
);
511 /* Return a new template argument vector which contains all of ARGS,
512 but has as its innermost set of arguments the EXTRA_ARGS. */
515 add_to_template_args (tree args
, tree extra_args
)
522 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
525 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
526 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
528 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
529 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
531 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
532 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
537 /* Like add_to_template_args, but only the outermost ARGS are added to
538 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
539 (EXTRA_ARGS) levels are added. This function is used to combine
540 the template arguments from a partial instantiation with the
541 template arguments used to attain the full instantiation from the
542 partial instantiation. */
545 add_outermost_template_args (tree args
, tree extra_args
)
549 /* If there are more levels of EXTRA_ARGS than there are ARGS,
550 something very fishy is going on. */
551 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
553 /* If *all* the new arguments will be the EXTRA_ARGS, just return
555 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
558 /* For the moment, we make ARGS look like it contains fewer levels. */
559 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
561 new_args
= add_to_template_args (args
, extra_args
);
563 /* Now, we restore ARGS to its full dimensions. */
564 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
569 /* Return the N levels of innermost template arguments from the ARGS. */
572 get_innermost_template_args (tree args
, int n
)
580 /* If N is 1, just return the innermost set of template arguments. */
582 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
584 /* If we're not removing anything, just return the arguments we were
586 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
587 gcc_assert (extra_levels
>= 0);
588 if (extra_levels
== 0)
591 /* Make a new set of arguments, not containing the outer arguments. */
592 new_args
= make_tree_vec (n
);
593 for (i
= 1; i
<= n
; ++i
)
594 SET_TMPL_ARGS_LEVEL (new_args
, i
,
595 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
600 /* The inverse of get_innermost_template_args: Return all but the innermost
601 EXTRA_LEVELS levels of template arguments from the ARGS. */
604 strip_innermost_template_args (tree args
, int extra_levels
)
607 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
612 /* If N is 1, just return the outermost set of template arguments. */
614 return TMPL_ARGS_LEVEL (args
, 1);
616 /* If we're not removing anything, just return the arguments we were
618 gcc_assert (extra_levels
>= 0);
619 if (extra_levels
== 0)
622 /* Make a new set of arguments, not containing the inner arguments. */
623 new_args
= make_tree_vec (n
);
624 for (i
= 1; i
<= n
; ++i
)
625 SET_TMPL_ARGS_LEVEL (new_args
, i
,
626 TMPL_ARGS_LEVEL (args
, i
));
631 /* We've got a template header coming up; push to a new level for storing
635 begin_template_parm_list (void)
637 /* We use a non-tag-transparent scope here, which causes pushtag to
638 put tags in this scope, rather than in the enclosing class or
639 namespace scope. This is the right thing, since we want
640 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
641 global template class, push_template_decl handles putting the
642 TEMPLATE_DECL into top-level scope. For a nested template class,
645 template <class T> struct S1 {
646 template <class T> struct S2 {};
649 pushtag contains special code to call pushdecl_with_scope on the
650 TEMPLATE_DECL for S2. */
651 begin_scope (sk_template_parms
, NULL
);
652 ++processing_template_decl
;
653 ++processing_template_parmlist
;
654 note_template_header (0);
657 /* This routine is called when a specialization is declared. If it is
658 invalid to declare a specialization here, an error is reported and
659 false is returned, otherwise this routine will return true. */
662 check_specialization_scope (void)
664 tree scope
= current_scope ();
668 An explicit specialization shall be declared in the namespace of
669 which the template is a member, or, for member templates, in the
670 namespace of which the enclosing class or enclosing class
671 template is a member. An explicit specialization of a member
672 function, member class or static data member of a class template
673 shall be declared in the namespace of which the class template
675 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
677 error ("explicit specialization in non-namespace scope %qD", scope
);
683 In an explicit specialization declaration for a member of a class
684 template or a member template that appears in namespace scope,
685 the member template and some of its enclosing class templates may
686 remain unspecialized, except that the declaration shall not
687 explicitly specialize a class member template if its enclosing
688 class templates are not explicitly specialized as well. */
689 if (current_template_parms
)
691 error ("enclosing class templates are not explicitly specialized");
698 /* We've just seen template <>. */
701 begin_specialization (void)
703 begin_scope (sk_template_spec
, NULL
);
704 note_template_header (1);
705 return check_specialization_scope ();
708 /* Called at then end of processing a declaration preceded by
712 end_specialization (void)
715 reset_specialization ();
718 /* Any template <>'s that we have seen thus far are not referring to a
719 function specialization. */
722 reset_specialization (void)
724 processing_specialization
= 0;
725 template_header_count
= 0;
728 /* We've just seen a template header. If SPECIALIZATION is nonzero,
729 it was of the form template <>. */
732 note_template_header (int specialization
)
734 processing_specialization
= specialization
;
735 template_header_count
++;
738 /* We're beginning an explicit instantiation. */
741 begin_explicit_instantiation (void)
743 gcc_assert (!processing_explicit_instantiation
);
744 processing_explicit_instantiation
= true;
749 end_explicit_instantiation (void)
751 gcc_assert (processing_explicit_instantiation
);
752 processing_explicit_instantiation
= false;
755 /* An explicit specialization or partial specialization of TMPL is being
756 declared. Check that the namespace in which the specialization is
757 occurring is permissible. Returns false iff it is invalid to
758 specialize TMPL in the current namespace. */
761 check_specialization_namespace (tree tmpl
)
763 tree tpl_ns
= decl_namespace_context (tmpl
);
767 An explicit specialization shall be declared in the namespace of
768 which the template is a member, or, for member templates, in the
769 namespace of which the enclosing class or enclosing class
770 template is a member. An explicit specialization of a member
771 function, member class or static data member of a class template
772 shall be declared in the namespace of which the class template is
774 if (current_scope() != DECL_CONTEXT (tmpl
)
775 && !at_namespace_scope_p ())
777 error ("specialization of %qD must appear at namespace scope", tmpl
);
780 if (is_associated_namespace (current_namespace
, tpl_ns
))
781 /* Same or super-using namespace. */
785 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
786 permerror (input_location
, " from definition of %q+#D", tmpl
);
791 /* SPEC is an explicit instantiation. Check that it is valid to
792 perform this explicit instantiation in the current namespace. */
795 check_explicit_instantiation_namespace (tree spec
)
799 /* DR 275: An explicit instantiation shall appear in an enclosing
800 namespace of its template. */
801 ns
= decl_namespace_context (spec
);
802 if (!is_ancestor (current_namespace
, ns
))
803 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
804 "(which does not enclose namespace %qD)",
805 spec
, current_namespace
, ns
);
808 /* The TYPE is being declared. If it is a template type, that means it
809 is a partial specialization. Do appropriate error-checking. */
812 maybe_process_partial_specialization (tree type
)
816 if (type
== error_mark_node
)
817 return error_mark_node
;
819 /* A lambda that appears in specialization context is not itself a
821 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
824 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
826 error ("name of class shadows template template parameter %qD",
828 return error_mark_node
;
831 context
= TYPE_CONTEXT (type
);
833 if (TYPE_ALIAS_P (type
))
835 if (TYPE_TEMPLATE_INFO (type
)
836 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
837 error ("specialization of alias template %qD",
838 TYPE_TI_TEMPLATE (type
));
840 error ("explicit specialization of non-template %qT", type
);
841 return error_mark_node
;
843 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
845 /* This is for ordinary explicit specialization and partial
846 specialization of a template class such as:
848 template <> class C<int>;
852 template <class T> class C<T*>;
854 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
856 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
857 && !COMPLETE_TYPE_P (type
))
859 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
))
860 && !at_namespace_scope_p ())
861 return error_mark_node
;
862 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
863 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
864 if (processing_template_decl
)
866 if (push_template_decl (TYPE_MAIN_DECL (type
))
868 return error_mark_node
;
871 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
872 error ("specialization of %qT after instantiation", type
);
873 else if (errorcount
&& !processing_specialization
874 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
875 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
876 /* Trying to define a specialization either without a template<> header
877 or in an inappropriate place. We've already given an error, so just
878 bail now so we don't actually define the specialization. */
879 return error_mark_node
;
881 else if (CLASS_TYPE_P (type
)
882 && !CLASSTYPE_USE_TEMPLATE (type
)
883 && CLASSTYPE_TEMPLATE_INFO (type
)
884 && context
&& CLASS_TYPE_P (context
)
885 && CLASSTYPE_TEMPLATE_INFO (context
))
887 /* This is for an explicit specialization of member class
888 template according to [temp.expl.spec/18]:
890 template <> template <class U> class C<int>::D;
892 The context `C<int>' must be an implicit instantiation.
893 Otherwise this is just a member class template declared
896 template <> class C<int> { template <class U> class D; };
897 template <> template <class U> class C<int>::D;
899 In the first case, `C<int>::D' is a specialization of `C<T>::D'
900 while in the second case, `C<int>::D' is a primary template
901 and `C<T>::D' may not exist. */
903 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
904 && !COMPLETE_TYPE_P (type
))
907 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
909 if (current_namespace
910 != decl_namespace_context (tmpl
))
912 permerror (input_location
, "specializing %q#T in different namespace", type
);
913 permerror (input_location
, " from definition of %q+#D", tmpl
);
916 /* Check for invalid specialization after instantiation:
918 template <> template <> class C<int>::D<int>;
919 template <> template <class U> class C<int>::D; */
921 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
922 t
; t
= TREE_CHAIN (t
))
924 tree inst
= TREE_VALUE (t
);
925 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
926 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
928 /* We already have a full specialization of this partial
929 instantiation, or a full specialization has been
930 looked up but not instantiated. Reassign it to the
931 new member specialization template. */
936 elt
.tmpl
= most_general_template (tmpl
);
937 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
940 htab_remove_elt (type_specializations
, &elt
);
943 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
945 slot
= htab_find_slot (type_specializations
, &elt
, INSERT
);
946 entry
= ggc_alloc
<spec_entry
> ();
951 /* But if we've had an implicit instantiation, that's a
952 problem ([temp.expl.spec]/6). */
953 error ("specialization %qT after instantiation %qT",
957 /* Mark TYPE as a specialization. And as a result, we only
958 have one level of template argument for the innermost
960 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
961 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
962 CLASSTYPE_TI_ARGS (type
)
963 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
966 else if (processing_specialization
)
968 /* Someday C++0x may allow for enum template specialization. */
969 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
970 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
971 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
972 "of %qD not allowed by ISO C++", type
);
975 error ("explicit specialization of non-template %qT", type
);
976 return error_mark_node
;
983 /* Returns nonzero if we can optimize the retrieval of specializations
984 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
985 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
988 optimize_specialization_lookup_p (tree tmpl
)
990 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
991 && DECL_CLASS_SCOPE_P (tmpl
)
992 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
994 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
995 /* The optimized lookup depends on the fact that the
996 template arguments for the member function template apply
997 purely to the containing class, which is not true if the
998 containing class is an explicit or partial
1000 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1001 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1002 && !DECL_CONV_FN_P (tmpl
)
1003 /* It is possible to have a template that is not a member
1004 template and is not a member of a template class:
1006 template <typename T>
1007 struct S { friend A::f(); };
1009 Here, the friend function is a template, but the context does
1010 not have template information. The optimized lookup relies
1011 on having ARGS be the template arguments for both the class
1012 and the function template. */
1013 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1016 /* Retrieve the specialization (in the sense of [temp.spec] - a
1017 specialization is either an instantiation or an explicit
1018 specialization) of TMPL for the given template ARGS. If there is
1019 no such specialization, return NULL_TREE. The ARGS are a vector of
1020 arguments, or a vector of vectors of arguments, in the case of
1021 templates with more than one level of parameters.
1023 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1024 then we search for a partial specialization matching ARGS. This
1025 parameter is ignored if TMPL is not a class template.
1027 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1028 result is a NONTYPE_ARGUMENT_PACK. */
1031 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1033 if (tmpl
== NULL_TREE
)
1036 if (args
== error_mark_node
)
1039 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1040 || TREE_CODE (tmpl
) == FIELD_DECL
);
1042 /* There should be as many levels of arguments as there are
1043 levels of parameters. */
1044 gcc_assert (TMPL_ARGS_DEPTH (args
)
1045 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1046 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1047 : template_class_depth (DECL_CONTEXT (tmpl
))));
1049 if (optimize_specialization_lookup_p (tmpl
))
1051 tree class_template
;
1052 tree class_specialization
;
1053 vec
<tree
, va_gc
> *methods
;
1057 /* The template arguments actually apply to the containing
1058 class. Find the class specialization with those
1060 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1061 class_specialization
1062 = retrieve_specialization (class_template
, args
, 0);
1063 if (!class_specialization
)
1065 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1066 for the specialization. */
1067 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1070 /* Iterate through the methods with the indicated name, looking
1071 for the one that has an instance of TMPL. */
1072 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1073 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1075 tree fn
= OVL_CURRENT (fns
);
1076 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1077 /* using-declarations can add base methods to the method vec,
1078 and we don't want those here. */
1079 && DECL_CONTEXT (fn
) == class_specialization
)
1088 htab_t specializations
;
1092 elt
.spec
= NULL_TREE
;
1094 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1095 specializations
= type_specializations
;
1097 specializations
= decl_specializations
;
1100 hash
= hash_specialization (&elt
);
1101 found
= (spec_entry
*) htab_find_with_hash (specializations
, &elt
, hash
);
1109 /* Like retrieve_specialization, but for local declarations. */
1112 retrieve_local_specialization (tree tmpl
)
1114 if (local_specializations
== NULL
)
1117 tree
*slot
= local_specializations
->get (tmpl
);
1118 return slot
? *slot
: NULL_TREE
;
1121 /* Returns nonzero iff DECL is a specialization of TMPL. */
1124 is_specialization_of (tree decl
, tree tmpl
)
1128 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1132 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1138 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1140 for (t
= TREE_TYPE (decl
);
1142 t
= CLASSTYPE_USE_TEMPLATE (t
)
1143 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1144 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1151 /* Returns nonzero iff DECL is a specialization of friend declaration
1152 FRIEND_DECL according to [temp.friend]. */
1155 is_specialization_of_friend (tree decl
, tree friend_decl
)
1157 bool need_template
= true;
1160 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1161 || TREE_CODE (decl
) == TYPE_DECL
);
1163 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1164 of a template class, we want to check if DECL is a specialization
1166 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1167 && DECL_TEMPLATE_INFO (friend_decl
)
1168 && !DECL_USE_TEMPLATE (friend_decl
))
1170 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1171 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1172 need_template
= false;
1174 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1175 && !PRIMARY_TEMPLATE_P (friend_decl
))
1176 need_template
= false;
1178 /* There is nothing to do if this is not a template friend. */
1179 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1182 if (is_specialization_of (decl
, friend_decl
))
1186 A member of a class template may be declared to be a friend of a
1187 non-template class. In this case, the corresponding member of
1188 every specialization of the class template is a friend of the
1189 class granting friendship.
1191 For example, given a template friend declaration
1193 template <class T> friend void A<T>::f();
1195 the member function below is considered a friend
1197 template <> struct A<int> {
1201 For this type of template friend, TEMPLATE_DEPTH below will be
1202 nonzero. To determine if DECL is a friend of FRIEND, we first
1203 check if the enclosing class is a specialization of another. */
1205 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1207 && DECL_CLASS_SCOPE_P (decl
)
1208 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1209 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1211 /* Next, we check the members themselves. In order to handle
1212 a few tricky cases, such as when FRIEND_DECL's are
1214 template <class T> friend void A<T>::g(T t);
1215 template <class T> template <T t> friend void A<T>::h();
1219 void A<int>::g(int);
1220 template <int> void A<int>::h();
1222 we need to figure out ARGS, the template arguments from
1223 the context of DECL. This is required for template substitution
1224 of `T' in the function parameter of `g' and template parameter
1225 of `h' in the above examples. Here ARGS corresponds to `int'. */
1227 tree context
= DECL_CONTEXT (decl
);
1228 tree args
= NULL_TREE
;
1229 int current_depth
= 0;
1231 while (current_depth
< template_depth
)
1233 if (CLASSTYPE_TEMPLATE_INFO (context
))
1235 if (current_depth
== 0)
1236 args
= TYPE_TI_ARGS (context
);
1238 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1241 context
= TYPE_CONTEXT (context
);
1244 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1249 tree friend_args_type
;
1250 tree decl_args_type
;
1252 /* Make sure that both DECL and FRIEND_DECL are templates or
1254 is_template
= DECL_TEMPLATE_INFO (decl
)
1255 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1256 if (need_template
^ is_template
)
1258 else if (is_template
)
1260 /* If both are templates, check template parameter list. */
1262 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1264 if (!comp_template_parms
1265 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1269 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1272 decl_type
= TREE_TYPE (decl
);
1274 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1275 tf_none
, NULL_TREE
);
1276 if (friend_type
== error_mark_node
)
1279 /* Check if return types match. */
1280 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1283 /* Check if function parameter types match, ignoring the
1284 `this' parameter. */
1285 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1286 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1287 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1288 friend_args_type
= TREE_CHAIN (friend_args_type
);
1289 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1290 decl_args_type
= TREE_CHAIN (decl_args_type
);
1292 return compparms (decl_args_type
, friend_args_type
);
1296 /* DECL is a TYPE_DECL */
1298 tree decl_type
= TREE_TYPE (decl
);
1300 /* Make sure that both DECL and FRIEND_DECL are templates or
1303 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1304 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1306 if (need_template
^ is_template
)
1308 else if (is_template
)
1311 /* If both are templates, check the name of the two
1312 TEMPLATE_DECL's first because is_friend didn't. */
1313 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1314 != DECL_NAME (friend_decl
))
1317 /* Now check template parameter list. */
1319 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1321 return comp_template_parms
1322 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1326 return (DECL_NAME (decl
)
1327 == DECL_NAME (friend_decl
));
1333 /* Register the specialization SPEC as a specialization of TMPL with
1334 the indicated ARGS. IS_FRIEND indicates whether the specialization
1335 is actually just a friend declaration. Returns SPEC, or an
1336 equivalent prior declaration, if available.
1338 We also store instantiations of field packs in the hash table, even
1339 though they are not themselves templates, to make lookup easier. */
1342 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1349 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1350 || (TREE_CODE (tmpl
) == FIELD_DECL
1351 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1353 if (TREE_CODE (spec
) == FUNCTION_DECL
1354 && uses_template_parms (DECL_TI_ARGS (spec
)))
1355 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1356 register it; we want the corresponding TEMPLATE_DECL instead.
1357 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1358 the more obvious `uses_template_parms (spec)' to avoid problems
1359 with default function arguments. In particular, given
1360 something like this:
1362 template <class T> void f(T t1, T t = T())
1364 the default argument expression is not substituted for in an
1365 instantiation unless and until it is actually needed. */
1368 if (optimize_specialization_lookup_p (tmpl
))
1369 /* We don't put these specializations in the hash table, but we might
1370 want to give an error about a mismatch. */
1371 fn
= retrieve_specialization (tmpl
, args
, 0);
1379 hash
= hash_specialization (&elt
);
1382 htab_find_slot_with_hash (decl_specializations
, &elt
, hash
, INSERT
);
1384 fn
= ((spec_entry
*) *slot
)->spec
;
1389 /* We can sometimes try to re-register a specialization that we've
1390 already got. In particular, regenerate_decl_from_template calls
1391 duplicate_decls which will update the specialization list. But,
1392 we'll still get called again here anyhow. It's more convenient
1393 to simply allow this than to try to prevent it. */
1396 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1398 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1400 if (DECL_ODR_USED (fn
)
1401 || DECL_EXPLICIT_INSTANTIATION (fn
))
1403 error ("specialization of %qD after instantiation",
1405 return error_mark_node
;
1410 /* This situation should occur only if the first
1411 specialization is an implicit instantiation, the
1412 second is an explicit specialization, and the
1413 implicit instantiation has not yet been used. That
1414 situation can occur if we have implicitly
1415 instantiated a member function and then specialized
1418 We can also wind up here if a friend declaration that
1419 looked like an instantiation turns out to be a
1422 template <class T> void foo(T);
1423 class S { friend void foo<>(int) };
1424 template <> void foo(int);
1426 We transform the existing DECL in place so that any
1427 pointers to it become pointers to the updated
1430 If there was a definition for the template, but not
1431 for the specialization, we want this to look as if
1432 there were no definition, and vice versa. */
1433 DECL_INITIAL (fn
) = NULL_TREE
;
1434 duplicate_decls (spec
, fn
, is_friend
);
1435 /* The call to duplicate_decls will have applied
1438 An explicit specialization of a function template
1439 is inline only if it is explicitly declared to be,
1440 and independently of whether its function template
1443 to the primary function; now copy the inline bits to
1444 the various clones. */
1445 FOR_EACH_CLONE (clone
, fn
)
1447 DECL_DECLARED_INLINE_P (clone
)
1448 = DECL_DECLARED_INLINE_P (fn
);
1449 DECL_SOURCE_LOCATION (clone
)
1450 = DECL_SOURCE_LOCATION (fn
);
1451 DECL_DELETED_FN (clone
)
1452 = DECL_DELETED_FN (fn
);
1454 check_specialization_namespace (tmpl
);
1459 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1461 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1462 /* Dup decl failed, but this is a new definition. Set the
1463 line number so any errors match this new
1465 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1471 return duplicate_decls (spec
, fn
, is_friend
);
1473 /* A specialization must be declared in the same namespace as the
1474 template it is specializing. */
1475 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1476 && !check_specialization_namespace (tmpl
))
1477 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1479 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1481 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1482 gcc_assert (tmpl
&& args
&& spec
);
1485 if (TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1486 && PRIMARY_TEMPLATE_P (tmpl
)
1487 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1488 /* TMPL is a forward declaration of a template function; keep a list
1489 of all specializations in case we need to reassign them to a friend
1490 template later in tsubst_friend_function. */
1491 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1492 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1498 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1499 TMPL and ARGS members, ignores SPEC. */
1501 int comparing_specializations
;
1504 eq_specializations (const void *p1
, const void *p2
)
1506 const spec_entry
*e1
= (const spec_entry
*)p1
;
1507 const spec_entry
*e2
= (const spec_entry
*)p2
;
1510 ++comparing_specializations
;
1511 equal
= (e1
->tmpl
== e2
->tmpl
1512 && comp_template_args (e1
->args
, e2
->args
));
1513 --comparing_specializations
;
1518 /* Returns a hash for a template TMPL and template arguments ARGS. */
1521 hash_tmpl_and_args (tree tmpl
, tree args
)
1523 hashval_t val
= DECL_UID (tmpl
);
1524 return iterative_hash_template_arg (args
, val
);
1527 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1531 hash_specialization (const void *p
)
1533 const spec_entry
*e
= (const spec_entry
*)p
;
1534 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1537 /* Recursively calculate a hash value for a template argument ARG, for use
1538 in the hash tables of template specializations. */
1541 iterative_hash_template_arg (tree arg
, hashval_t val
)
1543 unsigned HOST_WIDE_INT i
;
1544 enum tree_code code
;
1547 if (arg
== NULL_TREE
)
1548 return iterative_hash_object (arg
, val
);
1553 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1554 /* We can get one of these when re-hashing a previous entry in the middle
1555 of substituting into a pack expansion. Just look through it. */
1556 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1558 code
= TREE_CODE (arg
);
1559 tclass
= TREE_CODE_CLASS (code
);
1561 val
= iterative_hash_object (code
, val
);
1568 case IDENTIFIER_NODE
:
1569 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1573 int i
, len
= TREE_VEC_LENGTH (arg
);
1574 for (i
= 0; i
< len
; ++i
)
1575 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1579 case TYPE_PACK_EXPANSION
:
1580 case EXPR_PACK_EXPANSION
:
1581 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1582 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1584 case TYPE_ARGUMENT_PACK
:
1585 case NONTYPE_ARGUMENT_PACK
:
1586 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1589 for (; arg
; arg
= TREE_CHAIN (arg
))
1590 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1594 for (; arg
; arg
= OVL_NEXT (arg
))
1595 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1601 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1603 val
= iterative_hash_template_arg (field
, val
);
1604 val
= iterative_hash_template_arg (value
, val
);
1610 if (!DECL_ARTIFICIAL (arg
))
1612 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1613 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1615 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1618 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1621 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1622 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1624 case TEMPLATE_PARM_INDEX
:
1625 val
= iterative_hash_template_arg
1626 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1627 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1628 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1631 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1632 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1633 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1636 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1638 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1642 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1643 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1644 val
= iterative_hash_object (code
, val
);
1645 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1648 /* A lambda can't appear in a template arg, but don't crash on
1650 gcc_assert (seen_error ());
1654 case IMPLICIT_CONV_EXPR
:
1655 case STATIC_CAST_EXPR
:
1656 case REINTERPRET_CAST_EXPR
:
1657 case CONST_CAST_EXPR
:
1658 case DYNAMIC_CAST_EXPR
:
1660 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1661 /* Now hash operands as usual. */
1671 if (TYPE_CANONICAL (arg
))
1672 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1674 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1675 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1676 /* Otherwise just compare the types during lookup. */
1679 case tcc_declaration
:
1681 return iterative_hash_expr (arg
, val
);
1684 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1686 unsigned n
= cp_tree_operand_length (arg
);
1687 for (i
= 0; i
< n
; ++i
)
1688 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1696 /* Unregister the specialization SPEC as a specialization of TMPL.
1697 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1698 if the SPEC was listed as a specialization of TMPL.
1700 Note that SPEC has been ggc_freed, so we can't look inside it. */
1703 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1708 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1709 elt
.args
= TI_ARGS (tinfo
);
1710 elt
.spec
= NULL_TREE
;
1712 entry
= (spec_entry
*) htab_find (decl_specializations
, &elt
);
1715 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1716 gcc_assert (new_spec
!= NULL_TREE
);
1717 entry
->spec
= new_spec
;
1724 /* Like register_specialization, but for local declarations. We are
1725 registering SPEC, an instantiation of TMPL. */
1728 register_local_specialization (tree spec
, tree tmpl
)
1730 local_specializations
->put (tmpl
, spec
);
1733 /* TYPE is a class type. Returns true if TYPE is an explicitly
1734 specialized class. */
1737 explicit_class_specialization_p (tree type
)
1739 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1741 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1744 /* Print the list of functions at FNS, going through all the overloads
1745 for each element of the list. Alternatively, FNS can not be a
1746 TREE_LIST, in which case it will be printed together with all the
1749 MORE and *STR should respectively be FALSE and NULL when the function
1750 is called from the outside. They are used internally on recursive
1751 calls. print_candidates manages the two parameters and leaves NULL
1752 in *STR when it ends. */
1755 print_candidates_1 (tree fns
, bool more
, const char **str
)
1758 char *spaces
= NULL
;
1760 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1761 if (TREE_CODE (fn
) == TREE_LIST
)
1763 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1764 print_candidates_1 (TREE_VALUE (fn2
),
1765 TREE_CHAIN (fn2
) || more
, str
);
1769 tree cand
= OVL_CURRENT (fn
);
1772 /* Pick the prefix string. */
1773 if (!more
&& !OVL_NEXT (fns
))
1775 inform (DECL_SOURCE_LOCATION (cand
),
1776 "candidate is: %#D", cand
);
1780 *str
= _("candidates are:");
1781 spaces
= get_spaces (*str
);
1783 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1784 *str
= spaces
? spaces
: *str
;
1794 /* Print the list of candidate FNS in an error message. FNS can also
1795 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1798 print_candidates (tree fns
)
1800 const char *str
= NULL
;
1801 print_candidates_1 (fns
, false, &str
);
1802 gcc_assert (str
== NULL
);
1805 /* Returns the template (one of the functions given by TEMPLATE_ID)
1806 which can be specialized to match the indicated DECL with the
1807 explicit template args given in TEMPLATE_ID. The DECL may be
1808 NULL_TREE if none is available. In that case, the functions in
1809 TEMPLATE_ID are non-members.
1811 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1812 specialization of a member template.
1814 The TEMPLATE_COUNT is the number of references to qualifying
1815 template classes that appeared in the name of the function. See
1816 check_explicit_specialization for a more accurate description.
1818 TSK indicates what kind of template declaration (if any) is being
1819 declared. TSK_TEMPLATE indicates that the declaration given by
1820 DECL, though a FUNCTION_DECL, has template parameters, and is
1821 therefore a template function.
1823 The template args (those explicitly specified and those deduced)
1824 are output in a newly created vector *TARGS_OUT.
1826 If it is impossible to determine the result, an error message is
1827 issued. The error_mark_node is returned to indicate failure. */
1830 determine_specialization (tree template_id
,
1833 int need_member_template
,
1839 tree explicit_targs
;
1840 tree candidates
= NULL_TREE
;
1841 /* A TREE_LIST of templates of which DECL may be a specialization.
1842 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1843 corresponding TREE_PURPOSE is the set of template arguments that,
1844 when used to instantiate the template, would produce a function
1845 with the signature of DECL. */
1846 tree templates
= NULL_TREE
;
1848 cp_binding_level
*b
;
1850 *targs_out
= NULL_TREE
;
1852 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1853 return error_mark_node
;
1855 /* We shouldn't be specializing a member template of an
1856 unspecialized class template; we already gave an error in
1857 check_specialization_scope, now avoid crashing. */
1858 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
1859 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
1861 gcc_assert (errorcount
);
1862 return error_mark_node
;
1865 fns
= TREE_OPERAND (template_id
, 0);
1866 explicit_targs
= TREE_OPERAND (template_id
, 1);
1868 if (fns
== error_mark_node
)
1869 return error_mark_node
;
1871 /* Check for baselinks. */
1872 if (BASELINK_P (fns
))
1873 fns
= BASELINK_FUNCTIONS (fns
);
1875 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
1877 error ("%qD is not a function template", fns
);
1878 return error_mark_node
;
1880 else if (VAR_P (decl
) && !variable_template_p (fns
))
1882 error ("%qD is not a variable template", fns
);
1883 return error_mark_node
;
1886 /* Count the number of template headers specified for this
1889 for (b
= current_binding_level
;
1890 b
->kind
== sk_template_parms
;
1894 if (variable_template_p (fns
))
1895 templates
= tree_cons (explicit_targs
, fns
, templates
);
1896 else for (; fns
; fns
= OVL_NEXT (fns
))
1898 tree fn
= OVL_CURRENT (fns
);
1900 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1902 tree decl_arg_types
;
1906 /* In case of explicit specialization, we need to check if
1907 the number of template headers appearing in the specialization
1908 is correct. This is usually done in check_explicit_specialization,
1909 but the check done there cannot be exhaustive when specializing
1910 member functions. Consider the following code:
1912 template <> void A<int>::f(int);
1913 template <> template <> void A<int>::f(int);
1915 Assuming that A<int> is not itself an explicit specialization
1916 already, the first line specializes "f" which is a non-template
1917 member function, whilst the second line specializes "f" which
1918 is a template member function. So both lines are syntactically
1919 correct, and check_explicit_specialization does not reject
1922 Here, we can do better, as we are matching the specialization
1923 against the declarations. We count the number of template
1924 headers, and we check if they match TEMPLATE_COUNT + 1
1925 (TEMPLATE_COUNT is the number of qualifying template classes,
1926 plus there must be another header for the member template
1929 Notice that if header_count is zero, this is not a
1930 specialization but rather a template instantiation, so there
1931 is no check we can perform here. */
1932 if (header_count
&& header_count
!= template_count
+ 1)
1935 /* Check that the number of template arguments at the
1936 innermost level for DECL is the same as for FN. */
1937 if (current_binding_level
->kind
== sk_template_parms
1938 && !current_binding_level
->explicit_spec_p
1939 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1940 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1941 (current_template_parms
))))
1944 /* DECL might be a specialization of FN. */
1945 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1946 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1948 /* For a non-static member function, we need to make sure
1949 that the const qualification is the same. Since
1950 get_bindings does not try to merge the "this" parameter,
1951 we must do the comparison explicitly. */
1952 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1953 && !same_type_p (TREE_VALUE (fn_arg_types
),
1954 TREE_VALUE (decl_arg_types
)))
1957 /* Skip the "this" parameter and, for constructors of
1958 classes with virtual bases, the VTT parameter. A
1959 full specialization of a constructor will have a VTT
1960 parameter, but a template never will. */
1962 = skip_artificial_parms_for (decl
, decl_arg_types
);
1964 = skip_artificial_parms_for (fn
, fn_arg_types
);
1966 /* Function templates cannot be specializations; there are
1967 no partial specializations of functions. Therefore, if
1968 the type of DECL does not match FN, there is no
1970 if (tsk
== tsk_template
)
1972 if (compparms (fn_arg_types
, decl_arg_types
))
1973 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1977 /* See whether this function might be a specialization of this
1978 template. Suppress access control because we might be trying
1979 to make this specialization a friend, and we have already done
1980 access control for the declaration of the specialization. */
1981 push_deferring_access_checks (dk_no_check
);
1982 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1983 pop_deferring_access_checks ();
1986 /* We cannot deduce template arguments that when used to
1987 specialize TMPL will produce DECL. */
1990 /* Make sure that the deduced arguments actually work. */
1991 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
1992 if (insttype
== error_mark_node
)
1995 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
1996 if (!compparms (fn_arg_types
, decl_arg_types
))
1999 /* Save this template, and the arguments deduced. */
2000 templates
= tree_cons (targs
, fn
, templates
);
2002 else if (need_member_template
)
2003 /* FN is an ordinary member function, and we need a
2004 specialization of a member template. */
2006 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2007 /* We can get IDENTIFIER_NODEs here in certain erroneous
2010 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2011 /* This is just an ordinary non-member function. Nothing can
2012 be a specialization of that. */
2014 else if (DECL_ARTIFICIAL (fn
))
2015 /* Cannot specialize functions that are created implicitly. */
2019 tree decl_arg_types
;
2021 /* This is an ordinary member function. However, since
2022 we're here, we can assume its enclosing class is a
2023 template class. For example,
2025 template <typename T> struct S { void f(); };
2026 template <> void S<int>::f() {}
2028 Here, S<int>::f is a non-template, but S<int> is a
2029 template class. If FN has the same type as DECL, we
2030 might be in business. */
2032 if (!DECL_TEMPLATE_INFO (fn
))
2033 /* Its enclosing class is an explicit specialization
2034 of a template class. This is not a candidate. */
2037 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2038 TREE_TYPE (TREE_TYPE (fn
))))
2039 /* The return types differ. */
2042 /* Adjust the type of DECL in case FN is a static member. */
2043 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2044 if (DECL_STATIC_FUNCTION_P (fn
)
2045 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2046 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2048 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2051 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2055 if (templates
&& TREE_CHAIN (templates
))
2061 It is possible for a specialization with a given function
2062 signature to be instantiated from more than one function
2063 template. In such cases, explicit specification of the
2064 template arguments must be used to uniquely identify the
2065 function template specialization being specialized.
2067 Note that here, there's no suggestion that we're supposed to
2068 determine which of the candidate templates is most
2069 specialized. However, we, also have:
2073 Partial ordering of overloaded function template
2074 declarations is used in the following contexts to select
2075 the function template to which a function template
2076 specialization refers:
2078 -- when an explicit specialization refers to a function
2081 So, we do use the partial ordering rules, at least for now.
2082 This extension can only serve to make invalid programs valid,
2083 so it's safe. And, there is strong anecdotal evidence that
2084 the committee intended the partial ordering rules to apply;
2085 the EDG front end has that behavior, and John Spicer claims
2086 that the committee simply forgot to delete the wording in
2087 [temp.expl.spec]. */
2088 tree tmpl
= most_specialized_instantiation (templates
);
2089 if (tmpl
!= error_mark_node
)
2092 TREE_CHAIN (templates
) = NULL_TREE
;
2096 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2098 error ("template-id %qD for %q+D does not match any template "
2099 "declaration", template_id
, decl
);
2100 if (header_count
&& header_count
!= template_count
+ 1)
2101 inform (input_location
, "saw %d %<template<>%>, need %d for "
2102 "specializing a member function template",
2103 header_count
, template_count
+ 1);
2104 return error_mark_node
;
2106 else if ((templates
&& TREE_CHAIN (templates
))
2107 || (candidates
&& TREE_CHAIN (candidates
))
2108 || (templates
&& candidates
))
2110 error ("ambiguous template specialization %qD for %q+D",
2112 candidates
= chainon (candidates
, templates
);
2113 print_candidates (candidates
);
2114 return error_mark_node
;
2117 /* We have one, and exactly one, match. */
2120 tree fn
= TREE_VALUE (candidates
);
2121 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2122 /* DECL is a re-declaration or partial instantiation of a template
2124 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2126 /* It was a specialization of an ordinary member function in a
2128 return DECL_TI_TEMPLATE (fn
);
2131 /* It was a specialization of a template. */
2132 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2133 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2135 *targs_out
= copy_node (targs
);
2136 SET_TMPL_ARGS_LEVEL (*targs_out
,
2137 TMPL_ARGS_DEPTH (*targs_out
),
2138 TREE_PURPOSE (templates
));
2141 *targs_out
= TREE_PURPOSE (templates
);
2142 return TREE_VALUE (templates
);
2145 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2146 but with the default argument values filled in from those in the
2150 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2153 tree new_spec_types
;
2158 if (spec_types
== void_list_node
)
2159 return void_list_node
;
2161 /* Substitute into the rest of the list. */
2163 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2164 TREE_CHAIN (tmpl_types
));
2166 /* Add the default argument for this parameter. */
2167 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2168 TREE_VALUE (spec_types
),
2172 /* DECL is an explicit specialization. Replicate default arguments
2173 from the template it specializes. (That way, code like:
2175 template <class T> void f(T = 3);
2176 template <> void f(double);
2179 works, as required.) An alternative approach would be to look up
2180 the correct default arguments at the call-site, but this approach
2181 is consistent with how implicit instantiations are handled. */
2184 copy_default_args_to_explicit_spec (tree decl
)
2189 tree new_spec_types
;
2193 tree object_type
= NULL_TREE
;
2194 tree in_charge
= NULL_TREE
;
2195 tree vtt
= NULL_TREE
;
2197 /* See if there's anything we need to do. */
2198 tmpl
= DECL_TI_TEMPLATE (decl
);
2199 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2200 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2201 if (TREE_PURPOSE (t
))
2206 old_type
= TREE_TYPE (decl
);
2207 spec_types
= TYPE_ARG_TYPES (old_type
);
2209 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2211 /* Remove the this pointer, but remember the object's type for
2213 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2214 spec_types
= TREE_CHAIN (spec_types
);
2215 tmpl_types
= TREE_CHAIN (tmpl_types
);
2217 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2219 /* DECL may contain more parameters than TMPL due to the extra
2220 in-charge parameter in constructors and destructors. */
2221 in_charge
= spec_types
;
2222 spec_types
= TREE_CHAIN (spec_types
);
2224 if (DECL_HAS_VTT_PARM_P (decl
))
2227 spec_types
= TREE_CHAIN (spec_types
);
2231 /* Compute the merged default arguments. */
2233 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2235 /* Compute the new FUNCTION_TYPE. */
2239 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2244 /* Put the in-charge parameter back. */
2245 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2246 TREE_VALUE (in_charge
),
2249 new_type
= build_method_type_directly (object_type
,
2250 TREE_TYPE (old_type
),
2254 new_type
= build_function_type (TREE_TYPE (old_type
),
2256 new_type
= cp_build_type_attribute_variant (new_type
,
2257 TYPE_ATTRIBUTES (old_type
));
2258 new_type
= build_exception_variant (new_type
,
2259 TYPE_RAISES_EXCEPTIONS (old_type
));
2261 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2262 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2264 TREE_TYPE (decl
) = new_type
;
2267 /* Return the number of template headers we expect to see for a definition
2268 or specialization of CTYPE or one of its non-template members. */
2271 num_template_headers_for_class (tree ctype
)
2273 int num_templates
= 0;
2275 while (ctype
&& CLASS_TYPE_P (ctype
))
2277 /* You're supposed to have one `template <...>' for every
2278 template class, but you don't need one for a full
2279 specialization. For example:
2281 template <class T> struct S{};
2282 template <> struct S<int> { void f(); };
2283 void S<int>::f () {}
2285 is correct; there shouldn't be a `template <>' for the
2286 definition of `S<int>::f'. */
2287 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2288 /* If CTYPE does not have template information of any
2289 kind, then it is not a template, nor is it nested
2290 within a template. */
2292 if (explicit_class_specialization_p (ctype
))
2294 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2297 ctype
= TYPE_CONTEXT (ctype
);
2300 return num_templates
;
2303 /* Do a simple sanity check on the template headers that precede the
2304 variable declaration DECL. */
2307 check_template_variable (tree decl
)
2309 tree ctx
= CP_DECL_CONTEXT (decl
);
2310 int wanted
= num_template_headers_for_class (ctx
);
2311 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2312 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2314 if (cxx_dialect
< cxx14
)
2315 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2316 "variable templates only available with "
2317 "-std=c++14 or -std=gnu++14");
2319 // Namespace-scope variable templates should have a template header.
2322 if (template_header_count
> wanted
)
2324 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2325 "too many template headers for %D (should be %d)",
2327 if (warned
&& CLASS_TYPE_P (ctx
)
2328 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2329 inform (DECL_SOURCE_LOCATION (decl
),
2330 "members of an explicitly specialized class are defined "
2331 "without a template header");
2335 /* Check to see if the function just declared, as indicated in
2336 DECLARATOR, and in DECL, is a specialization of a function
2337 template. We may also discover that the declaration is an explicit
2338 instantiation at this point.
2340 Returns DECL, or an equivalent declaration that should be used
2341 instead if all goes well. Issues an error message if something is
2342 amiss. Returns error_mark_node if the error is not easily
2345 FLAGS is a bitmask consisting of the following flags:
2347 2: The function has a definition.
2348 4: The function is a friend.
2350 The TEMPLATE_COUNT is the number of references to qualifying
2351 template classes that appeared in the name of the function. For
2354 template <class T> struct S { void f(); };
2357 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2358 classes are not counted in the TEMPLATE_COUNT, so that in
2360 template <class T> struct S {};
2361 template <> struct S<int> { void f(); }
2362 template <> void S<int>::f();
2364 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2365 invalid; there should be no template <>.)
2367 If the function is a specialization, it is marked as such via
2368 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2369 is set up correctly, and it is added to the list of specializations
2370 for that template. */
2373 check_explicit_specialization (tree declarator
,
2378 int have_def
= flags
& 2;
2379 int is_friend
= flags
& 4;
2380 int specialization
= 0;
2381 int explicit_instantiation
= 0;
2382 int member_specialization
= 0;
2383 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2384 tree dname
= DECL_NAME (decl
);
2389 if (!processing_specialization
)
2392 tsk
= tsk_excessive_parms
;
2395 tsk
= current_tmpl_spec_kind (template_count
);
2400 if (processing_specialization
)
2403 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2405 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2408 /* This could be something like:
2410 template <class T> void f(T);
2411 class S { friend void f<>(int); } */
2415 /* This case handles bogus declarations like template <>
2416 template <class T> void f<int>(); */
2418 error ("template-id %qD in declaration of primary template",
2425 case tsk_invalid_member_spec
:
2426 /* The error has already been reported in
2427 check_specialization_scope. */
2428 return error_mark_node
;
2430 case tsk_invalid_expl_inst
:
2431 error ("template parameter list used in explicit instantiation");
2437 error ("definition provided for explicit instantiation");
2439 explicit_instantiation
= 1;
2442 case tsk_excessive_parms
:
2443 case tsk_insufficient_parms
:
2444 if (tsk
== tsk_excessive_parms
)
2445 error ("too many template parameter lists in declaration of %qD",
2447 else if (template_header_count
)
2448 error("too few template parameter lists in declaration of %qD", decl
);
2450 error("explicit specialization of %qD must be introduced by "
2451 "%<template <>%>", decl
);
2455 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2456 /* In cases like template<> constexpr bool v = true;
2457 We'll give an error in check_template_variable. */
2460 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2462 member_specialization
= 1;
2468 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2470 /* This case handles bogus declarations like template <>
2471 template <class T> void f<int>(); */
2473 if (uses_template_parms (declarator
))
2474 error ("non-type partial specialization %qD "
2475 "is not allowed", declarator
);
2477 error ("template-id %qD in declaration of primary template",
2482 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2483 /* This is a specialization of a member template, without
2484 specialization the containing class. Something like:
2486 template <class T> struct S {
2487 template <class U> void f (U);
2489 template <> template <class U> void S<int>::f(U) {}
2491 That's a specialization -- but of the entire template. */
2499 if ((specialization
|| member_specialization
)
2500 /* This doesn't apply to variable templates. */
2501 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2502 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2504 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2505 for (; t
; t
= TREE_CHAIN (t
))
2506 if (TREE_PURPOSE (t
))
2508 permerror (input_location
,
2509 "default argument specified in explicit specialization");
2514 if (specialization
|| member_specialization
|| explicit_instantiation
)
2516 tree tmpl
= NULL_TREE
;
2517 tree targs
= NULL_TREE
;
2519 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2520 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2524 gcc_assert (identifier_p (declarator
));
2529 /* If there is no class context, the explicit instantiation
2530 must be at namespace scope. */
2531 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2533 /* Find the namespace binding, using the declaration
2535 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2537 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2539 error ("%qD is not a template function", dname
);
2540 fns
= error_mark_node
;
2544 tree fn
= OVL_CURRENT (fns
);
2545 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2546 CP_DECL_CONTEXT (fn
)))
2547 error ("%qD is not declared in %qD",
2548 decl
, current_namespace
);
2552 declarator
= lookup_template_function (fns
, NULL_TREE
);
2555 if (declarator
== error_mark_node
)
2556 return error_mark_node
;
2558 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2560 if (!explicit_instantiation
)
2561 /* A specialization in class scope. This is invalid,
2562 but the error will already have been flagged by
2563 check_specialization_scope. */
2564 return error_mark_node
;
2567 /* It's not valid to write an explicit instantiation in
2570 class C { template void f(); }
2572 This case is caught by the parser. However, on
2575 template class C { void f(); };
2577 (which is invalid) we can get here. The error will be
2584 else if (ctype
!= NULL_TREE
2585 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2587 // Ignore variable templates.
2591 /* Find the list of functions in ctype that have the same
2592 name as the declared function. */
2593 tree name
= TREE_OPERAND (declarator
, 0);
2594 tree fns
= NULL_TREE
;
2597 if (constructor_name_p (name
, ctype
))
2599 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2601 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2602 : !CLASSTYPE_DESTRUCTORS (ctype
))
2604 /* From [temp.expl.spec]:
2606 If such an explicit specialization for the member
2607 of a class template names an implicitly-declared
2608 special member function (clause _special_), the
2609 program is ill-formed.
2611 Similar language is found in [temp.explicit]. */
2612 error ("specialization of implicitly-declared special member function");
2613 return error_mark_node
;
2616 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2619 if (!DECL_CONV_FN_P (decl
))
2621 idx
= lookup_fnfields_1 (ctype
, name
);
2623 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2627 vec
<tree
, va_gc
> *methods
;
2630 /* For a type-conversion operator, we cannot do a
2631 name-based lookup. We might be looking for `operator
2632 int' which will be a specialization of `operator T'.
2633 So, we find *all* the conversion operators, and then
2634 select from them. */
2637 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2639 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2640 methods
->iterate (idx
, &ovl
);
2643 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2644 /* There are no more conversion functions. */
2647 /* Glue all these conversion functions together
2648 with those we already have. */
2649 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2650 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2654 if (fns
== NULL_TREE
)
2656 error ("no member function %qD declared in %qT", name
, ctype
);
2657 return error_mark_node
;
2660 TREE_OPERAND (declarator
, 0) = fns
;
2663 /* Figure out what exactly is being specialized at this point.
2664 Note that for an explicit instantiation, even one for a
2665 member function, we cannot tell apriori whether the
2666 instantiation is for a member template, or just a member
2667 function of a template class. Even if a member template is
2668 being instantiated, the member template arguments may be
2669 elided if they can be deduced from the rest of the
2671 tmpl
= determine_specialization (declarator
, decl
,
2673 member_specialization
,
2677 if (!tmpl
|| tmpl
== error_mark_node
)
2678 /* We couldn't figure out what this declaration was
2680 return error_mark_node
;
2683 tree gen_tmpl
= most_general_template (tmpl
);
2685 if (explicit_instantiation
)
2687 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2688 is done by do_decl_instantiation later. */
2690 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2691 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2693 if (arg_depth
> parm_depth
)
2695 /* If TMPL is not the most general template (for
2696 example, if TMPL is a friend template that is
2697 injected into namespace scope), then there will
2698 be too many levels of TARGS. Remove some of them
2703 new_targs
= make_tree_vec (parm_depth
);
2704 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2705 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2706 = TREE_VEC_ELT (targs
, i
);
2710 return instantiate_template (tmpl
, targs
, tf_error
);
2713 /* If we thought that the DECL was a member function, but it
2714 turns out to be specializing a static member function,
2715 make DECL a static member function as well. */
2716 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2717 && DECL_STATIC_FUNCTION_P (tmpl
)
2718 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2719 revert_static_member_fn (decl
);
2721 /* If this is a specialization of a member template of a
2722 template class, we want to return the TEMPLATE_DECL, not
2723 the specialization of it. */
2724 if (tsk
== tsk_template
)
2726 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2727 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2728 DECL_INITIAL (result
) = NULL_TREE
;
2732 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2733 DECL_SOURCE_LOCATION (result
)
2734 = DECL_SOURCE_LOCATION (decl
);
2735 /* We want to use the argument list specified in the
2736 definition, not in the original declaration. */
2737 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2738 for (parm
= DECL_ARGUMENTS (result
); parm
;
2739 parm
= DECL_CHAIN (parm
))
2740 DECL_CONTEXT (parm
) = result
;
2742 return register_specialization (tmpl
, gen_tmpl
, targs
,
2746 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2747 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2749 /* Inherit default function arguments from the template
2750 DECL is specializing. */
2751 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2752 copy_default_args_to_explicit_spec (decl
);
2754 /* This specialization has the same protection as the
2755 template it specializes. */
2756 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2757 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2759 /* 7.1.1-1 [dcl.stc]
2761 A storage-class-specifier shall not be specified in an
2762 explicit specialization...
2764 The parser rejects these, so unless action is taken here,
2765 explicit function specializations will always appear with
2768 The action recommended by the C++ CWG in response to C++
2769 defect report 605 is to make the storage class and linkage
2770 of the explicit specialization match the templated function:
2772 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2774 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2776 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2777 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2779 /* This specialization has the same linkage and visibility as
2780 the function template it specializes. */
2781 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2782 if (! TREE_PUBLIC (decl
))
2784 DECL_INTERFACE_KNOWN (decl
) = 1;
2785 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2787 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2788 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2790 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2791 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2795 /* If DECL is a friend declaration, declared using an
2796 unqualified name, the namespace associated with DECL may
2797 have been set incorrectly. For example, in:
2799 template <typename T> void f(T);
2801 struct S { friend void f<int>(int); }
2804 we will have set the DECL_CONTEXT for the friend
2805 declaration to N, rather than to the global namespace. */
2806 if (DECL_NAMESPACE_SCOPE_P (decl
))
2807 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2809 if (is_friend
&& !have_def
)
2810 /* This is not really a declaration of a specialization.
2811 It's just the name of an instantiation. But, it's not
2812 a request for an instantiation, either. */
2813 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2814 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
2815 /* A specialization is not necessarily COMDAT. */
2816 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
2817 && DECL_DECLARED_INLINE_P (decl
));
2818 else if (TREE_CODE (decl
) == VAR_DECL
)
2819 DECL_COMDAT (decl
) = false;
2821 /* Register this specialization so that we can find it
2823 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2825 /* A 'structor should already have clones. */
2826 gcc_assert (decl
== error_mark_node
2827 || variable_template_p (tmpl
)
2828 || !(DECL_CONSTRUCTOR_P (decl
)
2829 || DECL_DESTRUCTOR_P (decl
))
2830 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
2837 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2838 parameters. These are represented in the same format used for
2839 DECL_TEMPLATE_PARMS. */
2842 comp_template_parms (const_tree parms1
, const_tree parms2
)
2847 if (parms1
== parms2
)
2850 for (p1
= parms1
, p2
= parms2
;
2851 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2852 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2854 tree t1
= TREE_VALUE (p1
);
2855 tree t2
= TREE_VALUE (p2
);
2858 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2859 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2861 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2864 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2866 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2867 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2869 /* If either of the template parameters are invalid, assume
2870 they match for the sake of error recovery. */
2871 if (error_operand_p (parm1
) || error_operand_p (parm2
))
2874 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2877 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2878 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2879 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2881 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2886 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2887 /* One set of parameters has more parameters lists than the
2894 /* Determine whether PARM is a parameter pack. */
2897 template_parameter_pack_p (const_tree parm
)
2899 /* Determine if we have a non-type template parameter pack. */
2900 if (TREE_CODE (parm
) == PARM_DECL
)
2901 return (DECL_TEMPLATE_PARM_P (parm
)
2902 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2903 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2904 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2906 /* If this is a list of template parameters, we could get a
2907 TYPE_DECL or a TEMPLATE_DECL. */
2908 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2909 parm
= TREE_TYPE (parm
);
2911 /* Otherwise it must be a type template parameter. */
2912 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2913 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2914 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2917 /* Determine if T is a function parameter pack. */
2920 function_parameter_pack_p (const_tree t
)
2922 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2923 return DECL_PACK_P (t
);
2927 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2928 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2931 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2933 if (! primary_func_tmpl_inst
2934 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2935 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2938 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2941 /* Return true iff the function parameter PARAM_DECL was expanded
2942 from the function parameter pack PACK. */
2945 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2947 if (DECL_ARTIFICIAL (param_decl
)
2948 || !function_parameter_pack_p (pack
))
2951 /* The parameter pack and its pack arguments have the same
2953 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2956 /* Determine whether ARGS describes a variadic template args list,
2957 i.e., one that is terminated by a template argument pack. */
2960 template_args_variadic_p (tree args
)
2965 if (args
== NULL_TREE
)
2968 args
= INNERMOST_TEMPLATE_ARGS (args
);
2969 nargs
= TREE_VEC_LENGTH (args
);
2974 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2976 return ARGUMENT_PACK_P (last_parm
);
2979 /* Generate a new name for the parameter pack name NAME (an
2980 IDENTIFIER_NODE) that incorporates its */
2983 make_ith_pack_parameter_name (tree name
, int i
)
2985 /* Munge the name to include the parameter index. */
2986 #define NUMBUF_LEN 128
2987 char numbuf
[NUMBUF_LEN
];
2991 if (name
== NULL_TREE
)
2993 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2994 newname_len
= IDENTIFIER_LENGTH (name
)
2995 + strlen (numbuf
) + 2;
2996 newname
= (char*)alloca (newname_len
);
2997 snprintf (newname
, newname_len
,
2998 "%s#%i", IDENTIFIER_POINTER (name
), i
);
2999 return get_identifier (newname
);
3002 /* Return true if T is a primary function, class or alias template
3006 primary_template_instantiation_p (const_tree t
)
3011 if (TREE_CODE (t
) == FUNCTION_DECL
)
3012 return DECL_LANG_SPECIFIC (t
)
3013 && DECL_TEMPLATE_INSTANTIATION (t
)
3014 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3015 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3016 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3017 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3018 else if (alias_template_specialization_p (t
))
3023 /* Return true if PARM is a template template parameter. */
3026 template_template_parameter_p (const_tree parm
)
3028 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3031 /* Return true iff PARM is a DECL representing a type template
3035 template_type_parameter_p (const_tree parm
)
3038 && (TREE_CODE (parm
) == TYPE_DECL
3039 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3040 && DECL_TEMPLATE_PARM_P (parm
));
3043 /* Return the template parameters of T if T is a
3044 primary template instantiation, NULL otherwise. */
3047 get_primary_template_innermost_parameters (const_tree t
)
3049 tree parms
= NULL
, template_info
= NULL
;
3051 if ((template_info
= get_template_info (t
))
3052 && primary_template_instantiation_p (t
))
3053 parms
= INNERMOST_TEMPLATE_PARMS
3054 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3059 /* Return the template parameters of the LEVELth level from the full list
3060 of template parameters PARMS. */
3063 get_template_parms_at_level (tree parms
, int level
)
3067 || TREE_CODE (parms
) != TREE_LIST
3068 || level
> TMPL_PARMS_DEPTH (parms
))
3071 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3072 if (TMPL_PARMS_DEPTH (p
) == level
)
3078 /* Returns the template arguments of T if T is a template instantiation,
3082 get_template_innermost_arguments (const_tree t
)
3084 tree args
= NULL
, template_info
= NULL
;
3086 if ((template_info
= get_template_info (t
))
3087 && TI_ARGS (template_info
))
3088 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3093 /* Return the argument pack elements of T if T is a template argument pack,
3097 get_template_argument_pack_elems (const_tree t
)
3099 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3100 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3103 return ARGUMENT_PACK_ARGS (t
);
3106 /* Structure used to track the progress of find_parameter_packs_r. */
3107 struct find_parameter_pack_data
3109 /* TREE_LIST that will contain all of the parameter packs found by
3111 tree
* parameter_packs
;
3113 /* Set of AST nodes that have been visited by the traversal. */
3114 hash_set
<tree
> *visited
;
3117 /* Identifies all of the argument packs that occur in a template
3118 argument and appends them to the TREE_LIST inside DATA, which is a
3119 find_parameter_pack_data structure. This is a subroutine of
3120 make_pack_expansion and uses_parameter_packs. */
3122 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3125 struct find_parameter_pack_data
* ppd
=
3126 (struct find_parameter_pack_data
*)data
;
3127 bool parameter_pack_p
= false;
3129 /* Handle type aliases/typedefs. */
3130 if (TYPE_ALIAS_P (t
))
3132 if (TYPE_TEMPLATE_INFO (t
))
3133 cp_walk_tree (&TYPE_TI_ARGS (t
),
3134 &find_parameter_packs_r
,
3140 /* Identify whether this is a parameter pack or not. */
3141 switch (TREE_CODE (t
))
3143 case TEMPLATE_PARM_INDEX
:
3144 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3145 parameter_pack_p
= true;
3148 case TEMPLATE_TYPE_PARM
:
3149 t
= TYPE_MAIN_VARIANT (t
);
3150 case TEMPLATE_TEMPLATE_PARM
:
3151 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3152 parameter_pack_p
= true;
3157 if (DECL_PACK_P (t
))
3159 /* We don't want to walk into the type of a PARM_DECL,
3160 because we don't want to see the type parameter pack. */
3162 parameter_pack_p
= true;
3166 /* Look through a lambda capture proxy to the field pack. */
3168 if (DECL_HAS_VALUE_EXPR_P (t
))
3170 tree v
= DECL_VALUE_EXPR (t
);
3172 &find_parameter_packs_r
,
3179 parameter_pack_p
= true;
3182 /* Not a parameter pack. */
3186 if (parameter_pack_p
)
3188 /* Add this parameter pack to the list. */
3189 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3193 cp_walk_tree (&TYPE_CONTEXT (t
),
3194 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3196 /* This switch statement will return immediately if we don't find a
3198 switch (TREE_CODE (t
))
3200 case TEMPLATE_PARM_INDEX
:
3203 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3204 /* Check the template itself. */
3205 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3206 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3207 /* Check the template arguments. */
3208 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3213 case TEMPLATE_TYPE_PARM
:
3214 case TEMPLATE_TEMPLATE_PARM
:
3221 if (TYPE_PTRMEMFUNC_P (t
))
3227 if (TYPE_TEMPLATE_INFO (t
))
3228 cp_walk_tree (&TYPE_TI_ARGS (t
),
3229 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3236 cp_walk_tree (&TREE_TYPE (t
),
3237 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3241 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3246 case TYPE_PACK_EXPANSION
:
3247 case EXPR_PACK_EXPANSION
:
3252 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3257 case IDENTIFIER_NODE
:
3258 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3270 /* Determines if the expression or type T uses any parameter packs. */
3272 uses_parameter_packs (tree t
)
3274 tree parameter_packs
= NULL_TREE
;
3275 struct find_parameter_pack_data ppd
;
3276 ppd
.parameter_packs
= ¶meter_packs
;
3277 ppd
.visited
= new hash_set
<tree
>;
3278 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3280 return parameter_packs
!= NULL_TREE
;
3283 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3284 representation a base-class initializer into a parameter pack
3285 expansion. If all goes well, the resulting node will be an
3286 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3289 make_pack_expansion (tree arg
)
3292 tree parameter_packs
= NULL_TREE
;
3293 bool for_types
= false;
3294 struct find_parameter_pack_data ppd
;
3296 if (!arg
|| arg
== error_mark_node
)
3299 if (TREE_CODE (arg
) == TREE_LIST
)
3301 /* The only time we will see a TREE_LIST here is for a base
3302 class initializer. In this case, the TREE_PURPOSE will be a
3303 _TYPE node (representing the base class expansion we're
3304 initializing) and the TREE_VALUE will be a TREE_LIST
3305 containing the initialization arguments.
3307 The resulting expansion looks somewhat different from most
3308 expansions. Rather than returning just one _EXPANSION, we
3309 return a TREE_LIST whose TREE_PURPOSE is a
3310 TYPE_PACK_EXPANSION containing the bases that will be
3311 initialized. The TREE_VALUE will be identical to the
3312 original TREE_VALUE, which is a list of arguments that will
3313 be passed to each base. We do not introduce any new pack
3314 expansion nodes into the TREE_VALUE (although it is possible
3315 that some already exist), because the TREE_PURPOSE and
3316 TREE_VALUE all need to be expanded together with the same
3317 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3318 resulting TREE_PURPOSE will mention the parameter packs in
3319 both the bases and the arguments to the bases. */
3322 tree parameter_packs
= NULL_TREE
;
3324 /* Determine which parameter packs will be used by the base
3326 ppd
.visited
= new hash_set
<tree
>;
3327 ppd
.parameter_packs
= ¶meter_packs
;
3328 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3331 if (parameter_packs
== NULL_TREE
)
3333 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3335 return error_mark_node
;
3338 if (TREE_VALUE (arg
) != void_type_node
)
3340 /* Collect the sets of parameter packs used in each of the
3341 initialization arguments. */
3342 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3344 /* Determine which parameter packs will be expanded in this
3346 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3353 /* Create the pack expansion type for the base type. */
3354 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3355 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3356 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3358 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3359 they will rarely be compared to anything. */
3360 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3362 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3365 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3368 /* Build the PACK_EXPANSION_* node. */
3370 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3371 : make_node (EXPR_PACK_EXPANSION
);
3372 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3373 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3375 /* Propagate type and const-expression information. */
3376 TREE_TYPE (result
) = TREE_TYPE (arg
);
3377 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3380 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3381 they will rarely be compared to anything. */
3382 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3384 /* Determine which parameter packs will be expanded. */
3385 ppd
.parameter_packs
= ¶meter_packs
;
3386 ppd
.visited
= new hash_set
<tree
>;
3387 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3390 /* Make sure we found some parameter packs. */
3391 if (parameter_packs
== NULL_TREE
)
3394 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3396 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3397 return error_mark_node
;
3399 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3401 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3406 /* Checks T for any "bare" parameter packs, which have not yet been
3407 expanded, and issues an error if any are found. This operation can
3408 only be done on full expressions or types (e.g., an expression
3409 statement, "if" condition, etc.), because we could have expressions like:
3411 foo(f(g(h(args)))...)
3413 where "args" is a parameter pack. check_for_bare_parameter_packs
3414 should not be called for the subexpressions args, h(args),
3415 g(h(args)), or f(g(h(args))), because we would produce erroneous
3418 Returns TRUE and emits an error if there were bare parameter packs,
3419 returns FALSE otherwise. */
3421 check_for_bare_parameter_packs (tree t
)
3423 tree parameter_packs
= NULL_TREE
;
3424 struct find_parameter_pack_data ppd
;
3426 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3429 if (TREE_CODE (t
) == TYPE_DECL
)
3432 ppd
.parameter_packs
= ¶meter_packs
;
3433 ppd
.visited
= new hash_set
<tree
>;
3434 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3437 if (parameter_packs
)
3439 error ("parameter packs not expanded with %<...%>:");
3440 while (parameter_packs
)
3442 tree pack
= TREE_VALUE (parameter_packs
);
3443 tree name
= NULL_TREE
;
3445 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3446 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3447 name
= TYPE_NAME (pack
);
3448 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3449 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3451 name
= DECL_NAME (pack
);
3454 inform (input_location
, " %qD", name
);
3456 inform (input_location
, " <anonymous>");
3458 parameter_packs
= TREE_CHAIN (parameter_packs
);
3467 /* Expand any parameter packs that occur in the template arguments in
3470 expand_template_argument_pack (tree args
)
3472 tree result_args
= NULL_TREE
;
3473 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3474 int num_result_args
= -1;
3475 int non_default_args_count
= -1;
3477 /* First, determine if we need to expand anything, and the number of
3478 slots we'll need. */
3479 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3481 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3482 if (arg
== NULL_TREE
)
3484 if (ARGUMENT_PACK_P (arg
))
3486 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3487 if (num_result_args
< 0)
3488 num_result_args
= in_arg
+ num_packed
;
3490 num_result_args
+= num_packed
;
3494 if (num_result_args
>= 0)
3499 /* If no expansion is necessary, we're done. */
3500 if (num_result_args
< 0)
3503 /* Expand arguments. */
3504 result_args
= make_tree_vec (num_result_args
);
3505 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3506 non_default_args_count
=
3507 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3508 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3510 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3511 if (ARGUMENT_PACK_P (arg
))
3513 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3514 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3515 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3516 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3517 if (non_default_args_count
> 0)
3518 non_default_args_count
+= num_packed
- 1;
3522 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3526 if (non_default_args_count
>= 0)
3527 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3531 /* Checks if DECL shadows a template parameter.
3533 [temp.local]: A template-parameter shall not be redeclared within its
3534 scope (including nested scopes).
3536 Emits an error and returns TRUE if the DECL shadows a parameter,
3537 returns FALSE otherwise. */
3540 check_template_shadow (tree decl
)
3544 /* If we're not in a template, we can't possibly shadow a template
3546 if (!current_template_parms
)
3549 /* Figure out what we're shadowing. */
3550 if (TREE_CODE (decl
) == OVERLOAD
)
3551 decl
= OVL_CURRENT (decl
);
3552 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3554 /* If there's no previous binding for this name, we're not shadowing
3555 anything, let alone a template parameter. */
3559 /* If we're not shadowing a template parameter, we're done. Note
3560 that OLDDECL might be an OVERLOAD (or perhaps even an
3561 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3563 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3566 /* We check for decl != olddecl to avoid bogus errors for using a
3567 name inside a class. We check TPFI to avoid duplicate errors for
3568 inline member templates. */
3570 || (DECL_TEMPLATE_PARM_P (decl
)
3571 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3574 /* Don't complain about the injected class name, as we've already
3575 complained about the class itself. */
3576 if (DECL_SELF_REFERENCE_P (decl
))
3579 error ("declaration of %q+#D", decl
);
3580 error (" shadows template parm %q+#D", olddecl
);
3584 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3585 ORIG_LEVEL, DECL, and TYPE. */
3588 build_template_parm_index (int index
,
3594 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3595 TEMPLATE_PARM_IDX (t
) = index
;
3596 TEMPLATE_PARM_LEVEL (t
) = level
;
3597 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3598 TEMPLATE_PARM_DECL (t
) = decl
;
3599 TREE_TYPE (t
) = type
;
3600 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3601 TREE_READONLY (t
) = TREE_READONLY (decl
);
3606 /* Find the canonical type parameter for the given template type
3607 parameter. Returns the canonical type parameter, which may be TYPE
3608 if no such parameter existed. */
3611 canonical_type_parameter (tree type
)
3614 int idx
= TEMPLATE_TYPE_IDX (type
);
3615 if (!canonical_template_parms
)
3616 vec_alloc (canonical_template_parms
, idx
+1);
3618 while (canonical_template_parms
->length () <= (unsigned)idx
)
3619 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3621 list
= (*canonical_template_parms
)[idx
];
3622 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3623 list
= TREE_CHAIN (list
);
3626 return TREE_VALUE (list
);
3629 (*canonical_template_parms
)[idx
]
3630 = tree_cons (NULL_TREE
, type
,
3631 (*canonical_template_parms
)[idx
]);
3636 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3637 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3638 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3639 new one is created. */
3642 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3643 tsubst_flags_t complain
)
3645 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3646 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3647 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3648 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3650 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3653 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3654 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3655 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3656 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3657 DECL_ARTIFICIAL (decl
) = 1;
3658 SET_DECL_TEMPLATE_PARM_P (decl
);
3660 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3661 TEMPLATE_PARM_LEVEL (index
) - levels
,
3662 TEMPLATE_PARM_ORIG_LEVEL (index
),
3664 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3665 TEMPLATE_PARM_PARAMETER_PACK (t
)
3666 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3668 /* Template template parameters need this. */
3669 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3670 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3671 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3675 return TEMPLATE_PARM_DESCENDANTS (index
);
3678 /* Process information from new template parameter PARM and append it
3679 to the LIST being built. This new parameter is a non-type
3680 parameter iff IS_NON_TYPE is true. This new parameter is a
3681 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3685 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3686 bool is_non_type
, bool is_parameter_pack
)
3692 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3693 defval
= TREE_PURPOSE (parm
);
3697 tree p
= tree_last (list
);
3699 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3702 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3703 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3705 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3713 parm
= TREE_VALUE (parm
);
3715 SET_DECL_TEMPLATE_PARM_P (parm
);
3717 if (TREE_TYPE (parm
) != error_mark_node
)
3721 The top-level cv-qualifiers on the template-parameter are
3722 ignored when determining its type. */
3723 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3724 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3725 TREE_TYPE (parm
) = error_mark_node
;
3726 else if (uses_parameter_packs (TREE_TYPE (parm
))
3727 && !is_parameter_pack
3728 /* If we're in a nested template parameter list, the template
3729 template parameter could be a parameter pack. */
3730 && processing_template_parmlist
== 1)
3732 /* This template parameter is not a parameter pack, but it
3733 should be. Complain about "bare" parameter packs. */
3734 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3736 /* Recover by calling this a parameter pack. */
3737 is_parameter_pack
= true;
3741 /* A template parameter is not modifiable. */
3742 TREE_CONSTANT (parm
) = 1;
3743 TREE_READONLY (parm
) = 1;
3744 decl
= build_decl (parm_loc
,
3745 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3746 TREE_CONSTANT (decl
) = 1;
3747 TREE_READONLY (decl
) = 1;
3748 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3749 = build_template_parm_index (idx
, processing_template_decl
,
3750 processing_template_decl
,
3751 decl
, TREE_TYPE (parm
));
3753 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3754 = is_parameter_pack
;
3759 parm
= TREE_VALUE (TREE_VALUE (parm
));
3761 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3763 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3764 /* This is for distinguishing between real templates and template
3765 template parameters */
3766 TREE_TYPE (parm
) = t
;
3767 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3772 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3773 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3774 decl
= build_decl (parm_loc
,
3775 TYPE_DECL
, parm
, t
);
3778 TYPE_NAME (t
) = decl
;
3779 TYPE_STUB_DECL (t
) = decl
;
3781 TEMPLATE_TYPE_PARM_INDEX (t
)
3782 = build_template_parm_index (idx
, processing_template_decl
,
3783 processing_template_decl
,
3784 decl
, TREE_TYPE (parm
));
3785 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3786 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3788 DECL_ARTIFICIAL (decl
) = 1;
3789 SET_DECL_TEMPLATE_PARM_P (decl
);
3791 parm
= build_tree_list (defval
, parm
);
3792 return chainon (list
, parm
);
3795 /* The end of a template parameter list has been reached. Process the
3796 tree list into a parameter vector, converting each parameter into a more
3797 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3801 end_template_parm_list (tree parms
)
3805 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3807 current_template_parms
3808 = tree_cons (size_int (processing_template_decl
),
3809 saved_parmlist
, current_template_parms
);
3811 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3813 next
= TREE_CHAIN (parm
);
3814 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3815 TREE_CHAIN (parm
) = NULL_TREE
;
3818 --processing_template_parmlist
;
3820 return saved_parmlist
;
3823 /* end_template_decl is called after a template declaration is seen. */
3826 end_template_decl (void)
3828 reset_specialization ();
3830 if (! processing_template_decl
)
3833 /* This matches the pushlevel in begin_template_parm_list. */
3836 --processing_template_decl
;
3837 current_template_parms
= TREE_CHAIN (current_template_parms
);
3840 /* Takes a TREE_LIST representing a template parameter and convert it
3841 into an argument suitable to be passed to the type substitution
3842 functions. Note that If the TREE_LIST contains an error_mark
3843 node, the returned argument is error_mark_node. */
3846 template_parm_to_arg (tree t
)
3850 || TREE_CODE (t
) != TREE_LIST
)
3853 if (error_operand_p (TREE_VALUE (t
)))
3854 return error_mark_node
;
3858 if (TREE_CODE (t
) == TYPE_DECL
3859 || TREE_CODE (t
) == TEMPLATE_DECL
)
3863 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3865 /* Turn this argument into a TYPE_ARGUMENT_PACK
3866 with a single element, which expands T. */
3867 tree vec
= make_tree_vec (1);
3868 #ifdef ENABLE_CHECKING
3869 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3870 (vec
, TREE_VEC_LENGTH (vec
));
3872 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3874 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3875 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3880 t
= DECL_INITIAL (t
);
3882 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3884 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3885 with a single element, which expands T. */
3886 tree vec
= make_tree_vec (1);
3887 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3888 #ifdef ENABLE_CHECKING
3889 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3890 (vec
, TREE_VEC_LENGTH (vec
));
3892 t
= convert_from_reference (t
);
3893 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3895 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3896 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3897 TREE_TYPE (t
) = type
;
3900 t
= convert_from_reference (t
);
3905 /* Given a set of template parameters, return them as a set of template
3906 arguments. The template parameters are represented as a TREE_VEC, in
3907 the form documented in cp-tree.h for template arguments. */
3910 template_parms_to_args (tree parms
)
3913 tree args
= NULL_TREE
;
3914 int length
= TMPL_PARMS_DEPTH (parms
);
3917 /* If there is only one level of template parameters, we do not
3918 create a TREE_VEC of TREE_VECs. Instead, we return a single
3919 TREE_VEC containing the arguments. */
3921 args
= make_tree_vec (length
);
3923 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3925 tree a
= copy_node (TREE_VALUE (header
));
3928 TREE_TYPE (a
) = NULL_TREE
;
3929 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3930 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3932 #ifdef ENABLE_CHECKING
3933 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3937 TREE_VEC_ELT (args
, --l
) = a
;
3942 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3943 /* This can happen for template parms of a template template
3946 template<template<class T, class U> class TT> struct S;
3948 Consider the level of the parms of TT; T and U both have
3949 level 2; TT has no template parm of level 1. So in this case
3950 the first element of full_template_args is NULL_TREE. If we
3951 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3952 of 2. This will make tsubst wrongly consider that T and U
3953 have level 1. Instead, let's create a dummy vector as the
3954 first element of full_template_args so that TMPL_ARGS_DEPTH
3955 returns the correct depth for args. */
3956 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3960 /* Within the declaration of a template, return the currently active
3961 template parameters as an argument TREE_VEC. */
3964 current_template_args (void)
3966 return template_parms_to_args (current_template_parms
);
3969 /* Update the declared TYPE by doing any lookups which were thought to be
3970 dependent, but are not now that we know the SCOPE of the declarator. */
3973 maybe_update_decl_type (tree orig_type
, tree scope
)
3975 tree type
= orig_type
;
3977 if (type
== NULL_TREE
)
3980 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3981 type
= TREE_TYPE (type
);
3983 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3984 && dependent_type_p (type
)
3985 /* Don't bother building up the args in this case. */
3986 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3988 /* tsubst in the args corresponding to the template parameters,
3989 including auto if present. Most things will be unchanged, but
3990 make_typename_type and tsubst_qualified_id will resolve
3991 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3992 tree args
= current_template_args ();
3993 tree auto_node
= type_uses_auto (type
);
3997 tree auto_vec
= make_tree_vec (1);
3998 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
3999 args
= add_to_template_args (args
, auto_vec
);
4001 pushed
= push_scope (scope
);
4002 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4007 if (type
== error_mark_node
)
4010 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4012 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4015 type
= TYPE_NAME (type
);
4020 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4021 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
4022 a member template. Used by push_template_decl below. */
4025 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4027 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4028 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4029 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4030 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4031 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4036 struct template_parm_data
4038 /* The level of the template parameters we are currently
4042 /* The index of the specialization argument we are currently
4046 /* An array whose size is the number of template parameters. The
4047 elements are nonzero if the parameter has been used in any one
4048 of the arguments processed so far. */
4051 /* An array whose size is the number of template arguments. The
4052 elements are nonzero if the argument makes use of template
4053 parameters of this level. */
4054 int* arg_uses_template_parms
;
4057 /* Subroutine of push_template_decl used to see if each template
4058 parameter in a partial specialization is used in the explicit
4059 argument list. If T is of the LEVEL given in DATA (which is
4060 treated as a template_parm_data*), then DATA->PARMS is marked
4064 mark_template_parm (tree t
, void* data
)
4068 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4070 template_parm_level_and_index (t
, &level
, &idx
);
4072 if (level
== tpd
->level
)
4074 tpd
->parms
[idx
] = 1;
4075 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4078 /* Return zero so that for_each_template_parm will continue the
4079 traversal of the tree; we want to mark *every* template parm. */
4083 /* Process the partial specialization DECL. */
4086 process_partial_specialization (tree decl
)
4088 tree type
= TREE_TYPE (decl
);
4089 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4090 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4091 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4092 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4095 int nargs
= TREE_VEC_LENGTH (inner_args
);
4098 bool did_error_intro
= false;
4099 struct template_parm_data tpd
;
4100 struct template_parm_data tpd2
;
4102 gcc_assert (current_template_parms
);
4104 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4105 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4107 /* We check that each of the template parameters given in the
4108 partial specialization is used in the argument list to the
4109 specialization. For example:
4111 template <class T> struct S;
4112 template <class T> struct S<T*>;
4114 The second declaration is OK because `T*' uses the template
4115 parameter T, whereas
4117 template <class T> struct S<int>;
4119 is no good. Even trickier is:
4130 The S2<T> declaration is actually invalid; it is a
4131 full-specialization. Of course,
4134 struct S2<T (*)(U)>;
4136 or some such would have been OK. */
4137 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4138 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4139 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4141 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4142 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4143 for (i
= 0; i
< nargs
; ++i
)
4145 tpd
.current_arg
= i
;
4146 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4147 &mark_template_parm
,
4150 /*include_nondeduced_p=*/false);
4152 for (i
= 0; i
< ntparms
; ++i
)
4153 if (tpd
.parms
[i
] == 0)
4155 /* One of the template parms was not used in a deduced context in the
4157 if (!did_error_intro
)
4159 error ("template parameters not deducible in "
4160 "partial specialization:");
4161 did_error_intro
= true;
4164 inform (input_location
, " %qD",
4165 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4168 if (did_error_intro
)
4169 return error_mark_node
;
4171 /* [temp.class.spec]
4173 The argument list of the specialization shall not be identical to
4174 the implicit argument list of the primary template. */
4175 if (comp_template_args
4177 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4179 error ("partial specialization %qT does not specialize any template arguments", type
);
4181 /* A partial specialization that replaces multiple parameters of the
4182 primary template with a pack expansion is less specialized for those
4184 if (nargs
< DECL_NTPARMS (maintmpl
))
4186 error ("partial specialization is not more specialized than the "
4187 "primary template because it replaces multiple parameters "
4188 "with a pack expansion");
4189 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4193 /* [temp.class.spec]
4195 A partially specialized non-type argument expression shall not
4196 involve template parameters of the partial specialization except
4197 when the argument expression is a simple identifier.
4199 The type of a template parameter corresponding to a specialized
4200 non-type argument shall not be dependent on a parameter of the
4203 Also, we verify that pack expansions only occur at the
4204 end of the argument list. */
4205 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4207 for (i
= 0; i
< nargs
; ++i
)
4209 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4210 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4211 tree packed_args
= NULL_TREE
;
4214 if (ARGUMENT_PACK_P (arg
))
4216 /* Extract the arguments from the argument pack. We'll be
4217 iterating over these in the following loop. */
4218 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4219 len
= TREE_VEC_LENGTH (packed_args
);
4222 for (j
= 0; j
< len
; j
++)
4225 /* Get the Jth argument in the parameter pack. */
4226 arg
= TREE_VEC_ELT (packed_args
, j
);
4228 if (PACK_EXPANSION_P (arg
))
4230 /* Pack expansions must come at the end of the
4232 if ((packed_args
&& j
< len
- 1)
4233 || (!packed_args
&& i
< nargs
- 1))
4235 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4236 error ("parameter pack argument %qE must be at the "
4237 "end of the template argument list", arg
);
4239 error ("parameter pack argument %qT must be at the "
4240 "end of the template argument list", arg
);
4244 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4245 /* We only care about the pattern. */
4246 arg
= PACK_EXPANSION_PATTERN (arg
);
4248 if (/* These first two lines are the `non-type' bit. */
4250 && TREE_CODE (arg
) != TEMPLATE_DECL
4251 /* This next two lines are the `argument expression is not just a
4252 simple identifier' condition and also the `specialized
4253 non-type argument' bit. */
4254 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4255 && !(REFERENCE_REF_P (arg
)
4256 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4258 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4259 || (packed_args
&& uses_template_parms (arg
)))
4260 error ("template argument %qE involves template parameter(s)",
4264 /* Look at the corresponding template parameter,
4265 marking which template parameters its type depends
4267 tree type
= TREE_TYPE (parm
);
4271 /* We haven't yet initialized TPD2. Do so now. */
4272 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4273 /* The number of parameters here is the number in the
4274 main template, which, as checked in the assertion
4276 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4278 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4281 /* Mark the template parameters. But this time, we're
4282 looking for the template parameters of the main
4283 template, not in the specialization. */
4284 tpd2
.current_arg
= i
;
4285 tpd2
.arg_uses_template_parms
[i
] = 0;
4286 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4287 for_each_template_parm (type
,
4288 &mark_template_parm
,
4291 /*include_nondeduced_p=*/false);
4293 if (tpd2
.arg_uses_template_parms
[i
])
4295 /* The type depended on some template parameters.
4296 If they are fully specialized in the
4297 specialization, that's OK. */
4300 for (j
= 0; j
< nargs
; ++j
)
4301 if (tpd2
.parms
[j
] != 0
4302 && tpd
.arg_uses_template_parms
[j
])
4305 error_n (input_location
, count
,
4306 "type %qT of template argument %qE depends "
4307 "on a template parameter",
4308 "type %qT of template argument %qE depends "
4309 "on template parameters",
4318 /* We should only get here once. */
4319 gcc_assert (!COMPLETE_TYPE_P (type
));
4321 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4322 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4323 TREE_TYPE (tmpl
) = type
;
4324 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4325 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4326 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4327 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4329 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4330 = tree_cons (specargs
, tmpl
,
4331 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4332 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4334 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4335 inst
= TREE_CHAIN (inst
))
4337 tree inst_type
= TREE_VALUE (inst
);
4338 if (COMPLETE_TYPE_P (inst_type
)
4339 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4341 tree spec
= most_specialized_class (inst_type
, tf_none
);
4342 if (spec
&& TREE_TYPE (spec
) == type
)
4343 permerror (input_location
,
4344 "partial specialization of %qT after instantiation "
4345 "of %qT", type
, inst_type
);
4352 /* PARM is a template parameter of some form; return the corresponding
4353 TEMPLATE_PARM_INDEX. */
4356 get_template_parm_index (tree parm
)
4358 if (TREE_CODE (parm
) == PARM_DECL
4359 || TREE_CODE (parm
) == CONST_DECL
)
4360 parm
= DECL_INITIAL (parm
);
4361 else if (TREE_CODE (parm
) == TYPE_DECL
4362 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4363 parm
= TREE_TYPE (parm
);
4364 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4365 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4366 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4367 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4371 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4372 parameter packs used by the template parameter PARM. */
4375 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4377 /* A type parm can't refer to another parm. */
4378 if (TREE_CODE (parm
) == TYPE_DECL
)
4380 else if (TREE_CODE (parm
) == PARM_DECL
)
4382 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4387 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4389 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4390 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4391 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4394 /* PARM is a template parameter pack. Return any parameter packs used in
4395 its type or the type of any of its template parameters. If there are
4396 any such packs, it will be instantiated into a fixed template parameter
4397 list by partial instantiation rather than be fully deduced. */
4400 fixed_parameter_pack_p (tree parm
)
4402 /* This can only be true in a member template. */
4403 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4405 /* This can only be true for a parameter pack. */
4406 if (!template_parameter_pack_p (parm
))
4408 /* A type parm can't refer to another parm. */
4409 if (TREE_CODE (parm
) == TYPE_DECL
)
4412 tree parameter_packs
= NULL_TREE
;
4413 struct find_parameter_pack_data ppd
;
4414 ppd
.parameter_packs
= ¶meter_packs
;
4415 ppd
.visited
= new hash_set
<tree
>;
4417 fixed_parameter_pack_p_1 (parm
, &ppd
);
4420 return parameter_packs
;
4423 /* Check that a template declaration's use of default arguments and
4424 parameter packs is not invalid. Here, PARMS are the template
4425 parameters. IS_PRIMARY is true if DECL is the thing declared by
4426 a primary template. IS_PARTIAL is true if DECL is a partial
4429 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4430 declaration (but not a definition); 1 indicates a declaration, 2
4431 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4432 emitted for extraneous default arguments.
4434 Returns TRUE if there were no errors found, FALSE otherwise. */
4437 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4438 bool is_partial
, int is_friend_decl
)
4441 int last_level_to_check
;
4443 bool no_errors
= true;
4447 A default template-argument shall not be specified in a
4448 function template declaration or a function template definition, nor
4449 in the template-parameter-list of the definition of a member of a
4452 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4453 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4454 /* You can't have a function template declaration in a local
4455 scope, nor you can you define a member of a class template in a
4459 if ((TREE_CODE (decl
) == TYPE_DECL
4461 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4462 || (TREE_CODE (decl
) == FUNCTION_DECL
4463 && LAMBDA_FUNCTION_P (decl
)))
4464 /* A lambda doesn't have an explicit declaration; don't complain
4465 about the parms of the enclosing class. */
4468 if (current_class_type
4469 && !TYPE_BEING_DEFINED (current_class_type
)
4470 && DECL_LANG_SPECIFIC (decl
)
4471 && DECL_DECLARES_FUNCTION_P (decl
)
4472 /* If this is either a friend defined in the scope of the class
4473 or a member function. */
4474 && (DECL_FUNCTION_MEMBER_P (decl
)
4475 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4476 : DECL_FRIEND_CONTEXT (decl
)
4477 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4479 /* And, if it was a member function, it really was defined in
4480 the scope of the class. */
4481 && (!DECL_FUNCTION_MEMBER_P (decl
)
4482 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4483 /* We already checked these parameters when the template was
4484 declared, so there's no need to do it again now. This function
4485 was defined in class scope, but we're processing its body now
4486 that the class is complete. */
4489 /* Core issue 226 (C++0x only): the following only applies to class
4492 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4496 If a template-parameter has a default template-argument, all
4497 subsequent template-parameters shall have a default
4498 template-argument supplied. */
4499 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4501 tree inner_parms
= TREE_VALUE (parm_level
);
4502 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4503 int seen_def_arg_p
= 0;
4506 for (i
= 0; i
< ntparms
; ++i
)
4508 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4510 if (parm
== error_mark_node
)
4513 if (TREE_PURPOSE (parm
))
4515 else if (seen_def_arg_p
4516 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4518 error ("no default argument for %qD", TREE_VALUE (parm
));
4519 /* For better subsequent error-recovery, we indicate that
4520 there should have been a default argument. */
4521 TREE_PURPOSE (parm
) = error_mark_node
;
4524 else if (!is_partial
4526 /* Don't complain about an enclosing partial
4528 && parm_level
== parms
4529 && TREE_CODE (decl
) == TYPE_DECL
4531 && template_parameter_pack_p (TREE_VALUE (parm
))
4532 /* A fixed parameter pack will be partially
4533 instantiated into a fixed length list. */
4534 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4536 /* A primary class template can only have one
4537 parameter pack, at the end of the template
4540 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4541 error ("parameter pack %qE must be at the end of the"
4542 " template parameter list", TREE_VALUE (parm
));
4544 error ("parameter pack %qT must be at the end of the"
4545 " template parameter list",
4546 TREE_TYPE (TREE_VALUE (parm
)));
4548 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4556 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4560 /* For an ordinary class template, default template arguments are
4561 allowed at the innermost level, e.g.:
4562 template <class T = int>
4564 but, in a partial specialization, they're not allowed even
4565 there, as we have in [temp.class.spec]:
4567 The template parameter list of a specialization shall not
4568 contain default template argument values.
4570 So, for a partial specialization, or for a function template
4571 (in C++98/C++03), we look at all of them. */
4574 /* But, for a primary class template that is not a partial
4575 specialization we look at all template parameters except the
4577 parms
= TREE_CHAIN (parms
);
4579 /* Figure out what error message to issue. */
4580 if (is_friend_decl
== 2)
4581 msg
= G_("default template arguments may not be used in function template "
4582 "friend re-declaration");
4583 else if (is_friend_decl
)
4584 msg
= G_("default template arguments may not be used in function template "
4585 "friend declarations");
4586 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4587 msg
= G_("default template arguments may not be used in function templates "
4588 "without -std=c++11 or -std=gnu++11");
4589 else if (is_partial
)
4590 msg
= G_("default template arguments may not be used in "
4591 "partial specializations");
4593 msg
= G_("default argument for template parameter for class enclosing %qD");
4595 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4596 /* If we're inside a class definition, there's no need to
4597 examine the parameters to the class itself. On the one
4598 hand, they will be checked when the class is defined, and,
4599 on the other, default arguments are valid in things like:
4600 template <class T = double>
4601 struct S { template <class U> void f(U); };
4602 Here the default argument for `S' has no bearing on the
4603 declaration of `f'. */
4604 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4606 /* Check everything. */
4607 last_level_to_check
= 0;
4609 for (parm_level
= parms
;
4610 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4611 parm_level
= TREE_CHAIN (parm_level
))
4613 tree inner_parms
= TREE_VALUE (parm_level
);
4617 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4618 for (i
= 0; i
< ntparms
; ++i
)
4620 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4623 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4628 if (is_friend_decl
== 2)
4635 /* Clear out the default argument so that we are not
4637 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4641 /* At this point, if we're still interested in issuing messages,
4642 they must apply to classes surrounding the object declared. */
4644 msg
= G_("default argument for template parameter for class "
4651 /* Worker for push_template_decl_real, called via
4652 for_each_template_parm. DATA is really an int, indicating the
4653 level of the parameters we are interested in. If T is a template
4654 parameter of that level, return nonzero. */
4657 template_parm_this_level_p (tree t
, void* data
)
4659 int this_level
= *(int *)data
;
4662 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4663 level
= TEMPLATE_PARM_LEVEL (t
);
4665 level
= TEMPLATE_TYPE_LEVEL (t
);
4666 return level
== this_level
;
4669 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4670 parameters given by current_template_args, or reuses a
4671 previously existing one, if appropriate. Returns the DECL, or an
4672 equivalent one, if it is replaced via a call to duplicate_decls.
4674 If IS_FRIEND is true, DECL is a friend declaration. */
4677 push_template_decl_real (tree decl
, bool is_friend
)
4685 int new_template_p
= 0;
4686 /* True if the template is a member template, in the sense of
4688 bool member_template_p
= false;
4690 if (decl
== error_mark_node
|| !current_template_parms
)
4691 return error_mark_node
;
4693 /* See if this is a partial specialization. */
4694 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4695 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4696 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4698 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4702 /* For a friend, we want the context of the friend function, not
4703 the type of which it is a friend. */
4704 ctx
= CP_DECL_CONTEXT (decl
);
4705 else if (CP_DECL_CONTEXT (decl
)
4706 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4707 /* In the case of a virtual function, we want the class in which
4709 ctx
= CP_DECL_CONTEXT (decl
);
4711 /* Otherwise, if we're currently defining some class, the DECL
4712 is assumed to be a member of the class. */
4713 ctx
= current_scope ();
4715 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4718 if (!DECL_CONTEXT (decl
))
4719 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4721 /* See if this is a primary template. */
4722 if (is_friend
&& ctx
4723 && uses_template_parms_level (ctx
, processing_template_decl
))
4724 /* A friend template that specifies a class context, i.e.
4725 template <typename T> friend void A<T>::f();
4728 else if (TREE_CODE (decl
) == TYPE_DECL
4729 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4732 is_primary
= template_parm_scope_p ();
4736 if (DECL_CLASS_SCOPE_P (decl
))
4737 member_template_p
= true;
4738 if (TREE_CODE (decl
) == TYPE_DECL
4739 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4741 error ("template class without a name");
4742 return error_mark_node
;
4744 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4746 if (member_template_p
)
4748 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
4749 error ("member template %qD may not have virt-specifiers", decl
);
4751 if (DECL_DESTRUCTOR_P (decl
))
4755 A destructor shall not be a member template. */
4756 error ("destructor %qD declared as member template", decl
);
4757 return error_mark_node
;
4759 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4760 && (!prototype_p (TREE_TYPE (decl
))
4761 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4762 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4763 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4764 == void_list_node
)))
4766 /* [basic.stc.dynamic.allocation]
4768 An allocation function can be a function
4769 template. ... Template allocation functions shall
4770 have two or more parameters. */
4771 error ("invalid template declaration of %qD", decl
);
4772 return error_mark_node
;
4775 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4776 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4778 else if (TREE_CODE (decl
) == TYPE_DECL
4779 && TYPE_DECL_ALIAS_P (decl
))
4780 /* alias-declaration */
4781 gcc_assert (!DECL_ARTIFICIAL (decl
));
4782 else if (VAR_P (decl
))
4783 /* C++14 variable template. */;
4786 error ("template declaration of %q#D", decl
);
4787 return error_mark_node
;
4791 /* Check to see that the rules regarding the use of default
4792 arguments are not being violated. */
4793 check_default_tmpl_args (decl
, current_template_parms
,
4794 is_primary
, is_partial
, /*is_friend_decl=*/0);
4796 /* Ensure that there are no parameter packs in the type of this
4797 declaration that have not been expanded. */
4798 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4800 /* Check each of the arguments individually to see if there are
4801 any bare parameter packs. */
4802 tree type
= TREE_TYPE (decl
);
4803 tree arg
= DECL_ARGUMENTS (decl
);
4804 tree argtype
= TYPE_ARG_TYPES (type
);
4806 while (arg
&& argtype
)
4808 if (!DECL_PACK_P (arg
)
4809 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4811 /* This is a PARM_DECL that contains unexpanded parameter
4812 packs. We have already complained about this in the
4813 check_for_bare_parameter_packs call, so just replace
4814 these types with ERROR_MARK_NODE. */
4815 TREE_TYPE (arg
) = error_mark_node
;
4816 TREE_VALUE (argtype
) = error_mark_node
;
4819 arg
= DECL_CHAIN (arg
);
4820 argtype
= TREE_CHAIN (argtype
);
4823 /* Check for bare parameter packs in the return type and the
4824 exception specifiers. */
4825 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4826 /* Errors were already issued, set return type to int
4827 as the frontend doesn't expect error_mark_node as
4829 TREE_TYPE (type
) = integer_type_node
;
4830 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4831 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4833 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4834 && TYPE_DECL_ALIAS_P (decl
))
4835 ? DECL_ORIGINAL_TYPE (decl
)
4836 : TREE_TYPE (decl
)))
4838 TREE_TYPE (decl
) = error_mark_node
;
4839 return error_mark_node
;
4843 return process_partial_specialization (decl
);
4845 args
= current_template_args ();
4848 || TREE_CODE (ctx
) == FUNCTION_DECL
4849 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4850 || (TREE_CODE (decl
) == TYPE_DECL
4851 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4852 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4854 if (DECL_LANG_SPECIFIC (decl
)
4855 && DECL_TEMPLATE_INFO (decl
)
4856 && DECL_TI_TEMPLATE (decl
))
4857 tmpl
= DECL_TI_TEMPLATE (decl
);
4858 /* If DECL is a TYPE_DECL for a class-template, then there won't
4859 be DECL_LANG_SPECIFIC. The information equivalent to
4860 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4861 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4862 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4863 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4865 /* Since a template declaration already existed for this
4866 class-type, we must be redeclaring it here. Make sure
4867 that the redeclaration is valid. */
4868 redeclare_class_template (TREE_TYPE (decl
),
4869 current_template_parms
);
4870 /* We don't need to create a new TEMPLATE_DECL; just use the
4871 one we already had. */
4872 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4876 tmpl
= build_template_decl (decl
, current_template_parms
,
4880 if (DECL_LANG_SPECIFIC (decl
)
4881 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4883 /* A specialization of a member template of a template
4885 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4886 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4887 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4893 tree a
, t
, current
, parms
;
4895 tree tinfo
= get_template_info (decl
);
4899 error ("template definition of non-template %q#D", decl
);
4900 return error_mark_node
;
4903 tmpl
= TI_TEMPLATE (tinfo
);
4905 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4906 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4907 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4908 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4912 /* The declaration is a specialization of a member
4913 template, declared outside the class. Therefore, the
4914 innermost template arguments will be NULL, so we
4915 replace them with the arguments determined by the
4916 earlier call to check_explicit_specialization. */
4917 args
= DECL_TI_ARGS (decl
);
4920 = build_template_decl (decl
, current_template_parms
,
4922 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4923 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4924 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4925 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4926 DECL_TEMPLATE_INFO (new_tmpl
)
4927 = build_template_info (tmpl
, args
);
4929 register_specialization (new_tmpl
,
4930 most_general_template (tmpl
),
4936 /* Make sure the template headers we got make sense. */
4938 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4939 i
= TMPL_PARMS_DEPTH (parms
);
4940 if (TMPL_ARGS_DEPTH (args
) != i
)
4942 error ("expected %d levels of template parms for %q#D, got %d",
4943 i
, decl
, TMPL_ARGS_DEPTH (args
));
4944 DECL_INTERFACE_KNOWN (decl
) = 1;
4945 return error_mark_node
;
4948 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4950 a
= TMPL_ARGS_LEVEL (args
, i
);
4951 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4953 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4955 if (current
== decl
)
4956 error ("got %d template parameters for %q#D",
4957 TREE_VEC_LENGTH (a
), decl
);
4959 error ("got %d template parameters for %q#T",
4960 TREE_VEC_LENGTH (a
), current
);
4961 error (" but %d required", TREE_VEC_LENGTH (t
));
4962 /* Avoid crash in import_export_decl. */
4963 DECL_INTERFACE_KNOWN (decl
) = 1;
4964 return error_mark_node
;
4967 if (current
== decl
)
4969 else if (current
== NULL_TREE
)
4970 /* Can happen in erroneous input. */
4973 current
= get_containing_scope (current
);
4976 /* Check that the parms are used in the appropriate qualifying scopes
4977 in the declarator. */
4978 if (!comp_template_args
4980 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4983 template arguments to %qD do not match original template %qD",
4984 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4985 if (!uses_template_parms (TI_ARGS (tinfo
)))
4986 inform (input_location
, "use template<> for an explicit specialization");
4987 /* Avoid crash in import_export_decl. */
4988 DECL_INTERFACE_KNOWN (decl
) = 1;
4989 return error_mark_node
;
4993 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4994 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4996 /* Push template declarations for global functions and types. Note
4997 that we do not try to push a global template friend declared in a
4998 template class; such a thing may well depend on the template
4999 parameters of the class. */
5000 if (new_template_p
&& !ctx
5001 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5003 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5004 if (tmpl
== error_mark_node
)
5005 return error_mark_node
;
5007 /* Hide template friend classes that haven't been declared yet. */
5008 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5010 DECL_ANTICIPATED (tmpl
) = 1;
5011 DECL_FRIEND_P (tmpl
) = 1;
5017 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5020 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5021 if (DECL_CONV_FN_P (tmpl
))
5023 int depth
= TMPL_PARMS_DEPTH (parms
);
5025 /* It is a conversion operator. See if the type converted to
5026 depends on innermost template operands. */
5028 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5030 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5033 /* Give template template parms a DECL_CONTEXT of the template
5034 for which they are a parameter. */
5035 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5036 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5038 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5039 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5040 DECL_CONTEXT (parm
) = tmpl
;
5044 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5045 back to its most general template. If TMPL is a specialization,
5046 ARGS may only have the innermost set of arguments. Add the missing
5047 argument levels if necessary. */
5048 if (DECL_TEMPLATE_INFO (tmpl
))
5049 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5051 info
= build_template_info (tmpl
, args
);
5053 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5054 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5057 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5058 retrofit_lang_decl (decl
);
5059 if (DECL_LANG_SPECIFIC (decl
))
5060 DECL_TEMPLATE_INFO (decl
) = info
;
5063 if (flag_implicit_templates
5065 && TREE_PUBLIC (decl
)
5066 && VAR_OR_FUNCTION_DECL_P (decl
))
5067 /* Set DECL_COMDAT on template instantiations; if we force
5068 them to be emitted by explicit instantiation or -frepo,
5069 mark_needed will tell cgraph to do the right thing. */
5070 DECL_COMDAT (decl
) = true;
5072 return DECL_TEMPLATE_RESULT (tmpl
);
5076 push_template_decl (tree decl
)
5078 return push_template_decl_real (decl
, false);
5081 /* FN is an inheriting constructor that inherits from the constructor
5082 template INHERITED; turn FN into a constructor template with a matching
5086 add_inherited_template_parms (tree fn
, tree inherited
)
5089 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5090 inner_parms
= copy_node (inner_parms
);
5092 = tree_cons (size_int (processing_template_decl
+ 1),
5093 inner_parms
, current_template_parms
);
5094 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5095 tree args
= template_parms_to_args (parms
);
5096 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5097 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5098 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5099 DECL_ARTIFICIAL (tmpl
) = true;
5100 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5104 /* Called when a class template TYPE is redeclared with the indicated
5105 template PARMS, e.g.:
5107 template <class T> struct S;
5108 template <class T> struct S {}; */
5111 redeclare_class_template (tree type
, tree parms
)
5117 if (!TYPE_TEMPLATE_INFO (type
))
5119 error ("%qT is not a template type", type
);
5123 tmpl
= TYPE_TI_TEMPLATE (type
);
5124 if (!PRIMARY_TEMPLATE_P (tmpl
))
5125 /* The type is nested in some template class. Nothing to worry
5126 about here; there are no new template parameters for the nested
5132 error ("template specifiers not specified in declaration of %qD",
5137 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5138 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5140 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5142 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5143 "redeclared with %d template parameter",
5144 "redeclared with %d template parameters",
5145 TREE_VEC_LENGTH (parms
));
5146 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5147 "previous declaration %q+D used %d template parameter",
5148 "previous declaration %q+D used %d template parameters",
5149 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5153 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5160 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5161 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5164 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5165 if (error_operand_p (tmpl_parm
))
5168 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5169 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5170 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5172 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5174 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5175 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5176 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5177 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5178 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5179 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5180 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5181 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5182 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5184 error ("template parameter %q+#D", tmpl_parm
);
5185 error ("redeclared here as %q#D", parm
);
5189 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5191 /* We have in [temp.param]:
5193 A template-parameter may not be given default arguments
5194 by two different declarations in the same scope. */
5195 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5196 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5197 "original definition appeared here");
5201 if (parm_default
!= NULL_TREE
)
5202 /* Update the previous template parameters (which are the ones
5203 that will really count) with the new default value. */
5204 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5205 else if (tmpl_default
!= NULL_TREE
)
5206 /* Update the new parameters, too; they'll be used as the
5207 parameters for any members. */
5208 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5214 /* Simplify EXPR if it is a non-dependent expression. Returns the
5215 (possibly simplified) expression. */
5218 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5220 if (expr
== NULL_TREE
)
5223 /* If we're in a template, but EXPR isn't value dependent, simplify
5224 it. We're supposed to treat:
5226 template <typename T> void f(T[1 + 1]);
5227 template <typename T> void f(T[2]);
5229 as two declarations of the same function, for example. */
5230 if (processing_template_decl
5231 && !instantiation_dependent_expression_p (expr
)
5232 && potential_constant_expression (expr
))
5234 HOST_WIDE_INT saved_processing_template_decl
;
5236 saved_processing_template_decl
= processing_template_decl
;
5237 processing_template_decl
= 0;
5238 expr
= tsubst_copy_and_build (expr
,
5241 /*in_decl=*/NULL_TREE
,
5242 /*function_p=*/false,
5243 /*integral_constant_expression_p=*/true);
5244 processing_template_decl
= saved_processing_template_decl
;
5250 fold_non_dependent_expr (tree expr
)
5252 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5255 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5256 template declaration, or a TYPE_DECL for an alias declaration. */
5259 alias_type_or_template_p (tree t
)
5263 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5266 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5267 || DECL_ALIAS_TEMPLATE_P (t
));
5270 /* Return TRUE iff is a specialization of an alias template. */
5273 alias_template_specialization_p (const_tree t
)
5279 && TYPE_TEMPLATE_INFO (t
)
5280 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5281 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5284 /* Return the number of innermost template parameters in TMPL. */
5287 num_innermost_template_parms (tree tmpl
)
5289 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5290 return TREE_VEC_LENGTH (parms
);
5293 /* Return either TMPL or another template that it is equivalent to under DR
5294 1286: An alias that just changes the name of a template is equivalent to
5295 the other template. */
5298 get_underlying_template (tree tmpl
)
5300 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5301 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5303 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5304 if (TYPE_TEMPLATE_INFO (result
))
5306 tree sub
= TYPE_TI_TEMPLATE (result
);
5307 if (PRIMARY_TEMPLATE_P (sub
)
5308 && (num_innermost_template_parms (tmpl
)
5309 == num_innermost_template_parms (sub
)))
5311 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5312 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5313 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5315 /* The alias type is equivalent to the pattern of the
5316 underlying template, so strip the alias. */
5326 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5327 must be a function or a pointer-to-function type, as specified
5328 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5329 and check that the resulting function has external linkage. */
5332 convert_nontype_argument_function (tree type
, tree expr
,
5333 tsubst_flags_t complain
)
5337 linkage_kind linkage
;
5339 fn
= instantiate_type (type
, fns
, tf_none
);
5340 if (fn
== error_mark_node
)
5341 return error_mark_node
;
5344 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5345 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5346 if (BASELINK_P (fn_no_ptr
))
5347 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5349 /* [temp.arg.nontype]/1
5351 A template-argument for a non-type, non-template template-parameter
5354 -- the address of an object or function with external [C++11: or
5355 internal] linkage. */
5357 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5359 if (complain
& tf_error
)
5361 error ("%qE is not a valid template argument for type %qT",
5363 if (TYPE_PTR_P (type
))
5364 error ("it must be the address of a function with "
5365 "external linkage");
5367 error ("it must be the name of a function with "
5368 "external linkage");
5373 linkage
= decl_linkage (fn_no_ptr
);
5374 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5376 if (complain
& tf_error
)
5378 if (cxx_dialect
>= cxx11
)
5379 error ("%qE is not a valid template argument for type %qT "
5380 "because %qD has no linkage",
5381 expr
, type
, fn_no_ptr
);
5383 error ("%qE is not a valid template argument for type %qT "
5384 "because %qD does not have external linkage",
5385 expr
, type
, fn_no_ptr
);
5393 /* Subroutine of convert_nontype_argument.
5394 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5395 Emit an error otherwise. */
5398 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5399 tsubst_flags_t complain
)
5402 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5404 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5406 if (processing_template_decl
5407 && TREE_CODE (expr
) == ADDR_EXPR
5408 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5410 if (complain
& tf_error
)
5412 error ("%qE is not a valid template argument for type %qT",
5414 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5419 /* Returns TRUE iff the address of OP is value-dependent.
5421 14.6.2.4 [temp.dep.temp]:
5422 A non-integral non-type template-argument is dependent if its type is
5423 dependent or it has either of the following forms
5426 and contains a nested-name-specifier which specifies a class-name that
5427 names a dependent type.
5429 We generalize this to just say that the address of a member of a
5430 dependent class is value-dependent; the above doesn't cover the
5431 address of a static data member named with an unqualified-id. */
5434 has_value_dependent_address (tree op
)
5436 /* We could use get_inner_reference here, but there's no need;
5437 this is only relevant for template non-type arguments, which
5438 can only be expressed as &id-expression. */
5441 tree ctx
= CP_DECL_CONTEXT (op
);
5442 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5449 /* The next set of functions are used for providing helpful explanatory
5450 diagnostics for failed overload resolution. Their messages should be
5451 indented by two spaces for consistency with the messages in
5455 unify_success (bool /*explain_p*/)
5461 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5464 inform (input_location
,
5465 " couldn't deduce template parameter %qD", parm
);
5470 unify_invalid (bool /*explain_p*/)
5476 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5479 inform (input_location
,
5480 " types %qT and %qT have incompatible cv-qualifiers",
5486 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5489 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5494 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5497 inform (input_location
,
5498 " template parameter %qD is not a parameter pack, but "
5505 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5508 inform (input_location
,
5509 " template argument %qE does not match "
5510 "pointer-to-member constant %qE",
5516 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5519 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5524 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5527 inform (input_location
,
5528 " inconsistent parameter pack deduction with %qT and %qT",
5534 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5539 inform (input_location
,
5540 " deduced conflicting types for parameter %qT (%qT and %qT)",
5541 parm
, first
, second
);
5543 inform (input_location
,
5544 " deduced conflicting values for non-type parameter "
5545 "%qE (%qE and %qE)", parm
, first
, second
);
5551 unify_vla_arg (bool explain_p
, tree arg
)
5554 inform (input_location
,
5555 " variable-sized array type %qT is not "
5556 "a valid template argument",
5562 unify_method_type_error (bool explain_p
, tree arg
)
5565 inform (input_location
,
5566 " member function type %qT is not a valid template argument",
5572 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
5577 inform_n (input_location
, wanted
,
5578 " candidate expects at least %d argument, %d provided",
5579 " candidate expects at least %d arguments, %d provided",
5582 inform_n (input_location
, wanted
,
5583 " candidate expects %d argument, %d provided",
5584 " candidate expects %d arguments, %d provided",
5591 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5593 return unify_arity (explain_p
, have
, wanted
);
5597 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
5598 bool least_p
= false)
5600 return unify_arity (explain_p
, have
, wanted
, least_p
);
5604 unify_arg_conversion (bool explain_p
, tree to_type
,
5605 tree from_type
, tree arg
)
5608 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5609 " cannot convert %qE (type %qT) to type %qT",
5610 arg
, from_type
, to_type
);
5615 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5616 tree parm
, tree arg
)
5621 case tbr_ambiguous_baseclass
:
5622 inform (input_location
, " %qT is an ambiguous base class of %qT",
5626 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5633 unify_inconsistent_template_template_parameters (bool explain_p
)
5636 inform (input_location
,
5637 " template parameters of a template template argument are "
5638 "inconsistent with other deduced template arguments");
5643 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5646 inform (input_location
,
5647 " can't deduce a template for %qT from non-template type %qT",
5653 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5656 inform (input_location
,
5657 " template argument %qE does not match %qD", arg
, parm
);
5662 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5665 inform (input_location
,
5666 " could not resolve address from overloaded function %qE",
5671 /* Attempt to convert the non-type template parameter EXPR to the
5672 indicated TYPE. If the conversion is successful, return the
5673 converted value. If the conversion is unsuccessful, return
5674 NULL_TREE if we issued an error message, or error_mark_node if we
5675 did not. We issue error messages for out-and-out bad template
5676 parameters, but not simply because the conversion failed, since we
5677 might be just trying to do argument deduction. Both TYPE and EXPR
5678 must be non-dependent.
5680 The conversion follows the special rules described in
5681 [temp.arg.nontype], and it is much more strict than an implicit
5684 This function is called twice for each template argument (see
5685 lookup_template_class for a more accurate description of this
5686 problem). This means that we need to handle expressions which
5687 are not valid in a C++ source, but can be created from the
5688 first call (for instance, casts to perform conversions). These
5689 hacks can go away after we fix the double coercion problem. */
5692 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5696 /* Detect immediately string literals as invalid non-type argument.
5697 This special-case is not needed for correctness (we would easily
5698 catch this later), but only to provide better diagnostic for this
5699 common user mistake. As suggested by DR 100, we do not mention
5700 linkage issues in the diagnostic as this is not the point. */
5701 /* FIXME we're making this OK. */
5702 if (TREE_CODE (expr
) == STRING_CST
)
5704 if (complain
& tf_error
)
5705 error ("%qE is not a valid template argument for type %qT "
5706 "because string literals can never be used in this context",
5711 /* Add the ADDR_EXPR now for the benefit of
5712 value_dependent_expression_p. */
5713 if (TYPE_PTROBV_P (type
)
5714 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5716 expr
= decay_conversion (expr
, complain
);
5717 if (expr
== error_mark_node
)
5718 return error_mark_node
;
5721 /* If we are in a template, EXPR may be non-dependent, but still
5722 have a syntactic, rather than semantic, form. For example, EXPR
5723 might be a SCOPE_REF, rather than the VAR_DECL to which the
5724 SCOPE_REF refers. Preserving the qualifying scope is necessary
5725 so that access checking can be performed when the template is
5726 instantiated -- but here we need the resolved form so that we can
5727 convert the argument. */
5728 if (TYPE_REF_OBJ_P (type
)
5729 && has_value_dependent_address (expr
))
5730 /* If we want the address and it's value-dependent, don't fold. */;
5731 else if (!type_unknown_p (expr
))
5732 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5733 if (error_operand_p (expr
))
5734 return error_mark_node
;
5735 expr_type
= TREE_TYPE (expr
);
5736 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5737 expr
= mark_lvalue_use (expr
);
5739 expr
= mark_rvalue_use (expr
);
5741 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5742 to a non-type argument of "nullptr". */
5743 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5744 expr
= convert (type
, expr
);
5746 /* In C++11, integral or enumeration non-type template arguments can be
5747 arbitrary constant expressions. Pointer and pointer to
5748 member arguments can be general constant expressions that evaluate
5749 to a null value, but otherwise still need to be of a specific form. */
5750 if (cxx_dialect
>= cxx11
)
5752 if (TREE_CODE (expr
) == PTRMEM_CST
)
5753 /* A PTRMEM_CST is already constant, and a valid template
5754 argument for a parameter of pointer to member type, we just want
5755 to leave it in that form rather than lower it to a
5757 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5758 expr
= maybe_constant_value (expr
);
5759 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5761 tree folded
= maybe_constant_value (expr
);
5762 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5763 : null_member_pointer_value_p (folded
))
5768 /* HACK: Due to double coercion, we can get a
5769 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5770 which is the tree that we built on the first call (see
5771 below when coercing to reference to object or to reference to
5772 function). We just strip everything and get to the arg.
5773 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5775 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5777 tree probe_type
, probe
= expr
;
5778 if (REFERENCE_REF_P (probe
))
5779 probe
= TREE_OPERAND (probe
, 0);
5780 probe_type
= TREE_TYPE (probe
);
5781 if (TREE_CODE (probe
) == NOP_EXPR
)
5783 /* ??? Maybe we could use convert_from_reference here, but we
5784 would need to relax its constraints because the NOP_EXPR
5785 could actually change the type to something more cv-qualified,
5786 and this is not folded by convert_from_reference. */
5787 tree addr
= TREE_OPERAND (probe
, 0);
5788 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5789 && TREE_CODE (addr
) == ADDR_EXPR
5790 && TYPE_PTR_P (TREE_TYPE (addr
))
5791 && (same_type_ignoring_top_level_qualifiers_p
5792 (TREE_TYPE (probe_type
),
5793 TREE_TYPE (TREE_TYPE (addr
)))))
5795 expr
= TREE_OPERAND (addr
, 0);
5796 expr_type
= TREE_TYPE (probe_type
);
5801 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5802 parameter is a pointer to object, through decay and
5803 qualification conversion. Let's strip everything. */
5804 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5808 if (TREE_CODE (probe
) == ADDR_EXPR
5809 && TYPE_PTR_P (TREE_TYPE (probe
)))
5811 /* Skip the ADDR_EXPR only if it is part of the decay for
5812 an array. Otherwise, it is part of the original argument
5813 in the source code. */
5814 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5815 probe
= TREE_OPERAND (probe
, 0);
5817 expr_type
= TREE_TYPE (expr
);
5821 /* [temp.arg.nontype]/5, bullet 1
5823 For a non-type template-parameter of integral or enumeration type,
5824 integral promotions (_conv.prom_) and integral conversions
5825 (_conv.integral_) are applied. */
5826 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5828 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5829 t
= maybe_constant_value (t
);
5830 if (t
!= error_mark_node
)
5833 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5834 return error_mark_node
;
5836 /* Notice that there are constant expressions like '4 % 0' which
5837 do not fold into integer constants. */
5838 if (TREE_CODE (expr
) != INTEGER_CST
)
5840 if (complain
& tf_error
)
5842 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5843 if (processing_template_decl
5844 && !require_potential_constant_expression (expr
))
5846 expr
= cxx_constant_value (expr
);
5847 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5848 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
5849 "in template argument for type %qT ", type
);
5850 if (expr
== error_mark_node
)
5852 /* else cxx_constant_value complained but gave us
5853 a real constant, so go ahead. */
5854 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5860 /* Avoid typedef problems. */
5861 if (TREE_TYPE (expr
) != type
)
5862 expr
= fold_convert (type
, expr
);
5864 /* [temp.arg.nontype]/5, bullet 2
5866 For a non-type template-parameter of type pointer to object,
5867 qualification conversions (_conv.qual_) and the array-to-pointer
5868 conversion (_conv.array_) are applied. */
5869 else if (TYPE_PTROBV_P (type
))
5871 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5873 A template-argument for a non-type, non-template template-parameter
5874 shall be one of: [...]
5876 -- the name of a non-type template-parameter;
5877 -- the address of an object or function with external linkage, [...]
5878 expressed as "& id-expression" where the & is optional if the name
5879 refers to a function or array, or if the corresponding
5880 template-parameter is a reference.
5882 Here, we do not care about functions, as they are invalid anyway
5883 for a parameter of type pointer-to-object. */
5885 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5886 /* Non-type template parameters are OK. */
5888 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5889 /* Null pointer values are OK in C++11. */;
5890 else if (TREE_CODE (expr
) != ADDR_EXPR
5891 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5895 if (complain
& tf_error
)
5896 error ("%qD is not a valid template argument "
5897 "because %qD is a variable, not the address of "
5898 "a variable", expr
, expr
);
5901 if (POINTER_TYPE_P (expr_type
))
5903 if (complain
& tf_error
)
5904 error ("%qE is not a valid template argument for %qT "
5905 "because it is not the address of a variable",
5909 /* Other values, like integer constants, might be valid
5910 non-type arguments of some other type. */
5911 return error_mark_node
;
5917 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5918 ? TREE_OPERAND (expr
, 0) : expr
);
5921 if (complain
& tf_error
)
5922 error ("%qE is not a valid template argument of type %qT "
5923 "because %qE is not a variable", expr
, type
, decl
);
5926 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5928 if (complain
& tf_error
)
5929 error ("%qE is not a valid template argument of type %qT "
5930 "because %qD does not have external linkage",
5934 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
5936 if (complain
& tf_error
)
5937 error ("%qE is not a valid template argument of type %qT "
5938 "because %qD has no linkage", expr
, type
, decl
);
5943 expr
= decay_conversion (expr
, complain
);
5944 if (expr
== error_mark_node
)
5945 return error_mark_node
;
5947 expr
= perform_qualification_conversions (type
, expr
);
5948 if (expr
== error_mark_node
)
5949 return error_mark_node
;
5951 /* [temp.arg.nontype]/5, bullet 3
5953 For a non-type template-parameter of type reference to object, no
5954 conversions apply. The type referred to by the reference may be more
5955 cv-qualified than the (otherwise identical) type of the
5956 template-argument. The template-parameter is bound directly to the
5957 template-argument, which must be an lvalue. */
5958 else if (TYPE_REF_OBJ_P (type
))
5960 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5962 return error_mark_node
;
5964 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5966 if (complain
& tf_error
)
5967 error ("%qE is not a valid template argument for type %qT "
5968 "because of conflicts in cv-qualification", expr
, type
);
5972 if (!real_lvalue_p (expr
))
5974 if (complain
& tf_error
)
5975 error ("%qE is not a valid template argument for type %qT "
5976 "because it is not an lvalue", expr
, type
);
5980 /* [temp.arg.nontype]/1
5982 A template-argument for a non-type, non-template template-parameter
5983 shall be one of: [...]
5985 -- the address of an object or function with external linkage. */
5986 if (INDIRECT_REF_P (expr
)
5987 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5989 expr
= TREE_OPERAND (expr
, 0);
5992 if (complain
& tf_error
)
5993 error ("%q#D is not a valid template argument for type %qT "
5994 "because a reference variable does not have a constant "
5995 "address", expr
, type
);
6002 if (complain
& tf_error
)
6003 error ("%qE is not a valid template argument for type %qT "
6004 "because it is not an object with external linkage",
6009 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
6011 if (complain
& tf_error
)
6012 error ("%qE is not a valid template argument for type %qT "
6013 "because object %qD has not external linkage",
6018 expr
= build_nop (type
, build_address (expr
));
6020 /* [temp.arg.nontype]/5, bullet 4
6022 For a non-type template-parameter of type pointer to function, only
6023 the function-to-pointer conversion (_conv.func_) is applied. If the
6024 template-argument represents a set of overloaded functions (or a
6025 pointer to such), the matching function is selected from the set
6027 else if (TYPE_PTRFN_P (type
))
6029 /* If the argument is a template-id, we might not have enough
6030 context information to decay the pointer. */
6031 if (!type_unknown_p (expr_type
))
6033 expr
= decay_conversion (expr
, complain
);
6034 if (expr
== error_mark_node
)
6035 return error_mark_node
;
6038 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6039 /* Null pointer values are OK in C++11. */
6040 return perform_qualification_conversions (type
, expr
);
6042 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6043 if (!expr
|| expr
== error_mark_node
)
6046 /* [temp.arg.nontype]/5, bullet 5
6048 For a non-type template-parameter of type reference to function, no
6049 conversions apply. If the template-argument represents a set of
6050 overloaded functions, the matching function is selected from the set
6052 else if (TYPE_REFFN_P (type
))
6054 if (TREE_CODE (expr
) == ADDR_EXPR
)
6056 if (complain
& tf_error
)
6058 error ("%qE is not a valid template argument for type %qT "
6059 "because it is a pointer", expr
, type
);
6060 inform (input_location
, "try using %qE instead",
6061 TREE_OPERAND (expr
, 0));
6066 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6067 if (!expr
|| expr
== error_mark_node
)
6070 expr
= build_nop (type
, build_address (expr
));
6072 /* [temp.arg.nontype]/5, bullet 6
6074 For a non-type template-parameter of type pointer to member function,
6075 no conversions apply. If the template-argument represents a set of
6076 overloaded member functions, the matching member function is selected
6077 from the set (_over.over_). */
6078 else if (TYPE_PTRMEMFUNC_P (type
))
6080 expr
= instantiate_type (type
, expr
, tf_none
);
6081 if (expr
== error_mark_node
)
6082 return error_mark_node
;
6084 /* [temp.arg.nontype] bullet 1 says the pointer to member
6085 expression must be a pointer-to-member constant. */
6086 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6087 return error_mark_node
;
6089 /* There is no way to disable standard conversions in
6090 resolve_address_of_overloaded_function (called by
6091 instantiate_type). It is possible that the call succeeded by
6092 converting &B::I to &D::I (where B is a base of D), so we need
6093 to reject this conversion here.
6095 Actually, even if there was a way to disable standard conversions,
6096 it would still be better to reject them here so that we can
6097 provide a superior diagnostic. */
6098 if (!same_type_p (TREE_TYPE (expr
), type
))
6100 if (complain
& tf_error
)
6102 error ("%qE is not a valid template argument for type %qT "
6103 "because it is of type %qT", expr
, type
,
6105 /* If we are just one standard conversion off, explain. */
6106 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6107 inform (input_location
,
6108 "standard conversions are not allowed in this context");
6113 /* [temp.arg.nontype]/5, bullet 7
6115 For a non-type template-parameter of type pointer to data member,
6116 qualification conversions (_conv.qual_) are applied. */
6117 else if (TYPE_PTRDATAMEM_P (type
))
6119 /* [temp.arg.nontype] bullet 1 says the pointer to member
6120 expression must be a pointer-to-member constant. */
6121 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6122 return error_mark_node
;
6124 expr
= perform_qualification_conversions (type
, expr
);
6125 if (expr
== error_mark_node
)
6128 else if (NULLPTR_TYPE_P (type
))
6130 if (expr
!= nullptr_node
)
6132 if (complain
& tf_error
)
6133 error ("%qE is not a valid template argument for type %qT "
6134 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6139 /* A template non-type parameter must be one of the above. */
6143 /* Sanity check: did we actually convert the argument to the
6145 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6146 (type
, TREE_TYPE (expr
)));
6150 /* Subroutine of coerce_template_template_parms, which returns 1 if
6151 PARM_PARM and ARG_PARM match using the rule for the template
6152 parameters of template template parameters. Both PARM and ARG are
6153 template parameters; the rest of the arguments are the same as for
6154 coerce_template_template_parms.
6157 coerce_template_template_parm (tree parm
,
6159 tsubst_flags_t complain
,
6163 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6164 || parm
== NULL_TREE
|| error_operand_p (parm
))
6167 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6170 switch (TREE_CODE (parm
))
6173 /* We encounter instantiations of templates like
6174 template <template <template <class> class> class TT>
6177 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6178 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6180 if (!coerce_template_template_parms
6181 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6187 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6188 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6189 /* Argument is a parameter pack but parameter is not. */
6194 /* The tsubst call is used to handle cases such as
6196 template <int> class C {};
6197 template <class T, template <T> class TT> class D {};
6200 i.e. the parameter list of TT depends on earlier parameters. */
6201 if (!uses_template_parms (TREE_TYPE (arg
))
6203 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6207 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6208 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6209 /* Argument is a parameter pack but parameter is not. */
6222 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6223 template template parameters. Both PARM_PARMS and ARG_PARMS are
6224 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6227 Consider the example:
6228 template <class T> class A;
6229 template<template <class U> class TT> class B;
6231 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6232 the parameters to A, and OUTER_ARGS contains A. */
6235 coerce_template_template_parms (tree parm_parms
,
6237 tsubst_flags_t complain
,
6241 int nparms
, nargs
, i
;
6245 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6246 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6248 nparms
= TREE_VEC_LENGTH (parm_parms
);
6249 nargs
= TREE_VEC_LENGTH (arg_parms
);
6251 /* Determine whether we have a parameter pack at the end of the
6252 template template parameter's template parameter list. */
6253 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6255 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6257 if (error_operand_p (parm
))
6260 switch (TREE_CODE (parm
))
6264 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6269 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6279 && !(variadic_p
&& nargs
>= nparms
- 1))
6282 /* Check all of the template parameters except the parameter pack at
6283 the end (if any). */
6284 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6286 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6287 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6290 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6291 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6293 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6301 /* Check each of the template parameters in the template
6302 argument against the template parameter pack at the end of
6303 the template template parameter. */
6304 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6307 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6309 for (; i
< nargs
; ++i
)
6311 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6314 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6316 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6325 /* Verifies that the deduced template arguments (in TARGS) for the
6326 template template parameters (in TPARMS) represent valid bindings,
6327 by comparing the template parameter list of each template argument
6328 to the template parameter list of its corresponding template
6329 template parameter, in accordance with DR150. This
6330 routine can only be called after all template arguments have been
6331 deduced. It will return TRUE if all of the template template
6332 parameter bindings are okay, FALSE otherwise. */
6334 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6336 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6339 /* We're dealing with template parms in this process. */
6340 ++processing_template_decl
;
6342 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6344 for (i
= 0; i
< ntparms
; ++i
)
6346 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6347 tree targ
= TREE_VEC_ELT (targs
, i
);
6349 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6351 tree packed_args
= NULL_TREE
;
6354 if (ARGUMENT_PACK_P (targ
))
6356 /* Look inside the argument pack. */
6357 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6358 len
= TREE_VEC_LENGTH (packed_args
);
6361 for (idx
= 0; idx
< len
; ++idx
)
6363 tree targ_parms
= NULL_TREE
;
6366 /* Extract the next argument from the argument
6368 targ
= TREE_VEC_ELT (packed_args
, idx
);
6370 if (PACK_EXPANSION_P (targ
))
6371 /* Look at the pattern of the pack expansion. */
6372 targ
= PACK_EXPANSION_PATTERN (targ
);
6374 /* Extract the template parameters from the template
6376 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6377 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6378 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6379 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6381 /* Verify that we can coerce the template template
6382 parameters from the template argument to the template
6383 parameter. This requires an exact match. */
6385 && !coerce_template_template_parms
6386 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6401 --processing_template_decl
;
6405 /* Since type attributes aren't mangled, we need to strip them from
6406 template type arguments. */
6409 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6412 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6414 mv
= TYPE_MAIN_VARIANT (arg
);
6415 arg
= strip_typedefs (arg
);
6416 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6417 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6419 if (complain
& tf_warning
)
6420 warning (0, "ignoring attributes on template argument %qT", arg
);
6421 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6422 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6427 /* Convert the indicated template ARG as necessary to match the
6428 indicated template PARM. Returns the converted ARG, or
6429 error_mark_node if the conversion was unsuccessful. Error and
6430 warning messages are issued under control of COMPLAIN. This
6431 conversion is for the Ith parameter in the parameter list. ARGS is
6432 the full set of template arguments deduced so far. */
6435 convert_template_argument (tree parm
,
6438 tsubst_flags_t complain
,
6444 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6446 if (TREE_CODE (arg
) == TREE_LIST
6447 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6449 /* The template argument was the name of some
6450 member function. That's usually
6451 invalid, but static members are OK. In any
6452 case, grab the underlying fields/functions
6453 and issue an error later if required. */
6454 orig_arg
= TREE_VALUE (arg
);
6455 TREE_TYPE (arg
) = unknown_type_node
;
6460 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6461 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6462 || requires_tmpl_type
);
6464 /* When determining whether an argument pack expansion is a template,
6465 look at the pattern. */
6466 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6467 arg
= PACK_EXPANSION_PATTERN (arg
);
6469 /* Deal with an injected-class-name used as a template template arg. */
6470 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6472 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6473 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6475 if (cxx_dialect
>= cxx11
)
6476 /* OK under DR 1004. */;
6477 else if (complain
& tf_warning_or_error
)
6478 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6479 " used as template template argument", TYPE_NAME (arg
));
6480 else if (flag_pedantic_errors
)
6488 ((TREE_CODE (arg
) == TEMPLATE_DECL
6489 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6490 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6491 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6492 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6495 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6496 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6497 arg
= TYPE_STUB_DECL (arg
);
6499 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6501 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6502 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6504 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6506 if (complain
& tf_error
)
6507 error ("invalid use of destructor %qE as a type", orig_arg
);
6508 return error_mark_node
;
6511 permerror (input_location
,
6512 "to refer to a type member of a template parameter, "
6513 "use %<typename %E%>", orig_arg
);
6515 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6516 TREE_OPERAND (arg
, 1),
6522 if (is_type
!= requires_type
)
6526 if (complain
& tf_error
)
6528 error ("type/value mismatch at argument %d in template "
6529 "parameter list for %qD",
6532 inform (input_location
,
6533 " expected a constant of type %qT, got %qT",
6535 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6536 else if (requires_tmpl_type
)
6537 inform (input_location
,
6538 " expected a class template, got %qE", orig_arg
);
6540 inform (input_location
,
6541 " expected a type, got %qE", orig_arg
);
6544 return error_mark_node
;
6546 if (is_tmpl_type
^ requires_tmpl_type
)
6548 if (in_decl
&& (complain
& tf_error
))
6550 error ("type/value mismatch at argument %d in template "
6551 "parameter list for %qD",
6554 inform (input_location
,
6555 " expected a type, got %qT", DECL_NAME (arg
));
6557 inform (input_location
,
6558 " expected a class template, got %qT", orig_arg
);
6560 return error_mark_node
;
6565 if (requires_tmpl_type
)
6567 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6569 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6570 /* The number of argument required is not known yet.
6571 Just accept it for now. */
6572 val
= TREE_TYPE (arg
);
6575 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6578 /* Strip alias templates that are equivalent to another
6580 arg
= get_underlying_template (arg
);
6581 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6583 if (coerce_template_template_parms (parmparm
, argparm
,
6589 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6591 if (val
!= error_mark_node
)
6593 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6594 val
= TREE_TYPE (val
);
6595 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6596 val
= make_pack_expansion (val
);
6601 if (in_decl
&& (complain
& tf_error
))
6603 error ("type/value mismatch at argument %d in "
6604 "template parameter list for %qD",
6606 inform (input_location
,
6607 " expected a template of type %qD, got %qT",
6611 val
= error_mark_node
;
6617 /* We only form one instance of each template specialization.
6618 Therefore, if we use a non-canonical variant (i.e., a
6619 typedef), any future messages referring to the type will use
6620 the typedef, which is confusing if those future uses do not
6621 themselves also use the typedef. */
6623 val
= canonicalize_type_argument (val
, complain
);
6627 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6629 if (invalid_nontype_parm_type_p (t
, complain
))
6630 return error_mark_node
;
6632 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6634 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6638 /* Not sure if this is reachable, but it doesn't hurt
6640 error ("type mismatch in nontype parameter pack");
6641 val
= error_mark_node
;
6644 else if (!dependent_template_arg_p (orig_arg
)
6645 && !uses_template_parms (t
))
6646 /* We used to call digest_init here. However, digest_init
6647 will report errors, which we don't want when complain
6648 is zero. More importantly, digest_init will try too
6649 hard to convert things: for example, `0' should not be
6650 converted to pointer type at this point according to
6651 the standard. Accepting this is not merely an
6652 extension, since deciding whether or not these
6653 conversions can occur is part of determining which
6654 function template to call, or whether a given explicit
6655 argument specification is valid. */
6656 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6658 val
= strip_typedefs_expr (orig_arg
);
6660 if (val
== NULL_TREE
)
6661 val
= error_mark_node
;
6662 else if (val
== error_mark_node
&& (complain
& tf_error
))
6663 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6665 if (TREE_CODE (val
) == SCOPE_REF
)
6667 /* Strip typedefs from the SCOPE_REF. */
6668 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6669 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6671 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6672 QUALIFIED_NAME_IS_TEMPLATE (val
));
6679 /* Coerces the remaining template arguments in INNER_ARGS (from
6680 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6681 Returns the coerced argument pack. PARM_IDX is the position of this
6682 parameter in the template parameter list. ARGS is the original
6683 template argument list. */
6685 coerce_template_parameter_pack (tree parms
,
6693 tsubst_flags_t complain
)
6695 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6696 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6699 tree packed_parms
= NULL_TREE
;
6701 if (arg_idx
> nargs
)
6704 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6706 /* When the template parameter is a non-type template parameter pack
6707 or template template parameter pack whose type or template
6708 parameters use parameter packs, we know exactly how many arguments
6709 we are looking for. Build a vector of the instantiated decls for
6710 these template parameters in PACKED_PARMS. */
6711 /* We can't use make_pack_expansion here because it would interpret a
6712 _DECL as a use rather than a declaration. */
6713 tree decl
= TREE_VALUE (parm
);
6714 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6715 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6716 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6717 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6719 TREE_VEC_LENGTH (args
)--;
6720 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6721 TREE_VEC_LENGTH (args
)++;
6723 if (packed_parms
== error_mark_node
)
6724 return error_mark_node
;
6726 /* If we're doing a partial instantiation of a member template,
6727 verify that all of the types used for the non-type
6728 template parameter pack are, in fact, valid for non-type
6729 template parameters. */
6731 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6733 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6734 for (j
= 0; j
< len
; ++j
)
6736 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6737 if (invalid_nontype_parm_type_p (t
, complain
))
6738 return error_mark_node
;
6742 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6745 packed_args
= make_tree_vec (nargs
- arg_idx
);
6747 /* Convert the remaining arguments, which will be a part of the
6748 parameter pack "parm". */
6749 for (; arg_idx
< nargs
; ++arg_idx
)
6751 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6752 tree actual_parm
= TREE_VALUE (parm
);
6753 int pack_idx
= arg_idx
- parm_idx
;
6757 /* Once we've packed as many args as we have types, stop. */
6758 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6760 else if (PACK_EXPANSION_P (arg
))
6761 /* We don't know how many args we have yet, just
6762 use the unconverted ones for now. */
6765 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6768 if (arg
== error_mark_node
)
6770 if (complain
& tf_error
)
6771 error ("template argument %d is invalid", arg_idx
+ 1);
6774 arg
= convert_template_argument (actual_parm
,
6775 arg
, new_args
, complain
, parm_idx
,
6777 if (arg
== error_mark_node
)
6779 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6782 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6783 && TREE_VEC_LENGTH (packed_args
) > 0)
6785 if (complain
& tf_error
)
6786 error ("wrong number of template arguments (%d, should be %d)",
6787 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6788 return error_mark_node
;
6791 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6792 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6793 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6796 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6797 TREE_TYPE (argument_pack
)
6798 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6799 TREE_CONSTANT (argument_pack
) = 1;
6802 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6803 #ifdef ENABLE_CHECKING
6804 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6805 TREE_VEC_LENGTH (packed_args
));
6807 return argument_pack
;
6810 /* Returns the number of pack expansions in the template argument vector
6814 pack_expansion_args_count (tree args
)
6819 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6821 tree elt
= TREE_VEC_ELT (args
, i
);
6822 if (elt
&& PACK_EXPANSION_P (elt
))
6828 /* Convert all template arguments to their appropriate types, and
6829 return a vector containing the innermost resulting template
6830 arguments. If any error occurs, return error_mark_node. Error and
6831 warning messages are issued under control of COMPLAIN.
6833 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6834 for arguments not specified in ARGS. Otherwise, if
6835 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6836 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6837 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6841 coerce_template_parms (tree parms
,
6844 tsubst_flags_t complain
,
6845 bool require_all_args
,
6846 bool use_default_args
)
6848 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6849 tree orig_inner_args
;
6852 tree new_inner_args
;
6853 int saved_unevaluated_operand
;
6854 int saved_inhibit_evaluation_warnings
;
6856 /* When used as a boolean value, indicates whether this is a
6857 variadic template parameter list. Since it's an int, we can also
6858 subtract it from nparms to get the number of non-variadic
6861 int variadic_args_p
= 0;
6862 int post_variadic_parms
= 0;
6864 /* Likewise for parameters with default arguments. */
6867 if (args
== error_mark_node
)
6868 return error_mark_node
;
6870 nparms
= TREE_VEC_LENGTH (parms
);
6872 /* Determine if there are any parameter packs or default arguments. */
6873 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6875 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6877 ++post_variadic_parms
;
6878 if (template_parameter_pack_p (TREE_VALUE (parm
)))
6880 if (TREE_PURPOSE (parm
))
6884 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6885 /* If there are no parameters that follow a parameter pack, we need to
6886 expand any argument packs so that we can deduce a parameter pack from
6887 some non-packed args followed by an argument pack, as in variadic85.C.
6888 If there are such parameters, we need to leave argument packs intact
6889 so the arguments are assigned properly. This can happen when dealing
6890 with a nested class inside a partial specialization of a class
6891 template, as in variadic92.C, or when deducing a template parameter pack
6892 from a sub-declarator, as in variadic114.C. */
6893 if (!post_variadic_parms
)
6894 inner_args
= expand_template_argument_pack (inner_args
);
6896 /* Count any pack expansion args. */
6897 variadic_args_p
= pack_expansion_args_count (inner_args
);
6899 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6900 if ((nargs
> nparms
&& !variadic_p
)
6901 || (nargs
< nparms
- variadic_p
6904 && (!use_default_args
6905 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6906 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6908 if (complain
& tf_error
)
6910 if (variadic_p
|| default_p
)
6912 nparms
-= variadic_p
+ default_p
;
6913 error ("wrong number of template arguments "
6914 "(%d, should be at least %d)", nargs
, nparms
);
6917 error ("wrong number of template arguments "
6918 "(%d, should be %d)", nargs
, nparms
);
6921 inform (input_location
, "provided for %q+D", in_decl
);
6924 return error_mark_node
;
6926 /* We can't pass a pack expansion to a non-pack parameter of an alias
6927 template (DR 1430). */
6928 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
6930 && nargs
- variadic_args_p
< nparms
- variadic_p
)
6932 if (complain
& tf_error
)
6934 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
6936 tree arg
= TREE_VEC_ELT (inner_args
, i
);
6937 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6939 if (PACK_EXPANSION_P (arg
)
6940 && !template_parameter_pack_p (parm
))
6942 error ("pack expansion argument for non-pack parameter "
6943 "%qD of alias template %qD", parm
, in_decl
);
6944 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
6951 return error_mark_node
;
6954 /* We need to evaluate the template arguments, even though this
6955 template-id may be nested within a "sizeof". */
6956 saved_unevaluated_operand
= cp_unevaluated_operand
;
6957 cp_unevaluated_operand
= 0;
6958 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6959 c_inhibit_evaluation_warnings
= 0;
6960 new_inner_args
= make_tree_vec (nparms
);
6961 new_args
= add_outermost_template_args (args
, new_inner_args
);
6962 int pack_adjust
= 0;
6963 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6968 /* Get the Ith template parameter. */
6969 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6971 if (parm
== error_mark_node
)
6973 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6977 /* Calculate the next argument. */
6978 if (arg_idx
< nargs
)
6979 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6983 if (template_parameter_pack_p (TREE_VALUE (parm
))
6984 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6986 /* Some arguments will be placed in the
6987 template parameter pack PARM. */
6988 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6989 inner_args
, arg_idx
,
6993 if (arg
== NULL_TREE
)
6995 /* We don't know how many args we have yet, just use the
6996 unconverted (and still packed) ones for now. */
6997 new_inner_args
= orig_inner_args
;
7002 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7004 /* Store this argument. */
7005 if (arg
== error_mark_node
)
7008 /* We are done with all of the arguments. */
7013 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7014 arg_idx
+= pack_adjust
;
7021 if (PACK_EXPANSION_P (arg
))
7023 /* "If every valid specialization of a variadic template
7024 requires an empty template parameter pack, the template is
7025 ill-formed, no diagnostic required." So check that the
7026 pattern works with this parameter. */
7027 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7028 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7032 if (conv
== error_mark_node
)
7034 inform (input_location
, "so any instantiation with a "
7035 "non-empty parameter pack would be ill-formed");
7038 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7039 /* Recover from missing typename. */
7040 TREE_VEC_ELT (inner_args
, arg_idx
)
7041 = make_pack_expansion (conv
);
7043 /* We don't know how many args we have yet, just
7044 use the unconverted ones for now. */
7045 new_inner_args
= inner_args
;
7050 else if (require_all_args
)
7052 /* There must be a default arg in this case. */
7053 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7055 /* The position of the first default template argument,
7056 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7058 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7059 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7060 arg_idx
- pack_adjust
);
7065 if (arg
== error_mark_node
)
7067 if (complain
& tf_error
)
7068 error ("template argument %d is invalid", arg_idx
+ 1);
7071 /* This only occurs if there was an error in the template
7072 parameter list itself (which we would already have
7073 reported) that we are trying to recover from, e.g., a class
7074 template with a parameter list such as
7075 template<typename..., typename>. */
7078 arg
= convert_template_argument (TREE_VALUE (parm
),
7079 arg
, new_args
, complain
,
7082 if (arg
== error_mark_node
)
7084 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7086 cp_unevaluated_operand
= saved_unevaluated_operand
;
7087 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7089 if (variadic_p
&& arg_idx
< nargs
)
7091 if (complain
& tf_error
)
7093 error ("wrong number of template arguments "
7094 "(%d, should be %d)", nargs
, arg_idx
);
7096 error ("provided for %q+D", in_decl
);
7098 return error_mark_node
;
7102 return error_mark_node
;
7104 #ifdef ENABLE_CHECKING
7105 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7106 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7107 TREE_VEC_LENGTH (new_inner_args
));
7110 return new_inner_args
;
7113 /* Like coerce_template_parms. If PARMS represents all template
7114 parameters levels, this function returns a vector of vectors
7115 representing all the resulting argument levels. Note that in this
7116 case, only the innermost arguments are coerced because the
7117 outermost ones are supposed to have been coerced already.
7119 Otherwise, if PARMS represents only (the innermost) vector of
7120 parameters, this function returns a vector containing just the
7121 innermost resulting arguments. */
7124 coerce_innermost_template_parms (tree parms
,
7127 tsubst_flags_t complain
,
7128 bool require_all_args
,
7129 bool use_default_args
)
7131 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7132 int args_depth
= TMPL_ARGS_DEPTH (args
);
7135 if (parms_depth
> 1)
7137 coerced_args
= make_tree_vec (parms_depth
);
7141 for (level
= parms
, cur_depth
= parms_depth
;
7142 parms_depth
> 0 && level
!= NULL_TREE
;
7143 level
= TREE_CHAIN (level
), --cur_depth
)
7146 if (cur_depth
== args_depth
)
7147 l
= coerce_template_parms (TREE_VALUE (level
),
7148 args
, in_decl
, complain
,
7152 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7154 if (l
== error_mark_node
)
7155 return error_mark_node
;
7157 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7161 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7162 args
, in_decl
, complain
,
7165 return coerced_args
;
7168 /* Returns 1 if template args OT and NT are equivalent. */
7171 template_args_equal (tree ot
, tree nt
)
7175 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7178 if (TREE_CODE (nt
) == TREE_VEC
)
7179 /* For member templates */
7180 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7181 else if (PACK_EXPANSION_P (ot
))
7182 return (PACK_EXPANSION_P (nt
)
7183 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7184 PACK_EXPANSION_PATTERN (nt
))
7185 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7186 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7187 else if (ARGUMENT_PACK_P (ot
))
7192 if (!ARGUMENT_PACK_P (nt
))
7195 opack
= ARGUMENT_PACK_ARGS (ot
);
7196 npack
= ARGUMENT_PACK_ARGS (nt
);
7197 len
= TREE_VEC_LENGTH (opack
);
7198 if (TREE_VEC_LENGTH (npack
) != len
)
7200 for (i
= 0; i
< len
; ++i
)
7201 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7202 TREE_VEC_ELT (npack
, i
)))
7206 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7208 /* We get here probably because we are in the middle of substituting
7209 into the pattern of a pack expansion. In that case the
7210 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7211 interested in. So we want to use the initial pack argument for
7213 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7214 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7215 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7216 return template_args_equal (ot
, nt
);
7218 else if (TYPE_P (nt
))
7219 return TYPE_P (ot
) && same_type_p (ot
, nt
);
7220 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7223 return cp_tree_equal (ot
, nt
);
7226 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7227 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7228 NEWARG_PTR with the offending arguments if they are non-NULL. */
7231 comp_template_args_with_info (tree oldargs
, tree newargs
,
7232 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7236 if (oldargs
== newargs
)
7239 if (!oldargs
|| !newargs
)
7242 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7245 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7247 tree nt
= TREE_VEC_ELT (newargs
, i
);
7248 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7250 if (! template_args_equal (ot
, nt
))
7252 if (oldarg_ptr
!= NULL
)
7254 if (newarg_ptr
!= NULL
)
7262 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7263 of template arguments. Returns 0 otherwise. */
7266 comp_template_args (tree oldargs
, tree newargs
)
7268 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7272 add_pending_template (tree d
)
7274 tree ti
= (TYPE_P (d
)
7275 ? CLASSTYPE_TEMPLATE_INFO (d
)
7276 : DECL_TEMPLATE_INFO (d
));
7277 struct pending_template
*pt
;
7280 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7283 /* We are called both from instantiate_decl, where we've already had a
7284 tinst_level pushed, and instantiate_template, where we haven't.
7286 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7289 push_tinst_level (d
);
7291 pt
= ggc_alloc
<pending_template
> ();
7293 pt
->tinst
= current_tinst_level
;
7294 if (last_pending_template
)
7295 last_pending_template
->next
= pt
;
7297 pending_templates
= pt
;
7299 last_pending_template
= pt
;
7301 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7308 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7309 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7310 documentation for TEMPLATE_ID_EXPR. */
7313 lookup_template_function (tree fns
, tree arglist
)
7317 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7318 return error_mark_node
;
7320 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7322 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7324 error ("%q#D is not a function template", fns
);
7325 return error_mark_node
;
7328 if (BASELINK_P (fns
))
7330 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7332 BASELINK_FUNCTIONS (fns
),
7337 type
= TREE_TYPE (fns
);
7338 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7339 type
= unknown_type_node
;
7341 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7344 /* Within the scope of a template class S<T>, the name S gets bound
7345 (in build_self_reference) to a TYPE_DECL for the class, not a
7346 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7347 or one of its enclosing classes, and that type is a template,
7348 return the associated TEMPLATE_DECL. Otherwise, the original
7351 Also handle the case when DECL is a TREE_LIST of ambiguous
7352 injected-class-names from different bases. */
7355 maybe_get_template_decl_from_type_decl (tree decl
)
7357 if (decl
== NULL_TREE
)
7360 /* DR 176: A lookup that finds an injected-class-name (10.2
7361 [class.member.lookup]) can result in an ambiguity in certain cases
7362 (for example, if it is found in more than one base class). If all of
7363 the injected-class-names that are found refer to specializations of
7364 the same class template, and if the name is followed by a
7365 template-argument-list, the reference refers to the class template
7366 itself and not a specialization thereof, and is not ambiguous. */
7367 if (TREE_CODE (decl
) == TREE_LIST
)
7369 tree t
, tmpl
= NULL_TREE
;
7370 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7372 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7375 else if (tmpl
!= elt
)
7378 if (tmpl
&& t
== NULL_TREE
)
7384 return (decl
!= NULL_TREE
7385 && DECL_SELF_REFERENCE_P (decl
)
7386 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7387 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7390 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7391 parameters, find the desired type.
7393 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7395 IN_DECL, if non-NULL, is the template declaration we are trying to
7398 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7399 the class we are looking up.
7401 Issue error and warning messages under control of COMPLAIN.
7403 If the template class is really a local class in a template
7404 function, then the FUNCTION_CONTEXT is the function in which it is
7407 ??? Note that this function is currently called *twice* for each
7408 template-id: the first time from the parser, while creating the
7409 incomplete type (finish_template_type), and the second type during the
7410 real instantiation (instantiate_template_class). This is surely something
7411 that we want to avoid. It also causes some problems with argument
7412 coercion (see convert_nontype_argument for more information on this). */
7415 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7416 int entering_scope
, tsubst_flags_t complain
)
7418 tree templ
= NULL_TREE
, parmlist
;
7425 if (identifier_p (d1
))
7427 tree value
= innermost_non_namespace_value (d1
);
7428 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7433 push_decl_namespace (context
);
7434 templ
= lookup_name (d1
);
7435 templ
= maybe_get_template_decl_from_type_decl (templ
);
7437 pop_decl_namespace ();
7440 context
= DECL_CONTEXT (templ
);
7442 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7444 tree type
= TREE_TYPE (d1
);
7446 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7447 an implicit typename for the second A. Deal with it. */
7448 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7449 type
= TREE_TYPE (type
);
7451 if (CLASSTYPE_TEMPLATE_INFO (type
))
7453 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7454 d1
= DECL_NAME (templ
);
7457 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7458 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7460 templ
= TYPE_TI_TEMPLATE (d1
);
7461 d1
= DECL_NAME (templ
);
7463 else if (DECL_TYPE_TEMPLATE_P (d1
))
7466 d1
= DECL_NAME (templ
);
7467 context
= DECL_CONTEXT (templ
);
7469 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7472 d1
= DECL_NAME (templ
);
7475 /* Issue an error message if we didn't find a template. */
7478 if (complain
& tf_error
)
7479 error ("%qT is not a template", d1
);
7480 return error_mark_node
;
7483 if (TREE_CODE (templ
) != TEMPLATE_DECL
7484 /* Make sure it's a user visible template, if it was named by
7486 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7487 && !PRIMARY_TEMPLATE_P (templ
)))
7489 if (complain
& tf_error
)
7491 error ("non-template type %qT used as a template", d1
);
7493 error ("for template declaration %q+D", in_decl
);
7495 return error_mark_node
;
7498 complain
&= ~tf_user
;
7500 /* An alias that just changes the name of a template is equivalent to the
7501 other template, so if any of the arguments are pack expansions, strip
7502 the alias to avoid problems with a pack expansion passed to a non-pack
7503 alias template parameter (DR 1430). */
7504 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7505 templ
= get_underlying_template (templ
);
7507 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7509 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7510 template arguments */
7516 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7518 /* Consider an example where a template template parameter declared as
7520 template <class T, class U = std::allocator<T> > class TT
7522 The template parameter level of T and U are one level larger than
7523 of TT. To proper process the default argument of U, say when an
7524 instantiation `TT<int>' is seen, we need to build the full
7525 arguments containing {int} as the innermost level. Outer levels,
7526 available when not appearing as default template argument, can be
7527 obtained from the arguments of the enclosing template.
7529 Suppose that TT is later substituted with std::vector. The above
7530 instantiation is `TT<int, std::allocator<T> >' with TT at
7531 level 1, and T at level 2, while the template arguments at level 1
7532 becomes {std::vector} and the inner level 2 is {int}. */
7534 outer
= DECL_CONTEXT (templ
);
7536 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7537 else if (current_template_parms
)
7538 /* This is an argument of the current template, so we haven't set
7539 DECL_CONTEXT yet. */
7540 outer
= current_template_args ();
7543 arglist
= add_to_template_args (outer
, arglist
);
7545 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7547 /*require_all_args=*/true,
7548 /*use_default_args=*/true);
7549 if (arglist2
== error_mark_node
7550 || (!uses_template_parms (arglist2
)
7551 && check_instantiated_args (templ
, arglist2
, complain
)))
7552 return error_mark_node
;
7554 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7559 tree template_type
= TREE_TYPE (templ
);
7562 tree found
= NULL_TREE
;
7565 int is_dependent_type
;
7566 int use_partial_inst_tmpl
= false;
7568 if (template_type
== error_mark_node
)
7569 /* An error occurred while building the template TEMPL, and a
7570 diagnostic has most certainly been emitted for that
7571 already. Let's propagate that error. */
7572 return error_mark_node
;
7574 gen_tmpl
= most_general_template (templ
);
7575 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7576 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7577 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7579 if (arg_depth
== 1 && parm_depth
> 1)
7581 /* We've been given an incomplete set of template arguments.
7584 template <class T> struct S1 {
7585 template <class U> struct S2 {};
7586 template <class U> struct S2<U*> {};
7589 we will be called with an ARGLIST of `U*', but the
7590 TEMPLATE will be `template <class T> template
7591 <class U> struct S1<T>::S2'. We must fill in the missing
7594 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7596 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7599 /* Now we should have enough arguments. */
7600 gcc_assert (parm_depth
== arg_depth
);
7602 /* From here on, we're only interested in the most general
7605 /* Calculate the BOUND_ARGS. These will be the args that are
7606 actually tsubst'd into the definition to create the
7610 /* We have multiple levels of arguments to coerce, at once. */
7612 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7614 tree bound_args
= make_tree_vec (parm_depth
);
7616 for (i
= saved_depth
,
7617 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7618 i
> 0 && t
!= NULL_TREE
;
7619 --i
, t
= TREE_CHAIN (t
))
7622 if (i
== saved_depth
)
7623 a
= coerce_template_parms (TREE_VALUE (t
),
7626 /*require_all_args=*/true,
7627 /*use_default_args=*/true);
7629 /* Outer levels should have already been coerced. */
7630 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7632 /* Don't process further if one of the levels fails. */
7633 if (a
== error_mark_node
)
7635 /* Restore the ARGLIST to its full size. */
7636 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7637 return error_mark_node
;
7640 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7642 /* We temporarily reduce the length of the ARGLIST so
7643 that coerce_template_parms will see only the arguments
7644 corresponding to the template parameters it is
7646 TREE_VEC_LENGTH (arglist
)--;
7649 /* Restore the ARGLIST to its full size. */
7650 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7652 arglist
= bound_args
;
7656 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7657 INNERMOST_TEMPLATE_ARGS (arglist
),
7660 /*require_all_args=*/true,
7661 /*use_default_args=*/true);
7663 if (arglist
== error_mark_node
)
7664 /* We were unable to bind the arguments. */
7665 return error_mark_node
;
7667 /* In the scope of a template class, explicit references to the
7668 template class refer to the type of the template, not any
7669 instantiation of it. For example, in:
7671 template <class T> class C { void f(C<T>); }
7673 the `C<T>' is just the same as `C'. Outside of the
7674 class, however, such a reference is an instantiation. */
7676 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7677 || currently_open_class (template_type
))
7678 /* comp_template_args is expensive, check it last. */
7679 && comp_template_args (TYPE_TI_ARGS (template_type
),
7681 return template_type
;
7683 /* If we already have this specialization, return it. */
7684 elt
.tmpl
= gen_tmpl
;
7686 hash
= hash_specialization (&elt
);
7687 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7693 is_dependent_type
= uses_template_parms (arglist
);
7695 /* If the deduced arguments are invalid, then the binding
7697 if (!is_dependent_type
7698 && check_instantiated_args (gen_tmpl
,
7699 INNERMOST_TEMPLATE_ARGS (arglist
),
7701 return error_mark_node
;
7703 if (!is_dependent_type
7704 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7705 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7706 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7708 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7709 DECL_NAME (gen_tmpl
),
7710 /*tag_scope=*/ts_global
);
7714 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7716 if (context
== error_mark_node
)
7717 return error_mark_node
;
7720 context
= global_namespace
;
7722 /* Create the type. */
7723 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7725 /* The user referred to a specialization of an alias
7726 template represented by GEN_TMPL.
7728 [temp.alias]/2 says:
7730 When a template-id refers to the specialization of an
7731 alias template, it is equivalent to the associated
7732 type obtained by substitution of its
7733 template-arguments for the template-parameters in the
7734 type-id of the alias template. */
7736 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7737 /* Note that the call above (by indirectly calling
7738 register_specialization in tsubst_decl) registers the
7739 TYPE_DECL representing the specialization of the alias
7740 template. So next time someone substitutes ARGLIST for
7741 the template parms into the alias template (GEN_TMPL),
7742 she'll get that TYPE_DECL back. */
7744 if (t
== error_mark_node
)
7747 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7749 if (!is_dependent_type
)
7751 set_current_access_from_decl (TYPE_NAME (template_type
));
7752 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7753 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7754 arglist
, complain
, in_decl
),
7755 SCOPED_ENUM_P (template_type
), NULL
);
7757 if (t
== error_mark_node
)
7762 /* We don't want to call start_enum for this type, since
7763 the values for the enumeration constants may involve
7764 template parameters. And, no one should be interested
7765 in the enumeration constants for such a type. */
7766 t
= cxx_make_type (ENUMERAL_TYPE
);
7767 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7769 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7770 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7771 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7773 else if (CLASS_TYPE_P (template_type
))
7775 t
= make_class_type (TREE_CODE (template_type
));
7776 CLASSTYPE_DECLARED_CLASS (t
)
7777 = CLASSTYPE_DECLARED_CLASS (template_type
);
7778 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7779 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7781 /* A local class. Make sure the decl gets registered properly. */
7782 if (context
== current_function_decl
)
7783 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7785 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7786 /* This instantiation is another name for the primary
7787 template type. Set the TYPE_CANONICAL field
7789 TYPE_CANONICAL (t
) = template_type
;
7790 else if (any_template_arguments_need_structural_equality_p (arglist
))
7791 /* Some of the template arguments require structural
7792 equality testing, so this template class requires
7793 structural equality testing. */
7794 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7799 /* If we called start_enum or pushtag above, this information
7800 will already be set up. */
7803 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7805 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7806 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7807 DECL_SOURCE_LOCATION (type_decl
)
7808 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7811 type_decl
= TYPE_NAME (t
);
7813 if (CLASS_TYPE_P (template_type
))
7815 TREE_PRIVATE (type_decl
)
7816 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7817 TREE_PROTECTED (type_decl
)
7818 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7819 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7821 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7822 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7826 if (OVERLOAD_TYPE_P (t
)
7827 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7830 = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (template_type
)))
7832 if (!TREE_CHAIN (attributes
))
7833 TYPE_ATTRIBUTES (t
) = attributes
;
7836 = build_tree_list (TREE_PURPOSE (attributes
),
7837 TREE_VALUE (attributes
));
7841 /* Let's consider the explicit specialization of a member
7842 of a class template specialization that is implicitly instantiated,
7847 template<class U> struct M {}; //#0
7852 struct S<int>::M<char> //#1
7856 [temp.expl.spec]/4 says this is valid.
7858 In this case, when we write:
7861 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7864 When we encounter #1, we want to store the partial instantiation
7865 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7867 For all cases other than this "explicit specialization of member of a
7868 class template", we just want to store the most general template into
7869 the CLASSTYPE_TI_TEMPLATE of M.
7871 This case of "explicit specialization of member of a class template"
7873 1/ the enclosing class is an instantiation of, and therefore not
7874 the same as, the context of the most general template, and
7875 2/ we aren't looking at the partial instantiation itself, i.e.
7876 the innermost arguments are not the same as the innermost parms of
7877 the most general template.
7879 So it's only when 1/ and 2/ happens that we want to use the partial
7880 instantiation of the member template in lieu of its most general
7883 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7884 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7885 /* the enclosing class must be an instantiation... */
7886 && CLASS_TYPE_P (context
)
7887 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7889 tree partial_inst_args
;
7890 TREE_VEC_LENGTH (arglist
)--;
7891 ++processing_template_decl
;
7893 tsubst (INNERMOST_TEMPLATE_ARGS
7894 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7895 arglist
, complain
, NULL_TREE
);
7896 --processing_template_decl
;
7897 TREE_VEC_LENGTH (arglist
)++;
7898 use_partial_inst_tmpl
=
7899 /*...and we must not be looking at the partial instantiation
7901 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7905 if (!use_partial_inst_tmpl
)
7906 /* This case is easy; there are no member templates involved. */
7910 /* This is a full instantiation of a member template. Find
7911 the partial instantiation of which this is an instance. */
7913 /* Temporarily reduce by one the number of levels in the ARGLIST
7914 so as to avoid comparing the last set of arguments. */
7915 TREE_VEC_LENGTH (arglist
)--;
7916 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7917 TREE_VEC_LENGTH (arglist
)++;
7918 /* FOUND is either a proper class type, or an alias
7919 template specialization. In the later case, it's a
7920 TYPE_DECL, resulting from the substituting of arguments
7921 for parameters in the TYPE_DECL of the alias template
7922 done earlier. So be careful while getting the template
7924 found
= TREE_CODE (found
) == TYPE_DECL
7925 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7926 : CLASSTYPE_TI_TEMPLATE (found
);
7929 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7932 slot
= htab_find_slot_with_hash (type_specializations
,
7933 &elt
, hash
, INSERT
);
7934 entry
= ggc_alloc
<spec_entry
> ();
7938 /* Note this use of the partial instantiation so we can check it
7939 later in maybe_process_partial_specialization. */
7940 DECL_TEMPLATE_INSTANTIATIONS (found
)
7941 = tree_cons (arglist
, t
,
7942 DECL_TEMPLATE_INSTANTIATIONS (found
));
7944 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
7945 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7946 /* Now that the type has been registered on the instantiations
7947 list, we set up the enumerators. Because the enumeration
7948 constants may involve the enumeration type itself, we make
7949 sure to register the type first, and then create the
7950 constants. That way, doing tsubst_expr for the enumeration
7951 constants won't result in recursive calls here; we'll find
7952 the instantiation and exit above. */
7953 tsubst_enum (template_type
, t
, arglist
);
7955 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7956 /* If the type makes use of template parameters, the
7957 code that generates debugging information will crash. */
7958 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
7960 /* Possibly limit visibility based on template args. */
7961 TREE_PUBLIC (type_decl
) = 1;
7962 determine_visibility (type_decl
);
7964 inherit_targ_abi_tags (t
);
7970 /* Wrapper for lookup_template_class_1. */
7973 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7974 int entering_scope
, tsubst_flags_t complain
)
7977 timevar_push (TV_TEMPLATE_INST
);
7978 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7979 entering_scope
, complain
);
7980 timevar_pop (TV_TEMPLATE_INST
);
7984 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST.
7985 If the ARGLIST refers to any template parameters, the type of the
7986 expression is the unknown_type_node since the template-id could
7987 refer to an explicit or partial specialization. */
7990 lookup_template_variable (tree templ
, tree arglist
)
7993 if (uses_template_parms (arglist
))
7994 type
= unknown_type_node
;
7996 type
= TREE_TYPE (templ
);
7997 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8005 /* True when we should also visit template parameters that occur in
8006 non-deduced contexts. */
8007 bool include_nondeduced_p
;
8008 hash_set
<tree
> *visited
;
8011 /* Called from for_each_template_parm via walk_tree. */
8014 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8017 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8018 tree_fn_t fn
= pfd
->fn
;
8019 void *data
= pfd
->data
;
8022 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8023 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8024 pfd
->include_nondeduced_p
))
8025 return error_mark_node
;
8027 switch (TREE_CODE (t
))
8030 if (TYPE_PTRMEMFUNC_P (t
))
8036 if (!TYPE_TEMPLATE_INFO (t
))
8038 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8039 fn
, data
, pfd
->visited
,
8040 pfd
->include_nondeduced_p
))
8041 return error_mark_node
;
8045 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8046 fn
, data
, pfd
->visited
,
8047 pfd
->include_nondeduced_p
)
8048 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8049 fn
, data
, pfd
->visited
,
8050 pfd
->include_nondeduced_p
))
8051 return error_mark_node
;
8055 /* Since we're not going to walk subtrees, we have to do this
8057 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8058 pfd
->visited
, pfd
->include_nondeduced_p
))
8059 return error_mark_node
;
8063 /* Check the return type. */
8064 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8065 pfd
->include_nondeduced_p
))
8066 return error_mark_node
;
8068 /* Check the parameter types. Since default arguments are not
8069 instantiated until they are needed, the TYPE_ARG_TYPES may
8070 contain expressions that involve template parameters. But,
8071 no-one should be looking at them yet. And, once they're
8072 instantiated, they don't contain template parameters, so
8073 there's no point in looking at them then, either. */
8077 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8078 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8079 pfd
->visited
, pfd
->include_nondeduced_p
))
8080 return error_mark_node
;
8082 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8083 want walk_tree walking into them itself. */
8089 case UNDERLYING_TYPE
:
8090 if (pfd
->include_nondeduced_p
8091 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
8093 pfd
->include_nondeduced_p
))
8094 return error_mark_node
;
8099 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8100 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8101 pfd
->visited
, pfd
->include_nondeduced_p
))
8102 return error_mark_node
;
8107 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8108 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8109 pfd
->visited
, pfd
->include_nondeduced_p
))
8110 return error_mark_node
;
8111 if (DECL_CONTEXT (t
)
8112 && pfd
->include_nondeduced_p
8113 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8114 pfd
->visited
, pfd
->include_nondeduced_p
))
8115 return error_mark_node
;
8118 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8119 /* Record template parameters such as `T' inside `TT<T>'. */
8120 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8121 pfd
->include_nondeduced_p
))
8122 return error_mark_node
;
8125 case TEMPLATE_TEMPLATE_PARM
:
8126 case TEMPLATE_TYPE_PARM
:
8127 case TEMPLATE_PARM_INDEX
:
8128 if (fn
&& (*fn
)(t
, data
))
8129 return error_mark_node
;
8131 return error_mark_node
;
8135 /* A template template parameter is encountered. */
8136 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8137 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8138 pfd
->include_nondeduced_p
))
8139 return error_mark_node
;
8141 /* Already substituted template template parameter */
8147 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8149 pfd
->include_nondeduced_p
))
8150 return error_mark_node
;
8154 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8155 && pfd
->include_nondeduced_p
8156 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8157 (TREE_TYPE (t
)), fn
, data
,
8158 pfd
->visited
, pfd
->include_nondeduced_p
))
8159 return error_mark_node
;
8164 /* If there's no type, then this thing must be some expression
8165 involving template parameters. */
8166 if (!fn
&& !TREE_TYPE (t
))
8167 return error_mark_node
;
8172 case IMPLICIT_CONV_EXPR
:
8173 case REINTERPRET_CAST_EXPR
:
8174 case CONST_CAST_EXPR
:
8175 case STATIC_CAST_EXPR
:
8176 case DYNAMIC_CAST_EXPR
:
8180 case PSEUDO_DTOR_EXPR
:
8182 return error_mark_node
;
8189 /* We didn't find any template parameters we liked. */
8193 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8194 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8195 call FN with the parameter and the DATA.
8196 If FN returns nonzero, the iteration is terminated, and
8197 for_each_template_parm returns 1. Otherwise, the iteration
8198 continues. If FN never returns a nonzero value, the value
8199 returned by for_each_template_parm is 0. If FN is NULL, it is
8200 considered to be the function which always returns 1.
8202 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8203 parameters that occur in non-deduced contexts. When false, only
8204 visits those template parameters that can be deduced. */
8207 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8208 hash_set
<tree
> *visited
,
8209 bool include_nondeduced_p
)
8211 struct pair_fn_data pfd
;
8217 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8219 /* Walk the tree. (Conceptually, we would like to walk without
8220 duplicates, but for_each_template_parm_r recursively calls
8221 for_each_template_parm, so we would need to reorganize a fair
8222 bit to use walk_tree_without_duplicates, so we keep our own
8225 pfd
.visited
= visited
;
8227 pfd
.visited
= new hash_set
<tree
>;
8228 result
= cp_walk_tree (&t
,
8229 for_each_template_parm_r
,
8231 pfd
.visited
) != NULL_TREE
;
8243 /* Returns true if T depends on any template parameter. */
8246 uses_template_parms (tree t
)
8249 int saved_processing_template_decl
;
8251 saved_processing_template_decl
= processing_template_decl
;
8252 if (!saved_processing_template_decl
)
8253 processing_template_decl
= 1;
8255 dependent_p
= dependent_type_p (t
);
8256 else if (TREE_CODE (t
) == TREE_VEC
)
8257 dependent_p
= any_dependent_template_arguments_p (t
);
8258 else if (TREE_CODE (t
) == TREE_LIST
)
8259 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8260 || uses_template_parms (TREE_CHAIN (t
)));
8261 else if (TREE_CODE (t
) == TYPE_DECL
)
8262 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8265 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8266 || TREE_CODE (t
) == OVERLOAD
8269 || TREE_CODE (t
) == TRAIT_EXPR
8270 || TREE_CODE (t
) == CONSTRUCTOR
8271 || CONSTANT_CLASS_P (t
))
8272 dependent_p
= (type_dependent_expression_p (t
)
8273 || value_dependent_expression_p (t
));
8276 gcc_assert (t
== error_mark_node
);
8277 dependent_p
= false;
8280 processing_template_decl
= saved_processing_template_decl
;
8285 /* Returns true iff current_function_decl is an incompletely instantiated
8286 template. Useful instead of processing_template_decl because the latter
8287 is set to 0 during fold_non_dependent_expr. */
8290 in_template_function (void)
8292 tree fn
= current_function_decl
;
8294 ++processing_template_decl
;
8295 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8296 && DECL_TEMPLATE_INFO (fn
)
8297 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8298 --processing_template_decl
;
8302 /* Returns true if T depends on any template parameter with level LEVEL. */
8305 uses_template_parms_level (tree t
, int level
)
8307 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8308 /*include_nondeduced_p=*/true);
8311 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8312 ill-formed translation unit, i.e. a variable or function that isn't
8313 usable in a constant expression. */
8316 neglectable_inst_p (tree d
)
8319 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8320 : decl_maybe_constant_var_p (d
)));
8323 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8324 neglectable and instantiated from within an erroneous instantiation. */
8327 limit_bad_template_recursion (tree decl
)
8329 struct tinst_level
*lev
= current_tinst_level
;
8330 int errs
= errorcount
+ sorrycount
;
8331 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8334 for (; lev
; lev
= lev
->next
)
8335 if (neglectable_inst_p (lev
->decl
))
8338 return (lev
&& errs
> lev
->errors
);
8341 static int tinst_depth
;
8342 extern int max_tinst_depth
;
8345 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8347 /* We're starting to instantiate D; record the template instantiation context
8348 for diagnostics and to restore it later. */
8351 push_tinst_level (tree d
)
8353 return push_tinst_level_loc (d
, input_location
);
8356 /* We're starting to instantiate D; record the template instantiation context
8357 at LOC for diagnostics and to restore it later. */
8360 push_tinst_level_loc (tree d
, location_t loc
)
8362 struct tinst_level
*new_level
;
8364 if (tinst_depth
>= max_tinst_depth
)
8366 fatal_error ("template instantiation depth exceeds maximum of %d"
8367 " (use -ftemplate-depth= to increase the maximum)",
8372 /* If the current instantiation caused problems, don't let it instantiate
8373 anything else. Do allow deduction substitution and decls usable in
8374 constant expressions. */
8375 if (limit_bad_template_recursion (d
))
8378 new_level
= ggc_alloc
<tinst_level
> ();
8379 new_level
->decl
= d
;
8380 new_level
->locus
= loc
;
8381 new_level
->errors
= errorcount
+sorrycount
;
8382 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8383 new_level
->next
= current_tinst_level
;
8384 current_tinst_level
= new_level
;
8387 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8388 depth_reached
= tinst_depth
;
8393 /* We're done instantiating this template; return to the instantiation
8397 pop_tinst_level (void)
8399 /* Restore the filename and line number stashed away when we started
8400 this instantiation. */
8401 input_location
= current_tinst_level
->locus
;
8402 current_tinst_level
= current_tinst_level
->next
;
8406 /* We're instantiating a deferred template; restore the template
8407 instantiation context in which the instantiation was requested, which
8408 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8411 reopen_tinst_level (struct tinst_level
*level
)
8413 struct tinst_level
*t
;
8416 for (t
= level
; t
; t
= t
->next
)
8419 current_tinst_level
= level
;
8421 if (current_tinst_level
)
8422 current_tinst_level
->errors
= errorcount
+sorrycount
;
8426 /* Returns the TINST_LEVEL which gives the original instantiation
8429 struct tinst_level
*
8430 outermost_tinst_level (void)
8432 struct tinst_level
*level
= current_tinst_level
;
8435 level
= level
->next
;
8439 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8440 vector of template arguments, as for tsubst.
8442 Returns an appropriate tsubst'd friend declaration. */
8445 tsubst_friend_function (tree decl
, tree args
)
8449 if (TREE_CODE (decl
) == FUNCTION_DECL
8450 && DECL_TEMPLATE_INSTANTIATION (decl
)
8451 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8452 /* This was a friend declared with an explicit template
8453 argument list, e.g.:
8457 to indicate that f was a template instantiation, not a new
8458 function declaration. Now, we have to figure out what
8459 instantiation of what template. */
8461 tree template_id
, arglist
, fns
;
8464 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8466 /* Friend functions are looked up in the containing namespace scope.
8467 We must enter that scope, to avoid finding member functions of the
8468 current class with same name. */
8469 push_nested_namespace (ns
);
8470 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8471 tf_warning_or_error
, NULL_TREE
,
8472 /*integral_constant_expression_p=*/false);
8473 pop_nested_namespace (ns
);
8474 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8475 tf_warning_or_error
, NULL_TREE
);
8476 template_id
= lookup_template_function (fns
, arglist
);
8478 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8479 tmpl
= determine_specialization (template_id
, new_friend
,
8481 /*need_member_template=*/0,
8482 TREE_VEC_LENGTH (args
),
8484 return instantiate_template (tmpl
, new_args
, tf_error
);
8487 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8489 /* The NEW_FRIEND will look like an instantiation, to the
8490 compiler, but is not an instantiation from the point of view of
8491 the language. For example, we might have had:
8493 template <class T> struct S {
8494 template <class U> friend void f(T, U);
8497 Then, in S<int>, template <class U> void f(int, U) is not an
8498 instantiation of anything. */
8499 if (new_friend
== error_mark_node
)
8500 return error_mark_node
;
8502 DECL_USE_TEMPLATE (new_friend
) = 0;
8503 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8505 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8506 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8507 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8510 /* The mangled name for the NEW_FRIEND is incorrect. The function
8511 is not a template instantiation and should not be mangled like
8512 one. Therefore, we forget the mangling here; we'll recompute it
8513 later if we need it. */
8514 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8516 SET_DECL_RTL (new_friend
, NULL
);
8517 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8520 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8523 tree new_friend_template_info
;
8524 tree new_friend_result_template_info
;
8526 int new_friend_is_defn
;
8528 /* We must save some information from NEW_FRIEND before calling
8529 duplicate decls since that function will free NEW_FRIEND if
8531 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8532 new_friend_is_defn
=
8533 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8534 (template_for_substitution (new_friend
)))
8536 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8538 /* This declaration is a `primary' template. */
8539 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8541 new_friend_result_template_info
8542 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8545 new_friend_result_template_info
= NULL_TREE
;
8547 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8548 if (new_friend_is_defn
)
8549 DECL_INITIAL (new_friend
) = error_mark_node
;
8551 /* Inside pushdecl_namespace_level, we will push into the
8552 current namespace. However, the friend function should go
8553 into the namespace of the template. */
8554 ns
= decl_namespace_context (new_friend
);
8555 push_nested_namespace (ns
);
8556 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8557 pop_nested_namespace (ns
);
8559 if (old_decl
== error_mark_node
)
8560 return error_mark_node
;
8562 if (old_decl
!= new_friend
)
8564 /* This new friend declaration matched an existing
8565 declaration. For example, given:
8567 template <class T> void f(T);
8568 template <class U> class C {
8569 template <class T> friend void f(T) {}
8572 the friend declaration actually provides the definition
8573 of `f', once C has been instantiated for some type. So,
8574 old_decl will be the out-of-class template declaration,
8575 while new_friend is the in-class definition.
8577 But, if `f' was called before this point, the
8578 instantiation of `f' will have DECL_TI_ARGS corresponding
8579 to `T' but not to `U', references to which might appear
8580 in the definition of `f'. Previously, the most general
8581 template for an instantiation of `f' was the out-of-class
8582 version; now it is the in-class version. Therefore, we
8583 run through all specialization of `f', adding to their
8584 DECL_TI_ARGS appropriately. In particular, they need a
8585 new set of outer arguments, corresponding to the
8586 arguments for this class instantiation.
8588 The same situation can arise with something like this:
8591 template <class T> class C {
8595 when `C<int>' is instantiated. Now, `f(int)' is defined
8598 if (!new_friend_is_defn
)
8599 /* On the other hand, if the in-class declaration does
8600 *not* provide a definition, then we don't want to alter
8601 existing definitions. We can just leave everything
8606 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8607 tree new_args
= TI_ARGS (new_friend_template_info
);
8609 /* Overwrite whatever template info was there before, if
8610 any, with the new template information pertaining to
8612 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8614 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8616 /* We should have called reregister_specialization in
8618 gcc_assert (retrieve_specialization (new_template
,
8622 /* Instantiate it if the global has already been used. */
8623 if (DECL_ODR_USED (old_decl
))
8624 instantiate_decl (old_decl
, /*defer_ok=*/true,
8625 /*expl_inst_class_mem_p=*/false);
8631 /* Indicate that the old function template is a partial
8633 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8634 = new_friend_result_template_info
;
8636 gcc_assert (new_template
8637 == most_general_template (new_template
));
8638 gcc_assert (new_template
!= old_decl
);
8640 /* Reassign any specializations already in the hash table
8641 to the new more general template, and add the
8642 additional template args. */
8643 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8647 tree spec
= TREE_VALUE (t
);
8650 elt
.tmpl
= old_decl
;
8651 elt
.args
= DECL_TI_ARGS (spec
);
8652 elt
.spec
= NULL_TREE
;
8654 htab_remove_elt (decl_specializations
, &elt
);
8657 = add_outermost_template_args (new_args
,
8658 DECL_TI_ARGS (spec
));
8660 register_specialization
8661 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8664 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8668 /* The information from NEW_FRIEND has been merged into OLD_DECL
8669 by duplicate_decls. */
8670 new_friend
= old_decl
;
8675 tree context
= DECL_CONTEXT (new_friend
);
8679 template <class T> class C {
8680 template <class U> friend void C1<U>::f (); // case 1
8681 friend void C2<T>::f (); // case 2
8683 we only need to make sure CONTEXT is a complete type for
8684 case 2. To distinguish between the two cases, we note that
8685 CONTEXT of case 1 remains dependent type after tsubst while
8686 this isn't true for case 2. */
8687 ++processing_template_decl
;
8688 dependent_p
= dependent_type_p (context
);
8689 --processing_template_decl
;
8692 && !complete_type_or_else (context
, NULL_TREE
))
8693 return error_mark_node
;
8695 if (COMPLETE_TYPE_P (context
))
8697 tree fn
= new_friend
;
8698 /* do_friend adds the TEMPLATE_DECL for any member friend
8699 template even if it isn't a member template, i.e.
8700 template <class T> friend A<T>::f();
8701 Look through it in that case. */
8702 if (TREE_CODE (fn
) == TEMPLATE_DECL
8703 && !PRIMARY_TEMPLATE_P (fn
))
8704 fn
= DECL_TEMPLATE_RESULT (fn
);
8705 /* Check to see that the declaration is really present, and,
8706 possibly obtain an improved declaration. */
8707 fn
= check_classfn (context
, fn
, NULL_TREE
);
8717 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8718 template arguments, as for tsubst.
8720 Returns an appropriate tsubst'd friend type or error_mark_node on
8724 tsubst_friend_class (tree friend_tmpl
, tree args
)
8730 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8732 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8733 return TREE_TYPE (t
);
8736 context
= CP_DECL_CONTEXT (friend_tmpl
);
8738 if (context
!= global_namespace
)
8740 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8741 push_nested_namespace (context
);
8743 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8746 /* Look for a class template declaration. We look for hidden names
8747 because two friend declarations of the same template are the
8748 same. For example, in:
8751 template <typename> friend class F;
8753 template <typename> struct B {
8754 template <typename> friend class F;
8757 both F templates are the same. */
8758 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8759 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8761 /* But, if we don't find one, it might be because we're in a
8762 situation like this:
8770 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8771 for `S<int>', not the TEMPLATE_DECL. */
8772 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8774 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8775 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8778 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8780 /* The friend template has already been declared. Just
8781 check to see that the declarations match, and install any new
8782 default parameters. We must tsubst the default parameters,
8783 of course. We only need the innermost template parameters
8784 because that is all that redeclare_class_template will look
8786 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8787 > TMPL_ARGS_DEPTH (args
))
8790 location_t saved_input_location
;
8791 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8792 args
, tf_warning_or_error
);
8794 saved_input_location
= input_location
;
8795 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8796 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8797 input_location
= saved_input_location
;
8801 friend_type
= TREE_TYPE (tmpl
);
8805 /* The friend template has not already been declared. In this
8806 case, the instantiation of the template class will cause the
8807 injection of this template into the global scope. */
8808 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8809 if (tmpl
== error_mark_node
)
8810 return error_mark_node
;
8812 /* The new TMPL is not an instantiation of anything, so we
8813 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8814 the new type because that is supposed to be the corresponding
8815 template decl, i.e., TMPL. */
8816 DECL_USE_TEMPLATE (tmpl
) = 0;
8817 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8818 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8819 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8820 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8822 /* Inject this template into the global scope. */
8823 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8826 if (context
!= global_namespace
)
8828 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8829 pop_nested_namespace (context
);
8831 pop_nested_class ();
8837 /* Returns zero if TYPE cannot be completed later due to circularity.
8838 Otherwise returns one. */
8841 can_complete_type_without_circularity (tree type
)
8843 if (type
== NULL_TREE
|| type
== error_mark_node
)
8845 else if (COMPLETE_TYPE_P (type
))
8847 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8848 return can_complete_type_without_circularity (TREE_TYPE (type
));
8849 else if (CLASS_TYPE_P (type
)
8850 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8856 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
8858 /* Apply any attributes which had to be deferred until instantiation
8859 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8860 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8863 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8864 tree args
, tsubst_flags_t complain
, tree in_decl
)
8866 tree last_dep
= NULL_TREE
;
8870 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8871 if (ATTR_IS_DEPENDENT (t
))
8874 attributes
= copy_list (attributes
);
8878 if (DECL_P (*decl_p
))
8880 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8882 p
= &DECL_ATTRIBUTES (*decl_p
);
8885 p
= &TYPE_ATTRIBUTES (*decl_p
);
8889 tree late_attrs
= NULL_TREE
;
8890 tree
*q
= &late_attrs
;
8892 for (*p
= attributes
; *p
; )
8895 if (ATTR_IS_DEPENDENT (t
))
8897 *p
= TREE_CHAIN (t
);
8898 TREE_CHAIN (t
) = NULL_TREE
;
8899 if ((flag_openmp
|| flag_cilkplus
)
8900 && is_attribute_p ("omp declare simd",
8901 get_attribute_name (t
))
8904 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
8905 clauses
= tsubst_omp_clauses (clauses
, true, args
,
8907 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
8908 clauses
= finish_omp_clauses (clauses
);
8909 tree parms
= DECL_ARGUMENTS (*decl_p
);
8911 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
8913 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
8915 TREE_VALUE (t
) = NULL_TREE
;
8917 /* If the first attribute argument is an identifier, don't
8918 pass it through tsubst. Attributes like mode, format,
8919 cleanup and several target specific attributes expect it
8921 else if (attribute_takes_identifier_p (get_attribute_name (t
))
8925 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8927 /*integral_constant_expression_p=*/false);
8928 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8930 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8935 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8936 /*integral_constant_expression_p=*/false);
8938 q
= &TREE_CHAIN (t
);
8941 p
= &TREE_CHAIN (t
);
8944 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8948 /* Perform (or defer) access check for typedefs that were referenced
8949 from within the template TMPL code.
8950 This is a subroutine of instantiate_decl and instantiate_class_template.
8951 TMPL is the template to consider and TARGS is the list of arguments of
8955 perform_typedefs_access_check (tree tmpl
, tree targs
)
8957 location_t saved_location
;
8959 qualified_typedef_usage_t
*iter
;
8962 || (!CLASS_TYPE_P (tmpl
)
8963 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8966 saved_location
= input_location
;
8967 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8969 tree type_decl
= iter
->typedef_decl
;
8970 tree type_scope
= iter
->context
;
8972 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8975 if (uses_template_parms (type_decl
))
8976 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8977 if (uses_template_parms (type_scope
))
8978 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8980 /* Make access check error messages point to the location
8981 of the use of the typedef. */
8982 input_location
= iter
->locus
;
8983 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8984 type_decl
, type_decl
,
8985 tf_warning_or_error
);
8987 input_location
= saved_location
;
8991 instantiate_class_template_1 (tree type
)
8993 tree templ
, args
, pattern
, t
, member
;
8997 unsigned int saved_maximum_field_alignment
;
9000 if (type
== error_mark_node
)
9001 return error_mark_node
;
9003 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9004 || uses_template_parms (type
))
9007 /* Figure out which template is being instantiated. */
9008 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9009 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9011 /* Determine what specialization of the original template to
9013 t
= most_specialized_class (type
, tf_warning_or_error
);
9014 if (t
== error_mark_node
)
9016 TYPE_BEING_DEFINED (type
) = 1;
9017 return error_mark_node
;
9021 /* This TYPE is actually an instantiation of a partial
9022 specialization. We replace the innermost set of ARGS with
9023 the arguments appropriate for substitution. For example,
9026 template <class T> struct S {};
9027 template <class T> struct S<T*> {};
9029 and supposing that we are instantiating S<int*>, ARGS will
9030 presently be {int*} -- but we need {int}. */
9031 pattern
= TREE_TYPE (t
);
9032 args
= TREE_PURPOSE (t
);
9036 pattern
= TREE_TYPE (templ
);
9037 args
= CLASSTYPE_TI_ARGS (type
);
9040 /* If the template we're instantiating is incomplete, then clearly
9041 there's nothing we can do. */
9042 if (!COMPLETE_TYPE_P (pattern
))
9045 /* If we've recursively instantiated too many templates, stop. */
9046 if (! push_tinst_level (type
))
9049 /* Now we're really doing the instantiation. Mark the type as in
9050 the process of being defined. */
9051 TYPE_BEING_DEFINED (type
) = 1;
9053 /* We may be in the middle of deferred access check. Disable
9055 push_deferring_access_checks (dk_no_deferred
);
9057 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9058 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9059 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9060 fn_context
= error_mark_node
;
9062 push_to_top_level ();
9063 /* Use #pragma pack from the template context. */
9064 saved_maximum_field_alignment
= maximum_field_alignment
;
9065 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9067 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9069 /* Set the input location to the most specialized template definition.
9070 This is needed if tsubsting causes an error. */
9071 typedecl
= TYPE_MAIN_DECL (pattern
);
9072 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9073 DECL_SOURCE_LOCATION (typedecl
);
9075 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9076 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9077 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9078 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9079 if (ANON_AGGR_TYPE_P (pattern
))
9080 SET_ANON_AGGR_TYPE_P (type
);
9081 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9083 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9084 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9085 /* Adjust visibility for template arguments. */
9086 determine_visibility (TYPE_MAIN_DECL (type
));
9088 if (CLASS_TYPE_P (type
))
9089 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9091 pbinfo
= TYPE_BINFO (pattern
);
9093 /* We should never instantiate a nested class before its enclosing
9094 class; we need to look up the nested class by name before we can
9095 instantiate it, and that lookup should instantiate the enclosing
9097 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9098 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9100 base_list
= NULL_TREE
;
9101 if (BINFO_N_BASE_BINFOS (pbinfo
))
9107 /* We must enter the scope containing the type, as that is where
9108 the accessibility of types named in dependent bases are
9110 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9112 /* Substitute into each of the bases to determine the actual
9114 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9117 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9118 tree expanded_bases
= NULL_TREE
;
9121 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9124 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9125 args
, tf_error
, NULL_TREE
);
9126 if (expanded_bases
== error_mark_node
)
9129 len
= TREE_VEC_LENGTH (expanded_bases
);
9132 for (idx
= 0; idx
< len
; idx
++)
9135 /* Extract the already-expanded base class. */
9136 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9138 /* Substitute to figure out the base class. */
9139 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9142 if (base
== error_mark_node
)
9145 base_list
= tree_cons (access
, base
, base_list
);
9146 if (BINFO_VIRTUAL_P (pbase_binfo
))
9147 TREE_TYPE (base_list
) = integer_type_node
;
9151 /* The list is now in reverse order; correct that. */
9152 base_list
= nreverse (base_list
);
9155 pop_scope (pushed_scope
);
9157 /* Now call xref_basetypes to set up all the base-class
9159 xref_basetypes (type
, base_list
);
9161 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9162 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9163 args
, tf_error
, NULL_TREE
);
9164 fixup_attribute_variants (type
);
9166 /* Now that our base classes are set up, enter the scope of the
9167 class, so that name lookups into base classes, etc. will work
9168 correctly. This is precisely analogous to what we do in
9169 begin_class_definition when defining an ordinary non-template
9170 class, except we also need to push the enclosing classes. */
9171 push_nested_class (type
);
9173 /* Now members are processed in the order of declaration. */
9174 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9175 member
; member
= TREE_CHAIN (member
))
9177 tree t
= TREE_VALUE (member
);
9179 if (TREE_PURPOSE (member
))
9183 /* Build new CLASSTYPE_NESTED_UTDS. */
9186 bool class_template_p
;
9188 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9189 && TYPE_LANG_SPECIFIC (t
)
9190 && CLASSTYPE_IS_TEMPLATE (t
));
9191 /* If the member is a class template, then -- even after
9192 substitution -- there may be dependent types in the
9193 template argument list for the class. We increment
9194 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9195 that function will assume that no types are dependent
9196 when outside of a template. */
9197 if (class_template_p
)
9198 ++processing_template_decl
;
9199 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9200 if (class_template_p
)
9201 --processing_template_decl
;
9202 if (newtag
== error_mark_node
)
9205 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9207 tree name
= TYPE_IDENTIFIER (t
);
9209 if (class_template_p
)
9210 /* Unfortunately, lookup_template_class sets
9211 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9212 instantiation (i.e., for the type of a member
9213 template class nested within a template class.)
9214 This behavior is required for
9215 maybe_process_partial_specialization to work
9216 correctly, but is not accurate in this case;
9217 the TAG is not an instantiation of anything.
9218 (The corresponding TEMPLATE_DECL is an
9219 instantiation, but the TYPE is not.) */
9220 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9222 /* Now, we call pushtag to put this NEWTAG into the scope of
9223 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9224 pushtag calling push_template_decl. We don't have to do
9225 this for enums because it will already have been done in
9228 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9229 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9232 else if (DECL_DECLARES_FUNCTION_P (t
))
9234 /* Build new TYPE_METHODS. */
9237 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9238 ++processing_template_decl
;
9239 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9240 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9241 --processing_template_decl
;
9242 set_current_access_from_decl (r
);
9243 finish_member_declaration (r
);
9244 /* Instantiate members marked with attribute used. */
9245 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9247 if (TREE_CODE (r
) == FUNCTION_DECL
9248 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9249 cp_check_omp_declare_reduction (r
);
9251 else if (DECL_CLASS_TEMPLATE_P (t
)
9252 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9253 /* A closure type for a lambda in a default argument for a
9254 member template. Ignore it; it will be instantiated with
9255 the default argument. */;
9258 /* Build new TYPE_FIELDS. */
9259 if (TREE_CODE (t
) == STATIC_ASSERT
)
9263 ++c_inhibit_evaluation_warnings
;
9265 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9266 tf_warning_or_error
, NULL_TREE
,
9267 /*integral_constant_expression_p=*/true);
9268 --c_inhibit_evaluation_warnings
;
9270 finish_static_assert (condition
,
9271 STATIC_ASSERT_MESSAGE (t
),
9272 STATIC_ASSERT_SOURCE_LOCATION (t
),
9275 else if (TREE_CODE (t
) != CONST_DECL
)
9278 tree vec
= NULL_TREE
;
9281 /* The file and line for this declaration, to
9282 assist in error message reporting. Since we
9283 called push_tinst_level above, we don't need to
9285 input_location
= DECL_SOURCE_LOCATION (t
);
9287 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9288 ++processing_template_decl
;
9289 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9290 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9291 --processing_template_decl
;
9293 if (TREE_CODE (r
) == TREE_VEC
)
9295 /* A capture pack became multiple fields. */
9297 len
= TREE_VEC_LENGTH (vec
);
9300 for (int i
= 0; i
< len
; ++i
)
9303 r
= TREE_VEC_ELT (vec
, i
);
9308 [t]he initialization (and any associated
9309 side-effects) of a static data member does
9310 not occur unless the static data member is
9311 itself used in a way that requires the
9312 definition of the static data member to
9315 Therefore, we do not substitute into the
9316 initialized for the static data member here. */
9317 finish_static_data_member_decl
9320 /*init_const_expr_p=*/false,
9321 /*asmspec_tree=*/NULL_TREE
,
9323 /* Instantiate members marked with attribute used. */
9324 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9327 else if (TREE_CODE (r
) == FIELD_DECL
)
9329 /* Determine whether R has a valid type and can be
9330 completed later. If R is invalid, then its type
9331 is replaced by error_mark_node. */
9332 tree rtype
= TREE_TYPE (r
);
9333 if (can_complete_type_without_circularity (rtype
))
9334 complete_type (rtype
);
9336 if (!COMPLETE_TYPE_P (rtype
))
9338 cxx_incomplete_type_error (r
, rtype
);
9339 TREE_TYPE (r
) = error_mark_node
;
9343 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9344 such a thing will already have been added to the field
9345 list by tsubst_enum in finish_member_declaration in the
9346 CLASSTYPE_NESTED_UTDS case above. */
9347 if (!(TREE_CODE (r
) == TYPE_DECL
9348 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9349 && DECL_ARTIFICIAL (r
)))
9351 set_current_access_from_decl (r
);
9352 finish_member_declaration (r
);
9360 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9361 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9363 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9365 tree friend_type
= t
;
9366 bool adjust_processing_template_decl
= false;
9368 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9370 /* template <class T> friend class C; */
9371 friend_type
= tsubst_friend_class (friend_type
, args
);
9372 adjust_processing_template_decl
= true;
9374 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9376 /* template <class T> friend class C::D; */
9377 friend_type
= tsubst (friend_type
, args
,
9378 tf_warning_or_error
, NULL_TREE
);
9379 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9380 friend_type
= TREE_TYPE (friend_type
);
9381 adjust_processing_template_decl
= true;
9383 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9384 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9386 /* This could be either
9390 when dependent_type_p is false or
9392 template <class U> friend class T::C;
9395 friend_type
= tsubst (friend_type
, args
,
9396 tf_warning_or_error
, NULL_TREE
);
9397 /* Bump processing_template_decl for correct
9398 dependent_type_p calculation. */
9399 ++processing_template_decl
;
9400 if (dependent_type_p (friend_type
))
9401 adjust_processing_template_decl
= true;
9402 --processing_template_decl
;
9404 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9405 && hidden_name_p (TYPE_NAME (friend_type
)))
9409 where C hasn't been declared yet. Let's lookup name
9410 from namespace scope directly, bypassing any name that
9411 come from dependent base class. */
9412 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9414 /* The call to xref_tag_from_type does injection for friend
9416 push_nested_namespace (ns
);
9418 xref_tag_from_type (friend_type
, NULL_TREE
,
9419 /*tag_scope=*/ts_current
);
9420 pop_nested_namespace (ns
);
9422 else if (uses_template_parms (friend_type
))
9423 /* friend class C<T>; */
9424 friend_type
= tsubst (friend_type
, args
,
9425 tf_warning_or_error
, NULL_TREE
);
9430 where C is already declared or
9432 friend class C<int>;
9434 We don't have to do anything in these cases. */
9436 if (adjust_processing_template_decl
)
9437 /* Trick make_friend_class into realizing that the friend
9438 we're adding is a template, not an ordinary class. It's
9439 important that we use make_friend_class since it will
9440 perform some error-checking and output cross-reference
9442 ++processing_template_decl
;
9444 if (friend_type
!= error_mark_node
)
9445 make_friend_class (type
, friend_type
, /*complain=*/false);
9447 if (adjust_processing_template_decl
)
9448 --processing_template_decl
;
9452 /* Build new DECL_FRIENDLIST. */
9455 /* The file and line for this declaration, to
9456 assist in error message reporting. Since we
9457 called push_tinst_level above, we don't need to
9459 input_location
= DECL_SOURCE_LOCATION (t
);
9461 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9463 ++processing_template_decl
;
9464 push_deferring_access_checks (dk_no_check
);
9467 r
= tsubst_friend_function (t
, args
);
9468 add_friend (type
, r
, /*complain=*/false);
9469 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9471 pop_deferring_access_checks ();
9472 --processing_template_decl
;
9478 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9480 tree decl
= lambda_function (type
);
9483 if (!DECL_TEMPLATE_INFO (decl
)
9484 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9485 instantiate_decl (decl
, false, false);
9487 /* We need to instantiate the capture list from the template
9488 after we've instantiated the closure members, but before we
9489 consider adding the conversion op. Also keep any captures
9490 that may have been added during instantiation of the op(). */
9491 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9493 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9494 args
, tf_warning_or_error
, NULL_TREE
,
9497 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9498 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9500 maybe_add_lambda_conv_op (type
);
9503 gcc_assert (errorcount
);
9506 /* Set the file and line number information to whatever is given for
9507 the class itself. This puts error messages involving generated
9508 implicit functions at a predictable point, and the same point
9509 that would be used for non-template classes. */
9510 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9512 unreverse_member_declarations (type
);
9513 finish_struct_1 (type
);
9514 TYPE_BEING_DEFINED (type
) = 0;
9516 /* We don't instantiate default arguments for member functions. 14.7.1:
9518 The implicit instantiation of a class template specialization causes
9519 the implicit instantiation of the declarations, but not of the
9520 definitions or default arguments, of the class member functions,
9521 member classes, static data members and member templates.... */
9523 /* Some typedefs referenced from within the template code need to be access
9524 checked at template instantiation time, i.e now. These types were
9525 added to the template at parsing time. Let's get those and perform
9526 the access checks then. */
9527 perform_typedefs_access_check (pattern
, args
);
9528 perform_deferred_access_checks (tf_warning_or_error
);
9529 pop_nested_class ();
9530 maximum_field_alignment
= saved_maximum_field_alignment
;
9532 pop_from_top_level ();
9533 pop_deferring_access_checks ();
9536 /* The vtable for a template class can be emitted in any translation
9537 unit in which the class is instantiated. When there is no key
9538 method, however, finish_struct_1 will already have added TYPE to
9539 the keyed_classes list. */
9540 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9541 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9546 /* Wrapper for instantiate_class_template_1. */
9549 instantiate_class_template (tree type
)
9552 timevar_push (TV_TEMPLATE_INST
);
9553 ret
= instantiate_class_template_1 (type
);
9554 timevar_pop (TV_TEMPLATE_INST
);
9559 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9565 else if (TYPE_P (t
))
9566 r
= tsubst (t
, args
, complain
, in_decl
);
9569 if (!(complain
& tf_warning
))
9570 ++c_inhibit_evaluation_warnings
;
9571 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9572 /*integral_constant_expression_p=*/true);
9573 if (!(complain
& tf_warning
))
9574 --c_inhibit_evaluation_warnings
;
9579 /* Given a function parameter pack TMPL_PARM and some function parameters
9580 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9581 and set *SPEC_P to point at the next point in the list. */
9584 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9586 /* Collect all of the extra "packed" parameters into an
9590 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9591 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9592 tree spec_parm
= *spec_p
;
9595 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9597 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9600 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9601 parmvec
= make_tree_vec (len
);
9602 parmtypevec
= make_tree_vec (len
);
9603 spec_parm
= *spec_p
;
9604 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9606 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9607 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9610 /* Build the argument packs. */
9611 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9612 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9613 TREE_TYPE (argpack
) = argtypepack
;
9614 *spec_p
= spec_parm
;
9619 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9620 NONTYPE_ARGUMENT_PACK. */
9623 make_fnparm_pack (tree spec_parm
)
9625 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9628 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9632 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9634 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9635 if (i
>= TREE_VEC_LENGTH (vec
))
9637 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9641 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9644 make_argument_pack_select (tree arg_pack
, unsigned index
)
9646 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9648 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9649 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9654 /* This is a subroutine of tsubst_pack_expansion.
9656 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9657 mechanism to store the (non complete list of) arguments of the
9658 substitution and return a non substituted pack expansion, in order
9659 to wait for when we have enough arguments to really perform the
9663 use_pack_expansion_extra_args_p (tree parm_packs
,
9667 /* If one pack has an expansion and another pack has a normal
9668 argument or if one pack has an empty argument and an another
9669 one hasn't then tsubst_pack_expansion cannot perform the
9670 substitution and need to fall back on the
9671 PACK_EXPANSION_EXTRA mechanism. */
9672 if (parm_packs
== NULL_TREE
)
9674 else if (has_empty_arg
)
9677 bool has_expansion_arg
= false;
9678 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9680 bool has_non_expansion_arg
= false;
9681 for (tree parm_pack
= parm_packs
;
9683 parm_pack
= TREE_CHAIN (parm_pack
))
9685 tree arg
= TREE_VALUE (parm_pack
);
9687 if (argument_pack_element_is_expansion_p (arg
, i
))
9688 has_expansion_arg
= true;
9690 has_non_expansion_arg
= true;
9693 if (has_expansion_arg
&& has_non_expansion_arg
)
9699 /* [temp.variadic]/6 says that:
9701 The instantiation of a pack expansion [...]
9702 produces a list E1,E2, ..., En, where N is the number of elements
9703 in the pack expansion parameters.
9705 This subroutine of tsubst_pack_expansion produces one of these Ei.
9707 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9708 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9709 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9710 INDEX is the index 'i' of the element Ei to produce. ARGS,
9711 COMPLAIN, and IN_DECL are the same parameters as for the
9712 tsubst_pack_expansion function.
9714 The function returns the resulting Ei upon successful completion,
9717 Note that this function possibly modifies the ARGS parameter, so
9718 it's the responsibility of the caller to restore it. */
9721 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9724 tree args
/* This parm gets
9726 tsubst_flags_t complain
,
9730 bool ith_elem_is_expansion
= false;
9732 /* For each parameter pack, change the substitution of the parameter
9733 pack to the ith argument in its argument pack, then expand the
9735 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9737 tree parm
= TREE_PURPOSE (pack
);
9738 tree arg_pack
= TREE_VALUE (pack
);
9739 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9741 ith_elem_is_expansion
|=
9742 argument_pack_element_is_expansion_p (arg_pack
, index
);
9744 /* Select the Ith argument from the pack. */
9745 if (TREE_CODE (parm
) == PARM_DECL
9746 || TREE_CODE (parm
) == FIELD_DECL
)
9750 aps
= make_argument_pack_select (arg_pack
, index
);
9752 register_local_specialization (aps
, parm
);
9755 aps
= retrieve_local_specialization (parm
);
9760 template_parm_level_and_index (parm
, &level
, &idx
);
9764 aps
= make_argument_pack_select (arg_pack
, index
);
9765 /* Update the corresponding argument. */
9766 TMPL_ARG (args
, level
, idx
) = aps
;
9769 /* Re-use the ARGUMENT_PACK_SELECT. */
9770 aps
= TMPL_ARG (args
, level
, idx
);
9772 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9775 /* Substitute into the PATTERN with the (possibly altered)
9777 if (pattern
== in_decl
)
9778 /* Expanding a fixed parameter pack from
9779 coerce_template_parameter_pack. */
9780 t
= tsubst_decl (pattern
, args
, complain
);
9781 else if (!TYPE_P (pattern
))
9782 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9783 /*integral_constant_expression_p=*/false);
9785 t
= tsubst (pattern
, args
, complain
, in_decl
);
9787 /* If the Ith argument pack element is a pack expansion, then
9788 the Ith element resulting from the substituting is going to
9789 be a pack expansion as well. */
9790 if (ith_elem_is_expansion
)
9791 t
= make_pack_expansion (t
);
9796 /* Substitute ARGS into T, which is an pack expansion
9797 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9798 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9799 (if only a partial substitution could be performed) or
9800 ERROR_MARK_NODE if there was an error. */
9802 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9806 tree pack
, packs
= NULL_TREE
;
9807 bool unsubstituted_packs
= false;
9810 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
9811 bool need_local_specializations
= false;
9814 gcc_assert (PACK_EXPANSION_P (t
));
9815 pattern
= PACK_EXPANSION_PATTERN (t
);
9817 /* Add in any args remembered from an earlier partial instantiation. */
9818 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9820 levels
= TMPL_ARGS_DEPTH (args
);
9822 /* Determine the argument packs that will instantiate the parameter
9823 packs used in the expansion expression. While we're at it,
9824 compute the number of arguments to be expanded and make sure it
9826 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9827 pack
= TREE_CHAIN (pack
))
9829 tree parm_pack
= TREE_VALUE (pack
);
9830 tree arg_pack
= NULL_TREE
;
9831 tree orig_arg
= NULL_TREE
;
9834 if (TREE_CODE (parm_pack
) == BASES
)
9836 if (BASES_DIRECT (parm_pack
))
9837 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9838 args
, complain
, in_decl
, false));
9840 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9841 args
, complain
, in_decl
, false));
9843 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9845 if (PACK_EXPANSION_LOCAL_P (t
))
9846 arg_pack
= retrieve_local_specialization (parm_pack
);
9849 /* We can't rely on local_specializations for a parameter
9850 name used later in a function declaration (such as in a
9851 late-specified return type). Even if it exists, it might
9852 have the wrong value for a recursive call. Just make a
9853 dummy decl, since it's only used for its type. */
9854 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9855 if (arg_pack
&& DECL_PACK_P (arg_pack
))
9856 /* Partial instantiation of the parm_pack, we can't build
9857 up an argument pack yet. */
9858 arg_pack
= NULL_TREE
;
9860 arg_pack
= make_fnparm_pack (arg_pack
);
9861 need_local_specializations
= true;
9864 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
9865 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
9869 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9871 if (level
<= levels
)
9872 arg_pack
= TMPL_ARG (args
, level
, idx
);
9875 orig_arg
= arg_pack
;
9876 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9877 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9879 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9880 /* This can only happen if we forget to expand an argument
9881 pack somewhere else. Just return an error, silently. */
9883 result
= make_tree_vec (1);
9884 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9891 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9893 /* Don't bother trying to do a partial substitution with
9894 incomplete packs; we'll try again after deduction. */
9895 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9900 else if (len
!= my_len
)
9902 if (!(complain
& tf_error
))
9903 /* Fail quietly. */;
9904 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9905 error ("mismatched argument pack lengths while expanding "
9909 error ("mismatched argument pack lengths while expanding "
9912 return error_mark_node
;
9915 /* Keep track of the parameter packs and their corresponding
9917 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9918 TREE_TYPE (packs
) = orig_arg
;
9922 /* We can't substitute for this parameter pack. We use a flag as
9923 well as the missing_level counter because function parameter
9924 packs don't have a level. */
9925 unsubstituted_packs
= true;
9929 /* If the expansion is just T..., return the matching argument pack. */
9930 if (!unsubstituted_packs
9931 && TREE_PURPOSE (packs
) == pattern
)
9932 return ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
9934 /* We cannot expand this expansion expression, because we don't have
9935 all of the argument packs we need. */
9936 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9938 /* We got some full packs, but we can't substitute them in until we
9939 have values for all the packs. So remember these until then. */
9941 t
= make_pack_expansion (pattern
);
9942 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9945 else if (unsubstituted_packs
)
9947 /* There were no real arguments, we're just replacing a parameter
9948 pack with another version of itself. Substitute into the
9949 pattern and return a PACK_EXPANSION_*. The caller will need to
9951 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9952 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9953 /*integral_constant_expression_p=*/false);
9955 t
= tsubst (pattern
, args
, complain
, in_decl
);
9956 t
= make_pack_expansion (t
);
9960 gcc_assert (len
>= 0);
9962 if (need_local_specializations
)
9964 /* We're in a late-specified return type, so create our own local
9965 specializations map; the current map is either NULL or (in the
9966 case of recursive unification) might have bindings that we don't
9967 want to use or alter. */
9968 saved_local_specializations
= local_specializations
;
9969 local_specializations
= new hash_map
<tree
, tree
>;
9972 /* For each argument in each argument pack, substitute into the
9974 result
= make_tree_vec (len
);
9975 for (i
= 0; i
< len
; ++i
)
9977 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9981 TREE_VEC_ELT (result
, i
) = t
;
9982 if (t
== error_mark_node
)
9984 result
= error_mark_node
;
9989 /* Update ARGS to restore the substitution from parameter packs to
9990 their argument packs. */
9991 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9993 tree parm
= TREE_PURPOSE (pack
);
9995 if (TREE_CODE (parm
) == PARM_DECL
9996 || TREE_CODE (parm
) == FIELD_DECL
)
9997 register_local_specialization (TREE_TYPE (pack
), parm
);
10002 if (TREE_VALUE (pack
) == NULL_TREE
)
10005 template_parm_level_and_index (parm
, &level
, &idx
);
10007 /* Update the corresponding argument. */
10008 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10009 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10012 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10016 if (need_local_specializations
)
10018 delete local_specializations
;
10019 local_specializations
= saved_local_specializations
;
10025 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10026 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10027 parameter packs; all parms generated from a function parameter pack will
10028 have the same DECL_PARM_INDEX. */
10031 get_pattern_parm (tree parm
, tree tmpl
)
10033 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10036 if (DECL_ARTIFICIAL (parm
))
10038 for (patparm
= DECL_ARGUMENTS (pattern
);
10039 patparm
; patparm
= DECL_CHAIN (patparm
))
10040 if (DECL_ARTIFICIAL (patparm
)
10041 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10046 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10047 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10048 gcc_assert (DECL_PARM_INDEX (patparm
)
10049 == DECL_PARM_INDEX (parm
));
10055 /* Substitute ARGS into the vector or list of template arguments T. */
10058 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10061 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10064 if (t
== error_mark_node
)
10065 return error_mark_node
;
10067 len
= TREE_VEC_LENGTH (t
);
10068 elts
= XALLOCAVEC (tree
, len
);
10070 for (i
= 0; i
< len
; i
++)
10072 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10075 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10076 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10077 else if (PACK_EXPANSION_P (orig_arg
))
10079 /* Substitute into an expansion expression. */
10080 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10082 if (TREE_CODE (new_arg
) == TREE_VEC
)
10083 /* Add to the expanded length adjustment the number of
10084 expanded arguments. We subtract one from this
10085 measurement, because the argument pack expression
10086 itself is already counted as 1 in
10087 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10088 the argument pack is empty. */
10089 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10091 else if (ARGUMENT_PACK_P (orig_arg
))
10093 /* Substitute into each of the arguments. */
10094 new_arg
= TYPE_P (orig_arg
)
10095 ? cxx_make_type (TREE_CODE (orig_arg
))
10096 : make_node (TREE_CODE (orig_arg
));
10098 SET_ARGUMENT_PACK_ARGS (
10100 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10101 args
, complain
, in_decl
));
10103 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10104 new_arg
= error_mark_node
;
10106 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10107 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10108 complain
, in_decl
);
10109 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10111 if (TREE_TYPE (new_arg
) == error_mark_node
)
10112 new_arg
= error_mark_node
;
10116 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10118 if (new_arg
== error_mark_node
)
10119 return error_mark_node
;
10122 if (new_arg
!= orig_arg
)
10129 /* Make space for the expanded arguments coming from template
10131 t
= make_tree_vec (len
+ expanded_len_adjust
);
10132 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10133 arguments for a member template.
10134 In that case each TREE_VEC in ORIG_T represents a level of template
10135 arguments, and ORIG_T won't carry any non defaulted argument count.
10136 It will rather be the nested TREE_VECs that will carry one.
10137 In other words, ORIG_T carries a non defaulted argument count only
10138 if it doesn't contain any nested TREE_VEC. */
10139 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10141 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10142 count
+= expanded_len_adjust
;
10143 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10145 for (i
= 0, out
= 0; i
< len
; i
++)
10147 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10148 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10149 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10153 /* Now expand the template argument pack "in place". */
10154 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10155 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10159 TREE_VEC_ELT (t
, out
) = elts
[i
];
10167 /* Return the result of substituting ARGS into the template parameters
10168 given by PARMS. If there are m levels of ARGS and m + n levels of
10169 PARMS, then the result will contain n levels of PARMS. For
10170 example, if PARMS is `template <class T> template <class U>
10171 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10172 result will be `template <int*, double, class V>'. */
10175 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10177 tree r
= NULL_TREE
;
10180 /* When substituting into a template, we must set
10181 PROCESSING_TEMPLATE_DECL as the template parameters may be
10182 dependent if they are based on one-another, and the dependency
10183 predicates are short-circuit outside of templates. */
10184 ++processing_template_decl
;
10186 for (new_parms
= &r
;
10187 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10188 new_parms
= &(TREE_CHAIN (*new_parms
)),
10189 parms
= TREE_CHAIN (parms
))
10192 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10195 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10199 if (parms
== error_mark_node
)
10202 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10204 if (tuple
== error_mark_node
)
10207 TREE_VEC_ELT (new_vec
, i
) =
10208 tsubst_template_parm (tuple
, args
, complain
);
10212 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10213 - TMPL_ARGS_DEPTH (args
)),
10214 new_vec
, NULL_TREE
);
10217 --processing_template_decl
;
10222 /* Return the result of substituting ARGS into one template parameter
10223 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10224 parameter and which TREE_PURPOSE is the default argument of the
10225 template parameter. */
10228 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10230 tree default_value
, parm_decl
;
10232 if (args
== NULL_TREE
10234 || t
== error_mark_node
)
10237 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10239 default_value
= TREE_PURPOSE (t
);
10240 parm_decl
= TREE_VALUE (t
);
10242 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10243 if (TREE_CODE (parm_decl
) == PARM_DECL
10244 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10245 parm_decl
= error_mark_node
;
10246 default_value
= tsubst_template_arg (default_value
, args
,
10247 complain
, NULL_TREE
);
10249 return build_tree_list (default_value
, parm_decl
);
10252 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10253 type T. If T is not an aggregate or enumeration type, it is
10254 handled as if by tsubst. IN_DECL is as for tsubst. If
10255 ENTERING_SCOPE is nonzero, T is the context for a template which
10256 we are presently tsubst'ing. Return the substituted value. */
10259 tsubst_aggr_type (tree t
,
10261 tsubst_flags_t complain
,
10263 int entering_scope
)
10265 if (t
== NULL_TREE
)
10268 switch (TREE_CODE (t
))
10271 if (TYPE_PTRMEMFUNC_P (t
))
10272 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10274 /* Else fall through. */
10275 case ENUMERAL_TYPE
:
10277 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10282 int saved_unevaluated_operand
;
10283 int saved_inhibit_evaluation_warnings
;
10285 /* In "sizeof(X<I>)" we need to evaluate "I". */
10286 saved_unevaluated_operand
= cp_unevaluated_operand
;
10287 cp_unevaluated_operand
= 0;
10288 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10289 c_inhibit_evaluation_warnings
= 0;
10291 /* First, determine the context for the type we are looking
10293 context
= TYPE_CONTEXT (t
);
10294 if (context
&& TYPE_P (context
))
10296 context
= tsubst_aggr_type (context
, args
, complain
,
10297 in_decl
, /*entering_scope=*/1);
10298 /* If context is a nested class inside a class template,
10299 it may still need to be instantiated (c++/33959). */
10300 context
= complete_type (context
);
10303 /* Then, figure out what arguments are appropriate for the
10304 type we are trying to find. For example, given:
10306 template <class T> struct S;
10307 template <class T, class U> void f(T, U) { S<U> su; }
10309 and supposing that we are instantiating f<int, double>,
10310 then our ARGS will be {int, double}, but, when looking up
10311 S we only want {double}. */
10312 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10313 complain
, in_decl
);
10314 if (argvec
== error_mark_node
)
10315 r
= error_mark_node
;
10318 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10319 entering_scope
, complain
);
10320 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10323 cp_unevaluated_operand
= saved_unevaluated_operand
;
10324 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10329 /* This is not a template type, so there's nothing to do. */
10333 return tsubst (t
, args
, complain
, in_decl
);
10337 /* Substitute into the default argument ARG (a default argument for
10338 FN), which has the indicated TYPE. */
10341 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10343 tree saved_class_ptr
= NULL_TREE
;
10344 tree saved_class_ref
= NULL_TREE
;
10345 int errs
= errorcount
+ sorrycount
;
10347 /* This can happen in invalid code. */
10348 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10351 /* This default argument came from a template. Instantiate the
10352 default argument here, not in tsubst. In the case of
10361 we must be careful to do name lookup in the scope of S<T>,
10362 rather than in the current class. */
10363 push_access_scope (fn
);
10364 /* The "this" pointer is not valid in a default argument. */
10367 saved_class_ptr
= current_class_ptr
;
10368 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10369 saved_class_ref
= current_class_ref
;
10370 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10373 push_deferring_access_checks(dk_no_deferred
);
10374 /* The default argument expression may cause implicitly defined
10375 member functions to be synthesized, which will result in garbage
10376 collection. We must treat this situation as if we were within
10377 the body of function so as to avoid collecting live data on the
10380 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10381 complain
, NULL_TREE
,
10382 /*integral_constant_expression_p=*/false);
10384 pop_deferring_access_checks();
10386 /* Restore the "this" pointer. */
10389 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10390 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10393 if (errorcount
+sorrycount
> errs
10394 && (complain
& tf_warning_or_error
))
10395 inform (input_location
,
10396 " when instantiating default argument for call to %D", fn
);
10398 /* Make sure the default argument is reasonable. */
10399 arg
= check_default_argument (type
, arg
, complain
);
10401 pop_access_scope (fn
);
10406 /* Substitute into all the default arguments for FN. */
10409 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10414 tmpl_args
= DECL_TI_ARGS (fn
);
10416 /* If this function is not yet instantiated, we certainly don't need
10417 its default arguments. */
10418 if (uses_template_parms (tmpl_args
))
10420 /* Don't do this again for clones. */
10421 if (DECL_CLONED_FUNCTION_P (fn
))
10424 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10426 arg
= TREE_CHAIN (arg
))
10427 if (TREE_PURPOSE (arg
))
10428 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10430 TREE_PURPOSE (arg
),
10434 /* Substitute the ARGS into the T, which is a _DECL. Return the
10435 result of the substitution. Issue error and warning messages under
10436 control of COMPLAIN. */
10439 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10441 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10442 location_t saved_loc
;
10443 tree r
= NULL_TREE
;
10445 hashval_t hash
= 0;
10447 /* Set the filename and linenumber to improve error-reporting. */
10448 saved_loc
= input_location
;
10449 input_location
= DECL_SOURCE_LOCATION (t
);
10451 switch (TREE_CODE (t
))
10453 case TEMPLATE_DECL
:
10455 /* We can get here when processing a member function template,
10456 member class template, or template template parameter. */
10457 tree decl
= DECL_TEMPLATE_RESULT (t
);
10462 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10464 /* Template template parameter is treated here. */
10465 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10466 if (new_type
== error_mark_node
)
10467 RETURN (error_mark_node
);
10468 /* If we get a real template back, return it. This can happen in
10469 the context of most_specialized_class. */
10470 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10474 DECL_CHAIN (r
) = NULL_TREE
;
10475 TREE_TYPE (r
) = new_type
;
10476 DECL_TEMPLATE_RESULT (r
)
10477 = build_decl (DECL_SOURCE_LOCATION (decl
),
10478 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10479 DECL_TEMPLATE_PARMS (r
)
10480 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10482 TYPE_NAME (new_type
) = r
;
10486 /* We might already have an instance of this template.
10487 The ARGS are for the surrounding class type, so the
10488 full args contain the tsubst'd args for the context,
10489 plus the innermost args from the template decl. */
10490 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10491 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10492 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10493 /* Because this is a template, the arguments will still be
10494 dependent, even after substitution. If
10495 PROCESSING_TEMPLATE_DECL is not set, the dependency
10496 predicates will short-circuit. */
10497 ++processing_template_decl
;
10498 full_args
= tsubst_template_args (tmpl_args
, args
,
10499 complain
, in_decl
);
10500 --processing_template_decl
;
10501 if (full_args
== error_mark_node
)
10502 RETURN (error_mark_node
);
10504 /* If this is a default template template argument,
10505 tsubst might not have changed anything. */
10506 if (full_args
== tmpl_args
)
10509 hash
= hash_tmpl_and_args (t
, full_args
);
10510 spec
= retrieve_specialization (t
, full_args
, hash
);
10511 if (spec
!= NULL_TREE
)
10517 /* Make a new template decl. It will be similar to the
10518 original, but will record the current template arguments.
10519 We also create a new function declaration, which is just
10520 like the old one, but points to this new template, rather
10521 than the old one. */
10523 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10524 DECL_CHAIN (r
) = NULL_TREE
;
10526 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10528 if (TREE_CODE (decl
) == TYPE_DECL
10529 && !TYPE_DECL_ALIAS_P (decl
))
10532 ++processing_template_decl
;
10533 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10534 --processing_template_decl
;
10535 if (new_type
== error_mark_node
)
10536 RETURN (error_mark_node
);
10538 TREE_TYPE (r
) = new_type
;
10539 /* For a partial specialization, we need to keep pointing to
10540 the primary template. */
10541 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10542 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10543 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10544 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10545 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10550 ++processing_template_decl
;
10551 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10552 --processing_template_decl
;
10553 if (new_decl
== error_mark_node
)
10554 RETURN (error_mark_node
);
10556 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10557 DECL_TI_TEMPLATE (new_decl
) = r
;
10558 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10559 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10560 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10563 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10564 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10565 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10567 /* The template parameters for this new template are all the
10568 template parameters for the old template, except the
10569 outermost level of parameters. */
10570 DECL_TEMPLATE_PARMS (r
)
10571 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10574 if (PRIMARY_TEMPLATE_P (t
))
10575 DECL_PRIMARY_TEMPLATE (r
) = r
;
10577 if (TREE_CODE (decl
) != TYPE_DECL
&& TREE_CODE (decl
) != VAR_DECL
)
10578 /* Record this non-type partial instantiation. */
10579 register_specialization (r
, t
,
10580 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10585 case FUNCTION_DECL
:
10588 tree argvec
= NULL_TREE
;
10596 /* Nobody should be tsubst'ing into non-template functions. */
10597 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10599 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10604 /* If T is not dependent, just return it. We have to
10605 increment PROCESSING_TEMPLATE_DECL because
10606 value_dependent_expression_p assumes that nothing is
10607 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10608 ++processing_template_decl
;
10609 dependent_p
= value_dependent_expression_p (t
);
10610 --processing_template_decl
;
10614 /* Calculate the most general template of which R is a
10615 specialization, and the complete set of arguments used to
10617 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10618 argvec
= tsubst_template_args (DECL_TI_ARGS
10619 (DECL_TEMPLATE_RESULT
10620 (DECL_TI_TEMPLATE (t
))),
10621 args
, complain
, in_decl
);
10622 if (argvec
== error_mark_node
)
10623 RETURN (error_mark_node
);
10625 /* Check to see if we already have this specialization. */
10626 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10627 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10635 /* We can see more levels of arguments than parameters if
10636 there was a specialization of a member template, like
10639 template <class T> struct S { template <class U> void f(); }
10640 template <> template <class U> void S<int>::f(U);
10642 Here, we'll be substituting into the specialization,
10643 because that's where we can find the code we actually
10644 want to generate, but we'll have enough arguments for
10645 the most general template.
10647 We also deal with the peculiar case:
10649 template <class T> struct S {
10650 template <class U> friend void f();
10652 template <class U> void f() {}
10654 template void f<double>();
10656 Here, the ARGS for the instantiation of will be {int,
10657 double}. But, we only need as many ARGS as there are
10658 levels of template parameters in CODE_PATTERN. We are
10659 careful not to get fooled into reducing the ARGS in
10662 template <class T> struct S { template <class U> void f(U); }
10663 template <class T> template <> void S<T>::f(int) {}
10665 which we can spot because the pattern will be a
10666 specialization in this case. */
10667 args_depth
= TMPL_ARGS_DEPTH (args
);
10669 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10670 if (args_depth
> parms_depth
10671 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10672 args
= get_innermost_template_args (args
, parms_depth
);
10676 /* This special case arises when we have something like this:
10678 template <class T> struct S {
10679 friend void f<int>(int, double);
10682 Here, the DECL_TI_TEMPLATE for the friend declaration
10683 will be an IDENTIFIER_NODE. We are being called from
10684 tsubst_friend_function, and we want only to create a
10685 new decl (R) with appropriate types so that we can call
10686 determine_specialization. */
10687 gen_tmpl
= NULL_TREE
;
10690 if (DECL_CLASS_SCOPE_P (t
))
10692 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10696 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10697 complain
, t
, /*entering_scope=*/1);
10702 ctx
= DECL_CONTEXT (t
);
10704 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10705 if (type
== error_mark_node
)
10706 RETURN (error_mark_node
);
10708 /* If we hit excessive deduction depth, the type is bogus even if
10709 it isn't error_mark_node, so don't build a decl. */
10710 if (excessive_deduction_depth
)
10711 RETURN (error_mark_node
);
10713 /* We do NOT check for matching decls pushed separately at this
10714 point, as they may not represent instantiations of this
10715 template, and in any case are considered separate under the
10718 DECL_USE_TEMPLATE (r
) = 0;
10719 TREE_TYPE (r
) = type
;
10720 /* Clear out the mangled name and RTL for the instantiation. */
10721 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10722 SET_DECL_RTL (r
, NULL
);
10723 /* Leave DECL_INITIAL set on deleted instantiations. */
10724 if (!DECL_DELETED_FN (r
))
10725 DECL_INITIAL (r
) = NULL_TREE
;
10726 DECL_CONTEXT (r
) = ctx
;
10728 /* OpenMP UDRs have the only argument a reference to the declared
10729 type. We want to diagnose if the declared type is a reference,
10730 which is invalid, but as references to references are usually
10731 quietly merged, diagnose it here. */
10732 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10735 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10736 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10737 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10738 error_at (DECL_SOURCE_LOCATION (t
),
10739 "reference type %qT in "
10740 "%<#pragma omp declare reduction%>", argtype
);
10741 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10742 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10746 if (member
&& DECL_CONV_FN_P (r
))
10747 /* Type-conversion operator. Reconstruct the name, in
10748 case it's the name of one of the template's parameters. */
10749 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10751 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10753 DECL_RESULT (r
) = NULL_TREE
;
10755 TREE_STATIC (r
) = 0;
10756 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10757 DECL_EXTERNAL (r
) = 1;
10758 /* If this is an instantiation of a function with internal
10759 linkage, we already know what object file linkage will be
10760 assigned to the instantiation. */
10761 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10762 DECL_DEFER_OUTPUT (r
) = 0;
10763 DECL_CHAIN (r
) = NULL_TREE
;
10764 DECL_PENDING_INLINE_INFO (r
) = 0;
10765 DECL_PENDING_INLINE_P (r
) = 0;
10766 DECL_SAVED_TREE (r
) = NULL_TREE
;
10767 DECL_STRUCT_FUNCTION (r
) = NULL
;
10769 /* We'll re-clone as appropriate in instantiate_template. */
10770 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10772 /* If we aren't complaining now, return on error before we register
10773 the specialization so that we'll complain eventually. */
10774 if ((complain
& tf_error
) == 0
10775 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10776 && !grok_op_properties (r
, /*complain=*/false))
10777 RETURN (error_mark_node
);
10779 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10780 this in the special friend case mentioned above where
10781 GEN_TMPL is NULL. */
10784 DECL_TEMPLATE_INFO (r
)
10785 = build_template_info (gen_tmpl
, argvec
);
10786 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10789 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10791 /* We instantiated this while substituting into
10792 the type earlier (template/friend54.C). */
10795 /* We're not supposed to instantiate default arguments
10796 until they are called, for a template. But, for a
10799 template <class T> void f ()
10800 { extern void g(int i = T()); }
10802 we should do the substitution when the template is
10803 instantiated. We handle the member function case in
10804 instantiate_class_template since the default arguments
10805 might refer to other members of the class. */
10807 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10808 && !uses_template_parms (argvec
))
10809 tsubst_default_arguments (r
, complain
);
10812 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10814 /* Copy the list of befriending classes. */
10815 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10817 friends
= &TREE_CHAIN (*friends
))
10819 *friends
= copy_node (*friends
);
10820 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10825 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10827 maybe_retrofit_in_chrg (r
);
10828 if (DECL_CONSTRUCTOR_P (r
))
10829 grok_ctor_properties (ctx
, r
);
10830 if (DECL_INHERITED_CTOR_BASE (r
))
10831 deduce_inheriting_ctor (r
);
10832 /* If this is an instantiation of a member template, clone it.
10833 If it isn't, that'll be handled by
10834 clone_constructors_and_destructors. */
10835 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10836 clone_function_decl (r
, /*update_method_vec_p=*/0);
10838 else if ((complain
& tf_error
) != 0
10839 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10840 && !grok_op_properties (r
, /*complain=*/true))
10841 RETURN (error_mark_node
);
10843 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10844 SET_DECL_FRIEND_CONTEXT (r
,
10845 tsubst (DECL_FRIEND_CONTEXT (t
),
10846 args
, complain
, in_decl
));
10848 /* Possibly limit visibility based on template args. */
10849 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10850 if (DECL_VISIBILITY_SPECIFIED (t
))
10852 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10853 DECL_ATTRIBUTES (r
)
10854 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10856 determine_visibility (r
);
10857 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10858 && !processing_template_decl
)
10859 defaulted_late_check (r
);
10861 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10862 args
, complain
, in_decl
);
10868 tree type
= NULL_TREE
;
10870 tree expanded_types
= NULL_TREE
;
10871 tree prev_r
= NULL_TREE
;
10872 tree first_r
= NULL_TREE
;
10874 if (DECL_PACK_P (t
))
10876 /* If there is a local specialization that isn't a
10877 parameter pack, it means that we're doing a "simple"
10878 substitution from inside tsubst_pack_expansion. Just
10879 return the local specialization (which will be a single
10881 tree spec
= retrieve_local_specialization (t
);
10883 && TREE_CODE (spec
) == PARM_DECL
10884 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10887 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10888 the parameters in this function parameter pack. */
10889 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10890 complain
, in_decl
);
10891 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10893 len
= TREE_VEC_LENGTH (expanded_types
);
10895 /* Zero-length parameter packs are boring. Just substitute
10898 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10903 /* All we did was update the type. Make a note of that. */
10904 type
= expanded_types
;
10905 expanded_types
= NULL_TREE
;
10909 /* Loop through all of the parameters we'll build. When T is
10910 a function parameter pack, LEN is the number of expanded
10911 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10913 for (i
= 0; i
< len
; ++i
)
10917 if (DECL_TEMPLATE_PARM_P (t
))
10918 SET_DECL_TEMPLATE_PARM_P (r
);
10920 if (expanded_types
)
10921 /* We're on the Ith parameter of the function parameter
10924 /* Get the Ith type. */
10925 type
= TREE_VEC_ELT (expanded_types
, i
);
10927 /* Rename the parameter to include the index. */
10929 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10932 /* We're dealing with a normal parameter. */
10933 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10935 type
= type_decays_to (type
);
10936 TREE_TYPE (r
) = type
;
10937 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10939 if (DECL_INITIAL (r
))
10941 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10942 DECL_INITIAL (r
) = TREE_TYPE (r
);
10944 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10945 complain
, in_decl
);
10948 DECL_CONTEXT (r
) = NULL_TREE
;
10950 if (!DECL_TEMPLATE_PARM_P (r
))
10951 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10953 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10954 args
, complain
, in_decl
);
10956 /* Keep track of the first new parameter we
10957 generate. That's what will be returned to the
10962 /* Build a proper chain of parameters when substituting
10963 into a function parameter pack. */
10965 DECL_CHAIN (prev_r
) = r
;
10968 /* If cp_unevaluated_operand is set, we're just looking for a
10969 single dummy parameter, so don't keep going. */
10970 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10971 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10972 complain
, DECL_CHAIN (t
));
10974 /* FIRST_R contains the start of the chain we've built. */
10981 tree type
= NULL_TREE
;
10982 tree vec
= NULL_TREE
;
10983 tree expanded_types
= NULL_TREE
;
10986 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
10988 /* This field is a lambda capture pack. Return a TREE_VEC of
10989 the expanded fields to instantiate_class_template_1 and
10990 store them in the specializations hash table as a
10991 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
10992 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10993 complain
, in_decl
);
10994 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10996 len
= TREE_VEC_LENGTH (expanded_types
);
10997 vec
= make_tree_vec (len
);
11001 /* All we did was update the type. Make a note of that. */
11002 type
= expanded_types
;
11003 expanded_types
= NULL_TREE
;
11007 for (int i
= 0; i
< len
; ++i
)
11010 if (expanded_types
)
11012 type
= TREE_VEC_ELT (expanded_types
, i
);
11014 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11017 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11019 if (type
== error_mark_node
)
11020 RETURN (error_mark_node
);
11021 TREE_TYPE (r
) = type
;
11022 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11024 if (DECL_C_BIT_FIELD (r
))
11025 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11026 non-bit-fields DECL_INITIAL is a non-static data member
11027 initializer, which gets deferred instantiation. */
11029 = tsubst_expr (DECL_INITIAL (t
), args
,
11031 /*integral_constant_expression_p=*/true);
11032 else if (DECL_INITIAL (t
))
11034 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11035 NSDMI in perform_member_init. Still set DECL_INITIAL
11036 so that we know there is one. */
11037 DECL_INITIAL (r
) = void_node
;
11038 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11039 retrofit_lang_decl (r
);
11040 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11042 /* We don't have to set DECL_CONTEXT here; it is set by
11043 finish_member_declaration. */
11044 DECL_CHAIN (r
) = NULL_TREE
;
11046 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11047 args
, complain
, in_decl
);
11050 TREE_VEC_ELT (vec
, i
) = r
;
11056 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11057 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11058 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11059 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11060 TREE_TYPE (pack
) = tpack
;
11061 register_specialization (pack
, t
, args
, false, 0);
11067 /* We reach here only for member using decls. We also need to check
11068 uses_template_parms because DECL_DEPENDENT_P is not set for a
11069 using-declaration that designates a member of the current
11070 instantiation (c++/53549). */
11071 if (DECL_DEPENDENT_P (t
)
11072 || uses_template_parms (USING_DECL_SCOPE (t
)))
11074 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11075 complain
, in_decl
);
11076 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11077 r
= do_class_using_decl (inst_scope
, name
);
11079 r
= error_mark_node
;
11082 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11083 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11089 DECL_CHAIN (r
) = NULL_TREE
;
11096 tree argvec
= NULL_TREE
;
11097 tree gen_tmpl
= NULL_TREE
;
11099 tree tmpl
= NULL_TREE
;
11101 tree type
= NULL_TREE
;
11104 if (TREE_TYPE (t
) == error_mark_node
)
11105 RETURN (error_mark_node
);
11107 if (TREE_CODE (t
) == TYPE_DECL
11108 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11110 /* If this is the canonical decl, we don't have to
11111 mess with instantiations, and often we can't (for
11112 typename, template type parms and such). Note that
11113 TYPE_NAME is not correct for the above test if
11114 we've copied the type for a typedef. */
11115 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11116 if (type
== error_mark_node
)
11117 RETURN (error_mark_node
);
11118 r
= TYPE_NAME (type
);
11122 /* Check to see if we already have the specialization we
11125 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11127 /* T is a static data member or namespace-scope entity.
11128 We have to substitute into namespace-scope variables
11129 (even though such entities are never templates) because
11132 template <class T> void f() { extern T t; }
11134 where the entity referenced is not known until
11135 instantiation time. */
11137 ctx
= DECL_CONTEXT (t
);
11138 if (DECL_CLASS_SCOPE_P (t
))
11140 ctx
= tsubst_aggr_type (ctx
, args
,
11142 in_decl
, /*entering_scope=*/1);
11143 /* If CTX is unchanged, then T is in fact the
11144 specialization we want. That situation occurs when
11145 referencing a static data member within in its own
11146 class. We can use pointer equality, rather than
11147 same_type_p, because DECL_CONTEXT is always
11149 if (ctx
== DECL_CONTEXT (t
)
11150 /* ... unless T is a member template; in which
11151 case our caller can be willing to create a
11152 specialization of that template represented
11154 && !(DECL_TI_TEMPLATE (t
)
11155 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
11161 tmpl
= DECL_TI_TEMPLATE (t
);
11162 gen_tmpl
= most_general_template (tmpl
);
11163 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11164 if (argvec
== error_mark_node
)
11165 RETURN (error_mark_node
);
11166 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11167 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11172 /* A local variable. */
11174 /* Subsequent calls to pushdecl will fill this in. */
11176 spec
= retrieve_local_specialization (t
);
11178 /* If we already have the specialization we need, there is
11179 nothing more to do. */
11186 /* Create a new node for the specialization we need. */
11188 if (type
== NULL_TREE
)
11190 if (is_typedef_decl (t
))
11191 type
= DECL_ORIGINAL_TYPE (t
);
11193 type
= TREE_TYPE (t
);
11195 && VAR_HAD_UNKNOWN_BOUND (t
)
11196 && type
!= error_mark_node
)
11197 type
= strip_array_domain (type
);
11198 type
= tsubst (type
, args
, complain
, in_decl
);
11202 /* Even if the original location is out of scope, the
11203 newly substituted one is not. */
11204 DECL_DEAD_FOR_LOCAL (r
) = 0;
11205 DECL_INITIALIZED_P (r
) = 0;
11206 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11207 if (type
== error_mark_node
)
11208 RETURN (error_mark_node
);
11209 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11211 /* It may seem that this case cannot occur, since:
11216 declares a function, not a variable. However:
11219 template <typename T> void g() { T t; }
11220 template void g<f>();
11222 is an attempt to declare a variable with function
11224 error ("variable %qD has function type",
11225 /* R is not yet sufficiently initialized, so we
11226 just use its name. */
11228 RETURN (error_mark_node
);
11230 type
= complete_type (type
);
11231 /* Wait until cp_finish_decl to set this again, to handle
11232 circular dependency (template/instantiate6.C). */
11233 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11234 type
= check_var_type (DECL_NAME (r
), type
);
11236 if (DECL_HAS_VALUE_EXPR_P (t
))
11238 tree ve
= DECL_VALUE_EXPR (t
);
11239 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11240 /*constant_expression_p=*/false);
11241 if (REFERENCE_REF_P (ve
))
11243 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11244 ve
= TREE_OPERAND (ve
, 0);
11246 SET_DECL_VALUE_EXPR (r
, ve
);
11248 if (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
11249 set_decl_tls_model (r
, decl_tls_model (t
));
11251 else if (DECL_SELF_REFERENCE_P (t
))
11252 SET_DECL_SELF_REFERENCE_P (r
);
11253 TREE_TYPE (r
) = type
;
11254 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11255 DECL_CONTEXT (r
) = ctx
;
11256 /* Clear out the mangled name and RTL for the instantiation. */
11257 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11258 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11259 SET_DECL_RTL (r
, NULL
);
11260 /* The initializer must not be expanded until it is required;
11261 see [temp.inst]. */
11262 DECL_INITIAL (r
) = NULL_TREE
;
11263 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11264 SET_DECL_RTL (r
, NULL
);
11265 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11268 /* Possibly limit visibility based on template args. */
11269 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11270 if (DECL_VISIBILITY_SPECIFIED (t
))
11272 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11273 DECL_ATTRIBUTES (r
)
11274 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11276 determine_visibility (r
);
11281 /* A static data member declaration is always marked
11282 external when it is declared in-class, even if an
11283 initializer is present. We mimic the non-template
11284 processing here. */
11285 DECL_EXTERNAL (r
) = 1;
11287 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11288 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11289 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11291 else if (!cp_unevaluated_operand
)
11292 register_local_specialization (r
, t
);
11294 DECL_CHAIN (r
) = NULL_TREE
;
11296 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11298 args
, complain
, in_decl
);
11300 /* Preserve a typedef that names a type. */
11301 if (is_typedef_decl (r
))
11303 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11304 set_underlying_type (r
);
11307 layout_decl (r
, 0);
11312 gcc_unreachable ();
11317 /* Restore the file and line information. */
11318 input_location
= saved_loc
;
11323 /* Substitute into the ARG_TYPES of a function type.
11324 If END is a TREE_CHAIN, leave it and any following types
11328 tsubst_arg_types (tree arg_types
,
11331 tsubst_flags_t complain
,
11334 tree remaining_arg_types
;
11335 tree type
= NULL_TREE
;
11337 tree expanded_args
= NULL_TREE
;
11340 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11343 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11344 args
, end
, complain
, in_decl
);
11345 if (remaining_arg_types
== error_mark_node
)
11346 return error_mark_node
;
11348 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11350 /* For a pack expansion, perform substitution on the
11351 entire expression. Later on, we'll handle the arguments
11353 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11354 args
, complain
, in_decl
);
11356 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11357 /* So that we'll spin through the parameters, one by one. */
11358 i
= TREE_VEC_LENGTH (expanded_args
);
11361 /* We only partially substituted into the parameter
11362 pack. Our type is TYPE_PACK_EXPANSION. */
11363 type
= expanded_args
;
11364 expanded_args
= NULL_TREE
;
11372 type
= TREE_VEC_ELT (expanded_args
, i
);
11374 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11376 if (type
== error_mark_node
)
11377 return error_mark_node
;
11378 if (VOID_TYPE_P (type
))
11380 if (complain
& tf_error
)
11382 error ("invalid parameter type %qT", type
);
11384 error ("in declaration %q+D", in_decl
);
11386 return error_mark_node
;
11389 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11390 return error_mark_node
;
11392 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11393 top-level qualifiers as required. */
11394 type
= cv_unqualified (type_decays_to (type
));
11396 /* We do not substitute into default arguments here. The standard
11397 mandates that they be instantiated only when needed, which is
11398 done in build_over_call. */
11399 default_arg
= TREE_PURPOSE (arg_types
);
11401 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11403 /* We've instantiated a template before its default arguments
11404 have been parsed. This can happen for a nested template
11405 class, and is not an error unless we require the default
11406 argument in a call of this function. */
11407 remaining_arg_types
=
11408 tree_cons (default_arg
, type
, remaining_arg_types
);
11409 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11412 remaining_arg_types
=
11413 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11416 return remaining_arg_types
;
11419 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11420 *not* handle the exception-specification for FNTYPE, because the
11421 initial substitution of explicitly provided template parameters
11422 during argument deduction forbids substitution into the
11423 exception-specification:
11427 All references in the function type of the function template to the
11428 corresponding template parameters are replaced by the specified tem-
11429 plate argument values. If a substitution in a template parameter or
11430 in the function type of the function template results in an invalid
11431 type, type deduction fails. [Note: The equivalent substitution in
11432 exception specifications is done only when the function is instanti-
11433 ated, at which point a program is ill-formed if the substitution
11434 results in an invalid type.] */
11437 tsubst_function_type (tree t
,
11439 tsubst_flags_t complain
,
11443 tree arg_types
= NULL_TREE
;
11446 /* The TYPE_CONTEXT is not used for function/method types. */
11447 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11449 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
11451 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
11453 if (late_return_type_p
)
11455 /* Substitute the argument types. */
11456 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11457 complain
, in_decl
);
11458 if (arg_types
== error_mark_node
)
11459 return error_mark_node
;
11461 tree save_ccp
= current_class_ptr
;
11462 tree save_ccr
= current_class_ref
;
11463 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
11464 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
11465 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
11468 /* DR 1207: 'this' is in scope in the trailing return type. */
11469 inject_this_parameter (this_type
, cp_type_quals (this_type
));
11472 /* Substitute the return type. */
11473 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11477 current_class_ptr
= save_ccp
;
11478 current_class_ref
= save_ccr
;
11482 /* Substitute the return type. */
11483 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11485 if (return_type
== error_mark_node
)
11486 return error_mark_node
;
11487 /* DR 486 clarifies that creation of a function type with an
11488 invalid return type is a deduction failure. */
11489 if (TREE_CODE (return_type
) == ARRAY_TYPE
11490 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11492 if (complain
& tf_error
)
11494 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11495 error ("function returning an array");
11497 error ("function returning a function");
11499 return error_mark_node
;
11502 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11503 return error_mark_node
;
11505 if (!late_return_type_p
)
11507 /* Substitute the argument types. */
11508 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11509 complain
, in_decl
);
11510 if (arg_types
== error_mark_node
)
11511 return error_mark_node
;
11514 /* Construct a new type node and return it. */
11515 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11517 fntype
= build_function_type (return_type
, arg_types
);
11518 fntype
= apply_memfn_quals (fntype
,
11519 type_memfn_quals (t
),
11520 type_memfn_rqual (t
));
11524 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11525 /* Don't pick up extra function qualifiers from the basetype. */
11526 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11527 if (! MAYBE_CLASS_TYPE_P (r
))
11531 Type deduction may fail for any of the following
11534 -- Attempting to create "pointer to member of T" when T
11535 is not a class type. */
11536 if (complain
& tf_error
)
11537 error ("creating pointer to member function of non-class type %qT",
11539 return error_mark_node
;
11542 fntype
= build_method_type_directly (r
, return_type
,
11543 TREE_CHAIN (arg_types
));
11544 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11546 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11548 if (late_return_type_p
)
11549 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
11554 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11555 ARGS into that specification, and return the substituted
11556 specification. If there is no specification, return NULL_TREE. */
11559 tsubst_exception_specification (tree fntype
,
11561 tsubst_flags_t complain
,
11568 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11569 new_specs
= NULL_TREE
;
11570 if (specs
&& TREE_PURPOSE (specs
))
11572 /* A noexcept-specifier. */
11573 tree expr
= TREE_PURPOSE (specs
);
11574 if (TREE_CODE (expr
) == INTEGER_CST
)
11578 /* Defer instantiation of noexcept-specifiers to avoid
11579 excessive instantiations (c++/49107). */
11580 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11581 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11583 /* We already partially instantiated this member template,
11584 so combine the new args with the old. */
11585 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11586 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11587 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11588 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11592 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11593 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11597 new_specs
= tsubst_copy_and_build
11598 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11599 /*integral_constant_expression_p=*/true);
11600 new_specs
= build_noexcept_spec (new_specs
, complain
);
11604 if (! TREE_VALUE (specs
))
11611 tree expanded_specs
= NULL_TREE
;
11613 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11615 /* Expand the pack expansion type. */
11616 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11620 if (expanded_specs
== error_mark_node
)
11621 return error_mark_node
;
11622 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11623 len
= TREE_VEC_LENGTH (expanded_specs
);
11626 /* We're substituting into a member template, so
11627 we got a TYPE_PACK_EXPANSION back. Add that
11628 expansion and move on. */
11629 gcc_assert (TREE_CODE (expanded_specs
)
11630 == TYPE_PACK_EXPANSION
);
11631 new_specs
= add_exception_specifier (new_specs
,
11634 specs
= TREE_CHAIN (specs
);
11639 for (i
= 0; i
< len
; ++i
)
11641 if (expanded_specs
)
11642 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11644 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11645 if (spec
== error_mark_node
)
11647 new_specs
= add_exception_specifier (new_specs
, spec
,
11651 specs
= TREE_CHAIN (specs
);
11657 /* Take the tree structure T and replace template parameters used
11658 therein with the argument vector ARGS. IN_DECL is an associated
11659 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11660 Issue error and warning messages under control of COMPLAIN. Note
11661 that we must be relatively non-tolerant of extensions here, in
11662 order to preserve conformance; if we allow substitutions that
11663 should not be allowed, we may allow argument deductions that should
11664 not succeed, and therefore report ambiguous overload situations
11665 where there are none. In theory, we could allow the substitution,
11666 but indicate that it should have failed, and allow our caller to
11667 make sure that the right thing happens, but we don't try to do this
11670 This function is used for dealing with types, decls and the like;
11671 for expressions, use tsubst_expr or tsubst_copy. */
11674 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11676 enum tree_code code
;
11677 tree type
, r
= NULL_TREE
;
11679 if (t
== NULL_TREE
|| t
== error_mark_node
11680 || t
== integer_type_node
11681 || t
== void_type_node
11682 || t
== char_type_node
11683 || t
== unknown_type_node
11684 || TREE_CODE (t
) == NAMESPACE_DECL
11685 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11689 return tsubst_decl (t
, args
, complain
);
11691 if (args
== NULL_TREE
)
11694 code
= TREE_CODE (t
);
11696 if (code
== IDENTIFIER_NODE
)
11697 type
= IDENTIFIER_TYPE_VALUE (t
);
11699 type
= TREE_TYPE (t
);
11701 gcc_assert (type
!= unknown_type_node
);
11703 /* Reuse typedefs. We need to do this to handle dependent attributes,
11704 such as attribute aligned. */
11706 && typedef_variant_p (t
))
11708 tree decl
= TYPE_NAME (t
);
11710 if (alias_template_specialization_p (t
))
11712 /* DECL represents an alias template and we want to
11714 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11715 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11716 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11718 else if (DECL_CLASS_SCOPE_P (decl
)
11719 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11720 && uses_template_parms (DECL_CONTEXT (decl
)))
11722 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11723 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11724 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11726 else if (DECL_FUNCTION_SCOPE_P (decl
)
11727 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11728 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11729 r
= retrieve_local_specialization (decl
);
11731 /* The typedef is from a non-template context. */
11737 r
= cp_build_qualified_type_real
11738 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11739 complain
| tf_ignore_bad_quals
);
11744 /* We don't have an instantiation yet, so drop the typedef. */
11745 int quals
= cp_type_quals (t
);
11746 t
= DECL_ORIGINAL_TYPE (decl
);
11747 t
= cp_build_qualified_type_real (t
, quals
,
11748 complain
| tf_ignore_bad_quals
);
11753 && code
!= TYPENAME_TYPE
11754 && code
!= TEMPLATE_TYPE_PARM
11755 && code
!= IDENTIFIER_NODE
11756 && code
!= FUNCTION_TYPE
11757 && code
!= METHOD_TYPE
)
11758 type
= tsubst (type
, args
, complain
, in_decl
);
11759 if (type
== error_mark_node
)
11760 return error_mark_node
;
11766 case ENUMERAL_TYPE
:
11767 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11768 /*entering_scope=*/0);
11771 case IDENTIFIER_NODE
:
11782 if (t
== integer_type_node
)
11785 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11786 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11790 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11792 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11793 /*integral_constant_expression_p=*/false);
11795 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11797 if (TREE_CODE (max
) == NOP_EXPR
11798 && TREE_SIDE_EFFECTS (omax
)
11799 && !TREE_TYPE (max
))
11800 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11802 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11803 with TREE_SIDE_EFFECTS that indicates this is not an integral
11804 constant expression. */
11805 if (processing_template_decl
11806 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11808 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11809 TREE_SIDE_EFFECTS (max
) = 1;
11812 return compute_array_index_type (NULL_TREE
, max
, complain
);
11815 case TEMPLATE_TYPE_PARM
:
11816 case TEMPLATE_TEMPLATE_PARM
:
11817 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11818 case TEMPLATE_PARM_INDEX
:
11823 tree arg
= NULL_TREE
;
11827 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11828 template_parm_level_and_index (t
, &level
, &idx
);
11830 levels
= TMPL_ARGS_DEPTH (args
);
11831 if (level
<= levels
)
11833 arg
= TMPL_ARG (args
, level
, idx
);
11835 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11837 /* See through ARGUMENT_PACK_SELECT arguments. */
11838 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11839 /* If the selected argument is an expansion E, that most
11840 likely means we were called from
11841 gen_elem_of_pack_expansion_instantiation during the
11842 substituting of pack an argument pack (which Ith
11843 element is a pack expansion, where I is
11844 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11845 In this case, the Ith element resulting from this
11846 substituting is going to be a pack expansion, which
11847 pattern is the pattern of E. Let's return the
11849 gen_elem_of_pack_expansion_instantiation will
11850 build the resulting pack expansion from it. */
11851 if (PACK_EXPANSION_P (arg
))
11853 /* Make sure we aren't throwing away arg info. */
11854 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
11855 arg
= PACK_EXPANSION_PATTERN (arg
);
11860 if (arg
== error_mark_node
)
11861 return error_mark_node
;
11862 else if (arg
!= NULL_TREE
)
11864 if (ARGUMENT_PACK_P (arg
))
11865 /* If ARG is an argument pack, we don't actually want to
11866 perform a substitution here, because substitutions
11867 for argument packs are only done
11868 element-by-element. We can get to this point when
11869 substituting the type of a non-type template
11870 parameter pack, when that type actually contains
11871 template parameter packs from an outer template, e.g.,
11873 template<typename... Types> struct A {
11874 template<Types... Values> struct B { };
11878 if (code
== TEMPLATE_TYPE_PARM
)
11881 gcc_assert (TYPE_P (arg
));
11883 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11885 return cp_build_qualified_type_real
11886 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11888 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11890 /* We are processing a type constructed from a
11891 template template parameter. */
11892 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11893 args
, complain
, in_decl
);
11894 if (argvec
== error_mark_node
)
11895 return error_mark_node
;
11897 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11898 || TREE_CODE (arg
) == TEMPLATE_DECL
11899 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11901 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11902 /* Consider this code:
11904 template <template <class> class Template>
11906 template <class Arg> using Bind = Template<Arg>;
11909 template <template <class> class Template, class Arg>
11910 using Instantiate = Template<Arg>; //#0
11912 template <template <class> class Template,
11915 Instantiate<Internal<Template>::template Bind,
11918 When #1 is parsed, the
11919 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11920 parameter `Template' in #0 matches the
11921 UNBOUND_CLASS_TEMPLATE representing the argument
11922 `Internal<Template>::template Bind'; We then want
11923 to assemble the type `Bind<Argument>' that can't
11924 be fully created right now, because
11925 `Internal<Template>' not being complete, the Bind
11926 template cannot be looked up in that context. So
11927 we need to "store" `Bind<Argument>' for later
11928 when the context of Bind becomes complete. Let's
11929 store that in a TYPENAME_TYPE. */
11930 return make_typename_type (TYPE_CONTEXT (arg
),
11931 build_nt (TEMPLATE_ID_EXPR
,
11932 TYPE_IDENTIFIER (arg
),
11937 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11938 are resolving nested-types in the signature of a
11939 member function templates. Otherwise ARG is a
11940 TEMPLATE_DECL and is the real template to be
11942 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11943 arg
= TYPE_NAME (arg
);
11945 r
= lookup_template_class (arg
,
11947 DECL_CONTEXT (arg
),
11948 /*entering_scope=*/0,
11950 return cp_build_qualified_type_real
11951 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
11954 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11955 return convert_from_reference (unshare_expr (arg
));
11959 /* This can happen during the attempted tsubst'ing in
11960 unify. This means that we don't yet have any information
11961 about the template parameter in question. */
11964 /* Early in template argument deduction substitution, we don't
11965 want to reduce the level of 'auto', or it will be confused
11966 with a normal template parm in subsequent deduction. */
11967 if (is_auto (t
) && (complain
& tf_partial
))
11970 /* If we get here, we must have been looking at a parm for a
11971 more deeply nested template. Make a new version of this
11972 template parameter, but with a lower level. */
11975 case TEMPLATE_TYPE_PARM
:
11976 case TEMPLATE_TEMPLATE_PARM
:
11977 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11978 if (cp_type_quals (t
))
11980 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11981 r
= cp_build_qualified_type_real
11982 (r
, cp_type_quals (t
),
11983 complain
| (code
== TEMPLATE_TYPE_PARM
11984 ? tf_ignore_bad_quals
: 0));
11989 TEMPLATE_TYPE_PARM_INDEX (r
)
11990 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11991 r
, levels
, args
, complain
);
11992 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11993 TYPE_MAIN_VARIANT (r
) = r
;
11994 TYPE_POINTER_TO (r
) = NULL_TREE
;
11995 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11997 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11998 /* We have reduced the level of the template
11999 template parameter, but not the levels of its
12000 template parameters, so canonical_type_parameter
12001 will not be able to find the canonical template
12002 template parameter for this level. Thus, we
12003 require structural equality checking to compare
12004 TEMPLATE_TEMPLATE_PARMs. */
12005 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12006 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12007 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12009 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12011 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12013 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12014 complain
, in_decl
);
12015 if (argvec
== error_mark_node
)
12016 return error_mark_node
;
12018 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
12019 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
12024 case TEMPLATE_PARM_INDEX
:
12025 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
12029 gcc_unreachable ();
12037 tree purpose
, value
, chain
;
12039 if (t
== void_list_node
)
12042 purpose
= TREE_PURPOSE (t
);
12045 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
12046 if (purpose
== error_mark_node
)
12047 return error_mark_node
;
12049 value
= TREE_VALUE (t
);
12052 value
= tsubst (value
, args
, complain
, in_decl
);
12053 if (value
== error_mark_node
)
12054 return error_mark_node
;
12056 chain
= TREE_CHAIN (t
);
12057 if (chain
&& chain
!= void_type_node
)
12059 chain
= tsubst (chain
, args
, complain
, in_decl
);
12060 if (chain
== error_mark_node
)
12061 return error_mark_node
;
12063 if (purpose
== TREE_PURPOSE (t
)
12064 && value
== TREE_VALUE (t
)
12065 && chain
== TREE_CHAIN (t
))
12067 return hash_tree_cons (purpose
, value
, chain
);
12071 /* We should never be tsubsting a binfo. */
12072 gcc_unreachable ();
12075 /* A vector of template arguments. */
12076 gcc_assert (!type
);
12077 return tsubst_template_args (t
, args
, complain
, in_decl
);
12080 case REFERENCE_TYPE
:
12082 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12087 Type deduction may fail for any of the following
12090 -- Attempting to create a pointer to reference type.
12091 -- Attempting to create a reference to a reference type or
12092 a reference to void.
12094 Core issue 106 says that creating a reference to a reference
12095 during instantiation is no longer a cause for failure. We
12096 only enforce this check in strict C++98 mode. */
12097 if ((TREE_CODE (type
) == REFERENCE_TYPE
12098 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12099 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12101 static location_t last_loc
;
12103 /* We keep track of the last time we issued this error
12104 message to avoid spewing a ton of messages during a
12105 single bad template instantiation. */
12106 if (complain
& tf_error
12107 && last_loc
!= input_location
)
12109 if (VOID_TYPE_P (type
))
12110 error ("forming reference to void");
12111 else if (code
== POINTER_TYPE
)
12112 error ("forming pointer to reference type %qT", type
);
12114 error ("forming reference to reference type %qT", type
);
12115 last_loc
= input_location
;
12118 return error_mark_node
;
12120 else if (TREE_CODE (type
) == FUNCTION_TYPE
12121 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12122 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12124 if (complain
& tf_error
)
12126 if (code
== POINTER_TYPE
)
12127 error ("forming pointer to qualified function type %qT",
12130 error ("forming reference to qualified function type %qT",
12133 return error_mark_node
;
12135 else if (code
== POINTER_TYPE
)
12137 r
= build_pointer_type (type
);
12138 if (TREE_CODE (type
) == METHOD_TYPE
)
12139 r
= build_ptrmemfunc_type (r
);
12141 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12142 /* In C++0x, during template argument substitution, when there is an
12143 attempt to create a reference to a reference type, reference
12144 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12146 "If a template-argument for a template-parameter T names a type
12147 that is a reference to a type A, an attempt to create the type
12148 'lvalue reference to cv T' creates the type 'lvalue reference to
12149 A,' while an attempt to create the type type rvalue reference to
12150 cv T' creates the type T"
12152 r
= cp_build_reference_type
12154 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12156 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12157 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12159 if (cxx_dialect
>= cxx14
12160 && !(TREE_CODE (t
) == REFERENCE_TYPE
&& REFERENCE_VLA_OK (t
))
12161 && array_of_runtime_bound_p (type
)
12162 && (flag_iso
|| warn_vla
> 0))
12164 if (complain
& tf_warning_or_error
)
12166 (input_location
, OPT_Wvla
,
12167 code
== REFERENCE_TYPE
12168 ? G_("cannot declare reference to array of runtime bound")
12169 : G_("cannot declare pointer to array of runtime bound"));
12171 r
= error_mark_node
;
12174 if (r
!= error_mark_node
)
12175 /* Will this ever be needed for TYPE_..._TO values? */
12182 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12183 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12187 Type deduction may fail for any of the following
12190 -- Attempting to create "pointer to member of T" when T
12191 is not a class type. */
12192 if (complain
& tf_error
)
12193 error ("creating pointer to member of non-class type %qT", r
);
12194 return error_mark_node
;
12196 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12198 if (complain
& tf_error
)
12199 error ("creating pointer to member reference type %qT", type
);
12200 return error_mark_node
;
12202 if (VOID_TYPE_P (type
))
12204 if (complain
& tf_error
)
12205 error ("creating pointer to member of type void");
12206 return error_mark_node
;
12208 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12209 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12211 /* The type of the implicit object parameter gets its
12212 cv-qualifiers from the FUNCTION_TYPE. */
12215 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12216 type_memfn_rqual (type
));
12217 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12218 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12222 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12226 case FUNCTION_TYPE
:
12231 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12232 if (fntype
== error_mark_node
)
12233 return error_mark_node
;
12235 /* Substitute the exception specification. */
12236 specs
= tsubst_exception_specification (t
, args
, complain
,
12237 in_decl
, /*defer_ok*/true);
12238 if (specs
== error_mark_node
)
12239 return error_mark_node
;
12241 fntype
= build_exception_variant (fntype
, specs
);
12246 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12247 if (domain
== error_mark_node
)
12248 return error_mark_node
;
12250 /* As an optimization, we avoid regenerating the array type if
12251 it will obviously be the same as T. */
12252 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12255 /* These checks should match the ones in create_array_type_for_decl.
12259 The deduction may fail for any of the following reasons:
12261 -- Attempting to create an array with an element type that
12262 is void, a function type, or a reference type, or [DR337]
12263 an abstract class type. */
12264 if (VOID_TYPE_P (type
)
12265 || TREE_CODE (type
) == FUNCTION_TYPE
12266 || (TREE_CODE (type
) == ARRAY_TYPE
12267 && TYPE_DOMAIN (type
) == NULL_TREE
)
12268 || TREE_CODE (type
) == REFERENCE_TYPE
)
12270 if (complain
& tf_error
)
12271 error ("creating array of %qT", type
);
12272 return error_mark_node
;
12275 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12276 return error_mark_node
;
12278 r
= build_cplus_array_type (type
, domain
);
12280 if (TYPE_USER_ALIGN (t
))
12282 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12283 TYPE_USER_ALIGN (r
) = 1;
12289 case TYPENAME_TYPE
:
12291 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12292 in_decl
, /*entering_scope=*/1);
12293 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12294 complain
, in_decl
);
12296 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12297 return error_mark_node
;
12299 if (!MAYBE_CLASS_TYPE_P (ctx
))
12301 if (complain
& tf_error
)
12302 error ("%qT is not a class, struct, or union type", ctx
);
12303 return error_mark_node
;
12305 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12307 /* Normally, make_typename_type does not require that the CTX
12308 have complete type in order to allow things like:
12310 template <class T> struct S { typename S<T>::X Y; };
12312 But, such constructs have already been resolved by this
12313 point, so here CTX really should have complete type, unless
12314 it's a partial instantiation. */
12315 ctx
= complete_type (ctx
);
12316 if (!COMPLETE_TYPE_P (ctx
))
12318 if (complain
& tf_error
)
12319 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12320 return error_mark_node
;
12324 f
= make_typename_type (ctx
, f
, typename_type
,
12325 complain
| tf_keep_type_decl
);
12326 if (f
== error_mark_node
)
12328 if (TREE_CODE (f
) == TYPE_DECL
)
12330 complain
|= tf_ignore_bad_quals
;
12334 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12336 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12338 if (complain
& tf_error
)
12339 error ("%qT resolves to %qT, which is not an enumeration type",
12342 return error_mark_node
;
12344 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12346 if (complain
& tf_error
)
12347 error ("%qT resolves to %qT, which is is not a class type",
12350 return error_mark_node
;
12354 return cp_build_qualified_type_real
12355 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12358 case UNBOUND_CLASS_TEMPLATE
:
12360 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12361 in_decl
, /*entering_scope=*/1);
12362 tree name
= TYPE_IDENTIFIER (t
);
12363 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12365 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12366 return error_mark_node
;
12369 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12370 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12377 ++cp_unevaluated_operand
;
12378 ++c_inhibit_evaluation_warnings
;
12380 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12382 /*integral_constant_expression_p=*/false);
12384 --cp_unevaluated_operand
;
12385 --c_inhibit_evaluation_warnings
;
12387 type
= finish_typeof (type
);
12388 return cp_build_qualified_type_real (type
,
12390 | cp_type_quals (type
),
12394 case DECLTYPE_TYPE
:
12398 ++cp_unevaluated_operand
;
12399 ++c_inhibit_evaluation_warnings
;
12401 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12402 complain
|tf_decltype
, in_decl
,
12403 /*function_p*/false,
12404 /*integral_constant_expression*/false);
12406 --cp_unevaluated_operand
;
12407 --c_inhibit_evaluation_warnings
;
12409 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12410 type
= lambda_capture_field_type (type
,
12411 DECLTYPE_FOR_INIT_CAPTURE (t
));
12412 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12413 type
= lambda_proxy_type (type
);
12416 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12417 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12419 /* In a template ~id could be either a complement expression
12420 or an unqualified-id naming a destructor; if instantiating
12421 it produces an expression, it's not an id-expression or
12424 type
= finish_decltype_type (type
, id
, complain
);
12426 return cp_build_qualified_type_real (type
,
12428 | cp_type_quals (type
),
12432 case UNDERLYING_TYPE
:
12434 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12435 complain
, in_decl
);
12436 return finish_underlying_type (type
);
12439 case TYPE_ARGUMENT_PACK
:
12440 case NONTYPE_ARGUMENT_PACK
:
12442 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12444 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12448 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12450 /* For template nontype argument packs, also substitute into
12452 if (code
== NONTYPE_ARGUMENT_PACK
)
12453 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12472 /* We should use one of the expression tsubsts for these codes. */
12473 gcc_unreachable ();
12476 sorry ("use of %qs in template", get_tree_code_name (code
));
12477 return error_mark_node
;
12481 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12482 type of the expression on the left-hand side of the "." or "->"
12486 tsubst_baselink (tree baselink
, tree object_type
,
12487 tree args
, tsubst_flags_t complain
, tree in_decl
)
12490 tree qualifying_scope
;
12493 tree template_args
= 0;
12494 bool template_id_p
= false;
12495 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12497 /* A baselink indicates a function from a base class. Both the
12498 BASELINK_ACCESS_BINFO and the base class referenced may
12499 indicate bases of the template class, rather than the
12500 instantiated class. In addition, lookups that were not
12501 ambiguous before may be ambiguous now. Therefore, we perform
12502 the lookup again. */
12503 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12504 qualifying_scope
= tsubst (qualifying_scope
, args
,
12505 complain
, in_decl
);
12506 fns
= BASELINK_FUNCTIONS (baselink
);
12507 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12508 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12510 template_id_p
= true;
12511 template_args
= TREE_OPERAND (fns
, 1);
12512 fns
= TREE_OPERAND (fns
, 0);
12514 template_args
= tsubst_template_args (template_args
, args
,
12515 complain
, in_decl
);
12517 name
= DECL_NAME (get_first_fn (fns
));
12518 if (IDENTIFIER_TYPENAME_P (name
))
12519 name
= mangle_conv_op_name_for_type (optype
);
12520 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12522 return error_mark_node
;
12524 /* If lookup found a single function, mark it as used at this
12525 point. (If it lookup found multiple functions the one selected
12526 later by overload resolution will be marked as used at that
12528 if (BASELINK_P (baselink
))
12529 fns
= BASELINK_FUNCTIONS (baselink
);
12530 if (!template_id_p
&& !really_overloaded_fn (fns
))
12531 mark_used (OVL_CURRENT (fns
));
12533 /* Add back the template arguments, if present. */
12534 if (BASELINK_P (baselink
) && template_id_p
)
12535 BASELINK_FUNCTIONS (baselink
)
12536 = build_nt (TEMPLATE_ID_EXPR
,
12537 BASELINK_FUNCTIONS (baselink
),
12539 /* Update the conversion operator type. */
12540 BASELINK_OPTYPE (baselink
) = optype
;
12543 object_type
= current_class_type
;
12546 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12552 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12553 true if the qualified-id will be a postfix-expression in-and-of
12554 itself; false if more of the postfix-expression follows the
12555 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12559 tsubst_qualified_id (tree qualified_id
, tree args
,
12560 tsubst_flags_t complain
, tree in_decl
,
12561 bool done
, bool address_p
)
12567 tree template_args
;
12568 location_t loc
= UNKNOWN_LOCATION
;
12570 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12572 /* Figure out what name to look up. */
12573 name
= TREE_OPERAND (qualified_id
, 1);
12574 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12576 is_template
= true;
12577 loc
= EXPR_LOCATION (name
);
12578 template_args
= TREE_OPERAND (name
, 1);
12580 template_args
= tsubst_template_args (template_args
, args
,
12581 complain
, in_decl
);
12582 name
= TREE_OPERAND (name
, 0);
12586 is_template
= false;
12587 template_args
= NULL_TREE
;
12590 /* Substitute into the qualifying scope. When there are no ARGS, we
12591 are just trying to simplify a non-dependent expression. In that
12592 case the qualifying scope may be dependent, and, in any case,
12593 substituting will not help. */
12594 scope
= TREE_OPERAND (qualified_id
, 0);
12597 scope
= tsubst (scope
, args
, complain
, in_decl
);
12598 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12603 if (dependent_scope_p (scope
))
12606 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12607 return build_qualified_name (NULL_TREE
, scope
, expr
,
12608 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12611 if (!BASELINK_P (name
) && !DECL_P (expr
))
12613 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12615 /* A BIT_NOT_EXPR is used to represent a destructor. */
12616 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12618 error ("qualifying type %qT does not match destructor name ~%qT",
12619 scope
, TREE_OPERAND (expr
, 0));
12620 expr
= error_mark_node
;
12623 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12624 /*is_type_p=*/0, false);
12627 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12628 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12629 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12631 if (complain
& tf_error
)
12633 error ("dependent-name %qE is parsed as a non-type, but "
12634 "instantiation yields a type", qualified_id
);
12635 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12637 return error_mark_node
;
12643 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12645 /* Remember that there was a reference to this entity. */
12649 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12651 if (complain
& tf_error
)
12652 qualified_name_lookup_error (scope
,
12653 TREE_OPERAND (qualified_id
, 1),
12654 expr
, input_location
);
12655 return error_mark_node
;
12659 expr
= lookup_template_function (expr
, template_args
);
12661 if (expr
== error_mark_node
&& complain
& tf_error
)
12662 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12663 expr
, input_location
);
12664 else if (TYPE_P (scope
))
12666 expr
= (adjust_result_of_qualified_name_lookup
12667 (expr
, scope
, current_nonlambda_class_type ()));
12668 expr
= (finish_qualified_id_expr
12669 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12670 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12671 /*template_arg_p=*/false, complain
));
12674 /* Expressions do not generally have reference type. */
12675 if (TREE_CODE (expr
) != SCOPE_REF
12676 /* However, if we're about to form a pointer-to-member, we just
12677 want the referenced member referenced. */
12678 && TREE_CODE (expr
) != OFFSET_REF
)
12679 expr
= convert_from_reference (expr
);
12684 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
12685 initializer, DECL is the substituted VAR_DECL. Other arguments are as
12689 tsubst_init (tree init
, tree decl
, tree args
,
12690 tsubst_flags_t complain
, tree in_decl
)
12695 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
12699 /* If we had an initializer but it
12700 instantiated to nothing,
12701 value-initialize the object. This will
12702 only occur when the initializer was a
12703 pack expansion where the parameter packs
12704 used in that expansion were of length
12706 init
= build_value_init (TREE_TYPE (decl
),
12708 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12709 init
= get_target_expr_sfinae (init
, complain
);
12715 /* Like tsubst, but deals with expressions. This function just replaces
12716 template parms; to finish processing the resultant expression, use
12717 tsubst_copy_and_build or tsubst_expr. */
12720 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12722 enum tree_code code
;
12725 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12728 code
= TREE_CODE (t
);
12733 r
= retrieve_local_specialization (t
);
12735 if (r
== NULL_TREE
)
12737 /* We get here for a use of 'this' in an NSDMI. */
12738 if (DECL_NAME (t
) == this_identifier
12739 && current_function_decl
12740 && DECL_CONSTRUCTOR_P (current_function_decl
))
12741 return current_class_ptr
;
12743 /* This can happen for a parameter name used later in a function
12744 declaration (such as in a late-specified return type). Just
12745 make a dummy decl, since it's only used for its type. */
12746 gcc_assert (cp_unevaluated_operand
!= 0);
12747 r
= tsubst_decl (t
, args
, complain
);
12748 /* Give it the template pattern as its context; its true context
12749 hasn't been instantiated yet and this is good enough for
12751 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12754 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12755 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12764 if (DECL_TEMPLATE_PARM_P (t
))
12765 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12766 /* There is no need to substitute into namespace-scope
12768 if (DECL_NAMESPACE_SCOPE_P (t
))
12770 /* If ARGS is NULL, then T is known to be non-dependent. */
12771 if (args
== NULL_TREE
)
12772 return integral_constant_value (t
);
12774 /* Unfortunately, we cannot just call lookup_name here.
12777 template <int I> int f() {
12779 struct S { void g() { E e = a; } };
12782 When we instantiate f<7>::S::g(), say, lookup_name is not
12783 clever enough to find f<7>::a. */
12785 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12786 /*entering_scope=*/0);
12788 for (v
= TYPE_VALUES (enum_type
);
12790 v
= TREE_CHAIN (v
))
12791 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12792 return TREE_VALUE (v
);
12794 /* We didn't find the name. That should never happen; if
12795 name-lookup found it during preliminary parsing, we
12796 should find it again here during instantiation. */
12797 gcc_unreachable ();
12802 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12804 /* Check for a local specialization set up by
12805 tsubst_pack_expansion. */
12806 if (tree r
= retrieve_local_specialization (t
))
12808 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12809 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12813 /* When retrieving a capture pack from a generic lambda, remove the
12814 lambda call op's own template argument list from ARGS. Only the
12815 template arguments active for the closure type should be used to
12816 retrieve the pack specialization. */
12817 if (LAMBDA_FUNCTION_P (current_function_decl
)
12818 && (template_class_depth (DECL_CONTEXT (t
))
12819 != TMPL_ARGS_DEPTH (args
)))
12820 args
= strip_innermost_template_args (args
, 1);
12822 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12823 tsubst_decl put in the hash table. */
12824 return retrieve_specialization (t
, args
, 0);
12827 if (DECL_CONTEXT (t
))
12831 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12832 /*entering_scope=*/1);
12833 if (ctx
!= DECL_CONTEXT (t
))
12835 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12838 if (complain
& tf_error
)
12839 error ("using invalid field %qD", t
);
12840 return error_mark_node
;
12849 case FUNCTION_DECL
:
12850 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12851 r
= tsubst (t
, args
, complain
, in_decl
);
12852 else if (local_variable_p (t
))
12854 r
= retrieve_local_specialization (t
);
12855 if (r
== NULL_TREE
)
12857 /* First try name lookup to find the instantiation. */
12858 r
= lookup_name (DECL_NAME (t
));
12861 /* Make sure that the one we found is the one we want. */
12862 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
12863 complain
, in_decl
);
12864 if (ctx
!= DECL_CONTEXT (r
))
12872 /* This can happen for a variable used in a
12873 late-specified return type of a local lambda, or for a
12874 local static or constant. Building a new VAR_DECL
12875 should be OK in all those cases. */
12876 r
= tsubst_decl (t
, args
, complain
);
12877 if (decl_maybe_constant_var_p (r
))
12879 /* We can't call cp_finish_decl, so handle the
12880 initializer by hand. */
12881 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
12882 complain
, in_decl
);
12883 if (!processing_template_decl
)
12884 init
= maybe_constant_init (init
);
12885 if (processing_template_decl
12886 ? potential_constant_expression (init
)
12887 : reduced_constant_expression_p (init
))
12888 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
12889 = TREE_CONSTANT (r
) = true;
12890 DECL_INITIAL (r
) = init
;
12892 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
12893 || decl_constant_var_p (r
)
12894 || errorcount
|| sorrycount
);
12895 if (!processing_template_decl
)
12897 if (TREE_STATIC (r
))
12898 rest_of_decl_compilation (r
, toplevel_bindings_p (),
12900 else if (decl_constant_var_p (r
))
12901 /* A use of a local constant decays to its value.
12902 FIXME update for core DR 696. */
12903 r
= integral_constant_value (r
);
12906 /* Remember this for subsequent uses. */
12907 if (local_specializations
)
12908 register_local_specialization (r
, t
);
12916 case NAMESPACE_DECL
:
12920 /* An OVERLOAD will always be a non-dependent overload set; an
12921 overload set from function scope will just be represented with an
12922 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12923 gcc_assert (!uses_template_parms (t
));
12927 return tsubst_baselink (t
, current_nonlambda_class_type (),
12928 args
, complain
, in_decl
);
12930 case TEMPLATE_DECL
:
12931 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12932 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12933 args
, complain
, in_decl
);
12934 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12935 return tsubst (t
, args
, complain
, in_decl
);
12936 else if (DECL_CLASS_SCOPE_P (t
)
12937 && uses_template_parms (DECL_CONTEXT (t
)))
12939 /* Template template argument like the following example need
12942 template <template <class> class TT> struct C {};
12943 template <class T> struct D {
12944 template <class U> struct E {};
12949 We are processing the template argument `E' in #1 for
12950 the template instantiation #2. Originally, `E' is a
12951 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12952 have to substitute this with one having context `D<int>'. */
12954 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12955 return lookup_field (context
, DECL_NAME(t
), 0, false);
12958 /* Ordinary template template argument. */
12962 case REINTERPRET_CAST_EXPR
:
12963 case CONST_CAST_EXPR
:
12964 case STATIC_CAST_EXPR
:
12965 case DYNAMIC_CAST_EXPR
:
12966 case IMPLICIT_CONV_EXPR
:
12970 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12971 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12972 return build1 (code
, type
, op0
);
12976 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12979 tree expanded
, op
= TREE_OPERAND (t
, 0);
12982 if (SIZEOF_EXPR_TYPE_P (t
))
12983 op
= TREE_TYPE (op
);
12985 ++cp_unevaluated_operand
;
12986 ++c_inhibit_evaluation_warnings
;
12987 /* We only want to compute the number of arguments. */
12988 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12989 --cp_unevaluated_operand
;
12990 --c_inhibit_evaluation_warnings
;
12992 if (TREE_CODE (expanded
) == TREE_VEC
)
12993 len
= TREE_VEC_LENGTH (expanded
);
12995 if (expanded
== error_mark_node
)
12996 return error_mark_node
;
12997 else if (PACK_EXPANSION_P (expanded
)
12998 || (TREE_CODE (expanded
) == TREE_VEC
13000 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13002 if (TREE_CODE (expanded
) == TREE_VEC
)
13003 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13005 if (TYPE_P (expanded
))
13006 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13007 complain
& tf_error
);
13009 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13010 complain
& tf_error
);
13013 return build_int_cst (size_type_node
, len
);
13015 if (SIZEOF_EXPR_TYPE_P (t
))
13017 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13018 args
, complain
, in_decl
);
13019 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13020 r
= build1 (SIZEOF_EXPR
,
13021 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13022 SIZEOF_EXPR_TYPE_P (r
) = 1;
13029 case TRUTH_NOT_EXPR
:
13032 case UNARY_PLUS_EXPR
: /* Unary + */
13034 case AT_ENCODE_EXPR
:
13038 case REALPART_EXPR
:
13039 case IMAGPART_EXPR
:
13042 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13043 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13044 return build1 (code
, type
, op0
);
13047 case COMPONENT_REF
:
13052 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13053 name
= TREE_OPERAND (t
, 1);
13054 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13056 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13057 complain
, in_decl
);
13058 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13060 else if (TREE_CODE (name
) == SCOPE_REF
13061 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13063 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13064 complain
, in_decl
);
13065 name
= TREE_OPERAND (name
, 1);
13066 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13067 complain
, in_decl
);
13068 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13069 name
= build_qualified_name (/*type=*/NULL_TREE
,
13071 /*template_p=*/false);
13073 else if (BASELINK_P (name
))
13074 name
= tsubst_baselink (name
,
13075 non_reference (TREE_TYPE (object
)),
13079 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13080 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13086 case TRUNC_DIV_EXPR
:
13087 case CEIL_DIV_EXPR
:
13088 case FLOOR_DIV_EXPR
:
13089 case ROUND_DIV_EXPR
:
13090 case EXACT_DIV_EXPR
:
13094 case TRUNC_MOD_EXPR
:
13095 case FLOOR_MOD_EXPR
:
13096 case TRUTH_ANDIF_EXPR
:
13097 case TRUTH_ORIF_EXPR
:
13098 case TRUTH_AND_EXPR
:
13099 case TRUTH_OR_EXPR
:
13112 case COMPOUND_EXPR
:
13115 case PREDECREMENT_EXPR
:
13116 case PREINCREMENT_EXPR
:
13117 case POSTDECREMENT_EXPR
:
13118 case POSTINCREMENT_EXPR
:
13120 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13121 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13122 return build_nt (code
, op0
, op1
);
13127 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13128 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13129 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13130 QUALIFIED_NAME_IS_TEMPLATE (t
));
13135 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13136 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13137 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13142 int n
= VL_EXP_OPERAND_LENGTH (t
);
13143 tree result
= build_vl_exp (CALL_EXPR
, n
);
13145 for (i
= 0; i
< n
; i
++)
13146 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13147 complain
, in_decl
);
13153 case PSEUDO_DTOR_EXPR
:
13154 case VEC_PERM_EXPR
:
13156 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13157 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13158 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13159 r
= build_nt (code
, op0
, op1
, op2
);
13160 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13166 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13167 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13168 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13169 r
= build_nt (code
, op0
, op1
, op2
);
13170 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13176 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13177 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13178 r
= build_nt (code
, op0
, op1
);
13179 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13180 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13184 case TEMPLATE_ID_EXPR
:
13186 /* Substituted template arguments */
13187 tree fn
= TREE_OPERAND (t
, 0);
13188 tree targs
= TREE_OPERAND (t
, 1);
13190 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13192 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13194 return lookup_template_function (fn
, targs
);
13199 tree purpose
, value
, chain
;
13201 if (t
== void_list_node
)
13204 purpose
= TREE_PURPOSE (t
);
13206 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13207 value
= TREE_VALUE (t
);
13209 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13210 chain
= TREE_CHAIN (t
);
13211 if (chain
&& chain
!= void_type_node
)
13212 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13213 if (purpose
== TREE_PURPOSE (t
)
13214 && value
== TREE_VALUE (t
)
13215 && chain
== TREE_CHAIN (t
))
13217 return tree_cons (purpose
, value
, chain
);
13222 case ENUMERAL_TYPE
:
13224 case TEMPLATE_TYPE_PARM
:
13225 case TEMPLATE_TEMPLATE_PARM
:
13226 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13227 case TEMPLATE_PARM_INDEX
:
13229 case REFERENCE_TYPE
:
13231 case FUNCTION_TYPE
:
13234 case TYPENAME_TYPE
:
13235 case UNBOUND_CLASS_TEMPLATE
:
13237 case DECLTYPE_TYPE
:
13239 return tsubst (t
, args
, complain
, in_decl
);
13243 /* Fall through. */
13244 case IDENTIFIER_NODE
:
13245 if (IDENTIFIER_TYPENAME_P (t
))
13247 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13248 return mangle_conv_op_name_for_type (new_type
);
13254 /* This is handled by tsubst_copy_and_build. */
13255 gcc_unreachable ();
13259 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13260 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13261 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13264 case CLEANUP_POINT_EXPR
:
13265 /* We shouldn't have built any of these during initial template
13266 generation. Instead, they should be built during instantiation
13267 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13268 gcc_unreachable ();
13272 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13273 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13274 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13275 r
= build2 (code
, type
, op0
, op1
);
13276 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13277 mark_used (TREE_OPERAND (r
, 1));
13281 case EXPR_PACK_EXPANSION
:
13282 error ("invalid use of pack expansion expression");
13283 return error_mark_node
;
13285 case NONTYPE_ARGUMENT_PACK
:
13286 error ("use %<...%> to expand argument pack");
13287 return error_mark_node
;
13290 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
13298 /* Instantiate any typedefs in the type. */
13299 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13300 r
= fold_convert (type
, t
);
13301 gcc_assert (TREE_CODE (r
) == code
);
13306 /* These can sometimes show up in a partial instantiation, but never
13307 involve template parms. */
13308 gcc_assert (!uses_template_parms (t
));
13312 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13313 gcc_checking_assert (false);
13318 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13321 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13322 tree args
, tsubst_flags_t complain
, tree in_decl
)
13324 tree new_clauses
= NULL
, nc
, oc
;
13326 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13328 nc
= copy_node (oc
);
13329 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13332 switch (OMP_CLAUSE_CODE (nc
))
13334 case OMP_CLAUSE_LASTPRIVATE
:
13335 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13337 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13338 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13339 in_decl
, /*integral_constant_expression_p=*/false);
13340 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13341 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13344 case OMP_CLAUSE_PRIVATE
:
13345 case OMP_CLAUSE_SHARED
:
13346 case OMP_CLAUSE_FIRSTPRIVATE
:
13347 case OMP_CLAUSE_COPYIN
:
13348 case OMP_CLAUSE_COPYPRIVATE
:
13349 case OMP_CLAUSE_IF
:
13350 case OMP_CLAUSE_NUM_THREADS
:
13351 case OMP_CLAUSE_SCHEDULE
:
13352 case OMP_CLAUSE_COLLAPSE
:
13353 case OMP_CLAUSE_FINAL
:
13354 case OMP_CLAUSE_DEPEND
:
13355 case OMP_CLAUSE_FROM
:
13356 case OMP_CLAUSE_TO
:
13357 case OMP_CLAUSE_UNIFORM
:
13358 case OMP_CLAUSE_MAP
:
13359 case OMP_CLAUSE_DEVICE
:
13360 case OMP_CLAUSE_DIST_SCHEDULE
:
13361 case OMP_CLAUSE_NUM_TEAMS
:
13362 case OMP_CLAUSE_THREAD_LIMIT
:
13363 case OMP_CLAUSE_SAFELEN
:
13364 case OMP_CLAUSE_SIMDLEN
:
13365 OMP_CLAUSE_OPERAND (nc
, 0)
13366 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13367 in_decl
, /*integral_constant_expression_p=*/false);
13369 case OMP_CLAUSE_REDUCTION
:
13370 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13372 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13373 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13375 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13376 complain
, in_decl
);
13377 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13378 = build_qualified_name (NULL_TREE
, scope
,
13379 TREE_OPERAND (placeholder
, 1),
13383 gcc_assert (identifier_p (placeholder
));
13385 OMP_CLAUSE_OPERAND (nc
, 0)
13386 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13387 in_decl
, /*integral_constant_expression_p=*/false);
13389 case OMP_CLAUSE_LINEAR
:
13390 case OMP_CLAUSE_ALIGNED
:
13391 OMP_CLAUSE_OPERAND (nc
, 0)
13392 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13393 in_decl
, /*integral_constant_expression_p=*/false);
13394 OMP_CLAUSE_OPERAND (nc
, 1)
13395 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13396 in_decl
, /*integral_constant_expression_p=*/false);
13399 case OMP_CLAUSE_NOWAIT
:
13400 case OMP_CLAUSE_ORDERED
:
13401 case OMP_CLAUSE_DEFAULT
:
13402 case OMP_CLAUSE_UNTIED
:
13403 case OMP_CLAUSE_MERGEABLE
:
13404 case OMP_CLAUSE_INBRANCH
:
13405 case OMP_CLAUSE_NOTINBRANCH
:
13406 case OMP_CLAUSE_PROC_BIND
:
13407 case OMP_CLAUSE_FOR
:
13408 case OMP_CLAUSE_PARALLEL
:
13409 case OMP_CLAUSE_SECTIONS
:
13410 case OMP_CLAUSE_TASKGROUP
:
13413 gcc_unreachable ();
13417 new_clauses
= nreverse (new_clauses
);
13419 new_clauses
= finish_omp_clauses (new_clauses
);
13420 return new_clauses
;
13423 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13426 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13429 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13431 tree purpose
, value
, chain
;
13436 if (TREE_CODE (t
) != TREE_LIST
)
13437 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13438 /*function_p=*/false,
13439 /*integral_constant_expression_p=*/false);
13441 if (t
== void_list_node
)
13444 purpose
= TREE_PURPOSE (t
);
13446 purpose
= RECUR (purpose
);
13447 value
= TREE_VALUE (t
);
13450 if (TREE_CODE (value
) != LABEL_DECL
)
13451 value
= RECUR (value
);
13454 value
= lookup_label (DECL_NAME (value
));
13455 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13456 TREE_USED (value
) = 1;
13459 chain
= TREE_CHAIN (t
);
13460 if (chain
&& chain
!= void_type_node
)
13461 chain
= RECUR (chain
);
13462 return tree_cons (purpose
, value
, chain
);
13466 /* Substitute one OMP_FOR iterator. */
13469 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13470 tree condv
, tree incrv
, tree
*clauses
,
13471 tree args
, tsubst_flags_t complain
, tree in_decl
,
13472 bool integral_constant_expression_p
)
13474 #define RECUR(NODE) \
13475 tsubst_expr ((NODE), args, complain, in_decl, \
13476 integral_constant_expression_p)
13477 tree decl
, init
, cond
, incr
;
13479 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13480 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13481 decl
= TREE_OPERAND (init
, 0);
13482 init
= TREE_OPERAND (init
, 1);
13483 tree decl_expr
= NULL_TREE
;
13484 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13486 /* We need to jump through some hoops to handle declarations in the
13487 for-init-statement, since we might need to handle auto deduction,
13488 but we need to keep control of initialization. */
13490 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13491 decl
= tsubst_decl (decl
, args
, complain
);
13494 decl
= RECUR (decl
);
13495 init
= RECUR (init
);
13497 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13498 if (auto_node
&& init
)
13500 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13502 gcc_assert (!type_dependent_expression_p (decl
));
13504 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13508 /* Declare the variable, but don't let that initialize it. */
13509 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13510 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13512 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13515 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13516 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13517 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13519 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13520 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
13521 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
13522 NOP_EXPR
, rhs
, complain
);
13525 incr
= RECUR (incr
);
13526 TREE_VEC_ELT (declv
, i
) = decl
;
13527 TREE_VEC_ELT (initv
, i
) = init
;
13528 TREE_VEC_ELT (condv
, i
) = cond
;
13529 TREE_VEC_ELT (incrv
, i
) = incr
;
13535 /* Declare and initialize the variable. */
13542 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13544 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13545 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13546 && OMP_CLAUSE_DECL (c
) == decl
)
13548 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13549 && OMP_CLAUSE_DECL (c
) == decl
)
13550 error ("iteration variable %qD should not be firstprivate", decl
);
13551 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13552 && OMP_CLAUSE_DECL (c
) == decl
)
13553 error ("iteration variable %qD should not be reduction", decl
);
13557 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13558 OMP_CLAUSE_DECL (c
) = decl
;
13559 c
= finish_omp_clauses (c
);
13562 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13567 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13568 if (COMPARISON_CLASS_P (cond
))
13570 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
13571 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
13572 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
13575 cond
= RECUR (cond
);
13576 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13577 switch (TREE_CODE (incr
))
13579 case PREINCREMENT_EXPR
:
13580 case PREDECREMENT_EXPR
:
13581 case POSTINCREMENT_EXPR
:
13582 case POSTDECREMENT_EXPR
:
13583 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13584 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13587 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13588 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13590 tree rhs
= TREE_OPERAND (incr
, 1);
13591 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13592 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13593 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13594 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13595 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13599 incr
= RECUR (incr
);
13602 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13603 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13605 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13606 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13607 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13608 TREE_TYPE (decl
), lhs
,
13609 RECUR (TREE_OPERAND (incr
, 2))));
13611 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13612 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13613 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13615 tree rhs
= TREE_OPERAND (incr
, 2);
13616 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13617 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13618 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13619 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13620 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13624 incr
= RECUR (incr
);
13627 incr
= RECUR (incr
);
13631 TREE_VEC_ELT (declv
, i
) = decl
;
13632 TREE_VEC_ELT (initv
, i
) = init
;
13633 TREE_VEC_ELT (condv
, i
) = cond
;
13634 TREE_VEC_ELT (incrv
, i
) = incr
;
13638 /* Like tsubst_copy for expressions, etc. but also does semantic
13642 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13643 bool integral_constant_expression_p
)
13645 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13646 #define RECUR(NODE) \
13647 tsubst_expr ((NODE), args, complain, in_decl, \
13648 integral_constant_expression_p)
13654 if (t
== NULL_TREE
|| t
== error_mark_node
)
13657 loc
= input_location
;
13658 if (EXPR_HAS_LOCATION (t
))
13659 input_location
= EXPR_LOCATION (t
);
13660 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13661 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13663 switch (TREE_CODE (t
))
13665 case STATEMENT_LIST
:
13667 tree_stmt_iterator i
;
13668 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13669 RECUR (tsi_stmt (i
));
13673 case CTOR_INITIALIZER
:
13674 finish_mem_initializers (tsubst_initializer_list
13675 (TREE_OPERAND (t
, 0), args
));
13679 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13683 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13684 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13685 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13687 finish_expr_stmt (tmp
);
13691 do_using_directive (USING_STMT_NAMESPACE (t
));
13696 tree decl
, pattern_decl
;
13699 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13700 if (TREE_CODE (decl
) == LABEL_DECL
)
13701 finish_label_decl (DECL_NAME (decl
));
13702 else if (TREE_CODE (decl
) == USING_DECL
)
13704 tree scope
= USING_DECL_SCOPE (decl
);
13705 tree name
= DECL_NAME (decl
);
13708 scope
= tsubst (scope
, args
, complain
, in_decl
);
13709 decl
= lookup_qualified_name (scope
, name
,
13710 /*is_type_p=*/false,
13711 /*complain=*/false);
13712 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13713 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13715 do_local_using_decl (decl
, scope
, name
);
13717 else if (DECL_PACK_P (decl
))
13719 /* Don't build up decls for a variadic capture proxy, we'll
13720 instantiate the elements directly as needed. */
13725 init
= DECL_INITIAL (decl
);
13726 decl
= tsubst (decl
, args
, complain
, in_decl
);
13727 if (decl
!= error_mark_node
)
13729 /* By marking the declaration as instantiated, we avoid
13730 trying to instantiate it. Since instantiate_decl can't
13731 handle local variables, and since we've already done
13732 all that needs to be done, that's the right thing to
13735 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13737 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13738 /* Anonymous aggregates are a special case. */
13739 finish_anon_union (decl
);
13740 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13742 DECL_CONTEXT (decl
) = current_function_decl
;
13743 if (DECL_NAME (decl
) == this_identifier
)
13745 tree lam
= DECL_CONTEXT (current_function_decl
);
13746 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13747 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13749 insert_capture_proxy (decl
);
13751 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13752 /* We already did a pushtag. */;
13753 else if (TREE_CODE (decl
) == FUNCTION_DECL
13754 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
13755 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
13757 DECL_CONTEXT (decl
) = NULL_TREE
;
13759 DECL_CONTEXT (decl
) = current_function_decl
;
13760 cp_check_omp_declare_reduction (decl
);
13764 int const_init
= false;
13765 maybe_push_decl (decl
);
13767 && DECL_PRETTY_FUNCTION_P (decl
))
13769 /* For __PRETTY_FUNCTION__ we have to adjust the
13771 const char *const name
13772 = cxx_printable_name (current_function_decl
, 2);
13773 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
13776 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
13779 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13781 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13790 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13791 RECUR (FOR_INIT_STMT (t
));
13792 finish_for_init_stmt (stmt
);
13793 tmp
= RECUR (FOR_COND (t
));
13794 finish_for_cond (tmp
, stmt
, false);
13795 tmp
= RECUR (FOR_EXPR (t
));
13796 finish_for_expr (tmp
, stmt
);
13797 RECUR (FOR_BODY (t
));
13798 finish_for_stmt (stmt
);
13801 case RANGE_FOR_STMT
:
13804 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13805 decl
= RANGE_FOR_DECL (t
);
13806 decl
= tsubst (decl
, args
, complain
, in_decl
);
13807 maybe_push_decl (decl
);
13808 expr
= RECUR (RANGE_FOR_EXPR (t
));
13809 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
13810 RECUR (RANGE_FOR_BODY (t
));
13811 finish_for_stmt (stmt
);
13816 stmt
= begin_while_stmt ();
13817 tmp
= RECUR (WHILE_COND (t
));
13818 finish_while_stmt_cond (tmp
, stmt
, false);
13819 RECUR (WHILE_BODY (t
));
13820 finish_while_stmt (stmt
);
13824 stmt
= begin_do_stmt ();
13825 RECUR (DO_BODY (t
));
13826 finish_do_body (stmt
);
13827 tmp
= RECUR (DO_COND (t
));
13828 finish_do_stmt (tmp
, stmt
, false);
13832 stmt
= begin_if_stmt ();
13833 tmp
= RECUR (IF_COND (t
));
13834 finish_if_stmt_cond (tmp
, stmt
);
13835 RECUR (THEN_CLAUSE (t
));
13836 finish_then_clause (stmt
);
13838 if (ELSE_CLAUSE (t
))
13840 begin_else_clause (stmt
);
13841 RECUR (ELSE_CLAUSE (t
));
13842 finish_else_clause (stmt
);
13845 finish_if_stmt (stmt
);
13849 if (BIND_EXPR_BODY_BLOCK (t
))
13850 stmt
= begin_function_body ();
13852 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13853 ? BCS_TRY_BLOCK
: 0);
13855 RECUR (BIND_EXPR_BODY (t
));
13857 if (BIND_EXPR_BODY_BLOCK (t
))
13858 finish_function_body (stmt
);
13860 finish_compound_stmt (stmt
);
13864 finish_break_stmt ();
13867 case CONTINUE_STMT
:
13868 finish_continue_stmt ();
13872 stmt
= begin_switch_stmt ();
13873 tmp
= RECUR (SWITCH_STMT_COND (t
));
13874 finish_switch_cond (tmp
, stmt
);
13875 RECUR (SWITCH_STMT_BODY (t
));
13876 finish_switch_stmt (stmt
);
13879 case CASE_LABEL_EXPR
:
13881 tree low
= RECUR (CASE_LOW (t
));
13882 tree high
= RECUR (CASE_HIGH (t
));
13883 finish_case_label (EXPR_LOCATION (t
), low
, high
);
13889 tree decl
= LABEL_EXPR_LABEL (t
);
13892 label
= finish_label_stmt (DECL_NAME (decl
));
13893 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13894 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13899 tmp
= GOTO_DESTINATION (t
);
13900 if (TREE_CODE (tmp
) != LABEL_DECL
)
13901 /* Computed goto's must be tsubst'd into. On the other hand,
13902 non-computed gotos must not be; the identifier in question
13903 will have no binding. */
13906 tmp
= DECL_NAME (tmp
);
13907 finish_goto_stmt (tmp
);
13912 tree string
= RECUR (ASM_STRING (t
));
13913 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
13914 complain
, in_decl
);
13915 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
13916 complain
, in_decl
);
13917 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
13918 complain
, in_decl
);
13919 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
13920 complain
, in_decl
);
13921 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
13923 tree asm_expr
= tmp
;
13924 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13925 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13926 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13933 stmt
= begin_try_block ();
13934 RECUR (TRY_STMTS (t
));
13935 finish_cleanup_try_block (stmt
);
13936 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13940 tree compound_stmt
= NULL_TREE
;
13942 if (FN_TRY_BLOCK_P (t
))
13943 stmt
= begin_function_try_block (&compound_stmt
);
13945 stmt
= begin_try_block ();
13947 RECUR (TRY_STMTS (t
));
13949 if (FN_TRY_BLOCK_P (t
))
13950 finish_function_try_block (stmt
);
13952 finish_try_block (stmt
);
13954 RECUR (TRY_HANDLERS (t
));
13955 if (FN_TRY_BLOCK_P (t
))
13956 finish_function_handler_sequence (stmt
, compound_stmt
);
13958 finish_handler_sequence (stmt
);
13964 tree decl
= HANDLER_PARMS (t
);
13968 decl
= tsubst (decl
, args
, complain
, in_decl
);
13969 /* Prevent instantiate_decl from trying to instantiate
13970 this variable. We've already done all that needs to be
13972 if (decl
!= error_mark_node
)
13973 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13975 stmt
= begin_handler ();
13976 finish_handler_parms (decl
, stmt
);
13977 RECUR (HANDLER_BODY (t
));
13978 finish_handler (stmt
);
13983 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13984 if (CLASS_TYPE_P (tmp
))
13986 /* Local classes are not independent templates; they are
13987 instantiated along with their containing function. And this
13988 way we don't have to deal with pushing out of one local class
13989 to instantiate a member of another local class. */
13991 /* Closures are handled by the LAMBDA_EXPR. */
13992 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13993 complete_type (tmp
);
13994 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13995 if (!DECL_ARTIFICIAL (fn
))
13996 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
14000 case STATIC_ASSERT
:
14004 ++c_inhibit_evaluation_warnings
;
14006 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
14009 /*integral_constant_expression_p=*/true);
14010 --c_inhibit_evaluation_warnings
;
14012 finish_static_assert (condition
,
14013 STATIC_ASSERT_MESSAGE (t
),
14014 STATIC_ASSERT_SOURCE_LOCATION (t
),
14015 /*member_p=*/false);
14020 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
14021 args
, complain
, in_decl
);
14022 stmt
= begin_omp_parallel ();
14023 RECUR (OMP_PARALLEL_BODY (t
));
14024 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
14025 = OMP_PARALLEL_COMBINED (t
);
14029 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
14030 args
, complain
, in_decl
);
14031 stmt
= begin_omp_task ();
14032 RECUR (OMP_TASK_BODY (t
));
14033 finish_omp_task (tmp
, stmt
);
14040 case OMP_DISTRIBUTE
:
14042 tree clauses
, body
, pre_body
;
14043 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
14044 tree incrv
= NULL_TREE
;
14047 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
14048 args
, complain
, in_decl
);
14049 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14051 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14052 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14053 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14054 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14057 stmt
= begin_omp_structured_block ();
14059 pre_body
= push_stmt_list ();
14060 RECUR (OMP_FOR_PRE_BODY (t
));
14061 pre_body
= pop_stmt_list (pre_body
);
14063 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14064 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14065 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14066 &clauses
, args
, complain
, in_decl
,
14067 integral_constant_expression_p
);
14069 body
= push_stmt_list ();
14070 RECUR (OMP_FOR_BODY (t
));
14071 body
= pop_stmt_list (body
);
14073 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14074 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14075 condv
, incrv
, body
, pre_body
, clauses
);
14078 t
= make_node (TREE_CODE (t
));
14079 TREE_TYPE (t
) = void_type_node
;
14080 OMP_FOR_BODY (t
) = body
;
14081 OMP_FOR_PRE_BODY (t
) = pre_body
;
14082 OMP_FOR_CLAUSES (t
) = clauses
;
14083 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14087 add_stmt (finish_omp_structured_block (stmt
));
14094 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14095 args
, complain
, in_decl
);
14096 stmt
= push_stmt_list ();
14097 RECUR (OMP_BODY (t
));
14098 stmt
= pop_stmt_list (stmt
);
14101 OMP_BODY (t
) = stmt
;
14102 OMP_CLAUSES (t
) = tmp
;
14106 case OMP_TARGET_DATA
:
14108 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14109 args
, complain
, in_decl
);
14110 keep_next_level (true);
14111 stmt
= begin_omp_structured_block ();
14113 RECUR (OMP_BODY (t
));
14114 stmt
= finish_omp_structured_block (stmt
);
14117 OMP_BODY (t
) = stmt
;
14118 OMP_CLAUSES (t
) = tmp
;
14122 case OMP_TARGET_UPDATE
:
14123 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14124 args
, complain
, in_decl
);
14126 OMP_CLAUSES (t
) = tmp
;
14133 case OMP_TASKGROUP
:
14135 stmt
= push_stmt_list ();
14136 RECUR (OMP_BODY (t
));
14137 stmt
= pop_stmt_list (stmt
);
14140 OMP_BODY (t
) = stmt
;
14145 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14146 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14148 tree op1
= TREE_OPERAND (t
, 1);
14149 tree rhs1
= NULL_TREE
;
14151 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14153 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14154 op1
= TREE_OPERAND (op1
, 1);
14156 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14157 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14158 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14159 NULL_TREE
, NULL_TREE
, rhs1
,
14160 OMP_ATOMIC_SEQ_CST (t
));
14164 tree op1
= TREE_OPERAND (t
, 1);
14165 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14166 tree rhs1
= NULL_TREE
;
14167 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14168 enum tree_code opcode
= NOP_EXPR
;
14169 if (code
== OMP_ATOMIC_READ
)
14171 v
= RECUR (TREE_OPERAND (op1
, 0));
14172 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14174 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14175 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14177 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14178 v
= RECUR (TREE_OPERAND (op1
, 0));
14179 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14180 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14182 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14183 op11
= TREE_OPERAND (op11
, 1);
14185 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14186 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14187 opcode
= TREE_CODE (op11
);
14188 if (opcode
== MODIFY_EXPR
)
14194 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14195 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14197 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14198 OMP_ATOMIC_SEQ_CST (t
));
14202 case TRANSACTION_EXPR
:
14205 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14206 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14208 if (TRANSACTION_EXPR_IS_STMT (t
))
14210 tree body
= TRANSACTION_EXPR_BODY (t
);
14211 tree noex
= NULL_TREE
;
14212 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14214 noex
= MUST_NOT_THROW_COND (body
);
14215 if (noex
== NULL_TREE
)
14216 noex
= boolean_true_node
;
14217 body
= TREE_OPERAND (body
, 0);
14219 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14221 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14225 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14226 RECUR (TRANSACTION_EXPR_BODY (t
)),
14233 case MUST_NOT_THROW_EXPR
:
14235 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14236 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14237 RETURN (build_must_not_throw_expr (op0
, cond
));
14240 case EXPR_PACK_EXPANSION
:
14241 error ("invalid use of pack expansion expression");
14242 RETURN (error_mark_node
);
14244 case NONTYPE_ARGUMENT_PACK
:
14245 error ("use %<...%> to expand argument pack");
14246 RETURN (error_mark_node
);
14248 case CILK_SPAWN_STMT
:
14249 cfun
->calls_cilk_spawn
= 1;
14250 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
14252 case CILK_SYNC_STMT
:
14253 RETURN (build_cilk_sync ());
14255 case COMPOUND_EXPR
:
14256 tmp
= RECUR (TREE_OPERAND (t
, 0));
14257 if (tmp
== NULL_TREE
)
14258 /* If the first operand was a statement, we're done with it. */
14259 RETURN (RECUR (TREE_OPERAND (t
, 1)));
14260 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
14261 RECUR (TREE_OPERAND (t
, 1)),
14264 case ANNOTATE_EXPR
:
14265 tmp
= RECUR (TREE_OPERAND (t
, 0));
14266 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
14267 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
14270 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
14272 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14273 /*function_p=*/false,
14274 integral_constant_expression_p
));
14277 RETURN (NULL_TREE
);
14279 input_location
= loc
;
14285 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14286 function. For description of the body see comment above
14287 cp_parser_omp_declare_reduction_exprs. */
14290 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14292 if (t
== NULL_TREE
|| t
== error_mark_node
)
14295 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14297 tree_stmt_iterator tsi
;
14300 memset (stmts
, 0, sizeof stmts
);
14301 for (i
= 0, tsi
= tsi_start (t
);
14302 i
< 7 && !tsi_end_p (tsi
);
14303 i
++, tsi_next (&tsi
))
14304 stmts
[i
] = tsi_stmt (tsi
);
14305 gcc_assert (tsi_end_p (tsi
));
14309 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14310 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14311 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14312 args
, complain
, in_decl
);
14313 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14314 args
, complain
, in_decl
);
14315 DECL_CONTEXT (omp_out
) = current_function_decl
;
14316 DECL_CONTEXT (omp_in
) = current_function_decl
;
14317 keep_next_level (true);
14318 tree block
= begin_omp_structured_block ();
14319 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14320 block
= finish_omp_structured_block (block
);
14321 block
= maybe_cleanup_point_expr_void (block
);
14322 add_decl_expr (omp_out
);
14323 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14324 TREE_NO_WARNING (omp_out
) = 1;
14325 add_decl_expr (omp_in
);
14326 finish_expr_stmt (block
);
14330 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14331 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14332 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14333 args
, complain
, in_decl
);
14334 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14335 args
, complain
, in_decl
);
14336 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14337 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14338 keep_next_level (true);
14339 tree block
= begin_omp_structured_block ();
14340 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14341 block
= finish_omp_structured_block (block
);
14342 block
= maybe_cleanup_point_expr_void (block
);
14343 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14344 add_decl_expr (omp_priv
);
14345 add_decl_expr (omp_orig
);
14346 finish_expr_stmt (block
);
14348 add_decl_expr (omp_orig
);
14352 /* T is a postfix-expression that is not being used in a function
14353 call. Return the substituted version of T. */
14356 tsubst_non_call_postfix_expression (tree t
, tree args
,
14357 tsubst_flags_t complain
,
14360 if (TREE_CODE (t
) == SCOPE_REF
)
14361 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14362 /*done=*/false, /*address_p=*/false);
14364 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14365 /*function_p=*/false,
14366 /*integral_constant_expression_p=*/false);
14371 /* Sentinel to disable certain warnings during template substitution. */
14373 struct warning_sentinel
{
14376 warning_sentinel(int& flag
, bool suppress
=true)
14377 : flag(flag
), val(flag
) { if (suppress
) flag
= 0; }
14378 ~warning_sentinel() { flag
= val
; }
14381 /* Like tsubst but deals with expressions and performs semantic
14382 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14385 tsubst_copy_and_build (tree t
,
14387 tsubst_flags_t complain
,
14390 bool integral_constant_expression_p
)
14392 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14393 #define RECUR(NODE) \
14394 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14395 /*function_p=*/false, \
14396 integral_constant_expression_p)
14401 if (t
== NULL_TREE
|| t
== error_mark_node
)
14404 loc
= input_location
;
14405 if (EXPR_HAS_LOCATION (t
))
14406 input_location
= EXPR_LOCATION (t
);
14408 /* N3276 decltype magic only applies to calls at the top level or on the
14409 right side of a comma. */
14410 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14411 complain
&= ~tf_decltype
;
14413 switch (TREE_CODE (t
))
14417 /* Fall through. */
14418 case IDENTIFIER_NODE
:
14422 bool non_integral_constant_expression_p
;
14423 const char *error_msg
;
14425 if (IDENTIFIER_TYPENAME_P (t
))
14427 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14428 t
= mangle_conv_op_name_for_type (new_type
);
14431 /* Look up the name. */
14432 decl
= lookup_name (t
);
14434 /* By convention, expressions use ERROR_MARK_NODE to indicate
14435 failure, not NULL_TREE. */
14436 if (decl
== NULL_TREE
)
14437 decl
= error_mark_node
;
14439 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14441 integral_constant_expression_p
,
14442 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14443 &non_integral_constant_expression_p
,
14444 /*template_p=*/false,
14446 /*address_p=*/false,
14447 /*template_arg_p=*/false,
14452 if (!function_p
&& identifier_p (decl
))
14454 if (complain
& tf_error
)
14455 unqualified_name_lookup_error (decl
);
14456 decl
= error_mark_node
;
14461 case TEMPLATE_ID_EXPR
:
14464 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14465 tree targs
= TREE_OPERAND (t
, 1);
14468 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14470 if (TREE_CODE (templ
) == COMPONENT_REF
)
14472 object
= TREE_OPERAND (templ
, 0);
14473 templ
= TREE_OPERAND (templ
, 1);
14476 object
= NULL_TREE
;
14477 templ
= lookup_template_function (templ
, targs
);
14480 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14481 object
, templ
, NULL_TREE
));
14483 RETURN (baselink_for_fns (templ
));
14488 tree r
= RECUR (TREE_OPERAND (t
, 0));
14490 if (REFERENCE_REF_P (t
))
14492 /* A type conversion to reference type will be enclosed in
14493 such an indirect ref, but the substitution of the cast
14494 will have also added such an indirect ref. */
14495 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14496 r
= convert_from_reference (r
);
14499 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14500 complain
|decltype_flag
);
14506 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14507 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14508 RETURN (build_nop (type
, op0
));
14511 case IMPLICIT_CONV_EXPR
:
14513 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14514 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14515 int flags
= LOOKUP_IMPLICIT
;
14516 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14517 flags
= LOOKUP_NORMAL
;
14518 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14524 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14525 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14526 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
14530 case REINTERPRET_CAST_EXPR
:
14531 case CONST_CAST_EXPR
:
14532 case DYNAMIC_CAST_EXPR
:
14533 case STATIC_CAST_EXPR
:
14536 tree op
, r
= NULL_TREE
;
14538 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14539 if (integral_constant_expression_p
14540 && !cast_valid_in_integral_constant_expression_p (type
))
14542 if (complain
& tf_error
)
14543 error ("a cast to a type other than an integral or "
14544 "enumeration type cannot appear in a constant-expression");
14545 RETURN (error_mark_node
);
14548 op
= RECUR (TREE_OPERAND (t
, 0));
14550 warning_sentinel
s(warn_useless_cast
);
14551 switch (TREE_CODE (t
))
14554 r
= build_functional_cast (type
, op
, complain
);
14556 case REINTERPRET_CAST_EXPR
:
14557 r
= build_reinterpret_cast (type
, op
, complain
);
14559 case CONST_CAST_EXPR
:
14560 r
= build_const_cast (type
, op
, complain
);
14562 case DYNAMIC_CAST_EXPR
:
14563 r
= build_dynamic_cast (type
, op
, complain
);
14565 case STATIC_CAST_EXPR
:
14566 r
= build_static_cast (type
, op
, complain
);
14569 gcc_unreachable ();
14575 case POSTDECREMENT_EXPR
:
14576 case POSTINCREMENT_EXPR
:
14577 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14578 args
, complain
, in_decl
);
14579 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14580 complain
|decltype_flag
));
14582 case PREDECREMENT_EXPR
:
14583 case PREINCREMENT_EXPR
:
14587 case TRUTH_NOT_EXPR
:
14588 case UNARY_PLUS_EXPR
: /* Unary + */
14589 case REALPART_EXPR
:
14590 case IMAGPART_EXPR
:
14591 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14592 RECUR (TREE_OPERAND (t
, 0)),
14593 complain
|decltype_flag
));
14595 case FIX_TRUNC_EXPR
:
14596 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14600 op1
= TREE_OPERAND (t
, 0);
14601 if (TREE_CODE (op1
) == LABEL_DECL
)
14602 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14603 EXPR_LOCATION (op1
)));
14604 if (TREE_CODE (op1
) == SCOPE_REF
)
14605 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14606 /*done=*/true, /*address_p=*/true);
14608 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14610 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14611 complain
|decltype_flag
));
14616 case TRUNC_DIV_EXPR
:
14617 case CEIL_DIV_EXPR
:
14618 case FLOOR_DIV_EXPR
:
14619 case ROUND_DIV_EXPR
:
14620 case EXACT_DIV_EXPR
:
14624 case TRUNC_MOD_EXPR
:
14625 case FLOOR_MOD_EXPR
:
14626 case TRUTH_ANDIF_EXPR
:
14627 case TRUTH_ORIF_EXPR
:
14628 case TRUTH_AND_EXPR
:
14629 case TRUTH_OR_EXPR
:
14645 warning_sentinel
s1(warn_type_limits
);
14646 warning_sentinel
s2(warn_div_by_zero
);
14647 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14648 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14649 tree r
= build_x_binary_op
14650 (input_location
, TREE_CODE (t
),
14652 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14654 : TREE_CODE (TREE_OPERAND (t
, 0))),
14656 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14658 : TREE_CODE (TREE_OPERAND (t
, 1))),
14660 complain
|decltype_flag
);
14661 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14662 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14667 case POINTER_PLUS_EXPR
:
14669 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14670 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14671 return fold_build_pointer_plus (op0
, op1
);
14675 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14676 /*address_p=*/false));
14678 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14679 args
, complain
, in_decl
);
14680 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14681 RECUR (TREE_OPERAND (t
, 1)),
14682 complain
|decltype_flag
));
14684 case ARRAY_NOTATION_REF
:
14686 tree start_index
, length
, stride
;
14687 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14688 args
, complain
, in_decl
);
14689 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14690 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14691 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14692 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14693 length
, stride
, TREE_TYPE (op1
)));
14696 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14697 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14704 op1
= TREE_OPERAND (t
, 0);
14705 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14706 op1
= TREE_TYPE (op1
);
14709 /* When there are no ARGS, we are trying to evaluate a
14710 non-dependent expression from the parser. Trying to do
14711 the substitutions may not work. */
14713 op1
= TREE_TYPE (op1
);
14717 ++cp_unevaluated_operand
;
14718 ++c_inhibit_evaluation_warnings
;
14720 op1
= tsubst (op1
, args
, complain
, in_decl
);
14722 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14723 /*function_p=*/false,
14724 /*integral_constant_expression_p=*/
14726 --cp_unevaluated_operand
;
14727 --c_inhibit_evaluation_warnings
;
14730 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14731 complain
& tf_error
);
14733 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14734 complain
& tf_error
);
14735 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14737 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14739 if (!processing_template_decl
&& TYPE_P (op1
))
14741 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14742 build1 (NOP_EXPR
, op1
, error_mark_node
));
14743 SIZEOF_EXPR_TYPE_P (r
) = 1;
14746 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14747 TREE_SIDE_EFFECTS (r
) = 0;
14748 TREE_READONLY (r
) = 1;
14750 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14755 case AT_ENCODE_EXPR
:
14757 op1
= TREE_OPERAND (t
, 0);
14758 ++cp_unevaluated_operand
;
14759 ++c_inhibit_evaluation_warnings
;
14760 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14761 /*function_p=*/false,
14762 /*integral_constant_expression_p=*/false);
14763 --cp_unevaluated_operand
;
14764 --c_inhibit_evaluation_warnings
;
14765 RETURN (objc_build_encode_expr (op1
));
14768 case NOEXCEPT_EXPR
:
14769 op1
= TREE_OPERAND (t
, 0);
14770 ++cp_unevaluated_operand
;
14771 ++c_inhibit_evaluation_warnings
;
14772 ++cp_noexcept_operand
;
14773 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14774 /*function_p=*/false,
14775 /*integral_constant_expression_p=*/false);
14776 --cp_unevaluated_operand
;
14777 --c_inhibit_evaluation_warnings
;
14778 --cp_noexcept_operand
;
14779 RETURN (finish_noexcept_expr (op1
, complain
));
14783 warning_sentinel
s(warn_div_by_zero
);
14784 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
14785 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
14786 tree r
= build_x_modify_expr
14787 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
14788 complain
|decltype_flag
);
14789 /* TREE_NO_WARNING must be set if either the expression was
14790 parenthesized or it uses an operator such as >>= rather
14791 than plain assignment. In the former case, it was already
14792 set and must be copied. In the latter case,
14793 build_x_modify_expr sets it and it must not be reset
14795 if (TREE_NO_WARNING (t
))
14796 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14802 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14803 args
, complain
, in_decl
);
14804 /* Remember that there was a reference to this entity. */
14807 RETURN (build_x_arrow (input_location
, op1
, complain
));
14811 tree placement
= RECUR (TREE_OPERAND (t
, 0));
14812 tree init
= RECUR (TREE_OPERAND (t
, 3));
14813 vec
<tree
, va_gc
> *placement_vec
;
14814 vec
<tree
, va_gc
> *init_vec
;
14817 if (placement
== NULL_TREE
)
14818 placement_vec
= NULL
;
14821 placement_vec
= make_tree_vector ();
14822 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
14823 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
14826 /* If there was an initializer in the original tree, but it
14827 instantiated to an empty list, then we should pass a
14828 non-NULL empty vector to tell build_new that it was an
14829 empty initializer() rather than no initializer. This can
14830 only happen when the initializer is a pack expansion whose
14831 parameter packs are of length zero. */
14832 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
14836 init_vec
= make_tree_vector ();
14837 if (init
== void_node
)
14838 gcc_assert (init_vec
!= NULL
);
14841 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
14842 vec_safe_push (init_vec
, TREE_VALUE (init
));
14846 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14847 tree op2
= RECUR (TREE_OPERAND (t
, 2));
14848 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
14849 NEW_EXPR_USE_GLOBAL (t
),
14852 if (placement_vec
!= NULL
)
14853 release_tree_vector (placement_vec
);
14854 if (init_vec
!= NULL
)
14855 release_tree_vector (init_vec
);
14862 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14863 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14864 RETURN (delete_sanity (op0
, op1
,
14865 DELETE_EXPR_USE_VEC (t
),
14866 DELETE_EXPR_USE_GLOBAL (t
),
14870 case COMPOUND_EXPR
:
14872 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
14873 complain
& ~tf_decltype
, in_decl
,
14874 /*function_p=*/false,
14875 integral_constant_expression_p
);
14876 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
14878 RECUR (TREE_OPERAND (t
, 1)),
14879 complain
|decltype_flag
));
14885 vec
<tree
, va_gc
> *call_args
;
14886 unsigned int nargs
, i
;
14891 function
= CALL_EXPR_FN (t
);
14892 /* When we parsed the expression, we determined whether or
14893 not Koenig lookup should be performed. */
14894 koenig_p
= KOENIG_LOOKUP_P (t
);
14895 if (TREE_CODE (function
) == SCOPE_REF
)
14897 qualified_p
= true;
14898 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
14900 /*address_p=*/false);
14902 else if (koenig_p
&& identifier_p (function
))
14904 /* Do nothing; calling tsubst_copy_and_build on an identifier
14905 would incorrectly perform unqualified lookup again.
14907 Note that we can also have an IDENTIFIER_NODE if the earlier
14908 unqualified lookup found a member function; in that case
14909 koenig_p will be false and we do want to do the lookup
14910 again to find the instantiated member function.
14912 FIXME but doing that causes c++/15272, so we need to stop
14913 using IDENTIFIER_NODE in that situation. */
14914 qualified_p
= false;
14918 if (TREE_CODE (function
) == COMPONENT_REF
)
14920 tree op
= TREE_OPERAND (function
, 1);
14922 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
14923 || (BASELINK_P (op
)
14924 && BASELINK_QUALIFIED_P (op
)));
14927 qualified_p
= false;
14929 if (TREE_CODE (function
) == ADDR_EXPR
14930 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
14931 /* Avoid error about taking the address of a constructor. */
14932 function
= TREE_OPERAND (function
, 0);
14934 function
= tsubst_copy_and_build (function
, args
, complain
,
14937 integral_constant_expression_p
);
14939 if (BASELINK_P (function
))
14940 qualified_p
= true;
14943 nargs
= call_expr_nargs (t
);
14944 call_args
= make_tree_vector ();
14945 for (i
= 0; i
< nargs
; ++i
)
14947 tree arg
= CALL_EXPR_ARG (t
, i
);
14949 if (!PACK_EXPANSION_P (arg
))
14950 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
14953 /* Expand the pack expansion and push each entry onto
14955 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
14956 if (TREE_CODE (arg
) == TREE_VEC
)
14958 unsigned int len
, j
;
14960 len
= TREE_VEC_LENGTH (arg
);
14961 for (j
= 0; j
< len
; ++j
)
14963 tree value
= TREE_VEC_ELT (arg
, j
);
14964 if (value
!= NULL_TREE
)
14965 value
= convert_from_reference (value
);
14966 vec_safe_push (call_args
, value
);
14971 /* A partial substitution. Add one entry. */
14972 vec_safe_push (call_args
, arg
);
14977 /* We do not perform argument-dependent lookup if normal
14978 lookup finds a non-function, in accordance with the
14979 expected resolution of DR 218. */
14981 && ((is_overloaded_fn (function
)
14982 /* If lookup found a member function, the Koenig lookup is
14983 not appropriate, even if an unqualified-name was used
14984 to denote the function. */
14985 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14986 || identifier_p (function
))
14987 /* Only do this when substitution turns a dependent call
14988 into a non-dependent call. */
14989 && type_dependent_expression_p_push (t
)
14990 && !any_type_dependent_arguments_p (call_args
))
14991 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
14993 if (identifier_p (function
)
14994 && !any_type_dependent_arguments_p (call_args
))
14996 if (koenig_p
&& (complain
& tf_warning_or_error
))
14998 /* For backwards compatibility and good diagnostics, try
14999 the unqualified lookup again if we aren't in SFINAE
15001 tree unq
= (tsubst_copy_and_build
15002 (function
, args
, complain
, in_decl
, true,
15003 integral_constant_expression_p
));
15004 if (unq
== error_mark_node
)
15005 RETURN (error_mark_node
);
15007 if (unq
!= function
)
15010 if (INDIRECT_REF_P (fn
))
15011 fn
= TREE_OPERAND (fn
, 0);
15012 if (TREE_CODE (fn
) == COMPONENT_REF
)
15013 fn
= TREE_OPERAND (fn
, 1);
15014 if (is_overloaded_fn (fn
))
15015 fn
= get_first_fn (fn
);
15016 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
15017 "%qD was not declared in this scope, "
15018 "and no declarations were found by "
15019 "argument-dependent lookup at the point "
15020 "of instantiation", function
))
15023 /* Can't say anything more. */;
15024 else if (DECL_CLASS_SCOPE_P (fn
))
15026 location_t loc
= EXPR_LOC_OR_LOC (t
,
15029 "declarations in dependent base %qT are "
15030 "not found by unqualified lookup",
15031 DECL_CLASS_CONTEXT (fn
));
15032 if (current_class_ptr
)
15034 "use %<this->%D%> instead", function
);
15037 "use %<%T::%D%> instead",
15038 current_class_name
, function
);
15041 inform (0, "%q+D declared here, later in the "
15042 "translation unit", fn
);
15047 if (identifier_p (function
))
15049 if (complain
& tf_error
)
15050 unqualified_name_lookup_error (function
);
15051 release_tree_vector (call_args
);
15052 RETURN (error_mark_node
);
15056 /* Remember that there was a reference to this entity. */
15057 if (DECL_P (function
))
15058 mark_used (function
);
15060 /* Put back tf_decltype for the actual call. */
15061 complain
|= decltype_flag
;
15063 if (TREE_CODE (function
) == OFFSET_REF
)
15064 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
15066 else if (TREE_CODE (function
) == COMPONENT_REF
)
15068 tree instance
= TREE_OPERAND (function
, 0);
15069 tree fn
= TREE_OPERAND (function
, 1);
15071 if (processing_template_decl
15072 && (type_dependent_expression_p (instance
)
15073 || (!BASELINK_P (fn
)
15074 && TREE_CODE (fn
) != FIELD_DECL
)
15075 || type_dependent_expression_p (fn
)
15076 || any_type_dependent_arguments_p (call_args
)))
15077 ret
= build_nt_call_vec (function
, call_args
);
15078 else if (!BASELINK_P (fn
))
15079 ret
= finish_call_expr (function
, &call_args
,
15080 /*disallow_virtual=*/false,
15081 /*koenig_p=*/false,
15084 ret
= (build_new_method_call
15086 &call_args
, NULL_TREE
,
15087 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15092 ret
= finish_call_expr (function
, &call_args
,
15093 /*disallow_virtual=*/qualified_p
,
15097 release_tree_vector (call_args
);
15104 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15107 if (TREE_CODE (cond
) == INTEGER_CST
)
15109 if (integer_zerop (cond
))
15111 ++c_inhibit_evaluation_warnings
;
15112 exp1
= RECUR (TREE_OPERAND (t
, 1));
15113 --c_inhibit_evaluation_warnings
;
15114 exp2
= RECUR (TREE_OPERAND (t
, 2));
15118 exp1
= RECUR (TREE_OPERAND (t
, 1));
15119 ++c_inhibit_evaluation_warnings
;
15120 exp2
= RECUR (TREE_OPERAND (t
, 2));
15121 --c_inhibit_evaluation_warnings
;
15126 exp1
= RECUR (TREE_OPERAND (t
, 1));
15127 exp2
= RECUR (TREE_OPERAND (t
, 2));
15130 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15131 cond
, exp1
, exp2
, complain
));
15134 case PSEUDO_DTOR_EXPR
:
15136 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15137 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15138 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15139 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15145 tree purpose
, value
, chain
;
15147 if (t
== void_list_node
)
15150 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15151 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15153 /* We have pack expansions, so expand those and
15154 create a new list out of it. */
15155 tree purposevec
= NULL_TREE
;
15156 tree valuevec
= NULL_TREE
;
15160 /* Expand the argument expressions. */
15161 if (TREE_PURPOSE (t
))
15162 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15163 complain
, in_decl
);
15164 if (TREE_VALUE (t
))
15165 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15166 complain
, in_decl
);
15168 /* Build the rest of the list. */
15169 chain
= TREE_CHAIN (t
);
15170 if (chain
&& chain
!= void_type_node
)
15171 chain
= RECUR (chain
);
15173 /* Determine the number of arguments. */
15174 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15176 len
= TREE_VEC_LENGTH (purposevec
);
15177 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15179 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15180 len
= TREE_VEC_LENGTH (valuevec
);
15183 /* Since we only performed a partial substitution into
15184 the argument pack, we only RETURN (a single list
15186 if (purposevec
== TREE_PURPOSE (t
)
15187 && valuevec
== TREE_VALUE (t
)
15188 && chain
== TREE_CHAIN (t
))
15191 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15194 /* Convert the argument vectors into a TREE_LIST */
15198 /* Grab the Ith values. */
15200 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15203 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15206 /* Build the list (backwards). */
15207 chain
= tree_cons (purpose
, value
, chain
);
15213 purpose
= TREE_PURPOSE (t
);
15215 purpose
= RECUR (purpose
);
15216 value
= TREE_VALUE (t
);
15218 value
= RECUR (value
);
15219 chain
= TREE_CHAIN (t
);
15220 if (chain
&& chain
!= void_type_node
)
15221 chain
= RECUR (chain
);
15222 if (purpose
== TREE_PURPOSE (t
)
15223 && value
== TREE_VALUE (t
)
15224 && chain
== TREE_CHAIN (t
))
15226 RETURN (tree_cons (purpose
, value
, chain
));
15229 case COMPONENT_REF
:
15236 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15237 args
, complain
, in_decl
);
15238 /* Remember that there was a reference to this entity. */
15239 if (DECL_P (object
))
15240 mark_used (object
);
15241 object_type
= TREE_TYPE (object
);
15243 member
= TREE_OPERAND (t
, 1);
15244 if (BASELINK_P (member
))
15245 member
= tsubst_baselink (member
,
15246 non_reference (TREE_TYPE (object
)),
15247 args
, complain
, in_decl
);
15249 member
= tsubst_copy (member
, args
, complain
, in_decl
);
15250 if (member
== error_mark_node
)
15251 RETURN (error_mark_node
);
15253 if (type_dependent_expression_p (object
))
15254 /* We can't do much here. */;
15255 else if (!CLASS_TYPE_P (object_type
))
15257 if (scalarish_type_p (object_type
))
15259 tree s
= NULL_TREE
;
15260 tree dtor
= member
;
15262 if (TREE_CODE (dtor
) == SCOPE_REF
)
15264 s
= TREE_OPERAND (dtor
, 0);
15265 dtor
= TREE_OPERAND (dtor
, 1);
15267 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
15269 dtor
= TREE_OPERAND (dtor
, 0);
15271 RETURN (finish_pseudo_destructor_expr
15272 (object
, s
, dtor
, input_location
));
15276 else if (TREE_CODE (member
) == SCOPE_REF
15277 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
15279 /* Lookup the template functions now that we know what the
15281 tree scope
= TREE_OPERAND (member
, 0);
15282 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
15283 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
15284 member
= lookup_qualified_name (scope
, tmpl
,
15285 /*is_type_p=*/false,
15286 /*complain=*/false);
15287 if (BASELINK_P (member
))
15289 BASELINK_FUNCTIONS (member
)
15290 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
15292 member
= (adjust_result_of_qualified_name_lookup
15293 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15298 qualified_name_lookup_error (scope
, tmpl
, member
,
15300 RETURN (error_mark_node
);
15303 else if (TREE_CODE (member
) == SCOPE_REF
15304 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15305 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15307 if (complain
& tf_error
)
15309 if (TYPE_P (TREE_OPERAND (member
, 0)))
15310 error ("%qT is not a class or namespace",
15311 TREE_OPERAND (member
, 0));
15313 error ("%qD is not a class or namespace",
15314 TREE_OPERAND (member
, 0));
15316 RETURN (error_mark_node
);
15318 else if (TREE_CODE (member
) == FIELD_DECL
)
15320 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15321 if (TREE_CODE (r
) == COMPONENT_REF
)
15322 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15326 r
= finish_class_member_access_expr (object
, member
,
15327 /*template_p=*/false,
15329 if (TREE_CODE (r
) == COMPONENT_REF
)
15330 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15335 RETURN (build_throw
15336 (RECUR (TREE_OPERAND (t
, 0))));
15340 vec
<constructor_elt
, va_gc
> *n
;
15341 constructor_elt
*ce
;
15342 unsigned HOST_WIDE_INT idx
;
15343 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15344 bool process_index_p
;
15346 bool need_copy_p
= false;
15349 if (type
== error_mark_node
)
15350 RETURN (error_mark_node
);
15352 /* digest_init will do the wrong thing if we let it. */
15353 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15356 /* We do not want to process the index of aggregate
15357 initializers as they are identifier nodes which will be
15358 looked up by digest_init. */
15359 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15361 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15362 newlen
= vec_safe_length (n
);
15363 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15365 if (ce
->index
&& process_index_p
15366 /* An identifier index is looked up in the type
15367 being initialized, not the current scope. */
15368 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15369 ce
->index
= RECUR (ce
->index
);
15371 if (PACK_EXPANSION_P (ce
->value
))
15373 /* Substitute into the pack expansion. */
15374 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15377 if (ce
->value
== error_mark_node
15378 || PACK_EXPANSION_P (ce
->value
))
15380 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15381 /* Just move the argument into place. */
15382 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15385 /* Update the length of the final CONSTRUCTOR
15386 arguments vector, and note that we will need to
15388 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15389 need_copy_p
= true;
15393 ce
->value
= RECUR (ce
->value
);
15398 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15400 vec_alloc (n
, newlen
);
15401 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15403 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15405 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15406 for (i
= 0; i
< len
; ++i
)
15407 CONSTRUCTOR_APPEND_ELT (n
, 0,
15408 TREE_VEC_ELT (ce
->value
, i
));
15411 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15415 r
= build_constructor (init_list_type_node
, n
);
15416 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15418 if (TREE_HAS_CONSTRUCTOR (t
))
15419 RETURN (finish_compound_literal (type
, r
, complain
));
15421 TREE_TYPE (r
) = type
;
15427 tree operand_0
= TREE_OPERAND (t
, 0);
15428 if (TYPE_P (operand_0
))
15430 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15431 RETURN (get_typeid (operand_0
, complain
));
15435 operand_0
= RECUR (operand_0
);
15436 RETURN (build_typeid (operand_0
, complain
));
15443 else if (DECL_PACK_P (t
))
15445 /* We don't build decls for an instantiation of a
15446 variadic capture proxy, we instantiate the elements
15448 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15449 return RECUR (DECL_VALUE_EXPR (t
));
15455 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15457 && !processing_template_decl
15458 && !cp_unevaluated_operand
15459 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
15460 && DECL_THREAD_LOCAL_P (r
))
15462 if (tree wrap
= get_tls_wrapper_fn (r
))
15463 /* Replace an evaluated use of the thread_local variable with
15464 a call to its wrapper. */
15465 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
15468 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15469 /* If the original type was a reference, we'll be wrapped in
15470 the appropriate INDIRECT_REF. */
15471 r
= convert_from_reference (r
);
15477 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15478 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15479 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
15482 case OFFSETOF_EXPR
:
15483 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
15484 EXPR_LOCATION (t
)));
15488 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15489 complain
, in_decl
);
15491 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15492 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
15493 type2
= RECUR (type2
);
15495 type2
= tsubst (type2
, args
, complain
, in_decl
);
15497 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15502 tree old_stmt_expr
= cur_stmt_expr
;
15503 tree stmt_expr
= begin_stmt_expr ();
15505 cur_stmt_expr
= stmt_expr
;
15506 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15507 integral_constant_expression_p
);
15508 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15509 cur_stmt_expr
= old_stmt_expr
;
15511 /* If the resulting list of expression statement is empty,
15512 fold it further into void_node. */
15513 if (empty_expr_stmt_p (stmt_expr
))
15514 stmt_expr
= void_node
;
15516 RETURN (stmt_expr
);
15521 tree r
= build_lambda_expr ();
15523 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15524 LAMBDA_EXPR_CLOSURE (r
) = type
;
15525 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15527 LAMBDA_EXPR_LOCATION (r
)
15528 = LAMBDA_EXPR_LOCATION (t
);
15529 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15530 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15531 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15532 LAMBDA_EXPR_DISCRIMINATOR (r
)
15533 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15534 /* For a function scope, we want to use tsubst so that we don't
15535 complain about referring to an auto function before its return
15536 type has been deduced. Otherwise, we want to use tsubst_copy so
15537 that we look up the existing field/parameter/variable rather
15538 than build a new one. */
15539 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15540 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15541 scope
= tsubst (scope
, args
, complain
, in_decl
);
15542 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15544 /* Look up the parameter we want directly, as tsubst_copy
15545 doesn't do what we need. */
15546 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15547 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15548 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15549 parm
= DECL_CHAIN (parm
);
15551 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15552 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15553 DECL_CONTEXT (scope
) = fn
;
15556 scope
= RECUR (scope
);
15557 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15558 LAMBDA_EXPR_RETURN_TYPE (r
)
15559 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15561 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15562 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15564 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15565 determine_visibility (TYPE_NAME (type
));
15566 /* Now that we know visibility, instantiate the type so we have a
15567 declaration of the op() for later calls to lambda_function. */
15568 complete_type (type
);
15570 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15572 RETURN (build_lambda_object (r
));
15576 /* We can get here for a constant initializer of non-dependent type.
15577 FIXME stop folding in cp_parser_initializer_clause. */
15579 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15584 case TRANSACTION_EXPR
:
15585 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15586 integral_constant_expression_p
));
15589 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15591 case VEC_PERM_EXPR
:
15593 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15594 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15595 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15596 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
15601 /* Handle Objective-C++ constructs, if appropriate. */
15604 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15605 in_decl
, /*function_p=*/false);
15609 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15615 input_location
= loc
;
15619 /* Verify that the instantiated ARGS are valid. For type arguments,
15620 make sure that the type's linkage is ok. For non-type arguments,
15621 make sure they are constants if they are integral or enumerations.
15622 Emit an error under control of COMPLAIN, and return TRUE on error. */
15625 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15627 if (dependent_template_arg_p (t
))
15629 if (ARGUMENT_PACK_P (t
))
15631 tree vec
= ARGUMENT_PACK_ARGS (t
);
15632 int len
= TREE_VEC_LENGTH (vec
);
15633 bool result
= false;
15636 for (i
= 0; i
< len
; ++i
)
15637 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15641 else if (TYPE_P (t
))
15643 /* [basic.link]: A name with no linkage (notably, the name
15644 of a class or enumeration declared in a local scope)
15645 shall not be used to declare an entity with linkage.
15646 This implies that names with no linkage cannot be used as
15649 DR 757 relaxes this restriction for C++0x. */
15650 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15651 : no_linkage_check (t
, /*relaxed_p=*/false));
15655 /* DR 488 makes use of a type with no linkage cause
15656 type deduction to fail. */
15657 if (complain
& tf_error
)
15659 if (TYPE_ANONYMOUS_P (nt
))
15660 error ("%qT is/uses anonymous type", t
);
15662 error ("template argument for %qD uses local type %qT",
15667 /* In order to avoid all sorts of complications, we do not
15668 allow variably-modified types as template arguments. */
15669 else if (variably_modified_type_p (t
, NULL_TREE
))
15671 if (complain
& tf_error
)
15672 error ("%qT is a variably modified type", t
);
15676 /* Class template and alias template arguments should be OK. */
15677 else if (DECL_TYPE_TEMPLATE_P (t
))
15679 /* A non-type argument of integral or enumerated type must be a
15681 else if (TREE_TYPE (t
)
15682 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15683 && !TREE_CONSTANT (t
))
15685 if (complain
& tf_error
)
15686 error ("integral expression %qE is not constant", t
);
15693 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15695 int ix
, len
= DECL_NTPARMS (tmpl
);
15696 bool result
= false;
15698 for (ix
= 0; ix
!= len
; ix
++)
15700 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15703 if (result
&& (complain
& tf_error
))
15704 error (" trying to instantiate %qD", tmpl
);
15708 /* We're out of SFINAE context now, so generate diagnostics for the access
15709 errors we saw earlier when instantiating D from TMPL and ARGS. */
15712 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15714 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15715 tree type
= TREE_TYPE (pattern
);
15716 location_t loc
= input_location
;
15718 push_access_scope (d
);
15719 push_deferring_access_checks (dk_no_deferred
);
15720 input_location
= DECL_SOURCE_LOCATION (pattern
);
15721 tsubst (type
, args
, tf_warning_or_error
, d
);
15722 input_location
= loc
;
15723 pop_deferring_access_checks ();
15724 pop_access_scope (d
);
15727 /* Instantiate the indicated variable, function, or alias template TMPL with
15728 the template arguments in TARG_PTR. */
15731 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15733 tree targ_ptr
= orig_args
;
15737 bool access_ok
= true;
15739 if (tmpl
== error_mark_node
)
15740 return error_mark_node
;
15742 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15744 /* If this function is a clone, handle it specially. */
15745 if (DECL_CLONED_FUNCTION_P (tmpl
))
15750 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15751 DECL_CLONED_FUNCTION. */
15752 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
15753 targ_ptr
, complain
);
15754 if (spec
== error_mark_node
)
15755 return error_mark_node
;
15757 /* Look for the clone. */
15758 FOR_EACH_CLONE (clone
, spec
)
15759 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
15761 /* We should always have found the clone by now. */
15762 gcc_unreachable ();
15766 if (targ_ptr
== error_mark_node
)
15767 return error_mark_node
;
15769 /* Check to see if we already have this specialization. */
15770 gen_tmpl
= most_general_template (tmpl
);
15771 if (tmpl
!= gen_tmpl
)
15772 /* The TMPL is a partial instantiation. To get a full set of
15773 arguments we must add the arguments used to perform the
15774 partial instantiation. */
15775 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
15778 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15779 but it doesn't seem to be on the hot path. */
15780 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
15782 gcc_assert (tmpl
== gen_tmpl
15783 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
15785 || fndecl
== NULL_TREE
);
15787 if (spec
!= NULL_TREE
)
15789 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
15791 if (complain
& tf_error
)
15792 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
15793 return error_mark_node
;
15798 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
15800 return error_mark_node
;
15802 /* We are building a FUNCTION_DECL, during which the access of its
15803 parameters and return types have to be checked. However this
15804 FUNCTION_DECL which is the desired context for access checking
15805 is not built yet. We solve this chicken-and-egg problem by
15806 deferring all checks until we have the FUNCTION_DECL. */
15807 push_deferring_access_checks (dk_deferred
);
15809 /* Instantiation of the function happens in the context of the function
15810 template, not the context of the overload resolution we're doing. */
15811 push_to_top_level ();
15812 /* If there are dependent arguments, e.g. because we're doing partial
15813 ordering, make sure processing_template_decl stays set. */
15814 if (uses_template_parms (targ_ptr
))
15815 ++processing_template_decl
;
15816 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15818 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
15819 complain
, gen_tmpl
);
15820 push_nested_class (ctx
);
15822 /* Substitute template parameters to obtain the specialization. */
15823 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
15824 targ_ptr
, complain
, gen_tmpl
);
15825 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15826 pop_nested_class ();
15827 pop_from_top_level ();
15829 if (fndecl
== error_mark_node
)
15831 pop_deferring_access_checks ();
15832 return error_mark_node
;
15835 /* The DECL_TI_TEMPLATE should always be the immediate parent
15836 template, not the most general template. */
15837 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
15839 /* Now we know the specialization, compute access previously
15841 push_access_scope (fndecl
);
15842 if (!perform_deferred_access_checks (complain
))
15844 pop_access_scope (fndecl
);
15845 pop_deferring_access_checks ();
15847 /* If we've just instantiated the main entry point for a function,
15848 instantiate all the alternate entry points as well. We do this
15849 by cloning the instantiation of the main entry point, not by
15850 instantiating the template clones. */
15851 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
15852 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
15856 if (!(complain
& tf_error
))
15858 /* Remember to reinstantiate when we're out of SFINAE so the user
15859 can see the errors. */
15860 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
15862 return error_mark_node
;
15867 /* Wrapper for instantiate_template_1. */
15870 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15873 timevar_push (TV_TEMPLATE_INST
);
15874 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
15875 timevar_pop (TV_TEMPLATE_INST
);
15879 /* Instantiate the alias template TMPL with ARGS. Also push a template
15880 instantiation level, which instantiate_template doesn't do because
15881 functions and variables have sufficient context established by the
15885 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
15887 struct pending_template
*old_last_pend
= last_pending_template
;
15888 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15889 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
15890 return error_mark_node
;
15891 tree tinst
= build_tree_list (tmpl
, args
);
15892 if (!push_tinst_level (tinst
))
15895 return error_mark_node
;
15899 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
15900 args
, tmpl
, complain
,
15901 /*require_all_args=*/true,
15902 /*use_default_args=*/true);
15904 tree r
= instantiate_template (tmpl
, args
, complain
);
15905 pop_tinst_level ();
15906 /* We can't free this if a pending_template entry or last_error_tinst_level
15907 is pointing at it. */
15908 if (last_pending_template
== old_last_pend
15909 && last_error_tinst_level
== old_error_tinst
)
15915 /* PARM is a template parameter pack for FN. Returns true iff
15916 PARM is used in a deducible way in the argument list of FN. */
15919 pack_deducible_p (tree parm
, tree fn
)
15921 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
15922 for (; t
; t
= TREE_CHAIN (t
))
15924 tree type
= TREE_VALUE (t
);
15926 if (!PACK_EXPANSION_P (type
))
15928 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
15929 packs
; packs
= TREE_CHAIN (packs
))
15930 if (template_args_equal (TREE_VALUE (packs
), parm
))
15932 /* The template parameter pack is used in a function parameter
15933 pack. If this is the end of the parameter list, the
15934 template parameter pack is deducible. */
15935 if (TREE_CHAIN (t
) == void_list_node
)
15938 /* Otherwise, not. Well, it could be deduced from
15939 a non-pack parameter, but doing so would end up with
15940 a deduction mismatch, so don't bother. */
15944 /* The template parameter pack isn't used in any function parameter
15945 packs, but it might be used deeper, e.g. tuple<Args...>. */
15949 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
15950 NARGS elements of the arguments that are being used when calling
15951 it. TARGS is a vector into which the deduced template arguments
15954 Returns either a FUNCTION_DECL for the matching specialization of FN or
15955 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
15956 true, diagnostics will be printed to explain why it failed.
15958 If FN is a conversion operator, or we are trying to produce a specific
15959 specialization, RETURN_TYPE is the return type desired.
15961 The EXPLICIT_TARGS are explicit template arguments provided via a
15964 The parameter STRICT is one of:
15967 We are deducing arguments for a function call, as in
15968 [temp.deduct.call].
15971 We are deducing arguments for a conversion function, as in
15972 [temp.deduct.conv].
15975 We are deducing arguments when doing an explicit instantiation
15976 as in [temp.explicit], when determining an explicit specialization
15977 as in [temp.expl.spec], or when taking the address of a function
15978 template, as in [temp.deduct.funcaddr]. */
15981 fn_type_unification (tree fn
,
15982 tree explicit_targs
,
15985 unsigned int nargs
,
15987 unification_kind_t strict
,
15994 tree decl
= NULL_TREE
;
15995 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
15997 static int deduction_depth
;
15998 struct pending_template
*old_last_pend
= last_pending_template
;
15999 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
16000 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
16002 tree r
= error_mark_node
;
16005 complain
|= tf_decltype
;
16007 /* In C++0x, it's possible to have a function template whose type depends
16008 on itself recursively. This is most obvious with decltype, but can also
16009 occur with enumeration scope (c++/48969). So we need to catch infinite
16010 recursion and reject the substitution at deduction time; this function
16011 will return error_mark_node for any repeated substitution.
16013 This also catches excessive recursion such as when f<N> depends on
16014 f<N-1> across all integers, and returns error_mark_node for all the
16015 substitutions back up to the initial one.
16017 This is, of course, not reentrant. */
16018 if (excessive_deduction_depth
)
16019 return error_mark_node
;
16020 tinst
= build_tree_list (fn
, NULL_TREE
);
16023 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
16025 fntype
= TREE_TYPE (fn
);
16026 if (explicit_targs
)
16030 The specified template arguments must match the template
16031 parameters in kind (i.e., type, nontype, template), and there
16032 must not be more arguments than there are parameters;
16033 otherwise type deduction fails.
16035 Nontype arguments must match the types of the corresponding
16036 nontype template parameters, or must be convertible to the
16037 types of the corresponding nontype parameters as specified in
16038 _temp.arg.nontype_, otherwise type deduction fails.
16040 All references in the function type of the function template
16041 to the corresponding template parameters are replaced by the
16042 specified template argument values. If a substitution in a
16043 template parameter or in the function type of the function
16044 template results in an invalid type, type deduction fails. */
16045 int i
, len
= TREE_VEC_LENGTH (tparms
);
16046 location_t loc
= input_location
;
16047 bool incomplete
= false;
16049 /* Adjust any explicit template arguments before entering the
16050 substitution context. */
16052 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
16054 /*require_all_args=*/false,
16055 /*use_default_args=*/false));
16056 if (explicit_targs
== error_mark_node
)
16059 /* Substitute the explicit args into the function type. This is
16060 necessary so that, for instance, explicitly declared function
16061 arguments can match null pointed constants. If we were given
16062 an incomplete set of explicit args, we must not do semantic
16063 processing during substitution as we could create partial
16065 for (i
= 0; i
< len
; i
++)
16067 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16068 bool parameter_pack
= false;
16069 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
16071 /* Dig out the actual parm. */
16072 if (TREE_CODE (parm
) == TYPE_DECL
16073 || TREE_CODE (parm
) == TEMPLATE_DECL
)
16075 parm
= TREE_TYPE (parm
);
16076 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
16078 else if (TREE_CODE (parm
) == PARM_DECL
)
16080 parm
= DECL_INITIAL (parm
);
16081 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16084 if (!parameter_pack
&& targ
== NULL_TREE
)
16085 /* No explicit argument for this template parameter. */
16088 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16090 /* Mark the argument pack as "incomplete". We could
16091 still deduce more arguments during unification.
16092 We remove this mark in type_unification_real. */
16095 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16096 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16097 = ARGUMENT_PACK_ARGS (targ
);
16100 /* We have some incomplete argument packs. */
16105 TREE_VALUE (tinst
) = explicit_targs
;
16106 if (!push_tinst_level (tinst
))
16108 excessive_deduction_depth
= true;
16111 processing_template_decl
+= incomplete
;
16112 input_location
= DECL_SOURCE_LOCATION (fn
);
16113 /* Ignore any access checks; we'll see them again in
16114 instantiate_template and they might have the wrong
16115 access path at this point. */
16116 push_deferring_access_checks (dk_deferred
);
16117 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16118 complain
| tf_partial
, NULL_TREE
);
16119 pop_deferring_access_checks ();
16120 input_location
= loc
;
16121 processing_template_decl
-= incomplete
;
16122 pop_tinst_level ();
16124 if (fntype
== error_mark_node
)
16127 /* Place the explicitly specified arguments in TARGS. */
16128 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16129 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16132 /* Never do unification on the 'this' parameter. */
16133 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16139 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16140 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16141 new_args
[0] = return_type
;
16142 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16147 /* We allow incomplete unification without an error message here
16148 because the standard doesn't seem to explicitly prohibit it. Our
16149 callers must be ready to deal with unification failures in any
16152 TREE_VALUE (tinst
) = targs
;
16153 /* If we aren't explaining yet, push tinst context so we can see where
16154 any errors (e.g. from class instantiations triggered by instantiation
16155 of default template arguments) come from. If we are explaining, this
16156 context is redundant. */
16157 if (!explain_p
&& !push_tinst_level (tinst
))
16159 excessive_deduction_depth
= true;
16163 /* type_unification_real will pass back any access checks from default
16164 template argument substitution. */
16165 vec
<deferred_access_check
, va_gc
> *checks
;
16168 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16169 targs
, parms
, args
, nargs
, /*subr=*/0,
16170 strict
, flags
, &checks
, explain_p
);
16172 pop_tinst_level ();
16176 /* Now that we have bindings for all of the template arguments,
16177 ensure that the arguments deduced for the template template
16178 parameters have compatible template parameter lists. We cannot
16179 check this property before we have deduced all template
16180 arguments, because the template parameter types of a template
16181 template parameter might depend on prior template parameters
16182 deduced after the template template parameter. The following
16183 ill-formed example illustrates this issue:
16185 template<typename T, template<T> class C> void f(C<5>, T);
16187 template<int N> struct X {};
16190 f(X<5>(), 5l); // error: template argument deduction fails
16193 The template parameter list of 'C' depends on the template type
16194 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16195 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16196 time that we deduce 'C'. */
16197 if (!template_template_parm_bindings_ok_p
16198 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
16200 unify_inconsistent_template_template_parameters (explain_p
);
16204 /* All is well so far. Now, check:
16208 When all template arguments have been deduced, all uses of
16209 template parameters in nondeduced contexts are replaced with
16210 the corresponding deduced argument values. If the
16211 substitution results in an invalid type, as described above,
16212 type deduction fails. */
16213 TREE_VALUE (tinst
) = targs
;
16214 if (!push_tinst_level (tinst
))
16216 excessive_deduction_depth
= true;
16220 /* Also collect access checks from the instantiation. */
16221 reopen_deferring_access_checks (checks
);
16223 decl
= instantiate_template (fn
, targs
, complain
);
16225 checks
= get_deferred_access_checks ();
16226 pop_deferring_access_checks ();
16228 pop_tinst_level ();
16230 if (decl
== error_mark_node
)
16233 /* Now perform any access checks encountered during substitution. */
16234 push_access_scope (decl
);
16235 ok
= perform_access_checks (checks
, complain
);
16236 pop_access_scope (decl
);
16240 /* If we're looking for an exact match, check that what we got
16241 is indeed an exact match. It might not be if some template
16242 parameters are used in non-deduced contexts. But don't check
16243 for an exact match if we have dependent template arguments;
16244 in that case we're doing partial ordering, and we already know
16245 that we have two candidates that will provide the actual type. */
16246 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
16248 tree substed
= TREE_TYPE (decl
);
16252 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
16254 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
16255 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
16256 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
16258 unify_type_mismatch (explain_p
, args
[i
],
16259 TREE_VALUE (sarg
));
16268 if (excessive_deduction_depth
)
16270 if (deduction_depth
== 0)
16271 /* Reset once we're all the way out. */
16272 excessive_deduction_depth
= false;
16275 /* We can't free this if a pending_template entry or last_error_tinst_level
16276 is pointing at it. */
16277 if (last_pending_template
== old_last_pend
16278 && last_error_tinst_level
== old_error_tinst
)
16284 /* Adjust types before performing type deduction, as described in
16285 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16286 sections are symmetric. PARM is the type of a function parameter
16287 or the return type of the conversion function. ARG is the type of
16288 the argument passed to the call, or the type of the value
16289 initialized with the result of the conversion function.
16290 ARG_EXPR is the original argument expression, which may be null. */
16293 maybe_adjust_types_for_deduction (unification_kind_t strict
,
16307 /* Swap PARM and ARG throughout the remainder of this
16308 function; the handling is precisely symmetric since PARM
16309 will initialize ARG rather than vice versa. */
16317 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16318 too, but here handle it by stripping the reference from PARM
16319 rather than by adding it to ARG. */
16320 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16321 && TYPE_REF_IS_RVALUE (*parm
)
16322 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16323 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16324 && TREE_CODE (*arg
) == REFERENCE_TYPE
16325 && !TYPE_REF_IS_RVALUE (*arg
))
16326 *parm
= TREE_TYPE (*parm
);
16327 /* Nothing else to do in this case. */
16331 gcc_unreachable ();
16334 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16336 /* [temp.deduct.call]
16338 If P is not a reference type:
16340 --If A is an array type, the pointer type produced by the
16341 array-to-pointer standard conversion (_conv.array_) is
16342 used in place of A for type deduction; otherwise,
16344 --If A is a function type, the pointer type produced by
16345 the function-to-pointer standard conversion
16346 (_conv.func_) is used in place of A for type deduction;
16349 --If A is a cv-qualified type, the top level
16350 cv-qualifiers of A's type are ignored for type
16352 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16353 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16354 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16355 *arg
= build_pointer_type (*arg
);
16357 *arg
= TYPE_MAIN_VARIANT (*arg
);
16360 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16361 of the form T&&, where T is a template parameter, and the argument
16362 is an lvalue, T is deduced as A& */
16363 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16364 && TYPE_REF_IS_RVALUE (*parm
)
16365 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16366 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16367 && (arg_expr
? real_lvalue_p (arg_expr
)
16368 /* try_one_overload doesn't provide an arg_expr, but
16369 functions are always lvalues. */
16370 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16371 *arg
= build_reference_type (*arg
);
16373 /* [temp.deduct.call]
16375 If P is a cv-qualified type, the top level cv-qualifiers
16376 of P's type are ignored for type deduction. If P is a
16377 reference type, the type referred to by P is used for
16379 *parm
= TYPE_MAIN_VARIANT (*parm
);
16380 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16382 *parm
= TREE_TYPE (*parm
);
16383 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16386 /* DR 322. For conversion deduction, remove a reference type on parm
16387 too (which has been swapped into ARG). */
16388 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16389 *arg
= TREE_TYPE (*arg
);
16394 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16395 template which does contain any deducible template parameters; check if
16396 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16397 unify_one_argument. */
16400 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16401 int flags
, bool explain_p
)
16406 type
= TREE_TYPE (arg
);
16410 if (same_type_p (parm
, type
))
16411 return unify_success (explain_p
);
16413 if (strict
== DEDUCE_CONV
)
16415 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16416 explain_p
? tf_warning_or_error
: tf_none
))
16417 return unify_success (explain_p
);
16419 else if (strict
!= DEDUCE_EXACT
)
16421 if (can_convert_arg (parm
, type
,
16422 TYPE_P (arg
) ? NULL_TREE
: arg
,
16423 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16424 return unify_success (explain_p
);
16427 if (strict
== DEDUCE_EXACT
)
16428 return unify_type_mismatch (explain_p
, parm
, arg
);
16430 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16433 static bool uses_deducible_template_parms (tree type
);
16435 /* Returns true iff the expression EXPR is one from which a template
16436 argument can be deduced. In other words, if it's an undecorated
16437 use of a template non-type parameter. */
16440 deducible_expression (tree expr
)
16442 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16445 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16446 deducible way; that is, if it has a max value of <PARM> - 1. */
16449 deducible_array_bound (tree domain
)
16451 if (domain
== NULL_TREE
)
16454 tree max
= TYPE_MAX_VALUE (domain
);
16455 if (TREE_CODE (max
) != MINUS_EXPR
)
16458 return deducible_expression (TREE_OPERAND (max
, 0));
16461 /* Returns true iff the template arguments ARGS use a template parameter
16462 in a deducible way. */
16465 deducible_template_args (tree args
)
16467 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16470 tree elt
= TREE_VEC_ELT (args
, i
);
16471 if (ARGUMENT_PACK_P (elt
))
16472 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16475 if (PACK_EXPANSION_P (elt
))
16476 elt
= PACK_EXPANSION_PATTERN (elt
);
16477 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16479 else if (TYPE_P (elt
))
16480 deducible
= uses_deducible_template_parms (elt
);
16482 deducible
= deducible_expression (elt
);
16490 /* Returns true iff TYPE contains any deducible references to template
16491 parameters, as per 14.8.2.5. */
16494 uses_deducible_template_parms (tree type
)
16496 if (PACK_EXPANSION_P (type
))
16497 type
= PACK_EXPANSION_PATTERN (type
);
16504 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16505 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16511 if (POINTER_TYPE_P (type
))
16512 return uses_deducible_template_parms (TREE_TYPE (type
));
16514 /* T[integer-constant ]
16516 if (TREE_CODE (type
) == ARRAY_TYPE
)
16517 return (uses_deducible_template_parms (TREE_TYPE (type
))
16518 || deducible_array_bound (TYPE_DOMAIN (type
)));
16530 if (TYPE_PTRMEM_P (type
))
16531 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16532 || (uses_deducible_template_parms
16533 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16535 /* template-name <T> (where template-name refers to a class template)
16536 template-name <i> (where template-name refers to a class template) */
16537 if (CLASS_TYPE_P (type
)
16538 && CLASSTYPE_TEMPLATE_INFO (type
)
16539 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16540 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16541 (CLASSTYPE_TI_ARGS (type
)));
16546 if (TREE_CODE (type
) == FUNCTION_TYPE
16547 || TREE_CODE (type
) == METHOD_TYPE
)
16549 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16551 tree parm
= TYPE_ARG_TYPES (type
);
16552 if (TREE_CODE (type
) == METHOD_TYPE
)
16553 parm
= TREE_CHAIN (parm
);
16554 for (; parm
; parm
= TREE_CHAIN (parm
))
16555 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16562 /* Subroutine of type_unification_real and unify_pack_expansion to
16563 handle unification of a single P/A pair. Parameters are as
16564 for those functions. */
16567 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16568 int subr
, unification_kind_t strict
, int flags
,
16571 tree arg_expr
= NULL_TREE
;
16574 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16575 return unify_invalid (explain_p
);
16576 if (arg
== unknown_type_node
)
16577 /* We can't deduce anything from this, but we might get all the
16578 template args from other function args. */
16579 return unify_success (explain_p
);
16581 /* Implicit conversions (Clause 4) will be performed on a function
16582 argument to convert it to the type of the corresponding function
16583 parameter if the parameter type contains no template-parameters that
16584 participate in template argument deduction. */
16585 if (TYPE_P (parm
) && !uses_template_parms (parm
))
16586 /* For function parameters that contain no template-parameters at all,
16587 we have historically checked for convertibility in order to shortcut
16588 consideration of this candidate. */
16589 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
16591 else if (strict
== DEDUCE_CALL
16592 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16593 /* For function parameters with only non-deducible template parameters,
16595 return unify_success (explain_p
);
16600 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16601 | UNIFY_ALLOW_MORE_CV_QUAL
16602 | UNIFY_ALLOW_DERIVED
);
16606 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16610 arg_strict
= UNIFY_ALLOW_NONE
;
16614 gcc_unreachable ();
16617 /* We only do these transformations if this is the top-level
16618 parameter_type_list in a call or declaration matching; in other
16619 situations (nested function declarators, template argument lists) we
16620 won't be comparing a type to an expression, and we don't do any type
16626 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16627 if (type_unknown_p (arg
))
16629 /* [temp.deduct.type] A template-argument can be
16630 deduced from a pointer to function or pointer
16631 to member function argument if the set of
16632 overloaded functions does not contain function
16633 templates and at most one of a set of
16634 overloaded functions provides a unique
16637 if (resolve_overloaded_unification
16638 (tparms
, targs
, parm
, arg
, strict
,
16639 arg_strict
, explain_p
))
16640 return unify_success (explain_p
);
16641 return unify_overload_resolution_failure (explain_p
, arg
);
16645 arg
= unlowered_expr_type (arg
);
16646 if (arg
== error_mark_node
)
16647 return unify_invalid (explain_p
);
16651 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16654 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16655 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
16656 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16658 /* For deduction from an init-list we need the actual list. */
16659 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16661 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16664 /* Most parms like fn_type_unification.
16666 If SUBR is 1, we're being called recursively (to unify the
16667 arguments of a function or method parameter of a function
16670 CHECKS is a pointer to a vector of access checks encountered while
16671 substituting default template arguments. */
16674 type_unification_real (tree tparms
,
16678 unsigned int xnargs
,
16680 unification_kind_t strict
,
16682 vec
<deferred_access_check
, va_gc
> **checks
,
16687 int ntparms
= TREE_VEC_LENGTH (tparms
);
16688 int saw_undeduced
= 0;
16691 unsigned int nargs
;
16694 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16695 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16696 gcc_assert (ntparms
> 0);
16698 /* Reset the number of non-defaulted template arguments contained
16700 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16708 while (parms
&& parms
!= void_list_node
16711 parm
= TREE_VALUE (parms
);
16713 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16714 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16715 /* For a function parameter pack that occurs at the end of the
16716 parameter-declaration-list, the type A of each remaining
16717 argument of the call is compared with the type P of the
16718 declarator-id of the function parameter pack. */
16721 parms
= TREE_CHAIN (parms
);
16723 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16724 /* For a function parameter pack that does not occur at the
16725 end of the parameter-declaration-list, the type of the
16726 parameter pack is a non-deduced context. */
16732 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16738 && parms
!= void_list_node
16739 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16741 /* Unify the remaining arguments with the pack expansion type. */
16743 tree parmvec
= make_tree_vec (1);
16745 /* Allocate a TREE_VEC and copy in all of the arguments */
16746 argvec
= make_tree_vec (nargs
- ia
);
16747 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
16748 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
16750 /* Copy the parameter into parmvec. */
16751 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
16752 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
16753 /*subr=*/subr
, explain_p
))
16756 /* Advance to the end of the list of parameters. */
16757 parms
= TREE_CHAIN (parms
);
16760 /* Fail if we've reached the end of the parm list, and more args
16761 are present, and the parm list isn't variadic. */
16762 if (ia
< nargs
&& parms
== void_list_node
)
16763 return unify_too_many_arguments (explain_p
, nargs
, ia
);
16764 /* Fail if parms are left and they don't have default values and
16765 they aren't all deduced as empty packs (c++/57397). This is
16766 consistent with sufficient_parms_p. */
16767 if (parms
&& parms
!= void_list_node
16768 && TREE_PURPOSE (parms
) == NULL_TREE
)
16770 unsigned int count
= nargs
;
16775 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
16778 p
= TREE_CHAIN (p
);
16780 while (p
&& p
!= void_list_node
);
16781 if (count
!= nargs
)
16782 return unify_too_few_arguments (explain_p
, ia
, count
,
16788 tsubst_flags_t complain
= (explain_p
16789 ? tf_warning_or_error
16792 for (i
= 0; i
< ntparms
; i
++)
16794 tree targ
= TREE_VEC_ELT (targs
, i
);
16795 tree tparm
= TREE_VEC_ELT (tparms
, i
);
16797 /* Clear the "incomplete" flags on all argument packs now so that
16798 substituting them into later default arguments works. */
16799 if (targ
&& ARGUMENT_PACK_P (targ
))
16801 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
16802 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
16805 if (targ
|| tparm
== error_mark_node
)
16807 tparm
= TREE_VALUE (tparm
);
16809 /* If this is an undeduced nontype parameter that depends on
16810 a type parameter, try another pass; its type may have been
16811 deduced from a later argument than the one from which
16812 this parameter can be deduced. */
16813 if (TREE_CODE (tparm
) == PARM_DECL
16814 && uses_template_parms (TREE_TYPE (tparm
))
16815 && !saw_undeduced
++)
16818 /* Core issue #226 (C++0x) [temp.deduct]:
16820 If a template argument has not been deduced, its
16821 default template argument, if any, is used.
16823 When we are in C++98 mode, TREE_PURPOSE will either
16824 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16825 to explicitly check cxx_dialect here. */
16826 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
16828 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16829 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
16830 reopen_deferring_access_checks (*checks
);
16831 location_t save_loc
= input_location
;
16833 input_location
= DECL_SOURCE_LOCATION (parm
);
16834 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
16835 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
16837 input_location
= save_loc
;
16838 *checks
= get_deferred_access_checks ();
16839 pop_deferring_access_checks ();
16840 if (arg
== error_mark_node
)
16844 TREE_VEC_ELT (targs
, i
) = arg
;
16845 /* The position of the first default template argument,
16846 is also the number of non-defaulted arguments in TARGS.
16848 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16849 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
16854 /* If the type parameter is a parameter pack, then it will
16855 be deduced to an empty parameter pack. */
16856 if (template_parameter_pack_p (tparm
))
16860 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
16862 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
16863 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
16864 TREE_CONSTANT (arg
) = 1;
16867 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16869 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
16871 TREE_VEC_ELT (targs
, i
) = arg
;
16875 return unify_parameter_deduction_failure (explain_p
, tparm
);
16878 #ifdef ENABLE_CHECKING
16879 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16880 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
16883 return unify_success (explain_p
);
16886 /* Subroutine of type_unification_real. Args are like the variables
16887 at the call site. ARG is an overloaded function (or template-id);
16888 we try deducing template args from each of the overloads, and if
16889 only one succeeds, we go with that. Modifies TARGS and returns
16890 true on success. */
16893 resolve_overloaded_unification (tree tparms
,
16897 unification_kind_t strict
,
16901 tree tempargs
= copy_node (targs
);
16903 tree goodfn
= NULL_TREE
;
16906 if (TREE_CODE (arg
) == ADDR_EXPR
)
16908 arg
= TREE_OPERAND (arg
, 0);
16914 if (TREE_CODE (arg
) == COMPONENT_REF
)
16915 /* Handle `&x' where `x' is some static or non-static member
16917 arg
= TREE_OPERAND (arg
, 1);
16919 if (TREE_CODE (arg
) == OFFSET_REF
)
16920 arg
= TREE_OPERAND (arg
, 1);
16922 /* Strip baselink information. */
16923 if (BASELINK_P (arg
))
16924 arg
= BASELINK_FUNCTIONS (arg
);
16926 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
16928 /* If we got some explicit template args, we need to plug them into
16929 the affected templates before we try to unify, in case the
16930 explicit args will completely resolve the templates in question. */
16933 tree expl_subargs
= TREE_OPERAND (arg
, 1);
16934 arg
= TREE_OPERAND (arg
, 0);
16936 for (; arg
; arg
= OVL_NEXT (arg
))
16938 tree fn
= OVL_CURRENT (arg
);
16939 tree subargs
, elem
;
16941 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16944 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16945 expl_subargs
, NULL_TREE
, tf_none
,
16946 /*require_all_args=*/true,
16947 /*use_default_args=*/true);
16948 if (subargs
!= error_mark_node
16949 && !any_dependent_template_arguments_p (subargs
))
16951 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
16952 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16953 elem
, strict
, sub_strict
, addr_p
, explain_p
)
16954 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
16963 /* If no templates (or more than one) are fully resolved by the
16964 explicit arguments, this template-id is a non-deduced context; it
16965 could still be OK if we deduce all template arguments for the
16966 enclosing call through other arguments. */
16970 else if (TREE_CODE (arg
) != OVERLOAD
16971 && TREE_CODE (arg
) != FUNCTION_DECL
)
16972 /* If ARG is, for example, "(0, &f)" then its type will be unknown
16973 -- but the deduction does not succeed because the expression is
16974 not just the function on its own. */
16977 for (; arg
; arg
= OVL_NEXT (arg
))
16978 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16979 TREE_TYPE (OVL_CURRENT (arg
)),
16980 strict
, sub_strict
, addr_p
, explain_p
)
16981 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
16983 goodfn
= OVL_CURRENT (arg
);
16987 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16988 to function or pointer to member function argument if the set of
16989 overloaded functions does not contain function templates and at most
16990 one of a set of overloaded functions provides a unique match.
16992 So if we found multiple possibilities, we return success but don't
16993 deduce anything. */
16997 int i
= TREE_VEC_LENGTH (targs
);
16999 if (TREE_VEC_ELT (tempargs
, i
))
17001 tree old
= TREE_VEC_ELT (targs
, i
);
17002 tree new_
= TREE_VEC_ELT (tempargs
, i
);
17003 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
17004 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
17005 /* Don't forget explicit template arguments in a pack. */
17006 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
17007 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
17008 TREE_VEC_ELT (targs
, i
) = new_
;
17017 /* Core DR 115: In contexts where deduction is done and fails, or in
17018 contexts where deduction is not done, if a template argument list is
17019 specified and it, along with any default template arguments, identifies
17020 a single function template specialization, then the template-id is an
17021 lvalue for the function template specialization. */
17024 resolve_nondeduced_context (tree orig_expr
)
17026 tree expr
, offset
, baselink
;
17029 if (!type_unknown_p (orig_expr
))
17034 offset
= NULL_TREE
;
17035 baselink
= NULL_TREE
;
17037 if (TREE_CODE (expr
) == ADDR_EXPR
)
17039 expr
= TREE_OPERAND (expr
, 0);
17042 if (TREE_CODE (expr
) == OFFSET_REF
)
17045 expr
= TREE_OPERAND (expr
, 1);
17047 if (BASELINK_P (expr
))
17050 expr
= BASELINK_FUNCTIONS (expr
);
17053 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
17056 tree goodfn
= NULL_TREE
;
17058 /* If we got some explicit template args, we need to plug them into
17059 the affected templates before we try to unify, in case the
17060 explicit args will completely resolve the templates in question. */
17062 tree expl_subargs
= TREE_OPERAND (expr
, 1);
17063 tree arg
= TREE_OPERAND (expr
, 0);
17064 tree badfn
= NULL_TREE
;
17065 tree badargs
= NULL_TREE
;
17067 for (; arg
; arg
= OVL_NEXT (arg
))
17069 tree fn
= OVL_CURRENT (arg
);
17070 tree subargs
, elem
;
17072 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17075 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17076 expl_subargs
, NULL_TREE
, tf_none
,
17077 /*require_all_args=*/true,
17078 /*use_default_args=*/true);
17079 if (subargs
!= error_mark_node
17080 && !any_dependent_template_arguments_p (subargs
))
17082 elem
= instantiate_template (fn
, subargs
, tf_none
);
17083 if (elem
== error_mark_node
)
17088 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17097 mark_used (goodfn
);
17100 expr
= build_baselink (BASELINK_BINFO (baselink
),
17101 BASELINK_ACCESS_BINFO (baselink
),
17102 expr
, BASELINK_OPTYPE (baselink
));
17106 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17107 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17110 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17113 else if (good
== 0 && badargs
)
17114 /* There were no good options and at least one bad one, so let the
17115 user know what the problem is. */
17116 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17121 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17122 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17123 different overloads deduce different arguments for a given parm.
17124 ADDR_P is true if the expression for which deduction is being
17125 performed was of the form "& fn" rather than simply "fn".
17127 Returns 1 on success. */
17130 try_one_overload (tree tparms
,
17135 unification_kind_t strict
,
17144 if (arg
== error_mark_node
)
17147 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17148 to function or pointer to member function argument if the set of
17149 overloaded functions does not contain function templates and at most
17150 one of a set of overloaded functions provides a unique match.
17152 So if this is a template, just return success. */
17154 if (uses_template_parms (arg
))
17157 if (TREE_CODE (arg
) == METHOD_TYPE
)
17158 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
17160 arg
= build_pointer_type (arg
);
17162 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
17164 /* We don't copy orig_targs for this because if we have already deduced
17165 some template args from previous args, unify would complain when we
17166 try to deduce a template parameter for the same argument, even though
17167 there isn't really a conflict. */
17168 nargs
= TREE_VEC_LENGTH (targs
);
17169 tempargs
= make_tree_vec (nargs
);
17171 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
17174 /* First make sure we didn't deduce anything that conflicts with
17175 explicitly specified args. */
17176 for (i
= nargs
; i
--; )
17178 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17179 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
17183 else if (uses_template_parms (elt
))
17184 /* Since we're unifying against ourselves, we will fill in
17185 template args used in the function parm list with our own
17186 template parms. Discard them. */
17187 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
17188 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
17192 for (i
= nargs
; i
--; )
17194 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17197 TREE_VEC_ELT (targs
, i
) = elt
;
17203 /* PARM is a template class (perhaps with unbound template
17204 parameters). ARG is a fully instantiated type. If ARG can be
17205 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
17206 TARGS are as for unify. */
17209 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
17212 tree copy_of_targs
;
17214 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
17215 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
17216 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
17219 /* We need to make a new template argument vector for the call to
17220 unify. If we used TARGS, we'd clutter it up with the result of
17221 the attempted unification, even if this class didn't work out.
17222 We also don't want to commit ourselves to all the unifications
17223 we've already done, since unification is supposed to be done on
17224 an argument-by-argument basis. In other words, consider the
17225 following pathological case:
17227 template <int I, int J, int K>
17230 template <int I, int J>
17231 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
17233 template <int I, int J, int K>
17234 void f(S<I, J, K>, S<I, I, I>);
17243 Now, by the time we consider the unification involving `s2', we
17244 already know that we must have `f<0, 0, 0>'. But, even though
17245 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17246 because there are two ways to unify base classes of S<0, 1, 2>
17247 with S<I, I, I>. If we kept the already deduced knowledge, we
17248 would reject the possibility I=1. */
17249 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
17251 /* If unification failed, we're done. */
17252 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
17253 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
17259 /* Given a template type PARM and a class type ARG, find the unique
17260 base type in ARG that is an instance of PARM. We do not examine
17261 ARG itself; only its base-classes. If there is not exactly one
17262 appropriate base class, return NULL_TREE. PARM may be the type of
17263 a partial specialization, as well as a plain template type. Used
17266 static enum template_base_result
17267 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
17268 bool explain_p
, tree
*result
)
17270 tree rval
= NULL_TREE
;
17273 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
17275 binfo
= TYPE_BINFO (complete_type (arg
));
17278 /* The type could not be completed. */
17279 *result
= NULL_TREE
;
17280 return tbr_incomplete_type
;
17283 /* Walk in inheritance graph order. The search order is not
17284 important, and this avoids multiple walks of virtual bases. */
17285 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
17287 tree r
= try_class_unification (tparms
, targs
, parm
,
17288 BINFO_TYPE (binfo
), explain_p
);
17292 /* If there is more than one satisfactory baseclass, then:
17296 If they yield more than one possible deduced A, the type
17300 if (rval
&& !same_type_p (r
, rval
))
17302 *result
= NULL_TREE
;
17303 return tbr_ambiguous_baseclass
;
17311 return tbr_success
;
17314 /* Returns the level of DECL, which declares a template parameter. */
17317 template_decl_level (tree decl
)
17319 switch (TREE_CODE (decl
))
17322 case TEMPLATE_DECL
:
17323 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
17326 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
17329 gcc_unreachable ();
17334 /* Decide whether ARG can be unified with PARM, considering only the
17335 cv-qualifiers of each type, given STRICT as documented for unify.
17336 Returns nonzero iff the unification is OK on that basis. */
17339 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17341 int arg_quals
= cp_type_quals (arg
);
17342 int parm_quals
= cp_type_quals (parm
);
17344 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17345 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17347 /* Although a CVR qualifier is ignored when being applied to a
17348 substituted template parameter ([8.3.2]/1 for example), that
17349 does not allow us to unify "const T" with "int&" because both
17350 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17351 It is ok when we're allowing additional CV qualifiers
17352 at the outer level [14.8.2.1]/3,1st bullet. */
17353 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17354 || TREE_CODE (arg
) == FUNCTION_TYPE
17355 || TREE_CODE (arg
) == METHOD_TYPE
)
17356 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17359 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17360 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17364 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17365 && (arg_quals
& parm_quals
) != parm_quals
)
17368 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17369 && (parm_quals
& arg_quals
) != arg_quals
)
17375 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17377 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17379 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17380 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17381 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17383 *index
= TEMPLATE_TYPE_IDX (parm
);
17384 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17388 *index
= TEMPLATE_PARM_IDX (parm
);
17389 *level
= TEMPLATE_PARM_LEVEL (parm
);
17393 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17395 if (unify (TP, TA, P, A, S, EP)) \
17399 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17400 expansion at the end of PACKED_PARMS. Returns 0 if the type
17401 deduction succeeds, 1 otherwise. STRICT is the same as in
17402 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17403 call argument list. We'll need to adjust the arguments to make them
17404 types. SUBR tells us if this is from a recursive call to
17405 type_unification_real, or for comparing two template argument
17409 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17410 tree packed_args
, unification_kind_t strict
,
17411 bool subr
, bool explain_p
)
17414 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17415 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17416 tree pack
, packs
= NULL_TREE
;
17417 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17419 packed_args
= expand_template_argument_pack (packed_args
);
17421 int len
= TREE_VEC_LENGTH (packed_args
);
17423 /* Determine the parameter packs we will be deducing from the
17424 pattern, and record their current deductions. */
17425 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17426 pack
; pack
= TREE_CHAIN (pack
))
17428 tree parm_pack
= TREE_VALUE (pack
);
17431 /* Determine the index and level of this parameter pack. */
17432 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17434 /* Keep track of the parameter packs and their corresponding
17436 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17437 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17440 /* Loop through all of the arguments that have not yet been
17441 unified and unify each with the pattern. */
17442 for (i
= start
; i
< len
; i
++)
17445 bool any_explicit
= false;
17446 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17448 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17449 or the element of its argument pack at the current index if
17450 this argument was explicitly specified. */
17451 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17455 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17458 if (TREE_VALUE (pack
)
17459 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17460 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17462 any_explicit
= true;
17463 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17465 TMPL_ARG (targs
, level
, idx
) = arg
;
17468 /* If we had explicit template arguments, substitute them into the
17469 pattern before deduction. */
17472 /* Some arguments might still be unspecified or dependent. */
17474 ++processing_template_decl
;
17475 dependent
= any_dependent_template_arguments_p (targs
);
17477 --processing_template_decl
;
17478 parm
= tsubst (pattern
, targs
,
17479 explain_p
? tf_warning_or_error
: tf_none
,
17482 --processing_template_decl
;
17483 if (parm
== error_mark_node
)
17489 /* Unify the pattern with the current argument. */
17490 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17491 LOOKUP_IMPLICIT
, explain_p
))
17494 /* For each parameter pack, collect the deduced value. */
17495 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17498 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17500 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17501 TMPL_ARG (targs
, level
, idx
);
17505 /* Verify that the results of unification with the parameter packs
17506 produce results consistent with what we've seen before, and make
17507 the deduced argument packs available. */
17508 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17510 tree old_pack
= TREE_VALUE (pack
);
17511 tree new_args
= TREE_TYPE (pack
);
17512 int i
, len
= TREE_VEC_LENGTH (new_args
);
17514 bool nondeduced_p
= false;
17516 /* By default keep the original deduced argument pack.
17517 If necessary, more specific code is going to update the
17518 resulting deduced argument later down in this function. */
17519 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17520 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17522 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17523 actually deduce anything. */
17524 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17525 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17526 nondeduced_p
= true;
17530 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17532 /* If we had fewer function args than explicit template args,
17533 just use the explicits. */
17534 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17535 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17536 if (len
< explicit_len
)
17537 new_args
= explicit_args
;
17543 /* Build the deduced *_ARGUMENT_PACK. */
17544 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17546 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17547 TREE_TYPE (result
) =
17548 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17549 TREE_CONSTANT (result
) = 1;
17552 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17554 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17556 /* Note the deduced argument packs for this parameter
17558 TMPL_ARG (targs
, level
, idx
) = result
;
17560 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17561 && (ARGUMENT_PACK_ARGS (old_pack
)
17562 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17564 /* We only had the explicitly-provided arguments before, but
17565 now we have a complete set of arguments. */
17566 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17568 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17569 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17570 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17574 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17575 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17577 if (!comp_template_args_with_info (old_args
, new_args
,
17578 &bad_old_arg
, &bad_new_arg
))
17579 /* Inconsistent unification of this parameter pack. */
17580 return unify_parameter_pack_inconsistent (explain_p
,
17586 return unify_success (explain_p
);
17589 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17590 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17591 parameters and return value are as for unify. */
17594 unify_array_domain (tree tparms
, tree targs
,
17595 tree parm_dom
, tree arg_dom
,
17603 /* Our representation of array types uses "N - 1" as the
17604 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17605 not an integer constant. We cannot unify arbitrarily
17606 complex expressions, so we eliminate the MINUS_EXPRs
17608 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17609 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17612 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17613 parm_max
= TREE_OPERAND (parm_max
, 0);
17615 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17616 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17619 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17620 trying to unify the type of a variable with the type
17621 of a template parameter. For example:
17623 template <unsigned int N>
17624 void f (char (&) [N]);
17631 Here, the type of the ARG will be "int [g(i)]", and
17632 may be a SAVE_EXPR, etc. */
17633 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17634 return unify_vla_arg (explain_p
, arg_dom
);
17635 arg_max
= TREE_OPERAND (arg_max
, 0);
17638 /* If only one of the bounds used a MINUS_EXPR, compensate
17639 by adding one to the other bound. */
17640 if (parm_cst
&& !arg_cst
)
17641 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17645 else if (arg_cst
&& !parm_cst
)
17646 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17651 return unify (tparms
, targs
, parm_max
, arg_max
,
17652 UNIFY_ALLOW_INTEGER
, explain_p
);
17655 /* Deduce the value of template parameters. TPARMS is the (innermost)
17656 set of template parameters to a template. TARGS is the bindings
17657 for those template parameters, as determined thus far; TARGS may
17658 include template arguments for outer levels of template parameters
17659 as well. PARM is a parameter to a template function, or a
17660 subcomponent of that parameter; ARG is the corresponding argument.
17661 This function attempts to match PARM with ARG in a manner
17662 consistent with the existing assignments in TARGS. If more values
17663 are deduced, then TARGS is updated.
17665 Returns 0 if the type deduction succeeds, 1 otherwise. The
17666 parameter STRICT is a bitwise or of the following flags:
17669 Require an exact match between PARM and ARG.
17670 UNIFY_ALLOW_MORE_CV_QUAL:
17671 Allow the deduced ARG to be more cv-qualified (by qualification
17672 conversion) than ARG.
17673 UNIFY_ALLOW_LESS_CV_QUAL:
17674 Allow the deduced ARG to be less cv-qualified than ARG.
17675 UNIFY_ALLOW_DERIVED:
17676 Allow the deduced ARG to be a template base class of ARG,
17677 or a pointer to a template base class of the type pointed to by
17679 UNIFY_ALLOW_INTEGER:
17680 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17681 case for more information.
17682 UNIFY_ALLOW_OUTER_LEVEL:
17683 This is the outermost level of a deduction. Used to determine validity
17684 of qualification conversions. A valid qualification conversion must
17685 have const qualified pointers leading up to the inner type which
17686 requires additional CV quals, except at the outer level, where const
17687 is not required [conv.qual]. It would be normal to set this flag in
17688 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17689 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17690 This is the outermost level of a deduction, and PARM can be more CV
17691 qualified at this point.
17692 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17693 This is the outermost level of a deduction, and PARM can be less CV
17694 qualified at this point. */
17697 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
17703 int strict_in
= strict
;
17705 /* I don't think this will do the right thing with respect to types.
17706 But the only case I've seen it in so far has been array bounds, where
17707 signedness is the only information lost, and I think that will be
17709 while (TREE_CODE (parm
) == NOP_EXPR
)
17710 parm
= TREE_OPERAND (parm
, 0);
17712 if (arg
== error_mark_node
)
17713 return unify_invalid (explain_p
);
17714 if (arg
== unknown_type_node
17715 || arg
== init_list_type_node
)
17716 /* We can't deduce anything from this, but we might get all the
17717 template args from other function args. */
17718 return unify_success (explain_p
);
17720 /* If PARM uses template parameters, then we can't bail out here,
17721 even if ARG == PARM, since we won't record unifications for the
17722 template parameters. We might need them if we're trying to
17723 figure out which of two things is more specialized. */
17724 if (arg
== parm
&& !uses_template_parms (parm
))
17725 return unify_success (explain_p
);
17727 /* Handle init lists early, so the rest of the function can assume
17728 we're dealing with a type. */
17729 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
17733 tree orig_parm
= parm
;
17735 /* Replace T with std::initializer_list<T> for deduction. */
17736 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17737 && flag_deduce_init_list
)
17738 parm
= listify (parm
);
17740 if (!is_std_init_list (parm
)
17741 && TREE_CODE (parm
) != ARRAY_TYPE
)
17742 /* We can only deduce from an initializer list argument if the
17743 parameter is std::initializer_list or an array; otherwise this
17744 is a non-deduced context. */
17745 return unify_success (explain_p
);
17747 if (TREE_CODE (parm
) == ARRAY_TYPE
)
17748 elttype
= TREE_TYPE (parm
);
17750 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
17752 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
17754 int elt_strict
= strict
;
17756 if (elt
== error_mark_node
)
17757 return unify_invalid (explain_p
);
17759 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
17761 tree type
= TREE_TYPE (elt
);
17762 /* It should only be possible to get here for a call. */
17763 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
17764 elt_strict
|= maybe_adjust_types_for_deduction
17765 (DEDUCE_CALL
, &elttype
, &type
, elt
);
17769 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
17773 if (TREE_CODE (parm
) == ARRAY_TYPE
17774 && deducible_array_bound (TYPE_DOMAIN (parm
)))
17776 /* Also deduce from the length of the initializer list. */
17777 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
17778 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
17779 if (idx
== error_mark_node
)
17780 return unify_invalid (explain_p
);
17781 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17785 /* If the std::initializer_list<T> deduction worked, replace the
17786 deduced A with std::initializer_list<A>. */
17787 if (orig_parm
!= parm
)
17789 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
17790 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17791 targ
= listify (targ
);
17792 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
17794 return unify_success (explain_p
);
17797 /* Immediately reject some pairs that won't unify because of
17798 cv-qualification mismatches. */
17799 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17801 /* It is the elements of the array which hold the cv quals of an array
17802 type, and the elements might be template type parms. We'll check
17803 when we recurse. */
17804 && TREE_CODE (arg
) != ARRAY_TYPE
17805 /* We check the cv-qualifiers when unifying with template type
17806 parameters below. We want to allow ARG `const T' to unify with
17807 PARM `T' for example, when computing which of two templates
17808 is more specialized, for example. */
17809 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
17810 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
17811 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17813 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
17814 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
17815 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
17816 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
17817 strict
&= ~UNIFY_ALLOW_DERIVED
;
17818 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17819 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
17821 switch (TREE_CODE (parm
))
17823 case TYPENAME_TYPE
:
17825 case UNBOUND_CLASS_TEMPLATE
:
17826 /* In a type which contains a nested-name-specifier, template
17827 argument values cannot be deduced for template parameters used
17828 within the nested-name-specifier. */
17829 return unify_success (explain_p
);
17831 case TEMPLATE_TYPE_PARM
:
17832 case TEMPLATE_TEMPLATE_PARM
:
17833 case BOUND_TEMPLATE_TEMPLATE_PARM
:
17834 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17835 if (error_operand_p (tparm
))
17836 return unify_invalid (explain_p
);
17838 if (TEMPLATE_TYPE_LEVEL (parm
)
17839 != template_decl_level (tparm
))
17840 /* The PARM is not one we're trying to unify. Just check
17841 to see if it matches ARG. */
17843 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17844 && (is_auto (parm
) ? is_auto (arg
)
17845 : same_type_p (parm
, arg
)))
17846 return unify_success (explain_p
);
17848 return unify_type_mismatch (explain_p
, parm
, arg
);
17850 idx
= TEMPLATE_TYPE_IDX (parm
);
17851 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17852 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
17853 if (error_operand_p (tparm
))
17854 return unify_invalid (explain_p
);
17856 /* Check for mixed types and values. */
17857 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17858 && TREE_CODE (tparm
) != TYPE_DECL
)
17859 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17860 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
17861 gcc_unreachable ();
17863 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17865 /* ARG must be constructed from a template class or a template
17866 template parameter. */
17867 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
17868 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
17869 return unify_template_deduction_failure (explain_p
, parm
, arg
);
17871 tree parmvec
= TYPE_TI_ARGS (parm
);
17872 /* An alias template name is never deduced. */
17873 if (TYPE_ALIAS_P (arg
))
17874 arg
= strip_typedefs (arg
);
17875 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
17876 tree full_argvec
= add_to_template_args (targs
, argvec
);
17878 = DECL_INNERMOST_TEMPLATE_PARMS
17879 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
17881 int parm_variadic_p
= 0;
17883 /* The resolution to DR150 makes clear that default
17884 arguments for an N-argument may not be used to bind T
17885 to a template template parameter with fewer than N
17886 parameters. It is not safe to permit the binding of
17887 default arguments as an extension, as that may change
17888 the meaning of a conforming program. Consider:
17890 struct Dense { static const unsigned int dim = 1; };
17892 template <template <typename> class View,
17894 void operator+(float, View<Block> const&);
17896 template <typename Block,
17897 unsigned int Dim = Block::dim>
17898 struct Lvalue_proxy { operator float() const; };
17902 Lvalue_proxy<Dense> p;
17907 Here, if Lvalue_proxy is permitted to bind to View, then
17908 the global operator+ will be used; if they are not, the
17909 Lvalue_proxy will be converted to float. */
17910 if (coerce_template_parms (parm_parms
,
17912 TYPE_TI_TEMPLATE (parm
),
17914 ? tf_warning_or_error
17916 /*require_all_args=*/true,
17917 /*use_default_args=*/false)
17918 == error_mark_node
)
17921 /* Deduce arguments T, i from TT<T> or TT<i>.
17922 We check each element of PARMVEC and ARGVEC individually
17923 rather than the whole TREE_VEC since they can have
17924 different number of elements. */
17926 parmvec
= expand_template_argument_pack (parmvec
);
17927 argvec
= expand_template_argument_pack (argvec
);
17929 len
= TREE_VEC_LENGTH (parmvec
);
17931 /* Check if the parameters end in a pack, making them
17934 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
17935 parm_variadic_p
= 1;
17937 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17938 /* If the template argument list of P contains a pack
17939 expansion that is not the last template argument, the
17940 entire template argument list is a non-deduced
17942 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
17943 return unify_success (explain_p
);
17945 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
17946 return unify_too_few_arguments (explain_p
,
17947 TREE_VEC_LENGTH (argvec
), len
);
17949 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17951 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17952 TREE_VEC_ELT (parmvec
, i
),
17953 TREE_VEC_ELT (argvec
, i
),
17954 UNIFY_ALLOW_NONE
, explain_p
);
17957 if (parm_variadic_p
17958 && unify_pack_expansion (tparms
, targs
,
17961 /*subr=*/true, explain_p
))
17964 arg
= TYPE_TI_TEMPLATE (arg
);
17966 /* Fall through to deduce template name. */
17969 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17970 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17972 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
17974 /* Simple cases: Value already set, does match or doesn't. */
17975 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
17976 return unify_success (explain_p
);
17978 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17982 /* If PARM is `const T' and ARG is only `int', we don't have
17983 a match unless we are allowing additional qualification.
17984 If ARG is `const int' and PARM is just `T' that's OK;
17985 that binds `const int' to `T'. */
17986 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
17988 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17990 /* Consider the case where ARG is `const volatile int' and
17991 PARM is `const T'. Then, T should be `volatile int'. */
17992 arg
= cp_build_qualified_type_real
17993 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
17994 if (arg
== error_mark_node
)
17995 return unify_invalid (explain_p
);
17997 /* Simple cases: Value already set, does match or doesn't. */
17998 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
17999 return unify_success (explain_p
);
18001 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
18003 /* Make sure that ARG is not a variable-sized array. (Note
18004 that were talking about variable-sized arrays (like
18005 `int[n]'), rather than arrays of unknown size (like
18006 `int[]').) We'll get very confused by such a type since
18007 the bound of the array is not constant, and therefore
18008 not mangleable. Besides, such types are not allowed in
18009 ISO C++, so we can do as we please here. We do allow
18010 them for 'auto' deduction, since that isn't ABI-exposed. */
18011 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
18012 return unify_vla_arg (explain_p
, arg
);
18014 /* Strip typedefs as in convert_template_argument. */
18015 arg
= canonicalize_type_argument (arg
, tf_none
);
18018 /* If ARG is a parameter pack or an expansion, we cannot unify
18019 against it unless PARM is also a parameter pack. */
18020 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18021 && !template_parameter_pack_p (parm
))
18022 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18024 /* If the argument deduction results is a METHOD_TYPE,
18025 then there is a problem.
18026 METHOD_TYPE doesn't map to any real C++ type the result of
18027 the deduction can not be of that type. */
18028 if (TREE_CODE (arg
) == METHOD_TYPE
)
18029 return unify_method_type_error (explain_p
, arg
);
18031 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18032 return unify_success (explain_p
);
18034 case TEMPLATE_PARM_INDEX
:
18035 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
18036 if (error_operand_p (tparm
))
18037 return unify_invalid (explain_p
);
18039 if (TEMPLATE_PARM_LEVEL (parm
)
18040 != template_decl_level (tparm
))
18042 /* The PARM is not one we're trying to unify. Just check
18043 to see if it matches ARG. */
18044 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
18045 && cp_tree_equal (parm
, arg
));
18047 unify_expression_unequal (explain_p
, parm
, arg
);
18051 idx
= TEMPLATE_PARM_IDX (parm
);
18052 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18056 int x
= !cp_tree_equal (targ
, arg
);
18058 unify_inconsistency (explain_p
, parm
, targ
, arg
);
18062 /* [temp.deduct.type] If, in the declaration of a function template
18063 with a non-type template-parameter, the non-type
18064 template-parameter is used in an expression in the function
18065 parameter-list and, if the corresponding template-argument is
18066 deduced, the template-argument type shall match the type of the
18067 template-parameter exactly, except that a template-argument
18068 deduced from an array bound may be of any integral type.
18069 The non-type parameter might use already deduced type parameters. */
18070 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
18071 if (!TREE_TYPE (arg
))
18072 /* Template-parameter dependent expression. Just accept it for now.
18073 It will later be processed in convert_template_argument. */
18075 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18077 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18078 && CP_INTEGRAL_TYPE_P (tparm
))
18079 /* Convert the ARG to the type of PARM; the deduced non-type
18080 template argument must exactly match the types of the
18081 corresponding parameter. */
18082 arg
= fold (build_nop (tparm
, arg
));
18083 else if (uses_template_parms (tparm
))
18084 /* We haven't deduced the type of this parameter yet. Try again
18086 return unify_success (explain_p
);
18088 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18090 /* If ARG is a parameter pack or an expansion, we cannot unify
18091 against it unless PARM is also a parameter pack. */
18092 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18093 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18094 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18096 arg
= strip_typedefs_expr (arg
);
18097 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18098 return unify_success (explain_p
);
18102 /* A pointer-to-member constant can be unified only with
18103 another constant. */
18104 if (TREE_CODE (arg
) != PTRMEM_CST
)
18105 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18107 /* Just unify the class member. It would be useless (and possibly
18108 wrong, depending on the strict flags) to unify also
18109 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18110 arg refer to the same variable, even if through different
18111 classes. For instance:
18113 struct A { int x; };
18116 Unification of &A::x and &B::x must succeed. */
18117 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18118 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18123 if (!TYPE_PTR_P (arg
))
18124 return unify_type_mismatch (explain_p
, parm
, arg
);
18126 /* [temp.deduct.call]
18128 A can be another pointer or pointer to member type that can
18129 be converted to the deduced A via a qualification
18130 conversion (_conv.qual_).
18132 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18133 This will allow for additional cv-qualification of the
18134 pointed-to types if appropriate. */
18136 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18137 /* The derived-to-base conversion only persists through one
18138 level of pointers. */
18139 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
18141 return unify (tparms
, targs
, TREE_TYPE (parm
),
18142 TREE_TYPE (arg
), strict
, explain_p
);
18145 case REFERENCE_TYPE
:
18146 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
18147 return unify_type_mismatch (explain_p
, parm
, arg
);
18148 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18149 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18152 if (TREE_CODE (arg
) != ARRAY_TYPE
)
18153 return unify_type_mismatch (explain_p
, parm
, arg
);
18154 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
18155 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
18156 return unify_type_mismatch (explain_p
, parm
, arg
);
18157 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18158 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18159 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
18160 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18161 TYPE_DOMAIN (arg
), explain_p
);
18162 return unify_success (explain_p
);
18169 case ENUMERAL_TYPE
:
18172 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18173 return unify_type_mismatch (explain_p
, parm
, arg
);
18175 /* We have already checked cv-qualification at the top of the
18177 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
18178 return unify_type_mismatch (explain_p
, parm
, arg
);
18180 /* As far as unification is concerned, this wins. Later checks
18181 will invalidate it if necessary. */
18182 return unify_success (explain_p
);
18184 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
18185 /* Type INTEGER_CST can come from ordinary constant template args. */
18187 while (TREE_CODE (arg
) == NOP_EXPR
)
18188 arg
= TREE_OPERAND (arg
, 0);
18190 if (TREE_CODE (arg
) != INTEGER_CST
)
18191 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18192 return (tree_int_cst_equal (parm
, arg
)
18193 ? unify_success (explain_p
)
18194 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
18198 int i
, len
, argslen
;
18199 int parm_variadic_p
= 0;
18201 if (TREE_CODE (arg
) != TREE_VEC
)
18202 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18204 len
= TREE_VEC_LENGTH (parm
);
18205 argslen
= TREE_VEC_LENGTH (arg
);
18207 /* Check for pack expansions in the parameters. */
18208 for (i
= 0; i
< len
; ++i
)
18210 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
18213 /* We can unify against something with a trailing
18215 parm_variadic_p
= 1;
18217 /* [temp.deduct.type]/9: If the template argument list of
18218 P contains a pack expansion that is not the last
18219 template argument, the entire template argument list
18220 is a non-deduced context. */
18221 return unify_success (explain_p
);
18225 /* If we don't have enough arguments to satisfy the parameters
18226 (not counting the pack expression at the end), or we have
18227 too many arguments for a parameter list that doesn't end in
18228 a pack expression, we can't unify. */
18229 if (parm_variadic_p
18230 ? argslen
< len
- parm_variadic_p
18232 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
18234 /* Unify all of the parameters that precede the (optional)
18235 pack expression. */
18236 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18238 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18239 TREE_VEC_ELT (parm
, i
),
18240 TREE_VEC_ELT (arg
, i
),
18241 UNIFY_ALLOW_NONE
, explain_p
);
18243 if (parm_variadic_p
)
18244 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
18246 /*subr=*/true, explain_p
);
18247 return unify_success (explain_p
);
18252 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18253 return unify_type_mismatch (explain_p
, parm
, arg
);
18255 if (TYPE_PTRMEMFUNC_P (parm
))
18257 if (!TYPE_PTRMEMFUNC_P (arg
))
18258 return unify_type_mismatch (explain_p
, parm
, arg
);
18260 return unify (tparms
, targs
,
18261 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
18262 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
18263 strict
, explain_p
);
18265 else if (TYPE_PTRMEMFUNC_P (arg
))
18266 return unify_type_mismatch (explain_p
, parm
, arg
);
18268 if (CLASSTYPE_TEMPLATE_INFO (parm
))
18270 tree t
= NULL_TREE
;
18272 if (strict_in
& UNIFY_ALLOW_DERIVED
)
18274 /* First, we try to unify the PARM and ARG directly. */
18275 t
= try_class_unification (tparms
, targs
,
18276 parm
, arg
, explain_p
);
18280 /* Fallback to the special case allowed in
18281 [temp.deduct.call]:
18283 If P is a class, and P has the form
18284 template-id, then A can be a derived class of
18285 the deduced A. Likewise, if P is a pointer to
18286 a class of the form template-id, A can be a
18287 pointer to a derived class pointed to by the
18289 enum template_base_result r
;
18290 r
= get_template_base (tparms
, targs
, parm
, arg
,
18294 return unify_no_common_base (explain_p
, r
, parm
, arg
);
18297 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
18298 && (CLASSTYPE_TI_TEMPLATE (parm
)
18299 == CLASSTYPE_TI_TEMPLATE (arg
)))
18300 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18301 Then, we should unify `int' and `U'. */
18304 /* There's no chance of unification succeeding. */
18305 return unify_type_mismatch (explain_p
, parm
, arg
);
18307 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
18308 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
18310 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
18311 return unify_type_mismatch (explain_p
, parm
, arg
);
18312 return unify_success (explain_p
);
18315 case FUNCTION_TYPE
:
18317 unsigned int nargs
;
18322 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18323 return unify_type_mismatch (explain_p
, parm
, arg
);
18325 /* CV qualifications for methods can never be deduced, they must
18326 match exactly. We need to check them explicitly here,
18327 because type_unification_real treats them as any other
18328 cv-qualified parameter. */
18329 if (TREE_CODE (parm
) == METHOD_TYPE
18330 && (!check_cv_quals_for_unify
18332 class_of_this_parm (arg
),
18333 class_of_this_parm (parm
))))
18334 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18336 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18337 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18339 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18340 args
= XALLOCAVEC (tree
, nargs
);
18341 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18342 a
!= NULL_TREE
&& a
!= void_list_node
;
18343 a
= TREE_CHAIN (a
), ++i
)
18344 args
[i
] = TREE_VALUE (a
);
18347 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18348 args
, nargs
, 1, DEDUCE_EXACT
,
18349 LOOKUP_NORMAL
, NULL
, explain_p
);
18353 /* Unify a pointer to member with a pointer to member function, which
18354 deduces the type of the member as a function type. */
18355 if (TYPE_PTRMEMFUNC_P (arg
))
18357 /* Check top-level cv qualifiers */
18358 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18359 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18361 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18362 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18363 UNIFY_ALLOW_NONE
, explain_p
);
18365 /* Determine the type of the function we are unifying against. */
18366 tree fntype
= static_fn_type (arg
);
18368 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18371 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18372 return unify_type_mismatch (explain_p
, parm
, arg
);
18373 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18374 TYPE_OFFSET_BASETYPE (arg
),
18375 UNIFY_ALLOW_NONE
, explain_p
);
18376 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18377 strict
, explain_p
);
18380 if (DECL_TEMPLATE_PARM_P (parm
))
18381 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18382 if (arg
!= integral_constant_value (parm
))
18383 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18384 return unify_success (explain_p
);
18387 case TEMPLATE_DECL
:
18388 /* Matched cases are handled by the ARG == PARM test above. */
18389 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18392 /* A non-type template parameter that is a variable should be a
18393 an integral constant, in which case, it whould have been
18394 folded into its (constant) value. So we should not be getting
18395 a variable here. */
18396 gcc_unreachable ();
18398 case TYPE_ARGUMENT_PACK
:
18399 case NONTYPE_ARGUMENT_PACK
:
18400 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18401 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18404 case DECLTYPE_TYPE
:
18405 case UNDERLYING_TYPE
:
18406 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18407 or UNDERLYING_TYPE nodes. */
18408 return unify_success (explain_p
);
18411 /* Unification fails if we hit an error node. */
18412 return unify_invalid (explain_p
);
18415 if (REFERENCE_REF_P (parm
))
18416 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18417 strict
, explain_p
);
18421 /* An unresolved overload is a nondeduced context. */
18422 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18423 return unify_success (explain_p
);
18424 gcc_assert (EXPR_P (parm
));
18426 /* We must be looking at an expression. This can happen with
18430 void foo(S<I>, S<I + 2>);
18432 This is a "nondeduced context":
18436 The nondeduced contexts are:
18438 --A type that is a template-id in which one or more of
18439 the template-arguments is an expression that references
18440 a template-parameter.
18442 In these cases, we assume deduction succeeded, but don't
18443 actually infer any unifications. */
18445 if (!uses_template_parms (parm
)
18446 && !template_args_equal (parm
, arg
))
18447 return unify_expression_unequal (explain_p
, parm
, arg
);
18449 return unify_success (explain_p
);
18452 #undef RECUR_AND_CHECK_FAILURE
18454 /* Note that DECL can be defined in this translation unit, if
18458 mark_definable (tree decl
)
18461 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18462 FOR_EACH_CLONE (clone
, decl
)
18463 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18466 /* Called if RESULT is explicitly instantiated, or is a member of an
18467 explicitly instantiated class. */
18470 mark_decl_instantiated (tree result
, int extern_p
)
18472 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18474 /* If this entity has already been written out, it's too late to
18475 make any modifications. */
18476 if (TREE_ASM_WRITTEN (result
))
18479 /* For anonymous namespace we don't need to do anything. */
18480 if (decl_anon_ns_mem_p (result
))
18482 gcc_assert (!TREE_PUBLIC (result
));
18486 if (TREE_CODE (result
) != FUNCTION_DECL
)
18487 /* The TREE_PUBLIC flag for function declarations will have been
18488 set correctly by tsubst. */
18489 TREE_PUBLIC (result
) = 1;
18491 /* This might have been set by an earlier implicit instantiation. */
18492 DECL_COMDAT (result
) = 0;
18495 DECL_NOT_REALLY_EXTERN (result
) = 0;
18498 mark_definable (result
);
18499 mark_needed (result
);
18500 /* Always make artificials weak. */
18501 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18502 comdat_linkage (result
);
18503 /* For WIN32 we also want to put explicit instantiations in
18504 linkonce sections. */
18505 else if (TREE_PUBLIC (result
))
18506 maybe_make_one_only (result
);
18509 /* If EXTERN_P, then this function will not be emitted -- unless
18510 followed by an explicit instantiation, at which point its linkage
18511 will be adjusted. If !EXTERN_P, then this function will be
18512 emitted here. In neither circumstance do we want
18513 import_export_decl to adjust the linkage. */
18514 DECL_INTERFACE_KNOWN (result
) = 1;
18517 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18518 important template arguments. If any are missing, we check whether
18519 they're important by using error_mark_node for substituting into any
18520 args that were used for partial ordering (the ones between ARGS and END)
18521 and seeing if it bubbles up. */
18524 check_undeduced_parms (tree targs
, tree args
, tree end
)
18526 bool found
= false;
18528 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18529 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18532 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18536 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18537 if (substed
== error_mark_node
)
18543 /* Given two function templates PAT1 and PAT2, return:
18545 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18546 -1 if PAT2 is more specialized than PAT1.
18547 0 if neither is more specialized.
18549 LEN indicates the number of parameters we should consider
18550 (defaulted parameters should not be considered).
18552 The 1998 std underspecified function template partial ordering, and
18553 DR214 addresses the issue. We take pairs of arguments, one from
18554 each of the templates, and deduce them against each other. One of
18555 the templates will be more specialized if all the *other*
18556 template's arguments deduce against its arguments and at least one
18557 of its arguments *does* *not* deduce against the other template's
18558 corresponding argument. Deduction is done as for class templates.
18559 The arguments used in deduction have reference and top level cv
18560 qualifiers removed. Iff both arguments were originally reference
18561 types *and* deduction succeeds in both directions, an lvalue reference
18562 wins against an rvalue reference and otherwise the template
18563 with the more cv-qualified argument wins for that pairing (if
18564 neither is more cv-qualified, they both are equal). Unlike regular
18565 deduction, after all the arguments have been deduced in this way,
18566 we do *not* verify the deduced template argument values can be
18567 substituted into non-deduced contexts.
18569 The logic can be a bit confusing here, because we look at deduce1 and
18570 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18571 can find template arguments for pat1 to make arg1 look like arg2, that
18572 means that arg2 is at least as specialized as arg1. */
18575 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18577 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18578 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18579 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18580 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18581 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18582 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18583 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18584 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18585 tree origs1
, origs2
;
18586 bool lose1
= false;
18587 bool lose2
= false;
18589 /* Remove the this parameter from non-static member functions. If
18590 one is a non-static member function and the other is not a static
18591 member function, remove the first parameter from that function
18592 also. This situation occurs for operator functions where we
18593 locate both a member function (with this pointer) and non-member
18594 operator (with explicit first operand). */
18595 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18597 len
--; /* LEN is the number of significant arguments for DECL1 */
18598 args1
= TREE_CHAIN (args1
);
18599 if (!DECL_STATIC_FUNCTION_P (decl2
))
18600 args2
= TREE_CHAIN (args2
);
18602 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18604 args2
= TREE_CHAIN (args2
);
18605 if (!DECL_STATIC_FUNCTION_P (decl1
))
18608 args1
= TREE_CHAIN (args1
);
18612 /* If only one is a conversion operator, they are unordered. */
18613 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18616 /* Consider the return type for a conversion function */
18617 if (DECL_CONV_FN_P (decl1
))
18619 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18620 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18624 processing_template_decl
++;
18630 /* Stop when an ellipsis is seen. */
18631 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18633 tree arg1
= TREE_VALUE (args1
);
18634 tree arg2
= TREE_VALUE (args2
);
18635 int deduce1
, deduce2
;
18641 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18642 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18644 /* When both arguments are pack expansions, we need only
18645 unify the patterns themselves. */
18646 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18647 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18649 /* This is the last comparison we need to do. */
18653 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18655 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18656 arg1
= TREE_TYPE (arg1
);
18657 quals1
= cp_type_quals (arg1
);
18660 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18662 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18663 arg2
= TREE_TYPE (arg2
);
18664 quals2
= cp_type_quals (arg2
);
18667 arg1
= TYPE_MAIN_VARIANT (arg1
);
18668 arg2
= TYPE_MAIN_VARIANT (arg2
);
18670 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
18672 int i
, len2
= list_length (args2
);
18673 tree parmvec
= make_tree_vec (1);
18674 tree argvec
= make_tree_vec (len2
);
18677 /* Setup the parameter vector, which contains only ARG1. */
18678 TREE_VEC_ELT (parmvec
, 0) = arg1
;
18680 /* Setup the argument vector, which contains the remaining
18682 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
18683 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18685 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
18686 argvec
, DEDUCE_EXACT
,
18687 /*subr=*/true, /*explain_p=*/false)
18690 /* We cannot deduce in the other direction, because ARG1 is
18691 a pack expansion but ARG2 is not. */
18694 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18696 int i
, len1
= list_length (args1
);
18697 tree parmvec
= make_tree_vec (1);
18698 tree argvec
= make_tree_vec (len1
);
18701 /* Setup the parameter vector, which contains only ARG1. */
18702 TREE_VEC_ELT (parmvec
, 0) = arg2
;
18704 /* Setup the argument vector, which contains the remaining
18706 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
18707 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18709 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
18710 argvec
, DEDUCE_EXACT
,
18711 /*subr=*/true, /*explain_p=*/false)
18714 /* We cannot deduce in the other direction, because ARG2 is
18715 a pack expansion but ARG1 is not.*/
18721 /* The normal case, where neither argument is a pack
18723 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
18724 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18726 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
18727 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18731 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18732 arg2, then arg2 is not as specialized as arg1. */
18738 /* "If, for a given type, deduction succeeds in both directions
18739 (i.e., the types are identical after the transformations above)
18740 and both P and A were reference types (before being replaced with
18741 the type referred to above):
18742 - if the type from the argument template was an lvalue reference and
18743 the type from the parameter template was not, the argument type is
18744 considered to be more specialized than the other; otherwise,
18745 - if the type from the argument template is more cv-qualified
18746 than the type from the parameter template (as described above),
18747 the argument type is considered to be more specialized than the other;
18749 - neither type is more specialized than the other." */
18751 if (deduce1
&& deduce2
)
18753 if (ref1
&& ref2
&& ref1
!= ref2
)
18760 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
18762 if ((quals1
& quals2
) == quals2
)
18764 if ((quals1
& quals2
) == quals1
)
18769 if (lose1
&& lose2
)
18770 /* We've failed to deduce something in either direction.
18771 These must be unordered. */
18774 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18775 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18776 /* We have already processed all of the arguments in our
18777 handing of the pack expansion type. */
18780 args1
= TREE_CHAIN (args1
);
18781 args2
= TREE_CHAIN (args2
);
18784 /* "In most cases, all template parameters must have values in order for
18785 deduction to succeed, but for partial ordering purposes a template
18786 parameter may remain without a value provided it is not used in the
18787 types being used for partial ordering."
18789 Thus, if we are missing any of the targs1 we need to substitute into
18790 origs1, then pat2 is not as specialized as pat1. This can happen when
18791 there is a nondeduced context. */
18792 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
18794 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
18797 processing_template_decl
--;
18799 /* All things being equal, if the next argument is a pack expansion
18800 for one function but not for the other, prefer the
18801 non-variadic function. FIXME this is bogus; see c++/41958. */
18803 && args1
&& TREE_VALUE (args1
)
18804 && args2
&& TREE_VALUE (args2
))
18806 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
18807 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
18810 if (lose1
== lose2
)
18818 /* Determine which of two partial specializations of TMPL is more
18821 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
18822 to the first partial specialization. The TREE_VALUE is the
18823 innermost set of template parameters for the partial
18824 specialization. PAT2 is similar, but for the second template.
18826 Return 1 if the first partial specialization is more specialized;
18827 -1 if the second is more specialized; 0 if neither is more
18830 See [temp.class.order] for information about determining which of
18831 two templates is more specialized. */
18834 more_specialized_class (tree tmpl
, tree pat1
, tree pat2
)
18839 bool any_deductions
= false;
18841 tmpl1
= TREE_TYPE (pat1
);
18842 tmpl2
= TREE_TYPE (pat2
);
18844 /* Just like what happens for functions, if we are ordering between
18845 different class template specializations, we may encounter dependent
18846 types in the arguments, and we need our dependency check functions
18847 to behave correctly. */
18848 ++processing_template_decl
;
18849 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat1
),
18850 CLASSTYPE_TI_ARGS (tmpl1
),
18851 CLASSTYPE_TI_ARGS (tmpl2
));
18855 any_deductions
= true;
18858 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat2
),
18859 CLASSTYPE_TI_ARGS (tmpl2
),
18860 CLASSTYPE_TI_ARGS (tmpl1
));
18864 any_deductions
= true;
18866 --processing_template_decl
;
18868 /* In the case of a tie where at least one of the class templates
18869 has a parameter pack at the end, the template with the most
18870 non-packed parameters wins. */
18873 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
18874 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
18876 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
18877 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
18878 int len1
= TREE_VEC_LENGTH (args1
);
18879 int len2
= TREE_VEC_LENGTH (args2
);
18881 /* We don't count the pack expansion at the end. */
18882 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
18884 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
18889 else if (len1
< len2
)
18896 /* Return the template arguments that will produce the function signature
18897 DECL from the function template FN, with the explicit template
18898 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
18899 also match. Return NULL_TREE if no satisfactory arguments could be
18903 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
18905 int ntparms
= DECL_NTPARMS (fn
);
18906 tree targs
= make_tree_vec (ntparms
);
18907 tree decl_type
= TREE_TYPE (decl
);
18908 tree decl_arg_types
;
18910 unsigned int nargs
, ix
;
18913 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
18915 /* Never do unification on the 'this' parameter. */
18916 decl_arg_types
= skip_artificial_parms_for (decl
,
18917 TYPE_ARG_TYPES (decl_type
));
18919 nargs
= list_length (decl_arg_types
);
18920 args
= XALLOCAVEC (tree
, nargs
);
18921 for (arg
= decl_arg_types
, ix
= 0;
18922 arg
!= NULL_TREE
&& arg
!= void_list_node
;
18923 arg
= TREE_CHAIN (arg
), ++ix
)
18924 args
[ix
] = TREE_VALUE (arg
);
18926 if (fn_type_unification (fn
, explicit_args
, targs
,
18928 (check_rettype
|| DECL_CONV_FN_P (fn
)
18929 ? TREE_TYPE (decl_type
) : NULL_TREE
),
18930 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
18932 == error_mark_node
)
18938 /* Return the innermost template arguments that, when applied to a partial
18939 specialization of TMPL whose innermost template parameters are
18940 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
18943 For example, suppose we have:
18945 template <class T, class U> struct S {};
18946 template <class T> struct S<T*, int> {};
18948 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
18949 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
18950 int}. The resulting vector will be {double}, indicating that `T'
18951 is bound to `double'. */
18954 get_class_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
18956 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
18958 tree innermost_deduced_args
;
18960 innermost_deduced_args
= make_tree_vec (ntparms
);
18961 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18963 deduced_args
= copy_node (args
);
18964 SET_TMPL_ARGS_LEVEL (deduced_args
,
18965 TMPL_ARGS_DEPTH (deduced_args
),
18966 innermost_deduced_args
);
18969 deduced_args
= innermost_deduced_args
;
18971 if (unify (tparms
, deduced_args
,
18972 INNERMOST_TEMPLATE_ARGS (spec_args
),
18973 INNERMOST_TEMPLATE_ARGS (args
),
18974 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
18977 for (i
= 0; i
< ntparms
; ++i
)
18978 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
18981 /* Verify that nondeduced template arguments agree with the type
18982 obtained from argument deduction.
18986 struct A { typedef int X; };
18987 template <class T, class U> struct C {};
18988 template <class T> struct C<T, typename T::X> {};
18990 Then with the instantiation `C<A, int>', we can deduce that
18991 `T' is `A' but unify () does not check whether `typename T::X'
18993 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
18994 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18996 tf_none
, false, false);
18997 if (spec_args
== error_mark_node
18998 /* We only need to check the innermost arguments; the other
18999 arguments will always agree. */
19000 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
19001 INNERMOST_TEMPLATE_ARGS (args
)))
19004 /* Now that we have bindings for all of the template arguments,
19005 ensure that the arguments deduced for the template template
19006 parameters have compatible template parameter lists. See the use
19007 of template_template_parm_bindings_ok_p in fn_type_unification
19008 for more information. */
19009 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
19012 return deduced_args
;
19015 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
19016 Return the TREE_LIST node with the most specialized template, if
19017 any. If there is no most specialized template, the error_mark_node
19020 Note that this function does not look at, or modify, the
19021 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
19022 returned is one of the elements of INSTANTIATIONS, callers may
19023 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
19024 and retrieve it from the value returned. */
19027 most_specialized_instantiation (tree templates
)
19031 ++processing_template_decl
;
19034 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
19038 if (get_bindings (TREE_VALUE (champ
),
19039 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
19040 NULL_TREE
, /*check_ret=*/true))
19043 if (get_bindings (TREE_VALUE (fn
),
19044 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19045 NULL_TREE
, /*check_ret=*/true))
19052 /* Equally specialized, move to next function. If there
19053 is no next function, nothing's most specialized. */
19054 fn
= TREE_CHAIN (fn
);
19062 /* Now verify that champ is better than everything earlier in the
19063 instantiation list. */
19064 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
19065 if (get_bindings (TREE_VALUE (champ
),
19066 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
19067 NULL_TREE
, /*check_ret=*/true)
19068 || !get_bindings (TREE_VALUE (fn
),
19069 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19070 NULL_TREE
, /*check_ret=*/true))
19076 processing_template_decl
--;
19079 return error_mark_node
;
19084 /* If DECL is a specialization of some template, return the most
19085 general such template. Otherwise, returns NULL_TREE.
19087 For example, given:
19089 template <class T> struct S { template <class U> void f(U); };
19091 if TMPL is `template <class U> void S<int>::f(U)' this will return
19092 the full template. This function will not trace past partial
19093 specializations, however. For example, given in addition:
19095 template <class T> struct S<T*> { template <class U> void f(U); };
19097 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19098 `template <class T> template <class U> S<T*>::f(U)'. */
19101 most_general_template (tree decl
)
19103 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19105 if (tree tinfo
= get_template_info (decl
))
19106 decl
= TI_TEMPLATE (tinfo
);
19107 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19108 template friend, or a FIELD_DECL for a capture pack. */
19109 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19113 /* Look for more and more general templates. */
19114 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
19116 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
19117 (See cp-tree.h for details.) */
19118 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
19121 if (CLASS_TYPE_P (TREE_TYPE (decl
))
19122 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
19125 /* Stop if we run into an explicitly specialized class template. */
19126 if (!DECL_NAMESPACE_SCOPE_P (decl
)
19127 && DECL_CONTEXT (decl
)
19128 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
19131 decl
= DECL_TI_TEMPLATE (decl
);
19137 /* Return the most specialized of the class template partial
19138 specializations which can produce TYPE, a specialization of some class
19139 template. The value returned is actually a TREE_LIST; the TREE_TYPE is
19140 a _TYPE node corresponding to the partial specialization, while the
19141 TREE_PURPOSE is the set of template arguments that must be
19142 substituted into the TREE_TYPE in order to generate TYPE.
19144 If the choice of partial specialization is ambiguous, a diagnostic
19145 is issued, and the error_mark_node is returned. If there are no
19146 partial specializations matching TYPE, then NULL_TREE is
19147 returned, indicating that the primary template should be used. */
19150 most_specialized_class (tree type
, tsubst_flags_t complain
)
19152 tree list
= NULL_TREE
;
19157 tree outer_args
= NULL_TREE
;
19159 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
19160 tree main_tmpl
= most_general_template (tmpl
);
19161 tree args
= CLASSTYPE_TI_ARGS (type
);
19163 /* For determining which partial specialization to use, only the
19164 innermost args are interesting. */
19165 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19167 outer_args
= strip_innermost_template_args (args
, 1);
19168 args
= INNERMOST_TEMPLATE_ARGS (args
);
19171 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
19173 tree partial_spec_args
;
19175 tree spec_tmpl
= TREE_VALUE (t
);
19176 tree orig_parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19178 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
19180 ++processing_template_decl
;
19184 /* Discard the outer levels of args, and then substitute in the
19185 template args from the enclosing class. */
19186 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
19187 partial_spec_args
= tsubst_template_args
19188 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
19190 /* And the same for the partial specialization TEMPLATE_DECL. */
19191 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
19194 partial_spec_args
=
19195 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19198 /*require_all_args=*/true,
19199 /*use_default_args=*/true);
19201 --processing_template_decl
;
19203 if (partial_spec_args
== error_mark_node
)
19204 return error_mark_node
;
19205 if (spec_tmpl
== error_mark_node
)
19206 return error_mark_node
;
19208 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19209 spec_args
= get_class_bindings (tmpl
, parms
,
19215 spec_args
= add_to_template_args (outer_args
, spec_args
);
19216 list
= tree_cons (spec_args
, orig_parms
, list
);
19217 TREE_TYPE (list
) = TREE_TYPE (t
);
19224 ambiguous_p
= false;
19227 t
= TREE_CHAIN (t
);
19228 for (; t
; t
= TREE_CHAIN (t
))
19230 fate
= more_specialized_class (tmpl
, champ
, t
);
19237 t
= TREE_CHAIN (t
);
19240 ambiguous_p
= true;
19249 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
19251 fate
= more_specialized_class (tmpl
, champ
, t
);
19254 ambiguous_p
= true;
19262 char *spaces
= NULL
;
19263 if (!(complain
& tf_error
))
19264 return error_mark_node
;
19265 error ("ambiguous class template instantiation for %q#T", type
);
19266 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
19267 for (t
= list
; t
; t
= TREE_CHAIN (t
))
19269 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
19270 spaces
= spaces
? spaces
: get_spaces (str
);
19273 return error_mark_node
;
19279 /* Explicitly instantiate DECL. */
19282 do_decl_instantiation (tree decl
, tree storage
)
19284 tree result
= NULL_TREE
;
19287 if (!decl
|| decl
== error_mark_node
)
19288 /* An error occurred, for which grokdeclarator has already issued
19289 an appropriate message. */
19291 else if (! DECL_LANG_SPECIFIC (decl
))
19293 error ("explicit instantiation of non-template %q#D", decl
);
19297 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
19298 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
19300 if (VAR_P (decl
) && !var_templ
)
19302 /* There is an asymmetry here in the way VAR_DECLs and
19303 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19304 the latter, the DECL we get back will be marked as a
19305 template instantiation, and the appropriate
19306 DECL_TEMPLATE_INFO will be set up. This does not happen for
19307 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19308 should handle VAR_DECLs as it currently handles
19310 if (!DECL_CLASS_SCOPE_P (decl
))
19312 error ("%qD is not a static data member of a class template", decl
);
19315 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
19316 if (!result
|| !VAR_P (result
))
19318 error ("no matching template for %qD found", decl
);
19321 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
19323 error ("type %qT for explicit instantiation %qD does not match "
19324 "declared type %qT", TREE_TYPE (result
), decl
,
19329 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
19331 error ("explicit instantiation of %q#D", decl
);
19337 /* Check for various error cases. Note that if the explicit
19338 instantiation is valid the RESULT will currently be marked as an
19339 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19340 until we get here. */
19342 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19344 /* DR 259 [temp.spec].
19346 Both an explicit instantiation and a declaration of an explicit
19347 specialization shall not appear in a program unless the explicit
19348 instantiation follows a declaration of the explicit specialization.
19350 For a given set of template parameters, if an explicit
19351 instantiation of a template appears after a declaration of an
19352 explicit specialization for that template, the explicit
19353 instantiation has no effect. */
19356 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19360 No program shall explicitly instantiate any template more
19363 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19364 the first instantiation was `extern' and the second is not,
19365 and EXTERN_P for the opposite case. */
19366 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19367 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19368 /* If an "extern" explicit instantiation follows an ordinary
19369 explicit instantiation, the template is instantiated. */
19373 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19375 error ("no matching template for %qD found", result
);
19378 else if (!DECL_TEMPLATE_INFO (result
))
19380 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19384 if (storage
== NULL_TREE
)
19386 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19388 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19389 pedwarn (input_location
, OPT_Wpedantic
,
19390 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19395 error ("storage class %qD applied to template instantiation", storage
);
19397 check_explicit_instantiation_namespace (result
);
19398 mark_decl_instantiated (result
, extern_p
);
19400 instantiate_decl (result
, /*defer_ok=*/1,
19401 /*expl_inst_class_mem_p=*/false);
19405 mark_class_instantiated (tree t
, int extern_p
)
19407 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19408 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19409 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19410 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19413 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19414 rest_of_type_compilation (t
, 1);
19418 /* Called from do_type_instantiation through binding_table_foreach to
19419 do recursive instantiation for the type bound in ENTRY. */
19421 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19423 tree storage
= *(tree
*) data
;
19425 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19426 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19427 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19430 /* Called from do_type_instantiation to instantiate a member
19431 (a member function or a static member variable) of an
19432 explicitly instantiated class template. */
19434 instantiate_class_member (tree decl
, int extern_p
)
19436 mark_decl_instantiated (decl
, extern_p
);
19438 instantiate_decl (decl
, /*defer_ok=*/1,
19439 /*expl_inst_class_mem_p=*/true);
19442 /* Perform an explicit instantiation of template class T. STORAGE, if
19443 non-null, is the RID for extern, inline or static. COMPLAIN is
19444 nonzero if this is called from the parser, zero if called recursively,
19445 since the standard is unclear (as detailed below). */
19448 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19453 int previous_instantiation_extern_p
= 0;
19455 if (TREE_CODE (t
) == TYPE_DECL
)
19458 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19461 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19463 error ("explicit instantiation of non-class template %qD", tmpl
);
19465 error ("explicit instantiation of non-template type %qT", t
);
19471 if (!COMPLETE_TYPE_P (t
))
19473 if (complain
& tf_error
)
19474 error ("explicit instantiation of %q#T before definition of template",
19479 if (storage
!= NULL_TREE
)
19481 if (!in_system_header_at (input_location
))
19483 if (storage
== ridpointers
[(int) RID_EXTERN
])
19485 if (cxx_dialect
== cxx98
)
19486 pedwarn (input_location
, OPT_Wpedantic
,
19487 "ISO C++ 1998 forbids the use of %<extern%> on "
19488 "explicit instantiations");
19491 pedwarn (input_location
, OPT_Wpedantic
,
19492 "ISO C++ forbids the use of %qE"
19493 " on explicit instantiations", storage
);
19496 if (storage
== ridpointers
[(int) RID_INLINE
])
19498 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19500 else if (storage
== ridpointers
[(int) RID_STATIC
])
19504 error ("storage class %qD applied to template instantiation",
19510 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19512 /* DR 259 [temp.spec].
19514 Both an explicit instantiation and a declaration of an explicit
19515 specialization shall not appear in a program unless the explicit
19516 instantiation follows a declaration of the explicit specialization.
19518 For a given set of template parameters, if an explicit
19519 instantiation of a template appears after a declaration of an
19520 explicit specialization for that template, the explicit
19521 instantiation has no effect. */
19524 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19528 No program shall explicitly instantiate any template more
19531 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19532 instantiation was `extern'. If EXTERN_P then the second is.
19533 These cases are OK. */
19534 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19536 if (!previous_instantiation_extern_p
&& !extern_p
19537 && (complain
& tf_error
))
19538 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19540 /* If we've already instantiated the template, just return now. */
19541 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19545 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19546 mark_class_instantiated (t
, extern_p
);
19554 /* In contrast to implicit instantiation, where only the
19555 declarations, and not the definitions, of members are
19556 instantiated, we have here:
19560 The explicit instantiation of a class template specialization
19561 implies the instantiation of all of its members not
19562 previously explicitly specialized in the translation unit
19563 containing the explicit instantiation.
19565 Of course, we can't instantiate member template classes, since
19566 we don't have any arguments for them. Note that the standard
19567 is unclear on whether the instantiation of the members are
19568 *explicit* instantiations or not. However, the most natural
19569 interpretation is that it should be an explicit instantiation. */
19572 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19573 if (TREE_CODE (tmp
) == FUNCTION_DECL
19574 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19575 instantiate_class_member (tmp
, extern_p
);
19577 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19578 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19579 instantiate_class_member (tmp
, extern_p
);
19581 if (CLASSTYPE_NESTED_UTDS (t
))
19582 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19583 bt_instantiate_type_proc
, &storage
);
19587 /* Given a function DECL, which is a specialization of TMPL, modify
19588 DECL to be a re-instantiation of TMPL with the same template
19589 arguments. TMPL should be the template into which tsubst'ing
19590 should occur for DECL, not the most general template.
19592 One reason for doing this is a scenario like this:
19595 void f(const T&, int i);
19597 void g() { f(3, 7); }
19600 void f(const T& t, const int i) { }
19602 Note that when the template is first instantiated, with
19603 instantiate_template, the resulting DECL will have no name for the
19604 first parameter, and the wrong type for the second. So, when we go
19605 to instantiate the DECL, we regenerate it. */
19608 regenerate_decl_from_template (tree decl
, tree tmpl
)
19610 /* The arguments used to instantiate DECL, from the most general
19615 args
= DECL_TI_ARGS (decl
);
19616 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19618 /* Make sure that we can see identifiers, and compute access
19620 push_access_scope (decl
);
19622 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19630 args_depth
= TMPL_ARGS_DEPTH (args
);
19631 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19632 if (args_depth
> parms_depth
)
19633 args
= get_innermost_template_args (args
, parms_depth
);
19635 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19636 args
, tf_error
, NULL_TREE
,
19637 /*defer_ok*/false);
19638 if (specs
&& specs
!= error_mark_node
)
19639 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19642 /* Merge parameter declarations. */
19643 decl_parm
= skip_artificial_parms_for (decl
,
19644 DECL_ARGUMENTS (decl
));
19646 = skip_artificial_parms_for (code_pattern
,
19647 DECL_ARGUMENTS (code_pattern
));
19648 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
19653 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19654 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
19655 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
19657 parm_type
= type_decays_to (parm_type
);
19658 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19659 TREE_TYPE (decl_parm
) = parm_type
;
19660 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19661 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19663 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19664 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19666 decl_parm
= DECL_CHAIN (decl_parm
);
19667 pattern_parm
= DECL_CHAIN (pattern_parm
);
19669 /* Merge any parameters that match with the function parameter
19671 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
19674 tree expanded_types
;
19675 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19676 the parameters in this function parameter pack. */
19677 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
19678 args
, tf_error
, NULL_TREE
);
19679 len
= TREE_VEC_LENGTH (expanded_types
);
19680 for (i
= 0; i
< len
; i
++)
19685 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19686 /* Rename the parameter to include the index. */
19687 DECL_NAME (decl_parm
) =
19688 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
19689 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
19690 parm_type
= type_decays_to (parm_type
);
19691 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19692 TREE_TYPE (decl_parm
) = parm_type
;
19693 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19694 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19696 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19697 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19699 decl_parm
= DECL_CHAIN (decl_parm
);
19702 /* Merge additional specifiers from the CODE_PATTERN. */
19703 if (DECL_DECLARED_INLINE_P (code_pattern
)
19704 && !DECL_DECLARED_INLINE_P (decl
))
19705 DECL_DECLARED_INLINE_P (decl
) = 1;
19707 else if (VAR_P (decl
))
19709 DECL_INITIAL (decl
) =
19710 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
19711 tf_error
, DECL_TI_TEMPLATE (decl
),
19712 /*integral_constant_expression_p=*/false);
19713 if (VAR_HAD_UNKNOWN_BOUND (decl
))
19714 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
19715 tf_error
, DECL_TI_TEMPLATE (decl
));
19718 gcc_unreachable ();
19720 pop_access_scope (decl
);
19723 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19724 substituted to get DECL. */
19727 template_for_substitution (tree decl
)
19729 tree tmpl
= DECL_TI_TEMPLATE (decl
);
19731 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19732 for the instantiation. This is not always the most general
19733 template. Consider, for example:
19736 struct S { template <class U> void f();
19737 template <> void f<int>(); };
19739 and an instantiation of S<double>::f<int>. We want TD to be the
19740 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19741 while (/* An instantiation cannot have a definition, so we need a
19742 more general template. */
19743 DECL_TEMPLATE_INSTANTIATION (tmpl
)
19744 /* We must also deal with friend templates. Given:
19746 template <class T> struct S {
19747 template <class U> friend void f() {};
19750 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19751 so far as the language is concerned, but that's still
19752 where we get the pattern for the instantiation from. On
19753 other hand, if the definition comes outside the class, say:
19755 template <class T> struct S {
19756 template <class U> friend void f();
19758 template <class U> friend void f() {}
19760 we don't need to look any further. That's what the check for
19761 DECL_INITIAL is for. */
19762 || (TREE_CODE (decl
) == FUNCTION_DECL
19763 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
19764 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
19766 /* The present template, TD, should not be a definition. If it
19767 were a definition, we should be using it! Note that we
19768 cannot restructure the loop to just keep going until we find
19769 a template with a definition, since that might go too far if
19770 a specialization was declared, but not defined. */
19772 /* Fetch the more general template. */
19773 tmpl
= DECL_TI_TEMPLATE (tmpl
);
19779 /* Returns true if we need to instantiate this template instance even if we
19780 know we aren't going to emit it.. */
19783 always_instantiate_p (tree decl
)
19785 /* We always instantiate inline functions so that we can inline them. An
19786 explicit instantiation declaration prohibits implicit instantiation of
19787 non-inline functions. With high levels of optimization, we would
19788 normally inline non-inline functions -- but we're not allowed to do
19789 that for "extern template" functions. Therefore, we check
19790 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19791 return ((TREE_CODE (decl
) == FUNCTION_DECL
19792 && (DECL_DECLARED_INLINE_P (decl
)
19793 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
19794 /* And we need to instantiate static data members so that
19795 their initializers are available in integral constant
19798 && decl_maybe_constant_var_p (decl
)));
19801 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19802 instantiate it now, modifying TREE_TYPE (fn). */
19805 maybe_instantiate_noexcept (tree fn
)
19807 tree fntype
, spec
, noex
, clone
;
19809 /* Don't instantiate a noexcept-specification from template context. */
19810 if (processing_template_decl
)
19813 if (DECL_CLONED_FUNCTION_P (fn
))
19814 fn
= DECL_CLONED_FUNCTION (fn
);
19815 fntype
= TREE_TYPE (fn
);
19816 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
19818 if (!spec
|| !TREE_PURPOSE (spec
))
19821 noex
= TREE_PURPOSE (spec
);
19823 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
19825 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
19826 spec
= get_defaulted_eh_spec (fn
);
19827 else if (push_tinst_level (fn
))
19829 push_access_scope (fn
);
19830 push_deferring_access_checks (dk_no_deferred
);
19831 input_location
= DECL_SOURCE_LOCATION (fn
);
19832 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
19833 DEFERRED_NOEXCEPT_ARGS (noex
),
19834 tf_warning_or_error
, fn
,
19835 /*function_p=*/false,
19836 /*integral_constant_expression_p=*/true);
19837 pop_deferring_access_checks ();
19838 pop_access_scope (fn
);
19839 pop_tinst_level ();
19840 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
19841 if (spec
== error_mark_node
)
19842 spec
= noexcept_false_spec
;
19845 spec
= noexcept_false_spec
;
19847 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
19850 FOR_EACH_CLONE (clone
, fn
)
19852 if (TREE_TYPE (clone
) == fntype
)
19853 TREE_TYPE (clone
) = TREE_TYPE (fn
);
19855 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
19859 /* Produce the definition of D, a _DECL generated from a template. If
19860 DEFER_OK is nonzero, then we don't have to actually do the
19861 instantiation now; we just have to do it sometime. Normally it is
19862 an error if this is an explicit instantiation but D is undefined.
19863 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
19864 explicitly instantiated class template. */
19867 instantiate_decl (tree d
, int defer_ok
,
19868 bool expl_inst_class_mem_p
)
19870 tree tmpl
= DECL_TI_TEMPLATE (d
);
19877 bool pattern_defined
;
19878 location_t saved_loc
= input_location
;
19879 int saved_unevaluated_operand
= cp_unevaluated_operand
;
19880 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
19886 /* This function should only be used to instantiate templates for
19887 functions and static member variables. */
19888 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
19890 /* Variables are never deferred; if instantiation is required, they
19891 are instantiated right away. That allows for better code in the
19892 case that an expression refers to the value of the variable --
19893 if the variable has a constant value the referring expression can
19894 take advantage of that fact. */
19896 || DECL_DECLARED_CONSTEXPR_P (d
))
19899 /* Don't instantiate cloned functions. Instead, instantiate the
19900 functions they cloned. */
19901 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
19902 d
= DECL_CLONED_FUNCTION (d
);
19904 if (DECL_TEMPLATE_INSTANTIATED (d
)
19905 || (TREE_CODE (d
) == FUNCTION_DECL
19906 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
19907 || DECL_TEMPLATE_SPECIALIZATION (d
))
19908 /* D has already been instantiated or explicitly specialized, so
19909 there's nothing for us to do here.
19911 It might seem reasonable to check whether or not D is an explicit
19912 instantiation, and, if so, stop here. But when an explicit
19913 instantiation is deferred until the end of the compilation,
19914 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
19915 the instantiation. */
19918 /* Check to see whether we know that this template will be
19919 instantiated in some other file, as with "extern template"
19921 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
19923 /* In general, we do not instantiate such templates. */
19924 if (external_p
&& !always_instantiate_p (d
))
19927 gen_tmpl
= most_general_template (tmpl
);
19928 gen_args
= DECL_TI_ARGS (d
);
19930 if (tmpl
!= gen_tmpl
)
19931 /* We should already have the extra args. */
19932 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
19933 == TMPL_ARGS_DEPTH (gen_args
));
19934 /* And what's in the hash table should match D. */
19935 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
19936 || spec
== NULL_TREE
);
19938 /* This needs to happen before any tsubsting. */
19939 if (! push_tinst_level (d
))
19942 timevar_push (TV_TEMPLATE_INST
);
19944 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
19945 for the instantiation. */
19946 td
= template_for_substitution (d
);
19947 code_pattern
= DECL_TEMPLATE_RESULT (td
);
19949 /* We should never be trying to instantiate a member of a class
19950 template or partial specialization. */
19951 gcc_assert (d
!= code_pattern
);
19953 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
19954 || DECL_TEMPLATE_SPECIALIZATION (td
))
19955 /* In the case of a friend template whose definition is provided
19956 outside the class, we may have too many arguments. Drop the
19957 ones we don't need. The same is true for specializations. */
19958 args
= get_innermost_template_args
19959 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
19963 if (TREE_CODE (d
) == FUNCTION_DECL
)
19965 deleted_p
= DECL_DELETED_FN (code_pattern
);
19966 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
19967 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
19973 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
19976 /* We may be in the middle of deferred access check. Disable it now. */
19977 push_deferring_access_checks (dk_no_deferred
);
19979 /* Unless an explicit instantiation directive has already determined
19980 the linkage of D, remember that a definition is available for
19982 if (pattern_defined
19983 && !DECL_INTERFACE_KNOWN (d
)
19984 && !DECL_NOT_REALLY_EXTERN (d
))
19985 mark_definable (d
);
19987 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
19988 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
19989 input_location
= DECL_SOURCE_LOCATION (d
);
19991 /* If D is a member of an explicitly instantiated class template,
19992 and no definition is available, treat it like an implicit
19994 if (!pattern_defined
&& expl_inst_class_mem_p
19995 && DECL_EXPLICIT_INSTANTIATION (d
))
19997 /* Leave linkage flags alone on instantiations with anonymous
19999 if (TREE_PUBLIC (d
))
20001 DECL_NOT_REALLY_EXTERN (d
) = 0;
20002 DECL_INTERFACE_KNOWN (d
) = 0;
20004 SET_DECL_IMPLICIT_INSTANTIATION (d
);
20007 /* Defer all other templates, unless we have been explicitly
20008 forbidden from doing so. */
20009 if (/* If there is no definition, we cannot instantiate the
20012 /* If it's OK to postpone instantiation, do so. */
20014 /* If this is a static data member that will be defined
20015 elsewhere, we don't want to instantiate the entire data
20016 member, but we do want to instantiate the initializer so that
20017 we can substitute that elsewhere. */
20018 || (external_p
&& VAR_P (d
))
20019 /* Handle here a deleted function too, avoid generating
20020 its body (c++/61080). */
20023 /* The definition of the static data member is now required so
20024 we must substitute the initializer. */
20026 && !DECL_INITIAL (d
)
20027 && DECL_INITIAL (code_pattern
))
20031 bool const_init
= false;
20032 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20034 ns
= decl_namespace_context (d
);
20035 push_nested_namespace (ns
);
20037 push_nested_class (DECL_CONTEXT (d
));
20038 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
20040 tf_warning_or_error
, NULL_TREE
,
20041 /*integral_constant_expression_p=*/false);
20042 /* If instantiating the initializer involved instantiating this
20043 again, don't call cp_finish_decl twice. */
20044 if (!DECL_INITIAL (d
))
20046 /* Make sure the initializer is still constant, in case of
20047 circular dependency (template/instantiate6.C). */
20049 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20050 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
20051 /*asmspec_tree=*/NULL_TREE
,
20052 LOOKUP_ONLYCONVERTING
);
20055 pop_nested_class ();
20056 pop_nested_namespace (ns
);
20059 /* We restore the source position here because it's used by
20060 add_pending_template. */
20061 input_location
= saved_loc
;
20063 if (at_eof
&& !pattern_defined
20064 && DECL_EXPLICIT_INSTANTIATION (d
)
20065 && DECL_NOT_REALLY_EXTERN (d
))
20068 The definition of a non-exported function template, a
20069 non-exported member function template, or a non-exported
20070 member function or static data member of a class template
20071 shall be present in every translation unit in which it is
20072 explicitly instantiated. */
20073 permerror (input_location
, "explicit instantiation of %qD "
20074 "but no definition available", d
);
20076 /* If we're in unevaluated context, we just wanted to get the
20077 constant value; this isn't an odr use, so don't queue
20078 a full instantiation. */
20079 if (cp_unevaluated_operand
!= 0)
20081 /* ??? Historically, we have instantiated inline functions, even
20082 when marked as "extern template". */
20083 if (!(external_p
&& VAR_P (d
)))
20084 add_pending_template (d
);
20087 /* Tell the repository that D is available in this translation unit
20088 -- and see if it is supposed to be instantiated here. */
20089 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
20091 /* In a PCH file, despite the fact that the repository hasn't
20092 requested instantiation in the PCH it is still possible that
20093 an instantiation will be required in a file that includes the
20096 add_pending_template (d
);
20097 /* Instantiate inline functions so that the inliner can do its
20098 job, even though we'll not be emitting a copy of this
20100 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
20104 fn_context
= decl_function_context (d
);
20105 nested
= (current_function_decl
!= NULL_TREE
);
20107 push_to_top_level ();
20111 push_function_context ();
20112 cp_unevaluated_operand
= 0;
20113 c_inhibit_evaluation_warnings
= 0;
20116 /* Mark D as instantiated so that recursive calls to
20117 instantiate_decl do not try to instantiate it again. */
20118 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
20120 /* Regenerate the declaration in case the template has been modified
20121 by a subsequent redeclaration. */
20122 regenerate_decl_from_template (d
, td
);
20124 /* We already set the file and line above. Reset them now in case
20125 they changed as a result of calling regenerate_decl_from_template. */
20126 input_location
= DECL_SOURCE_LOCATION (d
);
20131 bool const_init
= false;
20133 /* Clear out DECL_RTL; whatever was there before may not be right
20134 since we've reset the type of the declaration. */
20135 SET_DECL_RTL (d
, NULL
);
20136 DECL_IN_AGGR_P (d
) = 0;
20138 /* The initializer is placed in DECL_INITIAL by
20139 regenerate_decl_from_template so we don't need to
20140 push/pop_access_scope again here. Pull it out so that
20141 cp_finish_decl can process it. */
20142 init
= DECL_INITIAL (d
);
20143 DECL_INITIAL (d
) = NULL_TREE
;
20144 DECL_INITIALIZED_P (d
) = 0;
20146 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
20147 initializer. That function will defer actual emission until
20148 we have a chance to determine linkage. */
20149 DECL_EXTERNAL (d
) = 0;
20151 /* Enter the scope of D so that access-checking works correctly. */
20152 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20154 push_nested_class (DECL_CONTEXT (d
));
20156 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20157 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
20160 pop_nested_class ();
20162 if (variable_template_p (td
))
20163 note_variable_template_instantiation (d
);
20165 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
20166 synthesize_method (d
);
20167 else if (TREE_CODE (d
) == FUNCTION_DECL
)
20169 hash_map
<tree
, tree
> *saved_local_specializations
;
20173 tree block
= NULL_TREE
;
20175 /* Save away the current list, in case we are instantiating one
20176 template from within the body of another. */
20177 saved_local_specializations
= local_specializations
;
20179 /* Set up the list of local specializations. */
20180 local_specializations
= new hash_map
<tree
, tree
>;
20182 /* Set up context. */
20183 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20184 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20185 block
= push_stmt_list ();
20187 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
20189 /* Some typedefs referenced from within the template code need to be
20190 access checked at template instantiation time, i.e now. These
20191 types were added to the template at parsing time. Let's get those
20192 and perform the access checks then. */
20193 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
20196 /* Create substitution entries for the parameters. */
20197 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
20198 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
20199 spec_parm
= DECL_ARGUMENTS (d
);
20200 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
20202 register_local_specialization (spec_parm
, tmpl_parm
);
20203 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
20204 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
20206 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
20208 if (!DECL_PACK_P (tmpl_parm
))
20210 register_local_specialization (spec_parm
, tmpl_parm
);
20211 spec_parm
= DECL_CHAIN (spec_parm
);
20215 /* Register the (value) argument pack as a specialization of
20216 TMPL_PARM, then move on. */
20217 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
20218 register_local_specialization (argpack
, tmpl_parm
);
20221 gcc_assert (!spec_parm
);
20223 /* Substitute into the body of the function. */
20224 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20225 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
20226 tf_warning_or_error
, tmpl
);
20229 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
20230 tf_warning_or_error
, tmpl
,
20231 /*integral_constant_expression_p=*/false);
20233 /* Set the current input_location to the end of the function
20234 so that finish_function knows where we are. */
20236 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
20238 /* Remember if we saw an infinite loop in the template. */
20239 current_function_infinite_loop
20240 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
20243 /* We don't need the local specializations any more. */
20244 delete local_specializations
;
20245 local_specializations
= saved_local_specializations
;
20247 /* Finish the function. */
20248 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20249 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20250 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
20253 d
= finish_function (0);
20254 expand_or_defer_fn (d
);
20257 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20258 cp_check_omp_declare_reduction (d
);
20261 /* We're not deferring instantiation any more. */
20262 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
20265 pop_from_top_level ();
20267 pop_function_context ();
20270 input_location
= saved_loc
;
20271 cp_unevaluated_operand
= saved_unevaluated_operand
;
20272 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20273 pop_deferring_access_checks ();
20274 pop_tinst_level ();
20276 timevar_pop (TV_TEMPLATE_INST
);
20281 /* Run through the list of templates that we wish we could
20282 instantiate, and instantiate any we can. RETRIES is the
20283 number of times we retry pending template instantiation. */
20286 instantiate_pending_templates (int retries
)
20289 location_t saved_loc
= input_location
;
20291 /* Instantiating templates may trigger vtable generation. This in turn
20292 may require further template instantiations. We place a limit here
20293 to avoid infinite loop. */
20294 if (pending_templates
&& retries
>= max_tinst_depth
)
20296 tree decl
= pending_templates
->tinst
->decl
;
20298 fatal_error ("template instantiation depth exceeds maximum of %d"
20299 " instantiating %q+D, possibly from virtual table generation"
20300 " (use -ftemplate-depth= to increase the maximum)",
20301 max_tinst_depth
, decl
);
20302 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20303 /* Pretend that we defined it. */
20304 DECL_INITIAL (decl
) = error_mark_node
;
20310 struct pending_template
**t
= &pending_templates
;
20311 struct pending_template
*last
= NULL
;
20315 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
20316 bool complete
= false;
20318 if (TYPE_P (instantiation
))
20322 if (!COMPLETE_TYPE_P (instantiation
))
20324 instantiate_class_template (instantiation
);
20325 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
20326 for (fn
= TYPE_METHODS (instantiation
);
20328 fn
= TREE_CHAIN (fn
))
20329 if (! DECL_ARTIFICIAL (fn
))
20330 instantiate_decl (fn
,
20332 /*expl_inst_class_mem_p=*/false);
20333 if (COMPLETE_TYPE_P (instantiation
))
20337 complete
= COMPLETE_TYPE_P (instantiation
);
20341 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20342 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
20345 = instantiate_decl (instantiation
,
20347 /*expl_inst_class_mem_p=*/false);
20348 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20352 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20353 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20357 /* If INSTANTIATION has been instantiated, then we don't
20358 need to consider it again in the future. */
20366 current_tinst_level
= NULL
;
20368 last_pending_template
= last
;
20370 while (reconsider
);
20372 input_location
= saved_loc
;
20375 /* Substitute ARGVEC into T, which is a list of initializers for
20376 either base class or a non-static data member. The TREE_PURPOSEs
20377 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20378 instantiate_decl. */
20381 tsubst_initializer_list (tree t
, tree argvec
)
20383 tree inits
= NULL_TREE
;
20385 for (; t
; t
= TREE_CHAIN (t
))
20389 tree expanded_bases
= NULL_TREE
;
20390 tree expanded_arguments
= NULL_TREE
;
20393 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20398 /* Expand the base class expansion type into separate base
20400 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20401 tf_warning_or_error
,
20403 if (expanded_bases
== error_mark_node
)
20406 /* We'll be building separate TREE_LISTs of arguments for
20408 len
= TREE_VEC_LENGTH (expanded_bases
);
20409 expanded_arguments
= make_tree_vec (len
);
20410 for (i
= 0; i
< len
; i
++)
20411 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20413 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20414 expand each argument in the TREE_VALUE of t. */
20415 expr
= make_node (EXPR_PACK_EXPANSION
);
20416 PACK_EXPANSION_LOCAL_P (expr
) = true;
20417 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20418 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20420 if (TREE_VALUE (t
) == void_type_node
)
20421 /* VOID_TYPE_NODE is used to indicate
20422 value-initialization. */
20424 for (i
= 0; i
< len
; i
++)
20425 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20429 /* Substitute parameter packs into each argument in the
20431 in_base_initializer
= 1;
20432 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20434 tree expanded_exprs
;
20436 /* Expand the argument. */
20437 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20439 = tsubst_pack_expansion (expr
, argvec
,
20440 tf_warning_or_error
,
20442 if (expanded_exprs
== error_mark_node
)
20445 /* Prepend each of the expanded expressions to the
20446 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20447 for (i
= 0; i
< len
; i
++)
20449 TREE_VEC_ELT (expanded_arguments
, i
) =
20450 tree_cons (NULL_TREE
,
20451 TREE_VEC_ELT (expanded_exprs
, i
),
20452 TREE_VEC_ELT (expanded_arguments
, i
));
20455 in_base_initializer
= 0;
20457 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20458 since we built them backwards. */
20459 for (i
= 0; i
< len
; i
++)
20461 TREE_VEC_ELT (expanded_arguments
, i
) =
20462 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20467 for (i
= 0; i
< len
; ++i
)
20469 if (expanded_bases
)
20471 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20472 decl
= expand_member_init (decl
);
20473 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20478 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20479 tf_warning_or_error
, NULL_TREE
);
20481 decl
= expand_member_init (decl
);
20482 if (decl
&& !DECL_P (decl
))
20483 in_base_initializer
= 1;
20485 init
= TREE_VALUE (t
);
20487 if (init
!= void_type_node
)
20488 init
= tsubst_expr (init
, argvec
,
20489 tf_warning_or_error
, NULL_TREE
,
20490 /*integral_constant_expression_p=*/false);
20491 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20492 /* If we had an initializer but it instantiated to nothing,
20493 value-initialize the object. This will only occur when
20494 the initializer was a pack expansion where the parameter
20495 packs used in that expansion were of length zero. */
20496 init
= void_type_node
;
20497 in_base_initializer
= 0;
20502 init
= build_tree_list (decl
, init
);
20503 TREE_CHAIN (init
) = inits
;
20511 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20514 set_current_access_from_decl (tree decl
)
20516 if (TREE_PRIVATE (decl
))
20517 current_access_specifier
= access_private_node
;
20518 else if (TREE_PROTECTED (decl
))
20519 current_access_specifier
= access_protected_node
;
20521 current_access_specifier
= access_public_node
;
20524 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20525 is the instantiation (which should have been created with
20526 start_enum) and ARGS are the template arguments to use. */
20529 tsubst_enum (tree tag
, tree newtag
, tree args
)
20533 if (SCOPED_ENUM_P (newtag
))
20534 begin_scope (sk_scoped_enum
, newtag
);
20536 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20541 decl
= TREE_VALUE (e
);
20542 /* Note that in a template enum, the TREE_VALUE is the
20543 CONST_DECL, not the corresponding INTEGER_CST. */
20544 value
= tsubst_expr (DECL_INITIAL (decl
),
20545 args
, tf_warning_or_error
, NULL_TREE
,
20546 /*integral_constant_expression_p=*/true);
20548 /* Give this enumeration constant the correct access. */
20549 set_current_access_from_decl (decl
);
20551 /* Actually build the enumerator itself. */
20553 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
20556 if (SCOPED_ENUM_P (newtag
))
20559 finish_enum_value_list (newtag
);
20560 finish_enum (newtag
);
20562 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20563 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20566 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20567 its type -- but without substituting the innermost set of template
20568 arguments. So, innermost set of template parameters will appear in
20572 get_mostly_instantiated_function_type (tree decl
)
20580 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
20581 targs
= DECL_TI_ARGS (decl
);
20582 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
20583 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
20585 /* There should be as many levels of arguments as there are levels
20587 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
20589 fn_type
= TREE_TYPE (tmpl
);
20591 if (parm_depth
== 1)
20592 /* No substitution is necessary. */
20599 /* Replace the innermost level of the TARGS with NULL_TREEs to
20600 let tsubst know not to substitute for those parameters. */
20601 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20602 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
20603 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
20604 TMPL_ARGS_LEVEL (targs
, i
));
20605 SET_TMPL_ARGS_LEVEL (partial_args
,
20606 TMPL_ARGS_DEPTH (targs
),
20607 make_tree_vec (DECL_NTPARMS (tmpl
)));
20609 /* Make sure that we can see identifiers, and compute access
20611 push_access_scope (decl
);
20613 ++processing_template_decl
;
20614 /* Now, do the (partial) substitution to figure out the
20615 appropriate function type. */
20616 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
20617 --processing_template_decl
;
20619 /* Substitute into the template parameters to obtain the real
20620 innermost set of parameters. This step is important if the
20621 innermost set of template parameters contains value
20622 parameters whose types depend on outer template parameters. */
20623 TREE_VEC_LENGTH (partial_args
)--;
20624 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
20626 pop_access_scope (decl
);
20632 /* Return truthvalue if we're processing a template different from
20633 the last one involved in diagnostics. */
20635 problematic_instantiation_changed (void)
20637 return current_tinst_level
!= last_error_tinst_level
;
20640 /* Remember current template involved in diagnostics. */
20642 record_last_problematic_instantiation (void)
20644 last_error_tinst_level
= current_tinst_level
;
20647 struct tinst_level
*
20648 current_instantiation (void)
20650 return current_tinst_level
;
20653 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20654 type. Return zero for ok, nonzero for disallowed. Issue error and
20655 warning messages under control of COMPLAIN. */
20658 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20660 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20662 else if (POINTER_TYPE_P (type
))
20664 else if (TYPE_PTRMEM_P (type
))
20666 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20668 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20670 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20672 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20675 if (complain
& tf_error
)
20677 if (type
== error_mark_node
)
20678 inform (input_location
, "invalid template non-type parameter");
20680 error ("%q#T is not a valid type for a template non-type parameter",
20686 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20687 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20690 dependent_type_p_r (tree type
)
20696 A type is dependent if it is:
20698 -- a template parameter. Template template parameters are types
20699 for us (since TYPE_P holds true for them) so we handle
20701 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20702 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
20704 /* -- a qualified-id with a nested-name-specifier which contains a
20705 class-name that names a dependent type or whose unqualified-id
20706 names a dependent type. */
20707 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20709 /* -- a cv-qualified type where the cv-unqualified type is
20711 type
= TYPE_MAIN_VARIANT (type
);
20712 /* -- a compound type constructed from any dependent type. */
20713 if (TYPE_PTRMEM_P (type
))
20714 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
20715 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
20717 else if (TYPE_PTR_P (type
)
20718 || TREE_CODE (type
) == REFERENCE_TYPE
)
20719 return dependent_type_p (TREE_TYPE (type
));
20720 else if (TREE_CODE (type
) == FUNCTION_TYPE
20721 || TREE_CODE (type
) == METHOD_TYPE
)
20725 if (dependent_type_p (TREE_TYPE (type
)))
20727 for (arg_type
= TYPE_ARG_TYPES (type
);
20729 arg_type
= TREE_CHAIN (arg_type
))
20730 if (dependent_type_p (TREE_VALUE (arg_type
)))
20734 /* -- an array type constructed from any dependent type or whose
20735 size is specified by a constant expression that is
20738 We checked for type- and value-dependence of the bounds in
20739 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20740 if (TREE_CODE (type
) == ARRAY_TYPE
)
20742 if (TYPE_DOMAIN (type
)
20743 && dependent_type_p (TYPE_DOMAIN (type
)))
20745 return dependent_type_p (TREE_TYPE (type
));
20748 /* -- a template-id in which either the template name is a template
20750 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20752 /* ... or any of the template arguments is a dependent type or
20753 an expression that is type-dependent or value-dependent. */
20754 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
20755 && (any_dependent_template_arguments_p
20756 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
20759 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20760 dependent; if the argument of the `typeof' expression is not
20761 type-dependent, then it should already been have resolved. */
20762 if (TREE_CODE (type
) == TYPEOF_TYPE
20763 || TREE_CODE (type
) == DECLTYPE_TYPE
20764 || TREE_CODE (type
) == UNDERLYING_TYPE
)
20767 /* A template argument pack is dependent if any of its packed
20769 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
20771 tree args
= ARGUMENT_PACK_ARGS (type
);
20772 int i
, len
= TREE_VEC_LENGTH (args
);
20773 for (i
= 0; i
< len
; ++i
)
20774 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20778 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20779 be template parameters. */
20780 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
20783 /* The standard does not specifically mention types that are local
20784 to template functions or local classes, but they should be
20785 considered dependent too. For example:
20787 template <int I> void f() {
20792 The size of `E' cannot be known until the value of `I' has been
20793 determined. Therefore, `E' must be considered dependent. */
20794 scope
= TYPE_CONTEXT (type
);
20795 if (scope
&& TYPE_P (scope
))
20796 return dependent_type_p (scope
);
20797 /* Don't use type_dependent_expression_p here, as it can lead
20798 to infinite recursion trying to determine whether a lambda
20799 nested in a lambda is dependent (c++/47687). */
20800 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
20801 && DECL_LANG_SPECIFIC (scope
)
20802 && DECL_TEMPLATE_INFO (scope
)
20803 && (any_dependent_template_arguments_p
20804 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
20807 /* Other types are non-dependent. */
20811 /* Returns TRUE if TYPE is dependent, in the sense of
20812 [temp.dep.type]. Note that a NULL type is considered dependent. */
20815 dependent_type_p (tree type
)
20817 /* If there are no template parameters in scope, then there can't be
20818 any dependent types. */
20819 if (!processing_template_decl
)
20821 /* If we are not processing a template, then nobody should be
20822 providing us with a dependent type. */
20824 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
20828 /* If the type is NULL, we have not computed a type for the entity
20829 in question; in that case, the type is dependent. */
20833 /* Erroneous types can be considered non-dependent. */
20834 if (type
== error_mark_node
)
20837 /* If we have not already computed the appropriate value for TYPE,
20839 if (!TYPE_DEPENDENT_P_VALID (type
))
20841 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
20842 TYPE_DEPENDENT_P_VALID (type
) = 1;
20845 return TYPE_DEPENDENT_P (type
);
20848 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
20849 lookup. In other words, a dependent type that is not the current
20853 dependent_scope_p (tree scope
)
20855 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
20856 && !currently_open_class (scope
));
20859 /* T is a SCOPE_REF; return whether we need to consider it
20860 instantiation-dependent so that we can check access at instantiation
20861 time even though we know which member it resolves to. */
20864 instantiation_dependent_scope_ref_p (tree t
)
20866 if (DECL_P (TREE_OPERAND (t
, 1))
20867 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
20868 && accessible_in_template_p (TREE_OPERAND (t
, 0),
20869 TREE_OPERAND (t
, 1)))
20875 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
20876 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
20879 /* Note that this predicate is not appropriate for general expressions;
20880 only constant expressions (that satisfy potential_constant_expression)
20881 can be tested for value dependence. */
20884 value_dependent_expression_p (tree expression
)
20886 if (!processing_template_decl
)
20889 /* A name declared with a dependent type. */
20890 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
20893 switch (TREE_CODE (expression
))
20895 case IDENTIFIER_NODE
:
20896 /* A name that has not been looked up -- must be dependent. */
20899 case TEMPLATE_PARM_INDEX
:
20900 /* A non-type template parm. */
20904 /* A non-type template parm. */
20905 if (DECL_TEMPLATE_PARM_P (expression
))
20907 return value_dependent_expression_p (DECL_INITIAL (expression
));
20910 /* A constant with literal type and is initialized
20911 with an expression that is value-dependent.
20913 Note that a non-dependent parenthesized initializer will have
20914 already been replaced with its constant value, so if we see
20915 a TREE_LIST it must be dependent. */
20916 if (DECL_INITIAL (expression
)
20917 && decl_constant_var_p (expression
)
20918 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
20919 || value_dependent_expression_p (DECL_INITIAL (expression
))))
20923 case DYNAMIC_CAST_EXPR
:
20924 case STATIC_CAST_EXPR
:
20925 case CONST_CAST_EXPR
:
20926 case REINTERPRET_CAST_EXPR
:
20928 /* These expressions are value-dependent if the type to which
20929 the cast occurs is dependent or the expression being casted
20930 is value-dependent. */
20932 tree type
= TREE_TYPE (expression
);
20934 if (dependent_type_p (type
))
20937 /* A functional cast has a list of operands. */
20938 expression
= TREE_OPERAND (expression
, 0);
20941 /* If there are no operands, it must be an expression such
20942 as "int()". This should not happen for aggregate types
20943 because it would form non-constant expressions. */
20944 gcc_assert (cxx_dialect
>= cxx11
20945 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
20950 if (TREE_CODE (expression
) == TREE_LIST
)
20951 return any_value_dependent_elements_p (expression
);
20953 return value_dependent_expression_p (expression
);
20957 if (SIZEOF_EXPR_TYPE_P (expression
))
20958 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
20962 /* A `sizeof' expression is value-dependent if the operand is
20963 type-dependent or is a pack expansion. */
20964 expression
= TREE_OPERAND (expression
, 0);
20965 if (PACK_EXPANSION_P (expression
))
20967 else if (TYPE_P (expression
))
20968 return dependent_type_p (expression
);
20969 return instantiation_dependent_expression_p (expression
);
20971 case AT_ENCODE_EXPR
:
20972 /* An 'encode' expression is value-dependent if the operand is
20974 expression
= TREE_OPERAND (expression
, 0);
20975 return dependent_type_p (expression
);
20977 case NOEXCEPT_EXPR
:
20978 expression
= TREE_OPERAND (expression
, 0);
20979 return instantiation_dependent_expression_p (expression
);
20982 /* All instantiation-dependent expressions should also be considered
20983 value-dependent. */
20984 return instantiation_dependent_scope_ref_p (expression
);
20986 case COMPONENT_REF
:
20987 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
20988 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
20990 case NONTYPE_ARGUMENT_PACK
:
20991 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
20992 is value-dependent. */
20994 tree values
= ARGUMENT_PACK_ARGS (expression
);
20995 int i
, len
= TREE_VEC_LENGTH (values
);
20997 for (i
= 0; i
< len
; ++i
)
20998 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
21006 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
21007 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
21008 || (type2
? dependent_type_p (type2
) : false));
21012 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21013 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
21016 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21017 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
21021 tree op
= TREE_OPERAND (expression
, 0);
21022 return (value_dependent_expression_p (op
)
21023 || has_value_dependent_address (op
));
21028 tree fn
= get_callee_fndecl (expression
);
21030 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
21032 nargs
= call_expr_nargs (expression
);
21033 for (i
= 0; i
< nargs
; ++i
)
21035 tree op
= CALL_EXPR_ARG (expression
, i
);
21036 /* In a call to a constexpr member function, look through the
21037 implicit ADDR_EXPR on the object argument so that it doesn't
21038 cause the call to be considered value-dependent. We also
21039 look through it in potential_constant_expression. */
21040 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
21041 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
21042 && TREE_CODE (op
) == ADDR_EXPR
)
21043 op
= TREE_OPERAND (op
, 0);
21044 if (value_dependent_expression_p (op
))
21050 case TEMPLATE_ID_EXPR
:
21051 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
21053 return type_dependent_expression_p (expression
);
21059 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
21060 if (value_dependent_expression_p (val
))
21066 /* Treat a GNU statement expression as dependent to avoid crashing
21067 under fold_non_dependent_expr; it can't be constant. */
21071 /* A constant expression is value-dependent if any subexpression is
21072 value-dependent. */
21073 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
21075 case tcc_reference
:
21077 case tcc_comparison
:
21079 case tcc_expression
:
21082 int i
, len
= cp_tree_operand_length (expression
);
21084 for (i
= 0; i
< len
; i
++)
21086 tree t
= TREE_OPERAND (expression
, i
);
21088 /* In some cases, some of the operands may be missing.l
21089 (For example, in the case of PREDECREMENT_EXPR, the
21090 amount to increment by may be missing.) That doesn't
21091 make the expression dependent. */
21092 if (t
&& value_dependent_expression_p (t
))
21103 /* The expression is not value-dependent. */
21107 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
21108 [temp.dep.expr]. Note that an expression with no type is
21109 considered dependent. Other parts of the compiler arrange for an
21110 expression with type-dependent subexpressions to have no type, so
21111 this function doesn't have to be fully recursive. */
21114 type_dependent_expression_p (tree expression
)
21116 if (!processing_template_decl
)
21119 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
21122 /* An unresolved name is always dependent. */
21123 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
21126 /* Some expression forms are never type-dependent. */
21127 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
21128 || TREE_CODE (expression
) == SIZEOF_EXPR
21129 || TREE_CODE (expression
) == ALIGNOF_EXPR
21130 || TREE_CODE (expression
) == AT_ENCODE_EXPR
21131 || TREE_CODE (expression
) == NOEXCEPT_EXPR
21132 || TREE_CODE (expression
) == TRAIT_EXPR
21133 || TREE_CODE (expression
) == TYPEID_EXPR
21134 || TREE_CODE (expression
) == DELETE_EXPR
21135 || TREE_CODE (expression
) == VEC_DELETE_EXPR
21136 || TREE_CODE (expression
) == THROW_EXPR
)
21139 /* The types of these expressions depends only on the type to which
21140 the cast occurs. */
21141 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
21142 || TREE_CODE (expression
) == STATIC_CAST_EXPR
21143 || TREE_CODE (expression
) == CONST_CAST_EXPR
21144 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
21145 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
21146 || TREE_CODE (expression
) == CAST_EXPR
)
21147 return dependent_type_p (TREE_TYPE (expression
));
21149 /* The types of these expressions depends only on the type created
21150 by the expression. */
21151 if (TREE_CODE (expression
) == NEW_EXPR
21152 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
21154 /* For NEW_EXPR tree nodes created inside a template, either
21155 the object type itself or a TREE_LIST may appear as the
21157 tree type
= TREE_OPERAND (expression
, 1);
21158 if (TREE_CODE (type
) == TREE_LIST
)
21159 /* This is an array type. We need to check array dimensions
21161 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
21162 || value_dependent_expression_p
21163 (TREE_OPERAND (TREE_VALUE (type
), 1));
21165 return dependent_type_p (type
);
21168 if (TREE_CODE (expression
) == SCOPE_REF
)
21170 tree scope
= TREE_OPERAND (expression
, 0);
21171 tree name
= TREE_OPERAND (expression
, 1);
21173 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
21174 contains an identifier associated by name lookup with one or more
21175 declarations declared with a dependent type, or...a
21176 nested-name-specifier or qualified-id that names a member of an
21177 unknown specialization. */
21178 return (type_dependent_expression_p (name
)
21179 || dependent_scope_p (scope
));
21182 if (TREE_CODE (expression
) == FUNCTION_DECL
21183 && DECL_LANG_SPECIFIC (expression
)
21184 && DECL_TEMPLATE_INFO (expression
)
21185 && (any_dependent_template_arguments_p
21186 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
21189 if (TREE_CODE (expression
) == TEMPLATE_DECL
21190 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
21193 if (TREE_CODE (expression
) == STMT_EXPR
)
21194 expression
= stmt_expr_value_expr (expression
);
21196 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
21201 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
21203 if (type_dependent_expression_p (elt
))
21209 /* A static data member of the current instantiation with incomplete
21210 array type is type-dependent, as the definition and specializations
21211 can have different bounds. */
21212 if (VAR_P (expression
)
21213 && DECL_CLASS_SCOPE_P (expression
)
21214 && dependent_type_p (DECL_CONTEXT (expression
))
21215 && VAR_HAD_UNKNOWN_BOUND (expression
))
21218 /* An array of unknown bound depending on a variadic parameter, eg:
21220 template<typename... Args>
21221 void foo (Args... args)
21223 int arr[] = { args... };
21226 template<int... vals>
21229 int arr[] = { vals... };
21232 If the array has no length and has an initializer, it must be that
21233 we couldn't determine its length in cp_complete_array_type because
21234 it is dependent. */
21235 if (VAR_P (expression
)
21236 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
21237 && !TYPE_DOMAIN (TREE_TYPE (expression
))
21238 && DECL_INITIAL (expression
))
21241 if (TREE_TYPE (expression
) == unknown_type_node
)
21243 if (TREE_CODE (expression
) == ADDR_EXPR
)
21244 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
21245 if (TREE_CODE (expression
) == COMPONENT_REF
21246 || TREE_CODE (expression
) == OFFSET_REF
)
21248 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21250 expression
= TREE_OPERAND (expression
, 1);
21251 if (identifier_p (expression
))
21254 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21255 if (TREE_CODE (expression
) == SCOPE_REF
)
21258 /* Always dependent, on the number of arguments if nothing else. */
21259 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
21262 if (BASELINK_P (expression
))
21264 if (BASELINK_OPTYPE (expression
)
21265 && dependent_type_p (BASELINK_OPTYPE (expression
)))
21267 expression
= BASELINK_FUNCTIONS (expression
);
21270 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
21272 if (any_dependent_template_arguments_p
21273 (TREE_OPERAND (expression
, 1)))
21275 expression
= TREE_OPERAND (expression
, 0);
21277 gcc_assert (TREE_CODE (expression
) == OVERLOAD
21278 || TREE_CODE (expression
) == FUNCTION_DECL
);
21282 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
21284 expression
= OVL_NEXT (expression
);
21289 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
21291 return (dependent_type_p (TREE_TYPE (expression
)));
21294 /* walk_tree callback function for instantiation_dependent_expression_p,
21295 below. Returns non-zero if a dependent subexpression is found. */
21298 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
21303 /* We don't have to worry about decltype currently because decltype
21304 of an instantiation-dependent expr is a dependent type. This
21305 might change depending on the resolution of DR 1172. */
21306 *walk_subtrees
= false;
21309 enum tree_code code
= TREE_CODE (*tp
);
21312 /* Don't treat an argument list as dependent just because it has no
21320 /* A constant with a dependent initializer is dependent. */
21321 if (value_dependent_expression_p (*tp
))
21325 case TEMPLATE_PARM_INDEX
:
21328 /* Handle expressions with type operands. */
21332 case AT_ENCODE_EXPR
:
21334 tree op
= TREE_OPERAND (*tp
, 0);
21335 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
21336 op
= TREE_TYPE (op
);
21339 if (dependent_type_p (op
))
21343 *walk_subtrees
= false;
21351 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21352 || (TRAIT_EXPR_TYPE2 (*tp
)
21353 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21355 *walk_subtrees
= false;
21358 case COMPONENT_REF
:
21359 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21360 /* In a template, finish_class_member_access_expr creates a
21361 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21362 type-dependent, so that we can check access control at
21363 instantiation time (PR 42277). See also Core issue 1273. */
21368 if (instantiation_dependent_scope_ref_p (*tp
))
21373 /* Treat statement-expressions as dependent. */
21381 if (type_dependent_expression_p (*tp
))
21387 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21388 sense defined by the ABI:
21390 "An expression is instantiation-dependent if it is type-dependent
21391 or value-dependent, or it has a subexpression that is type-dependent
21392 or value-dependent." */
21395 instantiation_dependent_expression_p (tree expression
)
21399 if (!processing_template_decl
)
21402 if (expression
== error_mark_node
)
21405 result
= cp_walk_tree_without_duplicates (&expression
,
21406 instantiation_dependent_r
, NULL
);
21407 return result
!= NULL_TREE
;
21410 /* Like type_dependent_expression_p, but it also works while not processing
21411 a template definition, i.e. during substitution or mangling. */
21414 type_dependent_expression_p_push (tree expr
)
21417 ++processing_template_decl
;
21418 b
= type_dependent_expression_p (expr
);
21419 --processing_template_decl
;
21423 /* Returns TRUE if ARGS contains a type-dependent expression. */
21426 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21431 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21433 if (type_dependent_expression_p (arg
))
21439 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21440 expressions) contains any type-dependent expressions. */
21443 any_type_dependent_elements_p (const_tree list
)
21445 for (; list
; list
= TREE_CHAIN (list
))
21446 if (type_dependent_expression_p (TREE_VALUE (list
)))
21452 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21453 expressions) contains any value-dependent expressions. */
21456 any_value_dependent_elements_p (const_tree list
)
21458 for (; list
; list
= TREE_CHAIN (list
))
21459 if (value_dependent_expression_p (TREE_VALUE (list
)))
21465 /* Returns TRUE if the ARG (a template argument) is dependent. */
21468 dependent_template_arg_p (tree arg
)
21470 if (!processing_template_decl
)
21473 /* Assume a template argument that was wrongly written by the user
21474 is dependent. This is consistent with what
21475 any_dependent_template_arguments_p [that calls this function]
21477 if (!arg
|| arg
== error_mark_node
)
21480 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21481 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21483 if (TREE_CODE (arg
) == TEMPLATE_DECL
21484 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21485 return dependent_template_p (arg
);
21486 else if (ARGUMENT_PACK_P (arg
))
21488 tree args
= ARGUMENT_PACK_ARGS (arg
);
21489 int i
, len
= TREE_VEC_LENGTH (args
);
21490 for (i
= 0; i
< len
; ++i
)
21492 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21498 else if (TYPE_P (arg
))
21499 return dependent_type_p (arg
);
21501 return (type_dependent_expression_p (arg
)
21502 || value_dependent_expression_p (arg
));
21505 /* Returns true if ARGS (a collection of template arguments) contains
21506 any types that require structural equality testing. */
21509 any_template_arguments_need_structural_equality_p (tree args
)
21516 if (args
== error_mark_node
)
21519 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21521 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21522 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21524 tree arg
= TREE_VEC_ELT (level
, j
);
21525 tree packed_args
= NULL_TREE
;
21528 if (ARGUMENT_PACK_P (arg
))
21530 /* Look inside the argument pack. */
21531 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21532 len
= TREE_VEC_LENGTH (packed_args
);
21535 for (k
= 0; k
< len
; ++k
)
21538 arg
= TREE_VEC_ELT (packed_args
, k
);
21540 if (error_operand_p (arg
))
21542 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21544 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21546 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21547 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21556 /* Returns true if ARGS (a collection of template arguments) contains
21557 any dependent arguments. */
21560 any_dependent_template_arguments_p (const_tree args
)
21567 if (args
== error_mark_node
)
21570 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21572 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21573 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21574 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21581 /* Returns TRUE if the template TMPL is dependent. */
21584 dependent_template_p (tree tmpl
)
21586 if (TREE_CODE (tmpl
) == OVERLOAD
)
21590 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21592 tmpl
= OVL_NEXT (tmpl
);
21597 /* Template template parameters are dependent. */
21598 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21599 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21601 /* So are names that have not been looked up. */
21602 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21604 /* So are member templates of dependent classes. */
21605 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21606 return dependent_type_p (DECL_CONTEXT (tmpl
));
21610 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21613 dependent_template_id_p (tree tmpl
, tree args
)
21615 return (dependent_template_p (tmpl
)
21616 || any_dependent_template_arguments_p (args
));
21619 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21623 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21627 if (!processing_template_decl
)
21630 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21632 tree decl
= TREE_VEC_ELT (declv
, i
);
21633 tree init
= TREE_VEC_ELT (initv
, i
);
21634 tree cond
= TREE_VEC_ELT (condv
, i
);
21635 tree incr
= TREE_VEC_ELT (incrv
, i
);
21637 if (type_dependent_expression_p (decl
))
21640 if (init
&& type_dependent_expression_p (init
))
21643 if (type_dependent_expression_p (cond
))
21646 if (COMPARISON_CLASS_P (cond
)
21647 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21648 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21651 if (TREE_CODE (incr
) == MODOP_EXPR
)
21653 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21654 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21657 else if (type_dependent_expression_p (incr
))
21659 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21661 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21663 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
21665 tree t
= TREE_OPERAND (incr
, 1);
21666 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
21667 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
21676 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21677 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21678 no such TYPE can be found. Note that this function peers inside
21679 uninstantiated templates and therefore should be used only in
21680 extremely limited situations. ONLY_CURRENT_P restricts this
21681 peering to the currently open classes hierarchy (which is required
21682 when comparing types). */
21685 resolve_typename_type (tree type
, bool only_current_p
)
21694 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
21696 scope
= TYPE_CONTEXT (type
);
21697 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21698 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21699 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21700 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21701 identifier of the TYPENAME_TYPE anymore.
21702 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21703 TYPENAME_TYPE instead, we avoid messing up with a possible
21704 typedef variant case. */
21705 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
21707 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21708 it first before we can figure out what NAME refers to. */
21709 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21711 if (TYPENAME_IS_RESOLVING_P (scope
))
21712 /* Given a class template A with a dependent base with nested type C,
21713 typedef typename A::C::C C will land us here, as trying to resolve
21714 the initial A::C leads to the local C typedef, which leads back to
21715 A::C::C. So we break the recursion now. */
21718 scope
= resolve_typename_type (scope
, only_current_p
);
21720 /* If we don't know what SCOPE refers to, then we cannot resolve the
21722 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21724 /* If the SCOPE is a template type parameter, we have no way of
21725 resolving the name. */
21726 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
21728 /* If the SCOPE is not the current instantiation, there's no reason
21729 to look inside it. */
21730 if (only_current_p
&& !currently_open_class (scope
))
21732 /* If this is a typedef, we don't want to look inside (c++/11987). */
21733 if (typedef_variant_p (type
))
21735 /* If SCOPE isn't the template itself, it will not have a valid
21736 TYPE_FIELDS list. */
21737 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
21738 /* scope is either the template itself or a compatible instantiation
21739 like X<T>, so look up the name in the original template. */
21740 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
21742 /* scope is a partial instantiation, so we can't do the lookup or we
21743 will lose the template arguments. */
21745 /* Enter the SCOPE so that name lookup will be resolved as if we
21746 were in the class definition. In particular, SCOPE will no
21747 longer be considered a dependent type. */
21748 pushed_scope
= push_scope (scope
);
21749 /* Look up the declaration. */
21750 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
21751 tf_warning_or_error
);
21753 result
= NULL_TREE
;
21755 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21756 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21759 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
21760 && TREE_CODE (decl
) == TYPE_DECL
)
21762 result
= TREE_TYPE (decl
);
21763 if (result
== error_mark_node
)
21764 result
= NULL_TREE
;
21766 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
21767 && DECL_CLASS_TEMPLATE_P (decl
))
21771 /* Obtain the template and the arguments. */
21772 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
21773 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
21774 /* Instantiate the template. */
21775 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
21776 /*entering_scope=*/0,
21777 tf_error
| tf_user
);
21778 if (result
== error_mark_node
)
21779 result
= NULL_TREE
;
21782 /* Leave the SCOPE. */
21784 pop_scope (pushed_scope
);
21786 /* If we failed to resolve it, return the original typename. */
21790 /* If lookup found a typename type, resolve that too. */
21791 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
21793 /* Ill-formed programs can cause infinite recursion here, so we
21794 must catch that. */
21795 TYPENAME_IS_RESOLVING_P (type
) = 1;
21796 result
= resolve_typename_type (result
, only_current_p
);
21797 TYPENAME_IS_RESOLVING_P (type
) = 0;
21800 /* Qualify the resulting type. */
21801 quals
= cp_type_quals (type
);
21803 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
21808 /* EXPR is an expression which is not type-dependent. Return a proxy
21809 for EXPR that can be used to compute the types of larger
21810 expressions containing EXPR. */
21813 build_non_dependent_expr (tree expr
)
21817 #ifdef ENABLE_CHECKING
21818 /* Try to get a constant value for all non-dependent expressions in
21819 order to expose bugs in *_dependent_expression_p and constexpr. */
21820 if (cxx_dialect
>= cxx11
)
21821 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
21824 /* Preserve OVERLOADs; the functions must be available to resolve
21827 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
21828 inner_expr
= stmt_expr_value_expr (inner_expr
);
21829 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
21830 inner_expr
= TREE_OPERAND (inner_expr
, 0);
21831 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
21832 inner_expr
= TREE_OPERAND (inner_expr
, 1);
21833 if (is_overloaded_fn (inner_expr
)
21834 || TREE_CODE (inner_expr
) == OFFSET_REF
)
21836 /* There is no need to return a proxy for a variable. */
21839 /* Preserve string constants; conversions from string constants to
21840 "char *" are allowed, even though normally a "const char *"
21841 cannot be used to initialize a "char *". */
21842 if (TREE_CODE (expr
) == STRING_CST
)
21844 /* Preserve void and arithmetic constants, as an optimization -- there is no
21845 reason to create a new node. */
21846 if (TREE_CODE (expr
) == VOID_CST
21847 || TREE_CODE (expr
) == INTEGER_CST
21848 || TREE_CODE (expr
) == REAL_CST
)
21850 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
21851 There is at least one place where we want to know that a
21852 particular expression is a throw-expression: when checking a ?:
21853 expression, there are special rules if the second or third
21854 argument is a throw-expression. */
21855 if (TREE_CODE (expr
) == THROW_EXPR
)
21858 /* Don't wrap an initializer list, we need to be able to look inside. */
21859 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
21862 /* Don't wrap a dummy object, we need to be able to test for it. */
21863 if (is_dummy_object (expr
))
21866 if (TREE_CODE (expr
) == COND_EXPR
)
21867 return build3 (COND_EXPR
,
21869 TREE_OPERAND (expr
, 0),
21870 (TREE_OPERAND (expr
, 1)
21871 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
21872 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
21873 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
21874 if (TREE_CODE (expr
) == COMPOUND_EXPR
21875 && !COMPOUND_EXPR_OVERLOADED (expr
))
21876 return build2 (COMPOUND_EXPR
,
21878 TREE_OPERAND (expr
, 0),
21879 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
21881 /* If the type is unknown, it can't really be non-dependent */
21882 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
21884 /* Otherwise, build a NON_DEPENDENT_EXPR. */
21885 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
21888 /* ARGS is a vector of expressions as arguments to a function call.
21889 Replace the arguments with equivalent non-dependent expressions.
21890 This modifies ARGS in place. */
21893 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
21898 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
21900 tree newarg
= build_non_dependent_expr (arg
);
21902 (*args
)[ix
] = newarg
;
21906 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
21907 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
21911 make_auto_1 (tree name
)
21913 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
21914 TYPE_NAME (au
) = build_decl (input_location
,
21915 TYPE_DECL
, name
, au
);
21916 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
21917 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
21918 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
21919 TYPE_NAME (au
), NULL_TREE
);
21920 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
21921 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
21922 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
21928 make_decltype_auto (void)
21930 return make_auto_1 (get_identifier ("decltype(auto)"));
21936 return make_auto_1 (get_identifier ("auto"));
21939 /* Given type ARG, return std::initializer_list<ARG>. */
21944 tree std_init_list
= namespace_binding
21945 (get_identifier ("initializer_list"), std_node
);
21947 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
21949 error ("deducing from brace-enclosed initializer list requires "
21950 "#include <initializer_list>");
21951 return error_mark_node
;
21953 argvec
= make_tree_vec (1);
21954 TREE_VEC_ELT (argvec
, 0) = arg
;
21955 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
21956 NULL_TREE
, 0, tf_warning_or_error
);
21959 /* Replace auto in TYPE with std::initializer_list<auto>. */
21962 listify_autos (tree type
, tree auto_node
)
21964 tree init_auto
= listify (auto_node
);
21965 tree argvec
= make_tree_vec (1);
21966 TREE_VEC_ELT (argvec
, 0) = init_auto
;
21967 if (processing_template_decl
)
21968 argvec
= add_to_template_args (current_template_args (), argvec
);
21969 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21972 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
21973 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
21976 do_auto_deduction (tree type
, tree init
, tree auto_node
)
21980 if (init
== error_mark_node
)
21981 return error_mark_node
;
21983 if (type_dependent_expression_p (init
))
21984 /* Defining a subset of type-dependent expressions that we can deduce
21985 from ahead of time isn't worth the trouble. */
21988 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
21989 with either a new invented type template parameter U or, if the
21990 initializer is a braced-init-list (8.5.4), with
21991 std::initializer_list<U>. */
21992 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
21993 type
= listify_autos (type
, auto_node
);
21995 init
= resolve_nondeduced_context (init
);
21997 targs
= make_tree_vec (1);
21998 if (AUTO_IS_DECLTYPE (auto_node
))
22000 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
22001 && !REF_PARENTHESIZED_P (init
)));
22002 TREE_VEC_ELT (targs
, 0)
22003 = finish_decltype_type (init
, id
, tf_warning_or_error
);
22004 if (type
!= auto_node
)
22006 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
22007 return error_mark_node
;
22012 tree parms
= build_tree_list (NULL_TREE
, type
);
22013 tree tparms
= make_tree_vec (1);
22016 TREE_VEC_ELT (tparms
, 0)
22017 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
22018 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
22019 DEDUCE_CALL
, LOOKUP_NORMAL
,
22020 NULL
, /*explain_p=*/false);
22023 if (processing_template_decl
)
22024 /* Try again at instantiation time. */
22026 if (type
&& type
!= error_mark_node
)
22027 /* If type is error_mark_node a diagnostic must have been
22028 emitted by now. Also, having a mention to '<type error>'
22029 in the diagnostic is not really useful to the user. */
22031 if (cfun
&& auto_node
== current_function_auto_return_pattern
22032 && LAMBDA_FUNCTION_P (current_function_decl
))
22033 error ("unable to deduce lambda return type from %qE", init
);
22035 error ("unable to deduce %qT from %qE", type
, init
);
22037 return error_mark_node
;
22041 /* If the list of declarators contains more than one declarator, the type
22042 of each declared variable is determined as described above. If the
22043 type deduced for the template parameter U is not the same in each
22044 deduction, the program is ill-formed. */
22045 if (TREE_TYPE (auto_node
)
22046 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
22048 if (cfun
&& auto_node
== current_function_auto_return_pattern
22049 && LAMBDA_FUNCTION_P (current_function_decl
))
22050 error ("inconsistent types %qT and %qT deduced for "
22051 "lambda return type", TREE_TYPE (auto_node
),
22052 TREE_VEC_ELT (targs
, 0));
22054 error ("inconsistent deduction for %qT: %qT and then %qT",
22055 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
22056 return error_mark_node
;
22058 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
22060 if (processing_template_decl
)
22061 targs
= add_to_template_args (current_template_args (), targs
);
22062 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
22065 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
22069 splice_late_return_type (tree type
, tree late_return_type
)
22073 if (late_return_type
== NULL_TREE
)
22075 argvec
= make_tree_vec (1);
22076 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
22077 if (processing_template_parmlist
)
22078 /* For a late-specified return type in a template type-parameter, we
22079 need to add a dummy argument level for its parmlist. */
22080 argvec
= add_to_template_args
22081 (make_tree_vec (processing_template_parmlist
), argvec
);
22082 if (current_template_parms
)
22083 argvec
= add_to_template_args (current_template_args (), argvec
);
22084 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22087 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
22088 'decltype(auto)'. */
22091 is_auto (const_tree type
)
22093 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22094 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
22095 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
22101 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
22102 a use of `auto'. Returns NULL_TREE otherwise. */
22105 type_uses_auto (tree type
)
22107 return find_type_usage (type
, is_auto
);
22110 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
22111 'decltype(auto)' or a concept. */
22114 is_auto_or_concept (const_tree type
)
22116 return is_auto (type
); // or concept
22119 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
22120 a concept identifier) iff TYPE contains a use of a generic type. Returns
22121 NULL_TREE otherwise. */
22124 type_uses_auto_or_concept (tree type
)
22126 return find_type_usage (type
, is_auto_or_concept
);
22130 /* For a given template T, return the vector of typedefs referenced
22131 in T for which access check is needed at T instantiation time.
22132 T is either a FUNCTION_DECL or a RECORD_TYPE.
22133 Those typedefs were added to T by the function
22134 append_type_to_template_for_access_check. */
22136 vec
<qualified_typedef_usage_t
, va_gc
> *
22137 get_types_needing_access_check (tree t
)
22140 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
22142 if (!t
|| t
== error_mark_node
)
22145 if (!(ti
= get_template_info (t
)))
22148 if (CLASS_TYPE_P (t
)
22149 || TREE_CODE (t
) == FUNCTION_DECL
)
22151 if (!TI_TEMPLATE (ti
))
22154 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
22160 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
22161 tied to T. That list of typedefs will be access checked at
22162 T instantiation time.
22163 T is either a FUNCTION_DECL or a RECORD_TYPE.
22164 TYPE_DECL is a TYPE_DECL node representing a typedef.
22165 SCOPE is the scope through which TYPE_DECL is accessed.
22166 LOCATION is the location of the usage point of TYPE_DECL.
22168 This function is a subroutine of
22169 append_type_to_template_for_access_check. */
22172 append_type_to_template_for_access_check_1 (tree t
,
22175 location_t location
)
22177 qualified_typedef_usage_t typedef_usage
;
22180 if (!t
|| t
== error_mark_node
)
22183 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
22184 || CLASS_TYPE_P (t
))
22186 && TREE_CODE (type_decl
) == TYPE_DECL
22189 if (!(ti
= get_template_info (t
)))
22192 gcc_assert (TI_TEMPLATE (ti
));
22194 typedef_usage
.typedef_decl
= type_decl
;
22195 typedef_usage
.context
= scope
;
22196 typedef_usage
.locus
= location
;
22198 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
22201 /* Append TYPE_DECL to the template TEMPL.
22202 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
22203 At TEMPL instanciation time, TYPE_DECL will be checked to see
22204 if it can be accessed through SCOPE.
22205 LOCATION is the location of the usage point of TYPE_DECL.
22207 e.g. consider the following code snippet:
22214 template<class U> struct S
22216 C::myint mi; // <-- usage point of the typedef C::myint
22221 At S<char> instantiation time, we need to check the access of C::myint
22222 In other words, we need to check the access of the myint typedef through
22223 the C scope. For that purpose, this function will add the myint typedef
22224 and the scope C through which its being accessed to a list of typedefs
22225 tied to the template S. That list will be walked at template instantiation
22226 time and access check performed on each typedefs it contains.
22227 Note that this particular code snippet should yield an error because
22228 myint is private to C. */
22231 append_type_to_template_for_access_check (tree templ
,
22234 location_t location
)
22236 qualified_typedef_usage_t
*iter
;
22239 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
22241 /* Make sure we don't append the type to the template twice. */
22242 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
22243 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
22246 append_type_to_template_for_access_check_1 (templ
, type_decl
,
22250 /* Convert the generic type parameters in PARM that match the types given in the
22251 range [START_IDX, END_IDX) from the current_template_parms into generic type
22255 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
22257 tree current
= current_template_parms
;
22258 int depth
= TMPL_PARMS_DEPTH (current
);
22259 current
= INNERMOST_TEMPLATE_PARMS (current
);
22260 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
22262 for (int i
= 0; i
< start_idx
; ++i
)
22263 TREE_VEC_ELT (replacement
, i
)
22264 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22266 for (int i
= start_idx
; i
< end_idx
; ++i
)
22268 /* Create a distinct parameter pack type from the current parm and add it
22269 to the replacement args to tsubst below into the generic function
22272 tree o
= TREE_TYPE (TREE_VALUE
22273 (TREE_VEC_ELT (current
, i
)));
22274 tree t
= copy_type (o
);
22275 TEMPLATE_TYPE_PARM_INDEX (t
)
22276 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
22278 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
22279 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
22280 TYPE_MAIN_VARIANT (t
) = t
;
22281 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
22282 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
22283 TREE_VEC_ELT (replacement
, i
) = t
;
22284 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
22287 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
22288 TREE_VEC_ELT (replacement
, i
)
22289 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22291 /* If there are more levels then build up the replacement with the outer
22294 replacement
= add_to_template_args (template_parms_to_args
22295 (TREE_CHAIN (current_template_parms
)),
22298 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
22302 /* Set up the hash tables for template instantiations. */
22305 init_template_processing (void)
22307 decl_specializations
= htab_create_ggc (37,
22308 hash_specialization
,
22309 eq_specializations
,
22311 type_specializations
= htab_create_ggc (37,
22312 hash_specialization
,
22313 eq_specializations
,
22317 /* Print stats about the template hash tables for -fstats. */
22320 print_template_statistics (void)
22322 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
22323 "%f collisions\n", (long) htab_size (decl_specializations
),
22324 (long) htab_elements (decl_specializations
),
22325 htab_collisions (decl_specializations
));
22326 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
22327 "%f collisions\n", (long) htab_size (type_specializations
),
22328 (long) htab_elements (type_specializations
),
22329 htab_collisions (type_specializations
));
22332 #include "gt-cp-pt.h"