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 struct GTY((for_user
)) spec_entry
90 struct spec_hasher
: ggc_hasher
<spec_entry
*>
92 static hashval_t
hash (spec_entry
*);
93 static bool equal (spec_entry
*, spec_entry
*);
96 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
98 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
100 /* Contains canonical template parameter types. The vector is indexed by
101 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
102 TREE_LIST, whose TREE_VALUEs contain the canonical template
103 parameters of various types and levels. */
104 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
106 #define UNIFY_ALLOW_NONE 0
107 #define UNIFY_ALLOW_MORE_CV_QUAL 1
108 #define UNIFY_ALLOW_LESS_CV_QUAL 2
109 #define UNIFY_ALLOW_DERIVED 4
110 #define UNIFY_ALLOW_INTEGER 8
111 #define UNIFY_ALLOW_OUTER_LEVEL 16
112 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
113 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
115 enum template_base_result
{
117 tbr_ambiguous_baseclass
,
121 static void push_access_scope (tree
);
122 static void pop_access_scope (tree
);
123 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
124 unification_kind_t
, int,
126 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
127 unification_kind_t
, int, bool, bool);
128 static int unify (tree
, tree
, tree
, tree
, int, bool);
129 static void add_pending_template (tree
);
130 static tree
reopen_tinst_level (struct tinst_level
*);
131 static tree
tsubst_initializer_list (tree
, tree
);
132 static tree
get_class_bindings (tree
, tree
, tree
, tree
);
133 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
135 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
137 static void tsubst_enum (tree
, tree
, tree
);
138 static tree
add_to_template_args (tree
, tree
);
139 static tree
add_outermost_template_args (tree
, tree
);
140 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
141 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
143 static int type_unification_real (tree
, tree
, tree
, const tree
*,
144 unsigned int, int, unification_kind_t
, int,
145 vec
<deferred_access_check
, va_gc
> **,
147 static void note_template_header (int);
148 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
149 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
150 static tree
convert_template_argument (tree
, tree
, tree
,
151 tsubst_flags_t
, int, tree
);
152 static int for_each_template_parm (tree
, tree_fn_t
, void*,
153 hash_set
<tree
> *, bool);
154 static tree
expand_template_argument_pack (tree
);
155 static tree
build_template_parm_index (int, int, int, tree
, tree
);
156 static bool inline_needs_template_parms (tree
, bool);
157 static void push_inline_template_parms_recursive (tree
, int);
158 static tree
retrieve_local_specialization (tree
);
159 static void register_local_specialization (tree
, tree
);
160 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
161 static int mark_template_parm (tree
, void *);
162 static int template_parm_this_level_p (tree
, void *);
163 static tree
tsubst_friend_function (tree
, tree
);
164 static tree
tsubst_friend_class (tree
, tree
);
165 static int can_complete_type_without_circularity (tree
);
166 static tree
get_bindings (tree
, tree
, tree
, bool);
167 static int template_decl_level (tree
);
168 static int check_cv_quals_for_unify (int, tree
, tree
);
169 static void template_parm_level_and_index (tree
, int*, int*);
170 static int unify_pack_expansion (tree
, tree
, tree
,
171 tree
, unification_kind_t
, bool, bool);
172 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
173 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
174 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
175 static void regenerate_decl_from_template (tree
, tree
);
176 static tree
most_specialized_class (tree
, tsubst_flags_t
);
177 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
178 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
179 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
180 static bool check_specialization_scope (void);
181 static tree
process_partial_specialization (tree
);
182 static void set_current_access_from_decl (tree
);
183 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
185 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
186 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
188 static bool template_template_parm_bindings_ok_p (tree
, tree
);
189 static int template_args_equal (tree
, tree
);
190 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
191 static tree
for_each_template_parm_r (tree
*, int *, void *);
192 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
193 static void copy_default_args_to_explicit_spec (tree
);
194 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
195 static bool dependent_template_arg_p (tree
);
196 static bool any_template_arguments_need_structural_equality_p (tree
);
197 static bool dependent_type_p_r (tree
);
198 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
199 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
200 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
201 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
202 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
203 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
205 static tree
listify (tree
);
206 static tree
listify_autos (tree
, tree
);
207 static tree
template_parm_to_arg (tree t
);
208 static tree
current_template_args (void);
209 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
210 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
212 /* Make the current scope suitable for access checking when we are
213 processing T. T can be FUNCTION_DECL for instantiated function
214 template, VAR_DECL for static member variable, or TYPE_DECL for
215 alias template (needed by instantiate_decl). */
218 push_access_scope (tree t
)
220 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
221 || TREE_CODE (t
) == TYPE_DECL
);
223 if (DECL_FRIEND_CONTEXT (t
))
224 push_nested_class (DECL_FRIEND_CONTEXT (t
));
225 else if (DECL_CLASS_SCOPE_P (t
))
226 push_nested_class (DECL_CONTEXT (t
));
228 push_to_top_level ();
230 if (TREE_CODE (t
) == FUNCTION_DECL
)
232 saved_access_scope
= tree_cons
233 (NULL_TREE
, current_function_decl
, saved_access_scope
);
234 current_function_decl
= t
;
238 /* Restore the scope set up by push_access_scope. T is the node we
242 pop_access_scope (tree t
)
244 if (TREE_CODE (t
) == FUNCTION_DECL
)
246 current_function_decl
= TREE_VALUE (saved_access_scope
);
247 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
250 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
253 pop_from_top_level ();
256 /* Do any processing required when DECL (a member template
257 declaration) is finished. Returns the TEMPLATE_DECL corresponding
258 to DECL, unless it is a specialization, in which case the DECL
259 itself is returned. */
262 finish_member_template_decl (tree decl
)
264 if (decl
== error_mark_node
)
265 return error_mark_node
;
267 gcc_assert (DECL_P (decl
));
269 if (TREE_CODE (decl
) == TYPE_DECL
)
273 type
= TREE_TYPE (decl
);
274 if (type
== error_mark_node
)
275 return error_mark_node
;
276 if (MAYBE_CLASS_TYPE_P (type
)
277 && CLASSTYPE_TEMPLATE_INFO (type
)
278 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
280 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
281 check_member_template (tmpl
);
286 else if (TREE_CODE (decl
) == FIELD_DECL
)
287 error ("data member %qD cannot be a member template", decl
);
288 else if (DECL_TEMPLATE_INFO (decl
))
290 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
292 check_member_template (DECL_TI_TEMPLATE (decl
));
293 return DECL_TI_TEMPLATE (decl
);
299 error ("invalid member template declaration %qD", decl
);
301 return error_mark_node
;
304 /* Create a template info node. */
307 build_template_info (tree template_decl
, tree template_args
)
309 tree result
= make_node (TEMPLATE_INFO
);
310 TI_TEMPLATE (result
) = template_decl
;
311 TI_ARGS (result
) = template_args
;
315 /* Return the template info node corresponding to T, whatever T is. */
318 get_template_info (const_tree t
)
320 tree tinfo
= NULL_TREE
;
322 if (!t
|| t
== error_mark_node
)
325 if (TREE_CODE (t
) == NAMESPACE_DECL
)
328 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
329 tinfo
= DECL_TEMPLATE_INFO (t
);
331 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
334 if (OVERLOAD_TYPE_P (t
))
335 tinfo
= TYPE_TEMPLATE_INFO (t
);
336 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
337 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
342 /* Returns the template nesting level of the indicated class TYPE.
352 A<T>::B<U> has depth two, while A<T> has depth one.
353 Both A<T>::B<int> and A<int>::B<U> have depth one, if
354 they are instantiations, not specializations.
356 This function is guaranteed to return 0 if passed NULL_TREE so
357 that, for example, `template_class_depth (current_class_type)' is
361 template_class_depth (tree type
)
366 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
367 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
368 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
370 tree tinfo
= get_template_info (type
);
372 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
373 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
380 /* Subroutine of maybe_begin_member_template_processing.
381 Returns true if processing DECL needs us to push template parms. */
384 inline_needs_template_parms (tree decl
, bool nsdmi
)
386 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
389 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
390 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
393 /* Subroutine of maybe_begin_member_template_processing.
394 Push the template parms in PARMS, starting from LEVELS steps into the
395 chain, and ending at the beginning, since template parms are listed
399 push_inline_template_parms_recursive (tree parmlist
, int levels
)
401 tree parms
= TREE_VALUE (parmlist
);
405 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
407 ++processing_template_decl
;
408 current_template_parms
409 = tree_cons (size_int (processing_template_decl
),
410 parms
, current_template_parms
);
411 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
413 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
415 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
417 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
419 if (error_operand_p (parm
))
422 gcc_assert (DECL_P (parm
));
424 switch (TREE_CODE (parm
))
433 /* Make a CONST_DECL as is done in process_template_parm.
434 It is ugly that we recreate this here; the original
435 version built in process_template_parm is no longer
437 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
438 CONST_DECL
, DECL_NAME (parm
),
440 DECL_ARTIFICIAL (decl
) = 1;
441 TREE_CONSTANT (decl
) = 1;
442 TREE_READONLY (decl
) = 1;
443 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
444 SET_DECL_TEMPLATE_PARM_P (decl
);
455 /* Restore the template parameter context for a member template, a
456 friend template defined in a class definition, or a non-template
457 member of template class. */
460 maybe_begin_member_template_processing (tree decl
)
464 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
468 tree ctx
= DECL_CONTEXT (decl
);
469 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
470 /* Disregard full specializations (c++/60999). */
471 && uses_template_parms (ctx
)
472 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
475 if (inline_needs_template_parms (decl
, nsdmi
))
477 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
478 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
480 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
483 parms
= TREE_CHAIN (parms
);
486 push_inline_template_parms_recursive (parms
, levels
);
489 /* Remember how many levels of template parameters we pushed so that
490 we can pop them later. */
491 inline_parm_levels
.safe_push (levels
);
494 /* Undo the effects of maybe_begin_member_template_processing. */
497 maybe_end_member_template_processing (void)
502 if (inline_parm_levels
.length () == 0)
505 last
= inline_parm_levels
.pop ();
506 for (i
= 0; i
< last
; ++i
)
508 --processing_template_decl
;
509 current_template_parms
= TREE_CHAIN (current_template_parms
);
514 /* Return a new template argument vector which contains all of ARGS,
515 but has as its innermost set of arguments the EXTRA_ARGS. */
518 add_to_template_args (tree args
, tree extra_args
)
525 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
528 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
529 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
531 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
532 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
534 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
535 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
540 /* Like add_to_template_args, but only the outermost ARGS are added to
541 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
542 (EXTRA_ARGS) levels are added. This function is used to combine
543 the template arguments from a partial instantiation with the
544 template arguments used to attain the full instantiation from the
545 partial instantiation. */
548 add_outermost_template_args (tree args
, tree extra_args
)
552 /* If there are more levels of EXTRA_ARGS than there are ARGS,
553 something very fishy is going on. */
554 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
556 /* If *all* the new arguments will be the EXTRA_ARGS, just return
558 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
561 /* For the moment, we make ARGS look like it contains fewer levels. */
562 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
564 new_args
= add_to_template_args (args
, extra_args
);
566 /* Now, we restore ARGS to its full dimensions. */
567 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
572 /* Return the N levels of innermost template arguments from the ARGS. */
575 get_innermost_template_args (tree args
, int n
)
583 /* If N is 1, just return the innermost set of template arguments. */
585 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
587 /* If we're not removing anything, just return the arguments we were
589 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
590 gcc_assert (extra_levels
>= 0);
591 if (extra_levels
== 0)
594 /* Make a new set of arguments, not containing the outer arguments. */
595 new_args
= make_tree_vec (n
);
596 for (i
= 1; i
<= n
; ++i
)
597 SET_TMPL_ARGS_LEVEL (new_args
, i
,
598 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
603 /* The inverse of get_innermost_template_args: Return all but the innermost
604 EXTRA_LEVELS levels of template arguments from the ARGS. */
607 strip_innermost_template_args (tree args
, int extra_levels
)
610 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
615 /* If N is 1, just return the outermost set of template arguments. */
617 return TMPL_ARGS_LEVEL (args
, 1);
619 /* If we're not removing anything, just return the arguments we were
621 gcc_assert (extra_levels
>= 0);
622 if (extra_levels
== 0)
625 /* Make a new set of arguments, not containing the inner arguments. */
626 new_args
= make_tree_vec (n
);
627 for (i
= 1; i
<= n
; ++i
)
628 SET_TMPL_ARGS_LEVEL (new_args
, i
,
629 TMPL_ARGS_LEVEL (args
, i
));
634 /* We've got a template header coming up; push to a new level for storing
638 begin_template_parm_list (void)
640 /* We use a non-tag-transparent scope here, which causes pushtag to
641 put tags in this scope, rather than in the enclosing class or
642 namespace scope. This is the right thing, since we want
643 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
644 global template class, push_template_decl handles putting the
645 TEMPLATE_DECL into top-level scope. For a nested template class,
648 template <class T> struct S1 {
649 template <class T> struct S2 {};
652 pushtag contains special code to call pushdecl_with_scope on the
653 TEMPLATE_DECL for S2. */
654 begin_scope (sk_template_parms
, NULL
);
655 ++processing_template_decl
;
656 ++processing_template_parmlist
;
657 note_template_header (0);
660 /* This routine is called when a specialization is declared. If it is
661 invalid to declare a specialization here, an error is reported and
662 false is returned, otherwise this routine will return true. */
665 check_specialization_scope (void)
667 tree scope
= current_scope ();
671 An explicit specialization shall be declared in the namespace of
672 which the template is a member, or, for member templates, in the
673 namespace of which the enclosing class or enclosing class
674 template is a member. An explicit specialization of a member
675 function, member class or static data member of a class template
676 shall be declared in the namespace of which the class template
678 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
680 error ("explicit specialization in non-namespace scope %qD", scope
);
686 In an explicit specialization declaration for a member of a class
687 template or a member template that appears in namespace scope,
688 the member template and some of its enclosing class templates may
689 remain unspecialized, except that the declaration shall not
690 explicitly specialize a class member template if its enclosing
691 class templates are not explicitly specialized as well. */
692 if (current_template_parms
)
694 error ("enclosing class templates are not explicitly specialized");
701 /* We've just seen template <>. */
704 begin_specialization (void)
706 begin_scope (sk_template_spec
, NULL
);
707 note_template_header (1);
708 return check_specialization_scope ();
711 /* Called at then end of processing a declaration preceded by
715 end_specialization (void)
718 reset_specialization ();
721 /* Any template <>'s that we have seen thus far are not referring to a
722 function specialization. */
725 reset_specialization (void)
727 processing_specialization
= 0;
728 template_header_count
= 0;
731 /* We've just seen a template header. If SPECIALIZATION is nonzero,
732 it was of the form template <>. */
735 note_template_header (int specialization
)
737 processing_specialization
= specialization
;
738 template_header_count
++;
741 /* We're beginning an explicit instantiation. */
744 begin_explicit_instantiation (void)
746 gcc_assert (!processing_explicit_instantiation
);
747 processing_explicit_instantiation
= true;
752 end_explicit_instantiation (void)
754 gcc_assert (processing_explicit_instantiation
);
755 processing_explicit_instantiation
= false;
758 /* An explicit specialization or partial specialization of TMPL is being
759 declared. Check that the namespace in which the specialization is
760 occurring is permissible. Returns false iff it is invalid to
761 specialize TMPL in the current namespace. */
764 check_specialization_namespace (tree tmpl
)
766 tree tpl_ns
= decl_namespace_context (tmpl
);
770 An explicit specialization shall be declared in the namespace of
771 which the template is a member, or, for member templates, in the
772 namespace of which the enclosing class or enclosing class
773 template is a member. An explicit specialization of a member
774 function, member class or static data member of a class template
775 shall be declared in the namespace of which the class template is
777 if (current_scope() != DECL_CONTEXT (tmpl
)
778 && !at_namespace_scope_p ())
780 error ("specialization of %qD must appear at namespace scope", tmpl
);
783 if (is_associated_namespace (current_namespace
, tpl_ns
))
784 /* Same or super-using namespace. */
788 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
789 permerror (input_location
, " from definition of %q+#D", tmpl
);
794 /* SPEC is an explicit instantiation. Check that it is valid to
795 perform this explicit instantiation in the current namespace. */
798 check_explicit_instantiation_namespace (tree spec
)
802 /* DR 275: An explicit instantiation shall appear in an enclosing
803 namespace of its template. */
804 ns
= decl_namespace_context (spec
);
805 if (!is_ancestor (current_namespace
, ns
))
806 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
807 "(which does not enclose namespace %qD)",
808 spec
, current_namespace
, ns
);
811 /* The TYPE is being declared. If it is a template type, that means it
812 is a partial specialization. Do appropriate error-checking. */
815 maybe_process_partial_specialization (tree type
)
819 if (type
== error_mark_node
)
820 return error_mark_node
;
822 /* A lambda that appears in specialization context is not itself a
824 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
827 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
829 error ("name of class shadows template template parameter %qD",
831 return error_mark_node
;
834 context
= TYPE_CONTEXT (type
);
836 if (TYPE_ALIAS_P (type
))
838 if (TYPE_TEMPLATE_INFO (type
)
839 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
840 error ("specialization of alias template %qD",
841 TYPE_TI_TEMPLATE (type
));
843 error ("explicit specialization of non-template %qT", type
);
844 return error_mark_node
;
846 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
848 /* This is for ordinary explicit specialization and partial
849 specialization of a template class such as:
851 template <> class C<int>;
855 template <class T> class C<T*>;
857 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
859 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
860 && !COMPLETE_TYPE_P (type
))
862 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
))
863 && !at_namespace_scope_p ())
864 return error_mark_node
;
865 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
866 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
867 if (processing_template_decl
)
869 if (push_template_decl (TYPE_MAIN_DECL (type
))
871 return error_mark_node
;
874 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
875 error ("specialization of %qT after instantiation", type
);
876 else if (errorcount
&& !processing_specialization
877 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
878 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
879 /* Trying to define a specialization either without a template<> header
880 or in an inappropriate place. We've already given an error, so just
881 bail now so we don't actually define the specialization. */
882 return error_mark_node
;
884 else if (CLASS_TYPE_P (type
)
885 && !CLASSTYPE_USE_TEMPLATE (type
)
886 && CLASSTYPE_TEMPLATE_INFO (type
)
887 && context
&& CLASS_TYPE_P (context
)
888 && CLASSTYPE_TEMPLATE_INFO (context
))
890 /* This is for an explicit specialization of member class
891 template according to [temp.expl.spec/18]:
893 template <> template <class U> class C<int>::D;
895 The context `C<int>' must be an implicit instantiation.
896 Otherwise this is just a member class template declared
899 template <> class C<int> { template <class U> class D; };
900 template <> template <class U> class C<int>::D;
902 In the first case, `C<int>::D' is a specialization of `C<T>::D'
903 while in the second case, `C<int>::D' is a primary template
904 and `C<T>::D' may not exist. */
906 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
907 && !COMPLETE_TYPE_P (type
))
910 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
912 if (current_namespace
913 != decl_namespace_context (tmpl
))
915 permerror (input_location
, "specializing %q#T in different namespace", type
);
916 permerror (input_location
, " from definition of %q+#D", tmpl
);
919 /* Check for invalid specialization after instantiation:
921 template <> template <> class C<int>::D<int>;
922 template <> template <class U> class C<int>::D; */
924 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
925 t
; t
= TREE_CHAIN (t
))
927 tree inst
= TREE_VALUE (t
);
928 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
929 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
931 /* We already have a full specialization of this partial
932 instantiation, or a full specialization has been
933 looked up but not instantiated. Reassign it to the
934 new member specialization template. */
938 elt
.tmpl
= most_general_template (tmpl
);
939 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
942 type_specializations
->remove_elt (&elt
);
945 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
948 = type_specializations
->find_slot (&elt
, INSERT
);
949 entry
= ggc_alloc
<spec_entry
> ();
954 /* But if we've had an implicit instantiation, that's a
955 problem ([temp.expl.spec]/6). */
956 error ("specialization %qT after instantiation %qT",
960 /* Mark TYPE as a specialization. And as a result, we only
961 have one level of template argument for the innermost
963 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
964 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
965 CLASSTYPE_TI_ARGS (type
)
966 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
969 else if (processing_specialization
)
971 /* Someday C++0x may allow for enum template specialization. */
972 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
973 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
974 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
975 "of %qD not allowed by ISO C++", type
);
978 error ("explicit specialization of non-template %qT", type
);
979 return error_mark_node
;
986 /* Returns nonzero if we can optimize the retrieval of specializations
987 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
988 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
991 optimize_specialization_lookup_p (tree tmpl
)
993 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
994 && DECL_CLASS_SCOPE_P (tmpl
)
995 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
997 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
998 /* The optimized lookup depends on the fact that the
999 template arguments for the member function template apply
1000 purely to the containing class, which is not true if the
1001 containing class is an explicit or partial
1003 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1004 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1005 && !DECL_CONV_FN_P (tmpl
)
1006 /* It is possible to have a template that is not a member
1007 template and is not a member of a template class:
1009 template <typename T>
1010 struct S { friend A::f(); };
1012 Here, the friend function is a template, but the context does
1013 not have template information. The optimized lookup relies
1014 on having ARGS be the template arguments for both the class
1015 and the function template. */
1016 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1019 /* Retrieve the specialization (in the sense of [temp.spec] - a
1020 specialization is either an instantiation or an explicit
1021 specialization) of TMPL for the given template ARGS. If there is
1022 no such specialization, return NULL_TREE. The ARGS are a vector of
1023 arguments, or a vector of vectors of arguments, in the case of
1024 templates with more than one level of parameters.
1026 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1027 then we search for a partial specialization matching ARGS. This
1028 parameter is ignored if TMPL is not a class template.
1030 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1031 result is a NONTYPE_ARGUMENT_PACK. */
1034 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1036 if (tmpl
== NULL_TREE
)
1039 if (args
== error_mark_node
)
1042 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1043 || TREE_CODE (tmpl
) == FIELD_DECL
);
1045 /* There should be as many levels of arguments as there are
1046 levels of parameters. */
1047 gcc_assert (TMPL_ARGS_DEPTH (args
)
1048 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1049 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1050 : template_class_depth (DECL_CONTEXT (tmpl
))));
1052 if (optimize_specialization_lookup_p (tmpl
))
1054 tree class_template
;
1055 tree class_specialization
;
1056 vec
<tree
, va_gc
> *methods
;
1060 /* The template arguments actually apply to the containing
1061 class. Find the class specialization with those
1063 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1064 class_specialization
1065 = retrieve_specialization (class_template
, args
, 0);
1066 if (!class_specialization
)
1068 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1069 for the specialization. */
1070 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1073 /* Iterate through the methods with the indicated name, looking
1074 for the one that has an instance of TMPL. */
1075 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1076 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1078 tree fn
= OVL_CURRENT (fns
);
1079 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1080 /* using-declarations can add base methods to the method vec,
1081 and we don't want those here. */
1082 && DECL_CONTEXT (fn
) == class_specialization
)
1091 hash_table
<spec_hasher
> *specializations
;
1095 elt
.spec
= NULL_TREE
;
1097 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1098 specializations
= type_specializations
;
1100 specializations
= decl_specializations
;
1103 hash
= spec_hasher::hash (&elt
);
1104 found
= specializations
->find_with_hash (&elt
, hash
);
1112 /* Like retrieve_specialization, but for local declarations. */
1115 retrieve_local_specialization (tree tmpl
)
1117 if (local_specializations
== NULL
)
1120 tree
*slot
= local_specializations
->get (tmpl
);
1121 return slot
? *slot
: NULL_TREE
;
1124 /* Returns nonzero iff DECL is a specialization of TMPL. */
1127 is_specialization_of (tree decl
, tree tmpl
)
1131 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1135 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1141 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1143 for (t
= TREE_TYPE (decl
);
1145 t
= CLASSTYPE_USE_TEMPLATE (t
)
1146 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1147 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1154 /* Returns nonzero iff DECL is a specialization of friend declaration
1155 FRIEND_DECL according to [temp.friend]. */
1158 is_specialization_of_friend (tree decl
, tree friend_decl
)
1160 bool need_template
= true;
1163 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1164 || TREE_CODE (decl
) == TYPE_DECL
);
1166 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1167 of a template class, we want to check if DECL is a specialization
1169 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1170 && DECL_TEMPLATE_INFO (friend_decl
)
1171 && !DECL_USE_TEMPLATE (friend_decl
))
1173 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1174 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1175 need_template
= false;
1177 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1178 && !PRIMARY_TEMPLATE_P (friend_decl
))
1179 need_template
= false;
1181 /* There is nothing to do if this is not a template friend. */
1182 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1185 if (is_specialization_of (decl
, friend_decl
))
1189 A member of a class template may be declared to be a friend of a
1190 non-template class. In this case, the corresponding member of
1191 every specialization of the class template is a friend of the
1192 class granting friendship.
1194 For example, given a template friend declaration
1196 template <class T> friend void A<T>::f();
1198 the member function below is considered a friend
1200 template <> struct A<int> {
1204 For this type of template friend, TEMPLATE_DEPTH below will be
1205 nonzero. To determine if DECL is a friend of FRIEND, we first
1206 check if the enclosing class is a specialization of another. */
1208 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1210 && DECL_CLASS_SCOPE_P (decl
)
1211 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1212 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1214 /* Next, we check the members themselves. In order to handle
1215 a few tricky cases, such as when FRIEND_DECL's are
1217 template <class T> friend void A<T>::g(T t);
1218 template <class T> template <T t> friend void A<T>::h();
1222 void A<int>::g(int);
1223 template <int> void A<int>::h();
1225 we need to figure out ARGS, the template arguments from
1226 the context of DECL. This is required for template substitution
1227 of `T' in the function parameter of `g' and template parameter
1228 of `h' in the above examples. Here ARGS corresponds to `int'. */
1230 tree context
= DECL_CONTEXT (decl
);
1231 tree args
= NULL_TREE
;
1232 int current_depth
= 0;
1234 while (current_depth
< template_depth
)
1236 if (CLASSTYPE_TEMPLATE_INFO (context
))
1238 if (current_depth
== 0)
1239 args
= TYPE_TI_ARGS (context
);
1241 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1244 context
= TYPE_CONTEXT (context
);
1247 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1252 tree friend_args_type
;
1253 tree decl_args_type
;
1255 /* Make sure that both DECL and FRIEND_DECL are templates or
1257 is_template
= DECL_TEMPLATE_INFO (decl
)
1258 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1259 if (need_template
^ is_template
)
1261 else if (is_template
)
1263 /* If both are templates, check template parameter list. */
1265 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1267 if (!comp_template_parms
1268 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1272 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1275 decl_type
= TREE_TYPE (decl
);
1277 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1278 tf_none
, NULL_TREE
);
1279 if (friend_type
== error_mark_node
)
1282 /* Check if return types match. */
1283 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1286 /* Check if function parameter types match, ignoring the
1287 `this' parameter. */
1288 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1289 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1290 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1291 friend_args_type
= TREE_CHAIN (friend_args_type
);
1292 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1293 decl_args_type
= TREE_CHAIN (decl_args_type
);
1295 return compparms (decl_args_type
, friend_args_type
);
1299 /* DECL is a TYPE_DECL */
1301 tree decl_type
= TREE_TYPE (decl
);
1303 /* Make sure that both DECL and FRIEND_DECL are templates or
1306 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1307 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1309 if (need_template
^ is_template
)
1311 else if (is_template
)
1314 /* If both are templates, check the name of the two
1315 TEMPLATE_DECL's first because is_friend didn't. */
1316 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1317 != DECL_NAME (friend_decl
))
1320 /* Now check template parameter list. */
1322 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1324 return comp_template_parms
1325 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1329 return (DECL_NAME (decl
)
1330 == DECL_NAME (friend_decl
));
1336 /* Register the specialization SPEC as a specialization of TMPL with
1337 the indicated ARGS. IS_FRIEND indicates whether the specialization
1338 is actually just a friend declaration. Returns SPEC, or an
1339 equivalent prior declaration, if available.
1341 We also store instantiations of field packs in the hash table, even
1342 though they are not themselves templates, to make lookup easier. */
1345 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1349 spec_entry
**slot
= NULL
;
1352 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1353 || (TREE_CODE (tmpl
) == FIELD_DECL
1354 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1356 if (TREE_CODE (spec
) == FUNCTION_DECL
1357 && uses_template_parms (DECL_TI_ARGS (spec
)))
1358 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1359 register it; we want the corresponding TEMPLATE_DECL instead.
1360 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1361 the more obvious `uses_template_parms (spec)' to avoid problems
1362 with default function arguments. In particular, given
1363 something like this:
1365 template <class T> void f(T t1, T t = T())
1367 the default argument expression is not substituted for in an
1368 instantiation unless and until it is actually needed. */
1371 if (optimize_specialization_lookup_p (tmpl
))
1372 /* We don't put these specializations in the hash table, but we might
1373 want to give an error about a mismatch. */
1374 fn
= retrieve_specialization (tmpl
, args
, 0);
1382 hash
= spec_hasher::hash (&elt
);
1385 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1387 fn
= ((spec_entry
*) *slot
)->spec
;
1392 /* We can sometimes try to re-register a specialization that we've
1393 already got. In particular, regenerate_decl_from_template calls
1394 duplicate_decls which will update the specialization list. But,
1395 we'll still get called again here anyhow. It's more convenient
1396 to simply allow this than to try to prevent it. */
1399 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1401 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1403 if (DECL_ODR_USED (fn
)
1404 || DECL_EXPLICIT_INSTANTIATION (fn
))
1406 error ("specialization of %qD after instantiation",
1408 return error_mark_node
;
1413 /* This situation should occur only if the first
1414 specialization is an implicit instantiation, the
1415 second is an explicit specialization, and the
1416 implicit instantiation has not yet been used. That
1417 situation can occur if we have implicitly
1418 instantiated a member function and then specialized
1421 We can also wind up here if a friend declaration that
1422 looked like an instantiation turns out to be a
1425 template <class T> void foo(T);
1426 class S { friend void foo<>(int) };
1427 template <> void foo(int);
1429 We transform the existing DECL in place so that any
1430 pointers to it become pointers to the updated
1433 If there was a definition for the template, but not
1434 for the specialization, we want this to look as if
1435 there were no definition, and vice versa. */
1436 DECL_INITIAL (fn
) = NULL_TREE
;
1437 duplicate_decls (spec
, fn
, is_friend
);
1438 /* The call to duplicate_decls will have applied
1441 An explicit specialization of a function template
1442 is inline only if it is explicitly declared to be,
1443 and independently of whether its function template
1446 to the primary function; now copy the inline bits to
1447 the various clones. */
1448 FOR_EACH_CLONE (clone
, fn
)
1450 DECL_DECLARED_INLINE_P (clone
)
1451 = DECL_DECLARED_INLINE_P (fn
);
1452 DECL_SOURCE_LOCATION (clone
)
1453 = DECL_SOURCE_LOCATION (fn
);
1454 DECL_DELETED_FN (clone
)
1455 = DECL_DELETED_FN (fn
);
1457 check_specialization_namespace (tmpl
);
1462 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1464 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1465 /* Dup decl failed, but this is a new definition. Set the
1466 line number so any errors match this new
1468 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1474 return duplicate_decls (spec
, fn
, is_friend
);
1476 /* A specialization must be declared in the same namespace as the
1477 template it is specializing. */
1478 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1479 && !check_specialization_namespace (tmpl
))
1480 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1482 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1484 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1485 gcc_assert (tmpl
&& args
&& spec
);
1488 if (TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1489 && PRIMARY_TEMPLATE_P (tmpl
)
1490 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1491 /* TMPL is a forward declaration of a template function; keep a list
1492 of all specializations in case we need to reassign them to a friend
1493 template later in tsubst_friend_function. */
1494 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1495 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1501 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1502 TMPL and ARGS members, ignores SPEC. */
1504 int comparing_specializations
;
1507 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1511 ++comparing_specializations
;
1512 equal
= (e1
->tmpl
== e2
->tmpl
1513 && comp_template_args (e1
->args
, e2
->args
));
1514 --comparing_specializations
;
1519 /* Returns a hash for a template TMPL and template arguments ARGS. */
1522 hash_tmpl_and_args (tree tmpl
, tree args
)
1524 hashval_t val
= DECL_UID (tmpl
);
1525 return iterative_hash_template_arg (args
, val
);
1528 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1532 spec_hasher::hash (spec_entry
*e
)
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 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1602 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1604 val
= iterative_hash_template_arg (field
, val
);
1605 val
= iterative_hash_template_arg (value
, val
);
1611 if (!DECL_ARTIFICIAL (arg
))
1613 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1614 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1616 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1619 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1622 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1623 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1625 case TEMPLATE_PARM_INDEX
:
1626 val
= iterative_hash_template_arg
1627 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1628 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1629 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1632 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1633 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1634 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1637 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1639 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1643 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1644 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1645 val
= iterative_hash_object (code
, val
);
1646 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1649 /* A lambda can't appear in a template arg, but don't crash on
1651 gcc_assert (seen_error ());
1655 case IMPLICIT_CONV_EXPR
:
1656 case STATIC_CAST_EXPR
:
1657 case REINTERPRET_CAST_EXPR
:
1658 case CONST_CAST_EXPR
:
1659 case DYNAMIC_CAST_EXPR
:
1661 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1662 /* Now hash operands as usual. */
1672 if (TYPE_CANONICAL (arg
))
1673 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1675 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1676 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1677 /* Otherwise just compare the types during lookup. */
1680 case tcc_declaration
:
1682 return iterative_hash_expr (arg
, val
);
1685 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1687 unsigned n
= cp_tree_operand_length (arg
);
1688 for (i
= 0; i
< n
; ++i
)
1689 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1697 /* Unregister the specialization SPEC as a specialization of TMPL.
1698 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1699 if the SPEC was listed as a specialization of TMPL.
1701 Note that SPEC has been ggc_freed, so we can't look inside it. */
1704 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1709 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1710 elt
.args
= TI_ARGS (tinfo
);
1711 elt
.spec
= NULL_TREE
;
1713 entry
= decl_specializations
->find (&elt
);
1716 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1717 gcc_assert (new_spec
!= NULL_TREE
);
1718 entry
->spec
= new_spec
;
1725 /* Like register_specialization, but for local declarations. We are
1726 registering SPEC, an instantiation of TMPL. */
1729 register_local_specialization (tree spec
, tree tmpl
)
1731 local_specializations
->put (tmpl
, spec
);
1734 /* TYPE is a class type. Returns true if TYPE is an explicitly
1735 specialized class. */
1738 explicit_class_specialization_p (tree type
)
1740 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1742 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1745 /* Print the list of functions at FNS, going through all the overloads
1746 for each element of the list. Alternatively, FNS can not be a
1747 TREE_LIST, in which case it will be printed together with all the
1750 MORE and *STR should respectively be FALSE and NULL when the function
1751 is called from the outside. They are used internally on recursive
1752 calls. print_candidates manages the two parameters and leaves NULL
1753 in *STR when it ends. */
1756 print_candidates_1 (tree fns
, bool more
, const char **str
)
1759 char *spaces
= NULL
;
1761 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1762 if (TREE_CODE (fn
) == TREE_LIST
)
1764 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1765 print_candidates_1 (TREE_VALUE (fn2
),
1766 TREE_CHAIN (fn2
) || more
, str
);
1770 tree cand
= OVL_CURRENT (fn
);
1773 /* Pick the prefix string. */
1774 if (!more
&& !OVL_NEXT (fns
))
1776 inform (DECL_SOURCE_LOCATION (cand
),
1777 "candidate is: %#D", cand
);
1781 *str
= _("candidates are:");
1782 spaces
= get_spaces (*str
);
1784 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1785 *str
= spaces
? spaces
: *str
;
1795 /* Print the list of candidate FNS in an error message. FNS can also
1796 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1799 print_candidates (tree fns
)
1801 const char *str
= NULL
;
1802 print_candidates_1 (fns
, false, &str
);
1803 gcc_assert (str
== NULL
);
1806 /* Returns the template (one of the functions given by TEMPLATE_ID)
1807 which can be specialized to match the indicated DECL with the
1808 explicit template args given in TEMPLATE_ID. The DECL may be
1809 NULL_TREE if none is available. In that case, the functions in
1810 TEMPLATE_ID are non-members.
1812 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1813 specialization of a member template.
1815 The TEMPLATE_COUNT is the number of references to qualifying
1816 template classes that appeared in the name of the function. See
1817 check_explicit_specialization for a more accurate description.
1819 TSK indicates what kind of template declaration (if any) is being
1820 declared. TSK_TEMPLATE indicates that the declaration given by
1821 DECL, though a FUNCTION_DECL, has template parameters, and is
1822 therefore a template function.
1824 The template args (those explicitly specified and those deduced)
1825 are output in a newly created vector *TARGS_OUT.
1827 If it is impossible to determine the result, an error message is
1828 issued. The error_mark_node is returned to indicate failure. */
1831 determine_specialization (tree template_id
,
1834 int need_member_template
,
1840 tree explicit_targs
;
1841 tree candidates
= NULL_TREE
;
1842 /* A TREE_LIST of templates of which DECL may be a specialization.
1843 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1844 corresponding TREE_PURPOSE is the set of template arguments that,
1845 when used to instantiate the template, would produce a function
1846 with the signature of DECL. */
1847 tree templates
= NULL_TREE
;
1849 cp_binding_level
*b
;
1851 *targs_out
= NULL_TREE
;
1853 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1854 return error_mark_node
;
1856 /* We shouldn't be specializing a member template of an
1857 unspecialized class template; we already gave an error in
1858 check_specialization_scope, now avoid crashing. */
1859 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
1860 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
1862 gcc_assert (errorcount
);
1863 return error_mark_node
;
1866 fns
= TREE_OPERAND (template_id
, 0);
1867 explicit_targs
= TREE_OPERAND (template_id
, 1);
1869 if (fns
== error_mark_node
)
1870 return error_mark_node
;
1872 /* Check for baselinks. */
1873 if (BASELINK_P (fns
))
1874 fns
= BASELINK_FUNCTIONS (fns
);
1876 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
1878 error ("%qD is not a function template", fns
);
1879 return error_mark_node
;
1881 else if (VAR_P (decl
) && !variable_template_p (fns
))
1883 error ("%qD is not a variable template", fns
);
1884 return error_mark_node
;
1887 /* Count the number of template headers specified for this
1890 for (b
= current_binding_level
;
1891 b
->kind
== sk_template_parms
;
1895 if (variable_template_p (fns
))
1896 templates
= tree_cons (explicit_targs
, fns
, templates
);
1897 else for (; fns
; fns
= OVL_NEXT (fns
))
1899 tree fn
= OVL_CURRENT (fns
);
1901 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1903 tree decl_arg_types
;
1907 /* In case of explicit specialization, we need to check if
1908 the number of template headers appearing in the specialization
1909 is correct. This is usually done in check_explicit_specialization,
1910 but the check done there cannot be exhaustive when specializing
1911 member functions. Consider the following code:
1913 template <> void A<int>::f(int);
1914 template <> template <> void A<int>::f(int);
1916 Assuming that A<int> is not itself an explicit specialization
1917 already, the first line specializes "f" which is a non-template
1918 member function, whilst the second line specializes "f" which
1919 is a template member function. So both lines are syntactically
1920 correct, and check_explicit_specialization does not reject
1923 Here, we can do better, as we are matching the specialization
1924 against the declarations. We count the number of template
1925 headers, and we check if they match TEMPLATE_COUNT + 1
1926 (TEMPLATE_COUNT is the number of qualifying template classes,
1927 plus there must be another header for the member template
1930 Notice that if header_count is zero, this is not a
1931 specialization but rather a template instantiation, so there
1932 is no check we can perform here. */
1933 if (header_count
&& header_count
!= template_count
+ 1)
1936 /* Check that the number of template arguments at the
1937 innermost level for DECL is the same as for FN. */
1938 if (current_binding_level
->kind
== sk_template_parms
1939 && !current_binding_level
->explicit_spec_p
1940 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1941 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1942 (current_template_parms
))))
1945 /* DECL might be a specialization of FN. */
1946 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1947 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1949 /* For a non-static member function, we need to make sure
1950 that the const qualification is the same. Since
1951 get_bindings does not try to merge the "this" parameter,
1952 we must do the comparison explicitly. */
1953 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1954 && !same_type_p (TREE_VALUE (fn_arg_types
),
1955 TREE_VALUE (decl_arg_types
)))
1958 /* Skip the "this" parameter and, for constructors of
1959 classes with virtual bases, the VTT parameter. A
1960 full specialization of a constructor will have a VTT
1961 parameter, but a template never will. */
1963 = skip_artificial_parms_for (decl
, decl_arg_types
);
1965 = skip_artificial_parms_for (fn
, fn_arg_types
);
1967 /* Function templates cannot be specializations; there are
1968 no partial specializations of functions. Therefore, if
1969 the type of DECL does not match FN, there is no
1971 if (tsk
== tsk_template
)
1973 if (compparms (fn_arg_types
, decl_arg_types
))
1974 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1978 /* See whether this function might be a specialization of this
1979 template. Suppress access control because we might be trying
1980 to make this specialization a friend, and we have already done
1981 access control for the declaration of the specialization. */
1982 push_deferring_access_checks (dk_no_check
);
1983 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1984 pop_deferring_access_checks ();
1987 /* We cannot deduce template arguments that when used to
1988 specialize TMPL will produce DECL. */
1991 /* Make sure that the deduced arguments actually work. */
1992 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
1993 if (insttype
== error_mark_node
)
1996 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
1997 if (!compparms (fn_arg_types
, decl_arg_types
))
2000 /* Save this template, and the arguments deduced. */
2001 templates
= tree_cons (targs
, fn
, templates
);
2003 else if (need_member_template
)
2004 /* FN is an ordinary member function, and we need a
2005 specialization of a member template. */
2007 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2008 /* We can get IDENTIFIER_NODEs here in certain erroneous
2011 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2012 /* This is just an ordinary non-member function. Nothing can
2013 be a specialization of that. */
2015 else if (DECL_ARTIFICIAL (fn
))
2016 /* Cannot specialize functions that are created implicitly. */
2020 tree decl_arg_types
;
2022 /* This is an ordinary member function. However, since
2023 we're here, we can assume its enclosing class is a
2024 template class. For example,
2026 template <typename T> struct S { void f(); };
2027 template <> void S<int>::f() {}
2029 Here, S<int>::f is a non-template, but S<int> is a
2030 template class. If FN has the same type as DECL, we
2031 might be in business. */
2033 if (!DECL_TEMPLATE_INFO (fn
))
2034 /* Its enclosing class is an explicit specialization
2035 of a template class. This is not a candidate. */
2038 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2039 TREE_TYPE (TREE_TYPE (fn
))))
2040 /* The return types differ. */
2043 /* Adjust the type of DECL in case FN is a static member. */
2044 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2045 if (DECL_STATIC_FUNCTION_P (fn
)
2046 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2047 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2049 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2052 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2056 if (templates
&& TREE_CHAIN (templates
))
2062 It is possible for a specialization with a given function
2063 signature to be instantiated from more than one function
2064 template. In such cases, explicit specification of the
2065 template arguments must be used to uniquely identify the
2066 function template specialization being specialized.
2068 Note that here, there's no suggestion that we're supposed to
2069 determine which of the candidate templates is most
2070 specialized. However, we, also have:
2074 Partial ordering of overloaded function template
2075 declarations is used in the following contexts to select
2076 the function template to which a function template
2077 specialization refers:
2079 -- when an explicit specialization refers to a function
2082 So, we do use the partial ordering rules, at least for now.
2083 This extension can only serve to make invalid programs valid,
2084 so it's safe. And, there is strong anecdotal evidence that
2085 the committee intended the partial ordering rules to apply;
2086 the EDG front end has that behavior, and John Spicer claims
2087 that the committee simply forgot to delete the wording in
2088 [temp.expl.spec]. */
2089 tree tmpl
= most_specialized_instantiation (templates
);
2090 if (tmpl
!= error_mark_node
)
2093 TREE_CHAIN (templates
) = NULL_TREE
;
2097 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2099 error ("template-id %qD for %q+D does not match any template "
2100 "declaration", template_id
, decl
);
2101 if (header_count
&& header_count
!= template_count
+ 1)
2102 inform (input_location
, "saw %d %<template<>%>, need %d for "
2103 "specializing a member function template",
2104 header_count
, template_count
+ 1);
2105 return error_mark_node
;
2107 else if ((templates
&& TREE_CHAIN (templates
))
2108 || (candidates
&& TREE_CHAIN (candidates
))
2109 || (templates
&& candidates
))
2111 error ("ambiguous template specialization %qD for %q+D",
2113 candidates
= chainon (candidates
, templates
);
2114 print_candidates (candidates
);
2115 return error_mark_node
;
2118 /* We have one, and exactly one, match. */
2121 tree fn
= TREE_VALUE (candidates
);
2122 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2123 /* DECL is a re-declaration or partial instantiation of a template
2125 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2127 /* It was a specialization of an ordinary member function in a
2129 return DECL_TI_TEMPLATE (fn
);
2132 /* It was a specialization of a template. */
2133 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2134 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2136 *targs_out
= copy_node (targs
);
2137 SET_TMPL_ARGS_LEVEL (*targs_out
,
2138 TMPL_ARGS_DEPTH (*targs_out
),
2139 TREE_PURPOSE (templates
));
2142 *targs_out
= TREE_PURPOSE (templates
);
2143 return TREE_VALUE (templates
);
2146 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2147 but with the default argument values filled in from those in the
2151 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2154 tree new_spec_types
;
2159 if (spec_types
== void_list_node
)
2160 return void_list_node
;
2162 /* Substitute into the rest of the list. */
2164 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2165 TREE_CHAIN (tmpl_types
));
2167 /* Add the default argument for this parameter. */
2168 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2169 TREE_VALUE (spec_types
),
2173 /* DECL is an explicit specialization. Replicate default arguments
2174 from the template it specializes. (That way, code like:
2176 template <class T> void f(T = 3);
2177 template <> void f(double);
2180 works, as required.) An alternative approach would be to look up
2181 the correct default arguments at the call-site, but this approach
2182 is consistent with how implicit instantiations are handled. */
2185 copy_default_args_to_explicit_spec (tree decl
)
2190 tree new_spec_types
;
2194 tree object_type
= NULL_TREE
;
2195 tree in_charge
= NULL_TREE
;
2196 tree vtt
= NULL_TREE
;
2198 /* See if there's anything we need to do. */
2199 tmpl
= DECL_TI_TEMPLATE (decl
);
2200 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2201 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2202 if (TREE_PURPOSE (t
))
2207 old_type
= TREE_TYPE (decl
);
2208 spec_types
= TYPE_ARG_TYPES (old_type
);
2210 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2212 /* Remove the this pointer, but remember the object's type for
2214 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2215 spec_types
= TREE_CHAIN (spec_types
);
2216 tmpl_types
= TREE_CHAIN (tmpl_types
);
2218 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2220 /* DECL may contain more parameters than TMPL due to the extra
2221 in-charge parameter in constructors and destructors. */
2222 in_charge
= spec_types
;
2223 spec_types
= TREE_CHAIN (spec_types
);
2225 if (DECL_HAS_VTT_PARM_P (decl
))
2228 spec_types
= TREE_CHAIN (spec_types
);
2232 /* Compute the merged default arguments. */
2234 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2236 /* Compute the new FUNCTION_TYPE. */
2240 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2245 /* Put the in-charge parameter back. */
2246 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2247 TREE_VALUE (in_charge
),
2250 new_type
= build_method_type_directly (object_type
,
2251 TREE_TYPE (old_type
),
2255 new_type
= build_function_type (TREE_TYPE (old_type
),
2257 new_type
= cp_build_type_attribute_variant (new_type
,
2258 TYPE_ATTRIBUTES (old_type
));
2259 new_type
= build_exception_variant (new_type
,
2260 TYPE_RAISES_EXCEPTIONS (old_type
));
2262 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2263 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2265 TREE_TYPE (decl
) = new_type
;
2268 /* Return the number of template headers we expect to see for a definition
2269 or specialization of CTYPE or one of its non-template members. */
2272 num_template_headers_for_class (tree ctype
)
2274 int num_templates
= 0;
2276 while (ctype
&& CLASS_TYPE_P (ctype
))
2278 /* You're supposed to have one `template <...>' for every
2279 template class, but you don't need one for a full
2280 specialization. For example:
2282 template <class T> struct S{};
2283 template <> struct S<int> { void f(); };
2284 void S<int>::f () {}
2286 is correct; there shouldn't be a `template <>' for the
2287 definition of `S<int>::f'. */
2288 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2289 /* If CTYPE does not have template information of any
2290 kind, then it is not a template, nor is it nested
2291 within a template. */
2293 if (explicit_class_specialization_p (ctype
))
2295 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2298 ctype
= TYPE_CONTEXT (ctype
);
2301 return num_templates
;
2304 /* Do a simple sanity check on the template headers that precede the
2305 variable declaration DECL. */
2308 check_template_variable (tree decl
)
2310 tree ctx
= CP_DECL_CONTEXT (decl
);
2311 int wanted
= num_template_headers_for_class (ctx
);
2312 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2313 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2315 if (cxx_dialect
< cxx14
)
2316 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2317 "variable templates only available with "
2318 "-std=c++14 or -std=gnu++14");
2320 // Namespace-scope variable templates should have a template header.
2323 if (template_header_count
> wanted
)
2325 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2326 "too many template headers for %D (should be %d)",
2328 if (warned
&& CLASS_TYPE_P (ctx
)
2329 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2330 inform (DECL_SOURCE_LOCATION (decl
),
2331 "members of an explicitly specialized class are defined "
2332 "without a template header");
2336 /* Check to see if the function just declared, as indicated in
2337 DECLARATOR, and in DECL, is a specialization of a function
2338 template. We may also discover that the declaration is an explicit
2339 instantiation at this point.
2341 Returns DECL, or an equivalent declaration that should be used
2342 instead if all goes well. Issues an error message if something is
2343 amiss. Returns error_mark_node if the error is not easily
2346 FLAGS is a bitmask consisting of the following flags:
2348 2: The function has a definition.
2349 4: The function is a friend.
2351 The TEMPLATE_COUNT is the number of references to qualifying
2352 template classes that appeared in the name of the function. For
2355 template <class T> struct S { void f(); };
2358 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2359 classes are not counted in the TEMPLATE_COUNT, so that in
2361 template <class T> struct S {};
2362 template <> struct S<int> { void f(); }
2363 template <> void S<int>::f();
2365 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2366 invalid; there should be no template <>.)
2368 If the function is a specialization, it is marked as such via
2369 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2370 is set up correctly, and it is added to the list of specializations
2371 for that template. */
2374 check_explicit_specialization (tree declarator
,
2379 int have_def
= flags
& 2;
2380 int is_friend
= flags
& 4;
2381 int specialization
= 0;
2382 int explicit_instantiation
= 0;
2383 int member_specialization
= 0;
2384 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2385 tree dname
= DECL_NAME (decl
);
2390 if (!processing_specialization
)
2393 tsk
= tsk_excessive_parms
;
2396 tsk
= current_tmpl_spec_kind (template_count
);
2401 if (processing_specialization
)
2404 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2406 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2409 /* This could be something like:
2411 template <class T> void f(T);
2412 class S { friend void f<>(int); } */
2416 /* This case handles bogus declarations like template <>
2417 template <class T> void f<int>(); */
2419 error ("template-id %qD in declaration of primary template",
2426 case tsk_invalid_member_spec
:
2427 /* The error has already been reported in
2428 check_specialization_scope. */
2429 return error_mark_node
;
2431 case tsk_invalid_expl_inst
:
2432 error ("template parameter list used in explicit instantiation");
2438 error ("definition provided for explicit instantiation");
2440 explicit_instantiation
= 1;
2443 case tsk_excessive_parms
:
2444 case tsk_insufficient_parms
:
2445 if (tsk
== tsk_excessive_parms
)
2446 error ("too many template parameter lists in declaration of %qD",
2448 else if (template_header_count
)
2449 error("too few template parameter lists in declaration of %qD", decl
);
2451 error("explicit specialization of %qD must be introduced by "
2452 "%<template <>%>", decl
);
2456 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2457 /* In cases like template<> constexpr bool v = true;
2458 We'll give an error in check_template_variable. */
2461 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2463 member_specialization
= 1;
2469 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2471 /* This case handles bogus declarations like template <>
2472 template <class T> void f<int>(); */
2474 if (uses_template_parms (declarator
))
2475 error ("non-type partial specialization %qD "
2476 "is not allowed", declarator
);
2478 error ("template-id %qD in declaration of primary template",
2483 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2484 /* This is a specialization of a member template, without
2485 specialization the containing class. Something like:
2487 template <class T> struct S {
2488 template <class U> void f (U);
2490 template <> template <class U> void S<int>::f(U) {}
2492 That's a specialization -- but of the entire template. */
2500 if ((specialization
|| member_specialization
)
2501 /* This doesn't apply to variable templates. */
2502 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2503 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2505 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2506 for (; t
; t
= TREE_CHAIN (t
))
2507 if (TREE_PURPOSE (t
))
2509 permerror (input_location
,
2510 "default argument specified in explicit specialization");
2515 if (specialization
|| member_specialization
|| explicit_instantiation
)
2517 tree tmpl
= NULL_TREE
;
2518 tree targs
= NULL_TREE
;
2520 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2521 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2525 gcc_assert (identifier_p (declarator
));
2530 /* If there is no class context, the explicit instantiation
2531 must be at namespace scope. */
2532 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2534 /* Find the namespace binding, using the declaration
2536 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2538 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2540 error ("%qD is not a template function", dname
);
2541 fns
= error_mark_node
;
2545 tree fn
= OVL_CURRENT (fns
);
2546 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2547 CP_DECL_CONTEXT (fn
)))
2548 error ("%qD is not declared in %qD",
2549 decl
, current_namespace
);
2553 declarator
= lookup_template_function (fns
, NULL_TREE
);
2556 if (declarator
== error_mark_node
)
2557 return error_mark_node
;
2559 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2561 if (!explicit_instantiation
)
2562 /* A specialization in class scope. This is invalid,
2563 but the error will already have been flagged by
2564 check_specialization_scope. */
2565 return error_mark_node
;
2568 /* It's not valid to write an explicit instantiation in
2571 class C { template void f(); }
2573 This case is caught by the parser. However, on
2576 template class C { void f(); };
2578 (which is invalid) we can get here. The error will be
2585 else if (ctype
!= NULL_TREE
2586 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2588 // Ignore variable templates.
2592 /* Find the list of functions in ctype that have the same
2593 name as the declared function. */
2594 tree name
= TREE_OPERAND (declarator
, 0);
2595 tree fns
= NULL_TREE
;
2598 if (constructor_name_p (name
, ctype
))
2600 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2602 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2603 : !CLASSTYPE_DESTRUCTORS (ctype
))
2605 /* From [temp.expl.spec]:
2607 If such an explicit specialization for the member
2608 of a class template names an implicitly-declared
2609 special member function (clause _special_), the
2610 program is ill-formed.
2612 Similar language is found in [temp.explicit]. */
2613 error ("specialization of implicitly-declared special member function");
2614 return error_mark_node
;
2617 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2620 if (!DECL_CONV_FN_P (decl
))
2622 idx
= lookup_fnfields_1 (ctype
, name
);
2624 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2628 vec
<tree
, va_gc
> *methods
;
2631 /* For a type-conversion operator, we cannot do a
2632 name-based lookup. We might be looking for `operator
2633 int' which will be a specialization of `operator T'.
2634 So, we find *all* the conversion operators, and then
2635 select from them. */
2638 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2640 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2641 methods
->iterate (idx
, &ovl
);
2644 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2645 /* There are no more conversion functions. */
2648 /* Glue all these conversion functions together
2649 with those we already have. */
2650 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2651 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2655 if (fns
== NULL_TREE
)
2657 error ("no member function %qD declared in %qT", name
, ctype
);
2658 return error_mark_node
;
2661 TREE_OPERAND (declarator
, 0) = fns
;
2664 /* Figure out what exactly is being specialized at this point.
2665 Note that for an explicit instantiation, even one for a
2666 member function, we cannot tell apriori whether the
2667 instantiation is for a member template, or just a member
2668 function of a template class. Even if a member template is
2669 being instantiated, the member template arguments may be
2670 elided if they can be deduced from the rest of the
2672 tmpl
= determine_specialization (declarator
, decl
,
2674 member_specialization
,
2678 if (!tmpl
|| tmpl
== error_mark_node
)
2679 /* We couldn't figure out what this declaration was
2681 return error_mark_node
;
2684 tree gen_tmpl
= most_general_template (tmpl
);
2686 if (explicit_instantiation
)
2688 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2689 is done by do_decl_instantiation later. */
2691 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2692 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2694 if (arg_depth
> parm_depth
)
2696 /* If TMPL is not the most general template (for
2697 example, if TMPL is a friend template that is
2698 injected into namespace scope), then there will
2699 be too many levels of TARGS. Remove some of them
2704 new_targs
= make_tree_vec (parm_depth
);
2705 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2706 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2707 = TREE_VEC_ELT (targs
, i
);
2711 return instantiate_template (tmpl
, targs
, tf_error
);
2714 /* If we thought that the DECL was a member function, but it
2715 turns out to be specializing a static member function,
2716 make DECL a static member function as well. */
2717 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2718 && DECL_STATIC_FUNCTION_P (tmpl
)
2719 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2720 revert_static_member_fn (decl
);
2722 /* If this is a specialization of a member template of a
2723 template class, we want to return the TEMPLATE_DECL, not
2724 the specialization of it. */
2725 if (tsk
== tsk_template
)
2727 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2728 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2729 DECL_INITIAL (result
) = NULL_TREE
;
2733 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2734 DECL_SOURCE_LOCATION (result
)
2735 = DECL_SOURCE_LOCATION (decl
);
2736 /* We want to use the argument list specified in the
2737 definition, not in the original declaration. */
2738 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2739 for (parm
= DECL_ARGUMENTS (result
); parm
;
2740 parm
= DECL_CHAIN (parm
))
2741 DECL_CONTEXT (parm
) = result
;
2743 return register_specialization (tmpl
, gen_tmpl
, targs
,
2747 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2748 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2750 /* Inherit default function arguments from the template
2751 DECL is specializing. */
2752 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2753 copy_default_args_to_explicit_spec (decl
);
2755 /* This specialization has the same protection as the
2756 template it specializes. */
2757 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2758 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2760 /* 7.1.1-1 [dcl.stc]
2762 A storage-class-specifier shall not be specified in an
2763 explicit specialization...
2765 The parser rejects these, so unless action is taken here,
2766 explicit function specializations will always appear with
2769 The action recommended by the C++ CWG in response to C++
2770 defect report 605 is to make the storage class and linkage
2771 of the explicit specialization match the templated function:
2773 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2775 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2777 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2778 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2780 /* This specialization has the same linkage and visibility as
2781 the function template it specializes. */
2782 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2783 if (! TREE_PUBLIC (decl
))
2785 DECL_INTERFACE_KNOWN (decl
) = 1;
2786 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2788 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2789 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2791 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2792 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2796 /* If DECL is a friend declaration, declared using an
2797 unqualified name, the namespace associated with DECL may
2798 have been set incorrectly. For example, in:
2800 template <typename T> void f(T);
2802 struct S { friend void f<int>(int); }
2805 we will have set the DECL_CONTEXT for the friend
2806 declaration to N, rather than to the global namespace. */
2807 if (DECL_NAMESPACE_SCOPE_P (decl
))
2808 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2810 if (is_friend
&& !have_def
)
2811 /* This is not really a declaration of a specialization.
2812 It's just the name of an instantiation. But, it's not
2813 a request for an instantiation, either. */
2814 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2815 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
2816 /* A specialization is not necessarily COMDAT. */
2817 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
2818 && DECL_DECLARED_INLINE_P (decl
));
2819 else if (TREE_CODE (decl
) == VAR_DECL
)
2820 DECL_COMDAT (decl
) = false;
2822 /* Register this specialization so that we can find it
2824 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2826 /* A 'structor should already have clones. */
2827 gcc_assert (decl
== error_mark_node
2828 || variable_template_p (tmpl
)
2829 || !(DECL_CONSTRUCTOR_P (decl
)
2830 || DECL_DESTRUCTOR_P (decl
))
2831 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
2838 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2839 parameters. These are represented in the same format used for
2840 DECL_TEMPLATE_PARMS. */
2843 comp_template_parms (const_tree parms1
, const_tree parms2
)
2848 if (parms1
== parms2
)
2851 for (p1
= parms1
, p2
= parms2
;
2852 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2853 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2855 tree t1
= TREE_VALUE (p1
);
2856 tree t2
= TREE_VALUE (p2
);
2859 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2860 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2862 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2865 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2867 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2868 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2870 /* If either of the template parameters are invalid, assume
2871 they match for the sake of error recovery. */
2872 if (error_operand_p (parm1
) || error_operand_p (parm2
))
2875 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2878 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2879 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2880 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2882 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2887 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2888 /* One set of parameters has more parameters lists than the
2895 /* Determine whether PARM is a parameter pack. */
2898 template_parameter_pack_p (const_tree parm
)
2900 /* Determine if we have a non-type template parameter pack. */
2901 if (TREE_CODE (parm
) == PARM_DECL
)
2902 return (DECL_TEMPLATE_PARM_P (parm
)
2903 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2904 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2905 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2907 /* If this is a list of template parameters, we could get a
2908 TYPE_DECL or a TEMPLATE_DECL. */
2909 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2910 parm
= TREE_TYPE (parm
);
2912 /* Otherwise it must be a type template parameter. */
2913 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2914 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2915 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2918 /* Determine if T is a function parameter pack. */
2921 function_parameter_pack_p (const_tree t
)
2923 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2924 return DECL_PACK_P (t
);
2928 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2929 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2932 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2934 if (! primary_func_tmpl_inst
2935 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2936 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2939 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2942 /* Return true iff the function parameter PARAM_DECL was expanded
2943 from the function parameter pack PACK. */
2946 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2948 if (DECL_ARTIFICIAL (param_decl
)
2949 || !function_parameter_pack_p (pack
))
2952 /* The parameter pack and its pack arguments have the same
2954 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2957 /* Determine whether ARGS describes a variadic template args list,
2958 i.e., one that is terminated by a template argument pack. */
2961 template_args_variadic_p (tree args
)
2966 if (args
== NULL_TREE
)
2969 args
= INNERMOST_TEMPLATE_ARGS (args
);
2970 nargs
= TREE_VEC_LENGTH (args
);
2975 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2977 return ARGUMENT_PACK_P (last_parm
);
2980 /* Generate a new name for the parameter pack name NAME (an
2981 IDENTIFIER_NODE) that incorporates its */
2984 make_ith_pack_parameter_name (tree name
, int i
)
2986 /* Munge the name to include the parameter index. */
2987 #define NUMBUF_LEN 128
2988 char numbuf
[NUMBUF_LEN
];
2992 if (name
== NULL_TREE
)
2994 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2995 newname_len
= IDENTIFIER_LENGTH (name
)
2996 + strlen (numbuf
) + 2;
2997 newname
= (char*)alloca (newname_len
);
2998 snprintf (newname
, newname_len
,
2999 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3000 return get_identifier (newname
);
3003 /* Return true if T is a primary function, class or alias template
3007 primary_template_instantiation_p (const_tree t
)
3012 if (TREE_CODE (t
) == FUNCTION_DECL
)
3013 return DECL_LANG_SPECIFIC (t
)
3014 && DECL_TEMPLATE_INSTANTIATION (t
)
3015 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3016 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3017 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3018 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3019 else if (alias_template_specialization_p (t
))
3024 /* Return true if PARM is a template template parameter. */
3027 template_template_parameter_p (const_tree parm
)
3029 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3032 /* Return true iff PARM is a DECL representing a type template
3036 template_type_parameter_p (const_tree parm
)
3039 && (TREE_CODE (parm
) == TYPE_DECL
3040 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3041 && DECL_TEMPLATE_PARM_P (parm
));
3044 /* Return the template parameters of T if T is a
3045 primary template instantiation, NULL otherwise. */
3048 get_primary_template_innermost_parameters (const_tree t
)
3050 tree parms
= NULL
, template_info
= NULL
;
3052 if ((template_info
= get_template_info (t
))
3053 && primary_template_instantiation_p (t
))
3054 parms
= INNERMOST_TEMPLATE_PARMS
3055 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3060 /* Return the template parameters of the LEVELth level from the full list
3061 of template parameters PARMS. */
3064 get_template_parms_at_level (tree parms
, int level
)
3068 || TREE_CODE (parms
) != TREE_LIST
3069 || level
> TMPL_PARMS_DEPTH (parms
))
3072 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3073 if (TMPL_PARMS_DEPTH (p
) == level
)
3079 /* Returns the template arguments of T if T is a template instantiation,
3083 get_template_innermost_arguments (const_tree t
)
3085 tree args
= NULL
, template_info
= NULL
;
3087 if ((template_info
= get_template_info (t
))
3088 && TI_ARGS (template_info
))
3089 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3094 /* Return the argument pack elements of T if T is a template argument pack,
3098 get_template_argument_pack_elems (const_tree t
)
3100 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3101 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3104 return ARGUMENT_PACK_ARGS (t
);
3107 /* Structure used to track the progress of find_parameter_packs_r. */
3108 struct find_parameter_pack_data
3110 /* TREE_LIST that will contain all of the parameter packs found by
3112 tree
* parameter_packs
;
3114 /* Set of AST nodes that have been visited by the traversal. */
3115 hash_set
<tree
> *visited
;
3118 /* Identifies all of the argument packs that occur in a template
3119 argument and appends them to the TREE_LIST inside DATA, which is a
3120 find_parameter_pack_data structure. This is a subroutine of
3121 make_pack_expansion and uses_parameter_packs. */
3123 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3126 struct find_parameter_pack_data
* ppd
=
3127 (struct find_parameter_pack_data
*)data
;
3128 bool parameter_pack_p
= false;
3130 /* Handle type aliases/typedefs. */
3131 if (TYPE_ALIAS_P (t
))
3133 if (TYPE_TEMPLATE_INFO (t
))
3134 cp_walk_tree (&TYPE_TI_ARGS (t
),
3135 &find_parameter_packs_r
,
3141 /* Identify whether this is a parameter pack or not. */
3142 switch (TREE_CODE (t
))
3144 case TEMPLATE_PARM_INDEX
:
3145 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3146 parameter_pack_p
= true;
3149 case TEMPLATE_TYPE_PARM
:
3150 t
= TYPE_MAIN_VARIANT (t
);
3151 case TEMPLATE_TEMPLATE_PARM
:
3152 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3153 parameter_pack_p
= true;
3158 if (DECL_PACK_P (t
))
3160 /* We don't want to walk into the type of a PARM_DECL,
3161 because we don't want to see the type parameter pack. */
3163 parameter_pack_p
= true;
3167 /* Look through a lambda capture proxy to the field pack. */
3169 if (DECL_HAS_VALUE_EXPR_P (t
))
3171 tree v
= DECL_VALUE_EXPR (t
);
3173 &find_parameter_packs_r
,
3180 parameter_pack_p
= true;
3183 /* Not a parameter pack. */
3187 if (parameter_pack_p
)
3189 /* Add this parameter pack to the list. */
3190 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3194 cp_walk_tree (&TYPE_CONTEXT (t
),
3195 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3197 /* This switch statement will return immediately if we don't find a
3199 switch (TREE_CODE (t
))
3201 case TEMPLATE_PARM_INDEX
:
3204 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3205 /* Check the template itself. */
3206 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3207 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3208 /* Check the template arguments. */
3209 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3214 case TEMPLATE_TYPE_PARM
:
3215 case TEMPLATE_TEMPLATE_PARM
:
3222 if (TYPE_PTRMEMFUNC_P (t
))
3228 if (TYPE_TEMPLATE_INFO (t
))
3229 cp_walk_tree (&TYPE_TI_ARGS (t
),
3230 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3237 cp_walk_tree (&TREE_TYPE (t
),
3238 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3242 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3247 case TYPE_PACK_EXPANSION
:
3248 case EXPR_PACK_EXPANSION
:
3253 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3258 case IDENTIFIER_NODE
:
3259 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3271 /* Determines if the expression or type T uses any parameter packs. */
3273 uses_parameter_packs (tree t
)
3275 tree parameter_packs
= NULL_TREE
;
3276 struct find_parameter_pack_data ppd
;
3277 ppd
.parameter_packs
= ¶meter_packs
;
3278 ppd
.visited
= new hash_set
<tree
>;
3279 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3281 return parameter_packs
!= NULL_TREE
;
3284 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3285 representation a base-class initializer into a parameter pack
3286 expansion. If all goes well, the resulting node will be an
3287 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3290 make_pack_expansion (tree arg
)
3293 tree parameter_packs
= NULL_TREE
;
3294 bool for_types
= false;
3295 struct find_parameter_pack_data ppd
;
3297 if (!arg
|| arg
== error_mark_node
)
3300 if (TREE_CODE (arg
) == TREE_LIST
)
3302 /* The only time we will see a TREE_LIST here is for a base
3303 class initializer. In this case, the TREE_PURPOSE will be a
3304 _TYPE node (representing the base class expansion we're
3305 initializing) and the TREE_VALUE will be a TREE_LIST
3306 containing the initialization arguments.
3308 The resulting expansion looks somewhat different from most
3309 expansions. Rather than returning just one _EXPANSION, we
3310 return a TREE_LIST whose TREE_PURPOSE is a
3311 TYPE_PACK_EXPANSION containing the bases that will be
3312 initialized. The TREE_VALUE will be identical to the
3313 original TREE_VALUE, which is a list of arguments that will
3314 be passed to each base. We do not introduce any new pack
3315 expansion nodes into the TREE_VALUE (although it is possible
3316 that some already exist), because the TREE_PURPOSE and
3317 TREE_VALUE all need to be expanded together with the same
3318 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3319 resulting TREE_PURPOSE will mention the parameter packs in
3320 both the bases and the arguments to the bases. */
3323 tree parameter_packs
= NULL_TREE
;
3325 /* Determine which parameter packs will be used by the base
3327 ppd
.visited
= new hash_set
<tree
>;
3328 ppd
.parameter_packs
= ¶meter_packs
;
3329 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3332 if (parameter_packs
== NULL_TREE
)
3334 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3336 return error_mark_node
;
3339 if (TREE_VALUE (arg
) != void_type_node
)
3341 /* Collect the sets of parameter packs used in each of the
3342 initialization arguments. */
3343 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3345 /* Determine which parameter packs will be expanded in this
3347 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3354 /* Create the pack expansion type for the base type. */
3355 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3356 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3357 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3359 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3360 they will rarely be compared to anything. */
3361 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3363 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3366 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3369 /* Build the PACK_EXPANSION_* node. */
3371 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3372 : make_node (EXPR_PACK_EXPANSION
);
3373 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3374 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3376 /* Propagate type and const-expression information. */
3377 TREE_TYPE (result
) = TREE_TYPE (arg
);
3378 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3381 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3382 they will rarely be compared to anything. */
3383 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3385 /* Determine which parameter packs will be expanded. */
3386 ppd
.parameter_packs
= ¶meter_packs
;
3387 ppd
.visited
= new hash_set
<tree
>;
3388 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3391 /* Make sure we found some parameter packs. */
3392 if (parameter_packs
== NULL_TREE
)
3395 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3397 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3398 return error_mark_node
;
3400 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3402 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3407 /* Checks T for any "bare" parameter packs, which have not yet been
3408 expanded, and issues an error if any are found. This operation can
3409 only be done on full expressions or types (e.g., an expression
3410 statement, "if" condition, etc.), because we could have expressions like:
3412 foo(f(g(h(args)))...)
3414 where "args" is a parameter pack. check_for_bare_parameter_packs
3415 should not be called for the subexpressions args, h(args),
3416 g(h(args)), or f(g(h(args))), because we would produce erroneous
3419 Returns TRUE and emits an error if there were bare parameter packs,
3420 returns FALSE otherwise. */
3422 check_for_bare_parameter_packs (tree t
)
3424 tree parameter_packs
= NULL_TREE
;
3425 struct find_parameter_pack_data ppd
;
3427 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3430 if (TREE_CODE (t
) == TYPE_DECL
)
3433 ppd
.parameter_packs
= ¶meter_packs
;
3434 ppd
.visited
= new hash_set
<tree
>;
3435 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3438 if (parameter_packs
)
3440 error ("parameter packs not expanded with %<...%>:");
3441 while (parameter_packs
)
3443 tree pack
= TREE_VALUE (parameter_packs
);
3444 tree name
= NULL_TREE
;
3446 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3447 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3448 name
= TYPE_NAME (pack
);
3449 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3450 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3452 name
= DECL_NAME (pack
);
3455 inform (input_location
, " %qD", name
);
3457 inform (input_location
, " <anonymous>");
3459 parameter_packs
= TREE_CHAIN (parameter_packs
);
3468 /* Expand any parameter packs that occur in the template arguments in
3471 expand_template_argument_pack (tree args
)
3473 tree result_args
= NULL_TREE
;
3474 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3475 int num_result_args
= -1;
3476 int non_default_args_count
= -1;
3478 /* First, determine if we need to expand anything, and the number of
3479 slots we'll need. */
3480 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3482 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3483 if (arg
== NULL_TREE
)
3485 if (ARGUMENT_PACK_P (arg
))
3487 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3488 if (num_result_args
< 0)
3489 num_result_args
= in_arg
+ num_packed
;
3491 num_result_args
+= num_packed
;
3495 if (num_result_args
>= 0)
3500 /* If no expansion is necessary, we're done. */
3501 if (num_result_args
< 0)
3504 /* Expand arguments. */
3505 result_args
= make_tree_vec (num_result_args
);
3506 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3507 non_default_args_count
=
3508 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3509 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3511 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3512 if (ARGUMENT_PACK_P (arg
))
3514 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3515 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3516 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3517 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3518 if (non_default_args_count
> 0)
3519 non_default_args_count
+= num_packed
- 1;
3523 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3527 if (non_default_args_count
>= 0)
3528 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3532 /* Checks if DECL shadows a template parameter.
3534 [temp.local]: A template-parameter shall not be redeclared within its
3535 scope (including nested scopes).
3537 Emits an error and returns TRUE if the DECL shadows a parameter,
3538 returns FALSE otherwise. */
3541 check_template_shadow (tree decl
)
3545 /* If we're not in a template, we can't possibly shadow a template
3547 if (!current_template_parms
)
3550 /* Figure out what we're shadowing. */
3551 if (TREE_CODE (decl
) == OVERLOAD
)
3552 decl
= OVL_CURRENT (decl
);
3553 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3555 /* If there's no previous binding for this name, we're not shadowing
3556 anything, let alone a template parameter. */
3560 /* If we're not shadowing a template parameter, we're done. Note
3561 that OLDDECL might be an OVERLOAD (or perhaps even an
3562 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3564 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3567 /* We check for decl != olddecl to avoid bogus errors for using a
3568 name inside a class. We check TPFI to avoid duplicate errors for
3569 inline member templates. */
3571 || (DECL_TEMPLATE_PARM_P (decl
)
3572 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3575 /* Don't complain about the injected class name, as we've already
3576 complained about the class itself. */
3577 if (DECL_SELF_REFERENCE_P (decl
))
3580 error ("declaration of %q+#D", decl
);
3581 error (" shadows template parm %q+#D", olddecl
);
3585 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3586 ORIG_LEVEL, DECL, and TYPE. */
3589 build_template_parm_index (int index
,
3595 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3596 TEMPLATE_PARM_IDX (t
) = index
;
3597 TEMPLATE_PARM_LEVEL (t
) = level
;
3598 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3599 TEMPLATE_PARM_DECL (t
) = decl
;
3600 TREE_TYPE (t
) = type
;
3601 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3602 TREE_READONLY (t
) = TREE_READONLY (decl
);
3607 /* Find the canonical type parameter for the given template type
3608 parameter. Returns the canonical type parameter, which may be TYPE
3609 if no such parameter existed. */
3612 canonical_type_parameter (tree type
)
3615 int idx
= TEMPLATE_TYPE_IDX (type
);
3616 if (!canonical_template_parms
)
3617 vec_alloc (canonical_template_parms
, idx
+1);
3619 while (canonical_template_parms
->length () <= (unsigned)idx
)
3620 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3622 list
= (*canonical_template_parms
)[idx
];
3623 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3624 list
= TREE_CHAIN (list
);
3627 return TREE_VALUE (list
);
3630 (*canonical_template_parms
)[idx
]
3631 = tree_cons (NULL_TREE
, type
,
3632 (*canonical_template_parms
)[idx
]);
3637 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3638 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3639 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3640 new one is created. */
3643 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3644 tsubst_flags_t complain
)
3646 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3647 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3648 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3649 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3651 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3654 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3655 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3656 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3657 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3658 DECL_ARTIFICIAL (decl
) = 1;
3659 SET_DECL_TEMPLATE_PARM_P (decl
);
3661 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3662 TEMPLATE_PARM_LEVEL (index
) - levels
,
3663 TEMPLATE_PARM_ORIG_LEVEL (index
),
3665 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3666 TEMPLATE_PARM_PARAMETER_PACK (t
)
3667 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3669 /* Template template parameters need this. */
3670 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3671 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3672 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3676 return TEMPLATE_PARM_DESCENDANTS (index
);
3679 /* Process information from new template parameter PARM and append it
3680 to the LIST being built. This new parameter is a non-type
3681 parameter iff IS_NON_TYPE is true. This new parameter is a
3682 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3686 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3687 bool is_non_type
, bool is_parameter_pack
)
3693 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3694 defval
= TREE_PURPOSE (parm
);
3698 tree p
= tree_last (list
);
3700 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3703 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3704 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3706 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3714 parm
= TREE_VALUE (parm
);
3716 SET_DECL_TEMPLATE_PARM_P (parm
);
3718 if (TREE_TYPE (parm
) != error_mark_node
)
3722 The top-level cv-qualifiers on the template-parameter are
3723 ignored when determining its type. */
3724 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3725 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3726 TREE_TYPE (parm
) = error_mark_node
;
3727 else if (uses_parameter_packs (TREE_TYPE (parm
))
3728 && !is_parameter_pack
3729 /* If we're in a nested template parameter list, the template
3730 template parameter could be a parameter pack. */
3731 && processing_template_parmlist
== 1)
3733 /* This template parameter is not a parameter pack, but it
3734 should be. Complain about "bare" parameter packs. */
3735 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3737 /* Recover by calling this a parameter pack. */
3738 is_parameter_pack
= true;
3742 /* A template parameter is not modifiable. */
3743 TREE_CONSTANT (parm
) = 1;
3744 TREE_READONLY (parm
) = 1;
3745 decl
= build_decl (parm_loc
,
3746 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3747 TREE_CONSTANT (decl
) = 1;
3748 TREE_READONLY (decl
) = 1;
3749 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3750 = build_template_parm_index (idx
, processing_template_decl
,
3751 processing_template_decl
,
3752 decl
, TREE_TYPE (parm
));
3754 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3755 = is_parameter_pack
;
3760 parm
= TREE_VALUE (TREE_VALUE (parm
));
3762 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3764 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3765 /* This is for distinguishing between real templates and template
3766 template parameters */
3767 TREE_TYPE (parm
) = t
;
3768 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3773 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3774 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3775 decl
= build_decl (parm_loc
,
3776 TYPE_DECL
, parm
, t
);
3779 TYPE_NAME (t
) = decl
;
3780 TYPE_STUB_DECL (t
) = decl
;
3782 TEMPLATE_TYPE_PARM_INDEX (t
)
3783 = build_template_parm_index (idx
, processing_template_decl
,
3784 processing_template_decl
,
3785 decl
, TREE_TYPE (parm
));
3786 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3787 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3789 DECL_ARTIFICIAL (decl
) = 1;
3790 SET_DECL_TEMPLATE_PARM_P (decl
);
3792 parm
= build_tree_list (defval
, parm
);
3793 return chainon (list
, parm
);
3796 /* The end of a template parameter list has been reached. Process the
3797 tree list into a parameter vector, converting each parameter into a more
3798 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3802 end_template_parm_list (tree parms
)
3806 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3808 current_template_parms
3809 = tree_cons (size_int (processing_template_decl
),
3810 saved_parmlist
, current_template_parms
);
3812 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3814 next
= TREE_CHAIN (parm
);
3815 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3816 TREE_CHAIN (parm
) = NULL_TREE
;
3819 --processing_template_parmlist
;
3821 return saved_parmlist
;
3824 /* end_template_decl is called after a template declaration is seen. */
3827 end_template_decl (void)
3829 reset_specialization ();
3831 if (! processing_template_decl
)
3834 /* This matches the pushlevel in begin_template_parm_list. */
3837 --processing_template_decl
;
3838 current_template_parms
= TREE_CHAIN (current_template_parms
);
3841 /* Takes a TREE_LIST representing a template parameter and convert it
3842 into an argument suitable to be passed to the type substitution
3843 functions. Note that If the TREE_LIST contains an error_mark
3844 node, the returned argument is error_mark_node. */
3847 template_parm_to_arg (tree t
)
3851 || TREE_CODE (t
) != TREE_LIST
)
3854 if (error_operand_p (TREE_VALUE (t
)))
3855 return error_mark_node
;
3859 if (TREE_CODE (t
) == TYPE_DECL
3860 || TREE_CODE (t
) == TEMPLATE_DECL
)
3864 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3866 /* Turn this argument into a TYPE_ARGUMENT_PACK
3867 with a single element, which expands T. */
3868 tree vec
= make_tree_vec (1);
3869 #ifdef ENABLE_CHECKING
3870 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3871 (vec
, TREE_VEC_LENGTH (vec
));
3873 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3875 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3876 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3881 t
= DECL_INITIAL (t
);
3883 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3885 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3886 with a single element, which expands T. */
3887 tree vec
= make_tree_vec (1);
3888 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3889 #ifdef ENABLE_CHECKING
3890 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3891 (vec
, TREE_VEC_LENGTH (vec
));
3893 t
= convert_from_reference (t
);
3894 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3896 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3897 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3898 TREE_TYPE (t
) = type
;
3901 t
= convert_from_reference (t
);
3906 /* Given a set of template parameters, return them as a set of template
3907 arguments. The template parameters are represented as a TREE_VEC, in
3908 the form documented in cp-tree.h for template arguments. */
3911 template_parms_to_args (tree parms
)
3914 tree args
= NULL_TREE
;
3915 int length
= TMPL_PARMS_DEPTH (parms
);
3918 /* If there is only one level of template parameters, we do not
3919 create a TREE_VEC of TREE_VECs. Instead, we return a single
3920 TREE_VEC containing the arguments. */
3922 args
= make_tree_vec (length
);
3924 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3926 tree a
= copy_node (TREE_VALUE (header
));
3929 TREE_TYPE (a
) = NULL_TREE
;
3930 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3931 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3933 #ifdef ENABLE_CHECKING
3934 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3938 TREE_VEC_ELT (args
, --l
) = a
;
3943 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3944 /* This can happen for template parms of a template template
3947 template<template<class T, class U> class TT> struct S;
3949 Consider the level of the parms of TT; T and U both have
3950 level 2; TT has no template parm of level 1. So in this case
3951 the first element of full_template_args is NULL_TREE. If we
3952 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3953 of 2. This will make tsubst wrongly consider that T and U
3954 have level 1. Instead, let's create a dummy vector as the
3955 first element of full_template_args so that TMPL_ARGS_DEPTH
3956 returns the correct depth for args. */
3957 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3961 /* Within the declaration of a template, return the currently active
3962 template parameters as an argument TREE_VEC. */
3965 current_template_args (void)
3967 return template_parms_to_args (current_template_parms
);
3970 /* Update the declared TYPE by doing any lookups which were thought to be
3971 dependent, but are not now that we know the SCOPE of the declarator. */
3974 maybe_update_decl_type (tree orig_type
, tree scope
)
3976 tree type
= orig_type
;
3978 if (type
== NULL_TREE
)
3981 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3982 type
= TREE_TYPE (type
);
3984 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3985 && dependent_type_p (type
)
3986 /* Don't bother building up the args in this case. */
3987 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3989 /* tsubst in the args corresponding to the template parameters,
3990 including auto if present. Most things will be unchanged, but
3991 make_typename_type and tsubst_qualified_id will resolve
3992 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3993 tree args
= current_template_args ();
3994 tree auto_node
= type_uses_auto (type
);
3998 tree auto_vec
= make_tree_vec (1);
3999 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4000 args
= add_to_template_args (args
, auto_vec
);
4002 pushed
= push_scope (scope
);
4003 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4008 if (type
== error_mark_node
)
4011 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4013 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4016 type
= TYPE_NAME (type
);
4021 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4022 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
4023 a member template. Used by push_template_decl below. */
4026 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4028 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4029 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4030 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4031 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4032 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4037 struct template_parm_data
4039 /* The level of the template parameters we are currently
4043 /* The index of the specialization argument we are currently
4047 /* An array whose size is the number of template parameters. The
4048 elements are nonzero if the parameter has been used in any one
4049 of the arguments processed so far. */
4052 /* An array whose size is the number of template arguments. The
4053 elements are nonzero if the argument makes use of template
4054 parameters of this level. */
4055 int* arg_uses_template_parms
;
4058 /* Subroutine of push_template_decl used to see if each template
4059 parameter in a partial specialization is used in the explicit
4060 argument list. If T is of the LEVEL given in DATA (which is
4061 treated as a template_parm_data*), then DATA->PARMS is marked
4065 mark_template_parm (tree t
, void* data
)
4069 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4071 template_parm_level_and_index (t
, &level
, &idx
);
4073 if (level
== tpd
->level
)
4075 tpd
->parms
[idx
] = 1;
4076 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4079 /* Return zero so that for_each_template_parm will continue the
4080 traversal of the tree; we want to mark *every* template parm. */
4084 /* Process the partial specialization DECL. */
4087 process_partial_specialization (tree decl
)
4089 tree type
= TREE_TYPE (decl
);
4090 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4091 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4092 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4093 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4096 int nargs
= TREE_VEC_LENGTH (inner_args
);
4099 bool did_error_intro
= false;
4100 struct template_parm_data tpd
;
4101 struct template_parm_data tpd2
;
4103 gcc_assert (current_template_parms
);
4105 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4106 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4108 /* We check that each of the template parameters given in the
4109 partial specialization is used in the argument list to the
4110 specialization. For example:
4112 template <class T> struct S;
4113 template <class T> struct S<T*>;
4115 The second declaration is OK because `T*' uses the template
4116 parameter T, whereas
4118 template <class T> struct S<int>;
4120 is no good. Even trickier is:
4131 The S2<T> declaration is actually invalid; it is a
4132 full-specialization. Of course,
4135 struct S2<T (*)(U)>;
4137 or some such would have been OK. */
4138 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4139 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4140 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4142 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4143 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4144 for (i
= 0; i
< nargs
; ++i
)
4146 tpd
.current_arg
= i
;
4147 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4148 &mark_template_parm
,
4151 /*include_nondeduced_p=*/false);
4153 for (i
= 0; i
< ntparms
; ++i
)
4154 if (tpd
.parms
[i
] == 0)
4156 /* One of the template parms was not used in a deduced context in the
4158 if (!did_error_intro
)
4160 error ("template parameters not deducible in "
4161 "partial specialization:");
4162 did_error_intro
= true;
4165 inform (input_location
, " %qD",
4166 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4169 if (did_error_intro
)
4170 return error_mark_node
;
4172 /* [temp.class.spec]
4174 The argument list of the specialization shall not be identical to
4175 the implicit argument list of the primary template. */
4176 if (comp_template_args
4178 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4180 error ("partial specialization %qT does not specialize any template arguments", type
);
4182 /* A partial specialization that replaces multiple parameters of the
4183 primary template with a pack expansion is less specialized for those
4185 if (nargs
< DECL_NTPARMS (maintmpl
))
4187 error ("partial specialization is not more specialized than the "
4188 "primary template because it replaces multiple parameters "
4189 "with a pack expansion");
4190 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4194 /* [temp.class.spec]
4196 A partially specialized non-type argument expression shall not
4197 involve template parameters of the partial specialization except
4198 when the argument expression is a simple identifier.
4200 The type of a template parameter corresponding to a specialized
4201 non-type argument shall not be dependent on a parameter of the
4204 Also, we verify that pack expansions only occur at the
4205 end of the argument list. */
4206 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4208 for (i
= 0; i
< nargs
; ++i
)
4210 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4211 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4212 tree packed_args
= NULL_TREE
;
4215 if (ARGUMENT_PACK_P (arg
))
4217 /* Extract the arguments from the argument pack. We'll be
4218 iterating over these in the following loop. */
4219 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4220 len
= TREE_VEC_LENGTH (packed_args
);
4223 for (j
= 0; j
< len
; j
++)
4226 /* Get the Jth argument in the parameter pack. */
4227 arg
= TREE_VEC_ELT (packed_args
, j
);
4229 if (PACK_EXPANSION_P (arg
))
4231 /* Pack expansions must come at the end of the
4233 if ((packed_args
&& j
< len
- 1)
4234 || (!packed_args
&& i
< nargs
- 1))
4236 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4237 error ("parameter pack argument %qE must be at the "
4238 "end of the template argument list", arg
);
4240 error ("parameter pack argument %qT must be at the "
4241 "end of the template argument list", arg
);
4245 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4246 /* We only care about the pattern. */
4247 arg
= PACK_EXPANSION_PATTERN (arg
);
4249 if (/* These first two lines are the `non-type' bit. */
4251 && TREE_CODE (arg
) != TEMPLATE_DECL
4252 /* This next two lines are the `argument expression is not just a
4253 simple identifier' condition and also the `specialized
4254 non-type argument' bit. */
4255 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4256 && !(REFERENCE_REF_P (arg
)
4257 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4259 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4260 || (packed_args
&& uses_template_parms (arg
)))
4261 error ("template argument %qE involves template parameter(s)",
4265 /* Look at the corresponding template parameter,
4266 marking which template parameters its type depends
4268 tree type
= TREE_TYPE (parm
);
4272 /* We haven't yet initialized TPD2. Do so now. */
4273 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4274 /* The number of parameters here is the number in the
4275 main template, which, as checked in the assertion
4277 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4279 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4282 /* Mark the template parameters. But this time, we're
4283 looking for the template parameters of the main
4284 template, not in the specialization. */
4285 tpd2
.current_arg
= i
;
4286 tpd2
.arg_uses_template_parms
[i
] = 0;
4287 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4288 for_each_template_parm (type
,
4289 &mark_template_parm
,
4292 /*include_nondeduced_p=*/false);
4294 if (tpd2
.arg_uses_template_parms
[i
])
4296 /* The type depended on some template parameters.
4297 If they are fully specialized in the
4298 specialization, that's OK. */
4301 for (j
= 0; j
< nargs
; ++j
)
4302 if (tpd2
.parms
[j
] != 0
4303 && tpd
.arg_uses_template_parms
[j
])
4306 error_n (input_location
, count
,
4307 "type %qT of template argument %qE depends "
4308 "on a template parameter",
4309 "type %qT of template argument %qE depends "
4310 "on template parameters",
4319 /* We should only get here once. */
4320 gcc_assert (!COMPLETE_TYPE_P (type
));
4322 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4323 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4324 TREE_TYPE (tmpl
) = type
;
4325 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4326 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4327 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4328 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4330 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4331 = tree_cons (specargs
, tmpl
,
4332 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4333 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4335 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4336 inst
= TREE_CHAIN (inst
))
4338 tree inst_type
= TREE_VALUE (inst
);
4339 if (COMPLETE_TYPE_P (inst_type
)
4340 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4342 tree spec
= most_specialized_class (inst_type
, tf_none
);
4343 if (spec
&& TREE_TYPE (spec
) == type
)
4344 permerror (input_location
,
4345 "partial specialization of %qT after instantiation "
4346 "of %qT", type
, inst_type
);
4353 /* PARM is a template parameter of some form; return the corresponding
4354 TEMPLATE_PARM_INDEX. */
4357 get_template_parm_index (tree parm
)
4359 if (TREE_CODE (parm
) == PARM_DECL
4360 || TREE_CODE (parm
) == CONST_DECL
)
4361 parm
= DECL_INITIAL (parm
);
4362 else if (TREE_CODE (parm
) == TYPE_DECL
4363 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4364 parm
= TREE_TYPE (parm
);
4365 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4366 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4367 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4368 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4372 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4373 parameter packs used by the template parameter PARM. */
4376 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4378 /* A type parm can't refer to another parm. */
4379 if (TREE_CODE (parm
) == TYPE_DECL
)
4381 else if (TREE_CODE (parm
) == PARM_DECL
)
4383 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4388 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4390 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4391 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4392 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4395 /* PARM is a template parameter pack. Return any parameter packs used in
4396 its type or the type of any of its template parameters. If there are
4397 any such packs, it will be instantiated into a fixed template parameter
4398 list by partial instantiation rather than be fully deduced. */
4401 fixed_parameter_pack_p (tree parm
)
4403 /* This can only be true in a member template. */
4404 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4406 /* This can only be true for a parameter pack. */
4407 if (!template_parameter_pack_p (parm
))
4409 /* A type parm can't refer to another parm. */
4410 if (TREE_CODE (parm
) == TYPE_DECL
)
4413 tree parameter_packs
= NULL_TREE
;
4414 struct find_parameter_pack_data ppd
;
4415 ppd
.parameter_packs
= ¶meter_packs
;
4416 ppd
.visited
= new hash_set
<tree
>;
4418 fixed_parameter_pack_p_1 (parm
, &ppd
);
4421 return parameter_packs
;
4424 /* Check that a template declaration's use of default arguments and
4425 parameter packs is not invalid. Here, PARMS are the template
4426 parameters. IS_PRIMARY is true if DECL is the thing declared by
4427 a primary template. IS_PARTIAL is true if DECL is a partial
4430 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4431 declaration (but not a definition); 1 indicates a declaration, 2
4432 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4433 emitted for extraneous default arguments.
4435 Returns TRUE if there were no errors found, FALSE otherwise. */
4438 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4439 bool is_partial
, int is_friend_decl
)
4442 int last_level_to_check
;
4444 bool no_errors
= true;
4448 A default template-argument shall not be specified in a
4449 function template declaration or a function template definition, nor
4450 in the template-parameter-list of the definition of a member of a
4453 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4454 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4455 /* You can't have a function template declaration in a local
4456 scope, nor you can you define a member of a class template in a
4460 if ((TREE_CODE (decl
) == TYPE_DECL
4462 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4463 || (TREE_CODE (decl
) == FUNCTION_DECL
4464 && LAMBDA_FUNCTION_P (decl
)))
4465 /* A lambda doesn't have an explicit declaration; don't complain
4466 about the parms of the enclosing class. */
4469 if (current_class_type
4470 && !TYPE_BEING_DEFINED (current_class_type
)
4471 && DECL_LANG_SPECIFIC (decl
)
4472 && DECL_DECLARES_FUNCTION_P (decl
)
4473 /* If this is either a friend defined in the scope of the class
4474 or a member function. */
4475 && (DECL_FUNCTION_MEMBER_P (decl
)
4476 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4477 : DECL_FRIEND_CONTEXT (decl
)
4478 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4480 /* And, if it was a member function, it really was defined in
4481 the scope of the class. */
4482 && (!DECL_FUNCTION_MEMBER_P (decl
)
4483 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4484 /* We already checked these parameters when the template was
4485 declared, so there's no need to do it again now. This function
4486 was defined in class scope, but we're processing its body now
4487 that the class is complete. */
4490 /* Core issue 226 (C++0x only): the following only applies to class
4493 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4497 If a template-parameter has a default template-argument, all
4498 subsequent template-parameters shall have a default
4499 template-argument supplied. */
4500 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4502 tree inner_parms
= TREE_VALUE (parm_level
);
4503 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4504 int seen_def_arg_p
= 0;
4507 for (i
= 0; i
< ntparms
; ++i
)
4509 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4511 if (parm
== error_mark_node
)
4514 if (TREE_PURPOSE (parm
))
4516 else if (seen_def_arg_p
4517 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4519 error ("no default argument for %qD", TREE_VALUE (parm
));
4520 /* For better subsequent error-recovery, we indicate that
4521 there should have been a default argument. */
4522 TREE_PURPOSE (parm
) = error_mark_node
;
4525 else if (!is_partial
4527 /* Don't complain about an enclosing partial
4529 && parm_level
== parms
4530 && TREE_CODE (decl
) == TYPE_DECL
4532 && template_parameter_pack_p (TREE_VALUE (parm
))
4533 /* A fixed parameter pack will be partially
4534 instantiated into a fixed length list. */
4535 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4537 /* A primary class template can only have one
4538 parameter pack, at the end of the template
4541 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4542 error ("parameter pack %qE must be at the end of the"
4543 " template parameter list", TREE_VALUE (parm
));
4545 error ("parameter pack %qT must be at the end of the"
4546 " template parameter list",
4547 TREE_TYPE (TREE_VALUE (parm
)));
4549 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4557 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4561 /* For an ordinary class template, default template arguments are
4562 allowed at the innermost level, e.g.:
4563 template <class T = int>
4565 but, in a partial specialization, they're not allowed even
4566 there, as we have in [temp.class.spec]:
4568 The template parameter list of a specialization shall not
4569 contain default template argument values.
4571 So, for a partial specialization, or for a function template
4572 (in C++98/C++03), we look at all of them. */
4575 /* But, for a primary class template that is not a partial
4576 specialization we look at all template parameters except the
4578 parms
= TREE_CHAIN (parms
);
4580 /* Figure out what error message to issue. */
4581 if (is_friend_decl
== 2)
4582 msg
= G_("default template arguments may not be used in function template "
4583 "friend re-declaration");
4584 else if (is_friend_decl
)
4585 msg
= G_("default template arguments may not be used in function template "
4586 "friend declarations");
4587 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4588 msg
= G_("default template arguments may not be used in function templates "
4589 "without -std=c++11 or -std=gnu++11");
4590 else if (is_partial
)
4591 msg
= G_("default template arguments may not be used in "
4592 "partial specializations");
4594 msg
= G_("default argument for template parameter for class enclosing %qD");
4596 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4597 /* If we're inside a class definition, there's no need to
4598 examine the parameters to the class itself. On the one
4599 hand, they will be checked when the class is defined, and,
4600 on the other, default arguments are valid in things like:
4601 template <class T = double>
4602 struct S { template <class U> void f(U); };
4603 Here the default argument for `S' has no bearing on the
4604 declaration of `f'. */
4605 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4607 /* Check everything. */
4608 last_level_to_check
= 0;
4610 for (parm_level
= parms
;
4611 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4612 parm_level
= TREE_CHAIN (parm_level
))
4614 tree inner_parms
= TREE_VALUE (parm_level
);
4618 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4619 for (i
= 0; i
< ntparms
; ++i
)
4621 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4624 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4629 if (is_friend_decl
== 2)
4636 /* Clear out the default argument so that we are not
4638 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4642 /* At this point, if we're still interested in issuing messages,
4643 they must apply to classes surrounding the object declared. */
4645 msg
= G_("default argument for template parameter for class "
4652 /* Worker for push_template_decl_real, called via
4653 for_each_template_parm. DATA is really an int, indicating the
4654 level of the parameters we are interested in. If T is a template
4655 parameter of that level, return nonzero. */
4658 template_parm_this_level_p (tree t
, void* data
)
4660 int this_level
= *(int *)data
;
4663 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4664 level
= TEMPLATE_PARM_LEVEL (t
);
4666 level
= TEMPLATE_TYPE_LEVEL (t
);
4667 return level
== this_level
;
4670 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4671 parameters given by current_template_args, or reuses a
4672 previously existing one, if appropriate. Returns the DECL, or an
4673 equivalent one, if it is replaced via a call to duplicate_decls.
4675 If IS_FRIEND is true, DECL is a friend declaration. */
4678 push_template_decl_real (tree decl
, bool is_friend
)
4686 int new_template_p
= 0;
4687 /* True if the template is a member template, in the sense of
4689 bool member_template_p
= false;
4691 if (decl
== error_mark_node
|| !current_template_parms
)
4692 return error_mark_node
;
4694 /* See if this is a partial specialization. */
4695 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4696 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4697 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4699 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4703 /* For a friend, we want the context of the friend function, not
4704 the type of which it is a friend. */
4705 ctx
= CP_DECL_CONTEXT (decl
);
4706 else if (CP_DECL_CONTEXT (decl
)
4707 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4708 /* In the case of a virtual function, we want the class in which
4710 ctx
= CP_DECL_CONTEXT (decl
);
4712 /* Otherwise, if we're currently defining some class, the DECL
4713 is assumed to be a member of the class. */
4714 ctx
= current_scope ();
4716 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4719 if (!DECL_CONTEXT (decl
))
4720 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4722 /* See if this is a primary template. */
4723 if (is_friend
&& ctx
4724 && uses_template_parms_level (ctx
, processing_template_decl
))
4725 /* A friend template that specifies a class context, i.e.
4726 template <typename T> friend void A<T>::f();
4729 else if (TREE_CODE (decl
) == TYPE_DECL
4730 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4733 is_primary
= template_parm_scope_p ();
4737 if (DECL_CLASS_SCOPE_P (decl
))
4738 member_template_p
= true;
4739 if (TREE_CODE (decl
) == TYPE_DECL
4740 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4742 error ("template class without a name");
4743 return error_mark_node
;
4745 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4747 if (member_template_p
)
4749 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
4750 error ("member template %qD may not have virt-specifiers", decl
);
4752 if (DECL_DESTRUCTOR_P (decl
))
4756 A destructor shall not be a member template. */
4757 error ("destructor %qD declared as member template", decl
);
4758 return error_mark_node
;
4760 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4761 && (!prototype_p (TREE_TYPE (decl
))
4762 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4763 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4764 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4765 == void_list_node
)))
4767 /* [basic.stc.dynamic.allocation]
4769 An allocation function can be a function
4770 template. ... Template allocation functions shall
4771 have two or more parameters. */
4772 error ("invalid template declaration of %qD", decl
);
4773 return error_mark_node
;
4776 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4777 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4779 else if (TREE_CODE (decl
) == TYPE_DECL
4780 && TYPE_DECL_ALIAS_P (decl
))
4781 /* alias-declaration */
4782 gcc_assert (!DECL_ARTIFICIAL (decl
));
4783 else if (VAR_P (decl
))
4784 /* C++14 variable template. */;
4787 error ("template declaration of %q#D", decl
);
4788 return error_mark_node
;
4792 /* Check to see that the rules regarding the use of default
4793 arguments are not being violated. */
4794 check_default_tmpl_args (decl
, current_template_parms
,
4795 is_primary
, is_partial
, /*is_friend_decl=*/0);
4797 /* Ensure that there are no parameter packs in the type of this
4798 declaration that have not been expanded. */
4799 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4801 /* Check each of the arguments individually to see if there are
4802 any bare parameter packs. */
4803 tree type
= TREE_TYPE (decl
);
4804 tree arg
= DECL_ARGUMENTS (decl
);
4805 tree argtype
= TYPE_ARG_TYPES (type
);
4807 while (arg
&& argtype
)
4809 if (!DECL_PACK_P (arg
)
4810 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4812 /* This is a PARM_DECL that contains unexpanded parameter
4813 packs. We have already complained about this in the
4814 check_for_bare_parameter_packs call, so just replace
4815 these types with ERROR_MARK_NODE. */
4816 TREE_TYPE (arg
) = error_mark_node
;
4817 TREE_VALUE (argtype
) = error_mark_node
;
4820 arg
= DECL_CHAIN (arg
);
4821 argtype
= TREE_CHAIN (argtype
);
4824 /* Check for bare parameter packs in the return type and the
4825 exception specifiers. */
4826 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4827 /* Errors were already issued, set return type to int
4828 as the frontend doesn't expect error_mark_node as
4830 TREE_TYPE (type
) = integer_type_node
;
4831 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4832 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4834 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4835 && TYPE_DECL_ALIAS_P (decl
))
4836 ? DECL_ORIGINAL_TYPE (decl
)
4837 : TREE_TYPE (decl
)))
4839 TREE_TYPE (decl
) = error_mark_node
;
4840 return error_mark_node
;
4844 return process_partial_specialization (decl
);
4846 args
= current_template_args ();
4849 || TREE_CODE (ctx
) == FUNCTION_DECL
4850 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4851 || (TREE_CODE (decl
) == TYPE_DECL
4852 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4853 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4855 if (DECL_LANG_SPECIFIC (decl
)
4856 && DECL_TEMPLATE_INFO (decl
)
4857 && DECL_TI_TEMPLATE (decl
))
4858 tmpl
= DECL_TI_TEMPLATE (decl
);
4859 /* If DECL is a TYPE_DECL for a class-template, then there won't
4860 be DECL_LANG_SPECIFIC. The information equivalent to
4861 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4862 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4863 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4864 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4866 /* Since a template declaration already existed for this
4867 class-type, we must be redeclaring it here. Make sure
4868 that the redeclaration is valid. */
4869 redeclare_class_template (TREE_TYPE (decl
),
4870 current_template_parms
);
4871 /* We don't need to create a new TEMPLATE_DECL; just use the
4872 one we already had. */
4873 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4877 tmpl
= build_template_decl (decl
, current_template_parms
,
4881 if (DECL_LANG_SPECIFIC (decl
)
4882 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4884 /* A specialization of a member template of a template
4886 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4887 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4888 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4894 tree a
, t
, current
, parms
;
4896 tree tinfo
= get_template_info (decl
);
4900 error ("template definition of non-template %q#D", decl
);
4901 return error_mark_node
;
4904 tmpl
= TI_TEMPLATE (tinfo
);
4906 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4907 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4908 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4909 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4913 /* The declaration is a specialization of a member
4914 template, declared outside the class. Therefore, the
4915 innermost template arguments will be NULL, so we
4916 replace them with the arguments determined by the
4917 earlier call to check_explicit_specialization. */
4918 args
= DECL_TI_ARGS (decl
);
4921 = build_template_decl (decl
, current_template_parms
,
4923 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4924 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4925 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4926 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4927 DECL_TEMPLATE_INFO (new_tmpl
)
4928 = build_template_info (tmpl
, args
);
4930 register_specialization (new_tmpl
,
4931 most_general_template (tmpl
),
4937 /* Make sure the template headers we got make sense. */
4939 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4940 i
= TMPL_PARMS_DEPTH (parms
);
4941 if (TMPL_ARGS_DEPTH (args
) != i
)
4943 error ("expected %d levels of template parms for %q#D, got %d",
4944 i
, decl
, TMPL_ARGS_DEPTH (args
));
4945 DECL_INTERFACE_KNOWN (decl
) = 1;
4946 return error_mark_node
;
4949 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4951 a
= TMPL_ARGS_LEVEL (args
, i
);
4952 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4954 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4956 if (current
== decl
)
4957 error ("got %d template parameters for %q#D",
4958 TREE_VEC_LENGTH (a
), decl
);
4960 error ("got %d template parameters for %q#T",
4961 TREE_VEC_LENGTH (a
), current
);
4962 error (" but %d required", TREE_VEC_LENGTH (t
));
4963 /* Avoid crash in import_export_decl. */
4964 DECL_INTERFACE_KNOWN (decl
) = 1;
4965 return error_mark_node
;
4968 if (current
== decl
)
4970 else if (current
== NULL_TREE
)
4971 /* Can happen in erroneous input. */
4974 current
= get_containing_scope (current
);
4977 /* Check that the parms are used in the appropriate qualifying scopes
4978 in the declarator. */
4979 if (!comp_template_args
4981 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4984 template arguments to %qD do not match original template %qD",
4985 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4986 if (!uses_template_parms (TI_ARGS (tinfo
)))
4987 inform (input_location
, "use template<> for an explicit specialization");
4988 /* Avoid crash in import_export_decl. */
4989 DECL_INTERFACE_KNOWN (decl
) = 1;
4990 return error_mark_node
;
4994 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4995 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4997 /* Push template declarations for global functions and types. Note
4998 that we do not try to push a global template friend declared in a
4999 template class; such a thing may well depend on the template
5000 parameters of the class. */
5001 if (new_template_p
&& !ctx
5002 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5004 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5005 if (tmpl
== error_mark_node
)
5006 return error_mark_node
;
5008 /* Hide template friend classes that haven't been declared yet. */
5009 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5011 DECL_ANTICIPATED (tmpl
) = 1;
5012 DECL_FRIEND_P (tmpl
) = 1;
5018 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5021 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5022 if (DECL_CONV_FN_P (tmpl
))
5024 int depth
= TMPL_PARMS_DEPTH (parms
);
5026 /* It is a conversion operator. See if the type converted to
5027 depends on innermost template operands. */
5029 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5031 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5034 /* Give template template parms a DECL_CONTEXT of the template
5035 for which they are a parameter. */
5036 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5037 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5039 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5040 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5041 DECL_CONTEXT (parm
) = tmpl
;
5045 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5046 back to its most general template. If TMPL is a specialization,
5047 ARGS may only have the innermost set of arguments. Add the missing
5048 argument levels if necessary. */
5049 if (DECL_TEMPLATE_INFO (tmpl
))
5050 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5052 info
= build_template_info (tmpl
, args
);
5054 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5055 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5058 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5059 retrofit_lang_decl (decl
);
5060 if (DECL_LANG_SPECIFIC (decl
))
5061 DECL_TEMPLATE_INFO (decl
) = info
;
5064 if (flag_implicit_templates
5066 && TREE_PUBLIC (decl
)
5067 && VAR_OR_FUNCTION_DECL_P (decl
))
5068 /* Set DECL_COMDAT on template instantiations; if we force
5069 them to be emitted by explicit instantiation or -frepo,
5070 mark_needed will tell cgraph to do the right thing. */
5071 DECL_COMDAT (decl
) = true;
5073 return DECL_TEMPLATE_RESULT (tmpl
);
5077 push_template_decl (tree decl
)
5079 return push_template_decl_real (decl
, false);
5082 /* FN is an inheriting constructor that inherits from the constructor
5083 template INHERITED; turn FN into a constructor template with a matching
5087 add_inherited_template_parms (tree fn
, tree inherited
)
5090 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5091 inner_parms
= copy_node (inner_parms
);
5093 = tree_cons (size_int (processing_template_decl
+ 1),
5094 inner_parms
, current_template_parms
);
5095 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5096 tree args
= template_parms_to_args (parms
);
5097 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5098 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5099 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5100 DECL_ARTIFICIAL (tmpl
) = true;
5101 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5105 /* Called when a class template TYPE is redeclared with the indicated
5106 template PARMS, e.g.:
5108 template <class T> struct S;
5109 template <class T> struct S {}; */
5112 redeclare_class_template (tree type
, tree parms
)
5118 if (!TYPE_TEMPLATE_INFO (type
))
5120 error ("%qT is not a template type", type
);
5124 tmpl
= TYPE_TI_TEMPLATE (type
);
5125 if (!PRIMARY_TEMPLATE_P (tmpl
))
5126 /* The type is nested in some template class. Nothing to worry
5127 about here; there are no new template parameters for the nested
5133 error ("template specifiers not specified in declaration of %qD",
5138 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5139 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5141 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5143 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5144 "redeclared with %d template parameter",
5145 "redeclared with %d template parameters",
5146 TREE_VEC_LENGTH (parms
));
5147 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5148 "previous declaration %q+D used %d template parameter",
5149 "previous declaration %q+D used %d template parameters",
5150 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5154 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5161 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5162 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5165 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5166 if (error_operand_p (tmpl_parm
))
5169 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5170 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5171 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5173 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5175 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5176 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5177 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5178 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5179 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5180 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5181 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5182 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5183 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5185 error ("template parameter %q+#D", tmpl_parm
);
5186 error ("redeclared here as %q#D", parm
);
5190 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5192 /* We have in [temp.param]:
5194 A template-parameter may not be given default arguments
5195 by two different declarations in the same scope. */
5196 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5197 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5198 "original definition appeared here");
5202 if (parm_default
!= NULL_TREE
)
5203 /* Update the previous template parameters (which are the ones
5204 that will really count) with the new default value. */
5205 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5206 else if (tmpl_default
!= NULL_TREE
)
5207 /* Update the new parameters, too; they'll be used as the
5208 parameters for any members. */
5209 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5215 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5216 to be used when the caller has already checked
5217 (processing_template_decl
5218 && !instantiation_dependent_expression_p (expr)
5219 && potential_constant_expression (expr))
5220 and cleared processing_template_decl. */
5223 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5225 return tsubst_copy_and_build (expr
,
5228 /*in_decl=*/NULL_TREE
,
5229 /*function_p=*/false,
5230 /*integral_constant_expression_p=*/true);
5233 /* Simplify EXPR if it is a non-dependent expression. Returns the
5234 (possibly simplified) expression. */
5237 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5239 if (expr
== NULL_TREE
)
5242 /* If we're in a template, but EXPR isn't value dependent, simplify
5243 it. We're supposed to treat:
5245 template <typename T> void f(T[1 + 1]);
5246 template <typename T> void f(T[2]);
5248 as two declarations of the same function, for example. */
5249 if (processing_template_decl
5250 && !instantiation_dependent_expression_p (expr
)
5251 && potential_constant_expression (expr
))
5253 processing_template_decl_sentinel s
;
5254 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5260 instantiate_non_dependent_expr (tree expr
)
5262 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5265 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5266 template declaration, or a TYPE_DECL for an alias declaration. */
5269 alias_type_or_template_p (tree t
)
5273 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5276 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5277 || DECL_ALIAS_TEMPLATE_P (t
));
5280 /* Return TRUE iff T is a specialization of an alias template. */
5283 alias_template_specialization_p (const_tree t
)
5289 && TYPE_TEMPLATE_INFO (t
)
5290 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5291 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5294 /* Return TRUE iff T is a specialization of an alias template with
5295 dependent template-arguments. */
5298 dependent_alias_template_spec_p (const_tree t
)
5300 return (alias_template_specialization_p (t
)
5301 && any_dependent_template_arguments_p (TYPE_TI_ARGS (t
)));
5304 /* Return the number of innermost template parameters in TMPL. */
5307 num_innermost_template_parms (tree tmpl
)
5309 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5310 return TREE_VEC_LENGTH (parms
);
5313 /* Return either TMPL or another template that it is equivalent to under DR
5314 1286: An alias that just changes the name of a template is equivalent to
5315 the other template. */
5318 get_underlying_template (tree tmpl
)
5320 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5321 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5323 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5324 if (TYPE_TEMPLATE_INFO (result
))
5326 tree sub
= TYPE_TI_TEMPLATE (result
);
5327 if (PRIMARY_TEMPLATE_P (sub
)
5328 && (num_innermost_template_parms (tmpl
)
5329 == num_innermost_template_parms (sub
)))
5331 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5332 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5333 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5335 /* The alias type is equivalent to the pattern of the
5336 underlying template, so strip the alias. */
5346 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5347 must be a function or a pointer-to-function type, as specified
5348 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5349 and check that the resulting function has external linkage. */
5352 convert_nontype_argument_function (tree type
, tree expr
,
5353 tsubst_flags_t complain
)
5357 linkage_kind linkage
;
5359 fn
= instantiate_type (type
, fns
, tf_none
);
5360 if (fn
== error_mark_node
)
5361 return error_mark_node
;
5364 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5365 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5366 if (BASELINK_P (fn_no_ptr
))
5367 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5369 /* [temp.arg.nontype]/1
5371 A template-argument for a non-type, non-template template-parameter
5374 -- the address of an object or function with external [C++11: or
5375 internal] linkage. */
5377 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5379 if (complain
& tf_error
)
5381 error ("%qE is not a valid template argument for type %qT",
5383 if (TYPE_PTR_P (type
))
5384 error ("it must be the address of a function with "
5385 "external linkage");
5387 error ("it must be the name of a function with "
5388 "external linkage");
5393 linkage
= decl_linkage (fn_no_ptr
);
5394 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5396 if (complain
& tf_error
)
5398 if (cxx_dialect
>= cxx11
)
5399 error ("%qE is not a valid template argument for type %qT "
5400 "because %qD has no linkage",
5401 expr
, type
, fn_no_ptr
);
5403 error ("%qE is not a valid template argument for type %qT "
5404 "because %qD does not have external linkage",
5405 expr
, type
, fn_no_ptr
);
5413 /* Subroutine of convert_nontype_argument.
5414 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5415 Emit an error otherwise. */
5418 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5419 tsubst_flags_t complain
)
5422 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5424 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5426 if (processing_template_decl
5427 && TREE_CODE (expr
) == ADDR_EXPR
5428 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5430 if (complain
& tf_error
)
5432 error ("%qE is not a valid template argument for type %qT",
5434 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5439 /* Returns TRUE iff the address of OP is value-dependent.
5441 14.6.2.4 [temp.dep.temp]:
5442 A non-integral non-type template-argument is dependent if its type is
5443 dependent or it has either of the following forms
5446 and contains a nested-name-specifier which specifies a class-name that
5447 names a dependent type.
5449 We generalize this to just say that the address of a member of a
5450 dependent class is value-dependent; the above doesn't cover the
5451 address of a static data member named with an unqualified-id. */
5454 has_value_dependent_address (tree op
)
5456 /* We could use get_inner_reference here, but there's no need;
5457 this is only relevant for template non-type arguments, which
5458 can only be expressed as &id-expression. */
5461 tree ctx
= CP_DECL_CONTEXT (op
);
5462 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5469 /* The next set of functions are used for providing helpful explanatory
5470 diagnostics for failed overload resolution. Their messages should be
5471 indented by two spaces for consistency with the messages in
5475 unify_success (bool /*explain_p*/)
5481 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5484 inform (input_location
,
5485 " couldn't deduce template parameter %qD", parm
);
5490 unify_invalid (bool /*explain_p*/)
5496 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5499 inform (input_location
,
5500 " types %qT and %qT have incompatible cv-qualifiers",
5506 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5509 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5514 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5517 inform (input_location
,
5518 " template parameter %qD is not a parameter pack, but "
5525 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5528 inform (input_location
,
5529 " template argument %qE does not match "
5530 "pointer-to-member constant %qE",
5536 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5539 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5544 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5547 inform (input_location
,
5548 " inconsistent parameter pack deduction with %qT and %qT",
5554 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5559 inform (input_location
,
5560 " deduced conflicting types for parameter %qT (%qT and %qT)",
5561 parm
, first
, second
);
5563 inform (input_location
,
5564 " deduced conflicting values for non-type parameter "
5565 "%qE (%qE and %qE)", parm
, first
, second
);
5571 unify_vla_arg (bool explain_p
, tree arg
)
5574 inform (input_location
,
5575 " variable-sized array type %qT is not "
5576 "a valid template argument",
5582 unify_method_type_error (bool explain_p
, tree arg
)
5585 inform (input_location
,
5586 " member function type %qT is not a valid template argument",
5592 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
5597 inform_n (input_location
, wanted
,
5598 " candidate expects at least %d argument, %d provided",
5599 " candidate expects at least %d arguments, %d provided",
5602 inform_n (input_location
, wanted
,
5603 " candidate expects %d argument, %d provided",
5604 " candidate expects %d arguments, %d provided",
5611 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5613 return unify_arity (explain_p
, have
, wanted
);
5617 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
5618 bool least_p
= false)
5620 return unify_arity (explain_p
, have
, wanted
, least_p
);
5624 unify_arg_conversion (bool explain_p
, tree to_type
,
5625 tree from_type
, tree arg
)
5628 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5629 " cannot convert %qE (type %qT) to type %qT",
5630 arg
, from_type
, to_type
);
5635 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5636 tree parm
, tree arg
)
5641 case tbr_ambiguous_baseclass
:
5642 inform (input_location
, " %qT is an ambiguous base class of %qT",
5646 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5653 unify_inconsistent_template_template_parameters (bool explain_p
)
5656 inform (input_location
,
5657 " template parameters of a template template argument are "
5658 "inconsistent with other deduced template arguments");
5663 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5666 inform (input_location
,
5667 " can't deduce a template for %qT from non-template type %qT",
5673 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5676 inform (input_location
,
5677 " template argument %qE does not match %qD", arg
, parm
);
5682 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5685 inform (input_location
,
5686 " could not resolve address from overloaded function %qE",
5691 /* Attempt to convert the non-type template parameter EXPR to the
5692 indicated TYPE. If the conversion is successful, return the
5693 converted value. If the conversion is unsuccessful, return
5694 NULL_TREE if we issued an error message, or error_mark_node if we
5695 did not. We issue error messages for out-and-out bad template
5696 parameters, but not simply because the conversion failed, since we
5697 might be just trying to do argument deduction. Both TYPE and EXPR
5698 must be non-dependent.
5700 The conversion follows the special rules described in
5701 [temp.arg.nontype], and it is much more strict than an implicit
5704 This function is called twice for each template argument (see
5705 lookup_template_class for a more accurate description of this
5706 problem). This means that we need to handle expressions which
5707 are not valid in a C++ source, but can be created from the
5708 first call (for instance, casts to perform conversions). These
5709 hacks can go away after we fix the double coercion problem. */
5712 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5716 /* Detect immediately string literals as invalid non-type argument.
5717 This special-case is not needed for correctness (we would easily
5718 catch this later), but only to provide better diagnostic for this
5719 common user mistake. As suggested by DR 100, we do not mention
5720 linkage issues in the diagnostic as this is not the point. */
5721 /* FIXME we're making this OK. */
5722 if (TREE_CODE (expr
) == STRING_CST
)
5724 if (complain
& tf_error
)
5725 error ("%qE is not a valid template argument for type %qT "
5726 "because string literals can never be used in this context",
5731 /* Add the ADDR_EXPR now for the benefit of
5732 value_dependent_expression_p. */
5733 if (TYPE_PTROBV_P (type
)
5734 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5736 expr
= decay_conversion (expr
, complain
);
5737 if (expr
== error_mark_node
)
5738 return error_mark_node
;
5741 /* If we are in a template, EXPR may be non-dependent, but still
5742 have a syntactic, rather than semantic, form. For example, EXPR
5743 might be a SCOPE_REF, rather than the VAR_DECL to which the
5744 SCOPE_REF refers. Preserving the qualifying scope is necessary
5745 so that access checking can be performed when the template is
5746 instantiated -- but here we need the resolved form so that we can
5747 convert the argument. */
5748 bool non_dep
= false;
5749 if (TYPE_REF_OBJ_P (type
)
5750 && has_value_dependent_address (expr
))
5751 /* If we want the address and it's value-dependent, don't fold. */;
5752 else if (!type_unknown_p (expr
)
5753 && processing_template_decl
5754 && !instantiation_dependent_expression_p (expr
)
5755 && potential_constant_expression (expr
))
5757 if (error_operand_p (expr
))
5758 return error_mark_node
;
5759 expr_type
= TREE_TYPE (expr
);
5760 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5761 expr
= mark_lvalue_use (expr
);
5763 expr
= mark_rvalue_use (expr
);
5765 /* If the argument is non-dependent, perform any conversions in
5766 non-dependent context as well. */
5767 processing_template_decl_sentinel
s (non_dep
);
5769 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5771 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5772 to a non-type argument of "nullptr". */
5773 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5774 expr
= convert (type
, expr
);
5776 /* In C++11, integral or enumeration non-type template arguments can be
5777 arbitrary constant expressions. Pointer and pointer to
5778 member arguments can be general constant expressions that evaluate
5779 to a null value, but otherwise still need to be of a specific form. */
5780 if (cxx_dialect
>= cxx11
)
5782 if (TREE_CODE (expr
) == PTRMEM_CST
)
5783 /* A PTRMEM_CST is already constant, and a valid template
5784 argument for a parameter of pointer to member type, we just want
5785 to leave it in that form rather than lower it to a
5787 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5788 expr
= maybe_constant_value (expr
);
5789 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5791 tree folded
= maybe_constant_value (expr
);
5792 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5793 : null_member_pointer_value_p (folded
))
5798 /* HACK: Due to double coercion, we can get a
5799 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5800 which is the tree that we built on the first call (see
5801 below when coercing to reference to object or to reference to
5802 function). We just strip everything and get to the arg.
5803 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5805 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5807 tree probe_type
, probe
= expr
;
5808 if (REFERENCE_REF_P (probe
))
5809 probe
= TREE_OPERAND (probe
, 0);
5810 probe_type
= TREE_TYPE (probe
);
5811 if (TREE_CODE (probe
) == NOP_EXPR
)
5813 /* ??? Maybe we could use convert_from_reference here, but we
5814 would need to relax its constraints because the NOP_EXPR
5815 could actually change the type to something more cv-qualified,
5816 and this is not folded by convert_from_reference. */
5817 tree addr
= TREE_OPERAND (probe
, 0);
5818 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5819 && TREE_CODE (addr
) == ADDR_EXPR
5820 && TYPE_PTR_P (TREE_TYPE (addr
))
5821 && (same_type_ignoring_top_level_qualifiers_p
5822 (TREE_TYPE (probe_type
),
5823 TREE_TYPE (TREE_TYPE (addr
)))))
5825 expr
= TREE_OPERAND (addr
, 0);
5826 expr_type
= TREE_TYPE (probe_type
);
5831 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5832 parameter is a pointer to object, through decay and
5833 qualification conversion. Let's strip everything. */
5834 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5838 if (TREE_CODE (probe
) == ADDR_EXPR
5839 && TYPE_PTR_P (TREE_TYPE (probe
)))
5841 /* Skip the ADDR_EXPR only if it is part of the decay for
5842 an array. Otherwise, it is part of the original argument
5843 in the source code. */
5844 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5845 probe
= TREE_OPERAND (probe
, 0);
5847 expr_type
= TREE_TYPE (expr
);
5851 /* [temp.arg.nontype]/5, bullet 1
5853 For a non-type template-parameter of integral or enumeration type,
5854 integral promotions (_conv.prom_) and integral conversions
5855 (_conv.integral_) are applied. */
5856 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5858 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5859 t
= maybe_constant_value (t
);
5860 if (t
!= error_mark_node
)
5863 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5864 return error_mark_node
;
5866 /* Notice that there are constant expressions like '4 % 0' which
5867 do not fold into integer constants. */
5868 if (TREE_CODE (expr
) != INTEGER_CST
)
5870 if (complain
& tf_error
)
5872 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5873 if (processing_template_decl
5874 && !require_potential_constant_expression (expr
))
5876 expr
= cxx_constant_value (expr
);
5877 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5878 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
5879 "in template argument for type %qT ", type
);
5880 if (expr
== error_mark_node
)
5882 /* else cxx_constant_value complained but gave us
5883 a real constant, so go ahead. */
5884 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5890 /* Avoid typedef problems. */
5891 if (TREE_TYPE (expr
) != type
)
5892 expr
= fold_convert (type
, expr
);
5894 /* [temp.arg.nontype]/5, bullet 2
5896 For a non-type template-parameter of type pointer to object,
5897 qualification conversions (_conv.qual_) and the array-to-pointer
5898 conversion (_conv.array_) are applied. */
5899 else if (TYPE_PTROBV_P (type
))
5901 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5903 A template-argument for a non-type, non-template template-parameter
5904 shall be one of: [...]
5906 -- the name of a non-type template-parameter;
5907 -- the address of an object or function with external linkage, [...]
5908 expressed as "& id-expression" where the & is optional if the name
5909 refers to a function or array, or if the corresponding
5910 template-parameter is a reference.
5912 Here, we do not care about functions, as they are invalid anyway
5913 for a parameter of type pointer-to-object. */
5915 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5916 /* Non-type template parameters are OK. */
5918 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5919 /* Null pointer values are OK in C++11. */;
5920 else if (TREE_CODE (expr
) != ADDR_EXPR
5921 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5925 if (complain
& tf_error
)
5926 error ("%qD is not a valid template argument "
5927 "because %qD is a variable, not the address of "
5928 "a variable", expr
, expr
);
5931 if (POINTER_TYPE_P (expr_type
))
5933 if (complain
& tf_error
)
5934 error ("%qE is not a valid template argument for %qT "
5935 "because it is not the address of a variable",
5939 /* Other values, like integer constants, might be valid
5940 non-type arguments of some other type. */
5941 return error_mark_node
;
5947 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5948 ? TREE_OPERAND (expr
, 0) : expr
);
5951 if (complain
& tf_error
)
5952 error ("%qE is not a valid template argument of type %qT "
5953 "because %qE is not a variable", expr
, type
, decl
);
5956 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5958 if (complain
& tf_error
)
5959 error ("%qE is not a valid template argument of type %qT "
5960 "because %qD does not have external linkage",
5964 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
5966 if (complain
& tf_error
)
5967 error ("%qE is not a valid template argument of type %qT "
5968 "because %qD has no linkage", expr
, type
, decl
);
5973 expr
= decay_conversion (expr
, complain
);
5974 if (expr
== error_mark_node
)
5975 return error_mark_node
;
5977 expr
= perform_qualification_conversions (type
, expr
);
5978 if (expr
== error_mark_node
)
5979 return error_mark_node
;
5981 /* [temp.arg.nontype]/5, bullet 3
5983 For a non-type template-parameter of type reference to object, no
5984 conversions apply. The type referred to by the reference may be more
5985 cv-qualified than the (otherwise identical) type of the
5986 template-argument. The template-parameter is bound directly to the
5987 template-argument, which must be an lvalue. */
5988 else if (TYPE_REF_OBJ_P (type
))
5990 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5992 return error_mark_node
;
5994 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5996 if (complain
& tf_error
)
5997 error ("%qE is not a valid template argument for type %qT "
5998 "because of conflicts in cv-qualification", expr
, type
);
6002 if (!real_lvalue_p (expr
))
6004 if (complain
& tf_error
)
6005 error ("%qE is not a valid template argument for type %qT "
6006 "because it is not an lvalue", expr
, type
);
6010 /* [temp.arg.nontype]/1
6012 A template-argument for a non-type, non-template template-parameter
6013 shall be one of: [...]
6015 -- the address of an object or function with external linkage. */
6016 if (INDIRECT_REF_P (expr
)
6017 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6019 expr
= TREE_OPERAND (expr
, 0);
6022 if (complain
& tf_error
)
6023 error ("%q#D is not a valid template argument for type %qT "
6024 "because a reference variable does not have a constant "
6025 "address", expr
, type
);
6032 if (complain
& tf_error
)
6033 error ("%qE is not a valid template argument for type %qT "
6034 "because it is not an object with external linkage",
6039 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
6041 if (complain
& tf_error
)
6042 error ("%qE is not a valid template argument for type %qT "
6043 "because object %qD has not external linkage",
6048 expr
= build_nop (type
, build_address (expr
));
6050 /* [temp.arg.nontype]/5, bullet 4
6052 For a non-type template-parameter of type pointer to function, only
6053 the function-to-pointer conversion (_conv.func_) is applied. If the
6054 template-argument represents a set of overloaded functions (or a
6055 pointer to such), the matching function is selected from the set
6057 else if (TYPE_PTRFN_P (type
))
6059 /* If the argument is a template-id, we might not have enough
6060 context information to decay the pointer. */
6061 if (!type_unknown_p (expr_type
))
6063 expr
= decay_conversion (expr
, complain
);
6064 if (expr
== error_mark_node
)
6065 return error_mark_node
;
6068 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6069 /* Null pointer values are OK in C++11. */
6070 return perform_qualification_conversions (type
, expr
);
6072 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6073 if (!expr
|| expr
== error_mark_node
)
6076 /* [temp.arg.nontype]/5, bullet 5
6078 For a non-type template-parameter of type reference to function, no
6079 conversions apply. If the template-argument represents a set of
6080 overloaded functions, the matching function is selected from the set
6082 else if (TYPE_REFFN_P (type
))
6084 if (TREE_CODE (expr
) == ADDR_EXPR
)
6086 if (complain
& tf_error
)
6088 error ("%qE is not a valid template argument for type %qT "
6089 "because it is a pointer", expr
, type
);
6090 inform (input_location
, "try using %qE instead",
6091 TREE_OPERAND (expr
, 0));
6096 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6097 if (!expr
|| expr
== error_mark_node
)
6100 expr
= build_nop (type
, build_address (expr
));
6102 /* [temp.arg.nontype]/5, bullet 6
6104 For a non-type template-parameter of type pointer to member function,
6105 no conversions apply. If the template-argument represents a set of
6106 overloaded member functions, the matching member function is selected
6107 from the set (_over.over_). */
6108 else if (TYPE_PTRMEMFUNC_P (type
))
6110 expr
= instantiate_type (type
, expr
, tf_none
);
6111 if (expr
== error_mark_node
)
6112 return error_mark_node
;
6114 /* [temp.arg.nontype] bullet 1 says the pointer to member
6115 expression must be a pointer-to-member constant. */
6116 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6117 return error_mark_node
;
6119 /* There is no way to disable standard conversions in
6120 resolve_address_of_overloaded_function (called by
6121 instantiate_type). It is possible that the call succeeded by
6122 converting &B::I to &D::I (where B is a base of D), so we need
6123 to reject this conversion here.
6125 Actually, even if there was a way to disable standard conversions,
6126 it would still be better to reject them here so that we can
6127 provide a superior diagnostic. */
6128 if (!same_type_p (TREE_TYPE (expr
), type
))
6130 if (complain
& tf_error
)
6132 error ("%qE is not a valid template argument for type %qT "
6133 "because it is of type %qT", expr
, type
,
6135 /* If we are just one standard conversion off, explain. */
6136 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6137 inform (input_location
,
6138 "standard conversions are not allowed in this context");
6143 /* [temp.arg.nontype]/5, bullet 7
6145 For a non-type template-parameter of type pointer to data member,
6146 qualification conversions (_conv.qual_) are applied. */
6147 else if (TYPE_PTRDATAMEM_P (type
))
6149 /* [temp.arg.nontype] bullet 1 says the pointer to member
6150 expression must be a pointer-to-member constant. */
6151 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6152 return error_mark_node
;
6154 expr
= perform_qualification_conversions (type
, expr
);
6155 if (expr
== error_mark_node
)
6158 else if (NULLPTR_TYPE_P (type
))
6160 if (expr
!= nullptr_node
)
6162 if (complain
& tf_error
)
6163 error ("%qE is not a valid template argument for type %qT "
6164 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6169 /* A template non-type parameter must be one of the above. */
6173 /* Sanity check: did we actually convert the argument to the
6175 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6176 (type
, TREE_TYPE (expr
)));
6180 /* Subroutine of coerce_template_template_parms, which returns 1 if
6181 PARM_PARM and ARG_PARM match using the rule for the template
6182 parameters of template template parameters. Both PARM and ARG are
6183 template parameters; the rest of the arguments are the same as for
6184 coerce_template_template_parms.
6187 coerce_template_template_parm (tree parm
,
6189 tsubst_flags_t complain
,
6193 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6194 || parm
== NULL_TREE
|| error_operand_p (parm
))
6197 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6200 switch (TREE_CODE (parm
))
6203 /* We encounter instantiations of templates like
6204 template <template <template <class> class> class TT>
6207 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6208 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6210 if (!coerce_template_template_parms
6211 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6217 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6218 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6219 /* Argument is a parameter pack but parameter is not. */
6224 /* The tsubst call is used to handle cases such as
6226 template <int> class C {};
6227 template <class T, template <T> class TT> class D {};
6230 i.e. the parameter list of TT depends on earlier parameters. */
6231 if (!uses_template_parms (TREE_TYPE (arg
))
6233 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6237 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6238 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6239 /* Argument is a parameter pack but parameter is not. */
6252 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6253 template template parameters. Both PARM_PARMS and ARG_PARMS are
6254 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6257 Consider the example:
6258 template <class T> class A;
6259 template<template <class U> class TT> class B;
6261 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6262 the parameters to A, and OUTER_ARGS contains A. */
6265 coerce_template_template_parms (tree parm_parms
,
6267 tsubst_flags_t complain
,
6271 int nparms
, nargs
, i
;
6275 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6276 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6278 nparms
= TREE_VEC_LENGTH (parm_parms
);
6279 nargs
= TREE_VEC_LENGTH (arg_parms
);
6281 /* Determine whether we have a parameter pack at the end of the
6282 template template parameter's template parameter list. */
6283 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6285 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6287 if (error_operand_p (parm
))
6290 switch (TREE_CODE (parm
))
6294 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6299 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6309 && !(variadic_p
&& nargs
>= nparms
- 1))
6312 /* Check all of the template parameters except the parameter pack at
6313 the end (if any). */
6314 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6316 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6317 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6320 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6321 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6323 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6331 /* Check each of the template parameters in the template
6332 argument against the template parameter pack at the end of
6333 the template template parameter. */
6334 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6337 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6339 for (; i
< nargs
; ++i
)
6341 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6344 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6346 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6355 /* Verifies that the deduced template arguments (in TARGS) for the
6356 template template parameters (in TPARMS) represent valid bindings,
6357 by comparing the template parameter list of each template argument
6358 to the template parameter list of its corresponding template
6359 template parameter, in accordance with DR150. This
6360 routine can only be called after all template arguments have been
6361 deduced. It will return TRUE if all of the template template
6362 parameter bindings are okay, FALSE otherwise. */
6364 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6366 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6369 /* We're dealing with template parms in this process. */
6370 ++processing_template_decl
;
6372 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6374 for (i
= 0; i
< ntparms
; ++i
)
6376 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6377 tree targ
= TREE_VEC_ELT (targs
, i
);
6379 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6381 tree packed_args
= NULL_TREE
;
6384 if (ARGUMENT_PACK_P (targ
))
6386 /* Look inside the argument pack. */
6387 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6388 len
= TREE_VEC_LENGTH (packed_args
);
6391 for (idx
= 0; idx
< len
; ++idx
)
6393 tree targ_parms
= NULL_TREE
;
6396 /* Extract the next argument from the argument
6398 targ
= TREE_VEC_ELT (packed_args
, idx
);
6400 if (PACK_EXPANSION_P (targ
))
6401 /* Look at the pattern of the pack expansion. */
6402 targ
= PACK_EXPANSION_PATTERN (targ
);
6404 /* Extract the template parameters from the template
6406 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6407 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6408 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6409 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6411 /* Verify that we can coerce the template template
6412 parameters from the template argument to the template
6413 parameter. This requires an exact match. */
6415 && !coerce_template_template_parms
6416 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6431 --processing_template_decl
;
6435 /* Since type attributes aren't mangled, we need to strip them from
6436 template type arguments. */
6439 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6442 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6444 mv
= TYPE_MAIN_VARIANT (arg
);
6445 arg
= strip_typedefs (arg
);
6446 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6447 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6449 if (complain
& tf_warning
)
6450 warning (0, "ignoring attributes on template argument %qT", arg
);
6451 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6452 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6457 /* Convert the indicated template ARG as necessary to match the
6458 indicated template PARM. Returns the converted ARG, or
6459 error_mark_node if the conversion was unsuccessful. Error and
6460 warning messages are issued under control of COMPLAIN. This
6461 conversion is for the Ith parameter in the parameter list. ARGS is
6462 the full set of template arguments deduced so far. */
6465 convert_template_argument (tree parm
,
6468 tsubst_flags_t complain
,
6474 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6476 if (TREE_CODE (arg
) == TREE_LIST
6477 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6479 /* The template argument was the name of some
6480 member function. That's usually
6481 invalid, but static members are OK. In any
6482 case, grab the underlying fields/functions
6483 and issue an error later if required. */
6484 orig_arg
= TREE_VALUE (arg
);
6485 TREE_TYPE (arg
) = unknown_type_node
;
6490 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6491 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6492 || requires_tmpl_type
);
6494 /* When determining whether an argument pack expansion is a template,
6495 look at the pattern. */
6496 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6497 arg
= PACK_EXPANSION_PATTERN (arg
);
6499 /* Deal with an injected-class-name used as a template template arg. */
6500 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6502 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6503 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6505 if (cxx_dialect
>= cxx11
)
6506 /* OK under DR 1004. */;
6507 else if (complain
& tf_warning_or_error
)
6508 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6509 " used as template template argument", TYPE_NAME (arg
));
6510 else if (flag_pedantic_errors
)
6518 ((TREE_CODE (arg
) == TEMPLATE_DECL
6519 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6520 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6521 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6522 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6525 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6526 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6527 arg
= TYPE_STUB_DECL (arg
);
6529 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6531 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6532 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6534 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6536 if (complain
& tf_error
)
6537 error ("invalid use of destructor %qE as a type", orig_arg
);
6538 return error_mark_node
;
6541 permerror (input_location
,
6542 "to refer to a type member of a template parameter, "
6543 "use %<typename %E%>", orig_arg
);
6545 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6546 TREE_OPERAND (arg
, 1),
6552 if (is_type
!= requires_type
)
6556 if (complain
& tf_error
)
6558 error ("type/value mismatch at argument %d in template "
6559 "parameter list for %qD",
6562 inform (input_location
,
6563 " expected a constant of type %qT, got %qT",
6565 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6566 else if (requires_tmpl_type
)
6567 inform (input_location
,
6568 " expected a class template, got %qE", orig_arg
);
6570 inform (input_location
,
6571 " expected a type, got %qE", orig_arg
);
6574 return error_mark_node
;
6576 if (is_tmpl_type
^ requires_tmpl_type
)
6578 if (in_decl
&& (complain
& tf_error
))
6580 error ("type/value mismatch at argument %d in template "
6581 "parameter list for %qD",
6584 inform (input_location
,
6585 " expected a type, got %qT", DECL_NAME (arg
));
6587 inform (input_location
,
6588 " expected a class template, got %qT", orig_arg
);
6590 return error_mark_node
;
6595 if (requires_tmpl_type
)
6597 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6599 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6600 /* The number of argument required is not known yet.
6601 Just accept it for now. */
6602 val
= TREE_TYPE (arg
);
6605 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6608 /* Strip alias templates that are equivalent to another
6610 arg
= get_underlying_template (arg
);
6611 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6613 if (coerce_template_template_parms (parmparm
, argparm
,
6619 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6621 if (val
!= error_mark_node
)
6623 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6624 val
= TREE_TYPE (val
);
6625 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6626 val
= make_pack_expansion (val
);
6631 if (in_decl
&& (complain
& tf_error
))
6633 error ("type/value mismatch at argument %d in "
6634 "template parameter list for %qD",
6636 inform (input_location
,
6637 " expected a template of type %qD, got %qT",
6641 val
= error_mark_node
;
6647 /* We only form one instance of each template specialization.
6648 Therefore, if we use a non-canonical variant (i.e., a
6649 typedef), any future messages referring to the type will use
6650 the typedef, which is confusing if those future uses do not
6651 themselves also use the typedef. */
6653 val
= canonicalize_type_argument (val
, complain
);
6657 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6659 if (invalid_nontype_parm_type_p (t
, complain
))
6660 return error_mark_node
;
6662 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6664 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6668 /* Not sure if this is reachable, but it doesn't hurt
6670 error ("type mismatch in nontype parameter pack");
6671 val
= error_mark_node
;
6674 else if (!dependent_template_arg_p (orig_arg
)
6675 && !uses_template_parms (t
))
6676 /* We used to call digest_init here. However, digest_init
6677 will report errors, which we don't want when complain
6678 is zero. More importantly, digest_init will try too
6679 hard to convert things: for example, `0' should not be
6680 converted to pointer type at this point according to
6681 the standard. Accepting this is not merely an
6682 extension, since deciding whether or not these
6683 conversions can occur is part of determining which
6684 function template to call, or whether a given explicit
6685 argument specification is valid. */
6686 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6688 val
= strip_typedefs_expr (orig_arg
);
6690 if (val
== NULL_TREE
)
6691 val
= error_mark_node
;
6692 else if (val
== error_mark_node
&& (complain
& tf_error
))
6693 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6695 if (TREE_CODE (val
) == SCOPE_REF
)
6697 /* Strip typedefs from the SCOPE_REF. */
6698 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6699 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6701 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6702 QUALIFIED_NAME_IS_TEMPLATE (val
));
6709 /* Coerces the remaining template arguments in INNER_ARGS (from
6710 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6711 Returns the coerced argument pack. PARM_IDX is the position of this
6712 parameter in the template parameter list. ARGS is the original
6713 template argument list. */
6715 coerce_template_parameter_pack (tree parms
,
6723 tsubst_flags_t complain
)
6725 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6726 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6729 tree packed_parms
= NULL_TREE
;
6731 if (arg_idx
> nargs
)
6734 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6736 /* When the template parameter is a non-type template parameter pack
6737 or template template parameter pack whose type or template
6738 parameters use parameter packs, we know exactly how many arguments
6739 we are looking for. Build a vector of the instantiated decls for
6740 these template parameters in PACKED_PARMS. */
6741 /* We can't use make_pack_expansion here because it would interpret a
6742 _DECL as a use rather than a declaration. */
6743 tree decl
= TREE_VALUE (parm
);
6744 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6745 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6746 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6747 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6749 TREE_VEC_LENGTH (args
)--;
6750 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6751 TREE_VEC_LENGTH (args
)++;
6753 if (packed_parms
== error_mark_node
)
6754 return error_mark_node
;
6756 /* If we're doing a partial instantiation of a member template,
6757 verify that all of the types used for the non-type
6758 template parameter pack are, in fact, valid for non-type
6759 template parameters. */
6761 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6763 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6764 for (j
= 0; j
< len
; ++j
)
6766 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6767 if (invalid_nontype_parm_type_p (t
, complain
))
6768 return error_mark_node
;
6772 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6775 packed_args
= make_tree_vec (nargs
- arg_idx
);
6777 /* Convert the remaining arguments, which will be a part of the
6778 parameter pack "parm". */
6779 for (; arg_idx
< nargs
; ++arg_idx
)
6781 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6782 tree actual_parm
= TREE_VALUE (parm
);
6783 int pack_idx
= arg_idx
- parm_idx
;
6787 /* Once we've packed as many args as we have types, stop. */
6788 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6790 else if (PACK_EXPANSION_P (arg
))
6791 /* We don't know how many args we have yet, just
6792 use the unconverted ones for now. */
6795 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6798 if (arg
== error_mark_node
)
6800 if (complain
& tf_error
)
6801 error ("template argument %d is invalid", arg_idx
+ 1);
6804 arg
= convert_template_argument (actual_parm
,
6805 arg
, new_args
, complain
, parm_idx
,
6807 if (arg
== error_mark_node
)
6809 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6812 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6813 && TREE_VEC_LENGTH (packed_args
) > 0)
6815 if (complain
& tf_error
)
6816 error ("wrong number of template arguments (%d, should be %d)",
6817 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6818 return error_mark_node
;
6821 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6822 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6823 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6826 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6827 TREE_TYPE (argument_pack
)
6828 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6829 TREE_CONSTANT (argument_pack
) = 1;
6832 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6833 #ifdef ENABLE_CHECKING
6834 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6835 TREE_VEC_LENGTH (packed_args
));
6837 return argument_pack
;
6840 /* Returns the number of pack expansions in the template argument vector
6844 pack_expansion_args_count (tree args
)
6849 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6851 tree elt
= TREE_VEC_ELT (args
, i
);
6852 if (elt
&& PACK_EXPANSION_P (elt
))
6858 /* Convert all template arguments to their appropriate types, and
6859 return a vector containing the innermost resulting template
6860 arguments. If any error occurs, return error_mark_node. Error and
6861 warning messages are issued under control of COMPLAIN.
6863 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6864 for arguments not specified in ARGS. Otherwise, if
6865 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6866 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6867 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6871 coerce_template_parms (tree parms
,
6874 tsubst_flags_t complain
,
6875 bool require_all_args
,
6876 bool use_default_args
)
6878 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6879 tree orig_inner_args
;
6882 tree new_inner_args
;
6883 int saved_unevaluated_operand
;
6884 int saved_inhibit_evaluation_warnings
;
6886 /* When used as a boolean value, indicates whether this is a
6887 variadic template parameter list. Since it's an int, we can also
6888 subtract it from nparms to get the number of non-variadic
6891 int variadic_args_p
= 0;
6892 int post_variadic_parms
= 0;
6894 /* Likewise for parameters with default arguments. */
6897 if (args
== error_mark_node
)
6898 return error_mark_node
;
6900 nparms
= TREE_VEC_LENGTH (parms
);
6902 /* Determine if there are any parameter packs or default arguments. */
6903 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6905 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6907 ++post_variadic_parms
;
6908 if (template_parameter_pack_p (TREE_VALUE (parm
)))
6910 if (TREE_PURPOSE (parm
))
6914 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6915 /* If there are no parameters that follow a parameter pack, we need to
6916 expand any argument packs so that we can deduce a parameter pack from
6917 some non-packed args followed by an argument pack, as in variadic85.C.
6918 If there are such parameters, we need to leave argument packs intact
6919 so the arguments are assigned properly. This can happen when dealing
6920 with a nested class inside a partial specialization of a class
6921 template, as in variadic92.C, or when deducing a template parameter pack
6922 from a sub-declarator, as in variadic114.C. */
6923 if (!post_variadic_parms
)
6924 inner_args
= expand_template_argument_pack (inner_args
);
6926 /* Count any pack expansion args. */
6927 variadic_args_p
= pack_expansion_args_count (inner_args
);
6929 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6930 if ((nargs
> nparms
&& !variadic_p
)
6931 || (nargs
< nparms
- variadic_p
6934 && (!use_default_args
6935 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6936 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6938 if (complain
& tf_error
)
6940 if (variadic_p
|| default_p
)
6942 nparms
-= variadic_p
+ default_p
;
6943 error ("wrong number of template arguments "
6944 "(%d, should be at least %d)", nargs
, nparms
);
6947 error ("wrong number of template arguments "
6948 "(%d, should be %d)", nargs
, nparms
);
6951 inform (input_location
, "provided for %q+D", in_decl
);
6954 return error_mark_node
;
6956 /* We can't pass a pack expansion to a non-pack parameter of an alias
6957 template (DR 1430). */
6958 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
6960 && nargs
- variadic_args_p
< nparms
- variadic_p
)
6962 if (complain
& tf_error
)
6964 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
6966 tree arg
= TREE_VEC_ELT (inner_args
, i
);
6967 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6969 if (PACK_EXPANSION_P (arg
)
6970 && !template_parameter_pack_p (parm
))
6972 error ("pack expansion argument for non-pack parameter "
6973 "%qD of alias template %qD", parm
, in_decl
);
6974 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
6981 return error_mark_node
;
6984 /* We need to evaluate the template arguments, even though this
6985 template-id may be nested within a "sizeof". */
6986 saved_unevaluated_operand
= cp_unevaluated_operand
;
6987 cp_unevaluated_operand
= 0;
6988 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6989 c_inhibit_evaluation_warnings
= 0;
6990 new_inner_args
= make_tree_vec (nparms
);
6991 new_args
= add_outermost_template_args (args
, new_inner_args
);
6992 int pack_adjust
= 0;
6993 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6998 /* Get the Ith template parameter. */
6999 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7001 if (parm
== error_mark_node
)
7003 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7007 /* Calculate the next argument. */
7008 if (arg_idx
< nargs
)
7009 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7013 if (template_parameter_pack_p (TREE_VALUE (parm
))
7014 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7016 /* Some arguments will be placed in the
7017 template parameter pack PARM. */
7018 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7019 inner_args
, arg_idx
,
7023 if (arg
== NULL_TREE
)
7025 /* We don't know how many args we have yet, just use the
7026 unconverted (and still packed) ones for now. */
7027 new_inner_args
= orig_inner_args
;
7032 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7034 /* Store this argument. */
7035 if (arg
== error_mark_node
)
7038 /* We are done with all of the arguments. */
7043 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7044 arg_idx
+= pack_adjust
;
7051 if (PACK_EXPANSION_P (arg
))
7053 /* "If every valid specialization of a variadic template
7054 requires an empty template parameter pack, the template is
7055 ill-formed, no diagnostic required." So check that the
7056 pattern works with this parameter. */
7057 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7058 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7062 if (conv
== error_mark_node
)
7064 inform (input_location
, "so any instantiation with a "
7065 "non-empty parameter pack would be ill-formed");
7068 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7069 /* Recover from missing typename. */
7070 TREE_VEC_ELT (inner_args
, arg_idx
)
7071 = make_pack_expansion (conv
);
7073 /* We don't know how many args we have yet, just
7074 use the unconverted ones for now. */
7075 new_inner_args
= inner_args
;
7080 else if (require_all_args
)
7082 /* There must be a default arg in this case. */
7083 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7085 /* The position of the first default template argument,
7086 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7088 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7089 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7090 arg_idx
- pack_adjust
);
7095 if (arg
== error_mark_node
)
7097 if (complain
& tf_error
)
7098 error ("template argument %d is invalid", arg_idx
+ 1);
7101 /* This only occurs if there was an error in the template
7102 parameter list itself (which we would already have
7103 reported) that we are trying to recover from, e.g., a class
7104 template with a parameter list such as
7105 template<typename..., typename>. */
7108 arg
= convert_template_argument (TREE_VALUE (parm
),
7109 arg
, new_args
, complain
,
7112 if (arg
== error_mark_node
)
7114 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7116 cp_unevaluated_operand
= saved_unevaluated_operand
;
7117 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7119 if (variadic_p
&& arg_idx
< nargs
)
7121 if (complain
& tf_error
)
7123 error ("wrong number of template arguments "
7124 "(%d, should be %d)", nargs
, arg_idx
);
7126 error ("provided for %q+D", in_decl
);
7128 return error_mark_node
;
7132 return error_mark_node
;
7134 #ifdef ENABLE_CHECKING
7135 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7136 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7137 TREE_VEC_LENGTH (new_inner_args
));
7140 return new_inner_args
;
7143 /* Like coerce_template_parms. If PARMS represents all template
7144 parameters levels, this function returns a vector of vectors
7145 representing all the resulting argument levels. Note that in this
7146 case, only the innermost arguments are coerced because the
7147 outermost ones are supposed to have been coerced already.
7149 Otherwise, if PARMS represents only (the innermost) vector of
7150 parameters, this function returns a vector containing just the
7151 innermost resulting arguments. */
7154 coerce_innermost_template_parms (tree parms
,
7157 tsubst_flags_t complain
,
7158 bool require_all_args
,
7159 bool use_default_args
)
7161 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7162 int args_depth
= TMPL_ARGS_DEPTH (args
);
7165 if (parms_depth
> 1)
7167 coerced_args
= make_tree_vec (parms_depth
);
7171 for (level
= parms
, cur_depth
= parms_depth
;
7172 parms_depth
> 0 && level
!= NULL_TREE
;
7173 level
= TREE_CHAIN (level
), --cur_depth
)
7176 if (cur_depth
== args_depth
)
7177 l
= coerce_template_parms (TREE_VALUE (level
),
7178 args
, in_decl
, complain
,
7182 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7184 if (l
== error_mark_node
)
7185 return error_mark_node
;
7187 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7191 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7192 args
, in_decl
, complain
,
7195 return coerced_args
;
7198 /* Returns 1 if template args OT and NT are equivalent. */
7201 template_args_equal (tree ot
, tree nt
)
7205 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7208 if (TREE_CODE (nt
) == TREE_VEC
)
7209 /* For member templates */
7210 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7211 else if (PACK_EXPANSION_P (ot
))
7212 return (PACK_EXPANSION_P (nt
)
7213 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7214 PACK_EXPANSION_PATTERN (nt
))
7215 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7216 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7217 else if (ARGUMENT_PACK_P (ot
))
7222 if (!ARGUMENT_PACK_P (nt
))
7225 opack
= ARGUMENT_PACK_ARGS (ot
);
7226 npack
= ARGUMENT_PACK_ARGS (nt
);
7227 len
= TREE_VEC_LENGTH (opack
);
7228 if (TREE_VEC_LENGTH (npack
) != len
)
7230 for (i
= 0; i
< len
; ++i
)
7231 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7232 TREE_VEC_ELT (npack
, i
)))
7236 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7238 /* We get here probably because we are in the middle of substituting
7239 into the pattern of a pack expansion. In that case the
7240 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7241 interested in. So we want to use the initial pack argument for
7243 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7244 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7245 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7246 return template_args_equal (ot
, nt
);
7248 else if (TYPE_P (nt
))
7252 /* Don't treat an alias template specialization with dependent
7253 arguments as equivalent to its underlying type when used as a
7254 template argument; we need them to hash differently. */
7255 bool ndep
= dependent_alias_template_spec_p (nt
);
7256 ++processing_template_decl
;
7257 bool odep
= dependent_alias_template_spec_p (ot
);
7258 --processing_template_decl
;
7262 return (TYPE_TI_TEMPLATE (nt
) == TYPE_TI_TEMPLATE (ot
)
7263 && template_args_equal (TYPE_TI_ARGS (nt
), TYPE_TI_ARGS (ot
)));
7265 return same_type_p (ot
, nt
);
7267 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7270 return cp_tree_equal (ot
, nt
);
7273 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7274 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7275 NEWARG_PTR with the offending arguments if they are non-NULL. */
7278 comp_template_args_with_info (tree oldargs
, tree newargs
,
7279 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7283 if (oldargs
== newargs
)
7286 if (!oldargs
|| !newargs
)
7289 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7292 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7294 tree nt
= TREE_VEC_ELT (newargs
, i
);
7295 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7297 if (! template_args_equal (ot
, nt
))
7299 if (oldarg_ptr
!= NULL
)
7301 if (newarg_ptr
!= NULL
)
7309 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7310 of template arguments. Returns 0 otherwise. */
7313 comp_template_args (tree oldargs
, tree newargs
)
7315 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7319 add_pending_template (tree d
)
7321 tree ti
= (TYPE_P (d
)
7322 ? CLASSTYPE_TEMPLATE_INFO (d
)
7323 : DECL_TEMPLATE_INFO (d
));
7324 struct pending_template
*pt
;
7327 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7330 /* We are called both from instantiate_decl, where we've already had a
7331 tinst_level pushed, and instantiate_template, where we haven't.
7333 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7336 push_tinst_level (d
);
7338 pt
= ggc_alloc
<pending_template
> ();
7340 pt
->tinst
= current_tinst_level
;
7341 if (last_pending_template
)
7342 last_pending_template
->next
= pt
;
7344 pending_templates
= pt
;
7346 last_pending_template
= pt
;
7348 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7355 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7356 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7357 documentation for TEMPLATE_ID_EXPR. */
7360 lookup_template_function (tree fns
, tree arglist
)
7364 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7365 return error_mark_node
;
7367 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7369 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7371 error ("%q#D is not a function template", fns
);
7372 return error_mark_node
;
7375 if (BASELINK_P (fns
))
7377 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7379 BASELINK_FUNCTIONS (fns
),
7384 type
= TREE_TYPE (fns
);
7385 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7386 type
= unknown_type_node
;
7388 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7391 /* Within the scope of a template class S<T>, the name S gets bound
7392 (in build_self_reference) to a TYPE_DECL for the class, not a
7393 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7394 or one of its enclosing classes, and that type is a template,
7395 return the associated TEMPLATE_DECL. Otherwise, the original
7398 Also handle the case when DECL is a TREE_LIST of ambiguous
7399 injected-class-names from different bases. */
7402 maybe_get_template_decl_from_type_decl (tree decl
)
7404 if (decl
== NULL_TREE
)
7407 /* DR 176: A lookup that finds an injected-class-name (10.2
7408 [class.member.lookup]) can result in an ambiguity in certain cases
7409 (for example, if it is found in more than one base class). If all of
7410 the injected-class-names that are found refer to specializations of
7411 the same class template, and if the name is followed by a
7412 template-argument-list, the reference refers to the class template
7413 itself and not a specialization thereof, and is not ambiguous. */
7414 if (TREE_CODE (decl
) == TREE_LIST
)
7416 tree t
, tmpl
= NULL_TREE
;
7417 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7419 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7422 else if (tmpl
!= elt
)
7425 if (tmpl
&& t
== NULL_TREE
)
7431 return (decl
!= NULL_TREE
7432 && DECL_SELF_REFERENCE_P (decl
)
7433 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7434 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7437 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7438 parameters, find the desired type.
7440 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7442 IN_DECL, if non-NULL, is the template declaration we are trying to
7445 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7446 the class we are looking up.
7448 Issue error and warning messages under control of COMPLAIN.
7450 If the template class is really a local class in a template
7451 function, then the FUNCTION_CONTEXT is the function in which it is
7454 ??? Note that this function is currently called *twice* for each
7455 template-id: the first time from the parser, while creating the
7456 incomplete type (finish_template_type), and the second type during the
7457 real instantiation (instantiate_template_class). This is surely something
7458 that we want to avoid. It also causes some problems with argument
7459 coercion (see convert_nontype_argument for more information on this). */
7462 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7463 int entering_scope
, tsubst_flags_t complain
)
7465 tree templ
= NULL_TREE
, parmlist
;
7472 if (identifier_p (d1
))
7474 tree value
= innermost_non_namespace_value (d1
);
7475 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7480 push_decl_namespace (context
);
7481 templ
= lookup_name (d1
);
7482 templ
= maybe_get_template_decl_from_type_decl (templ
);
7484 pop_decl_namespace ();
7487 context
= DECL_CONTEXT (templ
);
7489 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7491 tree type
= TREE_TYPE (d1
);
7493 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7494 an implicit typename for the second A. Deal with it. */
7495 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7496 type
= TREE_TYPE (type
);
7498 if (CLASSTYPE_TEMPLATE_INFO (type
))
7500 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7501 d1
= DECL_NAME (templ
);
7504 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7505 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7507 templ
= TYPE_TI_TEMPLATE (d1
);
7508 d1
= DECL_NAME (templ
);
7510 else if (DECL_TYPE_TEMPLATE_P (d1
))
7513 d1
= DECL_NAME (templ
);
7514 context
= DECL_CONTEXT (templ
);
7516 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7519 d1
= DECL_NAME (templ
);
7522 /* Issue an error message if we didn't find a template. */
7525 if (complain
& tf_error
)
7526 error ("%qT is not a template", d1
);
7527 return error_mark_node
;
7530 if (TREE_CODE (templ
) != TEMPLATE_DECL
7531 /* Make sure it's a user visible template, if it was named by
7533 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7534 && !PRIMARY_TEMPLATE_P (templ
)))
7536 if (complain
& tf_error
)
7538 error ("non-template type %qT used as a template", d1
);
7540 error ("for template declaration %q+D", in_decl
);
7542 return error_mark_node
;
7545 complain
&= ~tf_user
;
7547 /* An alias that just changes the name of a template is equivalent to the
7548 other template, so if any of the arguments are pack expansions, strip
7549 the alias to avoid problems with a pack expansion passed to a non-pack
7550 alias template parameter (DR 1430). */
7551 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7552 templ
= get_underlying_template (templ
);
7554 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7556 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7557 template arguments */
7563 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7565 /* Consider an example where a template template parameter declared as
7567 template <class T, class U = std::allocator<T> > class TT
7569 The template parameter level of T and U are one level larger than
7570 of TT. To proper process the default argument of U, say when an
7571 instantiation `TT<int>' is seen, we need to build the full
7572 arguments containing {int} as the innermost level. Outer levels,
7573 available when not appearing as default template argument, can be
7574 obtained from the arguments of the enclosing template.
7576 Suppose that TT is later substituted with std::vector. The above
7577 instantiation is `TT<int, std::allocator<T> >' with TT at
7578 level 1, and T at level 2, while the template arguments at level 1
7579 becomes {std::vector} and the inner level 2 is {int}. */
7581 outer
= DECL_CONTEXT (templ
);
7583 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7584 else if (current_template_parms
)
7585 /* This is an argument of the current template, so we haven't set
7586 DECL_CONTEXT yet. */
7587 outer
= current_template_args ();
7590 arglist
= add_to_template_args (outer
, arglist
);
7592 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7594 /*require_all_args=*/true,
7595 /*use_default_args=*/true);
7596 if (arglist2
== error_mark_node
7597 || (!uses_template_parms (arglist2
)
7598 && check_instantiated_args (templ
, arglist2
, complain
)))
7599 return error_mark_node
;
7601 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7606 tree template_type
= TREE_TYPE (templ
);
7609 tree found
= NULL_TREE
;
7612 int is_dependent_type
;
7613 int use_partial_inst_tmpl
= false;
7615 if (template_type
== error_mark_node
)
7616 /* An error occurred while building the template TEMPL, and a
7617 diagnostic has most certainly been emitted for that
7618 already. Let's propagate that error. */
7619 return error_mark_node
;
7621 gen_tmpl
= most_general_template (templ
);
7622 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7623 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7624 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7626 if (arg_depth
== 1 && parm_depth
> 1)
7628 /* We've been given an incomplete set of template arguments.
7631 template <class T> struct S1 {
7632 template <class U> struct S2 {};
7633 template <class U> struct S2<U*> {};
7636 we will be called with an ARGLIST of `U*', but the
7637 TEMPLATE will be `template <class T> template
7638 <class U> struct S1<T>::S2'. We must fill in the missing
7641 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7643 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7646 /* Now we should have enough arguments. */
7647 gcc_assert (parm_depth
== arg_depth
);
7649 /* From here on, we're only interested in the most general
7652 /* Calculate the BOUND_ARGS. These will be the args that are
7653 actually tsubst'd into the definition to create the
7657 /* We have multiple levels of arguments to coerce, at once. */
7659 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7661 tree bound_args
= make_tree_vec (parm_depth
);
7663 for (i
= saved_depth
,
7664 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7665 i
> 0 && t
!= NULL_TREE
;
7666 --i
, t
= TREE_CHAIN (t
))
7669 if (i
== saved_depth
)
7670 a
= coerce_template_parms (TREE_VALUE (t
),
7673 /*require_all_args=*/true,
7674 /*use_default_args=*/true);
7676 /* Outer levels should have already been coerced. */
7677 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7679 /* Don't process further if one of the levels fails. */
7680 if (a
== error_mark_node
)
7682 /* Restore the ARGLIST to its full size. */
7683 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7684 return error_mark_node
;
7687 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7689 /* We temporarily reduce the length of the ARGLIST so
7690 that coerce_template_parms will see only the arguments
7691 corresponding to the template parameters it is
7693 TREE_VEC_LENGTH (arglist
)--;
7696 /* Restore the ARGLIST to its full size. */
7697 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7699 arglist
= bound_args
;
7703 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7704 INNERMOST_TEMPLATE_ARGS (arglist
),
7707 /*require_all_args=*/true,
7708 /*use_default_args=*/true);
7710 if (arglist
== error_mark_node
)
7711 /* We were unable to bind the arguments. */
7712 return error_mark_node
;
7714 /* In the scope of a template class, explicit references to the
7715 template class refer to the type of the template, not any
7716 instantiation of it. For example, in:
7718 template <class T> class C { void f(C<T>); }
7720 the `C<T>' is just the same as `C'. Outside of the
7721 class, however, such a reference is an instantiation. */
7723 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7724 || currently_open_class (template_type
))
7725 /* comp_template_args is expensive, check it last. */
7726 && comp_template_args (TYPE_TI_ARGS (template_type
),
7728 return template_type
;
7730 /* If we already have this specialization, return it. */
7731 elt
.tmpl
= gen_tmpl
;
7733 hash
= spec_hasher::hash (&elt
);
7734 entry
= type_specializations
->find_with_hash (&elt
, hash
);
7739 is_dependent_type
= uses_template_parms (arglist
);
7741 /* If the deduced arguments are invalid, then the binding
7743 if (!is_dependent_type
7744 && check_instantiated_args (gen_tmpl
,
7745 INNERMOST_TEMPLATE_ARGS (arglist
),
7747 return error_mark_node
;
7749 if (!is_dependent_type
7750 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7751 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7752 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7754 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7755 DECL_NAME (gen_tmpl
),
7756 /*tag_scope=*/ts_global
);
7760 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7762 if (context
== error_mark_node
)
7763 return error_mark_node
;
7766 context
= global_namespace
;
7768 /* Create the type. */
7769 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7771 /* The user referred to a specialization of an alias
7772 template represented by GEN_TMPL.
7774 [temp.alias]/2 says:
7776 When a template-id refers to the specialization of an
7777 alias template, it is equivalent to the associated
7778 type obtained by substitution of its
7779 template-arguments for the template-parameters in the
7780 type-id of the alias template. */
7782 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7783 /* Note that the call above (by indirectly calling
7784 register_specialization in tsubst_decl) registers the
7785 TYPE_DECL representing the specialization of the alias
7786 template. So next time someone substitutes ARGLIST for
7787 the template parms into the alias template (GEN_TMPL),
7788 she'll get that TYPE_DECL back. */
7790 if (t
== error_mark_node
)
7793 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7795 if (!is_dependent_type
)
7797 set_current_access_from_decl (TYPE_NAME (template_type
));
7798 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7799 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7800 arglist
, complain
, in_decl
),
7801 SCOPED_ENUM_P (template_type
), NULL
);
7803 if (t
== error_mark_node
)
7808 /* We don't want to call start_enum for this type, since
7809 the values for the enumeration constants may involve
7810 template parameters. And, no one should be interested
7811 in the enumeration constants for such a type. */
7812 t
= cxx_make_type (ENUMERAL_TYPE
);
7813 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7815 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7816 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7817 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7819 else if (CLASS_TYPE_P (template_type
))
7821 t
= make_class_type (TREE_CODE (template_type
));
7822 CLASSTYPE_DECLARED_CLASS (t
)
7823 = CLASSTYPE_DECLARED_CLASS (template_type
);
7824 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7825 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7827 /* A local class. Make sure the decl gets registered properly. */
7828 if (context
== current_function_decl
)
7829 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7831 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7832 /* This instantiation is another name for the primary
7833 template type. Set the TYPE_CANONICAL field
7835 TYPE_CANONICAL (t
) = template_type
;
7836 else if (any_template_arguments_need_structural_equality_p (arglist
))
7837 /* Some of the template arguments require structural
7838 equality testing, so this template class requires
7839 structural equality testing. */
7840 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7845 /* If we called start_enum or pushtag above, this information
7846 will already be set up. */
7849 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7851 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7852 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7853 DECL_SOURCE_LOCATION (type_decl
)
7854 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7857 type_decl
= TYPE_NAME (t
);
7859 if (CLASS_TYPE_P (template_type
))
7861 TREE_PRIVATE (type_decl
)
7862 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7863 TREE_PROTECTED (type_decl
)
7864 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7865 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7867 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7868 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7872 if (OVERLOAD_TYPE_P (t
)
7873 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7876 = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (template_type
)))
7878 if (!TREE_CHAIN (attributes
))
7879 TYPE_ATTRIBUTES (t
) = attributes
;
7882 = build_tree_list (TREE_PURPOSE (attributes
),
7883 TREE_VALUE (attributes
));
7887 /* Let's consider the explicit specialization of a member
7888 of a class template specialization that is implicitly instantiated,
7893 template<class U> struct M {}; //#0
7898 struct S<int>::M<char> //#1
7902 [temp.expl.spec]/4 says this is valid.
7904 In this case, when we write:
7907 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7910 When we encounter #1, we want to store the partial instantiation
7911 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7913 For all cases other than this "explicit specialization of member of a
7914 class template", we just want to store the most general template into
7915 the CLASSTYPE_TI_TEMPLATE of M.
7917 This case of "explicit specialization of member of a class template"
7919 1/ the enclosing class is an instantiation of, and therefore not
7920 the same as, the context of the most general template, and
7921 2/ we aren't looking at the partial instantiation itself, i.e.
7922 the innermost arguments are not the same as the innermost parms of
7923 the most general template.
7925 So it's only when 1/ and 2/ happens that we want to use the partial
7926 instantiation of the member template in lieu of its most general
7929 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7930 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7931 /* the enclosing class must be an instantiation... */
7932 && CLASS_TYPE_P (context
)
7933 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7935 tree partial_inst_args
;
7936 TREE_VEC_LENGTH (arglist
)--;
7937 ++processing_template_decl
;
7939 tsubst (INNERMOST_TEMPLATE_ARGS
7940 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7941 arglist
, complain
, NULL_TREE
);
7942 --processing_template_decl
;
7943 TREE_VEC_LENGTH (arglist
)++;
7944 use_partial_inst_tmpl
=
7945 /*...and we must not be looking at the partial instantiation
7947 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7951 if (!use_partial_inst_tmpl
)
7952 /* This case is easy; there are no member templates involved. */
7956 /* This is a full instantiation of a member template. Find
7957 the partial instantiation of which this is an instance. */
7959 /* Temporarily reduce by one the number of levels in the ARGLIST
7960 so as to avoid comparing the last set of arguments. */
7961 TREE_VEC_LENGTH (arglist
)--;
7962 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7963 TREE_VEC_LENGTH (arglist
)++;
7964 /* FOUND is either a proper class type, or an alias
7965 template specialization. In the later case, it's a
7966 TYPE_DECL, resulting from the substituting of arguments
7967 for parameters in the TYPE_DECL of the alias template
7968 done earlier. So be careful while getting the template
7970 found
= TREE_CODE (found
) == TYPE_DECL
7971 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7972 : CLASSTYPE_TI_TEMPLATE (found
);
7975 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7978 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
7979 entry
= ggc_alloc
<spec_entry
> ();
7983 /* Note this use of the partial instantiation so we can check it
7984 later in maybe_process_partial_specialization. */
7985 DECL_TEMPLATE_INSTANTIATIONS (found
)
7986 = tree_cons (arglist
, t
,
7987 DECL_TEMPLATE_INSTANTIATIONS (found
));
7989 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
7990 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7991 /* Now that the type has been registered on the instantiations
7992 list, we set up the enumerators. Because the enumeration
7993 constants may involve the enumeration type itself, we make
7994 sure to register the type first, and then create the
7995 constants. That way, doing tsubst_expr for the enumeration
7996 constants won't result in recursive calls here; we'll find
7997 the instantiation and exit above. */
7998 tsubst_enum (template_type
, t
, arglist
);
8000 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8001 /* If the type makes use of template parameters, the
8002 code that generates debugging information will crash. */
8003 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8005 /* Possibly limit visibility based on template args. */
8006 TREE_PUBLIC (type_decl
) = 1;
8007 determine_visibility (type_decl
);
8009 inherit_targ_abi_tags (t
);
8015 /* Wrapper for lookup_template_class_1. */
8018 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8019 int entering_scope
, tsubst_flags_t complain
)
8022 timevar_push (TV_TEMPLATE_INST
);
8023 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8024 entering_scope
, complain
);
8025 timevar_pop (TV_TEMPLATE_INST
);
8029 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST.
8030 If the ARGLIST refers to any template parameters, the type of the
8031 expression is the unknown_type_node since the template-id could
8032 refer to an explicit or partial specialization. */
8035 lookup_template_variable (tree templ
, tree arglist
)
8038 if (uses_template_parms (arglist
))
8039 type
= unknown_type_node
;
8041 type
= TREE_TYPE (templ
);
8042 tsubst_flags_t complain
= tf_warning_or_error
;
8043 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (templ
));
8044 arglist
= coerce_template_parms (parms
, arglist
, templ
, complain
,
8045 /*req_all*/true, /*use_default*/true);
8046 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8054 /* True when we should also visit template parameters that occur in
8055 non-deduced contexts. */
8056 bool include_nondeduced_p
;
8057 hash_set
<tree
> *visited
;
8060 /* Called from for_each_template_parm via walk_tree. */
8063 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8066 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8067 tree_fn_t fn
= pfd
->fn
;
8068 void *data
= pfd
->data
;
8071 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8072 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8073 pfd
->include_nondeduced_p
))
8074 return error_mark_node
;
8076 switch (TREE_CODE (t
))
8079 if (TYPE_PTRMEMFUNC_P (t
))
8085 if (!TYPE_TEMPLATE_INFO (t
))
8087 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8088 fn
, data
, pfd
->visited
,
8089 pfd
->include_nondeduced_p
))
8090 return error_mark_node
;
8094 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8095 fn
, data
, pfd
->visited
,
8096 pfd
->include_nondeduced_p
)
8097 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8098 fn
, data
, pfd
->visited
,
8099 pfd
->include_nondeduced_p
))
8100 return error_mark_node
;
8104 /* Since we're not going to walk subtrees, we have to do this
8106 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8107 pfd
->visited
, pfd
->include_nondeduced_p
))
8108 return error_mark_node
;
8112 /* Check the return type. */
8113 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8114 pfd
->include_nondeduced_p
))
8115 return error_mark_node
;
8117 /* Check the parameter types. Since default arguments are not
8118 instantiated until they are needed, the TYPE_ARG_TYPES may
8119 contain expressions that involve template parameters. But,
8120 no-one should be looking at them yet. And, once they're
8121 instantiated, they don't contain template parameters, so
8122 there's no point in looking at them then, either. */
8126 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8127 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8128 pfd
->visited
, pfd
->include_nondeduced_p
))
8129 return error_mark_node
;
8131 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8132 want walk_tree walking into them itself. */
8138 case UNDERLYING_TYPE
:
8139 if (pfd
->include_nondeduced_p
8140 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
8142 pfd
->include_nondeduced_p
))
8143 return error_mark_node
;
8148 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8149 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8150 pfd
->visited
, pfd
->include_nondeduced_p
))
8151 return error_mark_node
;
8156 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8157 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8158 pfd
->visited
, pfd
->include_nondeduced_p
))
8159 return error_mark_node
;
8160 if (DECL_CONTEXT (t
)
8161 && pfd
->include_nondeduced_p
8162 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8163 pfd
->visited
, pfd
->include_nondeduced_p
))
8164 return error_mark_node
;
8167 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8168 /* Record template parameters such as `T' inside `TT<T>'. */
8169 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8170 pfd
->include_nondeduced_p
))
8171 return error_mark_node
;
8174 case TEMPLATE_TEMPLATE_PARM
:
8175 case TEMPLATE_TYPE_PARM
:
8176 case TEMPLATE_PARM_INDEX
:
8177 if (fn
&& (*fn
)(t
, data
))
8178 return error_mark_node
;
8180 return error_mark_node
;
8184 /* A template template parameter is encountered. */
8185 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8186 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8187 pfd
->include_nondeduced_p
))
8188 return error_mark_node
;
8190 /* Already substituted template template parameter */
8196 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8198 pfd
->include_nondeduced_p
))
8199 return error_mark_node
;
8203 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8204 && pfd
->include_nondeduced_p
8205 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8206 (TREE_TYPE (t
)), fn
, data
,
8207 pfd
->visited
, pfd
->include_nondeduced_p
))
8208 return error_mark_node
;
8213 /* If there's no type, then this thing must be some expression
8214 involving template parameters. */
8215 if (!fn
&& !TREE_TYPE (t
))
8216 return error_mark_node
;
8221 case IMPLICIT_CONV_EXPR
:
8222 case REINTERPRET_CAST_EXPR
:
8223 case CONST_CAST_EXPR
:
8224 case STATIC_CAST_EXPR
:
8225 case DYNAMIC_CAST_EXPR
:
8229 case PSEUDO_DTOR_EXPR
:
8231 return error_mark_node
;
8238 /* We didn't find any template parameters we liked. */
8242 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8243 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8244 call FN with the parameter and the DATA.
8245 If FN returns nonzero, the iteration is terminated, and
8246 for_each_template_parm returns 1. Otherwise, the iteration
8247 continues. If FN never returns a nonzero value, the value
8248 returned by for_each_template_parm is 0. If FN is NULL, it is
8249 considered to be the function which always returns 1.
8251 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8252 parameters that occur in non-deduced contexts. When false, only
8253 visits those template parameters that can be deduced. */
8256 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8257 hash_set
<tree
> *visited
,
8258 bool include_nondeduced_p
)
8260 struct pair_fn_data pfd
;
8266 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8268 /* Walk the tree. (Conceptually, we would like to walk without
8269 duplicates, but for_each_template_parm_r recursively calls
8270 for_each_template_parm, so we would need to reorganize a fair
8271 bit to use walk_tree_without_duplicates, so we keep our own
8274 pfd
.visited
= visited
;
8276 pfd
.visited
= new hash_set
<tree
>;
8277 result
= cp_walk_tree (&t
,
8278 for_each_template_parm_r
,
8280 pfd
.visited
) != NULL_TREE
;
8292 /* Returns true if T depends on any template parameter. */
8295 uses_template_parms (tree t
)
8298 int saved_processing_template_decl
;
8300 saved_processing_template_decl
= processing_template_decl
;
8301 if (!saved_processing_template_decl
)
8302 processing_template_decl
= 1;
8304 dependent_p
= dependent_type_p (t
);
8305 else if (TREE_CODE (t
) == TREE_VEC
)
8306 dependent_p
= any_dependent_template_arguments_p (t
);
8307 else if (TREE_CODE (t
) == TREE_LIST
)
8308 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8309 || uses_template_parms (TREE_CHAIN (t
)));
8310 else if (TREE_CODE (t
) == TYPE_DECL
)
8311 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8314 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8315 || TREE_CODE (t
) == OVERLOAD
8318 || TREE_CODE (t
) == TRAIT_EXPR
8319 || TREE_CODE (t
) == CONSTRUCTOR
8320 || CONSTANT_CLASS_P (t
))
8321 dependent_p
= (type_dependent_expression_p (t
)
8322 || value_dependent_expression_p (t
));
8325 gcc_assert (t
== error_mark_node
);
8326 dependent_p
= false;
8329 processing_template_decl
= saved_processing_template_decl
;
8334 /* Returns true iff current_function_decl is an incompletely instantiated
8335 template. Useful instead of processing_template_decl because the latter
8336 is set to 0 during instantiate_non_dependent_expr. */
8339 in_template_function (void)
8341 tree fn
= current_function_decl
;
8343 ++processing_template_decl
;
8344 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8345 && DECL_TEMPLATE_INFO (fn
)
8346 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8347 --processing_template_decl
;
8351 /* Returns true if T depends on any template parameter with level LEVEL. */
8354 uses_template_parms_level (tree t
, int level
)
8356 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8357 /*include_nondeduced_p=*/true);
8360 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8361 ill-formed translation unit, i.e. a variable or function that isn't
8362 usable in a constant expression. */
8365 neglectable_inst_p (tree d
)
8368 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8369 : decl_maybe_constant_var_p (d
)));
8372 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8373 neglectable and instantiated from within an erroneous instantiation. */
8376 limit_bad_template_recursion (tree decl
)
8378 struct tinst_level
*lev
= current_tinst_level
;
8379 int errs
= errorcount
+ sorrycount
;
8380 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8383 for (; lev
; lev
= lev
->next
)
8384 if (neglectable_inst_p (lev
->decl
))
8387 return (lev
&& errs
> lev
->errors
);
8390 static int tinst_depth
;
8391 extern int max_tinst_depth
;
8394 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8396 /* We're starting to instantiate D; record the template instantiation context
8397 for diagnostics and to restore it later. */
8400 push_tinst_level (tree d
)
8402 return push_tinst_level_loc (d
, input_location
);
8405 /* We're starting to instantiate D; record the template instantiation context
8406 at LOC for diagnostics and to restore it later. */
8409 push_tinst_level_loc (tree d
, location_t loc
)
8411 struct tinst_level
*new_level
;
8413 if (tinst_depth
>= max_tinst_depth
)
8415 fatal_error ("template instantiation depth exceeds maximum of %d"
8416 " (use -ftemplate-depth= to increase the maximum)",
8421 /* If the current instantiation caused problems, don't let it instantiate
8422 anything else. Do allow deduction substitution and decls usable in
8423 constant expressions. */
8424 if (limit_bad_template_recursion (d
))
8427 new_level
= ggc_alloc
<tinst_level
> ();
8428 new_level
->decl
= d
;
8429 new_level
->locus
= loc
;
8430 new_level
->errors
= errorcount
+sorrycount
;
8431 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8432 new_level
->next
= current_tinst_level
;
8433 current_tinst_level
= new_level
;
8436 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8437 depth_reached
= tinst_depth
;
8442 /* We're done instantiating this template; return to the instantiation
8446 pop_tinst_level (void)
8448 /* Restore the filename and line number stashed away when we started
8449 this instantiation. */
8450 input_location
= current_tinst_level
->locus
;
8451 current_tinst_level
= current_tinst_level
->next
;
8455 /* We're instantiating a deferred template; restore the template
8456 instantiation context in which the instantiation was requested, which
8457 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8460 reopen_tinst_level (struct tinst_level
*level
)
8462 struct tinst_level
*t
;
8465 for (t
= level
; t
; t
= t
->next
)
8468 current_tinst_level
= level
;
8470 if (current_tinst_level
)
8471 current_tinst_level
->errors
= errorcount
+sorrycount
;
8475 /* Returns the TINST_LEVEL which gives the original instantiation
8478 struct tinst_level
*
8479 outermost_tinst_level (void)
8481 struct tinst_level
*level
= current_tinst_level
;
8484 level
= level
->next
;
8488 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8489 vector of template arguments, as for tsubst.
8491 Returns an appropriate tsubst'd friend declaration. */
8494 tsubst_friend_function (tree decl
, tree args
)
8498 if (TREE_CODE (decl
) == FUNCTION_DECL
8499 && DECL_TEMPLATE_INSTANTIATION (decl
)
8500 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8501 /* This was a friend declared with an explicit template
8502 argument list, e.g.:
8506 to indicate that f was a template instantiation, not a new
8507 function declaration. Now, we have to figure out what
8508 instantiation of what template. */
8510 tree template_id
, arglist
, fns
;
8513 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8515 /* Friend functions are looked up in the containing namespace scope.
8516 We must enter that scope, to avoid finding member functions of the
8517 current class with same name. */
8518 push_nested_namespace (ns
);
8519 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8520 tf_warning_or_error
, NULL_TREE
,
8521 /*integral_constant_expression_p=*/false);
8522 pop_nested_namespace (ns
);
8523 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8524 tf_warning_or_error
, NULL_TREE
);
8525 template_id
= lookup_template_function (fns
, arglist
);
8527 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8528 tmpl
= determine_specialization (template_id
, new_friend
,
8530 /*need_member_template=*/0,
8531 TREE_VEC_LENGTH (args
),
8533 return instantiate_template (tmpl
, new_args
, tf_error
);
8536 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8538 /* The NEW_FRIEND will look like an instantiation, to the
8539 compiler, but is not an instantiation from the point of view of
8540 the language. For example, we might have had:
8542 template <class T> struct S {
8543 template <class U> friend void f(T, U);
8546 Then, in S<int>, template <class U> void f(int, U) is not an
8547 instantiation of anything. */
8548 if (new_friend
== error_mark_node
)
8549 return error_mark_node
;
8551 DECL_USE_TEMPLATE (new_friend
) = 0;
8552 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8554 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8555 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8556 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8559 /* The mangled name for the NEW_FRIEND is incorrect. The function
8560 is not a template instantiation and should not be mangled like
8561 one. Therefore, we forget the mangling here; we'll recompute it
8562 later if we need it. */
8563 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8565 SET_DECL_RTL (new_friend
, NULL
);
8566 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8569 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8572 tree new_friend_template_info
;
8573 tree new_friend_result_template_info
;
8575 int new_friend_is_defn
;
8577 /* We must save some information from NEW_FRIEND before calling
8578 duplicate decls since that function will free NEW_FRIEND if
8580 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8581 new_friend_is_defn
=
8582 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8583 (template_for_substitution (new_friend
)))
8585 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8587 /* This declaration is a `primary' template. */
8588 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8590 new_friend_result_template_info
8591 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8594 new_friend_result_template_info
= NULL_TREE
;
8596 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8597 if (new_friend_is_defn
)
8598 DECL_INITIAL (new_friend
) = error_mark_node
;
8600 /* Inside pushdecl_namespace_level, we will push into the
8601 current namespace. However, the friend function should go
8602 into the namespace of the template. */
8603 ns
= decl_namespace_context (new_friend
);
8604 push_nested_namespace (ns
);
8605 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8606 pop_nested_namespace (ns
);
8608 if (old_decl
== error_mark_node
)
8609 return error_mark_node
;
8611 if (old_decl
!= new_friend
)
8613 /* This new friend declaration matched an existing
8614 declaration. For example, given:
8616 template <class T> void f(T);
8617 template <class U> class C {
8618 template <class T> friend void f(T) {}
8621 the friend declaration actually provides the definition
8622 of `f', once C has been instantiated for some type. So,
8623 old_decl will be the out-of-class template declaration,
8624 while new_friend is the in-class definition.
8626 But, if `f' was called before this point, the
8627 instantiation of `f' will have DECL_TI_ARGS corresponding
8628 to `T' but not to `U', references to which might appear
8629 in the definition of `f'. Previously, the most general
8630 template for an instantiation of `f' was the out-of-class
8631 version; now it is the in-class version. Therefore, we
8632 run through all specialization of `f', adding to their
8633 DECL_TI_ARGS appropriately. In particular, they need a
8634 new set of outer arguments, corresponding to the
8635 arguments for this class instantiation.
8637 The same situation can arise with something like this:
8640 template <class T> class C {
8644 when `C<int>' is instantiated. Now, `f(int)' is defined
8647 if (!new_friend_is_defn
)
8648 /* On the other hand, if the in-class declaration does
8649 *not* provide a definition, then we don't want to alter
8650 existing definitions. We can just leave everything
8655 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8656 tree new_args
= TI_ARGS (new_friend_template_info
);
8658 /* Overwrite whatever template info was there before, if
8659 any, with the new template information pertaining to
8661 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8663 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8665 /* We should have called reregister_specialization in
8667 gcc_assert (retrieve_specialization (new_template
,
8671 /* Instantiate it if the global has already been used. */
8672 if (DECL_ODR_USED (old_decl
))
8673 instantiate_decl (old_decl
, /*defer_ok=*/true,
8674 /*expl_inst_class_mem_p=*/false);
8680 /* Indicate that the old function template is a partial
8682 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8683 = new_friend_result_template_info
;
8685 gcc_assert (new_template
8686 == most_general_template (new_template
));
8687 gcc_assert (new_template
!= old_decl
);
8689 /* Reassign any specializations already in the hash table
8690 to the new more general template, and add the
8691 additional template args. */
8692 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8696 tree spec
= TREE_VALUE (t
);
8699 elt
.tmpl
= old_decl
;
8700 elt
.args
= DECL_TI_ARGS (spec
);
8701 elt
.spec
= NULL_TREE
;
8703 decl_specializations
->remove_elt (&elt
);
8706 = add_outermost_template_args (new_args
,
8707 DECL_TI_ARGS (spec
));
8709 register_specialization
8710 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8713 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8717 /* The information from NEW_FRIEND has been merged into OLD_DECL
8718 by duplicate_decls. */
8719 new_friend
= old_decl
;
8724 tree context
= DECL_CONTEXT (new_friend
);
8728 template <class T> class C {
8729 template <class U> friend void C1<U>::f (); // case 1
8730 friend void C2<T>::f (); // case 2
8732 we only need to make sure CONTEXT is a complete type for
8733 case 2. To distinguish between the two cases, we note that
8734 CONTEXT of case 1 remains dependent type after tsubst while
8735 this isn't true for case 2. */
8736 ++processing_template_decl
;
8737 dependent_p
= dependent_type_p (context
);
8738 --processing_template_decl
;
8741 && !complete_type_or_else (context
, NULL_TREE
))
8742 return error_mark_node
;
8744 if (COMPLETE_TYPE_P (context
))
8746 tree fn
= new_friend
;
8747 /* do_friend adds the TEMPLATE_DECL for any member friend
8748 template even if it isn't a member template, i.e.
8749 template <class T> friend A<T>::f();
8750 Look through it in that case. */
8751 if (TREE_CODE (fn
) == TEMPLATE_DECL
8752 && !PRIMARY_TEMPLATE_P (fn
))
8753 fn
= DECL_TEMPLATE_RESULT (fn
);
8754 /* Check to see that the declaration is really present, and,
8755 possibly obtain an improved declaration. */
8756 fn
= check_classfn (context
, fn
, NULL_TREE
);
8766 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8767 template arguments, as for tsubst.
8769 Returns an appropriate tsubst'd friend type or error_mark_node on
8773 tsubst_friend_class (tree friend_tmpl
, tree args
)
8779 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8781 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8782 return TREE_TYPE (t
);
8785 context
= CP_DECL_CONTEXT (friend_tmpl
);
8787 if (context
!= global_namespace
)
8789 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8790 push_nested_namespace (context
);
8792 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8795 /* Look for a class template declaration. We look for hidden names
8796 because two friend declarations of the same template are the
8797 same. For example, in:
8800 template <typename> friend class F;
8802 template <typename> struct B {
8803 template <typename> friend class F;
8806 both F templates are the same. */
8807 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8808 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8810 /* But, if we don't find one, it might be because we're in a
8811 situation like this:
8819 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8820 for `S<int>', not the TEMPLATE_DECL. */
8821 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8823 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8824 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8827 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8829 /* The friend template has already been declared. Just
8830 check to see that the declarations match, and install any new
8831 default parameters. We must tsubst the default parameters,
8832 of course. We only need the innermost template parameters
8833 because that is all that redeclare_class_template will look
8835 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8836 > TMPL_ARGS_DEPTH (args
))
8839 location_t saved_input_location
;
8840 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8841 args
, tf_warning_or_error
);
8843 saved_input_location
= input_location
;
8844 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8845 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8846 input_location
= saved_input_location
;
8850 friend_type
= TREE_TYPE (tmpl
);
8854 /* The friend template has not already been declared. In this
8855 case, the instantiation of the template class will cause the
8856 injection of this template into the global scope. */
8857 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8858 if (tmpl
== error_mark_node
)
8859 return error_mark_node
;
8861 /* The new TMPL is not an instantiation of anything, so we
8862 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8863 the new type because that is supposed to be the corresponding
8864 template decl, i.e., TMPL. */
8865 DECL_USE_TEMPLATE (tmpl
) = 0;
8866 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8867 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8868 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8869 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8871 /* Inject this template into the global scope. */
8872 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8875 if (context
!= global_namespace
)
8877 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8878 pop_nested_namespace (context
);
8880 pop_nested_class ();
8886 /* Returns zero if TYPE cannot be completed later due to circularity.
8887 Otherwise returns one. */
8890 can_complete_type_without_circularity (tree type
)
8892 if (type
== NULL_TREE
|| type
== error_mark_node
)
8894 else if (COMPLETE_TYPE_P (type
))
8896 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8897 return can_complete_type_without_circularity (TREE_TYPE (type
));
8898 else if (CLASS_TYPE_P (type
)
8899 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8905 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
8907 /* Apply any attributes which had to be deferred until instantiation
8908 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8909 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8912 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8913 tree args
, tsubst_flags_t complain
, tree in_decl
)
8915 tree last_dep
= NULL_TREE
;
8919 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8920 if (ATTR_IS_DEPENDENT (t
))
8923 attributes
= copy_list (attributes
);
8927 if (DECL_P (*decl_p
))
8929 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8931 p
= &DECL_ATTRIBUTES (*decl_p
);
8934 p
= &TYPE_ATTRIBUTES (*decl_p
);
8938 tree late_attrs
= NULL_TREE
;
8939 tree
*q
= &late_attrs
;
8941 for (*p
= attributes
; *p
; )
8944 if (ATTR_IS_DEPENDENT (t
))
8946 *p
= TREE_CHAIN (t
);
8947 TREE_CHAIN (t
) = NULL_TREE
;
8948 if ((flag_openmp
|| flag_cilkplus
)
8949 && is_attribute_p ("omp declare simd",
8950 get_attribute_name (t
))
8953 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
8954 clauses
= tsubst_omp_clauses (clauses
, true, args
,
8956 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
8957 clauses
= finish_omp_clauses (clauses
);
8958 tree parms
= DECL_ARGUMENTS (*decl_p
);
8960 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
8962 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
8964 TREE_VALUE (t
) = NULL_TREE
;
8966 /* If the first attribute argument is an identifier, don't
8967 pass it through tsubst. Attributes like mode, format,
8968 cleanup and several target specific attributes expect it
8970 else if (attribute_takes_identifier_p (get_attribute_name (t
))
8974 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8976 /*integral_constant_expression_p=*/false);
8977 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8979 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8984 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8985 /*integral_constant_expression_p=*/false);
8987 q
= &TREE_CHAIN (t
);
8990 p
= &TREE_CHAIN (t
);
8993 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8997 /* Perform (or defer) access check for typedefs that were referenced
8998 from within the template TMPL code.
8999 This is a subroutine of instantiate_decl and instantiate_class_template.
9000 TMPL is the template to consider and TARGS is the list of arguments of
9004 perform_typedefs_access_check (tree tmpl
, tree targs
)
9006 location_t saved_location
;
9008 qualified_typedef_usage_t
*iter
;
9011 || (!CLASS_TYPE_P (tmpl
)
9012 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9015 saved_location
= input_location
;
9016 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9018 tree type_decl
= iter
->typedef_decl
;
9019 tree type_scope
= iter
->context
;
9021 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9024 if (uses_template_parms (type_decl
))
9025 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9026 if (uses_template_parms (type_scope
))
9027 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9029 /* Make access check error messages point to the location
9030 of the use of the typedef. */
9031 input_location
= iter
->locus
;
9032 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9033 type_decl
, type_decl
,
9034 tf_warning_or_error
);
9036 input_location
= saved_location
;
9040 instantiate_class_template_1 (tree type
)
9042 tree templ
, args
, pattern
, t
, member
;
9046 unsigned int saved_maximum_field_alignment
;
9049 if (type
== error_mark_node
)
9050 return error_mark_node
;
9052 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9053 || uses_template_parms (type
))
9056 /* Figure out which template is being instantiated. */
9057 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9058 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9060 /* Determine what specialization of the original template to
9062 t
= most_specialized_class (type
, tf_warning_or_error
);
9063 if (t
== error_mark_node
)
9065 TYPE_BEING_DEFINED (type
) = 1;
9066 return error_mark_node
;
9070 /* This TYPE is actually an instantiation of a partial
9071 specialization. We replace the innermost set of ARGS with
9072 the arguments appropriate for substitution. For example,
9075 template <class T> struct S {};
9076 template <class T> struct S<T*> {};
9078 and supposing that we are instantiating S<int*>, ARGS will
9079 presently be {int*} -- but we need {int}. */
9080 pattern
= TREE_TYPE (t
);
9081 args
= TREE_PURPOSE (t
);
9085 pattern
= TREE_TYPE (templ
);
9086 args
= CLASSTYPE_TI_ARGS (type
);
9089 /* If the template we're instantiating is incomplete, then clearly
9090 there's nothing we can do. */
9091 if (!COMPLETE_TYPE_P (pattern
))
9094 /* If we've recursively instantiated too many templates, stop. */
9095 if (! push_tinst_level (type
))
9098 /* Now we're really doing the instantiation. Mark the type as in
9099 the process of being defined. */
9100 TYPE_BEING_DEFINED (type
) = 1;
9102 /* We may be in the middle of deferred access check. Disable
9104 push_deferring_access_checks (dk_no_deferred
);
9106 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9107 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9108 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9109 fn_context
= error_mark_node
;
9111 push_to_top_level ();
9112 /* Use #pragma pack from the template context. */
9113 saved_maximum_field_alignment
= maximum_field_alignment
;
9114 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9116 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9118 /* Set the input location to the most specialized template definition.
9119 This is needed if tsubsting causes an error. */
9120 typedecl
= TYPE_MAIN_DECL (pattern
);
9121 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9122 DECL_SOURCE_LOCATION (typedecl
);
9124 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9125 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9126 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9127 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9128 if (ANON_AGGR_TYPE_P (pattern
))
9129 SET_ANON_AGGR_TYPE_P (type
);
9130 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9132 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9133 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9134 /* Adjust visibility for template arguments. */
9135 determine_visibility (TYPE_MAIN_DECL (type
));
9137 if (CLASS_TYPE_P (type
))
9138 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9140 pbinfo
= TYPE_BINFO (pattern
);
9142 /* We should never instantiate a nested class before its enclosing
9143 class; we need to look up the nested class by name before we can
9144 instantiate it, and that lookup should instantiate the enclosing
9146 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9147 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9149 base_list
= NULL_TREE
;
9150 if (BINFO_N_BASE_BINFOS (pbinfo
))
9156 /* We must enter the scope containing the type, as that is where
9157 the accessibility of types named in dependent bases are
9159 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9161 /* Substitute into each of the bases to determine the actual
9163 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9166 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9167 tree expanded_bases
= NULL_TREE
;
9170 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9173 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9174 args
, tf_error
, NULL_TREE
);
9175 if (expanded_bases
== error_mark_node
)
9178 len
= TREE_VEC_LENGTH (expanded_bases
);
9181 for (idx
= 0; idx
< len
; idx
++)
9184 /* Extract the already-expanded base class. */
9185 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9187 /* Substitute to figure out the base class. */
9188 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9191 if (base
== error_mark_node
)
9194 base_list
= tree_cons (access
, base
, base_list
);
9195 if (BINFO_VIRTUAL_P (pbase_binfo
))
9196 TREE_TYPE (base_list
) = integer_type_node
;
9200 /* The list is now in reverse order; correct that. */
9201 base_list
= nreverse (base_list
);
9204 pop_scope (pushed_scope
);
9206 /* Now call xref_basetypes to set up all the base-class
9208 xref_basetypes (type
, base_list
);
9210 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9211 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9212 args
, tf_error
, NULL_TREE
);
9213 fixup_attribute_variants (type
);
9215 /* Now that our base classes are set up, enter the scope of the
9216 class, so that name lookups into base classes, etc. will work
9217 correctly. This is precisely analogous to what we do in
9218 begin_class_definition when defining an ordinary non-template
9219 class, except we also need to push the enclosing classes. */
9220 push_nested_class (type
);
9222 /* Now members are processed in the order of declaration. */
9223 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9224 member
; member
= TREE_CHAIN (member
))
9226 tree t
= TREE_VALUE (member
);
9228 if (TREE_PURPOSE (member
))
9232 /* Build new CLASSTYPE_NESTED_UTDS. */
9235 bool class_template_p
;
9237 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9238 && TYPE_LANG_SPECIFIC (t
)
9239 && CLASSTYPE_IS_TEMPLATE (t
));
9240 /* If the member is a class template, then -- even after
9241 substitution -- there may be dependent types in the
9242 template argument list for the class. We increment
9243 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9244 that function will assume that no types are dependent
9245 when outside of a template. */
9246 if (class_template_p
)
9247 ++processing_template_decl
;
9248 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9249 if (class_template_p
)
9250 --processing_template_decl
;
9251 if (newtag
== error_mark_node
)
9254 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9256 tree name
= TYPE_IDENTIFIER (t
);
9258 if (class_template_p
)
9259 /* Unfortunately, lookup_template_class sets
9260 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9261 instantiation (i.e., for the type of a member
9262 template class nested within a template class.)
9263 This behavior is required for
9264 maybe_process_partial_specialization to work
9265 correctly, but is not accurate in this case;
9266 the TAG is not an instantiation of anything.
9267 (The corresponding TEMPLATE_DECL is an
9268 instantiation, but the TYPE is not.) */
9269 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9271 /* Now, we call pushtag to put this NEWTAG into the scope of
9272 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9273 pushtag calling push_template_decl. We don't have to do
9274 this for enums because it will already have been done in
9277 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9278 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9281 else if (DECL_DECLARES_FUNCTION_P (t
))
9283 /* Build new TYPE_METHODS. */
9286 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9287 ++processing_template_decl
;
9288 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9289 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9290 --processing_template_decl
;
9291 set_current_access_from_decl (r
);
9292 finish_member_declaration (r
);
9293 /* Instantiate members marked with attribute used. */
9294 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9296 if (TREE_CODE (r
) == FUNCTION_DECL
9297 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9298 cp_check_omp_declare_reduction (r
);
9300 else if (DECL_CLASS_TEMPLATE_P (t
)
9301 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9302 /* A closure type for a lambda in a default argument for a
9303 member template. Ignore it; it will be instantiated with
9304 the default argument. */;
9307 /* Build new TYPE_FIELDS. */
9308 if (TREE_CODE (t
) == STATIC_ASSERT
)
9312 ++c_inhibit_evaluation_warnings
;
9314 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9315 tf_warning_or_error
, NULL_TREE
,
9316 /*integral_constant_expression_p=*/true);
9317 --c_inhibit_evaluation_warnings
;
9319 finish_static_assert (condition
,
9320 STATIC_ASSERT_MESSAGE (t
),
9321 STATIC_ASSERT_SOURCE_LOCATION (t
),
9324 else if (TREE_CODE (t
) != CONST_DECL
)
9327 tree vec
= NULL_TREE
;
9330 /* The file and line for this declaration, to
9331 assist in error message reporting. Since we
9332 called push_tinst_level above, we don't need to
9334 input_location
= DECL_SOURCE_LOCATION (t
);
9336 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9337 ++processing_template_decl
;
9338 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9339 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9340 --processing_template_decl
;
9342 if (TREE_CODE (r
) == TREE_VEC
)
9344 /* A capture pack became multiple fields. */
9346 len
= TREE_VEC_LENGTH (vec
);
9349 for (int i
= 0; i
< len
; ++i
)
9352 r
= TREE_VEC_ELT (vec
, i
);
9357 [t]he initialization (and any associated
9358 side-effects) of a static data member does
9359 not occur unless the static data member is
9360 itself used in a way that requires the
9361 definition of the static data member to
9364 Therefore, we do not substitute into the
9365 initialized for the static data member here. */
9366 finish_static_data_member_decl
9369 /*init_const_expr_p=*/false,
9370 /*asmspec_tree=*/NULL_TREE
,
9372 /* Instantiate members marked with attribute used. */
9373 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9376 else if (TREE_CODE (r
) == FIELD_DECL
)
9378 /* Determine whether R has a valid type and can be
9379 completed later. If R is invalid, then its type
9380 is replaced by error_mark_node. */
9381 tree rtype
= TREE_TYPE (r
);
9382 if (can_complete_type_without_circularity (rtype
))
9383 complete_type (rtype
);
9385 if (!COMPLETE_TYPE_P (rtype
))
9387 cxx_incomplete_type_error (r
, rtype
);
9388 TREE_TYPE (r
) = error_mark_node
;
9392 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9393 such a thing will already have been added to the field
9394 list by tsubst_enum in finish_member_declaration in the
9395 CLASSTYPE_NESTED_UTDS case above. */
9396 if (!(TREE_CODE (r
) == TYPE_DECL
9397 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9398 && DECL_ARTIFICIAL (r
)))
9400 set_current_access_from_decl (r
);
9401 finish_member_declaration (r
);
9409 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9410 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9412 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9414 tree friend_type
= t
;
9415 bool adjust_processing_template_decl
= false;
9417 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9419 /* template <class T> friend class C; */
9420 friend_type
= tsubst_friend_class (friend_type
, args
);
9421 adjust_processing_template_decl
= true;
9423 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9425 /* template <class T> friend class C::D; */
9426 friend_type
= tsubst (friend_type
, args
,
9427 tf_warning_or_error
, NULL_TREE
);
9428 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9429 friend_type
= TREE_TYPE (friend_type
);
9430 adjust_processing_template_decl
= true;
9432 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9433 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9435 /* This could be either
9439 when dependent_type_p is false or
9441 template <class U> friend class T::C;
9444 friend_type
= tsubst (friend_type
, args
,
9445 tf_warning_or_error
, NULL_TREE
);
9446 /* Bump processing_template_decl for correct
9447 dependent_type_p calculation. */
9448 ++processing_template_decl
;
9449 if (dependent_type_p (friend_type
))
9450 adjust_processing_template_decl
= true;
9451 --processing_template_decl
;
9453 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9454 && hidden_name_p (TYPE_NAME (friend_type
)))
9458 where C hasn't been declared yet. Let's lookup name
9459 from namespace scope directly, bypassing any name that
9460 come from dependent base class. */
9461 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9463 /* The call to xref_tag_from_type does injection for friend
9465 push_nested_namespace (ns
);
9467 xref_tag_from_type (friend_type
, NULL_TREE
,
9468 /*tag_scope=*/ts_current
);
9469 pop_nested_namespace (ns
);
9471 else if (uses_template_parms (friend_type
))
9472 /* friend class C<T>; */
9473 friend_type
= tsubst (friend_type
, args
,
9474 tf_warning_or_error
, NULL_TREE
);
9479 where C is already declared or
9481 friend class C<int>;
9483 We don't have to do anything in these cases. */
9485 if (adjust_processing_template_decl
)
9486 /* Trick make_friend_class into realizing that the friend
9487 we're adding is a template, not an ordinary class. It's
9488 important that we use make_friend_class since it will
9489 perform some error-checking and output cross-reference
9491 ++processing_template_decl
;
9493 if (friend_type
!= error_mark_node
)
9494 make_friend_class (type
, friend_type
, /*complain=*/false);
9496 if (adjust_processing_template_decl
)
9497 --processing_template_decl
;
9501 /* Build new DECL_FRIENDLIST. */
9504 /* The file and line for this declaration, to
9505 assist in error message reporting. Since we
9506 called push_tinst_level above, we don't need to
9508 input_location
= DECL_SOURCE_LOCATION (t
);
9510 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9512 ++processing_template_decl
;
9513 push_deferring_access_checks (dk_no_check
);
9516 r
= tsubst_friend_function (t
, args
);
9517 add_friend (type
, r
, /*complain=*/false);
9518 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9520 pop_deferring_access_checks ();
9521 --processing_template_decl
;
9527 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9529 tree decl
= lambda_function (type
);
9532 if (!DECL_TEMPLATE_INFO (decl
)
9533 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9534 instantiate_decl (decl
, false, false);
9536 /* We need to instantiate the capture list from the template
9537 after we've instantiated the closure members, but before we
9538 consider adding the conversion op. Also keep any captures
9539 that may have been added during instantiation of the op(). */
9540 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9542 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9543 args
, tf_warning_or_error
, NULL_TREE
,
9546 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9547 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9549 maybe_add_lambda_conv_op (type
);
9552 gcc_assert (errorcount
);
9555 /* Set the file and line number information to whatever is given for
9556 the class itself. This puts error messages involving generated
9557 implicit functions at a predictable point, and the same point
9558 that would be used for non-template classes. */
9559 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9561 unreverse_member_declarations (type
);
9562 finish_struct_1 (type
);
9563 TYPE_BEING_DEFINED (type
) = 0;
9565 /* We don't instantiate default arguments for member functions. 14.7.1:
9567 The implicit instantiation of a class template specialization causes
9568 the implicit instantiation of the declarations, but not of the
9569 definitions or default arguments, of the class member functions,
9570 member classes, static data members and member templates.... */
9572 /* Some typedefs referenced from within the template code need to be access
9573 checked at template instantiation time, i.e now. These types were
9574 added to the template at parsing time. Let's get those and perform
9575 the access checks then. */
9576 perform_typedefs_access_check (pattern
, args
);
9577 perform_deferred_access_checks (tf_warning_or_error
);
9578 pop_nested_class ();
9579 maximum_field_alignment
= saved_maximum_field_alignment
;
9581 pop_from_top_level ();
9582 pop_deferring_access_checks ();
9585 /* The vtable for a template class can be emitted in any translation
9586 unit in which the class is instantiated. When there is no key
9587 method, however, finish_struct_1 will already have added TYPE to
9588 the keyed_classes list. */
9589 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9590 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9595 /* Wrapper for instantiate_class_template_1. */
9598 instantiate_class_template (tree type
)
9601 timevar_push (TV_TEMPLATE_INST
);
9602 ret
= instantiate_class_template_1 (type
);
9603 timevar_pop (TV_TEMPLATE_INST
);
9608 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9614 else if (TYPE_P (t
))
9615 r
= tsubst (t
, args
, complain
, in_decl
);
9618 if (!(complain
& tf_warning
))
9619 ++c_inhibit_evaluation_warnings
;
9620 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9621 /*integral_constant_expression_p=*/true);
9622 if (!(complain
& tf_warning
))
9623 --c_inhibit_evaluation_warnings
;
9628 /* Given a function parameter pack TMPL_PARM and some function parameters
9629 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9630 and set *SPEC_P to point at the next point in the list. */
9633 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9635 /* Collect all of the extra "packed" parameters into an
9639 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9640 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9641 tree spec_parm
= *spec_p
;
9644 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9646 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9649 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9650 parmvec
= make_tree_vec (len
);
9651 parmtypevec
= make_tree_vec (len
);
9652 spec_parm
= *spec_p
;
9653 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9655 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9656 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9659 /* Build the argument packs. */
9660 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9661 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9662 TREE_TYPE (argpack
) = argtypepack
;
9663 *spec_p
= spec_parm
;
9668 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9669 NONTYPE_ARGUMENT_PACK. */
9672 make_fnparm_pack (tree spec_parm
)
9674 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9677 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9681 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9683 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9684 if (i
>= TREE_VEC_LENGTH (vec
))
9686 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9690 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9693 make_argument_pack_select (tree arg_pack
, unsigned index
)
9695 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9697 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9698 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9703 /* This is a subroutine of tsubst_pack_expansion.
9705 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9706 mechanism to store the (non complete list of) arguments of the
9707 substitution and return a non substituted pack expansion, in order
9708 to wait for when we have enough arguments to really perform the
9712 use_pack_expansion_extra_args_p (tree parm_packs
,
9716 /* If one pack has an expansion and another pack has a normal
9717 argument or if one pack has an empty argument and an another
9718 one hasn't then tsubst_pack_expansion cannot perform the
9719 substitution and need to fall back on the
9720 PACK_EXPANSION_EXTRA mechanism. */
9721 if (parm_packs
== NULL_TREE
)
9723 else if (has_empty_arg
)
9726 bool has_expansion_arg
= false;
9727 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9729 bool has_non_expansion_arg
= false;
9730 for (tree parm_pack
= parm_packs
;
9732 parm_pack
= TREE_CHAIN (parm_pack
))
9734 tree arg
= TREE_VALUE (parm_pack
);
9736 if (argument_pack_element_is_expansion_p (arg
, i
))
9737 has_expansion_arg
= true;
9739 has_non_expansion_arg
= true;
9742 if (has_expansion_arg
&& has_non_expansion_arg
)
9748 /* [temp.variadic]/6 says that:
9750 The instantiation of a pack expansion [...]
9751 produces a list E1,E2, ..., En, where N is the number of elements
9752 in the pack expansion parameters.
9754 This subroutine of tsubst_pack_expansion produces one of these Ei.
9756 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9757 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9758 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9759 INDEX is the index 'i' of the element Ei to produce. ARGS,
9760 COMPLAIN, and IN_DECL are the same parameters as for the
9761 tsubst_pack_expansion function.
9763 The function returns the resulting Ei upon successful completion,
9766 Note that this function possibly modifies the ARGS parameter, so
9767 it's the responsibility of the caller to restore it. */
9770 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9773 tree args
/* This parm gets
9775 tsubst_flags_t complain
,
9779 bool ith_elem_is_expansion
= false;
9781 /* For each parameter pack, change the substitution of the parameter
9782 pack to the ith argument in its argument pack, then expand the
9784 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9786 tree parm
= TREE_PURPOSE (pack
);
9787 tree arg_pack
= TREE_VALUE (pack
);
9788 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9790 ith_elem_is_expansion
|=
9791 argument_pack_element_is_expansion_p (arg_pack
, index
);
9793 /* Select the Ith argument from the pack. */
9794 if (TREE_CODE (parm
) == PARM_DECL
9795 || TREE_CODE (parm
) == FIELD_DECL
)
9799 aps
= make_argument_pack_select (arg_pack
, index
);
9801 register_local_specialization (aps
, parm
);
9804 aps
= retrieve_local_specialization (parm
);
9809 template_parm_level_and_index (parm
, &level
, &idx
);
9813 aps
= make_argument_pack_select (arg_pack
, index
);
9814 /* Update the corresponding argument. */
9815 TMPL_ARG (args
, level
, idx
) = aps
;
9818 /* Re-use the ARGUMENT_PACK_SELECT. */
9819 aps
= TMPL_ARG (args
, level
, idx
);
9821 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9824 /* Substitute into the PATTERN with the (possibly altered)
9826 if (pattern
== in_decl
)
9827 /* Expanding a fixed parameter pack from
9828 coerce_template_parameter_pack. */
9829 t
= tsubst_decl (pattern
, args
, complain
);
9830 else if (!TYPE_P (pattern
))
9831 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9832 /*integral_constant_expression_p=*/false);
9834 t
= tsubst (pattern
, args
, complain
, in_decl
);
9836 /* If the Ith argument pack element is a pack expansion, then
9837 the Ith element resulting from the substituting is going to
9838 be a pack expansion as well. */
9839 if (ith_elem_is_expansion
)
9840 t
= make_pack_expansion (t
);
9845 /* Substitute ARGS into T, which is an pack expansion
9846 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9847 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9848 (if only a partial substitution could be performed) or
9849 ERROR_MARK_NODE if there was an error. */
9851 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9855 tree pack
, packs
= NULL_TREE
;
9856 bool unsubstituted_packs
= false;
9859 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
9860 bool need_local_specializations
= false;
9863 gcc_assert (PACK_EXPANSION_P (t
));
9864 pattern
= PACK_EXPANSION_PATTERN (t
);
9866 /* Add in any args remembered from an earlier partial instantiation. */
9867 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9869 levels
= TMPL_ARGS_DEPTH (args
);
9871 /* Determine the argument packs that will instantiate the parameter
9872 packs used in the expansion expression. While we're at it,
9873 compute the number of arguments to be expanded and make sure it
9875 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9876 pack
= TREE_CHAIN (pack
))
9878 tree parm_pack
= TREE_VALUE (pack
);
9879 tree arg_pack
= NULL_TREE
;
9880 tree orig_arg
= NULL_TREE
;
9883 if (TREE_CODE (parm_pack
) == BASES
)
9885 if (BASES_DIRECT (parm_pack
))
9886 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9887 args
, complain
, in_decl
, false));
9889 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9890 args
, complain
, in_decl
, false));
9892 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9894 if (PACK_EXPANSION_LOCAL_P (t
))
9895 arg_pack
= retrieve_local_specialization (parm_pack
);
9898 /* We can't rely on local_specializations for a parameter
9899 name used later in a function declaration (such as in a
9900 late-specified return type). Even if it exists, it might
9901 have the wrong value for a recursive call. Just make a
9902 dummy decl, since it's only used for its type. */
9903 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9904 if (arg_pack
&& DECL_PACK_P (arg_pack
))
9905 /* Partial instantiation of the parm_pack, we can't build
9906 up an argument pack yet. */
9907 arg_pack
= NULL_TREE
;
9909 arg_pack
= make_fnparm_pack (arg_pack
);
9910 need_local_specializations
= true;
9913 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
9914 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
9918 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9920 if (level
<= levels
)
9921 arg_pack
= TMPL_ARG (args
, level
, idx
);
9924 orig_arg
= arg_pack
;
9925 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9926 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9928 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9929 /* This can only happen if we forget to expand an argument
9930 pack somewhere else. Just return an error, silently. */
9932 result
= make_tree_vec (1);
9933 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9940 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9942 /* Don't bother trying to do a partial substitution with
9943 incomplete packs; we'll try again after deduction. */
9944 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9949 else if (len
!= my_len
)
9951 if (!(complain
& tf_error
))
9952 /* Fail quietly. */;
9953 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9954 error ("mismatched argument pack lengths while expanding "
9958 error ("mismatched argument pack lengths while expanding "
9961 return error_mark_node
;
9964 /* Keep track of the parameter packs and their corresponding
9966 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9967 TREE_TYPE (packs
) = orig_arg
;
9971 /* We can't substitute for this parameter pack. We use a flag as
9972 well as the missing_level counter because function parameter
9973 packs don't have a level. */
9974 unsubstituted_packs
= true;
9978 /* If the expansion is just T..., return the matching argument pack. */
9979 if (!unsubstituted_packs
9980 && TREE_PURPOSE (packs
) == pattern
)
9982 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
9983 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
9984 || pack_expansion_args_count (args
))
9986 /* Otherwise use the normal path so we get convert_from_reference. */
9989 /* We cannot expand this expansion expression, because we don't have
9990 all of the argument packs we need. */
9991 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9993 /* We got some full packs, but we can't substitute them in until we
9994 have values for all the packs. So remember these until then. */
9996 t
= make_pack_expansion (pattern
);
9997 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10000 else if (unsubstituted_packs
)
10002 /* There were no real arguments, we're just replacing a parameter
10003 pack with another version of itself. Substitute into the
10004 pattern and return a PACK_EXPANSION_*. The caller will need to
10006 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10007 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10008 /*integral_constant_expression_p=*/false);
10010 t
= tsubst (pattern
, args
, complain
, in_decl
);
10011 t
= make_pack_expansion (t
);
10015 gcc_assert (len
>= 0);
10017 if (need_local_specializations
)
10019 /* We're in a late-specified return type, so create our own local
10020 specializations map; the current map is either NULL or (in the
10021 case of recursive unification) might have bindings that we don't
10022 want to use or alter. */
10023 saved_local_specializations
= local_specializations
;
10024 local_specializations
= new hash_map
<tree
, tree
>;
10027 /* For each argument in each argument pack, substitute into the
10029 result
= make_tree_vec (len
);
10030 for (i
= 0; i
< len
; ++i
)
10032 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10036 TREE_VEC_ELT (result
, i
) = t
;
10037 if (t
== error_mark_node
)
10039 result
= error_mark_node
;
10044 /* Update ARGS to restore the substitution from parameter packs to
10045 their argument packs. */
10046 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10048 tree parm
= TREE_PURPOSE (pack
);
10050 if (TREE_CODE (parm
) == PARM_DECL
10051 || TREE_CODE (parm
) == FIELD_DECL
)
10052 register_local_specialization (TREE_TYPE (pack
), parm
);
10057 if (TREE_VALUE (pack
) == NULL_TREE
)
10060 template_parm_level_and_index (parm
, &level
, &idx
);
10062 /* Update the corresponding argument. */
10063 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10064 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10067 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10071 if (need_local_specializations
)
10073 delete local_specializations
;
10074 local_specializations
= saved_local_specializations
;
10080 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10081 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10082 parameter packs; all parms generated from a function parameter pack will
10083 have the same DECL_PARM_INDEX. */
10086 get_pattern_parm (tree parm
, tree tmpl
)
10088 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10091 if (DECL_ARTIFICIAL (parm
))
10093 for (patparm
= DECL_ARGUMENTS (pattern
);
10094 patparm
; patparm
= DECL_CHAIN (patparm
))
10095 if (DECL_ARTIFICIAL (patparm
)
10096 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10101 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10102 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10103 gcc_assert (DECL_PARM_INDEX (patparm
)
10104 == DECL_PARM_INDEX (parm
));
10110 /* Substitute ARGS into the vector or list of template arguments T. */
10113 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10116 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10119 if (t
== error_mark_node
)
10120 return error_mark_node
;
10122 len
= TREE_VEC_LENGTH (t
);
10123 elts
= XALLOCAVEC (tree
, len
);
10125 for (i
= 0; i
< len
; i
++)
10127 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10130 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10131 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10132 else if (PACK_EXPANSION_P (orig_arg
))
10134 /* Substitute into an expansion expression. */
10135 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10137 if (TREE_CODE (new_arg
) == TREE_VEC
)
10138 /* Add to the expanded length adjustment the number of
10139 expanded arguments. We subtract one from this
10140 measurement, because the argument pack expression
10141 itself is already counted as 1 in
10142 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10143 the argument pack is empty. */
10144 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10146 else if (ARGUMENT_PACK_P (orig_arg
))
10148 /* Substitute into each of the arguments. */
10149 new_arg
= TYPE_P (orig_arg
)
10150 ? cxx_make_type (TREE_CODE (orig_arg
))
10151 : make_node (TREE_CODE (orig_arg
));
10153 SET_ARGUMENT_PACK_ARGS (
10155 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10156 args
, complain
, in_decl
));
10158 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10159 new_arg
= error_mark_node
;
10161 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10162 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10163 complain
, in_decl
);
10164 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10166 if (TREE_TYPE (new_arg
) == error_mark_node
)
10167 new_arg
= error_mark_node
;
10171 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10173 if (new_arg
== error_mark_node
)
10174 return error_mark_node
;
10177 if (new_arg
!= orig_arg
)
10184 /* Make space for the expanded arguments coming from template
10186 t
= make_tree_vec (len
+ expanded_len_adjust
);
10187 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10188 arguments for a member template.
10189 In that case each TREE_VEC in ORIG_T represents a level of template
10190 arguments, and ORIG_T won't carry any non defaulted argument count.
10191 It will rather be the nested TREE_VECs that will carry one.
10192 In other words, ORIG_T carries a non defaulted argument count only
10193 if it doesn't contain any nested TREE_VEC. */
10194 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10196 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10197 count
+= expanded_len_adjust
;
10198 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10200 for (i
= 0, out
= 0; i
< len
; i
++)
10202 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10203 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10204 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10208 /* Now expand the template argument pack "in place". */
10209 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10210 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10214 TREE_VEC_ELT (t
, out
) = elts
[i
];
10222 /* Return the result of substituting ARGS into the template parameters
10223 given by PARMS. If there are m levels of ARGS and m + n levels of
10224 PARMS, then the result will contain n levels of PARMS. For
10225 example, if PARMS is `template <class T> template <class U>
10226 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10227 result will be `template <int*, double, class V>'. */
10230 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10232 tree r
= NULL_TREE
;
10235 /* When substituting into a template, we must set
10236 PROCESSING_TEMPLATE_DECL as the template parameters may be
10237 dependent if they are based on one-another, and the dependency
10238 predicates are short-circuit outside of templates. */
10239 ++processing_template_decl
;
10241 for (new_parms
= &r
;
10242 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10243 new_parms
= &(TREE_CHAIN (*new_parms
)),
10244 parms
= TREE_CHAIN (parms
))
10247 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10250 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10254 if (parms
== error_mark_node
)
10257 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10259 if (tuple
== error_mark_node
)
10262 TREE_VEC_ELT (new_vec
, i
) =
10263 tsubst_template_parm (tuple
, args
, complain
);
10267 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10268 - TMPL_ARGS_DEPTH (args
)),
10269 new_vec
, NULL_TREE
);
10272 --processing_template_decl
;
10277 /* Return the result of substituting ARGS into one template parameter
10278 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10279 parameter and which TREE_PURPOSE is the default argument of the
10280 template parameter. */
10283 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10285 tree default_value
, parm_decl
;
10287 if (args
== NULL_TREE
10289 || t
== error_mark_node
)
10292 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10294 default_value
= TREE_PURPOSE (t
);
10295 parm_decl
= TREE_VALUE (t
);
10297 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10298 if (TREE_CODE (parm_decl
) == PARM_DECL
10299 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10300 parm_decl
= error_mark_node
;
10301 default_value
= tsubst_template_arg (default_value
, args
,
10302 complain
, NULL_TREE
);
10304 return build_tree_list (default_value
, parm_decl
);
10307 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10308 type T. If T is not an aggregate or enumeration type, it is
10309 handled as if by tsubst. IN_DECL is as for tsubst. If
10310 ENTERING_SCOPE is nonzero, T is the context for a template which
10311 we are presently tsubst'ing. Return the substituted value. */
10314 tsubst_aggr_type (tree t
,
10316 tsubst_flags_t complain
,
10318 int entering_scope
)
10320 if (t
== NULL_TREE
)
10323 switch (TREE_CODE (t
))
10326 if (TYPE_PTRMEMFUNC_P (t
))
10327 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10329 /* Else fall through. */
10330 case ENUMERAL_TYPE
:
10332 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10337 int saved_unevaluated_operand
;
10338 int saved_inhibit_evaluation_warnings
;
10340 /* In "sizeof(X<I>)" we need to evaluate "I". */
10341 saved_unevaluated_operand
= cp_unevaluated_operand
;
10342 cp_unevaluated_operand
= 0;
10343 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10344 c_inhibit_evaluation_warnings
= 0;
10346 /* First, determine the context for the type we are looking
10348 context
= TYPE_CONTEXT (t
);
10349 if (context
&& TYPE_P (context
))
10351 context
= tsubst_aggr_type (context
, args
, complain
,
10352 in_decl
, /*entering_scope=*/1);
10353 /* If context is a nested class inside a class template,
10354 it may still need to be instantiated (c++/33959). */
10355 context
= complete_type (context
);
10358 /* Then, figure out what arguments are appropriate for the
10359 type we are trying to find. For example, given:
10361 template <class T> struct S;
10362 template <class T, class U> void f(T, U) { S<U> su; }
10364 and supposing that we are instantiating f<int, double>,
10365 then our ARGS will be {int, double}, but, when looking up
10366 S we only want {double}. */
10367 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10368 complain
, in_decl
);
10369 if (argvec
== error_mark_node
)
10370 r
= error_mark_node
;
10373 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10374 entering_scope
, complain
);
10375 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10378 cp_unevaluated_operand
= saved_unevaluated_operand
;
10379 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10384 /* This is not a template type, so there's nothing to do. */
10388 return tsubst (t
, args
, complain
, in_decl
);
10392 /* Substitute into the default argument ARG (a default argument for
10393 FN), which has the indicated TYPE. */
10396 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10398 tree saved_class_ptr
= NULL_TREE
;
10399 tree saved_class_ref
= NULL_TREE
;
10400 int errs
= errorcount
+ sorrycount
;
10402 /* This can happen in invalid code. */
10403 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10406 /* This default argument came from a template. Instantiate the
10407 default argument here, not in tsubst. In the case of
10416 we must be careful to do name lookup in the scope of S<T>,
10417 rather than in the current class. */
10418 push_access_scope (fn
);
10419 /* The "this" pointer is not valid in a default argument. */
10422 saved_class_ptr
= current_class_ptr
;
10423 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10424 saved_class_ref
= current_class_ref
;
10425 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10428 push_deferring_access_checks(dk_no_deferred
);
10429 /* The default argument expression may cause implicitly defined
10430 member functions to be synthesized, which will result in garbage
10431 collection. We must treat this situation as if we were within
10432 the body of function so as to avoid collecting live data on the
10435 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10436 complain
, NULL_TREE
,
10437 /*integral_constant_expression_p=*/false);
10439 pop_deferring_access_checks();
10441 /* Restore the "this" pointer. */
10444 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10445 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10448 if (errorcount
+sorrycount
> errs
10449 && (complain
& tf_warning_or_error
))
10450 inform (input_location
,
10451 " when instantiating default argument for call to %D", fn
);
10453 /* Make sure the default argument is reasonable. */
10454 arg
= check_default_argument (type
, arg
, complain
);
10456 pop_access_scope (fn
);
10461 /* Substitute into all the default arguments for FN. */
10464 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10469 tmpl_args
= DECL_TI_ARGS (fn
);
10471 /* If this function is not yet instantiated, we certainly don't need
10472 its default arguments. */
10473 if (uses_template_parms (tmpl_args
))
10475 /* Don't do this again for clones. */
10476 if (DECL_CLONED_FUNCTION_P (fn
))
10479 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10481 arg
= TREE_CHAIN (arg
))
10482 if (TREE_PURPOSE (arg
))
10483 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10485 TREE_PURPOSE (arg
),
10489 /* Substitute the ARGS into the T, which is a _DECL. Return the
10490 result of the substitution. Issue error and warning messages under
10491 control of COMPLAIN. */
10494 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10496 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10497 location_t saved_loc
;
10498 tree r
= NULL_TREE
;
10500 hashval_t hash
= 0;
10502 /* Set the filename and linenumber to improve error-reporting. */
10503 saved_loc
= input_location
;
10504 input_location
= DECL_SOURCE_LOCATION (t
);
10506 switch (TREE_CODE (t
))
10508 case TEMPLATE_DECL
:
10510 /* We can get here when processing a member function template,
10511 member class template, or template template parameter. */
10512 tree decl
= DECL_TEMPLATE_RESULT (t
);
10517 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10519 /* Template template parameter is treated here. */
10520 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10521 if (new_type
== error_mark_node
)
10522 RETURN (error_mark_node
);
10523 /* If we get a real template back, return it. This can happen in
10524 the context of most_specialized_class. */
10525 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10529 DECL_CHAIN (r
) = NULL_TREE
;
10530 TREE_TYPE (r
) = new_type
;
10531 DECL_TEMPLATE_RESULT (r
)
10532 = build_decl (DECL_SOURCE_LOCATION (decl
),
10533 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10534 DECL_TEMPLATE_PARMS (r
)
10535 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10537 TYPE_NAME (new_type
) = r
;
10541 /* We might already have an instance of this template.
10542 The ARGS are for the surrounding class type, so the
10543 full args contain the tsubst'd args for the context,
10544 plus the innermost args from the template decl. */
10545 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10546 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10547 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10548 /* Because this is a template, the arguments will still be
10549 dependent, even after substitution. If
10550 PROCESSING_TEMPLATE_DECL is not set, the dependency
10551 predicates will short-circuit. */
10552 ++processing_template_decl
;
10553 full_args
= tsubst_template_args (tmpl_args
, args
,
10554 complain
, in_decl
);
10555 --processing_template_decl
;
10556 if (full_args
== error_mark_node
)
10557 RETURN (error_mark_node
);
10559 /* If this is a default template template argument,
10560 tsubst might not have changed anything. */
10561 if (full_args
== tmpl_args
)
10564 hash
= hash_tmpl_and_args (t
, full_args
);
10565 spec
= retrieve_specialization (t
, full_args
, hash
);
10566 if (spec
!= NULL_TREE
)
10572 /* Make a new template decl. It will be similar to the
10573 original, but will record the current template arguments.
10574 We also create a new function declaration, which is just
10575 like the old one, but points to this new template, rather
10576 than the old one. */
10578 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10579 DECL_CHAIN (r
) = NULL_TREE
;
10581 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10583 if (TREE_CODE (decl
) == TYPE_DECL
10584 && !TYPE_DECL_ALIAS_P (decl
))
10587 ++processing_template_decl
;
10588 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10589 --processing_template_decl
;
10590 if (new_type
== error_mark_node
)
10591 RETURN (error_mark_node
);
10593 TREE_TYPE (r
) = new_type
;
10594 /* For a partial specialization, we need to keep pointing to
10595 the primary template. */
10596 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10597 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10598 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10599 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10600 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10605 ++processing_template_decl
;
10606 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10607 --processing_template_decl
;
10608 if (new_decl
== error_mark_node
)
10609 RETURN (error_mark_node
);
10611 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10612 DECL_TI_TEMPLATE (new_decl
) = r
;
10613 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10614 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10615 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10618 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10619 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10620 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10622 /* The template parameters for this new template are all the
10623 template parameters for the old template, except the
10624 outermost level of parameters. */
10625 DECL_TEMPLATE_PARMS (r
)
10626 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10629 if (PRIMARY_TEMPLATE_P (t
))
10630 DECL_PRIMARY_TEMPLATE (r
) = r
;
10632 if (TREE_CODE (decl
) != TYPE_DECL
&& TREE_CODE (decl
) != VAR_DECL
)
10633 /* Record this non-type partial instantiation. */
10634 register_specialization (r
, t
,
10635 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10640 case FUNCTION_DECL
:
10643 tree argvec
= NULL_TREE
;
10651 /* Nobody should be tsubst'ing into non-template functions. */
10652 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10654 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10659 /* If T is not dependent, just return it. We have to
10660 increment PROCESSING_TEMPLATE_DECL because
10661 value_dependent_expression_p assumes that nothing is
10662 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10663 ++processing_template_decl
;
10664 dependent_p
= value_dependent_expression_p (t
);
10665 --processing_template_decl
;
10669 /* Calculate the most general template of which R is a
10670 specialization, and the complete set of arguments used to
10672 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10673 argvec
= tsubst_template_args (DECL_TI_ARGS
10674 (DECL_TEMPLATE_RESULT
10675 (DECL_TI_TEMPLATE (t
))),
10676 args
, complain
, in_decl
);
10677 if (argvec
== error_mark_node
)
10678 RETURN (error_mark_node
);
10680 /* Check to see if we already have this specialization. */
10681 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10682 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10690 /* We can see more levels of arguments than parameters if
10691 there was a specialization of a member template, like
10694 template <class T> struct S { template <class U> void f(); }
10695 template <> template <class U> void S<int>::f(U);
10697 Here, we'll be substituting into the specialization,
10698 because that's where we can find the code we actually
10699 want to generate, but we'll have enough arguments for
10700 the most general template.
10702 We also deal with the peculiar case:
10704 template <class T> struct S {
10705 template <class U> friend void f();
10707 template <class U> void f() {}
10709 template void f<double>();
10711 Here, the ARGS for the instantiation of will be {int,
10712 double}. But, we only need as many ARGS as there are
10713 levels of template parameters in CODE_PATTERN. We are
10714 careful not to get fooled into reducing the ARGS in
10717 template <class T> struct S { template <class U> void f(U); }
10718 template <class T> template <> void S<T>::f(int) {}
10720 which we can spot because the pattern will be a
10721 specialization in this case. */
10722 args_depth
= TMPL_ARGS_DEPTH (args
);
10724 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10725 if (args_depth
> parms_depth
10726 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10727 args
= get_innermost_template_args (args
, parms_depth
);
10731 /* This special case arises when we have something like this:
10733 template <class T> struct S {
10734 friend void f<int>(int, double);
10737 Here, the DECL_TI_TEMPLATE for the friend declaration
10738 will be an IDENTIFIER_NODE. We are being called from
10739 tsubst_friend_function, and we want only to create a
10740 new decl (R) with appropriate types so that we can call
10741 determine_specialization. */
10742 gen_tmpl
= NULL_TREE
;
10745 if (DECL_CLASS_SCOPE_P (t
))
10747 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10751 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10752 complain
, t
, /*entering_scope=*/1);
10757 ctx
= DECL_CONTEXT (t
);
10759 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10760 if (type
== error_mark_node
)
10761 RETURN (error_mark_node
);
10763 /* If we hit excessive deduction depth, the type is bogus even if
10764 it isn't error_mark_node, so don't build a decl. */
10765 if (excessive_deduction_depth
)
10766 RETURN (error_mark_node
);
10768 /* We do NOT check for matching decls pushed separately at this
10769 point, as they may not represent instantiations of this
10770 template, and in any case are considered separate under the
10773 DECL_USE_TEMPLATE (r
) = 0;
10774 TREE_TYPE (r
) = type
;
10775 /* Clear out the mangled name and RTL for the instantiation. */
10776 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10777 SET_DECL_RTL (r
, NULL
);
10778 /* Leave DECL_INITIAL set on deleted instantiations. */
10779 if (!DECL_DELETED_FN (r
))
10780 DECL_INITIAL (r
) = NULL_TREE
;
10781 DECL_CONTEXT (r
) = ctx
;
10783 /* OpenMP UDRs have the only argument a reference to the declared
10784 type. We want to diagnose if the declared type is a reference,
10785 which is invalid, but as references to references are usually
10786 quietly merged, diagnose it here. */
10787 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10790 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10791 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10792 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10793 error_at (DECL_SOURCE_LOCATION (t
),
10794 "reference type %qT in "
10795 "%<#pragma omp declare reduction%>", argtype
);
10796 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10797 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10801 if (member
&& DECL_CONV_FN_P (r
))
10802 /* Type-conversion operator. Reconstruct the name, in
10803 case it's the name of one of the template's parameters. */
10804 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10806 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10808 DECL_RESULT (r
) = NULL_TREE
;
10810 TREE_STATIC (r
) = 0;
10811 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10812 DECL_EXTERNAL (r
) = 1;
10813 /* If this is an instantiation of a function with internal
10814 linkage, we already know what object file linkage will be
10815 assigned to the instantiation. */
10816 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10817 DECL_DEFER_OUTPUT (r
) = 0;
10818 DECL_CHAIN (r
) = NULL_TREE
;
10819 DECL_PENDING_INLINE_INFO (r
) = 0;
10820 DECL_PENDING_INLINE_P (r
) = 0;
10821 DECL_SAVED_TREE (r
) = NULL_TREE
;
10822 DECL_STRUCT_FUNCTION (r
) = NULL
;
10824 /* We'll re-clone as appropriate in instantiate_template. */
10825 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10827 /* If we aren't complaining now, return on error before we register
10828 the specialization so that we'll complain eventually. */
10829 if ((complain
& tf_error
) == 0
10830 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10831 && !grok_op_properties (r
, /*complain=*/false))
10832 RETURN (error_mark_node
);
10834 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10835 this in the special friend case mentioned above where
10836 GEN_TMPL is NULL. */
10839 DECL_TEMPLATE_INFO (r
)
10840 = build_template_info (gen_tmpl
, argvec
);
10841 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10844 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10846 /* We instantiated this while substituting into
10847 the type earlier (template/friend54.C). */
10850 /* We're not supposed to instantiate default arguments
10851 until they are called, for a template. But, for a
10854 template <class T> void f ()
10855 { extern void g(int i = T()); }
10857 we should do the substitution when the template is
10858 instantiated. We handle the member function case in
10859 instantiate_class_template since the default arguments
10860 might refer to other members of the class. */
10862 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10863 && !uses_template_parms (argvec
))
10864 tsubst_default_arguments (r
, complain
);
10867 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10869 /* Copy the list of befriending classes. */
10870 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10872 friends
= &TREE_CHAIN (*friends
))
10874 *friends
= copy_node (*friends
);
10875 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10880 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10882 maybe_retrofit_in_chrg (r
);
10883 if (DECL_CONSTRUCTOR_P (r
))
10884 grok_ctor_properties (ctx
, r
);
10885 if (DECL_INHERITED_CTOR_BASE (r
))
10886 deduce_inheriting_ctor (r
);
10887 /* If this is an instantiation of a member template, clone it.
10888 If it isn't, that'll be handled by
10889 clone_constructors_and_destructors. */
10890 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10891 clone_function_decl (r
, /*update_method_vec_p=*/0);
10893 else if ((complain
& tf_error
) != 0
10894 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10895 && !grok_op_properties (r
, /*complain=*/true))
10896 RETURN (error_mark_node
);
10898 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10899 SET_DECL_FRIEND_CONTEXT (r
,
10900 tsubst (DECL_FRIEND_CONTEXT (t
),
10901 args
, complain
, in_decl
));
10903 /* Possibly limit visibility based on template args. */
10904 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10905 if (DECL_VISIBILITY_SPECIFIED (t
))
10907 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10908 DECL_ATTRIBUTES (r
)
10909 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10911 determine_visibility (r
);
10912 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10913 && !processing_template_decl
)
10914 defaulted_late_check (r
);
10916 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10917 args
, complain
, in_decl
);
10923 tree type
= NULL_TREE
;
10925 tree expanded_types
= NULL_TREE
;
10926 tree prev_r
= NULL_TREE
;
10927 tree first_r
= NULL_TREE
;
10929 if (DECL_PACK_P (t
))
10931 /* If there is a local specialization that isn't a
10932 parameter pack, it means that we're doing a "simple"
10933 substitution from inside tsubst_pack_expansion. Just
10934 return the local specialization (which will be a single
10936 tree spec
= retrieve_local_specialization (t
);
10938 && TREE_CODE (spec
) == PARM_DECL
10939 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10942 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10943 the parameters in this function parameter pack. */
10944 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10945 complain
, in_decl
);
10946 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10948 len
= TREE_VEC_LENGTH (expanded_types
);
10950 /* Zero-length parameter packs are boring. Just substitute
10953 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10958 /* All we did was update the type. Make a note of that. */
10959 type
= expanded_types
;
10960 expanded_types
= NULL_TREE
;
10964 /* Loop through all of the parameters we'll build. When T is
10965 a function parameter pack, LEN is the number of expanded
10966 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10968 for (i
= 0; i
< len
; ++i
)
10972 if (DECL_TEMPLATE_PARM_P (t
))
10973 SET_DECL_TEMPLATE_PARM_P (r
);
10975 if (expanded_types
)
10976 /* We're on the Ith parameter of the function parameter
10979 /* Get the Ith type. */
10980 type
= TREE_VEC_ELT (expanded_types
, i
);
10982 /* Rename the parameter to include the index. */
10984 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10987 /* We're dealing with a normal parameter. */
10988 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10990 type
= type_decays_to (type
);
10991 TREE_TYPE (r
) = type
;
10992 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10994 if (DECL_INITIAL (r
))
10996 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10997 DECL_INITIAL (r
) = TREE_TYPE (r
);
10999 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11000 complain
, in_decl
);
11003 DECL_CONTEXT (r
) = NULL_TREE
;
11005 if (!DECL_TEMPLATE_PARM_P (r
))
11006 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11008 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11009 args
, complain
, in_decl
);
11011 /* Keep track of the first new parameter we
11012 generate. That's what will be returned to the
11017 /* Build a proper chain of parameters when substituting
11018 into a function parameter pack. */
11020 DECL_CHAIN (prev_r
) = r
;
11023 /* If cp_unevaluated_operand is set, we're just looking for a
11024 single dummy parameter, so don't keep going. */
11025 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11026 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11027 complain
, DECL_CHAIN (t
));
11029 /* FIRST_R contains the start of the chain we've built. */
11036 tree type
= NULL_TREE
;
11037 tree vec
= NULL_TREE
;
11038 tree expanded_types
= NULL_TREE
;
11041 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11043 /* This field is a lambda capture pack. Return a TREE_VEC of
11044 the expanded fields to instantiate_class_template_1 and
11045 store them in the specializations hash table as a
11046 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11047 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11048 complain
, in_decl
);
11049 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11051 len
= TREE_VEC_LENGTH (expanded_types
);
11052 vec
= make_tree_vec (len
);
11056 /* All we did was update the type. Make a note of that. */
11057 type
= expanded_types
;
11058 expanded_types
= NULL_TREE
;
11062 for (int i
= 0; i
< len
; ++i
)
11065 if (expanded_types
)
11067 type
= TREE_VEC_ELT (expanded_types
, i
);
11069 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11072 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11074 if (type
== error_mark_node
)
11075 RETURN (error_mark_node
);
11076 TREE_TYPE (r
) = type
;
11077 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11079 if (DECL_C_BIT_FIELD (r
))
11080 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11081 non-bit-fields DECL_INITIAL is a non-static data member
11082 initializer, which gets deferred instantiation. */
11084 = tsubst_expr (DECL_INITIAL (t
), args
,
11086 /*integral_constant_expression_p=*/true);
11087 else if (DECL_INITIAL (t
))
11089 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11090 NSDMI in perform_member_init. Still set DECL_INITIAL
11091 so that we know there is one. */
11092 DECL_INITIAL (r
) = void_node
;
11093 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11094 retrofit_lang_decl (r
);
11095 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11097 /* We don't have to set DECL_CONTEXT here; it is set by
11098 finish_member_declaration. */
11099 DECL_CHAIN (r
) = NULL_TREE
;
11101 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11102 args
, complain
, in_decl
);
11105 TREE_VEC_ELT (vec
, i
) = r
;
11111 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11112 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11113 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11114 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11115 TREE_TYPE (pack
) = tpack
;
11116 register_specialization (pack
, t
, args
, false, 0);
11122 /* We reach here only for member using decls. We also need to check
11123 uses_template_parms because DECL_DEPENDENT_P is not set for a
11124 using-declaration that designates a member of the current
11125 instantiation (c++/53549). */
11126 if (DECL_DEPENDENT_P (t
)
11127 || uses_template_parms (USING_DECL_SCOPE (t
)))
11129 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11130 complain
, in_decl
);
11131 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11132 r
= do_class_using_decl (inst_scope
, name
);
11134 r
= error_mark_node
;
11137 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11138 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11144 DECL_CHAIN (r
) = NULL_TREE
;
11151 tree argvec
= NULL_TREE
;
11152 tree gen_tmpl
= NULL_TREE
;
11154 tree tmpl
= NULL_TREE
;
11156 tree type
= NULL_TREE
;
11159 if (TREE_TYPE (t
) == error_mark_node
)
11160 RETURN (error_mark_node
);
11162 if (TREE_CODE (t
) == TYPE_DECL
11163 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11165 /* If this is the canonical decl, we don't have to
11166 mess with instantiations, and often we can't (for
11167 typename, template type parms and such). Note that
11168 TYPE_NAME is not correct for the above test if
11169 we've copied the type for a typedef. */
11170 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11171 if (type
== error_mark_node
)
11172 RETURN (error_mark_node
);
11173 r
= TYPE_NAME (type
);
11177 /* Check to see if we already have the specialization we
11180 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11182 /* T is a static data member or namespace-scope entity.
11183 We have to substitute into namespace-scope variables
11184 (even though such entities are never templates) because
11187 template <class T> void f() { extern T t; }
11189 where the entity referenced is not known until
11190 instantiation time. */
11192 ctx
= DECL_CONTEXT (t
);
11193 if (DECL_CLASS_SCOPE_P (t
))
11195 ctx
= tsubst_aggr_type (ctx
, args
,
11197 in_decl
, /*entering_scope=*/1);
11198 /* If CTX is unchanged, then T is in fact the
11199 specialization we want. That situation occurs when
11200 referencing a static data member within in its own
11201 class. We can use pointer equality, rather than
11202 same_type_p, because DECL_CONTEXT is always
11204 if (ctx
== DECL_CONTEXT (t
)
11205 /* ... unless T is a member template; in which
11206 case our caller can be willing to create a
11207 specialization of that template represented
11209 && !(DECL_TI_TEMPLATE (t
)
11210 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
11216 tmpl
= DECL_TI_TEMPLATE (t
);
11217 gen_tmpl
= most_general_template (tmpl
);
11218 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11219 if (argvec
== error_mark_node
)
11220 RETURN (error_mark_node
);
11221 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11222 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11227 /* A local variable. */
11229 /* Subsequent calls to pushdecl will fill this in. */
11231 spec
= retrieve_local_specialization (t
);
11233 /* If we already have the specialization we need, there is
11234 nothing more to do. */
11241 /* Create a new node for the specialization we need. */
11243 if (type
== NULL_TREE
)
11245 if (is_typedef_decl (t
))
11246 type
= DECL_ORIGINAL_TYPE (t
);
11248 type
= TREE_TYPE (t
);
11250 && VAR_HAD_UNKNOWN_BOUND (t
)
11251 && type
!= error_mark_node
)
11252 type
= strip_array_domain (type
);
11253 type
= tsubst (type
, args
, complain
, in_decl
);
11257 /* Even if the original location is out of scope, the
11258 newly substituted one is not. */
11259 DECL_DEAD_FOR_LOCAL (r
) = 0;
11260 DECL_INITIALIZED_P (r
) = 0;
11261 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11262 if (type
== error_mark_node
)
11263 RETURN (error_mark_node
);
11264 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11266 /* It may seem that this case cannot occur, since:
11271 declares a function, not a variable. However:
11274 template <typename T> void g() { T t; }
11275 template void g<f>();
11277 is an attempt to declare a variable with function
11279 error ("variable %qD has function type",
11280 /* R is not yet sufficiently initialized, so we
11281 just use its name. */
11283 RETURN (error_mark_node
);
11285 type
= complete_type (type
);
11286 /* Wait until cp_finish_decl to set this again, to handle
11287 circular dependency (template/instantiate6.C). */
11288 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11289 type
= check_var_type (DECL_NAME (r
), type
);
11291 if (DECL_HAS_VALUE_EXPR_P (t
))
11293 tree ve
= DECL_VALUE_EXPR (t
);
11294 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11295 /*constant_expression_p=*/false);
11296 if (REFERENCE_REF_P (ve
))
11298 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11299 ve
= TREE_OPERAND (ve
, 0);
11301 SET_DECL_VALUE_EXPR (r
, ve
);
11303 if (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
11304 set_decl_tls_model (r
, decl_tls_model (t
));
11306 else if (DECL_SELF_REFERENCE_P (t
))
11307 SET_DECL_SELF_REFERENCE_P (r
);
11308 TREE_TYPE (r
) = type
;
11309 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11310 DECL_CONTEXT (r
) = ctx
;
11311 /* Clear out the mangled name and RTL for the instantiation. */
11312 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11313 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11314 SET_DECL_RTL (r
, NULL
);
11315 /* The initializer must not be expanded until it is required;
11316 see [temp.inst]. */
11317 DECL_INITIAL (r
) = NULL_TREE
;
11318 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11319 SET_DECL_RTL (r
, NULL
);
11320 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11323 /* Possibly limit visibility based on template args. */
11324 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11325 if (DECL_VISIBILITY_SPECIFIED (t
))
11327 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11328 DECL_ATTRIBUTES (r
)
11329 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11331 determine_visibility (r
);
11336 /* A static data member declaration is always marked
11337 external when it is declared in-class, even if an
11338 initializer is present. We mimic the non-template
11339 processing here. */
11340 DECL_EXTERNAL (r
) = 1;
11342 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11343 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11344 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11346 else if (!cp_unevaluated_operand
)
11347 register_local_specialization (r
, t
);
11349 DECL_CHAIN (r
) = NULL_TREE
;
11351 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11353 args
, complain
, in_decl
);
11355 /* Preserve a typedef that names a type. */
11356 if (is_typedef_decl (r
))
11358 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11359 set_underlying_type (r
);
11362 layout_decl (r
, 0);
11367 gcc_unreachable ();
11372 /* Restore the file and line information. */
11373 input_location
= saved_loc
;
11378 /* Substitute into the ARG_TYPES of a function type.
11379 If END is a TREE_CHAIN, leave it and any following types
11383 tsubst_arg_types (tree arg_types
,
11386 tsubst_flags_t complain
,
11389 tree remaining_arg_types
;
11390 tree type
= NULL_TREE
;
11392 tree expanded_args
= NULL_TREE
;
11395 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11398 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11399 args
, end
, complain
, in_decl
);
11400 if (remaining_arg_types
== error_mark_node
)
11401 return error_mark_node
;
11403 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11405 /* For a pack expansion, perform substitution on the
11406 entire expression. Later on, we'll handle the arguments
11408 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11409 args
, complain
, in_decl
);
11411 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11412 /* So that we'll spin through the parameters, one by one. */
11413 i
= TREE_VEC_LENGTH (expanded_args
);
11416 /* We only partially substituted into the parameter
11417 pack. Our type is TYPE_PACK_EXPANSION. */
11418 type
= expanded_args
;
11419 expanded_args
= NULL_TREE
;
11427 type
= TREE_VEC_ELT (expanded_args
, i
);
11429 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11431 if (type
== error_mark_node
)
11432 return error_mark_node
;
11433 if (VOID_TYPE_P (type
))
11435 if (complain
& tf_error
)
11437 error ("invalid parameter type %qT", type
);
11439 error ("in declaration %q+D", in_decl
);
11441 return error_mark_node
;
11444 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11445 return error_mark_node
;
11447 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11448 top-level qualifiers as required. */
11449 type
= cv_unqualified (type_decays_to (type
));
11451 /* We do not substitute into default arguments here. The standard
11452 mandates that they be instantiated only when needed, which is
11453 done in build_over_call. */
11454 default_arg
= TREE_PURPOSE (arg_types
);
11456 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11458 /* We've instantiated a template before its default arguments
11459 have been parsed. This can happen for a nested template
11460 class, and is not an error unless we require the default
11461 argument in a call of this function. */
11462 remaining_arg_types
=
11463 tree_cons (default_arg
, type
, remaining_arg_types
);
11464 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11467 remaining_arg_types
=
11468 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11471 return remaining_arg_types
;
11474 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11475 *not* handle the exception-specification for FNTYPE, because the
11476 initial substitution of explicitly provided template parameters
11477 during argument deduction forbids substitution into the
11478 exception-specification:
11482 All references in the function type of the function template to the
11483 corresponding template parameters are replaced by the specified tem-
11484 plate argument values. If a substitution in a template parameter or
11485 in the function type of the function template results in an invalid
11486 type, type deduction fails. [Note: The equivalent substitution in
11487 exception specifications is done only when the function is instanti-
11488 ated, at which point a program is ill-formed if the substitution
11489 results in an invalid type.] */
11492 tsubst_function_type (tree t
,
11494 tsubst_flags_t complain
,
11498 tree arg_types
= NULL_TREE
;
11501 /* The TYPE_CONTEXT is not used for function/method types. */
11502 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11504 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
11506 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
11508 if (late_return_type_p
)
11510 /* Substitute the argument types. */
11511 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11512 complain
, in_decl
);
11513 if (arg_types
== error_mark_node
)
11514 return error_mark_node
;
11516 tree save_ccp
= current_class_ptr
;
11517 tree save_ccr
= current_class_ref
;
11518 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
11519 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
11520 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
11523 /* DR 1207: 'this' is in scope in the trailing return type. */
11524 inject_this_parameter (this_type
, cp_type_quals (this_type
));
11527 /* Substitute the return type. */
11528 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11532 current_class_ptr
= save_ccp
;
11533 current_class_ref
= save_ccr
;
11537 /* Substitute the return type. */
11538 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11540 if (return_type
== error_mark_node
)
11541 return error_mark_node
;
11542 /* DR 486 clarifies that creation of a function type with an
11543 invalid return type is a deduction failure. */
11544 if (TREE_CODE (return_type
) == ARRAY_TYPE
11545 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11547 if (complain
& tf_error
)
11549 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11550 error ("function returning an array");
11552 error ("function returning a function");
11554 return error_mark_node
;
11557 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11558 return error_mark_node
;
11560 if (!late_return_type_p
)
11562 /* Substitute the argument types. */
11563 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11564 complain
, in_decl
);
11565 if (arg_types
== error_mark_node
)
11566 return error_mark_node
;
11569 /* Construct a new type node and return it. */
11570 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11572 fntype
= build_function_type (return_type
, arg_types
);
11573 fntype
= apply_memfn_quals (fntype
,
11574 type_memfn_quals (t
),
11575 type_memfn_rqual (t
));
11579 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11580 /* Don't pick up extra function qualifiers from the basetype. */
11581 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11582 if (! MAYBE_CLASS_TYPE_P (r
))
11586 Type deduction may fail for any of the following
11589 -- Attempting to create "pointer to member of T" when T
11590 is not a class type. */
11591 if (complain
& tf_error
)
11592 error ("creating pointer to member function of non-class type %qT",
11594 return error_mark_node
;
11597 fntype
= build_method_type_directly (r
, return_type
,
11598 TREE_CHAIN (arg_types
));
11599 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11601 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11603 if (late_return_type_p
)
11604 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
11609 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11610 ARGS into that specification, and return the substituted
11611 specification. If there is no specification, return NULL_TREE. */
11614 tsubst_exception_specification (tree fntype
,
11616 tsubst_flags_t complain
,
11623 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11624 new_specs
= NULL_TREE
;
11625 if (specs
&& TREE_PURPOSE (specs
))
11627 /* A noexcept-specifier. */
11628 tree expr
= TREE_PURPOSE (specs
);
11629 if (TREE_CODE (expr
) == INTEGER_CST
)
11633 /* Defer instantiation of noexcept-specifiers to avoid
11634 excessive instantiations (c++/49107). */
11635 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11636 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11638 /* We already partially instantiated this member template,
11639 so combine the new args with the old. */
11640 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11641 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11642 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11643 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11647 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11648 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11652 new_specs
= tsubst_copy_and_build
11653 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11654 /*integral_constant_expression_p=*/true);
11655 new_specs
= build_noexcept_spec (new_specs
, complain
);
11659 if (! TREE_VALUE (specs
))
11666 tree expanded_specs
= NULL_TREE
;
11668 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11670 /* Expand the pack expansion type. */
11671 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11675 if (expanded_specs
== error_mark_node
)
11676 return error_mark_node
;
11677 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11678 len
= TREE_VEC_LENGTH (expanded_specs
);
11681 /* We're substituting into a member template, so
11682 we got a TYPE_PACK_EXPANSION back. Add that
11683 expansion and move on. */
11684 gcc_assert (TREE_CODE (expanded_specs
)
11685 == TYPE_PACK_EXPANSION
);
11686 new_specs
= add_exception_specifier (new_specs
,
11689 specs
= TREE_CHAIN (specs
);
11694 for (i
= 0; i
< len
; ++i
)
11696 if (expanded_specs
)
11697 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11699 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11700 if (spec
== error_mark_node
)
11702 new_specs
= add_exception_specifier (new_specs
, spec
,
11706 specs
= TREE_CHAIN (specs
);
11712 /* Take the tree structure T and replace template parameters used
11713 therein with the argument vector ARGS. IN_DECL is an associated
11714 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11715 Issue error and warning messages under control of COMPLAIN. Note
11716 that we must be relatively non-tolerant of extensions here, in
11717 order to preserve conformance; if we allow substitutions that
11718 should not be allowed, we may allow argument deductions that should
11719 not succeed, and therefore report ambiguous overload situations
11720 where there are none. In theory, we could allow the substitution,
11721 but indicate that it should have failed, and allow our caller to
11722 make sure that the right thing happens, but we don't try to do this
11725 This function is used for dealing with types, decls and the like;
11726 for expressions, use tsubst_expr or tsubst_copy. */
11729 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11731 enum tree_code code
;
11732 tree type
, r
= NULL_TREE
;
11734 if (t
== NULL_TREE
|| t
== error_mark_node
11735 || t
== integer_type_node
11736 || t
== void_type_node
11737 || t
== char_type_node
11738 || t
== unknown_type_node
11739 || TREE_CODE (t
) == NAMESPACE_DECL
11740 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11744 return tsubst_decl (t
, args
, complain
);
11746 if (args
== NULL_TREE
)
11749 code
= TREE_CODE (t
);
11751 if (code
== IDENTIFIER_NODE
)
11752 type
= IDENTIFIER_TYPE_VALUE (t
);
11754 type
= TREE_TYPE (t
);
11756 gcc_assert (type
!= unknown_type_node
);
11758 /* Reuse typedefs. We need to do this to handle dependent attributes,
11759 such as attribute aligned. */
11761 && typedef_variant_p (t
))
11763 tree decl
= TYPE_NAME (t
);
11765 if (alias_template_specialization_p (t
))
11767 /* DECL represents an alias template and we want to
11769 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11770 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11771 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11773 else if (DECL_CLASS_SCOPE_P (decl
)
11774 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11775 && uses_template_parms (DECL_CONTEXT (decl
)))
11777 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11778 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11779 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11781 else if (DECL_FUNCTION_SCOPE_P (decl
)
11782 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11783 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11784 r
= retrieve_local_specialization (decl
);
11786 /* The typedef is from a non-template context. */
11792 r
= cp_build_qualified_type_real
11793 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11794 complain
| tf_ignore_bad_quals
);
11799 /* We don't have an instantiation yet, so drop the typedef. */
11800 int quals
= cp_type_quals (t
);
11801 t
= DECL_ORIGINAL_TYPE (decl
);
11802 t
= cp_build_qualified_type_real (t
, quals
,
11803 complain
| tf_ignore_bad_quals
);
11808 && code
!= TYPENAME_TYPE
11809 && code
!= TEMPLATE_TYPE_PARM
11810 && code
!= IDENTIFIER_NODE
11811 && code
!= FUNCTION_TYPE
11812 && code
!= METHOD_TYPE
)
11813 type
= tsubst (type
, args
, complain
, in_decl
);
11814 if (type
== error_mark_node
)
11815 return error_mark_node
;
11821 case ENUMERAL_TYPE
:
11822 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11823 /*entering_scope=*/0);
11826 case IDENTIFIER_NODE
:
11837 if (t
== integer_type_node
)
11840 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11841 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11845 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11847 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11848 /*integral_constant_expression_p=*/false);
11850 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11852 if (TREE_CODE (max
) == NOP_EXPR
11853 && TREE_SIDE_EFFECTS (omax
)
11854 && !TREE_TYPE (max
))
11855 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11857 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11858 with TREE_SIDE_EFFECTS that indicates this is not an integral
11859 constant expression. */
11860 if (processing_template_decl
11861 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11863 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11864 TREE_SIDE_EFFECTS (max
) = 1;
11867 return compute_array_index_type (NULL_TREE
, max
, complain
);
11870 case TEMPLATE_TYPE_PARM
:
11871 case TEMPLATE_TEMPLATE_PARM
:
11872 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11873 case TEMPLATE_PARM_INDEX
:
11878 tree arg
= NULL_TREE
;
11882 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11883 template_parm_level_and_index (t
, &level
, &idx
);
11885 levels
= TMPL_ARGS_DEPTH (args
);
11886 if (level
<= levels
)
11888 arg
= TMPL_ARG (args
, level
, idx
);
11890 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11892 /* See through ARGUMENT_PACK_SELECT arguments. */
11893 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11894 /* If the selected argument is an expansion E, that most
11895 likely means we were called from
11896 gen_elem_of_pack_expansion_instantiation during the
11897 substituting of pack an argument pack (which Ith
11898 element is a pack expansion, where I is
11899 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11900 In this case, the Ith element resulting from this
11901 substituting is going to be a pack expansion, which
11902 pattern is the pattern of E. Let's return the
11904 gen_elem_of_pack_expansion_instantiation will
11905 build the resulting pack expansion from it. */
11906 if (PACK_EXPANSION_P (arg
))
11908 /* Make sure we aren't throwing away arg info. */
11909 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
11910 arg
= PACK_EXPANSION_PATTERN (arg
);
11915 if (arg
== error_mark_node
)
11916 return error_mark_node
;
11917 else if (arg
!= NULL_TREE
)
11919 if (ARGUMENT_PACK_P (arg
))
11920 /* If ARG is an argument pack, we don't actually want to
11921 perform a substitution here, because substitutions
11922 for argument packs are only done
11923 element-by-element. We can get to this point when
11924 substituting the type of a non-type template
11925 parameter pack, when that type actually contains
11926 template parameter packs from an outer template, e.g.,
11928 template<typename... Types> struct A {
11929 template<Types... Values> struct B { };
11933 if (code
== TEMPLATE_TYPE_PARM
)
11936 gcc_assert (TYPE_P (arg
));
11938 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11940 return cp_build_qualified_type_real
11941 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11943 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11945 /* We are processing a type constructed from a
11946 template template parameter. */
11947 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11948 args
, complain
, in_decl
);
11949 if (argvec
== error_mark_node
)
11950 return error_mark_node
;
11952 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11953 || TREE_CODE (arg
) == TEMPLATE_DECL
11954 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11956 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11957 /* Consider this code:
11959 template <template <class> class Template>
11961 template <class Arg> using Bind = Template<Arg>;
11964 template <template <class> class Template, class Arg>
11965 using Instantiate = Template<Arg>; //#0
11967 template <template <class> class Template,
11970 Instantiate<Internal<Template>::template Bind,
11973 When #1 is parsed, the
11974 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11975 parameter `Template' in #0 matches the
11976 UNBOUND_CLASS_TEMPLATE representing the argument
11977 `Internal<Template>::template Bind'; We then want
11978 to assemble the type `Bind<Argument>' that can't
11979 be fully created right now, because
11980 `Internal<Template>' not being complete, the Bind
11981 template cannot be looked up in that context. So
11982 we need to "store" `Bind<Argument>' for later
11983 when the context of Bind becomes complete. Let's
11984 store that in a TYPENAME_TYPE. */
11985 return make_typename_type (TYPE_CONTEXT (arg
),
11986 build_nt (TEMPLATE_ID_EXPR
,
11987 TYPE_IDENTIFIER (arg
),
11992 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11993 are resolving nested-types in the signature of a
11994 member function templates. Otherwise ARG is a
11995 TEMPLATE_DECL and is the real template to be
11997 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11998 arg
= TYPE_NAME (arg
);
12000 r
= lookup_template_class (arg
,
12002 DECL_CONTEXT (arg
),
12003 /*entering_scope=*/0,
12005 return cp_build_qualified_type_real
12006 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12009 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12010 return convert_from_reference (unshare_expr (arg
));
12014 /* This can happen during the attempted tsubst'ing in
12015 unify. This means that we don't yet have any information
12016 about the template parameter in question. */
12019 /* Early in template argument deduction substitution, we don't
12020 want to reduce the level of 'auto', or it will be confused
12021 with a normal template parm in subsequent deduction. */
12022 if (is_auto (t
) && (complain
& tf_partial
))
12025 /* If we get here, we must have been looking at a parm for a
12026 more deeply nested template. Make a new version of this
12027 template parameter, but with a lower level. */
12030 case TEMPLATE_TYPE_PARM
:
12031 case TEMPLATE_TEMPLATE_PARM
:
12032 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12033 if (cp_type_quals (t
))
12035 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12036 r
= cp_build_qualified_type_real
12037 (r
, cp_type_quals (t
),
12038 complain
| (code
== TEMPLATE_TYPE_PARM
12039 ? tf_ignore_bad_quals
: 0));
12044 TEMPLATE_TYPE_PARM_INDEX (r
)
12045 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12046 r
, levels
, args
, complain
);
12047 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12048 TYPE_MAIN_VARIANT (r
) = r
;
12049 TYPE_POINTER_TO (r
) = NULL_TREE
;
12050 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12052 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12053 /* We have reduced the level of the template
12054 template parameter, but not the levels of its
12055 template parameters, so canonical_type_parameter
12056 will not be able to find the canonical template
12057 template parameter for this level. Thus, we
12058 require structural equality checking to compare
12059 TEMPLATE_TEMPLATE_PARMs. */
12060 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12061 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12062 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12064 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12066 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12068 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12069 complain
, in_decl
);
12070 if (argvec
== error_mark_node
)
12071 return error_mark_node
;
12073 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
12074 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
12079 case TEMPLATE_PARM_INDEX
:
12080 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
12084 gcc_unreachable ();
12092 tree purpose
, value
, chain
;
12094 if (t
== void_list_node
)
12097 purpose
= TREE_PURPOSE (t
);
12100 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
12101 if (purpose
== error_mark_node
)
12102 return error_mark_node
;
12104 value
= TREE_VALUE (t
);
12107 value
= tsubst (value
, args
, complain
, in_decl
);
12108 if (value
== error_mark_node
)
12109 return error_mark_node
;
12111 chain
= TREE_CHAIN (t
);
12112 if (chain
&& chain
!= void_type_node
)
12114 chain
= tsubst (chain
, args
, complain
, in_decl
);
12115 if (chain
== error_mark_node
)
12116 return error_mark_node
;
12118 if (purpose
== TREE_PURPOSE (t
)
12119 && value
== TREE_VALUE (t
)
12120 && chain
== TREE_CHAIN (t
))
12122 return hash_tree_cons (purpose
, value
, chain
);
12126 /* We should never be tsubsting a binfo. */
12127 gcc_unreachable ();
12130 /* A vector of template arguments. */
12131 gcc_assert (!type
);
12132 return tsubst_template_args (t
, args
, complain
, in_decl
);
12135 case REFERENCE_TYPE
:
12137 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12142 Type deduction may fail for any of the following
12145 -- Attempting to create a pointer to reference type.
12146 -- Attempting to create a reference to a reference type or
12147 a reference to void.
12149 Core issue 106 says that creating a reference to a reference
12150 during instantiation is no longer a cause for failure. We
12151 only enforce this check in strict C++98 mode. */
12152 if ((TREE_CODE (type
) == REFERENCE_TYPE
12153 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12154 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12156 static location_t last_loc
;
12158 /* We keep track of the last time we issued this error
12159 message to avoid spewing a ton of messages during a
12160 single bad template instantiation. */
12161 if (complain
& tf_error
12162 && last_loc
!= input_location
)
12164 if (VOID_TYPE_P (type
))
12165 error ("forming reference to void");
12166 else if (code
== POINTER_TYPE
)
12167 error ("forming pointer to reference type %qT", type
);
12169 error ("forming reference to reference type %qT", type
);
12170 last_loc
= input_location
;
12173 return error_mark_node
;
12175 else if (TREE_CODE (type
) == FUNCTION_TYPE
12176 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12177 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12179 if (complain
& tf_error
)
12181 if (code
== POINTER_TYPE
)
12182 error ("forming pointer to qualified function type %qT",
12185 error ("forming reference to qualified function type %qT",
12188 return error_mark_node
;
12190 else if (code
== POINTER_TYPE
)
12192 r
= build_pointer_type (type
);
12193 if (TREE_CODE (type
) == METHOD_TYPE
)
12194 r
= build_ptrmemfunc_type (r
);
12196 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12197 /* In C++0x, during template argument substitution, when there is an
12198 attempt to create a reference to a reference type, reference
12199 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12201 "If a template-argument for a template-parameter T names a type
12202 that is a reference to a type A, an attempt to create the type
12203 'lvalue reference to cv T' creates the type 'lvalue reference to
12204 A,' while an attempt to create the type type rvalue reference to
12205 cv T' creates the type T"
12207 r
= cp_build_reference_type
12209 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12211 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12212 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12214 if (cxx_dialect
>= cxx14
12215 && !(TREE_CODE (t
) == REFERENCE_TYPE
&& REFERENCE_VLA_OK (t
))
12216 && array_of_runtime_bound_p (type
)
12217 && (flag_iso
|| warn_vla
> 0))
12219 if (complain
& tf_warning_or_error
)
12221 (input_location
, OPT_Wvla
,
12222 code
== REFERENCE_TYPE
12223 ? G_("cannot declare reference to array of runtime bound")
12224 : G_("cannot declare pointer to array of runtime bound"));
12226 r
= error_mark_node
;
12229 if (r
!= error_mark_node
)
12230 /* Will this ever be needed for TYPE_..._TO values? */
12237 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12238 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12242 Type deduction may fail for any of the following
12245 -- Attempting to create "pointer to member of T" when T
12246 is not a class type. */
12247 if (complain
& tf_error
)
12248 error ("creating pointer to member of non-class type %qT", r
);
12249 return error_mark_node
;
12251 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12253 if (complain
& tf_error
)
12254 error ("creating pointer to member reference type %qT", type
);
12255 return error_mark_node
;
12257 if (VOID_TYPE_P (type
))
12259 if (complain
& tf_error
)
12260 error ("creating pointer to member of type void");
12261 return error_mark_node
;
12263 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12264 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12266 /* The type of the implicit object parameter gets its
12267 cv-qualifiers from the FUNCTION_TYPE. */
12270 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12271 type_memfn_rqual (type
));
12272 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12273 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12277 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12281 case FUNCTION_TYPE
:
12286 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12287 if (fntype
== error_mark_node
)
12288 return error_mark_node
;
12290 /* Substitute the exception specification. */
12291 specs
= tsubst_exception_specification (t
, args
, complain
,
12292 in_decl
, /*defer_ok*/true);
12293 if (specs
== error_mark_node
)
12294 return error_mark_node
;
12296 fntype
= build_exception_variant (fntype
, specs
);
12301 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12302 if (domain
== error_mark_node
)
12303 return error_mark_node
;
12305 /* As an optimization, we avoid regenerating the array type if
12306 it will obviously be the same as T. */
12307 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12310 /* These checks should match the ones in create_array_type_for_decl.
12314 The deduction may fail for any of the following reasons:
12316 -- Attempting to create an array with an element type that
12317 is void, a function type, or a reference type, or [DR337]
12318 an abstract class type. */
12319 if (VOID_TYPE_P (type
)
12320 || TREE_CODE (type
) == FUNCTION_TYPE
12321 || (TREE_CODE (type
) == ARRAY_TYPE
12322 && TYPE_DOMAIN (type
) == NULL_TREE
)
12323 || TREE_CODE (type
) == REFERENCE_TYPE
)
12325 if (complain
& tf_error
)
12326 error ("creating array of %qT", type
);
12327 return error_mark_node
;
12330 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12331 return error_mark_node
;
12333 r
= build_cplus_array_type (type
, domain
);
12335 if (TYPE_USER_ALIGN (t
))
12337 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12338 TYPE_USER_ALIGN (r
) = 1;
12344 case TYPENAME_TYPE
:
12346 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12347 in_decl
, /*entering_scope=*/1);
12348 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12349 complain
, in_decl
);
12351 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12352 return error_mark_node
;
12354 if (!MAYBE_CLASS_TYPE_P (ctx
))
12356 if (complain
& tf_error
)
12357 error ("%qT is not a class, struct, or union type", ctx
);
12358 return error_mark_node
;
12360 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12362 /* Normally, make_typename_type does not require that the CTX
12363 have complete type in order to allow things like:
12365 template <class T> struct S { typename S<T>::X Y; };
12367 But, such constructs have already been resolved by this
12368 point, so here CTX really should have complete type, unless
12369 it's a partial instantiation. */
12370 ctx
= complete_type (ctx
);
12371 if (!COMPLETE_TYPE_P (ctx
))
12373 if (complain
& tf_error
)
12374 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12375 return error_mark_node
;
12379 f
= make_typename_type (ctx
, f
, typename_type
,
12380 complain
| tf_keep_type_decl
);
12381 if (f
== error_mark_node
)
12383 if (TREE_CODE (f
) == TYPE_DECL
)
12385 complain
|= tf_ignore_bad_quals
;
12389 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12391 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12393 if (complain
& tf_error
)
12394 error ("%qT resolves to %qT, which is not an enumeration type",
12397 return error_mark_node
;
12399 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12401 if (complain
& tf_error
)
12402 error ("%qT resolves to %qT, which is is not a class type",
12405 return error_mark_node
;
12409 return cp_build_qualified_type_real
12410 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12413 case UNBOUND_CLASS_TEMPLATE
:
12415 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12416 in_decl
, /*entering_scope=*/1);
12417 tree name
= TYPE_IDENTIFIER (t
);
12418 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12420 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12421 return error_mark_node
;
12424 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12425 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12432 ++cp_unevaluated_operand
;
12433 ++c_inhibit_evaluation_warnings
;
12435 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12437 /*integral_constant_expression_p=*/false);
12439 --cp_unevaluated_operand
;
12440 --c_inhibit_evaluation_warnings
;
12442 type
= finish_typeof (type
);
12443 return cp_build_qualified_type_real (type
,
12445 | cp_type_quals (type
),
12449 case DECLTYPE_TYPE
:
12453 ++cp_unevaluated_operand
;
12454 ++c_inhibit_evaluation_warnings
;
12456 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12457 complain
|tf_decltype
, in_decl
,
12458 /*function_p*/false,
12459 /*integral_constant_expression*/false);
12461 --cp_unevaluated_operand
;
12462 --c_inhibit_evaluation_warnings
;
12464 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12465 type
= lambda_capture_field_type (type
,
12466 DECLTYPE_FOR_INIT_CAPTURE (t
));
12467 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12468 type
= lambda_proxy_type (type
);
12471 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12472 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12474 /* In a template ~id could be either a complement expression
12475 or an unqualified-id naming a destructor; if instantiating
12476 it produces an expression, it's not an id-expression or
12479 type
= finish_decltype_type (type
, id
, complain
);
12481 return cp_build_qualified_type_real (type
,
12483 | cp_type_quals (type
),
12484 complain
| tf_ignore_bad_quals
);
12487 case UNDERLYING_TYPE
:
12489 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12490 complain
, in_decl
);
12491 return finish_underlying_type (type
);
12494 case TYPE_ARGUMENT_PACK
:
12495 case NONTYPE_ARGUMENT_PACK
:
12497 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12499 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12503 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12505 /* For template nontype argument packs, also substitute into
12507 if (code
== NONTYPE_ARGUMENT_PACK
)
12508 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12527 /* We should use one of the expression tsubsts for these codes. */
12528 gcc_unreachable ();
12531 sorry ("use of %qs in template", get_tree_code_name (code
));
12532 return error_mark_node
;
12536 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12537 type of the expression on the left-hand side of the "." or "->"
12541 tsubst_baselink (tree baselink
, tree object_type
,
12542 tree args
, tsubst_flags_t complain
, tree in_decl
)
12545 tree qualifying_scope
;
12548 tree template_args
= 0;
12549 bool template_id_p
= false;
12550 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12552 /* A baselink indicates a function from a base class. Both the
12553 BASELINK_ACCESS_BINFO and the base class referenced may
12554 indicate bases of the template class, rather than the
12555 instantiated class. In addition, lookups that were not
12556 ambiguous before may be ambiguous now. Therefore, we perform
12557 the lookup again. */
12558 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12559 qualifying_scope
= tsubst (qualifying_scope
, args
,
12560 complain
, in_decl
);
12561 fns
= BASELINK_FUNCTIONS (baselink
);
12562 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12563 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12565 template_id_p
= true;
12566 template_args
= TREE_OPERAND (fns
, 1);
12567 fns
= TREE_OPERAND (fns
, 0);
12569 template_args
= tsubst_template_args (template_args
, args
,
12570 complain
, in_decl
);
12572 name
= DECL_NAME (get_first_fn (fns
));
12573 if (IDENTIFIER_TYPENAME_P (name
))
12574 name
= mangle_conv_op_name_for_type (optype
);
12575 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12577 return error_mark_node
;
12579 /* If lookup found a single function, mark it as used at this
12580 point. (If it lookup found multiple functions the one selected
12581 later by overload resolution will be marked as used at that
12583 if (BASELINK_P (baselink
))
12584 fns
= BASELINK_FUNCTIONS (baselink
);
12585 if (!template_id_p
&& !really_overloaded_fn (fns
))
12586 mark_used (OVL_CURRENT (fns
));
12588 /* Add back the template arguments, if present. */
12589 if (BASELINK_P (baselink
) && template_id_p
)
12590 BASELINK_FUNCTIONS (baselink
)
12591 = build_nt (TEMPLATE_ID_EXPR
,
12592 BASELINK_FUNCTIONS (baselink
),
12594 /* Update the conversion operator type. */
12595 BASELINK_OPTYPE (baselink
) = optype
;
12598 object_type
= current_class_type
;
12601 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12607 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12608 true if the qualified-id will be a postfix-expression in-and-of
12609 itself; false if more of the postfix-expression follows the
12610 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12614 tsubst_qualified_id (tree qualified_id
, tree args
,
12615 tsubst_flags_t complain
, tree in_decl
,
12616 bool done
, bool address_p
)
12622 tree template_args
;
12623 location_t loc
= UNKNOWN_LOCATION
;
12625 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12627 /* Figure out what name to look up. */
12628 name
= TREE_OPERAND (qualified_id
, 1);
12629 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12631 is_template
= true;
12632 loc
= EXPR_LOCATION (name
);
12633 template_args
= TREE_OPERAND (name
, 1);
12635 template_args
= tsubst_template_args (template_args
, args
,
12636 complain
, in_decl
);
12637 name
= TREE_OPERAND (name
, 0);
12641 is_template
= false;
12642 template_args
= NULL_TREE
;
12645 /* Substitute into the qualifying scope. When there are no ARGS, we
12646 are just trying to simplify a non-dependent expression. In that
12647 case the qualifying scope may be dependent, and, in any case,
12648 substituting will not help. */
12649 scope
= TREE_OPERAND (qualified_id
, 0);
12652 scope
= tsubst (scope
, args
, complain
, in_decl
);
12653 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12658 if (dependent_scope_p (scope
))
12661 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12662 return build_qualified_name (NULL_TREE
, scope
, expr
,
12663 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12666 if (!BASELINK_P (name
) && !DECL_P (expr
))
12668 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12670 /* A BIT_NOT_EXPR is used to represent a destructor. */
12671 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12673 error ("qualifying type %qT does not match destructor name ~%qT",
12674 scope
, TREE_OPERAND (expr
, 0));
12675 expr
= error_mark_node
;
12678 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12679 /*is_type_p=*/0, false);
12682 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12683 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12684 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12686 if (complain
& tf_error
)
12688 error ("dependent-name %qE is parsed as a non-type, but "
12689 "instantiation yields a type", qualified_id
);
12690 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12692 return error_mark_node
;
12698 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12700 /* Remember that there was a reference to this entity. */
12704 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12706 if (complain
& tf_error
)
12707 qualified_name_lookup_error (scope
,
12708 TREE_OPERAND (qualified_id
, 1),
12709 expr
, input_location
);
12710 return error_mark_node
;
12714 expr
= lookup_template_function (expr
, template_args
);
12716 if (expr
== error_mark_node
&& complain
& tf_error
)
12717 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12718 expr
, input_location
);
12719 else if (TYPE_P (scope
))
12721 expr
= (adjust_result_of_qualified_name_lookup
12722 (expr
, scope
, current_nonlambda_class_type ()));
12723 expr
= (finish_qualified_id_expr
12724 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12725 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12726 /*template_arg_p=*/false, complain
));
12729 /* Expressions do not generally have reference type. */
12730 if (TREE_CODE (expr
) != SCOPE_REF
12731 /* However, if we're about to form a pointer-to-member, we just
12732 want the referenced member referenced. */
12733 && TREE_CODE (expr
) != OFFSET_REF
)
12734 expr
= convert_from_reference (expr
);
12739 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
12740 initializer, DECL is the substituted VAR_DECL. Other arguments are as
12744 tsubst_init (tree init
, tree decl
, tree args
,
12745 tsubst_flags_t complain
, tree in_decl
)
12750 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
12754 /* If we had an initializer but it
12755 instantiated to nothing,
12756 value-initialize the object. This will
12757 only occur when the initializer was a
12758 pack expansion where the parameter packs
12759 used in that expansion were of length
12761 init
= build_value_init (TREE_TYPE (decl
),
12763 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12764 init
= get_target_expr_sfinae (init
, complain
);
12770 /* Like tsubst, but deals with expressions. This function just replaces
12771 template parms; to finish processing the resultant expression, use
12772 tsubst_copy_and_build or tsubst_expr. */
12775 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12777 enum tree_code code
;
12780 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12783 code
= TREE_CODE (t
);
12788 r
= retrieve_local_specialization (t
);
12790 if (r
== NULL_TREE
)
12792 /* We get here for a use of 'this' in an NSDMI. */
12793 if (DECL_NAME (t
) == this_identifier
12794 && current_function_decl
12795 && DECL_CONSTRUCTOR_P (current_function_decl
))
12796 return current_class_ptr
;
12798 /* This can happen for a parameter name used later in a function
12799 declaration (such as in a late-specified return type). Just
12800 make a dummy decl, since it's only used for its type. */
12801 gcc_assert (cp_unevaluated_operand
!= 0);
12802 r
= tsubst_decl (t
, args
, complain
);
12803 /* Give it the template pattern as its context; its true context
12804 hasn't been instantiated yet and this is good enough for
12806 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12809 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12810 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12819 if (DECL_TEMPLATE_PARM_P (t
))
12820 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12821 /* There is no need to substitute into namespace-scope
12823 if (DECL_NAMESPACE_SCOPE_P (t
))
12825 /* If ARGS is NULL, then T is known to be non-dependent. */
12826 if (args
== NULL_TREE
)
12827 return scalar_constant_value (t
);
12829 /* Unfortunately, we cannot just call lookup_name here.
12832 template <int I> int f() {
12834 struct S { void g() { E e = a; } };
12837 When we instantiate f<7>::S::g(), say, lookup_name is not
12838 clever enough to find f<7>::a. */
12840 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12841 /*entering_scope=*/0);
12843 for (v
= TYPE_VALUES (enum_type
);
12845 v
= TREE_CHAIN (v
))
12846 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12847 return TREE_VALUE (v
);
12849 /* We didn't find the name. That should never happen; if
12850 name-lookup found it during preliminary parsing, we
12851 should find it again here during instantiation. */
12852 gcc_unreachable ();
12857 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12859 /* Check for a local specialization set up by
12860 tsubst_pack_expansion. */
12861 if (tree r
= retrieve_local_specialization (t
))
12863 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12864 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12868 /* When retrieving a capture pack from a generic lambda, remove the
12869 lambda call op's own template argument list from ARGS. Only the
12870 template arguments active for the closure type should be used to
12871 retrieve the pack specialization. */
12872 if (LAMBDA_FUNCTION_P (current_function_decl
)
12873 && (template_class_depth (DECL_CONTEXT (t
))
12874 != TMPL_ARGS_DEPTH (args
)))
12875 args
= strip_innermost_template_args (args
, 1);
12877 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12878 tsubst_decl put in the hash table. */
12879 return retrieve_specialization (t
, args
, 0);
12882 if (DECL_CONTEXT (t
))
12886 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12887 /*entering_scope=*/1);
12888 if (ctx
!= DECL_CONTEXT (t
))
12890 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12893 if (complain
& tf_error
)
12894 error ("using invalid field %qD", t
);
12895 return error_mark_node
;
12904 case FUNCTION_DECL
:
12905 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12906 r
= tsubst (t
, args
, complain
, in_decl
);
12907 else if (local_variable_p (t
))
12909 r
= retrieve_local_specialization (t
);
12910 if (r
== NULL_TREE
)
12912 /* First try name lookup to find the instantiation. */
12913 r
= lookup_name (DECL_NAME (t
));
12916 /* Make sure that the one we found is the one we want. */
12917 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
12918 complain
, in_decl
);
12919 if (ctx
!= DECL_CONTEXT (r
))
12927 /* This can happen for a variable used in a
12928 late-specified return type of a local lambda, or for a
12929 local static or constant. Building a new VAR_DECL
12930 should be OK in all those cases. */
12931 r
= tsubst_decl (t
, args
, complain
);
12932 if (decl_maybe_constant_var_p (r
))
12934 /* We can't call cp_finish_decl, so handle the
12935 initializer by hand. */
12936 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
12937 complain
, in_decl
);
12938 if (!processing_template_decl
)
12939 init
= maybe_constant_init (init
);
12940 if (processing_template_decl
12941 ? potential_constant_expression (init
)
12942 : reduced_constant_expression_p (init
))
12943 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
12944 = TREE_CONSTANT (r
) = true;
12945 DECL_INITIAL (r
) = init
;
12947 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
12948 || decl_constant_var_p (r
)
12949 || errorcount
|| sorrycount
);
12950 if (!processing_template_decl
)
12952 if (TREE_STATIC (r
))
12953 rest_of_decl_compilation (r
, toplevel_bindings_p (),
12955 else if (decl_constant_var_p (r
))
12956 /* A use of a local constant decays to its value.
12957 FIXME update for core DR 696. */
12958 r
= scalar_constant_value (r
);
12961 /* Remember this for subsequent uses. */
12962 if (local_specializations
)
12963 register_local_specialization (r
, t
);
12971 case NAMESPACE_DECL
:
12975 /* An OVERLOAD will always be a non-dependent overload set; an
12976 overload set from function scope will just be represented with an
12977 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12978 gcc_assert (!uses_template_parms (t
));
12982 return tsubst_baselink (t
, current_nonlambda_class_type (),
12983 args
, complain
, in_decl
);
12985 case TEMPLATE_DECL
:
12986 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12987 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12988 args
, complain
, in_decl
);
12989 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12990 return tsubst (t
, args
, complain
, in_decl
);
12991 else if (DECL_CLASS_SCOPE_P (t
)
12992 && uses_template_parms (DECL_CONTEXT (t
)))
12994 /* Template template argument like the following example need
12997 template <template <class> class TT> struct C {};
12998 template <class T> struct D {
12999 template <class U> struct E {};
13004 We are processing the template argument `E' in #1 for
13005 the template instantiation #2. Originally, `E' is a
13006 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13007 have to substitute this with one having context `D<int>'. */
13009 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13010 return lookup_field (context
, DECL_NAME(t
), 0, false);
13013 /* Ordinary template template argument. */
13017 case REINTERPRET_CAST_EXPR
:
13018 case CONST_CAST_EXPR
:
13019 case STATIC_CAST_EXPR
:
13020 case DYNAMIC_CAST_EXPR
:
13021 case IMPLICIT_CONV_EXPR
:
13025 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13026 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13027 return build1 (code
, type
, op0
);
13031 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13034 tree expanded
, op
= TREE_OPERAND (t
, 0);
13037 if (SIZEOF_EXPR_TYPE_P (t
))
13038 op
= TREE_TYPE (op
);
13040 ++cp_unevaluated_operand
;
13041 ++c_inhibit_evaluation_warnings
;
13042 /* We only want to compute the number of arguments. */
13043 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13044 --cp_unevaluated_operand
;
13045 --c_inhibit_evaluation_warnings
;
13047 if (TREE_CODE (expanded
) == TREE_VEC
)
13048 len
= TREE_VEC_LENGTH (expanded
);
13050 if (expanded
== error_mark_node
)
13051 return error_mark_node
;
13052 else if (PACK_EXPANSION_P (expanded
)
13053 || (TREE_CODE (expanded
) == TREE_VEC
13055 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13057 if (TREE_CODE (expanded
) == TREE_VEC
)
13058 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13060 if (TYPE_P (expanded
))
13061 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13062 complain
& tf_error
);
13064 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13065 complain
& tf_error
);
13068 return build_int_cst (size_type_node
, len
);
13070 if (SIZEOF_EXPR_TYPE_P (t
))
13072 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13073 args
, complain
, in_decl
);
13074 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13075 r
= build1 (SIZEOF_EXPR
,
13076 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13077 SIZEOF_EXPR_TYPE_P (r
) = 1;
13084 case TRUTH_NOT_EXPR
:
13087 case UNARY_PLUS_EXPR
: /* Unary + */
13089 case AT_ENCODE_EXPR
:
13093 case REALPART_EXPR
:
13094 case IMAGPART_EXPR
:
13097 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13098 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13099 return build1 (code
, type
, op0
);
13102 case COMPONENT_REF
:
13107 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13108 name
= TREE_OPERAND (t
, 1);
13109 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13111 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13112 complain
, in_decl
);
13113 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13115 else if (TREE_CODE (name
) == SCOPE_REF
13116 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13118 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13119 complain
, in_decl
);
13120 name
= TREE_OPERAND (name
, 1);
13121 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13122 complain
, in_decl
);
13123 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13124 name
= build_qualified_name (/*type=*/NULL_TREE
,
13126 /*template_p=*/false);
13128 else if (BASELINK_P (name
))
13129 name
= tsubst_baselink (name
,
13130 non_reference (TREE_TYPE (object
)),
13134 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13135 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13141 case TRUNC_DIV_EXPR
:
13142 case CEIL_DIV_EXPR
:
13143 case FLOOR_DIV_EXPR
:
13144 case ROUND_DIV_EXPR
:
13145 case EXACT_DIV_EXPR
:
13149 case TRUNC_MOD_EXPR
:
13150 case FLOOR_MOD_EXPR
:
13151 case TRUTH_ANDIF_EXPR
:
13152 case TRUTH_ORIF_EXPR
:
13153 case TRUTH_AND_EXPR
:
13154 case TRUTH_OR_EXPR
:
13167 case COMPOUND_EXPR
:
13170 case PREDECREMENT_EXPR
:
13171 case PREINCREMENT_EXPR
:
13172 case POSTDECREMENT_EXPR
:
13173 case POSTINCREMENT_EXPR
:
13175 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13176 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13177 return build_nt (code
, op0
, op1
);
13182 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13183 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13184 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13185 QUALIFIED_NAME_IS_TEMPLATE (t
));
13190 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13191 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13192 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13197 int n
= VL_EXP_OPERAND_LENGTH (t
);
13198 tree result
= build_vl_exp (CALL_EXPR
, n
);
13200 for (i
= 0; i
< n
; i
++)
13201 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13202 complain
, in_decl
);
13208 case PSEUDO_DTOR_EXPR
:
13209 case VEC_PERM_EXPR
:
13211 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13212 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13213 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13214 r
= build_nt (code
, op0
, op1
, op2
);
13215 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13221 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13222 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13223 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13224 r
= build_nt (code
, op0
, op1
, op2
);
13225 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13231 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13232 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13233 r
= build_nt (code
, op0
, op1
);
13234 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13235 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13239 case TEMPLATE_ID_EXPR
:
13241 /* Substituted template arguments */
13242 tree fn
= TREE_OPERAND (t
, 0);
13243 tree targs
= TREE_OPERAND (t
, 1);
13245 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13247 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13249 return lookup_template_function (fn
, targs
);
13254 tree purpose
, value
, chain
;
13256 if (t
== void_list_node
)
13259 purpose
= TREE_PURPOSE (t
);
13261 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13262 value
= TREE_VALUE (t
);
13264 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13265 chain
= TREE_CHAIN (t
);
13266 if (chain
&& chain
!= void_type_node
)
13267 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13268 if (purpose
== TREE_PURPOSE (t
)
13269 && value
== TREE_VALUE (t
)
13270 && chain
== TREE_CHAIN (t
))
13272 return tree_cons (purpose
, value
, chain
);
13277 case ENUMERAL_TYPE
:
13279 case TEMPLATE_TYPE_PARM
:
13280 case TEMPLATE_TEMPLATE_PARM
:
13281 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13282 case TEMPLATE_PARM_INDEX
:
13284 case REFERENCE_TYPE
:
13286 case FUNCTION_TYPE
:
13289 case TYPENAME_TYPE
:
13290 case UNBOUND_CLASS_TEMPLATE
:
13292 case DECLTYPE_TYPE
:
13294 return tsubst (t
, args
, complain
, in_decl
);
13298 /* Fall through. */
13299 case IDENTIFIER_NODE
:
13300 if (IDENTIFIER_TYPENAME_P (t
))
13302 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13303 return mangle_conv_op_name_for_type (new_type
);
13309 /* This is handled by tsubst_copy_and_build. */
13310 gcc_unreachable ();
13314 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13315 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13316 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13319 case CLEANUP_POINT_EXPR
:
13320 /* We shouldn't have built any of these during initial template
13321 generation. Instead, they should be built during instantiation
13322 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13323 gcc_unreachable ();
13327 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13328 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13329 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13330 r
= build2 (code
, type
, op0
, op1
);
13331 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13332 mark_used (TREE_OPERAND (r
, 1));
13336 case EXPR_PACK_EXPANSION
:
13337 error ("invalid use of pack expansion expression");
13338 return error_mark_node
;
13340 case NONTYPE_ARGUMENT_PACK
:
13341 error ("use %<...%> to expand argument pack");
13342 return error_mark_node
;
13345 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
13353 /* Instantiate any typedefs in the type. */
13354 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13355 r
= fold_convert (type
, t
);
13356 gcc_assert (TREE_CODE (r
) == code
);
13361 /* These can sometimes show up in a partial instantiation, but never
13362 involve template parms. */
13363 gcc_assert (!uses_template_parms (t
));
13367 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13368 gcc_checking_assert (false);
13373 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13376 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13377 tree args
, tsubst_flags_t complain
, tree in_decl
)
13379 tree new_clauses
= NULL
, nc
, oc
;
13381 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13383 nc
= copy_node (oc
);
13384 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13387 switch (OMP_CLAUSE_CODE (nc
))
13389 case OMP_CLAUSE_LASTPRIVATE
:
13390 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13392 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13393 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13394 in_decl
, /*integral_constant_expression_p=*/false);
13395 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13396 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13399 case OMP_CLAUSE_PRIVATE
:
13400 case OMP_CLAUSE_SHARED
:
13401 case OMP_CLAUSE_FIRSTPRIVATE
:
13402 case OMP_CLAUSE_COPYIN
:
13403 case OMP_CLAUSE_COPYPRIVATE
:
13404 case OMP_CLAUSE_IF
:
13405 case OMP_CLAUSE_NUM_THREADS
:
13406 case OMP_CLAUSE_SCHEDULE
:
13407 case OMP_CLAUSE_COLLAPSE
:
13408 case OMP_CLAUSE_FINAL
:
13409 case OMP_CLAUSE_DEPEND
:
13410 case OMP_CLAUSE_FROM
:
13411 case OMP_CLAUSE_TO
:
13412 case OMP_CLAUSE_UNIFORM
:
13413 case OMP_CLAUSE_MAP
:
13414 case OMP_CLAUSE_DEVICE
:
13415 case OMP_CLAUSE_DIST_SCHEDULE
:
13416 case OMP_CLAUSE_NUM_TEAMS
:
13417 case OMP_CLAUSE_THREAD_LIMIT
:
13418 case OMP_CLAUSE_SAFELEN
:
13419 case OMP_CLAUSE_SIMDLEN
:
13420 OMP_CLAUSE_OPERAND (nc
, 0)
13421 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13422 in_decl
, /*integral_constant_expression_p=*/false);
13424 case OMP_CLAUSE_REDUCTION
:
13425 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13427 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13428 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13430 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13431 complain
, in_decl
);
13432 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13433 = build_qualified_name (NULL_TREE
, scope
,
13434 TREE_OPERAND (placeholder
, 1),
13438 gcc_assert (identifier_p (placeholder
));
13440 OMP_CLAUSE_OPERAND (nc
, 0)
13441 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13442 in_decl
, /*integral_constant_expression_p=*/false);
13444 case OMP_CLAUSE_LINEAR
:
13445 case OMP_CLAUSE_ALIGNED
:
13446 OMP_CLAUSE_OPERAND (nc
, 0)
13447 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13448 in_decl
, /*integral_constant_expression_p=*/false);
13449 OMP_CLAUSE_OPERAND (nc
, 1)
13450 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13451 in_decl
, /*integral_constant_expression_p=*/false);
13454 case OMP_CLAUSE_NOWAIT
:
13455 case OMP_CLAUSE_ORDERED
:
13456 case OMP_CLAUSE_DEFAULT
:
13457 case OMP_CLAUSE_UNTIED
:
13458 case OMP_CLAUSE_MERGEABLE
:
13459 case OMP_CLAUSE_INBRANCH
:
13460 case OMP_CLAUSE_NOTINBRANCH
:
13461 case OMP_CLAUSE_PROC_BIND
:
13462 case OMP_CLAUSE_FOR
:
13463 case OMP_CLAUSE_PARALLEL
:
13464 case OMP_CLAUSE_SECTIONS
:
13465 case OMP_CLAUSE_TASKGROUP
:
13468 gcc_unreachable ();
13472 new_clauses
= nreverse (new_clauses
);
13474 new_clauses
= finish_omp_clauses (new_clauses
);
13475 return new_clauses
;
13478 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13481 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13484 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13486 tree purpose
, value
, chain
;
13491 if (TREE_CODE (t
) != TREE_LIST
)
13492 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13493 /*function_p=*/false,
13494 /*integral_constant_expression_p=*/false);
13496 if (t
== void_list_node
)
13499 purpose
= TREE_PURPOSE (t
);
13501 purpose
= RECUR (purpose
);
13502 value
= TREE_VALUE (t
);
13505 if (TREE_CODE (value
) != LABEL_DECL
)
13506 value
= RECUR (value
);
13509 value
= lookup_label (DECL_NAME (value
));
13510 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13511 TREE_USED (value
) = 1;
13514 chain
= TREE_CHAIN (t
);
13515 if (chain
&& chain
!= void_type_node
)
13516 chain
= RECUR (chain
);
13517 return tree_cons (purpose
, value
, chain
);
13521 /* Substitute one OMP_FOR iterator. */
13524 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13525 tree condv
, tree incrv
, tree
*clauses
,
13526 tree args
, tsubst_flags_t complain
, tree in_decl
,
13527 bool integral_constant_expression_p
)
13529 #define RECUR(NODE) \
13530 tsubst_expr ((NODE), args, complain, in_decl, \
13531 integral_constant_expression_p)
13532 tree decl
, init
, cond
, incr
;
13534 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13535 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13536 decl
= TREE_OPERAND (init
, 0);
13537 init
= TREE_OPERAND (init
, 1);
13538 tree decl_expr
= NULL_TREE
;
13539 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13541 /* We need to jump through some hoops to handle declarations in the
13542 for-init-statement, since we might need to handle auto deduction,
13543 but we need to keep control of initialization. */
13545 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13546 decl
= tsubst_decl (decl
, args
, complain
);
13549 decl
= RECUR (decl
);
13550 init
= RECUR (init
);
13552 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13553 if (auto_node
&& init
)
13555 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13557 gcc_assert (!type_dependent_expression_p (decl
));
13559 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13563 /* Declare the variable, but don't let that initialize it. */
13564 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13565 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13567 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13570 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13571 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13572 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13574 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13575 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
13576 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
13577 NOP_EXPR
, rhs
, complain
);
13580 incr
= RECUR (incr
);
13581 TREE_VEC_ELT (declv
, i
) = decl
;
13582 TREE_VEC_ELT (initv
, i
) = init
;
13583 TREE_VEC_ELT (condv
, i
) = cond
;
13584 TREE_VEC_ELT (incrv
, i
) = incr
;
13590 /* Declare and initialize the variable. */
13597 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13599 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13600 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13601 && OMP_CLAUSE_DECL (c
) == decl
)
13603 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13604 && OMP_CLAUSE_DECL (c
) == decl
)
13605 error ("iteration variable %qD should not be firstprivate", decl
);
13606 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13607 && OMP_CLAUSE_DECL (c
) == decl
)
13608 error ("iteration variable %qD should not be reduction", decl
);
13612 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13613 OMP_CLAUSE_DECL (c
) = decl
;
13614 c
= finish_omp_clauses (c
);
13617 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13622 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13623 if (COMPARISON_CLASS_P (cond
))
13625 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
13626 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
13627 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
13630 cond
= RECUR (cond
);
13631 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13632 switch (TREE_CODE (incr
))
13634 case PREINCREMENT_EXPR
:
13635 case PREDECREMENT_EXPR
:
13636 case POSTINCREMENT_EXPR
:
13637 case POSTDECREMENT_EXPR
:
13638 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13639 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13642 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13643 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13645 tree rhs
= TREE_OPERAND (incr
, 1);
13646 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13647 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13648 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13649 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13650 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13654 incr
= RECUR (incr
);
13657 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13658 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13660 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13661 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13662 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13663 TREE_TYPE (decl
), lhs
,
13664 RECUR (TREE_OPERAND (incr
, 2))));
13666 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13667 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13668 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13670 tree rhs
= TREE_OPERAND (incr
, 2);
13671 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13672 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13673 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13674 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13675 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13679 incr
= RECUR (incr
);
13682 incr
= RECUR (incr
);
13686 TREE_VEC_ELT (declv
, i
) = decl
;
13687 TREE_VEC_ELT (initv
, i
) = init
;
13688 TREE_VEC_ELT (condv
, i
) = cond
;
13689 TREE_VEC_ELT (incrv
, i
) = incr
;
13693 /* Like tsubst_copy for expressions, etc. but also does semantic
13697 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13698 bool integral_constant_expression_p
)
13700 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13701 #define RECUR(NODE) \
13702 tsubst_expr ((NODE), args, complain, in_decl, \
13703 integral_constant_expression_p)
13709 if (t
== NULL_TREE
|| t
== error_mark_node
)
13712 loc
= input_location
;
13713 if (EXPR_HAS_LOCATION (t
))
13714 input_location
= EXPR_LOCATION (t
);
13715 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13716 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13718 switch (TREE_CODE (t
))
13720 case STATEMENT_LIST
:
13722 tree_stmt_iterator i
;
13723 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13724 RECUR (tsi_stmt (i
));
13728 case CTOR_INITIALIZER
:
13729 finish_mem_initializers (tsubst_initializer_list
13730 (TREE_OPERAND (t
, 0), args
));
13734 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13738 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13739 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13740 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13742 finish_expr_stmt (tmp
);
13746 do_using_directive (USING_STMT_NAMESPACE (t
));
13751 tree decl
, pattern_decl
;
13754 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13755 if (TREE_CODE (decl
) == LABEL_DECL
)
13756 finish_label_decl (DECL_NAME (decl
));
13757 else if (TREE_CODE (decl
) == USING_DECL
)
13759 tree scope
= USING_DECL_SCOPE (decl
);
13760 tree name
= DECL_NAME (decl
);
13763 scope
= tsubst (scope
, args
, complain
, in_decl
);
13764 decl
= lookup_qualified_name (scope
, name
,
13765 /*is_type_p=*/false,
13766 /*complain=*/false);
13767 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13768 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13770 do_local_using_decl (decl
, scope
, name
);
13772 else if (DECL_PACK_P (decl
))
13774 /* Don't build up decls for a variadic capture proxy, we'll
13775 instantiate the elements directly as needed. */
13780 init
= DECL_INITIAL (decl
);
13781 decl
= tsubst (decl
, args
, complain
, in_decl
);
13782 if (decl
!= error_mark_node
)
13784 /* By marking the declaration as instantiated, we avoid
13785 trying to instantiate it. Since instantiate_decl can't
13786 handle local variables, and since we've already done
13787 all that needs to be done, that's the right thing to
13790 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13792 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13793 /* Anonymous aggregates are a special case. */
13794 finish_anon_union (decl
);
13795 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13797 DECL_CONTEXT (decl
) = current_function_decl
;
13798 if (DECL_NAME (decl
) == this_identifier
)
13800 tree lam
= DECL_CONTEXT (current_function_decl
);
13801 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13802 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13804 insert_capture_proxy (decl
);
13806 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13807 /* We already did a pushtag. */;
13808 else if (TREE_CODE (decl
) == FUNCTION_DECL
13809 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
13810 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
13812 DECL_CONTEXT (decl
) = NULL_TREE
;
13814 DECL_CONTEXT (decl
) = current_function_decl
;
13815 cp_check_omp_declare_reduction (decl
);
13819 int const_init
= false;
13820 maybe_push_decl (decl
);
13822 && DECL_PRETTY_FUNCTION_P (decl
))
13824 /* For __PRETTY_FUNCTION__ we have to adjust the
13826 const char *const name
13827 = cxx_printable_name (current_function_decl
, 2);
13828 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
13831 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
13834 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13836 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13845 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13846 RECUR (FOR_INIT_STMT (t
));
13847 finish_for_init_stmt (stmt
);
13848 tmp
= RECUR (FOR_COND (t
));
13849 finish_for_cond (tmp
, stmt
, false);
13850 tmp
= RECUR (FOR_EXPR (t
));
13851 finish_for_expr (tmp
, stmt
);
13852 RECUR (FOR_BODY (t
));
13853 finish_for_stmt (stmt
);
13856 case RANGE_FOR_STMT
:
13859 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13860 decl
= RANGE_FOR_DECL (t
);
13861 decl
= tsubst (decl
, args
, complain
, in_decl
);
13862 maybe_push_decl (decl
);
13863 expr
= RECUR (RANGE_FOR_EXPR (t
));
13864 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
13865 RECUR (RANGE_FOR_BODY (t
));
13866 finish_for_stmt (stmt
);
13871 stmt
= begin_while_stmt ();
13872 tmp
= RECUR (WHILE_COND (t
));
13873 finish_while_stmt_cond (tmp
, stmt
, false);
13874 RECUR (WHILE_BODY (t
));
13875 finish_while_stmt (stmt
);
13879 stmt
= begin_do_stmt ();
13880 RECUR (DO_BODY (t
));
13881 finish_do_body (stmt
);
13882 tmp
= RECUR (DO_COND (t
));
13883 finish_do_stmt (tmp
, stmt
, false);
13887 stmt
= begin_if_stmt ();
13888 tmp
= RECUR (IF_COND (t
));
13889 finish_if_stmt_cond (tmp
, stmt
);
13890 RECUR (THEN_CLAUSE (t
));
13891 finish_then_clause (stmt
);
13893 if (ELSE_CLAUSE (t
))
13895 begin_else_clause (stmt
);
13896 RECUR (ELSE_CLAUSE (t
));
13897 finish_else_clause (stmt
);
13900 finish_if_stmt (stmt
);
13904 if (BIND_EXPR_BODY_BLOCK (t
))
13905 stmt
= begin_function_body ();
13907 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13908 ? BCS_TRY_BLOCK
: 0);
13910 RECUR (BIND_EXPR_BODY (t
));
13912 if (BIND_EXPR_BODY_BLOCK (t
))
13913 finish_function_body (stmt
);
13915 finish_compound_stmt (stmt
);
13919 finish_break_stmt ();
13922 case CONTINUE_STMT
:
13923 finish_continue_stmt ();
13927 stmt
= begin_switch_stmt ();
13928 tmp
= RECUR (SWITCH_STMT_COND (t
));
13929 finish_switch_cond (tmp
, stmt
);
13930 RECUR (SWITCH_STMT_BODY (t
));
13931 finish_switch_stmt (stmt
);
13934 case CASE_LABEL_EXPR
:
13936 tree low
= RECUR (CASE_LOW (t
));
13937 tree high
= RECUR (CASE_HIGH (t
));
13938 finish_case_label (EXPR_LOCATION (t
), low
, high
);
13944 tree decl
= LABEL_EXPR_LABEL (t
);
13947 label
= finish_label_stmt (DECL_NAME (decl
));
13948 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13949 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13954 tmp
= GOTO_DESTINATION (t
);
13955 if (TREE_CODE (tmp
) != LABEL_DECL
)
13956 /* Computed goto's must be tsubst'd into. On the other hand,
13957 non-computed gotos must not be; the identifier in question
13958 will have no binding. */
13961 tmp
= DECL_NAME (tmp
);
13962 finish_goto_stmt (tmp
);
13967 tree string
= RECUR (ASM_STRING (t
));
13968 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
13969 complain
, in_decl
);
13970 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
13971 complain
, in_decl
);
13972 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
13973 complain
, in_decl
);
13974 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
13975 complain
, in_decl
);
13976 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
13978 tree asm_expr
= tmp
;
13979 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13980 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13981 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13988 stmt
= begin_try_block ();
13989 RECUR (TRY_STMTS (t
));
13990 finish_cleanup_try_block (stmt
);
13991 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13995 tree compound_stmt
= NULL_TREE
;
13997 if (FN_TRY_BLOCK_P (t
))
13998 stmt
= begin_function_try_block (&compound_stmt
);
14000 stmt
= begin_try_block ();
14002 RECUR (TRY_STMTS (t
));
14004 if (FN_TRY_BLOCK_P (t
))
14005 finish_function_try_block (stmt
);
14007 finish_try_block (stmt
);
14009 RECUR (TRY_HANDLERS (t
));
14010 if (FN_TRY_BLOCK_P (t
))
14011 finish_function_handler_sequence (stmt
, compound_stmt
);
14013 finish_handler_sequence (stmt
);
14019 tree decl
= HANDLER_PARMS (t
);
14023 decl
= tsubst (decl
, args
, complain
, in_decl
);
14024 /* Prevent instantiate_decl from trying to instantiate
14025 this variable. We've already done all that needs to be
14027 if (decl
!= error_mark_node
)
14028 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14030 stmt
= begin_handler ();
14031 finish_handler_parms (decl
, stmt
);
14032 RECUR (HANDLER_BODY (t
));
14033 finish_handler (stmt
);
14038 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
14039 if (CLASS_TYPE_P (tmp
))
14041 /* Local classes are not independent templates; they are
14042 instantiated along with their containing function. And this
14043 way we don't have to deal with pushing out of one local class
14044 to instantiate a member of another local class. */
14046 /* Closures are handled by the LAMBDA_EXPR. */
14047 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
14048 complete_type (tmp
);
14049 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
14050 if (!DECL_ARTIFICIAL (fn
))
14051 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
14055 case STATIC_ASSERT
:
14059 ++c_inhibit_evaluation_warnings
;
14061 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
14064 /*integral_constant_expression_p=*/true);
14065 --c_inhibit_evaluation_warnings
;
14067 finish_static_assert (condition
,
14068 STATIC_ASSERT_MESSAGE (t
),
14069 STATIC_ASSERT_SOURCE_LOCATION (t
),
14070 /*member_p=*/false);
14075 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
14076 args
, complain
, in_decl
);
14077 stmt
= begin_omp_parallel ();
14078 RECUR (OMP_PARALLEL_BODY (t
));
14079 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
14080 = OMP_PARALLEL_COMBINED (t
);
14084 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
14085 args
, complain
, in_decl
);
14086 stmt
= begin_omp_task ();
14087 RECUR (OMP_TASK_BODY (t
));
14088 finish_omp_task (tmp
, stmt
);
14095 case OMP_DISTRIBUTE
:
14097 tree clauses
, body
, pre_body
;
14098 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
14099 tree incrv
= NULL_TREE
;
14102 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
14103 args
, complain
, in_decl
);
14104 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14106 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14107 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14108 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14109 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14112 stmt
= begin_omp_structured_block ();
14114 pre_body
= push_stmt_list ();
14115 RECUR (OMP_FOR_PRE_BODY (t
));
14116 pre_body
= pop_stmt_list (pre_body
);
14118 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14119 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14120 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14121 &clauses
, args
, complain
, in_decl
,
14122 integral_constant_expression_p
);
14124 body
= push_stmt_list ();
14125 RECUR (OMP_FOR_BODY (t
));
14126 body
= pop_stmt_list (body
);
14128 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14129 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14130 condv
, incrv
, body
, pre_body
, clauses
);
14133 t
= make_node (TREE_CODE (t
));
14134 TREE_TYPE (t
) = void_type_node
;
14135 OMP_FOR_BODY (t
) = body
;
14136 OMP_FOR_PRE_BODY (t
) = pre_body
;
14137 OMP_FOR_CLAUSES (t
) = clauses
;
14138 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14142 add_stmt (finish_omp_structured_block (stmt
));
14149 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14150 args
, complain
, in_decl
);
14151 stmt
= push_stmt_list ();
14152 RECUR (OMP_BODY (t
));
14153 stmt
= pop_stmt_list (stmt
);
14156 OMP_BODY (t
) = stmt
;
14157 OMP_CLAUSES (t
) = tmp
;
14161 case OMP_TARGET_DATA
:
14163 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14164 args
, complain
, in_decl
);
14165 keep_next_level (true);
14166 stmt
= begin_omp_structured_block ();
14168 RECUR (OMP_BODY (t
));
14169 stmt
= finish_omp_structured_block (stmt
);
14172 OMP_BODY (t
) = stmt
;
14173 OMP_CLAUSES (t
) = tmp
;
14177 case OMP_TARGET_UPDATE
:
14178 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14179 args
, complain
, in_decl
);
14181 OMP_CLAUSES (t
) = tmp
;
14188 case OMP_TASKGROUP
:
14190 stmt
= push_stmt_list ();
14191 RECUR (OMP_BODY (t
));
14192 stmt
= pop_stmt_list (stmt
);
14195 OMP_BODY (t
) = stmt
;
14200 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14201 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14203 tree op1
= TREE_OPERAND (t
, 1);
14204 tree rhs1
= NULL_TREE
;
14206 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14208 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14209 op1
= TREE_OPERAND (op1
, 1);
14211 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14212 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14213 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14214 NULL_TREE
, NULL_TREE
, rhs1
,
14215 OMP_ATOMIC_SEQ_CST (t
));
14219 tree op1
= TREE_OPERAND (t
, 1);
14220 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14221 tree rhs1
= NULL_TREE
;
14222 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14223 enum tree_code opcode
= NOP_EXPR
;
14224 if (code
== OMP_ATOMIC_READ
)
14226 v
= RECUR (TREE_OPERAND (op1
, 0));
14227 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14229 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14230 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14232 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14233 v
= RECUR (TREE_OPERAND (op1
, 0));
14234 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14235 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14237 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14238 op11
= TREE_OPERAND (op11
, 1);
14240 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14241 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14242 opcode
= TREE_CODE (op11
);
14243 if (opcode
== MODIFY_EXPR
)
14249 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14250 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14252 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14253 OMP_ATOMIC_SEQ_CST (t
));
14257 case TRANSACTION_EXPR
:
14260 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14261 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14263 if (TRANSACTION_EXPR_IS_STMT (t
))
14265 tree body
= TRANSACTION_EXPR_BODY (t
);
14266 tree noex
= NULL_TREE
;
14267 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14269 noex
= MUST_NOT_THROW_COND (body
);
14270 if (noex
== NULL_TREE
)
14271 noex
= boolean_true_node
;
14272 body
= TREE_OPERAND (body
, 0);
14274 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14276 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14280 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14281 RECUR (TRANSACTION_EXPR_BODY (t
)),
14288 case MUST_NOT_THROW_EXPR
:
14290 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14291 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14292 RETURN (build_must_not_throw_expr (op0
, cond
));
14295 case EXPR_PACK_EXPANSION
:
14296 error ("invalid use of pack expansion expression");
14297 RETURN (error_mark_node
);
14299 case NONTYPE_ARGUMENT_PACK
:
14300 error ("use %<...%> to expand argument pack");
14301 RETURN (error_mark_node
);
14303 case CILK_SPAWN_STMT
:
14304 cfun
->calls_cilk_spawn
= 1;
14305 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
14307 case CILK_SYNC_STMT
:
14308 RETURN (build_cilk_sync ());
14310 case COMPOUND_EXPR
:
14311 tmp
= RECUR (TREE_OPERAND (t
, 0));
14312 if (tmp
== NULL_TREE
)
14313 /* If the first operand was a statement, we're done with it. */
14314 RETURN (RECUR (TREE_OPERAND (t
, 1)));
14315 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
14316 RECUR (TREE_OPERAND (t
, 1)),
14319 case ANNOTATE_EXPR
:
14320 tmp
= RECUR (TREE_OPERAND (t
, 0));
14321 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
14322 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
14325 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
14327 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14328 /*function_p=*/false,
14329 integral_constant_expression_p
));
14332 RETURN (NULL_TREE
);
14334 input_location
= loc
;
14340 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14341 function. For description of the body see comment above
14342 cp_parser_omp_declare_reduction_exprs. */
14345 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14347 if (t
== NULL_TREE
|| t
== error_mark_node
)
14350 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14352 tree_stmt_iterator tsi
;
14355 memset (stmts
, 0, sizeof stmts
);
14356 for (i
= 0, tsi
= tsi_start (t
);
14357 i
< 7 && !tsi_end_p (tsi
);
14358 i
++, tsi_next (&tsi
))
14359 stmts
[i
] = tsi_stmt (tsi
);
14360 gcc_assert (tsi_end_p (tsi
));
14364 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14365 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14366 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14367 args
, complain
, in_decl
);
14368 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14369 args
, complain
, in_decl
);
14370 DECL_CONTEXT (omp_out
) = current_function_decl
;
14371 DECL_CONTEXT (omp_in
) = current_function_decl
;
14372 keep_next_level (true);
14373 tree block
= begin_omp_structured_block ();
14374 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14375 block
= finish_omp_structured_block (block
);
14376 block
= maybe_cleanup_point_expr_void (block
);
14377 add_decl_expr (omp_out
);
14378 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14379 TREE_NO_WARNING (omp_out
) = 1;
14380 add_decl_expr (omp_in
);
14381 finish_expr_stmt (block
);
14385 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14386 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14387 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14388 args
, complain
, in_decl
);
14389 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14390 args
, complain
, in_decl
);
14391 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14392 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14393 keep_next_level (true);
14394 tree block
= begin_omp_structured_block ();
14395 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14396 block
= finish_omp_structured_block (block
);
14397 block
= maybe_cleanup_point_expr_void (block
);
14398 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14399 add_decl_expr (omp_priv
);
14400 add_decl_expr (omp_orig
);
14401 finish_expr_stmt (block
);
14403 add_decl_expr (omp_orig
);
14407 /* T is a postfix-expression that is not being used in a function
14408 call. Return the substituted version of T. */
14411 tsubst_non_call_postfix_expression (tree t
, tree args
,
14412 tsubst_flags_t complain
,
14415 if (TREE_CODE (t
) == SCOPE_REF
)
14416 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14417 /*done=*/false, /*address_p=*/false);
14419 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14420 /*function_p=*/false,
14421 /*integral_constant_expression_p=*/false);
14426 /* Sentinel to disable certain warnings during template substitution. */
14428 struct warning_sentinel
{
14431 warning_sentinel(int& flag
, bool suppress
=true)
14432 : flag(flag
), val(flag
) { if (suppress
) flag
= 0; }
14433 ~warning_sentinel() { flag
= val
; }
14436 /* Like tsubst but deals with expressions and performs semantic
14437 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14440 tsubst_copy_and_build (tree t
,
14442 tsubst_flags_t complain
,
14445 bool integral_constant_expression_p
)
14447 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14448 #define RECUR(NODE) \
14449 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14450 /*function_p=*/false, \
14451 integral_constant_expression_p)
14456 if (t
== NULL_TREE
|| t
== error_mark_node
)
14459 loc
= input_location
;
14460 if (EXPR_HAS_LOCATION (t
))
14461 input_location
= EXPR_LOCATION (t
);
14463 /* N3276 decltype magic only applies to calls at the top level or on the
14464 right side of a comma. */
14465 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14466 complain
&= ~tf_decltype
;
14468 switch (TREE_CODE (t
))
14472 /* Fall through. */
14473 case IDENTIFIER_NODE
:
14477 bool non_integral_constant_expression_p
;
14478 const char *error_msg
;
14480 if (IDENTIFIER_TYPENAME_P (t
))
14482 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14483 t
= mangle_conv_op_name_for_type (new_type
);
14486 /* Look up the name. */
14487 decl
= lookup_name (t
);
14489 /* By convention, expressions use ERROR_MARK_NODE to indicate
14490 failure, not NULL_TREE. */
14491 if (decl
== NULL_TREE
)
14492 decl
= error_mark_node
;
14494 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14496 integral_constant_expression_p
,
14497 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14498 &non_integral_constant_expression_p
,
14499 /*template_p=*/false,
14501 /*address_p=*/false,
14502 /*template_arg_p=*/false,
14507 if (!function_p
&& identifier_p (decl
))
14509 if (complain
& tf_error
)
14510 unqualified_name_lookup_error (decl
);
14511 decl
= error_mark_node
;
14516 case TEMPLATE_ID_EXPR
:
14519 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14520 tree targs
= TREE_OPERAND (t
, 1);
14523 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14525 if (TREE_CODE (templ
) == COMPONENT_REF
)
14527 object
= TREE_OPERAND (templ
, 0);
14528 templ
= TREE_OPERAND (templ
, 1);
14531 object
= NULL_TREE
;
14532 templ
= lookup_template_function (templ
, targs
);
14535 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14536 object
, templ
, NULL_TREE
));
14538 RETURN (baselink_for_fns (templ
));
14543 tree r
= RECUR (TREE_OPERAND (t
, 0));
14545 if (REFERENCE_REF_P (t
))
14547 /* A type conversion to reference type will be enclosed in
14548 such an indirect ref, but the substitution of the cast
14549 will have also added such an indirect ref. */
14550 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14551 r
= convert_from_reference (r
);
14554 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14555 complain
|decltype_flag
);
14561 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14562 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14563 RETURN (build_nop (type
, op0
));
14566 case IMPLICIT_CONV_EXPR
:
14568 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14569 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14570 int flags
= LOOKUP_IMPLICIT
;
14571 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14572 flags
= LOOKUP_NORMAL
;
14573 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14579 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14580 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14581 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
14585 case REINTERPRET_CAST_EXPR
:
14586 case CONST_CAST_EXPR
:
14587 case DYNAMIC_CAST_EXPR
:
14588 case STATIC_CAST_EXPR
:
14591 tree op
, r
= NULL_TREE
;
14593 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14594 if (integral_constant_expression_p
14595 && !cast_valid_in_integral_constant_expression_p (type
))
14597 if (complain
& tf_error
)
14598 error ("a cast to a type other than an integral or "
14599 "enumeration type cannot appear in a constant-expression");
14600 RETURN (error_mark_node
);
14603 op
= RECUR (TREE_OPERAND (t
, 0));
14605 warning_sentinel
s(warn_useless_cast
);
14606 switch (TREE_CODE (t
))
14609 r
= build_functional_cast (type
, op
, complain
);
14611 case REINTERPRET_CAST_EXPR
:
14612 r
= build_reinterpret_cast (type
, op
, complain
);
14614 case CONST_CAST_EXPR
:
14615 r
= build_const_cast (type
, op
, complain
);
14617 case DYNAMIC_CAST_EXPR
:
14618 r
= build_dynamic_cast (type
, op
, complain
);
14620 case STATIC_CAST_EXPR
:
14621 r
= build_static_cast (type
, op
, complain
);
14624 gcc_unreachable ();
14630 case POSTDECREMENT_EXPR
:
14631 case POSTINCREMENT_EXPR
:
14632 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14633 args
, complain
, in_decl
);
14634 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14635 complain
|decltype_flag
));
14637 case PREDECREMENT_EXPR
:
14638 case PREINCREMENT_EXPR
:
14642 case TRUTH_NOT_EXPR
:
14643 case UNARY_PLUS_EXPR
: /* Unary + */
14644 case REALPART_EXPR
:
14645 case IMAGPART_EXPR
:
14646 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14647 RECUR (TREE_OPERAND (t
, 0)),
14648 complain
|decltype_flag
));
14650 case FIX_TRUNC_EXPR
:
14651 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14655 op1
= TREE_OPERAND (t
, 0);
14656 if (TREE_CODE (op1
) == LABEL_DECL
)
14657 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14658 EXPR_LOCATION (op1
)));
14659 if (TREE_CODE (op1
) == SCOPE_REF
)
14660 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14661 /*done=*/true, /*address_p=*/true);
14663 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14665 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14666 complain
|decltype_flag
));
14671 case TRUNC_DIV_EXPR
:
14672 case CEIL_DIV_EXPR
:
14673 case FLOOR_DIV_EXPR
:
14674 case ROUND_DIV_EXPR
:
14675 case EXACT_DIV_EXPR
:
14679 case TRUNC_MOD_EXPR
:
14680 case FLOOR_MOD_EXPR
:
14681 case TRUTH_ANDIF_EXPR
:
14682 case TRUTH_ORIF_EXPR
:
14683 case TRUTH_AND_EXPR
:
14684 case TRUTH_OR_EXPR
:
14700 warning_sentinel
s1(warn_type_limits
);
14701 warning_sentinel
s2(warn_div_by_zero
);
14702 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14703 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14704 tree r
= build_x_binary_op
14705 (input_location
, TREE_CODE (t
),
14707 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14709 : TREE_CODE (TREE_OPERAND (t
, 0))),
14711 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14713 : TREE_CODE (TREE_OPERAND (t
, 1))),
14715 complain
|decltype_flag
);
14716 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14717 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14722 case POINTER_PLUS_EXPR
:
14724 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14725 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14726 return fold_build_pointer_plus (op0
, op1
);
14730 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14731 /*address_p=*/false));
14733 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14734 args
, complain
, in_decl
);
14735 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14736 RECUR (TREE_OPERAND (t
, 1)),
14737 complain
|decltype_flag
));
14739 case ARRAY_NOTATION_REF
:
14741 tree start_index
, length
, stride
;
14742 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14743 args
, complain
, in_decl
);
14744 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14745 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14746 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14747 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14748 length
, stride
, TREE_TYPE (op1
)));
14751 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14752 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14759 op1
= TREE_OPERAND (t
, 0);
14760 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14761 op1
= TREE_TYPE (op1
);
14764 /* When there are no ARGS, we are trying to evaluate a
14765 non-dependent expression from the parser. Trying to do
14766 the substitutions may not work. */
14768 op1
= TREE_TYPE (op1
);
14772 ++cp_unevaluated_operand
;
14773 ++c_inhibit_evaluation_warnings
;
14775 op1
= tsubst (op1
, args
, complain
, in_decl
);
14777 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14778 /*function_p=*/false,
14779 /*integral_constant_expression_p=*/
14781 --cp_unevaluated_operand
;
14782 --c_inhibit_evaluation_warnings
;
14785 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14786 complain
& tf_error
);
14788 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14789 complain
& tf_error
);
14790 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14792 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14794 if (!processing_template_decl
&& TYPE_P (op1
))
14796 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14797 build1 (NOP_EXPR
, op1
, error_mark_node
));
14798 SIZEOF_EXPR_TYPE_P (r
) = 1;
14801 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14802 TREE_SIDE_EFFECTS (r
) = 0;
14803 TREE_READONLY (r
) = 1;
14805 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14810 case AT_ENCODE_EXPR
:
14812 op1
= TREE_OPERAND (t
, 0);
14813 ++cp_unevaluated_operand
;
14814 ++c_inhibit_evaluation_warnings
;
14815 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14816 /*function_p=*/false,
14817 /*integral_constant_expression_p=*/false);
14818 --cp_unevaluated_operand
;
14819 --c_inhibit_evaluation_warnings
;
14820 RETURN (objc_build_encode_expr (op1
));
14823 case NOEXCEPT_EXPR
:
14824 op1
= TREE_OPERAND (t
, 0);
14825 ++cp_unevaluated_operand
;
14826 ++c_inhibit_evaluation_warnings
;
14827 ++cp_noexcept_operand
;
14828 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14829 /*function_p=*/false,
14830 /*integral_constant_expression_p=*/false);
14831 --cp_unevaluated_operand
;
14832 --c_inhibit_evaluation_warnings
;
14833 --cp_noexcept_operand
;
14834 RETURN (finish_noexcept_expr (op1
, complain
));
14838 warning_sentinel
s(warn_div_by_zero
);
14839 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
14840 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
14841 tree r
= build_x_modify_expr
14842 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
14843 complain
|decltype_flag
);
14844 /* TREE_NO_WARNING must be set if either the expression was
14845 parenthesized or it uses an operator such as >>= rather
14846 than plain assignment. In the former case, it was already
14847 set and must be copied. In the latter case,
14848 build_x_modify_expr sets it and it must not be reset
14850 if (TREE_NO_WARNING (t
))
14851 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14857 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14858 args
, complain
, in_decl
);
14859 /* Remember that there was a reference to this entity. */
14862 RETURN (build_x_arrow (input_location
, op1
, complain
));
14866 tree placement
= RECUR (TREE_OPERAND (t
, 0));
14867 tree init
= RECUR (TREE_OPERAND (t
, 3));
14868 vec
<tree
, va_gc
> *placement_vec
;
14869 vec
<tree
, va_gc
> *init_vec
;
14872 if (placement
== NULL_TREE
)
14873 placement_vec
= NULL
;
14876 placement_vec
= make_tree_vector ();
14877 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
14878 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
14881 /* If there was an initializer in the original tree, but it
14882 instantiated to an empty list, then we should pass a
14883 non-NULL empty vector to tell build_new that it was an
14884 empty initializer() rather than no initializer. This can
14885 only happen when the initializer is a pack expansion whose
14886 parameter packs are of length zero. */
14887 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
14891 init_vec
= make_tree_vector ();
14892 if (init
== void_node
)
14893 gcc_assert (init_vec
!= NULL
);
14896 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
14897 vec_safe_push (init_vec
, TREE_VALUE (init
));
14901 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
14902 tree op2
= RECUR (TREE_OPERAND (t
, 2));
14903 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
14904 NEW_EXPR_USE_GLOBAL (t
),
14907 if (placement_vec
!= NULL
)
14908 release_tree_vector (placement_vec
);
14909 if (init_vec
!= NULL
)
14910 release_tree_vector (init_vec
);
14917 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14918 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14919 RETURN (delete_sanity (op0
, op1
,
14920 DELETE_EXPR_USE_VEC (t
),
14921 DELETE_EXPR_USE_GLOBAL (t
),
14925 case COMPOUND_EXPR
:
14927 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
14928 complain
& ~tf_decltype
, in_decl
,
14929 /*function_p=*/false,
14930 integral_constant_expression_p
);
14931 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
14933 RECUR (TREE_OPERAND (t
, 1)),
14934 complain
|decltype_flag
));
14940 vec
<tree
, va_gc
> *call_args
;
14941 unsigned int nargs
, i
;
14946 function
= CALL_EXPR_FN (t
);
14947 /* When we parsed the expression, we determined whether or
14948 not Koenig lookup should be performed. */
14949 koenig_p
= KOENIG_LOOKUP_P (t
);
14950 if (TREE_CODE (function
) == SCOPE_REF
)
14952 qualified_p
= true;
14953 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
14955 /*address_p=*/false);
14957 else if (koenig_p
&& identifier_p (function
))
14959 /* Do nothing; calling tsubst_copy_and_build on an identifier
14960 would incorrectly perform unqualified lookup again.
14962 Note that we can also have an IDENTIFIER_NODE if the earlier
14963 unqualified lookup found a member function; in that case
14964 koenig_p will be false and we do want to do the lookup
14965 again to find the instantiated member function.
14967 FIXME but doing that causes c++/15272, so we need to stop
14968 using IDENTIFIER_NODE in that situation. */
14969 qualified_p
= false;
14973 if (TREE_CODE (function
) == COMPONENT_REF
)
14975 tree op
= TREE_OPERAND (function
, 1);
14977 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
14978 || (BASELINK_P (op
)
14979 && BASELINK_QUALIFIED_P (op
)));
14982 qualified_p
= false;
14984 if (TREE_CODE (function
) == ADDR_EXPR
14985 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
14986 /* Avoid error about taking the address of a constructor. */
14987 function
= TREE_OPERAND (function
, 0);
14989 function
= tsubst_copy_and_build (function
, args
, complain
,
14992 integral_constant_expression_p
);
14994 if (BASELINK_P (function
))
14995 qualified_p
= true;
14998 nargs
= call_expr_nargs (t
);
14999 call_args
= make_tree_vector ();
15000 for (i
= 0; i
< nargs
; ++i
)
15002 tree arg
= CALL_EXPR_ARG (t
, i
);
15004 if (!PACK_EXPANSION_P (arg
))
15005 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
15008 /* Expand the pack expansion and push each entry onto
15010 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
15011 if (TREE_CODE (arg
) == TREE_VEC
)
15013 unsigned int len
, j
;
15015 len
= TREE_VEC_LENGTH (arg
);
15016 for (j
= 0; j
< len
; ++j
)
15018 tree value
= TREE_VEC_ELT (arg
, j
);
15019 if (value
!= NULL_TREE
)
15020 value
= convert_from_reference (value
);
15021 vec_safe_push (call_args
, value
);
15026 /* A partial substitution. Add one entry. */
15027 vec_safe_push (call_args
, arg
);
15032 /* We do not perform argument-dependent lookup if normal
15033 lookup finds a non-function, in accordance with the
15034 expected resolution of DR 218. */
15036 && ((is_overloaded_fn (function
)
15037 /* If lookup found a member function, the Koenig lookup is
15038 not appropriate, even if an unqualified-name was used
15039 to denote the function. */
15040 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
15041 || identifier_p (function
))
15042 /* Only do this when substitution turns a dependent call
15043 into a non-dependent call. */
15044 && type_dependent_expression_p_push (t
)
15045 && !any_type_dependent_arguments_p (call_args
))
15046 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
15048 if (identifier_p (function
)
15049 && !any_type_dependent_arguments_p (call_args
))
15051 if (koenig_p
&& (complain
& tf_warning_or_error
))
15053 /* For backwards compatibility and good diagnostics, try
15054 the unqualified lookup again if we aren't in SFINAE
15056 tree unq
= (tsubst_copy_and_build
15057 (function
, args
, complain
, in_decl
, true,
15058 integral_constant_expression_p
));
15059 if (unq
== error_mark_node
)
15060 RETURN (error_mark_node
);
15062 if (unq
!= function
)
15065 if (INDIRECT_REF_P (fn
))
15066 fn
= TREE_OPERAND (fn
, 0);
15067 if (TREE_CODE (fn
) == COMPONENT_REF
)
15068 fn
= TREE_OPERAND (fn
, 1);
15069 if (is_overloaded_fn (fn
))
15070 fn
= get_first_fn (fn
);
15071 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
15072 "%qD was not declared in this scope, "
15073 "and no declarations were found by "
15074 "argument-dependent lookup at the point "
15075 "of instantiation", function
))
15078 /* Can't say anything more. */;
15079 else if (DECL_CLASS_SCOPE_P (fn
))
15081 location_t loc
= EXPR_LOC_OR_LOC (t
,
15084 "declarations in dependent base %qT are "
15085 "not found by unqualified lookup",
15086 DECL_CLASS_CONTEXT (fn
));
15087 if (current_class_ptr
)
15089 "use %<this->%D%> instead", function
);
15092 "use %<%T::%D%> instead",
15093 current_class_name
, function
);
15096 inform (0, "%q+D declared here, later in the "
15097 "translation unit", fn
);
15102 if (identifier_p (function
))
15104 if (complain
& tf_error
)
15105 unqualified_name_lookup_error (function
);
15106 release_tree_vector (call_args
);
15107 RETURN (error_mark_node
);
15111 /* Remember that there was a reference to this entity. */
15112 if (DECL_P (function
))
15113 mark_used (function
);
15115 /* Put back tf_decltype for the actual call. */
15116 complain
|= decltype_flag
;
15118 if (TREE_CODE (function
) == OFFSET_REF
)
15119 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
15121 else if (TREE_CODE (function
) == COMPONENT_REF
)
15123 tree instance
= TREE_OPERAND (function
, 0);
15124 tree fn
= TREE_OPERAND (function
, 1);
15126 if (processing_template_decl
15127 && (type_dependent_expression_p (instance
)
15128 || (!BASELINK_P (fn
)
15129 && TREE_CODE (fn
) != FIELD_DECL
)
15130 || type_dependent_expression_p (fn
)
15131 || any_type_dependent_arguments_p (call_args
)))
15132 ret
= build_nt_call_vec (function
, call_args
);
15133 else if (!BASELINK_P (fn
))
15134 ret
= finish_call_expr (function
, &call_args
,
15135 /*disallow_virtual=*/false,
15136 /*koenig_p=*/false,
15139 ret
= (build_new_method_call
15141 &call_args
, NULL_TREE
,
15142 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15147 ret
= finish_call_expr (function
, &call_args
,
15148 /*disallow_virtual=*/qualified_p
,
15152 release_tree_vector (call_args
);
15159 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15160 tree folded_cond
= fold_non_dependent_expr (cond
);
15163 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
15165 if (integer_zerop (folded_cond
))
15167 ++c_inhibit_evaluation_warnings
;
15168 exp1
= RECUR (TREE_OPERAND (t
, 1));
15169 --c_inhibit_evaluation_warnings
;
15170 exp2
= RECUR (TREE_OPERAND (t
, 2));
15174 exp1
= RECUR (TREE_OPERAND (t
, 1));
15175 ++c_inhibit_evaluation_warnings
;
15176 exp2
= RECUR (TREE_OPERAND (t
, 2));
15177 --c_inhibit_evaluation_warnings
;
15179 cond
= folded_cond
;
15183 exp1
= RECUR (TREE_OPERAND (t
, 1));
15184 exp2
= RECUR (TREE_OPERAND (t
, 2));
15187 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15188 cond
, exp1
, exp2
, complain
));
15191 case PSEUDO_DTOR_EXPR
:
15193 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15194 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15195 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15196 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15202 tree purpose
, value
, chain
;
15204 if (t
== void_list_node
)
15207 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15208 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15210 /* We have pack expansions, so expand those and
15211 create a new list out of it. */
15212 tree purposevec
= NULL_TREE
;
15213 tree valuevec
= NULL_TREE
;
15217 /* Expand the argument expressions. */
15218 if (TREE_PURPOSE (t
))
15219 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15220 complain
, in_decl
);
15221 if (TREE_VALUE (t
))
15222 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15223 complain
, in_decl
);
15225 /* Build the rest of the list. */
15226 chain
= TREE_CHAIN (t
);
15227 if (chain
&& chain
!= void_type_node
)
15228 chain
= RECUR (chain
);
15230 /* Determine the number of arguments. */
15231 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15233 len
= TREE_VEC_LENGTH (purposevec
);
15234 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15236 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15237 len
= TREE_VEC_LENGTH (valuevec
);
15240 /* Since we only performed a partial substitution into
15241 the argument pack, we only RETURN (a single list
15243 if (purposevec
== TREE_PURPOSE (t
)
15244 && valuevec
== TREE_VALUE (t
)
15245 && chain
== TREE_CHAIN (t
))
15248 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15251 /* Convert the argument vectors into a TREE_LIST */
15255 /* Grab the Ith values. */
15257 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15260 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15263 /* Build the list (backwards). */
15264 chain
= tree_cons (purpose
, value
, chain
);
15270 purpose
= TREE_PURPOSE (t
);
15272 purpose
= RECUR (purpose
);
15273 value
= TREE_VALUE (t
);
15275 value
= RECUR (value
);
15276 chain
= TREE_CHAIN (t
);
15277 if (chain
&& chain
!= void_type_node
)
15278 chain
= RECUR (chain
);
15279 if (purpose
== TREE_PURPOSE (t
)
15280 && value
== TREE_VALUE (t
)
15281 && chain
== TREE_CHAIN (t
))
15283 RETURN (tree_cons (purpose
, value
, chain
));
15286 case COMPONENT_REF
:
15293 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15294 args
, complain
, in_decl
);
15295 /* Remember that there was a reference to this entity. */
15296 if (DECL_P (object
))
15297 mark_used (object
);
15298 object_type
= TREE_TYPE (object
);
15300 member
= TREE_OPERAND (t
, 1);
15301 if (BASELINK_P (member
))
15302 member
= tsubst_baselink (member
,
15303 non_reference (TREE_TYPE (object
)),
15304 args
, complain
, in_decl
);
15306 member
= tsubst_copy (member
, args
, complain
, in_decl
);
15307 if (member
== error_mark_node
)
15308 RETURN (error_mark_node
);
15310 if (type_dependent_expression_p (object
))
15311 /* We can't do much here. */;
15312 else if (!CLASS_TYPE_P (object_type
))
15314 if (scalarish_type_p (object_type
))
15316 tree s
= NULL_TREE
;
15317 tree dtor
= member
;
15319 if (TREE_CODE (dtor
) == SCOPE_REF
)
15321 s
= TREE_OPERAND (dtor
, 0);
15322 dtor
= TREE_OPERAND (dtor
, 1);
15324 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
15326 dtor
= TREE_OPERAND (dtor
, 0);
15328 RETURN (finish_pseudo_destructor_expr
15329 (object
, s
, dtor
, input_location
));
15333 else if (TREE_CODE (member
) == SCOPE_REF
15334 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
15336 /* Lookup the template functions now that we know what the
15338 tree scope
= TREE_OPERAND (member
, 0);
15339 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
15340 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
15341 member
= lookup_qualified_name (scope
, tmpl
,
15342 /*is_type_p=*/false,
15343 /*complain=*/false);
15344 if (BASELINK_P (member
))
15346 BASELINK_FUNCTIONS (member
)
15347 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
15349 member
= (adjust_result_of_qualified_name_lookup
15350 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15355 qualified_name_lookup_error (scope
, tmpl
, member
,
15357 RETURN (error_mark_node
);
15360 else if (TREE_CODE (member
) == SCOPE_REF
15361 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15362 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15364 if (complain
& tf_error
)
15366 if (TYPE_P (TREE_OPERAND (member
, 0)))
15367 error ("%qT is not a class or namespace",
15368 TREE_OPERAND (member
, 0));
15370 error ("%qD is not a class or namespace",
15371 TREE_OPERAND (member
, 0));
15373 RETURN (error_mark_node
);
15375 else if (TREE_CODE (member
) == FIELD_DECL
)
15377 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15378 if (TREE_CODE (r
) == COMPONENT_REF
)
15379 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15383 r
= finish_class_member_access_expr (object
, member
,
15384 /*template_p=*/false,
15386 if (TREE_CODE (r
) == COMPONENT_REF
)
15387 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15392 RETURN (build_throw
15393 (RECUR (TREE_OPERAND (t
, 0))));
15397 vec
<constructor_elt
, va_gc
> *n
;
15398 constructor_elt
*ce
;
15399 unsigned HOST_WIDE_INT idx
;
15400 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15401 bool process_index_p
;
15403 bool need_copy_p
= false;
15406 if (type
== error_mark_node
)
15407 RETURN (error_mark_node
);
15409 /* digest_init will do the wrong thing if we let it. */
15410 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15413 /* We do not want to process the index of aggregate
15414 initializers as they are identifier nodes which will be
15415 looked up by digest_init. */
15416 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15418 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15419 newlen
= vec_safe_length (n
);
15420 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15422 if (ce
->index
&& process_index_p
15423 /* An identifier index is looked up in the type
15424 being initialized, not the current scope. */
15425 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15426 ce
->index
= RECUR (ce
->index
);
15428 if (PACK_EXPANSION_P (ce
->value
))
15430 /* Substitute into the pack expansion. */
15431 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15434 if (ce
->value
== error_mark_node
15435 || PACK_EXPANSION_P (ce
->value
))
15437 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15438 /* Just move the argument into place. */
15439 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15442 /* Update the length of the final CONSTRUCTOR
15443 arguments vector, and note that we will need to
15445 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15446 need_copy_p
= true;
15450 ce
->value
= RECUR (ce
->value
);
15455 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15457 vec_alloc (n
, newlen
);
15458 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15460 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15462 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15463 for (i
= 0; i
< len
; ++i
)
15464 CONSTRUCTOR_APPEND_ELT (n
, 0,
15465 TREE_VEC_ELT (ce
->value
, i
));
15468 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15472 r
= build_constructor (init_list_type_node
, n
);
15473 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15475 if (TREE_HAS_CONSTRUCTOR (t
))
15476 RETURN (finish_compound_literal (type
, r
, complain
));
15478 TREE_TYPE (r
) = type
;
15484 tree operand_0
= TREE_OPERAND (t
, 0);
15485 if (TYPE_P (operand_0
))
15487 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15488 RETURN (get_typeid (operand_0
, complain
));
15492 operand_0
= RECUR (operand_0
);
15493 RETURN (build_typeid (operand_0
, complain
));
15500 else if (DECL_PACK_P (t
))
15502 /* We don't build decls for an instantiation of a
15503 variadic capture proxy, we instantiate the elements
15505 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15506 return RECUR (DECL_VALUE_EXPR (t
));
15512 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15513 /* ??? We're doing a subset of finish_id_expression here. */
15515 && !processing_template_decl
15516 && !cp_unevaluated_operand
15517 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
15518 && DECL_THREAD_LOCAL_P (r
))
15520 if (tree wrap
= get_tls_wrapper_fn (r
))
15521 /* Replace an evaluated use of the thread_local variable with
15522 a call to its wrapper. */
15523 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
15525 else if (outer_automatic_var_p (r
))
15526 r
= process_outer_var_ref (r
, complain
);
15528 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15529 /* If the original type was a reference, we'll be wrapped in
15530 the appropriate INDIRECT_REF. */
15531 r
= convert_from_reference (r
);
15537 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15538 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15539 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
15542 case OFFSETOF_EXPR
:
15543 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
15544 EXPR_LOCATION (t
)));
15548 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15549 complain
, in_decl
);
15551 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15552 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
15553 type2
= RECUR (type2
);
15555 type2
= tsubst (type2
, args
, complain
, in_decl
);
15557 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15562 tree old_stmt_expr
= cur_stmt_expr
;
15563 tree stmt_expr
= begin_stmt_expr ();
15565 cur_stmt_expr
= stmt_expr
;
15566 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15567 integral_constant_expression_p
);
15568 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15569 cur_stmt_expr
= old_stmt_expr
;
15571 /* If the resulting list of expression statement is empty,
15572 fold it further into void_node. */
15573 if (empty_expr_stmt_p (stmt_expr
))
15574 stmt_expr
= void_node
;
15576 RETURN (stmt_expr
);
15581 tree r
= build_lambda_expr ();
15583 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15584 LAMBDA_EXPR_CLOSURE (r
) = type
;
15585 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15587 LAMBDA_EXPR_LOCATION (r
)
15588 = LAMBDA_EXPR_LOCATION (t
);
15589 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15590 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15591 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15592 LAMBDA_EXPR_DISCRIMINATOR (r
)
15593 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15594 /* For a function scope, we want to use tsubst so that we don't
15595 complain about referring to an auto function before its return
15596 type has been deduced. Otherwise, we want to use tsubst_copy so
15597 that we look up the existing field/parameter/variable rather
15598 than build a new one. */
15599 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15600 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15601 scope
= tsubst (scope
, args
, complain
, in_decl
);
15602 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15604 /* Look up the parameter we want directly, as tsubst_copy
15605 doesn't do what we need. */
15606 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15607 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15608 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15609 parm
= DECL_CHAIN (parm
);
15611 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15612 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15613 DECL_CONTEXT (scope
) = fn
;
15616 scope
= RECUR (scope
);
15617 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15618 LAMBDA_EXPR_RETURN_TYPE (r
)
15619 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15621 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15622 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15624 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15625 determine_visibility (TYPE_NAME (type
));
15626 /* Now that we know visibility, instantiate the type so we have a
15627 declaration of the op() for later calls to lambda_function. */
15628 complete_type (type
);
15630 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15632 RETURN (build_lambda_object (r
));
15636 /* We can get here for a constant initializer of non-dependent type.
15637 FIXME stop folding in cp_parser_initializer_clause. */
15639 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15644 case TRANSACTION_EXPR
:
15645 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15646 integral_constant_expression_p
));
15649 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15651 case VEC_PERM_EXPR
:
15653 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15654 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15655 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15656 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
15661 /* Handle Objective-C++ constructs, if appropriate. */
15664 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15665 in_decl
, /*function_p=*/false);
15669 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15675 input_location
= loc
;
15679 /* Verify that the instantiated ARGS are valid. For type arguments,
15680 make sure that the type's linkage is ok. For non-type arguments,
15681 make sure they are constants if they are integral or enumerations.
15682 Emit an error under control of COMPLAIN, and return TRUE on error. */
15685 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15687 if (dependent_template_arg_p (t
))
15689 if (ARGUMENT_PACK_P (t
))
15691 tree vec
= ARGUMENT_PACK_ARGS (t
);
15692 int len
= TREE_VEC_LENGTH (vec
);
15693 bool result
= false;
15696 for (i
= 0; i
< len
; ++i
)
15697 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15701 else if (TYPE_P (t
))
15703 /* [basic.link]: A name with no linkage (notably, the name
15704 of a class or enumeration declared in a local scope)
15705 shall not be used to declare an entity with linkage.
15706 This implies that names with no linkage cannot be used as
15709 DR 757 relaxes this restriction for C++0x. */
15710 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15711 : no_linkage_check (t
, /*relaxed_p=*/false));
15715 /* DR 488 makes use of a type with no linkage cause
15716 type deduction to fail. */
15717 if (complain
& tf_error
)
15719 if (TYPE_ANONYMOUS_P (nt
))
15720 error ("%qT is/uses anonymous type", t
);
15722 error ("template argument for %qD uses local type %qT",
15727 /* In order to avoid all sorts of complications, we do not
15728 allow variably-modified types as template arguments. */
15729 else if (variably_modified_type_p (t
, NULL_TREE
))
15731 if (complain
& tf_error
)
15732 error ("%qT is a variably modified type", t
);
15736 /* Class template and alias template arguments should be OK. */
15737 else if (DECL_TYPE_TEMPLATE_P (t
))
15739 /* A non-type argument of integral or enumerated type must be a
15741 else if (TREE_TYPE (t
)
15742 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15743 && !TREE_CONSTANT (t
))
15745 if (complain
& tf_error
)
15746 error ("integral expression %qE is not constant", t
);
15753 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15755 int ix
, len
= DECL_NTPARMS (tmpl
);
15756 bool result
= false;
15758 for (ix
= 0; ix
!= len
; ix
++)
15760 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15763 if (result
&& (complain
& tf_error
))
15764 error (" trying to instantiate %qD", tmpl
);
15768 /* We're out of SFINAE context now, so generate diagnostics for the access
15769 errors we saw earlier when instantiating D from TMPL and ARGS. */
15772 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15774 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15775 tree type
= TREE_TYPE (pattern
);
15776 location_t loc
= input_location
;
15778 push_access_scope (d
);
15779 push_deferring_access_checks (dk_no_deferred
);
15780 input_location
= DECL_SOURCE_LOCATION (pattern
);
15781 tsubst (type
, args
, tf_warning_or_error
, d
);
15782 input_location
= loc
;
15783 pop_deferring_access_checks ();
15784 pop_access_scope (d
);
15787 /* Instantiate the indicated variable, function, or alias template TMPL with
15788 the template arguments in TARG_PTR. */
15791 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15793 tree targ_ptr
= orig_args
;
15797 bool access_ok
= true;
15799 if (tmpl
== error_mark_node
)
15800 return error_mark_node
;
15802 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15804 /* If this function is a clone, handle it specially. */
15805 if (DECL_CLONED_FUNCTION_P (tmpl
))
15810 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15811 DECL_CLONED_FUNCTION. */
15812 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
15813 targ_ptr
, complain
);
15814 if (spec
== error_mark_node
)
15815 return error_mark_node
;
15817 /* Look for the clone. */
15818 FOR_EACH_CLONE (clone
, spec
)
15819 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
15821 /* We should always have found the clone by now. */
15822 gcc_unreachable ();
15826 if (targ_ptr
== error_mark_node
)
15827 return error_mark_node
;
15829 /* Check to see if we already have this specialization. */
15830 gen_tmpl
= most_general_template (tmpl
);
15831 if (tmpl
!= gen_tmpl
)
15832 /* The TMPL is a partial instantiation. To get a full set of
15833 arguments we must add the arguments used to perform the
15834 partial instantiation. */
15835 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
15838 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15839 but it doesn't seem to be on the hot path. */
15840 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
15842 gcc_assert (tmpl
== gen_tmpl
15843 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
15845 || fndecl
== NULL_TREE
);
15847 if (spec
!= NULL_TREE
)
15849 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
15851 if (complain
& tf_error
)
15852 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
15853 return error_mark_node
;
15858 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
15860 return error_mark_node
;
15862 /* We are building a FUNCTION_DECL, during which the access of its
15863 parameters and return types have to be checked. However this
15864 FUNCTION_DECL which is the desired context for access checking
15865 is not built yet. We solve this chicken-and-egg problem by
15866 deferring all checks until we have the FUNCTION_DECL. */
15867 push_deferring_access_checks (dk_deferred
);
15869 /* Instantiation of the function happens in the context of the function
15870 template, not the context of the overload resolution we're doing. */
15871 push_to_top_level ();
15872 /* If there are dependent arguments, e.g. because we're doing partial
15873 ordering, make sure processing_template_decl stays set. */
15874 if (uses_template_parms (targ_ptr
))
15875 ++processing_template_decl
;
15876 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15878 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
15879 complain
, gen_tmpl
, true);
15880 push_nested_class (ctx
);
15882 /* Substitute template parameters to obtain the specialization. */
15883 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
15884 targ_ptr
, complain
, gen_tmpl
);
15885 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15886 pop_nested_class ();
15887 pop_from_top_level ();
15889 if (fndecl
== error_mark_node
)
15891 pop_deferring_access_checks ();
15892 return error_mark_node
;
15895 /* The DECL_TI_TEMPLATE should always be the immediate parent
15896 template, not the most general template. */
15897 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
15899 /* Now we know the specialization, compute access previously
15901 push_access_scope (fndecl
);
15902 if (!perform_deferred_access_checks (complain
))
15904 pop_access_scope (fndecl
);
15905 pop_deferring_access_checks ();
15907 /* If we've just instantiated the main entry point for a function,
15908 instantiate all the alternate entry points as well. We do this
15909 by cloning the instantiation of the main entry point, not by
15910 instantiating the template clones. */
15911 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
15912 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
15916 if (!(complain
& tf_error
))
15918 /* Remember to reinstantiate when we're out of SFINAE so the user
15919 can see the errors. */
15920 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
15922 return error_mark_node
;
15927 /* Wrapper for instantiate_template_1. */
15930 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15933 timevar_push (TV_TEMPLATE_INST
);
15934 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
15935 timevar_pop (TV_TEMPLATE_INST
);
15939 /* Instantiate the alias template TMPL with ARGS. Also push a template
15940 instantiation level, which instantiate_template doesn't do because
15941 functions and variables have sufficient context established by the
15945 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
15947 struct pending_template
*old_last_pend
= last_pending_template
;
15948 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15949 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
15950 return error_mark_node
;
15951 tree tinst
= build_tree_list (tmpl
, args
);
15952 if (!push_tinst_level (tinst
))
15955 return error_mark_node
;
15959 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
15960 args
, tmpl
, complain
,
15961 /*require_all_args=*/true,
15962 /*use_default_args=*/true);
15964 tree r
= instantiate_template (tmpl
, args
, complain
);
15965 pop_tinst_level ();
15966 /* We can't free this if a pending_template entry or last_error_tinst_level
15967 is pointing at it. */
15968 if (last_pending_template
== old_last_pend
15969 && last_error_tinst_level
== old_error_tinst
)
15975 /* PARM is a template parameter pack for FN. Returns true iff
15976 PARM is used in a deducible way in the argument list of FN. */
15979 pack_deducible_p (tree parm
, tree fn
)
15981 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
15982 for (; t
; t
= TREE_CHAIN (t
))
15984 tree type
= TREE_VALUE (t
);
15986 if (!PACK_EXPANSION_P (type
))
15988 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
15989 packs
; packs
= TREE_CHAIN (packs
))
15990 if (template_args_equal (TREE_VALUE (packs
), parm
))
15992 /* The template parameter pack is used in a function parameter
15993 pack. If this is the end of the parameter list, the
15994 template parameter pack is deducible. */
15995 if (TREE_CHAIN (t
) == void_list_node
)
15998 /* Otherwise, not. Well, it could be deduced from
15999 a non-pack parameter, but doing so would end up with
16000 a deduction mismatch, so don't bother. */
16004 /* The template parameter pack isn't used in any function parameter
16005 packs, but it might be used deeper, e.g. tuple<Args...>. */
16009 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
16010 NARGS elements of the arguments that are being used when calling
16011 it. TARGS is a vector into which the deduced template arguments
16014 Returns either a FUNCTION_DECL for the matching specialization of FN or
16015 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
16016 true, diagnostics will be printed to explain why it failed.
16018 If FN is a conversion operator, or we are trying to produce a specific
16019 specialization, RETURN_TYPE is the return type desired.
16021 The EXPLICIT_TARGS are explicit template arguments provided via a
16024 The parameter STRICT is one of:
16027 We are deducing arguments for a function call, as in
16028 [temp.deduct.call].
16031 We are deducing arguments for a conversion function, as in
16032 [temp.deduct.conv].
16035 We are deducing arguments when doing an explicit instantiation
16036 as in [temp.explicit], when determining an explicit specialization
16037 as in [temp.expl.spec], or when taking the address of a function
16038 template, as in [temp.deduct.funcaddr]. */
16041 fn_type_unification (tree fn
,
16042 tree explicit_targs
,
16045 unsigned int nargs
,
16047 unification_kind_t strict
,
16054 tree decl
= NULL_TREE
;
16055 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
16057 static int deduction_depth
;
16058 struct pending_template
*old_last_pend
= last_pending_template
;
16059 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
16060 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
16062 tree r
= error_mark_node
;
16065 complain
|= tf_decltype
;
16067 /* In C++0x, it's possible to have a function template whose type depends
16068 on itself recursively. This is most obvious with decltype, but can also
16069 occur with enumeration scope (c++/48969). So we need to catch infinite
16070 recursion and reject the substitution at deduction time; this function
16071 will return error_mark_node for any repeated substitution.
16073 This also catches excessive recursion such as when f<N> depends on
16074 f<N-1> across all integers, and returns error_mark_node for all the
16075 substitutions back up to the initial one.
16077 This is, of course, not reentrant. */
16078 if (excessive_deduction_depth
)
16079 return error_mark_node
;
16080 tinst
= build_tree_list (fn
, NULL_TREE
);
16083 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
16085 fntype
= TREE_TYPE (fn
);
16086 if (explicit_targs
)
16090 The specified template arguments must match the template
16091 parameters in kind (i.e., type, nontype, template), and there
16092 must not be more arguments than there are parameters;
16093 otherwise type deduction fails.
16095 Nontype arguments must match the types of the corresponding
16096 nontype template parameters, or must be convertible to the
16097 types of the corresponding nontype parameters as specified in
16098 _temp.arg.nontype_, otherwise type deduction fails.
16100 All references in the function type of the function template
16101 to the corresponding template parameters are replaced by the
16102 specified template argument values. If a substitution in a
16103 template parameter or in the function type of the function
16104 template results in an invalid type, type deduction fails. */
16105 int i
, len
= TREE_VEC_LENGTH (tparms
);
16106 location_t loc
= input_location
;
16107 bool incomplete
= false;
16109 /* Adjust any explicit template arguments before entering the
16110 substitution context. */
16112 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
16114 /*require_all_args=*/false,
16115 /*use_default_args=*/false));
16116 if (explicit_targs
== error_mark_node
)
16119 /* Substitute the explicit args into the function type. This is
16120 necessary so that, for instance, explicitly declared function
16121 arguments can match null pointed constants. If we were given
16122 an incomplete set of explicit args, we must not do semantic
16123 processing during substitution as we could create partial
16125 for (i
= 0; i
< len
; i
++)
16127 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16128 bool parameter_pack
= false;
16129 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
16131 /* Dig out the actual parm. */
16132 if (TREE_CODE (parm
) == TYPE_DECL
16133 || TREE_CODE (parm
) == TEMPLATE_DECL
)
16135 parm
= TREE_TYPE (parm
);
16136 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
16138 else if (TREE_CODE (parm
) == PARM_DECL
)
16140 parm
= DECL_INITIAL (parm
);
16141 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16144 if (!parameter_pack
&& targ
== NULL_TREE
)
16145 /* No explicit argument for this template parameter. */
16148 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16150 /* Mark the argument pack as "incomplete". We could
16151 still deduce more arguments during unification.
16152 We remove this mark in type_unification_real. */
16155 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16156 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16157 = ARGUMENT_PACK_ARGS (targ
);
16160 /* We have some incomplete argument packs. */
16165 TREE_VALUE (tinst
) = explicit_targs
;
16166 if (!push_tinst_level (tinst
))
16168 excessive_deduction_depth
= true;
16171 processing_template_decl
+= incomplete
;
16172 input_location
= DECL_SOURCE_LOCATION (fn
);
16173 /* Ignore any access checks; we'll see them again in
16174 instantiate_template and they might have the wrong
16175 access path at this point. */
16176 push_deferring_access_checks (dk_deferred
);
16177 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16178 complain
| tf_partial
, NULL_TREE
);
16179 pop_deferring_access_checks ();
16180 input_location
= loc
;
16181 processing_template_decl
-= incomplete
;
16182 pop_tinst_level ();
16184 if (fntype
== error_mark_node
)
16187 /* Place the explicitly specified arguments in TARGS. */
16188 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16189 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16192 /* Never do unification on the 'this' parameter. */
16193 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16199 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16200 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16201 new_args
[0] = return_type
;
16202 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16207 /* We allow incomplete unification without an error message here
16208 because the standard doesn't seem to explicitly prohibit it. Our
16209 callers must be ready to deal with unification failures in any
16212 TREE_VALUE (tinst
) = targs
;
16213 /* If we aren't explaining yet, push tinst context so we can see where
16214 any errors (e.g. from class instantiations triggered by instantiation
16215 of default template arguments) come from. If we are explaining, this
16216 context is redundant. */
16217 if (!explain_p
&& !push_tinst_level (tinst
))
16219 excessive_deduction_depth
= true;
16223 /* type_unification_real will pass back any access checks from default
16224 template argument substitution. */
16225 vec
<deferred_access_check
, va_gc
> *checks
;
16228 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16229 targs
, parms
, args
, nargs
, /*subr=*/0,
16230 strict
, flags
, &checks
, explain_p
);
16232 pop_tinst_level ();
16236 /* Now that we have bindings for all of the template arguments,
16237 ensure that the arguments deduced for the template template
16238 parameters have compatible template parameter lists. We cannot
16239 check this property before we have deduced all template
16240 arguments, because the template parameter types of a template
16241 template parameter might depend on prior template parameters
16242 deduced after the template template parameter. The following
16243 ill-formed example illustrates this issue:
16245 template<typename T, template<T> class C> void f(C<5>, T);
16247 template<int N> struct X {};
16250 f(X<5>(), 5l); // error: template argument deduction fails
16253 The template parameter list of 'C' depends on the template type
16254 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16255 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16256 time that we deduce 'C'. */
16257 if (!template_template_parm_bindings_ok_p
16258 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
16260 unify_inconsistent_template_template_parameters (explain_p
);
16264 /* All is well so far. Now, check:
16268 When all template arguments have been deduced, all uses of
16269 template parameters in nondeduced contexts are replaced with
16270 the corresponding deduced argument values. If the
16271 substitution results in an invalid type, as described above,
16272 type deduction fails. */
16273 TREE_VALUE (tinst
) = targs
;
16274 if (!push_tinst_level (tinst
))
16276 excessive_deduction_depth
= true;
16280 /* Also collect access checks from the instantiation. */
16281 reopen_deferring_access_checks (checks
);
16283 decl
= instantiate_template (fn
, targs
, complain
);
16285 checks
= get_deferred_access_checks ();
16286 pop_deferring_access_checks ();
16288 pop_tinst_level ();
16290 if (decl
== error_mark_node
)
16293 /* Now perform any access checks encountered during substitution. */
16294 push_access_scope (decl
);
16295 ok
= perform_access_checks (checks
, complain
);
16296 pop_access_scope (decl
);
16300 /* If we're looking for an exact match, check that what we got
16301 is indeed an exact match. It might not be if some template
16302 parameters are used in non-deduced contexts. But don't check
16303 for an exact match if we have dependent template arguments;
16304 in that case we're doing partial ordering, and we already know
16305 that we have two candidates that will provide the actual type. */
16306 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
16308 tree substed
= TREE_TYPE (decl
);
16312 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
16314 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
16315 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
16316 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
16318 unify_type_mismatch (explain_p
, args
[i
],
16319 TREE_VALUE (sarg
));
16328 if (excessive_deduction_depth
)
16330 if (deduction_depth
== 0)
16331 /* Reset once we're all the way out. */
16332 excessive_deduction_depth
= false;
16335 /* We can't free this if a pending_template entry or last_error_tinst_level
16336 is pointing at it. */
16337 if (last_pending_template
== old_last_pend
16338 && last_error_tinst_level
== old_error_tinst
)
16344 /* Adjust types before performing type deduction, as described in
16345 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16346 sections are symmetric. PARM is the type of a function parameter
16347 or the return type of the conversion function. ARG is the type of
16348 the argument passed to the call, or the type of the value
16349 initialized with the result of the conversion function.
16350 ARG_EXPR is the original argument expression, which may be null. */
16353 maybe_adjust_types_for_deduction (unification_kind_t strict
,
16367 /* Swap PARM and ARG throughout the remainder of this
16368 function; the handling is precisely symmetric since PARM
16369 will initialize ARG rather than vice versa. */
16377 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16378 too, but here handle it by stripping the reference from PARM
16379 rather than by adding it to ARG. */
16380 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16381 && TYPE_REF_IS_RVALUE (*parm
)
16382 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16383 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16384 && TREE_CODE (*arg
) == REFERENCE_TYPE
16385 && !TYPE_REF_IS_RVALUE (*arg
))
16386 *parm
= TREE_TYPE (*parm
);
16387 /* Nothing else to do in this case. */
16391 gcc_unreachable ();
16394 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16396 /* [temp.deduct.call]
16398 If P is not a reference type:
16400 --If A is an array type, the pointer type produced by the
16401 array-to-pointer standard conversion (_conv.array_) is
16402 used in place of A for type deduction; otherwise,
16404 --If A is a function type, the pointer type produced by
16405 the function-to-pointer standard conversion
16406 (_conv.func_) is used in place of A for type deduction;
16409 --If A is a cv-qualified type, the top level
16410 cv-qualifiers of A's type are ignored for type
16412 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16413 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16414 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16415 *arg
= build_pointer_type (*arg
);
16417 *arg
= TYPE_MAIN_VARIANT (*arg
);
16420 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16421 of the form T&&, where T is a template parameter, and the argument
16422 is an lvalue, T is deduced as A& */
16423 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16424 && TYPE_REF_IS_RVALUE (*parm
)
16425 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16426 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16427 && (arg_expr
? real_lvalue_p (arg_expr
)
16428 /* try_one_overload doesn't provide an arg_expr, but
16429 functions are always lvalues. */
16430 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16431 *arg
= build_reference_type (*arg
);
16433 /* [temp.deduct.call]
16435 If P is a cv-qualified type, the top level cv-qualifiers
16436 of P's type are ignored for type deduction. If P is a
16437 reference type, the type referred to by P is used for
16439 *parm
= TYPE_MAIN_VARIANT (*parm
);
16440 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16442 *parm
= TREE_TYPE (*parm
);
16443 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16446 /* DR 322. For conversion deduction, remove a reference type on parm
16447 too (which has been swapped into ARG). */
16448 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16449 *arg
= TREE_TYPE (*arg
);
16454 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16455 template which does contain any deducible template parameters; check if
16456 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16457 unify_one_argument. */
16460 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16461 int flags
, bool explain_p
)
16466 type
= TREE_TYPE (arg
);
16470 if (same_type_p (parm
, type
))
16471 return unify_success (explain_p
);
16473 if (strict
== DEDUCE_CONV
)
16475 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16476 explain_p
? tf_warning_or_error
: tf_none
))
16477 return unify_success (explain_p
);
16479 else if (strict
!= DEDUCE_EXACT
)
16481 if (can_convert_arg (parm
, type
,
16482 TYPE_P (arg
) ? NULL_TREE
: arg
,
16483 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16484 return unify_success (explain_p
);
16487 if (strict
== DEDUCE_EXACT
)
16488 return unify_type_mismatch (explain_p
, parm
, arg
);
16490 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16493 static bool uses_deducible_template_parms (tree type
);
16495 /* Returns true iff the expression EXPR is one from which a template
16496 argument can be deduced. In other words, if it's an undecorated
16497 use of a template non-type parameter. */
16500 deducible_expression (tree expr
)
16502 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16505 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16506 deducible way; that is, if it has a max value of <PARM> - 1. */
16509 deducible_array_bound (tree domain
)
16511 if (domain
== NULL_TREE
)
16514 tree max
= TYPE_MAX_VALUE (domain
);
16515 if (TREE_CODE (max
) != MINUS_EXPR
)
16518 return deducible_expression (TREE_OPERAND (max
, 0));
16521 /* Returns true iff the template arguments ARGS use a template parameter
16522 in a deducible way. */
16525 deducible_template_args (tree args
)
16527 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16530 tree elt
= TREE_VEC_ELT (args
, i
);
16531 if (ARGUMENT_PACK_P (elt
))
16532 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16535 if (PACK_EXPANSION_P (elt
))
16536 elt
= PACK_EXPANSION_PATTERN (elt
);
16537 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16539 else if (TYPE_P (elt
))
16540 deducible
= uses_deducible_template_parms (elt
);
16542 deducible
= deducible_expression (elt
);
16550 /* Returns true iff TYPE contains any deducible references to template
16551 parameters, as per 14.8.2.5. */
16554 uses_deducible_template_parms (tree type
)
16556 if (PACK_EXPANSION_P (type
))
16557 type
= PACK_EXPANSION_PATTERN (type
);
16564 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16565 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16571 if (POINTER_TYPE_P (type
))
16572 return uses_deducible_template_parms (TREE_TYPE (type
));
16574 /* T[integer-constant ]
16576 if (TREE_CODE (type
) == ARRAY_TYPE
)
16577 return (uses_deducible_template_parms (TREE_TYPE (type
))
16578 || deducible_array_bound (TYPE_DOMAIN (type
)));
16590 if (TYPE_PTRMEM_P (type
))
16591 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16592 || (uses_deducible_template_parms
16593 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16595 /* template-name <T> (where template-name refers to a class template)
16596 template-name <i> (where template-name refers to a class template) */
16597 if (CLASS_TYPE_P (type
)
16598 && CLASSTYPE_TEMPLATE_INFO (type
)
16599 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16600 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16601 (CLASSTYPE_TI_ARGS (type
)));
16606 if (TREE_CODE (type
) == FUNCTION_TYPE
16607 || TREE_CODE (type
) == METHOD_TYPE
)
16609 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16611 tree parm
= TYPE_ARG_TYPES (type
);
16612 if (TREE_CODE (type
) == METHOD_TYPE
)
16613 parm
= TREE_CHAIN (parm
);
16614 for (; parm
; parm
= TREE_CHAIN (parm
))
16615 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16622 /* Subroutine of type_unification_real and unify_pack_expansion to
16623 handle unification of a single P/A pair. Parameters are as
16624 for those functions. */
16627 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16628 int subr
, unification_kind_t strict
, int flags
,
16631 tree arg_expr
= NULL_TREE
;
16634 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16635 return unify_invalid (explain_p
);
16636 if (arg
== unknown_type_node
)
16637 /* We can't deduce anything from this, but we might get all the
16638 template args from other function args. */
16639 return unify_success (explain_p
);
16641 /* Implicit conversions (Clause 4) will be performed on a function
16642 argument to convert it to the type of the corresponding function
16643 parameter if the parameter type contains no template-parameters that
16644 participate in template argument deduction. */
16645 if (TYPE_P (parm
) && !uses_template_parms (parm
))
16646 /* For function parameters that contain no template-parameters at all,
16647 we have historically checked for convertibility in order to shortcut
16648 consideration of this candidate. */
16649 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
16651 else if (strict
== DEDUCE_CALL
16652 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16653 /* For function parameters with only non-deducible template parameters,
16655 return unify_success (explain_p
);
16660 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16661 | UNIFY_ALLOW_MORE_CV_QUAL
16662 | UNIFY_ALLOW_DERIVED
);
16666 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16670 arg_strict
= UNIFY_ALLOW_NONE
;
16674 gcc_unreachable ();
16677 /* We only do these transformations if this is the top-level
16678 parameter_type_list in a call or declaration matching; in other
16679 situations (nested function declarators, template argument lists) we
16680 won't be comparing a type to an expression, and we don't do any type
16686 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16687 if (type_unknown_p (arg
))
16689 /* [temp.deduct.type] A template-argument can be
16690 deduced from a pointer to function or pointer
16691 to member function argument if the set of
16692 overloaded functions does not contain function
16693 templates and at most one of a set of
16694 overloaded functions provides a unique
16697 if (resolve_overloaded_unification
16698 (tparms
, targs
, parm
, arg
, strict
,
16699 arg_strict
, explain_p
))
16700 return unify_success (explain_p
);
16701 return unify_overload_resolution_failure (explain_p
, arg
);
16705 arg
= unlowered_expr_type (arg
);
16706 if (arg
== error_mark_node
)
16707 return unify_invalid (explain_p
);
16711 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16714 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16715 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
16716 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16718 /* For deduction from an init-list we need the actual list. */
16719 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16721 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16724 /* Most parms like fn_type_unification.
16726 If SUBR is 1, we're being called recursively (to unify the
16727 arguments of a function or method parameter of a function
16730 CHECKS is a pointer to a vector of access checks encountered while
16731 substituting default template arguments. */
16734 type_unification_real (tree tparms
,
16738 unsigned int xnargs
,
16740 unification_kind_t strict
,
16742 vec
<deferred_access_check
, va_gc
> **checks
,
16747 int ntparms
= TREE_VEC_LENGTH (tparms
);
16748 int saw_undeduced
= 0;
16751 unsigned int nargs
;
16754 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16755 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16756 gcc_assert (ntparms
> 0);
16758 /* Reset the number of non-defaulted template arguments contained
16760 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16768 while (parms
&& parms
!= void_list_node
16771 parm
= TREE_VALUE (parms
);
16773 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16774 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16775 /* For a function parameter pack that occurs at the end of the
16776 parameter-declaration-list, the type A of each remaining
16777 argument of the call is compared with the type P of the
16778 declarator-id of the function parameter pack. */
16781 parms
= TREE_CHAIN (parms
);
16783 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16784 /* For a function parameter pack that does not occur at the
16785 end of the parameter-declaration-list, the type of the
16786 parameter pack is a non-deduced context. */
16792 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16798 && parms
!= void_list_node
16799 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16801 /* Unify the remaining arguments with the pack expansion type. */
16803 tree parmvec
= make_tree_vec (1);
16805 /* Allocate a TREE_VEC and copy in all of the arguments */
16806 argvec
= make_tree_vec (nargs
- ia
);
16807 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
16808 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
16810 /* Copy the parameter into parmvec. */
16811 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
16812 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
16813 /*subr=*/subr
, explain_p
))
16816 /* Advance to the end of the list of parameters. */
16817 parms
= TREE_CHAIN (parms
);
16820 /* Fail if we've reached the end of the parm list, and more args
16821 are present, and the parm list isn't variadic. */
16822 if (ia
< nargs
&& parms
== void_list_node
)
16823 return unify_too_many_arguments (explain_p
, nargs
, ia
);
16824 /* Fail if parms are left and they don't have default values and
16825 they aren't all deduced as empty packs (c++/57397). This is
16826 consistent with sufficient_parms_p. */
16827 if (parms
&& parms
!= void_list_node
16828 && TREE_PURPOSE (parms
) == NULL_TREE
)
16830 unsigned int count
= nargs
;
16835 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
16838 p
= TREE_CHAIN (p
);
16840 while (p
&& p
!= void_list_node
);
16841 if (count
!= nargs
)
16842 return unify_too_few_arguments (explain_p
, ia
, count
,
16848 tsubst_flags_t complain
= (explain_p
16849 ? tf_warning_or_error
16852 for (i
= 0; i
< ntparms
; i
++)
16854 tree targ
= TREE_VEC_ELT (targs
, i
);
16855 tree tparm
= TREE_VEC_ELT (tparms
, i
);
16857 /* Clear the "incomplete" flags on all argument packs now so that
16858 substituting them into later default arguments works. */
16859 if (targ
&& ARGUMENT_PACK_P (targ
))
16861 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
16862 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
16865 if (targ
|| tparm
== error_mark_node
)
16867 tparm
= TREE_VALUE (tparm
);
16869 /* If this is an undeduced nontype parameter that depends on
16870 a type parameter, try another pass; its type may have been
16871 deduced from a later argument than the one from which
16872 this parameter can be deduced. */
16873 if (TREE_CODE (tparm
) == PARM_DECL
16874 && uses_template_parms (TREE_TYPE (tparm
))
16875 && !saw_undeduced
++)
16878 /* Core issue #226 (C++0x) [temp.deduct]:
16880 If a template argument has not been deduced, its
16881 default template argument, if any, is used.
16883 When we are in C++98 mode, TREE_PURPOSE will either
16884 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16885 to explicitly check cxx_dialect here. */
16886 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
16888 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16889 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
16890 reopen_deferring_access_checks (*checks
);
16891 location_t save_loc
= input_location
;
16893 input_location
= DECL_SOURCE_LOCATION (parm
);
16894 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
16895 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
16897 input_location
= save_loc
;
16898 *checks
= get_deferred_access_checks ();
16899 pop_deferring_access_checks ();
16900 if (arg
== error_mark_node
)
16904 TREE_VEC_ELT (targs
, i
) = arg
;
16905 /* The position of the first default template argument,
16906 is also the number of non-defaulted arguments in TARGS.
16908 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16909 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
16914 /* If the type parameter is a parameter pack, then it will
16915 be deduced to an empty parameter pack. */
16916 if (template_parameter_pack_p (tparm
))
16920 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
16922 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
16923 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
16924 TREE_CONSTANT (arg
) = 1;
16927 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16929 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
16931 TREE_VEC_ELT (targs
, i
) = arg
;
16935 return unify_parameter_deduction_failure (explain_p
, tparm
);
16938 #ifdef ENABLE_CHECKING
16939 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16940 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
16943 return unify_success (explain_p
);
16946 /* Subroutine of type_unification_real. Args are like the variables
16947 at the call site. ARG is an overloaded function (or template-id);
16948 we try deducing template args from each of the overloads, and if
16949 only one succeeds, we go with that. Modifies TARGS and returns
16950 true on success. */
16953 resolve_overloaded_unification (tree tparms
,
16957 unification_kind_t strict
,
16961 tree tempargs
= copy_node (targs
);
16963 tree goodfn
= NULL_TREE
;
16966 if (TREE_CODE (arg
) == ADDR_EXPR
)
16968 arg
= TREE_OPERAND (arg
, 0);
16974 if (TREE_CODE (arg
) == COMPONENT_REF
)
16975 /* Handle `&x' where `x' is some static or non-static member
16977 arg
= TREE_OPERAND (arg
, 1);
16979 if (TREE_CODE (arg
) == OFFSET_REF
)
16980 arg
= TREE_OPERAND (arg
, 1);
16982 /* Strip baselink information. */
16983 if (BASELINK_P (arg
))
16984 arg
= BASELINK_FUNCTIONS (arg
);
16986 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
16988 /* If we got some explicit template args, we need to plug them into
16989 the affected templates before we try to unify, in case the
16990 explicit args will completely resolve the templates in question. */
16993 tree expl_subargs
= TREE_OPERAND (arg
, 1);
16994 arg
= TREE_OPERAND (arg
, 0);
16996 for (; arg
; arg
= OVL_NEXT (arg
))
16998 tree fn
= OVL_CURRENT (arg
);
16999 tree subargs
, elem
;
17001 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17004 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17005 expl_subargs
, NULL_TREE
, tf_none
,
17006 /*require_all_args=*/true,
17007 /*use_default_args=*/true);
17008 if (subargs
!= error_mark_node
17009 && !any_dependent_template_arguments_p (subargs
))
17011 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
17012 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
17013 elem
, strict
, sub_strict
, addr_p
, explain_p
)
17014 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
17023 /* If no templates (or more than one) are fully resolved by the
17024 explicit arguments, this template-id is a non-deduced context; it
17025 could still be OK if we deduce all template arguments for the
17026 enclosing call through other arguments. */
17030 else if (TREE_CODE (arg
) != OVERLOAD
17031 && TREE_CODE (arg
) != FUNCTION_DECL
)
17032 /* If ARG is, for example, "(0, &f)" then its type will be unknown
17033 -- but the deduction does not succeed because the expression is
17034 not just the function on its own. */
17037 for (; arg
; arg
= OVL_NEXT (arg
))
17038 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
17039 TREE_TYPE (OVL_CURRENT (arg
)),
17040 strict
, sub_strict
, addr_p
, explain_p
)
17041 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
17043 goodfn
= OVL_CURRENT (arg
);
17047 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17048 to function or pointer to member function argument if the set of
17049 overloaded functions does not contain function templates and at most
17050 one of a set of overloaded functions provides a unique match.
17052 So if we found multiple possibilities, we return success but don't
17053 deduce anything. */
17057 int i
= TREE_VEC_LENGTH (targs
);
17059 if (TREE_VEC_ELT (tempargs
, i
))
17061 tree old
= TREE_VEC_ELT (targs
, i
);
17062 tree new_
= TREE_VEC_ELT (tempargs
, i
);
17063 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
17064 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
17065 /* Don't forget explicit template arguments in a pack. */
17066 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
17067 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
17068 TREE_VEC_ELT (targs
, i
) = new_
;
17077 /* Core DR 115: In contexts where deduction is done and fails, or in
17078 contexts where deduction is not done, if a template argument list is
17079 specified and it, along with any default template arguments, identifies
17080 a single function template specialization, then the template-id is an
17081 lvalue for the function template specialization. */
17084 resolve_nondeduced_context (tree orig_expr
)
17086 tree expr
, offset
, baselink
;
17089 if (!type_unknown_p (orig_expr
))
17094 offset
= NULL_TREE
;
17095 baselink
= NULL_TREE
;
17097 if (TREE_CODE (expr
) == ADDR_EXPR
)
17099 expr
= TREE_OPERAND (expr
, 0);
17102 if (TREE_CODE (expr
) == OFFSET_REF
)
17105 expr
= TREE_OPERAND (expr
, 1);
17107 if (BASELINK_P (expr
))
17110 expr
= BASELINK_FUNCTIONS (expr
);
17113 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
17116 tree goodfn
= NULL_TREE
;
17118 /* If we got some explicit template args, we need to plug them into
17119 the affected templates before we try to unify, in case the
17120 explicit args will completely resolve the templates in question. */
17122 tree expl_subargs
= TREE_OPERAND (expr
, 1);
17123 tree arg
= TREE_OPERAND (expr
, 0);
17124 tree badfn
= NULL_TREE
;
17125 tree badargs
= NULL_TREE
;
17127 for (; arg
; arg
= OVL_NEXT (arg
))
17129 tree fn
= OVL_CURRENT (arg
);
17130 tree subargs
, elem
;
17132 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17135 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17136 expl_subargs
, NULL_TREE
, tf_none
,
17137 /*require_all_args=*/true,
17138 /*use_default_args=*/true);
17139 if (subargs
!= error_mark_node
17140 && !any_dependent_template_arguments_p (subargs
))
17142 elem
= instantiate_template (fn
, subargs
, tf_none
);
17143 if (elem
== error_mark_node
)
17148 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17157 mark_used (goodfn
);
17160 expr
= build_baselink (BASELINK_BINFO (baselink
),
17161 BASELINK_ACCESS_BINFO (baselink
),
17162 expr
, BASELINK_OPTYPE (baselink
));
17166 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17167 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17170 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17173 else if (good
== 0 && badargs
)
17174 /* There were no good options and at least one bad one, so let the
17175 user know what the problem is. */
17176 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17181 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17182 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17183 different overloads deduce different arguments for a given parm.
17184 ADDR_P is true if the expression for which deduction is being
17185 performed was of the form "& fn" rather than simply "fn".
17187 Returns 1 on success. */
17190 try_one_overload (tree tparms
,
17195 unification_kind_t strict
,
17204 if (arg
== error_mark_node
)
17207 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17208 to function or pointer to member function argument if the set of
17209 overloaded functions does not contain function templates and at most
17210 one of a set of overloaded functions provides a unique match.
17212 So if this is a template, just return success. */
17214 if (uses_template_parms (arg
))
17217 if (TREE_CODE (arg
) == METHOD_TYPE
)
17218 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
17220 arg
= build_pointer_type (arg
);
17222 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
17224 /* We don't copy orig_targs for this because if we have already deduced
17225 some template args from previous args, unify would complain when we
17226 try to deduce a template parameter for the same argument, even though
17227 there isn't really a conflict. */
17228 nargs
= TREE_VEC_LENGTH (targs
);
17229 tempargs
= make_tree_vec (nargs
);
17231 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
17234 /* First make sure we didn't deduce anything that conflicts with
17235 explicitly specified args. */
17236 for (i
= nargs
; i
--; )
17238 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17239 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
17243 else if (uses_template_parms (elt
))
17244 /* Since we're unifying against ourselves, we will fill in
17245 template args used in the function parm list with our own
17246 template parms. Discard them. */
17247 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
17248 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
17252 for (i
= nargs
; i
--; )
17254 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17257 TREE_VEC_ELT (targs
, i
) = elt
;
17263 /* PARM is a template class (perhaps with unbound template
17264 parameters). ARG is a fully instantiated type. If ARG can be
17265 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
17266 TARGS are as for unify. */
17269 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
17272 tree copy_of_targs
;
17274 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
17275 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
17276 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
17279 /* We need to make a new template argument vector for the call to
17280 unify. If we used TARGS, we'd clutter it up with the result of
17281 the attempted unification, even if this class didn't work out.
17282 We also don't want to commit ourselves to all the unifications
17283 we've already done, since unification is supposed to be done on
17284 an argument-by-argument basis. In other words, consider the
17285 following pathological case:
17287 template <int I, int J, int K>
17290 template <int I, int J>
17291 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
17293 template <int I, int J, int K>
17294 void f(S<I, J, K>, S<I, I, I>);
17303 Now, by the time we consider the unification involving `s2', we
17304 already know that we must have `f<0, 0, 0>'. But, even though
17305 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17306 because there are two ways to unify base classes of S<0, 1, 2>
17307 with S<I, I, I>. If we kept the already deduced knowledge, we
17308 would reject the possibility I=1. */
17309 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
17311 /* If unification failed, we're done. */
17312 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
17313 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
17319 /* Given a template type PARM and a class type ARG, find the unique
17320 base type in ARG that is an instance of PARM. We do not examine
17321 ARG itself; only its base-classes. If there is not exactly one
17322 appropriate base class, return NULL_TREE. PARM may be the type of
17323 a partial specialization, as well as a plain template type. Used
17326 static enum template_base_result
17327 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
17328 bool explain_p
, tree
*result
)
17330 tree rval
= NULL_TREE
;
17333 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
17335 binfo
= TYPE_BINFO (complete_type (arg
));
17338 /* The type could not be completed. */
17339 *result
= NULL_TREE
;
17340 return tbr_incomplete_type
;
17343 /* Walk in inheritance graph order. The search order is not
17344 important, and this avoids multiple walks of virtual bases. */
17345 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
17347 tree r
= try_class_unification (tparms
, targs
, parm
,
17348 BINFO_TYPE (binfo
), explain_p
);
17352 /* If there is more than one satisfactory baseclass, then:
17356 If they yield more than one possible deduced A, the type
17360 if (rval
&& !same_type_p (r
, rval
))
17362 *result
= NULL_TREE
;
17363 return tbr_ambiguous_baseclass
;
17371 return tbr_success
;
17374 /* Returns the level of DECL, which declares a template parameter. */
17377 template_decl_level (tree decl
)
17379 switch (TREE_CODE (decl
))
17382 case TEMPLATE_DECL
:
17383 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
17386 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
17389 gcc_unreachable ();
17394 /* Decide whether ARG can be unified with PARM, considering only the
17395 cv-qualifiers of each type, given STRICT as documented for unify.
17396 Returns nonzero iff the unification is OK on that basis. */
17399 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17401 int arg_quals
= cp_type_quals (arg
);
17402 int parm_quals
= cp_type_quals (parm
);
17404 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17405 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17407 /* Although a CVR qualifier is ignored when being applied to a
17408 substituted template parameter ([8.3.2]/1 for example), that
17409 does not allow us to unify "const T" with "int&" because both
17410 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17411 It is ok when we're allowing additional CV qualifiers
17412 at the outer level [14.8.2.1]/3,1st bullet. */
17413 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17414 || TREE_CODE (arg
) == FUNCTION_TYPE
17415 || TREE_CODE (arg
) == METHOD_TYPE
)
17416 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17419 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17420 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17424 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17425 && (arg_quals
& parm_quals
) != parm_quals
)
17428 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17429 && (parm_quals
& arg_quals
) != arg_quals
)
17435 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17437 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17439 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17440 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17441 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17443 *index
= TEMPLATE_TYPE_IDX (parm
);
17444 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17448 *index
= TEMPLATE_PARM_IDX (parm
);
17449 *level
= TEMPLATE_PARM_LEVEL (parm
);
17453 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17455 if (unify (TP, TA, P, A, S, EP)) \
17459 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17460 expansion at the end of PACKED_PARMS. Returns 0 if the type
17461 deduction succeeds, 1 otherwise. STRICT is the same as in
17462 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17463 call argument list. We'll need to adjust the arguments to make them
17464 types. SUBR tells us if this is from a recursive call to
17465 type_unification_real, or for comparing two template argument
17469 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17470 tree packed_args
, unification_kind_t strict
,
17471 bool subr
, bool explain_p
)
17474 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17475 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17476 tree pack
, packs
= NULL_TREE
;
17477 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17479 packed_args
= expand_template_argument_pack (packed_args
);
17481 int len
= TREE_VEC_LENGTH (packed_args
);
17483 /* Determine the parameter packs we will be deducing from the
17484 pattern, and record their current deductions. */
17485 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17486 pack
; pack
= TREE_CHAIN (pack
))
17488 tree parm_pack
= TREE_VALUE (pack
);
17491 /* Determine the index and level of this parameter pack. */
17492 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17494 /* Keep track of the parameter packs and their corresponding
17496 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17497 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17500 /* Loop through all of the arguments that have not yet been
17501 unified and unify each with the pattern. */
17502 for (i
= start
; i
< len
; i
++)
17505 bool any_explicit
= false;
17506 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17508 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17509 or the element of its argument pack at the current index if
17510 this argument was explicitly specified. */
17511 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17515 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17518 if (TREE_VALUE (pack
)
17519 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17520 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17522 any_explicit
= true;
17523 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17525 TMPL_ARG (targs
, level
, idx
) = arg
;
17528 /* If we had explicit template arguments, substitute them into the
17529 pattern before deduction. */
17532 /* Some arguments might still be unspecified or dependent. */
17534 ++processing_template_decl
;
17535 dependent
= any_dependent_template_arguments_p (targs
);
17537 --processing_template_decl
;
17538 parm
= tsubst (pattern
, targs
,
17539 explain_p
? tf_warning_or_error
: tf_none
,
17542 --processing_template_decl
;
17543 if (parm
== error_mark_node
)
17549 /* Unify the pattern with the current argument. */
17550 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17551 LOOKUP_IMPLICIT
, explain_p
))
17554 /* For each parameter pack, collect the deduced value. */
17555 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17558 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17560 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17561 TMPL_ARG (targs
, level
, idx
);
17565 /* Verify that the results of unification with the parameter packs
17566 produce results consistent with what we've seen before, and make
17567 the deduced argument packs available. */
17568 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17570 tree old_pack
= TREE_VALUE (pack
);
17571 tree new_args
= TREE_TYPE (pack
);
17572 int i
, len
= TREE_VEC_LENGTH (new_args
);
17574 bool nondeduced_p
= false;
17576 /* By default keep the original deduced argument pack.
17577 If necessary, more specific code is going to update the
17578 resulting deduced argument later down in this function. */
17579 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17580 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17582 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17583 actually deduce anything. */
17584 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17585 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17586 nondeduced_p
= true;
17590 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17592 /* If we had fewer function args than explicit template args,
17593 just use the explicits. */
17594 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17595 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17596 if (len
< explicit_len
)
17597 new_args
= explicit_args
;
17603 /* Build the deduced *_ARGUMENT_PACK. */
17604 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17606 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17607 TREE_TYPE (result
) =
17608 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17609 TREE_CONSTANT (result
) = 1;
17612 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17614 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17616 /* Note the deduced argument packs for this parameter
17618 TMPL_ARG (targs
, level
, idx
) = result
;
17620 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17621 && (ARGUMENT_PACK_ARGS (old_pack
)
17622 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17624 /* We only had the explicitly-provided arguments before, but
17625 now we have a complete set of arguments. */
17626 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17628 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17629 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17630 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17634 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17635 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17637 if (!comp_template_args_with_info (old_args
, new_args
,
17638 &bad_old_arg
, &bad_new_arg
))
17639 /* Inconsistent unification of this parameter pack. */
17640 return unify_parameter_pack_inconsistent (explain_p
,
17646 return unify_success (explain_p
);
17649 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17650 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17651 parameters and return value are as for unify. */
17654 unify_array_domain (tree tparms
, tree targs
,
17655 tree parm_dom
, tree arg_dom
,
17663 /* Our representation of array types uses "N - 1" as the
17664 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17665 not an integer constant. We cannot unify arbitrarily
17666 complex expressions, so we eliminate the MINUS_EXPRs
17668 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17669 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17672 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17673 parm_max
= TREE_OPERAND (parm_max
, 0);
17675 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17676 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17679 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17680 trying to unify the type of a variable with the type
17681 of a template parameter. For example:
17683 template <unsigned int N>
17684 void f (char (&) [N]);
17691 Here, the type of the ARG will be "int [g(i)]", and
17692 may be a SAVE_EXPR, etc. */
17693 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17694 return unify_vla_arg (explain_p
, arg_dom
);
17695 arg_max
= TREE_OPERAND (arg_max
, 0);
17698 /* If only one of the bounds used a MINUS_EXPR, compensate
17699 by adding one to the other bound. */
17700 if (parm_cst
&& !arg_cst
)
17701 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17705 else if (arg_cst
&& !parm_cst
)
17706 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17711 return unify (tparms
, targs
, parm_max
, arg_max
,
17712 UNIFY_ALLOW_INTEGER
, explain_p
);
17715 /* Deduce the value of template parameters. TPARMS is the (innermost)
17716 set of template parameters to a template. TARGS is the bindings
17717 for those template parameters, as determined thus far; TARGS may
17718 include template arguments for outer levels of template parameters
17719 as well. PARM is a parameter to a template function, or a
17720 subcomponent of that parameter; ARG is the corresponding argument.
17721 This function attempts to match PARM with ARG in a manner
17722 consistent with the existing assignments in TARGS. If more values
17723 are deduced, then TARGS is updated.
17725 Returns 0 if the type deduction succeeds, 1 otherwise. The
17726 parameter STRICT is a bitwise or of the following flags:
17729 Require an exact match between PARM and ARG.
17730 UNIFY_ALLOW_MORE_CV_QUAL:
17731 Allow the deduced ARG to be more cv-qualified (by qualification
17732 conversion) than ARG.
17733 UNIFY_ALLOW_LESS_CV_QUAL:
17734 Allow the deduced ARG to be less cv-qualified than ARG.
17735 UNIFY_ALLOW_DERIVED:
17736 Allow the deduced ARG to be a template base class of ARG,
17737 or a pointer to a template base class of the type pointed to by
17739 UNIFY_ALLOW_INTEGER:
17740 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17741 case for more information.
17742 UNIFY_ALLOW_OUTER_LEVEL:
17743 This is the outermost level of a deduction. Used to determine validity
17744 of qualification conversions. A valid qualification conversion must
17745 have const qualified pointers leading up to the inner type which
17746 requires additional CV quals, except at the outer level, where const
17747 is not required [conv.qual]. It would be normal to set this flag in
17748 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17749 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17750 This is the outermost level of a deduction, and PARM can be more CV
17751 qualified at this point.
17752 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17753 This is the outermost level of a deduction, and PARM can be less CV
17754 qualified at this point. */
17757 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
17763 int strict_in
= strict
;
17765 /* I don't think this will do the right thing with respect to types.
17766 But the only case I've seen it in so far has been array bounds, where
17767 signedness is the only information lost, and I think that will be
17769 while (TREE_CODE (parm
) == NOP_EXPR
)
17770 parm
= TREE_OPERAND (parm
, 0);
17772 if (arg
== error_mark_node
)
17773 return unify_invalid (explain_p
);
17774 if (arg
== unknown_type_node
17775 || arg
== init_list_type_node
)
17776 /* We can't deduce anything from this, but we might get all the
17777 template args from other function args. */
17778 return unify_success (explain_p
);
17780 /* If PARM uses template parameters, then we can't bail out here,
17781 even if ARG == PARM, since we won't record unifications for the
17782 template parameters. We might need them if we're trying to
17783 figure out which of two things is more specialized. */
17784 if (arg
== parm
&& !uses_template_parms (parm
))
17785 return unify_success (explain_p
);
17787 /* Handle init lists early, so the rest of the function can assume
17788 we're dealing with a type. */
17789 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
17793 tree orig_parm
= parm
;
17795 /* Replace T with std::initializer_list<T> for deduction. */
17796 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17797 && flag_deduce_init_list
)
17798 parm
= listify (parm
);
17800 if (!is_std_init_list (parm
)
17801 && TREE_CODE (parm
) != ARRAY_TYPE
)
17802 /* We can only deduce from an initializer list argument if the
17803 parameter is std::initializer_list or an array; otherwise this
17804 is a non-deduced context. */
17805 return unify_success (explain_p
);
17807 if (TREE_CODE (parm
) == ARRAY_TYPE
)
17808 elttype
= TREE_TYPE (parm
);
17810 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
17812 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
17814 int elt_strict
= strict
;
17816 if (elt
== error_mark_node
)
17817 return unify_invalid (explain_p
);
17819 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
17821 tree type
= TREE_TYPE (elt
);
17822 /* It should only be possible to get here for a call. */
17823 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
17824 elt_strict
|= maybe_adjust_types_for_deduction
17825 (DEDUCE_CALL
, &elttype
, &type
, elt
);
17829 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
17833 if (TREE_CODE (parm
) == ARRAY_TYPE
17834 && deducible_array_bound (TYPE_DOMAIN (parm
)))
17836 /* Also deduce from the length of the initializer list. */
17837 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
17838 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
17839 if (idx
== error_mark_node
)
17840 return unify_invalid (explain_p
);
17841 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17845 /* If the std::initializer_list<T> deduction worked, replace the
17846 deduced A with std::initializer_list<A>. */
17847 if (orig_parm
!= parm
)
17849 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
17850 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17851 targ
= listify (targ
);
17852 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
17854 return unify_success (explain_p
);
17857 /* Immediately reject some pairs that won't unify because of
17858 cv-qualification mismatches. */
17859 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17861 /* It is the elements of the array which hold the cv quals of an array
17862 type, and the elements might be template type parms. We'll check
17863 when we recurse. */
17864 && TREE_CODE (arg
) != ARRAY_TYPE
17865 /* We check the cv-qualifiers when unifying with template type
17866 parameters below. We want to allow ARG `const T' to unify with
17867 PARM `T' for example, when computing which of two templates
17868 is more specialized, for example. */
17869 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
17870 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
17871 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17873 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
17874 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
17875 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
17876 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
17877 strict
&= ~UNIFY_ALLOW_DERIVED
;
17878 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17879 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
17881 switch (TREE_CODE (parm
))
17883 case TYPENAME_TYPE
:
17885 case UNBOUND_CLASS_TEMPLATE
:
17886 /* In a type which contains a nested-name-specifier, template
17887 argument values cannot be deduced for template parameters used
17888 within the nested-name-specifier. */
17889 return unify_success (explain_p
);
17891 case TEMPLATE_TYPE_PARM
:
17892 case TEMPLATE_TEMPLATE_PARM
:
17893 case BOUND_TEMPLATE_TEMPLATE_PARM
:
17894 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17895 if (error_operand_p (tparm
))
17896 return unify_invalid (explain_p
);
17898 if (TEMPLATE_TYPE_LEVEL (parm
)
17899 != template_decl_level (tparm
))
17900 /* The PARM is not one we're trying to unify. Just check
17901 to see if it matches ARG. */
17903 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17904 && (is_auto (parm
) ? is_auto (arg
)
17905 : same_type_p (parm
, arg
)))
17906 return unify_success (explain_p
);
17908 return unify_type_mismatch (explain_p
, parm
, arg
);
17910 idx
= TEMPLATE_TYPE_IDX (parm
);
17911 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17912 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
17913 if (error_operand_p (tparm
))
17914 return unify_invalid (explain_p
);
17916 /* Check for mixed types and values. */
17917 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17918 && TREE_CODE (tparm
) != TYPE_DECL
)
17919 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17920 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
17921 gcc_unreachable ();
17923 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17925 /* ARG must be constructed from a template class or a template
17926 template parameter. */
17927 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
17928 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
17929 return unify_template_deduction_failure (explain_p
, parm
, arg
);
17931 tree parmvec
= TYPE_TI_ARGS (parm
);
17932 /* An alias template name is never deduced. */
17933 if (TYPE_ALIAS_P (arg
))
17934 arg
= strip_typedefs (arg
);
17935 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
17936 tree full_argvec
= add_to_template_args (targs
, argvec
);
17938 = DECL_INNERMOST_TEMPLATE_PARMS
17939 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
17941 int parm_variadic_p
= 0;
17943 /* The resolution to DR150 makes clear that default
17944 arguments for an N-argument may not be used to bind T
17945 to a template template parameter with fewer than N
17946 parameters. It is not safe to permit the binding of
17947 default arguments as an extension, as that may change
17948 the meaning of a conforming program. Consider:
17950 struct Dense { static const unsigned int dim = 1; };
17952 template <template <typename> class View,
17954 void operator+(float, View<Block> const&);
17956 template <typename Block,
17957 unsigned int Dim = Block::dim>
17958 struct Lvalue_proxy { operator float() const; };
17962 Lvalue_proxy<Dense> p;
17967 Here, if Lvalue_proxy is permitted to bind to View, then
17968 the global operator+ will be used; if they are not, the
17969 Lvalue_proxy will be converted to float. */
17970 if (coerce_template_parms (parm_parms
,
17972 TYPE_TI_TEMPLATE (parm
),
17974 ? tf_warning_or_error
17976 /*require_all_args=*/true,
17977 /*use_default_args=*/false)
17978 == error_mark_node
)
17981 /* Deduce arguments T, i from TT<T> or TT<i>.
17982 We check each element of PARMVEC and ARGVEC individually
17983 rather than the whole TREE_VEC since they can have
17984 different number of elements. */
17986 parmvec
= expand_template_argument_pack (parmvec
);
17987 argvec
= expand_template_argument_pack (argvec
);
17989 len
= TREE_VEC_LENGTH (parmvec
);
17991 /* Check if the parameters end in a pack, making them
17994 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
17995 parm_variadic_p
= 1;
17997 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17998 /* If the template argument list of P contains a pack
17999 expansion that is not the last template argument, the
18000 entire template argument list is a non-deduced
18002 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
18003 return unify_success (explain_p
);
18005 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
18006 return unify_too_few_arguments (explain_p
,
18007 TREE_VEC_LENGTH (argvec
), len
);
18009 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18011 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18012 TREE_VEC_ELT (parmvec
, i
),
18013 TREE_VEC_ELT (argvec
, i
),
18014 UNIFY_ALLOW_NONE
, explain_p
);
18017 if (parm_variadic_p
18018 && unify_pack_expansion (tparms
, targs
,
18021 /*subr=*/true, explain_p
))
18024 arg
= TYPE_TI_TEMPLATE (arg
);
18026 /* Fall through to deduce template name. */
18029 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18030 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18032 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
18034 /* Simple cases: Value already set, does match or doesn't. */
18035 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
18036 return unify_success (explain_p
);
18038 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
18042 /* If PARM is `const T' and ARG is only `int', we don't have
18043 a match unless we are allowing additional qualification.
18044 If ARG is `const int' and PARM is just `T' that's OK;
18045 that binds `const int' to `T'. */
18046 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
18048 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18050 /* Consider the case where ARG is `const volatile int' and
18051 PARM is `const T'. Then, T should be `volatile int'. */
18052 arg
= cp_build_qualified_type_real
18053 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
18054 if (arg
== error_mark_node
)
18055 return unify_invalid (explain_p
);
18057 /* Simple cases: Value already set, does match or doesn't. */
18058 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
18059 return unify_success (explain_p
);
18061 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
18063 /* Make sure that ARG is not a variable-sized array. (Note
18064 that were talking about variable-sized arrays (like
18065 `int[n]'), rather than arrays of unknown size (like
18066 `int[]').) We'll get very confused by such a type since
18067 the bound of the array is not constant, and therefore
18068 not mangleable. Besides, such types are not allowed in
18069 ISO C++, so we can do as we please here. We do allow
18070 them for 'auto' deduction, since that isn't ABI-exposed. */
18071 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
18072 return unify_vla_arg (explain_p
, arg
);
18074 /* Strip typedefs as in convert_template_argument. */
18075 arg
= canonicalize_type_argument (arg
, tf_none
);
18078 /* If ARG is a parameter pack or an expansion, we cannot unify
18079 against it unless PARM is also a parameter pack. */
18080 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18081 && !template_parameter_pack_p (parm
))
18082 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18084 /* If the argument deduction results is a METHOD_TYPE,
18085 then there is a problem.
18086 METHOD_TYPE doesn't map to any real C++ type the result of
18087 the deduction can not be of that type. */
18088 if (TREE_CODE (arg
) == METHOD_TYPE
)
18089 return unify_method_type_error (explain_p
, arg
);
18091 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18092 return unify_success (explain_p
);
18094 case TEMPLATE_PARM_INDEX
:
18095 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
18096 if (error_operand_p (tparm
))
18097 return unify_invalid (explain_p
);
18099 if (TEMPLATE_PARM_LEVEL (parm
)
18100 != template_decl_level (tparm
))
18102 /* The PARM is not one we're trying to unify. Just check
18103 to see if it matches ARG. */
18104 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
18105 && cp_tree_equal (parm
, arg
));
18107 unify_expression_unequal (explain_p
, parm
, arg
);
18111 idx
= TEMPLATE_PARM_IDX (parm
);
18112 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18116 int x
= !cp_tree_equal (targ
, arg
);
18118 unify_inconsistency (explain_p
, parm
, targ
, arg
);
18122 /* [temp.deduct.type] If, in the declaration of a function template
18123 with a non-type template-parameter, the non-type
18124 template-parameter is used in an expression in the function
18125 parameter-list and, if the corresponding template-argument is
18126 deduced, the template-argument type shall match the type of the
18127 template-parameter exactly, except that a template-argument
18128 deduced from an array bound may be of any integral type.
18129 The non-type parameter might use already deduced type parameters. */
18130 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
18131 if (!TREE_TYPE (arg
))
18132 /* Template-parameter dependent expression. Just accept it for now.
18133 It will later be processed in convert_template_argument. */
18135 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18137 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18138 && CP_INTEGRAL_TYPE_P (tparm
))
18139 /* Convert the ARG to the type of PARM; the deduced non-type
18140 template argument must exactly match the types of the
18141 corresponding parameter. */
18142 arg
= fold (build_nop (tparm
, arg
));
18143 else if (uses_template_parms (tparm
))
18144 /* We haven't deduced the type of this parameter yet. Try again
18146 return unify_success (explain_p
);
18148 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18150 /* If ARG is a parameter pack or an expansion, we cannot unify
18151 against it unless PARM is also a parameter pack. */
18152 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18153 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18154 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18156 arg
= strip_typedefs_expr (arg
);
18157 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18158 return unify_success (explain_p
);
18162 /* A pointer-to-member constant can be unified only with
18163 another constant. */
18164 if (TREE_CODE (arg
) != PTRMEM_CST
)
18165 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18167 /* Just unify the class member. It would be useless (and possibly
18168 wrong, depending on the strict flags) to unify also
18169 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18170 arg refer to the same variable, even if through different
18171 classes. For instance:
18173 struct A { int x; };
18176 Unification of &A::x and &B::x must succeed. */
18177 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18178 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18183 if (!TYPE_PTR_P (arg
))
18184 return unify_type_mismatch (explain_p
, parm
, arg
);
18186 /* [temp.deduct.call]
18188 A can be another pointer or pointer to member type that can
18189 be converted to the deduced A via a qualification
18190 conversion (_conv.qual_).
18192 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18193 This will allow for additional cv-qualification of the
18194 pointed-to types if appropriate. */
18196 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18197 /* The derived-to-base conversion only persists through one
18198 level of pointers. */
18199 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
18201 return unify (tparms
, targs
, TREE_TYPE (parm
),
18202 TREE_TYPE (arg
), strict
, explain_p
);
18205 case REFERENCE_TYPE
:
18206 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
18207 return unify_type_mismatch (explain_p
, parm
, arg
);
18208 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18209 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18212 if (TREE_CODE (arg
) != ARRAY_TYPE
)
18213 return unify_type_mismatch (explain_p
, parm
, arg
);
18214 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
18215 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
18216 return unify_type_mismatch (explain_p
, parm
, arg
);
18217 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18218 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18219 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
18220 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18221 TYPE_DOMAIN (arg
), explain_p
);
18222 return unify_success (explain_p
);
18229 case ENUMERAL_TYPE
:
18232 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18233 return unify_type_mismatch (explain_p
, parm
, arg
);
18235 /* We have already checked cv-qualification at the top of the
18237 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
18238 return unify_type_mismatch (explain_p
, parm
, arg
);
18240 /* As far as unification is concerned, this wins. Later checks
18241 will invalidate it if necessary. */
18242 return unify_success (explain_p
);
18244 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
18245 /* Type INTEGER_CST can come from ordinary constant template args. */
18247 while (TREE_CODE (arg
) == NOP_EXPR
)
18248 arg
= TREE_OPERAND (arg
, 0);
18250 if (TREE_CODE (arg
) != INTEGER_CST
)
18251 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18252 return (tree_int_cst_equal (parm
, arg
)
18253 ? unify_success (explain_p
)
18254 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
18258 int i
, len
, argslen
;
18259 int parm_variadic_p
= 0;
18261 if (TREE_CODE (arg
) != TREE_VEC
)
18262 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18264 len
= TREE_VEC_LENGTH (parm
);
18265 argslen
= TREE_VEC_LENGTH (arg
);
18267 /* Check for pack expansions in the parameters. */
18268 for (i
= 0; i
< len
; ++i
)
18270 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
18273 /* We can unify against something with a trailing
18275 parm_variadic_p
= 1;
18277 /* [temp.deduct.type]/9: If the template argument list of
18278 P contains a pack expansion that is not the last
18279 template argument, the entire template argument list
18280 is a non-deduced context. */
18281 return unify_success (explain_p
);
18285 /* If we don't have enough arguments to satisfy the parameters
18286 (not counting the pack expression at the end), or we have
18287 too many arguments for a parameter list that doesn't end in
18288 a pack expression, we can't unify. */
18289 if (parm_variadic_p
18290 ? argslen
< len
- parm_variadic_p
18292 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
18294 /* Unify all of the parameters that precede the (optional)
18295 pack expression. */
18296 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18298 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18299 TREE_VEC_ELT (parm
, i
),
18300 TREE_VEC_ELT (arg
, i
),
18301 UNIFY_ALLOW_NONE
, explain_p
);
18303 if (parm_variadic_p
)
18304 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
18306 /*subr=*/true, explain_p
);
18307 return unify_success (explain_p
);
18312 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18313 return unify_type_mismatch (explain_p
, parm
, arg
);
18315 if (TYPE_PTRMEMFUNC_P (parm
))
18317 if (!TYPE_PTRMEMFUNC_P (arg
))
18318 return unify_type_mismatch (explain_p
, parm
, arg
);
18320 return unify (tparms
, targs
,
18321 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
18322 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
18323 strict
, explain_p
);
18325 else if (TYPE_PTRMEMFUNC_P (arg
))
18326 return unify_type_mismatch (explain_p
, parm
, arg
);
18328 if (CLASSTYPE_TEMPLATE_INFO (parm
))
18330 tree t
= NULL_TREE
;
18332 if (strict_in
& UNIFY_ALLOW_DERIVED
)
18334 /* First, we try to unify the PARM and ARG directly. */
18335 t
= try_class_unification (tparms
, targs
,
18336 parm
, arg
, explain_p
);
18340 /* Fallback to the special case allowed in
18341 [temp.deduct.call]:
18343 If P is a class, and P has the form
18344 template-id, then A can be a derived class of
18345 the deduced A. Likewise, if P is a pointer to
18346 a class of the form template-id, A can be a
18347 pointer to a derived class pointed to by the
18349 enum template_base_result r
;
18350 r
= get_template_base (tparms
, targs
, parm
, arg
,
18354 return unify_no_common_base (explain_p
, r
, parm
, arg
);
18357 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
18358 && (CLASSTYPE_TI_TEMPLATE (parm
)
18359 == CLASSTYPE_TI_TEMPLATE (arg
)))
18360 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18361 Then, we should unify `int' and `U'. */
18364 /* There's no chance of unification succeeding. */
18365 return unify_type_mismatch (explain_p
, parm
, arg
);
18367 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
18368 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
18370 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
18371 return unify_type_mismatch (explain_p
, parm
, arg
);
18372 return unify_success (explain_p
);
18375 case FUNCTION_TYPE
:
18377 unsigned int nargs
;
18382 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18383 return unify_type_mismatch (explain_p
, parm
, arg
);
18385 /* CV qualifications for methods can never be deduced, they must
18386 match exactly. We need to check them explicitly here,
18387 because type_unification_real treats them as any other
18388 cv-qualified parameter. */
18389 if (TREE_CODE (parm
) == METHOD_TYPE
18390 && (!check_cv_quals_for_unify
18392 class_of_this_parm (arg
),
18393 class_of_this_parm (parm
))))
18394 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18396 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18397 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18399 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18400 args
= XALLOCAVEC (tree
, nargs
);
18401 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18402 a
!= NULL_TREE
&& a
!= void_list_node
;
18403 a
= TREE_CHAIN (a
), ++i
)
18404 args
[i
] = TREE_VALUE (a
);
18407 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18408 args
, nargs
, 1, DEDUCE_EXACT
,
18409 LOOKUP_NORMAL
, NULL
, explain_p
);
18413 /* Unify a pointer to member with a pointer to member function, which
18414 deduces the type of the member as a function type. */
18415 if (TYPE_PTRMEMFUNC_P (arg
))
18417 /* Check top-level cv qualifiers */
18418 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18419 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18421 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18422 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18423 UNIFY_ALLOW_NONE
, explain_p
);
18425 /* Determine the type of the function we are unifying against. */
18426 tree fntype
= static_fn_type (arg
);
18428 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18431 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18432 return unify_type_mismatch (explain_p
, parm
, arg
);
18433 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18434 TYPE_OFFSET_BASETYPE (arg
),
18435 UNIFY_ALLOW_NONE
, explain_p
);
18436 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18437 strict
, explain_p
);
18440 if (DECL_TEMPLATE_PARM_P (parm
))
18441 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18442 if (arg
!= scalar_constant_value (parm
))
18443 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18444 return unify_success (explain_p
);
18447 case TEMPLATE_DECL
:
18448 /* Matched cases are handled by the ARG == PARM test above. */
18449 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18452 /* A non-type template parameter that is a variable should be a
18453 an integral constant, in which case, it whould have been
18454 folded into its (constant) value. So we should not be getting
18455 a variable here. */
18456 gcc_unreachable ();
18458 case TYPE_ARGUMENT_PACK
:
18459 case NONTYPE_ARGUMENT_PACK
:
18460 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18461 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18464 case DECLTYPE_TYPE
:
18465 case UNDERLYING_TYPE
:
18466 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18467 or UNDERLYING_TYPE nodes. */
18468 return unify_success (explain_p
);
18471 /* Unification fails if we hit an error node. */
18472 return unify_invalid (explain_p
);
18475 if (REFERENCE_REF_P (parm
))
18476 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18477 strict
, explain_p
);
18481 /* An unresolved overload is a nondeduced context. */
18482 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18483 return unify_success (explain_p
);
18484 gcc_assert (EXPR_P (parm
));
18486 /* We must be looking at an expression. This can happen with
18490 void foo(S<I>, S<I + 2>);
18492 This is a "nondeduced context":
18496 The nondeduced contexts are:
18498 --A type that is a template-id in which one or more of
18499 the template-arguments is an expression that references
18500 a template-parameter.
18502 In these cases, we assume deduction succeeded, but don't
18503 actually infer any unifications. */
18505 if (!uses_template_parms (parm
)
18506 && !template_args_equal (parm
, arg
))
18507 return unify_expression_unequal (explain_p
, parm
, arg
);
18509 return unify_success (explain_p
);
18512 #undef RECUR_AND_CHECK_FAILURE
18514 /* Note that DECL can be defined in this translation unit, if
18518 mark_definable (tree decl
)
18521 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18522 FOR_EACH_CLONE (clone
, decl
)
18523 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18526 /* Called if RESULT is explicitly instantiated, or is a member of an
18527 explicitly instantiated class. */
18530 mark_decl_instantiated (tree result
, int extern_p
)
18532 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18534 /* If this entity has already been written out, it's too late to
18535 make any modifications. */
18536 if (TREE_ASM_WRITTEN (result
))
18539 /* For anonymous namespace we don't need to do anything. */
18540 if (decl_anon_ns_mem_p (result
))
18542 gcc_assert (!TREE_PUBLIC (result
));
18546 if (TREE_CODE (result
) != FUNCTION_DECL
)
18547 /* The TREE_PUBLIC flag for function declarations will have been
18548 set correctly by tsubst. */
18549 TREE_PUBLIC (result
) = 1;
18551 /* This might have been set by an earlier implicit instantiation. */
18552 DECL_COMDAT (result
) = 0;
18555 DECL_NOT_REALLY_EXTERN (result
) = 0;
18558 mark_definable (result
);
18559 mark_needed (result
);
18560 /* Always make artificials weak. */
18561 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18562 comdat_linkage (result
);
18563 /* For WIN32 we also want to put explicit instantiations in
18564 linkonce sections. */
18565 else if (TREE_PUBLIC (result
))
18566 maybe_make_one_only (result
);
18569 /* If EXTERN_P, then this function will not be emitted -- unless
18570 followed by an explicit instantiation, at which point its linkage
18571 will be adjusted. If !EXTERN_P, then this function will be
18572 emitted here. In neither circumstance do we want
18573 import_export_decl to adjust the linkage. */
18574 DECL_INTERFACE_KNOWN (result
) = 1;
18577 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18578 important template arguments. If any are missing, we check whether
18579 they're important by using error_mark_node for substituting into any
18580 args that were used for partial ordering (the ones between ARGS and END)
18581 and seeing if it bubbles up. */
18584 check_undeduced_parms (tree targs
, tree args
, tree end
)
18586 bool found
= false;
18588 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18589 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18592 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18596 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18597 if (substed
== error_mark_node
)
18603 /* Given two function templates PAT1 and PAT2, return:
18605 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18606 -1 if PAT2 is more specialized than PAT1.
18607 0 if neither is more specialized.
18609 LEN indicates the number of parameters we should consider
18610 (defaulted parameters should not be considered).
18612 The 1998 std underspecified function template partial ordering, and
18613 DR214 addresses the issue. We take pairs of arguments, one from
18614 each of the templates, and deduce them against each other. One of
18615 the templates will be more specialized if all the *other*
18616 template's arguments deduce against its arguments and at least one
18617 of its arguments *does* *not* deduce against the other template's
18618 corresponding argument. Deduction is done as for class templates.
18619 The arguments used in deduction have reference and top level cv
18620 qualifiers removed. Iff both arguments were originally reference
18621 types *and* deduction succeeds in both directions, an lvalue reference
18622 wins against an rvalue reference and otherwise the template
18623 with the more cv-qualified argument wins for that pairing (if
18624 neither is more cv-qualified, they both are equal). Unlike regular
18625 deduction, after all the arguments have been deduced in this way,
18626 we do *not* verify the deduced template argument values can be
18627 substituted into non-deduced contexts.
18629 The logic can be a bit confusing here, because we look at deduce1 and
18630 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18631 can find template arguments for pat1 to make arg1 look like arg2, that
18632 means that arg2 is at least as specialized as arg1. */
18635 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18637 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18638 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18639 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18640 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18641 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18642 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18643 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18644 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18645 tree origs1
, origs2
;
18646 bool lose1
= false;
18647 bool lose2
= false;
18649 /* Remove the this parameter from non-static member functions. If
18650 one is a non-static member function and the other is not a static
18651 member function, remove the first parameter from that function
18652 also. This situation occurs for operator functions where we
18653 locate both a member function (with this pointer) and non-member
18654 operator (with explicit first operand). */
18655 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18657 len
--; /* LEN is the number of significant arguments for DECL1 */
18658 args1
= TREE_CHAIN (args1
);
18659 if (!DECL_STATIC_FUNCTION_P (decl2
))
18660 args2
= TREE_CHAIN (args2
);
18662 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18664 args2
= TREE_CHAIN (args2
);
18665 if (!DECL_STATIC_FUNCTION_P (decl1
))
18668 args1
= TREE_CHAIN (args1
);
18672 /* If only one is a conversion operator, they are unordered. */
18673 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18676 /* Consider the return type for a conversion function */
18677 if (DECL_CONV_FN_P (decl1
))
18679 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18680 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18684 processing_template_decl
++;
18690 /* Stop when an ellipsis is seen. */
18691 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18693 tree arg1
= TREE_VALUE (args1
);
18694 tree arg2
= TREE_VALUE (args2
);
18695 int deduce1
, deduce2
;
18701 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18702 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18704 /* When both arguments are pack expansions, we need only
18705 unify the patterns themselves. */
18706 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18707 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18709 /* This is the last comparison we need to do. */
18713 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18715 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18716 arg1
= TREE_TYPE (arg1
);
18717 quals1
= cp_type_quals (arg1
);
18720 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18722 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18723 arg2
= TREE_TYPE (arg2
);
18724 quals2
= cp_type_quals (arg2
);
18727 arg1
= TYPE_MAIN_VARIANT (arg1
);
18728 arg2
= TYPE_MAIN_VARIANT (arg2
);
18730 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
18732 int i
, len2
= list_length (args2
);
18733 tree parmvec
= make_tree_vec (1);
18734 tree argvec
= make_tree_vec (len2
);
18737 /* Setup the parameter vector, which contains only ARG1. */
18738 TREE_VEC_ELT (parmvec
, 0) = arg1
;
18740 /* Setup the argument vector, which contains the remaining
18742 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
18743 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18745 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
18746 argvec
, DEDUCE_EXACT
,
18747 /*subr=*/true, /*explain_p=*/false)
18750 /* We cannot deduce in the other direction, because ARG1 is
18751 a pack expansion but ARG2 is not. */
18754 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18756 int i
, len1
= list_length (args1
);
18757 tree parmvec
= make_tree_vec (1);
18758 tree argvec
= make_tree_vec (len1
);
18761 /* Setup the parameter vector, which contains only ARG1. */
18762 TREE_VEC_ELT (parmvec
, 0) = arg2
;
18764 /* Setup the argument vector, which contains the remaining
18766 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
18767 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18769 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
18770 argvec
, DEDUCE_EXACT
,
18771 /*subr=*/true, /*explain_p=*/false)
18774 /* We cannot deduce in the other direction, because ARG2 is
18775 a pack expansion but ARG1 is not.*/
18781 /* The normal case, where neither argument is a pack
18783 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
18784 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18786 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
18787 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18791 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18792 arg2, then arg2 is not as specialized as arg1. */
18798 /* "If, for a given type, deduction succeeds in both directions
18799 (i.e., the types are identical after the transformations above)
18800 and both P and A were reference types (before being replaced with
18801 the type referred to above):
18802 - if the type from the argument template was an lvalue reference and
18803 the type from the parameter template was not, the argument type is
18804 considered to be more specialized than the other; otherwise,
18805 - if the type from the argument template is more cv-qualified
18806 than the type from the parameter template (as described above),
18807 the argument type is considered to be more specialized than the other;
18809 - neither type is more specialized than the other." */
18811 if (deduce1
&& deduce2
)
18813 if (ref1
&& ref2
&& ref1
!= ref2
)
18820 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
18822 if ((quals1
& quals2
) == quals2
)
18824 if ((quals1
& quals2
) == quals1
)
18829 if (lose1
&& lose2
)
18830 /* We've failed to deduce something in either direction.
18831 These must be unordered. */
18834 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18835 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18836 /* We have already processed all of the arguments in our
18837 handing of the pack expansion type. */
18840 args1
= TREE_CHAIN (args1
);
18841 args2
= TREE_CHAIN (args2
);
18844 /* "In most cases, all template parameters must have values in order for
18845 deduction to succeed, but for partial ordering purposes a template
18846 parameter may remain without a value provided it is not used in the
18847 types being used for partial ordering."
18849 Thus, if we are missing any of the targs1 we need to substitute into
18850 origs1, then pat2 is not as specialized as pat1. This can happen when
18851 there is a nondeduced context. */
18852 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
18854 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
18857 processing_template_decl
--;
18859 /* All things being equal, if the next argument is a pack expansion
18860 for one function but not for the other, prefer the
18861 non-variadic function. FIXME this is bogus; see c++/41958. */
18863 && args1
&& TREE_VALUE (args1
)
18864 && args2
&& TREE_VALUE (args2
))
18866 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
18867 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
18870 if (lose1
== lose2
)
18878 /* Determine which of two partial specializations of TMPL is more
18881 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
18882 to the first partial specialization. The TREE_VALUE is the
18883 innermost set of template parameters for the partial
18884 specialization. PAT2 is similar, but for the second template.
18886 Return 1 if the first partial specialization is more specialized;
18887 -1 if the second is more specialized; 0 if neither is more
18890 See [temp.class.order] for information about determining which of
18891 two templates is more specialized. */
18894 more_specialized_class (tree tmpl
, tree pat1
, tree pat2
)
18899 bool any_deductions
= false;
18901 tmpl1
= TREE_TYPE (pat1
);
18902 tmpl2
= TREE_TYPE (pat2
);
18904 /* Just like what happens for functions, if we are ordering between
18905 different class template specializations, we may encounter dependent
18906 types in the arguments, and we need our dependency check functions
18907 to behave correctly. */
18908 ++processing_template_decl
;
18909 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat1
),
18910 CLASSTYPE_TI_ARGS (tmpl1
),
18911 CLASSTYPE_TI_ARGS (tmpl2
));
18915 any_deductions
= true;
18918 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat2
),
18919 CLASSTYPE_TI_ARGS (tmpl2
),
18920 CLASSTYPE_TI_ARGS (tmpl1
));
18924 any_deductions
= true;
18926 --processing_template_decl
;
18928 /* In the case of a tie where at least one of the class templates
18929 has a parameter pack at the end, the template with the most
18930 non-packed parameters wins. */
18933 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
18934 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
18936 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
18937 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
18938 int len1
= TREE_VEC_LENGTH (args1
);
18939 int len2
= TREE_VEC_LENGTH (args2
);
18941 /* We don't count the pack expansion at the end. */
18942 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
18944 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
18949 else if (len1
< len2
)
18956 /* Return the template arguments that will produce the function signature
18957 DECL from the function template FN, with the explicit template
18958 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
18959 also match. Return NULL_TREE if no satisfactory arguments could be
18963 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
18965 int ntparms
= DECL_NTPARMS (fn
);
18966 tree targs
= make_tree_vec (ntparms
);
18967 tree decl_type
= TREE_TYPE (decl
);
18968 tree decl_arg_types
;
18970 unsigned int nargs
, ix
;
18973 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
18975 /* Never do unification on the 'this' parameter. */
18976 decl_arg_types
= skip_artificial_parms_for (decl
,
18977 TYPE_ARG_TYPES (decl_type
));
18979 nargs
= list_length (decl_arg_types
);
18980 args
= XALLOCAVEC (tree
, nargs
);
18981 for (arg
= decl_arg_types
, ix
= 0;
18982 arg
!= NULL_TREE
&& arg
!= void_list_node
;
18983 arg
= TREE_CHAIN (arg
), ++ix
)
18984 args
[ix
] = TREE_VALUE (arg
);
18986 if (fn_type_unification (fn
, explicit_args
, targs
,
18988 (check_rettype
|| DECL_CONV_FN_P (fn
)
18989 ? TREE_TYPE (decl_type
) : NULL_TREE
),
18990 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
18992 == error_mark_node
)
18998 /* Return the innermost template arguments that, when applied to a partial
18999 specialization of TMPL whose innermost template parameters are
19000 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
19003 For example, suppose we have:
19005 template <class T, class U> struct S {};
19006 template <class T> struct S<T*, int> {};
19008 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
19009 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
19010 int}. The resulting vector will be {double}, indicating that `T'
19011 is bound to `double'. */
19014 get_class_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
19016 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
19018 tree innermost_deduced_args
;
19020 innermost_deduced_args
= make_tree_vec (ntparms
);
19021 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19023 deduced_args
= copy_node (args
);
19024 SET_TMPL_ARGS_LEVEL (deduced_args
,
19025 TMPL_ARGS_DEPTH (deduced_args
),
19026 innermost_deduced_args
);
19029 deduced_args
= innermost_deduced_args
;
19031 if (unify (tparms
, deduced_args
,
19032 INNERMOST_TEMPLATE_ARGS (spec_args
),
19033 INNERMOST_TEMPLATE_ARGS (args
),
19034 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
19037 for (i
= 0; i
< ntparms
; ++i
)
19038 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
19041 /* Verify that nondeduced template arguments agree with the type
19042 obtained from argument deduction.
19046 struct A { typedef int X; };
19047 template <class T, class U> struct C {};
19048 template <class T> struct C<T, typename T::X> {};
19050 Then with the instantiation `C<A, int>', we can deduce that
19051 `T' is `A' but unify () does not check whether `typename T::X'
19053 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
19054 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19056 tf_none
, false, false);
19057 if (spec_args
== error_mark_node
19058 /* We only need to check the innermost arguments; the other
19059 arguments will always agree. */
19060 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
19061 INNERMOST_TEMPLATE_ARGS (args
)))
19064 /* Now that we have bindings for all of the template arguments,
19065 ensure that the arguments deduced for the template template
19066 parameters have compatible template parameter lists. See the use
19067 of template_template_parm_bindings_ok_p in fn_type_unification
19068 for more information. */
19069 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
19072 return deduced_args
;
19075 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
19076 Return the TREE_LIST node with the most specialized template, if
19077 any. If there is no most specialized template, the error_mark_node
19080 Note that this function does not look at, or modify, the
19081 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
19082 returned is one of the elements of INSTANTIATIONS, callers may
19083 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
19084 and retrieve it from the value returned. */
19087 most_specialized_instantiation (tree templates
)
19091 ++processing_template_decl
;
19094 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
19098 if (get_bindings (TREE_VALUE (champ
),
19099 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
19100 NULL_TREE
, /*check_ret=*/true))
19103 if (get_bindings (TREE_VALUE (fn
),
19104 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19105 NULL_TREE
, /*check_ret=*/true))
19112 /* Equally specialized, move to next function. If there
19113 is no next function, nothing's most specialized. */
19114 fn
= TREE_CHAIN (fn
);
19122 /* Now verify that champ is better than everything earlier in the
19123 instantiation list. */
19124 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
19125 if (get_bindings (TREE_VALUE (champ
),
19126 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
19127 NULL_TREE
, /*check_ret=*/true)
19128 || !get_bindings (TREE_VALUE (fn
),
19129 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19130 NULL_TREE
, /*check_ret=*/true))
19136 processing_template_decl
--;
19139 return error_mark_node
;
19144 /* If DECL is a specialization of some template, return the most
19145 general such template. Otherwise, returns NULL_TREE.
19147 For example, given:
19149 template <class T> struct S { template <class U> void f(U); };
19151 if TMPL is `template <class U> void S<int>::f(U)' this will return
19152 the full template. This function will not trace past partial
19153 specializations, however. For example, given in addition:
19155 template <class T> struct S<T*> { template <class U> void f(U); };
19157 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19158 `template <class T> template <class U> S<T*>::f(U)'. */
19161 most_general_template (tree decl
)
19163 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19165 if (tree tinfo
= get_template_info (decl
))
19166 decl
= TI_TEMPLATE (tinfo
);
19167 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19168 template friend, or a FIELD_DECL for a capture pack. */
19169 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19173 /* Look for more and more general templates. */
19174 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
19176 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
19177 (See cp-tree.h for details.) */
19178 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
19181 if (CLASS_TYPE_P (TREE_TYPE (decl
))
19182 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
19185 /* Stop if we run into an explicitly specialized class template. */
19186 if (!DECL_NAMESPACE_SCOPE_P (decl
)
19187 && DECL_CONTEXT (decl
)
19188 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
19191 decl
= DECL_TI_TEMPLATE (decl
);
19197 /* Return the most specialized of the class template partial
19198 specializations which can produce TYPE, a specialization of some class
19199 template. The value returned is actually a TREE_LIST; the TREE_TYPE is
19200 a _TYPE node corresponding to the partial specialization, while the
19201 TREE_PURPOSE is the set of template arguments that must be
19202 substituted into the TREE_TYPE in order to generate TYPE.
19204 If the choice of partial specialization is ambiguous, a diagnostic
19205 is issued, and the error_mark_node is returned. If there are no
19206 partial specializations matching TYPE, then NULL_TREE is
19207 returned, indicating that the primary template should be used. */
19210 most_specialized_class (tree type
, tsubst_flags_t complain
)
19212 tree list
= NULL_TREE
;
19217 tree outer_args
= NULL_TREE
;
19219 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
19220 tree main_tmpl
= most_general_template (tmpl
);
19221 tree args
= CLASSTYPE_TI_ARGS (type
);
19223 /* For determining which partial specialization to use, only the
19224 innermost args are interesting. */
19225 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19227 outer_args
= strip_innermost_template_args (args
, 1);
19228 args
= INNERMOST_TEMPLATE_ARGS (args
);
19231 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
19233 tree partial_spec_args
;
19235 tree spec_tmpl
= TREE_VALUE (t
);
19236 tree orig_parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19238 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
19240 ++processing_template_decl
;
19244 /* Discard the outer levels of args, and then substitute in the
19245 template args from the enclosing class. */
19246 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
19247 partial_spec_args
= tsubst_template_args
19248 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
19250 /* And the same for the partial specialization TEMPLATE_DECL. */
19251 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
19254 partial_spec_args
=
19255 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19258 /*require_all_args=*/true,
19259 /*use_default_args=*/true);
19261 --processing_template_decl
;
19263 if (partial_spec_args
== error_mark_node
)
19264 return error_mark_node
;
19265 if (spec_tmpl
== error_mark_node
)
19266 return error_mark_node
;
19268 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19269 spec_args
= get_class_bindings (tmpl
, parms
,
19275 spec_args
= add_to_template_args (outer_args
, spec_args
);
19276 list
= tree_cons (spec_args
, orig_parms
, list
);
19277 TREE_TYPE (list
) = TREE_TYPE (t
);
19284 ambiguous_p
= false;
19287 t
= TREE_CHAIN (t
);
19288 for (; t
; t
= TREE_CHAIN (t
))
19290 fate
= more_specialized_class (tmpl
, champ
, t
);
19297 t
= TREE_CHAIN (t
);
19300 ambiguous_p
= true;
19309 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
19311 fate
= more_specialized_class (tmpl
, champ
, t
);
19314 ambiguous_p
= true;
19322 char *spaces
= NULL
;
19323 if (!(complain
& tf_error
))
19324 return error_mark_node
;
19325 error ("ambiguous class template instantiation for %q#T", type
);
19326 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
19327 for (t
= list
; t
; t
= TREE_CHAIN (t
))
19329 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
19330 spaces
= spaces
? spaces
: get_spaces (str
);
19333 return error_mark_node
;
19339 /* Explicitly instantiate DECL. */
19342 do_decl_instantiation (tree decl
, tree storage
)
19344 tree result
= NULL_TREE
;
19347 if (!decl
|| decl
== error_mark_node
)
19348 /* An error occurred, for which grokdeclarator has already issued
19349 an appropriate message. */
19351 else if (! DECL_LANG_SPECIFIC (decl
))
19353 error ("explicit instantiation of non-template %q#D", decl
);
19357 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
19358 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
19360 if (VAR_P (decl
) && !var_templ
)
19362 /* There is an asymmetry here in the way VAR_DECLs and
19363 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19364 the latter, the DECL we get back will be marked as a
19365 template instantiation, and the appropriate
19366 DECL_TEMPLATE_INFO will be set up. This does not happen for
19367 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19368 should handle VAR_DECLs as it currently handles
19370 if (!DECL_CLASS_SCOPE_P (decl
))
19372 error ("%qD is not a static data member of a class template", decl
);
19375 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
19376 if (!result
|| !VAR_P (result
))
19378 error ("no matching template for %qD found", decl
);
19381 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
19383 error ("type %qT for explicit instantiation %qD does not match "
19384 "declared type %qT", TREE_TYPE (result
), decl
,
19389 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
19391 error ("explicit instantiation of %q#D", decl
);
19397 /* Check for various error cases. Note that if the explicit
19398 instantiation is valid the RESULT will currently be marked as an
19399 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19400 until we get here. */
19402 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19404 /* DR 259 [temp.spec].
19406 Both an explicit instantiation and a declaration of an explicit
19407 specialization shall not appear in a program unless the explicit
19408 instantiation follows a declaration of the explicit specialization.
19410 For a given set of template parameters, if an explicit
19411 instantiation of a template appears after a declaration of an
19412 explicit specialization for that template, the explicit
19413 instantiation has no effect. */
19416 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19420 No program shall explicitly instantiate any template more
19423 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19424 the first instantiation was `extern' and the second is not,
19425 and EXTERN_P for the opposite case. */
19426 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19427 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19428 /* If an "extern" explicit instantiation follows an ordinary
19429 explicit instantiation, the template is instantiated. */
19433 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19435 error ("no matching template for %qD found", result
);
19438 else if (!DECL_TEMPLATE_INFO (result
))
19440 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19444 if (storage
== NULL_TREE
)
19446 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19448 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19449 pedwarn (input_location
, OPT_Wpedantic
,
19450 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19455 error ("storage class %qD applied to template instantiation", storage
);
19457 check_explicit_instantiation_namespace (result
);
19458 mark_decl_instantiated (result
, extern_p
);
19460 instantiate_decl (result
, /*defer_ok=*/1,
19461 /*expl_inst_class_mem_p=*/false);
19465 mark_class_instantiated (tree t
, int extern_p
)
19467 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19468 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19469 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19470 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19473 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19474 rest_of_type_compilation (t
, 1);
19478 /* Called from do_type_instantiation through binding_table_foreach to
19479 do recursive instantiation for the type bound in ENTRY. */
19481 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19483 tree storage
= *(tree
*) data
;
19485 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19486 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19487 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19490 /* Called from do_type_instantiation to instantiate a member
19491 (a member function or a static member variable) of an
19492 explicitly instantiated class template. */
19494 instantiate_class_member (tree decl
, int extern_p
)
19496 mark_decl_instantiated (decl
, extern_p
);
19498 instantiate_decl (decl
, /*defer_ok=*/1,
19499 /*expl_inst_class_mem_p=*/true);
19502 /* Perform an explicit instantiation of template class T. STORAGE, if
19503 non-null, is the RID for extern, inline or static. COMPLAIN is
19504 nonzero if this is called from the parser, zero if called recursively,
19505 since the standard is unclear (as detailed below). */
19508 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19513 int previous_instantiation_extern_p
= 0;
19515 if (TREE_CODE (t
) == TYPE_DECL
)
19518 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19521 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19523 error ("explicit instantiation of non-class template %qD", tmpl
);
19525 error ("explicit instantiation of non-template type %qT", t
);
19531 if (!COMPLETE_TYPE_P (t
))
19533 if (complain
& tf_error
)
19534 error ("explicit instantiation of %q#T before definition of template",
19539 if (storage
!= NULL_TREE
)
19541 if (!in_system_header_at (input_location
))
19543 if (storage
== ridpointers
[(int) RID_EXTERN
])
19545 if (cxx_dialect
== cxx98
)
19546 pedwarn (input_location
, OPT_Wpedantic
,
19547 "ISO C++ 1998 forbids the use of %<extern%> on "
19548 "explicit instantiations");
19551 pedwarn (input_location
, OPT_Wpedantic
,
19552 "ISO C++ forbids the use of %qE"
19553 " on explicit instantiations", storage
);
19556 if (storage
== ridpointers
[(int) RID_INLINE
])
19558 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19560 else if (storage
== ridpointers
[(int) RID_STATIC
])
19564 error ("storage class %qD applied to template instantiation",
19570 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19572 /* DR 259 [temp.spec].
19574 Both an explicit instantiation and a declaration of an explicit
19575 specialization shall not appear in a program unless the explicit
19576 instantiation follows a declaration of the explicit specialization.
19578 For a given set of template parameters, if an explicit
19579 instantiation of a template appears after a declaration of an
19580 explicit specialization for that template, the explicit
19581 instantiation has no effect. */
19584 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19588 No program shall explicitly instantiate any template more
19591 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19592 instantiation was `extern'. If EXTERN_P then the second is.
19593 These cases are OK. */
19594 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19596 if (!previous_instantiation_extern_p
&& !extern_p
19597 && (complain
& tf_error
))
19598 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19600 /* If we've already instantiated the template, just return now. */
19601 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19605 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19606 mark_class_instantiated (t
, extern_p
);
19614 /* In contrast to implicit instantiation, where only the
19615 declarations, and not the definitions, of members are
19616 instantiated, we have here:
19620 The explicit instantiation of a class template specialization
19621 implies the instantiation of all of its members not
19622 previously explicitly specialized in the translation unit
19623 containing the explicit instantiation.
19625 Of course, we can't instantiate member template classes, since
19626 we don't have any arguments for them. Note that the standard
19627 is unclear on whether the instantiation of the members are
19628 *explicit* instantiations or not. However, the most natural
19629 interpretation is that it should be an explicit instantiation. */
19632 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19633 if (TREE_CODE (tmp
) == FUNCTION_DECL
19634 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19635 instantiate_class_member (tmp
, extern_p
);
19637 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19638 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19639 instantiate_class_member (tmp
, extern_p
);
19641 if (CLASSTYPE_NESTED_UTDS (t
))
19642 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19643 bt_instantiate_type_proc
, &storage
);
19647 /* Given a function DECL, which is a specialization of TMPL, modify
19648 DECL to be a re-instantiation of TMPL with the same template
19649 arguments. TMPL should be the template into which tsubst'ing
19650 should occur for DECL, not the most general template.
19652 One reason for doing this is a scenario like this:
19655 void f(const T&, int i);
19657 void g() { f(3, 7); }
19660 void f(const T& t, const int i) { }
19662 Note that when the template is first instantiated, with
19663 instantiate_template, the resulting DECL will have no name for the
19664 first parameter, and the wrong type for the second. So, when we go
19665 to instantiate the DECL, we regenerate it. */
19668 regenerate_decl_from_template (tree decl
, tree tmpl
)
19670 /* The arguments used to instantiate DECL, from the most general
19675 args
= DECL_TI_ARGS (decl
);
19676 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19678 /* Make sure that we can see identifiers, and compute access
19680 push_access_scope (decl
);
19682 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19690 args_depth
= TMPL_ARGS_DEPTH (args
);
19691 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19692 if (args_depth
> parms_depth
)
19693 args
= get_innermost_template_args (args
, parms_depth
);
19695 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19696 args
, tf_error
, NULL_TREE
,
19697 /*defer_ok*/false);
19698 if (specs
&& specs
!= error_mark_node
)
19699 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19702 /* Merge parameter declarations. */
19703 decl_parm
= skip_artificial_parms_for (decl
,
19704 DECL_ARGUMENTS (decl
));
19706 = skip_artificial_parms_for (code_pattern
,
19707 DECL_ARGUMENTS (code_pattern
));
19708 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
19713 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19714 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
19715 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
19717 parm_type
= type_decays_to (parm_type
);
19718 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19719 TREE_TYPE (decl_parm
) = parm_type
;
19720 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19721 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19723 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19724 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19726 decl_parm
= DECL_CHAIN (decl_parm
);
19727 pattern_parm
= DECL_CHAIN (pattern_parm
);
19729 /* Merge any parameters that match with the function parameter
19731 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
19734 tree expanded_types
;
19735 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19736 the parameters in this function parameter pack. */
19737 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
19738 args
, tf_error
, NULL_TREE
);
19739 len
= TREE_VEC_LENGTH (expanded_types
);
19740 for (i
= 0; i
< len
; i
++)
19745 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19746 /* Rename the parameter to include the index. */
19747 DECL_NAME (decl_parm
) =
19748 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
19749 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
19750 parm_type
= type_decays_to (parm_type
);
19751 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19752 TREE_TYPE (decl_parm
) = parm_type
;
19753 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19754 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19756 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19757 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19759 decl_parm
= DECL_CHAIN (decl_parm
);
19762 /* Merge additional specifiers from the CODE_PATTERN. */
19763 if (DECL_DECLARED_INLINE_P (code_pattern
)
19764 && !DECL_DECLARED_INLINE_P (decl
))
19765 DECL_DECLARED_INLINE_P (decl
) = 1;
19767 else if (VAR_P (decl
))
19769 DECL_INITIAL (decl
) =
19770 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
19771 tf_error
, DECL_TI_TEMPLATE (decl
),
19772 /*integral_constant_expression_p=*/false);
19773 if (VAR_HAD_UNKNOWN_BOUND (decl
))
19774 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
19775 tf_error
, DECL_TI_TEMPLATE (decl
));
19778 gcc_unreachable ();
19780 pop_access_scope (decl
);
19783 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19784 substituted to get DECL. */
19787 template_for_substitution (tree decl
)
19789 tree tmpl
= DECL_TI_TEMPLATE (decl
);
19791 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19792 for the instantiation. This is not always the most general
19793 template. Consider, for example:
19796 struct S { template <class U> void f();
19797 template <> void f<int>(); };
19799 and an instantiation of S<double>::f<int>. We want TD to be the
19800 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19801 while (/* An instantiation cannot have a definition, so we need a
19802 more general template. */
19803 DECL_TEMPLATE_INSTANTIATION (tmpl
)
19804 /* We must also deal with friend templates. Given:
19806 template <class T> struct S {
19807 template <class U> friend void f() {};
19810 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19811 so far as the language is concerned, but that's still
19812 where we get the pattern for the instantiation from. On
19813 other hand, if the definition comes outside the class, say:
19815 template <class T> struct S {
19816 template <class U> friend void f();
19818 template <class U> friend void f() {}
19820 we don't need to look any further. That's what the check for
19821 DECL_INITIAL is for. */
19822 || (TREE_CODE (decl
) == FUNCTION_DECL
19823 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
19824 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
19826 /* The present template, TD, should not be a definition. If it
19827 were a definition, we should be using it! Note that we
19828 cannot restructure the loop to just keep going until we find
19829 a template with a definition, since that might go too far if
19830 a specialization was declared, but not defined. */
19832 /* Fetch the more general template. */
19833 tmpl
= DECL_TI_TEMPLATE (tmpl
);
19839 /* Returns true if we need to instantiate this template instance even if we
19840 know we aren't going to emit it.. */
19843 always_instantiate_p (tree decl
)
19845 /* We always instantiate inline functions so that we can inline them. An
19846 explicit instantiation declaration prohibits implicit instantiation of
19847 non-inline functions. With high levels of optimization, we would
19848 normally inline non-inline functions -- but we're not allowed to do
19849 that for "extern template" functions. Therefore, we check
19850 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19851 return ((TREE_CODE (decl
) == FUNCTION_DECL
19852 && (DECL_DECLARED_INLINE_P (decl
)
19853 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
19854 /* And we need to instantiate static data members so that
19855 their initializers are available in integral constant
19858 && decl_maybe_constant_var_p (decl
)));
19861 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19862 instantiate it now, modifying TREE_TYPE (fn). */
19865 maybe_instantiate_noexcept (tree fn
)
19867 tree fntype
, spec
, noex
, clone
;
19869 /* Don't instantiate a noexcept-specification from template context. */
19870 if (processing_template_decl
)
19873 if (DECL_CLONED_FUNCTION_P (fn
))
19874 fn
= DECL_CLONED_FUNCTION (fn
);
19875 fntype
= TREE_TYPE (fn
);
19876 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
19878 if (!spec
|| !TREE_PURPOSE (spec
))
19881 noex
= TREE_PURPOSE (spec
);
19883 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
19885 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
19886 spec
= get_defaulted_eh_spec (fn
);
19887 else if (push_tinst_level (fn
))
19889 push_access_scope (fn
);
19890 push_deferring_access_checks (dk_no_deferred
);
19891 input_location
= DECL_SOURCE_LOCATION (fn
);
19892 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
19893 DEFERRED_NOEXCEPT_ARGS (noex
),
19894 tf_warning_or_error
, fn
,
19895 /*function_p=*/false,
19896 /*integral_constant_expression_p=*/true);
19897 pop_deferring_access_checks ();
19898 pop_access_scope (fn
);
19899 pop_tinst_level ();
19900 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
19901 if (spec
== error_mark_node
)
19902 spec
= noexcept_false_spec
;
19905 spec
= noexcept_false_spec
;
19907 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
19910 FOR_EACH_CLONE (clone
, fn
)
19912 if (TREE_TYPE (clone
) == fntype
)
19913 TREE_TYPE (clone
) = TREE_TYPE (fn
);
19915 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
19919 /* Produce the definition of D, a _DECL generated from a template. If
19920 DEFER_OK is nonzero, then we don't have to actually do the
19921 instantiation now; we just have to do it sometime. Normally it is
19922 an error if this is an explicit instantiation but D is undefined.
19923 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
19924 explicitly instantiated class template. */
19927 instantiate_decl (tree d
, int defer_ok
,
19928 bool expl_inst_class_mem_p
)
19930 tree tmpl
= DECL_TI_TEMPLATE (d
);
19937 bool pattern_defined
;
19938 location_t saved_loc
= input_location
;
19939 int saved_unevaluated_operand
= cp_unevaluated_operand
;
19940 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
19946 /* This function should only be used to instantiate templates for
19947 functions and static member variables. */
19948 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
19950 /* Variables are never deferred; if instantiation is required, they
19951 are instantiated right away. That allows for better code in the
19952 case that an expression refers to the value of the variable --
19953 if the variable has a constant value the referring expression can
19954 take advantage of that fact. */
19956 || DECL_DECLARED_CONSTEXPR_P (d
))
19959 /* Don't instantiate cloned functions. Instead, instantiate the
19960 functions they cloned. */
19961 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
19962 d
= DECL_CLONED_FUNCTION (d
);
19964 if (DECL_TEMPLATE_INSTANTIATED (d
)
19965 || (TREE_CODE (d
) == FUNCTION_DECL
19966 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
19967 || DECL_TEMPLATE_SPECIALIZATION (d
))
19968 /* D has already been instantiated or explicitly specialized, so
19969 there's nothing for us to do here.
19971 It might seem reasonable to check whether or not D is an explicit
19972 instantiation, and, if so, stop here. But when an explicit
19973 instantiation is deferred until the end of the compilation,
19974 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
19975 the instantiation. */
19978 /* Check to see whether we know that this template will be
19979 instantiated in some other file, as with "extern template"
19981 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
19983 /* In general, we do not instantiate such templates. */
19984 if (external_p
&& !always_instantiate_p (d
))
19987 gen_tmpl
= most_general_template (tmpl
);
19988 gen_args
= DECL_TI_ARGS (d
);
19990 if (tmpl
!= gen_tmpl
)
19991 /* We should already have the extra args. */
19992 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
19993 == TMPL_ARGS_DEPTH (gen_args
));
19994 /* And what's in the hash table should match D. */
19995 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
19996 || spec
== NULL_TREE
);
19998 /* This needs to happen before any tsubsting. */
19999 if (! push_tinst_level (d
))
20002 timevar_push (TV_TEMPLATE_INST
);
20004 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
20005 for the instantiation. */
20006 td
= template_for_substitution (d
);
20007 code_pattern
= DECL_TEMPLATE_RESULT (td
);
20009 /* We should never be trying to instantiate a member of a class
20010 template or partial specialization. */
20011 gcc_assert (d
!= code_pattern
);
20013 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
20014 || DECL_TEMPLATE_SPECIALIZATION (td
))
20015 /* In the case of a friend template whose definition is provided
20016 outside the class, we may have too many arguments. Drop the
20017 ones we don't need. The same is true for specializations. */
20018 args
= get_innermost_template_args
20019 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
20023 if (TREE_CODE (d
) == FUNCTION_DECL
)
20025 deleted_p
= DECL_DELETED_FN (code_pattern
);
20026 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
20027 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
20033 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
20036 /* We may be in the middle of deferred access check. Disable it now. */
20037 push_deferring_access_checks (dk_no_deferred
);
20039 /* Unless an explicit instantiation directive has already determined
20040 the linkage of D, remember that a definition is available for
20042 if (pattern_defined
20043 && !DECL_INTERFACE_KNOWN (d
)
20044 && !DECL_NOT_REALLY_EXTERN (d
))
20045 mark_definable (d
);
20047 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
20048 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
20049 input_location
= DECL_SOURCE_LOCATION (d
);
20051 /* If D is a member of an explicitly instantiated class template,
20052 and no definition is available, treat it like an implicit
20054 if (!pattern_defined
&& expl_inst_class_mem_p
20055 && DECL_EXPLICIT_INSTANTIATION (d
))
20057 /* Leave linkage flags alone on instantiations with anonymous
20059 if (TREE_PUBLIC (d
))
20061 DECL_NOT_REALLY_EXTERN (d
) = 0;
20062 DECL_INTERFACE_KNOWN (d
) = 0;
20064 SET_DECL_IMPLICIT_INSTANTIATION (d
);
20067 /* Defer all other templates, unless we have been explicitly
20068 forbidden from doing so. */
20069 if (/* If there is no definition, we cannot instantiate the
20072 /* If it's OK to postpone instantiation, do so. */
20074 /* If this is a static data member that will be defined
20075 elsewhere, we don't want to instantiate the entire data
20076 member, but we do want to instantiate the initializer so that
20077 we can substitute that elsewhere. */
20078 || (external_p
&& VAR_P (d
))
20079 /* Handle here a deleted function too, avoid generating
20080 its body (c++/61080). */
20083 /* The definition of the static data member is now required so
20084 we must substitute the initializer. */
20086 && !DECL_INITIAL (d
)
20087 && DECL_INITIAL (code_pattern
))
20091 bool const_init
= false;
20092 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20094 ns
= decl_namespace_context (d
);
20095 push_nested_namespace (ns
);
20097 push_nested_class (DECL_CONTEXT (d
));
20098 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
20100 tf_warning_or_error
, NULL_TREE
,
20101 /*integral_constant_expression_p=*/false);
20102 /* If instantiating the initializer involved instantiating this
20103 again, don't call cp_finish_decl twice. */
20104 if (!DECL_INITIAL (d
))
20106 /* Make sure the initializer is still constant, in case of
20107 circular dependency (template/instantiate6.C). */
20109 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20110 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
20111 /*asmspec_tree=*/NULL_TREE
,
20112 LOOKUP_ONLYCONVERTING
);
20115 pop_nested_class ();
20116 pop_nested_namespace (ns
);
20119 /* We restore the source position here because it's used by
20120 add_pending_template. */
20121 input_location
= saved_loc
;
20123 if (at_eof
&& !pattern_defined
20124 && DECL_EXPLICIT_INSTANTIATION (d
)
20125 && DECL_NOT_REALLY_EXTERN (d
))
20128 The definition of a non-exported function template, a
20129 non-exported member function template, or a non-exported
20130 member function or static data member of a class template
20131 shall be present in every translation unit in which it is
20132 explicitly instantiated. */
20133 permerror (input_location
, "explicit instantiation of %qD "
20134 "but no definition available", d
);
20136 /* If we're in unevaluated context, we just wanted to get the
20137 constant value; this isn't an odr use, so don't queue
20138 a full instantiation. */
20139 if (cp_unevaluated_operand
!= 0)
20141 /* ??? Historically, we have instantiated inline functions, even
20142 when marked as "extern template". */
20143 if (!(external_p
&& VAR_P (d
)))
20144 add_pending_template (d
);
20147 /* Tell the repository that D is available in this translation unit
20148 -- and see if it is supposed to be instantiated here. */
20149 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
20151 /* In a PCH file, despite the fact that the repository hasn't
20152 requested instantiation in the PCH it is still possible that
20153 an instantiation will be required in a file that includes the
20156 add_pending_template (d
);
20157 /* Instantiate inline functions so that the inliner can do its
20158 job, even though we'll not be emitting a copy of this
20160 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
20164 fn_context
= decl_function_context (d
);
20165 nested
= (current_function_decl
!= NULL_TREE
);
20167 push_to_top_level ();
20171 push_function_context ();
20172 cp_unevaluated_operand
= 0;
20173 c_inhibit_evaluation_warnings
= 0;
20176 /* Mark D as instantiated so that recursive calls to
20177 instantiate_decl do not try to instantiate it again. */
20178 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
20180 /* Regenerate the declaration in case the template has been modified
20181 by a subsequent redeclaration. */
20182 regenerate_decl_from_template (d
, td
);
20184 /* We already set the file and line above. Reset them now in case
20185 they changed as a result of calling regenerate_decl_from_template. */
20186 input_location
= DECL_SOURCE_LOCATION (d
);
20191 bool const_init
= false;
20193 /* Clear out DECL_RTL; whatever was there before may not be right
20194 since we've reset the type of the declaration. */
20195 SET_DECL_RTL (d
, NULL
);
20196 DECL_IN_AGGR_P (d
) = 0;
20198 /* The initializer is placed in DECL_INITIAL by
20199 regenerate_decl_from_template so we don't need to
20200 push/pop_access_scope again here. Pull it out so that
20201 cp_finish_decl can process it. */
20202 init
= DECL_INITIAL (d
);
20203 DECL_INITIAL (d
) = NULL_TREE
;
20204 DECL_INITIALIZED_P (d
) = 0;
20206 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
20207 initializer. That function will defer actual emission until
20208 we have a chance to determine linkage. */
20209 DECL_EXTERNAL (d
) = 0;
20211 /* Enter the scope of D so that access-checking works correctly. */
20212 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20214 push_nested_class (DECL_CONTEXT (d
));
20216 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20217 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
20220 pop_nested_class ();
20222 if (variable_template_p (td
))
20223 note_variable_template_instantiation (d
);
20225 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
20226 synthesize_method (d
);
20227 else if (TREE_CODE (d
) == FUNCTION_DECL
)
20229 hash_map
<tree
, tree
> *saved_local_specializations
;
20233 tree block
= NULL_TREE
;
20235 /* Save away the current list, in case we are instantiating one
20236 template from within the body of another. */
20237 saved_local_specializations
= local_specializations
;
20239 /* Set up the list of local specializations. */
20240 local_specializations
= new hash_map
<tree
, tree
>;
20242 /* Set up context. */
20243 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20244 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20245 block
= push_stmt_list ();
20247 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
20249 /* Some typedefs referenced from within the template code need to be
20250 access checked at template instantiation time, i.e now. These
20251 types were added to the template at parsing time. Let's get those
20252 and perform the access checks then. */
20253 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
20256 /* Create substitution entries for the parameters. */
20257 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
20258 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
20259 spec_parm
= DECL_ARGUMENTS (d
);
20260 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
20262 register_local_specialization (spec_parm
, tmpl_parm
);
20263 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
20264 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
20266 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
20268 if (!DECL_PACK_P (tmpl_parm
))
20270 register_local_specialization (spec_parm
, tmpl_parm
);
20271 spec_parm
= DECL_CHAIN (spec_parm
);
20275 /* Register the (value) argument pack as a specialization of
20276 TMPL_PARM, then move on. */
20277 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
20278 register_local_specialization (argpack
, tmpl_parm
);
20281 gcc_assert (!spec_parm
);
20283 /* Substitute into the body of the function. */
20284 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20285 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
20286 tf_warning_or_error
, tmpl
);
20289 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
20290 tf_warning_or_error
, tmpl
,
20291 /*integral_constant_expression_p=*/false);
20293 /* Set the current input_location to the end of the function
20294 so that finish_function knows where we are. */
20296 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
20298 /* Remember if we saw an infinite loop in the template. */
20299 current_function_infinite_loop
20300 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
20303 /* We don't need the local specializations any more. */
20304 delete local_specializations
;
20305 local_specializations
= saved_local_specializations
;
20307 /* Finish the function. */
20308 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20309 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20310 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
20313 d
= finish_function (0);
20314 expand_or_defer_fn (d
);
20317 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20318 cp_check_omp_declare_reduction (d
);
20321 /* We're not deferring instantiation any more. */
20322 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
20325 pop_from_top_level ();
20327 pop_function_context ();
20330 input_location
= saved_loc
;
20331 cp_unevaluated_operand
= saved_unevaluated_operand
;
20332 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20333 pop_deferring_access_checks ();
20334 pop_tinst_level ();
20336 timevar_pop (TV_TEMPLATE_INST
);
20341 /* Run through the list of templates that we wish we could
20342 instantiate, and instantiate any we can. RETRIES is the
20343 number of times we retry pending template instantiation. */
20346 instantiate_pending_templates (int retries
)
20349 location_t saved_loc
= input_location
;
20351 /* Instantiating templates may trigger vtable generation. This in turn
20352 may require further template instantiations. We place a limit here
20353 to avoid infinite loop. */
20354 if (pending_templates
&& retries
>= max_tinst_depth
)
20356 tree decl
= pending_templates
->tinst
->decl
;
20358 fatal_error ("template instantiation depth exceeds maximum of %d"
20359 " instantiating %q+D, possibly from virtual table generation"
20360 " (use -ftemplate-depth= to increase the maximum)",
20361 max_tinst_depth
, decl
);
20362 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20363 /* Pretend that we defined it. */
20364 DECL_INITIAL (decl
) = error_mark_node
;
20370 struct pending_template
**t
= &pending_templates
;
20371 struct pending_template
*last
= NULL
;
20375 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
20376 bool complete
= false;
20378 if (TYPE_P (instantiation
))
20382 if (!COMPLETE_TYPE_P (instantiation
))
20384 instantiate_class_template (instantiation
);
20385 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
20386 for (fn
= TYPE_METHODS (instantiation
);
20388 fn
= TREE_CHAIN (fn
))
20389 if (! DECL_ARTIFICIAL (fn
))
20390 instantiate_decl (fn
,
20392 /*expl_inst_class_mem_p=*/false);
20393 if (COMPLETE_TYPE_P (instantiation
))
20397 complete
= COMPLETE_TYPE_P (instantiation
);
20401 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20402 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
20405 = instantiate_decl (instantiation
,
20407 /*expl_inst_class_mem_p=*/false);
20408 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20412 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20413 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20417 /* If INSTANTIATION has been instantiated, then we don't
20418 need to consider it again in the future. */
20426 current_tinst_level
= NULL
;
20428 last_pending_template
= last
;
20430 while (reconsider
);
20432 input_location
= saved_loc
;
20435 /* Substitute ARGVEC into T, which is a list of initializers for
20436 either base class or a non-static data member. The TREE_PURPOSEs
20437 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20438 instantiate_decl. */
20441 tsubst_initializer_list (tree t
, tree argvec
)
20443 tree inits
= NULL_TREE
;
20445 for (; t
; t
= TREE_CHAIN (t
))
20449 tree expanded_bases
= NULL_TREE
;
20450 tree expanded_arguments
= NULL_TREE
;
20453 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20458 /* Expand the base class expansion type into separate base
20460 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20461 tf_warning_or_error
,
20463 if (expanded_bases
== error_mark_node
)
20466 /* We'll be building separate TREE_LISTs of arguments for
20468 len
= TREE_VEC_LENGTH (expanded_bases
);
20469 expanded_arguments
= make_tree_vec (len
);
20470 for (i
= 0; i
< len
; i
++)
20471 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20473 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20474 expand each argument in the TREE_VALUE of t. */
20475 expr
= make_node (EXPR_PACK_EXPANSION
);
20476 PACK_EXPANSION_LOCAL_P (expr
) = true;
20477 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20478 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20480 if (TREE_VALUE (t
) == void_type_node
)
20481 /* VOID_TYPE_NODE is used to indicate
20482 value-initialization. */
20484 for (i
= 0; i
< len
; i
++)
20485 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20489 /* Substitute parameter packs into each argument in the
20491 in_base_initializer
= 1;
20492 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20494 tree expanded_exprs
;
20496 /* Expand the argument. */
20497 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20499 = tsubst_pack_expansion (expr
, argvec
,
20500 tf_warning_or_error
,
20502 if (expanded_exprs
== error_mark_node
)
20505 /* Prepend each of the expanded expressions to the
20506 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20507 for (i
= 0; i
< len
; i
++)
20509 TREE_VEC_ELT (expanded_arguments
, i
) =
20510 tree_cons (NULL_TREE
,
20511 TREE_VEC_ELT (expanded_exprs
, i
),
20512 TREE_VEC_ELT (expanded_arguments
, i
));
20515 in_base_initializer
= 0;
20517 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20518 since we built them backwards. */
20519 for (i
= 0; i
< len
; i
++)
20521 TREE_VEC_ELT (expanded_arguments
, i
) =
20522 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20527 for (i
= 0; i
< len
; ++i
)
20529 if (expanded_bases
)
20531 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20532 decl
= expand_member_init (decl
);
20533 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20538 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20539 tf_warning_or_error
, NULL_TREE
);
20541 decl
= expand_member_init (decl
);
20542 if (decl
&& !DECL_P (decl
))
20543 in_base_initializer
= 1;
20545 init
= TREE_VALUE (t
);
20547 if (init
!= void_type_node
)
20548 init
= tsubst_expr (init
, argvec
,
20549 tf_warning_or_error
, NULL_TREE
,
20550 /*integral_constant_expression_p=*/false);
20551 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20552 /* If we had an initializer but it instantiated to nothing,
20553 value-initialize the object. This will only occur when
20554 the initializer was a pack expansion where the parameter
20555 packs used in that expansion were of length zero. */
20556 init
= void_type_node
;
20557 in_base_initializer
= 0;
20562 init
= build_tree_list (decl
, init
);
20563 TREE_CHAIN (init
) = inits
;
20571 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20574 set_current_access_from_decl (tree decl
)
20576 if (TREE_PRIVATE (decl
))
20577 current_access_specifier
= access_private_node
;
20578 else if (TREE_PROTECTED (decl
))
20579 current_access_specifier
= access_protected_node
;
20581 current_access_specifier
= access_public_node
;
20584 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20585 is the instantiation (which should have been created with
20586 start_enum) and ARGS are the template arguments to use. */
20589 tsubst_enum (tree tag
, tree newtag
, tree args
)
20593 if (SCOPED_ENUM_P (newtag
))
20594 begin_scope (sk_scoped_enum
, newtag
);
20596 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20601 decl
= TREE_VALUE (e
);
20602 /* Note that in a template enum, the TREE_VALUE is the
20603 CONST_DECL, not the corresponding INTEGER_CST. */
20604 value
= tsubst_expr (DECL_INITIAL (decl
),
20605 args
, tf_warning_or_error
, NULL_TREE
,
20606 /*integral_constant_expression_p=*/true);
20608 /* Give this enumeration constant the correct access. */
20609 set_current_access_from_decl (decl
);
20611 /* Actually build the enumerator itself. */
20613 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
20616 if (SCOPED_ENUM_P (newtag
))
20619 finish_enum_value_list (newtag
);
20620 finish_enum (newtag
);
20622 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20623 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20626 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20627 its type -- but without substituting the innermost set of template
20628 arguments. So, innermost set of template parameters will appear in
20632 get_mostly_instantiated_function_type (tree decl
)
20640 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
20641 targs
= DECL_TI_ARGS (decl
);
20642 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
20643 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
20645 /* There should be as many levels of arguments as there are levels
20647 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
20649 fn_type
= TREE_TYPE (tmpl
);
20651 if (parm_depth
== 1)
20652 /* No substitution is necessary. */
20659 /* Replace the innermost level of the TARGS with NULL_TREEs to
20660 let tsubst know not to substitute for those parameters. */
20661 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20662 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
20663 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
20664 TMPL_ARGS_LEVEL (targs
, i
));
20665 SET_TMPL_ARGS_LEVEL (partial_args
,
20666 TMPL_ARGS_DEPTH (targs
),
20667 make_tree_vec (DECL_NTPARMS (tmpl
)));
20669 /* Make sure that we can see identifiers, and compute access
20671 push_access_scope (decl
);
20673 ++processing_template_decl
;
20674 /* Now, do the (partial) substitution to figure out the
20675 appropriate function type. */
20676 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
20677 --processing_template_decl
;
20679 /* Substitute into the template parameters to obtain the real
20680 innermost set of parameters. This step is important if the
20681 innermost set of template parameters contains value
20682 parameters whose types depend on outer template parameters. */
20683 TREE_VEC_LENGTH (partial_args
)--;
20684 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
20686 pop_access_scope (decl
);
20692 /* Return truthvalue if we're processing a template different from
20693 the last one involved in diagnostics. */
20695 problematic_instantiation_changed (void)
20697 return current_tinst_level
!= last_error_tinst_level
;
20700 /* Remember current template involved in diagnostics. */
20702 record_last_problematic_instantiation (void)
20704 last_error_tinst_level
= current_tinst_level
;
20707 struct tinst_level
*
20708 current_instantiation (void)
20710 return current_tinst_level
;
20713 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20714 type. Return zero for ok, nonzero for disallowed. Issue error and
20715 warning messages under control of COMPLAIN. */
20718 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20720 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20722 else if (POINTER_TYPE_P (type
))
20724 else if (TYPE_PTRMEM_P (type
))
20726 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20728 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20730 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20732 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20735 if (complain
& tf_error
)
20737 if (type
== error_mark_node
)
20738 inform (input_location
, "invalid template non-type parameter");
20740 error ("%q#T is not a valid type for a template non-type parameter",
20746 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20747 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20750 dependent_type_p_r (tree type
)
20756 A type is dependent if it is:
20758 -- a template parameter. Template template parameters are types
20759 for us (since TYPE_P holds true for them) so we handle
20761 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20762 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
20764 /* -- a qualified-id with a nested-name-specifier which contains a
20765 class-name that names a dependent type or whose unqualified-id
20766 names a dependent type. */
20767 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20769 /* -- a cv-qualified type where the cv-unqualified type is
20771 No code is necessary for this bullet; the code below handles
20772 cv-qualified types, and we don't want to strip aliases with
20773 TYPE_MAIN_VARIANT because of DR 1558. */
20774 /* -- a compound type constructed from any dependent type. */
20775 if (TYPE_PTRMEM_P (type
))
20776 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
20777 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
20779 else if (TYPE_PTR_P (type
)
20780 || TREE_CODE (type
) == REFERENCE_TYPE
)
20781 return dependent_type_p (TREE_TYPE (type
));
20782 else if (TREE_CODE (type
) == FUNCTION_TYPE
20783 || TREE_CODE (type
) == METHOD_TYPE
)
20787 if (dependent_type_p (TREE_TYPE (type
)))
20789 for (arg_type
= TYPE_ARG_TYPES (type
);
20791 arg_type
= TREE_CHAIN (arg_type
))
20792 if (dependent_type_p (TREE_VALUE (arg_type
)))
20796 /* -- an array type constructed from any dependent type or whose
20797 size is specified by a constant expression that is
20800 We checked for type- and value-dependence of the bounds in
20801 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20802 if (TREE_CODE (type
) == ARRAY_TYPE
)
20804 if (TYPE_DOMAIN (type
)
20805 && dependent_type_p (TYPE_DOMAIN (type
)))
20807 return dependent_type_p (TREE_TYPE (type
));
20810 /* -- a template-id in which either the template name is a template
20812 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20814 /* ... or any of the template arguments is a dependent type or
20815 an expression that is type-dependent or value-dependent. */
20816 else if (TYPE_TEMPLATE_INFO (type
)
20817 && (any_dependent_template_arguments_p
20818 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (type
)))))
20821 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20822 dependent; if the argument of the `typeof' expression is not
20823 type-dependent, then it should already been have resolved. */
20824 if (TREE_CODE (type
) == TYPEOF_TYPE
20825 || TREE_CODE (type
) == DECLTYPE_TYPE
20826 || TREE_CODE (type
) == UNDERLYING_TYPE
)
20829 /* A template argument pack is dependent if any of its packed
20831 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
20833 tree args
= ARGUMENT_PACK_ARGS (type
);
20834 int i
, len
= TREE_VEC_LENGTH (args
);
20835 for (i
= 0; i
< len
; ++i
)
20836 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20840 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20841 be template parameters. */
20842 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
20845 /* The standard does not specifically mention types that are local
20846 to template functions or local classes, but they should be
20847 considered dependent too. For example:
20849 template <int I> void f() {
20854 The size of `E' cannot be known until the value of `I' has been
20855 determined. Therefore, `E' must be considered dependent. */
20856 scope
= TYPE_CONTEXT (type
);
20857 if (scope
&& TYPE_P (scope
))
20858 return dependent_type_p (scope
);
20859 /* Don't use type_dependent_expression_p here, as it can lead
20860 to infinite recursion trying to determine whether a lambda
20861 nested in a lambda is dependent (c++/47687). */
20862 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
20863 && DECL_LANG_SPECIFIC (scope
)
20864 && DECL_TEMPLATE_INFO (scope
)
20865 && (any_dependent_template_arguments_p
20866 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
20869 /* Other types are non-dependent. */
20873 /* Returns TRUE if TYPE is dependent, in the sense of
20874 [temp.dep.type]. Note that a NULL type is considered dependent. */
20877 dependent_type_p (tree type
)
20879 /* If there are no template parameters in scope, then there can't be
20880 any dependent types. */
20881 if (!processing_template_decl
)
20883 /* If we are not processing a template, then nobody should be
20884 providing us with a dependent type. */
20886 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
20890 /* If the type is NULL, we have not computed a type for the entity
20891 in question; in that case, the type is dependent. */
20895 /* Erroneous types can be considered non-dependent. */
20896 if (type
== error_mark_node
)
20899 /* If we have not already computed the appropriate value for TYPE,
20901 if (!TYPE_DEPENDENT_P_VALID (type
))
20903 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
20904 TYPE_DEPENDENT_P_VALID (type
) = 1;
20907 return TYPE_DEPENDENT_P (type
);
20910 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
20911 lookup. In other words, a dependent type that is not the current
20915 dependent_scope_p (tree scope
)
20917 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
20918 && !currently_open_class (scope
));
20921 /* T is a SCOPE_REF; return whether we need to consider it
20922 instantiation-dependent so that we can check access at instantiation
20923 time even though we know which member it resolves to. */
20926 instantiation_dependent_scope_ref_p (tree t
)
20928 if (DECL_P (TREE_OPERAND (t
, 1))
20929 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
20930 && accessible_in_template_p (TREE_OPERAND (t
, 0),
20931 TREE_OPERAND (t
, 1)))
20937 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
20938 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
20941 /* Note that this predicate is not appropriate for general expressions;
20942 only constant expressions (that satisfy potential_constant_expression)
20943 can be tested for value dependence. */
20946 value_dependent_expression_p (tree expression
)
20948 if (!processing_template_decl
)
20951 /* A name declared with a dependent type. */
20952 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
20955 switch (TREE_CODE (expression
))
20957 case IDENTIFIER_NODE
:
20958 /* A name that has not been looked up -- must be dependent. */
20961 case TEMPLATE_PARM_INDEX
:
20962 /* A non-type template parm. */
20966 /* A non-type template parm. */
20967 if (DECL_TEMPLATE_PARM_P (expression
))
20969 return value_dependent_expression_p (DECL_INITIAL (expression
));
20972 /* A constant with literal type and is initialized
20973 with an expression that is value-dependent.
20975 Note that a non-dependent parenthesized initializer will have
20976 already been replaced with its constant value, so if we see
20977 a TREE_LIST it must be dependent. */
20978 if (DECL_INITIAL (expression
)
20979 && decl_constant_var_p (expression
)
20980 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
20981 /* cp_finish_decl doesn't fold reference initializers. */
20982 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
20983 || value_dependent_expression_p (DECL_INITIAL (expression
))))
20987 case DYNAMIC_CAST_EXPR
:
20988 case STATIC_CAST_EXPR
:
20989 case CONST_CAST_EXPR
:
20990 case REINTERPRET_CAST_EXPR
:
20992 /* These expressions are value-dependent if the type to which
20993 the cast occurs is dependent or the expression being casted
20994 is value-dependent. */
20996 tree type
= TREE_TYPE (expression
);
20998 if (dependent_type_p (type
))
21001 /* A functional cast has a list of operands. */
21002 expression
= TREE_OPERAND (expression
, 0);
21005 /* If there are no operands, it must be an expression such
21006 as "int()". This should not happen for aggregate types
21007 because it would form non-constant expressions. */
21008 gcc_assert (cxx_dialect
>= cxx11
21009 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
21014 if (TREE_CODE (expression
) == TREE_LIST
)
21015 return any_value_dependent_elements_p (expression
);
21017 return value_dependent_expression_p (expression
);
21021 if (SIZEOF_EXPR_TYPE_P (expression
))
21022 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
21026 /* A `sizeof' expression is value-dependent if the operand is
21027 type-dependent or is a pack expansion. */
21028 expression
= TREE_OPERAND (expression
, 0);
21029 if (PACK_EXPANSION_P (expression
))
21031 else if (TYPE_P (expression
))
21032 return dependent_type_p (expression
);
21033 return instantiation_dependent_expression_p (expression
);
21035 case AT_ENCODE_EXPR
:
21036 /* An 'encode' expression is value-dependent if the operand is
21038 expression
= TREE_OPERAND (expression
, 0);
21039 return dependent_type_p (expression
);
21041 case NOEXCEPT_EXPR
:
21042 expression
= TREE_OPERAND (expression
, 0);
21043 return instantiation_dependent_expression_p (expression
);
21046 /* All instantiation-dependent expressions should also be considered
21047 value-dependent. */
21048 return instantiation_dependent_scope_ref_p (expression
);
21050 case COMPONENT_REF
:
21051 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
21052 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
21054 case NONTYPE_ARGUMENT_PACK
:
21055 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
21056 is value-dependent. */
21058 tree values
= ARGUMENT_PACK_ARGS (expression
);
21059 int i
, len
= TREE_VEC_LENGTH (values
);
21061 for (i
= 0; i
< len
; ++i
)
21062 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
21070 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
21071 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
21072 || (type2
? dependent_type_p (type2
) : false));
21076 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21077 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
21080 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21081 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
21085 tree op
= TREE_OPERAND (expression
, 0);
21086 return (value_dependent_expression_p (op
)
21087 || has_value_dependent_address (op
));
21092 tree fn
= get_callee_fndecl (expression
);
21094 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
21096 nargs
= call_expr_nargs (expression
);
21097 for (i
= 0; i
< nargs
; ++i
)
21099 tree op
= CALL_EXPR_ARG (expression
, i
);
21100 /* In a call to a constexpr member function, look through the
21101 implicit ADDR_EXPR on the object argument so that it doesn't
21102 cause the call to be considered value-dependent. We also
21103 look through it in potential_constant_expression. */
21104 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
21105 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
21106 && TREE_CODE (op
) == ADDR_EXPR
)
21107 op
= TREE_OPERAND (op
, 0);
21108 if (value_dependent_expression_p (op
))
21114 case TEMPLATE_ID_EXPR
:
21115 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
21117 return type_dependent_expression_p (expression
);
21123 if (dependent_type_p (TREE_TYPE (expression
)))
21125 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
21126 if (value_dependent_expression_p (val
))
21132 /* Treat a GNU statement expression as dependent to avoid crashing
21133 under instantiate_non_dependent_expr; it can't be constant. */
21137 /* A constant expression is value-dependent if any subexpression is
21138 value-dependent. */
21139 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
21141 case tcc_reference
:
21143 case tcc_comparison
:
21145 case tcc_expression
:
21148 int i
, len
= cp_tree_operand_length (expression
);
21150 for (i
= 0; i
< len
; i
++)
21152 tree t
= TREE_OPERAND (expression
, i
);
21154 /* In some cases, some of the operands may be missing.l
21155 (For example, in the case of PREDECREMENT_EXPR, the
21156 amount to increment by may be missing.) That doesn't
21157 make the expression dependent. */
21158 if (t
&& value_dependent_expression_p (t
))
21169 /* The expression is not value-dependent. */
21173 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
21174 [temp.dep.expr]. Note that an expression with no type is
21175 considered dependent. Other parts of the compiler arrange for an
21176 expression with type-dependent subexpressions to have no type, so
21177 this function doesn't have to be fully recursive. */
21180 type_dependent_expression_p (tree expression
)
21182 if (!processing_template_decl
)
21185 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
21188 /* An unresolved name is always dependent. */
21189 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
21192 /* Some expression forms are never type-dependent. */
21193 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
21194 || TREE_CODE (expression
) == SIZEOF_EXPR
21195 || TREE_CODE (expression
) == ALIGNOF_EXPR
21196 || TREE_CODE (expression
) == AT_ENCODE_EXPR
21197 || TREE_CODE (expression
) == NOEXCEPT_EXPR
21198 || TREE_CODE (expression
) == TRAIT_EXPR
21199 || TREE_CODE (expression
) == TYPEID_EXPR
21200 || TREE_CODE (expression
) == DELETE_EXPR
21201 || TREE_CODE (expression
) == VEC_DELETE_EXPR
21202 || TREE_CODE (expression
) == THROW_EXPR
)
21205 /* The types of these expressions depends only on the type to which
21206 the cast occurs. */
21207 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
21208 || TREE_CODE (expression
) == STATIC_CAST_EXPR
21209 || TREE_CODE (expression
) == CONST_CAST_EXPR
21210 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
21211 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
21212 || TREE_CODE (expression
) == CAST_EXPR
)
21213 return dependent_type_p (TREE_TYPE (expression
));
21215 /* The types of these expressions depends only on the type created
21216 by the expression. */
21217 if (TREE_CODE (expression
) == NEW_EXPR
21218 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
21220 /* For NEW_EXPR tree nodes created inside a template, either
21221 the object type itself or a TREE_LIST may appear as the
21223 tree type
= TREE_OPERAND (expression
, 1);
21224 if (TREE_CODE (type
) == TREE_LIST
)
21225 /* This is an array type. We need to check array dimensions
21227 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
21228 || value_dependent_expression_p
21229 (TREE_OPERAND (TREE_VALUE (type
), 1));
21231 return dependent_type_p (type
);
21234 if (TREE_CODE (expression
) == SCOPE_REF
)
21236 tree scope
= TREE_OPERAND (expression
, 0);
21237 tree name
= TREE_OPERAND (expression
, 1);
21239 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
21240 contains an identifier associated by name lookup with one or more
21241 declarations declared with a dependent type, or...a
21242 nested-name-specifier or qualified-id that names a member of an
21243 unknown specialization. */
21244 return (type_dependent_expression_p (name
)
21245 || dependent_scope_p (scope
));
21248 if (TREE_CODE (expression
) == FUNCTION_DECL
21249 && DECL_LANG_SPECIFIC (expression
)
21250 && DECL_TEMPLATE_INFO (expression
)
21251 && (any_dependent_template_arguments_p
21252 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
21255 if (TREE_CODE (expression
) == TEMPLATE_DECL
21256 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
21259 if (TREE_CODE (expression
) == STMT_EXPR
)
21260 expression
= stmt_expr_value_expr (expression
);
21262 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
21267 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
21269 if (type_dependent_expression_p (elt
))
21275 /* A static data member of the current instantiation with incomplete
21276 array type is type-dependent, as the definition and specializations
21277 can have different bounds. */
21278 if (VAR_P (expression
)
21279 && DECL_CLASS_SCOPE_P (expression
)
21280 && dependent_type_p (DECL_CONTEXT (expression
))
21281 && VAR_HAD_UNKNOWN_BOUND (expression
))
21284 /* An array of unknown bound depending on a variadic parameter, eg:
21286 template<typename... Args>
21287 void foo (Args... args)
21289 int arr[] = { args... };
21292 template<int... vals>
21295 int arr[] = { vals... };
21298 If the array has no length and has an initializer, it must be that
21299 we couldn't determine its length in cp_complete_array_type because
21300 it is dependent. */
21301 if (VAR_P (expression
)
21302 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
21303 && !TYPE_DOMAIN (TREE_TYPE (expression
))
21304 && DECL_INITIAL (expression
))
21307 if (TREE_TYPE (expression
) == unknown_type_node
)
21309 if (TREE_CODE (expression
) == ADDR_EXPR
)
21310 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
21311 if (TREE_CODE (expression
) == COMPONENT_REF
21312 || TREE_CODE (expression
) == OFFSET_REF
)
21314 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21316 expression
= TREE_OPERAND (expression
, 1);
21317 if (identifier_p (expression
))
21320 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21321 if (TREE_CODE (expression
) == SCOPE_REF
)
21324 /* Always dependent, on the number of arguments if nothing else. */
21325 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
21328 if (BASELINK_P (expression
))
21330 if (BASELINK_OPTYPE (expression
)
21331 && dependent_type_p (BASELINK_OPTYPE (expression
)))
21333 expression
= BASELINK_FUNCTIONS (expression
);
21336 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
21338 if (any_dependent_template_arguments_p
21339 (TREE_OPERAND (expression
, 1)))
21341 expression
= TREE_OPERAND (expression
, 0);
21343 gcc_assert (TREE_CODE (expression
) == OVERLOAD
21344 || TREE_CODE (expression
) == FUNCTION_DECL
);
21348 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
21350 expression
= OVL_NEXT (expression
);
21355 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
21357 return (dependent_type_p (TREE_TYPE (expression
)));
21360 /* walk_tree callback function for instantiation_dependent_expression_p,
21361 below. Returns non-zero if a dependent subexpression is found. */
21364 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
21369 /* We don't have to worry about decltype currently because decltype
21370 of an instantiation-dependent expr is a dependent type. This
21371 might change depending on the resolution of DR 1172. */
21372 *walk_subtrees
= false;
21375 enum tree_code code
= TREE_CODE (*tp
);
21378 /* Don't treat an argument list as dependent just because it has no
21386 /* A constant with a dependent initializer is dependent. */
21387 if (value_dependent_expression_p (*tp
))
21391 case TEMPLATE_PARM_INDEX
:
21394 /* Handle expressions with type operands. */
21398 case AT_ENCODE_EXPR
:
21400 tree op
= TREE_OPERAND (*tp
, 0);
21401 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
21402 op
= TREE_TYPE (op
);
21405 if (dependent_type_p (op
))
21409 *walk_subtrees
= false;
21417 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21418 || (TRAIT_EXPR_TYPE2 (*tp
)
21419 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21421 *walk_subtrees
= false;
21424 case COMPONENT_REF
:
21425 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21426 /* In a template, finish_class_member_access_expr creates a
21427 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21428 type-dependent, so that we can check access control at
21429 instantiation time (PR 42277). See also Core issue 1273. */
21434 if (instantiation_dependent_scope_ref_p (*tp
))
21439 /* Treat statement-expressions as dependent. */
21447 if (type_dependent_expression_p (*tp
))
21453 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21454 sense defined by the ABI:
21456 "An expression is instantiation-dependent if it is type-dependent
21457 or value-dependent, or it has a subexpression that is type-dependent
21458 or value-dependent." */
21461 instantiation_dependent_expression_p (tree expression
)
21465 if (!processing_template_decl
)
21468 if (expression
== error_mark_node
)
21471 result
= cp_walk_tree_without_duplicates (&expression
,
21472 instantiation_dependent_r
, NULL
);
21473 return result
!= NULL_TREE
;
21476 /* Like type_dependent_expression_p, but it also works while not processing
21477 a template definition, i.e. during substitution or mangling. */
21480 type_dependent_expression_p_push (tree expr
)
21483 ++processing_template_decl
;
21484 b
= type_dependent_expression_p (expr
);
21485 --processing_template_decl
;
21489 /* Returns TRUE if ARGS contains a type-dependent expression. */
21492 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21497 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21499 if (type_dependent_expression_p (arg
))
21505 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21506 expressions) contains any type-dependent expressions. */
21509 any_type_dependent_elements_p (const_tree list
)
21511 for (; list
; list
= TREE_CHAIN (list
))
21512 if (type_dependent_expression_p (TREE_VALUE (list
)))
21518 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21519 expressions) contains any value-dependent expressions. */
21522 any_value_dependent_elements_p (const_tree list
)
21524 for (; list
; list
= TREE_CHAIN (list
))
21525 if (value_dependent_expression_p (TREE_VALUE (list
)))
21531 /* Returns TRUE if the ARG (a template argument) is dependent. */
21534 dependent_template_arg_p (tree arg
)
21536 if (!processing_template_decl
)
21539 /* Assume a template argument that was wrongly written by the user
21540 is dependent. This is consistent with what
21541 any_dependent_template_arguments_p [that calls this function]
21543 if (!arg
|| arg
== error_mark_node
)
21546 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21547 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21549 if (TREE_CODE (arg
) == TEMPLATE_DECL
21550 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21551 return dependent_template_p (arg
);
21552 else if (ARGUMENT_PACK_P (arg
))
21554 tree args
= ARGUMENT_PACK_ARGS (arg
);
21555 int i
, len
= TREE_VEC_LENGTH (args
);
21556 for (i
= 0; i
< len
; ++i
)
21558 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21564 else if (TYPE_P (arg
))
21565 return dependent_type_p (arg
);
21567 return (type_dependent_expression_p (arg
)
21568 || value_dependent_expression_p (arg
));
21571 /* Returns true if ARGS (a collection of template arguments) contains
21572 any types that require structural equality testing. */
21575 any_template_arguments_need_structural_equality_p (tree args
)
21582 if (args
== error_mark_node
)
21585 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21587 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21588 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21590 tree arg
= TREE_VEC_ELT (level
, j
);
21591 tree packed_args
= NULL_TREE
;
21594 if (ARGUMENT_PACK_P (arg
))
21596 /* Look inside the argument pack. */
21597 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21598 len
= TREE_VEC_LENGTH (packed_args
);
21601 for (k
= 0; k
< len
; ++k
)
21604 arg
= TREE_VEC_ELT (packed_args
, k
);
21606 if (error_operand_p (arg
))
21608 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21610 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21612 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21613 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21622 /* Returns true if ARGS (a collection of template arguments) contains
21623 any dependent arguments. */
21626 any_dependent_template_arguments_p (const_tree args
)
21633 if (args
== error_mark_node
)
21636 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21638 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21639 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21640 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21647 /* Returns TRUE if the template TMPL is dependent. */
21650 dependent_template_p (tree tmpl
)
21652 if (TREE_CODE (tmpl
) == OVERLOAD
)
21656 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21658 tmpl
= OVL_NEXT (tmpl
);
21663 /* Template template parameters are dependent. */
21664 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21665 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21667 /* So are names that have not been looked up. */
21668 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21670 /* So are member templates of dependent classes. */
21671 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21672 return dependent_type_p (DECL_CONTEXT (tmpl
));
21676 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21679 dependent_template_id_p (tree tmpl
, tree args
)
21681 return (dependent_template_p (tmpl
)
21682 || any_dependent_template_arguments_p (args
));
21685 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21689 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21693 if (!processing_template_decl
)
21696 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21698 tree decl
= TREE_VEC_ELT (declv
, i
);
21699 tree init
= TREE_VEC_ELT (initv
, i
);
21700 tree cond
= TREE_VEC_ELT (condv
, i
);
21701 tree incr
= TREE_VEC_ELT (incrv
, i
);
21703 if (type_dependent_expression_p (decl
))
21706 if (init
&& type_dependent_expression_p (init
))
21709 if (type_dependent_expression_p (cond
))
21712 if (COMPARISON_CLASS_P (cond
)
21713 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21714 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21717 if (TREE_CODE (incr
) == MODOP_EXPR
)
21719 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21720 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21723 else if (type_dependent_expression_p (incr
))
21725 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21727 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21729 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
21731 tree t
= TREE_OPERAND (incr
, 1);
21732 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
21733 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
21742 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21743 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21744 no such TYPE can be found. Note that this function peers inside
21745 uninstantiated templates and therefore should be used only in
21746 extremely limited situations. ONLY_CURRENT_P restricts this
21747 peering to the currently open classes hierarchy (which is required
21748 when comparing types). */
21751 resolve_typename_type (tree type
, bool only_current_p
)
21760 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
21762 scope
= TYPE_CONTEXT (type
);
21763 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21764 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21765 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21766 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21767 identifier of the TYPENAME_TYPE anymore.
21768 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21769 TYPENAME_TYPE instead, we avoid messing up with a possible
21770 typedef variant case. */
21771 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
21773 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21774 it first before we can figure out what NAME refers to. */
21775 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21777 if (TYPENAME_IS_RESOLVING_P (scope
))
21778 /* Given a class template A with a dependent base with nested type C,
21779 typedef typename A::C::C C will land us here, as trying to resolve
21780 the initial A::C leads to the local C typedef, which leads back to
21781 A::C::C. So we break the recursion now. */
21784 scope
= resolve_typename_type (scope
, only_current_p
);
21786 /* If we don't know what SCOPE refers to, then we cannot resolve the
21788 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21790 /* If the SCOPE is a template type parameter, we have no way of
21791 resolving the name. */
21792 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
21794 /* If the SCOPE is not the current instantiation, there's no reason
21795 to look inside it. */
21796 if (only_current_p
&& !currently_open_class (scope
))
21798 /* If this is a typedef, we don't want to look inside (c++/11987). */
21799 if (typedef_variant_p (type
))
21801 /* If SCOPE isn't the template itself, it will not have a valid
21802 TYPE_FIELDS list. */
21803 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
21804 /* scope is either the template itself or a compatible instantiation
21805 like X<T>, so look up the name in the original template. */
21806 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
21808 /* scope is a partial instantiation, so we can't do the lookup or we
21809 will lose the template arguments. */
21811 /* Enter the SCOPE so that name lookup will be resolved as if we
21812 were in the class definition. In particular, SCOPE will no
21813 longer be considered a dependent type. */
21814 pushed_scope
= push_scope (scope
);
21815 /* Look up the declaration. */
21816 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
21817 tf_warning_or_error
);
21819 result
= NULL_TREE
;
21821 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21822 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21825 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
21826 && TREE_CODE (decl
) == TYPE_DECL
)
21828 result
= TREE_TYPE (decl
);
21829 if (result
== error_mark_node
)
21830 result
= NULL_TREE
;
21832 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
21833 && DECL_CLASS_TEMPLATE_P (decl
))
21837 /* Obtain the template and the arguments. */
21838 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
21839 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
21840 /* Instantiate the template. */
21841 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
21842 /*entering_scope=*/0,
21843 tf_error
| tf_user
);
21844 if (result
== error_mark_node
)
21845 result
= NULL_TREE
;
21848 /* Leave the SCOPE. */
21850 pop_scope (pushed_scope
);
21852 /* If we failed to resolve it, return the original typename. */
21856 /* If lookup found a typename type, resolve that too. */
21857 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
21859 /* Ill-formed programs can cause infinite recursion here, so we
21860 must catch that. */
21861 TYPENAME_IS_RESOLVING_P (type
) = 1;
21862 result
= resolve_typename_type (result
, only_current_p
);
21863 TYPENAME_IS_RESOLVING_P (type
) = 0;
21866 /* Qualify the resulting type. */
21867 quals
= cp_type_quals (type
);
21869 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
21874 /* EXPR is an expression which is not type-dependent. Return a proxy
21875 for EXPR that can be used to compute the types of larger
21876 expressions containing EXPR. */
21879 build_non_dependent_expr (tree expr
)
21883 #ifdef ENABLE_CHECKING
21884 /* Try to get a constant value for all non-dependent expressions in
21885 order to expose bugs in *_dependent_expression_p and constexpr. */
21886 if (cxx_dialect
>= cxx11
)
21887 fold_non_dependent_expr (expr
);
21890 /* Preserve OVERLOADs; the functions must be available to resolve
21893 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
21894 inner_expr
= stmt_expr_value_expr (inner_expr
);
21895 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
21896 inner_expr
= TREE_OPERAND (inner_expr
, 0);
21897 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
21898 inner_expr
= TREE_OPERAND (inner_expr
, 1);
21899 if (is_overloaded_fn (inner_expr
)
21900 || TREE_CODE (inner_expr
) == OFFSET_REF
)
21902 /* There is no need to return a proxy for a variable. */
21905 /* Preserve string constants; conversions from string constants to
21906 "char *" are allowed, even though normally a "const char *"
21907 cannot be used to initialize a "char *". */
21908 if (TREE_CODE (expr
) == STRING_CST
)
21910 /* Preserve void and arithmetic constants, as an optimization -- there is no
21911 reason to create a new node. */
21912 if (TREE_CODE (expr
) == VOID_CST
21913 || TREE_CODE (expr
) == INTEGER_CST
21914 || TREE_CODE (expr
) == REAL_CST
)
21916 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
21917 There is at least one place where we want to know that a
21918 particular expression is a throw-expression: when checking a ?:
21919 expression, there are special rules if the second or third
21920 argument is a throw-expression. */
21921 if (TREE_CODE (expr
) == THROW_EXPR
)
21924 /* Don't wrap an initializer list, we need to be able to look inside. */
21925 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
21928 /* Don't wrap a dummy object, we need to be able to test for it. */
21929 if (is_dummy_object (expr
))
21932 if (TREE_CODE (expr
) == COND_EXPR
)
21933 return build3 (COND_EXPR
,
21935 TREE_OPERAND (expr
, 0),
21936 (TREE_OPERAND (expr
, 1)
21937 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
21938 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
21939 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
21940 if (TREE_CODE (expr
) == COMPOUND_EXPR
21941 && !COMPOUND_EXPR_OVERLOADED (expr
))
21942 return build2 (COMPOUND_EXPR
,
21944 TREE_OPERAND (expr
, 0),
21945 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
21947 /* If the type is unknown, it can't really be non-dependent */
21948 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
21950 /* Otherwise, build a NON_DEPENDENT_EXPR. */
21951 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
21954 /* ARGS is a vector of expressions as arguments to a function call.
21955 Replace the arguments with equivalent non-dependent expressions.
21956 This modifies ARGS in place. */
21959 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
21964 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
21966 tree newarg
= build_non_dependent_expr (arg
);
21968 (*args
)[ix
] = newarg
;
21972 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
21973 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
21977 make_auto_1 (tree name
)
21979 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
21980 TYPE_NAME (au
) = build_decl (input_location
,
21981 TYPE_DECL
, name
, au
);
21982 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
21983 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
21984 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
21985 TYPE_NAME (au
), NULL_TREE
);
21986 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
21987 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
21988 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
21994 make_decltype_auto (void)
21996 return make_auto_1 (get_identifier ("decltype(auto)"));
22002 return make_auto_1 (get_identifier ("auto"));
22005 /* Given type ARG, return std::initializer_list<ARG>. */
22010 tree std_init_list
= namespace_binding
22011 (get_identifier ("initializer_list"), std_node
);
22013 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
22015 error ("deducing from brace-enclosed initializer list requires "
22016 "#include <initializer_list>");
22017 return error_mark_node
;
22019 argvec
= make_tree_vec (1);
22020 TREE_VEC_ELT (argvec
, 0) = arg
;
22021 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
22022 NULL_TREE
, 0, tf_warning_or_error
);
22025 /* Replace auto in TYPE with std::initializer_list<auto>. */
22028 listify_autos (tree type
, tree auto_node
)
22030 tree init_auto
= listify (auto_node
);
22031 tree argvec
= make_tree_vec (1);
22032 TREE_VEC_ELT (argvec
, 0) = init_auto
;
22033 if (processing_template_decl
)
22034 argvec
= add_to_template_args (current_template_args (), argvec
);
22035 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22038 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
22039 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
22042 do_auto_deduction (tree type
, tree init
, tree auto_node
)
22046 if (init
== error_mark_node
)
22047 return error_mark_node
;
22049 if (type_dependent_expression_p (init
))
22050 /* Defining a subset of type-dependent expressions that we can deduce
22051 from ahead of time isn't worth the trouble. */
22054 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
22055 with either a new invented type template parameter U or, if the
22056 initializer is a braced-init-list (8.5.4), with
22057 std::initializer_list<U>. */
22058 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
22059 type
= listify_autos (type
, auto_node
);
22061 init
= resolve_nondeduced_context (init
);
22063 targs
= make_tree_vec (1);
22064 if (AUTO_IS_DECLTYPE (auto_node
))
22066 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
22067 && !REF_PARENTHESIZED_P (init
)));
22068 TREE_VEC_ELT (targs
, 0)
22069 = finish_decltype_type (init
, id
, tf_warning_or_error
);
22070 if (type
!= auto_node
)
22072 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
22073 return error_mark_node
;
22078 tree parms
= build_tree_list (NULL_TREE
, type
);
22079 tree tparms
= make_tree_vec (1);
22082 TREE_VEC_ELT (tparms
, 0)
22083 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
22084 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
22085 DEDUCE_CALL
, LOOKUP_NORMAL
,
22086 NULL
, /*explain_p=*/false);
22089 if (processing_template_decl
)
22090 /* Try again at instantiation time. */
22092 if (type
&& type
!= error_mark_node
)
22093 /* If type is error_mark_node a diagnostic must have been
22094 emitted by now. Also, having a mention to '<type error>'
22095 in the diagnostic is not really useful to the user. */
22097 if (cfun
&& auto_node
== current_function_auto_return_pattern
22098 && LAMBDA_FUNCTION_P (current_function_decl
))
22099 error ("unable to deduce lambda return type from %qE", init
);
22101 error ("unable to deduce %qT from %qE", type
, init
);
22103 return error_mark_node
;
22107 /* If the list of declarators contains more than one declarator, the type
22108 of each declared variable is determined as described above. If the
22109 type deduced for the template parameter U is not the same in each
22110 deduction, the program is ill-formed. */
22111 if (TREE_TYPE (auto_node
)
22112 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
22114 if (cfun
&& auto_node
== current_function_auto_return_pattern
22115 && LAMBDA_FUNCTION_P (current_function_decl
))
22116 error ("inconsistent types %qT and %qT deduced for "
22117 "lambda return type", TREE_TYPE (auto_node
),
22118 TREE_VEC_ELT (targs
, 0));
22120 error ("inconsistent deduction for %qT: %qT and then %qT",
22121 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
22122 return error_mark_node
;
22124 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
22126 if (processing_template_decl
)
22127 targs
= add_to_template_args (current_template_args (), targs
);
22128 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
22131 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
22135 splice_late_return_type (tree type
, tree late_return_type
)
22139 if (late_return_type
== NULL_TREE
)
22141 argvec
= make_tree_vec (1);
22142 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
22143 if (processing_template_parmlist
)
22144 /* For a late-specified return type in a template type-parameter, we
22145 need to add a dummy argument level for its parmlist. */
22146 argvec
= add_to_template_args
22147 (make_tree_vec (processing_template_parmlist
), argvec
);
22148 if (current_template_parms
)
22149 argvec
= add_to_template_args (current_template_args (), argvec
);
22150 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22153 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
22154 'decltype(auto)'. */
22157 is_auto (const_tree type
)
22159 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22160 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
22161 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
22167 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
22168 a use of `auto'. Returns NULL_TREE otherwise. */
22171 type_uses_auto (tree type
)
22173 return find_type_usage (type
, is_auto
);
22176 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
22177 'decltype(auto)' or a concept. */
22180 is_auto_or_concept (const_tree type
)
22182 return is_auto (type
); // or concept
22185 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
22186 a concept identifier) iff TYPE contains a use of a generic type. Returns
22187 NULL_TREE otherwise. */
22190 type_uses_auto_or_concept (tree type
)
22192 return find_type_usage (type
, is_auto_or_concept
);
22196 /* For a given template T, return the vector of typedefs referenced
22197 in T for which access check is needed at T instantiation time.
22198 T is either a FUNCTION_DECL or a RECORD_TYPE.
22199 Those typedefs were added to T by the function
22200 append_type_to_template_for_access_check. */
22202 vec
<qualified_typedef_usage_t
, va_gc
> *
22203 get_types_needing_access_check (tree t
)
22206 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
22208 if (!t
|| t
== error_mark_node
)
22211 if (!(ti
= get_template_info (t
)))
22214 if (CLASS_TYPE_P (t
)
22215 || TREE_CODE (t
) == FUNCTION_DECL
)
22217 if (!TI_TEMPLATE (ti
))
22220 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
22226 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
22227 tied to T. That list of typedefs will be access checked at
22228 T instantiation time.
22229 T is either a FUNCTION_DECL or a RECORD_TYPE.
22230 TYPE_DECL is a TYPE_DECL node representing a typedef.
22231 SCOPE is the scope through which TYPE_DECL is accessed.
22232 LOCATION is the location of the usage point of TYPE_DECL.
22234 This function is a subroutine of
22235 append_type_to_template_for_access_check. */
22238 append_type_to_template_for_access_check_1 (tree t
,
22241 location_t location
)
22243 qualified_typedef_usage_t typedef_usage
;
22246 if (!t
|| t
== error_mark_node
)
22249 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
22250 || CLASS_TYPE_P (t
))
22252 && TREE_CODE (type_decl
) == TYPE_DECL
22255 if (!(ti
= get_template_info (t
)))
22258 gcc_assert (TI_TEMPLATE (ti
));
22260 typedef_usage
.typedef_decl
= type_decl
;
22261 typedef_usage
.context
= scope
;
22262 typedef_usage
.locus
= location
;
22264 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
22267 /* Append TYPE_DECL to the template TEMPL.
22268 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
22269 At TEMPL instanciation time, TYPE_DECL will be checked to see
22270 if it can be accessed through SCOPE.
22271 LOCATION is the location of the usage point of TYPE_DECL.
22273 e.g. consider the following code snippet:
22280 template<class U> struct S
22282 C::myint mi; // <-- usage point of the typedef C::myint
22287 At S<char> instantiation time, we need to check the access of C::myint
22288 In other words, we need to check the access of the myint typedef through
22289 the C scope. For that purpose, this function will add the myint typedef
22290 and the scope C through which its being accessed to a list of typedefs
22291 tied to the template S. That list will be walked at template instantiation
22292 time and access check performed on each typedefs it contains.
22293 Note that this particular code snippet should yield an error because
22294 myint is private to C. */
22297 append_type_to_template_for_access_check (tree templ
,
22300 location_t location
)
22302 qualified_typedef_usage_t
*iter
;
22305 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
22307 /* Make sure we don't append the type to the template twice. */
22308 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
22309 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
22312 append_type_to_template_for_access_check_1 (templ
, type_decl
,
22316 /* Convert the generic type parameters in PARM that match the types given in the
22317 range [START_IDX, END_IDX) from the current_template_parms into generic type
22321 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
22323 tree current
= current_template_parms
;
22324 int depth
= TMPL_PARMS_DEPTH (current
);
22325 current
= INNERMOST_TEMPLATE_PARMS (current
);
22326 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
22328 for (int i
= 0; i
< start_idx
; ++i
)
22329 TREE_VEC_ELT (replacement
, i
)
22330 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22332 for (int i
= start_idx
; i
< end_idx
; ++i
)
22334 /* Create a distinct parameter pack type from the current parm and add it
22335 to the replacement args to tsubst below into the generic function
22338 tree o
= TREE_TYPE (TREE_VALUE
22339 (TREE_VEC_ELT (current
, i
)));
22340 tree t
= copy_type (o
);
22341 TEMPLATE_TYPE_PARM_INDEX (t
)
22342 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
22344 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
22345 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
22346 TYPE_MAIN_VARIANT (t
) = t
;
22347 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
22348 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
22349 TREE_VEC_ELT (replacement
, i
) = t
;
22350 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
22353 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
22354 TREE_VEC_ELT (replacement
, i
)
22355 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22357 /* If there are more levels then build up the replacement with the outer
22360 replacement
= add_to_template_args (template_parms_to_args
22361 (TREE_CHAIN (current_template_parms
)),
22364 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
22368 /* Set up the hash tables for template instantiations. */
22371 init_template_processing (void)
22373 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
22374 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
22377 /* Print stats about the template hash tables for -fstats. */
22380 print_template_statistics (void)
22382 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
22383 "%f collisions\n", (long) decl_specializations
->size (),
22384 (long) decl_specializations
->elements (),
22385 decl_specializations
->collisions ());
22386 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
22387 "%f collisions\n", (long) type_specializations
->size (),
22388 (long) type_specializations
->elements (),
22389 type_specializations
->collisions ());
22392 #include "gt-cp-pt.h"