1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2015 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"
33 #include "stringpool.h"
36 #include "stor-layout.h"
40 #include "c-family/c-common.h"
41 #include "c-family/c-objc.h"
42 #include "cp-objcp-common.h"
43 #include "tree-inline.h"
47 #include "tree-iterator.h"
48 #include "type-utils.h"
51 /* The type of functions taking a tree, and some additional data, and
53 typedef int (*tree_fn_t
) (tree
, void*);
55 /* The PENDING_TEMPLATES is a TREE_LIST of templates whose
56 instantiations have been deferred, either because their definitions
57 were not yet available, or because we were putting off doing the work. */
58 struct GTY ((chain_next ("%h.next"))) pending_template
{
59 struct pending_template
*next
;
60 struct tinst_level
*tinst
;
63 static GTY(()) struct pending_template
*pending_templates
;
64 static GTY(()) struct pending_template
*last_pending_template
;
66 int processing_template_parmlist
;
67 static int template_header_count
;
69 static GTY(()) tree saved_trees
;
70 static vec
<int> inline_parm_levels
;
72 static GTY(()) struct tinst_level
*current_tinst_level
;
74 static GTY(()) tree saved_access_scope
;
76 /* Live only within one (recursive) call to tsubst_expr. We use
77 this to pass the statement expression node from the STMT_EXPR
78 to the EXPR_STMT that is its result. */
79 static tree cur_stmt_expr
;
81 /* True if we've recursed into fn_type_unification too many times. */
82 static bool excessive_deduction_depth
;
84 struct GTY((for_user
)) spec_entry
91 struct spec_hasher
: ggc_ptr_hash
<spec_entry
>
93 static hashval_t
hash (spec_entry
*);
94 static bool equal (spec_entry
*, spec_entry
*);
97 static GTY (()) hash_table
<spec_hasher
> *decl_specializations
;
99 static GTY (()) hash_table
<spec_hasher
> *type_specializations
;
101 /* Contains canonical template parameter types. The vector is indexed by
102 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
103 TREE_LIST, whose TREE_VALUEs contain the canonical template
104 parameters of various types and levels. */
105 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
107 #define UNIFY_ALLOW_NONE 0
108 #define UNIFY_ALLOW_MORE_CV_QUAL 1
109 #define UNIFY_ALLOW_LESS_CV_QUAL 2
110 #define UNIFY_ALLOW_DERIVED 4
111 #define UNIFY_ALLOW_INTEGER 8
112 #define UNIFY_ALLOW_OUTER_LEVEL 16
113 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
114 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
116 enum template_base_result
{
118 tbr_ambiguous_baseclass
,
122 static void push_access_scope (tree
);
123 static void pop_access_scope (tree
);
124 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
125 unification_kind_t
, int,
127 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
128 unification_kind_t
, int, bool, bool);
129 static int unify (tree
, tree
, tree
, tree
, int, bool);
130 static void add_pending_template (tree
);
131 static tree
reopen_tinst_level (struct tinst_level
*);
132 static tree
tsubst_initializer_list (tree
, tree
);
133 static tree
get_partial_spec_bindings (tree
, tree
, tree
, tree
);
134 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
136 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
138 static void tsubst_enum (tree
, tree
, tree
);
139 static tree
add_to_template_args (tree
, tree
);
140 static tree
add_outermost_template_args (tree
, tree
);
141 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
142 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
144 static int type_unification_real (tree
, tree
, tree
, const tree
*,
145 unsigned int, int, unification_kind_t
, int,
146 vec
<deferred_access_check
, va_gc
> **,
148 static void note_template_header (int);
149 static tree
convert_nontype_argument_function (tree
, tree
, tsubst_flags_t
);
150 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
151 static tree
convert_template_argument (tree
, tree
, tree
,
152 tsubst_flags_t
, int, tree
);
153 static int for_each_template_parm (tree
, tree_fn_t
, void*,
154 hash_set
<tree
> *, bool);
155 static tree
expand_template_argument_pack (tree
);
156 static tree
build_template_parm_index (int, int, int, tree
, tree
);
157 static bool inline_needs_template_parms (tree
, bool);
158 static void push_inline_template_parms_recursive (tree
, int);
159 static tree
retrieve_local_specialization (tree
);
160 static void register_local_specialization (tree
, tree
);
161 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
162 static int mark_template_parm (tree
, void *);
163 static int template_parm_this_level_p (tree
, void *);
164 static tree
tsubst_friend_function (tree
, tree
);
165 static tree
tsubst_friend_class (tree
, tree
);
166 static int can_complete_type_without_circularity (tree
);
167 static tree
get_bindings (tree
, tree
, tree
, bool);
168 static int template_decl_level (tree
);
169 static int check_cv_quals_for_unify (int, tree
, tree
);
170 static void template_parm_level_and_index (tree
, int*, int*);
171 static int unify_pack_expansion (tree
, tree
, tree
,
172 tree
, unification_kind_t
, bool, bool);
173 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
174 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
175 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
176 static void regenerate_decl_from_template (tree
, tree
);
177 static tree
most_specialized_partial_spec (tree
, tsubst_flags_t
);
178 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
179 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
180 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
181 static bool check_specialization_scope (void);
182 static tree
process_partial_specialization (tree
);
183 static void set_current_access_from_decl (tree
);
184 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
186 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
187 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
189 static bool template_template_parm_bindings_ok_p (tree
, tree
);
190 static int template_args_equal (tree
, tree
);
191 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
192 static tree
for_each_template_parm_r (tree
*, int *, void *);
193 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
194 static void copy_default_args_to_explicit_spec (tree
);
195 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
196 static bool dependent_template_arg_p (tree
);
197 static bool any_template_arguments_need_structural_equality_p (tree
);
198 static bool dependent_type_p_r (tree
);
199 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
200 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
201 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
202 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
203 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
204 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
206 static tree
listify (tree
);
207 static tree
listify_autos (tree
, tree
);
208 static tree
template_parm_to_arg (tree t
);
209 static tree
current_template_args (void);
210 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
211 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
212 static bool complex_alias_template_p (const_tree tmpl
);
214 /* Make the current scope suitable for access checking when we are
215 processing T. T can be FUNCTION_DECL for instantiated function
216 template, VAR_DECL for static member variable, or TYPE_DECL for
217 alias template (needed by instantiate_decl). */
220 push_access_scope (tree t
)
222 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
223 || TREE_CODE (t
) == TYPE_DECL
);
225 if (DECL_FRIEND_CONTEXT (t
))
226 push_nested_class (DECL_FRIEND_CONTEXT (t
));
227 else if (DECL_CLASS_SCOPE_P (t
))
228 push_nested_class (DECL_CONTEXT (t
));
230 push_to_top_level ();
232 if (TREE_CODE (t
) == FUNCTION_DECL
)
234 saved_access_scope
= tree_cons
235 (NULL_TREE
, current_function_decl
, saved_access_scope
);
236 current_function_decl
= t
;
240 /* Restore the scope set up by push_access_scope. T is the node we
244 pop_access_scope (tree t
)
246 if (TREE_CODE (t
) == FUNCTION_DECL
)
248 current_function_decl
= TREE_VALUE (saved_access_scope
);
249 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
252 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
255 pop_from_top_level ();
258 /* Do any processing required when DECL (a member template
259 declaration) is finished. Returns the TEMPLATE_DECL corresponding
260 to DECL, unless it is a specialization, in which case the DECL
261 itself is returned. */
264 finish_member_template_decl (tree decl
)
266 if (decl
== error_mark_node
)
267 return error_mark_node
;
269 gcc_assert (DECL_P (decl
));
271 if (TREE_CODE (decl
) == TYPE_DECL
)
275 type
= TREE_TYPE (decl
);
276 if (type
== error_mark_node
)
277 return error_mark_node
;
278 if (MAYBE_CLASS_TYPE_P (type
)
279 && CLASSTYPE_TEMPLATE_INFO (type
)
280 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
282 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
283 check_member_template (tmpl
);
288 else if (TREE_CODE (decl
) == FIELD_DECL
)
289 error ("data member %qD cannot be a member template", decl
);
290 else if (DECL_TEMPLATE_INFO (decl
))
292 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
294 check_member_template (DECL_TI_TEMPLATE (decl
));
295 return DECL_TI_TEMPLATE (decl
);
301 error ("invalid member template declaration %qD", decl
);
303 return error_mark_node
;
306 /* Create a template info node. */
309 build_template_info (tree template_decl
, tree template_args
)
311 tree result
= make_node (TEMPLATE_INFO
);
312 TI_TEMPLATE (result
) = template_decl
;
313 TI_ARGS (result
) = template_args
;
317 /* Return the template info node corresponding to T, whatever T is. */
320 get_template_info (const_tree t
)
322 tree tinfo
= NULL_TREE
;
324 if (!t
|| t
== error_mark_node
)
327 if (TREE_CODE (t
) == NAMESPACE_DECL
)
330 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
331 tinfo
= DECL_TEMPLATE_INFO (t
);
333 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
336 if (OVERLOAD_TYPE_P (t
))
337 tinfo
= TYPE_TEMPLATE_INFO (t
);
338 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
339 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
344 /* Returns the template nesting level of the indicated class TYPE.
354 A<T>::B<U> has depth two, while A<T> has depth one.
355 Both A<T>::B<int> and A<int>::B<U> have depth one, if
356 they are instantiations, not specializations.
358 This function is guaranteed to return 0 if passed NULL_TREE so
359 that, for example, `template_class_depth (current_class_type)' is
363 template_class_depth (tree type
)
368 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
369 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
370 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
372 tree tinfo
= get_template_info (type
);
374 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
375 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
382 /* Subroutine of maybe_begin_member_template_processing.
383 Returns true if processing DECL needs us to push template parms. */
386 inline_needs_template_parms (tree decl
, bool nsdmi
)
388 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
391 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
392 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
395 /* Subroutine of maybe_begin_member_template_processing.
396 Push the template parms in PARMS, starting from LEVELS steps into the
397 chain, and ending at the beginning, since template parms are listed
401 push_inline_template_parms_recursive (tree parmlist
, int levels
)
403 tree parms
= TREE_VALUE (parmlist
);
407 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
409 ++processing_template_decl
;
410 current_template_parms
411 = tree_cons (size_int (processing_template_decl
),
412 parms
, current_template_parms
);
413 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
415 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
417 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
419 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
421 if (error_operand_p (parm
))
424 gcc_assert (DECL_P (parm
));
426 switch (TREE_CODE (parm
))
435 /* Make a CONST_DECL as is done in process_template_parm.
436 It is ugly that we recreate this here; the original
437 version built in process_template_parm is no longer
439 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
440 CONST_DECL
, DECL_NAME (parm
),
442 DECL_ARTIFICIAL (decl
) = 1;
443 TREE_CONSTANT (decl
) = 1;
444 TREE_READONLY (decl
) = 1;
445 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
446 SET_DECL_TEMPLATE_PARM_P (decl
);
457 /* Restore the template parameter context for a member template, a
458 friend template defined in a class definition, or a non-template
459 member of template class. */
462 maybe_begin_member_template_processing (tree decl
)
466 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
470 tree ctx
= DECL_CONTEXT (decl
);
471 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
472 /* Disregard full specializations (c++/60999). */
473 && uses_template_parms (ctx
)
474 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
477 if (inline_needs_template_parms (decl
, nsdmi
))
479 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
480 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
482 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
485 parms
= TREE_CHAIN (parms
);
488 push_inline_template_parms_recursive (parms
, levels
);
491 /* Remember how many levels of template parameters we pushed so that
492 we can pop them later. */
493 inline_parm_levels
.safe_push (levels
);
496 /* Undo the effects of maybe_begin_member_template_processing. */
499 maybe_end_member_template_processing (void)
504 if (inline_parm_levels
.length () == 0)
507 last
= inline_parm_levels
.pop ();
508 for (i
= 0; i
< last
; ++i
)
510 --processing_template_decl
;
511 current_template_parms
= TREE_CHAIN (current_template_parms
);
516 /* Return a new template argument vector which contains all of ARGS,
517 but has as its innermost set of arguments the EXTRA_ARGS. */
520 add_to_template_args (tree args
, tree extra_args
)
527 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
530 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
531 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
533 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
534 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
536 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
537 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
542 /* Like add_to_template_args, but only the outermost ARGS are added to
543 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
544 (EXTRA_ARGS) levels are added. This function is used to combine
545 the template arguments from a partial instantiation with the
546 template arguments used to attain the full instantiation from the
547 partial instantiation. */
550 add_outermost_template_args (tree args
, tree extra_args
)
554 /* If there are more levels of EXTRA_ARGS than there are ARGS,
555 something very fishy is going on. */
556 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
558 /* If *all* the new arguments will be the EXTRA_ARGS, just return
560 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
563 /* For the moment, we make ARGS look like it contains fewer levels. */
564 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
566 new_args
= add_to_template_args (args
, extra_args
);
568 /* Now, we restore ARGS to its full dimensions. */
569 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
574 /* Return the N levels of innermost template arguments from the ARGS. */
577 get_innermost_template_args (tree args
, int n
)
585 /* If N is 1, just return the innermost set of template arguments. */
587 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
589 /* If we're not removing anything, just return the arguments we were
591 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
592 gcc_assert (extra_levels
>= 0);
593 if (extra_levels
== 0)
596 /* Make a new set of arguments, not containing the outer arguments. */
597 new_args
= make_tree_vec (n
);
598 for (i
= 1; i
<= n
; ++i
)
599 SET_TMPL_ARGS_LEVEL (new_args
, i
,
600 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
605 /* The inverse of get_innermost_template_args: Return all but the innermost
606 EXTRA_LEVELS levels of template arguments from the ARGS. */
609 strip_innermost_template_args (tree args
, int extra_levels
)
612 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
617 /* If N is 1, just return the outermost set of template arguments. */
619 return TMPL_ARGS_LEVEL (args
, 1);
621 /* If we're not removing anything, just return the arguments we were
623 gcc_assert (extra_levels
>= 0);
624 if (extra_levels
== 0)
627 /* Make a new set of arguments, not containing the inner arguments. */
628 new_args
= make_tree_vec (n
);
629 for (i
= 1; i
<= n
; ++i
)
630 SET_TMPL_ARGS_LEVEL (new_args
, i
,
631 TMPL_ARGS_LEVEL (args
, i
));
636 /* We've got a template header coming up; push to a new level for storing
640 begin_template_parm_list (void)
642 /* We use a non-tag-transparent scope here, which causes pushtag to
643 put tags in this scope, rather than in the enclosing class or
644 namespace scope. This is the right thing, since we want
645 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
646 global template class, push_template_decl handles putting the
647 TEMPLATE_DECL into top-level scope. For a nested template class,
650 template <class T> struct S1 {
651 template <class T> struct S2 {};
654 pushtag contains special code to call pushdecl_with_scope on the
655 TEMPLATE_DECL for S2. */
656 begin_scope (sk_template_parms
, NULL
);
657 ++processing_template_decl
;
658 ++processing_template_parmlist
;
659 note_template_header (0);
662 /* This routine is called when a specialization is declared. If it is
663 invalid to declare a specialization here, an error is reported and
664 false is returned, otherwise this routine will return true. */
667 check_specialization_scope (void)
669 tree scope
= current_scope ();
673 An explicit specialization shall be declared in the namespace of
674 which the template is a member, or, for member templates, in the
675 namespace of which the enclosing class or enclosing class
676 template is a member. An explicit specialization of a member
677 function, member class or static data member of a class template
678 shall be declared in the namespace of which the class template
680 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
682 error ("explicit specialization in non-namespace scope %qD", scope
);
688 In an explicit specialization declaration for a member of a class
689 template or a member template that appears in namespace scope,
690 the member template and some of its enclosing class templates may
691 remain unspecialized, except that the declaration shall not
692 explicitly specialize a class member template if its enclosing
693 class templates are not explicitly specialized as well. */
694 if (current_template_parms
)
696 error ("enclosing class templates are not explicitly specialized");
703 /* We've just seen template <>. */
706 begin_specialization (void)
708 begin_scope (sk_template_spec
, NULL
);
709 note_template_header (1);
710 return check_specialization_scope ();
713 /* Called at then end of processing a declaration preceded by
717 end_specialization (void)
720 reset_specialization ();
723 /* Any template <>'s that we have seen thus far are not referring to a
724 function specialization. */
727 reset_specialization (void)
729 processing_specialization
= 0;
730 template_header_count
= 0;
733 /* We've just seen a template header. If SPECIALIZATION is nonzero,
734 it was of the form template <>. */
737 note_template_header (int specialization
)
739 processing_specialization
= specialization
;
740 template_header_count
++;
743 /* We're beginning an explicit instantiation. */
746 begin_explicit_instantiation (void)
748 gcc_assert (!processing_explicit_instantiation
);
749 processing_explicit_instantiation
= true;
754 end_explicit_instantiation (void)
756 gcc_assert (processing_explicit_instantiation
);
757 processing_explicit_instantiation
= false;
760 /* An explicit specialization or partial specialization of TMPL is being
761 declared. Check that the namespace in which the specialization is
762 occurring is permissible. Returns false iff it is invalid to
763 specialize TMPL in the current namespace. */
766 check_specialization_namespace (tree tmpl
)
768 tree tpl_ns
= decl_namespace_context (tmpl
);
772 An explicit specialization shall be declared in the namespace of
773 which the template is a member, or, for member templates, in the
774 namespace of which the enclosing class or enclosing class
775 template is a member. An explicit specialization of a member
776 function, member class or static data member of a class template
777 shall be declared in the namespace of which the class template is
779 if (current_scope() != DECL_CONTEXT (tmpl
)
780 && !at_namespace_scope_p ())
782 error ("specialization of %qD must appear at namespace scope", tmpl
);
785 if (is_associated_namespace (current_namespace
, tpl_ns
))
786 /* Same or super-using namespace. */
790 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
791 permerror (input_location
, " from definition of %q+#D", tmpl
);
796 /* SPEC is an explicit instantiation. Check that it is valid to
797 perform this explicit instantiation in the current namespace. */
800 check_explicit_instantiation_namespace (tree spec
)
804 /* DR 275: An explicit instantiation shall appear in an enclosing
805 namespace of its template. */
806 ns
= decl_namespace_context (spec
);
807 if (!is_ancestor (current_namespace
, ns
))
808 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
809 "(which does not enclose namespace %qD)",
810 spec
, current_namespace
, ns
);
813 /* The TYPE is being declared. If it is a template type, that means it
814 is a partial specialization. Do appropriate error-checking. */
817 maybe_process_partial_specialization (tree type
)
821 if (type
== error_mark_node
)
822 return error_mark_node
;
824 /* A lambda that appears in specialization context is not itself a
826 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
829 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
831 error ("name of class shadows template template parameter %qD",
833 return error_mark_node
;
836 context
= TYPE_CONTEXT (type
);
838 if (TYPE_ALIAS_P (type
))
840 if (TYPE_TEMPLATE_INFO (type
)
841 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
842 error ("specialization of alias template %qD",
843 TYPE_TI_TEMPLATE (type
));
845 error ("explicit specialization of non-template %qT", type
);
846 return error_mark_node
;
848 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
850 /* This is for ordinary explicit specialization and partial
851 specialization of a template class such as:
853 template <> class C<int>;
857 template <class T> class C<T*>;
859 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
861 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
862 && !COMPLETE_TYPE_P (type
))
864 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
))
865 && !at_namespace_scope_p ())
866 return error_mark_node
;
867 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
868 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
869 if (processing_template_decl
)
871 if (push_template_decl (TYPE_MAIN_DECL (type
))
873 return error_mark_node
;
876 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
877 error ("specialization of %qT after instantiation", type
);
878 else if (errorcount
&& !processing_specialization
879 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
880 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
881 /* Trying to define a specialization either without a template<> header
882 or in an inappropriate place. We've already given an error, so just
883 bail now so we don't actually define the specialization. */
884 return error_mark_node
;
886 else if (CLASS_TYPE_P (type
)
887 && !CLASSTYPE_USE_TEMPLATE (type
)
888 && CLASSTYPE_TEMPLATE_INFO (type
)
889 && context
&& CLASS_TYPE_P (context
)
890 && CLASSTYPE_TEMPLATE_INFO (context
))
892 /* This is for an explicit specialization of member class
893 template according to [temp.expl.spec/18]:
895 template <> template <class U> class C<int>::D;
897 The context `C<int>' must be an implicit instantiation.
898 Otherwise this is just a member class template declared
901 template <> class C<int> { template <class U> class D; };
902 template <> template <class U> class C<int>::D;
904 In the first case, `C<int>::D' is a specialization of `C<T>::D'
905 while in the second case, `C<int>::D' is a primary template
906 and `C<T>::D' may not exist. */
908 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
909 && !COMPLETE_TYPE_P (type
))
912 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
914 if (current_namespace
915 != decl_namespace_context (tmpl
))
917 permerror (input_location
, "specializing %q#T in different namespace", type
);
918 permerror (input_location
, " from definition of %q+#D", tmpl
);
921 /* Check for invalid specialization after instantiation:
923 template <> template <> class C<int>::D<int>;
924 template <> template <class U> class C<int>::D; */
926 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
927 t
; t
= TREE_CHAIN (t
))
929 tree inst
= TREE_VALUE (t
);
930 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
931 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
933 /* We already have a full specialization of this partial
934 instantiation, or a full specialization has been
935 looked up but not instantiated. Reassign it to the
936 new member specialization template. */
940 elt
.tmpl
= most_general_template (tmpl
);
941 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
944 type_specializations
->remove_elt (&elt
);
947 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
950 = type_specializations
->find_slot (&elt
, INSERT
);
951 entry
= ggc_alloc
<spec_entry
> ();
956 /* But if we've had an implicit instantiation, that's a
957 problem ([temp.expl.spec]/6). */
958 error ("specialization %qT after instantiation %qT",
962 /* Mark TYPE as a specialization. And as a result, we only
963 have one level of template argument for the innermost
965 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
966 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
967 CLASSTYPE_TI_ARGS (type
)
968 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
971 else if (processing_specialization
)
973 /* Someday C++0x may allow for enum template specialization. */
974 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
975 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
976 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
977 "of %qD not allowed by ISO C++", type
);
980 error ("explicit specialization of non-template %qT", type
);
981 return error_mark_node
;
988 /* Returns nonzero if we can optimize the retrieval of specializations
989 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
990 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
993 optimize_specialization_lookup_p (tree tmpl
)
995 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
996 && DECL_CLASS_SCOPE_P (tmpl
)
997 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
999 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
1000 /* The optimized lookup depends on the fact that the
1001 template arguments for the member function template apply
1002 purely to the containing class, which is not true if the
1003 containing class is an explicit or partial
1005 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1006 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1007 && !DECL_CONV_FN_P (tmpl
)
1008 /* It is possible to have a template that is not a member
1009 template and is not a member of a template class:
1011 template <typename T>
1012 struct S { friend A::f(); };
1014 Here, the friend function is a template, but the context does
1015 not have template information. The optimized lookup relies
1016 on having ARGS be the template arguments for both the class
1017 and the function template. */
1018 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1021 /* Make sure ARGS doesn't use any inappropriate typedefs; we should have
1022 gone through coerce_template_parms by now. */
1025 check_unstripped_args (tree args ATTRIBUTE_UNUSED
)
1027 #ifdef ENABLE_CHECKING
1028 ++processing_template_decl
;
1029 if (!any_dependent_template_arguments_p (args
))
1031 tree inner
= INNERMOST_TEMPLATE_ARGS (args
);
1032 for (int i
= 0; i
< TREE_VEC_LENGTH (inner
); ++i
)
1034 tree arg
= TREE_VEC_ELT (inner
, i
);
1035 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
1037 else if (TYPE_P (arg
))
1038 gcc_assert (strip_typedefs (arg
, NULL
) == arg
);
1039 else if (strip_typedefs (TREE_TYPE (arg
), NULL
) != TREE_TYPE (arg
))
1040 /* Allow typedefs on the type of a non-type argument, since a
1041 parameter can have them. */;
1043 gcc_assert (strip_typedefs_expr (arg
, NULL
) == arg
);
1046 --processing_template_decl
;
1050 /* Retrieve the specialization (in the sense of [temp.spec] - a
1051 specialization is either an instantiation or an explicit
1052 specialization) of TMPL for the given template ARGS. If there is
1053 no such specialization, return NULL_TREE. The ARGS are a vector of
1054 arguments, or a vector of vectors of arguments, in the case of
1055 templates with more than one level of parameters.
1057 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1058 then we search for a partial specialization matching ARGS. This
1059 parameter is ignored if TMPL is not a class template.
1061 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1062 result is a NONTYPE_ARGUMENT_PACK. */
1065 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1067 if (tmpl
== NULL_TREE
)
1070 if (args
== error_mark_node
)
1073 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1074 || TREE_CODE (tmpl
) == FIELD_DECL
);
1076 /* There should be as many levels of arguments as there are
1077 levels of parameters. */
1078 gcc_assert (TMPL_ARGS_DEPTH (args
)
1079 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1080 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1081 : template_class_depth (DECL_CONTEXT (tmpl
))));
1083 check_unstripped_args (args
);
1085 if (optimize_specialization_lookup_p (tmpl
))
1087 tree class_template
;
1088 tree class_specialization
;
1089 vec
<tree
, va_gc
> *methods
;
1093 /* The template arguments actually apply to the containing
1094 class. Find the class specialization with those
1096 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1097 class_specialization
1098 = retrieve_specialization (class_template
, args
, 0);
1099 if (!class_specialization
)
1101 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1102 for the specialization. */
1103 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1106 /* Iterate through the methods with the indicated name, looking
1107 for the one that has an instance of TMPL. */
1108 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1109 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1111 tree fn
= OVL_CURRENT (fns
);
1112 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1113 /* using-declarations can add base methods to the method vec,
1114 and we don't want those here. */
1115 && DECL_CONTEXT (fn
) == class_specialization
)
1124 hash_table
<spec_hasher
> *specializations
;
1128 elt
.spec
= NULL_TREE
;
1130 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1131 specializations
= type_specializations
;
1133 specializations
= decl_specializations
;
1136 hash
= spec_hasher::hash (&elt
);
1137 found
= specializations
->find_with_hash (&elt
, hash
);
1145 /* Like retrieve_specialization, but for local declarations. */
1148 retrieve_local_specialization (tree tmpl
)
1150 if (local_specializations
== NULL
)
1153 tree
*slot
= local_specializations
->get (tmpl
);
1154 return slot
? *slot
: NULL_TREE
;
1157 /* Returns nonzero iff DECL is a specialization of TMPL. */
1160 is_specialization_of (tree decl
, tree tmpl
)
1164 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1168 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1174 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1176 for (t
= TREE_TYPE (decl
);
1178 t
= CLASSTYPE_USE_TEMPLATE (t
)
1179 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1180 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1187 /* Returns nonzero iff DECL is a specialization of friend declaration
1188 FRIEND_DECL according to [temp.friend]. */
1191 is_specialization_of_friend (tree decl
, tree friend_decl
)
1193 bool need_template
= true;
1196 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1197 || TREE_CODE (decl
) == TYPE_DECL
);
1199 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1200 of a template class, we want to check if DECL is a specialization
1202 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1203 && DECL_TEMPLATE_INFO (friend_decl
)
1204 && !DECL_USE_TEMPLATE (friend_decl
))
1206 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1207 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1208 need_template
= false;
1210 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1211 && !PRIMARY_TEMPLATE_P (friend_decl
))
1212 need_template
= false;
1214 /* There is nothing to do if this is not a template friend. */
1215 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1218 if (is_specialization_of (decl
, friend_decl
))
1222 A member of a class template may be declared to be a friend of a
1223 non-template class. In this case, the corresponding member of
1224 every specialization of the class template is a friend of the
1225 class granting friendship.
1227 For example, given a template friend declaration
1229 template <class T> friend void A<T>::f();
1231 the member function below is considered a friend
1233 template <> struct A<int> {
1237 For this type of template friend, TEMPLATE_DEPTH below will be
1238 nonzero. To determine if DECL is a friend of FRIEND, we first
1239 check if the enclosing class is a specialization of another. */
1241 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1243 && DECL_CLASS_SCOPE_P (decl
)
1244 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1245 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1247 /* Next, we check the members themselves. In order to handle
1248 a few tricky cases, such as when FRIEND_DECL's are
1250 template <class T> friend void A<T>::g(T t);
1251 template <class T> template <T t> friend void A<T>::h();
1255 void A<int>::g(int);
1256 template <int> void A<int>::h();
1258 we need to figure out ARGS, the template arguments from
1259 the context of DECL. This is required for template substitution
1260 of `T' in the function parameter of `g' and template parameter
1261 of `h' in the above examples. Here ARGS corresponds to `int'. */
1263 tree context
= DECL_CONTEXT (decl
);
1264 tree args
= NULL_TREE
;
1265 int current_depth
= 0;
1267 while (current_depth
< template_depth
)
1269 if (CLASSTYPE_TEMPLATE_INFO (context
))
1271 if (current_depth
== 0)
1272 args
= TYPE_TI_ARGS (context
);
1274 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1277 context
= TYPE_CONTEXT (context
);
1280 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1285 tree friend_args_type
;
1286 tree decl_args_type
;
1288 /* Make sure that both DECL and FRIEND_DECL are templates or
1290 is_template
= DECL_TEMPLATE_INFO (decl
)
1291 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1292 if (need_template
^ is_template
)
1294 else if (is_template
)
1296 /* If both are templates, check template parameter list. */
1298 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1300 if (!comp_template_parms
1301 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1305 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1308 decl_type
= TREE_TYPE (decl
);
1310 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1311 tf_none
, NULL_TREE
);
1312 if (friend_type
== error_mark_node
)
1315 /* Check if return types match. */
1316 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1319 /* Check if function parameter types match, ignoring the
1320 `this' parameter. */
1321 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1322 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1323 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1324 friend_args_type
= TREE_CHAIN (friend_args_type
);
1325 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1326 decl_args_type
= TREE_CHAIN (decl_args_type
);
1328 return compparms (decl_args_type
, friend_args_type
);
1332 /* DECL is a TYPE_DECL */
1334 tree decl_type
= TREE_TYPE (decl
);
1336 /* Make sure that both DECL and FRIEND_DECL are templates or
1339 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1340 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1342 if (need_template
^ is_template
)
1344 else if (is_template
)
1347 /* If both are templates, check the name of the two
1348 TEMPLATE_DECL's first because is_friend didn't. */
1349 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1350 != DECL_NAME (friend_decl
))
1353 /* Now check template parameter list. */
1355 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1357 return comp_template_parms
1358 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1362 return (DECL_NAME (decl
)
1363 == DECL_NAME (friend_decl
));
1369 /* Register the specialization SPEC as a specialization of TMPL with
1370 the indicated ARGS. IS_FRIEND indicates whether the specialization
1371 is actually just a friend declaration. Returns SPEC, or an
1372 equivalent prior declaration, if available.
1374 We also store instantiations of field packs in the hash table, even
1375 though they are not themselves templates, to make lookup easier. */
1378 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1382 spec_entry
**slot
= NULL
;
1385 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1386 || (TREE_CODE (tmpl
) == FIELD_DECL
1387 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1389 if (TREE_CODE (spec
) == FUNCTION_DECL
1390 && uses_template_parms (DECL_TI_ARGS (spec
)))
1391 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1392 register it; we want the corresponding TEMPLATE_DECL instead.
1393 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1394 the more obvious `uses_template_parms (spec)' to avoid problems
1395 with default function arguments. In particular, given
1396 something like this:
1398 template <class T> void f(T t1, T t = T())
1400 the default argument expression is not substituted for in an
1401 instantiation unless and until it is actually needed. */
1404 if (optimize_specialization_lookup_p (tmpl
))
1405 /* We don't put these specializations in the hash table, but we might
1406 want to give an error about a mismatch. */
1407 fn
= retrieve_specialization (tmpl
, args
, 0);
1415 hash
= spec_hasher::hash (&elt
);
1418 decl_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
1420 fn
= ((spec_entry
*) *slot
)->spec
;
1425 /* We can sometimes try to re-register a specialization that we've
1426 already got. In particular, regenerate_decl_from_template calls
1427 duplicate_decls which will update the specialization list. But,
1428 we'll still get called again here anyhow. It's more convenient
1429 to simply allow this than to try to prevent it. */
1432 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1434 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1436 if (DECL_ODR_USED (fn
)
1437 || DECL_EXPLICIT_INSTANTIATION (fn
))
1439 error ("specialization of %qD after instantiation",
1441 return error_mark_node
;
1446 /* This situation should occur only if the first
1447 specialization is an implicit instantiation, the
1448 second is an explicit specialization, and the
1449 implicit instantiation has not yet been used. That
1450 situation can occur if we have implicitly
1451 instantiated a member function and then specialized
1454 We can also wind up here if a friend declaration that
1455 looked like an instantiation turns out to be a
1458 template <class T> void foo(T);
1459 class S { friend void foo<>(int) };
1460 template <> void foo(int);
1462 We transform the existing DECL in place so that any
1463 pointers to it become pointers to the updated
1466 If there was a definition for the template, but not
1467 for the specialization, we want this to look as if
1468 there were no definition, and vice versa. */
1469 DECL_INITIAL (fn
) = NULL_TREE
;
1470 duplicate_decls (spec
, fn
, is_friend
);
1471 /* The call to duplicate_decls will have applied
1474 An explicit specialization of a function template
1475 is inline only if it is explicitly declared to be,
1476 and independently of whether its function template
1479 to the primary function; now copy the inline bits to
1480 the various clones. */
1481 FOR_EACH_CLONE (clone
, fn
)
1483 DECL_DECLARED_INLINE_P (clone
)
1484 = DECL_DECLARED_INLINE_P (fn
);
1485 DECL_SOURCE_LOCATION (clone
)
1486 = DECL_SOURCE_LOCATION (fn
);
1487 DECL_DELETED_FN (clone
)
1488 = DECL_DELETED_FN (fn
);
1490 check_specialization_namespace (tmpl
);
1495 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1497 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1498 /* Dup decl failed, but this is a new definition. Set the
1499 line number so any errors match this new
1501 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1507 return duplicate_decls (spec
, fn
, is_friend
);
1509 /* A specialization must be declared in the same namespace as the
1510 template it is specializing. */
1511 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1512 && !check_specialization_namespace (tmpl
))
1513 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1515 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1517 spec_entry
*entry
= ggc_alloc
<spec_entry
> ();
1518 gcc_assert (tmpl
&& args
&& spec
);
1521 if ((TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1522 && PRIMARY_TEMPLATE_P (tmpl
)
1523 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1524 || variable_template_p (tmpl
))
1525 /* If TMPL is a forward declaration of a template function, keep a list
1526 of all specializations in case we need to reassign them to a friend
1527 template later in tsubst_friend_function.
1529 Also keep a list of all variable template instantiations so that
1530 process_partial_specialization can check whether a later partial
1531 specialization would have used it. */
1532 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1533 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1539 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1540 TMPL and ARGS members, ignores SPEC. */
1542 int comparing_specializations
;
1545 spec_hasher::equal (spec_entry
*e1
, spec_entry
*e2
)
1549 ++comparing_specializations
;
1550 equal
= (e1
->tmpl
== e2
->tmpl
1551 && comp_template_args (e1
->args
, e2
->args
));
1552 --comparing_specializations
;
1557 /* Returns a hash for a template TMPL and template arguments ARGS. */
1560 hash_tmpl_and_args (tree tmpl
, tree args
)
1562 hashval_t val
= DECL_UID (tmpl
);
1563 return iterative_hash_template_arg (args
, val
);
1566 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1570 spec_hasher::hash (spec_entry
*e
)
1572 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1575 /* Recursively calculate a hash value for a template argument ARG, for use
1576 in the hash tables of template specializations. */
1579 iterative_hash_template_arg (tree arg
, hashval_t val
)
1581 unsigned HOST_WIDE_INT i
;
1582 enum tree_code code
;
1585 if (arg
== NULL_TREE
)
1586 return iterative_hash_object (arg
, val
);
1591 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1592 /* We can get one of these when re-hashing a previous entry in the middle
1593 of substituting into a pack expansion. Just look through it. */
1594 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1596 code
= TREE_CODE (arg
);
1597 tclass
= TREE_CODE_CLASS (code
);
1599 val
= iterative_hash_object (code
, val
);
1606 case IDENTIFIER_NODE
:
1607 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1611 int i
, len
= TREE_VEC_LENGTH (arg
);
1612 for (i
= 0; i
< len
; ++i
)
1613 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1617 case TYPE_PACK_EXPANSION
:
1618 case EXPR_PACK_EXPANSION
:
1619 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1620 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1622 case TYPE_ARGUMENT_PACK
:
1623 case NONTYPE_ARGUMENT_PACK
:
1624 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1627 for (; arg
; arg
= TREE_CHAIN (arg
))
1628 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1632 for (; arg
; arg
= OVL_NEXT (arg
))
1633 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1639 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1640 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1642 val
= iterative_hash_template_arg (field
, val
);
1643 val
= iterative_hash_template_arg (value
, val
);
1649 if (!DECL_ARTIFICIAL (arg
))
1651 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1652 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1654 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1657 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1660 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1661 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1663 case TEMPLATE_PARM_INDEX
:
1664 val
= iterative_hash_template_arg
1665 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1666 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1667 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1670 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1671 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1672 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1675 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1677 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1681 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1682 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1683 val
= iterative_hash_object (code
, val
);
1684 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1687 /* A lambda can't appear in a template arg, but don't crash on
1689 gcc_assert (seen_error ());
1693 case IMPLICIT_CONV_EXPR
:
1694 case STATIC_CAST_EXPR
:
1695 case REINTERPRET_CAST_EXPR
:
1696 case CONST_CAST_EXPR
:
1697 case DYNAMIC_CAST_EXPR
:
1699 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1700 /* Now hash operands as usual. */
1710 if (alias_template_specialization_p (arg
))
1712 // We want an alias specialization that survived strip_typedefs
1713 // to hash differently from its TYPE_CANONICAL, to avoid hash
1714 // collisions that compare as different in template_args_equal.
1715 // These could be dependent specializations that strip_typedefs
1716 // left alone, or untouched specializations because
1717 // coerce_template_parms returns the unconverted template
1718 // arguments if it sees incomplete argument packs.
1719 tree ti
= TYPE_TEMPLATE_INFO (arg
);
1720 return hash_tmpl_and_args (TI_TEMPLATE (ti
), TI_ARGS (ti
));
1722 if (TYPE_CANONICAL (arg
))
1723 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1725 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1726 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1727 /* Otherwise just compare the types during lookup. */
1730 case tcc_declaration
:
1732 return iterative_hash_expr (arg
, val
);
1735 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1737 unsigned n
= cp_tree_operand_length (arg
);
1738 for (i
= 0; i
< n
; ++i
)
1739 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1747 /* Unregister the specialization SPEC as a specialization of TMPL.
1748 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1749 if the SPEC was listed as a specialization of TMPL.
1751 Note that SPEC has been ggc_freed, so we can't look inside it. */
1754 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1759 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1760 elt
.args
= TI_ARGS (tinfo
);
1761 elt
.spec
= NULL_TREE
;
1763 entry
= decl_specializations
->find (&elt
);
1766 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1767 gcc_assert (new_spec
!= NULL_TREE
);
1768 entry
->spec
= new_spec
;
1775 /* Like register_specialization, but for local declarations. We are
1776 registering SPEC, an instantiation of TMPL. */
1779 register_local_specialization (tree spec
, tree tmpl
)
1781 local_specializations
->put (tmpl
, spec
);
1784 /* TYPE is a class type. Returns true if TYPE is an explicitly
1785 specialized class. */
1788 explicit_class_specialization_p (tree type
)
1790 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1792 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1795 /* Print the list of functions at FNS, going through all the overloads
1796 for each element of the list. Alternatively, FNS can not be a
1797 TREE_LIST, in which case it will be printed together with all the
1800 MORE and *STR should respectively be FALSE and NULL when the function
1801 is called from the outside. They are used internally on recursive
1802 calls. print_candidates manages the two parameters and leaves NULL
1803 in *STR when it ends. */
1806 print_candidates_1 (tree fns
, bool more
, const char **str
)
1809 char *spaces
= NULL
;
1811 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1812 if (TREE_CODE (fn
) == TREE_LIST
)
1814 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1815 print_candidates_1 (TREE_VALUE (fn2
),
1816 TREE_CHAIN (fn2
) || more
, str
);
1820 tree cand
= OVL_CURRENT (fn
);
1823 /* Pick the prefix string. */
1824 if (!more
&& !OVL_NEXT (fns
))
1826 inform (DECL_SOURCE_LOCATION (cand
),
1827 "candidate is: %#D", cand
);
1831 *str
= _("candidates are:");
1832 spaces
= get_spaces (*str
);
1834 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1835 *str
= spaces
? spaces
: *str
;
1845 /* Print the list of candidate FNS in an error message. FNS can also
1846 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1849 print_candidates (tree fns
)
1851 const char *str
= NULL
;
1852 print_candidates_1 (fns
, false, &str
);
1853 gcc_assert (str
== NULL
);
1856 /* Returns the template (one of the functions given by TEMPLATE_ID)
1857 which can be specialized to match the indicated DECL with the
1858 explicit template args given in TEMPLATE_ID. The DECL may be
1859 NULL_TREE if none is available. In that case, the functions in
1860 TEMPLATE_ID are non-members.
1862 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1863 specialization of a member template.
1865 The TEMPLATE_COUNT is the number of references to qualifying
1866 template classes that appeared in the name of the function. See
1867 check_explicit_specialization for a more accurate description.
1869 TSK indicates what kind of template declaration (if any) is being
1870 declared. TSK_TEMPLATE indicates that the declaration given by
1871 DECL, though a FUNCTION_DECL, has template parameters, and is
1872 therefore a template function.
1874 The template args (those explicitly specified and those deduced)
1875 are output in a newly created vector *TARGS_OUT.
1877 If it is impossible to determine the result, an error message is
1878 issued. The error_mark_node is returned to indicate failure. */
1881 determine_specialization (tree template_id
,
1884 int need_member_template
,
1890 tree explicit_targs
;
1891 tree candidates
= NULL_TREE
;
1892 /* A TREE_LIST of templates of which DECL may be a specialization.
1893 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1894 corresponding TREE_PURPOSE is the set of template arguments that,
1895 when used to instantiate the template, would produce a function
1896 with the signature of DECL. */
1897 tree templates
= NULL_TREE
;
1899 cp_binding_level
*b
;
1901 *targs_out
= NULL_TREE
;
1903 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1904 return error_mark_node
;
1906 /* We shouldn't be specializing a member template of an
1907 unspecialized class template; we already gave an error in
1908 check_specialization_scope, now avoid crashing. */
1909 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
1910 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
1912 gcc_assert (errorcount
);
1913 return error_mark_node
;
1916 fns
= TREE_OPERAND (template_id
, 0);
1917 explicit_targs
= TREE_OPERAND (template_id
, 1);
1919 if (fns
== error_mark_node
)
1920 return error_mark_node
;
1922 /* Check for baselinks. */
1923 if (BASELINK_P (fns
))
1924 fns
= BASELINK_FUNCTIONS (fns
);
1926 if (TREE_CODE (decl
) == FUNCTION_DECL
&& !is_overloaded_fn (fns
))
1928 error ("%qD is not a function template", fns
);
1929 return error_mark_node
;
1931 else if (VAR_P (decl
) && !variable_template_p (fns
))
1933 error ("%qD is not a variable template", fns
);
1934 return error_mark_node
;
1937 /* Count the number of template headers specified for this
1940 for (b
= current_binding_level
;
1941 b
->kind
== sk_template_parms
;
1945 if (variable_template_p (fns
))
1947 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (fns
));
1948 targs
= coerce_template_parms (parms
, explicit_targs
, fns
,
1949 tf_warning_or_error
,
1950 /*req_all*/true, /*use_defarg*/true);
1951 templates
= tree_cons (targs
, fns
, templates
);
1953 else for (; fns
; fns
= OVL_NEXT (fns
))
1955 tree fn
= OVL_CURRENT (fns
);
1957 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1959 tree decl_arg_types
;
1963 /* In case of explicit specialization, we need to check if
1964 the number of template headers appearing in the specialization
1965 is correct. This is usually done in check_explicit_specialization,
1966 but the check done there cannot be exhaustive when specializing
1967 member functions. Consider the following code:
1969 template <> void A<int>::f(int);
1970 template <> template <> void A<int>::f(int);
1972 Assuming that A<int> is not itself an explicit specialization
1973 already, the first line specializes "f" which is a non-template
1974 member function, whilst the second line specializes "f" which
1975 is a template member function. So both lines are syntactically
1976 correct, and check_explicit_specialization does not reject
1979 Here, we can do better, as we are matching the specialization
1980 against the declarations. We count the number of template
1981 headers, and we check if they match TEMPLATE_COUNT + 1
1982 (TEMPLATE_COUNT is the number of qualifying template classes,
1983 plus there must be another header for the member template
1986 Notice that if header_count is zero, this is not a
1987 specialization but rather a template instantiation, so there
1988 is no check we can perform here. */
1989 if (header_count
&& header_count
!= template_count
+ 1)
1992 /* Check that the number of template arguments at the
1993 innermost level for DECL is the same as for FN. */
1994 if (current_binding_level
->kind
== sk_template_parms
1995 && !current_binding_level
->explicit_spec_p
1996 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1997 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1998 (current_template_parms
))))
2001 /* DECL might be a specialization of FN. */
2002 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2003 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2005 /* For a non-static member function, we need to make sure
2006 that the const qualification is the same. Since
2007 get_bindings does not try to merge the "this" parameter,
2008 we must do the comparison explicitly. */
2009 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2010 && !same_type_p (TREE_VALUE (fn_arg_types
),
2011 TREE_VALUE (decl_arg_types
)))
2014 /* Skip the "this" parameter and, for constructors of
2015 classes with virtual bases, the VTT parameter. A
2016 full specialization of a constructor will have a VTT
2017 parameter, but a template never will. */
2019 = skip_artificial_parms_for (decl
, decl_arg_types
);
2021 = skip_artificial_parms_for (fn
, fn_arg_types
);
2023 /* Function templates cannot be specializations; there are
2024 no partial specializations of functions. Therefore, if
2025 the type of DECL does not match FN, there is no
2027 if (tsk
== tsk_template
)
2029 if (compparms (fn_arg_types
, decl_arg_types
))
2030 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2034 /* See whether this function might be a specialization of this
2035 template. Suppress access control because we might be trying
2036 to make this specialization a friend, and we have already done
2037 access control for the declaration of the specialization. */
2038 push_deferring_access_checks (dk_no_check
);
2039 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
2040 pop_deferring_access_checks ();
2043 /* We cannot deduce template arguments that when used to
2044 specialize TMPL will produce DECL. */
2047 /* Make sure that the deduced arguments actually work. */
2048 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
2049 if (insttype
== error_mark_node
)
2052 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
2053 if (!compparms (fn_arg_types
, decl_arg_types
))
2056 /* Save this template, and the arguments deduced. */
2057 templates
= tree_cons (targs
, fn
, templates
);
2059 else if (need_member_template
)
2060 /* FN is an ordinary member function, and we need a
2061 specialization of a member template. */
2063 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2064 /* We can get IDENTIFIER_NODEs here in certain erroneous
2067 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2068 /* This is just an ordinary non-member function. Nothing can
2069 be a specialization of that. */
2071 else if (DECL_ARTIFICIAL (fn
))
2072 /* Cannot specialize functions that are created implicitly. */
2076 tree decl_arg_types
;
2078 /* This is an ordinary member function. However, since
2079 we're here, we can assume its enclosing class is a
2080 template class. For example,
2082 template <typename T> struct S { void f(); };
2083 template <> void S<int>::f() {}
2085 Here, S<int>::f is a non-template, but S<int> is a
2086 template class. If FN has the same type as DECL, we
2087 might be in business. */
2089 if (!DECL_TEMPLATE_INFO (fn
))
2090 /* Its enclosing class is an explicit specialization
2091 of a template class. This is not a candidate. */
2094 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2095 TREE_TYPE (TREE_TYPE (fn
))))
2096 /* The return types differ. */
2099 /* Adjust the type of DECL in case FN is a static member. */
2100 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2101 if (DECL_STATIC_FUNCTION_P (fn
)
2102 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2103 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2105 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2108 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2112 if (templates
&& TREE_CHAIN (templates
))
2118 It is possible for a specialization with a given function
2119 signature to be instantiated from more than one function
2120 template. In such cases, explicit specification of the
2121 template arguments must be used to uniquely identify the
2122 function template specialization being specialized.
2124 Note that here, there's no suggestion that we're supposed to
2125 determine which of the candidate templates is most
2126 specialized. However, we, also have:
2130 Partial ordering of overloaded function template
2131 declarations is used in the following contexts to select
2132 the function template to which a function template
2133 specialization refers:
2135 -- when an explicit specialization refers to a function
2138 So, we do use the partial ordering rules, at least for now.
2139 This extension can only serve to make invalid programs valid,
2140 so it's safe. And, there is strong anecdotal evidence that
2141 the committee intended the partial ordering rules to apply;
2142 the EDG front end has that behavior, and John Spicer claims
2143 that the committee simply forgot to delete the wording in
2144 [temp.expl.spec]. */
2145 tree tmpl
= most_specialized_instantiation (templates
);
2146 if (tmpl
!= error_mark_node
)
2149 TREE_CHAIN (templates
) = NULL_TREE
;
2153 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2155 error ("template-id %qD for %q+D does not match any template "
2156 "declaration", template_id
, decl
);
2157 if (header_count
&& header_count
!= template_count
+ 1)
2158 inform (input_location
, "saw %d %<template<>%>, need %d for "
2159 "specializing a member function template",
2160 header_count
, template_count
+ 1);
2161 return error_mark_node
;
2163 else if ((templates
&& TREE_CHAIN (templates
))
2164 || (candidates
&& TREE_CHAIN (candidates
))
2165 || (templates
&& candidates
))
2167 error ("ambiguous template specialization %qD for %q+D",
2169 candidates
= chainon (candidates
, templates
);
2170 print_candidates (candidates
);
2171 return error_mark_node
;
2174 /* We have one, and exactly one, match. */
2177 tree fn
= TREE_VALUE (candidates
);
2178 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2179 /* DECL is a re-declaration or partial instantiation of a template
2181 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2183 /* It was a specialization of an ordinary member function in a
2185 return DECL_TI_TEMPLATE (fn
);
2188 /* It was a specialization of a template. */
2189 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2190 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2192 *targs_out
= copy_node (targs
);
2193 SET_TMPL_ARGS_LEVEL (*targs_out
,
2194 TMPL_ARGS_DEPTH (*targs_out
),
2195 TREE_PURPOSE (templates
));
2198 *targs_out
= TREE_PURPOSE (templates
);
2199 return TREE_VALUE (templates
);
2202 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2203 but with the default argument values filled in from those in the
2207 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2210 tree new_spec_types
;
2215 if (spec_types
== void_list_node
)
2216 return void_list_node
;
2218 /* Substitute into the rest of the list. */
2220 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2221 TREE_CHAIN (tmpl_types
));
2223 /* Add the default argument for this parameter. */
2224 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2225 TREE_VALUE (spec_types
),
2229 /* DECL is an explicit specialization. Replicate default arguments
2230 from the template it specializes. (That way, code like:
2232 template <class T> void f(T = 3);
2233 template <> void f(double);
2236 works, as required.) An alternative approach would be to look up
2237 the correct default arguments at the call-site, but this approach
2238 is consistent with how implicit instantiations are handled. */
2241 copy_default_args_to_explicit_spec (tree decl
)
2246 tree new_spec_types
;
2250 tree object_type
= NULL_TREE
;
2251 tree in_charge
= NULL_TREE
;
2252 tree vtt
= NULL_TREE
;
2254 /* See if there's anything we need to do. */
2255 tmpl
= DECL_TI_TEMPLATE (decl
);
2256 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2257 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2258 if (TREE_PURPOSE (t
))
2263 old_type
= TREE_TYPE (decl
);
2264 spec_types
= TYPE_ARG_TYPES (old_type
);
2266 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2268 /* Remove the this pointer, but remember the object's type for
2270 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2271 spec_types
= TREE_CHAIN (spec_types
);
2272 tmpl_types
= TREE_CHAIN (tmpl_types
);
2274 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2276 /* DECL may contain more parameters than TMPL due to the extra
2277 in-charge parameter in constructors and destructors. */
2278 in_charge
= spec_types
;
2279 spec_types
= TREE_CHAIN (spec_types
);
2281 if (DECL_HAS_VTT_PARM_P (decl
))
2284 spec_types
= TREE_CHAIN (spec_types
);
2288 /* Compute the merged default arguments. */
2290 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2292 /* Compute the new FUNCTION_TYPE. */
2296 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2301 /* Put the in-charge parameter back. */
2302 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2303 TREE_VALUE (in_charge
),
2306 new_type
= build_method_type_directly (object_type
,
2307 TREE_TYPE (old_type
),
2311 new_type
= build_function_type (TREE_TYPE (old_type
),
2313 new_type
= cp_build_type_attribute_variant (new_type
,
2314 TYPE_ATTRIBUTES (old_type
));
2315 new_type
= build_exception_variant (new_type
,
2316 TYPE_RAISES_EXCEPTIONS (old_type
));
2318 if (TYPE_HAS_LATE_RETURN_TYPE (old_type
))
2319 TYPE_HAS_LATE_RETURN_TYPE (new_type
) = 1;
2321 TREE_TYPE (decl
) = new_type
;
2324 /* Return the number of template headers we expect to see for a definition
2325 or specialization of CTYPE or one of its non-template members. */
2328 num_template_headers_for_class (tree ctype
)
2330 int num_templates
= 0;
2332 while (ctype
&& CLASS_TYPE_P (ctype
))
2334 /* You're supposed to have one `template <...>' for every
2335 template class, but you don't need one for a full
2336 specialization. For example:
2338 template <class T> struct S{};
2339 template <> struct S<int> { void f(); };
2340 void S<int>::f () {}
2342 is correct; there shouldn't be a `template <>' for the
2343 definition of `S<int>::f'. */
2344 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2345 /* If CTYPE does not have template information of any
2346 kind, then it is not a template, nor is it nested
2347 within a template. */
2349 if (explicit_class_specialization_p (ctype
))
2351 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2354 ctype
= TYPE_CONTEXT (ctype
);
2357 return num_templates
;
2360 /* Do a simple sanity check on the template headers that precede the
2361 variable declaration DECL. */
2364 check_template_variable (tree decl
)
2366 tree ctx
= CP_DECL_CONTEXT (decl
);
2367 int wanted
= num_template_headers_for_class (ctx
);
2368 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
2369 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2371 if (cxx_dialect
< cxx14
)
2372 pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2373 "variable templates only available with "
2374 "-std=c++14 or -std=gnu++14");
2376 // Namespace-scope variable templates should have a template header.
2379 if (template_header_count
> wanted
)
2381 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2382 "too many template headers for %D (should be %d)",
2384 if (warned
&& CLASS_TYPE_P (ctx
)
2385 && CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2386 inform (DECL_SOURCE_LOCATION (decl
),
2387 "members of an explicitly specialized class are defined "
2388 "without a template header");
2392 /* Check to see if the function just declared, as indicated in
2393 DECLARATOR, and in DECL, is a specialization of a function
2394 template. We may also discover that the declaration is an explicit
2395 instantiation at this point.
2397 Returns DECL, or an equivalent declaration that should be used
2398 instead if all goes well. Issues an error message if something is
2399 amiss. Returns error_mark_node if the error is not easily
2402 FLAGS is a bitmask consisting of the following flags:
2404 2: The function has a definition.
2405 4: The function is a friend.
2407 The TEMPLATE_COUNT is the number of references to qualifying
2408 template classes that appeared in the name of the function. For
2411 template <class T> struct S { void f(); };
2414 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2415 classes are not counted in the TEMPLATE_COUNT, so that in
2417 template <class T> struct S {};
2418 template <> struct S<int> { void f(); }
2419 template <> void S<int>::f();
2421 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2422 invalid; there should be no template <>.)
2424 If the function is a specialization, it is marked as such via
2425 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2426 is set up correctly, and it is added to the list of specializations
2427 for that template. */
2430 check_explicit_specialization (tree declarator
,
2435 int have_def
= flags
& 2;
2436 int is_friend
= flags
& 4;
2437 int specialization
= 0;
2438 int explicit_instantiation
= 0;
2439 int member_specialization
= 0;
2440 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2441 tree dname
= DECL_NAME (decl
);
2446 if (!processing_specialization
)
2449 tsk
= tsk_excessive_parms
;
2452 tsk
= current_tmpl_spec_kind (template_count
);
2457 if (processing_specialization
&& !VAR_P (decl
))
2460 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2462 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2465 /* This could be something like:
2467 template <class T> void f(T);
2468 class S { friend void f<>(int); } */
2472 /* This case handles bogus declarations like template <>
2473 template <class T> void f<int>(); */
2475 error ("template-id %qD in declaration of primary template",
2482 case tsk_invalid_member_spec
:
2483 /* The error has already been reported in
2484 check_specialization_scope. */
2485 return error_mark_node
;
2487 case tsk_invalid_expl_inst
:
2488 error ("template parameter list used in explicit instantiation");
2494 error ("definition provided for explicit instantiation");
2496 explicit_instantiation
= 1;
2499 case tsk_excessive_parms
:
2500 case tsk_insufficient_parms
:
2501 if (tsk
== tsk_excessive_parms
)
2502 error ("too many template parameter lists in declaration of %qD",
2504 else if (template_header_count
)
2505 error("too few template parameter lists in declaration of %qD", decl
);
2507 error("explicit specialization of %qD must be introduced by "
2508 "%<template <>%>", decl
);
2512 if (VAR_P (decl
) && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2513 /* In cases like template<> constexpr bool v = true;
2514 We'll give an error in check_template_variable. */
2517 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2519 member_specialization
= 1;
2525 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2527 /* This case handles bogus declarations like template <>
2528 template <class T> void f<int>(); */
2530 if (!uses_template_parms (declarator
))
2531 error ("template-id %qD in declaration of primary template",
2533 else if (variable_template_p (TREE_OPERAND (declarator
, 0)))
2535 /* Partial specialization of variable template. */
2536 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2540 else if (cxx_dialect
< cxx14
)
2541 error ("non-type partial specialization %qD "
2542 "is not allowed", declarator
);
2544 error ("non-class, non-variable partial specialization %qD "
2545 "is not allowed", declarator
);
2550 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2551 /* This is a specialization of a member template, without
2552 specialization the containing class. Something like:
2554 template <class T> struct S {
2555 template <class U> void f (U);
2557 template <> template <class U> void S<int>::f(U) {}
2559 That's a specialization -- but of the entire template. */
2567 if ((specialization
|| member_specialization
)
2568 /* This doesn't apply to variable templates. */
2569 && (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
2570 || TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
))
2572 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2573 for (; t
; t
= TREE_CHAIN (t
))
2574 if (TREE_PURPOSE (t
))
2576 permerror (input_location
,
2577 "default argument specified in explicit specialization");
2582 if (specialization
|| member_specialization
|| explicit_instantiation
)
2584 tree tmpl
= NULL_TREE
;
2585 tree targs
= NULL_TREE
;
2586 bool was_template_id
= (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
);
2588 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2589 if (!was_template_id
)
2593 gcc_assert (identifier_p (declarator
));
2598 /* If there is no class context, the explicit instantiation
2599 must be at namespace scope. */
2600 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2602 /* Find the namespace binding, using the declaration
2604 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2606 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2608 error ("%qD is not a template function", dname
);
2609 fns
= error_mark_node
;
2613 tree fn
= OVL_CURRENT (fns
);
2614 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2615 CP_DECL_CONTEXT (fn
)))
2616 error ("%qD is not declared in %qD",
2617 decl
, current_namespace
);
2621 declarator
= lookup_template_function (fns
, NULL_TREE
);
2624 if (declarator
== error_mark_node
)
2625 return error_mark_node
;
2627 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2629 if (!explicit_instantiation
)
2630 /* A specialization in class scope. This is invalid,
2631 but the error will already have been flagged by
2632 check_specialization_scope. */
2633 return error_mark_node
;
2636 /* It's not valid to write an explicit instantiation in
2639 class C { template void f(); }
2641 This case is caught by the parser. However, on
2644 template class C { void f(); };
2646 (which is invalid) we can get here. The error will be
2653 else if (ctype
!= NULL_TREE
2654 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2656 // We'll match variable templates in start_decl.
2660 /* Find the list of functions in ctype that have the same
2661 name as the declared function. */
2662 tree name
= TREE_OPERAND (declarator
, 0);
2663 tree fns
= NULL_TREE
;
2666 if (constructor_name_p (name
, ctype
))
2668 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2670 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2671 : !CLASSTYPE_DESTRUCTORS (ctype
))
2673 /* From [temp.expl.spec]:
2675 If such an explicit specialization for the member
2676 of a class template names an implicitly-declared
2677 special member function (clause _special_), the
2678 program is ill-formed.
2680 Similar language is found in [temp.explicit]. */
2681 error ("specialization of implicitly-declared special member function");
2682 return error_mark_node
;
2685 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2688 if (!DECL_CONV_FN_P (decl
))
2690 idx
= lookup_fnfields_1 (ctype
, name
);
2692 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2696 vec
<tree
, va_gc
> *methods
;
2699 /* For a type-conversion operator, we cannot do a
2700 name-based lookup. We might be looking for `operator
2701 int' which will be a specialization of `operator T'.
2702 So, we find *all* the conversion operators, and then
2703 select from them. */
2706 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2708 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2709 methods
->iterate (idx
, &ovl
);
2712 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2713 /* There are no more conversion functions. */
2716 /* Glue all these conversion functions together
2717 with those we already have. */
2718 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2719 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2723 if (fns
== NULL_TREE
)
2725 error ("no member function %qD declared in %qT", name
, ctype
);
2726 return error_mark_node
;
2729 TREE_OPERAND (declarator
, 0) = fns
;
2732 /* Figure out what exactly is being specialized at this point.
2733 Note that for an explicit instantiation, even one for a
2734 member function, we cannot tell apriori whether the
2735 instantiation is for a member template, or just a member
2736 function of a template class. Even if a member template is
2737 being instantiated, the member template arguments may be
2738 elided if they can be deduced from the rest of the
2740 tmpl
= determine_specialization (declarator
, decl
,
2742 member_specialization
,
2746 if (!tmpl
|| tmpl
== error_mark_node
)
2747 /* We couldn't figure out what this declaration was
2749 return error_mark_node
;
2752 tree gen_tmpl
= most_general_template (tmpl
);
2754 if (explicit_instantiation
)
2756 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2757 is done by do_decl_instantiation later. */
2759 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2760 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2762 if (arg_depth
> parm_depth
)
2764 /* If TMPL is not the most general template (for
2765 example, if TMPL is a friend template that is
2766 injected into namespace scope), then there will
2767 be too many levels of TARGS. Remove some of them
2772 new_targs
= make_tree_vec (parm_depth
);
2773 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2774 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2775 = TREE_VEC_ELT (targs
, i
);
2779 return instantiate_template (tmpl
, targs
, tf_error
);
2782 /* If we thought that the DECL was a member function, but it
2783 turns out to be specializing a static member function,
2784 make DECL a static member function as well. */
2785 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
2786 && DECL_STATIC_FUNCTION_P (tmpl
)
2787 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2788 revert_static_member_fn (decl
);
2790 /* If this is a specialization of a member template of a
2791 template class, we want to return the TEMPLATE_DECL, not
2792 the specialization of it. */
2793 if (tsk
== tsk_template
&& !was_template_id
)
2795 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2796 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2797 DECL_INITIAL (result
) = NULL_TREE
;
2801 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2802 DECL_SOURCE_LOCATION (result
)
2803 = DECL_SOURCE_LOCATION (decl
);
2804 /* We want to use the argument list specified in the
2805 definition, not in the original declaration. */
2806 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2807 for (parm
= DECL_ARGUMENTS (result
); parm
;
2808 parm
= DECL_CHAIN (parm
))
2809 DECL_CONTEXT (parm
) = result
;
2811 return register_specialization (tmpl
, gen_tmpl
, targs
,
2815 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2816 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2818 if (was_template_id
)
2819 TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
)) = true;
2821 /* Inherit default function arguments from the template
2822 DECL is specializing. */
2823 if (DECL_FUNCTION_TEMPLATE_P (tmpl
))
2824 copy_default_args_to_explicit_spec (decl
);
2826 /* This specialization has the same protection as the
2827 template it specializes. */
2828 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2829 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2831 /* 7.1.1-1 [dcl.stc]
2833 A storage-class-specifier shall not be specified in an
2834 explicit specialization...
2836 The parser rejects these, so unless action is taken here,
2837 explicit function specializations will always appear with
2840 The action recommended by the C++ CWG in response to C++
2841 defect report 605 is to make the storage class and linkage
2842 of the explicit specialization match the templated function:
2844 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2846 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2848 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2849 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2851 /* This specialization has the same linkage and visibility as
2852 the function template it specializes. */
2853 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2854 if (! TREE_PUBLIC (decl
))
2856 DECL_INTERFACE_KNOWN (decl
) = 1;
2857 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2859 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2860 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2862 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2863 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2867 /* If DECL is a friend declaration, declared using an
2868 unqualified name, the namespace associated with DECL may
2869 have been set incorrectly. For example, in:
2871 template <typename T> void f(T);
2873 struct S { friend void f<int>(int); }
2876 we will have set the DECL_CONTEXT for the friend
2877 declaration to N, rather than to the global namespace. */
2878 if (DECL_NAMESPACE_SCOPE_P (decl
))
2879 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2881 if (is_friend
&& !have_def
)
2882 /* This is not really a declaration of a specialization.
2883 It's just the name of an instantiation. But, it's not
2884 a request for an instantiation, either. */
2885 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2886 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
2887 /* A specialization is not necessarily COMDAT. */
2888 DECL_COMDAT (decl
) = (TREE_PUBLIC (decl
)
2889 && DECL_DECLARED_INLINE_P (decl
));
2890 else if (VAR_P (decl
))
2891 DECL_COMDAT (decl
) = false;
2893 /* Register this specialization so that we can find it
2895 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2897 /* A 'structor should already have clones. */
2898 gcc_assert (decl
== error_mark_node
2899 || variable_template_p (tmpl
)
2900 || !(DECL_CONSTRUCTOR_P (decl
)
2901 || DECL_DESTRUCTOR_P (decl
))
2902 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
2909 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2910 parameters. These are represented in the same format used for
2911 DECL_TEMPLATE_PARMS. */
2914 comp_template_parms (const_tree parms1
, const_tree parms2
)
2919 if (parms1
== parms2
)
2922 for (p1
= parms1
, p2
= parms2
;
2923 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2924 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2926 tree t1
= TREE_VALUE (p1
);
2927 tree t2
= TREE_VALUE (p2
);
2930 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2931 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2933 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2936 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2938 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2939 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2941 /* If either of the template parameters are invalid, assume
2942 they match for the sake of error recovery. */
2943 if (error_operand_p (parm1
) || error_operand_p (parm2
))
2946 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2949 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2950 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2951 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2953 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2958 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2959 /* One set of parameters has more parameters lists than the
2966 /* Determine whether PARM is a parameter pack. */
2969 template_parameter_pack_p (const_tree parm
)
2971 /* Determine if we have a non-type template parameter pack. */
2972 if (TREE_CODE (parm
) == PARM_DECL
)
2973 return (DECL_TEMPLATE_PARM_P (parm
)
2974 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2975 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2976 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2978 /* If this is a list of template parameters, we could get a
2979 TYPE_DECL or a TEMPLATE_DECL. */
2980 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2981 parm
= TREE_TYPE (parm
);
2983 /* Otherwise it must be a type template parameter. */
2984 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2985 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2986 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2989 /* Determine if T is a function parameter pack. */
2992 function_parameter_pack_p (const_tree t
)
2994 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2995 return DECL_PACK_P (t
);
2999 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
3000 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
3003 get_function_template_decl (const_tree primary_func_tmpl_inst
)
3005 if (! primary_func_tmpl_inst
3006 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
3007 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
3010 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
3013 /* Return true iff the function parameter PARAM_DECL was expanded
3014 from the function parameter pack PACK. */
3017 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
3019 if (DECL_ARTIFICIAL (param_decl
)
3020 || !function_parameter_pack_p (pack
))
3023 /* The parameter pack and its pack arguments have the same
3025 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
3028 /* Determine whether ARGS describes a variadic template args list,
3029 i.e., one that is terminated by a template argument pack. */
3032 template_args_variadic_p (tree args
)
3037 if (args
== NULL_TREE
)
3040 args
= INNERMOST_TEMPLATE_ARGS (args
);
3041 nargs
= TREE_VEC_LENGTH (args
);
3046 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
3048 return ARGUMENT_PACK_P (last_parm
);
3051 /* Generate a new name for the parameter pack name NAME (an
3052 IDENTIFIER_NODE) that incorporates its */
3055 make_ith_pack_parameter_name (tree name
, int i
)
3057 /* Munge the name to include the parameter index. */
3058 #define NUMBUF_LEN 128
3059 char numbuf
[NUMBUF_LEN
];
3063 if (name
== NULL_TREE
)
3065 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
3066 newname_len
= IDENTIFIER_LENGTH (name
)
3067 + strlen (numbuf
) + 2;
3068 newname
= (char*)alloca (newname_len
);
3069 snprintf (newname
, newname_len
,
3070 "%s#%i", IDENTIFIER_POINTER (name
), i
);
3071 return get_identifier (newname
);
3074 /* Return true if T is a primary function, class or alias template
3078 primary_template_instantiation_p (const_tree t
)
3083 if (TREE_CODE (t
) == FUNCTION_DECL
)
3084 return DECL_LANG_SPECIFIC (t
)
3085 && DECL_TEMPLATE_INSTANTIATION (t
)
3086 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
3087 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
3088 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
3089 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
3090 else if (alias_template_specialization_p (t
))
3095 /* Return true if PARM is a template template parameter. */
3098 template_template_parameter_p (const_tree parm
)
3100 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
3103 /* Return true iff PARM is a DECL representing a type template
3107 template_type_parameter_p (const_tree parm
)
3110 && (TREE_CODE (parm
) == TYPE_DECL
3111 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3112 && DECL_TEMPLATE_PARM_P (parm
));
3115 /* Return the template parameters of T if T is a
3116 primary template instantiation, NULL otherwise. */
3119 get_primary_template_innermost_parameters (const_tree t
)
3121 tree parms
= NULL
, template_info
= NULL
;
3123 if ((template_info
= get_template_info (t
))
3124 && primary_template_instantiation_p (t
))
3125 parms
= INNERMOST_TEMPLATE_PARMS
3126 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3131 /* Return the template parameters of the LEVELth level from the full list
3132 of template parameters PARMS. */
3135 get_template_parms_at_level (tree parms
, int level
)
3139 || TREE_CODE (parms
) != TREE_LIST
3140 || level
> TMPL_PARMS_DEPTH (parms
))
3143 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3144 if (TMPL_PARMS_DEPTH (p
) == level
)
3150 /* Returns the template arguments of T if T is a template instantiation,
3154 get_template_innermost_arguments (const_tree t
)
3156 tree args
= NULL
, template_info
= NULL
;
3158 if ((template_info
= get_template_info (t
))
3159 && TI_ARGS (template_info
))
3160 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3165 /* Return the argument pack elements of T if T is a template argument pack,
3169 get_template_argument_pack_elems (const_tree t
)
3171 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3172 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3175 return ARGUMENT_PACK_ARGS (t
);
3178 /* Structure used to track the progress of find_parameter_packs_r. */
3179 struct find_parameter_pack_data
3181 /* TREE_LIST that will contain all of the parameter packs found by
3183 tree
* parameter_packs
;
3185 /* Set of AST nodes that have been visited by the traversal. */
3186 hash_set
<tree
> *visited
;
3189 /* Identifies all of the argument packs that occur in a template
3190 argument and appends them to the TREE_LIST inside DATA, which is a
3191 find_parameter_pack_data structure. This is a subroutine of
3192 make_pack_expansion and uses_parameter_packs. */
3194 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3197 struct find_parameter_pack_data
* ppd
=
3198 (struct find_parameter_pack_data
*)data
;
3199 bool parameter_pack_p
= false;
3201 /* Handle type aliases/typedefs. */
3202 if (TYPE_ALIAS_P (t
))
3204 if (TYPE_TEMPLATE_INFO (t
))
3205 cp_walk_tree (&TYPE_TI_ARGS (t
),
3206 &find_parameter_packs_r
,
3212 /* Identify whether this is a parameter pack or not. */
3213 switch (TREE_CODE (t
))
3215 case TEMPLATE_PARM_INDEX
:
3216 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3217 parameter_pack_p
= true;
3220 case TEMPLATE_TYPE_PARM
:
3221 t
= TYPE_MAIN_VARIANT (t
);
3222 case TEMPLATE_TEMPLATE_PARM
:
3223 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3224 parameter_pack_p
= true;
3229 if (DECL_PACK_P (t
))
3231 /* We don't want to walk into the type of a PARM_DECL,
3232 because we don't want to see the type parameter pack. */
3234 parameter_pack_p
= true;
3238 /* Look through a lambda capture proxy to the field pack. */
3240 if (DECL_HAS_VALUE_EXPR_P (t
))
3242 tree v
= DECL_VALUE_EXPR (t
);
3244 &find_parameter_packs_r
,
3251 parameter_pack_p
= true;
3254 /* Not a parameter pack. */
3258 if (parameter_pack_p
)
3260 /* Add this parameter pack to the list. */
3261 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3265 cp_walk_tree (&TYPE_CONTEXT (t
),
3266 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3268 /* This switch statement will return immediately if we don't find a
3270 switch (TREE_CODE (t
))
3272 case TEMPLATE_PARM_INDEX
:
3275 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3276 /* Check the template itself. */
3277 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3278 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3279 /* Check the template arguments. */
3280 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3285 case TEMPLATE_TYPE_PARM
:
3286 case TEMPLATE_TEMPLATE_PARM
:
3293 if (TYPE_PTRMEMFUNC_P (t
))
3299 if (TYPE_TEMPLATE_INFO (t
))
3300 cp_walk_tree (&TYPE_TI_ARGS (t
),
3301 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3308 cp_walk_tree (&TREE_TYPE (t
),
3309 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3313 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3318 case TYPE_PACK_EXPANSION
:
3319 case EXPR_PACK_EXPANSION
:
3324 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3329 case IDENTIFIER_NODE
:
3330 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3342 /* Determines if the expression or type T uses any parameter packs. */
3344 uses_parameter_packs (tree t
)
3346 tree parameter_packs
= NULL_TREE
;
3347 struct find_parameter_pack_data ppd
;
3348 ppd
.parameter_packs
= ¶meter_packs
;
3349 ppd
.visited
= new hash_set
<tree
>;
3350 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3352 return parameter_packs
!= NULL_TREE
;
3355 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3356 representation a base-class initializer into a parameter pack
3357 expansion. If all goes well, the resulting node will be an
3358 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3361 make_pack_expansion (tree arg
)
3364 tree parameter_packs
= NULL_TREE
;
3365 bool for_types
= false;
3366 struct find_parameter_pack_data ppd
;
3368 if (!arg
|| arg
== error_mark_node
)
3371 if (TREE_CODE (arg
) == TREE_LIST
&& TREE_PURPOSE (arg
))
3373 /* A TREE_LIST with a non-null TREE_PURPOSE is for a base
3374 class initializer. In this case, the TREE_PURPOSE will be a
3375 _TYPE node (representing the base class expansion we're
3376 initializing) and the TREE_VALUE will be a TREE_LIST
3377 containing the initialization arguments.
3379 The resulting expansion looks somewhat different from most
3380 expansions. Rather than returning just one _EXPANSION, we
3381 return a TREE_LIST whose TREE_PURPOSE is a
3382 TYPE_PACK_EXPANSION containing the bases that will be
3383 initialized. The TREE_VALUE will be identical to the
3384 original TREE_VALUE, which is a list of arguments that will
3385 be passed to each base. We do not introduce any new pack
3386 expansion nodes into the TREE_VALUE (although it is possible
3387 that some already exist), because the TREE_PURPOSE and
3388 TREE_VALUE all need to be expanded together with the same
3389 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3390 resulting TREE_PURPOSE will mention the parameter packs in
3391 both the bases and the arguments to the bases. */
3394 tree parameter_packs
= NULL_TREE
;
3396 /* Determine which parameter packs will be used by the base
3398 ppd
.visited
= new hash_set
<tree
>;
3399 ppd
.parameter_packs
= ¶meter_packs
;
3400 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3403 if (parameter_packs
== NULL_TREE
)
3405 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3407 return error_mark_node
;
3410 if (TREE_VALUE (arg
) != void_type_node
)
3412 /* Collect the sets of parameter packs used in each of the
3413 initialization arguments. */
3414 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3416 /* Determine which parameter packs will be expanded in this
3418 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3425 /* Create the pack expansion type for the base type. */
3426 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3427 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3428 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3430 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3431 they will rarely be compared to anything. */
3432 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3434 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3437 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3440 /* Build the PACK_EXPANSION_* node. */
3442 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3443 : make_node (EXPR_PACK_EXPANSION
);
3444 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3445 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3447 /* Propagate type and const-expression information. */
3448 TREE_TYPE (result
) = TREE_TYPE (arg
);
3449 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3452 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3453 they will rarely be compared to anything. */
3454 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3456 /* Determine which parameter packs will be expanded. */
3457 ppd
.parameter_packs
= ¶meter_packs
;
3458 ppd
.visited
= new hash_set
<tree
>;
3459 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3462 /* Make sure we found some parameter packs. */
3463 if (parameter_packs
== NULL_TREE
)
3466 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3468 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3469 return error_mark_node
;
3471 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3473 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3478 /* Checks T for any "bare" parameter packs, which have not yet been
3479 expanded, and issues an error if any are found. This operation can
3480 only be done on full expressions or types (e.g., an expression
3481 statement, "if" condition, etc.), because we could have expressions like:
3483 foo(f(g(h(args)))...)
3485 where "args" is a parameter pack. check_for_bare_parameter_packs
3486 should not be called for the subexpressions args, h(args),
3487 g(h(args)), or f(g(h(args))), because we would produce erroneous
3490 Returns TRUE and emits an error if there were bare parameter packs,
3491 returns FALSE otherwise. */
3493 check_for_bare_parameter_packs (tree t
)
3495 tree parameter_packs
= NULL_TREE
;
3496 struct find_parameter_pack_data ppd
;
3498 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3501 if (TREE_CODE (t
) == TYPE_DECL
)
3504 ppd
.parameter_packs
= ¶meter_packs
;
3505 ppd
.visited
= new hash_set
<tree
>;
3506 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3509 if (parameter_packs
)
3511 error ("parameter packs not expanded with %<...%>:");
3512 while (parameter_packs
)
3514 tree pack
= TREE_VALUE (parameter_packs
);
3515 tree name
= NULL_TREE
;
3517 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3518 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3519 name
= TYPE_NAME (pack
);
3520 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3521 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3523 name
= DECL_NAME (pack
);
3526 inform (input_location
, " %qD", name
);
3528 inform (input_location
, " <anonymous>");
3530 parameter_packs
= TREE_CHAIN (parameter_packs
);
3539 /* Expand any parameter packs that occur in the template arguments in
3542 expand_template_argument_pack (tree args
)
3544 tree result_args
= NULL_TREE
;
3545 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3546 int num_result_args
= -1;
3547 int non_default_args_count
= -1;
3549 /* First, determine if we need to expand anything, and the number of
3550 slots we'll need. */
3551 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3553 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3554 if (arg
== NULL_TREE
)
3556 if (ARGUMENT_PACK_P (arg
))
3558 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3559 if (num_result_args
< 0)
3560 num_result_args
= in_arg
+ num_packed
;
3562 num_result_args
+= num_packed
;
3566 if (num_result_args
>= 0)
3571 /* If no expansion is necessary, we're done. */
3572 if (num_result_args
< 0)
3575 /* Expand arguments. */
3576 result_args
= make_tree_vec (num_result_args
);
3577 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3578 non_default_args_count
=
3579 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3580 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3582 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3583 if (ARGUMENT_PACK_P (arg
))
3585 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3586 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3587 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3588 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3589 if (non_default_args_count
> 0)
3590 non_default_args_count
+= num_packed
- 1;
3594 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3598 if (non_default_args_count
>= 0)
3599 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3603 /* Checks if DECL shadows a template parameter.
3605 [temp.local]: A template-parameter shall not be redeclared within its
3606 scope (including nested scopes).
3608 Emits an error and returns TRUE if the DECL shadows a parameter,
3609 returns FALSE otherwise. */
3612 check_template_shadow (tree decl
)
3616 /* If we're not in a template, we can't possibly shadow a template
3618 if (!current_template_parms
)
3621 /* Figure out what we're shadowing. */
3622 if (TREE_CODE (decl
) == OVERLOAD
)
3623 decl
= OVL_CURRENT (decl
);
3624 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3626 /* If there's no previous binding for this name, we're not shadowing
3627 anything, let alone a template parameter. */
3631 /* If we're not shadowing a template parameter, we're done. Note
3632 that OLDDECL might be an OVERLOAD (or perhaps even an
3633 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3635 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3638 /* We check for decl != olddecl to avoid bogus errors for using a
3639 name inside a class. We check TPFI to avoid duplicate errors for
3640 inline member templates. */
3642 || (DECL_TEMPLATE_PARM_P (decl
)
3643 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3646 /* Don't complain about the injected class name, as we've already
3647 complained about the class itself. */
3648 if (DECL_SELF_REFERENCE_P (decl
))
3651 error ("declaration of %q+#D", decl
);
3652 error (" shadows template parm %q+#D", olddecl
);
3656 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3657 ORIG_LEVEL, DECL, and TYPE. */
3660 build_template_parm_index (int index
,
3666 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3667 TEMPLATE_PARM_IDX (t
) = index
;
3668 TEMPLATE_PARM_LEVEL (t
) = level
;
3669 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3670 TEMPLATE_PARM_DECL (t
) = decl
;
3671 TREE_TYPE (t
) = type
;
3672 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3673 TREE_READONLY (t
) = TREE_READONLY (decl
);
3678 /* Find the canonical type parameter for the given template type
3679 parameter. Returns the canonical type parameter, which may be TYPE
3680 if no such parameter existed. */
3683 canonical_type_parameter (tree type
)
3686 int idx
= TEMPLATE_TYPE_IDX (type
);
3687 if (!canonical_template_parms
)
3688 vec_alloc (canonical_template_parms
, idx
+1);
3690 while (canonical_template_parms
->length () <= (unsigned)idx
)
3691 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3693 list
= (*canonical_template_parms
)[idx
];
3694 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3695 list
= TREE_CHAIN (list
);
3698 return TREE_VALUE (list
);
3701 (*canonical_template_parms
)[idx
]
3702 = tree_cons (NULL_TREE
, type
,
3703 (*canonical_template_parms
)[idx
]);
3708 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3709 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3710 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3711 new one is created. */
3714 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3715 tsubst_flags_t complain
)
3717 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3718 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3719 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3720 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3722 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3725 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3726 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3727 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3728 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3729 DECL_ARTIFICIAL (decl
) = 1;
3730 SET_DECL_TEMPLATE_PARM_P (decl
);
3732 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3733 TEMPLATE_PARM_LEVEL (index
) - levels
,
3734 TEMPLATE_PARM_ORIG_LEVEL (index
),
3736 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3737 TEMPLATE_PARM_PARAMETER_PACK (t
)
3738 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3740 /* Template template parameters need this. */
3741 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3743 DECL_TEMPLATE_RESULT (decl
)
3744 = build_decl (DECL_SOURCE_LOCATION (decl
),
3745 TYPE_DECL
, DECL_NAME (decl
), type
);
3746 DECL_ARTIFICIAL (DECL_TEMPLATE_RESULT (decl
)) = true;
3747 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3748 (DECL_TEMPLATE_PARMS (orig_decl
), args
, complain
);
3752 return TEMPLATE_PARM_DESCENDANTS (index
);
3755 /* Process information from new template parameter PARM and append it
3756 to the LIST being built. This new parameter is a non-type
3757 parameter iff IS_NON_TYPE is true. This new parameter is a
3758 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3762 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3763 bool is_non_type
, bool is_parameter_pack
)
3769 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3770 defval
= TREE_PURPOSE (parm
);
3774 tree p
= tree_last (list
);
3776 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3779 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3780 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3782 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3790 parm
= TREE_VALUE (parm
);
3792 SET_DECL_TEMPLATE_PARM_P (parm
);
3794 if (TREE_TYPE (parm
) != error_mark_node
)
3798 The top-level cv-qualifiers on the template-parameter are
3799 ignored when determining its type. */
3800 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3801 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3802 TREE_TYPE (parm
) = error_mark_node
;
3803 else if (uses_parameter_packs (TREE_TYPE (parm
))
3804 && !is_parameter_pack
3805 /* If we're in a nested template parameter list, the template
3806 template parameter could be a parameter pack. */
3807 && processing_template_parmlist
== 1)
3809 /* This template parameter is not a parameter pack, but it
3810 should be. Complain about "bare" parameter packs. */
3811 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3813 /* Recover by calling this a parameter pack. */
3814 is_parameter_pack
= true;
3818 /* A template parameter is not modifiable. */
3819 TREE_CONSTANT (parm
) = 1;
3820 TREE_READONLY (parm
) = 1;
3821 decl
= build_decl (parm_loc
,
3822 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3823 TREE_CONSTANT (decl
) = 1;
3824 TREE_READONLY (decl
) = 1;
3825 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3826 = build_template_parm_index (idx
, processing_template_decl
,
3827 processing_template_decl
,
3828 decl
, TREE_TYPE (parm
));
3830 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3831 = is_parameter_pack
;
3836 parm
= TREE_VALUE (TREE_VALUE (parm
));
3838 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3840 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3841 /* This is for distinguishing between real templates and template
3842 template parameters */
3843 TREE_TYPE (parm
) = t
;
3844 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3849 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3850 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3851 decl
= build_decl (parm_loc
,
3852 TYPE_DECL
, parm
, t
);
3855 TYPE_NAME (t
) = decl
;
3856 TYPE_STUB_DECL (t
) = decl
;
3858 TEMPLATE_TYPE_PARM_INDEX (t
)
3859 = build_template_parm_index (idx
, processing_template_decl
,
3860 processing_template_decl
,
3861 decl
, TREE_TYPE (parm
));
3862 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3863 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3865 DECL_ARTIFICIAL (decl
) = 1;
3866 SET_DECL_TEMPLATE_PARM_P (decl
);
3868 parm
= build_tree_list (defval
, parm
);
3869 return chainon (list
, parm
);
3872 /* The end of a template parameter list has been reached. Process the
3873 tree list into a parameter vector, converting each parameter into a more
3874 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3878 end_template_parm_list (tree parms
)
3882 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3884 current_template_parms
3885 = tree_cons (size_int (processing_template_decl
),
3886 saved_parmlist
, current_template_parms
);
3888 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3890 next
= TREE_CHAIN (parm
);
3891 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3892 TREE_CHAIN (parm
) = NULL_TREE
;
3895 --processing_template_parmlist
;
3897 return saved_parmlist
;
3900 /* end_template_decl is called after a template declaration is seen. */
3903 end_template_decl (void)
3905 reset_specialization ();
3907 if (! processing_template_decl
)
3910 /* This matches the pushlevel in begin_template_parm_list. */
3913 --processing_template_decl
;
3914 current_template_parms
= TREE_CHAIN (current_template_parms
);
3917 /* Takes a TREE_LIST representing a template parameter and convert it
3918 into an argument suitable to be passed to the type substitution
3919 functions. Note that If the TREE_LIST contains an error_mark
3920 node, the returned argument is error_mark_node. */
3923 template_parm_to_arg (tree t
)
3927 || TREE_CODE (t
) != TREE_LIST
)
3930 if (error_operand_p (TREE_VALUE (t
)))
3931 return error_mark_node
;
3935 if (TREE_CODE (t
) == TYPE_DECL
3936 || TREE_CODE (t
) == TEMPLATE_DECL
)
3940 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3942 /* Turn this argument into a TYPE_ARGUMENT_PACK
3943 with a single element, which expands T. */
3944 tree vec
= make_tree_vec (1);
3945 #ifdef ENABLE_CHECKING
3946 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3947 (vec
, TREE_VEC_LENGTH (vec
));
3949 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3951 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3952 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3957 t
= DECL_INITIAL (t
);
3959 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3961 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3962 with a single element, which expands T. */
3963 tree vec
= make_tree_vec (1);
3964 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3965 #ifdef ENABLE_CHECKING
3966 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3967 (vec
, TREE_VEC_LENGTH (vec
));
3969 t
= convert_from_reference (t
);
3970 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3972 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3973 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3974 TREE_TYPE (t
) = type
;
3977 t
= convert_from_reference (t
);
3982 /* Given a set of template parameters, return them as a set of template
3983 arguments. The template parameters are represented as a TREE_VEC, in
3984 the form documented in cp-tree.h for template arguments. */
3987 template_parms_to_args (tree parms
)
3990 tree args
= NULL_TREE
;
3991 int length
= TMPL_PARMS_DEPTH (parms
);
3994 /* If there is only one level of template parameters, we do not
3995 create a TREE_VEC of TREE_VECs. Instead, we return a single
3996 TREE_VEC containing the arguments. */
3998 args
= make_tree_vec (length
);
4000 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
4002 tree a
= copy_node (TREE_VALUE (header
));
4005 TREE_TYPE (a
) = NULL_TREE
;
4006 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
4007 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
4009 #ifdef ENABLE_CHECKING
4010 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
4014 TREE_VEC_ELT (args
, --l
) = a
;
4019 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
4020 /* This can happen for template parms of a template template
4023 template<template<class T, class U> class TT> struct S;
4025 Consider the level of the parms of TT; T and U both have
4026 level 2; TT has no template parm of level 1. So in this case
4027 the first element of full_template_args is NULL_TREE. If we
4028 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
4029 of 2. This will make tsubst wrongly consider that T and U
4030 have level 1. Instead, let's create a dummy vector as the
4031 first element of full_template_args so that TMPL_ARGS_DEPTH
4032 returns the correct depth for args. */
4033 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
4037 /* Within the declaration of a template, return the currently active
4038 template parameters as an argument TREE_VEC. */
4041 current_template_args (void)
4043 return template_parms_to_args (current_template_parms
);
4046 /* Update the declared TYPE by doing any lookups which were thought to be
4047 dependent, but are not now that we know the SCOPE of the declarator. */
4050 maybe_update_decl_type (tree orig_type
, tree scope
)
4052 tree type
= orig_type
;
4054 if (type
== NULL_TREE
)
4057 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4058 type
= TREE_TYPE (type
);
4060 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
4061 && dependent_type_p (type
)
4062 /* Don't bother building up the args in this case. */
4063 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
4065 /* tsubst in the args corresponding to the template parameters,
4066 including auto if present. Most things will be unchanged, but
4067 make_typename_type and tsubst_qualified_id will resolve
4068 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
4069 tree args
= current_template_args ();
4070 tree auto_node
= type_uses_auto (type
);
4074 tree auto_vec
= make_tree_vec (1);
4075 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
4076 args
= add_to_template_args (args
, auto_vec
);
4078 pushed
= push_scope (scope
);
4079 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
4084 if (type
== error_mark_node
)
4087 if (TREE_CODE (orig_type
) == TYPE_DECL
)
4089 if (same_type_p (type
, TREE_TYPE (orig_type
)))
4092 type
= TYPE_NAME (type
);
4097 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
4098 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
4099 a member template. Used by push_template_decl below. */
4102 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
4104 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
4105 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
4106 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
4107 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
4108 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4113 struct template_parm_data
4115 /* The level of the template parameters we are currently
4119 /* The index of the specialization argument we are currently
4123 /* An array whose size is the number of template parameters. The
4124 elements are nonzero if the parameter has been used in any one
4125 of the arguments processed so far. */
4128 /* An array whose size is the number of template arguments. The
4129 elements are nonzero if the argument makes use of template
4130 parameters of this level. */
4131 int* arg_uses_template_parms
;
4134 /* Subroutine of push_template_decl used to see if each template
4135 parameter in a partial specialization is used in the explicit
4136 argument list. If T is of the LEVEL given in DATA (which is
4137 treated as a template_parm_data*), then DATA->PARMS is marked
4141 mark_template_parm (tree t
, void* data
)
4145 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4147 template_parm_level_and_index (t
, &level
, &idx
);
4149 if (level
== tpd
->level
)
4151 tpd
->parms
[idx
] = 1;
4152 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4155 /* Return zero so that for_each_template_parm will continue the
4156 traversal of the tree; we want to mark *every* template parm. */
4160 /* Process the partial specialization DECL. */
4163 process_partial_specialization (tree decl
)
4165 tree type
= TREE_TYPE (decl
);
4166 tree tinfo
= get_template_info (decl
);
4167 tree maintmpl
= TI_TEMPLATE (tinfo
);
4168 tree specargs
= TI_ARGS (tinfo
);
4169 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4170 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4173 int nargs
= TREE_VEC_LENGTH (inner_args
);
4176 bool did_error_intro
= false;
4177 struct template_parm_data tpd
;
4178 struct template_parm_data tpd2
;
4180 gcc_assert (current_template_parms
);
4182 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4183 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4185 /* We check that each of the template parameters given in the
4186 partial specialization is used in the argument list to the
4187 specialization. For example:
4189 template <class T> struct S;
4190 template <class T> struct S<T*>;
4192 The second declaration is OK because `T*' uses the template
4193 parameter T, whereas
4195 template <class T> struct S<int>;
4197 is no good. Even trickier is:
4208 The S2<T> declaration is actually invalid; it is a
4209 full-specialization. Of course,
4212 struct S2<T (*)(U)>;
4214 or some such would have been OK. */
4215 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4216 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4217 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4219 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4220 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4221 for (i
= 0; i
< nargs
; ++i
)
4223 tpd
.current_arg
= i
;
4224 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4225 &mark_template_parm
,
4228 /*include_nondeduced_p=*/false);
4230 for (i
= 0; i
< ntparms
; ++i
)
4231 if (tpd
.parms
[i
] == 0)
4233 /* One of the template parms was not used in a deduced context in the
4235 if (!did_error_intro
)
4237 error ("template parameters not deducible in "
4238 "partial specialization:");
4239 did_error_intro
= true;
4242 inform (input_location
, " %qD",
4243 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4246 if (did_error_intro
)
4247 return error_mark_node
;
4249 /* [temp.class.spec]
4251 The argument list of the specialization shall not be identical to
4252 the implicit argument list of the primary template. */
4254 = TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (maintmpl
)));
4255 if (comp_template_args (inner_args
, INNERMOST_TEMPLATE_ARGS (main_args
)))
4256 error ("partial specialization %qD does not specialize "
4257 "any template arguments", decl
);
4259 /* A partial specialization that replaces multiple parameters of the
4260 primary template with a pack expansion is less specialized for those
4262 if (nargs
< DECL_NTPARMS (maintmpl
))
4264 error ("partial specialization is not more specialized than the "
4265 "primary template because it replaces multiple parameters "
4266 "with a pack expansion");
4267 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4271 /* [temp.class.spec]
4273 A partially specialized non-type argument expression shall not
4274 involve template parameters of the partial specialization except
4275 when the argument expression is a simple identifier.
4277 The type of a template parameter corresponding to a specialized
4278 non-type argument shall not be dependent on a parameter of the
4281 Also, we verify that pack expansions only occur at the
4282 end of the argument list. */
4283 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4285 for (i
= 0; i
< nargs
; ++i
)
4287 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4288 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4289 tree packed_args
= NULL_TREE
;
4292 if (ARGUMENT_PACK_P (arg
))
4294 /* Extract the arguments from the argument pack. We'll be
4295 iterating over these in the following loop. */
4296 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4297 len
= TREE_VEC_LENGTH (packed_args
);
4300 for (j
= 0; j
< len
; j
++)
4303 /* Get the Jth argument in the parameter pack. */
4304 arg
= TREE_VEC_ELT (packed_args
, j
);
4306 if (PACK_EXPANSION_P (arg
))
4308 /* Pack expansions must come at the end of the
4310 if ((packed_args
&& j
< len
- 1)
4311 || (!packed_args
&& i
< nargs
- 1))
4313 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4314 error ("parameter pack argument %qE must be at the "
4315 "end of the template argument list", arg
);
4317 error ("parameter pack argument %qT must be at the "
4318 "end of the template argument list", arg
);
4322 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4323 /* We only care about the pattern. */
4324 arg
= PACK_EXPANSION_PATTERN (arg
);
4326 if (/* These first two lines are the `non-type' bit. */
4328 && TREE_CODE (arg
) != TEMPLATE_DECL
4329 /* This next two lines are the `argument expression is not just a
4330 simple identifier' condition and also the `specialized
4331 non-type argument' bit. */
4332 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4333 && !(REFERENCE_REF_P (arg
)
4334 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4336 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4337 || (packed_args
&& uses_template_parms (arg
)))
4338 error ("template argument %qE involves template parameter(s)",
4342 /* Look at the corresponding template parameter,
4343 marking which template parameters its type depends
4345 tree type
= TREE_TYPE (parm
);
4349 /* We haven't yet initialized TPD2. Do so now. */
4350 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4351 /* The number of parameters here is the number in the
4352 main template, which, as checked in the assertion
4354 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4356 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4359 /* Mark the template parameters. But this time, we're
4360 looking for the template parameters of the main
4361 template, not in the specialization. */
4362 tpd2
.current_arg
= i
;
4363 tpd2
.arg_uses_template_parms
[i
] = 0;
4364 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4365 for_each_template_parm (type
,
4366 &mark_template_parm
,
4369 /*include_nondeduced_p=*/false);
4371 if (tpd2
.arg_uses_template_parms
[i
])
4373 /* The type depended on some template parameters.
4374 If they are fully specialized in the
4375 specialization, that's OK. */
4378 for (j
= 0; j
< nargs
; ++j
)
4379 if (tpd2
.parms
[j
] != 0
4380 && tpd
.arg_uses_template_parms
[j
])
4383 error_n (input_location
, count
,
4384 "type %qT of template argument %qE depends "
4385 "on a template parameter",
4386 "type %qT of template argument %qE depends "
4387 "on template parameters",
4396 /* We should only get here once. */
4397 if (TREE_CODE (decl
) == TYPE_DECL
)
4398 gcc_assert (!COMPLETE_TYPE_P (type
));
4400 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4401 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4402 TREE_TYPE (tmpl
) = type
;
4403 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4404 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4405 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4406 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4408 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4409 = tree_cons (specargs
, tmpl
,
4410 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4411 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4413 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4414 inst
= TREE_CHAIN (inst
))
4416 tree instance
= TREE_VALUE (inst
);
4417 if (TYPE_P (instance
)
4418 ? (COMPLETE_TYPE_P (instance
)
4419 && CLASSTYPE_IMPLICIT_INSTANTIATION (instance
))
4420 : DECL_TEMPLATE_INSTANTIATION (instance
))
4422 tree spec
= most_specialized_partial_spec (instance
, tf_none
);
4423 if (spec
&& TREE_VALUE (spec
) == tmpl
)
4425 tree inst_decl
= (DECL_P (instance
)
4426 ? instance
: TYPE_NAME (instance
));
4427 permerror (input_location
,
4428 "partial specialization of %qD after instantiation "
4429 "of %qD", decl
, inst_decl
);
4437 /* PARM is a template parameter of some form; return the corresponding
4438 TEMPLATE_PARM_INDEX. */
4441 get_template_parm_index (tree parm
)
4443 if (TREE_CODE (parm
) == PARM_DECL
4444 || TREE_CODE (parm
) == CONST_DECL
)
4445 parm
= DECL_INITIAL (parm
);
4446 else if (TREE_CODE (parm
) == TYPE_DECL
4447 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4448 parm
= TREE_TYPE (parm
);
4449 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4450 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
4451 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4452 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4453 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4457 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4458 parameter packs used by the template parameter PARM. */
4461 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4463 /* A type parm can't refer to another parm. */
4464 if (TREE_CODE (parm
) == TYPE_DECL
)
4466 else if (TREE_CODE (parm
) == PARM_DECL
)
4468 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4473 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4475 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4476 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4477 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4480 /* PARM is a template parameter pack. Return any parameter packs used in
4481 its type or the type of any of its template parameters. If there are
4482 any such packs, it will be instantiated into a fixed template parameter
4483 list by partial instantiation rather than be fully deduced. */
4486 fixed_parameter_pack_p (tree parm
)
4488 /* This can only be true in a member template. */
4489 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4491 /* This can only be true for a parameter pack. */
4492 if (!template_parameter_pack_p (parm
))
4494 /* A type parm can't refer to another parm. */
4495 if (TREE_CODE (parm
) == TYPE_DECL
)
4498 tree parameter_packs
= NULL_TREE
;
4499 struct find_parameter_pack_data ppd
;
4500 ppd
.parameter_packs
= ¶meter_packs
;
4501 ppd
.visited
= new hash_set
<tree
>;
4503 fixed_parameter_pack_p_1 (parm
, &ppd
);
4506 return parameter_packs
;
4509 /* Check that a template declaration's use of default arguments and
4510 parameter packs is not invalid. Here, PARMS are the template
4511 parameters. IS_PRIMARY is true if DECL is the thing declared by
4512 a primary template. IS_PARTIAL is true if DECL is a partial
4515 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4516 declaration (but not a definition); 1 indicates a declaration, 2
4517 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4518 emitted for extraneous default arguments.
4520 Returns TRUE if there were no errors found, FALSE otherwise. */
4523 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4524 bool is_partial
, int is_friend_decl
)
4527 int last_level_to_check
;
4529 bool no_errors
= true;
4533 A default template-argument shall not be specified in a
4534 function template declaration or a function template definition, nor
4535 in the template-parameter-list of the definition of a member of a
4538 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4539 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4540 /* You can't have a function template declaration in a local
4541 scope, nor you can you define a member of a class template in a
4545 if ((TREE_CODE (decl
) == TYPE_DECL
4547 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4548 || (TREE_CODE (decl
) == FUNCTION_DECL
4549 && LAMBDA_FUNCTION_P (decl
)))
4550 /* A lambda doesn't have an explicit declaration; don't complain
4551 about the parms of the enclosing class. */
4554 if (current_class_type
4555 && !TYPE_BEING_DEFINED (current_class_type
)
4556 && DECL_LANG_SPECIFIC (decl
)
4557 && DECL_DECLARES_FUNCTION_P (decl
)
4558 /* If this is either a friend defined in the scope of the class
4559 or a member function. */
4560 && (DECL_FUNCTION_MEMBER_P (decl
)
4561 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4562 : DECL_FRIEND_CONTEXT (decl
)
4563 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4565 /* And, if it was a member function, it really was defined in
4566 the scope of the class. */
4567 && (!DECL_FUNCTION_MEMBER_P (decl
)
4568 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4569 /* We already checked these parameters when the template was
4570 declared, so there's no need to do it again now. This function
4571 was defined in class scope, but we're processing its body now
4572 that the class is complete. */
4575 /* Core issue 226 (C++0x only): the following only applies to class
4578 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4582 If a template-parameter has a default template-argument, all
4583 subsequent template-parameters shall have a default
4584 template-argument supplied. */
4585 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4587 tree inner_parms
= TREE_VALUE (parm_level
);
4588 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4589 int seen_def_arg_p
= 0;
4592 for (i
= 0; i
< ntparms
; ++i
)
4594 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4596 if (parm
== error_mark_node
)
4599 if (TREE_PURPOSE (parm
))
4601 else if (seen_def_arg_p
4602 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4604 error ("no default argument for %qD", TREE_VALUE (parm
));
4605 /* For better subsequent error-recovery, we indicate that
4606 there should have been a default argument. */
4607 TREE_PURPOSE (parm
) = error_mark_node
;
4610 else if (!is_partial
4612 /* Don't complain about an enclosing partial
4614 && parm_level
== parms
4615 && TREE_CODE (decl
) == TYPE_DECL
4617 && template_parameter_pack_p (TREE_VALUE (parm
))
4618 /* A fixed parameter pack will be partially
4619 instantiated into a fixed length list. */
4620 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4622 /* A primary class template can only have one
4623 parameter pack, at the end of the template
4626 error ("parameter pack %q+D must be at the end of the"
4627 " template parameter list", TREE_VALUE (parm
));
4629 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4637 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4641 /* For an ordinary class template, default template arguments are
4642 allowed at the innermost level, e.g.:
4643 template <class T = int>
4645 but, in a partial specialization, they're not allowed even
4646 there, as we have in [temp.class.spec]:
4648 The template parameter list of a specialization shall not
4649 contain default template argument values.
4651 So, for a partial specialization, or for a function template
4652 (in C++98/C++03), we look at all of them. */
4655 /* But, for a primary class template that is not a partial
4656 specialization we look at all template parameters except the
4658 parms
= TREE_CHAIN (parms
);
4660 /* Figure out what error message to issue. */
4661 if (is_friend_decl
== 2)
4662 msg
= G_("default template arguments may not be used in function template "
4663 "friend re-declaration");
4664 else if (is_friend_decl
)
4665 msg
= G_("default template arguments may not be used in function template "
4666 "friend declarations");
4667 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4668 msg
= G_("default template arguments may not be used in function templates "
4669 "without -std=c++11 or -std=gnu++11");
4670 else if (is_partial
)
4671 msg
= G_("default template arguments may not be used in "
4672 "partial specializations");
4674 msg
= G_("default argument for template parameter for class enclosing %qD");
4676 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4677 /* If we're inside a class definition, there's no need to
4678 examine the parameters to the class itself. On the one
4679 hand, they will be checked when the class is defined, and,
4680 on the other, default arguments are valid in things like:
4681 template <class T = double>
4682 struct S { template <class U> void f(U); };
4683 Here the default argument for `S' has no bearing on the
4684 declaration of `f'. */
4685 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4687 /* Check everything. */
4688 last_level_to_check
= 0;
4690 for (parm_level
= parms
;
4691 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4692 parm_level
= TREE_CHAIN (parm_level
))
4694 tree inner_parms
= TREE_VALUE (parm_level
);
4698 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4699 for (i
= 0; i
< ntparms
; ++i
)
4701 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4704 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4709 if (is_friend_decl
== 2)
4716 /* Clear out the default argument so that we are not
4718 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4722 /* At this point, if we're still interested in issuing messages,
4723 they must apply to classes surrounding the object declared. */
4725 msg
= G_("default argument for template parameter for class "
4732 /* Worker for push_template_decl_real, called via
4733 for_each_template_parm. DATA is really an int, indicating the
4734 level of the parameters we are interested in. If T is a template
4735 parameter of that level, return nonzero. */
4738 template_parm_this_level_p (tree t
, void* data
)
4740 int this_level
= *(int *)data
;
4743 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4744 level
= TEMPLATE_PARM_LEVEL (t
);
4746 level
= TEMPLATE_TYPE_LEVEL (t
);
4747 return level
== this_level
;
4750 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4751 parameters given by current_template_args, or reuses a
4752 previously existing one, if appropriate. Returns the DECL, or an
4753 equivalent one, if it is replaced via a call to duplicate_decls.
4755 If IS_FRIEND is true, DECL is a friend declaration. */
4758 push_template_decl_real (tree decl
, bool is_friend
)
4766 int new_template_p
= 0;
4767 /* True if the template is a member template, in the sense of
4769 bool member_template_p
= false;
4771 if (decl
== error_mark_node
|| !current_template_parms
)
4772 return error_mark_node
;
4774 /* See if this is a partial specialization. */
4775 is_partial
= ((DECL_IMPLICIT_TYPEDEF_P (decl
)
4776 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4777 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
4779 && DECL_LANG_SPECIFIC (decl
)
4780 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4781 && TINFO_USED_TEMPLATE_ID (DECL_TEMPLATE_INFO (decl
))));
4783 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4787 /* For a friend, we want the context of the friend function, not
4788 the type of which it is a friend. */
4789 ctx
= CP_DECL_CONTEXT (decl
);
4790 else if (CP_DECL_CONTEXT (decl
)
4791 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4792 /* In the case of a virtual function, we want the class in which
4794 ctx
= CP_DECL_CONTEXT (decl
);
4796 /* Otherwise, if we're currently defining some class, the DECL
4797 is assumed to be a member of the class. */
4798 ctx
= current_scope ();
4800 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4803 if (!DECL_CONTEXT (decl
))
4804 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4806 /* See if this is a primary template. */
4807 if (is_friend
&& ctx
4808 && uses_template_parms_level (ctx
, processing_template_decl
))
4809 /* A friend template that specifies a class context, i.e.
4810 template <typename T> friend void A<T>::f();
4813 else if (TREE_CODE (decl
) == TYPE_DECL
4814 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4817 is_primary
= template_parm_scope_p ();
4821 if (DECL_CLASS_SCOPE_P (decl
))
4822 member_template_p
= true;
4823 if (TREE_CODE (decl
) == TYPE_DECL
4824 && anon_aggrname_p (DECL_NAME (decl
)))
4826 error ("template class without a name");
4827 return error_mark_node
;
4829 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4831 if (member_template_p
)
4833 if (DECL_OVERRIDE_P (decl
) || DECL_FINAL_P (decl
))
4834 error ("member template %qD may not have virt-specifiers", decl
);
4836 if (DECL_DESTRUCTOR_P (decl
))
4840 A destructor shall not be a member template. */
4841 error ("destructor %qD declared as member template", decl
);
4842 return error_mark_node
;
4844 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4845 && (!prototype_p (TREE_TYPE (decl
))
4846 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4847 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4848 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4849 == void_list_node
)))
4851 /* [basic.stc.dynamic.allocation]
4853 An allocation function can be a function
4854 template. ... Template allocation functions shall
4855 have two or more parameters. */
4856 error ("invalid template declaration of %qD", decl
);
4857 return error_mark_node
;
4860 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4861 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4863 else if (TREE_CODE (decl
) == TYPE_DECL
4864 && TYPE_DECL_ALIAS_P (decl
))
4865 /* alias-declaration */
4866 gcc_assert (!DECL_ARTIFICIAL (decl
));
4867 else if (VAR_P (decl
))
4868 /* C++14 variable template. */;
4871 error ("template declaration of %q#D", decl
);
4872 return error_mark_node
;
4876 /* Check to see that the rules regarding the use of default
4877 arguments are not being violated. */
4878 check_default_tmpl_args (decl
, current_template_parms
,
4879 is_primary
, is_partial
, /*is_friend_decl=*/0);
4881 /* Ensure that there are no parameter packs in the type of this
4882 declaration that have not been expanded. */
4883 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4885 /* Check each of the arguments individually to see if there are
4886 any bare parameter packs. */
4887 tree type
= TREE_TYPE (decl
);
4888 tree arg
= DECL_ARGUMENTS (decl
);
4889 tree argtype
= TYPE_ARG_TYPES (type
);
4891 while (arg
&& argtype
)
4893 if (!DECL_PACK_P (arg
)
4894 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4896 /* This is a PARM_DECL that contains unexpanded parameter
4897 packs. We have already complained about this in the
4898 check_for_bare_parameter_packs call, so just replace
4899 these types with ERROR_MARK_NODE. */
4900 TREE_TYPE (arg
) = error_mark_node
;
4901 TREE_VALUE (argtype
) = error_mark_node
;
4904 arg
= DECL_CHAIN (arg
);
4905 argtype
= TREE_CHAIN (argtype
);
4908 /* Check for bare parameter packs in the return type and the
4909 exception specifiers. */
4910 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4911 /* Errors were already issued, set return type to int
4912 as the frontend doesn't expect error_mark_node as
4914 TREE_TYPE (type
) = integer_type_node
;
4915 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4916 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4918 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4919 && TYPE_DECL_ALIAS_P (decl
))
4920 ? DECL_ORIGINAL_TYPE (decl
)
4921 : TREE_TYPE (decl
)))
4923 TREE_TYPE (decl
) = error_mark_node
;
4924 return error_mark_node
;
4928 return process_partial_specialization (decl
);
4930 args
= current_template_args ();
4933 || TREE_CODE (ctx
) == FUNCTION_DECL
4934 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4935 || (TREE_CODE (decl
) == TYPE_DECL
4936 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4937 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4939 if (DECL_LANG_SPECIFIC (decl
)
4940 && DECL_TEMPLATE_INFO (decl
)
4941 && DECL_TI_TEMPLATE (decl
))
4942 tmpl
= DECL_TI_TEMPLATE (decl
);
4943 /* If DECL is a TYPE_DECL for a class-template, then there won't
4944 be DECL_LANG_SPECIFIC. The information equivalent to
4945 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4946 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4947 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4948 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4950 /* Since a template declaration already existed for this
4951 class-type, we must be redeclaring it here. Make sure
4952 that the redeclaration is valid. */
4953 redeclare_class_template (TREE_TYPE (decl
),
4954 current_template_parms
);
4955 /* We don't need to create a new TEMPLATE_DECL; just use the
4956 one we already had. */
4957 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4961 tmpl
= build_template_decl (decl
, current_template_parms
,
4965 if (DECL_LANG_SPECIFIC (decl
)
4966 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4968 /* A specialization of a member template of a template
4970 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4971 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4972 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4978 tree a
, t
, current
, parms
;
4980 tree tinfo
= get_template_info (decl
);
4984 error ("template definition of non-template %q#D", decl
);
4985 return error_mark_node
;
4988 tmpl
= TI_TEMPLATE (tinfo
);
4990 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4991 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4992 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4993 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4997 /* The declaration is a specialization of a member
4998 template, declared outside the class. Therefore, the
4999 innermost template arguments will be NULL, so we
5000 replace them with the arguments determined by the
5001 earlier call to check_explicit_specialization. */
5002 args
= DECL_TI_ARGS (decl
);
5005 = build_template_decl (decl
, current_template_parms
,
5007 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
5008 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
5009 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
5010 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
5011 DECL_TEMPLATE_INFO (new_tmpl
)
5012 = build_template_info (tmpl
, args
);
5014 register_specialization (new_tmpl
,
5015 most_general_template (tmpl
),
5021 /* Make sure the template headers we got make sense. */
5023 parms
= DECL_TEMPLATE_PARMS (tmpl
);
5024 i
= TMPL_PARMS_DEPTH (parms
);
5025 if (TMPL_ARGS_DEPTH (args
) != i
)
5027 error ("expected %d levels of template parms for %q#D, got %d",
5028 i
, decl
, TMPL_ARGS_DEPTH (args
));
5029 DECL_INTERFACE_KNOWN (decl
) = 1;
5030 return error_mark_node
;
5033 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
5035 a
= TMPL_ARGS_LEVEL (args
, i
);
5036 t
= INNERMOST_TEMPLATE_PARMS (parms
);
5038 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
5040 if (current
== decl
)
5041 error ("got %d template parameters for %q#D",
5042 TREE_VEC_LENGTH (a
), decl
);
5044 error ("got %d template parameters for %q#T",
5045 TREE_VEC_LENGTH (a
), current
);
5046 error (" but %d required", TREE_VEC_LENGTH (t
));
5047 /* Avoid crash in import_export_decl. */
5048 DECL_INTERFACE_KNOWN (decl
) = 1;
5049 return error_mark_node
;
5052 if (current
== decl
)
5054 else if (current
== NULL_TREE
)
5055 /* Can happen in erroneous input. */
5058 current
= get_containing_scope (current
);
5061 /* Check that the parms are used in the appropriate qualifying scopes
5062 in the declarator. */
5063 if (!comp_template_args
5065 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
5068 template arguments to %qD do not match original template %qD",
5069 decl
, DECL_TEMPLATE_RESULT (tmpl
));
5070 if (!uses_template_parms (TI_ARGS (tinfo
)))
5071 inform (input_location
, "use template<> for an explicit specialization");
5072 /* Avoid crash in import_export_decl. */
5073 DECL_INTERFACE_KNOWN (decl
) = 1;
5074 return error_mark_node
;
5078 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
5079 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
5081 /* Push template declarations for global functions and types. Note
5082 that we do not try to push a global template friend declared in a
5083 template class; such a thing may well depend on the template
5084 parameters of the class. */
5085 if (new_template_p
&& !ctx
5086 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
5088 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
5089 if (tmpl
== error_mark_node
)
5090 return error_mark_node
;
5092 /* Hide template friend classes that haven't been declared yet. */
5093 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
5095 DECL_ANTICIPATED (tmpl
) = 1;
5096 DECL_FRIEND_P (tmpl
) = 1;
5102 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5105 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5106 if (DECL_CONV_FN_P (tmpl
))
5108 int depth
= TMPL_PARMS_DEPTH (parms
);
5110 /* It is a conversion operator. See if the type converted to
5111 depends on innermost template operands. */
5113 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
5115 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5118 /* Give template template parms a DECL_CONTEXT of the template
5119 for which they are a parameter. */
5120 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5121 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5123 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5124 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5125 DECL_CONTEXT (parm
) = tmpl
;
5128 if (TREE_CODE (decl
) == TYPE_DECL
5129 && TYPE_DECL_ALIAS_P (decl
)
5130 && complex_alias_template_p (tmpl
))
5131 TEMPLATE_DECL_COMPLEX_ALIAS_P (tmpl
) = true;
5134 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5135 back to its most general template. If TMPL is a specialization,
5136 ARGS may only have the innermost set of arguments. Add the missing
5137 argument levels if necessary. */
5138 if (DECL_TEMPLATE_INFO (tmpl
))
5139 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5141 info
= build_template_info (tmpl
, args
);
5143 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5144 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5147 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5148 retrofit_lang_decl (decl
);
5149 if (DECL_LANG_SPECIFIC (decl
))
5150 DECL_TEMPLATE_INFO (decl
) = info
;
5153 if (flag_implicit_templates
5155 && TREE_PUBLIC (decl
)
5156 && VAR_OR_FUNCTION_DECL_P (decl
))
5157 /* Set DECL_COMDAT on template instantiations; if we force
5158 them to be emitted by explicit instantiation or -frepo,
5159 mark_needed will tell cgraph to do the right thing. */
5160 DECL_COMDAT (decl
) = true;
5162 return DECL_TEMPLATE_RESULT (tmpl
);
5166 push_template_decl (tree decl
)
5168 return push_template_decl_real (decl
, false);
5171 /* FN is an inheriting constructor that inherits from the constructor
5172 template INHERITED; turn FN into a constructor template with a matching
5176 add_inherited_template_parms (tree fn
, tree inherited
)
5179 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5180 inner_parms
= copy_node (inner_parms
);
5182 = tree_cons (size_int (processing_template_decl
+ 1),
5183 inner_parms
, current_template_parms
);
5184 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5185 tree args
= template_parms_to_args (parms
);
5186 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5187 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5188 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5189 DECL_ARTIFICIAL (tmpl
) = true;
5190 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5194 /* Called when a class template TYPE is redeclared with the indicated
5195 template PARMS, e.g.:
5197 template <class T> struct S;
5198 template <class T> struct S {}; */
5201 redeclare_class_template (tree type
, tree parms
)
5207 if (!TYPE_TEMPLATE_INFO (type
))
5209 error ("%qT is not a template type", type
);
5213 tmpl
= TYPE_TI_TEMPLATE (type
);
5214 if (!PRIMARY_TEMPLATE_P (tmpl
))
5215 /* The type is nested in some template class. Nothing to worry
5216 about here; there are no new template parameters for the nested
5222 error ("template specifiers not specified in declaration of %qD",
5227 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5228 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5230 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5232 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5233 "redeclared with %d template parameter",
5234 "redeclared with %d template parameters",
5235 TREE_VEC_LENGTH (parms
));
5236 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5237 "previous declaration %q+D used %d template parameter",
5238 "previous declaration %q+D used %d template parameters",
5239 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5243 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5250 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5251 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5254 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5255 if (error_operand_p (tmpl_parm
))
5258 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5259 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5260 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5262 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5264 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5265 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5266 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5267 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5268 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5269 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5270 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5271 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5272 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5274 error ("template parameter %q+#D", tmpl_parm
);
5275 error ("redeclared here as %q#D", parm
);
5279 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5281 /* We have in [temp.param]:
5283 A template-parameter may not be given default arguments
5284 by two different declarations in the same scope. */
5285 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5286 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5287 "original definition appeared here");
5291 if (parm_default
!= NULL_TREE
)
5292 /* Update the previous template parameters (which are the ones
5293 that will really count) with the new default value. */
5294 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5295 else if (tmpl_default
!= NULL_TREE
)
5296 /* Update the new parameters, too; they'll be used as the
5297 parameters for any members. */
5298 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5304 /* The actual substitution part of instantiate_non_dependent_expr_sfinae,
5305 to be used when the caller has already checked
5306 (processing_template_decl
5307 && !instantiation_dependent_expression_p (expr)
5308 && potential_constant_expression (expr))
5309 and cleared processing_template_decl. */
5312 instantiate_non_dependent_expr_internal (tree expr
, tsubst_flags_t complain
)
5314 return tsubst_copy_and_build (expr
,
5317 /*in_decl=*/NULL_TREE
,
5318 /*function_p=*/false,
5319 /*integral_constant_expression_p=*/true);
5322 /* Simplify EXPR if it is a non-dependent expression. Returns the
5323 (possibly simplified) expression. */
5326 instantiate_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5328 if (expr
== NULL_TREE
)
5331 /* If we're in a template, but EXPR isn't value dependent, simplify
5332 it. We're supposed to treat:
5334 template <typename T> void f(T[1 + 1]);
5335 template <typename T> void f(T[2]);
5337 as two declarations of the same function, for example. */
5338 if (processing_template_decl
5339 && !instantiation_dependent_expression_p (expr
)
5340 && potential_constant_expression (expr
))
5342 processing_template_decl_sentinel s
;
5343 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5349 instantiate_non_dependent_expr (tree expr
)
5351 return instantiate_non_dependent_expr_sfinae (expr
, tf_error
);
5354 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5355 template declaration, or a TYPE_DECL for an alias declaration. */
5358 alias_type_or_template_p (tree t
)
5362 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5365 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5366 || DECL_ALIAS_TEMPLATE_P (t
));
5369 /* Return TRUE iff T is a specialization of an alias template. */
5372 alias_template_specialization_p (const_tree t
)
5374 /* It's an alias template specialization if it's an alias and its
5375 TYPE_NAME is a specialization of a primary template. */
5376 if (TYPE_ALIAS_P (t
))
5378 tree name
= TYPE_NAME (t
);
5379 if (DECL_LANG_SPECIFIC (name
))
5380 if (tree ti
= DECL_TEMPLATE_INFO (name
))
5382 tree tmpl
= TI_TEMPLATE (ti
);
5383 return PRIMARY_TEMPLATE_P (tmpl
);
5389 /* An alias template is complex from a SFINAE perspective if a template-id
5390 using that alias can be ill-formed when the expansion is not, as with
5391 the void_t template. We determine this by checking whether the
5392 expansion for the alias template uses all its template parameters. */
5394 struct uses_all_template_parms_data
5401 uses_all_template_parms_r (tree t
, void *data_
)
5403 struct uses_all_template_parms_data
&data
5404 = *(struct uses_all_template_parms_data
*)data_
;
5405 tree idx
= get_template_parm_index (t
);
5407 if (TEMPLATE_PARM_LEVEL (idx
) == data
.level
)
5408 data
.seen
[TEMPLATE_PARM_IDX (idx
)] = true;
5413 complex_alias_template_p (const_tree tmpl
)
5415 struct uses_all_template_parms_data data
;
5416 tree pat
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5417 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
5418 data
.level
= TMPL_PARMS_DEPTH (parms
);
5419 int len
= TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS (parms
));
5420 data
.seen
= XALLOCAVEC (bool, len
);
5421 for (int i
= 0; i
< len
; ++i
)
5422 data
.seen
[i
] = false;
5424 for_each_template_parm (pat
, uses_all_template_parms_r
, &data
, NULL
, true);
5425 for (int i
= 0; i
< len
; ++i
)
5431 /* Return TRUE iff T is a specialization of a complex alias template with
5432 dependent template-arguments. */
5435 dependent_alias_template_spec_p (const_tree t
)
5437 return (alias_template_specialization_p (t
)
5438 && TEMPLATE_DECL_COMPLEX_ALIAS_P (DECL_TI_TEMPLATE (TYPE_NAME (t
)))
5439 && (any_dependent_template_arguments_p
5440 (INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (t
)))));
5443 /* Return the number of innermost template parameters in TMPL. */
5446 num_innermost_template_parms (tree tmpl
)
5448 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5449 return TREE_VEC_LENGTH (parms
);
5452 /* Return either TMPL or another template that it is equivalent to under DR
5453 1286: An alias that just changes the name of a template is equivalent to
5454 the other template. */
5457 get_underlying_template (tree tmpl
)
5459 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5460 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5462 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5463 if (TYPE_TEMPLATE_INFO (result
))
5465 tree sub
= TYPE_TI_TEMPLATE (result
);
5466 if (PRIMARY_TEMPLATE_P (sub
)
5467 && (num_innermost_template_parms (tmpl
)
5468 == num_innermost_template_parms (sub
)))
5470 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5471 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5472 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5474 /* The alias type is equivalent to the pattern of the
5475 underlying template, so strip the alias. */
5485 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5486 must be a function or a pointer-to-function type, as specified
5487 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5488 and check that the resulting function has external linkage. */
5491 convert_nontype_argument_function (tree type
, tree expr
,
5492 tsubst_flags_t complain
)
5496 linkage_kind linkage
;
5498 fn
= instantiate_type (type
, fns
, tf_none
);
5499 if (fn
== error_mark_node
)
5500 return error_mark_node
;
5503 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5504 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5505 if (BASELINK_P (fn_no_ptr
))
5506 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5508 /* [temp.arg.nontype]/1
5510 A template-argument for a non-type, non-template template-parameter
5513 -- the address of an object or function with external [C++11: or
5514 internal] linkage. */
5516 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5518 if (complain
& tf_error
)
5520 error ("%qE is not a valid template argument for type %qT",
5522 if (TYPE_PTR_P (type
))
5523 error ("it must be the address of a function with "
5524 "external linkage");
5526 error ("it must be the name of a function with "
5527 "external linkage");
5532 linkage
= decl_linkage (fn_no_ptr
);
5533 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5535 if (complain
& tf_error
)
5537 if (cxx_dialect
>= cxx11
)
5538 error ("%qE is not a valid template argument for type %qT "
5539 "because %qD has no linkage",
5540 expr
, type
, fn_no_ptr
);
5542 error ("%qE is not a valid template argument for type %qT "
5543 "because %qD does not have external linkage",
5544 expr
, type
, fn_no_ptr
);
5552 /* Subroutine of convert_nontype_argument.
5553 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5554 Emit an error otherwise. */
5557 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5558 tsubst_flags_t complain
)
5561 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5563 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5565 if (processing_template_decl
5566 && TREE_CODE (expr
) == ADDR_EXPR
5567 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5569 if (complain
& tf_error
)
5571 error ("%qE is not a valid template argument for type %qT",
5573 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5578 /* Returns TRUE iff the address of OP is value-dependent.
5580 14.6.2.4 [temp.dep.temp]:
5581 A non-integral non-type template-argument is dependent if its type is
5582 dependent or it has either of the following forms
5585 and contains a nested-name-specifier which specifies a class-name that
5586 names a dependent type.
5588 We generalize this to just say that the address of a member of a
5589 dependent class is value-dependent; the above doesn't cover the
5590 address of a static data member named with an unqualified-id. */
5593 has_value_dependent_address (tree op
)
5595 /* We could use get_inner_reference here, but there's no need;
5596 this is only relevant for template non-type arguments, which
5597 can only be expressed as &id-expression. */
5600 tree ctx
= CP_DECL_CONTEXT (op
);
5601 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5608 /* The next set of functions are used for providing helpful explanatory
5609 diagnostics for failed overload resolution. Their messages should be
5610 indented by two spaces for consistency with the messages in
5614 unify_success (bool /*explain_p*/)
5620 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5623 inform (input_location
,
5624 " couldn't deduce template parameter %qD", parm
);
5629 unify_invalid (bool /*explain_p*/)
5635 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5638 inform (input_location
,
5639 " types %qT and %qT have incompatible cv-qualifiers",
5645 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5648 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5653 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5656 inform (input_location
,
5657 " template parameter %qD is not a parameter pack, but "
5664 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5667 inform (input_location
,
5668 " template argument %qE does not match "
5669 "pointer-to-member constant %qE",
5675 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5678 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5683 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5686 inform (input_location
,
5687 " inconsistent parameter pack deduction with %qT and %qT",
5693 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5698 inform (input_location
,
5699 " deduced conflicting types for parameter %qT (%qT and %qT)",
5700 parm
, first
, second
);
5702 inform (input_location
,
5703 " deduced conflicting values for non-type parameter "
5704 "%qE (%qE and %qE)", parm
, first
, second
);
5710 unify_vla_arg (bool explain_p
, tree arg
)
5713 inform (input_location
,
5714 " variable-sized array type %qT is not "
5715 "a valid template argument",
5721 unify_method_type_error (bool explain_p
, tree arg
)
5724 inform (input_location
,
5725 " member function type %qT is not a valid template argument",
5731 unify_arity (bool explain_p
, int have
, int wanted
, bool least_p
= false)
5736 inform_n (input_location
, wanted
,
5737 " candidate expects at least %d argument, %d provided",
5738 " candidate expects at least %d arguments, %d provided",
5741 inform_n (input_location
, wanted
,
5742 " candidate expects %d argument, %d provided",
5743 " candidate expects %d arguments, %d provided",
5750 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5752 return unify_arity (explain_p
, have
, wanted
);
5756 unify_too_few_arguments (bool explain_p
, int have
, int wanted
,
5757 bool least_p
= false)
5759 return unify_arity (explain_p
, have
, wanted
, least_p
);
5763 unify_arg_conversion (bool explain_p
, tree to_type
,
5764 tree from_type
, tree arg
)
5767 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5768 " cannot convert %qE (type %qT) to type %qT",
5769 arg
, from_type
, to_type
);
5774 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5775 tree parm
, tree arg
)
5780 case tbr_ambiguous_baseclass
:
5781 inform (input_location
, " %qT is an ambiguous base class of %qT",
5785 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5792 unify_inconsistent_template_template_parameters (bool explain_p
)
5795 inform (input_location
,
5796 " template parameters of a template template argument are "
5797 "inconsistent with other deduced template arguments");
5802 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5805 inform (input_location
,
5806 " can't deduce a template for %qT from non-template type %qT",
5812 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5815 inform (input_location
,
5816 " template argument %qE does not match %qD", arg
, parm
);
5821 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5824 inform (input_location
,
5825 " could not resolve address from overloaded function %qE",
5830 /* Attempt to convert the non-type template parameter EXPR to the
5831 indicated TYPE. If the conversion is successful, return the
5832 converted value. If the conversion is unsuccessful, return
5833 NULL_TREE if we issued an error message, or error_mark_node if we
5834 did not. We issue error messages for out-and-out bad template
5835 parameters, but not simply because the conversion failed, since we
5836 might be just trying to do argument deduction. Both TYPE and EXPR
5837 must be non-dependent.
5839 The conversion follows the special rules described in
5840 [temp.arg.nontype], and it is much more strict than an implicit
5843 This function is called twice for each template argument (see
5844 lookup_template_class for a more accurate description of this
5845 problem). This means that we need to handle expressions which
5846 are not valid in a C++ source, but can be created from the
5847 first call (for instance, casts to perform conversions). These
5848 hacks can go away after we fix the double coercion problem. */
5851 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5855 /* Detect immediately string literals as invalid non-type argument.
5856 This special-case is not needed for correctness (we would easily
5857 catch this later), but only to provide better diagnostic for this
5858 common user mistake. As suggested by DR 100, we do not mention
5859 linkage issues in the diagnostic as this is not the point. */
5860 /* FIXME we're making this OK. */
5861 if (TREE_CODE (expr
) == STRING_CST
)
5863 if (complain
& tf_error
)
5864 error ("%qE is not a valid template argument for type %qT "
5865 "because string literals can never be used in this context",
5870 /* Add the ADDR_EXPR now for the benefit of
5871 value_dependent_expression_p. */
5872 if (TYPE_PTROBV_P (type
)
5873 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5875 expr
= decay_conversion (expr
, complain
);
5876 if (expr
== error_mark_node
)
5877 return error_mark_node
;
5880 /* If we are in a template, EXPR may be non-dependent, but still
5881 have a syntactic, rather than semantic, form. For example, EXPR
5882 might be a SCOPE_REF, rather than the VAR_DECL to which the
5883 SCOPE_REF refers. Preserving the qualifying scope is necessary
5884 so that access checking can be performed when the template is
5885 instantiated -- but here we need the resolved form so that we can
5886 convert the argument. */
5887 bool non_dep
= false;
5888 if (TYPE_REF_OBJ_P (type
)
5889 && has_value_dependent_address (expr
))
5890 /* If we want the address and it's value-dependent, don't fold. */;
5891 else if (!type_unknown_p (expr
)
5892 && processing_template_decl
5893 && !instantiation_dependent_expression_p (expr
)
5894 && potential_constant_expression (expr
))
5896 if (error_operand_p (expr
))
5897 return error_mark_node
;
5898 expr_type
= TREE_TYPE (expr
);
5899 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5900 expr
= mark_lvalue_use (expr
);
5902 expr
= mark_rvalue_use (expr
);
5904 /* If the argument is non-dependent, perform any conversions in
5905 non-dependent context as well. */
5906 processing_template_decl_sentinel
s (non_dep
);
5908 expr
= instantiate_non_dependent_expr_internal (expr
, complain
);
5910 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5911 to a non-type argument of "nullptr". */
5912 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5913 expr
= convert (type
, expr
);
5915 /* In C++11, integral or enumeration non-type template arguments can be
5916 arbitrary constant expressions. Pointer and pointer to
5917 member arguments can be general constant expressions that evaluate
5918 to a null value, but otherwise still need to be of a specific form. */
5919 if (cxx_dialect
>= cxx11
)
5921 if (TREE_CODE (expr
) == PTRMEM_CST
)
5922 /* A PTRMEM_CST is already constant, and a valid template
5923 argument for a parameter of pointer to member type, we just want
5924 to leave it in that form rather than lower it to a
5926 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5927 expr
= maybe_constant_value (expr
);
5928 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5930 tree folded
= maybe_constant_value (expr
);
5931 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5932 : null_member_pointer_value_p (folded
))
5937 /* HACK: Due to double coercion, we can get a
5938 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5939 which is the tree that we built on the first call (see
5940 below when coercing to reference to object or to reference to
5941 function). We just strip everything and get to the arg.
5942 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5944 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5946 tree probe_type
, probe
= expr
;
5947 if (REFERENCE_REF_P (probe
))
5948 probe
= TREE_OPERAND (probe
, 0);
5949 probe_type
= TREE_TYPE (probe
);
5950 if (TREE_CODE (probe
) == NOP_EXPR
)
5952 /* ??? Maybe we could use convert_from_reference here, but we
5953 would need to relax its constraints because the NOP_EXPR
5954 could actually change the type to something more cv-qualified,
5955 and this is not folded by convert_from_reference. */
5956 tree addr
= TREE_OPERAND (probe
, 0);
5957 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5958 && TREE_CODE (addr
) == ADDR_EXPR
5959 && TYPE_PTR_P (TREE_TYPE (addr
))
5960 && (same_type_ignoring_top_level_qualifiers_p
5961 (TREE_TYPE (probe_type
),
5962 TREE_TYPE (TREE_TYPE (addr
)))))
5964 expr
= TREE_OPERAND (addr
, 0);
5965 expr_type
= TREE_TYPE (probe_type
);
5970 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5971 parameter is a pointer to object, through decay and
5972 qualification conversion. Let's strip everything. */
5973 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5977 if (TREE_CODE (probe
) == ADDR_EXPR
5978 && TYPE_PTR_P (TREE_TYPE (probe
)))
5980 /* Skip the ADDR_EXPR only if it is part of the decay for
5981 an array. Otherwise, it is part of the original argument
5982 in the source code. */
5983 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5984 probe
= TREE_OPERAND (probe
, 0);
5986 expr_type
= TREE_TYPE (expr
);
5990 /* [temp.arg.nontype]/5, bullet 1
5992 For a non-type template-parameter of integral or enumeration type,
5993 integral promotions (_conv.prom_) and integral conversions
5994 (_conv.integral_) are applied. */
5995 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5997 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5998 t
= maybe_constant_value (t
);
5999 if (t
!= error_mark_node
)
6002 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
6003 return error_mark_node
;
6005 /* Notice that there are constant expressions like '4 % 0' which
6006 do not fold into integer constants. */
6007 if (TREE_CODE (expr
) != INTEGER_CST
)
6009 if (complain
& tf_error
)
6011 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
6012 if (processing_template_decl
6013 && !require_potential_constant_expression (expr
))
6015 expr
= cxx_constant_value (expr
);
6016 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
6017 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
6018 "in template argument for type %qT ", type
);
6019 if (expr
== error_mark_node
)
6021 /* else cxx_constant_value complained but gave us
6022 a real constant, so go ahead. */
6023 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
6029 /* Avoid typedef problems. */
6030 if (TREE_TYPE (expr
) != type
)
6031 expr
= fold_convert (type
, expr
);
6033 /* [temp.arg.nontype]/5, bullet 2
6035 For a non-type template-parameter of type pointer to object,
6036 qualification conversions (_conv.qual_) and the array-to-pointer
6037 conversion (_conv.array_) are applied. */
6038 else if (TYPE_PTROBV_P (type
))
6040 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
6042 A template-argument for a non-type, non-template template-parameter
6043 shall be one of: [...]
6045 -- the name of a non-type template-parameter;
6046 -- the address of an object or function with external linkage, [...]
6047 expressed as "& id-expression" where the & is optional if the name
6048 refers to a function or array, or if the corresponding
6049 template-parameter is a reference.
6051 Here, we do not care about functions, as they are invalid anyway
6052 for a parameter of type pointer-to-object. */
6054 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
6055 /* Non-type template parameters are OK. */
6057 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6058 /* Null pointer values are OK in C++11. */;
6059 else if (TREE_CODE (expr
) != ADDR_EXPR
6060 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
6064 if (complain
& tf_error
)
6065 error ("%qD is not a valid template argument "
6066 "because %qD is a variable, not the address of "
6067 "a variable", expr
, expr
);
6070 if (POINTER_TYPE_P (expr_type
))
6072 if (complain
& tf_error
)
6073 error ("%qE is not a valid template argument for %qT "
6074 "because it is not the address of a variable",
6078 /* Other values, like integer constants, might be valid
6079 non-type arguments of some other type. */
6080 return error_mark_node
;
6086 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
6087 ? TREE_OPERAND (expr
, 0) : expr
);
6090 if (complain
& tf_error
)
6091 error ("%qE is not a valid template argument of type %qT "
6092 "because %qE is not a variable", expr
, type
, decl
);
6095 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
6097 if (complain
& tf_error
)
6098 error ("%qE is not a valid template argument of type %qT "
6099 "because %qD does not have external linkage",
6103 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
6105 if (complain
& tf_error
)
6106 error ("%qE is not a valid template argument of type %qT "
6107 "because %qD has no linkage", expr
, type
, decl
);
6112 expr
= decay_conversion (expr
, complain
);
6113 if (expr
== error_mark_node
)
6114 return error_mark_node
;
6116 expr
= perform_qualification_conversions (type
, expr
);
6117 if (expr
== error_mark_node
)
6118 return error_mark_node
;
6120 /* [temp.arg.nontype]/5, bullet 3
6122 For a non-type template-parameter of type reference to object, no
6123 conversions apply. The type referred to by the reference may be more
6124 cv-qualified than the (otherwise identical) type of the
6125 template-argument. The template-parameter is bound directly to the
6126 template-argument, which must be an lvalue. */
6127 else if (TYPE_REF_OBJ_P (type
))
6129 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
6131 return error_mark_node
;
6133 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
6135 if (complain
& tf_error
)
6136 error ("%qE is not a valid template argument for type %qT "
6137 "because of conflicts in cv-qualification", expr
, type
);
6141 if (!real_lvalue_p (expr
))
6143 if (complain
& tf_error
)
6144 error ("%qE is not a valid template argument for type %qT "
6145 "because it is not an lvalue", expr
, type
);
6149 /* [temp.arg.nontype]/1
6151 A template-argument for a non-type, non-template template-parameter
6152 shall be one of: [...]
6154 -- the address of an object or function with external linkage. */
6155 if (INDIRECT_REF_P (expr
)
6156 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
6158 expr
= TREE_OPERAND (expr
, 0);
6161 if (complain
& tf_error
)
6162 error ("%q#D is not a valid template argument for type %qT "
6163 "because a reference variable does not have a constant "
6164 "address", expr
, type
);
6171 if (complain
& tf_error
)
6172 error ("%qE is not a valid template argument for type %qT "
6173 "because it is not an object with external linkage",
6178 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
6180 if (complain
& tf_error
)
6181 error ("%qE is not a valid template argument for type %qT "
6182 "because object %qD has not external linkage",
6187 expr
= build_nop (type
, build_address (expr
));
6189 /* [temp.arg.nontype]/5, bullet 4
6191 For a non-type template-parameter of type pointer to function, only
6192 the function-to-pointer conversion (_conv.func_) is applied. If the
6193 template-argument represents a set of overloaded functions (or a
6194 pointer to such), the matching function is selected from the set
6196 else if (TYPE_PTRFN_P (type
))
6198 /* If the argument is a template-id, we might not have enough
6199 context information to decay the pointer. */
6200 if (!type_unknown_p (expr_type
))
6202 expr
= decay_conversion (expr
, complain
);
6203 if (expr
== error_mark_node
)
6204 return error_mark_node
;
6207 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
6208 /* Null pointer values are OK in C++11. */
6209 return perform_qualification_conversions (type
, expr
);
6211 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6212 if (!expr
|| expr
== error_mark_node
)
6215 /* [temp.arg.nontype]/5, bullet 5
6217 For a non-type template-parameter of type reference to function, no
6218 conversions apply. If the template-argument represents a set of
6219 overloaded functions, the matching function is selected from the set
6221 else if (TYPE_REFFN_P (type
))
6223 if (TREE_CODE (expr
) == ADDR_EXPR
)
6225 if (complain
& tf_error
)
6227 error ("%qE is not a valid template argument for type %qT "
6228 "because it is a pointer", expr
, type
);
6229 inform (input_location
, "try using %qE instead",
6230 TREE_OPERAND (expr
, 0));
6235 expr
= convert_nontype_argument_function (type
, expr
, complain
);
6236 if (!expr
|| expr
== error_mark_node
)
6239 expr
= build_nop (type
, build_address (expr
));
6241 /* [temp.arg.nontype]/5, bullet 6
6243 For a non-type template-parameter of type pointer to member function,
6244 no conversions apply. If the template-argument represents a set of
6245 overloaded member functions, the matching member function is selected
6246 from the set (_over.over_). */
6247 else if (TYPE_PTRMEMFUNC_P (type
))
6249 expr
= instantiate_type (type
, expr
, tf_none
);
6250 if (expr
== error_mark_node
)
6251 return error_mark_node
;
6253 /* [temp.arg.nontype] bullet 1 says the pointer to member
6254 expression must be a pointer-to-member constant. */
6255 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6256 return error_mark_node
;
6258 /* There is no way to disable standard conversions in
6259 resolve_address_of_overloaded_function (called by
6260 instantiate_type). It is possible that the call succeeded by
6261 converting &B::I to &D::I (where B is a base of D), so we need
6262 to reject this conversion here.
6264 Actually, even if there was a way to disable standard conversions,
6265 it would still be better to reject them here so that we can
6266 provide a superior diagnostic. */
6267 if (!same_type_p (TREE_TYPE (expr
), type
))
6269 if (complain
& tf_error
)
6271 error ("%qE is not a valid template argument for type %qT "
6272 "because it is of type %qT", expr
, type
,
6274 /* If we are just one standard conversion off, explain. */
6275 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6276 inform (input_location
,
6277 "standard conversions are not allowed in this context");
6282 /* [temp.arg.nontype]/5, bullet 7
6284 For a non-type template-parameter of type pointer to data member,
6285 qualification conversions (_conv.qual_) are applied. */
6286 else if (TYPE_PTRDATAMEM_P (type
))
6288 /* [temp.arg.nontype] bullet 1 says the pointer to member
6289 expression must be a pointer-to-member constant. */
6290 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6291 return error_mark_node
;
6293 expr
= perform_qualification_conversions (type
, expr
);
6294 if (expr
== error_mark_node
)
6297 else if (NULLPTR_TYPE_P (type
))
6299 if (expr
!= nullptr_node
)
6301 if (complain
& tf_error
)
6302 error ("%qE is not a valid template argument for type %qT "
6303 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6308 /* A template non-type parameter must be one of the above. */
6312 /* Sanity check: did we actually convert the argument to the
6314 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6315 (type
, TREE_TYPE (expr
)));
6316 return convert_from_reference (expr
);
6319 /* Subroutine of coerce_template_template_parms, which returns 1 if
6320 PARM_PARM and ARG_PARM match using the rule for the template
6321 parameters of template template parameters. Both PARM and ARG are
6322 template parameters; the rest of the arguments are the same as for
6323 coerce_template_template_parms.
6326 coerce_template_template_parm (tree parm
,
6328 tsubst_flags_t complain
,
6332 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6333 || parm
== NULL_TREE
|| error_operand_p (parm
))
6336 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6339 switch (TREE_CODE (parm
))
6342 /* We encounter instantiations of templates like
6343 template <template <template <class> class> class TT>
6346 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6347 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6349 if (!coerce_template_template_parms
6350 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6356 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6357 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6358 /* Argument is a parameter pack but parameter is not. */
6363 /* The tsubst call is used to handle cases such as
6365 template <int> class C {};
6366 template <class T, template <T> class TT> class D {};
6369 i.e. the parameter list of TT depends on earlier parameters. */
6370 if (!uses_template_parms (TREE_TYPE (arg
)))
6372 tree t
= tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
);
6373 if (!uses_template_parms (t
)
6374 && !same_type_p (t
, TREE_TYPE (arg
)))
6378 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6379 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6380 /* Argument is a parameter pack but parameter is not. */
6393 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6394 template template parameters. Both PARM_PARMS and ARG_PARMS are
6395 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6398 Consider the example:
6399 template <class T> class A;
6400 template<template <class U> class TT> class B;
6402 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6403 the parameters to A, and OUTER_ARGS contains A. */
6406 coerce_template_template_parms (tree parm_parms
,
6408 tsubst_flags_t complain
,
6412 int nparms
, nargs
, i
;
6416 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6417 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6419 nparms
= TREE_VEC_LENGTH (parm_parms
);
6420 nargs
= TREE_VEC_LENGTH (arg_parms
);
6422 /* Determine whether we have a parameter pack at the end of the
6423 template template parameter's template parameter list. */
6424 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6426 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6428 if (error_operand_p (parm
))
6431 switch (TREE_CODE (parm
))
6435 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6440 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6450 && !(variadic_p
&& nargs
>= nparms
- 1))
6453 /* Check all of the template parameters except the parameter pack at
6454 the end (if any). */
6455 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6457 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6458 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6461 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6462 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6464 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6472 /* Check each of the template parameters in the template
6473 argument against the template parameter pack at the end of
6474 the template template parameter. */
6475 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6478 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6480 for (; i
< nargs
; ++i
)
6482 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6485 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6487 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6496 /* Verifies that the deduced template arguments (in TARGS) for the
6497 template template parameters (in TPARMS) represent valid bindings,
6498 by comparing the template parameter list of each template argument
6499 to the template parameter list of its corresponding template
6500 template parameter, in accordance with DR150. This
6501 routine can only be called after all template arguments have been
6502 deduced. It will return TRUE if all of the template template
6503 parameter bindings are okay, FALSE otherwise. */
6505 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6507 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6510 /* We're dealing with template parms in this process. */
6511 ++processing_template_decl
;
6513 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6515 for (i
= 0; i
< ntparms
; ++i
)
6517 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6518 tree targ
= TREE_VEC_ELT (targs
, i
);
6520 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6522 tree packed_args
= NULL_TREE
;
6525 if (ARGUMENT_PACK_P (targ
))
6527 /* Look inside the argument pack. */
6528 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6529 len
= TREE_VEC_LENGTH (packed_args
);
6532 for (idx
= 0; idx
< len
; ++idx
)
6534 tree targ_parms
= NULL_TREE
;
6537 /* Extract the next argument from the argument
6539 targ
= TREE_VEC_ELT (packed_args
, idx
);
6541 if (PACK_EXPANSION_P (targ
))
6542 /* Look at the pattern of the pack expansion. */
6543 targ
= PACK_EXPANSION_PATTERN (targ
);
6545 /* Extract the template parameters from the template
6547 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6548 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6549 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6550 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6552 /* Verify that we can coerce the template template
6553 parameters from the template argument to the template
6554 parameter. This requires an exact match. */
6556 && !coerce_template_template_parms
6557 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6572 --processing_template_decl
;
6576 /* Since type attributes aren't mangled, we need to strip them from
6577 template type arguments. */
6580 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6582 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6584 bool removed_attributes
= false;
6585 tree canon
= strip_typedefs (arg
, &removed_attributes
);
6586 if (removed_attributes
6587 && (complain
& tf_warning
))
6588 warning (0, "ignoring attributes on template argument %qT", arg
);
6592 /* Convert the indicated template ARG as necessary to match the
6593 indicated template PARM. Returns the converted ARG, or
6594 error_mark_node if the conversion was unsuccessful. Error and
6595 warning messages are issued under control of COMPLAIN. This
6596 conversion is for the Ith parameter in the parameter list. ARGS is
6597 the full set of template arguments deduced so far. */
6600 convert_template_argument (tree parm
,
6603 tsubst_flags_t complain
,
6609 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6611 if (parm
== error_mark_node
)
6612 return error_mark_node
;
6614 if (TREE_CODE (arg
) == TREE_LIST
6615 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6617 /* The template argument was the name of some
6618 member function. That's usually
6619 invalid, but static members are OK. In any
6620 case, grab the underlying fields/functions
6621 and issue an error later if required. */
6622 orig_arg
= TREE_VALUE (arg
);
6623 TREE_TYPE (arg
) = unknown_type_node
;
6628 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6629 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6630 || requires_tmpl_type
);
6632 /* When determining whether an argument pack expansion is a template,
6633 look at the pattern. */
6634 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6635 arg
= PACK_EXPANSION_PATTERN (arg
);
6637 /* Deal with an injected-class-name used as a template template arg. */
6638 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6640 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6641 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6643 if (cxx_dialect
>= cxx11
)
6644 /* OK under DR 1004. */;
6645 else if (complain
& tf_warning_or_error
)
6646 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6647 " used as template template argument", TYPE_NAME (arg
));
6648 else if (flag_pedantic_errors
)
6656 ((TREE_CODE (arg
) == TEMPLATE_DECL
6657 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6658 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6659 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6660 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6663 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6664 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6665 arg
= TYPE_STUB_DECL (arg
);
6667 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6669 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6670 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6672 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6674 if (complain
& tf_error
)
6675 error ("invalid use of destructor %qE as a type", orig_arg
);
6676 return error_mark_node
;
6679 permerror (input_location
,
6680 "to refer to a type member of a template parameter, "
6681 "use %<typename %E%>", orig_arg
);
6683 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6684 TREE_OPERAND (arg
, 1),
6690 if (is_type
!= requires_type
)
6694 if (complain
& tf_error
)
6696 error ("type/value mismatch at argument %d in template "
6697 "parameter list for %qD",
6700 inform (input_location
,
6701 " expected a constant of type %qT, got %qT",
6703 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6704 else if (requires_tmpl_type
)
6705 inform (input_location
,
6706 " expected a class template, got %qE", orig_arg
);
6708 inform (input_location
,
6709 " expected a type, got %qE", orig_arg
);
6712 return error_mark_node
;
6714 if (is_tmpl_type
^ requires_tmpl_type
)
6716 if (in_decl
&& (complain
& tf_error
))
6718 error ("type/value mismatch at argument %d in template "
6719 "parameter list for %qD",
6722 inform (input_location
,
6723 " expected a type, got %qT", DECL_NAME (arg
));
6725 inform (input_location
,
6726 " expected a class template, got %qT", orig_arg
);
6728 return error_mark_node
;
6733 if (requires_tmpl_type
)
6735 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6737 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6738 /* The number of argument required is not known yet.
6739 Just accept it for now. */
6740 val
= TREE_TYPE (arg
);
6743 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6746 /* Strip alias templates that are equivalent to another
6748 arg
= get_underlying_template (arg
);
6749 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6751 if (coerce_template_template_parms (parmparm
, argparm
,
6757 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6759 if (val
!= error_mark_node
)
6761 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6762 val
= TREE_TYPE (val
);
6763 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6764 val
= make_pack_expansion (val
);
6769 if (in_decl
&& (complain
& tf_error
))
6771 error ("type/value mismatch at argument %d in "
6772 "template parameter list for %qD",
6774 inform (input_location
,
6775 " expected a template of type %qD, got %qT",
6779 val
= error_mark_node
;
6785 /* We only form one instance of each template specialization.
6786 Therefore, if we use a non-canonical variant (i.e., a
6787 typedef), any future messages referring to the type will use
6788 the typedef, which is confusing if those future uses do not
6789 themselves also use the typedef. */
6791 val
= canonicalize_type_argument (val
, complain
);
6795 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6797 if (invalid_nontype_parm_type_p (t
, complain
))
6798 return error_mark_node
;
6800 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6802 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6806 /* Not sure if this is reachable, but it doesn't hurt
6808 error ("type mismatch in nontype parameter pack");
6809 val
= error_mark_node
;
6812 else if (!dependent_template_arg_p (orig_arg
)
6813 && !uses_template_parms (t
))
6814 /* We used to call digest_init here. However, digest_init
6815 will report errors, which we don't want when complain
6816 is zero. More importantly, digest_init will try too
6817 hard to convert things: for example, `0' should not be
6818 converted to pointer type at this point according to
6819 the standard. Accepting this is not merely an
6820 extension, since deciding whether or not these
6821 conversions can occur is part of determining which
6822 function template to call, or whether a given explicit
6823 argument specification is valid. */
6824 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6827 bool removed_attr
= false;
6828 val
= strip_typedefs_expr (orig_arg
, &removed_attr
);
6831 if (val
== NULL_TREE
)
6832 val
= error_mark_node
;
6833 else if (val
== error_mark_node
&& (complain
& tf_error
))
6834 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6836 if (TREE_CODE (val
) == SCOPE_REF
)
6838 /* Strip typedefs from the SCOPE_REF. */
6839 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6840 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6842 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6843 QUALIFIED_NAME_IS_TEMPLATE (val
));
6850 /* Coerces the remaining template arguments in INNER_ARGS (from
6851 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6852 Returns the coerced argument pack. PARM_IDX is the position of this
6853 parameter in the template parameter list. ARGS is the original
6854 template argument list. */
6856 coerce_template_parameter_pack (tree parms
,
6864 tsubst_flags_t complain
)
6866 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6867 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6870 tree packed_parms
= NULL_TREE
;
6872 if (arg_idx
> nargs
)
6875 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6877 /* When the template parameter is a non-type template parameter pack
6878 or template template parameter pack whose type or template
6879 parameters use parameter packs, we know exactly how many arguments
6880 we are looking for. Build a vector of the instantiated decls for
6881 these template parameters in PACKED_PARMS. */
6882 /* We can't use make_pack_expansion here because it would interpret a
6883 _DECL as a use rather than a declaration. */
6884 tree decl
= TREE_VALUE (parm
);
6885 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6886 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6887 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6888 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6890 TREE_VEC_LENGTH (args
)--;
6891 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6892 TREE_VEC_LENGTH (args
)++;
6894 if (packed_parms
== error_mark_node
)
6895 return error_mark_node
;
6897 /* If we're doing a partial instantiation of a member template,
6898 verify that all of the types used for the non-type
6899 template parameter pack are, in fact, valid for non-type
6900 template parameters. */
6902 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6904 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6905 for (j
= 0; j
< len
; ++j
)
6907 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6908 if (invalid_nontype_parm_type_p (t
, complain
))
6909 return error_mark_node
;
6911 /* We don't know how many args we have yet, just
6912 use the unconverted ones for now. */
6916 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6919 packed_args
= make_tree_vec (nargs
- arg_idx
);
6921 /* Convert the remaining arguments, which will be a part of the
6922 parameter pack "parm". */
6923 for (; arg_idx
< nargs
; ++arg_idx
)
6925 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6926 tree actual_parm
= TREE_VALUE (parm
);
6927 int pack_idx
= arg_idx
- parm_idx
;
6931 /* Once we've packed as many args as we have types, stop. */
6932 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6934 else if (PACK_EXPANSION_P (arg
))
6935 /* We don't know how many args we have yet, just
6936 use the unconverted ones for now. */
6939 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6942 if (arg
== error_mark_node
)
6944 if (complain
& tf_error
)
6945 error ("template argument %d is invalid", arg_idx
+ 1);
6948 arg
= convert_template_argument (actual_parm
,
6949 arg
, new_args
, complain
, parm_idx
,
6951 if (arg
== error_mark_node
)
6953 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6956 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6957 && TREE_VEC_LENGTH (packed_args
) > 0)
6959 if (complain
& tf_error
)
6960 error ("wrong number of template arguments (%d, should be %d)",
6961 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6962 return error_mark_node
;
6965 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6966 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6967 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6970 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6971 TREE_TYPE (argument_pack
)
6972 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6973 TREE_CONSTANT (argument_pack
) = 1;
6976 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6977 #ifdef ENABLE_CHECKING
6978 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6979 TREE_VEC_LENGTH (packed_args
));
6981 return argument_pack
;
6984 /* Returns the number of pack expansions in the template argument vector
6988 pack_expansion_args_count (tree args
)
6993 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6995 tree elt
= TREE_VEC_ELT (args
, i
);
6996 if (elt
&& PACK_EXPANSION_P (elt
))
7002 /* Convert all template arguments to their appropriate types, and
7003 return a vector containing the innermost resulting template
7004 arguments. If any error occurs, return error_mark_node. Error and
7005 warning messages are issued under control of COMPLAIN.
7007 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
7008 for arguments not specified in ARGS. Otherwise, if
7009 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
7010 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
7011 USE_DEFAULT_ARGS is false, then all arguments must be specified in
7015 coerce_template_parms (tree parms
,
7018 tsubst_flags_t complain
,
7019 bool require_all_args
,
7020 bool use_default_args
)
7022 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
7023 tree orig_inner_args
;
7026 tree new_inner_args
;
7027 int saved_unevaluated_operand
;
7028 int saved_inhibit_evaluation_warnings
;
7030 /* When used as a boolean value, indicates whether this is a
7031 variadic template parameter list. Since it's an int, we can also
7032 subtract it from nparms to get the number of non-variadic
7035 int variadic_args_p
= 0;
7036 int post_variadic_parms
= 0;
7038 /* Likewise for parameters with default arguments. */
7041 if (args
== error_mark_node
)
7042 return error_mark_node
;
7044 nparms
= TREE_VEC_LENGTH (parms
);
7046 /* Determine if there are any parameter packs or default arguments. */
7047 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
7049 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
7051 ++post_variadic_parms
;
7052 if (template_parameter_pack_p (TREE_VALUE (parm
)))
7054 if (TREE_PURPOSE (parm
))
7058 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
7059 /* If there are no parameters that follow a parameter pack, we need to
7060 expand any argument packs so that we can deduce a parameter pack from
7061 some non-packed args followed by an argument pack, as in variadic85.C.
7062 If there are such parameters, we need to leave argument packs intact
7063 so the arguments are assigned properly. This can happen when dealing
7064 with a nested class inside a partial specialization of a class
7065 template, as in variadic92.C, or when deducing a template parameter pack
7066 from a sub-declarator, as in variadic114.C. */
7067 if (!post_variadic_parms
)
7068 inner_args
= expand_template_argument_pack (inner_args
);
7070 /* Count any pack expansion args. */
7071 variadic_args_p
= pack_expansion_args_count (inner_args
);
7073 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
7074 if ((nargs
> nparms
&& !variadic_p
)
7075 || (nargs
< nparms
- variadic_p
7078 && (!use_default_args
7079 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
7080 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
7082 if (complain
& tf_error
)
7084 if (variadic_p
|| default_p
)
7086 nparms
-= variadic_p
+ default_p
;
7087 error ("wrong number of template arguments "
7088 "(%d, should be at least %d)", nargs
, nparms
);
7091 error ("wrong number of template arguments "
7092 "(%d, should be %d)", nargs
, nparms
);
7095 inform (input_location
, "provided for %q+D", in_decl
);
7098 return error_mark_node
;
7100 /* We can't pass a pack expansion to a non-pack parameter of an alias
7101 template (DR 1430). */
7102 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
7104 && nargs
- variadic_args_p
< nparms
- variadic_p
)
7106 if (complain
& tf_error
)
7108 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
7110 tree arg
= TREE_VEC_ELT (inner_args
, i
);
7111 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
7113 if (PACK_EXPANSION_P (arg
)
7114 && !template_parameter_pack_p (parm
))
7116 error ("pack expansion argument for non-pack parameter "
7117 "%qD of alias template %qD", parm
, in_decl
);
7118 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
7125 return error_mark_node
;
7128 /* We need to evaluate the template arguments, even though this
7129 template-id may be nested within a "sizeof". */
7130 saved_unevaluated_operand
= cp_unevaluated_operand
;
7131 cp_unevaluated_operand
= 0;
7132 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
7133 c_inhibit_evaluation_warnings
= 0;
7134 new_inner_args
= make_tree_vec (nparms
);
7135 new_args
= add_outermost_template_args (args
, new_inner_args
);
7136 int pack_adjust
= 0;
7137 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
7142 /* Get the Ith template parameter. */
7143 parm
= TREE_VEC_ELT (parms
, parm_idx
);
7145 if (parm
== error_mark_node
)
7147 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
7151 /* Calculate the next argument. */
7152 if (arg_idx
< nargs
)
7153 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
7157 if (template_parameter_pack_p (TREE_VALUE (parm
))
7158 && !(arg
&& ARGUMENT_PACK_P (arg
)))
7160 /* Some arguments will be placed in the
7161 template parameter pack PARM. */
7162 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
7163 inner_args
, arg_idx
,
7167 if (arg
== NULL_TREE
)
7169 /* We don't know how many args we have yet, just use the
7170 unconverted (and still packed) ones for now. */
7171 new_inner_args
= orig_inner_args
;
7176 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
7178 /* Store this argument. */
7179 if (arg
== error_mark_node
)
7182 /* We are done with all of the arguments. */
7187 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
7188 arg_idx
+= pack_adjust
;
7195 if (PACK_EXPANSION_P (arg
))
7197 /* "If every valid specialization of a variadic template
7198 requires an empty template parameter pack, the template is
7199 ill-formed, no diagnostic required." So check that the
7200 pattern works with this parameter. */
7201 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
7202 tree conv
= convert_template_argument (TREE_VALUE (parm
),
7206 if (conv
== error_mark_node
)
7208 inform (input_location
, "so any instantiation with a "
7209 "non-empty parameter pack would be ill-formed");
7212 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
7213 /* Recover from missing typename. */
7214 TREE_VEC_ELT (inner_args
, arg_idx
)
7215 = make_pack_expansion (conv
);
7217 /* We don't know how many args we have yet, just
7218 use the unconverted ones for now. */
7219 new_inner_args
= inner_args
;
7224 else if (require_all_args
)
7226 /* There must be a default arg in this case. */
7227 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
7229 /* The position of the first default template argument,
7230 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
7232 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7233 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7234 arg_idx
- pack_adjust
);
7239 if (arg
== error_mark_node
)
7241 if (complain
& tf_error
)
7242 error ("template argument %d is invalid", arg_idx
+ 1);
7245 /* This only occurs if there was an error in the template
7246 parameter list itself (which we would already have
7247 reported) that we are trying to recover from, e.g., a class
7248 template with a parameter list such as
7249 template<typename..., typename>. */
7252 arg
= convert_template_argument (TREE_VALUE (parm
),
7253 arg
, new_args
, complain
,
7256 if (arg
== error_mark_node
)
7258 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7260 cp_unevaluated_operand
= saved_unevaluated_operand
;
7261 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7263 if (variadic_p
&& arg_idx
< nargs
)
7265 if (complain
& tf_error
)
7267 error ("wrong number of template arguments "
7268 "(%d, should be %d)", nargs
, arg_idx
);
7270 error ("provided for %q+D", in_decl
);
7272 return error_mark_node
;
7276 return error_mark_node
;
7278 #ifdef ENABLE_CHECKING
7279 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7280 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7281 TREE_VEC_LENGTH (new_inner_args
));
7284 return new_inner_args
;
7287 /* Like coerce_template_parms. If PARMS represents all template
7288 parameters levels, this function returns a vector of vectors
7289 representing all the resulting argument levels. Note that in this
7290 case, only the innermost arguments are coerced because the
7291 outermost ones are supposed to have been coerced already.
7293 Otherwise, if PARMS represents only (the innermost) vector of
7294 parameters, this function returns a vector containing just the
7295 innermost resulting arguments. */
7298 coerce_innermost_template_parms (tree parms
,
7301 tsubst_flags_t complain
,
7302 bool require_all_args
,
7303 bool use_default_args
)
7305 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7306 int args_depth
= TMPL_ARGS_DEPTH (args
);
7309 if (parms_depth
> 1)
7311 coerced_args
= make_tree_vec (parms_depth
);
7315 for (level
= parms
, cur_depth
= parms_depth
;
7316 parms_depth
> 0 && level
!= NULL_TREE
;
7317 level
= TREE_CHAIN (level
), --cur_depth
)
7320 if (cur_depth
== args_depth
)
7321 l
= coerce_template_parms (TREE_VALUE (level
),
7322 args
, in_decl
, complain
,
7326 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7328 if (l
== error_mark_node
)
7329 return error_mark_node
;
7331 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7335 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7336 args
, in_decl
, complain
,
7339 return coerced_args
;
7342 /* Returns 1 if template args OT and NT are equivalent. */
7345 template_args_equal (tree ot
, tree nt
)
7349 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7352 if (TREE_CODE (nt
) == TREE_VEC
)
7353 /* For member templates */
7354 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7355 else if (PACK_EXPANSION_P (ot
))
7356 return (PACK_EXPANSION_P (nt
)
7357 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7358 PACK_EXPANSION_PATTERN (nt
))
7359 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7360 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7361 else if (ARGUMENT_PACK_P (ot
))
7366 if (!ARGUMENT_PACK_P (nt
))
7369 opack
= ARGUMENT_PACK_ARGS (ot
);
7370 npack
= ARGUMENT_PACK_ARGS (nt
);
7371 len
= TREE_VEC_LENGTH (opack
);
7372 if (TREE_VEC_LENGTH (npack
) != len
)
7374 for (i
= 0; i
< len
; ++i
)
7375 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7376 TREE_VEC_ELT (npack
, i
)))
7380 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7382 /* We get here probably because we are in the middle of substituting
7383 into the pattern of a pack expansion. In that case the
7384 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7385 interested in. So we want to use the initial pack argument for
7387 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7388 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7389 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7390 return template_args_equal (ot
, nt
);
7392 else if (TYPE_P (nt
))
7396 /* Don't treat an alias template specialization with dependent
7397 arguments as equivalent to its underlying type when used as a
7398 template argument; we need them to be distinct so that we
7399 substitute into the specialization arguments at instantiation
7400 time. And aliases can't be equivalent without being ==, so
7401 we don't need to look any deeper. */
7402 if (TYPE_ALIAS_P (nt
) || TYPE_ALIAS_P (ot
))
7405 return same_type_p (ot
, nt
);
7407 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7411 /* Try to treat a template non-type argument that has been converted
7412 to the parameter type as equivalent to one that hasn't yet. */
7413 for (enum tree_code code1
= TREE_CODE (ot
);
7414 CONVERT_EXPR_CODE_P (code1
)
7415 || code1
== NON_LVALUE_EXPR
;
7416 code1
= TREE_CODE (ot
))
7417 ot
= TREE_OPERAND (ot
, 0);
7418 for (enum tree_code code2
= TREE_CODE (nt
);
7419 CONVERT_EXPR_CODE_P (code2
)
7420 || code2
== NON_LVALUE_EXPR
;
7421 code2
= TREE_CODE (nt
))
7422 nt
= TREE_OPERAND (nt
, 0);
7424 return cp_tree_equal (ot
, nt
);
7428 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7429 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7430 NEWARG_PTR with the offending arguments if they are non-NULL. */
7433 comp_template_args_with_info (tree oldargs
, tree newargs
,
7434 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7438 if (oldargs
== newargs
)
7441 if (!oldargs
|| !newargs
)
7444 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7447 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7449 tree nt
= TREE_VEC_ELT (newargs
, i
);
7450 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7452 if (! template_args_equal (ot
, nt
))
7454 if (oldarg_ptr
!= NULL
)
7456 if (newarg_ptr
!= NULL
)
7464 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7465 of template arguments. Returns 0 otherwise. */
7468 comp_template_args (tree oldargs
, tree newargs
)
7470 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7474 add_pending_template (tree d
)
7476 tree ti
= (TYPE_P (d
)
7477 ? CLASSTYPE_TEMPLATE_INFO (d
)
7478 : DECL_TEMPLATE_INFO (d
));
7479 struct pending_template
*pt
;
7482 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7485 /* We are called both from instantiate_decl, where we've already had a
7486 tinst_level pushed, and instantiate_template, where we haven't.
7488 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7491 push_tinst_level (d
);
7493 pt
= ggc_alloc
<pending_template
> ();
7495 pt
->tinst
= current_tinst_level
;
7496 if (last_pending_template
)
7497 last_pending_template
->next
= pt
;
7499 pending_templates
= pt
;
7501 last_pending_template
= pt
;
7503 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7510 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7511 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7512 documentation for TEMPLATE_ID_EXPR. */
7515 lookup_template_function (tree fns
, tree arglist
)
7519 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7520 return error_mark_node
;
7522 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7524 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7526 error ("%q#D is not a function template", fns
);
7527 return error_mark_node
;
7530 if (BASELINK_P (fns
))
7532 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7534 BASELINK_FUNCTIONS (fns
),
7539 type
= TREE_TYPE (fns
);
7540 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7541 type
= unknown_type_node
;
7543 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7546 /* Within the scope of a template class S<T>, the name S gets bound
7547 (in build_self_reference) to a TYPE_DECL for the class, not a
7548 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7549 or one of its enclosing classes, and that type is a template,
7550 return the associated TEMPLATE_DECL. Otherwise, the original
7553 Also handle the case when DECL is a TREE_LIST of ambiguous
7554 injected-class-names from different bases. */
7557 maybe_get_template_decl_from_type_decl (tree decl
)
7559 if (decl
== NULL_TREE
)
7562 /* DR 176: A lookup that finds an injected-class-name (10.2
7563 [class.member.lookup]) can result in an ambiguity in certain cases
7564 (for example, if it is found in more than one base class). If all of
7565 the injected-class-names that are found refer to specializations of
7566 the same class template, and if the name is followed by a
7567 template-argument-list, the reference refers to the class template
7568 itself and not a specialization thereof, and is not ambiguous. */
7569 if (TREE_CODE (decl
) == TREE_LIST
)
7571 tree t
, tmpl
= NULL_TREE
;
7572 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7574 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7577 else if (tmpl
!= elt
)
7580 if (tmpl
&& t
== NULL_TREE
)
7586 return (decl
!= NULL_TREE
7587 && DECL_SELF_REFERENCE_P (decl
)
7588 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7589 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7592 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7593 parameters, find the desired type.
7595 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7597 IN_DECL, if non-NULL, is the template declaration we are trying to
7600 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7601 the class we are looking up.
7603 Issue error and warning messages under control of COMPLAIN.
7605 If the template class is really a local class in a template
7606 function, then the FUNCTION_CONTEXT is the function in which it is
7609 ??? Note that this function is currently called *twice* for each
7610 template-id: the first time from the parser, while creating the
7611 incomplete type (finish_template_type), and the second type during the
7612 real instantiation (instantiate_template_class). This is surely something
7613 that we want to avoid. It also causes some problems with argument
7614 coercion (see convert_nontype_argument for more information on this). */
7617 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7618 int entering_scope
, tsubst_flags_t complain
)
7620 tree templ
= NULL_TREE
, parmlist
;
7627 if (identifier_p (d1
))
7629 tree value
= innermost_non_namespace_value (d1
);
7630 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7635 push_decl_namespace (context
);
7636 templ
= lookup_name (d1
);
7637 templ
= maybe_get_template_decl_from_type_decl (templ
);
7639 pop_decl_namespace ();
7642 context
= DECL_CONTEXT (templ
);
7644 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7646 tree type
= TREE_TYPE (d1
);
7648 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7649 an implicit typename for the second A. Deal with it. */
7650 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7651 type
= TREE_TYPE (type
);
7653 if (CLASSTYPE_TEMPLATE_INFO (type
))
7655 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7656 d1
= DECL_NAME (templ
);
7659 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7660 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7662 templ
= TYPE_TI_TEMPLATE (d1
);
7663 d1
= DECL_NAME (templ
);
7665 else if (DECL_TYPE_TEMPLATE_P (d1
))
7668 d1
= DECL_NAME (templ
);
7669 context
= DECL_CONTEXT (templ
);
7671 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7674 d1
= DECL_NAME (templ
);
7677 /* Issue an error message if we didn't find a template. */
7680 if (complain
& tf_error
)
7681 error ("%qT is not a template", d1
);
7682 return error_mark_node
;
7685 if (TREE_CODE (templ
) != TEMPLATE_DECL
7686 /* Make sure it's a user visible template, if it was named by
7688 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7689 && !PRIMARY_TEMPLATE_P (templ
)))
7691 if (complain
& tf_error
)
7693 error ("non-template type %qT used as a template", d1
);
7695 error ("for template declaration %q+D", in_decl
);
7697 return error_mark_node
;
7700 complain
&= ~tf_user
;
7702 /* An alias that just changes the name of a template is equivalent to the
7703 other template, so if any of the arguments are pack expansions, strip
7704 the alias to avoid problems with a pack expansion passed to a non-pack
7705 alias template parameter (DR 1430). */
7706 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7707 templ
= get_underlying_template (templ
);
7709 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7711 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7712 template arguments */
7718 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7720 /* Consider an example where a template template parameter declared as
7722 template <class T, class U = std::allocator<T> > class TT
7724 The template parameter level of T and U are one level larger than
7725 of TT. To proper process the default argument of U, say when an
7726 instantiation `TT<int>' is seen, we need to build the full
7727 arguments containing {int} as the innermost level. Outer levels,
7728 available when not appearing as default template argument, can be
7729 obtained from the arguments of the enclosing template.
7731 Suppose that TT is later substituted with std::vector. The above
7732 instantiation is `TT<int, std::allocator<T> >' with TT at
7733 level 1, and T at level 2, while the template arguments at level 1
7734 becomes {std::vector} and the inner level 2 is {int}. */
7736 outer
= DECL_CONTEXT (templ
);
7738 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7739 else if (current_template_parms
)
7740 /* This is an argument of the current template, so we haven't set
7741 DECL_CONTEXT yet. */
7742 outer
= current_template_args ();
7745 arglist
= add_to_template_args (outer
, arglist
);
7747 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7749 /*require_all_args=*/true,
7750 /*use_default_args=*/true);
7751 if (arglist2
== error_mark_node
7752 || (!uses_template_parms (arglist2
)
7753 && check_instantiated_args (templ
, arglist2
, complain
)))
7754 return error_mark_node
;
7756 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7761 tree template_type
= TREE_TYPE (templ
);
7764 tree found
= NULL_TREE
;
7767 int is_dependent_type
;
7768 int use_partial_inst_tmpl
= false;
7770 if (template_type
== error_mark_node
)
7771 /* An error occurred while building the template TEMPL, and a
7772 diagnostic has most certainly been emitted for that
7773 already. Let's propagate that error. */
7774 return error_mark_node
;
7776 gen_tmpl
= most_general_template (templ
);
7777 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7778 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7779 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7781 if (arg_depth
== 1 && parm_depth
> 1)
7783 /* We've been given an incomplete set of template arguments.
7786 template <class T> struct S1 {
7787 template <class U> struct S2 {};
7788 template <class U> struct S2<U*> {};
7791 we will be called with an ARGLIST of `U*', but the
7792 TEMPLATE will be `template <class T> template
7793 <class U> struct S1<T>::S2'. We must fill in the missing
7796 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7798 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7801 /* Now we should have enough arguments. */
7802 gcc_assert (parm_depth
== arg_depth
);
7804 /* From here on, we're only interested in the most general
7807 /* Calculate the BOUND_ARGS. These will be the args that are
7808 actually tsubst'd into the definition to create the
7810 arglist
= coerce_innermost_template_parms (parmlist
, arglist
, gen_tmpl
,
7812 /*require_all_args=*/true,
7813 /*use_default_args=*/true);
7815 if (arglist
== error_mark_node
)
7816 /* We were unable to bind the arguments. */
7817 return error_mark_node
;
7819 /* In the scope of a template class, explicit references to the
7820 template class refer to the type of the template, not any
7821 instantiation of it. For example, in:
7823 template <class T> class C { void f(C<T>); }
7825 the `C<T>' is just the same as `C'. Outside of the
7826 class, however, such a reference is an instantiation. */
7828 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7829 || currently_open_class (template_type
))
7830 /* comp_template_args is expensive, check it last. */
7831 && comp_template_args (TYPE_TI_ARGS (template_type
),
7833 return template_type
;
7835 /* If we already have this specialization, return it. */
7836 elt
.tmpl
= gen_tmpl
;
7838 hash
= spec_hasher::hash (&elt
);
7839 entry
= type_specializations
->find_with_hash (&elt
, hash
);
7844 is_dependent_type
= uses_template_parms (arglist
);
7846 /* If the deduced arguments are invalid, then the binding
7848 if (!is_dependent_type
7849 && check_instantiated_args (gen_tmpl
,
7850 INNERMOST_TEMPLATE_ARGS (arglist
),
7852 return error_mark_node
;
7854 if (!is_dependent_type
7855 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7856 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7857 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7859 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7860 DECL_NAME (gen_tmpl
),
7861 /*tag_scope=*/ts_global
);
7865 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7867 if (context
== error_mark_node
)
7868 return error_mark_node
;
7871 context
= global_namespace
;
7873 /* Create the type. */
7874 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7876 /* The user referred to a specialization of an alias
7877 template represented by GEN_TMPL.
7879 [temp.alias]/2 says:
7881 When a template-id refers to the specialization of an
7882 alias template, it is equivalent to the associated
7883 type obtained by substitution of its
7884 template-arguments for the template-parameters in the
7885 type-id of the alias template. */
7887 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7888 /* Note that the call above (by indirectly calling
7889 register_specialization in tsubst_decl) registers the
7890 TYPE_DECL representing the specialization of the alias
7891 template. So next time someone substitutes ARGLIST for
7892 the template parms into the alias template (GEN_TMPL),
7893 she'll get that TYPE_DECL back. */
7895 if (t
== error_mark_node
)
7898 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7900 if (!is_dependent_type
)
7902 set_current_access_from_decl (TYPE_NAME (template_type
));
7903 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7904 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7905 arglist
, complain
, in_decl
),
7906 SCOPED_ENUM_P (template_type
), NULL
);
7908 if (t
== error_mark_node
)
7913 /* We don't want to call start_enum for this type, since
7914 the values for the enumeration constants may involve
7915 template parameters. And, no one should be interested
7916 in the enumeration constants for such a type. */
7917 t
= cxx_make_type (ENUMERAL_TYPE
);
7918 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7920 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7921 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7922 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7924 else if (CLASS_TYPE_P (template_type
))
7926 t
= make_class_type (TREE_CODE (template_type
));
7927 CLASSTYPE_DECLARED_CLASS (t
)
7928 = CLASSTYPE_DECLARED_CLASS (template_type
);
7929 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7930 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7932 /* A local class. Make sure the decl gets registered properly. */
7933 if (context
== current_function_decl
)
7934 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7936 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7937 /* This instantiation is another name for the primary
7938 template type. Set the TYPE_CANONICAL field
7940 TYPE_CANONICAL (t
) = template_type
;
7941 else if (any_template_arguments_need_structural_equality_p (arglist
))
7942 /* Some of the template arguments require structural
7943 equality testing, so this template class requires
7944 structural equality testing. */
7945 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7950 /* If we called start_enum or pushtag above, this information
7951 will already be set up. */
7954 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7956 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7957 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7958 DECL_SOURCE_LOCATION (type_decl
)
7959 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7962 type_decl
= TYPE_NAME (t
);
7964 if (CLASS_TYPE_P (template_type
))
7966 TREE_PRIVATE (type_decl
)
7967 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7968 TREE_PROTECTED (type_decl
)
7969 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7970 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7972 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7973 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7977 if (OVERLOAD_TYPE_P (t
)
7978 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7980 static const char *tags
[] = {"abi_tag", "may_alias"};
7982 for (unsigned ix
= 0; ix
!= 2; ix
++)
7985 = lookup_attribute (tags
[ix
], TYPE_ATTRIBUTES (template_type
));
7989 else if (!TREE_CHAIN (attributes
) && !TYPE_ATTRIBUTES (t
))
7990 TYPE_ATTRIBUTES (t
) = attributes
;
7993 = tree_cons (TREE_PURPOSE (attributes
),
7994 TREE_VALUE (attributes
),
7995 TYPE_ATTRIBUTES (t
));
7999 /* Let's consider the explicit specialization of a member
8000 of a class template specialization that is implicitly instantiated,
8005 template<class U> struct M {}; //#0
8010 struct S<int>::M<char> //#1
8014 [temp.expl.spec]/4 says this is valid.
8016 In this case, when we write:
8019 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
8022 When we encounter #1, we want to store the partial instantiation
8023 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
8025 For all cases other than this "explicit specialization of member of a
8026 class template", we just want to store the most general template into
8027 the CLASSTYPE_TI_TEMPLATE of M.
8029 This case of "explicit specialization of member of a class template"
8031 1/ the enclosing class is an instantiation of, and therefore not
8032 the same as, the context of the most general template, and
8033 2/ we aren't looking at the partial instantiation itself, i.e.
8034 the innermost arguments are not the same as the innermost parms of
8035 the most general template.
8037 So it's only when 1/ and 2/ happens that we want to use the partial
8038 instantiation of the member template in lieu of its most general
8041 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
8042 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
8043 /* the enclosing class must be an instantiation... */
8044 && CLASS_TYPE_P (context
)
8045 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
8047 tree partial_inst_args
;
8048 TREE_VEC_LENGTH (arglist
)--;
8049 ++processing_template_decl
;
8051 tsubst (INNERMOST_TEMPLATE_ARGS
8052 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
8053 arglist
, complain
, NULL_TREE
);
8054 --processing_template_decl
;
8055 TREE_VEC_LENGTH (arglist
)++;
8056 use_partial_inst_tmpl
=
8057 /*...and we must not be looking at the partial instantiation
8059 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
8063 if (!use_partial_inst_tmpl
)
8064 /* This case is easy; there are no member templates involved. */
8068 /* This is a full instantiation of a member template. Find
8069 the partial instantiation of which this is an instance. */
8071 /* Temporarily reduce by one the number of levels in the ARGLIST
8072 so as to avoid comparing the last set of arguments. */
8073 TREE_VEC_LENGTH (arglist
)--;
8074 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
8075 TREE_VEC_LENGTH (arglist
)++;
8076 /* FOUND is either a proper class type, or an alias
8077 template specialization. In the later case, it's a
8078 TYPE_DECL, resulting from the substituting of arguments
8079 for parameters in the TYPE_DECL of the alias template
8080 done earlier. So be careful while getting the template
8082 found
= TREE_CODE (found
) == TYPE_DECL
8083 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
8084 : CLASSTYPE_TI_TEMPLATE (found
);
8087 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
8090 slot
= type_specializations
->find_slot_with_hash (&elt
, hash
, INSERT
);
8091 entry
= ggc_alloc
<spec_entry
> ();
8095 /* Note this use of the partial instantiation so we can check it
8096 later in maybe_process_partial_specialization. */
8097 DECL_TEMPLATE_INSTANTIATIONS (found
)
8098 = tree_cons (arglist
, t
,
8099 DECL_TEMPLATE_INSTANTIATIONS (found
));
8101 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
8102 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
8103 /* Now that the type has been registered on the instantiations
8104 list, we set up the enumerators. Because the enumeration
8105 constants may involve the enumeration type itself, we make
8106 sure to register the type first, and then create the
8107 constants. That way, doing tsubst_expr for the enumeration
8108 constants won't result in recursive calls here; we'll find
8109 the instantiation and exit above. */
8110 tsubst_enum (template_type
, t
, arglist
);
8112 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
8113 /* If the type makes use of template parameters, the
8114 code that generates debugging information will crash. */
8115 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
8117 /* Possibly limit visibility based on template args. */
8118 TREE_PUBLIC (type_decl
) = 1;
8119 determine_visibility (type_decl
);
8121 inherit_targ_abi_tags (t
);
8127 /* Wrapper for lookup_template_class_1. */
8130 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
8131 int entering_scope
, tsubst_flags_t complain
)
8134 timevar_push (TV_TEMPLATE_INST
);
8135 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
8136 entering_scope
, complain
);
8137 timevar_pop (TV_TEMPLATE_INST
);
8141 /* Return a TEMPLATE_ID_EXPR for the given variable template and ARGLIST.
8142 The type of the expression is the unknown_type_node since the
8143 template-id could refer to an explicit or partial specialization. */
8146 lookup_template_variable (tree templ
, tree arglist
)
8148 tree type
= unknown_type_node
;
8149 return build2 (TEMPLATE_ID_EXPR
, type
, templ
, arglist
);
8152 /* Instantiate a variable declaration from a TEMPLATE_ID_EXPR for use. */
8155 finish_template_variable (tree var
)
8157 tree templ
= TREE_OPERAND (var
, 0);
8159 tree arglist
= TREE_OPERAND (var
, 1);
8160 tree tmpl_args
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (templ
));
8161 arglist
= add_outermost_template_args (tmpl_args
, arglist
);
8163 tree parms
= DECL_TEMPLATE_PARMS (templ
);
8164 tsubst_flags_t complain
= tf_warning_or_error
;
8165 arglist
= coerce_innermost_template_parms (parms
, arglist
, templ
, complain
,
8167 /*use_default*/true);
8169 return instantiate_template (templ
, arglist
, complain
);
8176 /* True when we should also visit template parameters that occur in
8177 non-deduced contexts. */
8178 bool include_nondeduced_p
;
8179 hash_set
<tree
> *visited
;
8182 /* Called from for_each_template_parm via walk_tree. */
8185 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
8188 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
8189 tree_fn_t fn
= pfd
->fn
;
8190 void *data
= pfd
->data
;
8193 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
8194 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
8195 pfd
->include_nondeduced_p
))
8196 return error_mark_node
;
8198 switch (TREE_CODE (t
))
8201 if (TYPE_PTRMEMFUNC_P (t
))
8207 if (!TYPE_TEMPLATE_INFO (t
))
8209 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
8210 fn
, data
, pfd
->visited
,
8211 pfd
->include_nondeduced_p
))
8212 return error_mark_node
;
8216 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
8217 fn
, data
, pfd
->visited
,
8218 pfd
->include_nondeduced_p
)
8219 || for_each_template_parm (TYPE_MAX_VALUE (t
),
8220 fn
, data
, pfd
->visited
,
8221 pfd
->include_nondeduced_p
))
8222 return error_mark_node
;
8226 /* Since we're not going to walk subtrees, we have to do this
8228 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
8229 pfd
->visited
, pfd
->include_nondeduced_p
))
8230 return error_mark_node
;
8234 /* Check the return type. */
8235 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8236 pfd
->include_nondeduced_p
))
8237 return error_mark_node
;
8239 /* Check the parameter types. Since default arguments are not
8240 instantiated until they are needed, the TYPE_ARG_TYPES may
8241 contain expressions that involve template parameters. But,
8242 no-one should be looking at them yet. And, once they're
8243 instantiated, they don't contain template parameters, so
8244 there's no point in looking at them then, either. */
8248 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
8249 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
8250 pfd
->visited
, pfd
->include_nondeduced_p
))
8251 return error_mark_node
;
8253 /* Since we've already handled the TYPE_ARG_TYPES, we don't
8254 want walk_tree walking into them itself. */
8260 case UNDERLYING_TYPE
:
8261 if (pfd
->include_nondeduced_p
8262 && for_each_template_parm (TYPE_VALUES_RAW (t
), fn
, data
,
8264 pfd
->include_nondeduced_p
))
8265 return error_mark_node
;
8270 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
8271 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
8272 pfd
->visited
, pfd
->include_nondeduced_p
))
8273 return error_mark_node
;
8278 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8279 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8280 pfd
->visited
, pfd
->include_nondeduced_p
))
8281 return error_mark_node
;
8282 if (DECL_CONTEXT (t
)
8283 && pfd
->include_nondeduced_p
8284 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8285 pfd
->visited
, pfd
->include_nondeduced_p
))
8286 return error_mark_node
;
8289 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8290 /* Record template parameters such as `T' inside `TT<T>'. */
8291 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8292 pfd
->include_nondeduced_p
))
8293 return error_mark_node
;
8296 case TEMPLATE_TEMPLATE_PARM
:
8297 case TEMPLATE_TYPE_PARM
:
8298 case TEMPLATE_PARM_INDEX
:
8299 if (fn
&& (*fn
)(t
, data
))
8300 return error_mark_node
;
8302 return error_mark_node
;
8306 /* A template template parameter is encountered. */
8307 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8308 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8309 pfd
->include_nondeduced_p
))
8310 return error_mark_node
;
8312 /* Already substituted template template parameter */
8318 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8320 pfd
->include_nondeduced_p
))
8321 return error_mark_node
;
8325 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8326 && pfd
->include_nondeduced_p
8327 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8328 (TREE_TYPE (t
)), fn
, data
,
8329 pfd
->visited
, pfd
->include_nondeduced_p
))
8330 return error_mark_node
;
8335 /* If there's no type, then this thing must be some expression
8336 involving template parameters. */
8337 if (!fn
&& !TREE_TYPE (t
))
8338 return error_mark_node
;
8343 case IMPLICIT_CONV_EXPR
:
8344 case REINTERPRET_CAST_EXPR
:
8345 case CONST_CAST_EXPR
:
8346 case STATIC_CAST_EXPR
:
8347 case DYNAMIC_CAST_EXPR
:
8351 case PSEUDO_DTOR_EXPR
:
8353 return error_mark_node
;
8360 /* We didn't find any template parameters we liked. */
8364 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8365 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8366 call FN with the parameter and the DATA.
8367 If FN returns nonzero, the iteration is terminated, and
8368 for_each_template_parm returns 1. Otherwise, the iteration
8369 continues. If FN never returns a nonzero value, the value
8370 returned by for_each_template_parm is 0. If FN is NULL, it is
8371 considered to be the function which always returns 1.
8373 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8374 parameters that occur in non-deduced contexts. When false, only
8375 visits those template parameters that can be deduced. */
8378 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8379 hash_set
<tree
> *visited
,
8380 bool include_nondeduced_p
)
8382 struct pair_fn_data pfd
;
8388 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8390 /* Walk the tree. (Conceptually, we would like to walk without
8391 duplicates, but for_each_template_parm_r recursively calls
8392 for_each_template_parm, so we would need to reorganize a fair
8393 bit to use walk_tree_without_duplicates, so we keep our own
8396 pfd
.visited
= visited
;
8398 pfd
.visited
= new hash_set
<tree
>;
8399 result
= cp_walk_tree (&t
,
8400 for_each_template_parm_r
,
8402 pfd
.visited
) != NULL_TREE
;
8414 /* Returns true if T depends on any template parameter. */
8417 uses_template_parms (tree t
)
8423 int saved_processing_template_decl
;
8425 saved_processing_template_decl
= processing_template_decl
;
8426 if (!saved_processing_template_decl
)
8427 processing_template_decl
= 1;
8429 dependent_p
= dependent_type_p (t
);
8430 else if (TREE_CODE (t
) == TREE_VEC
)
8431 dependent_p
= any_dependent_template_arguments_p (t
);
8432 else if (TREE_CODE (t
) == TREE_LIST
)
8433 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8434 || uses_template_parms (TREE_CHAIN (t
)));
8435 else if (TREE_CODE (t
) == TYPE_DECL
)
8436 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8439 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8440 || TREE_CODE (t
) == OVERLOAD
8443 || TREE_CODE (t
) == TRAIT_EXPR
8444 || TREE_CODE (t
) == CONSTRUCTOR
8445 || CONSTANT_CLASS_P (t
))
8446 dependent_p
= (type_dependent_expression_p (t
)
8447 || value_dependent_expression_p (t
));
8450 gcc_assert (t
== error_mark_node
);
8451 dependent_p
= false;
8454 processing_template_decl
= saved_processing_template_decl
;
8459 /* Returns true iff current_function_decl is an incompletely instantiated
8460 template. Useful instead of processing_template_decl because the latter
8461 is set to 0 during instantiate_non_dependent_expr. */
8464 in_template_function (void)
8466 tree fn
= current_function_decl
;
8468 ++processing_template_decl
;
8469 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8470 && DECL_TEMPLATE_INFO (fn
)
8471 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8472 --processing_template_decl
;
8476 /* Returns true if T depends on any template parameter with level LEVEL. */
8479 uses_template_parms_level (tree t
, int level
)
8481 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8482 /*include_nondeduced_p=*/true);
8485 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8486 ill-formed translation unit, i.e. a variable or function that isn't
8487 usable in a constant expression. */
8490 neglectable_inst_p (tree d
)
8493 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8494 : decl_maybe_constant_var_p (d
)));
8497 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8498 neglectable and instantiated from within an erroneous instantiation. */
8501 limit_bad_template_recursion (tree decl
)
8503 struct tinst_level
*lev
= current_tinst_level
;
8504 int errs
= errorcount
+ sorrycount
;
8505 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8508 for (; lev
; lev
= lev
->next
)
8509 if (neglectable_inst_p (lev
->decl
))
8512 return (lev
&& errs
> lev
->errors
);
8515 static int tinst_depth
;
8516 extern int max_tinst_depth
;
8519 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8521 /* We're starting to instantiate D; record the template instantiation context
8522 for diagnostics and to restore it later. */
8525 push_tinst_level (tree d
)
8527 return push_tinst_level_loc (d
, input_location
);
8530 /* We're starting to instantiate D; record the template instantiation context
8531 at LOC for diagnostics and to restore it later. */
8534 push_tinst_level_loc (tree d
, location_t loc
)
8536 struct tinst_level
*new_level
;
8538 if (tinst_depth
>= max_tinst_depth
)
8540 fatal_error (input_location
,
8541 "template instantiation depth exceeds maximum of %d"
8542 " (use -ftemplate-depth= to increase the maximum)",
8547 /* If the current instantiation caused problems, don't let it instantiate
8548 anything else. Do allow deduction substitution and decls usable in
8549 constant expressions. */
8550 if (limit_bad_template_recursion (d
))
8553 new_level
= ggc_alloc
<tinst_level
> ();
8554 new_level
->decl
= d
;
8555 new_level
->locus
= loc
;
8556 new_level
->errors
= errorcount
+sorrycount
;
8557 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8558 new_level
->next
= current_tinst_level
;
8559 current_tinst_level
= new_level
;
8562 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8563 depth_reached
= tinst_depth
;
8568 /* We're done instantiating this template; return to the instantiation
8572 pop_tinst_level (void)
8574 /* Restore the filename and line number stashed away when we started
8575 this instantiation. */
8576 input_location
= current_tinst_level
->locus
;
8577 current_tinst_level
= current_tinst_level
->next
;
8581 /* We're instantiating a deferred template; restore the template
8582 instantiation context in which the instantiation was requested, which
8583 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8586 reopen_tinst_level (struct tinst_level
*level
)
8588 struct tinst_level
*t
;
8591 for (t
= level
; t
; t
= t
->next
)
8594 current_tinst_level
= level
;
8596 if (current_tinst_level
)
8597 current_tinst_level
->errors
= errorcount
+sorrycount
;
8601 /* Returns the TINST_LEVEL which gives the original instantiation
8604 struct tinst_level
*
8605 outermost_tinst_level (void)
8607 struct tinst_level
*level
= current_tinst_level
;
8610 level
= level
->next
;
8614 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8615 vector of template arguments, as for tsubst.
8617 Returns an appropriate tsubst'd friend declaration. */
8620 tsubst_friend_function (tree decl
, tree args
)
8624 if (TREE_CODE (decl
) == FUNCTION_DECL
8625 && DECL_TEMPLATE_INSTANTIATION (decl
)
8626 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8627 /* This was a friend declared with an explicit template
8628 argument list, e.g.:
8632 to indicate that f was a template instantiation, not a new
8633 function declaration. Now, we have to figure out what
8634 instantiation of what template. */
8636 tree template_id
, arglist
, fns
;
8639 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8641 /* Friend functions are looked up in the containing namespace scope.
8642 We must enter that scope, to avoid finding member functions of the
8643 current class with same name. */
8644 push_nested_namespace (ns
);
8645 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8646 tf_warning_or_error
, NULL_TREE
,
8647 /*integral_constant_expression_p=*/false);
8648 pop_nested_namespace (ns
);
8649 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8650 tf_warning_or_error
, NULL_TREE
);
8651 template_id
= lookup_template_function (fns
, arglist
);
8653 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8654 tmpl
= determine_specialization (template_id
, new_friend
,
8656 /*need_member_template=*/0,
8657 TREE_VEC_LENGTH (args
),
8659 return instantiate_template (tmpl
, new_args
, tf_error
);
8662 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8664 /* The NEW_FRIEND will look like an instantiation, to the
8665 compiler, but is not an instantiation from the point of view of
8666 the language. For example, we might have had:
8668 template <class T> struct S {
8669 template <class U> friend void f(T, U);
8672 Then, in S<int>, template <class U> void f(int, U) is not an
8673 instantiation of anything. */
8674 if (new_friend
== error_mark_node
)
8675 return error_mark_node
;
8677 DECL_USE_TEMPLATE (new_friend
) = 0;
8678 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8680 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8681 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8682 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8685 /* The mangled name for the NEW_FRIEND is incorrect. The function
8686 is not a template instantiation and should not be mangled like
8687 one. Therefore, we forget the mangling here; we'll recompute it
8688 later if we need it. */
8689 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8691 SET_DECL_RTL (new_friend
, NULL
);
8692 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8695 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8698 tree new_friend_template_info
;
8699 tree new_friend_result_template_info
;
8701 int new_friend_is_defn
;
8703 /* We must save some information from NEW_FRIEND before calling
8704 duplicate decls since that function will free NEW_FRIEND if
8706 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8707 new_friend_is_defn
=
8708 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8709 (template_for_substitution (new_friend
)))
8711 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8713 /* This declaration is a `primary' template. */
8714 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8716 new_friend_result_template_info
8717 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8720 new_friend_result_template_info
= NULL_TREE
;
8722 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8723 if (new_friend_is_defn
)
8724 DECL_INITIAL (new_friend
) = error_mark_node
;
8726 /* Inside pushdecl_namespace_level, we will push into the
8727 current namespace. However, the friend function should go
8728 into the namespace of the template. */
8729 ns
= decl_namespace_context (new_friend
);
8730 push_nested_namespace (ns
);
8731 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8732 pop_nested_namespace (ns
);
8734 if (old_decl
== error_mark_node
)
8735 return error_mark_node
;
8737 if (old_decl
!= new_friend
)
8739 /* This new friend declaration matched an existing
8740 declaration. For example, given:
8742 template <class T> void f(T);
8743 template <class U> class C {
8744 template <class T> friend void f(T) {}
8747 the friend declaration actually provides the definition
8748 of `f', once C has been instantiated for some type. So,
8749 old_decl will be the out-of-class template declaration,
8750 while new_friend is the in-class definition.
8752 But, if `f' was called before this point, the
8753 instantiation of `f' will have DECL_TI_ARGS corresponding
8754 to `T' but not to `U', references to which might appear
8755 in the definition of `f'. Previously, the most general
8756 template for an instantiation of `f' was the out-of-class
8757 version; now it is the in-class version. Therefore, we
8758 run through all specialization of `f', adding to their
8759 DECL_TI_ARGS appropriately. In particular, they need a
8760 new set of outer arguments, corresponding to the
8761 arguments for this class instantiation.
8763 The same situation can arise with something like this:
8766 template <class T> class C {
8770 when `C<int>' is instantiated. Now, `f(int)' is defined
8773 if (!new_friend_is_defn
)
8774 /* On the other hand, if the in-class declaration does
8775 *not* provide a definition, then we don't want to alter
8776 existing definitions. We can just leave everything
8781 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8782 tree new_args
= TI_ARGS (new_friend_template_info
);
8784 /* Overwrite whatever template info was there before, if
8785 any, with the new template information pertaining to
8787 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8789 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8791 /* We should have called reregister_specialization in
8793 gcc_assert (retrieve_specialization (new_template
,
8797 /* Instantiate it if the global has already been used. */
8798 if (DECL_ODR_USED (old_decl
))
8799 instantiate_decl (old_decl
, /*defer_ok=*/true,
8800 /*expl_inst_class_mem_p=*/false);
8806 /* Indicate that the old function template is a partial
8808 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8809 = new_friend_result_template_info
;
8811 gcc_assert (new_template
8812 == most_general_template (new_template
));
8813 gcc_assert (new_template
!= old_decl
);
8815 /* Reassign any specializations already in the hash table
8816 to the new more general template, and add the
8817 additional template args. */
8818 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8822 tree spec
= TREE_VALUE (t
);
8825 elt
.tmpl
= old_decl
;
8826 elt
.args
= DECL_TI_ARGS (spec
);
8827 elt
.spec
= NULL_TREE
;
8829 decl_specializations
->remove_elt (&elt
);
8832 = add_outermost_template_args (new_args
,
8833 DECL_TI_ARGS (spec
));
8835 register_specialization
8836 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8839 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8843 /* The information from NEW_FRIEND has been merged into OLD_DECL
8844 by duplicate_decls. */
8845 new_friend
= old_decl
;
8850 tree context
= DECL_CONTEXT (new_friend
);
8854 template <class T> class C {
8855 template <class U> friend void C1<U>::f (); // case 1
8856 friend void C2<T>::f (); // case 2
8858 we only need to make sure CONTEXT is a complete type for
8859 case 2. To distinguish between the two cases, we note that
8860 CONTEXT of case 1 remains dependent type after tsubst while
8861 this isn't true for case 2. */
8862 ++processing_template_decl
;
8863 dependent_p
= dependent_type_p (context
);
8864 --processing_template_decl
;
8867 && !complete_type_or_else (context
, NULL_TREE
))
8868 return error_mark_node
;
8870 if (COMPLETE_TYPE_P (context
))
8872 tree fn
= new_friend
;
8873 /* do_friend adds the TEMPLATE_DECL for any member friend
8874 template even if it isn't a member template, i.e.
8875 template <class T> friend A<T>::f();
8876 Look through it in that case. */
8877 if (TREE_CODE (fn
) == TEMPLATE_DECL
8878 && !PRIMARY_TEMPLATE_P (fn
))
8879 fn
= DECL_TEMPLATE_RESULT (fn
);
8880 /* Check to see that the declaration is really present, and,
8881 possibly obtain an improved declaration. */
8882 fn
= check_classfn (context
, fn
, NULL_TREE
);
8892 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8893 template arguments, as for tsubst.
8895 Returns an appropriate tsubst'd friend type or error_mark_node on
8899 tsubst_friend_class (tree friend_tmpl
, tree args
)
8905 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8907 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8908 return TREE_TYPE (t
);
8911 context
= CP_DECL_CONTEXT (friend_tmpl
);
8913 if (context
!= global_namespace
)
8915 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8916 push_nested_namespace (context
);
8918 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8921 /* Look for a class template declaration. We look for hidden names
8922 because two friend declarations of the same template are the
8923 same. For example, in:
8926 template <typename> friend class F;
8928 template <typename> struct B {
8929 template <typename> friend class F;
8932 both F templates are the same. */
8933 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8934 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8936 /* But, if we don't find one, it might be because we're in a
8937 situation like this:
8945 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8946 for `S<int>', not the TEMPLATE_DECL. */
8947 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8949 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8950 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8953 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8955 /* The friend template has already been declared. Just
8956 check to see that the declarations match, and install any new
8957 default parameters. We must tsubst the default parameters,
8958 of course. We only need the innermost template parameters
8959 because that is all that redeclare_class_template will look
8961 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8962 > TMPL_ARGS_DEPTH (args
))
8965 location_t saved_input_location
;
8966 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8967 args
, tf_warning_or_error
);
8969 saved_input_location
= input_location
;
8970 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8971 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8972 input_location
= saved_input_location
;
8976 friend_type
= TREE_TYPE (tmpl
);
8980 /* The friend template has not already been declared. In this
8981 case, the instantiation of the template class will cause the
8982 injection of this template into the global scope. */
8983 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8984 if (tmpl
== error_mark_node
)
8985 return error_mark_node
;
8987 /* The new TMPL is not an instantiation of anything, so we
8988 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8989 the new type because that is supposed to be the corresponding
8990 template decl, i.e., TMPL. */
8991 DECL_USE_TEMPLATE (tmpl
) = 0;
8992 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8993 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8994 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8995 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8997 /* Inject this template into the global scope. */
8998 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
9001 if (context
!= global_namespace
)
9003 if (TREE_CODE (context
) == NAMESPACE_DECL
)
9004 pop_nested_namespace (context
);
9006 pop_nested_class ();
9012 /* Returns zero if TYPE cannot be completed later due to circularity.
9013 Otherwise returns one. */
9016 can_complete_type_without_circularity (tree type
)
9018 if (type
== NULL_TREE
|| type
== error_mark_node
)
9020 else if (COMPLETE_TYPE_P (type
))
9022 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
9023 return can_complete_type_without_circularity (TREE_TYPE (type
));
9024 else if (CLASS_TYPE_P (type
)
9025 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
9031 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
9033 /* Apply any attributes which had to be deferred until instantiation
9034 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
9035 ARGS, COMPLAIN, IN_DECL are as tsubst. */
9038 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
9039 tree args
, tsubst_flags_t complain
, tree in_decl
)
9041 tree last_dep
= NULL_TREE
;
9045 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
9046 if (ATTR_IS_DEPENDENT (t
))
9049 attributes
= copy_list (attributes
);
9053 if (DECL_P (*decl_p
))
9055 if (TREE_TYPE (*decl_p
) == error_mark_node
)
9057 p
= &DECL_ATTRIBUTES (*decl_p
);
9060 p
= &TYPE_ATTRIBUTES (*decl_p
);
9064 tree late_attrs
= NULL_TREE
;
9065 tree
*q
= &late_attrs
;
9067 for (*p
= attributes
; *p
; )
9070 if (ATTR_IS_DEPENDENT (t
))
9072 *p
= TREE_CHAIN (t
);
9073 TREE_CHAIN (t
) = NULL_TREE
;
9074 if ((flag_openmp
|| flag_cilkplus
)
9075 && is_attribute_p ("omp declare simd",
9076 get_attribute_name (t
))
9079 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
9080 clauses
= tsubst_omp_clauses (clauses
, true, args
,
9082 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
9083 clauses
= finish_omp_clauses (clauses
);
9084 tree parms
= DECL_ARGUMENTS (*decl_p
);
9086 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
9088 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
9090 TREE_VALUE (t
) = NULL_TREE
;
9092 /* If the first attribute argument is an identifier, don't
9093 pass it through tsubst. Attributes like mode, format,
9094 cleanup and several target specific attributes expect it
9096 else if (attribute_takes_identifier_p (get_attribute_name (t
))
9100 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
9102 /*integral_constant_expression_p=*/false);
9103 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
9105 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
9108 else if (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
)))
9110 /* An attribute pack expansion. */
9111 tree purp
= TREE_PURPOSE (t
);
9112 tree pack
= (tsubst_pack_expansion
9113 (TREE_VALUE (t
), args
, complain
, in_decl
));
9114 int len
= TREE_VEC_LENGTH (pack
);
9115 for (int i
= 0; i
< len
; ++i
)
9117 tree elt
= TREE_VEC_ELT (pack
, i
);
9118 *q
= build_tree_list (purp
, elt
);
9119 q
= &TREE_CHAIN (*q
);
9125 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
9126 /*integral_constant_expression_p=*/false);
9128 q
= &TREE_CHAIN (t
);
9131 p
= &TREE_CHAIN (t
);
9134 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
9138 /* Perform (or defer) access check for typedefs that were referenced
9139 from within the template TMPL code.
9140 This is a subroutine of instantiate_decl and instantiate_class_template.
9141 TMPL is the template to consider and TARGS is the list of arguments of
9145 perform_typedefs_access_check (tree tmpl
, tree targs
)
9147 location_t saved_location
;
9149 qualified_typedef_usage_t
*iter
;
9152 || (!CLASS_TYPE_P (tmpl
)
9153 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
9156 saved_location
= input_location
;
9157 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
9159 tree type_decl
= iter
->typedef_decl
;
9160 tree type_scope
= iter
->context
;
9162 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
9165 if (uses_template_parms (type_decl
))
9166 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
9167 if (uses_template_parms (type_scope
))
9168 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
9170 /* Make access check error messages point to the location
9171 of the use of the typedef. */
9172 input_location
= iter
->locus
;
9173 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
9174 type_decl
, type_decl
,
9175 tf_warning_or_error
);
9177 input_location
= saved_location
;
9181 instantiate_class_template_1 (tree type
)
9183 tree templ
, args
, pattern
, t
, member
;
9187 unsigned int saved_maximum_field_alignment
;
9190 if (type
== error_mark_node
)
9191 return error_mark_node
;
9193 if (COMPLETE_OR_OPEN_TYPE_P (type
)
9194 || uses_template_parms (type
))
9197 /* Figure out which template is being instantiated. */
9198 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
9199 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
9201 /* Determine what specialization of the original template to
9203 t
= most_specialized_partial_spec (type
, tf_warning_or_error
);
9204 if (t
== error_mark_node
)
9206 TYPE_BEING_DEFINED (type
) = 1;
9207 return error_mark_node
;
9211 /* This TYPE is actually an instantiation of a partial
9212 specialization. We replace the innermost set of ARGS with
9213 the arguments appropriate for substitution. For example,
9216 template <class T> struct S {};
9217 template <class T> struct S<T*> {};
9219 and supposing that we are instantiating S<int*>, ARGS will
9220 presently be {int*} -- but we need {int}. */
9221 pattern
= TREE_TYPE (t
);
9222 args
= TREE_PURPOSE (t
);
9226 pattern
= TREE_TYPE (templ
);
9227 args
= CLASSTYPE_TI_ARGS (type
);
9230 /* If the template we're instantiating is incomplete, then clearly
9231 there's nothing we can do. */
9232 if (!COMPLETE_TYPE_P (pattern
))
9235 /* If we've recursively instantiated too many templates, stop. */
9236 if (! push_tinst_level (type
))
9239 /* Now we're really doing the instantiation. Mark the type as in
9240 the process of being defined. */
9241 TYPE_BEING_DEFINED (type
) = 1;
9243 /* We may be in the middle of deferred access check. Disable
9245 push_deferring_access_checks (dk_no_deferred
);
9247 int saved_unevaluated_operand
= cp_unevaluated_operand
;
9248 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
9250 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
9251 /* Also avoid push_to_top_level for a lambda in an NSDMI. */
9252 if (!fn_context
&& LAMBDA_TYPE_P (type
) && TYPE_CLASS_SCOPE_P (type
))
9253 fn_context
= error_mark_node
;
9255 push_to_top_level ();
9258 cp_unevaluated_operand
= 0;
9259 c_inhibit_evaluation_warnings
= 0;
9261 /* Use #pragma pack from the template context. */
9262 saved_maximum_field_alignment
= maximum_field_alignment
;
9263 maximum_field_alignment
= TYPE_PRECISION (pattern
);
9265 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
9267 /* Set the input location to the most specialized template definition.
9268 This is needed if tsubsting causes an error. */
9269 typedecl
= TYPE_MAIN_DECL (pattern
);
9270 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
9271 DECL_SOURCE_LOCATION (typedecl
);
9273 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
9274 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
9275 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
9276 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
9277 if (ANON_AGGR_TYPE_P (pattern
))
9278 SET_ANON_AGGR_TYPE_P (type
);
9279 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
9281 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
9282 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
9283 /* Adjust visibility for template arguments. */
9284 determine_visibility (TYPE_MAIN_DECL (type
));
9286 if (CLASS_TYPE_P (type
))
9287 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
9289 pbinfo
= TYPE_BINFO (pattern
);
9291 /* We should never instantiate a nested class before its enclosing
9292 class; we need to look up the nested class by name before we can
9293 instantiate it, and that lookup should instantiate the enclosing
9295 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
9296 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
9298 base_list
= NULL_TREE
;
9299 if (BINFO_N_BASE_BINFOS (pbinfo
))
9305 /* We must enter the scope containing the type, as that is where
9306 the accessibility of types named in dependent bases are
9308 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9310 /* Substitute into each of the bases to determine the actual
9312 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9315 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9316 tree expanded_bases
= NULL_TREE
;
9319 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9322 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9323 args
, tf_error
, NULL_TREE
);
9324 if (expanded_bases
== error_mark_node
)
9327 len
= TREE_VEC_LENGTH (expanded_bases
);
9330 for (idx
= 0; idx
< len
; idx
++)
9333 /* Extract the already-expanded base class. */
9334 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9336 /* Substitute to figure out the base class. */
9337 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9340 if (base
== error_mark_node
)
9343 base_list
= tree_cons (access
, base
, base_list
);
9344 if (BINFO_VIRTUAL_P (pbase_binfo
))
9345 TREE_TYPE (base_list
) = integer_type_node
;
9349 /* The list is now in reverse order; correct that. */
9350 base_list
= nreverse (base_list
);
9353 pop_scope (pushed_scope
);
9355 /* Now call xref_basetypes to set up all the base-class
9357 xref_basetypes (type
, base_list
);
9359 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9360 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9361 args
, tf_error
, NULL_TREE
);
9362 fixup_attribute_variants (type
);
9364 /* Now that our base classes are set up, enter the scope of the
9365 class, so that name lookups into base classes, etc. will work
9366 correctly. This is precisely analogous to what we do in
9367 begin_class_definition when defining an ordinary non-template
9368 class, except we also need to push the enclosing classes. */
9369 push_nested_class (type
);
9371 /* Now members are processed in the order of declaration. */
9372 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9373 member
; member
= TREE_CHAIN (member
))
9375 tree t
= TREE_VALUE (member
);
9377 if (TREE_PURPOSE (member
))
9381 /* Build new CLASSTYPE_NESTED_UTDS. */
9384 bool class_template_p
;
9386 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9387 && TYPE_LANG_SPECIFIC (t
)
9388 && CLASSTYPE_IS_TEMPLATE (t
));
9389 /* If the member is a class template, then -- even after
9390 substitution -- there may be dependent types in the
9391 template argument list for the class. We increment
9392 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9393 that function will assume that no types are dependent
9394 when outside of a template. */
9395 if (class_template_p
)
9396 ++processing_template_decl
;
9397 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9398 if (class_template_p
)
9399 --processing_template_decl
;
9400 if (newtag
== error_mark_node
)
9403 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9405 tree name
= TYPE_IDENTIFIER (t
);
9407 if (class_template_p
)
9408 /* Unfortunately, lookup_template_class sets
9409 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9410 instantiation (i.e., for the type of a member
9411 template class nested within a template class.)
9412 This behavior is required for
9413 maybe_process_partial_specialization to work
9414 correctly, but is not accurate in this case;
9415 the TAG is not an instantiation of anything.
9416 (The corresponding TEMPLATE_DECL is an
9417 instantiation, but the TYPE is not.) */
9418 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9420 /* Now, we call pushtag to put this NEWTAG into the scope of
9421 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9422 pushtag calling push_template_decl. We don't have to do
9423 this for enums because it will already have been done in
9426 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9427 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9430 else if (DECL_DECLARES_FUNCTION_P (t
))
9432 /* Build new TYPE_METHODS. */
9435 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9436 ++processing_template_decl
;
9437 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9438 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9439 --processing_template_decl
;
9440 set_current_access_from_decl (r
);
9441 finish_member_declaration (r
);
9442 /* Instantiate members marked with attribute used. */
9443 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9445 if (TREE_CODE (r
) == FUNCTION_DECL
9446 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9447 cp_check_omp_declare_reduction (r
);
9449 else if (DECL_CLASS_TEMPLATE_P (t
)
9450 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9451 /* A closure type for a lambda in a default argument for a
9452 member template. Ignore it; it will be instantiated with
9453 the default argument. */;
9456 /* Build new TYPE_FIELDS. */
9457 if (TREE_CODE (t
) == STATIC_ASSERT
)
9461 ++c_inhibit_evaluation_warnings
;
9463 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9464 tf_warning_or_error
, NULL_TREE
,
9465 /*integral_constant_expression_p=*/true);
9466 --c_inhibit_evaluation_warnings
;
9468 finish_static_assert (condition
,
9469 STATIC_ASSERT_MESSAGE (t
),
9470 STATIC_ASSERT_SOURCE_LOCATION (t
),
9473 else if (TREE_CODE (t
) != CONST_DECL
)
9476 tree vec
= NULL_TREE
;
9479 /* The file and line for this declaration, to
9480 assist in error message reporting. Since we
9481 called push_tinst_level above, we don't need to
9483 input_location
= DECL_SOURCE_LOCATION (t
);
9485 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9486 ++processing_template_decl
;
9487 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9488 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9489 --processing_template_decl
;
9491 if (TREE_CODE (r
) == TREE_VEC
)
9493 /* A capture pack became multiple fields. */
9495 len
= TREE_VEC_LENGTH (vec
);
9498 for (int i
= 0; i
< len
; ++i
)
9501 r
= TREE_VEC_ELT (vec
, i
);
9506 [t]he initialization (and any associated
9507 side-effects) of a static data member does
9508 not occur unless the static data member is
9509 itself used in a way that requires the
9510 definition of the static data member to
9513 Therefore, we do not substitute into the
9514 initialized for the static data member here. */
9515 finish_static_data_member_decl
9518 /*init_const_expr_p=*/false,
9519 /*asmspec_tree=*/NULL_TREE
,
9521 /* Instantiate members marked with attribute used. */
9522 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9525 else if (TREE_CODE (r
) == FIELD_DECL
)
9527 /* Determine whether R has a valid type and can be
9528 completed later. If R is invalid, then its type
9529 is replaced by error_mark_node. */
9530 tree rtype
= TREE_TYPE (r
);
9531 if (can_complete_type_without_circularity (rtype
))
9532 complete_type (rtype
);
9534 if (!COMPLETE_TYPE_P (rtype
))
9536 cxx_incomplete_type_error (r
, rtype
);
9537 TREE_TYPE (r
) = error_mark_node
;
9541 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9542 such a thing will already have been added to the field
9543 list by tsubst_enum in finish_member_declaration in the
9544 CLASSTYPE_NESTED_UTDS case above. */
9545 if (!(TREE_CODE (r
) == TYPE_DECL
9546 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9547 && DECL_ARTIFICIAL (r
)))
9549 set_current_access_from_decl (r
);
9550 finish_member_declaration (r
);
9558 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9559 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9561 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9563 tree friend_type
= t
;
9564 bool adjust_processing_template_decl
= false;
9566 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9568 /* template <class T> friend class C; */
9569 friend_type
= tsubst_friend_class (friend_type
, args
);
9570 adjust_processing_template_decl
= true;
9572 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9574 /* template <class T> friend class C::D; */
9575 friend_type
= tsubst (friend_type
, args
,
9576 tf_warning_or_error
, NULL_TREE
);
9577 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9578 friend_type
= TREE_TYPE (friend_type
);
9579 adjust_processing_template_decl
= true;
9581 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9582 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9584 /* This could be either
9588 when dependent_type_p is false or
9590 template <class U> friend class T::C;
9593 friend_type
= tsubst (friend_type
, args
,
9594 tf_warning_or_error
, NULL_TREE
);
9595 /* Bump processing_template_decl for correct
9596 dependent_type_p calculation. */
9597 ++processing_template_decl
;
9598 if (dependent_type_p (friend_type
))
9599 adjust_processing_template_decl
= true;
9600 --processing_template_decl
;
9602 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9603 && hidden_name_p (TYPE_NAME (friend_type
)))
9607 where C hasn't been declared yet. Let's lookup name
9608 from namespace scope directly, bypassing any name that
9609 come from dependent base class. */
9610 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9612 /* The call to xref_tag_from_type does injection for friend
9614 push_nested_namespace (ns
);
9616 xref_tag_from_type (friend_type
, NULL_TREE
,
9617 /*tag_scope=*/ts_current
);
9618 pop_nested_namespace (ns
);
9620 else if (uses_template_parms (friend_type
))
9621 /* friend class C<T>; */
9622 friend_type
= tsubst (friend_type
, args
,
9623 tf_warning_or_error
, NULL_TREE
);
9628 where C is already declared or
9630 friend class C<int>;
9632 We don't have to do anything in these cases. */
9634 if (adjust_processing_template_decl
)
9635 /* Trick make_friend_class into realizing that the friend
9636 we're adding is a template, not an ordinary class. It's
9637 important that we use make_friend_class since it will
9638 perform some error-checking and output cross-reference
9640 ++processing_template_decl
;
9642 if (friend_type
!= error_mark_node
)
9643 make_friend_class (type
, friend_type
, /*complain=*/false);
9645 if (adjust_processing_template_decl
)
9646 --processing_template_decl
;
9650 /* Build new DECL_FRIENDLIST. */
9653 /* The file and line for this declaration, to
9654 assist in error message reporting. Since we
9655 called push_tinst_level above, we don't need to
9657 input_location
= DECL_SOURCE_LOCATION (t
);
9659 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9661 ++processing_template_decl
;
9662 push_deferring_access_checks (dk_no_check
);
9665 r
= tsubst_friend_function (t
, args
);
9666 add_friend (type
, r
, /*complain=*/false);
9667 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9669 pop_deferring_access_checks ();
9670 --processing_template_decl
;
9678 /* Restore these before substituting into the lambda capture
9680 cp_unevaluated_operand
= saved_unevaluated_operand
;
9681 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
9684 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9686 tree decl
= lambda_function (type
);
9689 if (!DECL_TEMPLATE_INFO (decl
)
9690 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9691 instantiate_decl (decl
, false, false);
9693 /* We need to instantiate the capture list from the template
9694 after we've instantiated the closure members, but before we
9695 consider adding the conversion op. Also keep any captures
9696 that may have been added during instantiation of the op(). */
9697 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9699 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9700 args
, tf_warning_or_error
, NULL_TREE
,
9703 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9704 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9706 maybe_add_lambda_conv_op (type
);
9709 gcc_assert (errorcount
);
9712 /* Set the file and line number information to whatever is given for
9713 the class itself. This puts error messages involving generated
9714 implicit functions at a predictable point, and the same point
9715 that would be used for non-template classes. */
9716 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9718 unreverse_member_declarations (type
);
9719 finish_struct_1 (type
);
9720 TYPE_BEING_DEFINED (type
) = 0;
9722 /* We don't instantiate default arguments for member functions. 14.7.1:
9724 The implicit instantiation of a class template specialization causes
9725 the implicit instantiation of the declarations, but not of the
9726 definitions or default arguments, of the class member functions,
9727 member classes, static data members and member templates.... */
9729 /* Some typedefs referenced from within the template code need to be access
9730 checked at template instantiation time, i.e now. These types were
9731 added to the template at parsing time. Let's get those and perform
9732 the access checks then. */
9733 perform_typedefs_access_check (pattern
, args
);
9734 perform_deferred_access_checks (tf_warning_or_error
);
9735 pop_nested_class ();
9736 maximum_field_alignment
= saved_maximum_field_alignment
;
9738 pop_from_top_level ();
9739 pop_deferring_access_checks ();
9742 /* The vtable for a template class can be emitted in any translation
9743 unit in which the class is instantiated. When there is no key
9744 method, however, finish_struct_1 will already have added TYPE to
9745 the keyed_classes list. */
9746 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9747 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9752 /* Wrapper for instantiate_class_template_1. */
9755 instantiate_class_template (tree type
)
9758 timevar_push (TV_TEMPLATE_INST
);
9759 ret
= instantiate_class_template_1 (type
);
9760 timevar_pop (TV_TEMPLATE_INST
);
9765 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9771 else if (TYPE_P (t
))
9772 r
= tsubst (t
, args
, complain
, in_decl
);
9775 if (!(complain
& tf_warning
))
9776 ++c_inhibit_evaluation_warnings
;
9777 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9778 /*integral_constant_expression_p=*/true);
9779 if (!(complain
& tf_warning
))
9780 --c_inhibit_evaluation_warnings
;
9785 /* Given a function parameter pack TMPL_PARM and some function parameters
9786 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9787 and set *SPEC_P to point at the next point in the list. */
9790 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9792 /* Collect all of the extra "packed" parameters into an
9796 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9797 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9798 tree spec_parm
= *spec_p
;
9801 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9803 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9806 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9807 parmvec
= make_tree_vec (len
);
9808 parmtypevec
= make_tree_vec (len
);
9809 spec_parm
= *spec_p
;
9810 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9812 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9813 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9816 /* Build the argument packs. */
9817 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9818 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9819 TREE_TYPE (argpack
) = argtypepack
;
9820 *spec_p
= spec_parm
;
9825 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9826 NONTYPE_ARGUMENT_PACK. */
9829 make_fnparm_pack (tree spec_parm
)
9831 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9834 /* Return 1 if the Ith element of the argument pack ARG_PACK is a
9835 pack expansion with no extra args, 2 if it has extra args, or 0
9836 if it is not a pack expansion. */
9839 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9841 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9842 if (i
>= TREE_VEC_LENGTH (vec
))
9844 tree elt
= TREE_VEC_ELT (vec
, i
);
9846 /* A decl pack is itself an expansion. */
9847 elt
= TREE_TYPE (elt
);
9848 if (!PACK_EXPANSION_P (elt
))
9850 if (PACK_EXPANSION_EXTRA_ARGS (elt
))
9856 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9859 make_argument_pack_select (tree arg_pack
, unsigned index
)
9861 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9863 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9864 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9869 /* This is a subroutine of tsubst_pack_expansion.
9871 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9872 mechanism to store the (non complete list of) arguments of the
9873 substitution and return a non substituted pack expansion, in order
9874 to wait for when we have enough arguments to really perform the
9878 use_pack_expansion_extra_args_p (tree parm_packs
,
9882 /* If one pack has an expansion and another pack has a normal
9883 argument or if one pack has an empty argument and an another
9884 one hasn't then tsubst_pack_expansion cannot perform the
9885 substitution and need to fall back on the
9886 PACK_EXPANSION_EXTRA mechanism. */
9887 if (parm_packs
== NULL_TREE
)
9889 else if (has_empty_arg
)
9892 bool has_expansion_arg
= false;
9893 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9895 bool has_non_expansion_arg
= false;
9896 for (tree parm_pack
= parm_packs
;
9898 parm_pack
= TREE_CHAIN (parm_pack
))
9900 tree arg
= TREE_VALUE (parm_pack
);
9902 int exp
= argument_pack_element_is_expansion_p (arg
, i
);
9904 /* We can't substitute a pack expansion with extra args into
9908 has_expansion_arg
= true;
9910 has_non_expansion_arg
= true;
9913 if (has_expansion_arg
&& has_non_expansion_arg
)
9919 /* [temp.variadic]/6 says that:
9921 The instantiation of a pack expansion [...]
9922 produces a list E1,E2, ..., En, where N is the number of elements
9923 in the pack expansion parameters.
9925 This subroutine of tsubst_pack_expansion produces one of these Ei.
9927 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9928 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9929 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9930 INDEX is the index 'i' of the element Ei to produce. ARGS,
9931 COMPLAIN, and IN_DECL are the same parameters as for the
9932 tsubst_pack_expansion function.
9934 The function returns the resulting Ei upon successful completion,
9937 Note that this function possibly modifies the ARGS parameter, so
9938 it's the responsibility of the caller to restore it. */
9941 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9944 tree args
/* This parm gets
9946 tsubst_flags_t complain
,
9950 bool ith_elem_is_expansion
= false;
9952 /* For each parameter pack, change the substitution of the parameter
9953 pack to the ith argument in its argument pack, then expand the
9955 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9957 tree parm
= TREE_PURPOSE (pack
);
9958 tree arg_pack
= TREE_VALUE (pack
);
9959 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9961 ith_elem_is_expansion
|=
9962 argument_pack_element_is_expansion_p (arg_pack
, index
);
9964 /* Select the Ith argument from the pack. */
9965 if (TREE_CODE (parm
) == PARM_DECL
9966 || TREE_CODE (parm
) == FIELD_DECL
)
9970 aps
= make_argument_pack_select (arg_pack
, index
);
9971 if (!mark_used (parm
, complain
) && !(complain
& tf_error
))
9972 return error_mark_node
;
9973 register_local_specialization (aps
, parm
);
9976 aps
= retrieve_local_specialization (parm
);
9981 template_parm_level_and_index (parm
, &level
, &idx
);
9985 aps
= make_argument_pack_select (arg_pack
, index
);
9986 /* Update the corresponding argument. */
9987 TMPL_ARG (args
, level
, idx
) = aps
;
9990 /* Re-use the ARGUMENT_PACK_SELECT. */
9991 aps
= TMPL_ARG (args
, level
, idx
);
9993 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9996 /* Substitute into the PATTERN with the (possibly altered)
9998 if (pattern
== in_decl
)
9999 /* Expanding a fixed parameter pack from
10000 coerce_template_parameter_pack. */
10001 t
= tsubst_decl (pattern
, args
, complain
);
10002 else if (!TYPE_P (pattern
))
10003 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10004 /*integral_constant_expression_p=*/false);
10006 t
= tsubst (pattern
, args
, complain
, in_decl
);
10008 /* If the Ith argument pack element is a pack expansion, then
10009 the Ith element resulting from the substituting is going to
10010 be a pack expansion as well. */
10011 if (ith_elem_is_expansion
)
10012 t
= make_pack_expansion (t
);
10017 /* Substitute ARGS into T, which is an pack expansion
10018 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
10019 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
10020 (if only a partial substitution could be performed) or
10021 ERROR_MARK_NODE if there was an error. */
10023 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
10027 tree pack
, packs
= NULL_TREE
;
10028 bool unsubstituted_packs
= false;
10031 hash_map
<tree
, tree
> *saved_local_specializations
= NULL
;
10032 bool need_local_specializations
= false;
10035 gcc_assert (PACK_EXPANSION_P (t
));
10036 pattern
= PACK_EXPANSION_PATTERN (t
);
10038 /* Add in any args remembered from an earlier partial instantiation. */
10039 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
10041 levels
= TMPL_ARGS_DEPTH (args
);
10043 /* Determine the argument packs that will instantiate the parameter
10044 packs used in the expansion expression. While we're at it,
10045 compute the number of arguments to be expanded and make sure it
10047 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
10048 pack
= TREE_CHAIN (pack
))
10050 tree parm_pack
= TREE_VALUE (pack
);
10051 tree arg_pack
= NULL_TREE
;
10052 tree orig_arg
= NULL_TREE
;
10055 if (TREE_CODE (parm_pack
) == BASES
)
10057 if (BASES_DIRECT (parm_pack
))
10058 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10059 args
, complain
, in_decl
, false));
10061 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
10062 args
, complain
, in_decl
, false));
10064 if (TREE_CODE (parm_pack
) == PARM_DECL
)
10066 if (PACK_EXPANSION_LOCAL_P (t
))
10067 arg_pack
= retrieve_local_specialization (parm_pack
);
10070 /* We can't rely on local_specializations for a parameter
10071 name used later in a function declaration (such as in a
10072 late-specified return type). Even if it exists, it might
10073 have the wrong value for a recursive call. Just make a
10074 dummy decl, since it's only used for its type. */
10075 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
10076 if (arg_pack
&& DECL_PACK_P (arg_pack
))
10077 /* Partial instantiation of the parm_pack, we can't build
10078 up an argument pack yet. */
10079 arg_pack
= NULL_TREE
;
10081 arg_pack
= make_fnparm_pack (arg_pack
);
10082 need_local_specializations
= true;
10085 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
10086 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
10090 template_parm_level_and_index (parm_pack
, &level
, &idx
);
10092 if (level
<= levels
)
10093 arg_pack
= TMPL_ARG (args
, level
, idx
);
10096 orig_arg
= arg_pack
;
10097 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
10098 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
10100 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
10101 /* This can only happen if we forget to expand an argument
10102 pack somewhere else. Just return an error, silently. */
10104 result
= make_tree_vec (1);
10105 TREE_VEC_ELT (result
, 0) = error_mark_node
;
10112 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
10114 /* Don't bother trying to do a partial substitution with
10115 incomplete packs; we'll try again after deduction. */
10116 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
10121 else if (len
!= my_len
)
10123 if (!(complain
& tf_error
))
10124 /* Fail quietly. */;
10125 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
10126 error ("mismatched argument pack lengths while expanding "
10130 error ("mismatched argument pack lengths while expanding "
10133 return error_mark_node
;
10136 /* Keep track of the parameter packs and their corresponding
10138 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
10139 TREE_TYPE (packs
) = orig_arg
;
10143 /* We can't substitute for this parameter pack. We use a flag as
10144 well as the missing_level counter because function parameter
10145 packs don't have a level. */
10146 unsubstituted_packs
= true;
10150 /* If the expansion is just T..., return the matching argument pack. */
10151 if (!unsubstituted_packs
10152 && TREE_PURPOSE (packs
) == pattern
)
10154 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
10155 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
10156 || pack_expansion_args_count (args
))
10158 /* Otherwise use the normal path so we get convert_from_reference. */
10161 /* We cannot expand this expansion expression, because we don't have
10162 all of the argument packs we need. */
10163 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
10165 /* We got some full packs, but we can't substitute them in until we
10166 have values for all the packs. So remember these until then. */
10168 t
= make_pack_expansion (pattern
);
10169 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
10172 else if (unsubstituted_packs
)
10174 /* There were no real arguments, we're just replacing a parameter
10175 pack with another version of itself. Substitute into the
10176 pattern and return a PACK_EXPANSION_*. The caller will need to
10178 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
10179 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
10180 /*integral_constant_expression_p=*/false);
10182 t
= tsubst (pattern
, args
, complain
, in_decl
);
10183 t
= make_pack_expansion (t
);
10187 gcc_assert (len
>= 0);
10189 if (need_local_specializations
)
10191 /* We're in a late-specified return type, so create our own local
10192 specializations map; the current map is either NULL or (in the
10193 case of recursive unification) might have bindings that we don't
10194 want to use or alter. */
10195 saved_local_specializations
= local_specializations
;
10196 local_specializations
= new hash_map
<tree
, tree
>;
10199 /* For each argument in each argument pack, substitute into the
10201 result
= make_tree_vec (len
);
10202 for (i
= 0; i
< len
; ++i
)
10204 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
10208 TREE_VEC_ELT (result
, i
) = t
;
10209 if (t
== error_mark_node
)
10211 result
= error_mark_node
;
10216 /* Update ARGS to restore the substitution from parameter packs to
10217 their argument packs. */
10218 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
10220 tree parm
= TREE_PURPOSE (pack
);
10222 if (TREE_CODE (parm
) == PARM_DECL
10223 || TREE_CODE (parm
) == FIELD_DECL
)
10224 register_local_specialization (TREE_TYPE (pack
), parm
);
10229 if (TREE_VALUE (pack
) == NULL_TREE
)
10232 template_parm_level_and_index (parm
, &level
, &idx
);
10234 /* Update the corresponding argument. */
10235 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
10236 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
10239 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
10243 if (need_local_specializations
)
10245 delete local_specializations
;
10246 local_specializations
= saved_local_specializations
;
10252 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
10253 TMPL. We do this using DECL_PARM_INDEX, which should work even with
10254 parameter packs; all parms generated from a function parameter pack will
10255 have the same DECL_PARM_INDEX. */
10258 get_pattern_parm (tree parm
, tree tmpl
)
10260 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
10263 if (DECL_ARTIFICIAL (parm
))
10265 for (patparm
= DECL_ARGUMENTS (pattern
);
10266 patparm
; patparm
= DECL_CHAIN (patparm
))
10267 if (DECL_ARTIFICIAL (patparm
)
10268 && DECL_NAME (parm
) == DECL_NAME (patparm
))
10273 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
10274 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
10275 gcc_assert (DECL_PARM_INDEX (patparm
)
10276 == DECL_PARM_INDEX (parm
));
10282 /* Substitute ARGS into the vector or list of template arguments T. */
10285 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
10288 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
10291 if (t
== error_mark_node
)
10292 return error_mark_node
;
10294 len
= TREE_VEC_LENGTH (t
);
10295 elts
= XALLOCAVEC (tree
, len
);
10297 for (i
= 0; i
< len
; i
++)
10299 tree orig_arg
= TREE_VEC_ELT (t
, i
);
10302 if (TREE_CODE (orig_arg
) == TREE_VEC
)
10303 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
10304 else if (PACK_EXPANSION_P (orig_arg
))
10306 /* Substitute into an expansion expression. */
10307 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
10309 if (TREE_CODE (new_arg
) == TREE_VEC
)
10310 /* Add to the expanded length adjustment the number of
10311 expanded arguments. We subtract one from this
10312 measurement, because the argument pack expression
10313 itself is already counted as 1 in
10314 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
10315 the argument pack is empty. */
10316 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
10318 else if (ARGUMENT_PACK_P (orig_arg
))
10320 /* Substitute into each of the arguments. */
10321 new_arg
= TYPE_P (orig_arg
)
10322 ? cxx_make_type (TREE_CODE (orig_arg
))
10323 : make_node (TREE_CODE (orig_arg
));
10325 SET_ARGUMENT_PACK_ARGS (
10327 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10328 args
, complain
, in_decl
));
10330 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10331 new_arg
= error_mark_node
;
10333 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10334 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10335 complain
, in_decl
);
10336 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10338 if (TREE_TYPE (new_arg
) == error_mark_node
)
10339 new_arg
= error_mark_node
;
10343 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10345 if (new_arg
== error_mark_node
)
10346 return error_mark_node
;
10349 if (new_arg
!= orig_arg
)
10356 /* Make space for the expanded arguments coming from template
10358 t
= make_tree_vec (len
+ expanded_len_adjust
);
10359 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10360 arguments for a member template.
10361 In that case each TREE_VEC in ORIG_T represents a level of template
10362 arguments, and ORIG_T won't carry any non defaulted argument count.
10363 It will rather be the nested TREE_VECs that will carry one.
10364 In other words, ORIG_T carries a non defaulted argument count only
10365 if it doesn't contain any nested TREE_VEC. */
10366 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10368 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10369 count
+= expanded_len_adjust
;
10370 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10372 for (i
= 0, out
= 0; i
< len
; i
++)
10374 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10375 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10376 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10380 /* Now expand the template argument pack "in place". */
10381 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10382 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10386 TREE_VEC_ELT (t
, out
) = elts
[i
];
10394 /* Return the result of substituting ARGS into the template parameters
10395 given by PARMS. If there are m levels of ARGS and m + n levels of
10396 PARMS, then the result will contain n levels of PARMS. For
10397 example, if PARMS is `template <class T> template <class U>
10398 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10399 result will be `template <int*, double, class V>'. */
10402 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10404 tree r
= NULL_TREE
;
10407 /* When substituting into a template, we must set
10408 PROCESSING_TEMPLATE_DECL as the template parameters may be
10409 dependent if they are based on one-another, and the dependency
10410 predicates are short-circuit outside of templates. */
10411 ++processing_template_decl
;
10413 for (new_parms
= &r
;
10414 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10415 new_parms
= &(TREE_CHAIN (*new_parms
)),
10416 parms
= TREE_CHAIN (parms
))
10419 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10422 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10426 if (parms
== error_mark_node
)
10429 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10431 if (tuple
== error_mark_node
)
10434 TREE_VEC_ELT (new_vec
, i
) =
10435 tsubst_template_parm (tuple
, args
, complain
);
10439 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10440 - TMPL_ARGS_DEPTH (args
)),
10441 new_vec
, NULL_TREE
);
10444 --processing_template_decl
;
10449 /* Return the result of substituting ARGS into one template parameter
10450 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10451 parameter and which TREE_PURPOSE is the default argument of the
10452 template parameter. */
10455 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10457 tree default_value
, parm_decl
;
10459 if (args
== NULL_TREE
10461 || t
== error_mark_node
)
10464 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10466 default_value
= TREE_PURPOSE (t
);
10467 parm_decl
= TREE_VALUE (t
);
10469 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10470 if (TREE_CODE (parm_decl
) == PARM_DECL
10471 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10472 parm_decl
= error_mark_node
;
10473 default_value
= tsubst_template_arg (default_value
, args
,
10474 complain
, NULL_TREE
);
10476 return build_tree_list (default_value
, parm_decl
);
10479 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10480 type T. If T is not an aggregate or enumeration type, it is
10481 handled as if by tsubst. IN_DECL is as for tsubst. If
10482 ENTERING_SCOPE is nonzero, T is the context for a template which
10483 we are presently tsubst'ing. Return the substituted value. */
10486 tsubst_aggr_type (tree t
,
10488 tsubst_flags_t complain
,
10490 int entering_scope
)
10492 if (t
== NULL_TREE
)
10495 switch (TREE_CODE (t
))
10498 if (TYPE_PTRMEMFUNC_P (t
))
10499 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10501 /* Else fall through. */
10502 case ENUMERAL_TYPE
:
10504 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10509 int saved_unevaluated_operand
;
10510 int saved_inhibit_evaluation_warnings
;
10512 /* In "sizeof(X<I>)" we need to evaluate "I". */
10513 saved_unevaluated_operand
= cp_unevaluated_operand
;
10514 cp_unevaluated_operand
= 0;
10515 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10516 c_inhibit_evaluation_warnings
= 0;
10518 /* First, determine the context for the type we are looking
10520 context
= TYPE_CONTEXT (t
);
10521 if (context
&& TYPE_P (context
))
10523 context
= tsubst_aggr_type (context
, args
, complain
,
10524 in_decl
, /*entering_scope=*/1);
10525 /* If context is a nested class inside a class template,
10526 it may still need to be instantiated (c++/33959). */
10527 context
= complete_type (context
);
10530 /* Then, figure out what arguments are appropriate for the
10531 type we are trying to find. For example, given:
10533 template <class T> struct S;
10534 template <class T, class U> void f(T, U) { S<U> su; }
10536 and supposing that we are instantiating f<int, double>,
10537 then our ARGS will be {int, double}, but, when looking up
10538 S we only want {double}. */
10539 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10540 complain
, in_decl
);
10541 if (argvec
== error_mark_node
)
10542 r
= error_mark_node
;
10545 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10546 entering_scope
, complain
);
10547 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10550 cp_unevaluated_operand
= saved_unevaluated_operand
;
10551 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10556 /* This is not a template type, so there's nothing to do. */
10560 return tsubst (t
, args
, complain
, in_decl
);
10564 /* Substitute into the default argument ARG (a default argument for
10565 FN), which has the indicated TYPE. */
10568 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10570 tree saved_class_ptr
= NULL_TREE
;
10571 tree saved_class_ref
= NULL_TREE
;
10572 int errs
= errorcount
+ sorrycount
;
10574 /* This can happen in invalid code. */
10575 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10578 /* This default argument came from a template. Instantiate the
10579 default argument here, not in tsubst. In the case of
10588 we must be careful to do name lookup in the scope of S<T>,
10589 rather than in the current class. */
10590 push_access_scope (fn
);
10591 /* The "this" pointer is not valid in a default argument. */
10594 saved_class_ptr
= current_class_ptr
;
10595 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10596 saved_class_ref
= current_class_ref
;
10597 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10600 push_deferring_access_checks(dk_no_deferred
);
10601 /* The default argument expression may cause implicitly defined
10602 member functions to be synthesized, which will result in garbage
10603 collection. We must treat this situation as if we were within
10604 the body of function so as to avoid collecting live data on the
10607 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10608 complain
, NULL_TREE
,
10609 /*integral_constant_expression_p=*/false);
10611 pop_deferring_access_checks();
10613 /* Restore the "this" pointer. */
10616 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10617 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10620 if (errorcount
+sorrycount
> errs
10621 && (complain
& tf_warning_or_error
))
10622 inform (input_location
,
10623 " when instantiating default argument for call to %D", fn
);
10625 /* Make sure the default argument is reasonable. */
10626 arg
= check_default_argument (type
, arg
, complain
);
10628 pop_access_scope (fn
);
10633 /* Substitute into all the default arguments for FN. */
10636 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10641 tmpl_args
= DECL_TI_ARGS (fn
);
10643 /* If this function is not yet instantiated, we certainly don't need
10644 its default arguments. */
10645 if (uses_template_parms (tmpl_args
))
10647 /* Don't do this again for clones. */
10648 if (DECL_CLONED_FUNCTION_P (fn
))
10651 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10653 arg
= TREE_CHAIN (arg
))
10654 if (TREE_PURPOSE (arg
))
10655 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10657 TREE_PURPOSE (arg
),
10661 /* Substitute the ARGS into the T, which is a _DECL. Return the
10662 result of the substitution. Issue error and warning messages under
10663 control of COMPLAIN. */
10666 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10668 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10669 location_t saved_loc
;
10670 tree r
= NULL_TREE
;
10672 hashval_t hash
= 0;
10674 /* Set the filename and linenumber to improve error-reporting. */
10675 saved_loc
= input_location
;
10676 input_location
= DECL_SOURCE_LOCATION (t
);
10678 switch (TREE_CODE (t
))
10680 case TEMPLATE_DECL
:
10682 /* We can get here when processing a member function template,
10683 member class template, or template template parameter. */
10684 tree decl
= DECL_TEMPLATE_RESULT (t
);
10689 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10691 /* Template template parameter is treated here. */
10692 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10693 if (new_type
== error_mark_node
)
10694 r
= error_mark_node
;
10695 /* If we get a real template back, return it. This can happen in
10696 the context of most_specialized_partial_spec. */
10697 else if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10700 /* The new TEMPLATE_DECL was built in
10701 reduce_template_parm_level. */
10702 r
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (new_type
);
10706 /* We might already have an instance of this template.
10707 The ARGS are for the surrounding class type, so the
10708 full args contain the tsubst'd args for the context,
10709 plus the innermost args from the template decl. */
10710 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10711 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10712 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10713 /* Because this is a template, the arguments will still be
10714 dependent, even after substitution. If
10715 PROCESSING_TEMPLATE_DECL is not set, the dependency
10716 predicates will short-circuit. */
10717 ++processing_template_decl
;
10718 full_args
= tsubst_template_args (tmpl_args
, args
,
10719 complain
, in_decl
);
10720 --processing_template_decl
;
10721 if (full_args
== error_mark_node
)
10722 RETURN (error_mark_node
);
10724 /* If this is a default template template argument,
10725 tsubst might not have changed anything. */
10726 if (full_args
== tmpl_args
)
10729 hash
= hash_tmpl_and_args (t
, full_args
);
10730 spec
= retrieve_specialization (t
, full_args
, hash
);
10731 if (spec
!= NULL_TREE
)
10737 /* Make a new template decl. It will be similar to the
10738 original, but will record the current template arguments.
10739 We also create a new function declaration, which is just
10740 like the old one, but points to this new template, rather
10741 than the old one. */
10743 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10744 DECL_CHAIN (r
) = NULL_TREE
;
10746 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10748 if (TREE_CODE (decl
) == TYPE_DECL
10749 && !TYPE_DECL_ALIAS_P (decl
))
10752 ++processing_template_decl
;
10753 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10754 --processing_template_decl
;
10755 if (new_type
== error_mark_node
)
10756 RETURN (error_mark_node
);
10758 TREE_TYPE (r
) = new_type
;
10759 /* For a partial specialization, we need to keep pointing to
10760 the primary template. */
10761 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10762 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10763 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10764 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10765 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10770 ++processing_template_decl
;
10771 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10772 --processing_template_decl
;
10773 if (new_decl
== error_mark_node
)
10774 RETURN (error_mark_node
);
10776 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10777 DECL_TI_TEMPLATE (new_decl
) = r
;
10778 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10779 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10780 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10783 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10784 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10785 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10787 /* The template parameters for this new template are all the
10788 template parameters for the old template, except the
10789 outermost level of parameters. */
10790 DECL_TEMPLATE_PARMS (r
)
10791 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10794 if (PRIMARY_TEMPLATE_P (t
))
10795 DECL_PRIMARY_TEMPLATE (r
) = r
;
10797 if (TREE_CODE (decl
) != TYPE_DECL
&& !VAR_P (decl
))
10798 /* Record this non-type partial instantiation. */
10799 register_specialization (r
, t
,
10800 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10805 case FUNCTION_DECL
:
10808 tree argvec
= NULL_TREE
;
10816 /* Nobody should be tsubst'ing into non-template functions. */
10817 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10819 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10824 /* If T is not dependent, just return it. We have to
10825 increment PROCESSING_TEMPLATE_DECL because
10826 value_dependent_expression_p assumes that nothing is
10827 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10828 ++processing_template_decl
;
10829 dependent_p
= value_dependent_expression_p (t
);
10830 --processing_template_decl
;
10834 /* Calculate the most general template of which R is a
10835 specialization, and the complete set of arguments used to
10837 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10838 argvec
= tsubst_template_args (DECL_TI_ARGS
10839 (DECL_TEMPLATE_RESULT
10840 (DECL_TI_TEMPLATE (t
))),
10841 args
, complain
, in_decl
);
10842 if (argvec
== error_mark_node
)
10843 RETURN (error_mark_node
);
10845 /* Check to see if we already have this specialization. */
10846 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10847 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10855 /* We can see more levels of arguments than parameters if
10856 there was a specialization of a member template, like
10859 template <class T> struct S { template <class U> void f(); }
10860 template <> template <class U> void S<int>::f(U);
10862 Here, we'll be substituting into the specialization,
10863 because that's where we can find the code we actually
10864 want to generate, but we'll have enough arguments for
10865 the most general template.
10867 We also deal with the peculiar case:
10869 template <class T> struct S {
10870 template <class U> friend void f();
10872 template <class U> void f() {}
10874 template void f<double>();
10876 Here, the ARGS for the instantiation of will be {int,
10877 double}. But, we only need as many ARGS as there are
10878 levels of template parameters in CODE_PATTERN. We are
10879 careful not to get fooled into reducing the ARGS in
10882 template <class T> struct S { template <class U> void f(U); }
10883 template <class T> template <> void S<T>::f(int) {}
10885 which we can spot because the pattern will be a
10886 specialization in this case. */
10887 args_depth
= TMPL_ARGS_DEPTH (args
);
10889 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10890 if (args_depth
> parms_depth
10891 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10892 args
= get_innermost_template_args (args
, parms_depth
);
10896 /* This special case arises when we have something like this:
10898 template <class T> struct S {
10899 friend void f<int>(int, double);
10902 Here, the DECL_TI_TEMPLATE for the friend declaration
10903 will be an IDENTIFIER_NODE. We are being called from
10904 tsubst_friend_function, and we want only to create a
10905 new decl (R) with appropriate types so that we can call
10906 determine_specialization. */
10907 gen_tmpl
= NULL_TREE
;
10910 if (DECL_CLASS_SCOPE_P (t
))
10912 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10916 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10917 complain
, t
, /*entering_scope=*/1);
10922 ctx
= DECL_CONTEXT (t
);
10924 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10925 if (type
== error_mark_node
)
10926 RETURN (error_mark_node
);
10928 /* If we hit excessive deduction depth, the type is bogus even if
10929 it isn't error_mark_node, so don't build a decl. */
10930 if (excessive_deduction_depth
)
10931 RETURN (error_mark_node
);
10933 /* We do NOT check for matching decls pushed separately at this
10934 point, as they may not represent instantiations of this
10935 template, and in any case are considered separate under the
10938 DECL_USE_TEMPLATE (r
) = 0;
10939 TREE_TYPE (r
) = type
;
10940 /* Clear out the mangled name and RTL for the instantiation. */
10941 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10942 SET_DECL_RTL (r
, NULL
);
10943 /* Leave DECL_INITIAL set on deleted instantiations. */
10944 if (!DECL_DELETED_FN (r
))
10945 DECL_INITIAL (r
) = NULL_TREE
;
10946 DECL_CONTEXT (r
) = ctx
;
10948 /* OpenMP UDRs have the only argument a reference to the declared
10949 type. We want to diagnose if the declared type is a reference,
10950 which is invalid, but as references to references are usually
10951 quietly merged, diagnose it here. */
10952 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10955 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10956 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10957 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10958 error_at (DECL_SOURCE_LOCATION (t
),
10959 "reference type %qT in "
10960 "%<#pragma omp declare reduction%>", argtype
);
10961 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10962 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10966 if (member
&& DECL_CONV_FN_P (r
))
10967 /* Type-conversion operator. Reconstruct the name, in
10968 case it's the name of one of the template's parameters. */
10969 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10971 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10973 DECL_RESULT (r
) = NULL_TREE
;
10975 TREE_STATIC (r
) = 0;
10976 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10977 DECL_EXTERNAL (r
) = 1;
10978 /* If this is an instantiation of a function with internal
10979 linkage, we already know what object file linkage will be
10980 assigned to the instantiation. */
10981 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10982 DECL_DEFER_OUTPUT (r
) = 0;
10983 DECL_CHAIN (r
) = NULL_TREE
;
10984 DECL_PENDING_INLINE_INFO (r
) = 0;
10985 DECL_PENDING_INLINE_P (r
) = 0;
10986 DECL_SAVED_TREE (r
) = NULL_TREE
;
10987 DECL_STRUCT_FUNCTION (r
) = NULL
;
10989 /* We'll re-clone as appropriate in instantiate_template. */
10990 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10992 /* If we aren't complaining now, return on error before we register
10993 the specialization so that we'll complain eventually. */
10994 if ((complain
& tf_error
) == 0
10995 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10996 && !grok_op_properties (r
, /*complain=*/false))
10997 RETURN (error_mark_node
);
10999 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
11000 this in the special friend case mentioned above where
11001 GEN_TMPL is NULL. */
11004 DECL_TEMPLATE_INFO (r
)
11005 = build_template_info (gen_tmpl
, argvec
);
11006 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11009 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11011 /* We instantiated this while substituting into
11012 the type earlier (template/friend54.C). */
11015 /* We're not supposed to instantiate default arguments
11016 until they are called, for a template. But, for a
11019 template <class T> void f ()
11020 { extern void g(int i = T()); }
11022 we should do the substitution when the template is
11023 instantiated. We handle the member function case in
11024 instantiate_class_template since the default arguments
11025 might refer to other members of the class. */
11027 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
11028 && !uses_template_parms (argvec
))
11029 tsubst_default_arguments (r
, complain
);
11032 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
11034 /* Copy the list of befriending classes. */
11035 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
11037 friends
= &TREE_CHAIN (*friends
))
11039 *friends
= copy_node (*friends
);
11040 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
11045 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
11047 maybe_retrofit_in_chrg (r
);
11048 if (DECL_CONSTRUCTOR_P (r
))
11049 grok_ctor_properties (ctx
, r
);
11050 if (DECL_INHERITED_CTOR_BASE (r
))
11051 deduce_inheriting_ctor (r
);
11052 /* If this is an instantiation of a member template, clone it.
11053 If it isn't, that'll be handled by
11054 clone_constructors_and_destructors. */
11055 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
11056 clone_function_decl (r
, /*update_method_vec_p=*/0);
11058 else if ((complain
& tf_error
) != 0
11059 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
11060 && !grok_op_properties (r
, /*complain=*/true))
11061 RETURN (error_mark_node
);
11063 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
11064 SET_DECL_FRIEND_CONTEXT (r
,
11065 tsubst (DECL_FRIEND_CONTEXT (t
),
11066 args
, complain
, in_decl
));
11068 /* Possibly limit visibility based on template args. */
11069 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11070 if (DECL_VISIBILITY_SPECIFIED (t
))
11072 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11073 DECL_ATTRIBUTES (r
)
11074 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11076 determine_visibility (r
);
11077 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
11078 && !processing_template_decl
)
11079 defaulted_late_check (r
);
11081 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11082 args
, complain
, in_decl
);
11088 tree type
= NULL_TREE
;
11090 tree expanded_types
= NULL_TREE
;
11091 tree prev_r
= NULL_TREE
;
11092 tree first_r
= NULL_TREE
;
11094 if (DECL_PACK_P (t
))
11096 /* If there is a local specialization that isn't a
11097 parameter pack, it means that we're doing a "simple"
11098 substitution from inside tsubst_pack_expansion. Just
11099 return the local specialization (which will be a single
11101 tree spec
= retrieve_local_specialization (t
);
11103 && TREE_CODE (spec
) == PARM_DECL
11104 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
11107 /* Expand the TYPE_PACK_EXPANSION that provides the types for
11108 the parameters in this function parameter pack. */
11109 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11110 complain
, in_decl
);
11111 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11113 len
= TREE_VEC_LENGTH (expanded_types
);
11115 /* Zero-length parameter packs are boring. Just substitute
11118 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
11123 /* All we did was update the type. Make a note of that. */
11124 type
= expanded_types
;
11125 expanded_types
= NULL_TREE
;
11129 /* Loop through all of the parameters we'll build. When T is
11130 a function parameter pack, LEN is the number of expanded
11131 types in EXPANDED_TYPES; otherwise, LEN is 1. */
11133 for (i
= 0; i
< len
; ++i
)
11137 if (DECL_TEMPLATE_PARM_P (t
))
11138 SET_DECL_TEMPLATE_PARM_P (r
);
11140 if (expanded_types
)
11141 /* We're on the Ith parameter of the function parameter
11144 /* Get the Ith type. */
11145 type
= TREE_VEC_ELT (expanded_types
, i
);
11147 /* Rename the parameter to include the index. */
11149 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11152 /* We're dealing with a normal parameter. */
11153 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11155 type
= type_decays_to (type
);
11156 TREE_TYPE (r
) = type
;
11157 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11159 if (DECL_INITIAL (r
))
11161 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
11162 DECL_INITIAL (r
) = TREE_TYPE (r
);
11164 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
11165 complain
, in_decl
);
11168 DECL_CONTEXT (r
) = NULL_TREE
;
11170 if (!DECL_TEMPLATE_PARM_P (r
))
11171 DECL_ARG_TYPE (r
) = type_passed_as (type
);
11173 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11174 args
, complain
, in_decl
);
11176 /* Keep track of the first new parameter we
11177 generate. That's what will be returned to the
11182 /* Build a proper chain of parameters when substituting
11183 into a function parameter pack. */
11185 DECL_CHAIN (prev_r
) = r
;
11188 /* If cp_unevaluated_operand is set, we're just looking for a
11189 single dummy parameter, so don't keep going. */
11190 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
11191 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
11192 complain
, DECL_CHAIN (t
));
11194 /* FIRST_R contains the start of the chain we've built. */
11201 tree type
= NULL_TREE
;
11202 tree vec
= NULL_TREE
;
11203 tree expanded_types
= NULL_TREE
;
11206 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
11208 /* This field is a lambda capture pack. Return a TREE_VEC of
11209 the expanded fields to instantiate_class_template_1 and
11210 store them in the specializations hash table as a
11211 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
11212 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
11213 complain
, in_decl
);
11214 if (TREE_CODE (expanded_types
) == TREE_VEC
)
11216 len
= TREE_VEC_LENGTH (expanded_types
);
11217 vec
= make_tree_vec (len
);
11221 /* All we did was update the type. Make a note of that. */
11222 type
= expanded_types
;
11223 expanded_types
= NULL_TREE
;
11227 for (int i
= 0; i
< len
; ++i
)
11230 if (expanded_types
)
11232 type
= TREE_VEC_ELT (expanded_types
, i
);
11234 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
11237 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11239 if (type
== error_mark_node
)
11240 RETURN (error_mark_node
);
11241 TREE_TYPE (r
) = type
;
11242 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11244 if (DECL_C_BIT_FIELD (r
))
11245 /* For bit-fields, DECL_INITIAL gives the number of bits. For
11246 non-bit-fields DECL_INITIAL is a non-static data member
11247 initializer, which gets deferred instantiation. */
11249 = tsubst_expr (DECL_INITIAL (t
), args
,
11251 /*integral_constant_expression_p=*/true);
11252 else if (DECL_INITIAL (t
))
11254 /* Set up DECL_TEMPLATE_INFO so that we can get at the
11255 NSDMI in perform_member_init. Still set DECL_INITIAL
11256 so that we know there is one. */
11257 DECL_INITIAL (r
) = void_node
;
11258 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
11259 retrofit_lang_decl (r
);
11260 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
11262 /* We don't have to set DECL_CONTEXT here; it is set by
11263 finish_member_declaration. */
11264 DECL_CHAIN (r
) = NULL_TREE
;
11266 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
11267 args
, complain
, in_decl
);
11270 TREE_VEC_ELT (vec
, i
) = r
;
11276 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
11277 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
11278 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
11279 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
11280 TREE_TYPE (pack
) = tpack
;
11281 register_specialization (pack
, t
, args
, false, 0);
11287 /* We reach here only for member using decls. We also need to check
11288 uses_template_parms because DECL_DEPENDENT_P is not set for a
11289 using-declaration that designates a member of the current
11290 instantiation (c++/53549). */
11291 if (DECL_DEPENDENT_P (t
)
11292 || uses_template_parms (USING_DECL_SCOPE (t
)))
11294 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
11295 complain
, in_decl
);
11296 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
11297 r
= do_class_using_decl (inst_scope
, name
);
11299 r
= error_mark_node
;
11302 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
11303 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
11309 DECL_CHAIN (r
) = NULL_TREE
;
11316 tree argvec
= NULL_TREE
;
11317 tree gen_tmpl
= NULL_TREE
;
11319 tree tmpl
= NULL_TREE
;
11321 tree type
= NULL_TREE
;
11324 if (TREE_TYPE (t
) == error_mark_node
)
11325 RETURN (error_mark_node
);
11327 if (TREE_CODE (t
) == TYPE_DECL
11328 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11330 /* If this is the canonical decl, we don't have to
11331 mess with instantiations, and often we can't (for
11332 typename, template type parms and such). Note that
11333 TYPE_NAME is not correct for the above test if
11334 we've copied the type for a typedef. */
11335 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11336 if (type
== error_mark_node
)
11337 RETURN (error_mark_node
);
11338 r
= TYPE_NAME (type
);
11342 /* Check to see if we already have the specialization we
11345 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11347 /* T is a static data member or namespace-scope entity.
11348 We have to substitute into namespace-scope variables
11349 (not just variable templates) because of cases like:
11351 template <class T> void f() { extern T t; }
11353 where the entity referenced is not known until
11354 instantiation time. */
11356 ctx
= DECL_CONTEXT (t
);
11357 if (DECL_CLASS_SCOPE_P (t
))
11359 ctx
= tsubst_aggr_type (ctx
, args
,
11361 in_decl
, /*entering_scope=*/1);
11362 /* If CTX is unchanged, then T is in fact the
11363 specialization we want. That situation occurs when
11364 referencing a static data member within in its own
11365 class. We can use pointer equality, rather than
11366 same_type_p, because DECL_CONTEXT is always
11368 if (ctx
== DECL_CONTEXT (t
)
11369 /* ... unless T is a member template; in which
11370 case our caller can be willing to create a
11371 specialization of that template represented
11373 && !(DECL_TI_TEMPLATE (t
)
11374 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
))))
11380 tmpl
= DECL_TI_TEMPLATE (t
);
11381 gen_tmpl
= most_general_template (tmpl
);
11382 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11383 if (argvec
!= error_mark_node
)
11384 argvec
= (coerce_innermost_template_parms
11385 (DECL_TEMPLATE_PARMS (gen_tmpl
),
11386 argvec
, t
, complain
,
11387 /*all*/true, /*defarg*/true));
11388 if (argvec
== error_mark_node
)
11389 RETURN (error_mark_node
);
11390 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11391 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11396 /* A local variable. */
11398 /* Subsequent calls to pushdecl will fill this in. */
11400 spec
= retrieve_local_specialization (t
);
11402 /* If we already have the specialization we need, there is
11403 nothing more to do. */
11410 /* Create a new node for the specialization we need. */
11412 if (type
== NULL_TREE
)
11414 if (is_typedef_decl (t
))
11415 type
= DECL_ORIGINAL_TYPE (t
);
11417 type
= TREE_TYPE (t
);
11419 && VAR_HAD_UNKNOWN_BOUND (t
)
11420 && type
!= error_mark_node
)
11421 type
= strip_array_domain (type
);
11422 type
= tsubst (type
, args
, complain
, in_decl
);
11426 /* Even if the original location is out of scope, the
11427 newly substituted one is not. */
11428 DECL_DEAD_FOR_LOCAL (r
) = 0;
11429 DECL_INITIALIZED_P (r
) = 0;
11430 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11431 if (type
== error_mark_node
)
11432 RETURN (error_mark_node
);
11433 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11435 /* It may seem that this case cannot occur, since:
11440 declares a function, not a variable. However:
11443 template <typename T> void g() { T t; }
11444 template void g<f>();
11446 is an attempt to declare a variable with function
11448 error ("variable %qD has function type",
11449 /* R is not yet sufficiently initialized, so we
11450 just use its name. */
11452 RETURN (error_mark_node
);
11454 type
= complete_type (type
);
11455 /* Wait until cp_finish_decl to set this again, to handle
11456 circular dependency (template/instantiate6.C). */
11457 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11458 type
= check_var_type (DECL_NAME (r
), type
);
11460 if (DECL_HAS_VALUE_EXPR_P (t
))
11462 tree ve
= DECL_VALUE_EXPR (t
);
11463 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11464 /*constant_expression_p=*/false);
11465 if (REFERENCE_REF_P (ve
))
11467 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11468 ve
= TREE_OPERAND (ve
, 0);
11470 SET_DECL_VALUE_EXPR (r
, ve
);
11472 if (CP_DECL_THREAD_LOCAL_P (r
)
11473 && !processing_template_decl
)
11474 set_decl_tls_model (r
, decl_default_tls_model (r
));
11476 else if (DECL_SELF_REFERENCE_P (t
))
11477 SET_DECL_SELF_REFERENCE_P (r
);
11478 TREE_TYPE (r
) = type
;
11479 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11480 DECL_CONTEXT (r
) = ctx
;
11481 /* Clear out the mangled name and RTL for the instantiation. */
11482 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11483 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11484 SET_DECL_RTL (r
, NULL
);
11485 /* The initializer must not be expanded until it is required;
11486 see [temp.inst]. */
11487 DECL_INITIAL (r
) = NULL_TREE
;
11488 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11489 SET_DECL_RTL (r
, NULL
);
11490 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11493 /* Possibly limit visibility based on template args. */
11494 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11495 if (DECL_VISIBILITY_SPECIFIED (t
))
11497 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11498 DECL_ATTRIBUTES (r
)
11499 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11501 determine_visibility (r
);
11506 /* A static data member declaration is always marked
11507 external when it is declared in-class, even if an
11508 initializer is present. We mimic the non-template
11509 processing here. */
11510 DECL_EXTERNAL (r
) = 1;
11511 if (DECL_NAMESPACE_SCOPE_P (t
))
11512 DECL_NOT_REALLY_EXTERN (r
) = 1;
11514 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11515 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11516 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11518 else if (!cp_unevaluated_operand
)
11519 register_local_specialization (r
, t
);
11521 DECL_CHAIN (r
) = NULL_TREE
;
11523 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11525 args
, complain
, in_decl
);
11527 /* Preserve a typedef that names a type. */
11528 if (is_typedef_decl (r
))
11530 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11531 set_underlying_type (r
);
11534 layout_decl (r
, 0);
11539 gcc_unreachable ();
11544 /* Restore the file and line information. */
11545 input_location
= saved_loc
;
11550 /* Substitute into the ARG_TYPES of a function type.
11551 If END is a TREE_CHAIN, leave it and any following types
11555 tsubst_arg_types (tree arg_types
,
11558 tsubst_flags_t complain
,
11561 tree remaining_arg_types
;
11562 tree type
= NULL_TREE
;
11564 tree expanded_args
= NULL_TREE
;
11567 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11570 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11571 args
, end
, complain
, in_decl
);
11572 if (remaining_arg_types
== error_mark_node
)
11573 return error_mark_node
;
11575 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11577 /* For a pack expansion, perform substitution on the
11578 entire expression. Later on, we'll handle the arguments
11580 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11581 args
, complain
, in_decl
);
11583 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11584 /* So that we'll spin through the parameters, one by one. */
11585 i
= TREE_VEC_LENGTH (expanded_args
);
11588 /* We only partially substituted into the parameter
11589 pack. Our type is TYPE_PACK_EXPANSION. */
11590 type
= expanded_args
;
11591 expanded_args
= NULL_TREE
;
11599 type
= TREE_VEC_ELT (expanded_args
, i
);
11601 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11603 if (type
== error_mark_node
)
11604 return error_mark_node
;
11605 if (VOID_TYPE_P (type
))
11607 if (complain
& tf_error
)
11609 error ("invalid parameter type %qT", type
);
11611 error ("in declaration %q+D", in_decl
);
11613 return error_mark_node
;
11616 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11617 return error_mark_node
;
11619 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11620 top-level qualifiers as required. */
11621 type
= cv_unqualified (type_decays_to (type
));
11623 /* We do not substitute into default arguments here. The standard
11624 mandates that they be instantiated only when needed, which is
11625 done in build_over_call. */
11626 default_arg
= TREE_PURPOSE (arg_types
);
11628 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11630 /* We've instantiated a template before its default arguments
11631 have been parsed. This can happen for a nested template
11632 class, and is not an error unless we require the default
11633 argument in a call of this function. */
11634 remaining_arg_types
=
11635 tree_cons (default_arg
, type
, remaining_arg_types
);
11636 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11639 remaining_arg_types
=
11640 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11643 return remaining_arg_types
;
11646 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11647 *not* handle the exception-specification for FNTYPE, because the
11648 initial substitution of explicitly provided template parameters
11649 during argument deduction forbids substitution into the
11650 exception-specification:
11654 All references in the function type of the function template to the
11655 corresponding template parameters are replaced by the specified tem-
11656 plate argument values. If a substitution in a template parameter or
11657 in the function type of the function template results in an invalid
11658 type, type deduction fails. [Note: The equivalent substitution in
11659 exception specifications is done only when the function is instanti-
11660 ated, at which point a program is ill-formed if the substitution
11661 results in an invalid type.] */
11664 tsubst_function_type (tree t
,
11666 tsubst_flags_t complain
,
11670 tree arg_types
= NULL_TREE
;
11673 /* The TYPE_CONTEXT is not used for function/method types. */
11674 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11676 /* DR 1227: Mixing immediate and non-immediate contexts in deduction
11678 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t
);
11680 if (late_return_type_p
)
11682 /* Substitute the argument types. */
11683 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11684 complain
, in_decl
);
11685 if (arg_types
== error_mark_node
)
11686 return error_mark_node
;
11688 tree save_ccp
= current_class_ptr
;
11689 tree save_ccr
= current_class_ref
;
11690 tree this_type
= (TREE_CODE (t
) == METHOD_TYPE
11691 ? TREE_TYPE (TREE_VALUE (arg_types
)) : NULL_TREE
);
11692 bool do_inject
= this_type
&& CLASS_TYPE_P (this_type
);
11695 /* DR 1207: 'this' is in scope in the trailing return type. */
11696 inject_this_parameter (this_type
, cp_type_quals (this_type
));
11699 /* Substitute the return type. */
11700 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11704 current_class_ptr
= save_ccp
;
11705 current_class_ref
= save_ccr
;
11709 /* Substitute the return type. */
11710 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11712 if (return_type
== error_mark_node
)
11713 return error_mark_node
;
11714 /* DR 486 clarifies that creation of a function type with an
11715 invalid return type is a deduction failure. */
11716 if (TREE_CODE (return_type
) == ARRAY_TYPE
11717 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11719 if (complain
& tf_error
)
11721 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11722 error ("function returning an array");
11724 error ("function returning a function");
11726 return error_mark_node
;
11729 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11730 return error_mark_node
;
11732 if (!late_return_type_p
)
11734 /* Substitute the argument types. */
11735 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11736 complain
, in_decl
);
11737 if (arg_types
== error_mark_node
)
11738 return error_mark_node
;
11741 /* Construct a new type node and return it. */
11742 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11744 fntype
= build_function_type (return_type
, arg_types
);
11745 fntype
= apply_memfn_quals (fntype
,
11746 type_memfn_quals (t
),
11747 type_memfn_rqual (t
));
11751 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11752 /* Don't pick up extra function qualifiers from the basetype. */
11753 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11754 if (! MAYBE_CLASS_TYPE_P (r
))
11758 Type deduction may fail for any of the following
11761 -- Attempting to create "pointer to member of T" when T
11762 is not a class type. */
11763 if (complain
& tf_error
)
11764 error ("creating pointer to member function of non-class type %qT",
11766 return error_mark_node
;
11769 fntype
= build_method_type_directly (r
, return_type
,
11770 TREE_CHAIN (arg_types
));
11771 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11773 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11775 if (late_return_type_p
)
11776 TYPE_HAS_LATE_RETURN_TYPE (fntype
) = 1;
11781 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11782 ARGS into that specification, and return the substituted
11783 specification. If there is no specification, return NULL_TREE. */
11786 tsubst_exception_specification (tree fntype
,
11788 tsubst_flags_t complain
,
11795 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11796 new_specs
= NULL_TREE
;
11797 if (specs
&& TREE_PURPOSE (specs
))
11799 /* A noexcept-specifier. */
11800 tree expr
= TREE_PURPOSE (specs
);
11801 if (TREE_CODE (expr
) == INTEGER_CST
)
11805 /* Defer instantiation of noexcept-specifiers to avoid
11806 excessive instantiations (c++/49107). */
11807 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11808 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11810 /* We already partially instantiated this member template,
11811 so combine the new args with the old. */
11812 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11813 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11814 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11815 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11819 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11820 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11824 new_specs
= tsubst_copy_and_build
11825 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11826 /*integral_constant_expression_p=*/true);
11827 new_specs
= build_noexcept_spec (new_specs
, complain
);
11831 if (! TREE_VALUE (specs
))
11838 tree expanded_specs
= NULL_TREE
;
11840 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11842 /* Expand the pack expansion type. */
11843 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11847 if (expanded_specs
== error_mark_node
)
11848 return error_mark_node
;
11849 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11850 len
= TREE_VEC_LENGTH (expanded_specs
);
11853 /* We're substituting into a member template, so
11854 we got a TYPE_PACK_EXPANSION back. Add that
11855 expansion and move on. */
11856 gcc_assert (TREE_CODE (expanded_specs
)
11857 == TYPE_PACK_EXPANSION
);
11858 new_specs
= add_exception_specifier (new_specs
,
11861 specs
= TREE_CHAIN (specs
);
11866 for (i
= 0; i
< len
; ++i
)
11868 if (expanded_specs
)
11869 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11871 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11872 if (spec
== error_mark_node
)
11874 new_specs
= add_exception_specifier (new_specs
, spec
,
11878 specs
= TREE_CHAIN (specs
);
11884 /* Take the tree structure T and replace template parameters used
11885 therein with the argument vector ARGS. IN_DECL is an associated
11886 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11887 Issue error and warning messages under control of COMPLAIN. Note
11888 that we must be relatively non-tolerant of extensions here, in
11889 order to preserve conformance; if we allow substitutions that
11890 should not be allowed, we may allow argument deductions that should
11891 not succeed, and therefore report ambiguous overload situations
11892 where there are none. In theory, we could allow the substitution,
11893 but indicate that it should have failed, and allow our caller to
11894 make sure that the right thing happens, but we don't try to do this
11897 This function is used for dealing with types, decls and the like;
11898 for expressions, use tsubst_expr or tsubst_copy. */
11901 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11903 enum tree_code code
;
11904 tree type
, r
= NULL_TREE
;
11906 if (t
== NULL_TREE
|| t
== error_mark_node
11907 || t
== integer_type_node
11908 || t
== void_type_node
11909 || t
== char_type_node
11910 || t
== unknown_type_node
11911 || TREE_CODE (t
) == NAMESPACE_DECL
11912 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11916 return tsubst_decl (t
, args
, complain
);
11918 if (args
== NULL_TREE
)
11921 code
= TREE_CODE (t
);
11923 if (code
== IDENTIFIER_NODE
)
11924 type
= IDENTIFIER_TYPE_VALUE (t
);
11926 type
= TREE_TYPE (t
);
11928 gcc_assert (type
!= unknown_type_node
);
11930 /* Reuse typedefs. We need to do this to handle dependent attributes,
11931 such as attribute aligned. */
11933 && typedef_variant_p (t
))
11935 tree decl
= TYPE_NAME (t
);
11937 if (alias_template_specialization_p (t
))
11939 /* DECL represents an alias template and we want to
11941 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11942 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11943 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11945 else if (DECL_CLASS_SCOPE_P (decl
)
11946 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11947 && uses_template_parms (DECL_CONTEXT (decl
)))
11949 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11950 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11951 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11953 else if (DECL_FUNCTION_SCOPE_P (decl
)
11954 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11955 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11956 r
= retrieve_local_specialization (decl
);
11958 /* The typedef is from a non-template context. */
11964 r
= cp_build_qualified_type_real
11965 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11966 complain
| tf_ignore_bad_quals
);
11971 /* We don't have an instantiation yet, so drop the typedef. */
11972 int quals
= cp_type_quals (t
);
11973 t
= DECL_ORIGINAL_TYPE (decl
);
11974 t
= cp_build_qualified_type_real (t
, quals
,
11975 complain
| tf_ignore_bad_quals
);
11980 && code
!= TYPENAME_TYPE
11981 && code
!= TEMPLATE_TYPE_PARM
11982 && code
!= IDENTIFIER_NODE
11983 && code
!= FUNCTION_TYPE
11984 && code
!= METHOD_TYPE
)
11985 type
= tsubst (type
, args
, complain
, in_decl
);
11986 if (type
== error_mark_node
)
11987 return error_mark_node
;
11993 case ENUMERAL_TYPE
:
11994 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11995 /*entering_scope=*/0);
11998 case IDENTIFIER_NODE
:
12009 if (t
== integer_type_node
)
12012 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
12013 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
12017 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
12019 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
12020 /*integral_constant_expression_p=*/false);
12022 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
12024 if (TREE_CODE (max
) == NOP_EXPR
12025 && TREE_SIDE_EFFECTS (omax
)
12026 && !TREE_TYPE (max
))
12027 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
12029 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
12030 with TREE_SIDE_EFFECTS that indicates this is not an integral
12031 constant expression. */
12032 if (processing_template_decl
12033 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
12035 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
12036 TREE_SIDE_EFFECTS (max
) = 1;
12039 return compute_array_index_type (NULL_TREE
, max
, complain
);
12042 case TEMPLATE_TYPE_PARM
:
12043 case TEMPLATE_TEMPLATE_PARM
:
12044 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12045 case TEMPLATE_PARM_INDEX
:
12050 tree arg
= NULL_TREE
;
12054 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
12055 template_parm_level_and_index (t
, &level
, &idx
);
12057 levels
= TMPL_ARGS_DEPTH (args
);
12058 if (level
<= levels
)
12060 arg
= TMPL_ARG (args
, level
, idx
);
12062 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
12064 /* See through ARGUMENT_PACK_SELECT arguments. */
12065 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
12066 /* If the selected argument is an expansion E, that most
12067 likely means we were called from
12068 gen_elem_of_pack_expansion_instantiation during the
12069 substituting of pack an argument pack (which Ith
12070 element is a pack expansion, where I is
12071 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
12072 In this case, the Ith element resulting from this
12073 substituting is going to be a pack expansion, which
12074 pattern is the pattern of E. Let's return the
12076 gen_elem_of_pack_expansion_instantiation will
12077 build the resulting pack expansion from it. */
12078 if (PACK_EXPANSION_P (arg
))
12080 /* Make sure we aren't throwing away arg info. */
12081 gcc_assert (!PACK_EXPANSION_EXTRA_ARGS (arg
));
12082 arg
= PACK_EXPANSION_PATTERN (arg
);
12087 if (arg
== error_mark_node
)
12088 return error_mark_node
;
12089 else if (arg
!= NULL_TREE
)
12091 if (ARGUMENT_PACK_P (arg
))
12092 /* If ARG is an argument pack, we don't actually want to
12093 perform a substitution here, because substitutions
12094 for argument packs are only done
12095 element-by-element. We can get to this point when
12096 substituting the type of a non-type template
12097 parameter pack, when that type actually contains
12098 template parameter packs from an outer template, e.g.,
12100 template<typename... Types> struct A {
12101 template<Types... Values> struct B { };
12105 if (code
== TEMPLATE_TYPE_PARM
)
12108 gcc_assert (TYPE_P (arg
));
12110 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
12112 return cp_build_qualified_type_real
12113 (arg
, quals
, complain
| tf_ignore_bad_quals
);
12115 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12117 /* We are processing a type constructed from a
12118 template template parameter. */
12119 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
12120 args
, complain
, in_decl
);
12121 if (argvec
== error_mark_node
)
12122 return error_mark_node
;
12124 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
12125 || TREE_CODE (arg
) == TEMPLATE_DECL
12126 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
12128 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
12129 /* Consider this code:
12131 template <template <class> class Template>
12133 template <class Arg> using Bind = Template<Arg>;
12136 template <template <class> class Template, class Arg>
12137 using Instantiate = Template<Arg>; //#0
12139 template <template <class> class Template,
12142 Instantiate<Internal<Template>::template Bind,
12145 When #1 is parsed, the
12146 BOUND_TEMPLATE_TEMPLATE_PARM representing the
12147 parameter `Template' in #0 matches the
12148 UNBOUND_CLASS_TEMPLATE representing the argument
12149 `Internal<Template>::template Bind'; We then want
12150 to assemble the type `Bind<Argument>' that can't
12151 be fully created right now, because
12152 `Internal<Template>' not being complete, the Bind
12153 template cannot be looked up in that context. So
12154 we need to "store" `Bind<Argument>' for later
12155 when the context of Bind becomes complete. Let's
12156 store that in a TYPENAME_TYPE. */
12157 return make_typename_type (TYPE_CONTEXT (arg
),
12158 build_nt (TEMPLATE_ID_EXPR
,
12159 TYPE_IDENTIFIER (arg
),
12164 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
12165 are resolving nested-types in the signature of a
12166 member function templates. Otherwise ARG is a
12167 TEMPLATE_DECL and is the real template to be
12169 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12170 arg
= TYPE_NAME (arg
);
12172 r
= lookup_template_class (arg
,
12174 DECL_CONTEXT (arg
),
12175 /*entering_scope=*/0,
12177 return cp_build_qualified_type_real
12178 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
12181 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
12182 return convert_from_reference (unshare_expr (arg
));
12186 /* This can happen during the attempted tsubst'ing in
12187 unify. This means that we don't yet have any information
12188 about the template parameter in question. */
12191 /* Early in template argument deduction substitution, we don't
12192 want to reduce the level of 'auto', or it will be confused
12193 with a normal template parm in subsequent deduction. */
12194 if (is_auto (t
) && (complain
& tf_partial
))
12197 /* If we get here, we must have been looking at a parm for a
12198 more deeply nested template. Make a new version of this
12199 template parameter, but with a lower level. */
12202 case TEMPLATE_TYPE_PARM
:
12203 case TEMPLATE_TEMPLATE_PARM
:
12204 case BOUND_TEMPLATE_TEMPLATE_PARM
:
12205 if (cp_type_quals (t
))
12207 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
12208 r
= cp_build_qualified_type_real
12209 (r
, cp_type_quals (t
),
12210 complain
| (code
== TEMPLATE_TYPE_PARM
12211 ? tf_ignore_bad_quals
: 0));
12216 TEMPLATE_TYPE_PARM_INDEX (r
)
12217 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
12218 r
, levels
, args
, complain
);
12219 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
12220 TYPE_MAIN_VARIANT (r
) = r
;
12221 TYPE_POINTER_TO (r
) = NULL_TREE
;
12222 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
12224 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
12225 /* We have reduced the level of the template
12226 template parameter, but not the levels of its
12227 template parameters, so canonical_type_parameter
12228 will not be able to find the canonical template
12229 template parameter for this level. Thus, we
12230 require structural equality checking to compare
12231 TEMPLATE_TEMPLATE_PARMs. */
12232 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12233 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
12234 SET_TYPE_STRUCTURAL_EQUALITY (r
);
12236 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
12238 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
12240 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
12241 complain
, in_decl
);
12242 if (argvec
== error_mark_node
)
12243 return error_mark_node
;
12245 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
12246 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
12251 case TEMPLATE_PARM_INDEX
:
12252 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
12256 gcc_unreachable ();
12264 tree purpose
, value
, chain
;
12266 if (t
== void_list_node
)
12269 purpose
= TREE_PURPOSE (t
);
12272 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
12273 if (purpose
== error_mark_node
)
12274 return error_mark_node
;
12276 value
= TREE_VALUE (t
);
12279 value
= tsubst (value
, args
, complain
, in_decl
);
12280 if (value
== error_mark_node
)
12281 return error_mark_node
;
12283 chain
= TREE_CHAIN (t
);
12284 if (chain
&& chain
!= void_type_node
)
12286 chain
= tsubst (chain
, args
, complain
, in_decl
);
12287 if (chain
== error_mark_node
)
12288 return error_mark_node
;
12290 if (purpose
== TREE_PURPOSE (t
)
12291 && value
== TREE_VALUE (t
)
12292 && chain
== TREE_CHAIN (t
))
12294 return hash_tree_cons (purpose
, value
, chain
);
12298 /* We should never be tsubsting a binfo. */
12299 gcc_unreachable ();
12302 /* A vector of template arguments. */
12303 gcc_assert (!type
);
12304 return tsubst_template_args (t
, args
, complain
, in_decl
);
12307 case REFERENCE_TYPE
:
12309 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
12314 Type deduction may fail for any of the following
12317 -- Attempting to create a pointer to reference type.
12318 -- Attempting to create a reference to a reference type or
12319 a reference to void.
12321 Core issue 106 says that creating a reference to a reference
12322 during instantiation is no longer a cause for failure. We
12323 only enforce this check in strict C++98 mode. */
12324 if ((TREE_CODE (type
) == REFERENCE_TYPE
12325 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
12326 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
12328 static location_t last_loc
;
12330 /* We keep track of the last time we issued this error
12331 message to avoid spewing a ton of messages during a
12332 single bad template instantiation. */
12333 if (complain
& tf_error
12334 && last_loc
!= input_location
)
12336 if (VOID_TYPE_P (type
))
12337 error ("forming reference to void");
12338 else if (code
== POINTER_TYPE
)
12339 error ("forming pointer to reference type %qT", type
);
12341 error ("forming reference to reference type %qT", type
);
12342 last_loc
= input_location
;
12345 return error_mark_node
;
12347 else if (TREE_CODE (type
) == FUNCTION_TYPE
12348 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
12349 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
12351 if (complain
& tf_error
)
12353 if (code
== POINTER_TYPE
)
12354 error ("forming pointer to qualified function type %qT",
12357 error ("forming reference to qualified function type %qT",
12360 return error_mark_node
;
12362 else if (code
== POINTER_TYPE
)
12364 r
= build_pointer_type (type
);
12365 if (TREE_CODE (type
) == METHOD_TYPE
)
12366 r
= build_ptrmemfunc_type (r
);
12368 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
12369 /* In C++0x, during template argument substitution, when there is an
12370 attempt to create a reference to a reference type, reference
12371 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12373 "If a template-argument for a template-parameter T names a type
12374 that is a reference to a type A, an attempt to create the type
12375 'lvalue reference to cv T' creates the type 'lvalue reference to
12376 A,' while an attempt to create the type type rvalue reference to
12377 cv T' creates the type T"
12379 r
= cp_build_reference_type
12381 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12383 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12384 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12386 if (r
!= error_mark_node
)
12387 /* Will this ever be needed for TYPE_..._TO values? */
12394 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12395 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12399 Type deduction may fail for any of the following
12402 -- Attempting to create "pointer to member of T" when T
12403 is not a class type. */
12404 if (complain
& tf_error
)
12405 error ("creating pointer to member of non-class type %qT", r
);
12406 return error_mark_node
;
12408 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12410 if (complain
& tf_error
)
12411 error ("creating pointer to member reference type %qT", type
);
12412 return error_mark_node
;
12414 if (VOID_TYPE_P (type
))
12416 if (complain
& tf_error
)
12417 error ("creating pointer to member of type void");
12418 return error_mark_node
;
12420 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12421 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12423 /* The type of the implicit object parameter gets its
12424 cv-qualifiers from the FUNCTION_TYPE. */
12427 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12428 type_memfn_rqual (type
));
12429 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12430 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12434 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12438 case FUNCTION_TYPE
:
12443 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12444 if (fntype
== error_mark_node
)
12445 return error_mark_node
;
12447 /* Substitute the exception specification. */
12448 specs
= tsubst_exception_specification (t
, args
, complain
,
12449 in_decl
, /*defer_ok*/true);
12450 if (specs
== error_mark_node
)
12451 return error_mark_node
;
12453 fntype
= build_exception_variant (fntype
, specs
);
12458 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12459 if (domain
== error_mark_node
)
12460 return error_mark_node
;
12462 /* As an optimization, we avoid regenerating the array type if
12463 it will obviously be the same as T. */
12464 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12467 /* These checks should match the ones in create_array_type_for_decl.
12471 The deduction may fail for any of the following reasons:
12473 -- Attempting to create an array with an element type that
12474 is void, a function type, or a reference type, or [DR337]
12475 an abstract class type. */
12476 if (VOID_TYPE_P (type
)
12477 || TREE_CODE (type
) == FUNCTION_TYPE
12478 || (TREE_CODE (type
) == ARRAY_TYPE
12479 && TYPE_DOMAIN (type
) == NULL_TREE
)
12480 || TREE_CODE (type
) == REFERENCE_TYPE
)
12482 if (complain
& tf_error
)
12483 error ("creating array of %qT", type
);
12484 return error_mark_node
;
12487 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12488 return error_mark_node
;
12490 r
= build_cplus_array_type (type
, domain
);
12492 if (TYPE_USER_ALIGN (t
))
12494 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12495 TYPE_USER_ALIGN (r
) = 1;
12501 case TYPENAME_TYPE
:
12503 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12504 in_decl
, /*entering_scope=*/1);
12505 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12506 complain
, in_decl
);
12508 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12509 return error_mark_node
;
12511 if (!MAYBE_CLASS_TYPE_P (ctx
))
12513 if (complain
& tf_error
)
12514 error ("%qT is not a class, struct, or union type", ctx
);
12515 return error_mark_node
;
12517 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12519 /* Normally, make_typename_type does not require that the CTX
12520 have complete type in order to allow things like:
12522 template <class T> struct S { typename S<T>::X Y; };
12524 But, such constructs have already been resolved by this
12525 point, so here CTX really should have complete type, unless
12526 it's a partial instantiation. */
12527 ctx
= complete_type (ctx
);
12528 if (!COMPLETE_TYPE_P (ctx
))
12530 if (complain
& tf_error
)
12531 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12532 return error_mark_node
;
12536 f
= make_typename_type (ctx
, f
, typename_type
,
12537 complain
| tf_keep_type_decl
);
12538 if (f
== error_mark_node
)
12540 if (TREE_CODE (f
) == TYPE_DECL
)
12542 complain
|= tf_ignore_bad_quals
;
12546 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12548 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12550 if (complain
& tf_error
)
12551 error ("%qT resolves to %qT, which is not an enumeration type",
12554 return error_mark_node
;
12556 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12558 if (complain
& tf_error
)
12559 error ("%qT resolves to %qT, which is is not a class type",
12562 return error_mark_node
;
12566 return cp_build_qualified_type_real
12567 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12570 case UNBOUND_CLASS_TEMPLATE
:
12572 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12573 in_decl
, /*entering_scope=*/1);
12574 tree name
= TYPE_IDENTIFIER (t
);
12575 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12577 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12578 return error_mark_node
;
12581 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12582 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12589 ++cp_unevaluated_operand
;
12590 ++c_inhibit_evaluation_warnings
;
12592 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12594 /*integral_constant_expression_p=*/false);
12596 --cp_unevaluated_operand
;
12597 --c_inhibit_evaluation_warnings
;
12599 type
= finish_typeof (type
);
12600 return cp_build_qualified_type_real (type
,
12602 | cp_type_quals (type
),
12606 case DECLTYPE_TYPE
:
12610 ++cp_unevaluated_operand
;
12611 ++c_inhibit_evaluation_warnings
;
12613 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12614 complain
|tf_decltype
, in_decl
,
12615 /*function_p*/false,
12616 /*integral_constant_expression*/false);
12618 --cp_unevaluated_operand
;
12619 --c_inhibit_evaluation_warnings
;
12621 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12622 type
= lambda_capture_field_type (type
,
12623 DECLTYPE_FOR_INIT_CAPTURE (t
));
12624 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12625 type
= lambda_proxy_type (type
);
12628 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12629 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12631 /* In a template ~id could be either a complement expression
12632 or an unqualified-id naming a destructor; if instantiating
12633 it produces an expression, it's not an id-expression or
12636 type
= finish_decltype_type (type
, id
, complain
);
12638 return cp_build_qualified_type_real (type
,
12640 | cp_type_quals (type
),
12641 complain
| tf_ignore_bad_quals
);
12644 case UNDERLYING_TYPE
:
12646 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12647 complain
, in_decl
);
12648 return finish_underlying_type (type
);
12651 case TYPE_ARGUMENT_PACK
:
12652 case NONTYPE_ARGUMENT_PACK
:
12654 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12656 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12660 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12662 /* For template nontype argument packs, also substitute into
12664 if (code
== NONTYPE_ARGUMENT_PACK
)
12665 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12684 /* We should use one of the expression tsubsts for these codes. */
12685 gcc_unreachable ();
12688 sorry ("use of %qs in template", get_tree_code_name (code
));
12689 return error_mark_node
;
12693 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12694 type of the expression on the left-hand side of the "." or "->"
12698 tsubst_baselink (tree baselink
, tree object_type
,
12699 tree args
, tsubst_flags_t complain
, tree in_decl
)
12702 tree qualifying_scope
;
12705 tree template_args
= 0;
12706 bool template_id_p
= false;
12707 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12709 /* A baselink indicates a function from a base class. Both the
12710 BASELINK_ACCESS_BINFO and the base class referenced may
12711 indicate bases of the template class, rather than the
12712 instantiated class. In addition, lookups that were not
12713 ambiguous before may be ambiguous now. Therefore, we perform
12714 the lookup again. */
12715 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12716 qualifying_scope
= tsubst (qualifying_scope
, args
,
12717 complain
, in_decl
);
12718 fns
= BASELINK_FUNCTIONS (baselink
);
12719 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12720 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12722 template_id_p
= true;
12723 template_args
= TREE_OPERAND (fns
, 1);
12724 fns
= TREE_OPERAND (fns
, 0);
12726 template_args
= tsubst_template_args (template_args
, args
,
12727 complain
, in_decl
);
12729 name
= DECL_NAME (get_first_fn (fns
));
12730 if (IDENTIFIER_TYPENAME_P (name
))
12731 name
= mangle_conv_op_name_for_type (optype
);
12732 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12734 return error_mark_node
;
12736 /* If lookup found a single function, mark it as used at this
12737 point. (If it lookup found multiple functions the one selected
12738 later by overload resolution will be marked as used at that
12740 if (BASELINK_P (baselink
))
12741 fns
= BASELINK_FUNCTIONS (baselink
);
12742 if (!template_id_p
&& !really_overloaded_fn (fns
)
12743 && !mark_used (OVL_CURRENT (fns
), complain
) && !(complain
& tf_error
))
12744 return error_mark_node
;
12746 /* Add back the template arguments, if present. */
12747 if (BASELINK_P (baselink
) && template_id_p
)
12748 BASELINK_FUNCTIONS (baselink
)
12749 = build_nt (TEMPLATE_ID_EXPR
,
12750 BASELINK_FUNCTIONS (baselink
),
12752 /* Update the conversion operator type. */
12753 BASELINK_OPTYPE (baselink
) = optype
;
12756 object_type
= current_class_type
;
12759 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12765 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12766 true if the qualified-id will be a postfix-expression in-and-of
12767 itself; false if more of the postfix-expression follows the
12768 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12772 tsubst_qualified_id (tree qualified_id
, tree args
,
12773 tsubst_flags_t complain
, tree in_decl
,
12774 bool done
, bool address_p
)
12780 tree template_args
;
12781 location_t loc
= UNKNOWN_LOCATION
;
12783 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12785 /* Figure out what name to look up. */
12786 name
= TREE_OPERAND (qualified_id
, 1);
12787 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12789 is_template
= true;
12790 loc
= EXPR_LOCATION (name
);
12791 template_args
= TREE_OPERAND (name
, 1);
12793 template_args
= tsubst_template_args (template_args
, args
,
12794 complain
, in_decl
);
12795 name
= TREE_OPERAND (name
, 0);
12799 is_template
= false;
12800 template_args
= NULL_TREE
;
12803 /* Substitute into the qualifying scope. When there are no ARGS, we
12804 are just trying to simplify a non-dependent expression. In that
12805 case the qualifying scope may be dependent, and, in any case,
12806 substituting will not help. */
12807 scope
= TREE_OPERAND (qualified_id
, 0);
12810 scope
= tsubst (scope
, args
, complain
, in_decl
);
12811 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12816 if (dependent_scope_p (scope
))
12819 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12820 return build_qualified_name (NULL_TREE
, scope
, expr
,
12821 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12824 if (!BASELINK_P (name
) && !DECL_P (expr
))
12826 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12828 /* A BIT_NOT_EXPR is used to represent a destructor. */
12829 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12831 error ("qualifying type %qT does not match destructor name ~%qT",
12832 scope
, TREE_OPERAND (expr
, 0));
12833 expr
= error_mark_node
;
12836 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12837 /*is_type_p=*/0, false);
12840 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12841 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12842 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12844 if (complain
& tf_error
)
12846 error ("dependent-name %qE is parsed as a non-type, but "
12847 "instantiation yields a type", qualified_id
);
12848 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12850 return error_mark_node
;
12856 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12858 /* Remember that there was a reference to this entity. */
12859 if (!mark_used (expr
, complain
) && !(complain
& tf_error
))
12860 return error_mark_node
;
12863 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12865 if (complain
& tf_error
)
12866 qualified_name_lookup_error (scope
,
12867 TREE_OPERAND (qualified_id
, 1),
12868 expr
, input_location
);
12869 return error_mark_node
;
12873 expr
= lookup_template_function (expr
, template_args
);
12875 if (expr
== error_mark_node
&& complain
& tf_error
)
12876 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12877 expr
, input_location
);
12878 else if (TYPE_P (scope
))
12880 expr
= (adjust_result_of_qualified_name_lookup
12881 (expr
, scope
, current_nonlambda_class_type ()));
12882 expr
= (finish_qualified_id_expr
12883 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12884 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12885 /*template_arg_p=*/false, complain
));
12888 /* Expressions do not generally have reference type. */
12889 if (TREE_CODE (expr
) != SCOPE_REF
12890 /* However, if we're about to form a pointer-to-member, we just
12891 want the referenced member referenced. */
12892 && TREE_CODE (expr
) != OFFSET_REF
)
12893 expr
= convert_from_reference (expr
);
12898 /* tsubst the initializer for a VAR_DECL. INIT is the unsubstituted
12899 initializer, DECL is the substituted VAR_DECL. Other arguments are as
12903 tsubst_init (tree init
, tree decl
, tree args
,
12904 tsubst_flags_t complain
, tree in_decl
)
12909 init
= tsubst_expr (init
, args
, complain
, in_decl
, false);
12913 /* If we had an initializer but it
12914 instantiated to nothing,
12915 value-initialize the object. This will
12916 only occur when the initializer was a
12917 pack expansion where the parameter packs
12918 used in that expansion were of length
12920 init
= build_value_init (TREE_TYPE (decl
),
12922 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
12923 init
= get_target_expr_sfinae (init
, complain
);
12929 /* Like tsubst, but deals with expressions. This function just replaces
12930 template parms; to finish processing the resultant expression, use
12931 tsubst_copy_and_build or tsubst_expr. */
12934 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12936 enum tree_code code
;
12939 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12942 code
= TREE_CODE (t
);
12947 r
= retrieve_local_specialization (t
);
12949 if (r
== NULL_TREE
)
12951 /* We get here for a use of 'this' in an NSDMI. */
12952 if (DECL_NAME (t
) == this_identifier
12953 && current_function_decl
12954 && DECL_CONSTRUCTOR_P (current_function_decl
))
12955 return current_class_ptr
;
12957 /* This can happen for a parameter name used later in a function
12958 declaration (such as in a late-specified return type). Just
12959 make a dummy decl, since it's only used for its type. */
12960 gcc_assert (cp_unevaluated_operand
!= 0);
12961 r
= tsubst_decl (t
, args
, complain
);
12962 /* Give it the template pattern as its context; its true context
12963 hasn't been instantiated yet and this is good enough for
12965 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12968 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12969 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12970 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
12971 return error_mark_node
;
12979 if (DECL_TEMPLATE_PARM_P (t
))
12980 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12981 /* There is no need to substitute into namespace-scope
12983 if (DECL_NAMESPACE_SCOPE_P (t
))
12985 /* If ARGS is NULL, then T is known to be non-dependent. */
12986 if (args
== NULL_TREE
)
12987 return scalar_constant_value (t
);
12989 /* Unfortunately, we cannot just call lookup_name here.
12992 template <int I> int f() {
12994 struct S { void g() { E e = a; } };
12997 When we instantiate f<7>::S::g(), say, lookup_name is not
12998 clever enough to find f<7>::a. */
13000 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13001 /*entering_scope=*/0);
13003 for (v
= TYPE_VALUES (enum_type
);
13005 v
= TREE_CHAIN (v
))
13006 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
13007 return TREE_VALUE (v
);
13009 /* We didn't find the name. That should never happen; if
13010 name-lookup found it during preliminary parsing, we
13011 should find it again here during instantiation. */
13012 gcc_unreachable ();
13017 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
13019 /* Check for a local specialization set up by
13020 tsubst_pack_expansion. */
13021 if (tree r
= retrieve_local_specialization (t
))
13023 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
13024 r
= ARGUMENT_PACK_SELECT_ARG (r
);
13028 /* When retrieving a capture pack from a generic lambda, remove the
13029 lambda call op's own template argument list from ARGS. Only the
13030 template arguments active for the closure type should be used to
13031 retrieve the pack specialization. */
13032 if (LAMBDA_FUNCTION_P (current_function_decl
)
13033 && (template_class_depth (DECL_CONTEXT (t
))
13034 != TMPL_ARGS_DEPTH (args
)))
13035 args
= strip_innermost_template_args (args
, 1);
13037 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
13038 tsubst_decl put in the hash table. */
13039 return retrieve_specialization (t
, args
, 0);
13042 if (DECL_CONTEXT (t
))
13046 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
13047 /*entering_scope=*/1);
13048 if (ctx
!= DECL_CONTEXT (t
))
13050 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
13053 if (complain
& tf_error
)
13054 error ("using invalid field %qD", t
);
13055 return error_mark_node
;
13064 case FUNCTION_DECL
:
13065 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
13066 r
= tsubst (t
, args
, complain
, in_decl
);
13067 else if (local_variable_p (t
))
13069 r
= retrieve_local_specialization (t
);
13070 if (r
== NULL_TREE
)
13072 /* First try name lookup to find the instantiation. */
13073 r
= lookup_name (DECL_NAME (t
));
13076 /* Make sure that the one we found is the one we want. */
13077 tree ctx
= tsubst (DECL_CONTEXT (t
), args
,
13078 complain
, in_decl
);
13079 if (ctx
!= DECL_CONTEXT (r
))
13087 /* This can happen for a variable used in a
13088 late-specified return type of a local lambda, or for a
13089 local static or constant. Building a new VAR_DECL
13090 should be OK in all those cases. */
13091 r
= tsubst_decl (t
, args
, complain
);
13092 if (decl_maybe_constant_var_p (r
))
13094 /* We can't call cp_finish_decl, so handle the
13095 initializer by hand. */
13096 tree init
= tsubst_init (DECL_INITIAL (t
), r
, args
,
13097 complain
, in_decl
);
13098 if (!processing_template_decl
)
13099 init
= maybe_constant_init (init
);
13100 if (processing_template_decl
13101 ? potential_constant_expression (init
)
13102 : reduced_constant_expression_p (init
))
13103 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
)
13104 = TREE_CONSTANT (r
) = true;
13105 DECL_INITIAL (r
) = init
;
13107 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
13108 || decl_constant_var_p (r
)
13109 || errorcount
|| sorrycount
);
13110 if (!processing_template_decl
)
13112 if (TREE_STATIC (r
))
13113 rest_of_decl_compilation (r
, toplevel_bindings_p (),
13116 r
= process_outer_var_ref (r
, complain
);
13119 /* Remember this for subsequent uses. */
13120 if (local_specializations
)
13121 register_local_specialization (r
, t
);
13126 if (!mark_used (r
, complain
) && !(complain
& tf_error
))
13127 return error_mark_node
;
13130 case NAMESPACE_DECL
:
13134 /* An OVERLOAD will always be a non-dependent overload set; an
13135 overload set from function scope will just be represented with an
13136 IDENTIFIER_NODE, and from class scope with a BASELINK. */
13137 gcc_assert (!uses_template_parms (t
));
13141 return tsubst_baselink (t
, current_nonlambda_class_type (),
13142 args
, complain
, in_decl
);
13144 case TEMPLATE_DECL
:
13145 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
13146 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
13147 args
, complain
, in_decl
);
13148 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
13149 return tsubst (t
, args
, complain
, in_decl
);
13150 else if (DECL_CLASS_SCOPE_P (t
)
13151 && uses_template_parms (DECL_CONTEXT (t
)))
13153 /* Template template argument like the following example need
13156 template <template <class> class TT> struct C {};
13157 template <class T> struct D {
13158 template <class U> struct E {};
13163 We are processing the template argument `E' in #1 for
13164 the template instantiation #2. Originally, `E' is a
13165 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
13166 have to substitute this with one having context `D<int>'. */
13168 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
13169 return lookup_field (context
, DECL_NAME(t
), 0, false);
13172 /* Ordinary template template argument. */
13176 case REINTERPRET_CAST_EXPR
:
13177 case CONST_CAST_EXPR
:
13178 case STATIC_CAST_EXPR
:
13179 case DYNAMIC_CAST_EXPR
:
13180 case IMPLICIT_CONV_EXPR
:
13184 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13185 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13186 return build1 (code
, type
, op0
);
13190 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
13193 tree expanded
, op
= TREE_OPERAND (t
, 0);
13196 if (SIZEOF_EXPR_TYPE_P (t
))
13197 op
= TREE_TYPE (op
);
13199 ++cp_unevaluated_operand
;
13200 ++c_inhibit_evaluation_warnings
;
13201 /* We only want to compute the number of arguments. */
13202 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
13203 --cp_unevaluated_operand
;
13204 --c_inhibit_evaluation_warnings
;
13206 if (TREE_CODE (expanded
) == TREE_VEC
)
13207 len
= TREE_VEC_LENGTH (expanded
);
13209 if (expanded
== error_mark_node
)
13210 return error_mark_node
;
13211 else if (PACK_EXPANSION_P (expanded
)
13212 || (TREE_CODE (expanded
) == TREE_VEC
13214 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
13216 if (TREE_CODE (expanded
) == TREE_VEC
)
13217 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
13219 if (TYPE_P (expanded
))
13220 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
13221 complain
& tf_error
);
13223 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
13224 complain
& tf_error
);
13227 return build_int_cst (size_type_node
, len
);
13229 if (SIZEOF_EXPR_TYPE_P (t
))
13231 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
13232 args
, complain
, in_decl
);
13233 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
13234 r
= build1 (SIZEOF_EXPR
,
13235 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
13236 SIZEOF_EXPR_TYPE_P (r
) = 1;
13243 case TRUTH_NOT_EXPR
:
13246 case UNARY_PLUS_EXPR
: /* Unary + */
13248 case AT_ENCODE_EXPR
:
13252 case REALPART_EXPR
:
13253 case IMAGPART_EXPR
:
13256 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13257 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13258 return build1 (code
, type
, op0
);
13261 case COMPONENT_REF
:
13266 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13267 name
= TREE_OPERAND (t
, 1);
13268 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
13270 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13271 complain
, in_decl
);
13272 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13274 else if (TREE_CODE (name
) == SCOPE_REF
13275 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
13277 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13278 complain
, in_decl
);
13279 name
= TREE_OPERAND (name
, 1);
13280 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
13281 complain
, in_decl
);
13282 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
13283 name
= build_qualified_name (/*type=*/NULL_TREE
,
13285 /*template_p=*/false);
13287 else if (BASELINK_P (name
))
13288 name
= tsubst_baselink (name
,
13289 non_reference (TREE_TYPE (object
)),
13293 name
= tsubst_copy (name
, args
, complain
, in_decl
);
13294 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
13300 case TRUNC_DIV_EXPR
:
13301 case CEIL_DIV_EXPR
:
13302 case FLOOR_DIV_EXPR
:
13303 case ROUND_DIV_EXPR
:
13304 case EXACT_DIV_EXPR
:
13308 case TRUNC_MOD_EXPR
:
13309 case FLOOR_MOD_EXPR
:
13310 case TRUTH_ANDIF_EXPR
:
13311 case TRUTH_ORIF_EXPR
:
13312 case TRUTH_AND_EXPR
:
13313 case TRUTH_OR_EXPR
:
13326 case COMPOUND_EXPR
:
13329 case PREDECREMENT_EXPR
:
13330 case PREINCREMENT_EXPR
:
13331 case POSTDECREMENT_EXPR
:
13332 case POSTINCREMENT_EXPR
:
13334 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13335 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13336 return build_nt (code
, op0
, op1
);
13341 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13342 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13343 return build_qualified_name (/*type=*/NULL_TREE
, op0
, op1
,
13344 QUALIFIED_NAME_IS_TEMPLATE (t
));
13349 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13350 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13351 return build_nt (ARRAY_REF
, op0
, op1
, NULL_TREE
, NULL_TREE
);
13356 int n
= VL_EXP_OPERAND_LENGTH (t
);
13357 tree result
= build_vl_exp (CALL_EXPR
, n
);
13359 for (i
= 0; i
< n
; i
++)
13360 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
13361 complain
, in_decl
);
13367 case PSEUDO_DTOR_EXPR
:
13368 case VEC_PERM_EXPR
:
13370 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13371 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13372 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13373 r
= build_nt (code
, op0
, op1
, op2
);
13374 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
13380 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13381 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13382 tree op2
= tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
13383 r
= build_nt (code
, op0
, op1
, op2
);
13384 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
13390 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13391 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13392 r
= build_nt (code
, op0
, op1
);
13393 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
13394 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
13398 case TEMPLATE_ID_EXPR
:
13400 /* Substituted template arguments */
13401 tree fn
= TREE_OPERAND (t
, 0);
13402 tree targs
= TREE_OPERAND (t
, 1);
13404 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
13406 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
13408 return lookup_template_function (fn
, targs
);
13413 tree purpose
, value
, chain
;
13415 if (t
== void_list_node
)
13418 purpose
= TREE_PURPOSE (t
);
13420 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
13421 value
= TREE_VALUE (t
);
13423 value
= tsubst_copy (value
, args
, complain
, in_decl
);
13424 chain
= TREE_CHAIN (t
);
13425 if (chain
&& chain
!= void_type_node
)
13426 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13427 if (purpose
== TREE_PURPOSE (t
)
13428 && value
== TREE_VALUE (t
)
13429 && chain
== TREE_CHAIN (t
))
13431 return tree_cons (purpose
, value
, chain
);
13436 case ENUMERAL_TYPE
:
13438 case TEMPLATE_TYPE_PARM
:
13439 case TEMPLATE_TEMPLATE_PARM
:
13440 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13441 case TEMPLATE_PARM_INDEX
:
13443 case REFERENCE_TYPE
:
13445 case FUNCTION_TYPE
:
13448 case TYPENAME_TYPE
:
13449 case UNBOUND_CLASS_TEMPLATE
:
13451 case DECLTYPE_TYPE
:
13453 return tsubst (t
, args
, complain
, in_decl
);
13457 /* Fall through. */
13458 case IDENTIFIER_NODE
:
13459 if (IDENTIFIER_TYPENAME_P (t
))
13461 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13462 return mangle_conv_op_name_for_type (new_type
);
13468 /* This is handled by tsubst_copy_and_build. */
13469 gcc_unreachable ();
13473 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13474 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13475 return build_x_va_arg (EXPR_LOCATION (t
), op0
, type
);
13478 case CLEANUP_POINT_EXPR
:
13479 /* We shouldn't have built any of these during initial template
13480 generation. Instead, they should be built during instantiation
13481 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13482 gcc_unreachable ();
13486 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13487 tree op0
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
13488 tree op1
= tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
13489 r
= build2 (code
, type
, op0
, op1
);
13490 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13491 if (!mark_used (TREE_OPERAND (r
, 1), complain
)
13492 && !(complain
& tf_error
))
13493 return error_mark_node
;
13497 case EXPR_PACK_EXPANSION
:
13498 error ("invalid use of pack expansion expression");
13499 return error_mark_node
;
13501 case NONTYPE_ARGUMENT_PACK
:
13502 error ("use %<...%> to expand argument pack");
13503 return error_mark_node
;
13506 gcc_checking_assert (t
== void_node
&& VOID_TYPE_P (TREE_TYPE (t
)));
13514 /* Instantiate any typedefs in the type. */
13515 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13516 r
= fold_convert (type
, t
);
13517 gcc_assert (TREE_CODE (r
) == code
);
13522 /* These can sometimes show up in a partial instantiation, but never
13523 involve template parms. */
13524 gcc_assert (!uses_template_parms (t
));
13528 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13529 gcc_checking_assert (false);
13534 /* Helper function for tsubst_omp_clauses, used for instantiation of
13535 OMP_CLAUSE_DECL of clauses that handles also OpenMP array sections
13536 represented with TREE_LIST. */
13539 tsubst_omp_clause_decl (tree decl
, tree args
, tsubst_flags_t complain
,
13542 if (TREE_CODE (decl
) == TREE_LIST
)
13545 = tsubst_expr (TREE_PURPOSE (decl
), args
, complain
, in_decl
,
13546 /*integral_constant_expression_p=*/false);
13547 tree length
= tsubst_expr (TREE_VALUE (decl
), args
, complain
, in_decl
,
13548 /*integral_constant_expression_p=*/false);
13549 tree chain
= tsubst_omp_clause_decl (TREE_CHAIN (decl
), args
, complain
,
13551 if (TREE_PURPOSE (decl
) == low_bound
13552 && TREE_VALUE (decl
) == length
13553 && TREE_CHAIN (decl
) == chain
)
13555 return tree_cons (low_bound
, length
, chain
);
13557 return tsubst_copy (decl
, args
, complain
, in_decl
);
13560 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13563 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13564 tree args
, tsubst_flags_t complain
, tree in_decl
)
13566 tree new_clauses
= NULL
, nc
, oc
;
13568 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13570 nc
= copy_node (oc
);
13571 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13574 switch (OMP_CLAUSE_CODE (nc
))
13576 case OMP_CLAUSE_LASTPRIVATE
:
13577 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13579 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13580 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13581 in_decl
, /*integral_constant_expression_p=*/false);
13582 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13583 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13586 case OMP_CLAUSE_PRIVATE
:
13587 case OMP_CLAUSE_SHARED
:
13588 case OMP_CLAUSE_FIRSTPRIVATE
:
13589 case OMP_CLAUSE_COPYIN
:
13590 case OMP_CLAUSE_COPYPRIVATE
:
13591 case OMP_CLAUSE_UNIFORM
:
13592 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
13593 complain
, in_decl
);
13595 case OMP_CLAUSE_DEPEND
:
13596 case OMP_CLAUSE_FROM
:
13597 case OMP_CLAUSE_TO
:
13598 case OMP_CLAUSE_MAP
:
13599 OMP_CLAUSE_DECL (nc
)
13600 = tsubst_omp_clause_decl (OMP_CLAUSE_DECL (oc
), args
, complain
,
13603 case OMP_CLAUSE_IF
:
13604 case OMP_CLAUSE_NUM_THREADS
:
13605 case OMP_CLAUSE_SCHEDULE
:
13606 case OMP_CLAUSE_COLLAPSE
:
13607 case OMP_CLAUSE_FINAL
:
13608 case OMP_CLAUSE_DEVICE
:
13609 case OMP_CLAUSE_DIST_SCHEDULE
:
13610 case OMP_CLAUSE_NUM_TEAMS
:
13611 case OMP_CLAUSE_THREAD_LIMIT
:
13612 case OMP_CLAUSE_SAFELEN
:
13613 case OMP_CLAUSE_SIMDLEN
:
13614 OMP_CLAUSE_OPERAND (nc
, 0)
13615 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13616 in_decl
, /*integral_constant_expression_p=*/false);
13618 case OMP_CLAUSE_REDUCTION
:
13619 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13621 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13622 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13624 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13625 complain
, in_decl
);
13626 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13627 = build_qualified_name (NULL_TREE
, scope
,
13628 TREE_OPERAND (placeholder
, 1),
13632 gcc_assert (identifier_p (placeholder
));
13634 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
13635 complain
, in_decl
);
13637 case OMP_CLAUSE_LINEAR
:
13638 case OMP_CLAUSE_ALIGNED
:
13639 OMP_CLAUSE_DECL (nc
) = tsubst_copy (OMP_CLAUSE_DECL (oc
), args
,
13640 complain
, in_decl
);
13641 OMP_CLAUSE_OPERAND (nc
, 1)
13642 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13643 in_decl
, /*integral_constant_expression_p=*/false);
13645 case OMP_CLAUSE_NOWAIT
:
13646 case OMP_CLAUSE_ORDERED
:
13647 case OMP_CLAUSE_DEFAULT
:
13648 case OMP_CLAUSE_UNTIED
:
13649 case OMP_CLAUSE_MERGEABLE
:
13650 case OMP_CLAUSE_INBRANCH
:
13651 case OMP_CLAUSE_NOTINBRANCH
:
13652 case OMP_CLAUSE_PROC_BIND
:
13653 case OMP_CLAUSE_FOR
:
13654 case OMP_CLAUSE_PARALLEL
:
13655 case OMP_CLAUSE_SECTIONS
:
13656 case OMP_CLAUSE_TASKGROUP
:
13659 gcc_unreachable ();
13663 new_clauses
= nreverse (new_clauses
);
13665 new_clauses
= finish_omp_clauses (new_clauses
);
13666 return new_clauses
;
13669 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13672 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13675 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13677 tree purpose
, value
, chain
;
13682 if (TREE_CODE (t
) != TREE_LIST
)
13683 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13684 /*function_p=*/false,
13685 /*integral_constant_expression_p=*/false);
13687 if (t
== void_list_node
)
13690 purpose
= TREE_PURPOSE (t
);
13692 purpose
= RECUR (purpose
);
13693 value
= TREE_VALUE (t
);
13696 if (TREE_CODE (value
) != LABEL_DECL
)
13697 value
= RECUR (value
);
13700 value
= lookup_label (DECL_NAME (value
));
13701 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13702 TREE_USED (value
) = 1;
13705 chain
= TREE_CHAIN (t
);
13706 if (chain
&& chain
!= void_type_node
)
13707 chain
= RECUR (chain
);
13708 return tree_cons (purpose
, value
, chain
);
13712 /* Substitute one OMP_FOR iterator. */
13715 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13716 tree condv
, tree incrv
, tree
*clauses
,
13717 tree args
, tsubst_flags_t complain
, tree in_decl
,
13718 bool integral_constant_expression_p
)
13720 #define RECUR(NODE) \
13721 tsubst_expr ((NODE), args, complain, in_decl, \
13722 integral_constant_expression_p)
13723 tree decl
, init
, cond
, incr
;
13725 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13726 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13727 decl
= TREE_OPERAND (init
, 0);
13728 init
= TREE_OPERAND (init
, 1);
13729 tree decl_expr
= NULL_TREE
;
13730 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13732 /* We need to jump through some hoops to handle declarations in the
13733 for-init-statement, since we might need to handle auto deduction,
13734 but we need to keep control of initialization. */
13736 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13737 decl
= tsubst_decl (decl
, args
, complain
);
13740 decl
= RECUR (decl
);
13741 init
= RECUR (init
);
13743 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13744 if (auto_node
&& init
)
13746 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13748 gcc_assert (!type_dependent_expression_p (decl
));
13750 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13754 /* Declare the variable, but don't let that initialize it. */
13755 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13756 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13758 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13761 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13762 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13763 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13765 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13766 tree rhs
= RECUR (TREE_OPERAND (incr
, 1));
13767 incr
= build_x_modify_expr (EXPR_LOCATION (incr
), lhs
,
13768 NOP_EXPR
, rhs
, complain
);
13771 incr
= RECUR (incr
);
13772 TREE_VEC_ELT (declv
, i
) = decl
;
13773 TREE_VEC_ELT (initv
, i
) = init
;
13774 TREE_VEC_ELT (condv
, i
) = cond
;
13775 TREE_VEC_ELT (incrv
, i
) = incr
;
13781 /* Declare and initialize the variable. */
13788 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13790 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13791 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13792 && OMP_CLAUSE_DECL (c
) == decl
)
13794 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13795 && OMP_CLAUSE_DECL (c
) == decl
)
13796 error ("iteration variable %qD should not be firstprivate", decl
);
13797 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13798 && OMP_CLAUSE_DECL (c
) == decl
)
13799 error ("iteration variable %qD should not be reduction", decl
);
13803 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13804 OMP_CLAUSE_DECL (c
) = decl
;
13805 c
= finish_omp_clauses (c
);
13808 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13813 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13814 if (COMPARISON_CLASS_P (cond
))
13816 tree op0
= RECUR (TREE_OPERAND (cond
, 0));
13817 tree op1
= RECUR (TREE_OPERAND (cond
, 1));
13818 cond
= build2 (TREE_CODE (cond
), boolean_type_node
, op0
, op1
);
13821 cond
= RECUR (cond
);
13822 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13823 switch (TREE_CODE (incr
))
13825 case PREINCREMENT_EXPR
:
13826 case PREDECREMENT_EXPR
:
13827 case POSTINCREMENT_EXPR
:
13828 case POSTDECREMENT_EXPR
:
13829 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13830 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13833 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13834 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13836 tree rhs
= TREE_OPERAND (incr
, 1);
13837 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13838 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13839 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13840 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13841 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13845 incr
= RECUR (incr
);
13848 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13849 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13851 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13852 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13853 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13854 TREE_TYPE (decl
), lhs
,
13855 RECUR (TREE_OPERAND (incr
, 2))));
13857 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13858 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13859 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13861 tree rhs
= TREE_OPERAND (incr
, 2);
13862 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13863 tree rhs0
= RECUR (TREE_OPERAND (rhs
, 0));
13864 tree rhs1
= RECUR (TREE_OPERAND (rhs
, 1));
13865 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13866 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13870 incr
= RECUR (incr
);
13873 incr
= RECUR (incr
);
13877 TREE_VEC_ELT (declv
, i
) = decl
;
13878 TREE_VEC_ELT (initv
, i
) = init
;
13879 TREE_VEC_ELT (condv
, i
) = cond
;
13880 TREE_VEC_ELT (incrv
, i
) = incr
;
13884 /* Like tsubst_copy for expressions, etc. but also does semantic
13888 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13889 bool integral_constant_expression_p
)
13891 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13892 #define RECUR(NODE) \
13893 tsubst_expr ((NODE), args, complain, in_decl, \
13894 integral_constant_expression_p)
13900 if (t
== NULL_TREE
|| t
== error_mark_node
)
13903 loc
= input_location
;
13904 if (EXPR_HAS_LOCATION (t
))
13905 input_location
= EXPR_LOCATION (t
);
13906 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13907 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13909 switch (TREE_CODE (t
))
13911 case STATEMENT_LIST
:
13913 tree_stmt_iterator i
;
13914 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13915 RECUR (tsi_stmt (i
));
13919 case CTOR_INITIALIZER
:
13920 finish_mem_initializers (tsubst_initializer_list
13921 (TREE_OPERAND (t
, 0), args
));
13925 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13929 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13930 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13931 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13933 finish_expr_stmt (tmp
);
13937 do_using_directive (USING_STMT_NAMESPACE (t
));
13942 tree decl
, pattern_decl
;
13945 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13946 if (TREE_CODE (decl
) == LABEL_DECL
)
13947 finish_label_decl (DECL_NAME (decl
));
13948 else if (TREE_CODE (decl
) == USING_DECL
)
13950 tree scope
= USING_DECL_SCOPE (decl
);
13951 tree name
= DECL_NAME (decl
);
13954 scope
= tsubst (scope
, args
, complain
, in_decl
);
13955 decl
= lookup_qualified_name (scope
, name
,
13956 /*is_type_p=*/false,
13957 /*complain=*/false);
13958 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13959 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13961 do_local_using_decl (decl
, scope
, name
);
13963 else if (DECL_PACK_P (decl
))
13965 /* Don't build up decls for a variadic capture proxy, we'll
13966 instantiate the elements directly as needed. */
13971 init
= DECL_INITIAL (decl
);
13972 decl
= tsubst (decl
, args
, complain
, in_decl
);
13973 if (decl
!= error_mark_node
)
13975 /* By marking the declaration as instantiated, we avoid
13976 trying to instantiate it. Since instantiate_decl can't
13977 handle local variables, and since we've already done
13978 all that needs to be done, that's the right thing to
13981 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13983 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13984 /* Anonymous aggregates are a special case. */
13985 finish_anon_union (decl
);
13986 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13988 DECL_CONTEXT (decl
) = current_function_decl
;
13989 if (DECL_NAME (decl
) == this_identifier
)
13991 tree lam
= DECL_CONTEXT (current_function_decl
);
13992 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13993 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13995 insert_capture_proxy (decl
);
13997 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13998 /* We already did a pushtag. */;
13999 else if (TREE_CODE (decl
) == FUNCTION_DECL
14000 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
14001 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
14003 DECL_CONTEXT (decl
) = NULL_TREE
;
14005 DECL_CONTEXT (decl
) = current_function_decl
;
14006 cp_check_omp_declare_reduction (decl
);
14010 int const_init
= false;
14011 maybe_push_decl (decl
);
14013 && DECL_PRETTY_FUNCTION_P (decl
))
14015 /* For __PRETTY_FUNCTION__ we have to adjust the
14017 const char *const name
14018 = cxx_printable_name (current_function_decl
, 2);
14019 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
14022 init
= tsubst_init (init
, decl
, args
, complain
, in_decl
);
14025 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
14027 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
14036 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14037 RECUR (FOR_INIT_STMT (t
));
14038 finish_for_init_stmt (stmt
);
14039 tmp
= RECUR (FOR_COND (t
));
14040 finish_for_cond (tmp
, stmt
, false);
14041 tmp
= RECUR (FOR_EXPR (t
));
14042 finish_for_expr (tmp
, stmt
);
14043 RECUR (FOR_BODY (t
));
14044 finish_for_stmt (stmt
);
14047 case RANGE_FOR_STMT
:
14050 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
14051 decl
= RANGE_FOR_DECL (t
);
14052 decl
= tsubst (decl
, args
, complain
, in_decl
);
14053 maybe_push_decl (decl
);
14054 expr
= RECUR (RANGE_FOR_EXPR (t
));
14055 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
14056 RECUR (RANGE_FOR_BODY (t
));
14057 finish_for_stmt (stmt
);
14062 stmt
= begin_while_stmt ();
14063 tmp
= RECUR (WHILE_COND (t
));
14064 finish_while_stmt_cond (tmp
, stmt
, false);
14065 RECUR (WHILE_BODY (t
));
14066 finish_while_stmt (stmt
);
14070 stmt
= begin_do_stmt ();
14071 RECUR (DO_BODY (t
));
14072 finish_do_body (stmt
);
14073 tmp
= RECUR (DO_COND (t
));
14074 finish_do_stmt (tmp
, stmt
, false);
14078 stmt
= begin_if_stmt ();
14079 tmp
= RECUR (IF_COND (t
));
14080 finish_if_stmt_cond (tmp
, stmt
);
14081 RECUR (THEN_CLAUSE (t
));
14082 finish_then_clause (stmt
);
14084 if (ELSE_CLAUSE (t
))
14086 begin_else_clause (stmt
);
14087 RECUR (ELSE_CLAUSE (t
));
14088 finish_else_clause (stmt
);
14091 finish_if_stmt (stmt
);
14095 if (BIND_EXPR_BODY_BLOCK (t
))
14096 stmt
= begin_function_body ();
14098 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
14099 ? BCS_TRY_BLOCK
: 0);
14101 RECUR (BIND_EXPR_BODY (t
));
14103 if (BIND_EXPR_BODY_BLOCK (t
))
14104 finish_function_body (stmt
);
14106 finish_compound_stmt (stmt
);
14110 finish_break_stmt ();
14113 case CONTINUE_STMT
:
14114 finish_continue_stmt ();
14118 stmt
= begin_switch_stmt ();
14119 tmp
= RECUR (SWITCH_STMT_COND (t
));
14120 finish_switch_cond (tmp
, stmt
);
14121 RECUR (SWITCH_STMT_BODY (t
));
14122 finish_switch_stmt (stmt
);
14125 case CASE_LABEL_EXPR
:
14127 tree low
= RECUR (CASE_LOW (t
));
14128 tree high
= RECUR (CASE_HIGH (t
));
14129 finish_case_label (EXPR_LOCATION (t
), low
, high
);
14135 tree decl
= LABEL_EXPR_LABEL (t
);
14138 label
= finish_label_stmt (DECL_NAME (decl
));
14139 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
14140 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
14145 tmp
= GOTO_DESTINATION (t
);
14146 if (TREE_CODE (tmp
) != LABEL_DECL
)
14147 /* Computed goto's must be tsubst'd into. On the other hand,
14148 non-computed gotos must not be; the identifier in question
14149 will have no binding. */
14152 tmp
= DECL_NAME (tmp
);
14153 finish_goto_stmt (tmp
);
14158 tree string
= RECUR (ASM_STRING (t
));
14159 tree outputs
= tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
,
14160 complain
, in_decl
);
14161 tree inputs
= tsubst_copy_asm_operands (ASM_INPUTS (t
), args
,
14162 complain
, in_decl
);
14163 tree clobbers
= tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
,
14164 complain
, in_decl
);
14165 tree labels
= tsubst_copy_asm_operands (ASM_LABELS (t
), args
,
14166 complain
, in_decl
);
14167 tmp
= finish_asm_stmt (ASM_VOLATILE_P (t
), string
, outputs
, inputs
,
14169 tree asm_expr
= tmp
;
14170 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
14171 asm_expr
= TREE_OPERAND (asm_expr
, 0);
14172 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
14179 stmt
= begin_try_block ();
14180 RECUR (TRY_STMTS (t
));
14181 finish_cleanup_try_block (stmt
);
14182 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
14186 tree compound_stmt
= NULL_TREE
;
14188 if (FN_TRY_BLOCK_P (t
))
14189 stmt
= begin_function_try_block (&compound_stmt
);
14191 stmt
= begin_try_block ();
14193 RECUR (TRY_STMTS (t
));
14195 if (FN_TRY_BLOCK_P (t
))
14196 finish_function_try_block (stmt
);
14198 finish_try_block (stmt
);
14200 RECUR (TRY_HANDLERS (t
));
14201 if (FN_TRY_BLOCK_P (t
))
14202 finish_function_handler_sequence (stmt
, compound_stmt
);
14204 finish_handler_sequence (stmt
);
14210 tree decl
= HANDLER_PARMS (t
);
14214 decl
= tsubst (decl
, args
, complain
, in_decl
);
14215 /* Prevent instantiate_decl from trying to instantiate
14216 this variable. We've already done all that needs to be
14218 if (decl
!= error_mark_node
)
14219 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
14221 stmt
= begin_handler ();
14222 finish_handler_parms (decl
, stmt
);
14223 RECUR (HANDLER_BODY (t
));
14224 finish_handler (stmt
);
14229 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
14230 if (CLASS_TYPE_P (tmp
))
14232 /* Local classes are not independent templates; they are
14233 instantiated along with their containing function. And this
14234 way we don't have to deal with pushing out of one local class
14235 to instantiate a member of another local class. */
14237 /* Closures are handled by the LAMBDA_EXPR. */
14238 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
14239 complete_type (tmp
);
14240 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
14241 if (!DECL_ARTIFICIAL (fn
))
14242 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
14246 case STATIC_ASSERT
:
14250 ++c_inhibit_evaluation_warnings
;
14252 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
14255 /*integral_constant_expression_p=*/true);
14256 --c_inhibit_evaluation_warnings
;
14258 finish_static_assert (condition
,
14259 STATIC_ASSERT_MESSAGE (t
),
14260 STATIC_ASSERT_SOURCE_LOCATION (t
),
14261 /*member_p=*/false);
14266 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
14267 args
, complain
, in_decl
);
14268 stmt
= begin_omp_parallel ();
14269 RECUR (OMP_PARALLEL_BODY (t
));
14270 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
14271 = OMP_PARALLEL_COMBINED (t
);
14275 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
14276 args
, complain
, in_decl
);
14277 stmt
= begin_omp_task ();
14278 RECUR (OMP_TASK_BODY (t
));
14279 finish_omp_task (tmp
, stmt
);
14286 case OMP_DISTRIBUTE
:
14288 tree clauses
, body
, pre_body
;
14289 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
14290 tree incrv
= NULL_TREE
;
14293 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
14294 args
, complain
, in_decl
);
14295 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14297 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14298 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14299 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14300 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
14303 stmt
= begin_omp_structured_block ();
14305 pre_body
= push_stmt_list ();
14306 RECUR (OMP_FOR_PRE_BODY (t
));
14307 pre_body
= pop_stmt_list (pre_body
);
14309 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14310 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
14311 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
14312 &clauses
, args
, complain
, in_decl
,
14313 integral_constant_expression_p
);
14315 body
= push_stmt_list ();
14316 RECUR (OMP_FOR_BODY (t
));
14317 body
= pop_stmt_list (body
);
14319 if (OMP_FOR_INIT (t
) != NULL_TREE
)
14320 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
14321 condv
, incrv
, body
, pre_body
, clauses
);
14324 t
= make_node (TREE_CODE (t
));
14325 TREE_TYPE (t
) = void_type_node
;
14326 OMP_FOR_BODY (t
) = body
;
14327 OMP_FOR_PRE_BODY (t
) = pre_body
;
14328 OMP_FOR_CLAUSES (t
) = clauses
;
14329 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
14333 add_stmt (finish_omp_structured_block (stmt
));
14340 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14341 args
, complain
, in_decl
);
14342 stmt
= push_stmt_list ();
14343 RECUR (OMP_BODY (t
));
14344 stmt
= pop_stmt_list (stmt
);
14347 OMP_BODY (t
) = stmt
;
14348 OMP_CLAUSES (t
) = tmp
;
14352 case OMP_TARGET_DATA
:
14354 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
14355 args
, complain
, in_decl
);
14356 keep_next_level (true);
14357 stmt
= begin_omp_structured_block ();
14359 RECUR (OMP_BODY (t
));
14360 stmt
= finish_omp_structured_block (stmt
);
14363 OMP_BODY (t
) = stmt
;
14364 OMP_CLAUSES (t
) = tmp
;
14368 case OMP_TARGET_UPDATE
:
14369 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
14370 args
, complain
, in_decl
);
14372 OMP_TARGET_UPDATE_CLAUSES (t
) = tmp
;
14379 case OMP_TASKGROUP
:
14381 stmt
= push_stmt_list ();
14382 RECUR (OMP_BODY (t
));
14383 stmt
= pop_stmt_list (stmt
);
14386 OMP_BODY (t
) = stmt
;
14391 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
14392 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
14394 tree op1
= TREE_OPERAND (t
, 1);
14395 tree rhs1
= NULL_TREE
;
14397 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
14399 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
14400 op1
= TREE_OPERAND (op1
, 1);
14402 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14403 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14404 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
14405 NULL_TREE
, NULL_TREE
, rhs1
,
14406 OMP_ATOMIC_SEQ_CST (t
));
14410 tree op1
= TREE_OPERAND (t
, 1);
14411 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
14412 tree rhs1
= NULL_TREE
;
14413 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
14414 enum tree_code opcode
= NOP_EXPR
;
14415 if (code
== OMP_ATOMIC_READ
)
14417 v
= RECUR (TREE_OPERAND (op1
, 0));
14418 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14420 else if (code
== OMP_ATOMIC_CAPTURE_OLD
14421 || code
== OMP_ATOMIC_CAPTURE_NEW
)
14423 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
14424 v
= RECUR (TREE_OPERAND (op1
, 0));
14425 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
14426 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
14428 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
14429 op11
= TREE_OPERAND (op11
, 1);
14431 lhs
= RECUR (TREE_OPERAND (op11
, 0));
14432 rhs
= RECUR (TREE_OPERAND (op11
, 1));
14433 opcode
= TREE_CODE (op11
);
14434 if (opcode
== MODIFY_EXPR
)
14440 lhs
= RECUR (TREE_OPERAND (op1
, 0));
14441 rhs
= RECUR (TREE_OPERAND (op1
, 1));
14443 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
14444 OMP_ATOMIC_SEQ_CST (t
));
14448 case TRANSACTION_EXPR
:
14451 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
14452 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
14454 if (TRANSACTION_EXPR_IS_STMT (t
))
14456 tree body
= TRANSACTION_EXPR_BODY (t
);
14457 tree noex
= NULL_TREE
;
14458 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14460 noex
= MUST_NOT_THROW_COND (body
);
14461 if (noex
== NULL_TREE
)
14462 noex
= boolean_true_node
;
14463 body
= TREE_OPERAND (body
, 0);
14465 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14467 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14471 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14472 RECUR (TRANSACTION_EXPR_BODY (t
)),
14479 case MUST_NOT_THROW_EXPR
:
14481 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14482 tree cond
= RECUR (MUST_NOT_THROW_COND (t
));
14483 RETURN (build_must_not_throw_expr (op0
, cond
));
14486 case EXPR_PACK_EXPANSION
:
14487 error ("invalid use of pack expansion expression");
14488 RETURN (error_mark_node
);
14490 case NONTYPE_ARGUMENT_PACK
:
14491 error ("use %<...%> to expand argument pack");
14492 RETURN (error_mark_node
);
14494 case CILK_SPAWN_STMT
:
14495 cfun
->calls_cilk_spawn
= 1;
14496 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
14498 case CILK_SYNC_STMT
:
14499 RETURN (build_cilk_sync ());
14501 case COMPOUND_EXPR
:
14502 tmp
= RECUR (TREE_OPERAND (t
, 0));
14503 if (tmp
== NULL_TREE
)
14504 /* If the first operand was a statement, we're done with it. */
14505 RETURN (RECUR (TREE_OPERAND (t
, 1)));
14506 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
14507 RECUR (TREE_OPERAND (t
, 1)),
14510 case ANNOTATE_EXPR
:
14511 tmp
= RECUR (TREE_OPERAND (t
, 0));
14512 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
14513 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
14516 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
14518 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14519 /*function_p=*/false,
14520 integral_constant_expression_p
));
14523 RETURN (NULL_TREE
);
14525 input_location
= loc
;
14531 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14532 function. For description of the body see comment above
14533 cp_parser_omp_declare_reduction_exprs. */
14536 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14538 if (t
== NULL_TREE
|| t
== error_mark_node
)
14541 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14543 tree_stmt_iterator tsi
;
14546 memset (stmts
, 0, sizeof stmts
);
14547 for (i
= 0, tsi
= tsi_start (t
);
14548 i
< 7 && !tsi_end_p (tsi
);
14549 i
++, tsi_next (&tsi
))
14550 stmts
[i
] = tsi_stmt (tsi
);
14551 gcc_assert (tsi_end_p (tsi
));
14555 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14556 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14557 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14558 args
, complain
, in_decl
);
14559 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14560 args
, complain
, in_decl
);
14561 DECL_CONTEXT (omp_out
) = current_function_decl
;
14562 DECL_CONTEXT (omp_in
) = current_function_decl
;
14563 keep_next_level (true);
14564 tree block
= begin_omp_structured_block ();
14565 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14566 block
= finish_omp_structured_block (block
);
14567 block
= maybe_cleanup_point_expr_void (block
);
14568 add_decl_expr (omp_out
);
14569 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14570 TREE_NO_WARNING (omp_out
) = 1;
14571 add_decl_expr (omp_in
);
14572 finish_expr_stmt (block
);
14576 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14577 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14578 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14579 args
, complain
, in_decl
);
14580 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14581 args
, complain
, in_decl
);
14582 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14583 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14584 keep_next_level (true);
14585 tree block
= begin_omp_structured_block ();
14586 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14587 block
= finish_omp_structured_block (block
);
14588 block
= maybe_cleanup_point_expr_void (block
);
14589 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14590 add_decl_expr (omp_priv
);
14591 add_decl_expr (omp_orig
);
14592 finish_expr_stmt (block
);
14594 add_decl_expr (omp_orig
);
14598 /* T is a postfix-expression that is not being used in a function
14599 call. Return the substituted version of T. */
14602 tsubst_non_call_postfix_expression (tree t
, tree args
,
14603 tsubst_flags_t complain
,
14606 if (TREE_CODE (t
) == SCOPE_REF
)
14607 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14608 /*done=*/false, /*address_p=*/false);
14610 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14611 /*function_p=*/false,
14612 /*integral_constant_expression_p=*/false);
14617 /* Like tsubst but deals with expressions and performs semantic
14618 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14621 tsubst_copy_and_build (tree t
,
14623 tsubst_flags_t complain
,
14626 bool integral_constant_expression_p
)
14628 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14629 #define RECUR(NODE) \
14630 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14631 /*function_p=*/false, \
14632 integral_constant_expression_p)
14637 if (t
== NULL_TREE
|| t
== error_mark_node
)
14640 loc
= input_location
;
14641 if (EXPR_HAS_LOCATION (t
))
14642 input_location
= EXPR_LOCATION (t
);
14644 /* N3276 decltype magic only applies to calls at the top level or on the
14645 right side of a comma. */
14646 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14647 complain
&= ~tf_decltype
;
14649 switch (TREE_CODE (t
))
14653 /* Fall through. */
14654 case IDENTIFIER_NODE
:
14658 bool non_integral_constant_expression_p
;
14659 const char *error_msg
;
14661 if (IDENTIFIER_TYPENAME_P (t
))
14663 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14664 t
= mangle_conv_op_name_for_type (new_type
);
14667 /* Look up the name. */
14668 decl
= lookup_name (t
);
14670 /* By convention, expressions use ERROR_MARK_NODE to indicate
14671 failure, not NULL_TREE. */
14672 if (decl
== NULL_TREE
)
14673 decl
= error_mark_node
;
14675 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14677 integral_constant_expression_p
,
14678 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14679 &non_integral_constant_expression_p
,
14680 /*template_p=*/false,
14682 /*address_p=*/false,
14683 /*template_arg_p=*/false,
14688 if (!function_p
&& identifier_p (decl
))
14690 if (complain
& tf_error
)
14691 unqualified_name_lookup_error (decl
);
14692 decl
= error_mark_node
;
14697 case TEMPLATE_ID_EXPR
:
14700 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14701 tree targs
= TREE_OPERAND (t
, 1);
14704 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14706 if (TREE_CODE (templ
) == COMPONENT_REF
)
14708 object
= TREE_OPERAND (templ
, 0);
14709 templ
= TREE_OPERAND (templ
, 1);
14712 object
= NULL_TREE
;
14713 templ
= lookup_template_function (templ
, targs
);
14716 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14717 object
, templ
, NULL_TREE
));
14719 RETURN (baselink_for_fns (templ
));
14724 tree r
= RECUR (TREE_OPERAND (t
, 0));
14726 if (REFERENCE_REF_P (t
))
14728 /* A type conversion to reference type will be enclosed in
14729 such an indirect ref, but the substitution of the cast
14730 will have also added such an indirect ref. */
14731 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14732 r
= convert_from_reference (r
);
14735 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14736 complain
|decltype_flag
);
14742 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14743 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14744 RETURN (build_nop (type
, op0
));
14747 case IMPLICIT_CONV_EXPR
:
14749 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14750 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14751 int flags
= LOOKUP_IMPLICIT
;
14752 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14753 flags
= LOOKUP_NORMAL
;
14754 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14760 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14761 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14762 RETURN (build1 (CONVERT_EXPR
, type
, op0
));
14766 case REINTERPRET_CAST_EXPR
:
14767 case CONST_CAST_EXPR
:
14768 case DYNAMIC_CAST_EXPR
:
14769 case STATIC_CAST_EXPR
:
14772 tree op
, r
= NULL_TREE
;
14774 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14775 if (integral_constant_expression_p
14776 && !cast_valid_in_integral_constant_expression_p (type
))
14778 if (complain
& tf_error
)
14779 error ("a cast to a type other than an integral or "
14780 "enumeration type cannot appear in a constant-expression");
14781 RETURN (error_mark_node
);
14784 op
= RECUR (TREE_OPERAND (t
, 0));
14786 warning_sentinel
s(warn_useless_cast
);
14787 switch (TREE_CODE (t
))
14790 r
= build_functional_cast (type
, op
, complain
);
14792 case REINTERPRET_CAST_EXPR
:
14793 r
= build_reinterpret_cast (type
, op
, complain
);
14795 case CONST_CAST_EXPR
:
14796 r
= build_const_cast (type
, op
, complain
);
14798 case DYNAMIC_CAST_EXPR
:
14799 r
= build_dynamic_cast (type
, op
, complain
);
14801 case STATIC_CAST_EXPR
:
14802 r
= build_static_cast (type
, op
, complain
);
14805 gcc_unreachable ();
14811 case POSTDECREMENT_EXPR
:
14812 case POSTINCREMENT_EXPR
:
14813 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14814 args
, complain
, in_decl
);
14815 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14816 complain
|decltype_flag
));
14818 case PREDECREMENT_EXPR
:
14819 case PREINCREMENT_EXPR
:
14823 case TRUTH_NOT_EXPR
:
14824 case UNARY_PLUS_EXPR
: /* Unary + */
14825 case REALPART_EXPR
:
14826 case IMAGPART_EXPR
:
14827 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14828 RECUR (TREE_OPERAND (t
, 0)),
14829 complain
|decltype_flag
));
14831 case FIX_TRUNC_EXPR
:
14832 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14836 op1
= TREE_OPERAND (t
, 0);
14837 if (TREE_CODE (op1
) == LABEL_DECL
)
14838 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14839 EXPR_LOCATION (op1
)));
14840 if (TREE_CODE (op1
) == SCOPE_REF
)
14841 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14842 /*done=*/true, /*address_p=*/true);
14844 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14846 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14847 complain
|decltype_flag
));
14852 case TRUNC_DIV_EXPR
:
14853 case CEIL_DIV_EXPR
:
14854 case FLOOR_DIV_EXPR
:
14855 case ROUND_DIV_EXPR
:
14856 case EXACT_DIV_EXPR
:
14860 case TRUNC_MOD_EXPR
:
14861 case FLOOR_MOD_EXPR
:
14862 case TRUTH_ANDIF_EXPR
:
14863 case TRUTH_ORIF_EXPR
:
14864 case TRUTH_AND_EXPR
:
14865 case TRUTH_OR_EXPR
:
14881 warning_sentinel
s1(warn_type_limits
);
14882 warning_sentinel
s2(warn_div_by_zero
);
14883 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14884 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14885 tree r
= build_x_binary_op
14886 (input_location
, TREE_CODE (t
),
14888 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14890 : TREE_CODE (TREE_OPERAND (t
, 0))),
14892 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14894 : TREE_CODE (TREE_OPERAND (t
, 1))),
14896 complain
|decltype_flag
);
14897 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14898 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14903 case POINTER_PLUS_EXPR
:
14905 tree op0
= RECUR (TREE_OPERAND (t
, 0));
14906 tree op1
= RECUR (TREE_OPERAND (t
, 1));
14907 return fold_build_pointer_plus (op0
, op1
);
14911 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14912 /*address_p=*/false));
14914 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14915 args
, complain
, in_decl
);
14916 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14917 RECUR (TREE_OPERAND (t
, 1)),
14918 complain
|decltype_flag
));
14920 case ARRAY_NOTATION_REF
:
14922 tree start_index
, length
, stride
;
14923 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14924 args
, complain
, in_decl
);
14925 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14926 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14927 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14928 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14929 length
, stride
, TREE_TYPE (op1
)));
14932 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14933 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14940 op1
= TREE_OPERAND (t
, 0);
14941 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14942 op1
= TREE_TYPE (op1
);
14945 /* When there are no ARGS, we are trying to evaluate a
14946 non-dependent expression from the parser. Trying to do
14947 the substitutions may not work. */
14949 op1
= TREE_TYPE (op1
);
14953 ++cp_unevaluated_operand
;
14954 ++c_inhibit_evaluation_warnings
;
14956 op1
= tsubst (op1
, args
, complain
, in_decl
);
14958 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14959 /*function_p=*/false,
14960 /*integral_constant_expression_p=*/
14962 --cp_unevaluated_operand
;
14963 --c_inhibit_evaluation_warnings
;
14966 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14967 complain
& tf_error
);
14969 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14970 complain
& tf_error
);
14971 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14973 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14975 if (!processing_template_decl
&& TYPE_P (op1
))
14977 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14978 build1 (NOP_EXPR
, op1
, error_mark_node
));
14979 SIZEOF_EXPR_TYPE_P (r
) = 1;
14982 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14983 TREE_SIDE_EFFECTS (r
) = 0;
14984 TREE_READONLY (r
) = 1;
14986 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14991 case AT_ENCODE_EXPR
:
14993 op1
= TREE_OPERAND (t
, 0);
14994 ++cp_unevaluated_operand
;
14995 ++c_inhibit_evaluation_warnings
;
14996 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14997 /*function_p=*/false,
14998 /*integral_constant_expression_p=*/false);
14999 --cp_unevaluated_operand
;
15000 --c_inhibit_evaluation_warnings
;
15001 RETURN (objc_build_encode_expr (op1
));
15004 case NOEXCEPT_EXPR
:
15005 op1
= TREE_OPERAND (t
, 0);
15006 ++cp_unevaluated_operand
;
15007 ++c_inhibit_evaluation_warnings
;
15008 ++cp_noexcept_operand
;
15009 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
15010 /*function_p=*/false,
15011 /*integral_constant_expression_p=*/false);
15012 --cp_unevaluated_operand
;
15013 --c_inhibit_evaluation_warnings
;
15014 --cp_noexcept_operand
;
15015 RETURN (finish_noexcept_expr (op1
, complain
));
15019 warning_sentinel
s(warn_div_by_zero
);
15020 tree lhs
= RECUR (TREE_OPERAND (t
, 0));
15021 tree rhs
= RECUR (TREE_OPERAND (t
, 2));
15022 tree r
= build_x_modify_expr
15023 (EXPR_LOCATION (t
), lhs
, TREE_CODE (TREE_OPERAND (t
, 1)), rhs
,
15024 complain
|decltype_flag
);
15025 /* TREE_NO_WARNING must be set if either the expression was
15026 parenthesized or it uses an operator such as >>= rather
15027 than plain assignment. In the former case, it was already
15028 set and must be copied. In the latter case,
15029 build_x_modify_expr sets it and it must not be reset
15031 if (TREE_NO_WARNING (t
))
15032 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
15038 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15039 args
, complain
, in_decl
);
15040 /* Remember that there was a reference to this entity. */
15042 && !mark_used (op1
, complain
) && !(complain
& tf_error
))
15043 RETURN (error_mark_node
);
15044 RETURN (build_x_arrow (input_location
, op1
, complain
));
15048 tree placement
= RECUR (TREE_OPERAND (t
, 0));
15049 tree init
= RECUR (TREE_OPERAND (t
, 3));
15050 vec
<tree
, va_gc
> *placement_vec
;
15051 vec
<tree
, va_gc
> *init_vec
;
15054 if (placement
== NULL_TREE
)
15055 placement_vec
= NULL
;
15058 placement_vec
= make_tree_vector ();
15059 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
15060 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
15063 /* If there was an initializer in the original tree, but it
15064 instantiated to an empty list, then we should pass a
15065 non-NULL empty vector to tell build_new that it was an
15066 empty initializer() rather than no initializer. This can
15067 only happen when the initializer is a pack expansion whose
15068 parameter packs are of length zero. */
15069 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
15073 init_vec
= make_tree_vector ();
15074 if (init
== void_node
)
15075 gcc_assert (init_vec
!= NULL
);
15078 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
15079 vec_safe_push (init_vec
, TREE_VALUE (init
));
15083 tree op1
= tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
);
15084 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15085 ret
= build_new (&placement_vec
, op1
, op2
, &init_vec
,
15086 NEW_EXPR_USE_GLOBAL (t
),
15089 if (placement_vec
!= NULL
)
15090 release_tree_vector (placement_vec
);
15091 if (init_vec
!= NULL
)
15092 release_tree_vector (init_vec
);
15099 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15100 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15101 RETURN (delete_sanity (op0
, op1
,
15102 DELETE_EXPR_USE_VEC (t
),
15103 DELETE_EXPR_USE_GLOBAL (t
),
15107 case COMPOUND_EXPR
:
15109 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
15110 complain
& ~tf_decltype
, in_decl
,
15111 /*function_p=*/false,
15112 integral_constant_expression_p
);
15113 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
15115 RECUR (TREE_OPERAND (t
, 1)),
15116 complain
|decltype_flag
));
15122 vec
<tree
, va_gc
> *call_args
;
15123 unsigned int nargs
, i
;
15128 function
= CALL_EXPR_FN (t
);
15129 /* When we parsed the expression, we determined whether or
15130 not Koenig lookup should be performed. */
15131 koenig_p
= KOENIG_LOOKUP_P (t
);
15132 if (TREE_CODE (function
) == SCOPE_REF
)
15134 qualified_p
= true;
15135 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
15137 /*address_p=*/false);
15139 else if (koenig_p
&& identifier_p (function
))
15141 /* Do nothing; calling tsubst_copy_and_build on an identifier
15142 would incorrectly perform unqualified lookup again.
15144 Note that we can also have an IDENTIFIER_NODE if the earlier
15145 unqualified lookup found a member function; in that case
15146 koenig_p will be false and we do want to do the lookup
15147 again to find the instantiated member function.
15149 FIXME but doing that causes c++/15272, so we need to stop
15150 using IDENTIFIER_NODE in that situation. */
15151 qualified_p
= false;
15155 if (TREE_CODE (function
) == COMPONENT_REF
)
15157 tree op
= TREE_OPERAND (function
, 1);
15159 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
15160 || (BASELINK_P (op
)
15161 && BASELINK_QUALIFIED_P (op
)));
15164 qualified_p
= false;
15166 if (TREE_CODE (function
) == ADDR_EXPR
15167 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
15168 /* Avoid error about taking the address of a constructor. */
15169 function
= TREE_OPERAND (function
, 0);
15171 function
= tsubst_copy_and_build (function
, args
, complain
,
15174 integral_constant_expression_p
);
15176 if (BASELINK_P (function
))
15177 qualified_p
= true;
15180 nargs
= call_expr_nargs (t
);
15181 call_args
= make_tree_vector ();
15182 for (i
= 0; i
< nargs
; ++i
)
15184 tree arg
= CALL_EXPR_ARG (t
, i
);
15186 if (!PACK_EXPANSION_P (arg
))
15187 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
15190 /* Expand the pack expansion and push each entry onto
15192 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
15193 if (TREE_CODE (arg
) == TREE_VEC
)
15195 unsigned int len
, j
;
15197 len
= TREE_VEC_LENGTH (arg
);
15198 for (j
= 0; j
< len
; ++j
)
15200 tree value
= TREE_VEC_ELT (arg
, j
);
15201 if (value
!= NULL_TREE
)
15202 value
= convert_from_reference (value
);
15203 vec_safe_push (call_args
, value
);
15208 /* A partial substitution. Add one entry. */
15209 vec_safe_push (call_args
, arg
);
15214 /* We do not perform argument-dependent lookup if normal
15215 lookup finds a non-function, in accordance with the
15216 expected resolution of DR 218. */
15218 && ((is_overloaded_fn (function
)
15219 /* If lookup found a member function, the Koenig lookup is
15220 not appropriate, even if an unqualified-name was used
15221 to denote the function. */
15222 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
15223 || identifier_p (function
))
15224 /* Only do this when substitution turns a dependent call
15225 into a non-dependent call. */
15226 && type_dependent_expression_p_push (t
)
15227 && !any_type_dependent_arguments_p (call_args
))
15228 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
15230 if (identifier_p (function
)
15231 && !any_type_dependent_arguments_p (call_args
))
15233 if (koenig_p
&& (complain
& tf_warning_or_error
))
15235 /* For backwards compatibility and good diagnostics, try
15236 the unqualified lookup again if we aren't in SFINAE
15238 tree unq
= (tsubst_copy_and_build
15239 (function
, args
, complain
, in_decl
, true,
15240 integral_constant_expression_p
));
15241 if (unq
== error_mark_node
)
15242 RETURN (error_mark_node
);
15244 if (unq
!= function
)
15247 if (INDIRECT_REF_P (fn
))
15248 fn
= TREE_OPERAND (fn
, 0);
15249 if (TREE_CODE (fn
) == COMPONENT_REF
)
15250 fn
= TREE_OPERAND (fn
, 1);
15251 if (is_overloaded_fn (fn
))
15252 fn
= get_first_fn (fn
);
15253 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
15254 "%qD was not declared in this scope, "
15255 "and no declarations were found by "
15256 "argument-dependent lookup at the point "
15257 "of instantiation", function
))
15260 /* Can't say anything more. */;
15261 else if (DECL_CLASS_SCOPE_P (fn
))
15263 location_t loc
= EXPR_LOC_OR_LOC (t
,
15266 "declarations in dependent base %qT are "
15267 "not found by unqualified lookup",
15268 DECL_CLASS_CONTEXT (fn
));
15269 if (current_class_ptr
)
15271 "use %<this->%D%> instead", function
);
15274 "use %<%T::%D%> instead",
15275 current_class_name
, function
);
15278 inform (0, "%q+D declared here, later in the "
15279 "translation unit", fn
);
15284 if (identifier_p (function
))
15286 if (complain
& tf_error
)
15287 unqualified_name_lookup_error (function
);
15288 release_tree_vector (call_args
);
15289 RETURN (error_mark_node
);
15293 /* Remember that there was a reference to this entity. */
15294 if (DECL_P (function
)
15295 && !mark_used (function
, complain
) && !(complain
& tf_error
))
15296 RETURN (error_mark_node
);
15298 /* Put back tf_decltype for the actual call. */
15299 complain
|= decltype_flag
;
15301 if (TREE_CODE (function
) == OFFSET_REF
)
15302 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
15304 else if (TREE_CODE (function
) == COMPONENT_REF
)
15306 tree instance
= TREE_OPERAND (function
, 0);
15307 tree fn
= TREE_OPERAND (function
, 1);
15309 if (processing_template_decl
15310 && (type_dependent_expression_p (instance
)
15311 || (!BASELINK_P (fn
)
15312 && TREE_CODE (fn
) != FIELD_DECL
)
15313 || type_dependent_expression_p (fn
)
15314 || any_type_dependent_arguments_p (call_args
)))
15315 ret
= build_nt_call_vec (function
, call_args
);
15316 else if (!BASELINK_P (fn
))
15317 ret
= finish_call_expr (function
, &call_args
,
15318 /*disallow_virtual=*/false,
15319 /*koenig_p=*/false,
15322 ret
= (build_new_method_call
15324 &call_args
, NULL_TREE
,
15325 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
15330 ret
= finish_call_expr (function
, &call_args
,
15331 /*disallow_virtual=*/qualified_p
,
15335 release_tree_vector (call_args
);
15342 tree cond
= RECUR (TREE_OPERAND (t
, 0));
15343 tree folded_cond
= fold_non_dependent_expr (cond
);
15346 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
15348 if (integer_zerop (folded_cond
))
15350 ++c_inhibit_evaluation_warnings
;
15351 exp1
= RECUR (TREE_OPERAND (t
, 1));
15352 --c_inhibit_evaluation_warnings
;
15353 exp2
= RECUR (TREE_OPERAND (t
, 2));
15357 exp1
= RECUR (TREE_OPERAND (t
, 1));
15358 ++c_inhibit_evaluation_warnings
;
15359 exp2
= RECUR (TREE_OPERAND (t
, 2));
15360 --c_inhibit_evaluation_warnings
;
15362 cond
= folded_cond
;
15366 exp1
= RECUR (TREE_OPERAND (t
, 1));
15367 exp2
= RECUR (TREE_OPERAND (t
, 2));
15370 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
15371 cond
, exp1
, exp2
, complain
));
15374 case PSEUDO_DTOR_EXPR
:
15376 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15377 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15378 tree op2
= tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
);
15379 RETURN (finish_pseudo_destructor_expr (op0
, op1
, op2
,
15385 tree purpose
, value
, chain
;
15387 if (t
== void_list_node
)
15390 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
15391 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
15393 /* We have pack expansions, so expand those and
15394 create a new list out of it. */
15395 tree purposevec
= NULL_TREE
;
15396 tree valuevec
= NULL_TREE
;
15400 /* Expand the argument expressions. */
15401 if (TREE_PURPOSE (t
))
15402 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
15403 complain
, in_decl
);
15404 if (TREE_VALUE (t
))
15405 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
15406 complain
, in_decl
);
15408 /* Build the rest of the list. */
15409 chain
= TREE_CHAIN (t
);
15410 if (chain
&& chain
!= void_type_node
)
15411 chain
= RECUR (chain
);
15413 /* Determine the number of arguments. */
15414 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
15416 len
= TREE_VEC_LENGTH (purposevec
);
15417 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
15419 else if (TREE_CODE (valuevec
) == TREE_VEC
)
15420 len
= TREE_VEC_LENGTH (valuevec
);
15423 /* Since we only performed a partial substitution into
15424 the argument pack, we only RETURN (a single list
15426 if (purposevec
== TREE_PURPOSE (t
)
15427 && valuevec
== TREE_VALUE (t
)
15428 && chain
== TREE_CHAIN (t
))
15431 RETURN (tree_cons (purposevec
, valuevec
, chain
));
15434 /* Convert the argument vectors into a TREE_LIST */
15438 /* Grab the Ith values. */
15440 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
15443 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
15446 /* Build the list (backwards). */
15447 chain
= tree_cons (purpose
, value
, chain
);
15453 purpose
= TREE_PURPOSE (t
);
15455 purpose
= RECUR (purpose
);
15456 value
= TREE_VALUE (t
);
15458 value
= RECUR (value
);
15459 chain
= TREE_CHAIN (t
);
15460 if (chain
&& chain
!= void_type_node
)
15461 chain
= RECUR (chain
);
15462 if (purpose
== TREE_PURPOSE (t
)
15463 && value
== TREE_VALUE (t
)
15464 && chain
== TREE_CHAIN (t
))
15466 RETURN (tree_cons (purpose
, value
, chain
));
15469 case COMPONENT_REF
:
15476 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15477 args
, complain
, in_decl
);
15478 /* Remember that there was a reference to this entity. */
15479 if (DECL_P (object
)
15480 && !mark_used (object
, complain
) && !(complain
& tf_error
))
15481 RETURN (error_mark_node
);
15482 object_type
= TREE_TYPE (object
);
15484 member
= TREE_OPERAND (t
, 1);
15485 if (BASELINK_P (member
))
15486 member
= tsubst_baselink (member
,
15487 non_reference (TREE_TYPE (object
)),
15488 args
, complain
, in_decl
);
15490 member
= tsubst_copy (member
, args
, complain
, in_decl
);
15491 if (member
== error_mark_node
)
15492 RETURN (error_mark_node
);
15494 if (type_dependent_expression_p (object
))
15495 /* We can't do much here. */;
15496 else if (!CLASS_TYPE_P (object_type
))
15498 if (scalarish_type_p (object_type
))
15500 tree s
= NULL_TREE
;
15501 tree dtor
= member
;
15503 if (TREE_CODE (dtor
) == SCOPE_REF
)
15505 s
= TREE_OPERAND (dtor
, 0);
15506 dtor
= TREE_OPERAND (dtor
, 1);
15508 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
15510 dtor
= TREE_OPERAND (dtor
, 0);
15512 RETURN (finish_pseudo_destructor_expr
15513 (object
, s
, dtor
, input_location
));
15517 else if (TREE_CODE (member
) == SCOPE_REF
15518 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
15520 /* Lookup the template functions now that we know what the
15522 tree scope
= TREE_OPERAND (member
, 0);
15523 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
15524 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
15525 member
= lookup_qualified_name (scope
, tmpl
,
15526 /*is_type_p=*/false,
15527 /*complain=*/false);
15528 if (BASELINK_P (member
))
15530 BASELINK_FUNCTIONS (member
)
15531 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
15533 member
= (adjust_result_of_qualified_name_lookup
15534 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15539 qualified_name_lookup_error (scope
, tmpl
, member
,
15541 RETURN (error_mark_node
);
15544 else if (TREE_CODE (member
) == SCOPE_REF
15545 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15546 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15548 if (complain
& tf_error
)
15550 if (TYPE_P (TREE_OPERAND (member
, 0)))
15551 error ("%qT is not a class or namespace",
15552 TREE_OPERAND (member
, 0));
15554 error ("%qD is not a class or namespace",
15555 TREE_OPERAND (member
, 0));
15557 RETURN (error_mark_node
);
15559 else if (TREE_CODE (member
) == FIELD_DECL
)
15561 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15562 if (TREE_CODE (r
) == COMPONENT_REF
)
15563 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15567 r
= finish_class_member_access_expr (object
, member
,
15568 /*template_p=*/false,
15570 if (TREE_CODE (r
) == COMPONENT_REF
)
15571 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15576 RETURN (build_throw
15577 (RECUR (TREE_OPERAND (t
, 0))));
15581 vec
<constructor_elt
, va_gc
> *n
;
15582 constructor_elt
*ce
;
15583 unsigned HOST_WIDE_INT idx
;
15584 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15585 bool process_index_p
;
15587 bool need_copy_p
= false;
15590 if (type
== error_mark_node
)
15591 RETURN (error_mark_node
);
15593 /* digest_init will do the wrong thing if we let it. */
15594 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15597 /* We do not want to process the index of aggregate
15598 initializers as they are identifier nodes which will be
15599 looked up by digest_init. */
15600 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15602 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15603 newlen
= vec_safe_length (n
);
15604 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15606 if (ce
->index
&& process_index_p
15607 /* An identifier index is looked up in the type
15608 being initialized, not the current scope. */
15609 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15610 ce
->index
= RECUR (ce
->index
);
15612 if (PACK_EXPANSION_P (ce
->value
))
15614 /* Substitute into the pack expansion. */
15615 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15618 if (ce
->value
== error_mark_node
15619 || PACK_EXPANSION_P (ce
->value
))
15621 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15622 /* Just move the argument into place. */
15623 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15626 /* Update the length of the final CONSTRUCTOR
15627 arguments vector, and note that we will need to
15629 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15630 need_copy_p
= true;
15634 ce
->value
= RECUR (ce
->value
);
15639 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15641 vec_alloc (n
, newlen
);
15642 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15644 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15646 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15647 for (i
= 0; i
< len
; ++i
)
15648 CONSTRUCTOR_APPEND_ELT (n
, 0,
15649 TREE_VEC_ELT (ce
->value
, i
));
15652 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15656 r
= build_constructor (init_list_type_node
, n
);
15657 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15659 if (TREE_HAS_CONSTRUCTOR (t
))
15660 RETURN (finish_compound_literal (type
, r
, complain
));
15662 TREE_TYPE (r
) = type
;
15668 tree operand_0
= TREE_OPERAND (t
, 0);
15669 if (TYPE_P (operand_0
))
15671 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15672 RETURN (get_typeid (operand_0
, complain
));
15676 operand_0
= RECUR (operand_0
);
15677 RETURN (build_typeid (operand_0
, complain
));
15684 else if (DECL_PACK_P (t
))
15686 /* We don't build decls for an instantiation of a
15687 variadic capture proxy, we instantiate the elements
15689 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15690 return RECUR (DECL_VALUE_EXPR (t
));
15696 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15697 /* ??? We're doing a subset of finish_id_expression here. */
15699 && !processing_template_decl
15700 && !cp_unevaluated_operand
15701 && (TREE_STATIC (r
) || DECL_EXTERNAL (r
))
15702 && CP_DECL_THREAD_LOCAL_P (r
))
15704 if (tree wrap
= get_tls_wrapper_fn (r
))
15705 /* Replace an evaluated use of the thread_local variable with
15706 a call to its wrapper. */
15707 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
15709 else if (outer_automatic_var_p (r
))
15711 r
= process_outer_var_ref (r
, complain
);
15712 if (is_capture_proxy (r
))
15713 register_local_specialization (r
, t
);
15716 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15717 /* If the original type was a reference, we'll be wrapped in
15718 the appropriate INDIRECT_REF. */
15719 r
= convert_from_reference (r
);
15725 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15726 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15727 RETURN (build_x_va_arg (EXPR_LOCATION (t
), op0
, type
));
15730 case OFFSETOF_EXPR
:
15731 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0)),
15732 EXPR_LOCATION (t
)));
15736 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15737 complain
, in_decl
);
15739 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15740 if (type2
&& TREE_CODE (type2
) == TREE_LIST
)
15741 type2
= RECUR (type2
);
15743 type2
= tsubst (type2
, args
, complain
, in_decl
);
15745 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15750 tree old_stmt_expr
= cur_stmt_expr
;
15751 tree stmt_expr
= begin_stmt_expr ();
15753 cur_stmt_expr
= stmt_expr
;
15754 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15755 integral_constant_expression_p
);
15756 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15757 cur_stmt_expr
= old_stmt_expr
;
15759 /* If the resulting list of expression statement is empty,
15760 fold it further into void_node. */
15761 if (empty_expr_stmt_p (stmt_expr
))
15762 stmt_expr
= void_node
;
15764 RETURN (stmt_expr
);
15769 tree r
= build_lambda_expr ();
15771 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15772 LAMBDA_EXPR_CLOSURE (r
) = type
;
15773 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15775 LAMBDA_EXPR_LOCATION (r
)
15776 = LAMBDA_EXPR_LOCATION (t
);
15777 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15778 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15779 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15780 LAMBDA_EXPR_DISCRIMINATOR (r
)
15781 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15782 /* For a function scope, we want to use tsubst so that we don't
15783 complain about referring to an auto function before its return
15784 type has been deduced. Otherwise, we want to use tsubst_copy so
15785 that we look up the existing field/parameter/variable rather
15786 than build a new one. */
15787 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15788 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15789 scope
= tsubst (scope
, args
, complain
, in_decl
);
15790 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15792 /* Look up the parameter we want directly, as tsubst_copy
15793 doesn't do what we need. */
15794 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15795 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15796 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15797 parm
= DECL_CHAIN (parm
);
15799 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15800 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15801 DECL_CONTEXT (scope
) = fn
;
15804 scope
= RECUR (scope
);
15805 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15806 LAMBDA_EXPR_RETURN_TYPE (r
)
15807 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15809 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15810 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15812 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15813 determine_visibility (TYPE_NAME (type
));
15814 /* Now that we know visibility, instantiate the type so we have a
15815 declaration of the op() for later calls to lambda_function. */
15816 complete_type (type
);
15818 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15820 RETURN (build_lambda_object (r
));
15824 /* We can get here for a constant initializer of non-dependent type.
15825 FIXME stop folding in cp_parser_initializer_clause. */
15827 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15832 case TRANSACTION_EXPR
:
15833 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15834 integral_constant_expression_p
));
15837 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15839 case VEC_PERM_EXPR
:
15841 tree op0
= RECUR (TREE_OPERAND (t
, 0));
15842 tree op1
= RECUR (TREE_OPERAND (t
, 1));
15843 tree op2
= RECUR (TREE_OPERAND (t
, 2));
15844 RETURN (build_x_vec_perm_expr (input_location
, op0
, op1
, op2
,
15849 /* Handle Objective-C++ constructs, if appropriate. */
15852 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15853 in_decl
, /*function_p=*/false);
15857 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15863 input_location
= loc
;
15867 /* Verify that the instantiated ARGS are valid. For type arguments,
15868 make sure that the type's linkage is ok. For non-type arguments,
15869 make sure they are constants if they are integral or enumerations.
15870 Emit an error under control of COMPLAIN, and return TRUE on error. */
15873 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15875 if (dependent_template_arg_p (t
))
15877 if (ARGUMENT_PACK_P (t
))
15879 tree vec
= ARGUMENT_PACK_ARGS (t
);
15880 int len
= TREE_VEC_LENGTH (vec
);
15881 bool result
= false;
15884 for (i
= 0; i
< len
; ++i
)
15885 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15889 else if (TYPE_P (t
))
15891 /* [basic.link]: A name with no linkage (notably, the name
15892 of a class or enumeration declared in a local scope)
15893 shall not be used to declare an entity with linkage.
15894 This implies that names with no linkage cannot be used as
15897 DR 757 relaxes this restriction for C++0x. */
15898 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15899 : no_linkage_check (t
, /*relaxed_p=*/false));
15903 /* DR 488 makes use of a type with no linkage cause
15904 type deduction to fail. */
15905 if (complain
& tf_error
)
15907 if (TYPE_ANONYMOUS_P (nt
))
15908 error ("%qT is/uses anonymous type", t
);
15910 error ("template argument for %qD uses local type %qT",
15915 /* In order to avoid all sorts of complications, we do not
15916 allow variably-modified types as template arguments. */
15917 else if (variably_modified_type_p (t
, NULL_TREE
))
15919 if (complain
& tf_error
)
15920 error ("%qT is a variably modified type", t
);
15924 /* Class template and alias template arguments should be OK. */
15925 else if (DECL_TYPE_TEMPLATE_P (t
))
15927 /* A non-type argument of integral or enumerated type must be a
15929 else if (TREE_TYPE (t
)
15930 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15931 && !REFERENCE_REF_P (t
)
15932 && !TREE_CONSTANT (t
))
15934 if (complain
& tf_error
)
15935 error ("integral expression %qE is not constant", t
);
15942 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15944 int ix
, len
= DECL_NTPARMS (tmpl
);
15945 bool result
= false;
15947 for (ix
= 0; ix
!= len
; ix
++)
15949 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15952 if (result
&& (complain
& tf_error
))
15953 error (" trying to instantiate %qD", tmpl
);
15957 /* We're out of SFINAE context now, so generate diagnostics for the access
15958 errors we saw earlier when instantiating D from TMPL and ARGS. */
15961 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15963 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15964 tree type
= TREE_TYPE (pattern
);
15965 location_t loc
= input_location
;
15967 push_access_scope (d
);
15968 push_deferring_access_checks (dk_no_deferred
);
15969 input_location
= DECL_SOURCE_LOCATION (pattern
);
15970 tsubst (type
, args
, tf_warning_or_error
, d
);
15971 input_location
= loc
;
15972 pop_deferring_access_checks ();
15973 pop_access_scope (d
);
15976 /* Instantiate the indicated variable, function, or alias template TMPL with
15977 the template arguments in TARG_PTR. */
15980 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15982 tree targ_ptr
= orig_args
;
15986 bool access_ok
= true;
15988 if (tmpl
== error_mark_node
)
15989 return error_mark_node
;
15991 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15993 /* If this function is a clone, handle it specially. */
15994 if (DECL_CLONED_FUNCTION_P (tmpl
))
15999 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
16000 DECL_CLONED_FUNCTION. */
16001 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
16002 targ_ptr
, complain
);
16003 if (spec
== error_mark_node
)
16004 return error_mark_node
;
16006 /* Look for the clone. */
16007 FOR_EACH_CLONE (clone
, spec
)
16008 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
16010 /* We should always have found the clone by now. */
16011 gcc_unreachable ();
16015 if (targ_ptr
== error_mark_node
)
16016 return error_mark_node
;
16018 /* Check to see if we already have this specialization. */
16019 gen_tmpl
= most_general_template (tmpl
);
16020 if (tmpl
!= gen_tmpl
)
16021 /* The TMPL is a partial instantiation. To get a full set of
16022 arguments we must add the arguments used to perform the
16023 partial instantiation. */
16024 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
16027 /* It would be nice to avoid hashing here and then again in tsubst_decl,
16028 but it doesn't seem to be on the hot path. */
16029 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
16031 gcc_assert (tmpl
== gen_tmpl
16032 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
16034 || fndecl
== NULL_TREE
);
16036 if (spec
!= NULL_TREE
)
16038 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
16040 if (complain
& tf_error
)
16041 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
16042 return error_mark_node
;
16047 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
16049 return error_mark_node
;
16051 /* We are building a FUNCTION_DECL, during which the access of its
16052 parameters and return types have to be checked. However this
16053 FUNCTION_DECL which is the desired context for access checking
16054 is not built yet. We solve this chicken-and-egg problem by
16055 deferring all checks until we have the FUNCTION_DECL. */
16056 push_deferring_access_checks (dk_deferred
);
16058 /* Instantiation of the function happens in the context of the function
16059 template, not the context of the overload resolution we're doing. */
16060 push_to_top_level ();
16061 /* If there are dependent arguments, e.g. because we're doing partial
16062 ordering, make sure processing_template_decl stays set. */
16063 if (uses_template_parms (targ_ptr
))
16064 ++processing_template_decl
;
16065 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
16067 tree ctx
= tsubst_aggr_type (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
16068 complain
, gen_tmpl
, true);
16069 push_nested_class (ctx
);
16072 tree pattern
= DECL_TEMPLATE_RESULT (gen_tmpl
);
16074 if (VAR_P (pattern
))
16076 /* We need to determine if we're using a partial or explicit
16077 specialization now, because the type of the variable could be
16079 tree tid
= lookup_template_variable (gen_tmpl
, targ_ptr
);
16080 tree elt
= most_specialized_partial_spec (tid
, complain
);
16081 if (elt
== error_mark_node
)
16082 pattern
= error_mark_node
;
16085 tmpl
= TREE_VALUE (elt
);
16086 pattern
= DECL_TEMPLATE_RESULT (tmpl
);
16087 targ_ptr
= TREE_PURPOSE (elt
);
16091 /* Substitute template parameters to obtain the specialization. */
16092 fndecl
= tsubst (pattern
, targ_ptr
, complain
, gen_tmpl
);
16093 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
16094 pop_nested_class ();
16095 pop_from_top_level ();
16097 if (fndecl
== error_mark_node
)
16099 pop_deferring_access_checks ();
16100 return error_mark_node
;
16103 /* The DECL_TI_TEMPLATE should always be the immediate parent
16104 template, not the most general template. */
16105 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
16107 /* Now we know the specialization, compute access previously
16109 push_access_scope (fndecl
);
16110 if (!perform_deferred_access_checks (complain
))
16112 pop_access_scope (fndecl
);
16113 pop_deferring_access_checks ();
16115 /* If we've just instantiated the main entry point for a function,
16116 instantiate all the alternate entry points as well. We do this
16117 by cloning the instantiation of the main entry point, not by
16118 instantiating the template clones. */
16119 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
16120 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
16124 if (!(complain
& tf_error
))
16126 /* Remember to reinstantiate when we're out of SFINAE so the user
16127 can see the errors. */
16128 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
16130 return error_mark_node
;
16135 /* Wrapper for instantiate_template_1. */
16138 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
16141 timevar_push (TV_TEMPLATE_INST
);
16142 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
16143 timevar_pop (TV_TEMPLATE_INST
);
16147 /* Instantiate the alias template TMPL with ARGS. Also push a template
16148 instantiation level, which instantiate_template doesn't do because
16149 functions and variables have sufficient context established by the
16153 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
16155 struct pending_template
*old_last_pend
= last_pending_template
;
16156 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
16157 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
16158 return error_mark_node
;
16159 tree tinst
= build_tree_list (tmpl
, args
);
16160 if (!push_tinst_level (tinst
))
16163 return error_mark_node
;
16167 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
16168 args
, tmpl
, complain
,
16169 /*require_all_args=*/true,
16170 /*use_default_args=*/true);
16172 tree r
= instantiate_template (tmpl
, args
, complain
);
16173 pop_tinst_level ();
16174 /* We can't free this if a pending_template entry or last_error_tinst_level
16175 is pointing at it. */
16176 if (last_pending_template
== old_last_pend
16177 && last_error_tinst_level
== old_error_tinst
)
16183 /* PARM is a template parameter pack for FN. Returns true iff
16184 PARM is used in a deducible way in the argument list of FN. */
16187 pack_deducible_p (tree parm
, tree fn
)
16189 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
16190 for (; t
; t
= TREE_CHAIN (t
))
16192 tree type
= TREE_VALUE (t
);
16194 if (!PACK_EXPANSION_P (type
))
16196 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
16197 packs
; packs
= TREE_CHAIN (packs
))
16198 if (template_args_equal (TREE_VALUE (packs
), parm
))
16200 /* The template parameter pack is used in a function parameter
16201 pack. If this is the end of the parameter list, the
16202 template parameter pack is deducible. */
16203 if (TREE_CHAIN (t
) == void_list_node
)
16206 /* Otherwise, not. Well, it could be deduced from
16207 a non-pack parameter, but doing so would end up with
16208 a deduction mismatch, so don't bother. */
16212 /* The template parameter pack isn't used in any function parameter
16213 packs, but it might be used deeper, e.g. tuple<Args...>. */
16217 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
16218 NARGS elements of the arguments that are being used when calling
16219 it. TARGS is a vector into which the deduced template arguments
16222 Returns either a FUNCTION_DECL for the matching specialization of FN or
16223 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
16224 true, diagnostics will be printed to explain why it failed.
16226 If FN is a conversion operator, or we are trying to produce a specific
16227 specialization, RETURN_TYPE is the return type desired.
16229 The EXPLICIT_TARGS are explicit template arguments provided via a
16232 The parameter STRICT is one of:
16235 We are deducing arguments for a function call, as in
16236 [temp.deduct.call].
16239 We are deducing arguments for a conversion function, as in
16240 [temp.deduct.conv].
16243 We are deducing arguments when doing an explicit instantiation
16244 as in [temp.explicit], when determining an explicit specialization
16245 as in [temp.expl.spec], or when taking the address of a function
16246 template, as in [temp.deduct.funcaddr]. */
16249 fn_type_unification (tree fn
,
16250 tree explicit_targs
,
16253 unsigned int nargs
,
16255 unification_kind_t strict
,
16262 tree decl
= NULL_TREE
;
16263 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
16265 static int deduction_depth
;
16266 struct pending_template
*old_last_pend
= last_pending_template
;
16267 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
16268 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
16270 tree r
= error_mark_node
;
16273 complain
|= tf_decltype
;
16275 /* In C++0x, it's possible to have a function template whose type depends
16276 on itself recursively. This is most obvious with decltype, but can also
16277 occur with enumeration scope (c++/48969). So we need to catch infinite
16278 recursion and reject the substitution at deduction time; this function
16279 will return error_mark_node for any repeated substitution.
16281 This also catches excessive recursion such as when f<N> depends on
16282 f<N-1> across all integers, and returns error_mark_node for all the
16283 substitutions back up to the initial one.
16285 This is, of course, not reentrant. */
16286 if (excessive_deduction_depth
)
16287 return error_mark_node
;
16288 tinst
= build_tree_list (fn
, NULL_TREE
);
16291 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
16293 fntype
= TREE_TYPE (fn
);
16294 if (explicit_targs
)
16298 The specified template arguments must match the template
16299 parameters in kind (i.e., type, nontype, template), and there
16300 must not be more arguments than there are parameters;
16301 otherwise type deduction fails.
16303 Nontype arguments must match the types of the corresponding
16304 nontype template parameters, or must be convertible to the
16305 types of the corresponding nontype parameters as specified in
16306 _temp.arg.nontype_, otherwise type deduction fails.
16308 All references in the function type of the function template
16309 to the corresponding template parameters are replaced by the
16310 specified template argument values. If a substitution in a
16311 template parameter or in the function type of the function
16312 template results in an invalid type, type deduction fails. */
16313 int i
, len
= TREE_VEC_LENGTH (tparms
);
16314 location_t loc
= input_location
;
16315 bool incomplete
= false;
16317 /* Adjust any explicit template arguments before entering the
16318 substitution context. */
16320 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
16322 /*require_all_args=*/false,
16323 /*use_default_args=*/false));
16324 if (explicit_targs
== error_mark_node
)
16327 /* Substitute the explicit args into the function type. This is
16328 necessary so that, for instance, explicitly declared function
16329 arguments can match null pointed constants. If we were given
16330 an incomplete set of explicit args, we must not do semantic
16331 processing during substitution as we could create partial
16333 for (i
= 0; i
< len
; i
++)
16335 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16336 bool parameter_pack
= false;
16337 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
16339 /* Dig out the actual parm. */
16340 if (TREE_CODE (parm
) == TYPE_DECL
16341 || TREE_CODE (parm
) == TEMPLATE_DECL
)
16343 parm
= TREE_TYPE (parm
);
16344 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
16346 else if (TREE_CODE (parm
) == PARM_DECL
)
16348 parm
= DECL_INITIAL (parm
);
16349 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
16352 if (!parameter_pack
&& targ
== NULL_TREE
)
16353 /* No explicit argument for this template parameter. */
16356 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
16358 /* Mark the argument pack as "incomplete". We could
16359 still deduce more arguments during unification.
16360 We remove this mark in type_unification_real. */
16363 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
16364 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
16365 = ARGUMENT_PACK_ARGS (targ
);
16368 /* We have some incomplete argument packs. */
16373 TREE_VALUE (tinst
) = explicit_targs
;
16374 if (!push_tinst_level (tinst
))
16376 excessive_deduction_depth
= true;
16379 processing_template_decl
+= incomplete
;
16380 input_location
= DECL_SOURCE_LOCATION (fn
);
16381 /* Ignore any access checks; we'll see them again in
16382 instantiate_template and they might have the wrong
16383 access path at this point. */
16384 push_deferring_access_checks (dk_deferred
);
16385 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
16386 complain
| tf_partial
, NULL_TREE
);
16387 pop_deferring_access_checks ();
16388 input_location
= loc
;
16389 processing_template_decl
-= incomplete
;
16390 pop_tinst_level ();
16392 if (fntype
== error_mark_node
)
16395 /* Place the explicitly specified arguments in TARGS. */
16396 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
16397 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
16400 /* Never do unification on the 'this' parameter. */
16401 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
16407 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
16408 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
16409 new_args
[0] = return_type
;
16410 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
16415 /* We allow incomplete unification without an error message here
16416 because the standard doesn't seem to explicitly prohibit it. Our
16417 callers must be ready to deal with unification failures in any
16420 TREE_VALUE (tinst
) = targs
;
16421 /* If we aren't explaining yet, push tinst context so we can see where
16422 any errors (e.g. from class instantiations triggered by instantiation
16423 of default template arguments) come from. If we are explaining, this
16424 context is redundant. */
16425 if (!explain_p
&& !push_tinst_level (tinst
))
16427 excessive_deduction_depth
= true;
16431 /* type_unification_real will pass back any access checks from default
16432 template argument substitution. */
16433 vec
<deferred_access_check
, va_gc
> *checks
;
16436 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16437 targs
, parms
, args
, nargs
, /*subr=*/0,
16438 strict
, flags
, &checks
, explain_p
);
16440 pop_tinst_level ();
16444 /* Now that we have bindings for all of the template arguments,
16445 ensure that the arguments deduced for the template template
16446 parameters have compatible template parameter lists. We cannot
16447 check this property before we have deduced all template
16448 arguments, because the template parameter types of a template
16449 template parameter might depend on prior template parameters
16450 deduced after the template template parameter. The following
16451 ill-formed example illustrates this issue:
16453 template<typename T, template<T> class C> void f(C<5>, T);
16455 template<int N> struct X {};
16458 f(X<5>(), 5l); // error: template argument deduction fails
16461 The template parameter list of 'C' depends on the template type
16462 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
16463 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
16464 time that we deduce 'C'. */
16465 if (!template_template_parm_bindings_ok_p
16466 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
16468 unify_inconsistent_template_template_parameters (explain_p
);
16472 /* All is well so far. Now, check:
16476 When all template arguments have been deduced, all uses of
16477 template parameters in nondeduced contexts are replaced with
16478 the corresponding deduced argument values. If the
16479 substitution results in an invalid type, as described above,
16480 type deduction fails. */
16481 TREE_VALUE (tinst
) = targs
;
16482 if (!push_tinst_level (tinst
))
16484 excessive_deduction_depth
= true;
16488 /* Also collect access checks from the instantiation. */
16489 reopen_deferring_access_checks (checks
);
16491 decl
= instantiate_template (fn
, targs
, complain
);
16493 checks
= get_deferred_access_checks ();
16494 pop_deferring_access_checks ();
16496 pop_tinst_level ();
16498 if (decl
== error_mark_node
)
16501 /* Now perform any access checks encountered during substitution. */
16502 push_access_scope (decl
);
16503 ok
= perform_access_checks (checks
, complain
);
16504 pop_access_scope (decl
);
16508 /* If we're looking for an exact match, check that what we got
16509 is indeed an exact match. It might not be if some template
16510 parameters are used in non-deduced contexts. But don't check
16511 for an exact match if we have dependent template arguments;
16512 in that case we're doing partial ordering, and we already know
16513 that we have two candidates that will provide the actual type. */
16514 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
16516 tree substed
= TREE_TYPE (decl
);
16520 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
16522 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
16523 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
16524 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
16526 unify_type_mismatch (explain_p
, args
[i
],
16527 TREE_VALUE (sarg
));
16536 if (excessive_deduction_depth
)
16538 if (deduction_depth
== 0)
16539 /* Reset once we're all the way out. */
16540 excessive_deduction_depth
= false;
16543 /* We can't free this if a pending_template entry or last_error_tinst_level
16544 is pointing at it. */
16545 if (last_pending_template
== old_last_pend
16546 && last_error_tinst_level
== old_error_tinst
)
16552 /* Adjust types before performing type deduction, as described in
16553 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16554 sections are symmetric. PARM is the type of a function parameter
16555 or the return type of the conversion function. ARG is the type of
16556 the argument passed to the call, or the type of the value
16557 initialized with the result of the conversion function.
16558 ARG_EXPR is the original argument expression, which may be null. */
16561 maybe_adjust_types_for_deduction (unification_kind_t strict
,
16574 /* Swap PARM and ARG throughout the remainder of this
16575 function; the handling is precisely symmetric since PARM
16576 will initialize ARG rather than vice versa. */
16577 std::swap (parm
, arg
);
16581 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16582 too, but here handle it by stripping the reference from PARM
16583 rather than by adding it to ARG. */
16584 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16585 && TYPE_REF_IS_RVALUE (*parm
)
16586 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16587 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16588 && TREE_CODE (*arg
) == REFERENCE_TYPE
16589 && !TYPE_REF_IS_RVALUE (*arg
))
16590 *parm
= TREE_TYPE (*parm
);
16591 /* Nothing else to do in this case. */
16595 gcc_unreachable ();
16598 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16600 /* [temp.deduct.call]
16602 If P is not a reference type:
16604 --If A is an array type, the pointer type produced by the
16605 array-to-pointer standard conversion (_conv.array_) is
16606 used in place of A for type deduction; otherwise,
16608 --If A is a function type, the pointer type produced by
16609 the function-to-pointer standard conversion
16610 (_conv.func_) is used in place of A for type deduction;
16613 --If A is a cv-qualified type, the top level
16614 cv-qualifiers of A's type are ignored for type
16616 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16617 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16618 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16619 *arg
= build_pointer_type (*arg
);
16621 *arg
= TYPE_MAIN_VARIANT (*arg
);
16624 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16625 of the form T&&, where T is a template parameter, and the argument
16626 is an lvalue, T is deduced as A& */
16627 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16628 && TYPE_REF_IS_RVALUE (*parm
)
16629 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16630 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16631 && (arg_expr
? real_lvalue_p (arg_expr
)
16632 /* try_one_overload doesn't provide an arg_expr, but
16633 functions are always lvalues. */
16634 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16635 *arg
= build_reference_type (*arg
);
16637 /* [temp.deduct.call]
16639 If P is a cv-qualified type, the top level cv-qualifiers
16640 of P's type are ignored for type deduction. If P is a
16641 reference type, the type referred to by P is used for
16643 *parm
= TYPE_MAIN_VARIANT (*parm
);
16644 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16646 *parm
= TREE_TYPE (*parm
);
16647 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16650 /* DR 322. For conversion deduction, remove a reference type on parm
16651 too (which has been swapped into ARG). */
16652 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16653 *arg
= TREE_TYPE (*arg
);
16658 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16659 template which does contain any deducible template parameters; check if
16660 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16661 unify_one_argument. */
16664 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16665 int flags
, bool explain_p
)
16670 type
= TREE_TYPE (arg
);
16674 if (same_type_p (parm
, type
))
16675 return unify_success (explain_p
);
16677 if (strict
== DEDUCE_CONV
)
16679 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16680 explain_p
? tf_warning_or_error
: tf_none
))
16681 return unify_success (explain_p
);
16683 else if (strict
!= DEDUCE_EXACT
)
16685 if (can_convert_arg (parm
, type
,
16686 TYPE_P (arg
) ? NULL_TREE
: arg
,
16687 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16688 return unify_success (explain_p
);
16691 if (strict
== DEDUCE_EXACT
)
16692 return unify_type_mismatch (explain_p
, parm
, arg
);
16694 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16697 static bool uses_deducible_template_parms (tree type
);
16699 /* Returns true iff the expression EXPR is one from which a template
16700 argument can be deduced. In other words, if it's an undecorated
16701 use of a template non-type parameter. */
16704 deducible_expression (tree expr
)
16706 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16709 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16710 deducible way; that is, if it has a max value of <PARM> - 1. */
16713 deducible_array_bound (tree domain
)
16715 if (domain
== NULL_TREE
)
16718 tree max
= TYPE_MAX_VALUE (domain
);
16719 if (TREE_CODE (max
) != MINUS_EXPR
)
16722 return deducible_expression (TREE_OPERAND (max
, 0));
16725 /* Returns true iff the template arguments ARGS use a template parameter
16726 in a deducible way. */
16729 deducible_template_args (tree args
)
16731 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16734 tree elt
= TREE_VEC_ELT (args
, i
);
16735 if (ARGUMENT_PACK_P (elt
))
16736 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16739 if (PACK_EXPANSION_P (elt
))
16740 elt
= PACK_EXPANSION_PATTERN (elt
);
16741 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16743 else if (TYPE_P (elt
))
16744 deducible
= uses_deducible_template_parms (elt
);
16746 deducible
= deducible_expression (elt
);
16754 /* Returns true iff TYPE contains any deducible references to template
16755 parameters, as per 14.8.2.5. */
16758 uses_deducible_template_parms (tree type
)
16760 if (PACK_EXPANSION_P (type
))
16761 type
= PACK_EXPANSION_PATTERN (type
);
16768 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16769 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16775 if (POINTER_TYPE_P (type
))
16776 return uses_deducible_template_parms (TREE_TYPE (type
));
16778 /* T[integer-constant ]
16780 if (TREE_CODE (type
) == ARRAY_TYPE
)
16781 return (uses_deducible_template_parms (TREE_TYPE (type
))
16782 || deducible_array_bound (TYPE_DOMAIN (type
)));
16794 if (TYPE_PTRMEM_P (type
))
16795 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16796 || (uses_deducible_template_parms
16797 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16799 /* template-name <T> (where template-name refers to a class template)
16800 template-name <i> (where template-name refers to a class template) */
16801 if (CLASS_TYPE_P (type
)
16802 && CLASSTYPE_TEMPLATE_INFO (type
)
16803 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16804 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16805 (CLASSTYPE_TI_ARGS (type
)));
16810 if (TREE_CODE (type
) == FUNCTION_TYPE
16811 || TREE_CODE (type
) == METHOD_TYPE
)
16813 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16815 tree parm
= TYPE_ARG_TYPES (type
);
16816 if (TREE_CODE (type
) == METHOD_TYPE
)
16817 parm
= TREE_CHAIN (parm
);
16818 for (; parm
; parm
= TREE_CHAIN (parm
))
16819 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16826 /* Subroutine of type_unification_real and unify_pack_expansion to
16827 handle unification of a single P/A pair. Parameters are as
16828 for those functions. */
16831 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16832 int subr
, unification_kind_t strict
,
16835 tree arg_expr
= NULL_TREE
;
16838 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16839 return unify_invalid (explain_p
);
16840 if (arg
== unknown_type_node
)
16841 /* We can't deduce anything from this, but we might get all the
16842 template args from other function args. */
16843 return unify_success (explain_p
);
16845 /* Implicit conversions (Clause 4) will be performed on a function
16846 argument to convert it to the type of the corresponding function
16847 parameter if the parameter type contains no template-parameters that
16848 participate in template argument deduction. */
16849 if (strict
!= DEDUCE_EXACT
16850 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16851 /* For function parameters with no deducible template parameters,
16852 just return. We'll check non-dependent conversions later. */
16853 return unify_success (explain_p
);
16858 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16859 | UNIFY_ALLOW_MORE_CV_QUAL
16860 | UNIFY_ALLOW_DERIVED
);
16864 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16868 arg_strict
= UNIFY_ALLOW_NONE
;
16872 gcc_unreachable ();
16875 /* We only do these transformations if this is the top-level
16876 parameter_type_list in a call or declaration matching; in other
16877 situations (nested function declarators, template argument lists) we
16878 won't be comparing a type to an expression, and we don't do any type
16884 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16885 if (type_unknown_p (arg
))
16887 /* [temp.deduct.type] A template-argument can be
16888 deduced from a pointer to function or pointer
16889 to member function argument if the set of
16890 overloaded functions does not contain function
16891 templates and at most one of a set of
16892 overloaded functions provides a unique
16895 if (resolve_overloaded_unification
16896 (tparms
, targs
, parm
, arg
, strict
,
16897 arg_strict
, explain_p
))
16898 return unify_success (explain_p
);
16899 return unify_overload_resolution_failure (explain_p
, arg
);
16903 arg
= unlowered_expr_type (arg
);
16904 if (arg
== error_mark_node
)
16905 return unify_invalid (explain_p
);
16909 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16912 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16913 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
16914 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16916 /* For deduction from an init-list we need the actual list. */
16917 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16919 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16922 /* Most parms like fn_type_unification.
16924 If SUBR is 1, we're being called recursively (to unify the
16925 arguments of a function or method parameter of a function
16928 CHECKS is a pointer to a vector of access checks encountered while
16929 substituting default template arguments. */
16932 type_unification_real (tree tparms
,
16936 unsigned int xnargs
,
16938 unification_kind_t strict
,
16940 vec
<deferred_access_check
, va_gc
> **checks
,
16945 int ntparms
= TREE_VEC_LENGTH (tparms
);
16946 int saw_undeduced
= 0;
16949 unsigned int nargs
;
16952 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16953 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16954 gcc_assert (ntparms
> 0);
16956 /* Reset the number of non-defaulted template arguments contained
16958 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16966 while (parms
&& parms
!= void_list_node
16969 parm
= TREE_VALUE (parms
);
16971 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16972 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16973 /* For a function parameter pack that occurs at the end of the
16974 parameter-declaration-list, the type A of each remaining
16975 argument of the call is compared with the type P of the
16976 declarator-id of the function parameter pack. */
16979 parms
= TREE_CHAIN (parms
);
16981 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16982 /* For a function parameter pack that does not occur at the
16983 end of the parameter-declaration-list, the type of the
16984 parameter pack is a non-deduced context. */
16990 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16996 && parms
!= void_list_node
16997 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16999 /* Unify the remaining arguments with the pack expansion type. */
17001 tree parmvec
= make_tree_vec (1);
17003 /* Allocate a TREE_VEC and copy in all of the arguments */
17004 argvec
= make_tree_vec (nargs
- ia
);
17005 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
17006 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
17008 /* Copy the parameter into parmvec. */
17009 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
17010 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
17011 /*subr=*/subr
, explain_p
))
17014 /* Advance to the end of the list of parameters. */
17015 parms
= TREE_CHAIN (parms
);
17018 /* Fail if we've reached the end of the parm list, and more args
17019 are present, and the parm list isn't variadic. */
17020 if (ia
< nargs
&& parms
== void_list_node
)
17021 return unify_too_many_arguments (explain_p
, nargs
, ia
);
17022 /* Fail if parms are left and they don't have default values and
17023 they aren't all deduced as empty packs (c++/57397). This is
17024 consistent with sufficient_parms_p. */
17025 if (parms
&& parms
!= void_list_node
17026 && TREE_PURPOSE (parms
) == NULL_TREE
)
17028 unsigned int count
= nargs
;
17033 type_pack_p
= TREE_CODE (TREE_VALUE (p
)) == TYPE_PACK_EXPANSION
;
17036 p
= TREE_CHAIN (p
);
17038 while (p
&& p
!= void_list_node
);
17039 if (count
!= nargs
)
17040 return unify_too_few_arguments (explain_p
, ia
, count
,
17046 tsubst_flags_t complain
= (explain_p
17047 ? tf_warning_or_error
17050 for (i
= 0; i
< ntparms
; i
++)
17052 tree targ
= TREE_VEC_ELT (targs
, i
);
17053 tree tparm
= TREE_VEC_ELT (tparms
, i
);
17055 /* Clear the "incomplete" flags on all argument packs now so that
17056 substituting them into later default arguments works. */
17057 if (targ
&& ARGUMENT_PACK_P (targ
))
17059 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
17060 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
17063 if (targ
|| tparm
== error_mark_node
)
17065 tparm
= TREE_VALUE (tparm
);
17067 /* If this is an undeduced nontype parameter that depends on
17068 a type parameter, try another pass; its type may have been
17069 deduced from a later argument than the one from which
17070 this parameter can be deduced. */
17071 if (TREE_CODE (tparm
) == PARM_DECL
17072 && uses_template_parms (TREE_TYPE (tparm
))
17073 && saw_undeduced
< 2)
17079 /* Core issue #226 (C++0x) [temp.deduct]:
17081 If a template argument has not been deduced, its
17082 default template argument, if any, is used.
17084 When we are in C++98 mode, TREE_PURPOSE will either
17085 be NULL_TREE or ERROR_MARK_NODE, so we do not need
17086 to explicitly check cxx_dialect here. */
17087 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
17088 /* OK, there is a default argument. Wait until after the
17089 conversion check to do substitution. */
17092 /* If the type parameter is a parameter pack, then it will
17093 be deduced to an empty parameter pack. */
17094 if (template_parameter_pack_p (tparm
))
17098 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
17100 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
17101 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
17102 TREE_CONSTANT (arg
) = 1;
17105 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17107 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
17109 TREE_VEC_ELT (targs
, i
) = arg
;
17113 return unify_parameter_deduction_failure (explain_p
, tparm
);
17116 /* DR 1391: All parameters have args, now check non-dependent parms for
17118 if (saw_undeduced
< 2)
17119 for (ia
= 0, parms
= xparms
, args
= xargs
, nargs
= xnargs
;
17120 parms
&& parms
!= void_list_node
&& ia
< nargs
; )
17122 parm
= TREE_VALUE (parms
);
17124 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
17125 && (!TREE_CHAIN (parms
)
17126 || TREE_CHAIN (parms
) == void_list_node
))
17127 /* For a function parameter pack that occurs at the end of the
17128 parameter-declaration-list, the type A of each remaining
17129 argument of the call is compared with the type P of the
17130 declarator-id of the function parameter pack. */
17133 parms
= TREE_CHAIN (parms
);
17135 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
17136 /* For a function parameter pack that does not occur at the
17137 end of the parameter-declaration-list, the type of the
17138 parameter pack is a non-deduced context. */
17144 if (uses_template_parms (parm
))
17146 if (check_non_deducible_conversion (parm
, arg
, strict
, flags
,
17151 /* Now substitute into the default template arguments. */
17152 for (i
= 0; i
< ntparms
; i
++)
17154 tree targ
= TREE_VEC_ELT (targs
, i
);
17155 tree tparm
= TREE_VEC_ELT (tparms
, i
);
17157 if (targ
|| tparm
== error_mark_node
)
17159 tree parm
= TREE_VALUE (tparm
);
17161 if (TREE_CODE (parm
) == PARM_DECL
17162 && uses_template_parms (TREE_TYPE (parm
))
17163 && saw_undeduced
< 2)
17166 tree arg
= TREE_PURPOSE (tparm
);
17167 reopen_deferring_access_checks (*checks
);
17168 location_t save_loc
= input_location
;
17170 input_location
= DECL_SOURCE_LOCATION (parm
);
17171 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
17172 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
17174 input_location
= save_loc
;
17175 *checks
= get_deferred_access_checks ();
17176 pop_deferring_access_checks ();
17177 if (arg
== error_mark_node
)
17181 TREE_VEC_ELT (targs
, i
) = arg
;
17182 /* The position of the first default template argument,
17183 is also the number of non-defaulted arguments in TARGS.
17185 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
17186 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
17191 if (saw_undeduced
++ == 1)
17194 #ifdef ENABLE_CHECKING
17195 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
17196 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
17199 return unify_success (explain_p
);
17202 /* Subroutine of type_unification_real. Args are like the variables
17203 at the call site. ARG is an overloaded function (or template-id);
17204 we try deducing template args from each of the overloads, and if
17205 only one succeeds, we go with that. Modifies TARGS and returns
17206 true on success. */
17209 resolve_overloaded_unification (tree tparms
,
17213 unification_kind_t strict
,
17217 tree tempargs
= copy_node (targs
);
17219 tree goodfn
= NULL_TREE
;
17222 if (TREE_CODE (arg
) == ADDR_EXPR
)
17224 arg
= TREE_OPERAND (arg
, 0);
17230 if (TREE_CODE (arg
) == COMPONENT_REF
)
17231 /* Handle `&x' where `x' is some static or non-static member
17233 arg
= TREE_OPERAND (arg
, 1);
17235 if (TREE_CODE (arg
) == OFFSET_REF
)
17236 arg
= TREE_OPERAND (arg
, 1);
17238 /* Strip baselink information. */
17239 if (BASELINK_P (arg
))
17240 arg
= BASELINK_FUNCTIONS (arg
);
17242 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
17244 /* If we got some explicit template args, we need to plug them into
17245 the affected templates before we try to unify, in case the
17246 explicit args will completely resolve the templates in question. */
17249 tree expl_subargs
= TREE_OPERAND (arg
, 1);
17250 arg
= TREE_OPERAND (arg
, 0);
17252 for (; arg
; arg
= OVL_NEXT (arg
))
17254 tree fn
= OVL_CURRENT (arg
);
17255 tree subargs
, elem
;
17257 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17260 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17261 expl_subargs
, NULL_TREE
, tf_none
,
17262 /*require_all_args=*/true,
17263 /*use_default_args=*/true);
17264 if (subargs
!= error_mark_node
17265 && !any_dependent_template_arguments_p (subargs
))
17267 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
17268 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
17269 elem
, strict
, sub_strict
, addr_p
, explain_p
)
17270 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
17279 /* If no templates (or more than one) are fully resolved by the
17280 explicit arguments, this template-id is a non-deduced context; it
17281 could still be OK if we deduce all template arguments for the
17282 enclosing call through other arguments. */
17286 else if (TREE_CODE (arg
) != OVERLOAD
17287 && TREE_CODE (arg
) != FUNCTION_DECL
)
17288 /* If ARG is, for example, "(0, &f)" then its type will be unknown
17289 -- but the deduction does not succeed because the expression is
17290 not just the function on its own. */
17293 for (; arg
; arg
= OVL_NEXT (arg
))
17294 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
17295 TREE_TYPE (OVL_CURRENT (arg
)),
17296 strict
, sub_strict
, addr_p
, explain_p
)
17297 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
17299 goodfn
= OVL_CURRENT (arg
);
17303 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17304 to function or pointer to member function argument if the set of
17305 overloaded functions does not contain function templates and at most
17306 one of a set of overloaded functions provides a unique match.
17308 So if we found multiple possibilities, we return success but don't
17309 deduce anything. */
17313 int i
= TREE_VEC_LENGTH (targs
);
17315 if (TREE_VEC_ELT (tempargs
, i
))
17317 tree old
= TREE_VEC_ELT (targs
, i
);
17318 tree new_
= TREE_VEC_ELT (tempargs
, i
);
17319 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
17320 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
17321 /* Don't forget explicit template arguments in a pack. */
17322 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
17323 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
17324 TREE_VEC_ELT (targs
, i
) = new_
;
17333 /* Core DR 115: In contexts where deduction is done and fails, or in
17334 contexts where deduction is not done, if a template argument list is
17335 specified and it, along with any default template arguments, identifies
17336 a single function template specialization, then the template-id is an
17337 lvalue for the function template specialization. */
17340 resolve_nondeduced_context (tree orig_expr
)
17342 tree expr
, offset
, baselink
;
17345 if (!type_unknown_p (orig_expr
))
17350 offset
= NULL_TREE
;
17351 baselink
= NULL_TREE
;
17353 if (TREE_CODE (expr
) == ADDR_EXPR
)
17355 expr
= TREE_OPERAND (expr
, 0);
17358 if (TREE_CODE (expr
) == OFFSET_REF
)
17361 expr
= TREE_OPERAND (expr
, 1);
17363 if (BASELINK_P (expr
))
17366 expr
= BASELINK_FUNCTIONS (expr
);
17369 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
17372 tree goodfn
= NULL_TREE
;
17374 /* If we got some explicit template args, we need to plug them into
17375 the affected templates before we try to unify, in case the
17376 explicit args will completely resolve the templates in question. */
17378 tree expl_subargs
= TREE_OPERAND (expr
, 1);
17379 tree arg
= TREE_OPERAND (expr
, 0);
17380 tree badfn
= NULL_TREE
;
17381 tree badargs
= NULL_TREE
;
17383 for (; arg
; arg
= OVL_NEXT (arg
))
17385 tree fn
= OVL_CURRENT (arg
);
17386 tree subargs
, elem
;
17388 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
17391 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
17392 expl_subargs
, NULL_TREE
, tf_none
,
17393 /*require_all_args=*/true,
17394 /*use_default_args=*/true);
17395 if (subargs
!= error_mark_node
17396 && !any_dependent_template_arguments_p (subargs
))
17398 elem
= instantiate_template (fn
, subargs
, tf_none
);
17399 if (elem
== error_mark_node
)
17404 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
17413 mark_used (goodfn
);
17416 expr
= build_baselink (BASELINK_BINFO (baselink
),
17417 BASELINK_ACCESS_BINFO (baselink
),
17418 expr
, BASELINK_OPTYPE (baselink
));
17422 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
17423 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
17426 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
17429 else if (good
== 0 && badargs
)
17430 /* There were no good options and at least one bad one, so let the
17431 user know what the problem is. */
17432 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
17437 /* Subroutine of resolve_overloaded_unification; does deduction for a single
17438 overload. Fills TARGS with any deduced arguments, or error_mark_node if
17439 different overloads deduce different arguments for a given parm.
17440 ADDR_P is true if the expression for which deduction is being
17441 performed was of the form "& fn" rather than simply "fn".
17443 Returns 1 on success. */
17446 try_one_overload (tree tparms
,
17451 unification_kind_t strict
,
17460 if (arg
== error_mark_node
)
17463 /* [temp.deduct.type] A template-argument can be deduced from a pointer
17464 to function or pointer to member function argument if the set of
17465 overloaded functions does not contain function templates and at most
17466 one of a set of overloaded functions provides a unique match.
17468 So if this is a template, just return success. */
17470 if (uses_template_parms (arg
))
17473 if (TREE_CODE (arg
) == METHOD_TYPE
)
17474 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
17476 arg
= build_pointer_type (arg
);
17478 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
17480 /* We don't copy orig_targs for this because if we have already deduced
17481 some template args from previous args, unify would complain when we
17482 try to deduce a template parameter for the same argument, even though
17483 there isn't really a conflict. */
17484 nargs
= TREE_VEC_LENGTH (targs
);
17485 tempargs
= make_tree_vec (nargs
);
17487 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
17490 /* First make sure we didn't deduce anything that conflicts with
17491 explicitly specified args. */
17492 for (i
= nargs
; i
--; )
17494 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17495 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
17499 else if (uses_template_parms (elt
))
17500 /* Since we're unifying against ourselves, we will fill in
17501 template args used in the function parm list with our own
17502 template parms. Discard them. */
17503 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
17504 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
17508 for (i
= nargs
; i
--; )
17510 tree elt
= TREE_VEC_ELT (tempargs
, i
);
17513 TREE_VEC_ELT (targs
, i
) = elt
;
17519 /* PARM is a template class (perhaps with unbound template
17520 parameters). ARG is a fully instantiated type. If ARG can be
17521 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
17522 TARGS are as for unify. */
17525 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
17528 tree copy_of_targs
;
17530 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
17531 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
17532 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
17535 /* We need to make a new template argument vector for the call to
17536 unify. If we used TARGS, we'd clutter it up with the result of
17537 the attempted unification, even if this class didn't work out.
17538 We also don't want to commit ourselves to all the unifications
17539 we've already done, since unification is supposed to be done on
17540 an argument-by-argument basis. In other words, consider the
17541 following pathological case:
17543 template <int I, int J, int K>
17546 template <int I, int J>
17547 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
17549 template <int I, int J, int K>
17550 void f(S<I, J, K>, S<I, I, I>);
17559 Now, by the time we consider the unification involving `s2', we
17560 already know that we must have `f<0, 0, 0>'. But, even though
17561 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17562 because there are two ways to unify base classes of S<0, 1, 2>
17563 with S<I, I, I>. If we kept the already deduced knowledge, we
17564 would reject the possibility I=1. */
17565 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
17567 /* If unification failed, we're done. */
17568 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
17569 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
17575 /* Given a template type PARM and a class type ARG, find the unique
17576 base type in ARG that is an instance of PARM. We do not examine
17577 ARG itself; only its base-classes. If there is not exactly one
17578 appropriate base class, return NULL_TREE. PARM may be the type of
17579 a partial specialization, as well as a plain template type. Used
17582 static enum template_base_result
17583 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
17584 bool explain_p
, tree
*result
)
17586 tree rval
= NULL_TREE
;
17589 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
17591 binfo
= TYPE_BINFO (complete_type (arg
));
17594 /* The type could not be completed. */
17595 *result
= NULL_TREE
;
17596 return tbr_incomplete_type
;
17599 /* Walk in inheritance graph order. The search order is not
17600 important, and this avoids multiple walks of virtual bases. */
17601 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
17603 tree r
= try_class_unification (tparms
, targs
, parm
,
17604 BINFO_TYPE (binfo
), explain_p
);
17608 /* If there is more than one satisfactory baseclass, then:
17612 If they yield more than one possible deduced A, the type
17616 if (rval
&& !same_type_p (r
, rval
))
17618 *result
= NULL_TREE
;
17619 return tbr_ambiguous_baseclass
;
17627 return tbr_success
;
17630 /* Returns the level of DECL, which declares a template parameter. */
17633 template_decl_level (tree decl
)
17635 switch (TREE_CODE (decl
))
17638 case TEMPLATE_DECL
:
17639 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
17642 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
17645 gcc_unreachable ();
17650 /* Decide whether ARG can be unified with PARM, considering only the
17651 cv-qualifiers of each type, given STRICT as documented for unify.
17652 Returns nonzero iff the unification is OK on that basis. */
17655 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17657 int arg_quals
= cp_type_quals (arg
);
17658 int parm_quals
= cp_type_quals (parm
);
17660 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17661 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17663 /* Although a CVR qualifier is ignored when being applied to a
17664 substituted template parameter ([8.3.2]/1 for example), that
17665 does not allow us to unify "const T" with "int&" because both
17666 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17667 It is ok when we're allowing additional CV qualifiers
17668 at the outer level [14.8.2.1]/3,1st bullet. */
17669 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17670 || TREE_CODE (arg
) == FUNCTION_TYPE
17671 || TREE_CODE (arg
) == METHOD_TYPE
)
17672 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17675 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17676 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17680 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17681 && (arg_quals
& parm_quals
) != parm_quals
)
17684 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17685 && (parm_quals
& arg_quals
) != arg_quals
)
17691 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17693 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17695 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17696 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17697 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17699 *index
= TEMPLATE_TYPE_IDX (parm
);
17700 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17704 *index
= TEMPLATE_PARM_IDX (parm
);
17705 *level
= TEMPLATE_PARM_LEVEL (parm
);
17709 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17711 if (unify (TP, TA, P, A, S, EP)) \
17715 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17716 expansion at the end of PACKED_PARMS. Returns 0 if the type
17717 deduction succeeds, 1 otherwise. STRICT is the same as in
17718 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17719 call argument list. We'll need to adjust the arguments to make them
17720 types. SUBR tells us if this is from a recursive call to
17721 type_unification_real, or for comparing two template argument
17725 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17726 tree packed_args
, unification_kind_t strict
,
17727 bool subr
, bool explain_p
)
17730 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17731 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17732 tree pack
, packs
= NULL_TREE
;
17733 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17735 packed_args
= expand_template_argument_pack (packed_args
);
17737 int len
= TREE_VEC_LENGTH (packed_args
);
17739 /* Determine the parameter packs we will be deducing from the
17740 pattern, and record their current deductions. */
17741 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17742 pack
; pack
= TREE_CHAIN (pack
))
17744 tree parm_pack
= TREE_VALUE (pack
);
17747 /* Determine the index and level of this parameter pack. */
17748 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17750 /* Keep track of the parameter packs and their corresponding
17752 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17753 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17756 /* Loop through all of the arguments that have not yet been
17757 unified and unify each with the pattern. */
17758 for (i
= start
; i
< len
; i
++)
17761 bool any_explicit
= false;
17762 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17764 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17765 or the element of its argument pack at the current index if
17766 this argument was explicitly specified. */
17767 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17771 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17774 if (TREE_VALUE (pack
)
17775 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17776 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17778 any_explicit
= true;
17779 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17781 TMPL_ARG (targs
, level
, idx
) = arg
;
17784 /* If we had explicit template arguments, substitute them into the
17785 pattern before deduction. */
17788 /* Some arguments might still be unspecified or dependent. */
17790 ++processing_template_decl
;
17791 dependent
= any_dependent_template_arguments_p (targs
);
17793 --processing_template_decl
;
17794 parm
= tsubst (pattern
, targs
,
17795 explain_p
? tf_warning_or_error
: tf_none
,
17798 --processing_template_decl
;
17799 if (parm
== error_mark_node
)
17805 /* Unify the pattern with the current argument. */
17806 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17810 /* For each parameter pack, collect the deduced value. */
17811 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17814 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17816 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17817 TMPL_ARG (targs
, level
, idx
);
17821 /* Verify that the results of unification with the parameter packs
17822 produce results consistent with what we've seen before, and make
17823 the deduced argument packs available. */
17824 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17826 tree old_pack
= TREE_VALUE (pack
);
17827 tree new_args
= TREE_TYPE (pack
);
17828 int i
, len
= TREE_VEC_LENGTH (new_args
);
17830 bool nondeduced_p
= false;
17832 /* By default keep the original deduced argument pack.
17833 If necessary, more specific code is going to update the
17834 resulting deduced argument later down in this function. */
17835 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17836 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17838 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17839 actually deduce anything. */
17840 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17841 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17842 nondeduced_p
= true;
17846 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17848 /* If we had fewer function args than explicit template args,
17849 just use the explicits. */
17850 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17851 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17852 if (len
< explicit_len
)
17853 new_args
= explicit_args
;
17859 /* Build the deduced *_ARGUMENT_PACK. */
17860 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17862 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17863 TREE_TYPE (result
) =
17864 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17865 TREE_CONSTANT (result
) = 1;
17868 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17870 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17872 /* Note the deduced argument packs for this parameter
17874 TMPL_ARG (targs
, level
, idx
) = result
;
17876 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17877 && (ARGUMENT_PACK_ARGS (old_pack
)
17878 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17880 /* We only had the explicitly-provided arguments before, but
17881 now we have a complete set of arguments. */
17882 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17884 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17885 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17886 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17890 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17891 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17893 if (!comp_template_args_with_info (old_args
, new_args
,
17894 &bad_old_arg
, &bad_new_arg
))
17895 /* Inconsistent unification of this parameter pack. */
17896 return unify_parameter_pack_inconsistent (explain_p
,
17902 return unify_success (explain_p
);
17905 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17906 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17907 parameters and return value are as for unify. */
17910 unify_array_domain (tree tparms
, tree targs
,
17911 tree parm_dom
, tree arg_dom
,
17919 /* Our representation of array types uses "N - 1" as the
17920 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17921 not an integer constant. We cannot unify arbitrarily
17922 complex expressions, so we eliminate the MINUS_EXPRs
17924 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17925 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17928 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17929 parm_max
= TREE_OPERAND (parm_max
, 0);
17931 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17932 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17935 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17936 trying to unify the type of a variable with the type
17937 of a template parameter. For example:
17939 template <unsigned int N>
17940 void f (char (&) [N]);
17947 Here, the type of the ARG will be "int [g(i)]", and
17948 may be a SAVE_EXPR, etc. */
17949 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17950 return unify_vla_arg (explain_p
, arg_dom
);
17951 arg_max
= TREE_OPERAND (arg_max
, 0);
17954 /* If only one of the bounds used a MINUS_EXPR, compensate
17955 by adding one to the other bound. */
17956 if (parm_cst
&& !arg_cst
)
17957 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17961 else if (arg_cst
&& !parm_cst
)
17962 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17967 return unify (tparms
, targs
, parm_max
, arg_max
,
17968 UNIFY_ALLOW_INTEGER
, explain_p
);
17971 /* Deduce the value of template parameters. TPARMS is the (innermost)
17972 set of template parameters to a template. TARGS is the bindings
17973 for those template parameters, as determined thus far; TARGS may
17974 include template arguments for outer levels of template parameters
17975 as well. PARM is a parameter to a template function, or a
17976 subcomponent of that parameter; ARG is the corresponding argument.
17977 This function attempts to match PARM with ARG in a manner
17978 consistent with the existing assignments in TARGS. If more values
17979 are deduced, then TARGS is updated.
17981 Returns 0 if the type deduction succeeds, 1 otherwise. The
17982 parameter STRICT is a bitwise or of the following flags:
17985 Require an exact match between PARM and ARG.
17986 UNIFY_ALLOW_MORE_CV_QUAL:
17987 Allow the deduced ARG to be more cv-qualified (by qualification
17988 conversion) than ARG.
17989 UNIFY_ALLOW_LESS_CV_QUAL:
17990 Allow the deduced ARG to be less cv-qualified than ARG.
17991 UNIFY_ALLOW_DERIVED:
17992 Allow the deduced ARG to be a template base class of ARG,
17993 or a pointer to a template base class of the type pointed to by
17995 UNIFY_ALLOW_INTEGER:
17996 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17997 case for more information.
17998 UNIFY_ALLOW_OUTER_LEVEL:
17999 This is the outermost level of a deduction. Used to determine validity
18000 of qualification conversions. A valid qualification conversion must
18001 have const qualified pointers leading up to the inner type which
18002 requires additional CV quals, except at the outer level, where const
18003 is not required [conv.qual]. It would be normal to set this flag in
18004 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
18005 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
18006 This is the outermost level of a deduction, and PARM can be more CV
18007 qualified at this point.
18008 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
18009 This is the outermost level of a deduction, and PARM can be less CV
18010 qualified at this point. */
18013 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
18019 int strict_in
= strict
;
18021 /* I don't think this will do the right thing with respect to types.
18022 But the only case I've seen it in so far has been array bounds, where
18023 signedness is the only information lost, and I think that will be
18025 while (TREE_CODE (parm
) == NOP_EXPR
)
18026 parm
= TREE_OPERAND (parm
, 0);
18028 if (arg
== error_mark_node
)
18029 return unify_invalid (explain_p
);
18030 if (arg
== unknown_type_node
18031 || arg
== init_list_type_node
)
18032 /* We can't deduce anything from this, but we might get all the
18033 template args from other function args. */
18034 return unify_success (explain_p
);
18036 /* If PARM uses template parameters, then we can't bail out here,
18037 even if ARG == PARM, since we won't record unifications for the
18038 template parameters. We might need them if we're trying to
18039 figure out which of two things is more specialized. */
18040 if (arg
== parm
&& !uses_template_parms (parm
))
18041 return unify_success (explain_p
);
18043 /* Handle init lists early, so the rest of the function can assume
18044 we're dealing with a type. */
18045 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
18049 tree orig_parm
= parm
;
18051 /* Replace T with std::initializer_list<T> for deduction. */
18052 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18053 && flag_deduce_init_list
)
18054 parm
= listify (parm
);
18056 if (!is_std_init_list (parm
)
18057 && TREE_CODE (parm
) != ARRAY_TYPE
)
18058 /* We can only deduce from an initializer list argument if the
18059 parameter is std::initializer_list or an array; otherwise this
18060 is a non-deduced context. */
18061 return unify_success (explain_p
);
18063 if (TREE_CODE (parm
) == ARRAY_TYPE
)
18064 elttype
= TREE_TYPE (parm
);
18067 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
18068 /* Deduction is defined in terms of a single type, so just punt
18069 on the (bizarre) std::initializer_list<T...>. */
18070 if (PACK_EXPANSION_P (elttype
))
18071 return unify_success (explain_p
);
18074 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
18076 int elt_strict
= strict
;
18078 if (elt
== error_mark_node
)
18079 return unify_invalid (explain_p
);
18081 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
18083 tree type
= TREE_TYPE (elt
);
18084 if (type
== error_mark_node
)
18085 return unify_invalid (explain_p
);
18086 /* It should only be possible to get here for a call. */
18087 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
18088 elt_strict
|= maybe_adjust_types_for_deduction
18089 (DEDUCE_CALL
, &elttype
, &type
, elt
);
18093 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
18097 if (TREE_CODE (parm
) == ARRAY_TYPE
18098 && deducible_array_bound (TYPE_DOMAIN (parm
)))
18100 /* Also deduce from the length of the initializer list. */
18101 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
18102 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
18103 if (idx
== error_mark_node
)
18104 return unify_invalid (explain_p
);
18105 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18109 /* If the std::initializer_list<T> deduction worked, replace the
18110 deduced A with std::initializer_list<A>. */
18111 if (orig_parm
!= parm
)
18113 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
18114 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18115 targ
= listify (targ
);
18116 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
18118 return unify_success (explain_p
);
18121 /* Immediately reject some pairs that won't unify because of
18122 cv-qualification mismatches. */
18123 if (TREE_CODE (arg
) == TREE_CODE (parm
)
18125 /* It is the elements of the array which hold the cv quals of an array
18126 type, and the elements might be template type parms. We'll check
18127 when we recurse. */
18128 && TREE_CODE (arg
) != ARRAY_TYPE
18129 /* We check the cv-qualifiers when unifying with template type
18130 parameters below. We want to allow ARG `const T' to unify with
18131 PARM `T' for example, when computing which of two templates
18132 is more specialized, for example. */
18133 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
18134 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
18135 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18137 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
18138 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
18139 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
18140 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
18141 strict
&= ~UNIFY_ALLOW_DERIVED
;
18142 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
18143 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
18145 switch (TREE_CODE (parm
))
18147 case TYPENAME_TYPE
:
18149 case UNBOUND_CLASS_TEMPLATE
:
18150 /* In a type which contains a nested-name-specifier, template
18151 argument values cannot be deduced for template parameters used
18152 within the nested-name-specifier. */
18153 return unify_success (explain_p
);
18155 case TEMPLATE_TYPE_PARM
:
18156 case TEMPLATE_TEMPLATE_PARM
:
18157 case BOUND_TEMPLATE_TEMPLATE_PARM
:
18158 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
18159 if (error_operand_p (tparm
))
18160 return unify_invalid (explain_p
);
18162 if (TEMPLATE_TYPE_LEVEL (parm
)
18163 != template_decl_level (tparm
))
18164 /* The PARM is not one we're trying to unify. Just check
18165 to see if it matches ARG. */
18167 if (TREE_CODE (arg
) == TREE_CODE (parm
)
18168 && (is_auto (parm
) ? is_auto (arg
)
18169 : same_type_p (parm
, arg
)))
18170 return unify_success (explain_p
);
18172 return unify_type_mismatch (explain_p
, parm
, arg
);
18174 idx
= TEMPLATE_TYPE_IDX (parm
);
18175 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18176 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
18177 if (error_operand_p (tparm
))
18178 return unify_invalid (explain_p
);
18180 /* Check for mixed types and values. */
18181 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
18182 && TREE_CODE (tparm
) != TYPE_DECL
)
18183 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18184 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
18185 gcc_unreachable ();
18187 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18189 /* ARG must be constructed from a template class or a template
18190 template parameter. */
18191 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
18192 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
18193 return unify_template_deduction_failure (explain_p
, parm
, arg
);
18195 tree parmvec
= TYPE_TI_ARGS (parm
);
18196 /* An alias template name is never deduced. */
18197 if (TYPE_ALIAS_P (arg
))
18198 arg
= strip_typedefs (arg
);
18199 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
18200 tree full_argvec
= add_to_template_args (targs
, argvec
);
18202 = DECL_INNERMOST_TEMPLATE_PARMS
18203 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
18205 int parm_variadic_p
= 0;
18207 /* The resolution to DR150 makes clear that default
18208 arguments for an N-argument may not be used to bind T
18209 to a template template parameter with fewer than N
18210 parameters. It is not safe to permit the binding of
18211 default arguments as an extension, as that may change
18212 the meaning of a conforming program. Consider:
18214 struct Dense { static const unsigned int dim = 1; };
18216 template <template <typename> class View,
18218 void operator+(float, View<Block> const&);
18220 template <typename Block,
18221 unsigned int Dim = Block::dim>
18222 struct Lvalue_proxy { operator float() const; };
18226 Lvalue_proxy<Dense> p;
18231 Here, if Lvalue_proxy is permitted to bind to View, then
18232 the global operator+ will be used; if they are not, the
18233 Lvalue_proxy will be converted to float. */
18234 if (coerce_template_parms (parm_parms
,
18236 TYPE_TI_TEMPLATE (parm
),
18238 ? tf_warning_or_error
18240 /*require_all_args=*/true,
18241 /*use_default_args=*/false)
18242 == error_mark_node
)
18245 /* Deduce arguments T, i from TT<T> or TT<i>.
18246 We check each element of PARMVEC and ARGVEC individually
18247 rather than the whole TREE_VEC since they can have
18248 different number of elements. */
18250 parmvec
= expand_template_argument_pack (parmvec
);
18251 argvec
= expand_template_argument_pack (argvec
);
18253 len
= TREE_VEC_LENGTH (parmvec
);
18255 /* Check if the parameters end in a pack, making them
18258 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
18259 parm_variadic_p
= 1;
18261 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18262 /* If the template argument list of P contains a pack
18263 expansion that is not the last template argument, the
18264 entire template argument list is a non-deduced
18266 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
18267 return unify_success (explain_p
);
18269 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
18270 return unify_too_few_arguments (explain_p
,
18271 TREE_VEC_LENGTH (argvec
), len
);
18273 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18275 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18276 TREE_VEC_ELT (parmvec
, i
),
18277 TREE_VEC_ELT (argvec
, i
),
18278 UNIFY_ALLOW_NONE
, explain_p
);
18281 if (parm_variadic_p
18282 && unify_pack_expansion (tparms
, targs
,
18285 /*subr=*/true, explain_p
))
18288 arg
= TYPE_TI_TEMPLATE (arg
);
18290 /* Fall through to deduce template name. */
18293 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
18294 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
18296 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
18298 /* Simple cases: Value already set, does match or doesn't. */
18299 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
18300 return unify_success (explain_p
);
18302 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
18306 /* If PARM is `const T' and ARG is only `int', we don't have
18307 a match unless we are allowing additional qualification.
18308 If ARG is `const int' and PARM is just `T' that's OK;
18309 that binds `const int' to `T'. */
18310 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
18312 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18314 /* Consider the case where ARG is `const volatile int' and
18315 PARM is `const T'. Then, T should be `volatile int'. */
18316 arg
= cp_build_qualified_type_real
18317 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
18318 if (arg
== error_mark_node
)
18319 return unify_invalid (explain_p
);
18321 /* Simple cases: Value already set, does match or doesn't. */
18322 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
18323 return unify_success (explain_p
);
18325 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
18327 /* Make sure that ARG is not a variable-sized array. (Note
18328 that were talking about variable-sized arrays (like
18329 `int[n]'), rather than arrays of unknown size (like
18330 `int[]').) We'll get very confused by such a type since
18331 the bound of the array is not constant, and therefore
18332 not mangleable. Besides, such types are not allowed in
18333 ISO C++, so we can do as we please here. We do allow
18334 them for 'auto' deduction, since that isn't ABI-exposed. */
18335 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
18336 return unify_vla_arg (explain_p
, arg
);
18338 /* Strip typedefs as in convert_template_argument. */
18339 arg
= canonicalize_type_argument (arg
, tf_none
);
18342 /* If ARG is a parameter pack or an expansion, we cannot unify
18343 against it unless PARM is also a parameter pack. */
18344 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18345 && !template_parameter_pack_p (parm
))
18346 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18348 /* If the argument deduction results is a METHOD_TYPE,
18349 then there is a problem.
18350 METHOD_TYPE doesn't map to any real C++ type the result of
18351 the deduction can not be of that type. */
18352 if (TREE_CODE (arg
) == METHOD_TYPE
)
18353 return unify_method_type_error (explain_p
, arg
);
18355 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18356 return unify_success (explain_p
);
18358 case TEMPLATE_PARM_INDEX
:
18359 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
18360 if (error_operand_p (tparm
))
18361 return unify_invalid (explain_p
);
18363 if (TEMPLATE_PARM_LEVEL (parm
)
18364 != template_decl_level (tparm
))
18366 /* The PARM is not one we're trying to unify. Just check
18367 to see if it matches ARG. */
18368 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
18369 && cp_tree_equal (parm
, arg
));
18371 unify_expression_unequal (explain_p
, parm
, arg
);
18375 idx
= TEMPLATE_PARM_IDX (parm
);
18376 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
18380 int x
= !cp_tree_equal (targ
, arg
);
18382 unify_inconsistency (explain_p
, parm
, targ
, arg
);
18386 /* [temp.deduct.type] If, in the declaration of a function template
18387 with a non-type template-parameter, the non-type
18388 template-parameter is used in an expression in the function
18389 parameter-list and, if the corresponding template-argument is
18390 deduced, the template-argument type shall match the type of the
18391 template-parameter exactly, except that a template-argument
18392 deduced from an array bound may be of any integral type.
18393 The non-type parameter might use already deduced type parameters. */
18394 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
18395 if (!TREE_TYPE (arg
))
18396 /* Template-parameter dependent expression. Just accept it for now.
18397 It will later be processed in convert_template_argument. */
18399 else if (same_type_p (TREE_TYPE (arg
), tparm
))
18401 else if ((strict
& UNIFY_ALLOW_INTEGER
)
18402 && CP_INTEGRAL_TYPE_P (tparm
))
18403 /* Convert the ARG to the type of PARM; the deduced non-type
18404 template argument must exactly match the types of the
18405 corresponding parameter. */
18406 arg
= fold (build_nop (tparm
, arg
));
18407 else if (uses_template_parms (tparm
))
18408 /* We haven't deduced the type of this parameter yet. Try again
18410 return unify_success (explain_p
);
18412 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
18414 /* If ARG is a parameter pack or an expansion, we cannot unify
18415 against it unless PARM is also a parameter pack. */
18416 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
18417 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
18418 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
18421 bool removed_attr
= false;
18422 arg
= strip_typedefs_expr (arg
, &removed_attr
);
18424 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
18425 return unify_success (explain_p
);
18429 /* A pointer-to-member constant can be unified only with
18430 another constant. */
18431 if (TREE_CODE (arg
) != PTRMEM_CST
)
18432 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
18434 /* Just unify the class member. It would be useless (and possibly
18435 wrong, depending on the strict flags) to unify also
18436 PTRMEM_CST_CLASS, because we want to be sure that both parm and
18437 arg refer to the same variable, even if through different
18438 classes. For instance:
18440 struct A { int x; };
18443 Unification of &A::x and &B::x must succeed. */
18444 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
18445 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
18450 if (!TYPE_PTR_P (arg
))
18451 return unify_type_mismatch (explain_p
, parm
, arg
);
18453 /* [temp.deduct.call]
18455 A can be another pointer or pointer to member type that can
18456 be converted to the deduced A via a qualification
18457 conversion (_conv.qual_).
18459 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
18460 This will allow for additional cv-qualification of the
18461 pointed-to types if appropriate. */
18463 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
18464 /* The derived-to-base conversion only persists through one
18465 level of pointers. */
18466 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
18468 return unify (tparms
, targs
, TREE_TYPE (parm
),
18469 TREE_TYPE (arg
), strict
, explain_p
);
18472 case REFERENCE_TYPE
:
18473 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
18474 return unify_type_mismatch (explain_p
, parm
, arg
);
18475 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18476 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18479 if (TREE_CODE (arg
) != ARRAY_TYPE
)
18480 return unify_type_mismatch (explain_p
, parm
, arg
);
18481 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
18482 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
18483 return unify_type_mismatch (explain_p
, parm
, arg
);
18484 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18485 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
18486 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
18487 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
18488 TYPE_DOMAIN (arg
), explain_p
);
18489 return unify_success (explain_p
);
18496 case ENUMERAL_TYPE
:
18499 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18500 return unify_type_mismatch (explain_p
, parm
, arg
);
18502 /* We have already checked cv-qualification at the top of the
18504 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
18505 return unify_type_mismatch (explain_p
, parm
, arg
);
18507 /* As far as unification is concerned, this wins. Later checks
18508 will invalidate it if necessary. */
18509 return unify_success (explain_p
);
18511 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
18512 /* Type INTEGER_CST can come from ordinary constant template args. */
18514 while (TREE_CODE (arg
) == NOP_EXPR
)
18515 arg
= TREE_OPERAND (arg
, 0);
18517 if (TREE_CODE (arg
) != INTEGER_CST
)
18518 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18519 return (tree_int_cst_equal (parm
, arg
)
18520 ? unify_success (explain_p
)
18521 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
18525 int i
, len
, argslen
;
18526 int parm_variadic_p
= 0;
18528 if (TREE_CODE (arg
) != TREE_VEC
)
18529 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18531 len
= TREE_VEC_LENGTH (parm
);
18532 argslen
= TREE_VEC_LENGTH (arg
);
18534 /* Check for pack expansions in the parameters. */
18535 for (i
= 0; i
< len
; ++i
)
18537 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
18540 /* We can unify against something with a trailing
18542 parm_variadic_p
= 1;
18544 /* [temp.deduct.type]/9: If the template argument list of
18545 P contains a pack expansion that is not the last
18546 template argument, the entire template argument list
18547 is a non-deduced context. */
18548 return unify_success (explain_p
);
18552 /* If we don't have enough arguments to satisfy the parameters
18553 (not counting the pack expression at the end), or we have
18554 too many arguments for a parameter list that doesn't end in
18555 a pack expression, we can't unify. */
18556 if (parm_variadic_p
18557 ? argslen
< len
- parm_variadic_p
18559 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
18561 /* Unify all of the parameters that precede the (optional)
18562 pack expression. */
18563 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
18565 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
18566 TREE_VEC_ELT (parm
, i
),
18567 TREE_VEC_ELT (arg
, i
),
18568 UNIFY_ALLOW_NONE
, explain_p
);
18570 if (parm_variadic_p
)
18571 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
18573 /*subr=*/true, explain_p
);
18574 return unify_success (explain_p
);
18579 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18580 return unify_type_mismatch (explain_p
, parm
, arg
);
18582 if (TYPE_PTRMEMFUNC_P (parm
))
18584 if (!TYPE_PTRMEMFUNC_P (arg
))
18585 return unify_type_mismatch (explain_p
, parm
, arg
);
18587 return unify (tparms
, targs
,
18588 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
18589 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
18590 strict
, explain_p
);
18592 else if (TYPE_PTRMEMFUNC_P (arg
))
18593 return unify_type_mismatch (explain_p
, parm
, arg
);
18595 if (CLASSTYPE_TEMPLATE_INFO (parm
))
18597 tree t
= NULL_TREE
;
18599 if (strict_in
& UNIFY_ALLOW_DERIVED
)
18601 /* First, we try to unify the PARM and ARG directly. */
18602 t
= try_class_unification (tparms
, targs
,
18603 parm
, arg
, explain_p
);
18607 /* Fallback to the special case allowed in
18608 [temp.deduct.call]:
18610 If P is a class, and P has the form
18611 template-id, then A can be a derived class of
18612 the deduced A. Likewise, if P is a pointer to
18613 a class of the form template-id, A can be a
18614 pointer to a derived class pointed to by the
18616 enum template_base_result r
;
18617 r
= get_template_base (tparms
, targs
, parm
, arg
,
18621 return unify_no_common_base (explain_p
, r
, parm
, arg
);
18624 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
18625 && (CLASSTYPE_TI_TEMPLATE (parm
)
18626 == CLASSTYPE_TI_TEMPLATE (arg
)))
18627 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18628 Then, we should unify `int' and `U'. */
18631 /* There's no chance of unification succeeding. */
18632 return unify_type_mismatch (explain_p
, parm
, arg
);
18634 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
18635 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
18637 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
18638 return unify_type_mismatch (explain_p
, parm
, arg
);
18639 return unify_success (explain_p
);
18642 case FUNCTION_TYPE
:
18644 unsigned int nargs
;
18649 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18650 return unify_type_mismatch (explain_p
, parm
, arg
);
18652 /* CV qualifications for methods can never be deduced, they must
18653 match exactly. We need to check them explicitly here,
18654 because type_unification_real treats them as any other
18655 cv-qualified parameter. */
18656 if (TREE_CODE (parm
) == METHOD_TYPE
18657 && (!check_cv_quals_for_unify
18659 class_of_this_parm (arg
),
18660 class_of_this_parm (parm
))))
18661 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18663 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18664 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18666 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18667 args
= XALLOCAVEC (tree
, nargs
);
18668 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18669 a
!= NULL_TREE
&& a
!= void_list_node
;
18670 a
= TREE_CHAIN (a
), ++i
)
18671 args
[i
] = TREE_VALUE (a
);
18674 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18675 args
, nargs
, 1, DEDUCE_EXACT
,
18676 LOOKUP_NORMAL
, NULL
, explain_p
);
18680 /* Unify a pointer to member with a pointer to member function, which
18681 deduces the type of the member as a function type. */
18682 if (TYPE_PTRMEMFUNC_P (arg
))
18684 /* Check top-level cv qualifiers */
18685 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18686 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18688 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18689 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18690 UNIFY_ALLOW_NONE
, explain_p
);
18692 /* Determine the type of the function we are unifying against. */
18693 tree fntype
= static_fn_type (arg
);
18695 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18698 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18699 return unify_type_mismatch (explain_p
, parm
, arg
);
18700 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18701 TYPE_OFFSET_BASETYPE (arg
),
18702 UNIFY_ALLOW_NONE
, explain_p
);
18703 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18704 strict
, explain_p
);
18707 if (DECL_TEMPLATE_PARM_P (parm
))
18708 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18709 if (arg
!= scalar_constant_value (parm
))
18710 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18711 return unify_success (explain_p
);
18714 case TEMPLATE_DECL
:
18715 /* Matched cases are handled by the ARG == PARM test above. */
18716 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18719 /* A non-type template parameter that is a variable should be a
18720 an integral constant, in which case, it whould have been
18721 folded into its (constant) value. So we should not be getting
18722 a variable here. */
18723 gcc_unreachable ();
18725 case TYPE_ARGUMENT_PACK
:
18726 case NONTYPE_ARGUMENT_PACK
:
18727 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18728 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18731 case DECLTYPE_TYPE
:
18732 case UNDERLYING_TYPE
:
18733 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18734 or UNDERLYING_TYPE nodes. */
18735 return unify_success (explain_p
);
18738 /* Unification fails if we hit an error node. */
18739 return unify_invalid (explain_p
);
18742 if (REFERENCE_REF_P (parm
))
18744 if (REFERENCE_REF_P (arg
))
18745 arg
= TREE_OPERAND (arg
, 0);
18746 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18747 strict
, explain_p
);
18752 /* An unresolved overload is a nondeduced context. */
18753 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18754 return unify_success (explain_p
);
18755 gcc_assert (EXPR_P (parm
));
18757 /* We must be looking at an expression. This can happen with
18761 void foo(S<I>, S<I + 2>);
18763 This is a "nondeduced context":
18767 The nondeduced contexts are:
18769 --A type that is a template-id in which one or more of
18770 the template-arguments is an expression that references
18771 a template-parameter.
18773 In these cases, we assume deduction succeeded, but don't
18774 actually infer any unifications. */
18776 if (!uses_template_parms (parm
)
18777 && !template_args_equal (parm
, arg
))
18778 return unify_expression_unequal (explain_p
, parm
, arg
);
18780 return unify_success (explain_p
);
18783 #undef RECUR_AND_CHECK_FAILURE
18785 /* Note that DECL can be defined in this translation unit, if
18789 mark_definable (tree decl
)
18792 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18793 FOR_EACH_CLONE (clone
, decl
)
18794 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18797 /* Called if RESULT is explicitly instantiated, or is a member of an
18798 explicitly instantiated class. */
18801 mark_decl_instantiated (tree result
, int extern_p
)
18803 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18805 /* If this entity has already been written out, it's too late to
18806 make any modifications. */
18807 if (TREE_ASM_WRITTEN (result
))
18810 /* For anonymous namespace we don't need to do anything. */
18811 if (decl_anon_ns_mem_p (result
))
18813 gcc_assert (!TREE_PUBLIC (result
));
18817 if (TREE_CODE (result
) != FUNCTION_DECL
)
18818 /* The TREE_PUBLIC flag for function declarations will have been
18819 set correctly by tsubst. */
18820 TREE_PUBLIC (result
) = 1;
18822 /* This might have been set by an earlier implicit instantiation. */
18823 DECL_COMDAT (result
) = 0;
18826 DECL_NOT_REALLY_EXTERN (result
) = 0;
18829 mark_definable (result
);
18830 mark_needed (result
);
18831 /* Always make artificials weak. */
18832 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18833 comdat_linkage (result
);
18834 /* For WIN32 we also want to put explicit instantiations in
18835 linkonce sections. */
18836 else if (TREE_PUBLIC (result
))
18837 maybe_make_one_only (result
);
18840 /* If EXTERN_P, then this function will not be emitted -- unless
18841 followed by an explicit instantiation, at which point its linkage
18842 will be adjusted. If !EXTERN_P, then this function will be
18843 emitted here. In neither circumstance do we want
18844 import_export_decl to adjust the linkage. */
18845 DECL_INTERFACE_KNOWN (result
) = 1;
18848 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18849 important template arguments. If any are missing, we check whether
18850 they're important by using error_mark_node for substituting into any
18851 args that were used for partial ordering (the ones between ARGS and END)
18852 and seeing if it bubbles up. */
18855 check_undeduced_parms (tree targs
, tree args
, tree end
)
18857 bool found
= false;
18859 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18860 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18863 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18867 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18868 if (substed
== error_mark_node
)
18874 /* Given two function templates PAT1 and PAT2, return:
18876 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18877 -1 if PAT2 is more specialized than PAT1.
18878 0 if neither is more specialized.
18880 LEN indicates the number of parameters we should consider
18881 (defaulted parameters should not be considered).
18883 The 1998 std underspecified function template partial ordering, and
18884 DR214 addresses the issue. We take pairs of arguments, one from
18885 each of the templates, and deduce them against each other. One of
18886 the templates will be more specialized if all the *other*
18887 template's arguments deduce against its arguments and at least one
18888 of its arguments *does* *not* deduce against the other template's
18889 corresponding argument. Deduction is done as for class templates.
18890 The arguments used in deduction have reference and top level cv
18891 qualifiers removed. Iff both arguments were originally reference
18892 types *and* deduction succeeds in both directions, an lvalue reference
18893 wins against an rvalue reference and otherwise the template
18894 with the more cv-qualified argument wins for that pairing (if
18895 neither is more cv-qualified, they both are equal). Unlike regular
18896 deduction, after all the arguments have been deduced in this way,
18897 we do *not* verify the deduced template argument values can be
18898 substituted into non-deduced contexts.
18900 The logic can be a bit confusing here, because we look at deduce1 and
18901 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18902 can find template arguments for pat1 to make arg1 look like arg2, that
18903 means that arg2 is at least as specialized as arg1. */
18906 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18908 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18909 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18910 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18911 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18912 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18913 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18914 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18915 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18916 tree origs1
, origs2
;
18917 bool lose1
= false;
18918 bool lose2
= false;
18920 /* Remove the this parameter from non-static member functions. If
18921 one is a non-static member function and the other is not a static
18922 member function, remove the first parameter from that function
18923 also. This situation occurs for operator functions where we
18924 locate both a member function (with this pointer) and non-member
18925 operator (with explicit first operand). */
18926 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18928 len
--; /* LEN is the number of significant arguments for DECL1 */
18929 args1
= TREE_CHAIN (args1
);
18930 if (!DECL_STATIC_FUNCTION_P (decl2
))
18931 args2
= TREE_CHAIN (args2
);
18933 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18935 args2
= TREE_CHAIN (args2
);
18936 if (!DECL_STATIC_FUNCTION_P (decl1
))
18939 args1
= TREE_CHAIN (args1
);
18943 /* If only one is a conversion operator, they are unordered. */
18944 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18947 /* Consider the return type for a conversion function */
18948 if (DECL_CONV_FN_P (decl1
))
18950 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18951 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18955 processing_template_decl
++;
18961 /* Stop when an ellipsis is seen. */
18962 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18964 tree arg1
= TREE_VALUE (args1
);
18965 tree arg2
= TREE_VALUE (args2
);
18966 int deduce1
, deduce2
;
18972 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18973 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18975 /* When both arguments are pack expansions, we need only
18976 unify the patterns themselves. */
18977 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18978 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18980 /* This is the last comparison we need to do. */
18984 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18986 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18987 arg1
= TREE_TYPE (arg1
);
18988 quals1
= cp_type_quals (arg1
);
18991 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18993 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18994 arg2
= TREE_TYPE (arg2
);
18995 quals2
= cp_type_quals (arg2
);
18998 arg1
= TYPE_MAIN_VARIANT (arg1
);
18999 arg2
= TYPE_MAIN_VARIANT (arg2
);
19001 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
19003 int i
, len2
= list_length (args2
);
19004 tree parmvec
= make_tree_vec (1);
19005 tree argvec
= make_tree_vec (len2
);
19008 /* Setup the parameter vector, which contains only ARG1. */
19009 TREE_VEC_ELT (parmvec
, 0) = arg1
;
19011 /* Setup the argument vector, which contains the remaining
19013 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
19014 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
19016 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
19017 argvec
, DEDUCE_EXACT
,
19018 /*subr=*/true, /*explain_p=*/false)
19021 /* We cannot deduce in the other direction, because ARG1 is
19022 a pack expansion but ARG2 is not. */
19025 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19027 int i
, len1
= list_length (args1
);
19028 tree parmvec
= make_tree_vec (1);
19029 tree argvec
= make_tree_vec (len1
);
19032 /* Setup the parameter vector, which contains only ARG1. */
19033 TREE_VEC_ELT (parmvec
, 0) = arg2
;
19035 /* Setup the argument vector, which contains the remaining
19037 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
19038 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
19040 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
19041 argvec
, DEDUCE_EXACT
,
19042 /*subr=*/true, /*explain_p=*/false)
19045 /* We cannot deduce in the other direction, because ARG2 is
19046 a pack expansion but ARG1 is not.*/
19052 /* The normal case, where neither argument is a pack
19054 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
19055 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
19057 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
19058 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
19062 /* If we couldn't deduce arguments for tparms1 to make arg1 match
19063 arg2, then arg2 is not as specialized as arg1. */
19069 /* "If, for a given type, deduction succeeds in both directions
19070 (i.e., the types are identical after the transformations above)
19071 and both P and A were reference types (before being replaced with
19072 the type referred to above):
19073 - if the type from the argument template was an lvalue reference and
19074 the type from the parameter template was not, the argument type is
19075 considered to be more specialized than the other; otherwise,
19076 - if the type from the argument template is more cv-qualified
19077 than the type from the parameter template (as described above),
19078 the argument type is considered to be more specialized than the other;
19080 - neither type is more specialized than the other." */
19082 if (deduce1
&& deduce2
)
19084 if (ref1
&& ref2
&& ref1
!= ref2
)
19091 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
19093 if ((quals1
& quals2
) == quals2
)
19095 if ((quals1
& quals2
) == quals1
)
19100 if (lose1
&& lose2
)
19101 /* We've failed to deduce something in either direction.
19102 These must be unordered. */
19105 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
19106 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
19107 /* We have already processed all of the arguments in our
19108 handing of the pack expansion type. */
19111 args1
= TREE_CHAIN (args1
);
19112 args2
= TREE_CHAIN (args2
);
19115 /* "In most cases, all template parameters must have values in order for
19116 deduction to succeed, but for partial ordering purposes a template
19117 parameter may remain without a value provided it is not used in the
19118 types being used for partial ordering."
19120 Thus, if we are missing any of the targs1 we need to substitute into
19121 origs1, then pat2 is not as specialized as pat1. This can happen when
19122 there is a nondeduced context. */
19123 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
19125 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
19128 processing_template_decl
--;
19130 /* All things being equal, if the next argument is a pack expansion
19131 for one function but not for the other, prefer the
19132 non-variadic function. FIXME this is bogus; see c++/41958. */
19134 && args1
&& TREE_VALUE (args1
)
19135 && args2
&& TREE_VALUE (args2
))
19137 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
19138 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
19141 if (lose1
== lose2
)
19149 /* Determine which of two partial specializations of TMPL is more
19152 PAT1 is a TREE_LIST whose TREE_VALUE is the TEMPLATE_DECL corresponding
19153 to the first partial specialization. The TREE_PURPOSE is the
19154 innermost set of template parameters for the partial
19155 specialization. PAT2 is similar, but for the second template.
19157 Return 1 if the first partial specialization is more specialized;
19158 -1 if the second is more specialized; 0 if neither is more
19161 See [temp.class.order] for information about determining which of
19162 two templates is more specialized. */
19165 more_specialized_partial_spec (tree tmpl
, tree pat1
, tree pat2
)
19169 bool any_deductions
= false;
19171 tree tmpl1
= TREE_VALUE (pat1
);
19172 tree tmpl2
= TREE_VALUE (pat2
);
19173 tree parms1
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl1
);
19174 tree parms2
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl2
);
19175 tree specargs1
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl1
)));
19176 tree specargs2
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl2
)));
19178 /* Just like what happens for functions, if we are ordering between
19179 different template specializations, we may encounter dependent
19180 types in the arguments, and we need our dependency check functions
19181 to behave correctly. */
19182 ++processing_template_decl
;
19183 targs
= get_partial_spec_bindings (tmpl
, parms1
, specargs1
, specargs2
);
19187 any_deductions
= true;
19190 targs
= get_partial_spec_bindings (tmpl
, parms2
, specargs2
, specargs1
);
19194 any_deductions
= true;
19196 --processing_template_decl
;
19198 /* In the case of a tie where at least one of the templates
19199 has a parameter pack at the end, the template with the most
19200 non-packed parameters wins. */
19203 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
19204 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
19206 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
19207 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
19208 int len1
= TREE_VEC_LENGTH (args1
);
19209 int len2
= TREE_VEC_LENGTH (args2
);
19211 /* We don't count the pack expansion at the end. */
19212 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
19214 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
19219 else if (len1
< len2
)
19226 /* Return the template arguments that will produce the function signature
19227 DECL from the function template FN, with the explicit template
19228 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
19229 also match. Return NULL_TREE if no satisfactory arguments could be
19233 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
19235 int ntparms
= DECL_NTPARMS (fn
);
19236 tree targs
= make_tree_vec (ntparms
);
19237 tree decl_type
= TREE_TYPE (decl
);
19238 tree decl_arg_types
;
19240 unsigned int nargs
, ix
;
19243 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
19245 /* Never do unification on the 'this' parameter. */
19246 decl_arg_types
= skip_artificial_parms_for (decl
,
19247 TYPE_ARG_TYPES (decl_type
));
19249 nargs
= list_length (decl_arg_types
);
19250 args
= XALLOCAVEC (tree
, nargs
);
19251 for (arg
= decl_arg_types
, ix
= 0;
19252 arg
!= NULL_TREE
&& arg
!= void_list_node
;
19253 arg
= TREE_CHAIN (arg
), ++ix
)
19254 args
[ix
] = TREE_VALUE (arg
);
19256 if (fn_type_unification (fn
, explicit_args
, targs
,
19258 (check_rettype
|| DECL_CONV_FN_P (fn
)
19259 ? TREE_TYPE (decl_type
) : NULL_TREE
),
19260 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
19262 == error_mark_node
)
19268 /* Return the innermost template arguments that, when applied to a partial
19269 specialization of TMPL whose innermost template parameters are
19270 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
19273 For example, suppose we have:
19275 template <class T, class U> struct S {};
19276 template <class T> struct S<T*, int> {};
19278 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
19279 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
19280 int}. The resulting vector will be {double}, indicating that `T'
19281 is bound to `double'. */
19284 get_partial_spec_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
19286 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
19288 tree innermost_deduced_args
;
19290 innermost_deduced_args
= make_tree_vec (ntparms
);
19291 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19293 deduced_args
= copy_node (args
);
19294 SET_TMPL_ARGS_LEVEL (deduced_args
,
19295 TMPL_ARGS_DEPTH (deduced_args
),
19296 innermost_deduced_args
);
19299 deduced_args
= innermost_deduced_args
;
19301 if (unify (tparms
, deduced_args
,
19302 INNERMOST_TEMPLATE_ARGS (spec_args
),
19303 INNERMOST_TEMPLATE_ARGS (args
),
19304 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
19307 for (i
= 0; i
< ntparms
; ++i
)
19308 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
19311 /* Verify that nondeduced template arguments agree with the type
19312 obtained from argument deduction.
19316 struct A { typedef int X; };
19317 template <class T, class U> struct C {};
19318 template <class T> struct C<T, typename T::X> {};
19320 Then with the instantiation `C<A, int>', we can deduce that
19321 `T' is `A' but unify () does not check whether `typename T::X'
19323 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
19324 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19326 tf_none
, false, false);
19327 if (spec_args
== error_mark_node
19328 /* We only need to check the innermost arguments; the other
19329 arguments will always agree. */
19330 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
19331 INNERMOST_TEMPLATE_ARGS (args
)))
19334 /* Now that we have bindings for all of the template arguments,
19335 ensure that the arguments deduced for the template template
19336 parameters have compatible template parameter lists. See the use
19337 of template_template_parm_bindings_ok_p in fn_type_unification
19338 for more information. */
19339 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
19342 return deduced_args
;
19345 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
19346 Return the TREE_LIST node with the most specialized template, if
19347 any. If there is no most specialized template, the error_mark_node
19350 Note that this function does not look at, or modify, the
19351 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
19352 returned is one of the elements of INSTANTIATIONS, callers may
19353 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
19354 and retrieve it from the value returned. */
19357 most_specialized_instantiation (tree templates
)
19361 ++processing_template_decl
;
19364 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
19368 if (get_bindings (TREE_VALUE (champ
),
19369 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
19370 NULL_TREE
, /*check_ret=*/true))
19373 if (get_bindings (TREE_VALUE (fn
),
19374 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19375 NULL_TREE
, /*check_ret=*/true))
19382 /* Equally specialized, move to next function. If there
19383 is no next function, nothing's most specialized. */
19384 fn
= TREE_CHAIN (fn
);
19392 /* Now verify that champ is better than everything earlier in the
19393 instantiation list. */
19394 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
19395 if (get_bindings (TREE_VALUE (champ
),
19396 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
19397 NULL_TREE
, /*check_ret=*/true)
19398 || !get_bindings (TREE_VALUE (fn
),
19399 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
19400 NULL_TREE
, /*check_ret=*/true))
19406 processing_template_decl
--;
19409 return error_mark_node
;
19414 /* If DECL is a specialization of some template, return the most
19415 general such template. Otherwise, returns NULL_TREE.
19417 For example, given:
19419 template <class T> struct S { template <class U> void f(U); };
19421 if TMPL is `template <class U> void S<int>::f(U)' this will return
19422 the full template. This function will not trace past partial
19423 specializations, however. For example, given in addition:
19425 template <class T> struct S<T*> { template <class U> void f(U); };
19427 if TMPL is `template <class U> void S<int*>::f(U)' this will return
19428 `template <class T> template <class U> S<T*>::f(U)'. */
19431 most_general_template (tree decl
)
19433 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19435 if (tree tinfo
= get_template_info (decl
))
19436 decl
= TI_TEMPLATE (tinfo
);
19437 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
19438 template friend, or a FIELD_DECL for a capture pack. */
19439 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
19443 /* Look for more and more general templates. */
19444 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
19446 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
19447 (See cp-tree.h for details.) */
19448 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
19451 if (CLASS_TYPE_P (TREE_TYPE (decl
))
19452 && !TYPE_DECL_ALIAS_P (TYPE_NAME (TREE_TYPE (decl
)))
19453 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
19456 /* Stop if we run into an explicitly specialized class template. */
19457 if (!DECL_NAMESPACE_SCOPE_P (decl
)
19458 && DECL_CONTEXT (decl
)
19459 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
19462 decl
= DECL_TI_TEMPLATE (decl
);
19468 /* Return the most specialized of the template partial specializations
19469 which can produce TARGET, a specialization of some class or variable
19470 template. The value returned is actually a TREE_LIST; the TREE_VALUE is
19471 a TEMPLATE_DECL node corresponding to the partial specialization, while
19472 the TREE_PURPOSE is the set of template arguments that must be
19473 substituted into the template pattern in order to generate TARGET.
19475 If the choice of partial specialization is ambiguous, a diagnostic
19476 is issued, and the error_mark_node is returned. If there are no
19477 partial specializations matching TARGET, then NULL_TREE is
19478 returned, indicating that the primary template should be used. */
19481 most_specialized_partial_spec (tree target
, tsubst_flags_t complain
)
19483 tree list
= NULL_TREE
;
19488 tree outer_args
= NULL_TREE
;
19491 if (TYPE_P (target
))
19493 tree tinfo
= CLASSTYPE_TEMPLATE_INFO (target
);
19494 tmpl
= TI_TEMPLATE (tinfo
);
19495 args
= TI_ARGS (tinfo
);
19497 else if (TREE_CODE (target
) == TEMPLATE_ID_EXPR
)
19499 tmpl
= TREE_OPERAND (target
, 0);
19500 args
= TREE_OPERAND (target
, 1);
19502 else if (VAR_P (target
))
19504 tree tinfo
= DECL_TEMPLATE_INFO (target
);
19505 tmpl
= TI_TEMPLATE (tinfo
);
19506 args
= TI_ARGS (tinfo
);
19509 gcc_unreachable ();
19511 tree main_tmpl
= most_general_template (tmpl
);
19513 /* For determining which partial specialization to use, only the
19514 innermost args are interesting. */
19515 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
19517 outer_args
= strip_innermost_template_args (args
, 1);
19518 args
= INNERMOST_TEMPLATE_ARGS (args
);
19521 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
19523 tree partial_spec_args
;
19525 tree spec_tmpl
= TREE_VALUE (t
);
19527 partial_spec_args
= TREE_PURPOSE (t
);
19529 ++processing_template_decl
;
19533 /* Discard the outer levels of args, and then substitute in the
19534 template args from the enclosing class. */
19535 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
19536 partial_spec_args
= tsubst_template_args
19537 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
19539 /* And the same for the partial specialization TEMPLATE_DECL. */
19540 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
19543 partial_spec_args
=
19544 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
19547 /*require_all_args=*/true,
19548 /*use_default_args=*/true);
19550 --processing_template_decl
;
19552 if (partial_spec_args
== error_mark_node
)
19553 return error_mark_node
;
19554 if (spec_tmpl
== error_mark_node
)
19555 return error_mark_node
;
19557 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
19558 spec_args
= get_partial_spec_bindings (tmpl
, parms
,
19564 spec_args
= add_to_template_args (outer_args
, spec_args
);
19565 list
= tree_cons (spec_args
, TREE_VALUE (t
), list
);
19566 TREE_TYPE (list
) = TREE_TYPE (t
);
19573 ambiguous_p
= false;
19576 t
= TREE_CHAIN (t
);
19577 for (; t
; t
= TREE_CHAIN (t
))
19579 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
19586 t
= TREE_CHAIN (t
);
19589 ambiguous_p
= true;
19598 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
19600 fate
= more_specialized_partial_spec (tmpl
, champ
, t
);
19603 ambiguous_p
= true;
19611 char *spaces
= NULL
;
19612 if (!(complain
& tf_error
))
19613 return error_mark_node
;
19614 if (TYPE_P (target
))
19615 error ("ambiguous template instantiation for %q#T", target
);
19617 error ("ambiguous template instantiation for %q#D", target
);
19618 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
19619 for (t
= list
; t
; t
= TREE_CHAIN (t
))
19621 tree subst
= build_tree_list (TREE_VALUE (t
), TREE_PURPOSE (t
));
19622 inform (DECL_SOURCE_LOCATION (TREE_VALUE (t
)),
19623 "%s %#S", spaces
? spaces
: str
, subst
);
19624 spaces
= spaces
? spaces
: get_spaces (str
);
19627 return error_mark_node
;
19633 /* Explicitly instantiate DECL. */
19636 do_decl_instantiation (tree decl
, tree storage
)
19638 tree result
= NULL_TREE
;
19641 if (!decl
|| decl
== error_mark_node
)
19642 /* An error occurred, for which grokdeclarator has already issued
19643 an appropriate message. */
19645 else if (! DECL_LANG_SPECIFIC (decl
))
19647 error ("explicit instantiation of non-template %q#D", decl
);
19651 bool var_templ
= (DECL_TEMPLATE_INFO (decl
)
19652 && variable_template_p (DECL_TI_TEMPLATE (decl
)));
19654 if (VAR_P (decl
) && !var_templ
)
19656 /* There is an asymmetry here in the way VAR_DECLs and
19657 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19658 the latter, the DECL we get back will be marked as a
19659 template instantiation, and the appropriate
19660 DECL_TEMPLATE_INFO will be set up. This does not happen for
19661 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19662 should handle VAR_DECLs as it currently handles
19664 if (!DECL_CLASS_SCOPE_P (decl
))
19666 error ("%qD is not a static data member of a class template", decl
);
19669 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
19670 if (!result
|| !VAR_P (result
))
19672 error ("no matching template for %qD found", decl
);
19675 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
19677 error ("type %qT for explicit instantiation %qD does not match "
19678 "declared type %qT", TREE_TYPE (result
), decl
,
19683 else if (TREE_CODE (decl
) != FUNCTION_DECL
&& !var_templ
)
19685 error ("explicit instantiation of %q#D", decl
);
19691 /* Check for various error cases. Note that if the explicit
19692 instantiation is valid the RESULT will currently be marked as an
19693 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19694 until we get here. */
19696 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19698 /* DR 259 [temp.spec].
19700 Both an explicit instantiation and a declaration of an explicit
19701 specialization shall not appear in a program unless the explicit
19702 instantiation follows a declaration of the explicit specialization.
19704 For a given set of template parameters, if an explicit
19705 instantiation of a template appears after a declaration of an
19706 explicit specialization for that template, the explicit
19707 instantiation has no effect. */
19710 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19714 No program shall explicitly instantiate any template more
19717 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19718 the first instantiation was `extern' and the second is not,
19719 and EXTERN_P for the opposite case. */
19720 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19721 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19722 /* If an "extern" explicit instantiation follows an ordinary
19723 explicit instantiation, the template is instantiated. */
19727 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19729 error ("no matching template for %qD found", result
);
19732 else if (!DECL_TEMPLATE_INFO (result
))
19734 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19738 if (storage
== NULL_TREE
)
19740 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19742 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19743 pedwarn (input_location
, OPT_Wpedantic
,
19744 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19749 error ("storage class %qD applied to template instantiation", storage
);
19751 check_explicit_instantiation_namespace (result
);
19752 mark_decl_instantiated (result
, extern_p
);
19754 instantiate_decl (result
, /*defer_ok=*/1,
19755 /*expl_inst_class_mem_p=*/false);
19759 mark_class_instantiated (tree t
, int extern_p
)
19761 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19762 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19763 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19764 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19767 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19768 rest_of_type_compilation (t
, 1);
19772 /* Called from do_type_instantiation through binding_table_foreach to
19773 do recursive instantiation for the type bound in ENTRY. */
19775 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19777 tree storage
= *(tree
*) data
;
19779 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19780 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19781 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19784 /* Called from do_type_instantiation to instantiate a member
19785 (a member function or a static member variable) of an
19786 explicitly instantiated class template. */
19788 instantiate_class_member (tree decl
, int extern_p
)
19790 mark_decl_instantiated (decl
, extern_p
);
19792 instantiate_decl (decl
, /*defer_ok=*/1,
19793 /*expl_inst_class_mem_p=*/true);
19796 /* Perform an explicit instantiation of template class T. STORAGE, if
19797 non-null, is the RID for extern, inline or static. COMPLAIN is
19798 nonzero if this is called from the parser, zero if called recursively,
19799 since the standard is unclear (as detailed below). */
19802 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19807 int previous_instantiation_extern_p
= 0;
19809 if (TREE_CODE (t
) == TYPE_DECL
)
19812 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19815 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19817 error ("explicit instantiation of non-class template %qD", tmpl
);
19819 error ("explicit instantiation of non-template type %qT", t
);
19825 if (!COMPLETE_TYPE_P (t
))
19827 if (complain
& tf_error
)
19828 error ("explicit instantiation of %q#T before definition of template",
19833 if (storage
!= NULL_TREE
)
19835 if (!in_system_header_at (input_location
))
19837 if (storage
== ridpointers
[(int) RID_EXTERN
])
19839 if (cxx_dialect
== cxx98
)
19840 pedwarn (input_location
, OPT_Wpedantic
,
19841 "ISO C++ 1998 forbids the use of %<extern%> on "
19842 "explicit instantiations");
19845 pedwarn (input_location
, OPT_Wpedantic
,
19846 "ISO C++ forbids the use of %qE"
19847 " on explicit instantiations", storage
);
19850 if (storage
== ridpointers
[(int) RID_INLINE
])
19852 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19854 else if (storage
== ridpointers
[(int) RID_STATIC
])
19858 error ("storage class %qD applied to template instantiation",
19864 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19866 /* DR 259 [temp.spec].
19868 Both an explicit instantiation and a declaration of an explicit
19869 specialization shall not appear in a program unless the explicit
19870 instantiation follows a declaration of the explicit specialization.
19872 For a given set of template parameters, if an explicit
19873 instantiation of a template appears after a declaration of an
19874 explicit specialization for that template, the explicit
19875 instantiation has no effect. */
19878 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19882 No program shall explicitly instantiate any template more
19885 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19886 instantiation was `extern'. If EXTERN_P then the second is.
19887 These cases are OK. */
19888 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19890 if (!previous_instantiation_extern_p
&& !extern_p
19891 && (complain
& tf_error
))
19892 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19894 /* If we've already instantiated the template, just return now. */
19895 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19899 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19900 mark_class_instantiated (t
, extern_p
);
19908 /* In contrast to implicit instantiation, where only the
19909 declarations, and not the definitions, of members are
19910 instantiated, we have here:
19914 The explicit instantiation of a class template specialization
19915 implies the instantiation of all of its members not
19916 previously explicitly specialized in the translation unit
19917 containing the explicit instantiation.
19919 Of course, we can't instantiate member template classes, since
19920 we don't have any arguments for them. Note that the standard
19921 is unclear on whether the instantiation of the members are
19922 *explicit* instantiations or not. However, the most natural
19923 interpretation is that it should be an explicit instantiation. */
19926 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19927 if (TREE_CODE (tmp
) == FUNCTION_DECL
19928 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19929 instantiate_class_member (tmp
, extern_p
);
19931 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19932 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19933 instantiate_class_member (tmp
, extern_p
);
19935 if (CLASSTYPE_NESTED_UTDS (t
))
19936 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19937 bt_instantiate_type_proc
, &storage
);
19941 /* Given a function DECL, which is a specialization of TMPL, modify
19942 DECL to be a re-instantiation of TMPL with the same template
19943 arguments. TMPL should be the template into which tsubst'ing
19944 should occur for DECL, not the most general template.
19946 One reason for doing this is a scenario like this:
19949 void f(const T&, int i);
19951 void g() { f(3, 7); }
19954 void f(const T& t, const int i) { }
19956 Note that when the template is first instantiated, with
19957 instantiate_template, the resulting DECL will have no name for the
19958 first parameter, and the wrong type for the second. So, when we go
19959 to instantiate the DECL, we regenerate it. */
19962 regenerate_decl_from_template (tree decl
, tree tmpl
)
19964 /* The arguments used to instantiate DECL, from the most general
19969 args
= DECL_TI_ARGS (decl
);
19970 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19972 /* Make sure that we can see identifiers, and compute access
19974 push_access_scope (decl
);
19976 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19984 args_depth
= TMPL_ARGS_DEPTH (args
);
19985 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19986 if (args_depth
> parms_depth
)
19987 args
= get_innermost_template_args (args
, parms_depth
);
19989 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19990 args
, tf_error
, NULL_TREE
,
19991 /*defer_ok*/false);
19992 if (specs
&& specs
!= error_mark_node
)
19993 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19996 /* Merge parameter declarations. */
19997 decl_parm
= skip_artificial_parms_for (decl
,
19998 DECL_ARGUMENTS (decl
));
20000 = skip_artificial_parms_for (code_pattern
,
20001 DECL_ARGUMENTS (code_pattern
));
20002 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
20007 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
20008 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
20009 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
20011 parm_type
= type_decays_to (parm_type
);
20012 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
20013 TREE_TYPE (decl_parm
) = parm_type
;
20014 attributes
= DECL_ATTRIBUTES (pattern_parm
);
20015 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
20017 DECL_ATTRIBUTES (decl_parm
) = attributes
;
20018 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
20020 decl_parm
= DECL_CHAIN (decl_parm
);
20021 pattern_parm
= DECL_CHAIN (pattern_parm
);
20023 /* Merge any parameters that match with the function parameter
20025 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
20028 tree expanded_types
;
20029 /* Expand the TYPE_PACK_EXPANSION that provides the types for
20030 the parameters in this function parameter pack. */
20031 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
20032 args
, tf_error
, NULL_TREE
);
20033 len
= TREE_VEC_LENGTH (expanded_types
);
20034 for (i
= 0; i
< len
; i
++)
20039 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
20040 /* Rename the parameter to include the index. */
20041 DECL_NAME (decl_parm
) =
20042 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
20043 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
20044 parm_type
= type_decays_to (parm_type
);
20045 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
20046 TREE_TYPE (decl_parm
) = parm_type
;
20047 attributes
= DECL_ATTRIBUTES (pattern_parm
);
20048 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
20050 DECL_ATTRIBUTES (decl_parm
) = attributes
;
20051 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
20053 decl_parm
= DECL_CHAIN (decl_parm
);
20056 /* Merge additional specifiers from the CODE_PATTERN. */
20057 if (DECL_DECLARED_INLINE_P (code_pattern
)
20058 && !DECL_DECLARED_INLINE_P (decl
))
20059 DECL_DECLARED_INLINE_P (decl
) = 1;
20061 else if (VAR_P (decl
))
20063 DECL_INITIAL (decl
) =
20064 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
20065 tf_error
, DECL_TI_TEMPLATE (decl
),
20066 /*integral_constant_expression_p=*/false);
20067 if (VAR_HAD_UNKNOWN_BOUND (decl
))
20068 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
20069 tf_error
, DECL_TI_TEMPLATE (decl
));
20072 gcc_unreachable ();
20074 pop_access_scope (decl
);
20077 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
20078 substituted to get DECL. */
20081 template_for_substitution (tree decl
)
20083 tree tmpl
= DECL_TI_TEMPLATE (decl
);
20085 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
20086 for the instantiation. This is not always the most general
20087 template. Consider, for example:
20090 struct S { template <class U> void f();
20091 template <> void f<int>(); };
20093 and an instantiation of S<double>::f<int>. We want TD to be the
20094 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
20095 while (/* An instantiation cannot have a definition, so we need a
20096 more general template. */
20097 DECL_TEMPLATE_INSTANTIATION (tmpl
)
20098 /* We must also deal with friend templates. Given:
20100 template <class T> struct S {
20101 template <class U> friend void f() {};
20104 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
20105 so far as the language is concerned, but that's still
20106 where we get the pattern for the instantiation from. On
20107 other hand, if the definition comes outside the class, say:
20109 template <class T> struct S {
20110 template <class U> friend void f();
20112 template <class U> friend void f() {}
20114 we don't need to look any further. That's what the check for
20115 DECL_INITIAL is for. */
20116 || (TREE_CODE (decl
) == FUNCTION_DECL
20117 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
20118 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
20120 /* The present template, TD, should not be a definition. If it
20121 were a definition, we should be using it! Note that we
20122 cannot restructure the loop to just keep going until we find
20123 a template with a definition, since that might go too far if
20124 a specialization was declared, but not defined. */
20126 /* Fetch the more general template. */
20127 tmpl
= DECL_TI_TEMPLATE (tmpl
);
20133 /* Returns true if we need to instantiate this template instance even if we
20134 know we aren't going to emit it.. */
20137 always_instantiate_p (tree decl
)
20139 /* We always instantiate inline functions so that we can inline them. An
20140 explicit instantiation declaration prohibits implicit instantiation of
20141 non-inline functions. With high levels of optimization, we would
20142 normally inline non-inline functions -- but we're not allowed to do
20143 that for "extern template" functions. Therefore, we check
20144 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
20145 return ((TREE_CODE (decl
) == FUNCTION_DECL
20146 && (DECL_DECLARED_INLINE_P (decl
)
20147 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
20148 /* And we need to instantiate static data members so that
20149 their initializers are available in integral constant
20152 && decl_maybe_constant_var_p (decl
)));
20155 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
20156 instantiate it now, modifying TREE_TYPE (fn). */
20159 maybe_instantiate_noexcept (tree fn
)
20161 tree fntype
, spec
, noex
, clone
;
20163 /* Don't instantiate a noexcept-specification from template context. */
20164 if (processing_template_decl
)
20167 if (DECL_CLONED_FUNCTION_P (fn
))
20168 fn
= DECL_CLONED_FUNCTION (fn
);
20169 fntype
= TREE_TYPE (fn
);
20170 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
20172 if (!spec
|| !TREE_PURPOSE (spec
))
20175 noex
= TREE_PURPOSE (spec
);
20177 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
20179 if (DEFERRED_NOEXCEPT_PATTERN (noex
) == NULL_TREE
)
20180 spec
= get_defaulted_eh_spec (fn
);
20181 else if (push_tinst_level (fn
))
20183 push_access_scope (fn
);
20184 push_deferring_access_checks (dk_no_deferred
);
20185 input_location
= DECL_SOURCE_LOCATION (fn
);
20186 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
20187 DEFERRED_NOEXCEPT_ARGS (noex
),
20188 tf_warning_or_error
, fn
,
20189 /*function_p=*/false,
20190 /*integral_constant_expression_p=*/true);
20191 pop_deferring_access_checks ();
20192 pop_access_scope (fn
);
20193 pop_tinst_level ();
20194 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
20195 if (spec
== error_mark_node
)
20196 spec
= noexcept_false_spec
;
20199 spec
= noexcept_false_spec
;
20201 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
20204 FOR_EACH_CLONE (clone
, fn
)
20206 if (TREE_TYPE (clone
) == fntype
)
20207 TREE_TYPE (clone
) = TREE_TYPE (fn
);
20209 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
20213 /* Produce the definition of D, a _DECL generated from a template. If
20214 DEFER_OK is nonzero, then we don't have to actually do the
20215 instantiation now; we just have to do it sometime. Normally it is
20216 an error if this is an explicit instantiation but D is undefined.
20217 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
20218 explicitly instantiated class template. */
20221 instantiate_decl (tree d
, int defer_ok
,
20222 bool expl_inst_class_mem_p
)
20224 tree tmpl
= DECL_TI_TEMPLATE (d
);
20231 bool pattern_defined
;
20232 location_t saved_loc
= input_location
;
20233 int saved_unevaluated_operand
= cp_unevaluated_operand
;
20234 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
20240 /* This function should only be used to instantiate templates for
20241 functions and static member variables. */
20242 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
20244 /* Variables are never deferred; if instantiation is required, they
20245 are instantiated right away. That allows for better code in the
20246 case that an expression refers to the value of the variable --
20247 if the variable has a constant value the referring expression can
20248 take advantage of that fact. */
20250 || DECL_DECLARED_CONSTEXPR_P (d
))
20253 /* Don't instantiate cloned functions. Instead, instantiate the
20254 functions they cloned. */
20255 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
20256 d
= DECL_CLONED_FUNCTION (d
);
20258 if (DECL_TEMPLATE_INSTANTIATED (d
)
20259 || (TREE_CODE (d
) == FUNCTION_DECL
20260 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
20261 || DECL_TEMPLATE_SPECIALIZATION (d
))
20262 /* D has already been instantiated or explicitly specialized, so
20263 there's nothing for us to do here.
20265 It might seem reasonable to check whether or not D is an explicit
20266 instantiation, and, if so, stop here. But when an explicit
20267 instantiation is deferred until the end of the compilation,
20268 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
20269 the instantiation. */
20272 /* Check to see whether we know that this template will be
20273 instantiated in some other file, as with "extern template"
20275 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
20277 /* In general, we do not instantiate such templates. */
20278 if (external_p
&& !always_instantiate_p (d
))
20281 gen_tmpl
= most_general_template (tmpl
);
20282 gen_args
= DECL_TI_ARGS (d
);
20284 if (tmpl
!= gen_tmpl
)
20285 /* We should already have the extra args. */
20286 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
20287 == TMPL_ARGS_DEPTH (gen_args
));
20288 /* And what's in the hash table should match D. */
20289 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
20290 || spec
== NULL_TREE
);
20292 /* This needs to happen before any tsubsting. */
20293 if (! push_tinst_level (d
))
20296 timevar_push (TV_TEMPLATE_INST
);
20298 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
20299 for the instantiation. */
20300 td
= template_for_substitution (d
);
20301 code_pattern
= DECL_TEMPLATE_RESULT (td
);
20303 /* We should never be trying to instantiate a member of a class
20304 template or partial specialization. */
20305 gcc_assert (d
!= code_pattern
);
20307 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
20308 || DECL_TEMPLATE_SPECIALIZATION (td
))
20309 /* In the case of a friend template whose definition is provided
20310 outside the class, we may have too many arguments. Drop the
20311 ones we don't need. The same is true for specializations. */
20312 args
= get_innermost_template_args
20313 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
20317 if (TREE_CODE (d
) == FUNCTION_DECL
)
20319 deleted_p
= DECL_DELETED_FN (code_pattern
);
20320 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
20321 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
)
20327 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
20330 /* We may be in the middle of deferred access check. Disable it now. */
20331 push_deferring_access_checks (dk_no_deferred
);
20333 /* Unless an explicit instantiation directive has already determined
20334 the linkage of D, remember that a definition is available for
20336 if (pattern_defined
20337 && !DECL_INTERFACE_KNOWN (d
)
20338 && !DECL_NOT_REALLY_EXTERN (d
))
20339 mark_definable (d
);
20341 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
20342 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
20343 input_location
= DECL_SOURCE_LOCATION (d
);
20345 /* If D is a member of an explicitly instantiated class template,
20346 and no definition is available, treat it like an implicit
20348 if (!pattern_defined
&& expl_inst_class_mem_p
20349 && DECL_EXPLICIT_INSTANTIATION (d
))
20351 /* Leave linkage flags alone on instantiations with anonymous
20353 if (TREE_PUBLIC (d
))
20355 DECL_NOT_REALLY_EXTERN (d
) = 0;
20356 DECL_INTERFACE_KNOWN (d
) = 0;
20358 SET_DECL_IMPLICIT_INSTANTIATION (d
);
20361 /* Defer all other templates, unless we have been explicitly
20362 forbidden from doing so. */
20363 if (/* If there is no definition, we cannot instantiate the
20366 /* If it's OK to postpone instantiation, do so. */
20368 /* If this is a static data member that will be defined
20369 elsewhere, we don't want to instantiate the entire data
20370 member, but we do want to instantiate the initializer so that
20371 we can substitute that elsewhere. */
20372 || (external_p
&& VAR_P (d
))
20373 /* Handle here a deleted function too, avoid generating
20374 its body (c++/61080). */
20377 /* The definition of the static data member is now required so
20378 we must substitute the initializer. */
20380 && !DECL_INITIAL (d
)
20381 && DECL_INITIAL (code_pattern
))
20385 bool const_init
= false;
20386 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20388 ns
= decl_namespace_context (d
);
20389 push_nested_namespace (ns
);
20391 push_nested_class (DECL_CONTEXT (d
));
20392 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
20394 tf_warning_or_error
, NULL_TREE
,
20395 /*integral_constant_expression_p=*/false);
20396 /* If instantiating the initializer involved instantiating this
20397 again, don't call cp_finish_decl twice. */
20398 if (!DECL_INITIAL (d
))
20400 /* Make sure the initializer is still constant, in case of
20401 circular dependency (template/instantiate6.C). */
20403 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20404 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
20405 /*asmspec_tree=*/NULL_TREE
,
20406 LOOKUP_ONLYCONVERTING
);
20409 pop_nested_class ();
20410 pop_nested_namespace (ns
);
20413 /* We restore the source position here because it's used by
20414 add_pending_template. */
20415 input_location
= saved_loc
;
20417 if (at_eof
&& !pattern_defined
20418 && DECL_EXPLICIT_INSTANTIATION (d
)
20419 && DECL_NOT_REALLY_EXTERN (d
))
20422 The definition of a non-exported function template, a
20423 non-exported member function template, or a non-exported
20424 member function or static data member of a class template
20425 shall be present in every translation unit in which it is
20426 explicitly instantiated. */
20427 permerror (input_location
, "explicit instantiation of %qD "
20428 "but no definition available", d
);
20430 /* If we're in unevaluated context, we just wanted to get the
20431 constant value; this isn't an odr use, so don't queue
20432 a full instantiation. */
20433 if (cp_unevaluated_operand
!= 0)
20435 /* ??? Historically, we have instantiated inline functions, even
20436 when marked as "extern template". */
20437 if (!(external_p
&& VAR_P (d
)))
20438 add_pending_template (d
);
20441 /* Tell the repository that D is available in this translation unit
20442 -- and see if it is supposed to be instantiated here. */
20443 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
20445 /* In a PCH file, despite the fact that the repository hasn't
20446 requested instantiation in the PCH it is still possible that
20447 an instantiation will be required in a file that includes the
20450 add_pending_template (d
);
20451 /* Instantiate inline functions so that the inliner can do its
20452 job, even though we'll not be emitting a copy of this
20454 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
20458 fn_context
= decl_function_context (d
);
20459 nested
= (current_function_decl
!= NULL_TREE
);
20461 push_to_top_level ();
20465 push_function_context ();
20466 cp_unevaluated_operand
= 0;
20467 c_inhibit_evaluation_warnings
= 0;
20470 /* Mark D as instantiated so that recursive calls to
20471 instantiate_decl do not try to instantiate it again. */
20472 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
20474 /* Regenerate the declaration in case the template has been modified
20475 by a subsequent redeclaration. */
20476 regenerate_decl_from_template (d
, td
);
20478 /* We already set the file and line above. Reset them now in case
20479 they changed as a result of calling regenerate_decl_from_template. */
20480 input_location
= DECL_SOURCE_LOCATION (d
);
20485 bool const_init
= false;
20487 /* Clear out DECL_RTL; whatever was there before may not be right
20488 since we've reset the type of the declaration. */
20489 SET_DECL_RTL (d
, NULL
);
20490 DECL_IN_AGGR_P (d
) = 0;
20492 /* The initializer is placed in DECL_INITIAL by
20493 regenerate_decl_from_template so we don't need to
20494 push/pop_access_scope again here. Pull it out so that
20495 cp_finish_decl can process it. */
20496 init
= DECL_INITIAL (d
);
20497 DECL_INITIAL (d
) = NULL_TREE
;
20498 DECL_INITIALIZED_P (d
) = 0;
20500 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
20501 initializer. That function will defer actual emission until
20502 we have a chance to determine linkage. */
20503 DECL_EXTERNAL (d
) = 0;
20505 /* Enter the scope of D so that access-checking works correctly. */
20506 bool enter_context
= DECL_CLASS_SCOPE_P (d
);
20508 push_nested_class (DECL_CONTEXT (d
));
20510 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
20511 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
20514 pop_nested_class ();
20516 if (variable_template_p (td
))
20517 note_variable_template_instantiation (d
);
20519 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
20520 synthesize_method (d
);
20521 else if (TREE_CODE (d
) == FUNCTION_DECL
)
20523 hash_map
<tree
, tree
> *saved_local_specializations
;
20527 tree block
= NULL_TREE
;
20529 /* Save away the current list, in case we are instantiating one
20530 template from within the body of another. */
20531 saved_local_specializations
= local_specializations
;
20533 /* Set up the list of local specializations. */
20534 local_specializations
= new hash_map
<tree
, tree
>;
20536 /* Set up context. */
20537 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20538 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20539 block
= push_stmt_list ();
20541 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
20543 /* Some typedefs referenced from within the template code need to be
20544 access checked at template instantiation time, i.e now. These
20545 types were added to the template at parsing time. Let's get those
20546 and perform the access checks then. */
20547 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
20550 /* Create substitution entries for the parameters. */
20551 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
20552 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
20553 spec_parm
= DECL_ARGUMENTS (d
);
20554 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
20556 register_local_specialization (spec_parm
, tmpl_parm
);
20557 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
20558 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
20560 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
20562 if (!DECL_PACK_P (tmpl_parm
))
20564 register_local_specialization (spec_parm
, tmpl_parm
);
20565 spec_parm
= DECL_CHAIN (spec_parm
);
20569 /* Register the (value) argument pack as a specialization of
20570 TMPL_PARM, then move on. */
20571 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
20572 register_local_specialization (argpack
, tmpl_parm
);
20575 gcc_assert (!spec_parm
);
20577 /* Substitute into the body of the function. */
20578 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20579 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
20580 tf_warning_or_error
, tmpl
);
20583 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
20584 tf_warning_or_error
, tmpl
,
20585 /*integral_constant_expression_p=*/false);
20587 /* Set the current input_location to the end of the function
20588 so that finish_function knows where we are. */
20590 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
20592 /* Remember if we saw an infinite loop in the template. */
20593 current_function_infinite_loop
20594 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
20597 /* We don't need the local specializations any more. */
20598 delete local_specializations
;
20599 local_specializations
= saved_local_specializations
;
20601 /* Finish the function. */
20602 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
20603 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
20604 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
20607 d
= finish_function (0);
20608 expand_or_defer_fn (d
);
20611 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20612 cp_check_omp_declare_reduction (d
);
20615 /* We're not deferring instantiation any more. */
20616 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
20619 pop_from_top_level ();
20621 pop_function_context ();
20624 input_location
= saved_loc
;
20625 cp_unevaluated_operand
= saved_unevaluated_operand
;
20626 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20627 pop_deferring_access_checks ();
20628 pop_tinst_level ();
20630 timevar_pop (TV_TEMPLATE_INST
);
20635 /* Run through the list of templates that we wish we could
20636 instantiate, and instantiate any we can. RETRIES is the
20637 number of times we retry pending template instantiation. */
20640 instantiate_pending_templates (int retries
)
20643 location_t saved_loc
= input_location
;
20645 /* Instantiating templates may trigger vtable generation. This in turn
20646 may require further template instantiations. We place a limit here
20647 to avoid infinite loop. */
20648 if (pending_templates
&& retries
>= max_tinst_depth
)
20650 tree decl
= pending_templates
->tinst
->decl
;
20652 fatal_error (input_location
,
20653 "template instantiation depth exceeds maximum of %d"
20654 " instantiating %q+D, possibly from virtual table generation"
20655 " (use -ftemplate-depth= to increase the maximum)",
20656 max_tinst_depth
, decl
);
20657 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20658 /* Pretend that we defined it. */
20659 DECL_INITIAL (decl
) = error_mark_node
;
20665 struct pending_template
**t
= &pending_templates
;
20666 struct pending_template
*last
= NULL
;
20670 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
20671 bool complete
= false;
20673 if (TYPE_P (instantiation
))
20677 if (!COMPLETE_TYPE_P (instantiation
))
20679 instantiate_class_template (instantiation
);
20680 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
20681 for (fn
= TYPE_METHODS (instantiation
);
20683 fn
= TREE_CHAIN (fn
))
20684 if (! DECL_ARTIFICIAL (fn
))
20685 instantiate_decl (fn
,
20687 /*expl_inst_class_mem_p=*/false);
20688 if (COMPLETE_TYPE_P (instantiation
))
20692 complete
= COMPLETE_TYPE_P (instantiation
);
20696 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20697 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
20700 = instantiate_decl (instantiation
,
20702 /*expl_inst_class_mem_p=*/false);
20703 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20707 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20708 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20712 /* If INSTANTIATION has been instantiated, then we don't
20713 need to consider it again in the future. */
20721 current_tinst_level
= NULL
;
20723 last_pending_template
= last
;
20725 while (reconsider
);
20727 input_location
= saved_loc
;
20730 /* Substitute ARGVEC into T, which is a list of initializers for
20731 either base class or a non-static data member. The TREE_PURPOSEs
20732 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20733 instantiate_decl. */
20736 tsubst_initializer_list (tree t
, tree argvec
)
20738 tree inits
= NULL_TREE
;
20740 for (; t
; t
= TREE_CHAIN (t
))
20744 tree expanded_bases
= NULL_TREE
;
20745 tree expanded_arguments
= NULL_TREE
;
20748 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20753 /* Expand the base class expansion type into separate base
20755 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20756 tf_warning_or_error
,
20758 if (expanded_bases
== error_mark_node
)
20761 /* We'll be building separate TREE_LISTs of arguments for
20763 len
= TREE_VEC_LENGTH (expanded_bases
);
20764 expanded_arguments
= make_tree_vec (len
);
20765 for (i
= 0; i
< len
; i
++)
20766 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20768 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20769 expand each argument in the TREE_VALUE of t. */
20770 expr
= make_node (EXPR_PACK_EXPANSION
);
20771 PACK_EXPANSION_LOCAL_P (expr
) = true;
20772 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20773 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20775 if (TREE_VALUE (t
) == void_type_node
)
20776 /* VOID_TYPE_NODE is used to indicate
20777 value-initialization. */
20779 for (i
= 0; i
< len
; i
++)
20780 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20784 /* Substitute parameter packs into each argument in the
20786 in_base_initializer
= 1;
20787 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20789 tree expanded_exprs
;
20791 /* Expand the argument. */
20792 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20794 = tsubst_pack_expansion (expr
, argvec
,
20795 tf_warning_or_error
,
20797 if (expanded_exprs
== error_mark_node
)
20800 /* Prepend each of the expanded expressions to the
20801 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20802 for (i
= 0; i
< len
; i
++)
20804 TREE_VEC_ELT (expanded_arguments
, i
) =
20805 tree_cons (NULL_TREE
,
20806 TREE_VEC_ELT (expanded_exprs
, i
),
20807 TREE_VEC_ELT (expanded_arguments
, i
));
20810 in_base_initializer
= 0;
20812 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20813 since we built them backwards. */
20814 for (i
= 0; i
< len
; i
++)
20816 TREE_VEC_ELT (expanded_arguments
, i
) =
20817 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20822 for (i
= 0; i
< len
; ++i
)
20824 if (expanded_bases
)
20826 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20827 decl
= expand_member_init (decl
);
20828 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20833 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20834 tf_warning_or_error
, NULL_TREE
);
20836 decl
= expand_member_init (decl
);
20837 if (decl
&& !DECL_P (decl
))
20838 in_base_initializer
= 1;
20840 init
= TREE_VALUE (t
);
20842 if (init
!= void_type_node
)
20843 init
= tsubst_expr (init
, argvec
,
20844 tf_warning_or_error
, NULL_TREE
,
20845 /*integral_constant_expression_p=*/false);
20846 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20847 /* If we had an initializer but it instantiated to nothing,
20848 value-initialize the object. This will only occur when
20849 the initializer was a pack expansion where the parameter
20850 packs used in that expansion were of length zero. */
20851 init
= void_type_node
;
20852 in_base_initializer
= 0;
20857 init
= build_tree_list (decl
, init
);
20858 TREE_CHAIN (init
) = inits
;
20866 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20869 set_current_access_from_decl (tree decl
)
20871 if (TREE_PRIVATE (decl
))
20872 current_access_specifier
= access_private_node
;
20873 else if (TREE_PROTECTED (decl
))
20874 current_access_specifier
= access_protected_node
;
20876 current_access_specifier
= access_public_node
;
20879 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20880 is the instantiation (which should have been created with
20881 start_enum) and ARGS are the template arguments to use. */
20884 tsubst_enum (tree tag
, tree newtag
, tree args
)
20888 if (SCOPED_ENUM_P (newtag
))
20889 begin_scope (sk_scoped_enum
, newtag
);
20891 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20896 decl
= TREE_VALUE (e
);
20897 /* Note that in a template enum, the TREE_VALUE is the
20898 CONST_DECL, not the corresponding INTEGER_CST. */
20899 value
= tsubst_expr (DECL_INITIAL (decl
),
20900 args
, tf_warning_or_error
, NULL_TREE
,
20901 /*integral_constant_expression_p=*/true);
20903 /* Give this enumeration constant the correct access. */
20904 set_current_access_from_decl (decl
);
20906 /* Actually build the enumerator itself. Here we're assuming that
20907 enumerators can't have dependent attributes. */
20908 build_enumerator (DECL_NAME (decl
), value
, newtag
,
20909 DECL_ATTRIBUTES (decl
), DECL_SOURCE_LOCATION (decl
));
20912 if (SCOPED_ENUM_P (newtag
))
20915 finish_enum_value_list (newtag
);
20916 finish_enum (newtag
);
20918 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20919 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20922 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20923 its type -- but without substituting the innermost set of template
20924 arguments. So, innermost set of template parameters will appear in
20928 get_mostly_instantiated_function_type (tree decl
)
20930 /* For a function, DECL_TI_TEMPLATE is partially instantiated. */
20931 return TREE_TYPE (DECL_TI_TEMPLATE (decl
));
20934 /* Return truthvalue if we're processing a template different from
20935 the last one involved in diagnostics. */
20937 problematic_instantiation_changed (void)
20939 return current_tinst_level
!= last_error_tinst_level
;
20942 /* Remember current template involved in diagnostics. */
20944 record_last_problematic_instantiation (void)
20946 last_error_tinst_level
= current_tinst_level
;
20949 struct tinst_level
*
20950 current_instantiation (void)
20952 return current_tinst_level
;
20955 /* Return TRUE if current_function_decl is being instantiated, false
20959 instantiating_current_function_p (void)
20961 return (current_instantiation ()
20962 && current_instantiation ()->decl
== current_function_decl
);
20965 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20966 type. Return zero for ok, nonzero for disallowed. Issue error and
20967 warning messages under control of COMPLAIN. */
20970 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20972 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20974 else if (POINTER_TYPE_P (type
))
20976 else if (TYPE_PTRMEM_P (type
))
20978 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20980 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20982 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20984 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20987 if (complain
& tf_error
)
20989 if (type
== error_mark_node
)
20990 inform (input_location
, "invalid template non-type parameter");
20992 error ("%q#T is not a valid type for a template non-type parameter",
20998 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20999 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
21002 dependent_type_p_r (tree type
)
21008 A type is dependent if it is:
21010 -- a template parameter. Template template parameters are types
21011 for us (since TYPE_P holds true for them) so we handle
21013 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
21014 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
21016 /* -- a qualified-id with a nested-name-specifier which contains a
21017 class-name that names a dependent type or whose unqualified-id
21018 names a dependent type. */
21019 if (TREE_CODE (type
) == TYPENAME_TYPE
)
21022 /* An alias template specialization can be dependent even if the
21023 resulting type is not. */
21024 if (dependent_alias_template_spec_p (type
))
21027 /* -- a cv-qualified type where the cv-unqualified type is
21029 No code is necessary for this bullet; the code below handles
21030 cv-qualified types, and we don't want to strip aliases with
21031 TYPE_MAIN_VARIANT because of DR 1558. */
21032 /* -- a compound type constructed from any dependent type. */
21033 if (TYPE_PTRMEM_P (type
))
21034 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
21035 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
21037 else if (TYPE_PTR_P (type
)
21038 || TREE_CODE (type
) == REFERENCE_TYPE
)
21039 return dependent_type_p (TREE_TYPE (type
));
21040 else if (TREE_CODE (type
) == FUNCTION_TYPE
21041 || TREE_CODE (type
) == METHOD_TYPE
)
21045 if (dependent_type_p (TREE_TYPE (type
)))
21047 for (arg_type
= TYPE_ARG_TYPES (type
);
21049 arg_type
= TREE_CHAIN (arg_type
))
21050 if (dependent_type_p (TREE_VALUE (arg_type
)))
21054 /* -- an array type constructed from any dependent type or whose
21055 size is specified by a constant expression that is
21058 We checked for type- and value-dependence of the bounds in
21059 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
21060 if (TREE_CODE (type
) == ARRAY_TYPE
)
21062 if (TYPE_DOMAIN (type
)
21063 && dependent_type_p (TYPE_DOMAIN (type
)))
21065 return dependent_type_p (TREE_TYPE (type
));
21068 /* -- a template-id in which either the template name is a template
21070 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
21072 /* ... or any of the template arguments is a dependent type or
21073 an expression that is type-dependent or value-dependent. */
21074 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
21075 && (any_dependent_template_arguments_p
21076 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
21079 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
21080 dependent; if the argument of the `typeof' expression is not
21081 type-dependent, then it should already been have resolved. */
21082 if (TREE_CODE (type
) == TYPEOF_TYPE
21083 || TREE_CODE (type
) == DECLTYPE_TYPE
21084 || TREE_CODE (type
) == UNDERLYING_TYPE
)
21087 /* A template argument pack is dependent if any of its packed
21089 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
21091 tree args
= ARGUMENT_PACK_ARGS (type
);
21092 int i
, len
= TREE_VEC_LENGTH (args
);
21093 for (i
= 0; i
< len
; ++i
)
21094 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21098 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
21099 be template parameters. */
21100 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
21103 /* The standard does not specifically mention types that are local
21104 to template functions or local classes, but they should be
21105 considered dependent too. For example:
21107 template <int I> void f() {
21112 The size of `E' cannot be known until the value of `I' has been
21113 determined. Therefore, `E' must be considered dependent. */
21114 scope
= TYPE_CONTEXT (type
);
21115 if (scope
&& TYPE_P (scope
))
21116 return dependent_type_p (scope
);
21117 /* Don't use type_dependent_expression_p here, as it can lead
21118 to infinite recursion trying to determine whether a lambda
21119 nested in a lambda is dependent (c++/47687). */
21120 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
21121 && DECL_LANG_SPECIFIC (scope
)
21122 && DECL_TEMPLATE_INFO (scope
)
21123 && (any_dependent_template_arguments_p
21124 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
21127 /* Other types are non-dependent. */
21131 /* Returns TRUE if TYPE is dependent, in the sense of
21132 [temp.dep.type]. Note that a NULL type is considered dependent. */
21135 dependent_type_p (tree type
)
21137 /* If there are no template parameters in scope, then there can't be
21138 any dependent types. */
21139 if (!processing_template_decl
)
21141 /* If we are not processing a template, then nobody should be
21142 providing us with a dependent type. */
21144 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
21148 /* If the type is NULL, we have not computed a type for the entity
21149 in question; in that case, the type is dependent. */
21153 /* Erroneous types can be considered non-dependent. */
21154 if (type
== error_mark_node
)
21157 /* If we have not already computed the appropriate value for TYPE,
21159 if (!TYPE_DEPENDENT_P_VALID (type
))
21161 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
21162 TYPE_DEPENDENT_P_VALID (type
) = 1;
21165 return TYPE_DEPENDENT_P (type
);
21168 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
21169 lookup. In other words, a dependent type that is not the current
21173 dependent_scope_p (tree scope
)
21175 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
21176 && !currently_open_class (scope
));
21179 /* T is a SCOPE_REF; return whether we need to consider it
21180 instantiation-dependent so that we can check access at instantiation
21181 time even though we know which member it resolves to. */
21184 instantiation_dependent_scope_ref_p (tree t
)
21186 if (DECL_P (TREE_OPERAND (t
, 1))
21187 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
21188 && accessible_in_template_p (TREE_OPERAND (t
, 0),
21189 TREE_OPERAND (t
, 1)))
21195 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
21196 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
21199 /* Note that this predicate is not appropriate for general expressions;
21200 only constant expressions (that satisfy potential_constant_expression)
21201 can be tested for value dependence. */
21204 value_dependent_expression_p (tree expression
)
21206 if (!processing_template_decl
)
21209 /* A name declared with a dependent type. */
21210 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
21213 switch (TREE_CODE (expression
))
21215 case IDENTIFIER_NODE
:
21216 /* A name that has not been looked up -- must be dependent. */
21219 case TEMPLATE_PARM_INDEX
:
21220 /* A non-type template parm. */
21224 /* A non-type template parm. */
21225 if (DECL_TEMPLATE_PARM_P (expression
))
21227 return value_dependent_expression_p (DECL_INITIAL (expression
));
21230 /* A constant with literal type and is initialized
21231 with an expression that is value-dependent.
21233 Note that a non-dependent parenthesized initializer will have
21234 already been replaced with its constant value, so if we see
21235 a TREE_LIST it must be dependent. */
21236 if (DECL_INITIAL (expression
)
21237 && decl_constant_var_p (expression
)
21238 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
21239 /* cp_finish_decl doesn't fold reference initializers. */
21240 || TREE_CODE (TREE_TYPE (expression
)) == REFERENCE_TYPE
21241 || value_dependent_expression_p (DECL_INITIAL (expression
))))
21245 case DYNAMIC_CAST_EXPR
:
21246 case STATIC_CAST_EXPR
:
21247 case CONST_CAST_EXPR
:
21248 case REINTERPRET_CAST_EXPR
:
21250 /* These expressions are value-dependent if the type to which
21251 the cast occurs is dependent or the expression being casted
21252 is value-dependent. */
21254 tree type
= TREE_TYPE (expression
);
21256 if (dependent_type_p (type
))
21259 /* A functional cast has a list of operands. */
21260 expression
= TREE_OPERAND (expression
, 0);
21263 /* If there are no operands, it must be an expression such
21264 as "int()". This should not happen for aggregate types
21265 because it would form non-constant expressions. */
21266 gcc_assert (cxx_dialect
>= cxx11
21267 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
21272 if (TREE_CODE (expression
) == TREE_LIST
)
21273 return any_value_dependent_elements_p (expression
);
21275 return value_dependent_expression_p (expression
);
21279 if (SIZEOF_EXPR_TYPE_P (expression
))
21280 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
21284 /* A `sizeof' expression is value-dependent if the operand is
21285 type-dependent or is a pack expansion. */
21286 expression
= TREE_OPERAND (expression
, 0);
21287 if (PACK_EXPANSION_P (expression
))
21289 else if (TYPE_P (expression
))
21290 return dependent_type_p (expression
);
21291 return instantiation_dependent_expression_p (expression
);
21293 case AT_ENCODE_EXPR
:
21294 /* An 'encode' expression is value-dependent if the operand is
21296 expression
= TREE_OPERAND (expression
, 0);
21297 return dependent_type_p (expression
);
21299 case NOEXCEPT_EXPR
:
21300 expression
= TREE_OPERAND (expression
, 0);
21301 return instantiation_dependent_expression_p (expression
);
21304 /* All instantiation-dependent expressions should also be considered
21305 value-dependent. */
21306 return instantiation_dependent_scope_ref_p (expression
);
21308 case COMPONENT_REF
:
21309 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
21310 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
21312 case NONTYPE_ARGUMENT_PACK
:
21313 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
21314 is value-dependent. */
21316 tree values
= ARGUMENT_PACK_ARGS (expression
);
21317 int i
, len
= TREE_VEC_LENGTH (values
);
21319 for (i
= 0; i
< len
; ++i
)
21320 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
21328 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
21329 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
21330 || (type2
? dependent_type_p (type2
) : false));
21334 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21335 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
21338 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21339 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
21343 tree op
= TREE_OPERAND (expression
, 0);
21344 return (value_dependent_expression_p (op
)
21345 || has_value_dependent_address (op
));
21350 tree fn
= get_callee_fndecl (expression
);
21352 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
21354 nargs
= call_expr_nargs (expression
);
21355 for (i
= 0; i
< nargs
; ++i
)
21357 tree op
= CALL_EXPR_ARG (expression
, i
);
21358 /* In a call to a constexpr member function, look through the
21359 implicit ADDR_EXPR on the object argument so that it doesn't
21360 cause the call to be considered value-dependent. We also
21361 look through it in potential_constant_expression. */
21362 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
21363 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
21364 && TREE_CODE (op
) == ADDR_EXPR
)
21365 op
= TREE_OPERAND (op
, 0);
21366 if (value_dependent_expression_p (op
))
21372 case TEMPLATE_ID_EXPR
:
21373 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
21375 return type_dependent_expression_p (expression
);
21381 if (dependent_type_p (TREE_TYPE (expression
)))
21383 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
21384 if (value_dependent_expression_p (val
))
21390 /* Treat a GNU statement expression as dependent to avoid crashing
21391 under instantiate_non_dependent_expr; it can't be constant. */
21395 /* A constant expression is value-dependent if any subexpression is
21396 value-dependent. */
21397 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
21399 case tcc_reference
:
21401 case tcc_comparison
:
21403 case tcc_expression
:
21406 int i
, len
= cp_tree_operand_length (expression
);
21408 for (i
= 0; i
< len
; i
++)
21410 tree t
= TREE_OPERAND (expression
, i
);
21412 /* In some cases, some of the operands may be missing.l
21413 (For example, in the case of PREDECREMENT_EXPR, the
21414 amount to increment by may be missing.) That doesn't
21415 make the expression dependent. */
21416 if (t
&& value_dependent_expression_p (t
))
21427 /* The expression is not value-dependent. */
21431 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
21432 [temp.dep.expr]. Note that an expression with no type is
21433 considered dependent. Other parts of the compiler arrange for an
21434 expression with type-dependent subexpressions to have no type, so
21435 this function doesn't have to be fully recursive. */
21438 type_dependent_expression_p (tree expression
)
21440 if (!processing_template_decl
)
21443 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
21446 /* An unresolved name is always dependent. */
21447 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
21450 /* Some expression forms are never type-dependent. */
21451 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
21452 || TREE_CODE (expression
) == SIZEOF_EXPR
21453 || TREE_CODE (expression
) == ALIGNOF_EXPR
21454 || TREE_CODE (expression
) == AT_ENCODE_EXPR
21455 || TREE_CODE (expression
) == NOEXCEPT_EXPR
21456 || TREE_CODE (expression
) == TRAIT_EXPR
21457 || TREE_CODE (expression
) == TYPEID_EXPR
21458 || TREE_CODE (expression
) == DELETE_EXPR
21459 || TREE_CODE (expression
) == VEC_DELETE_EXPR
21460 || TREE_CODE (expression
) == THROW_EXPR
)
21463 /* The types of these expressions depends only on the type to which
21464 the cast occurs. */
21465 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
21466 || TREE_CODE (expression
) == STATIC_CAST_EXPR
21467 || TREE_CODE (expression
) == CONST_CAST_EXPR
21468 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
21469 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
21470 || TREE_CODE (expression
) == CAST_EXPR
)
21471 return dependent_type_p (TREE_TYPE (expression
));
21473 /* The types of these expressions depends only on the type created
21474 by the expression. */
21475 if (TREE_CODE (expression
) == NEW_EXPR
21476 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
21478 /* For NEW_EXPR tree nodes created inside a template, either
21479 the object type itself or a TREE_LIST may appear as the
21481 tree type
= TREE_OPERAND (expression
, 1);
21482 if (TREE_CODE (type
) == TREE_LIST
)
21483 /* This is an array type. We need to check array dimensions
21485 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
21486 || value_dependent_expression_p
21487 (TREE_OPERAND (TREE_VALUE (type
), 1));
21489 return dependent_type_p (type
);
21492 if (TREE_CODE (expression
) == SCOPE_REF
)
21494 tree scope
= TREE_OPERAND (expression
, 0);
21495 tree name
= TREE_OPERAND (expression
, 1);
21497 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
21498 contains an identifier associated by name lookup with one or more
21499 declarations declared with a dependent type, or...a
21500 nested-name-specifier or qualified-id that names a member of an
21501 unknown specialization. */
21502 return (type_dependent_expression_p (name
)
21503 || dependent_scope_p (scope
));
21506 if (TREE_CODE (expression
) == FUNCTION_DECL
21507 && DECL_LANG_SPECIFIC (expression
)
21508 && DECL_TEMPLATE_INFO (expression
)
21509 && (any_dependent_template_arguments_p
21510 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
21513 if (TREE_CODE (expression
) == TEMPLATE_DECL
21514 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
21517 if (TREE_CODE (expression
) == STMT_EXPR
)
21518 expression
= stmt_expr_value_expr (expression
);
21520 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
21525 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
21527 if (type_dependent_expression_p (elt
))
21533 /* A static data member of the current instantiation with incomplete
21534 array type is type-dependent, as the definition and specializations
21535 can have different bounds. */
21536 if (VAR_P (expression
)
21537 && DECL_CLASS_SCOPE_P (expression
)
21538 && dependent_type_p (DECL_CONTEXT (expression
))
21539 && VAR_HAD_UNKNOWN_BOUND (expression
))
21542 /* An array of unknown bound depending on a variadic parameter, eg:
21544 template<typename... Args>
21545 void foo (Args... args)
21547 int arr[] = { args... };
21550 template<int... vals>
21553 int arr[] = { vals... };
21556 If the array has no length and has an initializer, it must be that
21557 we couldn't determine its length in cp_complete_array_type because
21558 it is dependent. */
21559 if (VAR_P (expression
)
21560 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
21561 && !TYPE_DOMAIN (TREE_TYPE (expression
))
21562 && DECL_INITIAL (expression
))
21565 /* A variable template specialization is type-dependent if it has any
21566 dependent template arguments. */
21567 if (VAR_P (expression
)
21568 && DECL_LANG_SPECIFIC (expression
)
21569 && DECL_TEMPLATE_INFO (expression
)
21570 && variable_template_p (DECL_TI_TEMPLATE (expression
)))
21571 return any_dependent_template_arguments_p (DECL_TI_ARGS (expression
));
21573 /* Always dependent, on the number of arguments if nothing else. */
21574 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
21577 if (TREE_TYPE (expression
) == unknown_type_node
)
21579 if (TREE_CODE (expression
) == ADDR_EXPR
)
21580 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
21581 if (TREE_CODE (expression
) == COMPONENT_REF
21582 || TREE_CODE (expression
) == OFFSET_REF
)
21584 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
21586 expression
= TREE_OPERAND (expression
, 1);
21587 if (identifier_p (expression
))
21590 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21591 if (TREE_CODE (expression
) == SCOPE_REF
)
21594 if (BASELINK_P (expression
))
21596 if (BASELINK_OPTYPE (expression
)
21597 && dependent_type_p (BASELINK_OPTYPE (expression
)))
21599 expression
= BASELINK_FUNCTIONS (expression
);
21602 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
21604 if (any_dependent_template_arguments_p
21605 (TREE_OPERAND (expression
, 1)))
21607 expression
= TREE_OPERAND (expression
, 0);
21610 if (variable_template_p (expression
))
21611 return dependent_type_p (TREE_TYPE (expression
));
21613 gcc_assert (TREE_CODE (expression
) == OVERLOAD
21614 || TREE_CODE (expression
) == FUNCTION_DECL
);
21618 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
21620 expression
= OVL_NEXT (expression
);
21625 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
21627 return (dependent_type_p (TREE_TYPE (expression
)));
21630 /* walk_tree callback function for instantiation_dependent_expression_p,
21631 below. Returns non-zero if a dependent subexpression is found. */
21634 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
21639 /* We don't have to worry about decltype currently because decltype
21640 of an instantiation-dependent expr is a dependent type. This
21641 might change depending on the resolution of DR 1172. */
21642 *walk_subtrees
= false;
21645 enum tree_code code
= TREE_CODE (*tp
);
21648 /* Don't treat an argument list as dependent just because it has no
21656 /* A constant with a dependent initializer is dependent. */
21657 if (value_dependent_expression_p (*tp
))
21661 case TEMPLATE_PARM_INDEX
:
21664 /* Handle expressions with type operands. */
21668 case AT_ENCODE_EXPR
:
21670 tree op
= TREE_OPERAND (*tp
, 0);
21671 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
21672 op
= TREE_TYPE (op
);
21675 if (dependent_type_p (op
))
21679 *walk_subtrees
= false;
21687 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21688 || (TRAIT_EXPR_TYPE2 (*tp
)
21689 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21691 *walk_subtrees
= false;
21694 case COMPONENT_REF
:
21695 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21696 /* In a template, finish_class_member_access_expr creates a
21697 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21698 type-dependent, so that we can check access control at
21699 instantiation time (PR 42277). See also Core issue 1273. */
21704 if (instantiation_dependent_scope_ref_p (*tp
))
21709 /* Treat statement-expressions as dependent. */
21717 if (type_dependent_expression_p (*tp
))
21723 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21724 sense defined by the ABI:
21726 "An expression is instantiation-dependent if it is type-dependent
21727 or value-dependent, or it has a subexpression that is type-dependent
21728 or value-dependent." */
21731 instantiation_dependent_expression_p (tree expression
)
21735 if (!processing_template_decl
)
21738 if (expression
== error_mark_node
)
21741 result
= cp_walk_tree_without_duplicates (&expression
,
21742 instantiation_dependent_r
, NULL
);
21743 return result
!= NULL_TREE
;
21746 /* Like type_dependent_expression_p, but it also works while not processing
21747 a template definition, i.e. during substitution or mangling. */
21750 type_dependent_expression_p_push (tree expr
)
21753 ++processing_template_decl
;
21754 b
= type_dependent_expression_p (expr
);
21755 --processing_template_decl
;
21759 /* Returns TRUE if ARGS contains a type-dependent expression. */
21762 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21767 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21769 if (type_dependent_expression_p (arg
))
21775 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21776 expressions) contains any type-dependent expressions. */
21779 any_type_dependent_elements_p (const_tree list
)
21781 for (; list
; list
= TREE_CHAIN (list
))
21782 if (type_dependent_expression_p (TREE_VALUE (list
)))
21788 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21789 expressions) contains any value-dependent expressions. */
21792 any_value_dependent_elements_p (const_tree list
)
21794 for (; list
; list
= TREE_CHAIN (list
))
21795 if (value_dependent_expression_p (TREE_VALUE (list
)))
21801 /* Returns TRUE if the ARG (a template argument) is dependent. */
21804 dependent_template_arg_p (tree arg
)
21806 if (!processing_template_decl
)
21809 /* Assume a template argument that was wrongly written by the user
21810 is dependent. This is consistent with what
21811 any_dependent_template_arguments_p [that calls this function]
21813 if (!arg
|| arg
== error_mark_node
)
21816 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21817 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21819 if (TREE_CODE (arg
) == TEMPLATE_DECL
21820 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21821 return dependent_template_p (arg
);
21822 else if (ARGUMENT_PACK_P (arg
))
21824 tree args
= ARGUMENT_PACK_ARGS (arg
);
21825 int i
, len
= TREE_VEC_LENGTH (args
);
21826 for (i
= 0; i
< len
; ++i
)
21828 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21834 else if (TYPE_P (arg
))
21835 return dependent_type_p (arg
);
21837 return (type_dependent_expression_p (arg
)
21838 || value_dependent_expression_p (arg
));
21841 /* Returns true if ARGS (a collection of template arguments) contains
21842 any types that require structural equality testing. */
21845 any_template_arguments_need_structural_equality_p (tree args
)
21852 if (args
== error_mark_node
)
21855 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21857 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21858 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21860 tree arg
= TREE_VEC_ELT (level
, j
);
21861 tree packed_args
= NULL_TREE
;
21864 if (ARGUMENT_PACK_P (arg
))
21866 /* Look inside the argument pack. */
21867 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21868 len
= TREE_VEC_LENGTH (packed_args
);
21871 for (k
= 0; k
< len
; ++k
)
21874 arg
= TREE_VEC_ELT (packed_args
, k
);
21876 if (error_operand_p (arg
))
21878 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21880 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21882 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21883 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21892 /* Returns true if ARGS (a collection of template arguments) contains
21893 any dependent arguments. */
21896 any_dependent_template_arguments_p (const_tree args
)
21903 if (args
== error_mark_node
)
21906 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21908 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21909 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21910 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21917 /* Returns TRUE if the template TMPL is dependent. */
21920 dependent_template_p (tree tmpl
)
21922 if (TREE_CODE (tmpl
) == OVERLOAD
)
21926 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21928 tmpl
= OVL_NEXT (tmpl
);
21933 /* Template template parameters are dependent. */
21934 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21935 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21937 /* So are names that have not been looked up. */
21938 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21940 /* So are member templates of dependent classes. */
21941 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21942 return dependent_type_p (DECL_CONTEXT (tmpl
));
21946 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21949 dependent_template_id_p (tree tmpl
, tree args
)
21951 return (dependent_template_p (tmpl
)
21952 || any_dependent_template_arguments_p (args
));
21955 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21959 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21963 if (!processing_template_decl
)
21966 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21968 tree decl
= TREE_VEC_ELT (declv
, i
);
21969 tree init
= TREE_VEC_ELT (initv
, i
);
21970 tree cond
= TREE_VEC_ELT (condv
, i
);
21971 tree incr
= TREE_VEC_ELT (incrv
, i
);
21973 if (type_dependent_expression_p (decl
))
21976 if (init
&& type_dependent_expression_p (init
))
21979 if (type_dependent_expression_p (cond
))
21982 if (COMPARISON_CLASS_P (cond
)
21983 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21984 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21987 if (TREE_CODE (incr
) == MODOP_EXPR
)
21989 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21990 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21993 else if (type_dependent_expression_p (incr
))
21995 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21997 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21999 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
22001 tree t
= TREE_OPERAND (incr
, 1);
22002 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
22003 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
22012 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
22013 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
22014 no such TYPE can be found. Note that this function peers inside
22015 uninstantiated templates and therefore should be used only in
22016 extremely limited situations. ONLY_CURRENT_P restricts this
22017 peering to the currently open classes hierarchy (which is required
22018 when comparing types). */
22021 resolve_typename_type (tree type
, bool only_current_p
)
22030 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
22032 scope
= TYPE_CONTEXT (type
);
22033 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
22034 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
22035 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
22036 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
22037 identifier of the TYPENAME_TYPE anymore.
22038 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
22039 TYPENAME_TYPE instead, we avoid messing up with a possible
22040 typedef variant case. */
22041 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
22043 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
22044 it first before we can figure out what NAME refers to. */
22045 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
22047 if (TYPENAME_IS_RESOLVING_P (scope
))
22048 /* Given a class template A with a dependent base with nested type C,
22049 typedef typename A::C::C C will land us here, as trying to resolve
22050 the initial A::C leads to the local C typedef, which leads back to
22051 A::C::C. So we break the recursion now. */
22054 scope
= resolve_typename_type (scope
, only_current_p
);
22056 /* If we don't know what SCOPE refers to, then we cannot resolve the
22058 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
22060 /* If the SCOPE is a template type parameter, we have no way of
22061 resolving the name. */
22062 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
22064 /* If the SCOPE is not the current instantiation, there's no reason
22065 to look inside it. */
22066 if (only_current_p
&& !currently_open_class (scope
))
22068 /* If this is a typedef, we don't want to look inside (c++/11987). */
22069 if (typedef_variant_p (type
))
22071 /* If SCOPE isn't the template itself, it will not have a valid
22072 TYPE_FIELDS list. */
22073 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
22074 /* scope is either the template itself or a compatible instantiation
22075 like X<T>, so look up the name in the original template. */
22076 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
22078 /* scope is a partial instantiation, so we can't do the lookup or we
22079 will lose the template arguments. */
22081 /* Enter the SCOPE so that name lookup will be resolved as if we
22082 were in the class definition. In particular, SCOPE will no
22083 longer be considered a dependent type. */
22084 pushed_scope
= push_scope (scope
);
22085 /* Look up the declaration. */
22086 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
22087 tf_warning_or_error
);
22089 result
= NULL_TREE
;
22091 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
22092 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
22095 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
22096 && TREE_CODE (decl
) == TYPE_DECL
)
22098 result
= TREE_TYPE (decl
);
22099 if (result
== error_mark_node
)
22100 result
= NULL_TREE
;
22102 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
22103 && DECL_CLASS_TEMPLATE_P (decl
))
22107 /* Obtain the template and the arguments. */
22108 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
22109 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
22110 /* Instantiate the template. */
22111 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
22112 /*entering_scope=*/0,
22113 tf_error
| tf_user
);
22114 if (result
== error_mark_node
)
22115 result
= NULL_TREE
;
22118 /* Leave the SCOPE. */
22120 pop_scope (pushed_scope
);
22122 /* If we failed to resolve it, return the original typename. */
22126 /* If lookup found a typename type, resolve that too. */
22127 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
22129 /* Ill-formed programs can cause infinite recursion here, so we
22130 must catch that. */
22131 TYPENAME_IS_RESOLVING_P (type
) = 1;
22132 result
= resolve_typename_type (result
, only_current_p
);
22133 TYPENAME_IS_RESOLVING_P (type
) = 0;
22136 /* Qualify the resulting type. */
22137 quals
= cp_type_quals (type
);
22139 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
22144 /* EXPR is an expression which is not type-dependent. Return a proxy
22145 for EXPR that can be used to compute the types of larger
22146 expressions containing EXPR. */
22149 build_non_dependent_expr (tree expr
)
22153 #ifdef ENABLE_CHECKING
22154 /* Try to get a constant value for all non-dependent expressions in
22155 order to expose bugs in *_dependent_expression_p and constexpr. */
22156 if (cxx_dialect
>= cxx11
)
22157 fold_non_dependent_expr (expr
);
22160 /* Preserve OVERLOADs; the functions must be available to resolve
22163 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
22164 inner_expr
= stmt_expr_value_expr (inner_expr
);
22165 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
22166 inner_expr
= TREE_OPERAND (inner_expr
, 0);
22167 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
22168 inner_expr
= TREE_OPERAND (inner_expr
, 1);
22169 if (is_overloaded_fn (inner_expr
)
22170 || TREE_CODE (inner_expr
) == OFFSET_REF
)
22172 /* There is no need to return a proxy for a variable. */
22175 /* Preserve string constants; conversions from string constants to
22176 "char *" are allowed, even though normally a "const char *"
22177 cannot be used to initialize a "char *". */
22178 if (TREE_CODE (expr
) == STRING_CST
)
22180 /* Preserve void and arithmetic constants, as an optimization -- there is no
22181 reason to create a new node. */
22182 if (TREE_CODE (expr
) == VOID_CST
22183 || TREE_CODE (expr
) == INTEGER_CST
22184 || TREE_CODE (expr
) == REAL_CST
)
22186 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
22187 There is at least one place where we want to know that a
22188 particular expression is a throw-expression: when checking a ?:
22189 expression, there are special rules if the second or third
22190 argument is a throw-expression. */
22191 if (TREE_CODE (expr
) == THROW_EXPR
)
22194 /* Don't wrap an initializer list, we need to be able to look inside. */
22195 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
22198 /* Don't wrap a dummy object, we need to be able to test for it. */
22199 if (is_dummy_object (expr
))
22202 if (TREE_CODE (expr
) == COND_EXPR
)
22203 return build3 (COND_EXPR
,
22205 TREE_OPERAND (expr
, 0),
22206 (TREE_OPERAND (expr
, 1)
22207 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
22208 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
22209 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
22210 if (TREE_CODE (expr
) == COMPOUND_EXPR
22211 && !COMPOUND_EXPR_OVERLOADED (expr
))
22212 return build2 (COMPOUND_EXPR
,
22214 TREE_OPERAND (expr
, 0),
22215 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
22217 /* If the type is unknown, it can't really be non-dependent */
22218 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
22220 /* Otherwise, build a NON_DEPENDENT_EXPR. */
22221 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
22224 /* ARGS is a vector of expressions as arguments to a function call.
22225 Replace the arguments with equivalent non-dependent expressions.
22226 This modifies ARGS in place. */
22229 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
22234 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
22236 tree newarg
= build_non_dependent_expr (arg
);
22238 (*args
)[ix
] = newarg
;
22242 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
22243 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
22247 make_auto_1 (tree name
)
22249 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
22250 TYPE_NAME (au
) = build_decl (input_location
,
22251 TYPE_DECL
, name
, au
);
22252 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
22253 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
22254 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
22255 TYPE_NAME (au
), NULL_TREE
);
22256 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
22257 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
22258 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
22264 make_decltype_auto (void)
22266 return make_auto_1 (get_identifier ("decltype(auto)"));
22272 return make_auto_1 (get_identifier ("auto"));
22275 /* Given type ARG, return std::initializer_list<ARG>. */
22280 tree std_init_list
= namespace_binding
22281 (get_identifier ("initializer_list"), std_node
);
22283 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
22285 error ("deducing from brace-enclosed initializer list requires "
22286 "#include <initializer_list>");
22287 return error_mark_node
;
22289 argvec
= make_tree_vec (1);
22290 TREE_VEC_ELT (argvec
, 0) = arg
;
22291 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
22292 NULL_TREE
, 0, tf_warning_or_error
);
22295 /* Replace auto in TYPE with std::initializer_list<auto>. */
22298 listify_autos (tree type
, tree auto_node
)
22300 tree init_auto
= listify (auto_node
);
22301 tree argvec
= make_tree_vec (1);
22302 TREE_VEC_ELT (argvec
, 0) = init_auto
;
22303 if (processing_template_decl
)
22304 argvec
= add_to_template_args (current_template_args (), argvec
);
22305 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22308 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
22309 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
22312 do_auto_deduction (tree type
, tree init
, tree auto_node
)
22316 if (init
== error_mark_node
)
22317 return error_mark_node
;
22319 if (type_dependent_expression_p (init
))
22320 /* Defining a subset of type-dependent expressions that we can deduce
22321 from ahead of time isn't worth the trouble. */
22324 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
22325 with either a new invented type template parameter U or, if the
22326 initializer is a braced-init-list (8.5.4), with
22327 std::initializer_list<U>. */
22328 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
22330 if (!DIRECT_LIST_INIT_P (init
))
22331 type
= listify_autos (type
, auto_node
);
22332 else if (CONSTRUCTOR_NELTS (init
) == 1)
22333 init
= CONSTRUCTOR_ELT (init
, 0)->value
;
22336 if (permerror (input_location
, "direct-list-initialization of "
22337 "%<auto%> requires exactly one element"))
22338 inform (input_location
,
22339 "for deduction to %<std::initializer_list%>, use copy-"
22340 "list-initialization (i.e. add %<=%> before the %<{%>)");
22341 type
= listify_autos (type
, auto_node
);
22345 init
= resolve_nondeduced_context (init
);
22347 targs
= make_tree_vec (1);
22348 if (AUTO_IS_DECLTYPE (auto_node
))
22350 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
22351 && !REF_PARENTHESIZED_P (init
)));
22352 TREE_VEC_ELT (targs
, 0)
22353 = finish_decltype_type (init
, id
, tf_warning_or_error
);
22354 if (type
!= auto_node
)
22356 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
22357 return error_mark_node
;
22362 tree parms
= build_tree_list (NULL_TREE
, type
);
22363 tree tparms
= make_tree_vec (1);
22366 TREE_VEC_ELT (tparms
, 0)
22367 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
22368 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
22369 DEDUCE_CALL
, LOOKUP_NORMAL
,
22370 NULL
, /*explain_p=*/false);
22373 if (processing_template_decl
)
22374 /* Try again at instantiation time. */
22376 if (type
&& type
!= error_mark_node
)
22377 /* If type is error_mark_node a diagnostic must have been
22378 emitted by now. Also, having a mention to '<type error>'
22379 in the diagnostic is not really useful to the user. */
22381 if (cfun
&& auto_node
== current_function_auto_return_pattern
22382 && LAMBDA_FUNCTION_P (current_function_decl
))
22383 error ("unable to deduce lambda return type from %qE", init
);
22385 error ("unable to deduce %qT from %qE", type
, init
);
22387 return error_mark_node
;
22391 /* If the list of declarators contains more than one declarator, the type
22392 of each declared variable is determined as described above. If the
22393 type deduced for the template parameter U is not the same in each
22394 deduction, the program is ill-formed. */
22395 if (TREE_TYPE (auto_node
)
22396 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
22398 if (cfun
&& auto_node
== current_function_auto_return_pattern
22399 && LAMBDA_FUNCTION_P (current_function_decl
))
22400 error ("inconsistent types %qT and %qT deduced for "
22401 "lambda return type", TREE_TYPE (auto_node
),
22402 TREE_VEC_ELT (targs
, 0));
22404 error ("inconsistent deduction for %qT: %qT and then %qT",
22405 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
22406 return error_mark_node
;
22408 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
22410 if (processing_template_decl
)
22411 targs
= add_to_template_args (current_template_args (), targs
);
22412 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
22415 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
22419 splice_late_return_type (tree type
, tree late_return_type
)
22423 if (late_return_type
== NULL_TREE
)
22425 argvec
= make_tree_vec (1);
22426 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
22427 if (processing_template_parmlist
)
22428 /* For a late-specified return type in a template type-parameter, we
22429 need to add a dummy argument level for its parmlist. */
22430 argvec
= add_to_template_args
22431 (make_tree_vec (processing_template_parmlist
), argvec
);
22432 if (current_template_parms
)
22433 argvec
= add_to_template_args (current_template_args (), argvec
);
22434 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
22437 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
22438 'decltype(auto)'. */
22441 is_auto (const_tree type
)
22443 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
22444 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
22445 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
22451 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
22452 a use of `auto'. Returns NULL_TREE otherwise. */
22455 type_uses_auto (tree type
)
22457 return find_type_usage (type
, is_auto
);
22460 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
22461 'decltype(auto)' or a concept. */
22464 is_auto_or_concept (const_tree type
)
22466 return is_auto (type
); // or concept
22469 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
22470 a concept identifier) iff TYPE contains a use of a generic type. Returns
22471 NULL_TREE otherwise. */
22474 type_uses_auto_or_concept (tree type
)
22476 return find_type_usage (type
, is_auto_or_concept
);
22480 /* For a given template T, return the vector of typedefs referenced
22481 in T for which access check is needed at T instantiation time.
22482 T is either a FUNCTION_DECL or a RECORD_TYPE.
22483 Those typedefs were added to T by the function
22484 append_type_to_template_for_access_check. */
22486 vec
<qualified_typedef_usage_t
, va_gc
> *
22487 get_types_needing_access_check (tree t
)
22490 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
22492 if (!t
|| t
== error_mark_node
)
22495 if (!(ti
= get_template_info (t
)))
22498 if (CLASS_TYPE_P (t
)
22499 || TREE_CODE (t
) == FUNCTION_DECL
)
22501 if (!TI_TEMPLATE (ti
))
22504 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
22510 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
22511 tied to T. That list of typedefs will be access checked at
22512 T instantiation time.
22513 T is either a FUNCTION_DECL or a RECORD_TYPE.
22514 TYPE_DECL is a TYPE_DECL node representing a typedef.
22515 SCOPE is the scope through which TYPE_DECL is accessed.
22516 LOCATION is the location of the usage point of TYPE_DECL.
22518 This function is a subroutine of
22519 append_type_to_template_for_access_check. */
22522 append_type_to_template_for_access_check_1 (tree t
,
22525 location_t location
)
22527 qualified_typedef_usage_t typedef_usage
;
22530 if (!t
|| t
== error_mark_node
)
22533 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
22534 || CLASS_TYPE_P (t
))
22536 && TREE_CODE (type_decl
) == TYPE_DECL
22539 if (!(ti
= get_template_info (t
)))
22542 gcc_assert (TI_TEMPLATE (ti
));
22544 typedef_usage
.typedef_decl
= type_decl
;
22545 typedef_usage
.context
= scope
;
22546 typedef_usage
.locus
= location
;
22548 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
22551 /* Append TYPE_DECL to the template TEMPL.
22552 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
22553 At TEMPL instanciation time, TYPE_DECL will be checked to see
22554 if it can be accessed through SCOPE.
22555 LOCATION is the location of the usage point of TYPE_DECL.
22557 e.g. consider the following code snippet:
22564 template<class U> struct S
22566 C::myint mi; // <-- usage point of the typedef C::myint
22571 At S<char> instantiation time, we need to check the access of C::myint
22572 In other words, we need to check the access of the myint typedef through
22573 the C scope. For that purpose, this function will add the myint typedef
22574 and the scope C through which its being accessed to a list of typedefs
22575 tied to the template S. That list will be walked at template instantiation
22576 time and access check performed on each typedefs it contains.
22577 Note that this particular code snippet should yield an error because
22578 myint is private to C. */
22581 append_type_to_template_for_access_check (tree templ
,
22584 location_t location
)
22586 qualified_typedef_usage_t
*iter
;
22589 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
22591 /* Make sure we don't append the type to the template twice. */
22592 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
22593 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
22596 append_type_to_template_for_access_check_1 (templ
, type_decl
,
22600 /* Convert the generic type parameters in PARM that match the types given in the
22601 range [START_IDX, END_IDX) from the current_template_parms into generic type
22605 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
22607 tree current
= current_template_parms
;
22608 int depth
= TMPL_PARMS_DEPTH (current
);
22609 current
= INNERMOST_TEMPLATE_PARMS (current
);
22610 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
22612 for (int i
= 0; i
< start_idx
; ++i
)
22613 TREE_VEC_ELT (replacement
, i
)
22614 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22616 for (int i
= start_idx
; i
< end_idx
; ++i
)
22618 /* Create a distinct parameter pack type from the current parm and add it
22619 to the replacement args to tsubst below into the generic function
22622 tree o
= TREE_TYPE (TREE_VALUE
22623 (TREE_VEC_ELT (current
, i
)));
22624 tree t
= copy_type (o
);
22625 TEMPLATE_TYPE_PARM_INDEX (t
)
22626 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
22628 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
22629 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
22630 TYPE_MAIN_VARIANT (t
) = t
;
22631 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
22632 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
22633 TREE_VEC_ELT (replacement
, i
) = t
;
22634 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
22637 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
22638 TREE_VEC_ELT (replacement
, i
)
22639 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22641 /* If there are more levels then build up the replacement with the outer
22644 replacement
= add_to_template_args (template_parms_to_args
22645 (TREE_CHAIN (current_template_parms
)),
22648 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
22652 /* Set up the hash tables for template instantiations. */
22655 init_template_processing (void)
22657 decl_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
22658 type_specializations
= hash_table
<spec_hasher
>::create_ggc (37);
22661 /* Print stats about the template hash tables for -fstats. */
22664 print_template_statistics (void)
22666 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
22667 "%f collisions\n", (long) decl_specializations
->size (),
22668 (long) decl_specializations
->elements (),
22669 decl_specializations
->collisions ());
22670 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
22671 "%f collisions\n", (long) type_specializations
->size (),
22672 (long) type_specializations
->elements (),
22673 type_specializations
->collisions ());
22676 #include "gt-cp-pt.h"