1 /* Handle parameterized types (templates) for GNU -*- C++ -*-.
2 Copyright (C) 1992-2014 Free Software Foundation, Inc.
3 Written by Ken Raeburn (raeburn@cygnus.com) while at Watchmaker Computing.
4 Rewritten by Jason Merrill (jason@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Known bugs or deficiencies include:
24 all methods must be provided in header files; can't use a source
25 file that contains only the method templates and "just win". */
29 #include "coretypes.h"
32 #include "stringpool.h"
35 #include "stor-layout.h"
37 #include "pointer-set.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 typedef struct GTY(()) spec_entry
91 static GTY ((param_is (spec_entry
)))
92 htab_t decl_specializations
;
94 static GTY ((param_is (spec_entry
)))
95 htab_t type_specializations
;
97 /* Contains canonical template parameter types. The vector is indexed by
98 the TEMPLATE_TYPE_IDX of the template parameter. Each element is a
99 TREE_LIST, whose TREE_VALUEs contain the canonical template
100 parameters of various types and levels. */
101 static GTY(()) vec
<tree
, va_gc
> *canonical_template_parms
;
103 #define UNIFY_ALLOW_NONE 0
104 #define UNIFY_ALLOW_MORE_CV_QUAL 1
105 #define UNIFY_ALLOW_LESS_CV_QUAL 2
106 #define UNIFY_ALLOW_DERIVED 4
107 #define UNIFY_ALLOW_INTEGER 8
108 #define UNIFY_ALLOW_OUTER_LEVEL 16
109 #define UNIFY_ALLOW_OUTER_MORE_CV_QUAL 32
110 #define UNIFY_ALLOW_OUTER_LESS_CV_QUAL 64
112 enum template_base_result
{
114 tbr_ambiguous_baseclass
,
118 static void push_access_scope (tree
);
119 static void pop_access_scope (tree
);
120 static bool resolve_overloaded_unification (tree
, tree
, tree
, tree
,
121 unification_kind_t
, int,
123 static int try_one_overload (tree
, tree
, tree
, tree
, tree
,
124 unification_kind_t
, int, bool, bool);
125 static int unify (tree
, tree
, tree
, tree
, int, bool);
126 static void add_pending_template (tree
);
127 static tree
reopen_tinst_level (struct tinst_level
*);
128 static tree
tsubst_initializer_list (tree
, tree
);
129 static tree
get_class_bindings (tree
, tree
, tree
, tree
);
130 static tree
coerce_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
132 static tree
coerce_innermost_template_parms (tree
, tree
, tree
, tsubst_flags_t
,
134 static void tsubst_enum (tree
, tree
, tree
);
135 static tree
add_to_template_args (tree
, tree
);
136 static tree
add_outermost_template_args (tree
, tree
);
137 static bool check_instantiated_args (tree
, tree
, tsubst_flags_t
);
138 static int maybe_adjust_types_for_deduction (unification_kind_t
, tree
*, tree
*,
140 static int type_unification_real (tree
, tree
, tree
, const tree
*,
141 unsigned int, int, unification_kind_t
, int,
142 vec
<deferred_access_check
, va_gc
> **,
144 static void note_template_header (int);
145 static tree
convert_nontype_argument_function (tree
, tree
);
146 static tree
convert_nontype_argument (tree
, tree
, tsubst_flags_t
);
147 static tree
convert_template_argument (tree
, tree
, tree
,
148 tsubst_flags_t
, int, tree
);
149 static int for_each_template_parm (tree
, tree_fn_t
, void*,
150 struct pointer_set_t
*, bool);
151 static tree
expand_template_argument_pack (tree
);
152 static tree
build_template_parm_index (int, int, int, tree
, tree
);
153 static bool inline_needs_template_parms (tree
, bool);
154 static void push_inline_template_parms_recursive (tree
, int);
155 static tree
retrieve_local_specialization (tree
);
156 static void register_local_specialization (tree
, tree
);
157 static hashval_t
hash_specialization (const void *p
);
158 static tree
reduce_template_parm_level (tree
, tree
, int, tree
, tsubst_flags_t
);
159 static int mark_template_parm (tree
, void *);
160 static int template_parm_this_level_p (tree
, void *);
161 static tree
tsubst_friend_function (tree
, tree
);
162 static tree
tsubst_friend_class (tree
, tree
);
163 static int can_complete_type_without_circularity (tree
);
164 static tree
get_bindings (tree
, tree
, tree
, bool);
165 static int template_decl_level (tree
);
166 static int check_cv_quals_for_unify (int, tree
, tree
);
167 static void template_parm_level_and_index (tree
, int*, int*);
168 static int unify_pack_expansion (tree
, tree
, tree
,
169 tree
, unification_kind_t
, bool, bool);
170 static tree
tsubst_template_arg (tree
, tree
, tsubst_flags_t
, tree
);
171 static tree
tsubst_template_args (tree
, tree
, tsubst_flags_t
, tree
);
172 static tree
tsubst_template_parms (tree
, tree
, tsubst_flags_t
);
173 static void regenerate_decl_from_template (tree
, tree
);
174 static tree
most_specialized_class (tree
, tsubst_flags_t
);
175 static tree
tsubst_aggr_type (tree
, tree
, tsubst_flags_t
, tree
, int);
176 static tree
tsubst_arg_types (tree
, tree
, tree
, tsubst_flags_t
, tree
);
177 static tree
tsubst_function_type (tree
, tree
, tsubst_flags_t
, tree
);
178 static bool check_specialization_scope (void);
179 static tree
process_partial_specialization (tree
);
180 static void set_current_access_from_decl (tree
);
181 static enum template_base_result
get_template_base (tree
, tree
, tree
, tree
,
183 static tree
try_class_unification (tree
, tree
, tree
, tree
, bool);
184 static int coerce_template_template_parms (tree
, tree
, tsubst_flags_t
,
186 static bool template_template_parm_bindings_ok_p (tree
, tree
);
187 static int template_args_equal (tree
, tree
);
188 static void tsubst_default_arguments (tree
, tsubst_flags_t
);
189 static tree
for_each_template_parm_r (tree
*, int *, void *);
190 static tree
copy_default_args_to_explicit_spec_1 (tree
, tree
);
191 static void copy_default_args_to_explicit_spec (tree
);
192 static int invalid_nontype_parm_type_p (tree
, tsubst_flags_t
);
193 static bool dependent_template_arg_p (tree
);
194 static bool any_template_arguments_need_structural_equality_p (tree
);
195 static bool dependent_type_p_r (tree
);
196 static tree
tsubst_expr (tree
, tree
, tsubst_flags_t
, tree
, bool);
197 static tree
tsubst_copy (tree
, tree
, tsubst_flags_t
, tree
);
198 static tree
tsubst_pack_expansion (tree
, tree
, tsubst_flags_t
, tree
);
199 static tree
tsubst_decl (tree
, tree
, tsubst_flags_t
);
200 static void perform_typedefs_access_check (tree tmpl
, tree targs
);
201 static void append_type_to_template_for_access_check_1 (tree
, tree
, tree
,
203 static tree
listify (tree
);
204 static tree
listify_autos (tree
, tree
);
205 static tree
template_parm_to_arg (tree t
);
206 static tree
current_template_args (void);
207 static tree
tsubst_template_parm (tree
, tree
, tsubst_flags_t
);
208 static tree
instantiate_alias_template (tree
, tree
, tsubst_flags_t
);
210 /* Make the current scope suitable for access checking when we are
211 processing T. T can be FUNCTION_DECL for instantiated function
212 template, VAR_DECL for static member variable, or TYPE_DECL for
213 alias template (needed by instantiate_decl). */
216 push_access_scope (tree t
)
218 gcc_assert (VAR_OR_FUNCTION_DECL_P (t
)
219 || TREE_CODE (t
) == TYPE_DECL
);
221 if (DECL_FRIEND_CONTEXT (t
))
222 push_nested_class (DECL_FRIEND_CONTEXT (t
));
223 else if (DECL_CLASS_SCOPE_P (t
))
224 push_nested_class (DECL_CONTEXT (t
));
226 push_to_top_level ();
228 if (TREE_CODE (t
) == FUNCTION_DECL
)
230 saved_access_scope
= tree_cons
231 (NULL_TREE
, current_function_decl
, saved_access_scope
);
232 current_function_decl
= t
;
236 /* Restore the scope set up by push_access_scope. T is the node we
240 pop_access_scope (tree t
)
242 if (TREE_CODE (t
) == FUNCTION_DECL
)
244 current_function_decl
= TREE_VALUE (saved_access_scope
);
245 saved_access_scope
= TREE_CHAIN (saved_access_scope
);
248 if (DECL_FRIEND_CONTEXT (t
) || DECL_CLASS_SCOPE_P (t
))
251 pop_from_top_level ();
254 /* Do any processing required when DECL (a member template
255 declaration) is finished. Returns the TEMPLATE_DECL corresponding
256 to DECL, unless it is a specialization, in which case the DECL
257 itself is returned. */
260 finish_member_template_decl (tree decl
)
262 if (decl
== error_mark_node
)
263 return error_mark_node
;
265 gcc_assert (DECL_P (decl
));
267 if (TREE_CODE (decl
) == TYPE_DECL
)
271 type
= TREE_TYPE (decl
);
272 if (type
== error_mark_node
)
273 return error_mark_node
;
274 if (MAYBE_CLASS_TYPE_P (type
)
275 && CLASSTYPE_TEMPLATE_INFO (type
)
276 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
278 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
279 check_member_template (tmpl
);
284 else if (TREE_CODE (decl
) == FIELD_DECL
)
285 error ("data member %qD cannot be a member template", decl
);
286 else if (DECL_TEMPLATE_INFO (decl
))
288 if (!DECL_TEMPLATE_SPECIALIZATION (decl
))
290 check_member_template (DECL_TI_TEMPLATE (decl
));
291 return DECL_TI_TEMPLATE (decl
);
297 error ("invalid member template declaration %qD", decl
);
299 return error_mark_node
;
302 /* Create a template info node. */
305 build_template_info (tree template_decl
, tree template_args
)
307 tree result
= make_node (TEMPLATE_INFO
);
308 TI_TEMPLATE (result
) = template_decl
;
309 TI_ARGS (result
) = template_args
;
313 /* Return the template info node corresponding to T, whatever T is. */
316 get_template_info (const_tree t
)
318 tree tinfo
= NULL_TREE
;
320 if (!t
|| t
== error_mark_node
)
323 if (TREE_CODE (t
) == NAMESPACE_DECL
)
326 if (DECL_P (t
) && DECL_LANG_SPECIFIC (t
))
327 tinfo
= DECL_TEMPLATE_INFO (t
);
329 if (!tinfo
&& DECL_IMPLICIT_TYPEDEF_P (t
))
332 if (OVERLOAD_TYPE_P (t
))
333 tinfo
= TYPE_TEMPLATE_INFO (t
);
334 else if (TREE_CODE (t
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
335 tinfo
= TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (t
);
340 /* Returns the template nesting level of the indicated class TYPE.
350 A<T>::B<U> has depth two, while A<T> has depth one.
351 Both A<T>::B<int> and A<int>::B<U> have depth one, if
352 they are instantiations, not specializations.
354 This function is guaranteed to return 0 if passed NULL_TREE so
355 that, for example, `template_class_depth (current_class_type)' is
359 template_class_depth (tree type
)
364 type
&& TREE_CODE (type
) != NAMESPACE_DECL
;
365 type
= (TREE_CODE (type
) == FUNCTION_DECL
)
366 ? CP_DECL_CONTEXT (type
) : CP_TYPE_CONTEXT (type
))
368 tree tinfo
= get_template_info (type
);
370 if (tinfo
&& PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo
))
371 && uses_template_parms (INNERMOST_TEMPLATE_ARGS (TI_ARGS (tinfo
))))
378 /* Subroutine of maybe_begin_member_template_processing.
379 Returns true if processing DECL needs us to push template parms. */
382 inline_needs_template_parms (tree decl
, bool nsdmi
)
384 if (!decl
|| (!nsdmi
&& ! DECL_TEMPLATE_INFO (decl
)))
387 return (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (most_general_template (decl
)))
388 > (processing_template_decl
+ DECL_TEMPLATE_SPECIALIZATION (decl
)));
391 /* Subroutine of maybe_begin_member_template_processing.
392 Push the template parms in PARMS, starting from LEVELS steps into the
393 chain, and ending at the beginning, since template parms are listed
397 push_inline_template_parms_recursive (tree parmlist
, int levels
)
399 tree parms
= TREE_VALUE (parmlist
);
403 push_inline_template_parms_recursive (TREE_CHAIN (parmlist
), levels
- 1);
405 ++processing_template_decl
;
406 current_template_parms
407 = tree_cons (size_int (processing_template_decl
),
408 parms
, current_template_parms
);
409 TEMPLATE_PARMS_FOR_INLINE (current_template_parms
) = 1;
411 begin_scope (TREE_VEC_LENGTH (parms
) ? sk_template_parms
: sk_template_spec
,
413 for (i
= 0; i
< TREE_VEC_LENGTH (parms
); ++i
)
415 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
417 if (error_operand_p (parm
))
420 gcc_assert (DECL_P (parm
));
422 switch (TREE_CODE (parm
))
431 /* Make a CONST_DECL as is done in process_template_parm.
432 It is ugly that we recreate this here; the original
433 version built in process_template_parm is no longer
435 tree decl
= build_decl (DECL_SOURCE_LOCATION (parm
),
436 CONST_DECL
, DECL_NAME (parm
),
438 DECL_ARTIFICIAL (decl
) = 1;
439 TREE_CONSTANT (decl
) = 1;
440 TREE_READONLY (decl
) = 1;
441 DECL_INITIAL (decl
) = DECL_INITIAL (parm
);
442 SET_DECL_TEMPLATE_PARM_P (decl
);
453 /* Restore the template parameter context for a member template, a
454 friend template defined in a class definition, or a non-template
455 member of template class. */
458 maybe_begin_member_template_processing (tree decl
)
462 bool nsdmi
= TREE_CODE (decl
) == FIELD_DECL
;
466 tree ctx
= DECL_CONTEXT (decl
);
467 decl
= (CLASSTYPE_TEMPLATE_INFO (ctx
)
468 /* Disregard full specializations (c++/60999). */
469 && uses_template_parms (ctx
)
470 ? CLASSTYPE_TI_TEMPLATE (ctx
) : NULL_TREE
);
473 if (inline_needs_template_parms (decl
, nsdmi
))
475 parms
= DECL_TEMPLATE_PARMS (most_general_template (decl
));
476 levels
= TMPL_PARMS_DEPTH (parms
) - processing_template_decl
;
478 if (DECL_TEMPLATE_SPECIALIZATION (decl
))
481 parms
= TREE_CHAIN (parms
);
484 push_inline_template_parms_recursive (parms
, levels
);
487 /* Remember how many levels of template parameters we pushed so that
488 we can pop them later. */
489 inline_parm_levels
.safe_push (levels
);
492 /* Undo the effects of maybe_begin_member_template_processing. */
495 maybe_end_member_template_processing (void)
500 if (inline_parm_levels
.length () == 0)
503 last
= inline_parm_levels
.pop ();
504 for (i
= 0; i
< last
; ++i
)
506 --processing_template_decl
;
507 current_template_parms
= TREE_CHAIN (current_template_parms
);
512 /* Return a new template argument vector which contains all of ARGS,
513 but has as its innermost set of arguments the EXTRA_ARGS. */
516 add_to_template_args (tree args
, tree extra_args
)
523 if (args
== NULL_TREE
|| extra_args
== error_mark_node
)
526 extra_depth
= TMPL_ARGS_DEPTH (extra_args
);
527 new_args
= make_tree_vec (TMPL_ARGS_DEPTH (args
) + extra_depth
);
529 for (i
= 1; i
<= TMPL_ARGS_DEPTH (args
); ++i
)
530 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (args
, i
));
532 for (j
= 1; j
<= extra_depth
; ++j
, ++i
)
533 SET_TMPL_ARGS_LEVEL (new_args
, i
, TMPL_ARGS_LEVEL (extra_args
, j
));
538 /* Like add_to_template_args, but only the outermost ARGS are added to
539 the EXTRA_ARGS. In particular, all but TMPL_ARGS_DEPTH
540 (EXTRA_ARGS) levels are added. This function is used to combine
541 the template arguments from a partial instantiation with the
542 template arguments used to attain the full instantiation from the
543 partial instantiation. */
546 add_outermost_template_args (tree args
, tree extra_args
)
550 /* If there are more levels of EXTRA_ARGS than there are ARGS,
551 something very fishy is going on. */
552 gcc_assert (TMPL_ARGS_DEPTH (args
) >= TMPL_ARGS_DEPTH (extra_args
));
554 /* If *all* the new arguments will be the EXTRA_ARGS, just return
556 if (TMPL_ARGS_DEPTH (args
) == TMPL_ARGS_DEPTH (extra_args
))
559 /* For the moment, we make ARGS look like it contains fewer levels. */
560 TREE_VEC_LENGTH (args
) -= TMPL_ARGS_DEPTH (extra_args
);
562 new_args
= add_to_template_args (args
, extra_args
);
564 /* Now, we restore ARGS to its full dimensions. */
565 TREE_VEC_LENGTH (args
) += TMPL_ARGS_DEPTH (extra_args
);
570 /* Return the N levels of innermost template arguments from the ARGS. */
573 get_innermost_template_args (tree args
, int n
)
581 /* If N is 1, just return the innermost set of template arguments. */
583 return TMPL_ARGS_LEVEL (args
, TMPL_ARGS_DEPTH (args
));
585 /* If we're not removing anything, just return the arguments we were
587 extra_levels
= TMPL_ARGS_DEPTH (args
) - n
;
588 gcc_assert (extra_levels
>= 0);
589 if (extra_levels
== 0)
592 /* Make a new set of arguments, not containing the outer arguments. */
593 new_args
= make_tree_vec (n
);
594 for (i
= 1; i
<= n
; ++i
)
595 SET_TMPL_ARGS_LEVEL (new_args
, i
,
596 TMPL_ARGS_LEVEL (args
, i
+ extra_levels
));
601 /* The inverse of get_innermost_template_args: Return all but the innermost
602 EXTRA_LEVELS levels of template arguments from the ARGS. */
605 strip_innermost_template_args (tree args
, int extra_levels
)
608 int n
= TMPL_ARGS_DEPTH (args
) - extra_levels
;
613 /* If N is 1, just return the outermost set of template arguments. */
615 return TMPL_ARGS_LEVEL (args
, 1);
617 /* If we're not removing anything, just return the arguments we were
619 gcc_assert (extra_levels
>= 0);
620 if (extra_levels
== 0)
623 /* Make a new set of arguments, not containing the inner arguments. */
624 new_args
= make_tree_vec (n
);
625 for (i
= 1; i
<= n
; ++i
)
626 SET_TMPL_ARGS_LEVEL (new_args
, i
,
627 TMPL_ARGS_LEVEL (args
, i
));
632 /* We've got a template header coming up; push to a new level for storing
636 begin_template_parm_list (void)
638 /* We use a non-tag-transparent scope here, which causes pushtag to
639 put tags in this scope, rather than in the enclosing class or
640 namespace scope. This is the right thing, since we want
641 TEMPLATE_DECLS, and not TYPE_DECLS for template classes. For a
642 global template class, push_template_decl handles putting the
643 TEMPLATE_DECL into top-level scope. For a nested template class,
646 template <class T> struct S1 {
647 template <class T> struct S2 {};
650 pushtag contains special code to call pushdecl_with_scope on the
651 TEMPLATE_DECL for S2. */
652 begin_scope (sk_template_parms
, NULL
);
653 ++processing_template_decl
;
654 ++processing_template_parmlist
;
655 note_template_header (0);
658 /* This routine is called when a specialization is declared. If it is
659 invalid to declare a specialization here, an error is reported and
660 false is returned, otherwise this routine will return true. */
663 check_specialization_scope (void)
665 tree scope
= current_scope ();
669 An explicit specialization shall be declared in the namespace of
670 which the template is a member, or, for member templates, in the
671 namespace of which the enclosing class or enclosing class
672 template is a member. An explicit specialization of a member
673 function, member class or static data member of a class template
674 shall be declared in the namespace of which the class template
676 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
)
678 error ("explicit specialization in non-namespace scope %qD", scope
);
684 In an explicit specialization declaration for a member of a class
685 template or a member template that appears in namespace scope,
686 the member template and some of its enclosing class templates may
687 remain unspecialized, except that the declaration shall not
688 explicitly specialize a class member template if its enclosing
689 class templates are not explicitly specialized as well. */
690 if (current_template_parms
)
692 error ("enclosing class templates are not explicitly specialized");
699 /* We've just seen template <>. */
702 begin_specialization (void)
704 begin_scope (sk_template_spec
, NULL
);
705 note_template_header (1);
706 return check_specialization_scope ();
709 /* Called at then end of processing a declaration preceded by
713 end_specialization (void)
716 reset_specialization ();
719 /* Any template <>'s that we have seen thus far are not referring to a
720 function specialization. */
723 reset_specialization (void)
725 processing_specialization
= 0;
726 template_header_count
= 0;
729 /* We've just seen a template header. If SPECIALIZATION is nonzero,
730 it was of the form template <>. */
733 note_template_header (int specialization
)
735 processing_specialization
= specialization
;
736 template_header_count
++;
739 /* We're beginning an explicit instantiation. */
742 begin_explicit_instantiation (void)
744 gcc_assert (!processing_explicit_instantiation
);
745 processing_explicit_instantiation
= true;
750 end_explicit_instantiation (void)
752 gcc_assert (processing_explicit_instantiation
);
753 processing_explicit_instantiation
= false;
756 /* An explicit specialization or partial specialization of TMPL is being
757 declared. Check that the namespace in which the specialization is
758 occurring is permissible. Returns false iff it is invalid to
759 specialize TMPL in the current namespace. */
762 check_specialization_namespace (tree tmpl
)
764 tree tpl_ns
= decl_namespace_context (tmpl
);
768 An explicit specialization shall be declared in the namespace of
769 which the template is a member, or, for member templates, in the
770 namespace of which the enclosing class or enclosing class
771 template is a member. An explicit specialization of a member
772 function, member class or static data member of a class template
773 shall be declared in the namespace of which the class template is
775 if (current_scope() != DECL_CONTEXT (tmpl
)
776 && !at_namespace_scope_p ())
778 error ("specialization of %qD must appear at namespace scope", tmpl
);
781 if (is_associated_namespace (current_namespace
, tpl_ns
))
782 /* Same or super-using namespace. */
786 permerror (input_location
, "specialization of %qD in different namespace", tmpl
);
787 permerror (input_location
, " from definition of %q+#D", tmpl
);
792 /* SPEC is an explicit instantiation. Check that it is valid to
793 perform this explicit instantiation in the current namespace. */
796 check_explicit_instantiation_namespace (tree spec
)
800 /* DR 275: An explicit instantiation shall appear in an enclosing
801 namespace of its template. */
802 ns
= decl_namespace_context (spec
);
803 if (!is_ancestor (current_namespace
, ns
))
804 permerror (input_location
, "explicit instantiation of %qD in namespace %qD "
805 "(which does not enclose namespace %qD)",
806 spec
, current_namespace
, ns
);
809 /* The TYPE is being declared. If it is a template type, that means it
810 is a partial specialization. Do appropriate error-checking. */
813 maybe_process_partial_specialization (tree type
)
817 if (type
== error_mark_node
)
818 return error_mark_node
;
820 /* A lambda that appears in specialization context is not itself a
822 if (CLASS_TYPE_P (type
) && CLASSTYPE_LAMBDA_EXPR (type
))
825 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
827 error ("name of class shadows template template parameter %qD",
829 return error_mark_node
;
832 context
= TYPE_CONTEXT (type
);
834 if (TYPE_ALIAS_P (type
))
836 if (TYPE_TEMPLATE_INFO (type
)
837 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (type
)))
838 error ("specialization of alias template %qD",
839 TYPE_TI_TEMPLATE (type
));
841 error ("explicit specialization of non-template %qT", type
);
842 return error_mark_node
;
844 else if (CLASS_TYPE_P (type
) && CLASSTYPE_USE_TEMPLATE (type
))
846 /* This is for ordinary explicit specialization and partial
847 specialization of a template class such as:
849 template <> class C<int>;
853 template <class T> class C<T*>;
855 Make sure that `C<int>' and `C<T*>' are implicit instantiations. */
857 if (CLASSTYPE_IMPLICIT_INSTANTIATION (type
)
858 && !COMPLETE_TYPE_P (type
))
860 if (!check_specialization_namespace (CLASSTYPE_TI_TEMPLATE (type
))
861 && !at_namespace_scope_p ())
862 return error_mark_node
;
863 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
864 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
865 if (processing_template_decl
)
867 if (push_template_decl (TYPE_MAIN_DECL (type
))
869 return error_mark_node
;
872 else if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
873 error ("specialization of %qT after instantiation", type
);
874 else if (errorcount
&& !processing_specialization
875 && CLASSTYPE_TEMPLATE_SPECIALIZATION (type
)
876 && !uses_template_parms (CLASSTYPE_TI_ARGS (type
)))
877 /* Trying to define a specialization either without a template<> header
878 or in an inappropriate place. We've already given an error, so just
879 bail now so we don't actually define the specialization. */
880 return error_mark_node
;
882 else if (CLASS_TYPE_P (type
)
883 && !CLASSTYPE_USE_TEMPLATE (type
)
884 && CLASSTYPE_TEMPLATE_INFO (type
)
885 && context
&& CLASS_TYPE_P (context
)
886 && CLASSTYPE_TEMPLATE_INFO (context
))
888 /* This is for an explicit specialization of member class
889 template according to [temp.expl.spec/18]:
891 template <> template <class U> class C<int>::D;
893 The context `C<int>' must be an implicit instantiation.
894 Otherwise this is just a member class template declared
897 template <> class C<int> { template <class U> class D; };
898 template <> template <class U> class C<int>::D;
900 In the first case, `C<int>::D' is a specialization of `C<T>::D'
901 while in the second case, `C<int>::D' is a primary template
902 and `C<T>::D' may not exist. */
904 if (CLASSTYPE_IMPLICIT_INSTANTIATION (context
)
905 && !COMPLETE_TYPE_P (type
))
908 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
910 if (current_namespace
911 != decl_namespace_context (tmpl
))
913 permerror (input_location
, "specializing %q#T in different namespace", type
);
914 permerror (input_location
, " from definition of %q+#D", tmpl
);
917 /* Check for invalid specialization after instantiation:
919 template <> template <> class C<int>::D<int>;
920 template <> template <class U> class C<int>::D; */
922 for (t
= DECL_TEMPLATE_INSTANTIATIONS (tmpl
);
923 t
; t
= TREE_CHAIN (t
))
925 tree inst
= TREE_VALUE (t
);
926 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (inst
)
927 || !COMPLETE_OR_OPEN_TYPE_P (inst
))
929 /* We already have a full specialization of this partial
930 instantiation, or a full specialization has been
931 looked up but not instantiated. Reassign it to the
932 new member specialization template. */
937 elt
.tmpl
= most_general_template (tmpl
);
938 elt
.args
= CLASSTYPE_TI_ARGS (inst
);
941 htab_remove_elt (type_specializations
, &elt
);
944 elt
.args
= INNERMOST_TEMPLATE_ARGS (elt
.args
);
946 slot
= htab_find_slot (type_specializations
, &elt
, INSERT
);
947 entry
= ggc_alloc_spec_entry ();
952 /* But if we've had an implicit instantiation, that's a
953 problem ([temp.expl.spec]/6). */
954 error ("specialization %qT after instantiation %qT",
958 /* Mark TYPE as a specialization. And as a result, we only
959 have one level of template argument for the innermost
961 SET_CLASSTYPE_TEMPLATE_SPECIALIZATION (type
);
962 DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)) = input_location
;
963 CLASSTYPE_TI_ARGS (type
)
964 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
967 else if (processing_specialization
)
969 /* Someday C++0x may allow for enum template specialization. */
970 if (cxx_dialect
> cxx98
&& TREE_CODE (type
) == ENUMERAL_TYPE
971 && CLASS_TYPE_P (context
) && CLASSTYPE_USE_TEMPLATE (context
))
972 pedwarn (input_location
, OPT_Wpedantic
, "template specialization "
973 "of %qD not allowed by ISO C++", type
);
976 error ("explicit specialization of non-template %qT", type
);
977 return error_mark_node
;
984 /* Returns nonzero if we can optimize the retrieval of specializations
985 for TMPL, a TEMPLATE_DECL. In particular, for such a template, we
986 do not use DECL_TEMPLATE_SPECIALIZATIONS at all. */
989 optimize_specialization_lookup_p (tree tmpl
)
991 return (DECL_FUNCTION_TEMPLATE_P (tmpl
)
992 && DECL_CLASS_SCOPE_P (tmpl
)
993 /* DECL_CLASS_SCOPE_P holds of T::f even if T is a template
995 && CLASS_TYPE_P (DECL_CONTEXT (tmpl
))
996 /* The optimized lookup depends on the fact that the
997 template arguments for the member function template apply
998 purely to the containing class, which is not true if the
999 containing class is an explicit or partial
1001 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (tmpl
))
1002 && !DECL_MEMBER_TEMPLATE_P (tmpl
)
1003 && !DECL_CONV_FN_P (tmpl
)
1004 /* It is possible to have a template that is not a member
1005 template and is not a member of a template class:
1007 template <typename T>
1008 struct S { friend A::f(); };
1010 Here, the friend function is a template, but the context does
1011 not have template information. The optimized lookup relies
1012 on having ARGS be the template arguments for both the class
1013 and the function template. */
1014 && !DECL_FRIEND_P (DECL_TEMPLATE_RESULT (tmpl
)));
1017 /* Retrieve the specialization (in the sense of [temp.spec] - a
1018 specialization is either an instantiation or an explicit
1019 specialization) of TMPL for the given template ARGS. If there is
1020 no such specialization, return NULL_TREE. The ARGS are a vector of
1021 arguments, or a vector of vectors of arguments, in the case of
1022 templates with more than one level of parameters.
1024 If TMPL is a type template and CLASS_SPECIALIZATIONS_P is true,
1025 then we search for a partial specialization matching ARGS. This
1026 parameter is ignored if TMPL is not a class template.
1028 We can also look up a FIELD_DECL, if it is a lambda capture pack; the
1029 result is a NONTYPE_ARGUMENT_PACK. */
1032 retrieve_specialization (tree tmpl
, tree args
, hashval_t hash
)
1034 if (tmpl
== NULL_TREE
)
1037 if (args
== error_mark_node
)
1040 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
1041 || TREE_CODE (tmpl
) == FIELD_DECL
);
1043 /* There should be as many levels of arguments as there are
1044 levels of parameters. */
1045 gcc_assert (TMPL_ARGS_DEPTH (args
)
1046 == (TREE_CODE (tmpl
) == TEMPLATE_DECL
1047 ? TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
))
1048 : template_class_depth (DECL_CONTEXT (tmpl
))));
1050 if (optimize_specialization_lookup_p (tmpl
))
1052 tree class_template
;
1053 tree class_specialization
;
1054 vec
<tree
, va_gc
> *methods
;
1058 /* The template arguments actually apply to the containing
1059 class. Find the class specialization with those
1061 class_template
= CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (tmpl
));
1062 class_specialization
1063 = retrieve_specialization (class_template
, args
, 0);
1064 if (!class_specialization
)
1066 /* Now, find the appropriate entry in the CLASSTYPE_METHOD_VEC
1067 for the specialization. */
1068 idx
= class_method_index_for_fn (class_specialization
, tmpl
);
1071 /* Iterate through the methods with the indicated name, looking
1072 for the one that has an instance of TMPL. */
1073 methods
= CLASSTYPE_METHOD_VEC (class_specialization
);
1074 for (fns
= (*methods
)[idx
]; fns
; fns
= OVL_NEXT (fns
))
1076 tree fn
= OVL_CURRENT (fns
);
1077 if (DECL_TEMPLATE_INFO (fn
) && DECL_TI_TEMPLATE (fn
) == tmpl
1078 /* using-declarations can add base methods to the method vec,
1079 and we don't want those here. */
1080 && DECL_CONTEXT (fn
) == class_specialization
)
1089 htab_t specializations
;
1093 elt
.spec
= NULL_TREE
;
1095 if (DECL_CLASS_TEMPLATE_P (tmpl
))
1096 specializations
= type_specializations
;
1098 specializations
= decl_specializations
;
1101 hash
= hash_specialization (&elt
);
1102 found
= (spec_entry
*) htab_find_with_hash (specializations
, &elt
, hash
);
1110 /* Like retrieve_specialization, but for local declarations. */
1113 retrieve_local_specialization (tree tmpl
)
1117 if (local_specializations
== NULL
)
1120 slot
= pointer_map_contains (local_specializations
, tmpl
);
1121 return slot
? (tree
) *slot
: NULL_TREE
;
1124 /* Returns nonzero iff DECL is a specialization of TMPL. */
1127 is_specialization_of (tree decl
, tree tmpl
)
1131 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1135 t
= DECL_TEMPLATE_INFO (t
) ? DECL_TI_TEMPLATE (t
) : NULL_TREE
)
1141 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
1143 for (t
= TREE_TYPE (decl
);
1145 t
= CLASSTYPE_USE_TEMPLATE (t
)
1146 ? TREE_TYPE (CLASSTYPE_TI_TEMPLATE (t
)) : NULL_TREE
)
1147 if (same_type_ignoring_top_level_qualifiers_p (t
, TREE_TYPE (tmpl
)))
1154 /* Returns nonzero iff DECL is a specialization of friend declaration
1155 FRIEND_DECL according to [temp.friend]. */
1158 is_specialization_of_friend (tree decl
, tree friend_decl
)
1160 bool need_template
= true;
1163 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
1164 || TREE_CODE (decl
) == TYPE_DECL
);
1166 /* For [temp.friend/6] when FRIEND_DECL is an ordinary member function
1167 of a template class, we want to check if DECL is a specialization
1169 if (TREE_CODE (friend_decl
) == FUNCTION_DECL
1170 && DECL_TEMPLATE_INFO (friend_decl
)
1171 && !DECL_USE_TEMPLATE (friend_decl
))
1173 /* We want a TEMPLATE_DECL for `is_specialization_of'. */
1174 friend_decl
= DECL_TI_TEMPLATE (friend_decl
);
1175 need_template
= false;
1177 else if (TREE_CODE (friend_decl
) == TEMPLATE_DECL
1178 && !PRIMARY_TEMPLATE_P (friend_decl
))
1179 need_template
= false;
1181 /* There is nothing to do if this is not a template friend. */
1182 if (TREE_CODE (friend_decl
) != TEMPLATE_DECL
)
1185 if (is_specialization_of (decl
, friend_decl
))
1189 A member of a class template may be declared to be a friend of a
1190 non-template class. In this case, the corresponding member of
1191 every specialization of the class template is a friend of the
1192 class granting friendship.
1194 For example, given a template friend declaration
1196 template <class T> friend void A<T>::f();
1198 the member function below is considered a friend
1200 template <> struct A<int> {
1204 For this type of template friend, TEMPLATE_DEPTH below will be
1205 nonzero. To determine if DECL is a friend of FRIEND, we first
1206 check if the enclosing class is a specialization of another. */
1208 template_depth
= template_class_depth (CP_DECL_CONTEXT (friend_decl
));
1210 && DECL_CLASS_SCOPE_P (decl
)
1211 && is_specialization_of (TYPE_NAME (DECL_CONTEXT (decl
)),
1212 CLASSTYPE_TI_TEMPLATE (DECL_CONTEXT (friend_decl
))))
1214 /* Next, we check the members themselves. In order to handle
1215 a few tricky cases, such as when FRIEND_DECL's are
1217 template <class T> friend void A<T>::g(T t);
1218 template <class T> template <T t> friend void A<T>::h();
1222 void A<int>::g(int);
1223 template <int> void A<int>::h();
1225 we need to figure out ARGS, the template arguments from
1226 the context of DECL. This is required for template substitution
1227 of `T' in the function parameter of `g' and template parameter
1228 of `h' in the above examples. Here ARGS corresponds to `int'. */
1230 tree context
= DECL_CONTEXT (decl
);
1231 tree args
= NULL_TREE
;
1232 int current_depth
= 0;
1234 while (current_depth
< template_depth
)
1236 if (CLASSTYPE_TEMPLATE_INFO (context
))
1238 if (current_depth
== 0)
1239 args
= TYPE_TI_ARGS (context
);
1241 args
= add_to_template_args (TYPE_TI_ARGS (context
), args
);
1244 context
= TYPE_CONTEXT (context
);
1247 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1252 tree friend_args_type
;
1253 tree decl_args_type
;
1255 /* Make sure that both DECL and FRIEND_DECL are templates or
1257 is_template
= DECL_TEMPLATE_INFO (decl
)
1258 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
));
1259 if (need_template
^ is_template
)
1261 else if (is_template
)
1263 /* If both are templates, check template parameter list. */
1265 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1267 if (!comp_template_parms
1268 (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (decl
)),
1272 decl_type
= TREE_TYPE (DECL_TI_TEMPLATE (decl
));
1275 decl_type
= TREE_TYPE (decl
);
1277 friend_type
= tsubst_function_type (TREE_TYPE (friend_decl
), args
,
1278 tf_none
, NULL_TREE
);
1279 if (friend_type
== error_mark_node
)
1282 /* Check if return types match. */
1283 if (!same_type_p (TREE_TYPE (decl_type
), TREE_TYPE (friend_type
)))
1286 /* Check if function parameter types match, ignoring the
1287 `this' parameter. */
1288 friend_args_type
= TYPE_ARG_TYPES (friend_type
);
1289 decl_args_type
= TYPE_ARG_TYPES (decl_type
);
1290 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (friend_decl
))
1291 friend_args_type
= TREE_CHAIN (friend_args_type
);
1292 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
1293 decl_args_type
= TREE_CHAIN (decl_args_type
);
1295 return compparms (decl_args_type
, friend_args_type
);
1299 /* DECL is a TYPE_DECL */
1301 tree decl_type
= TREE_TYPE (decl
);
1303 /* Make sure that both DECL and FRIEND_DECL are templates or
1306 = CLASSTYPE_TEMPLATE_INFO (decl_type
)
1307 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (decl_type
));
1309 if (need_template
^ is_template
)
1311 else if (is_template
)
1314 /* If both are templates, check the name of the two
1315 TEMPLATE_DECL's first because is_friend didn't. */
1316 if (DECL_NAME (CLASSTYPE_TI_TEMPLATE (decl_type
))
1317 != DECL_NAME (friend_decl
))
1320 /* Now check template parameter list. */
1322 = tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_decl
),
1324 return comp_template_parms
1325 (DECL_TEMPLATE_PARMS (CLASSTYPE_TI_TEMPLATE (decl_type
)),
1329 return (DECL_NAME (decl
)
1330 == DECL_NAME (friend_decl
));
1336 /* Register the specialization SPEC as a specialization of TMPL with
1337 the indicated ARGS. IS_FRIEND indicates whether the specialization
1338 is actually just a friend declaration. Returns SPEC, or an
1339 equivalent prior declaration, if available.
1341 We also store instantiations of field packs in the hash table, even
1342 though they are not themselves templates, to make lookup easier. */
1345 register_specialization (tree spec
, tree tmpl
, tree args
, bool is_friend
,
1352 gcc_assert ((TREE_CODE (tmpl
) == TEMPLATE_DECL
&& DECL_P (spec
))
1353 || (TREE_CODE (tmpl
) == FIELD_DECL
1354 && TREE_CODE (spec
) == NONTYPE_ARGUMENT_PACK
));
1356 if (TREE_CODE (spec
) == FUNCTION_DECL
1357 && uses_template_parms (DECL_TI_ARGS (spec
)))
1358 /* This is the FUNCTION_DECL for a partial instantiation. Don't
1359 register it; we want the corresponding TEMPLATE_DECL instead.
1360 We use `uses_template_parms (DECL_TI_ARGS (spec))' rather than
1361 the more obvious `uses_template_parms (spec)' to avoid problems
1362 with default function arguments. In particular, given
1363 something like this:
1365 template <class T> void f(T t1, T t = T())
1367 the default argument expression is not substituted for in an
1368 instantiation unless and until it is actually needed. */
1371 if (optimize_specialization_lookup_p (tmpl
))
1372 /* We don't put these specializations in the hash table, but we might
1373 want to give an error about a mismatch. */
1374 fn
= retrieve_specialization (tmpl
, args
, 0);
1382 hash
= hash_specialization (&elt
);
1385 htab_find_slot_with_hash (decl_specializations
, &elt
, hash
, INSERT
);
1387 fn
= ((spec_entry
*) *slot
)->spec
;
1392 /* We can sometimes try to re-register a specialization that we've
1393 already got. In particular, regenerate_decl_from_template calls
1394 duplicate_decls which will update the specialization list. But,
1395 we'll still get called again here anyhow. It's more convenient
1396 to simply allow this than to try to prevent it. */
1399 else if (fn
&& DECL_TEMPLATE_SPECIALIZATION (spec
))
1401 if (DECL_TEMPLATE_INSTANTIATION (fn
))
1403 if (DECL_ODR_USED (fn
)
1404 || DECL_EXPLICIT_INSTANTIATION (fn
))
1406 error ("specialization of %qD after instantiation",
1408 return error_mark_node
;
1413 /* This situation should occur only if the first
1414 specialization is an implicit instantiation, the
1415 second is an explicit specialization, and the
1416 implicit instantiation has not yet been used. That
1417 situation can occur if we have implicitly
1418 instantiated a member function and then specialized
1421 We can also wind up here if a friend declaration that
1422 looked like an instantiation turns out to be a
1425 template <class T> void foo(T);
1426 class S { friend void foo<>(int) };
1427 template <> void foo(int);
1429 We transform the existing DECL in place so that any
1430 pointers to it become pointers to the updated
1433 If there was a definition for the template, but not
1434 for the specialization, we want this to look as if
1435 there were no definition, and vice versa. */
1436 DECL_INITIAL (fn
) = NULL_TREE
;
1437 duplicate_decls (spec
, fn
, is_friend
);
1438 /* The call to duplicate_decls will have applied
1441 An explicit specialization of a function template
1442 is inline only if it is explicitly declared to be,
1443 and independently of whether its function template
1446 to the primary function; now copy the inline bits to
1447 the various clones. */
1448 FOR_EACH_CLONE (clone
, fn
)
1450 DECL_DECLARED_INLINE_P (clone
)
1451 = DECL_DECLARED_INLINE_P (fn
);
1452 DECL_SOURCE_LOCATION (clone
)
1453 = DECL_SOURCE_LOCATION (fn
);
1454 DECL_DELETED_FN (clone
)
1455 = DECL_DELETED_FN (fn
);
1457 check_specialization_namespace (tmpl
);
1462 else if (DECL_TEMPLATE_SPECIALIZATION (fn
))
1464 if (!duplicate_decls (spec
, fn
, is_friend
) && DECL_INITIAL (spec
))
1465 /* Dup decl failed, but this is a new definition. Set the
1466 line number so any errors match this new
1468 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (spec
);
1474 return duplicate_decls (spec
, fn
, is_friend
);
1476 /* A specialization must be declared in the same namespace as the
1477 template it is specializing. */
1478 if (DECL_P (spec
) && DECL_TEMPLATE_SPECIALIZATION (spec
)
1479 && !check_specialization_namespace (tmpl
))
1480 DECL_CONTEXT (spec
) = DECL_CONTEXT (tmpl
);
1482 if (slot
!= NULL
/* !optimize_specialization_lookup_p (tmpl) */)
1484 spec_entry
*entry
= ggc_alloc_spec_entry ();
1485 gcc_assert (tmpl
&& args
&& spec
);
1488 if (TREE_CODE (spec
) == FUNCTION_DECL
&& DECL_NAMESPACE_SCOPE_P (spec
)
1489 && PRIMARY_TEMPLATE_P (tmpl
)
1490 && DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (tmpl
)) == NULL_TREE
)
1491 /* TMPL is a forward declaration of a template function; keep a list
1492 of all specializations in case we need to reassign them to a friend
1493 template later in tsubst_friend_function. */
1494 DECL_TEMPLATE_INSTANTIATIONS (tmpl
)
1495 = tree_cons (args
, spec
, DECL_TEMPLATE_INSTANTIATIONS (tmpl
));
1501 /* Returns true iff two spec_entry nodes are equivalent. Only compares the
1502 TMPL and ARGS members, ignores SPEC. */
1504 int comparing_specializations
;
1507 eq_specializations (const void *p1
, const void *p2
)
1509 const spec_entry
*e1
= (const spec_entry
*)p1
;
1510 const spec_entry
*e2
= (const spec_entry
*)p2
;
1513 ++comparing_specializations
;
1514 equal
= (e1
->tmpl
== e2
->tmpl
1515 && comp_template_args (e1
->args
, e2
->args
));
1516 --comparing_specializations
;
1521 /* Returns a hash for a template TMPL and template arguments ARGS. */
1524 hash_tmpl_and_args (tree tmpl
, tree args
)
1526 hashval_t val
= DECL_UID (tmpl
);
1527 return iterative_hash_template_arg (args
, val
);
1530 /* Returns a hash for a spec_entry node based on the TMPL and ARGS members,
1534 hash_specialization (const void *p
)
1536 const spec_entry
*e
= (const spec_entry
*)p
;
1537 return hash_tmpl_and_args (e
->tmpl
, e
->args
);
1540 /* Recursively calculate a hash value for a template argument ARG, for use
1541 in the hash tables of template specializations. */
1544 iterative_hash_template_arg (tree arg
, hashval_t val
)
1546 unsigned HOST_WIDE_INT i
;
1547 enum tree_code code
;
1550 if (arg
== NULL_TREE
)
1551 return iterative_hash_object (arg
, val
);
1556 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
1557 /* We can get one of these when re-hashing a previous entry in the middle
1558 of substituting into a pack expansion. Just look through it. */
1559 arg
= ARGUMENT_PACK_SELECT_FROM_PACK (arg
);
1561 code
= TREE_CODE (arg
);
1562 tclass
= TREE_CODE_CLASS (code
);
1564 val
= iterative_hash_object (code
, val
);
1571 case IDENTIFIER_NODE
:
1572 return iterative_hash_object (IDENTIFIER_HASH_VALUE (arg
), val
);
1576 int i
, len
= TREE_VEC_LENGTH (arg
);
1577 for (i
= 0; i
< len
; ++i
)
1578 val
= iterative_hash_template_arg (TREE_VEC_ELT (arg
, i
), val
);
1582 case TYPE_PACK_EXPANSION
:
1583 case EXPR_PACK_EXPANSION
:
1584 val
= iterative_hash_template_arg (PACK_EXPANSION_PATTERN (arg
), val
);
1585 return iterative_hash_template_arg (PACK_EXPANSION_EXTRA_ARGS (arg
), val
);
1587 case TYPE_ARGUMENT_PACK
:
1588 case NONTYPE_ARGUMENT_PACK
:
1589 return iterative_hash_template_arg (ARGUMENT_PACK_ARGS (arg
), val
);
1592 for (; arg
; arg
= TREE_CHAIN (arg
))
1593 val
= iterative_hash_template_arg (TREE_VALUE (arg
), val
);
1597 for (; arg
; arg
= OVL_NEXT (arg
))
1598 val
= iterative_hash_template_arg (OVL_CURRENT (arg
), val
);
1604 iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1605 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (arg
), i
, field
, value
)
1607 val
= iterative_hash_template_arg (field
, val
);
1608 val
= iterative_hash_template_arg (value
, val
);
1614 if (!DECL_ARTIFICIAL (arg
))
1616 val
= iterative_hash_object (DECL_PARM_INDEX (arg
), val
);
1617 val
= iterative_hash_object (DECL_PARM_LEVEL (arg
), val
);
1619 return iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1622 return iterative_hash_template_arg (TARGET_EXPR_INITIAL (arg
), val
);
1625 val
= iterative_hash_template_arg (PTRMEM_CST_CLASS (arg
), val
);
1626 return iterative_hash_template_arg (PTRMEM_CST_MEMBER (arg
), val
);
1628 case TEMPLATE_PARM_INDEX
:
1629 val
= iterative_hash_template_arg
1630 (TREE_TYPE (TEMPLATE_PARM_DECL (arg
)), val
);
1631 val
= iterative_hash_object (TEMPLATE_PARM_LEVEL (arg
), val
);
1632 return iterative_hash_object (TEMPLATE_PARM_IDX (arg
), val
);
1635 val
= iterative_hash_object (TRAIT_EXPR_KIND (arg
), val
);
1636 val
= iterative_hash_template_arg (TRAIT_EXPR_TYPE1 (arg
), val
);
1637 return iterative_hash_template_arg (TRAIT_EXPR_TYPE2 (arg
), val
);
1640 val
= iterative_hash_template_arg (BINFO_TYPE (BASELINK_BINFO (arg
)),
1642 return iterative_hash_template_arg (DECL_NAME (get_first_fn (arg
)),
1646 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, 0), val
);
1647 code
= TREE_CODE (TREE_OPERAND (arg
, 1));
1648 val
= iterative_hash_object (code
, val
);
1649 return iterative_hash_template_arg (TREE_OPERAND (arg
, 2), val
);
1652 /* A lambda can't appear in a template arg, but don't crash on
1654 gcc_assert (seen_error ());
1658 case IMPLICIT_CONV_EXPR
:
1659 case STATIC_CAST_EXPR
:
1660 case REINTERPRET_CAST_EXPR
:
1661 case CONST_CAST_EXPR
:
1662 case DYNAMIC_CAST_EXPR
:
1664 val
= iterative_hash_template_arg (TREE_TYPE (arg
), val
);
1665 /* Now hash operands as usual. */
1675 if (TYPE_CANONICAL (arg
))
1676 return iterative_hash_object (TYPE_HASH (TYPE_CANONICAL (arg
)),
1678 else if (TREE_CODE (arg
) == DECLTYPE_TYPE
)
1679 return iterative_hash_template_arg (DECLTYPE_TYPE_EXPR (arg
), val
);
1680 /* Otherwise just compare the types during lookup. */
1683 case tcc_declaration
:
1685 return iterative_hash_expr (arg
, val
);
1688 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
1690 unsigned n
= cp_tree_operand_length (arg
);
1691 for (i
= 0; i
< n
; ++i
)
1692 val
= iterative_hash_template_arg (TREE_OPERAND (arg
, i
), val
);
1700 /* Unregister the specialization SPEC as a specialization of TMPL.
1701 Replace it with NEW_SPEC, if NEW_SPEC is non-NULL. Returns true
1702 if the SPEC was listed as a specialization of TMPL.
1704 Note that SPEC has been ggc_freed, so we can't look inside it. */
1707 reregister_specialization (tree spec
, tree tinfo
, tree new_spec
)
1712 elt
.tmpl
= most_general_template (TI_TEMPLATE (tinfo
));
1713 elt
.args
= TI_ARGS (tinfo
);
1714 elt
.spec
= NULL_TREE
;
1716 entry
= (spec_entry
*) htab_find (decl_specializations
, &elt
);
1719 gcc_assert (entry
->spec
== spec
|| entry
->spec
== new_spec
);
1720 gcc_assert (new_spec
!= NULL_TREE
);
1721 entry
->spec
= new_spec
;
1728 /* Like register_specialization, but for local declarations. We are
1729 registering SPEC, an instantiation of TMPL. */
1732 register_local_specialization (tree spec
, tree tmpl
)
1736 slot
= pointer_map_insert (local_specializations
, tmpl
);
1740 /* TYPE is a class type. Returns true if TYPE is an explicitly
1741 specialized class. */
1744 explicit_class_specialization_p (tree type
)
1746 if (!CLASSTYPE_TEMPLATE_SPECIALIZATION (type
))
1748 return !uses_template_parms (CLASSTYPE_TI_ARGS (type
));
1751 /* Print the list of functions at FNS, going through all the overloads
1752 for each element of the list. Alternatively, FNS can not be a
1753 TREE_LIST, in which case it will be printed together with all the
1756 MORE and *STR should respectively be FALSE and NULL when the function
1757 is called from the outside. They are used internally on recursive
1758 calls. print_candidates manages the two parameters and leaves NULL
1759 in *STR when it ends. */
1762 print_candidates_1 (tree fns
, bool more
, const char **str
)
1765 char *spaces
= NULL
;
1767 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
1768 if (TREE_CODE (fn
) == TREE_LIST
)
1770 for (fn2
= fn
; fn2
!= NULL_TREE
; fn2
= TREE_CHAIN (fn2
))
1771 print_candidates_1 (TREE_VALUE (fn2
),
1772 TREE_CHAIN (fn2
) || more
, str
);
1776 tree cand
= OVL_CURRENT (fn
);
1779 /* Pick the prefix string. */
1780 if (!more
&& !OVL_NEXT (fns
))
1782 inform (DECL_SOURCE_LOCATION (cand
),
1783 "candidate is: %#D", cand
);
1787 *str
= _("candidates are:");
1788 spaces
= get_spaces (*str
);
1790 inform (DECL_SOURCE_LOCATION (cand
), "%s %#D", *str
, cand
);
1791 *str
= spaces
? spaces
: *str
;
1801 /* Print the list of candidate FNS in an error message. FNS can also
1802 be a TREE_LIST of non-functions in the case of an ambiguous lookup. */
1805 print_candidates (tree fns
)
1807 const char *str
= NULL
;
1808 print_candidates_1 (fns
, false, &str
);
1809 gcc_assert (str
== NULL
);
1812 /* Returns the template (one of the functions given by TEMPLATE_ID)
1813 which can be specialized to match the indicated DECL with the
1814 explicit template args given in TEMPLATE_ID. The DECL may be
1815 NULL_TREE if none is available. In that case, the functions in
1816 TEMPLATE_ID are non-members.
1818 If NEED_MEMBER_TEMPLATE is nonzero the function is known to be a
1819 specialization of a member template.
1821 The TEMPLATE_COUNT is the number of references to qualifying
1822 template classes that appeared in the name of the function. See
1823 check_explicit_specialization for a more accurate description.
1825 TSK indicates what kind of template declaration (if any) is being
1826 declared. TSK_TEMPLATE indicates that the declaration given by
1827 DECL, though a FUNCTION_DECL, has template parameters, and is
1828 therefore a template function.
1830 The template args (those explicitly specified and those deduced)
1831 are output in a newly created vector *TARGS_OUT.
1833 If it is impossible to determine the result, an error message is
1834 issued. The error_mark_node is returned to indicate failure. */
1837 determine_specialization (tree template_id
,
1840 int need_member_template
,
1846 tree explicit_targs
;
1847 tree candidates
= NULL_TREE
;
1848 /* A TREE_LIST of templates of which DECL may be a specialization.
1849 The TREE_VALUE of each node is a TEMPLATE_DECL. The
1850 corresponding TREE_PURPOSE is the set of template arguments that,
1851 when used to instantiate the template, would produce a function
1852 with the signature of DECL. */
1853 tree templates
= NULL_TREE
;
1855 cp_binding_level
*b
;
1857 *targs_out
= NULL_TREE
;
1859 if (template_id
== error_mark_node
|| decl
== error_mark_node
)
1860 return error_mark_node
;
1862 /* We shouldn't be specializing a member template of an
1863 unspecialized class template; we already gave an error in
1864 check_specialization_scope, now avoid crashing. */
1865 if (template_count
&& DECL_CLASS_SCOPE_P (decl
)
1866 && template_class_depth (DECL_CONTEXT (decl
)) > 0)
1868 gcc_assert (errorcount
);
1869 return error_mark_node
;
1872 fns
= TREE_OPERAND (template_id
, 0);
1873 explicit_targs
= TREE_OPERAND (template_id
, 1);
1875 if (fns
== error_mark_node
)
1876 return error_mark_node
;
1878 /* Check for baselinks. */
1879 if (BASELINK_P (fns
))
1880 fns
= BASELINK_FUNCTIONS (fns
);
1882 if (!is_overloaded_fn (fns
))
1884 error ("%qD is not a function template", fns
);
1885 return error_mark_node
;
1888 /* Count the number of template headers specified for this
1891 for (b
= current_binding_level
;
1892 b
->kind
== sk_template_parms
;
1896 for (; fns
; fns
= OVL_NEXT (fns
))
1898 tree fn
= OVL_CURRENT (fns
);
1900 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1902 tree decl_arg_types
;
1906 /* In case of explicit specialization, we need to check if
1907 the number of template headers appearing in the specialization
1908 is correct. This is usually done in check_explicit_specialization,
1909 but the check done there cannot be exhaustive when specializing
1910 member functions. Consider the following code:
1912 template <> void A<int>::f(int);
1913 template <> template <> void A<int>::f(int);
1915 Assuming that A<int> is not itself an explicit specialization
1916 already, the first line specializes "f" which is a non-template
1917 member function, whilst the second line specializes "f" which
1918 is a template member function. So both lines are syntactically
1919 correct, and check_explicit_specialization does not reject
1922 Here, we can do better, as we are matching the specialization
1923 against the declarations. We count the number of template
1924 headers, and we check if they match TEMPLATE_COUNT + 1
1925 (TEMPLATE_COUNT is the number of qualifying template classes,
1926 plus there must be another header for the member template
1929 Notice that if header_count is zero, this is not a
1930 specialization but rather a template instantiation, so there
1931 is no check we can perform here. */
1932 if (header_count
&& header_count
!= template_count
+ 1)
1935 /* Check that the number of template arguments at the
1936 innermost level for DECL is the same as for FN. */
1937 if (current_binding_level
->kind
== sk_template_parms
1938 && !current_binding_level
->explicit_spec_p
1939 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn
))
1940 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS
1941 (current_template_parms
))))
1944 /* DECL might be a specialization of FN. */
1945 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
1946 fn_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1948 /* For a non-static member function, we need to make sure
1949 that the const qualification is the same. Since
1950 get_bindings does not try to merge the "this" parameter,
1951 we must do the comparison explicitly. */
1952 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1953 && !same_type_p (TREE_VALUE (fn_arg_types
),
1954 TREE_VALUE (decl_arg_types
)))
1957 /* Skip the "this" parameter and, for constructors of
1958 classes with virtual bases, the VTT parameter. A
1959 full specialization of a constructor will have a VTT
1960 parameter, but a template never will. */
1962 = skip_artificial_parms_for (decl
, decl_arg_types
);
1964 = skip_artificial_parms_for (fn
, fn_arg_types
);
1966 /* Function templates cannot be specializations; there are
1967 no partial specializations of functions. Therefore, if
1968 the type of DECL does not match FN, there is no
1970 if (tsk
== tsk_template
)
1972 if (compparms (fn_arg_types
, decl_arg_types
))
1973 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
1977 /* See whether this function might be a specialization of this
1978 template. Suppress access control because we might be trying
1979 to make this specialization a friend, and we have already done
1980 access control for the declaration of the specialization. */
1981 push_deferring_access_checks (dk_no_check
);
1982 targs
= get_bindings (fn
, decl
, explicit_targs
, /*check_ret=*/true);
1983 pop_deferring_access_checks ();
1986 /* We cannot deduce template arguments that when used to
1987 specialize TMPL will produce DECL. */
1990 /* Make sure that the deduced arguments actually work. */
1991 insttype
= tsubst (TREE_TYPE (fn
), targs
, tf_none
, NULL_TREE
);
1992 if (insttype
== error_mark_node
)
1995 = skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (insttype
));
1996 if (!compparms (fn_arg_types
, decl_arg_types
))
1999 /* Save this template, and the arguments deduced. */
2000 templates
= tree_cons (targs
, fn
, templates
);
2002 else if (need_member_template
)
2003 /* FN is an ordinary member function, and we need a
2004 specialization of a member template. */
2006 else if (TREE_CODE (fn
) != FUNCTION_DECL
)
2007 /* We can get IDENTIFIER_NODEs here in certain erroneous
2010 else if (!DECL_FUNCTION_MEMBER_P (fn
))
2011 /* This is just an ordinary non-member function. Nothing can
2012 be a specialization of that. */
2014 else if (DECL_ARTIFICIAL (fn
))
2015 /* Cannot specialize functions that are created implicitly. */
2019 tree decl_arg_types
;
2021 /* This is an ordinary member function. However, since
2022 we're here, we can assume its enclosing class is a
2023 template class. For example,
2025 template <typename T> struct S { void f(); };
2026 template <> void S<int>::f() {}
2028 Here, S<int>::f is a non-template, but S<int> is a
2029 template class. If FN has the same type as DECL, we
2030 might be in business. */
2032 if (!DECL_TEMPLATE_INFO (fn
))
2033 /* Its enclosing class is an explicit specialization
2034 of a template class. This is not a candidate. */
2037 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
2038 TREE_TYPE (TREE_TYPE (fn
))))
2039 /* The return types differ. */
2042 /* Adjust the type of DECL in case FN is a static member. */
2043 decl_arg_types
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2044 if (DECL_STATIC_FUNCTION_P (fn
)
2045 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2046 decl_arg_types
= TREE_CHAIN (decl_arg_types
);
2048 if (compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
2051 candidates
= tree_cons (NULL_TREE
, fn
, candidates
);
2055 if (templates
&& TREE_CHAIN (templates
))
2061 It is possible for a specialization with a given function
2062 signature to be instantiated from more than one function
2063 template. In such cases, explicit specification of the
2064 template arguments must be used to uniquely identify the
2065 function template specialization being specialized.
2067 Note that here, there's no suggestion that we're supposed to
2068 determine which of the candidate templates is most
2069 specialized. However, we, also have:
2073 Partial ordering of overloaded function template
2074 declarations is used in the following contexts to select
2075 the function template to which a function template
2076 specialization refers:
2078 -- when an explicit specialization refers to a function
2081 So, we do use the partial ordering rules, at least for now.
2082 This extension can only serve to make invalid programs valid,
2083 so it's safe. And, there is strong anecdotal evidence that
2084 the committee intended the partial ordering rules to apply;
2085 the EDG front end has that behavior, and John Spicer claims
2086 that the committee simply forgot to delete the wording in
2087 [temp.expl.spec]. */
2088 tree tmpl
= most_specialized_instantiation (templates
);
2089 if (tmpl
!= error_mark_node
)
2092 TREE_CHAIN (templates
) = NULL_TREE
;
2096 if (templates
== NULL_TREE
&& candidates
== NULL_TREE
)
2098 error ("template-id %qD for %q+D does not match any template "
2099 "declaration", template_id
, decl
);
2100 if (header_count
&& header_count
!= template_count
+ 1)
2101 inform (input_location
, "saw %d %<template<>%>, need %d for "
2102 "specializing a member function template",
2103 header_count
, template_count
+ 1);
2104 return error_mark_node
;
2106 else if ((templates
&& TREE_CHAIN (templates
))
2107 || (candidates
&& TREE_CHAIN (candidates
))
2108 || (templates
&& candidates
))
2110 error ("ambiguous template specialization %qD for %q+D",
2112 candidates
= chainon (candidates
, templates
);
2113 print_candidates (candidates
);
2114 return error_mark_node
;
2117 /* We have one, and exactly one, match. */
2120 tree fn
= TREE_VALUE (candidates
);
2121 *targs_out
= copy_node (DECL_TI_ARGS (fn
));
2122 /* DECL is a re-declaration or partial instantiation of a template
2124 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2126 /* It was a specialization of an ordinary member function in a
2128 return DECL_TI_TEMPLATE (fn
);
2131 /* It was a specialization of a template. */
2132 targs
= DECL_TI_ARGS (DECL_TEMPLATE_RESULT (TREE_VALUE (templates
)));
2133 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (targs
))
2135 *targs_out
= copy_node (targs
);
2136 SET_TMPL_ARGS_LEVEL (*targs_out
,
2137 TMPL_ARGS_DEPTH (*targs_out
),
2138 TREE_PURPOSE (templates
));
2141 *targs_out
= TREE_PURPOSE (templates
);
2142 return TREE_VALUE (templates
);
2145 /* Returns a chain of parameter types, exactly like the SPEC_TYPES,
2146 but with the default argument values filled in from those in the
2150 copy_default_args_to_explicit_spec_1 (tree spec_types
,
2153 tree new_spec_types
;
2158 if (spec_types
== void_list_node
)
2159 return void_list_node
;
2161 /* Substitute into the rest of the list. */
2163 copy_default_args_to_explicit_spec_1 (TREE_CHAIN (spec_types
),
2164 TREE_CHAIN (tmpl_types
));
2166 /* Add the default argument for this parameter. */
2167 return hash_tree_cons (TREE_PURPOSE (tmpl_types
),
2168 TREE_VALUE (spec_types
),
2172 /* DECL is an explicit specialization. Replicate default arguments
2173 from the template it specializes. (That way, code like:
2175 template <class T> void f(T = 3);
2176 template <> void f(double);
2179 works, as required.) An alternative approach would be to look up
2180 the correct default arguments at the call-site, but this approach
2181 is consistent with how implicit instantiations are handled. */
2184 copy_default_args_to_explicit_spec (tree decl
)
2189 tree new_spec_types
;
2193 tree object_type
= NULL_TREE
;
2194 tree in_charge
= NULL_TREE
;
2195 tree vtt
= NULL_TREE
;
2197 /* See if there's anything we need to do. */
2198 tmpl
= DECL_TI_TEMPLATE (decl
);
2199 tmpl_types
= TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (tmpl
)));
2200 for (t
= tmpl_types
; t
; t
= TREE_CHAIN (t
))
2201 if (TREE_PURPOSE (t
))
2206 old_type
= TREE_TYPE (decl
);
2207 spec_types
= TYPE_ARG_TYPES (old_type
);
2209 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2211 /* Remove the this pointer, but remember the object's type for
2213 object_type
= TREE_TYPE (TREE_VALUE (spec_types
));
2214 spec_types
= TREE_CHAIN (spec_types
);
2215 tmpl_types
= TREE_CHAIN (tmpl_types
);
2217 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
2219 /* DECL may contain more parameters than TMPL due to the extra
2220 in-charge parameter in constructors and destructors. */
2221 in_charge
= spec_types
;
2222 spec_types
= TREE_CHAIN (spec_types
);
2224 if (DECL_HAS_VTT_PARM_P (decl
))
2227 spec_types
= TREE_CHAIN (spec_types
);
2231 /* Compute the merged default arguments. */
2233 copy_default_args_to_explicit_spec_1 (spec_types
, tmpl_types
);
2235 /* Compute the new FUNCTION_TYPE. */
2239 new_spec_types
= hash_tree_cons (TREE_PURPOSE (vtt
),
2244 /* Put the in-charge parameter back. */
2245 new_spec_types
= hash_tree_cons (TREE_PURPOSE (in_charge
),
2246 TREE_VALUE (in_charge
),
2249 new_type
= build_method_type_directly (object_type
,
2250 TREE_TYPE (old_type
),
2254 new_type
= build_function_type (TREE_TYPE (old_type
),
2256 new_type
= cp_build_type_attribute_variant (new_type
,
2257 TYPE_ATTRIBUTES (old_type
));
2258 new_type
= build_exception_variant (new_type
,
2259 TYPE_RAISES_EXCEPTIONS (old_type
));
2260 TREE_TYPE (decl
) = new_type
;
2263 /* Return the number of template headers we expect to see for a definition
2264 or specialization of CTYPE or one of its non-template members. */
2267 num_template_headers_for_class (tree ctype
)
2269 int num_templates
= 0;
2271 while (ctype
&& CLASS_TYPE_P (ctype
))
2273 /* You're supposed to have one `template <...>' for every
2274 template class, but you don't need one for a full
2275 specialization. For example:
2277 template <class T> struct S{};
2278 template <> struct S<int> { void f(); };
2279 void S<int>::f () {}
2281 is correct; there shouldn't be a `template <>' for the
2282 definition of `S<int>::f'. */
2283 if (!CLASSTYPE_TEMPLATE_INFO (ctype
))
2284 /* If CTYPE does not have template information of any
2285 kind, then it is not a template, nor is it nested
2286 within a template. */
2288 if (explicit_class_specialization_p (ctype
))
2290 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (ctype
)))
2293 ctype
= TYPE_CONTEXT (ctype
);
2296 return num_templates
;
2299 /* Do a simple sanity check on the template headers that precede the
2300 variable declaration DECL. */
2303 check_template_variable (tree decl
)
2305 tree ctx
= CP_DECL_CONTEXT (decl
);
2306 int wanted
= num_template_headers_for_class (ctx
);
2307 if (!TYPE_P (ctx
) || !CLASSTYPE_TEMPLATE_INFO (ctx
))
2308 permerror (DECL_SOURCE_LOCATION (decl
),
2309 "%qD is not a static data member of a class template", decl
);
2310 else if (template_header_count
> wanted
)
2312 bool warned
= pedwarn (DECL_SOURCE_LOCATION (decl
), 0,
2313 "too many template headers for %D (should be %d)",
2315 if (warned
&& CLASSTYPE_TEMPLATE_SPECIALIZATION (ctx
))
2316 inform (DECL_SOURCE_LOCATION (decl
),
2317 "members of an explicitly specialized class are defined "
2318 "without a template header");
2322 /* Check to see if the function just declared, as indicated in
2323 DECLARATOR, and in DECL, is a specialization of a function
2324 template. We may also discover that the declaration is an explicit
2325 instantiation at this point.
2327 Returns DECL, or an equivalent declaration that should be used
2328 instead if all goes well. Issues an error message if something is
2329 amiss. Returns error_mark_node if the error is not easily
2332 FLAGS is a bitmask consisting of the following flags:
2334 2: The function has a definition.
2335 4: The function is a friend.
2337 The TEMPLATE_COUNT is the number of references to qualifying
2338 template classes that appeared in the name of the function. For
2341 template <class T> struct S { void f(); };
2344 the TEMPLATE_COUNT would be 1. However, explicitly specialized
2345 classes are not counted in the TEMPLATE_COUNT, so that in
2347 template <class T> struct S {};
2348 template <> struct S<int> { void f(); }
2349 template <> void S<int>::f();
2351 the TEMPLATE_COUNT would be 0. (Note that this declaration is
2352 invalid; there should be no template <>.)
2354 If the function is a specialization, it is marked as such via
2355 DECL_TEMPLATE_SPECIALIZATION. Furthermore, its DECL_TEMPLATE_INFO
2356 is set up correctly, and it is added to the list of specializations
2357 for that template. */
2360 check_explicit_specialization (tree declarator
,
2365 int have_def
= flags
& 2;
2366 int is_friend
= flags
& 4;
2367 int specialization
= 0;
2368 int explicit_instantiation
= 0;
2369 int member_specialization
= 0;
2370 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2371 tree dname
= DECL_NAME (decl
);
2376 if (!processing_specialization
)
2379 tsk
= tsk_excessive_parms
;
2382 tsk
= current_tmpl_spec_kind (template_count
);
2387 if (processing_specialization
)
2390 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2392 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2395 /* This could be something like:
2397 template <class T> void f(T);
2398 class S { friend void f<>(int); } */
2402 /* This case handles bogus declarations like template <>
2403 template <class T> void f<int>(); */
2405 error ("template-id %qD in declaration of primary template",
2412 case tsk_invalid_member_spec
:
2413 /* The error has already been reported in
2414 check_specialization_scope. */
2415 return error_mark_node
;
2417 case tsk_invalid_expl_inst
:
2418 error ("template parameter list used in explicit instantiation");
2424 error ("definition provided for explicit instantiation");
2426 explicit_instantiation
= 1;
2429 case tsk_excessive_parms
:
2430 case tsk_insufficient_parms
:
2431 if (tsk
== tsk_excessive_parms
)
2432 error ("too many template parameter lists in declaration of %qD",
2434 else if (template_header_count
)
2435 error("too few template parameter lists in declaration of %qD", decl
);
2437 error("explicit specialization of %qD must be introduced by "
2438 "%<template <>%>", decl
);
2442 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
2444 member_specialization
= 1;
2450 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
2452 /* This case handles bogus declarations like template <>
2453 template <class T> void f<int>(); */
2455 if (uses_template_parms (declarator
))
2456 error ("function template partial specialization %qD "
2457 "is not allowed", declarator
);
2459 error ("template-id %qD in declaration of primary template",
2464 if (ctype
&& CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2465 /* This is a specialization of a member template, without
2466 specialization the containing class. Something like:
2468 template <class T> struct S {
2469 template <class U> void f (U);
2471 template <> template <class U> void S<int>::f(U) {}
2473 That's a specialization -- but of the entire template. */
2481 if (specialization
|| member_specialization
)
2483 tree t
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
2484 for (; t
; t
= TREE_CHAIN (t
))
2485 if (TREE_PURPOSE (t
))
2487 permerror (input_location
,
2488 "default argument specified in explicit specialization");
2493 if (specialization
|| member_specialization
|| explicit_instantiation
)
2495 tree tmpl
= NULL_TREE
;
2496 tree targs
= NULL_TREE
;
2498 /* Make sure that the declarator is a TEMPLATE_ID_EXPR. */
2499 if (TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
2503 gcc_assert (identifier_p (declarator
));
2508 /* If there is no class context, the explicit instantiation
2509 must be at namespace scope. */
2510 gcc_assert (DECL_NAMESPACE_SCOPE_P (decl
));
2512 /* Find the namespace binding, using the declaration
2514 fns
= lookup_qualified_name (CP_DECL_CONTEXT (decl
), dname
,
2516 if (fns
== error_mark_node
|| !is_overloaded_fn (fns
))
2518 error ("%qD is not a template function", dname
);
2519 fns
= error_mark_node
;
2523 tree fn
= OVL_CURRENT (fns
);
2524 if (!is_associated_namespace (CP_DECL_CONTEXT (decl
),
2525 CP_DECL_CONTEXT (fn
)))
2526 error ("%qD is not declared in %qD",
2527 decl
, current_namespace
);
2531 declarator
= lookup_template_function (fns
, NULL_TREE
);
2534 if (declarator
== error_mark_node
)
2535 return error_mark_node
;
2537 if (ctype
!= NULL_TREE
&& TYPE_BEING_DEFINED (ctype
))
2539 if (!explicit_instantiation
)
2540 /* A specialization in class scope. This is invalid,
2541 but the error will already have been flagged by
2542 check_specialization_scope. */
2543 return error_mark_node
;
2546 /* It's not valid to write an explicit instantiation in
2549 class C { template void f(); }
2551 This case is caught by the parser. However, on
2554 template class C { void f(); };
2556 (which is invalid) we can get here. The error will be
2563 else if (ctype
!= NULL_TREE
2564 && (identifier_p (TREE_OPERAND (declarator
, 0))))
2566 /* Find the list of functions in ctype that have the same
2567 name as the declared function. */
2568 tree name
= TREE_OPERAND (declarator
, 0);
2569 tree fns
= NULL_TREE
;
2572 if (constructor_name_p (name
, ctype
))
2574 int is_constructor
= DECL_CONSTRUCTOR_P (decl
);
2576 if (is_constructor
? !TYPE_HAS_USER_CONSTRUCTOR (ctype
)
2577 : !CLASSTYPE_DESTRUCTORS (ctype
))
2579 /* From [temp.expl.spec]:
2581 If such an explicit specialization for the member
2582 of a class template names an implicitly-declared
2583 special member function (clause _special_), the
2584 program is ill-formed.
2586 Similar language is found in [temp.explicit]. */
2587 error ("specialization of implicitly-declared special member function");
2588 return error_mark_node
;
2591 name
= is_constructor
? ctor_identifier
: dtor_identifier
;
2594 if (!DECL_CONV_FN_P (decl
))
2596 idx
= lookup_fnfields_1 (ctype
, name
);
2598 fns
= (*CLASSTYPE_METHOD_VEC (ctype
))[idx
];
2602 vec
<tree
, va_gc
> *methods
;
2605 /* For a type-conversion operator, we cannot do a
2606 name-based lookup. We might be looking for `operator
2607 int' which will be a specialization of `operator T'.
2608 So, we find *all* the conversion operators, and then
2609 select from them. */
2612 methods
= CLASSTYPE_METHOD_VEC (ctype
);
2614 for (idx
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2615 methods
->iterate (idx
, &ovl
);
2618 if (!DECL_CONV_FN_P (OVL_CURRENT (ovl
)))
2619 /* There are no more conversion functions. */
2622 /* Glue all these conversion functions together
2623 with those we already have. */
2624 for (; ovl
; ovl
= OVL_NEXT (ovl
))
2625 fns
= ovl_cons (OVL_CURRENT (ovl
), fns
);
2629 if (fns
== NULL_TREE
)
2631 error ("no member function %qD declared in %qT", name
, ctype
);
2632 return error_mark_node
;
2635 TREE_OPERAND (declarator
, 0) = fns
;
2638 /* Figure out what exactly is being specialized at this point.
2639 Note that for an explicit instantiation, even one for a
2640 member function, we cannot tell apriori whether the
2641 instantiation is for a member template, or just a member
2642 function of a template class. Even if a member template is
2643 being instantiated, the member template arguments may be
2644 elided if they can be deduced from the rest of the
2646 tmpl
= determine_specialization (declarator
, decl
,
2648 member_specialization
,
2652 if (!tmpl
|| tmpl
== error_mark_node
)
2653 /* We couldn't figure out what this declaration was
2655 return error_mark_node
;
2658 tree gen_tmpl
= most_general_template (tmpl
);
2660 if (explicit_instantiation
)
2662 /* We don't set DECL_EXPLICIT_INSTANTIATION here; that
2663 is done by do_decl_instantiation later. */
2665 int arg_depth
= TMPL_ARGS_DEPTH (targs
);
2666 int parm_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
2668 if (arg_depth
> parm_depth
)
2670 /* If TMPL is not the most general template (for
2671 example, if TMPL is a friend template that is
2672 injected into namespace scope), then there will
2673 be too many levels of TARGS. Remove some of them
2678 new_targs
= make_tree_vec (parm_depth
);
2679 for (i
= arg_depth
- parm_depth
; i
< arg_depth
; ++i
)
2680 TREE_VEC_ELT (new_targs
, i
- (arg_depth
- parm_depth
))
2681 = TREE_VEC_ELT (targs
, i
);
2685 return instantiate_template (tmpl
, targs
, tf_error
);
2688 /* If we thought that the DECL was a member function, but it
2689 turns out to be specializing a static member function,
2690 make DECL a static member function as well. */
2691 if (DECL_STATIC_FUNCTION_P (tmpl
)
2692 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
))
2693 revert_static_member_fn (decl
);
2695 /* If this is a specialization of a member template of a
2696 template class, we want to return the TEMPLATE_DECL, not
2697 the specialization of it. */
2698 if (tsk
== tsk_template
)
2700 tree result
= DECL_TEMPLATE_RESULT (tmpl
);
2701 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
2702 DECL_INITIAL (result
) = NULL_TREE
;
2706 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
2707 DECL_SOURCE_LOCATION (result
)
2708 = DECL_SOURCE_LOCATION (decl
);
2709 /* We want to use the argument list specified in the
2710 definition, not in the original declaration. */
2711 DECL_ARGUMENTS (result
) = DECL_ARGUMENTS (decl
);
2712 for (parm
= DECL_ARGUMENTS (result
); parm
;
2713 parm
= DECL_CHAIN (parm
))
2714 DECL_CONTEXT (parm
) = result
;
2716 return register_specialization (tmpl
, gen_tmpl
, targs
,
2720 /* Set up the DECL_TEMPLATE_INFO for DECL. */
2721 DECL_TEMPLATE_INFO (decl
) = build_template_info (tmpl
, targs
);
2723 /* Inherit default function arguments from the template
2724 DECL is specializing. */
2725 copy_default_args_to_explicit_spec (decl
);
2727 /* This specialization has the same protection as the
2728 template it specializes. */
2729 TREE_PRIVATE (decl
) = TREE_PRIVATE (gen_tmpl
);
2730 TREE_PROTECTED (decl
) = TREE_PROTECTED (gen_tmpl
);
2732 /* 7.1.1-1 [dcl.stc]
2734 A storage-class-specifier shall not be specified in an
2735 explicit specialization...
2737 The parser rejects these, so unless action is taken here,
2738 explicit function specializations will always appear with
2741 The action recommended by the C++ CWG in response to C++
2742 defect report 605 is to make the storage class and linkage
2743 of the explicit specialization match the templated function:
2745 http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_active.html#605
2747 if (tsk
== tsk_expl_spec
&& DECL_FUNCTION_TEMPLATE_P (gen_tmpl
))
2749 tree tmpl_func
= DECL_TEMPLATE_RESULT (gen_tmpl
);
2750 gcc_assert (TREE_CODE (tmpl_func
) == FUNCTION_DECL
);
2752 /* This specialization has the same linkage and visibility as
2753 the function template it specializes. */
2754 TREE_PUBLIC (decl
) = TREE_PUBLIC (tmpl_func
);
2755 if (! TREE_PUBLIC (decl
))
2757 DECL_INTERFACE_KNOWN (decl
) = 1;
2758 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2760 DECL_THIS_STATIC (decl
) = DECL_THIS_STATIC (tmpl_func
);
2761 if (DECL_VISIBILITY_SPECIFIED (tmpl_func
))
2763 DECL_VISIBILITY_SPECIFIED (decl
) = 1;
2764 DECL_VISIBILITY (decl
) = DECL_VISIBILITY (tmpl_func
);
2768 /* If DECL is a friend declaration, declared using an
2769 unqualified name, the namespace associated with DECL may
2770 have been set incorrectly. For example, in:
2772 template <typename T> void f(T);
2774 struct S { friend void f<int>(int); }
2777 we will have set the DECL_CONTEXT for the friend
2778 declaration to N, rather than to the global namespace. */
2779 if (DECL_NAMESPACE_SCOPE_P (decl
))
2780 DECL_CONTEXT (decl
) = DECL_CONTEXT (tmpl
);
2782 if (is_friend
&& !have_def
)
2783 /* This is not really a declaration of a specialization.
2784 It's just the name of an instantiation. But, it's not
2785 a request for an instantiation, either. */
2786 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
2788 /* Register this specialization so that we can find it
2790 decl
= register_specialization (decl
, gen_tmpl
, targs
, is_friend
, 0);
2792 /* A 'structor should already have clones. */
2793 gcc_assert (decl
== error_mark_node
2794 || !(DECL_CONSTRUCTOR_P (decl
)
2795 || DECL_DESTRUCTOR_P (decl
))
2796 || DECL_CLONED_FUNCTION_P (DECL_CHAIN (decl
)));
2803 /* Returns 1 iff PARMS1 and PARMS2 are identical sets of template
2804 parameters. These are represented in the same format used for
2805 DECL_TEMPLATE_PARMS. */
2808 comp_template_parms (const_tree parms1
, const_tree parms2
)
2813 if (parms1
== parms2
)
2816 for (p1
= parms1
, p2
= parms2
;
2817 p1
!= NULL_TREE
&& p2
!= NULL_TREE
;
2818 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
))
2820 tree t1
= TREE_VALUE (p1
);
2821 tree t2
= TREE_VALUE (p2
);
2824 gcc_assert (TREE_CODE (t1
) == TREE_VEC
);
2825 gcc_assert (TREE_CODE (t2
) == TREE_VEC
);
2827 if (TREE_VEC_LENGTH (t1
) != TREE_VEC_LENGTH (t2
))
2830 for (i
= 0; i
< TREE_VEC_LENGTH (t2
); ++i
)
2832 tree parm1
= TREE_VALUE (TREE_VEC_ELT (t1
, i
));
2833 tree parm2
= TREE_VALUE (TREE_VEC_ELT (t2
, i
));
2835 /* If either of the template parameters are invalid, assume
2836 they match for the sake of error recovery. */
2837 if (error_operand_p (parm1
) || error_operand_p (parm2
))
2840 if (TREE_CODE (parm1
) != TREE_CODE (parm2
))
2843 if (TREE_CODE (parm1
) == TEMPLATE_TYPE_PARM
2844 && (TEMPLATE_TYPE_PARAMETER_PACK (parm1
)
2845 == TEMPLATE_TYPE_PARAMETER_PACK (parm2
)))
2847 else if (!same_type_p (TREE_TYPE (parm1
), TREE_TYPE (parm2
)))
2852 if ((p1
!= NULL_TREE
) != (p2
!= NULL_TREE
))
2853 /* One set of parameters has more parameters lists than the
2860 /* Determine whether PARM is a parameter pack. */
2863 template_parameter_pack_p (const_tree parm
)
2865 /* Determine if we have a non-type template parameter pack. */
2866 if (TREE_CODE (parm
) == PARM_DECL
)
2867 return (DECL_TEMPLATE_PARM_P (parm
)
2868 && TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)));
2869 if (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
)
2870 return TEMPLATE_PARM_PARAMETER_PACK (parm
);
2872 /* If this is a list of template parameters, we could get a
2873 TYPE_DECL or a TEMPLATE_DECL. */
2874 if (TREE_CODE (parm
) == TYPE_DECL
|| TREE_CODE (parm
) == TEMPLATE_DECL
)
2875 parm
= TREE_TYPE (parm
);
2877 /* Otherwise it must be a type template parameter. */
2878 return ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
2879 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
2880 && TEMPLATE_TYPE_PARAMETER_PACK (parm
));
2883 /* Determine if T is a function parameter pack. */
2886 function_parameter_pack_p (const_tree t
)
2888 if (t
&& TREE_CODE (t
) == PARM_DECL
)
2889 return DECL_PACK_P (t
);
2893 /* Return the function template declaration of PRIMARY_FUNC_TMPL_INST.
2894 PRIMARY_FUNC_TMPL_INST is a primary function template instantiation. */
2897 get_function_template_decl (const_tree primary_func_tmpl_inst
)
2899 if (! primary_func_tmpl_inst
2900 || TREE_CODE (primary_func_tmpl_inst
) != FUNCTION_DECL
2901 || ! primary_template_instantiation_p (primary_func_tmpl_inst
))
2904 return DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (primary_func_tmpl_inst
));
2907 /* Return true iff the function parameter PARAM_DECL was expanded
2908 from the function parameter pack PACK. */
2911 function_parameter_expanded_from_pack_p (tree param_decl
, tree pack
)
2913 if (DECL_ARTIFICIAL (param_decl
)
2914 || !function_parameter_pack_p (pack
))
2917 /* The parameter pack and its pack arguments have the same
2919 return DECL_PARM_INDEX (pack
) == DECL_PARM_INDEX (param_decl
);
2922 /* Determine whether ARGS describes a variadic template args list,
2923 i.e., one that is terminated by a template argument pack. */
2926 template_args_variadic_p (tree args
)
2931 if (args
== NULL_TREE
)
2934 args
= INNERMOST_TEMPLATE_ARGS (args
);
2935 nargs
= TREE_VEC_LENGTH (args
);
2940 last_parm
= TREE_VEC_ELT (args
, nargs
- 1);
2942 return ARGUMENT_PACK_P (last_parm
);
2945 /* Generate a new name for the parameter pack name NAME (an
2946 IDENTIFIER_NODE) that incorporates its */
2949 make_ith_pack_parameter_name (tree name
, int i
)
2951 /* Munge the name to include the parameter index. */
2952 #define NUMBUF_LEN 128
2953 char numbuf
[NUMBUF_LEN
];
2957 if (name
== NULL_TREE
)
2959 snprintf (numbuf
, NUMBUF_LEN
, "%i", i
);
2960 newname_len
= IDENTIFIER_LENGTH (name
)
2961 + strlen (numbuf
) + 2;
2962 newname
= (char*)alloca (newname_len
);
2963 snprintf (newname
, newname_len
,
2964 "%s#%i", IDENTIFIER_POINTER (name
), i
);
2965 return get_identifier (newname
);
2968 /* Return true if T is a primary function, class or alias template
2972 primary_template_instantiation_p (const_tree t
)
2977 if (TREE_CODE (t
) == FUNCTION_DECL
)
2978 return DECL_LANG_SPECIFIC (t
)
2979 && DECL_TEMPLATE_INSTANTIATION (t
)
2980 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (t
));
2981 else if (CLASS_TYPE_P (t
) && !TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
2982 return CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
2983 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
));
2984 else if (alias_template_specialization_p (t
))
2989 /* Return true if PARM is a template template parameter. */
2992 template_template_parameter_p (const_tree parm
)
2994 return DECL_TEMPLATE_TEMPLATE_PARM_P (parm
);
2997 /* Return true iff PARM is a DECL representing a type template
3001 template_type_parameter_p (const_tree parm
)
3004 && (TREE_CODE (parm
) == TYPE_DECL
3005 || TREE_CODE (parm
) == TEMPLATE_DECL
)
3006 && DECL_TEMPLATE_PARM_P (parm
));
3009 /* Return the template parameters of T if T is a
3010 primary template instantiation, NULL otherwise. */
3013 get_primary_template_innermost_parameters (const_tree t
)
3015 tree parms
= NULL
, template_info
= NULL
;
3017 if ((template_info
= get_template_info (t
))
3018 && primary_template_instantiation_p (t
))
3019 parms
= INNERMOST_TEMPLATE_PARMS
3020 (DECL_TEMPLATE_PARMS (TI_TEMPLATE (template_info
)));
3025 /* Return the template parameters of the LEVELth level from the full list
3026 of template parameters PARMS. */
3029 get_template_parms_at_level (tree parms
, int level
)
3033 || TREE_CODE (parms
) != TREE_LIST
3034 || level
> TMPL_PARMS_DEPTH (parms
))
3037 for (p
= parms
; p
; p
= TREE_CHAIN (p
))
3038 if (TMPL_PARMS_DEPTH (p
) == level
)
3044 /* Returns the template arguments of T if T is a template instantiation,
3048 get_template_innermost_arguments (const_tree t
)
3050 tree args
= NULL
, template_info
= NULL
;
3052 if ((template_info
= get_template_info (t
))
3053 && TI_ARGS (template_info
))
3054 args
= INNERMOST_TEMPLATE_ARGS (TI_ARGS (template_info
));
3059 /* Return the argument pack elements of T if T is a template argument pack,
3063 get_template_argument_pack_elems (const_tree t
)
3065 if (TREE_CODE (t
) != TYPE_ARGUMENT_PACK
3066 && TREE_CODE (t
) != NONTYPE_ARGUMENT_PACK
)
3069 return ARGUMENT_PACK_ARGS (t
);
3072 /* Structure used to track the progress of find_parameter_packs_r. */
3073 struct find_parameter_pack_data
3075 /* TREE_LIST that will contain all of the parameter packs found by
3077 tree
* parameter_packs
;
3079 /* Set of AST nodes that have been visited by the traversal. */
3080 struct pointer_set_t
*visited
;
3083 /* Identifies all of the argument packs that occur in a template
3084 argument and appends them to the TREE_LIST inside DATA, which is a
3085 find_parameter_pack_data structure. This is a subroutine of
3086 make_pack_expansion and uses_parameter_packs. */
3088 find_parameter_packs_r (tree
*tp
, int *walk_subtrees
, void* data
)
3091 struct find_parameter_pack_data
* ppd
=
3092 (struct find_parameter_pack_data
*)data
;
3093 bool parameter_pack_p
= false;
3095 /* Handle type aliases/typedefs. */
3096 if (TYPE_ALIAS_P (t
))
3098 if (TYPE_TEMPLATE_INFO (t
))
3099 cp_walk_tree (&TYPE_TI_ARGS (t
),
3100 &find_parameter_packs_r
,
3106 /* Identify whether this is a parameter pack or not. */
3107 switch (TREE_CODE (t
))
3109 case TEMPLATE_PARM_INDEX
:
3110 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3111 parameter_pack_p
= true;
3114 case TEMPLATE_TYPE_PARM
:
3115 t
= TYPE_MAIN_VARIANT (t
);
3116 case TEMPLATE_TEMPLATE_PARM
:
3117 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3118 parameter_pack_p
= true;
3123 if (DECL_PACK_P (t
))
3125 /* We don't want to walk into the type of a PARM_DECL,
3126 because we don't want to see the type parameter pack. */
3128 parameter_pack_p
= true;
3132 /* Look through a lambda capture proxy to the field pack. */
3134 if (DECL_HAS_VALUE_EXPR_P (t
))
3136 tree v
= DECL_VALUE_EXPR (t
);
3138 &find_parameter_packs_r
,
3145 parameter_pack_p
= true;
3148 /* Not a parameter pack. */
3152 if (parameter_pack_p
)
3154 /* Add this parameter pack to the list. */
3155 *ppd
->parameter_packs
= tree_cons (NULL_TREE
, t
, *ppd
->parameter_packs
);
3159 cp_walk_tree (&TYPE_CONTEXT (t
),
3160 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3162 /* This switch statement will return immediately if we don't find a
3164 switch (TREE_CODE (t
))
3166 case TEMPLATE_PARM_INDEX
:
3169 case BOUND_TEMPLATE_TEMPLATE_PARM
:
3170 /* Check the template itself. */
3171 cp_walk_tree (&TREE_TYPE (TYPE_TI_TEMPLATE (t
)),
3172 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3173 /* Check the template arguments. */
3174 cp_walk_tree (&TYPE_TI_ARGS (t
), &find_parameter_packs_r
, ppd
,
3179 case TEMPLATE_TYPE_PARM
:
3180 case TEMPLATE_TEMPLATE_PARM
:
3187 if (TYPE_PTRMEMFUNC_P (t
))
3193 if (TYPE_TEMPLATE_INFO (t
))
3194 cp_walk_tree (&TYPE_TI_ARGS (t
),
3195 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3202 cp_walk_tree (&TREE_TYPE (t
),
3203 &find_parameter_packs_r
, ppd
, ppd
->visited
);
3207 cp_walk_tree (&TYPENAME_TYPE_FULLNAME (t
), &find_parameter_packs_r
,
3212 case TYPE_PACK_EXPANSION
:
3213 case EXPR_PACK_EXPANSION
:
3218 cp_walk_tree (&TYPE_MAX_VALUE (t
), &find_parameter_packs_r
,
3223 case IDENTIFIER_NODE
:
3224 cp_walk_tree (&TREE_TYPE (t
), &find_parameter_packs_r
, ppd
,
3236 /* Determines if the expression or type T uses any parameter packs. */
3238 uses_parameter_packs (tree t
)
3240 tree parameter_packs
= NULL_TREE
;
3241 struct find_parameter_pack_data ppd
;
3242 ppd
.parameter_packs
= ¶meter_packs
;
3243 ppd
.visited
= pointer_set_create ();
3244 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3245 pointer_set_destroy (ppd
.visited
);
3246 return parameter_packs
!= NULL_TREE
;
3249 /* Turn ARG, which may be an expression, type, or a TREE_LIST
3250 representation a base-class initializer into a parameter pack
3251 expansion. If all goes well, the resulting node will be an
3252 EXPR_PACK_EXPANSION, TYPE_PACK_EXPANSION, or TREE_LIST,
3255 make_pack_expansion (tree arg
)
3258 tree parameter_packs
= NULL_TREE
;
3259 bool for_types
= false;
3260 struct find_parameter_pack_data ppd
;
3262 if (!arg
|| arg
== error_mark_node
)
3265 if (TREE_CODE (arg
) == TREE_LIST
)
3267 /* The only time we will see a TREE_LIST here is for a base
3268 class initializer. In this case, the TREE_PURPOSE will be a
3269 _TYPE node (representing the base class expansion we're
3270 initializing) and the TREE_VALUE will be a TREE_LIST
3271 containing the initialization arguments.
3273 The resulting expansion looks somewhat different from most
3274 expansions. Rather than returning just one _EXPANSION, we
3275 return a TREE_LIST whose TREE_PURPOSE is a
3276 TYPE_PACK_EXPANSION containing the bases that will be
3277 initialized. The TREE_VALUE will be identical to the
3278 original TREE_VALUE, which is a list of arguments that will
3279 be passed to each base. We do not introduce any new pack
3280 expansion nodes into the TREE_VALUE (although it is possible
3281 that some already exist), because the TREE_PURPOSE and
3282 TREE_VALUE all need to be expanded together with the same
3283 _EXPANSION node. Note that the TYPE_PACK_EXPANSION in the
3284 resulting TREE_PURPOSE will mention the parameter packs in
3285 both the bases and the arguments to the bases. */
3288 tree parameter_packs
= NULL_TREE
;
3290 /* Determine which parameter packs will be used by the base
3292 ppd
.visited
= pointer_set_create ();
3293 ppd
.parameter_packs
= ¶meter_packs
;
3294 cp_walk_tree (&TREE_PURPOSE (arg
), &find_parameter_packs_r
,
3297 if (parameter_packs
== NULL_TREE
)
3299 error ("base initializer expansion %<%T%> contains no parameter packs", arg
);
3300 pointer_set_destroy (ppd
.visited
);
3301 return error_mark_node
;
3304 if (TREE_VALUE (arg
) != void_type_node
)
3306 /* Collect the sets of parameter packs used in each of the
3307 initialization arguments. */
3308 for (value
= TREE_VALUE (arg
); value
; value
= TREE_CHAIN (value
))
3310 /* Determine which parameter packs will be expanded in this
3312 cp_walk_tree (&TREE_VALUE (value
), &find_parameter_packs_r
,
3317 pointer_set_destroy (ppd
.visited
);
3319 /* Create the pack expansion type for the base type. */
3320 purpose
= cxx_make_type (TYPE_PACK_EXPANSION
);
3321 SET_PACK_EXPANSION_PATTERN (purpose
, TREE_PURPOSE (arg
));
3322 PACK_EXPANSION_PARAMETER_PACKS (purpose
) = parameter_packs
;
3324 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3325 they will rarely be compared to anything. */
3326 SET_TYPE_STRUCTURAL_EQUALITY (purpose
);
3328 return tree_cons (purpose
, TREE_VALUE (arg
), NULL_TREE
);
3331 if (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
)
3334 /* Build the PACK_EXPANSION_* node. */
3336 ? cxx_make_type (TYPE_PACK_EXPANSION
)
3337 : make_node (EXPR_PACK_EXPANSION
);
3338 SET_PACK_EXPANSION_PATTERN (result
, arg
);
3339 if (TREE_CODE (result
) == EXPR_PACK_EXPANSION
)
3341 /* Propagate type and const-expression information. */
3342 TREE_TYPE (result
) = TREE_TYPE (arg
);
3343 TREE_CONSTANT (result
) = TREE_CONSTANT (arg
);
3346 /* Just use structural equality for these TYPE_PACK_EXPANSIONS;
3347 they will rarely be compared to anything. */
3348 SET_TYPE_STRUCTURAL_EQUALITY (result
);
3350 /* Determine which parameter packs will be expanded. */
3351 ppd
.parameter_packs
= ¶meter_packs
;
3352 ppd
.visited
= pointer_set_create ();
3353 cp_walk_tree (&arg
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3354 pointer_set_destroy (ppd
.visited
);
3356 /* Make sure we found some parameter packs. */
3357 if (parameter_packs
== NULL_TREE
)
3360 error ("expansion pattern %<%T%> contains no argument packs", arg
);
3362 error ("expansion pattern %<%E%> contains no argument packs", arg
);
3363 return error_mark_node
;
3365 PACK_EXPANSION_PARAMETER_PACKS (result
) = parameter_packs
;
3367 PACK_EXPANSION_LOCAL_P (result
) = at_function_scope_p ();
3372 /* Checks T for any "bare" parameter packs, which have not yet been
3373 expanded, and issues an error if any are found. This operation can
3374 only be done on full expressions or types (e.g., an expression
3375 statement, "if" condition, etc.), because we could have expressions like:
3377 foo(f(g(h(args)))...)
3379 where "args" is a parameter pack. check_for_bare_parameter_packs
3380 should not be called for the subexpressions args, h(args),
3381 g(h(args)), or f(g(h(args))), because we would produce erroneous
3384 Returns TRUE and emits an error if there were bare parameter packs,
3385 returns FALSE otherwise. */
3387 check_for_bare_parameter_packs (tree t
)
3389 tree parameter_packs
= NULL_TREE
;
3390 struct find_parameter_pack_data ppd
;
3392 if (!processing_template_decl
|| !t
|| t
== error_mark_node
)
3395 if (TREE_CODE (t
) == TYPE_DECL
)
3398 ppd
.parameter_packs
= ¶meter_packs
;
3399 ppd
.visited
= pointer_set_create ();
3400 cp_walk_tree (&t
, &find_parameter_packs_r
, &ppd
, ppd
.visited
);
3401 pointer_set_destroy (ppd
.visited
);
3403 if (parameter_packs
)
3405 error ("parameter packs not expanded with %<...%>:");
3406 while (parameter_packs
)
3408 tree pack
= TREE_VALUE (parameter_packs
);
3409 tree name
= NULL_TREE
;
3411 if (TREE_CODE (pack
) == TEMPLATE_TYPE_PARM
3412 || TREE_CODE (pack
) == TEMPLATE_TEMPLATE_PARM
)
3413 name
= TYPE_NAME (pack
);
3414 else if (TREE_CODE (pack
) == TEMPLATE_PARM_INDEX
)
3415 name
= DECL_NAME (TEMPLATE_PARM_DECL (pack
));
3417 name
= DECL_NAME (pack
);
3420 inform (input_location
, " %qD", name
);
3422 inform (input_location
, " <anonymous>");
3424 parameter_packs
= TREE_CHAIN (parameter_packs
);
3433 /* Expand any parameter packs that occur in the template arguments in
3436 expand_template_argument_pack (tree args
)
3438 tree result_args
= NULL_TREE
;
3439 int in_arg
, out_arg
= 0, nargs
= args
? TREE_VEC_LENGTH (args
) : 0;
3440 int num_result_args
= -1;
3441 int non_default_args_count
= -1;
3443 /* First, determine if we need to expand anything, and the number of
3444 slots we'll need. */
3445 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3447 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3448 if (arg
== NULL_TREE
)
3450 if (ARGUMENT_PACK_P (arg
))
3452 int num_packed
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
));
3453 if (num_result_args
< 0)
3454 num_result_args
= in_arg
+ num_packed
;
3456 num_result_args
+= num_packed
;
3460 if (num_result_args
>= 0)
3465 /* If no expansion is necessary, we're done. */
3466 if (num_result_args
< 0)
3469 /* Expand arguments. */
3470 result_args
= make_tree_vec (num_result_args
);
3471 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
))
3472 non_default_args_count
=
3473 GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (args
);
3474 for (in_arg
= 0; in_arg
< nargs
; ++in_arg
)
3476 tree arg
= TREE_VEC_ELT (args
, in_arg
);
3477 if (ARGUMENT_PACK_P (arg
))
3479 tree packed
= ARGUMENT_PACK_ARGS (arg
);
3480 int i
, num_packed
= TREE_VEC_LENGTH (packed
);
3481 for (i
= 0; i
< num_packed
; ++i
, ++out_arg
)
3482 TREE_VEC_ELT (result_args
, out_arg
) = TREE_VEC_ELT(packed
, i
);
3483 if (non_default_args_count
> 0)
3484 non_default_args_count
+= num_packed
- 1;
3488 TREE_VEC_ELT (result_args
, out_arg
) = arg
;
3492 if (non_default_args_count
>= 0)
3493 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (result_args
, non_default_args_count
);
3497 /* Checks if DECL shadows a template parameter.
3499 [temp.local]: A template-parameter shall not be redeclared within its
3500 scope (including nested scopes).
3502 Emits an error and returns TRUE if the DECL shadows a parameter,
3503 returns FALSE otherwise. */
3506 check_template_shadow (tree decl
)
3510 /* If we're not in a template, we can't possibly shadow a template
3512 if (!current_template_parms
)
3515 /* Figure out what we're shadowing. */
3516 if (TREE_CODE (decl
) == OVERLOAD
)
3517 decl
= OVL_CURRENT (decl
);
3518 olddecl
= innermost_non_namespace_value (DECL_NAME (decl
));
3520 /* If there's no previous binding for this name, we're not shadowing
3521 anything, let alone a template parameter. */
3525 /* If we're not shadowing a template parameter, we're done. Note
3526 that OLDDECL might be an OVERLOAD (or perhaps even an
3527 ERROR_MARK), so we can't just blithely assume it to be a _DECL
3529 if (!DECL_P (olddecl
) || !DECL_TEMPLATE_PARM_P (olddecl
))
3532 /* We check for decl != olddecl to avoid bogus errors for using a
3533 name inside a class. We check TPFI to avoid duplicate errors for
3534 inline member templates. */
3536 || (DECL_TEMPLATE_PARM_P (decl
)
3537 && TEMPLATE_PARMS_FOR_INLINE (current_template_parms
)))
3540 /* Don't complain about the injected class name, as we've already
3541 complained about the class itself. */
3542 if (DECL_SELF_REFERENCE_P (decl
))
3545 error ("declaration of %q+#D", decl
);
3546 error (" shadows template parm %q+#D", olddecl
);
3550 /* Return a new TEMPLATE_PARM_INDEX with the indicated INDEX, LEVEL,
3551 ORIG_LEVEL, DECL, and TYPE. */
3554 build_template_parm_index (int index
,
3560 tree t
= make_node (TEMPLATE_PARM_INDEX
);
3561 TEMPLATE_PARM_IDX (t
) = index
;
3562 TEMPLATE_PARM_LEVEL (t
) = level
;
3563 TEMPLATE_PARM_ORIG_LEVEL (t
) = orig_level
;
3564 TEMPLATE_PARM_DECL (t
) = decl
;
3565 TREE_TYPE (t
) = type
;
3566 TREE_CONSTANT (t
) = TREE_CONSTANT (decl
);
3567 TREE_READONLY (t
) = TREE_READONLY (decl
);
3572 /* Find the canonical type parameter for the given template type
3573 parameter. Returns the canonical type parameter, which may be TYPE
3574 if no such parameter existed. */
3577 canonical_type_parameter (tree type
)
3580 int idx
= TEMPLATE_TYPE_IDX (type
);
3581 if (!canonical_template_parms
)
3582 vec_alloc (canonical_template_parms
, idx
+1);
3584 while (canonical_template_parms
->length () <= (unsigned)idx
)
3585 vec_safe_push (canonical_template_parms
, NULL_TREE
);
3587 list
= (*canonical_template_parms
)[idx
];
3588 while (list
&& !comptypes (type
, TREE_VALUE (list
), COMPARE_STRUCTURAL
))
3589 list
= TREE_CHAIN (list
);
3592 return TREE_VALUE (list
);
3595 (*canonical_template_parms
)[idx
]
3596 = tree_cons (NULL_TREE
, type
,
3597 (*canonical_template_parms
)[idx
]);
3602 /* Return a TEMPLATE_PARM_INDEX, similar to INDEX, but whose
3603 TEMPLATE_PARM_LEVEL has been decreased by LEVELS. If such a
3604 TEMPLATE_PARM_INDEX already exists, it is returned; otherwise, a
3605 new one is created. */
3608 reduce_template_parm_level (tree index
, tree type
, int levels
, tree args
,
3609 tsubst_flags_t complain
)
3611 if (TEMPLATE_PARM_DESCENDANTS (index
) == NULL_TREE
3612 || (TEMPLATE_PARM_LEVEL (TEMPLATE_PARM_DESCENDANTS (index
))
3613 != TEMPLATE_PARM_LEVEL (index
) - levels
)
3614 || !same_type_p (type
, TREE_TYPE (TEMPLATE_PARM_DESCENDANTS (index
))))
3616 tree orig_decl
= TEMPLATE_PARM_DECL (index
);
3619 decl
= build_decl (DECL_SOURCE_LOCATION (orig_decl
),
3620 TREE_CODE (orig_decl
), DECL_NAME (orig_decl
), type
);
3621 TREE_CONSTANT (decl
) = TREE_CONSTANT (orig_decl
);
3622 TREE_READONLY (decl
) = TREE_READONLY (orig_decl
);
3623 DECL_ARTIFICIAL (decl
) = 1;
3624 SET_DECL_TEMPLATE_PARM_P (decl
);
3626 t
= build_template_parm_index (TEMPLATE_PARM_IDX (index
),
3627 TEMPLATE_PARM_LEVEL (index
) - levels
,
3628 TEMPLATE_PARM_ORIG_LEVEL (index
),
3630 TEMPLATE_PARM_DESCENDANTS (index
) = t
;
3631 TEMPLATE_PARM_PARAMETER_PACK (t
)
3632 = TEMPLATE_PARM_PARAMETER_PACK (index
);
3634 /* Template template parameters need this. */
3635 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3636 DECL_TEMPLATE_PARMS (decl
) = tsubst_template_parms
3637 (DECL_TEMPLATE_PARMS (TEMPLATE_PARM_DECL (index
)),
3641 return TEMPLATE_PARM_DESCENDANTS (index
);
3644 /* Process information from new template parameter PARM and append it
3645 to the LIST being built. This new parameter is a non-type
3646 parameter iff IS_NON_TYPE is true. This new parameter is a
3647 parameter pack iff IS_PARAMETER_PACK is true. The location of PARM
3651 process_template_parm (tree list
, location_t parm_loc
, tree parm
,
3652 bool is_non_type
, bool is_parameter_pack
)
3658 gcc_assert (TREE_CODE (parm
) == TREE_LIST
);
3659 defval
= TREE_PURPOSE (parm
);
3663 tree p
= tree_last (list
);
3665 if (p
&& TREE_VALUE (p
) != error_mark_node
)
3668 if (TREE_CODE (p
) == TYPE_DECL
|| TREE_CODE (p
) == TEMPLATE_DECL
)
3669 idx
= TEMPLATE_TYPE_IDX (TREE_TYPE (p
));
3671 idx
= TEMPLATE_PARM_IDX (DECL_INITIAL (p
));
3679 parm
= TREE_VALUE (parm
);
3681 SET_DECL_TEMPLATE_PARM_P (parm
);
3683 if (TREE_TYPE (parm
) != error_mark_node
)
3687 The top-level cv-qualifiers on the template-parameter are
3688 ignored when determining its type. */
3689 TREE_TYPE (parm
) = TYPE_MAIN_VARIANT (TREE_TYPE (parm
));
3690 if (invalid_nontype_parm_type_p (TREE_TYPE (parm
), 1))
3691 TREE_TYPE (parm
) = error_mark_node
;
3692 else if (uses_parameter_packs (TREE_TYPE (parm
))
3693 && !is_parameter_pack
3694 /* If we're in a nested template parameter list, the template
3695 template parameter could be a parameter pack. */
3696 && processing_template_parmlist
== 1)
3698 /* This template parameter is not a parameter pack, but it
3699 should be. Complain about "bare" parameter packs. */
3700 check_for_bare_parameter_packs (TREE_TYPE (parm
));
3702 /* Recover by calling this a parameter pack. */
3703 is_parameter_pack
= true;
3707 /* A template parameter is not modifiable. */
3708 TREE_CONSTANT (parm
) = 1;
3709 TREE_READONLY (parm
) = 1;
3710 decl
= build_decl (parm_loc
,
3711 CONST_DECL
, DECL_NAME (parm
), TREE_TYPE (parm
));
3712 TREE_CONSTANT (decl
) = 1;
3713 TREE_READONLY (decl
) = 1;
3714 DECL_INITIAL (parm
) = DECL_INITIAL (decl
)
3715 = build_template_parm_index (idx
, processing_template_decl
,
3716 processing_template_decl
,
3717 decl
, TREE_TYPE (parm
));
3719 TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
))
3720 = is_parameter_pack
;
3725 parm
= TREE_VALUE (TREE_VALUE (parm
));
3727 if (parm
&& TREE_CODE (parm
) == TEMPLATE_DECL
)
3729 t
= cxx_make_type (TEMPLATE_TEMPLATE_PARM
);
3730 /* This is for distinguishing between real templates and template
3731 template parameters */
3732 TREE_TYPE (parm
) = t
;
3733 TREE_TYPE (DECL_TEMPLATE_RESULT (parm
)) = t
;
3738 t
= cxx_make_type (TEMPLATE_TYPE_PARM
);
3739 /* parm is either IDENTIFIER_NODE or NULL_TREE. */
3740 decl
= build_decl (parm_loc
,
3741 TYPE_DECL
, parm
, t
);
3744 TYPE_NAME (t
) = decl
;
3745 TYPE_STUB_DECL (t
) = decl
;
3747 TEMPLATE_TYPE_PARM_INDEX (t
)
3748 = build_template_parm_index (idx
, processing_template_decl
,
3749 processing_template_decl
,
3750 decl
, TREE_TYPE (parm
));
3751 TEMPLATE_TYPE_PARAMETER_PACK (t
) = is_parameter_pack
;
3752 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
3754 DECL_ARTIFICIAL (decl
) = 1;
3755 SET_DECL_TEMPLATE_PARM_P (decl
);
3757 parm
= build_tree_list (defval
, parm
);
3758 return chainon (list
, parm
);
3761 /* The end of a template parameter list has been reached. Process the
3762 tree list into a parameter vector, converting each parameter into a more
3763 useful form. Type parameters are saved as IDENTIFIER_NODEs, and others
3767 end_template_parm_list (tree parms
)
3771 tree saved_parmlist
= make_tree_vec (list_length (parms
));
3773 current_template_parms
3774 = tree_cons (size_int (processing_template_decl
),
3775 saved_parmlist
, current_template_parms
);
3777 for (parm
= parms
, nparms
= 0; parm
; parm
= next
, nparms
++)
3779 next
= TREE_CHAIN (parm
);
3780 TREE_VEC_ELT (saved_parmlist
, nparms
) = parm
;
3781 TREE_CHAIN (parm
) = NULL_TREE
;
3784 --processing_template_parmlist
;
3786 return saved_parmlist
;
3789 /* end_template_decl is called after a template declaration is seen. */
3792 end_template_decl (void)
3794 reset_specialization ();
3796 if (! processing_template_decl
)
3799 /* This matches the pushlevel in begin_template_parm_list. */
3802 --processing_template_decl
;
3803 current_template_parms
= TREE_CHAIN (current_template_parms
);
3806 /* Takes a TREE_LIST representing a template parameter and convert it
3807 into an argument suitable to be passed to the type substitution
3808 functions. Note that If the TREE_LIST contains an error_mark
3809 node, the returned argument is error_mark_node. */
3812 template_parm_to_arg (tree t
)
3816 || TREE_CODE (t
) != TREE_LIST
)
3819 if (error_operand_p (TREE_VALUE (t
)))
3820 return error_mark_node
;
3824 if (TREE_CODE (t
) == TYPE_DECL
3825 || TREE_CODE (t
) == TEMPLATE_DECL
)
3829 if (TEMPLATE_TYPE_PARAMETER_PACK (t
))
3831 /* Turn this argument into a TYPE_ARGUMENT_PACK
3832 with a single element, which expands T. */
3833 tree vec
= make_tree_vec (1);
3834 #ifdef ENABLE_CHECKING
3835 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3836 (vec
, TREE_VEC_LENGTH (vec
));
3838 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3840 t
= cxx_make_type (TYPE_ARGUMENT_PACK
);
3841 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3846 t
= DECL_INITIAL (t
);
3848 if (TEMPLATE_PARM_PARAMETER_PACK (t
))
3850 /* Turn this argument into a NONTYPE_ARGUMENT_PACK
3851 with a single element, which expands T. */
3852 tree vec
= make_tree_vec (1);
3853 tree type
= TREE_TYPE (TEMPLATE_PARM_DECL (t
));
3854 #ifdef ENABLE_CHECKING
3855 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT
3856 (vec
, TREE_VEC_LENGTH (vec
));
3858 t
= convert_from_reference (t
);
3859 TREE_VEC_ELT (vec
, 0) = make_pack_expansion (t
);
3861 t
= make_node (NONTYPE_ARGUMENT_PACK
);
3862 SET_ARGUMENT_PACK_ARGS (t
, vec
);
3863 TREE_TYPE (t
) = type
;
3866 t
= convert_from_reference (t
);
3871 /* Given a set of template parameters, return them as a set of template
3872 arguments. The template parameters are represented as a TREE_VEC, in
3873 the form documented in cp-tree.h for template arguments. */
3876 template_parms_to_args (tree parms
)
3879 tree args
= NULL_TREE
;
3880 int length
= TMPL_PARMS_DEPTH (parms
);
3883 /* If there is only one level of template parameters, we do not
3884 create a TREE_VEC of TREE_VECs. Instead, we return a single
3885 TREE_VEC containing the arguments. */
3887 args
= make_tree_vec (length
);
3889 for (header
= parms
; header
; header
= TREE_CHAIN (header
))
3891 tree a
= copy_node (TREE_VALUE (header
));
3894 TREE_TYPE (a
) = NULL_TREE
;
3895 for (i
= TREE_VEC_LENGTH (a
) - 1; i
>= 0; --i
)
3896 TREE_VEC_ELT (a
, i
) = template_parm_to_arg (TREE_VEC_ELT (a
, i
));
3898 #ifdef ENABLE_CHECKING
3899 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (a
, TREE_VEC_LENGTH (a
));
3903 TREE_VEC_ELT (args
, --l
) = a
;
3908 if (length
> 1 && TREE_VEC_ELT (args
, 0) == NULL_TREE
)
3909 /* This can happen for template parms of a template template
3912 template<template<class T, class U> class TT> struct S;
3914 Consider the level of the parms of TT; T and U both have
3915 level 2; TT has no template parm of level 1. So in this case
3916 the first element of full_template_args is NULL_TREE. If we
3917 leave it like this TMPL_ARGS_DEPTH on args returns 1 instead
3918 of 2. This will make tsubst wrongly consider that T and U
3919 have level 1. Instead, let's create a dummy vector as the
3920 first element of full_template_args so that TMPL_ARGS_DEPTH
3921 returns the correct depth for args. */
3922 TREE_VEC_ELT (args
, 0) = make_tree_vec (1);
3926 /* Within the declaration of a template, return the currently active
3927 template parameters as an argument TREE_VEC. */
3930 current_template_args (void)
3932 return template_parms_to_args (current_template_parms
);
3935 /* Update the declared TYPE by doing any lookups which were thought to be
3936 dependent, but are not now that we know the SCOPE of the declarator. */
3939 maybe_update_decl_type (tree orig_type
, tree scope
)
3941 tree type
= orig_type
;
3943 if (type
== NULL_TREE
)
3946 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3947 type
= TREE_TYPE (type
);
3949 if (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
3950 && dependent_type_p (type
)
3951 /* Don't bother building up the args in this case. */
3952 && TREE_CODE (type
) != TEMPLATE_TYPE_PARM
)
3954 /* tsubst in the args corresponding to the template parameters,
3955 including auto if present. Most things will be unchanged, but
3956 make_typename_type and tsubst_qualified_id will resolve
3957 TYPENAME_TYPEs and SCOPE_REFs that were previously dependent. */
3958 tree args
= current_template_args ();
3959 tree auto_node
= type_uses_auto (type
);
3963 tree auto_vec
= make_tree_vec (1);
3964 TREE_VEC_ELT (auto_vec
, 0) = auto_node
;
3965 args
= add_to_template_args (args
, auto_vec
);
3967 pushed
= push_scope (scope
);
3968 type
= tsubst (type
, args
, tf_warning_or_error
, NULL_TREE
);
3973 if (type
== error_mark_node
)
3976 if (TREE_CODE (orig_type
) == TYPE_DECL
)
3978 if (same_type_p (type
, TREE_TYPE (orig_type
)))
3981 type
= TYPE_NAME (type
);
3986 /* Return a TEMPLATE_DECL corresponding to DECL, using the indicated
3987 template PARMS. If MEMBER_TEMPLATE_P is true, the new template is
3988 a member template. Used by push_template_decl below. */
3991 build_template_decl (tree decl
, tree parms
, bool member_template_p
)
3993 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, DECL_NAME (decl
), NULL_TREE
);
3994 DECL_TEMPLATE_PARMS (tmpl
) = parms
;
3995 DECL_CONTEXT (tmpl
) = DECL_CONTEXT (decl
);
3996 DECL_SOURCE_LOCATION (tmpl
) = DECL_SOURCE_LOCATION (decl
);
3997 DECL_MEMBER_TEMPLATE_P (tmpl
) = member_template_p
;
4002 struct template_parm_data
4004 /* The level of the template parameters we are currently
4008 /* The index of the specialization argument we are currently
4012 /* An array whose size is the number of template parameters. The
4013 elements are nonzero if the parameter has been used in any one
4014 of the arguments processed so far. */
4017 /* An array whose size is the number of template arguments. The
4018 elements are nonzero if the argument makes use of template
4019 parameters of this level. */
4020 int* arg_uses_template_parms
;
4023 /* Subroutine of push_template_decl used to see if each template
4024 parameter in a partial specialization is used in the explicit
4025 argument list. If T is of the LEVEL given in DATA (which is
4026 treated as a template_parm_data*), then DATA->PARMS is marked
4030 mark_template_parm (tree t
, void* data
)
4034 struct template_parm_data
* tpd
= (struct template_parm_data
*) data
;
4036 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4038 level
= TEMPLATE_PARM_LEVEL (t
);
4039 idx
= TEMPLATE_PARM_IDX (t
);
4043 level
= TEMPLATE_TYPE_LEVEL (t
);
4044 idx
= TEMPLATE_TYPE_IDX (t
);
4047 if (level
== tpd
->level
)
4049 tpd
->parms
[idx
] = 1;
4050 tpd
->arg_uses_template_parms
[tpd
->current_arg
] = 1;
4053 /* Return zero so that for_each_template_parm will continue the
4054 traversal of the tree; we want to mark *every* template parm. */
4058 /* Process the partial specialization DECL. */
4061 process_partial_specialization (tree decl
)
4063 tree type
= TREE_TYPE (decl
);
4064 tree maintmpl
= CLASSTYPE_TI_TEMPLATE (type
);
4065 tree specargs
= CLASSTYPE_TI_ARGS (type
);
4066 tree inner_args
= INNERMOST_TEMPLATE_ARGS (specargs
);
4067 tree main_inner_parms
= DECL_INNERMOST_TEMPLATE_PARMS (maintmpl
);
4070 int nargs
= TREE_VEC_LENGTH (inner_args
);
4073 bool did_error_intro
= false;
4074 struct template_parm_data tpd
;
4075 struct template_parm_data tpd2
;
4077 gcc_assert (current_template_parms
);
4079 inner_parms
= INNERMOST_TEMPLATE_PARMS (current_template_parms
);
4080 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4082 /* We check that each of the template parameters given in the
4083 partial specialization is used in the argument list to the
4084 specialization. For example:
4086 template <class T> struct S;
4087 template <class T> struct S<T*>;
4089 The second declaration is OK because `T*' uses the template
4090 parameter T, whereas
4092 template <class T> struct S<int>;
4094 is no good. Even trickier is:
4105 The S2<T> declaration is actually invalid; it is a
4106 full-specialization. Of course,
4109 struct S2<T (*)(U)>;
4111 or some such would have been OK. */
4112 tpd
.level
= TMPL_PARMS_DEPTH (current_template_parms
);
4113 tpd
.parms
= XALLOCAVEC (int, ntparms
);
4114 memset (tpd
.parms
, 0, sizeof (int) * ntparms
);
4116 tpd
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4117 memset (tpd
.arg_uses_template_parms
, 0, sizeof (int) * nargs
);
4118 for (i
= 0; i
< nargs
; ++i
)
4120 tpd
.current_arg
= i
;
4121 for_each_template_parm (TREE_VEC_ELT (inner_args
, i
),
4122 &mark_template_parm
,
4125 /*include_nondeduced_p=*/false);
4127 for (i
= 0; i
< ntparms
; ++i
)
4128 if (tpd
.parms
[i
] == 0)
4130 /* One of the template parms was not used in a deduced context in the
4132 if (!did_error_intro
)
4134 error ("template parameters not deducible in "
4135 "partial specialization:");
4136 did_error_intro
= true;
4139 inform (input_location
, " %qD",
4140 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
)));
4143 if (did_error_intro
)
4144 return error_mark_node
;
4146 /* [temp.class.spec]
4148 The argument list of the specialization shall not be identical to
4149 the implicit argument list of the primary template. */
4150 if (comp_template_args
4152 INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE
4154 error ("partial specialization %qT does not specialize any template arguments", type
);
4156 /* A partial specialization that replaces multiple parameters of the
4157 primary template with a pack expansion is less specialized for those
4159 if (nargs
< DECL_NTPARMS (maintmpl
))
4161 error ("partial specialization is not more specialized than the "
4162 "primary template because it replaces multiple parameters "
4163 "with a pack expansion");
4164 inform (DECL_SOURCE_LOCATION (maintmpl
), "primary template here");
4168 /* [temp.class.spec]
4170 A partially specialized non-type argument expression shall not
4171 involve template parameters of the partial specialization except
4172 when the argument expression is a simple identifier.
4174 The type of a template parameter corresponding to a specialized
4175 non-type argument shall not be dependent on a parameter of the
4178 Also, we verify that pack expansions only occur at the
4179 end of the argument list. */
4180 gcc_assert (nargs
== DECL_NTPARMS (maintmpl
));
4182 for (i
= 0; i
< nargs
; ++i
)
4184 tree parm
= TREE_VALUE (TREE_VEC_ELT (main_inner_parms
, i
));
4185 tree arg
= TREE_VEC_ELT (inner_args
, i
);
4186 tree packed_args
= NULL_TREE
;
4189 if (ARGUMENT_PACK_P (arg
))
4191 /* Extract the arguments from the argument pack. We'll be
4192 iterating over these in the following loop. */
4193 packed_args
= ARGUMENT_PACK_ARGS (arg
);
4194 len
= TREE_VEC_LENGTH (packed_args
);
4197 for (j
= 0; j
< len
; j
++)
4200 /* Get the Jth argument in the parameter pack. */
4201 arg
= TREE_VEC_ELT (packed_args
, j
);
4203 if (PACK_EXPANSION_P (arg
))
4205 /* Pack expansions must come at the end of the
4207 if ((packed_args
&& j
< len
- 1)
4208 || (!packed_args
&& i
< nargs
- 1))
4210 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4211 error ("parameter pack argument %qE must be at the "
4212 "end of the template argument list", arg
);
4214 error ("parameter pack argument %qT must be at the "
4215 "end of the template argument list", arg
);
4219 if (TREE_CODE (arg
) == EXPR_PACK_EXPANSION
)
4220 /* We only care about the pattern. */
4221 arg
= PACK_EXPANSION_PATTERN (arg
);
4223 if (/* These first two lines are the `non-type' bit. */
4225 && TREE_CODE (arg
) != TEMPLATE_DECL
4226 /* This next two lines are the `argument expression is not just a
4227 simple identifier' condition and also the `specialized
4228 non-type argument' bit. */
4229 && TREE_CODE (arg
) != TEMPLATE_PARM_INDEX
4230 && !(REFERENCE_REF_P (arg
)
4231 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_PARM_INDEX
))
4233 if ((!packed_args
&& tpd
.arg_uses_template_parms
[i
])
4234 || (packed_args
&& uses_template_parms (arg
)))
4235 error ("template argument %qE involves template parameter(s)",
4239 /* Look at the corresponding template parameter,
4240 marking which template parameters its type depends
4242 tree type
= TREE_TYPE (parm
);
4246 /* We haven't yet initialized TPD2. Do so now. */
4247 tpd2
.arg_uses_template_parms
= XALLOCAVEC (int, nargs
);
4248 /* The number of parameters here is the number in the
4249 main template, which, as checked in the assertion
4251 tpd2
.parms
= XALLOCAVEC (int, nargs
);
4253 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (maintmpl
));
4256 /* Mark the template parameters. But this time, we're
4257 looking for the template parameters of the main
4258 template, not in the specialization. */
4259 tpd2
.current_arg
= i
;
4260 tpd2
.arg_uses_template_parms
[i
] = 0;
4261 memset (tpd2
.parms
, 0, sizeof (int) * nargs
);
4262 for_each_template_parm (type
,
4263 &mark_template_parm
,
4266 /*include_nondeduced_p=*/false);
4268 if (tpd2
.arg_uses_template_parms
[i
])
4270 /* The type depended on some template parameters.
4271 If they are fully specialized in the
4272 specialization, that's OK. */
4275 for (j
= 0; j
< nargs
; ++j
)
4276 if (tpd2
.parms
[j
] != 0
4277 && tpd
.arg_uses_template_parms
[j
])
4280 error_n (input_location
, count
,
4281 "type %qT of template argument %qE depends "
4282 "on a template parameter",
4283 "type %qT of template argument %qE depends "
4284 "on template parameters",
4293 /* We should only get here once. */
4294 gcc_assert (!COMPLETE_TYPE_P (type
));
4296 tree tmpl
= build_template_decl (decl
, current_template_parms
,
4297 DECL_MEMBER_TEMPLATE_P (maintmpl
));
4298 TREE_TYPE (tmpl
) = type
;
4299 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4300 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4301 DECL_TEMPLATE_INFO (tmpl
) = build_template_info (maintmpl
, specargs
);
4302 DECL_PRIMARY_TEMPLATE (tmpl
) = maintmpl
;
4304 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)
4305 = tree_cons (specargs
, tmpl
,
4306 DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
));
4307 TREE_TYPE (DECL_TEMPLATE_SPECIALIZATIONS (maintmpl
)) = type
;
4309 for (inst
= DECL_TEMPLATE_INSTANTIATIONS (maintmpl
); inst
;
4310 inst
= TREE_CHAIN (inst
))
4312 tree inst_type
= TREE_VALUE (inst
);
4313 if (COMPLETE_TYPE_P (inst_type
)
4314 && CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type
))
4316 tree spec
= most_specialized_class (inst_type
, tf_none
);
4317 if (spec
&& TREE_TYPE (spec
) == type
)
4318 permerror (input_location
,
4319 "partial specialization of %qT after instantiation "
4320 "of %qT", type
, inst_type
);
4327 /* PARM is a template parameter of some form; return the corresponding
4328 TEMPLATE_PARM_INDEX. */
4331 get_template_parm_index (tree parm
)
4333 if (TREE_CODE (parm
) == PARM_DECL
4334 || TREE_CODE (parm
) == CONST_DECL
)
4335 parm
= DECL_INITIAL (parm
);
4336 else if (TREE_CODE (parm
) == TYPE_DECL
4337 || TREE_CODE (parm
) == TEMPLATE_DECL
)
4338 parm
= TREE_TYPE (parm
);
4339 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
4340 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
)
4341 parm
= TEMPLATE_TYPE_PARM_INDEX (parm
);
4342 gcc_assert (TREE_CODE (parm
) == TEMPLATE_PARM_INDEX
);
4346 /* Subroutine of fixed_parameter_pack_p below. Look for any template
4347 parameter packs used by the template parameter PARM. */
4350 fixed_parameter_pack_p_1 (tree parm
, struct find_parameter_pack_data
*ppd
)
4352 /* A type parm can't refer to another parm. */
4353 if (TREE_CODE (parm
) == TYPE_DECL
)
4355 else if (TREE_CODE (parm
) == PARM_DECL
)
4357 cp_walk_tree (&TREE_TYPE (parm
), &find_parameter_packs_r
,
4362 gcc_assert (TREE_CODE (parm
) == TEMPLATE_DECL
);
4364 tree vec
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (parm
));
4365 for (int i
= 0; i
< TREE_VEC_LENGTH (vec
); ++i
)
4366 fixed_parameter_pack_p_1 (TREE_VALUE (TREE_VEC_ELT (vec
, i
)), ppd
);
4369 /* PARM is a template parameter pack. Return any parameter packs used in
4370 its type or the type of any of its template parameters. If there are
4371 any such packs, it will be instantiated into a fixed template parameter
4372 list by partial instantiation rather than be fully deduced. */
4375 fixed_parameter_pack_p (tree parm
)
4377 /* This can only be true in a member template. */
4378 if (TEMPLATE_PARM_ORIG_LEVEL (get_template_parm_index (parm
)) < 2)
4380 /* This can only be true for a parameter pack. */
4381 if (!template_parameter_pack_p (parm
))
4383 /* A type parm can't refer to another parm. */
4384 if (TREE_CODE (parm
) == TYPE_DECL
)
4387 tree parameter_packs
= NULL_TREE
;
4388 struct find_parameter_pack_data ppd
;
4389 ppd
.parameter_packs
= ¶meter_packs
;
4390 ppd
.visited
= pointer_set_create ();
4392 fixed_parameter_pack_p_1 (parm
, &ppd
);
4394 pointer_set_destroy (ppd
.visited
);
4395 return parameter_packs
;
4398 /* Check that a template declaration's use of default arguments and
4399 parameter packs is not invalid. Here, PARMS are the template
4400 parameters. IS_PRIMARY is true if DECL is the thing declared by
4401 a primary template. IS_PARTIAL is true if DECL is a partial
4404 IS_FRIEND_DECL is nonzero if DECL is a friend function template
4405 declaration (but not a definition); 1 indicates a declaration, 2
4406 indicates a redeclaration. When IS_FRIEND_DECL=2, no errors are
4407 emitted for extraneous default arguments.
4409 Returns TRUE if there were no errors found, FALSE otherwise. */
4412 check_default_tmpl_args (tree decl
, tree parms
, bool is_primary
,
4413 bool is_partial
, int is_friend_decl
)
4416 int last_level_to_check
;
4418 bool no_errors
= true;
4422 A default template-argument shall not be specified in a
4423 function template declaration or a function template definition, nor
4424 in the template-parameter-list of the definition of a member of a
4427 if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
4428 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (decl
)))
4429 /* You can't have a function template declaration in a local
4430 scope, nor you can you define a member of a class template in a
4434 if ((TREE_CODE (decl
) == TYPE_DECL
4436 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4437 || (TREE_CODE (decl
) == FUNCTION_DECL
4438 && LAMBDA_FUNCTION_P (decl
)))
4439 /* A lambda doesn't have an explicit declaration; don't complain
4440 about the parms of the enclosing class. */
4443 if (current_class_type
4444 && !TYPE_BEING_DEFINED (current_class_type
)
4445 && DECL_LANG_SPECIFIC (decl
)
4446 && DECL_DECLARES_FUNCTION_P (decl
)
4447 /* If this is either a friend defined in the scope of the class
4448 or a member function. */
4449 && (DECL_FUNCTION_MEMBER_P (decl
)
4450 ? same_type_p (DECL_CONTEXT (decl
), current_class_type
)
4451 : DECL_FRIEND_CONTEXT (decl
)
4452 ? same_type_p (DECL_FRIEND_CONTEXT (decl
), current_class_type
)
4454 /* And, if it was a member function, it really was defined in
4455 the scope of the class. */
4456 && (!DECL_FUNCTION_MEMBER_P (decl
)
4457 || DECL_INITIALIZED_IN_CLASS_P (decl
)))
4458 /* We already checked these parameters when the template was
4459 declared, so there's no need to do it again now. This function
4460 was defined in class scope, but we're processing its body now
4461 that the class is complete. */
4464 /* Core issue 226 (C++0x only): the following only applies to class
4467 && ((cxx_dialect
== cxx98
) || TREE_CODE (decl
) != FUNCTION_DECL
))
4471 If a template-parameter has a default template-argument, all
4472 subsequent template-parameters shall have a default
4473 template-argument supplied. */
4474 for (parm_level
= parms
; parm_level
; parm_level
= TREE_CHAIN (parm_level
))
4476 tree inner_parms
= TREE_VALUE (parm_level
);
4477 int ntparms
= TREE_VEC_LENGTH (inner_parms
);
4478 int seen_def_arg_p
= 0;
4481 for (i
= 0; i
< ntparms
; ++i
)
4483 tree parm
= TREE_VEC_ELT (inner_parms
, i
);
4485 if (parm
== error_mark_node
)
4488 if (TREE_PURPOSE (parm
))
4490 else if (seen_def_arg_p
4491 && !template_parameter_pack_p (TREE_VALUE (parm
)))
4493 error ("no default argument for %qD", TREE_VALUE (parm
));
4494 /* For better subsequent error-recovery, we indicate that
4495 there should have been a default argument. */
4496 TREE_PURPOSE (parm
) = error_mark_node
;
4499 else if (!is_partial
4501 /* Don't complain about an enclosing partial
4503 && parm_level
== parms
4504 && TREE_CODE (decl
) == TYPE_DECL
4506 && template_parameter_pack_p (TREE_VALUE (parm
))
4507 /* A fixed parameter pack will be partially
4508 instantiated into a fixed length list. */
4509 && !fixed_parameter_pack_p (TREE_VALUE (parm
)))
4511 /* A primary class template can only have one
4512 parameter pack, at the end of the template
4515 if (TREE_CODE (TREE_VALUE (parm
)) == PARM_DECL
)
4516 error ("parameter pack %qE must be at the end of the"
4517 " template parameter list", TREE_VALUE (parm
));
4519 error ("parameter pack %qT must be at the end of the"
4520 " template parameter list",
4521 TREE_TYPE (TREE_VALUE (parm
)));
4523 TREE_VALUE (TREE_VEC_ELT (inner_parms
, i
))
4531 if (((cxx_dialect
== cxx98
) && TREE_CODE (decl
) != TYPE_DECL
)
4535 /* For an ordinary class template, default template arguments are
4536 allowed at the innermost level, e.g.:
4537 template <class T = int>
4539 but, in a partial specialization, they're not allowed even
4540 there, as we have in [temp.class.spec]:
4542 The template parameter list of a specialization shall not
4543 contain default template argument values.
4545 So, for a partial specialization, or for a function template
4546 (in C++98/C++03), we look at all of them. */
4549 /* But, for a primary class template that is not a partial
4550 specialization we look at all template parameters except the
4552 parms
= TREE_CHAIN (parms
);
4554 /* Figure out what error message to issue. */
4555 if (is_friend_decl
== 2)
4556 msg
= G_("default template arguments may not be used in function template "
4557 "friend re-declaration");
4558 else if (is_friend_decl
)
4559 msg
= G_("default template arguments may not be used in function template "
4560 "friend declarations");
4561 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& (cxx_dialect
== cxx98
))
4562 msg
= G_("default template arguments may not be used in function templates "
4563 "without -std=c++11 or -std=gnu++11");
4564 else if (is_partial
)
4565 msg
= G_("default template arguments may not be used in "
4566 "partial specializations");
4568 msg
= G_("default argument for template parameter for class enclosing %qD");
4570 if (current_class_type
&& TYPE_BEING_DEFINED (current_class_type
))
4571 /* If we're inside a class definition, there's no need to
4572 examine the parameters to the class itself. On the one
4573 hand, they will be checked when the class is defined, and,
4574 on the other, default arguments are valid in things like:
4575 template <class T = double>
4576 struct S { template <class U> void f(U); };
4577 Here the default argument for `S' has no bearing on the
4578 declaration of `f'. */
4579 last_level_to_check
= template_class_depth (current_class_type
) + 1;
4581 /* Check everything. */
4582 last_level_to_check
= 0;
4584 for (parm_level
= parms
;
4585 parm_level
&& TMPL_PARMS_DEPTH (parm_level
) >= last_level_to_check
;
4586 parm_level
= TREE_CHAIN (parm_level
))
4588 tree inner_parms
= TREE_VALUE (parm_level
);
4592 ntparms
= TREE_VEC_LENGTH (inner_parms
);
4593 for (i
= 0; i
< ntparms
; ++i
)
4595 if (TREE_VEC_ELT (inner_parms
, i
) == error_mark_node
)
4598 if (TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)))
4603 if (is_friend_decl
== 2)
4610 /* Clear out the default argument so that we are not
4612 TREE_PURPOSE (TREE_VEC_ELT (inner_parms
, i
)) = NULL_TREE
;
4616 /* At this point, if we're still interested in issuing messages,
4617 they must apply to classes surrounding the object declared. */
4619 msg
= G_("default argument for template parameter for class "
4626 /* Worker for push_template_decl_real, called via
4627 for_each_template_parm. DATA is really an int, indicating the
4628 level of the parameters we are interested in. If T is a template
4629 parameter of that level, return nonzero. */
4632 template_parm_this_level_p (tree t
, void* data
)
4634 int this_level
= *(int *)data
;
4637 if (TREE_CODE (t
) == TEMPLATE_PARM_INDEX
)
4638 level
= TEMPLATE_PARM_LEVEL (t
);
4640 level
= TEMPLATE_TYPE_LEVEL (t
);
4641 return level
== this_level
;
4644 /* Creates a TEMPLATE_DECL for the indicated DECL using the template
4645 parameters given by current_template_args, or reuses a
4646 previously existing one, if appropriate. Returns the DECL, or an
4647 equivalent one, if it is replaced via a call to duplicate_decls.
4649 If IS_FRIEND is true, DECL is a friend declaration. */
4652 push_template_decl_real (tree decl
, bool is_friend
)
4660 int new_template_p
= 0;
4661 /* True if the template is a member template, in the sense of
4663 bool member_template_p
= false;
4665 if (decl
== error_mark_node
|| !current_template_parms
)
4666 return error_mark_node
;
4668 /* See if this is a partial specialization. */
4669 is_partial
= (DECL_IMPLICIT_TYPEDEF_P (decl
)
4670 && TREE_CODE (TREE_TYPE (decl
)) != ENUMERAL_TYPE
4671 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)));
4673 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_FRIEND_P (decl
))
4677 /* For a friend, we want the context of the friend function, not
4678 the type of which it is a friend. */
4679 ctx
= CP_DECL_CONTEXT (decl
);
4680 else if (CP_DECL_CONTEXT (decl
)
4681 && TREE_CODE (CP_DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4682 /* In the case of a virtual function, we want the class in which
4684 ctx
= CP_DECL_CONTEXT (decl
);
4686 /* Otherwise, if we're currently defining some class, the DECL
4687 is assumed to be a member of the class. */
4688 ctx
= current_scope ();
4690 if (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
4693 if (!DECL_CONTEXT (decl
))
4694 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
4696 /* See if this is a primary template. */
4697 if (is_friend
&& ctx
4698 && uses_template_parms_level (ctx
, processing_template_decl
))
4699 /* A friend template that specifies a class context, i.e.
4700 template <typename T> friend void A<T>::f();
4703 else if (TREE_CODE (decl
) == TYPE_DECL
4704 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4707 is_primary
= template_parm_scope_p ();
4711 if (DECL_CLASS_SCOPE_P (decl
))
4712 member_template_p
= true;
4713 if (TREE_CODE (decl
) == TYPE_DECL
4714 && ANON_AGGRNAME_P (DECL_NAME (decl
)))
4716 error ("template class without a name");
4717 return error_mark_node
;
4719 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4721 if (DECL_DESTRUCTOR_P (decl
))
4725 A destructor shall not be a member template. */
4726 error ("destructor %qD declared as member template", decl
);
4727 return error_mark_node
;
4729 if (NEW_DELETE_OPNAME_P (DECL_NAME (decl
))
4730 && (!prototype_p (TREE_TYPE (decl
))
4731 || TYPE_ARG_TYPES (TREE_TYPE (decl
)) == void_list_node
4732 || !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
4733 || (TREE_CHAIN (TYPE_ARG_TYPES ((TREE_TYPE (decl
))))
4734 == void_list_node
)))
4736 /* [basic.stc.dynamic.allocation]
4738 An allocation function can be a function
4739 template. ... Template allocation functions shall
4740 have two or more parameters. */
4741 error ("invalid template declaration of %qD", decl
);
4742 return error_mark_node
;
4745 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4746 && CLASS_TYPE_P (TREE_TYPE (decl
)))
4748 else if (TREE_CODE (decl
) == TYPE_DECL
4749 && TYPE_DECL_ALIAS_P (decl
))
4750 /* alias-declaration */
4751 gcc_assert (!DECL_ARTIFICIAL (decl
));
4754 error ("template declaration of %q#D", decl
);
4755 return error_mark_node
;
4759 /* Check to see that the rules regarding the use of default
4760 arguments are not being violated. */
4761 check_default_tmpl_args (decl
, current_template_parms
,
4762 is_primary
, is_partial
, /*is_friend_decl=*/0);
4764 /* Ensure that there are no parameter packs in the type of this
4765 declaration that have not been expanded. */
4766 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4768 /* Check each of the arguments individually to see if there are
4769 any bare parameter packs. */
4770 tree type
= TREE_TYPE (decl
);
4771 tree arg
= DECL_ARGUMENTS (decl
);
4772 tree argtype
= TYPE_ARG_TYPES (type
);
4774 while (arg
&& argtype
)
4776 if (!DECL_PACK_P (arg
)
4777 && check_for_bare_parameter_packs (TREE_TYPE (arg
)))
4779 /* This is a PARM_DECL that contains unexpanded parameter
4780 packs. We have already complained about this in the
4781 check_for_bare_parameter_packs call, so just replace
4782 these types with ERROR_MARK_NODE. */
4783 TREE_TYPE (arg
) = error_mark_node
;
4784 TREE_VALUE (argtype
) = error_mark_node
;
4787 arg
= DECL_CHAIN (arg
);
4788 argtype
= TREE_CHAIN (argtype
);
4791 /* Check for bare parameter packs in the return type and the
4792 exception specifiers. */
4793 if (check_for_bare_parameter_packs (TREE_TYPE (type
)))
4794 /* Errors were already issued, set return type to int
4795 as the frontend doesn't expect error_mark_node as
4797 TREE_TYPE (type
) = integer_type_node
;
4798 if (check_for_bare_parameter_packs (TYPE_RAISES_EXCEPTIONS (type
)))
4799 TYPE_RAISES_EXCEPTIONS (type
) = NULL_TREE
;
4801 else if (check_for_bare_parameter_packs ((TREE_CODE (decl
) == TYPE_DECL
4802 && TYPE_DECL_ALIAS_P (decl
))
4803 ? DECL_ORIGINAL_TYPE (decl
)
4804 : TREE_TYPE (decl
)))
4806 TREE_TYPE (decl
) = error_mark_node
;
4807 return error_mark_node
;
4811 return process_partial_specialization (decl
);
4813 args
= current_template_args ();
4816 || TREE_CODE (ctx
) == FUNCTION_DECL
4817 || (CLASS_TYPE_P (ctx
) && TYPE_BEING_DEFINED (ctx
))
4818 || (TREE_CODE (decl
) == TYPE_DECL
4819 && LAMBDA_TYPE_P (TREE_TYPE (decl
)))
4820 || (is_friend
&& !DECL_TEMPLATE_INFO (decl
)))
4822 if (DECL_LANG_SPECIFIC (decl
)
4823 && DECL_TEMPLATE_INFO (decl
)
4824 && DECL_TI_TEMPLATE (decl
))
4825 tmpl
= DECL_TI_TEMPLATE (decl
);
4826 /* If DECL is a TYPE_DECL for a class-template, then there won't
4827 be DECL_LANG_SPECIFIC. The information equivalent to
4828 DECL_TEMPLATE_INFO is found in TYPE_TEMPLATE_INFO instead. */
4829 else if (DECL_IMPLICIT_TYPEDEF_P (decl
)
4830 && TYPE_TEMPLATE_INFO (TREE_TYPE (decl
))
4831 && TYPE_TI_TEMPLATE (TREE_TYPE (decl
)))
4833 /* Since a template declaration already existed for this
4834 class-type, we must be redeclaring it here. Make sure
4835 that the redeclaration is valid. */
4836 redeclare_class_template (TREE_TYPE (decl
),
4837 current_template_parms
);
4838 /* We don't need to create a new TEMPLATE_DECL; just use the
4839 one we already had. */
4840 tmpl
= TYPE_TI_TEMPLATE (TREE_TYPE (decl
));
4844 tmpl
= build_template_decl (decl
, current_template_parms
,
4848 if (DECL_LANG_SPECIFIC (decl
)
4849 && DECL_TEMPLATE_SPECIALIZATION (decl
))
4851 /* A specialization of a member template of a template
4853 SET_DECL_TEMPLATE_SPECIALIZATION (tmpl
);
4854 DECL_TEMPLATE_INFO (tmpl
) = DECL_TEMPLATE_INFO (decl
);
4855 DECL_TEMPLATE_INFO (decl
) = NULL_TREE
;
4861 tree a
, t
, current
, parms
;
4863 tree tinfo
= get_template_info (decl
);
4867 error ("template definition of non-template %q#D", decl
);
4868 return error_mark_node
;
4871 tmpl
= TI_TEMPLATE (tinfo
);
4873 if (DECL_FUNCTION_TEMPLATE_P (tmpl
)
4874 && DECL_TEMPLATE_INFO (decl
) && DECL_TI_ARGS (decl
)
4875 && DECL_TEMPLATE_SPECIALIZATION (decl
)
4876 && DECL_MEMBER_TEMPLATE_P (tmpl
))
4880 /* The declaration is a specialization of a member
4881 template, declared outside the class. Therefore, the
4882 innermost template arguments will be NULL, so we
4883 replace them with the arguments determined by the
4884 earlier call to check_explicit_specialization. */
4885 args
= DECL_TI_ARGS (decl
);
4888 = build_template_decl (decl
, current_template_parms
,
4890 DECL_TEMPLATE_RESULT (new_tmpl
) = decl
;
4891 TREE_TYPE (new_tmpl
) = TREE_TYPE (decl
);
4892 DECL_TI_TEMPLATE (decl
) = new_tmpl
;
4893 SET_DECL_TEMPLATE_SPECIALIZATION (new_tmpl
);
4894 DECL_TEMPLATE_INFO (new_tmpl
)
4895 = build_template_info (tmpl
, args
);
4897 register_specialization (new_tmpl
,
4898 most_general_template (tmpl
),
4904 /* Make sure the template headers we got make sense. */
4906 parms
= DECL_TEMPLATE_PARMS (tmpl
);
4907 i
= TMPL_PARMS_DEPTH (parms
);
4908 if (TMPL_ARGS_DEPTH (args
) != i
)
4910 error ("expected %d levels of template parms for %q#D, got %d",
4911 i
, decl
, TMPL_ARGS_DEPTH (args
));
4912 DECL_INTERFACE_KNOWN (decl
) = 1;
4913 return error_mark_node
;
4916 for (current
= decl
; i
> 0; --i
, parms
= TREE_CHAIN (parms
))
4918 a
= TMPL_ARGS_LEVEL (args
, i
);
4919 t
= INNERMOST_TEMPLATE_PARMS (parms
);
4921 if (TREE_VEC_LENGTH (t
) != TREE_VEC_LENGTH (a
))
4923 if (current
== decl
)
4924 error ("got %d template parameters for %q#D",
4925 TREE_VEC_LENGTH (a
), decl
);
4927 error ("got %d template parameters for %q#T",
4928 TREE_VEC_LENGTH (a
), current
);
4929 error (" but %d required", TREE_VEC_LENGTH (t
));
4930 /* Avoid crash in import_export_decl. */
4931 DECL_INTERFACE_KNOWN (decl
) = 1;
4932 return error_mark_node
;
4935 if (current
== decl
)
4937 else if (current
== NULL_TREE
)
4938 /* Can happen in erroneous input. */
4941 current
= get_containing_scope (current
);
4944 /* Check that the parms are used in the appropriate qualifying scopes
4945 in the declarator. */
4946 if (!comp_template_args
4948 TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (tmpl
)))))
4951 template arguments to %qD do not match original template %qD",
4952 decl
, DECL_TEMPLATE_RESULT (tmpl
));
4953 if (!uses_template_parms (TI_ARGS (tinfo
)))
4954 inform (input_location
, "use template<> for an explicit specialization");
4955 /* Avoid crash in import_export_decl. */
4956 DECL_INTERFACE_KNOWN (decl
) = 1;
4957 return error_mark_node
;
4961 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
4962 TREE_TYPE (tmpl
) = TREE_TYPE (decl
);
4964 /* Push template declarations for global functions and types. Note
4965 that we do not try to push a global template friend declared in a
4966 template class; such a thing may well depend on the template
4967 parameters of the class. */
4968 if (new_template_p
&& !ctx
4969 && !(is_friend
&& template_class_depth (current_class_type
) > 0))
4971 tmpl
= pushdecl_namespace_level (tmpl
, is_friend
);
4972 if (tmpl
== error_mark_node
)
4973 return error_mark_node
;
4975 /* Hide template friend classes that haven't been declared yet. */
4976 if (is_friend
&& TREE_CODE (decl
) == TYPE_DECL
)
4978 DECL_ANTICIPATED (tmpl
) = 1;
4979 DECL_FRIEND_P (tmpl
) = 1;
4985 tree parms
= DECL_TEMPLATE_PARMS (tmpl
);
4988 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
4989 if (DECL_CONV_FN_P (tmpl
))
4991 int depth
= TMPL_PARMS_DEPTH (parms
);
4993 /* It is a conversion operator. See if the type converted to
4994 depends on innermost template operands. */
4996 if (uses_template_parms_level (TREE_TYPE (TREE_TYPE (tmpl
)),
4998 DECL_TEMPLATE_CONV_FN_P (tmpl
) = 1;
5001 /* Give template template parms a DECL_CONTEXT of the template
5002 for which they are a parameter. */
5003 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5004 for (i
= TREE_VEC_LENGTH (parms
) - 1; i
>= 0; --i
)
5006 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5007 if (TREE_CODE (parm
) == TEMPLATE_DECL
)
5008 DECL_CONTEXT (parm
) = tmpl
;
5012 /* The DECL_TI_ARGS of DECL contains full set of arguments referring
5013 back to its most general template. If TMPL is a specialization,
5014 ARGS may only have the innermost set of arguments. Add the missing
5015 argument levels if necessary. */
5016 if (DECL_TEMPLATE_INFO (tmpl
))
5017 args
= add_outermost_template_args (DECL_TI_ARGS (tmpl
), args
);
5019 info
= build_template_info (tmpl
, args
);
5021 if (DECL_IMPLICIT_TYPEDEF_P (decl
))
5022 SET_TYPE_TEMPLATE_INFO (TREE_TYPE (tmpl
), info
);
5025 if (is_primary
&& !DECL_LANG_SPECIFIC (decl
))
5026 retrofit_lang_decl (decl
);
5027 if (DECL_LANG_SPECIFIC (decl
))
5028 DECL_TEMPLATE_INFO (decl
) = info
;
5031 return DECL_TEMPLATE_RESULT (tmpl
);
5035 push_template_decl (tree decl
)
5037 return push_template_decl_real (decl
, false);
5040 /* FN is an inheriting constructor that inherits from the constructor
5041 template INHERITED; turn FN into a constructor template with a matching
5045 add_inherited_template_parms (tree fn
, tree inherited
)
5048 = INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (inherited
));
5049 inner_parms
= copy_node (inner_parms
);
5051 = tree_cons (size_int (processing_template_decl
+ 1),
5052 inner_parms
, current_template_parms
);
5053 tree tmpl
= build_template_decl (fn
, parms
, /*member*/true);
5054 tree args
= template_parms_to_args (parms
);
5055 DECL_TEMPLATE_INFO (fn
) = build_template_info (tmpl
, args
);
5056 TREE_TYPE (tmpl
) = TREE_TYPE (fn
);
5057 DECL_TEMPLATE_RESULT (tmpl
) = fn
;
5058 DECL_ARTIFICIAL (tmpl
) = true;
5059 DECL_PRIMARY_TEMPLATE (tmpl
) = tmpl
;
5063 /* Called when a class template TYPE is redeclared with the indicated
5064 template PARMS, e.g.:
5066 template <class T> struct S;
5067 template <class T> struct S {}; */
5070 redeclare_class_template (tree type
, tree parms
)
5076 if (!TYPE_TEMPLATE_INFO (type
))
5078 error ("%qT is not a template type", type
);
5082 tmpl
= TYPE_TI_TEMPLATE (type
);
5083 if (!PRIMARY_TEMPLATE_P (tmpl
))
5084 /* The type is nested in some template class. Nothing to worry
5085 about here; there are no new template parameters for the nested
5091 error ("template specifiers not specified in declaration of %qD",
5096 parms
= INNERMOST_TEMPLATE_PARMS (parms
);
5097 tmpl_parms
= DECL_INNERMOST_TEMPLATE_PARMS (tmpl
);
5099 if (TREE_VEC_LENGTH (parms
) != TREE_VEC_LENGTH (tmpl_parms
))
5101 error_n (input_location
, TREE_VEC_LENGTH (parms
),
5102 "redeclared with %d template parameter",
5103 "redeclared with %d template parameters",
5104 TREE_VEC_LENGTH (parms
));
5105 inform_n (input_location
, TREE_VEC_LENGTH (tmpl_parms
),
5106 "previous declaration %q+D used %d template parameter",
5107 "previous declaration %q+D used %d template parameters",
5108 tmpl
, TREE_VEC_LENGTH (tmpl_parms
));
5112 for (i
= 0; i
< TREE_VEC_LENGTH (tmpl_parms
); ++i
)
5119 if (TREE_VEC_ELT (tmpl_parms
, i
) == error_mark_node
5120 || TREE_VEC_ELT (parms
, i
) == error_mark_node
)
5123 tmpl_parm
= TREE_VALUE (TREE_VEC_ELT (tmpl_parms
, i
));
5124 if (error_operand_p (tmpl_parm
))
5127 parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
5128 tmpl_default
= TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
));
5129 parm_default
= TREE_PURPOSE (TREE_VEC_ELT (parms
, i
));
5131 /* TMPL_PARM and PARM can be either TYPE_DECL, PARM_DECL, or
5133 if (TREE_CODE (tmpl_parm
) != TREE_CODE (parm
)
5134 || (TREE_CODE (tmpl_parm
) != TYPE_DECL
5135 && !same_type_p (TREE_TYPE (tmpl_parm
), TREE_TYPE (parm
)))
5136 || (TREE_CODE (tmpl_parm
) != PARM_DECL
5137 && (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (tmpl_parm
))
5138 != TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
))))
5139 || (TREE_CODE (tmpl_parm
) == PARM_DECL
5140 && (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (tmpl_parm
))
5141 != TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))))
5143 error ("template parameter %q+#D", tmpl_parm
);
5144 error ("redeclared here as %q#D", parm
);
5148 if (tmpl_default
!= NULL_TREE
&& parm_default
!= NULL_TREE
)
5150 /* We have in [temp.param]:
5152 A template-parameter may not be given default arguments
5153 by two different declarations in the same scope. */
5154 error_at (input_location
, "redefinition of default argument for %q#D", parm
);
5155 inform (DECL_SOURCE_LOCATION (tmpl_parm
),
5156 "original definition appeared here");
5160 if (parm_default
!= NULL_TREE
)
5161 /* Update the previous template parameters (which are the ones
5162 that will really count) with the new default value. */
5163 TREE_PURPOSE (TREE_VEC_ELT (tmpl_parms
, i
)) = parm_default
;
5164 else if (tmpl_default
!= NULL_TREE
)
5165 /* Update the new parameters, too; they'll be used as the
5166 parameters for any members. */
5167 TREE_PURPOSE (TREE_VEC_ELT (parms
, i
)) = tmpl_default
;
5173 /* Simplify EXPR if it is a non-dependent expression. Returns the
5174 (possibly simplified) expression. */
5177 fold_non_dependent_expr_sfinae (tree expr
, tsubst_flags_t complain
)
5179 if (expr
== NULL_TREE
)
5182 /* If we're in a template, but EXPR isn't value dependent, simplify
5183 it. We're supposed to treat:
5185 template <typename T> void f(T[1 + 1]);
5186 template <typename T> void f(T[2]);
5188 as two declarations of the same function, for example. */
5189 if (processing_template_decl
5190 && !instantiation_dependent_expression_p (expr
)
5191 && potential_constant_expression (expr
))
5193 HOST_WIDE_INT saved_processing_template_decl
;
5195 saved_processing_template_decl
= processing_template_decl
;
5196 processing_template_decl
= 0;
5197 expr
= tsubst_copy_and_build (expr
,
5200 /*in_decl=*/NULL_TREE
,
5201 /*function_p=*/false,
5202 /*integral_constant_expression_p=*/true);
5203 processing_template_decl
= saved_processing_template_decl
;
5209 fold_non_dependent_expr (tree expr
)
5211 return fold_non_dependent_expr_sfinae (expr
, tf_error
);
5214 /* Return TRUE iff T is a type alias, a TEMPLATE_DECL for an alias
5215 template declaration, or a TYPE_DECL for an alias declaration. */
5218 alias_type_or_template_p (tree t
)
5222 return ((TREE_CODE (t
) == TYPE_DECL
&& TYPE_DECL_ALIAS_P (t
))
5225 && TYPE_DECL_ALIAS_P (TYPE_NAME (t
)))
5226 || DECL_ALIAS_TEMPLATE_P (t
));
5229 /* Return TRUE iff is a specialization of an alias template. */
5232 alias_template_specialization_p (const_tree t
)
5238 && TYPE_TEMPLATE_INFO (t
)
5239 && PRIMARY_TEMPLATE_P (TYPE_TI_TEMPLATE (t
))
5240 && DECL_ALIAS_TEMPLATE_P (TYPE_TI_TEMPLATE (t
)));
5243 /* Return the number of innermost template parameters in TMPL. */
5246 num_innermost_template_parms (tree tmpl
)
5248 tree parms
= INNERMOST_TEMPLATE_PARMS (DECL_TEMPLATE_PARMS (tmpl
));
5249 return TREE_VEC_LENGTH (parms
);
5252 /* Return either TMPL or another template that it is equivalent to under DR
5253 1286: An alias that just changes the name of a template is equivalent to
5254 the other template. */
5257 get_underlying_template (tree tmpl
)
5259 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
5260 while (DECL_ALIAS_TEMPLATE_P (tmpl
))
5262 tree result
= DECL_ORIGINAL_TYPE (DECL_TEMPLATE_RESULT (tmpl
));
5263 if (TYPE_TEMPLATE_INFO (result
))
5265 tree sub
= TYPE_TI_TEMPLATE (result
);
5266 if (PRIMARY_TEMPLATE_P (sub
)
5267 && (num_innermost_template_parms (tmpl
)
5268 == num_innermost_template_parms (sub
)))
5270 tree alias_args
= INNERMOST_TEMPLATE_ARGS
5271 (template_parms_to_args (DECL_TEMPLATE_PARMS (tmpl
)));
5272 if (!comp_template_args (TYPE_TI_ARGS (result
), alias_args
))
5274 /* The alias type is equivalent to the pattern of the
5275 underlying template, so strip the alias. */
5285 /* Subroutine of convert_nontype_argument. Converts EXPR to TYPE, which
5286 must be a function or a pointer-to-function type, as specified
5287 in [temp.arg.nontype]: disambiguate EXPR if it is an overload set,
5288 and check that the resulting function has external linkage. */
5291 convert_nontype_argument_function (tree type
, tree expr
)
5295 linkage_kind linkage
;
5297 fn
= instantiate_type (type
, fns
, tf_none
);
5298 if (fn
== error_mark_node
)
5299 return error_mark_node
;
5302 if (TREE_CODE (fn_no_ptr
) == ADDR_EXPR
)
5303 fn_no_ptr
= TREE_OPERAND (fn_no_ptr
, 0);
5304 if (BASELINK_P (fn_no_ptr
))
5305 fn_no_ptr
= BASELINK_FUNCTIONS (fn_no_ptr
);
5307 /* [temp.arg.nontype]/1
5309 A template-argument for a non-type, non-template template-parameter
5312 -- the address of an object or function with external [C++11: or
5313 internal] linkage. */
5315 if (TREE_CODE (fn_no_ptr
) != FUNCTION_DECL
)
5317 error ("%qE is not a valid template argument for type %qT", expr
, type
);
5318 if (TYPE_PTR_P (type
))
5319 error ("it must be the address of a function with external linkage");
5321 error ("it must be the name of a function with external linkage");
5325 linkage
= decl_linkage (fn_no_ptr
);
5326 if (cxx_dialect
>= cxx11
? linkage
== lk_none
: linkage
!= lk_external
)
5328 if (cxx_dialect
>= cxx11
)
5329 error ("%qE is not a valid template argument for type %qT "
5330 "because %qD has no linkage",
5331 expr
, type
, fn_no_ptr
);
5333 error ("%qE is not a valid template argument for type %qT "
5334 "because %qD does not have external linkage",
5335 expr
, type
, fn_no_ptr
);
5342 /* Subroutine of convert_nontype_argument.
5343 Check if EXPR of type TYPE is a valid pointer-to-member constant.
5344 Emit an error otherwise. */
5347 check_valid_ptrmem_cst_expr (tree type
, tree expr
,
5348 tsubst_flags_t complain
)
5351 if (expr
&& (null_ptr_cst_p (expr
) || TREE_CODE (expr
) == PTRMEM_CST
))
5353 if (cxx_dialect
>= cxx11
&& null_member_pointer_value_p (expr
))
5355 if (processing_template_decl
5356 && TREE_CODE (expr
) == ADDR_EXPR
5357 && TREE_CODE (TREE_OPERAND (expr
, 0)) == OFFSET_REF
)
5359 if (complain
& tf_error
)
5361 error ("%qE is not a valid template argument for type %qT",
5363 error ("it must be a pointer-to-member of the form %<&X::Y%>");
5368 /* Returns TRUE iff the address of OP is value-dependent.
5370 14.6.2.4 [temp.dep.temp]:
5371 A non-integral non-type template-argument is dependent if its type is
5372 dependent or it has either of the following forms
5375 and contains a nested-name-specifier which specifies a class-name that
5376 names a dependent type.
5378 We generalize this to just say that the address of a member of a
5379 dependent class is value-dependent; the above doesn't cover the
5380 address of a static data member named with an unqualified-id. */
5383 has_value_dependent_address (tree op
)
5385 /* We could use get_inner_reference here, but there's no need;
5386 this is only relevant for template non-type arguments, which
5387 can only be expressed as &id-expression. */
5390 tree ctx
= CP_DECL_CONTEXT (op
);
5391 if (TYPE_P (ctx
) && dependent_type_p (ctx
))
5398 /* The next set of functions are used for providing helpful explanatory
5399 diagnostics for failed overload resolution. Their messages should be
5400 indented by two spaces for consistency with the messages in
5404 unify_success (bool /*explain_p*/)
5410 unify_parameter_deduction_failure (bool explain_p
, tree parm
)
5413 inform (input_location
,
5414 " couldn't deduce template parameter %qD", parm
);
5419 unify_invalid (bool /*explain_p*/)
5425 unify_cv_qual_mismatch (bool explain_p
, tree parm
, tree arg
)
5428 inform (input_location
,
5429 " types %qT and %qT have incompatible cv-qualifiers",
5435 unify_type_mismatch (bool explain_p
, tree parm
, tree arg
)
5438 inform (input_location
, " mismatched types %qT and %qT", parm
, arg
);
5443 unify_parameter_pack_mismatch (bool explain_p
, tree parm
, tree arg
)
5446 inform (input_location
,
5447 " template parameter %qD is not a parameter pack, but "
5454 unify_ptrmem_cst_mismatch (bool explain_p
, tree parm
, tree arg
)
5457 inform (input_location
,
5458 " template argument %qE does not match "
5459 "pointer-to-member constant %qE",
5465 unify_expression_unequal (bool explain_p
, tree parm
, tree arg
)
5468 inform (input_location
, " %qE is not equivalent to %qE", parm
, arg
);
5473 unify_parameter_pack_inconsistent (bool explain_p
, tree old_arg
, tree new_arg
)
5476 inform (input_location
,
5477 " inconsistent parameter pack deduction with %qT and %qT",
5483 unify_inconsistency (bool explain_p
, tree parm
, tree first
, tree second
)
5488 inform (input_location
,
5489 " deduced conflicting types for parameter %qT (%qT and %qT)",
5490 parm
, first
, second
);
5492 inform (input_location
,
5493 " deduced conflicting values for non-type parameter "
5494 "%qE (%qE and %qE)", parm
, first
, second
);
5500 unify_vla_arg (bool explain_p
, tree arg
)
5503 inform (input_location
,
5504 " variable-sized array type %qT is not "
5505 "a valid template argument",
5511 unify_method_type_error (bool explain_p
, tree arg
)
5514 inform (input_location
,
5515 " member function type %qT is not a valid template argument",
5521 unify_arity (bool explain_p
, int have
, int wanted
)
5524 inform_n (input_location
, wanted
,
5525 " candidate expects %d argument, %d provided",
5526 " candidate expects %d arguments, %d provided",
5532 unify_too_many_arguments (bool explain_p
, int have
, int wanted
)
5534 return unify_arity (explain_p
, have
, wanted
);
5538 unify_too_few_arguments (bool explain_p
, int have
, int wanted
)
5540 return unify_arity (explain_p
, have
, wanted
);
5544 unify_arg_conversion (bool explain_p
, tree to_type
,
5545 tree from_type
, tree arg
)
5548 inform (EXPR_LOC_OR_LOC (arg
, input_location
),
5549 " cannot convert %qE (type %qT) to type %qT",
5550 arg
, from_type
, to_type
);
5555 unify_no_common_base (bool explain_p
, enum template_base_result r
,
5556 tree parm
, tree arg
)
5561 case tbr_ambiguous_baseclass
:
5562 inform (input_location
, " %qT is an ambiguous base class of %qT",
5566 inform (input_location
, " %qT is not derived from %qT", arg
, parm
);
5573 unify_inconsistent_template_template_parameters (bool explain_p
)
5576 inform (input_location
,
5577 " template parameters of a template template argument are "
5578 "inconsistent with other deduced template arguments");
5583 unify_template_deduction_failure (bool explain_p
, tree parm
, tree arg
)
5586 inform (input_location
,
5587 " can't deduce a template for %qT from non-template type %qT",
5593 unify_template_argument_mismatch (bool explain_p
, tree parm
, tree arg
)
5596 inform (input_location
,
5597 " template argument %qE does not match %qD", arg
, parm
);
5602 unify_overload_resolution_failure (bool explain_p
, tree arg
)
5605 inform (input_location
,
5606 " could not resolve address from overloaded function %qE",
5611 /* Attempt to convert the non-type template parameter EXPR to the
5612 indicated TYPE. If the conversion is successful, return the
5613 converted value. If the conversion is unsuccessful, return
5614 NULL_TREE if we issued an error message, or error_mark_node if we
5615 did not. We issue error messages for out-and-out bad template
5616 parameters, but not simply because the conversion failed, since we
5617 might be just trying to do argument deduction. Both TYPE and EXPR
5618 must be non-dependent.
5620 The conversion follows the special rules described in
5621 [temp.arg.nontype], and it is much more strict than an implicit
5624 This function is called twice for each template argument (see
5625 lookup_template_class for a more accurate description of this
5626 problem). This means that we need to handle expressions which
5627 are not valid in a C++ source, but can be created from the
5628 first call (for instance, casts to perform conversions). These
5629 hacks can go away after we fix the double coercion problem. */
5632 convert_nontype_argument (tree type
, tree expr
, tsubst_flags_t complain
)
5636 /* Detect immediately string literals as invalid non-type argument.
5637 This special-case is not needed for correctness (we would easily
5638 catch this later), but only to provide better diagnostic for this
5639 common user mistake. As suggested by DR 100, we do not mention
5640 linkage issues in the diagnostic as this is not the point. */
5641 /* FIXME we're making this OK. */
5642 if (TREE_CODE (expr
) == STRING_CST
)
5644 if (complain
& tf_error
)
5645 error ("%qE is not a valid template argument for type %qT "
5646 "because string literals can never be used in this context",
5651 /* Add the ADDR_EXPR now for the benefit of
5652 value_dependent_expression_p. */
5653 if (TYPE_PTROBV_P (type
)
5654 && TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
)
5656 expr
= decay_conversion (expr
, complain
);
5657 if (expr
== error_mark_node
)
5658 return error_mark_node
;
5661 /* If we are in a template, EXPR may be non-dependent, but still
5662 have a syntactic, rather than semantic, form. For example, EXPR
5663 might be a SCOPE_REF, rather than the VAR_DECL to which the
5664 SCOPE_REF refers. Preserving the qualifying scope is necessary
5665 so that access checking can be performed when the template is
5666 instantiated -- but here we need the resolved form so that we can
5667 convert the argument. */
5668 if (TYPE_REF_OBJ_P (type
)
5669 && has_value_dependent_address (expr
))
5670 /* If we want the address and it's value-dependent, don't fold. */;
5671 else if (!type_unknown_p (expr
))
5672 expr
= fold_non_dependent_expr_sfinae (expr
, complain
);
5673 if (error_operand_p (expr
))
5674 return error_mark_node
;
5675 expr_type
= TREE_TYPE (expr
);
5676 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5677 expr
= mark_lvalue_use (expr
);
5679 expr
= mark_rvalue_use (expr
);
5681 /* 14.3.2/5: The null pointer{,-to-member} conversion is applied
5682 to a non-type argument of "nullptr". */
5683 if (expr
== nullptr_node
&& TYPE_PTR_OR_PTRMEM_P (type
))
5684 expr
= convert (type
, expr
);
5686 /* In C++11, integral or enumeration non-type template arguments can be
5687 arbitrary constant expressions. Pointer and pointer to
5688 member arguments can be general constant expressions that evaluate
5689 to a null value, but otherwise still need to be of a specific form. */
5690 if (cxx_dialect
>= cxx11
)
5692 if (TREE_CODE (expr
) == PTRMEM_CST
)
5693 /* A PTRMEM_CST is already constant, and a valid template
5694 argument for a parameter of pointer to member type, we just want
5695 to leave it in that form rather than lower it to a
5697 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5698 expr
= maybe_constant_value (expr
);
5699 else if (TYPE_PTR_OR_PTRMEM_P (type
))
5701 tree folded
= maybe_constant_value (expr
);
5702 if (TYPE_PTR_P (type
) ? integer_zerop (folded
)
5703 : null_member_pointer_value_p (folded
))
5708 /* HACK: Due to double coercion, we can get a
5709 NOP_EXPR<REFERENCE_TYPE>(ADDR_EXPR<POINTER_TYPE> (arg)) here,
5710 which is the tree that we built on the first call (see
5711 below when coercing to reference to object or to reference to
5712 function). We just strip everything and get to the arg.
5713 See g++.old-deja/g++.oliva/template4.C and g++.dg/template/nontype9.C
5715 if (TYPE_REF_OBJ_P (type
) || TYPE_REFFN_P (type
))
5717 tree probe_type
, probe
= expr
;
5718 if (REFERENCE_REF_P (probe
))
5719 probe
= TREE_OPERAND (probe
, 0);
5720 probe_type
= TREE_TYPE (probe
);
5721 if (TREE_CODE (probe
) == NOP_EXPR
)
5723 /* ??? Maybe we could use convert_from_reference here, but we
5724 would need to relax its constraints because the NOP_EXPR
5725 could actually change the type to something more cv-qualified,
5726 and this is not folded by convert_from_reference. */
5727 tree addr
= TREE_OPERAND (probe
, 0);
5728 if (TREE_CODE (probe_type
) == REFERENCE_TYPE
5729 && TREE_CODE (addr
) == ADDR_EXPR
5730 && TYPE_PTR_P (TREE_TYPE (addr
))
5731 && (same_type_ignoring_top_level_qualifiers_p
5732 (TREE_TYPE (probe_type
),
5733 TREE_TYPE (TREE_TYPE (addr
)))))
5735 expr
= TREE_OPERAND (addr
, 0);
5736 expr_type
= TREE_TYPE (probe_type
);
5741 /* We could also generate a NOP_EXPR(ADDR_EXPR()) when the
5742 parameter is a pointer to object, through decay and
5743 qualification conversion. Let's strip everything. */
5744 else if (TREE_CODE (expr
) == NOP_EXPR
&& TYPE_PTROBV_P (type
))
5748 if (TREE_CODE (probe
) == ADDR_EXPR
5749 && TYPE_PTR_P (TREE_TYPE (probe
)))
5751 /* Skip the ADDR_EXPR only if it is part of the decay for
5752 an array. Otherwise, it is part of the original argument
5753 in the source code. */
5754 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (probe
, 0))) == ARRAY_TYPE
)
5755 probe
= TREE_OPERAND (probe
, 0);
5757 expr_type
= TREE_TYPE (expr
);
5761 /* [temp.arg.nontype]/5, bullet 1
5763 For a non-type template-parameter of integral or enumeration type,
5764 integral promotions (_conv.prom_) and integral conversions
5765 (_conv.integral_) are applied. */
5766 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
5768 tree t
= build_integral_nontype_arg_conv (type
, expr
, complain
);
5769 t
= maybe_constant_value (t
);
5770 if (t
!= error_mark_node
)
5773 if (!same_type_ignoring_top_level_qualifiers_p (type
, TREE_TYPE (expr
)))
5774 return error_mark_node
;
5776 /* Notice that there are constant expressions like '4 % 0' which
5777 do not fold into integer constants. */
5778 if (TREE_CODE (expr
) != INTEGER_CST
)
5780 if (complain
& tf_error
)
5782 int errs
= errorcount
, warns
= warningcount
+ werrorcount
;
5783 if (processing_template_decl
5784 && !require_potential_constant_expression (expr
))
5786 expr
= cxx_constant_value (expr
);
5787 if (errorcount
> errs
|| warningcount
+ werrorcount
> warns
)
5788 inform (EXPR_LOC_OR_LOC (expr
, input_location
),
5789 "in template argument for type %qT ", type
);
5790 if (expr
== error_mark_node
)
5792 /* else cxx_constant_value complained but gave us
5793 a real constant, so go ahead. */
5794 gcc_assert (TREE_CODE (expr
) == INTEGER_CST
);
5800 /* Avoid typedef problems. */
5801 if (TREE_TYPE (expr
) != type
)
5802 expr
= fold_convert (type
, expr
);
5804 /* [temp.arg.nontype]/5, bullet 2
5806 For a non-type template-parameter of type pointer to object,
5807 qualification conversions (_conv.qual_) and the array-to-pointer
5808 conversion (_conv.array_) are applied. */
5809 else if (TYPE_PTROBV_P (type
))
5811 /* [temp.arg.nontype]/1 (TC1 version, DR 49):
5813 A template-argument for a non-type, non-template template-parameter
5814 shall be one of: [...]
5816 -- the name of a non-type template-parameter;
5817 -- the address of an object or function with external linkage, [...]
5818 expressed as "& id-expression" where the & is optional if the name
5819 refers to a function or array, or if the corresponding
5820 template-parameter is a reference.
5822 Here, we do not care about functions, as they are invalid anyway
5823 for a parameter of type pointer-to-object. */
5825 if (DECL_P (expr
) && DECL_TEMPLATE_PARM_P (expr
))
5826 /* Non-type template parameters are OK. */
5828 else if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5829 /* Null pointer values are OK in C++11. */;
5830 else if (TREE_CODE (expr
) != ADDR_EXPR
5831 && TREE_CODE (expr_type
) != ARRAY_TYPE
)
5835 if (complain
& tf_error
)
5836 error ("%qD is not a valid template argument "
5837 "because %qD is a variable, not the address of "
5838 "a variable", expr
, expr
);
5841 if (POINTER_TYPE_P (expr_type
))
5843 if (complain
& tf_error
)
5844 error ("%qE is not a valid template argument for %qT "
5845 "because it is not the address of a variable",
5849 /* Other values, like integer constants, might be valid
5850 non-type arguments of some other type. */
5851 return error_mark_node
;
5857 decl
= ((TREE_CODE (expr
) == ADDR_EXPR
)
5858 ? TREE_OPERAND (expr
, 0) : expr
);
5861 if (complain
& tf_error
)
5862 error ("%qE is not a valid template argument of type %qT "
5863 "because %qE is not a variable", expr
, type
, decl
);
5866 else if (cxx_dialect
< cxx11
&& !DECL_EXTERNAL_LINKAGE_P (decl
))
5868 if (complain
& tf_error
)
5869 error ("%qE is not a valid template argument of type %qT "
5870 "because %qD does not have external linkage",
5874 else if (cxx_dialect
>= cxx11
&& decl_linkage (decl
) == lk_none
)
5876 if (complain
& tf_error
)
5877 error ("%qE is not a valid template argument of type %qT "
5878 "because %qD has no linkage", expr
, type
, decl
);
5883 expr
= decay_conversion (expr
, complain
);
5884 if (expr
== error_mark_node
)
5885 return error_mark_node
;
5887 expr
= perform_qualification_conversions (type
, expr
);
5888 if (expr
== error_mark_node
)
5889 return error_mark_node
;
5891 /* [temp.arg.nontype]/5, bullet 3
5893 For a non-type template-parameter of type reference to object, no
5894 conversions apply. The type referred to by the reference may be more
5895 cv-qualified than the (otherwise identical) type of the
5896 template-argument. The template-parameter is bound directly to the
5897 template-argument, which must be an lvalue. */
5898 else if (TYPE_REF_OBJ_P (type
))
5900 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type
),
5902 return error_mark_node
;
5904 if (!at_least_as_qualified_p (TREE_TYPE (type
), expr_type
))
5906 if (complain
& tf_error
)
5907 error ("%qE is not a valid template argument for type %qT "
5908 "because of conflicts in cv-qualification", expr
, type
);
5912 if (!real_lvalue_p (expr
))
5914 if (complain
& tf_error
)
5915 error ("%qE is not a valid template argument for type %qT "
5916 "because it is not an lvalue", expr
, type
);
5920 /* [temp.arg.nontype]/1
5922 A template-argument for a non-type, non-template template-parameter
5923 shall be one of: [...]
5925 -- the address of an object or function with external linkage. */
5926 if (INDIRECT_REF_P (expr
)
5927 && TYPE_REF_OBJ_P (TREE_TYPE (TREE_OPERAND (expr
, 0))))
5929 expr
= TREE_OPERAND (expr
, 0);
5932 if (complain
& tf_error
)
5933 error ("%q#D is not a valid template argument for type %qT "
5934 "because a reference variable does not have a constant "
5935 "address", expr
, type
);
5942 if (complain
& tf_error
)
5943 error ("%qE is not a valid template argument for type %qT "
5944 "because it is not an object with external linkage",
5949 if (!DECL_EXTERNAL_LINKAGE_P (expr
))
5951 if (complain
& tf_error
)
5952 error ("%qE is not a valid template argument for type %qT "
5953 "because object %qD has not external linkage",
5958 expr
= build_nop (type
, build_address (expr
));
5960 /* [temp.arg.nontype]/5, bullet 4
5962 For a non-type template-parameter of type pointer to function, only
5963 the function-to-pointer conversion (_conv.func_) is applied. If the
5964 template-argument represents a set of overloaded functions (or a
5965 pointer to such), the matching function is selected from the set
5967 else if (TYPE_PTRFN_P (type
))
5969 /* If the argument is a template-id, we might not have enough
5970 context information to decay the pointer. */
5971 if (!type_unknown_p (expr_type
))
5973 expr
= decay_conversion (expr
, complain
);
5974 if (expr
== error_mark_node
)
5975 return error_mark_node
;
5978 if (cxx_dialect
>= cxx11
&& integer_zerop (expr
))
5979 /* Null pointer values are OK in C++11. */
5980 return perform_qualification_conversions (type
, expr
);
5982 expr
= convert_nontype_argument_function (type
, expr
);
5983 if (!expr
|| expr
== error_mark_node
)
5986 /* [temp.arg.nontype]/5, bullet 5
5988 For a non-type template-parameter of type reference to function, no
5989 conversions apply. If the template-argument represents a set of
5990 overloaded functions, the matching function is selected from the set
5992 else if (TYPE_REFFN_P (type
))
5994 if (TREE_CODE (expr
) == ADDR_EXPR
)
5996 if (complain
& tf_error
)
5998 error ("%qE is not a valid template argument for type %qT "
5999 "because it is a pointer", expr
, type
);
6000 inform (input_location
, "try using %qE instead",
6001 TREE_OPERAND (expr
, 0));
6006 expr
= convert_nontype_argument_function (type
, expr
);
6007 if (!expr
|| expr
== error_mark_node
)
6010 expr
= build_nop (type
, build_address (expr
));
6012 /* [temp.arg.nontype]/5, bullet 6
6014 For a non-type template-parameter of type pointer to member function,
6015 no conversions apply. If the template-argument represents a set of
6016 overloaded member functions, the matching member function is selected
6017 from the set (_over.over_). */
6018 else if (TYPE_PTRMEMFUNC_P (type
))
6020 expr
= instantiate_type (type
, expr
, tf_none
);
6021 if (expr
== error_mark_node
)
6022 return error_mark_node
;
6024 /* [temp.arg.nontype] bullet 1 says the pointer to member
6025 expression must be a pointer-to-member constant. */
6026 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6027 return error_mark_node
;
6029 /* There is no way to disable standard conversions in
6030 resolve_address_of_overloaded_function (called by
6031 instantiate_type). It is possible that the call succeeded by
6032 converting &B::I to &D::I (where B is a base of D), so we need
6033 to reject this conversion here.
6035 Actually, even if there was a way to disable standard conversions,
6036 it would still be better to reject them here so that we can
6037 provide a superior diagnostic. */
6038 if (!same_type_p (TREE_TYPE (expr
), type
))
6040 if (complain
& tf_error
)
6042 error ("%qE is not a valid template argument for type %qT "
6043 "because it is of type %qT", expr
, type
,
6045 /* If we are just one standard conversion off, explain. */
6046 if (can_convert_standard (type
, TREE_TYPE (expr
), complain
))
6047 inform (input_location
,
6048 "standard conversions are not allowed in this context");
6053 /* [temp.arg.nontype]/5, bullet 7
6055 For a non-type template-parameter of type pointer to data member,
6056 qualification conversions (_conv.qual_) are applied. */
6057 else if (TYPE_PTRDATAMEM_P (type
))
6059 /* [temp.arg.nontype] bullet 1 says the pointer to member
6060 expression must be a pointer-to-member constant. */
6061 if (!check_valid_ptrmem_cst_expr (type
, expr
, complain
))
6062 return error_mark_node
;
6064 expr
= perform_qualification_conversions (type
, expr
);
6065 if (expr
== error_mark_node
)
6068 else if (NULLPTR_TYPE_P (type
))
6070 if (expr
!= nullptr_node
)
6072 if (complain
& tf_error
)
6073 error ("%qE is not a valid template argument for type %qT "
6074 "because it is of type %qT", expr
, type
, TREE_TYPE (expr
));
6079 /* A template non-type parameter must be one of the above. */
6083 /* Sanity check: did we actually convert the argument to the
6085 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6086 (type
, TREE_TYPE (expr
)));
6090 /* Subroutine of coerce_template_template_parms, which returns 1 if
6091 PARM_PARM and ARG_PARM match using the rule for the template
6092 parameters of template template parameters. Both PARM and ARG are
6093 template parameters; the rest of the arguments are the same as for
6094 coerce_template_template_parms.
6097 coerce_template_template_parm (tree parm
,
6099 tsubst_flags_t complain
,
6103 if (arg
== NULL_TREE
|| error_operand_p (arg
)
6104 || parm
== NULL_TREE
|| error_operand_p (parm
))
6107 if (TREE_CODE (arg
) != TREE_CODE (parm
))
6110 switch (TREE_CODE (parm
))
6113 /* We encounter instantiations of templates like
6114 template <template <template <class> class> class TT>
6117 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6118 tree argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6120 if (!coerce_template_template_parms
6121 (parmparm
, argparm
, complain
, in_decl
, outer_args
))
6127 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (arg
))
6128 && !TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6129 /* Argument is a parameter pack but parameter is not. */
6134 /* The tsubst call is used to handle cases such as
6136 template <int> class C {};
6137 template <class T, template <T> class TT> class D {};
6140 i.e. the parameter list of TT depends on earlier parameters. */
6141 if (!uses_template_parms (TREE_TYPE (arg
))
6143 (tsubst (TREE_TYPE (parm
), outer_args
, complain
, in_decl
),
6147 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (arg
))
6148 && !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6149 /* Argument is a parameter pack but parameter is not. */
6162 /* Return 1 if PARM_PARMS and ARG_PARMS matches using rule for
6163 template template parameters. Both PARM_PARMS and ARG_PARMS are
6164 vectors of TREE_LIST nodes containing TYPE_DECL, TEMPLATE_DECL
6167 Consider the example:
6168 template <class T> class A;
6169 template<template <class U> class TT> class B;
6171 For B<A>, PARM_PARMS are the parameters to TT, while ARG_PARMS are
6172 the parameters to A, and OUTER_ARGS contains A. */
6175 coerce_template_template_parms (tree parm_parms
,
6177 tsubst_flags_t complain
,
6181 int nparms
, nargs
, i
;
6185 gcc_assert (TREE_CODE (parm_parms
) == TREE_VEC
);
6186 gcc_assert (TREE_CODE (arg_parms
) == TREE_VEC
);
6188 nparms
= TREE_VEC_LENGTH (parm_parms
);
6189 nargs
= TREE_VEC_LENGTH (arg_parms
);
6191 /* Determine whether we have a parameter pack at the end of the
6192 template template parameter's template parameter list. */
6193 if (TREE_VEC_ELT (parm_parms
, nparms
- 1) != error_mark_node
)
6195 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, nparms
- 1));
6197 if (error_operand_p (parm
))
6200 switch (TREE_CODE (parm
))
6204 if (TEMPLATE_TYPE_PARAMETER_PACK (TREE_TYPE (parm
)))
6209 if (TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm
)))
6219 && !(variadic_p
&& nargs
>= nparms
- 1))
6222 /* Check all of the template parameters except the parameter pack at
6223 the end (if any). */
6224 for (i
= 0; i
< nparms
- variadic_p
; ++i
)
6226 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
6227 || TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6230 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6231 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6233 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6241 /* Check each of the template parameters in the template
6242 argument against the template parameter pack at the end of
6243 the template template parameter. */
6244 if (TREE_VEC_ELT (parm_parms
, i
) == error_mark_node
)
6247 parm
= TREE_VALUE (TREE_VEC_ELT (parm_parms
, i
));
6249 for (; i
< nargs
; ++i
)
6251 if (TREE_VEC_ELT (arg_parms
, i
) == error_mark_node
)
6254 arg
= TREE_VALUE (TREE_VEC_ELT (arg_parms
, i
));
6256 if (!coerce_template_template_parm (parm
, arg
, complain
, in_decl
,
6265 /* Verifies that the deduced template arguments (in TARGS) for the
6266 template template parameters (in TPARMS) represent valid bindings,
6267 by comparing the template parameter list of each template argument
6268 to the template parameter list of its corresponding template
6269 template parameter, in accordance with DR150. This
6270 routine can only be called after all template arguments have been
6271 deduced. It will return TRUE if all of the template template
6272 parameter bindings are okay, FALSE otherwise. */
6274 template_template_parm_bindings_ok_p (tree tparms
, tree targs
)
6276 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
6279 /* We're dealing with template parms in this process. */
6280 ++processing_template_decl
;
6282 targs
= INNERMOST_TEMPLATE_ARGS (targs
);
6284 for (i
= 0; i
< ntparms
; ++i
)
6286 tree tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
6287 tree targ
= TREE_VEC_ELT (targs
, i
);
6289 if (TREE_CODE (tparm
) == TEMPLATE_DECL
&& targ
)
6291 tree packed_args
= NULL_TREE
;
6294 if (ARGUMENT_PACK_P (targ
))
6296 /* Look inside the argument pack. */
6297 packed_args
= ARGUMENT_PACK_ARGS (targ
);
6298 len
= TREE_VEC_LENGTH (packed_args
);
6301 for (idx
= 0; idx
< len
; ++idx
)
6303 tree targ_parms
= NULL_TREE
;
6306 /* Extract the next argument from the argument
6308 targ
= TREE_VEC_ELT (packed_args
, idx
);
6310 if (PACK_EXPANSION_P (targ
))
6311 /* Look at the pattern of the pack expansion. */
6312 targ
= PACK_EXPANSION_PATTERN (targ
);
6314 /* Extract the template parameters from the template
6316 if (TREE_CODE (targ
) == TEMPLATE_DECL
)
6317 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (targ
);
6318 else if (TREE_CODE (targ
) == TEMPLATE_TEMPLATE_PARM
)
6319 targ_parms
= DECL_INNERMOST_TEMPLATE_PARMS (TYPE_NAME (targ
));
6321 /* Verify that we can coerce the template template
6322 parameters from the template argument to the template
6323 parameter. This requires an exact match. */
6325 && !coerce_template_template_parms
6326 (DECL_INNERMOST_TEMPLATE_PARMS (tparm
),
6341 --processing_template_decl
;
6345 /* Since type attributes aren't mangled, we need to strip them from
6346 template type arguments. */
6349 canonicalize_type_argument (tree arg
, tsubst_flags_t complain
)
6352 if (!arg
|| arg
== error_mark_node
|| arg
== TYPE_CANONICAL (arg
))
6354 mv
= TYPE_MAIN_VARIANT (arg
);
6355 arg
= strip_typedefs (arg
);
6356 if (TYPE_ALIGN (arg
) != TYPE_ALIGN (mv
)
6357 || TYPE_ATTRIBUTES (arg
) != TYPE_ATTRIBUTES (mv
))
6359 if (complain
& tf_warning
)
6360 warning (0, "ignoring attributes on template argument %qT", arg
);
6361 arg
= build_aligned_type (arg
, TYPE_ALIGN (mv
));
6362 arg
= cp_build_type_attribute_variant (arg
, TYPE_ATTRIBUTES (mv
));
6367 /* Convert the indicated template ARG as necessary to match the
6368 indicated template PARM. Returns the converted ARG, or
6369 error_mark_node if the conversion was unsuccessful. Error and
6370 warning messages are issued under control of COMPLAIN. This
6371 conversion is for the Ith parameter in the parameter list. ARGS is
6372 the full set of template arguments deduced so far. */
6375 convert_template_argument (tree parm
,
6378 tsubst_flags_t complain
,
6384 int is_type
, requires_type
, is_tmpl_type
, requires_tmpl_type
;
6386 if (TREE_CODE (arg
) == TREE_LIST
6387 && TREE_CODE (TREE_VALUE (arg
)) == OFFSET_REF
)
6389 /* The template argument was the name of some
6390 member function. That's usually
6391 invalid, but static members are OK. In any
6392 case, grab the underlying fields/functions
6393 and issue an error later if required. */
6394 orig_arg
= TREE_VALUE (arg
);
6395 TREE_TYPE (arg
) = unknown_type_node
;
6400 requires_tmpl_type
= TREE_CODE (parm
) == TEMPLATE_DECL
;
6401 requires_type
= (TREE_CODE (parm
) == TYPE_DECL
6402 || requires_tmpl_type
);
6404 /* When determining whether an argument pack expansion is a template,
6405 look at the pattern. */
6406 if (TREE_CODE (arg
) == TYPE_PACK_EXPANSION
)
6407 arg
= PACK_EXPANSION_PATTERN (arg
);
6409 /* Deal with an injected-class-name used as a template template arg. */
6410 if (requires_tmpl_type
&& CLASS_TYPE_P (arg
))
6412 tree t
= maybe_get_template_decl_from_type_decl (TYPE_NAME (arg
));
6413 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6415 if (cxx_dialect
>= cxx11
)
6416 /* OK under DR 1004. */;
6417 else if (complain
& tf_warning_or_error
)
6418 pedwarn (input_location
, OPT_Wpedantic
, "injected-class-name %qD"
6419 " used as template template argument", TYPE_NAME (arg
));
6420 else if (flag_pedantic_errors
)
6428 ((TREE_CODE (arg
) == TEMPLATE_DECL
6429 && TREE_CODE (DECL_TEMPLATE_RESULT (arg
)) == TYPE_DECL
)
6430 || (requires_tmpl_type
&& TREE_CODE (arg
) == TYPE_ARGUMENT_PACK
)
6431 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6432 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
6435 && (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
6436 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
))
6437 arg
= TYPE_STUB_DECL (arg
);
6439 is_type
= TYPE_P (arg
) || is_tmpl_type
;
6441 if (requires_type
&& ! is_type
&& TREE_CODE (arg
) == SCOPE_REF
6442 && TREE_CODE (TREE_OPERAND (arg
, 0)) == TEMPLATE_TYPE_PARM
)
6444 if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BIT_NOT_EXPR
)
6446 if (complain
& tf_error
)
6447 error ("invalid use of destructor %qE as a type", orig_arg
);
6448 return error_mark_node
;
6451 permerror (input_location
,
6452 "to refer to a type member of a template parameter, "
6453 "use %<typename %E%>", orig_arg
);
6455 orig_arg
= make_typename_type (TREE_OPERAND (arg
, 0),
6456 TREE_OPERAND (arg
, 1),
6462 if (is_type
!= requires_type
)
6466 if (complain
& tf_error
)
6468 error ("type/value mismatch at argument %d in template "
6469 "parameter list for %qD",
6472 error (" expected a constant of type %qT, got %qT",
6474 (DECL_P (arg
) ? DECL_NAME (arg
) : orig_arg
));
6475 else if (requires_tmpl_type
)
6476 error (" expected a class template, got %qE", orig_arg
);
6478 error (" expected a type, got %qE", orig_arg
);
6481 return error_mark_node
;
6483 if (is_tmpl_type
^ requires_tmpl_type
)
6485 if (in_decl
&& (complain
& tf_error
))
6487 error ("type/value mismatch at argument %d in template "
6488 "parameter list for %qD",
6491 error (" expected a type, got %qT", DECL_NAME (arg
));
6493 error (" expected a class template, got %qT", orig_arg
);
6495 return error_mark_node
;
6500 if (requires_tmpl_type
)
6502 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6504 else if (TREE_CODE (TREE_TYPE (arg
)) == UNBOUND_CLASS_TEMPLATE
)
6505 /* The number of argument required is not known yet.
6506 Just accept it for now. */
6507 val
= TREE_TYPE (arg
);
6510 tree parmparm
= DECL_INNERMOST_TEMPLATE_PARMS (parm
);
6513 /* Strip alias templates that are equivalent to another
6515 arg
= get_underlying_template (arg
);
6516 argparm
= DECL_INNERMOST_TEMPLATE_PARMS (arg
);
6518 if (coerce_template_template_parms (parmparm
, argparm
,
6524 /* TEMPLATE_TEMPLATE_PARM node is preferred over
6526 if (val
!= error_mark_node
)
6528 if (DECL_TEMPLATE_TEMPLATE_PARM_P (val
))
6529 val
= TREE_TYPE (val
);
6530 if (TREE_CODE (orig_arg
) == TYPE_PACK_EXPANSION
)
6531 val
= make_pack_expansion (val
);
6536 if (in_decl
&& (complain
& tf_error
))
6538 error ("type/value mismatch at argument %d in "
6539 "template parameter list for %qD",
6541 error (" expected a template of type %qD, got %qT",
6545 val
= error_mark_node
;
6551 /* We only form one instance of each template specialization.
6552 Therefore, if we use a non-canonical variant (i.e., a
6553 typedef), any future messages referring to the type will use
6554 the typedef, which is confusing if those future uses do not
6555 themselves also use the typedef. */
6557 val
= canonicalize_type_argument (val
, complain
);
6561 tree t
= tsubst (TREE_TYPE (parm
), args
, complain
, in_decl
);
6563 if (invalid_nontype_parm_type_p (t
, complain
))
6564 return error_mark_node
;
6566 if (template_parameter_pack_p (parm
) && ARGUMENT_PACK_P (orig_arg
))
6568 if (same_type_p (t
, TREE_TYPE (orig_arg
)))
6572 /* Not sure if this is reachable, but it doesn't hurt
6574 error ("type mismatch in nontype parameter pack");
6575 val
= error_mark_node
;
6578 else if (!dependent_template_arg_p (orig_arg
)
6579 && !uses_template_parms (t
))
6580 /* We used to call digest_init here. However, digest_init
6581 will report errors, which we don't want when complain
6582 is zero. More importantly, digest_init will try too
6583 hard to convert things: for example, `0' should not be
6584 converted to pointer type at this point according to
6585 the standard. Accepting this is not merely an
6586 extension, since deciding whether or not these
6587 conversions can occur is part of determining which
6588 function template to call, or whether a given explicit
6589 argument specification is valid. */
6590 val
= convert_nontype_argument (t
, orig_arg
, complain
);
6592 val
= strip_typedefs_expr (orig_arg
);
6594 if (val
== NULL_TREE
)
6595 val
= error_mark_node
;
6596 else if (val
== error_mark_node
&& (complain
& tf_error
))
6597 error ("could not convert template argument %qE to %qT", orig_arg
, t
);
6599 if (TREE_CODE (val
) == SCOPE_REF
)
6601 /* Strip typedefs from the SCOPE_REF. */
6602 tree type
= canonicalize_type_argument (TREE_TYPE (val
), complain
);
6603 tree scope
= canonicalize_type_argument (TREE_OPERAND (val
, 0),
6605 val
= build_qualified_name (type
, scope
, TREE_OPERAND (val
, 1),
6606 QUALIFIED_NAME_IS_TEMPLATE (val
));
6613 /* Coerces the remaining template arguments in INNER_ARGS (from
6614 ARG_IDX to the end) into the parameter pack at PARM_IDX in PARMS.
6615 Returns the coerced argument pack. PARM_IDX is the position of this
6616 parameter in the template parameter list. ARGS is the original
6617 template argument list. */
6619 coerce_template_parameter_pack (tree parms
,
6627 tsubst_flags_t complain
)
6629 tree parm
= TREE_VEC_ELT (parms
, parm_idx
);
6630 int nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6633 tree packed_parms
= NULL_TREE
;
6635 if (arg_idx
> nargs
)
6638 if (tree packs
= fixed_parameter_pack_p (TREE_VALUE (parm
)))
6640 /* When the template parameter is a non-type template parameter pack
6641 or template template parameter pack whose type or template
6642 parameters use parameter packs, we know exactly how many arguments
6643 we are looking for. Build a vector of the instantiated decls for
6644 these template parameters in PACKED_PARMS. */
6645 /* We can't use make_pack_expansion here because it would interpret a
6646 _DECL as a use rather than a declaration. */
6647 tree decl
= TREE_VALUE (parm
);
6648 tree exp
= cxx_make_type (TYPE_PACK_EXPANSION
);
6649 SET_PACK_EXPANSION_PATTERN (exp
, decl
);
6650 PACK_EXPANSION_PARAMETER_PACKS (exp
) = packs
;
6651 SET_TYPE_STRUCTURAL_EQUALITY (exp
);
6653 TREE_VEC_LENGTH (args
)--;
6654 packed_parms
= tsubst_pack_expansion (exp
, args
, complain
, decl
);
6655 TREE_VEC_LENGTH (args
)++;
6657 if (packed_parms
== error_mark_node
)
6658 return error_mark_node
;
6660 /* If we're doing a partial instantiation of a member template,
6661 verify that all of the types used for the non-type
6662 template parameter pack are, in fact, valid for non-type
6663 template parameters. */
6665 && PACK_EXPANSION_P (TREE_VEC_ELT (inner_args
, arg_idx
)))
6667 int j
, len
= TREE_VEC_LENGTH (packed_parms
);
6668 for (j
= 0; j
< len
; ++j
)
6670 tree t
= TREE_TYPE (TREE_VEC_ELT (packed_parms
, j
));
6671 if (invalid_nontype_parm_type_p (t
, complain
))
6672 return error_mark_node
;
6676 packed_args
= make_tree_vec (TREE_VEC_LENGTH (packed_parms
));
6679 packed_args
= make_tree_vec (nargs
- arg_idx
);
6681 /* Convert the remaining arguments, which will be a part of the
6682 parameter pack "parm". */
6683 for (; arg_idx
< nargs
; ++arg_idx
)
6685 tree arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6686 tree actual_parm
= TREE_VALUE (parm
);
6687 int pack_idx
= arg_idx
- parm_idx
;
6691 /* Once we've packed as many args as we have types, stop. */
6692 if (pack_idx
>= TREE_VEC_LENGTH (packed_parms
))
6694 else if (PACK_EXPANSION_P (arg
))
6695 /* We don't know how many args we have yet, just
6696 use the unconverted ones for now. */
6699 actual_parm
= TREE_VEC_ELT (packed_parms
, pack_idx
);
6702 if (arg
== error_mark_node
)
6704 if (complain
& tf_error
)
6705 error ("template argument %d is invalid", arg_idx
+ 1);
6708 arg
= convert_template_argument (actual_parm
,
6709 arg
, new_args
, complain
, parm_idx
,
6711 if (arg
== error_mark_node
)
6713 TREE_VEC_ELT (packed_args
, pack_idx
) = arg
;
6716 if (arg_idx
- parm_idx
< TREE_VEC_LENGTH (packed_args
)
6717 && TREE_VEC_LENGTH (packed_args
) > 0)
6719 error ("wrong number of template arguments (%d, should be %d)",
6720 arg_idx
- parm_idx
, TREE_VEC_LENGTH (packed_args
));
6721 return error_mark_node
;
6724 if (TREE_CODE (TREE_VALUE (parm
)) == TYPE_DECL
6725 || TREE_CODE (TREE_VALUE (parm
)) == TEMPLATE_DECL
)
6726 argument_pack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
6729 argument_pack
= make_node (NONTYPE_ARGUMENT_PACK
);
6730 TREE_TYPE (argument_pack
)
6731 = tsubst (TREE_TYPE (TREE_VALUE (parm
)), new_args
, complain
, in_decl
);
6732 TREE_CONSTANT (argument_pack
) = 1;
6735 SET_ARGUMENT_PACK_ARGS (argument_pack
, packed_args
);
6736 #ifdef ENABLE_CHECKING
6737 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (packed_args
,
6738 TREE_VEC_LENGTH (packed_args
));
6740 return argument_pack
;
6743 /* Returns the number of pack expansions in the template argument vector
6747 pack_expansion_args_count (tree args
)
6752 for (i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
6754 tree elt
= TREE_VEC_ELT (args
, i
);
6755 if (elt
&& PACK_EXPANSION_P (elt
))
6761 /* Convert all template arguments to their appropriate types, and
6762 return a vector containing the innermost resulting template
6763 arguments. If any error occurs, return error_mark_node. Error and
6764 warning messages are issued under control of COMPLAIN.
6766 If REQUIRE_ALL_ARGS is false, argument deduction will be performed
6767 for arguments not specified in ARGS. Otherwise, if
6768 USE_DEFAULT_ARGS is true, default arguments will be used to fill in
6769 unspecified arguments. If REQUIRE_ALL_ARGS is true, but
6770 USE_DEFAULT_ARGS is false, then all arguments must be specified in
6774 coerce_template_parms (tree parms
,
6777 tsubst_flags_t complain
,
6778 bool require_all_args
,
6779 bool use_default_args
)
6781 int nparms
, nargs
, parm_idx
, arg_idx
, lost
= 0;
6782 tree orig_inner_args
;
6785 tree new_inner_args
;
6786 int saved_unevaluated_operand
;
6787 int saved_inhibit_evaluation_warnings
;
6789 /* When used as a boolean value, indicates whether this is a
6790 variadic template parameter list. Since it's an int, we can also
6791 subtract it from nparms to get the number of non-variadic
6794 int variadic_args_p
= 0;
6795 int post_variadic_parms
= 0;
6797 if (args
== error_mark_node
)
6798 return error_mark_node
;
6800 nparms
= TREE_VEC_LENGTH (parms
);
6802 /* Determine if there are any parameter packs. */
6803 for (parm_idx
= 0; parm_idx
< nparms
; ++parm_idx
)
6805 tree tparm
= TREE_VALUE (TREE_VEC_ELT (parms
, parm_idx
));
6807 ++post_variadic_parms
;
6808 if (template_parameter_pack_p (tparm
))
6812 inner_args
= orig_inner_args
= INNERMOST_TEMPLATE_ARGS (args
);
6813 /* If there are no parameters that follow a parameter pack, we need to
6814 expand any argument packs so that we can deduce a parameter pack from
6815 some non-packed args followed by an argument pack, as in variadic85.C.
6816 If there are such parameters, we need to leave argument packs intact
6817 so the arguments are assigned properly. This can happen when dealing
6818 with a nested class inside a partial specialization of a class
6819 template, as in variadic92.C, or when deducing a template parameter pack
6820 from a sub-declarator, as in variadic114.C. */
6821 if (!post_variadic_parms
)
6822 inner_args
= expand_template_argument_pack (inner_args
);
6824 /* Count any pack expansion args. */
6825 variadic_args_p
= pack_expansion_args_count (inner_args
);
6827 nargs
= inner_args
? NUM_TMPL_ARGS (inner_args
) : 0;
6828 if ((nargs
> nparms
&& !variadic_p
)
6829 || (nargs
< nparms
- variadic_p
6832 && (!use_default_args
6833 || (TREE_VEC_ELT (parms
, nargs
) != error_mark_node
6834 && !TREE_PURPOSE (TREE_VEC_ELT (parms
, nargs
))))))
6836 if (complain
& tf_error
)
6840 nparms
-= variadic_p
;
6841 error ("wrong number of template arguments "
6842 "(%d, should be %d or more)", nargs
, nparms
);
6845 error ("wrong number of template arguments "
6846 "(%d, should be %d)", nargs
, nparms
);
6849 error ("provided for %q+D", in_decl
);
6852 return error_mark_node
;
6854 /* We can't pass a pack expansion to a non-pack parameter of an alias
6855 template (DR 1430). */
6856 else if (in_decl
&& DECL_ALIAS_TEMPLATE_P (in_decl
)
6858 && nargs
- variadic_args_p
< nparms
- variadic_p
)
6860 if (complain
& tf_error
)
6862 for (int i
= 0; i
< TREE_VEC_LENGTH (inner_args
); ++i
)
6864 tree arg
= TREE_VEC_ELT (inner_args
, i
);
6865 tree parm
= TREE_VALUE (TREE_VEC_ELT (parms
, i
));
6867 if (PACK_EXPANSION_P (arg
)
6868 && !template_parameter_pack_p (parm
))
6870 error ("pack expansion argument for non-pack parameter "
6871 "%qD of alias template %qD", parm
, in_decl
);
6872 inform (DECL_SOURCE_LOCATION (parm
), "declared here");
6879 return error_mark_node
;
6882 /* We need to evaluate the template arguments, even though this
6883 template-id may be nested within a "sizeof". */
6884 saved_unevaluated_operand
= cp_unevaluated_operand
;
6885 cp_unevaluated_operand
= 0;
6886 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
6887 c_inhibit_evaluation_warnings
= 0;
6888 new_inner_args
= make_tree_vec (nparms
);
6889 new_args
= add_outermost_template_args (args
, new_inner_args
);
6890 int pack_adjust
= 0;
6891 for (parm_idx
= 0, arg_idx
= 0; parm_idx
< nparms
; parm_idx
++, arg_idx
++)
6896 /* Get the Ith template parameter. */
6897 parm
= TREE_VEC_ELT (parms
, parm_idx
);
6899 if (parm
== error_mark_node
)
6901 TREE_VEC_ELT (new_inner_args
, arg_idx
) = error_mark_node
;
6905 /* Calculate the next argument. */
6906 if (arg_idx
< nargs
)
6907 arg
= TREE_VEC_ELT (inner_args
, arg_idx
);
6911 if (template_parameter_pack_p (TREE_VALUE (parm
))
6912 && !(arg
&& ARGUMENT_PACK_P (arg
)))
6914 /* Some arguments will be placed in the
6915 template parameter pack PARM. */
6916 arg
= coerce_template_parameter_pack (parms
, parm_idx
, args
,
6917 inner_args
, arg_idx
,
6921 if (arg
== NULL_TREE
)
6923 /* We don't know how many args we have yet, just use the
6924 unconverted (and still packed) ones for now. */
6925 new_inner_args
= orig_inner_args
;
6930 TREE_VEC_ELT (new_inner_args
, parm_idx
) = arg
;
6932 /* Store this argument. */
6933 if (arg
== error_mark_node
)
6936 /* We are done with all of the arguments. */
6941 pack_adjust
= TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg
)) - 1;
6942 arg_idx
+= pack_adjust
;
6949 if (PACK_EXPANSION_P (arg
))
6951 /* "If every valid specialization of a variadic template
6952 requires an empty template parameter pack, the template is
6953 ill-formed, no diagnostic required." So check that the
6954 pattern works with this parameter. */
6955 tree pattern
= PACK_EXPANSION_PATTERN (arg
);
6956 tree conv
= convert_template_argument (TREE_VALUE (parm
),
6960 if (conv
== error_mark_node
)
6962 inform (input_location
, "so any instantiation with a "
6963 "non-empty parameter pack would be ill-formed");
6966 else if (TYPE_P (conv
) && !TYPE_P (pattern
))
6967 /* Recover from missing typename. */
6968 TREE_VEC_ELT (inner_args
, arg_idx
)
6969 = make_pack_expansion (conv
);
6971 /* We don't know how many args we have yet, just
6972 use the unconverted ones for now. */
6973 new_inner_args
= inner_args
;
6978 else if (require_all_args
)
6980 /* There must be a default arg in this case. */
6981 arg
= tsubst_template_arg (TREE_PURPOSE (parm
), new_args
,
6983 /* The position of the first default template argument,
6984 is also the number of non-defaulted arguments in NEW_INNER_ARGS.
6986 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
6987 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
6988 arg_idx
- pack_adjust
);
6993 if (arg
== error_mark_node
)
6995 if (complain
& tf_error
)
6996 error ("template argument %d is invalid", arg_idx
+ 1);
6999 /* This only occurs if there was an error in the template
7000 parameter list itself (which we would already have
7001 reported) that we are trying to recover from, e.g., a class
7002 template with a parameter list such as
7003 template<typename..., typename>. */
7006 arg
= convert_template_argument (TREE_VALUE (parm
),
7007 arg
, new_args
, complain
,
7010 if (arg
== error_mark_node
)
7012 TREE_VEC_ELT (new_inner_args
, arg_idx
- pack_adjust
) = arg
;
7014 cp_unevaluated_operand
= saved_unevaluated_operand
;
7015 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
7017 if (variadic_p
&& arg_idx
< nargs
)
7019 if (complain
& tf_error
)
7021 error ("wrong number of template arguments "
7022 "(%d, should be %d)", nargs
, arg_idx
);
7024 error ("provided for %q+D", in_decl
);
7026 return error_mark_node
;
7030 return error_mark_node
;
7032 #ifdef ENABLE_CHECKING
7033 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
))
7034 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (new_inner_args
,
7035 TREE_VEC_LENGTH (new_inner_args
));
7038 return new_inner_args
;
7041 /* Like coerce_template_parms. If PARMS represents all template
7042 parameters levels, this function returns a vector of vectors
7043 representing all the resulting argument levels. Note that in this
7044 case, only the innermost arguments are coerced because the
7045 outermost ones are supposed to have been coerced already.
7047 Otherwise, if PARMS represents only (the innermost) vector of
7048 parameters, this function returns a vector containing just the
7049 innermost resulting arguments. */
7052 coerce_innermost_template_parms (tree parms
,
7055 tsubst_flags_t complain
,
7056 bool require_all_args
,
7057 bool use_default_args
)
7059 int parms_depth
= TMPL_PARMS_DEPTH (parms
);
7060 int args_depth
= TMPL_ARGS_DEPTH (args
);
7063 if (parms_depth
> 1)
7065 coerced_args
= make_tree_vec (parms_depth
);
7069 for (level
= parms
, cur_depth
= parms_depth
;
7070 parms_depth
> 0 && level
!= NULL_TREE
;
7071 level
= TREE_CHAIN (level
), --cur_depth
)
7074 if (cur_depth
== args_depth
)
7075 l
= coerce_template_parms (TREE_VALUE (level
),
7076 args
, in_decl
, complain
,
7080 l
= TMPL_ARGS_LEVEL (args
, cur_depth
);
7082 if (l
== error_mark_node
)
7083 return error_mark_node
;
7085 SET_TMPL_ARGS_LEVEL (coerced_args
, cur_depth
, l
);
7089 coerced_args
= coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parms
),
7090 args
, in_decl
, complain
,
7093 return coerced_args
;
7096 /* Returns 1 if template args OT and NT are equivalent. */
7099 template_args_equal (tree ot
, tree nt
)
7103 if (nt
== NULL_TREE
|| ot
== NULL_TREE
)
7106 if (TREE_CODE (nt
) == TREE_VEC
)
7107 /* For member templates */
7108 return TREE_CODE (ot
) == TREE_VEC
&& comp_template_args (ot
, nt
);
7109 else if (PACK_EXPANSION_P (ot
))
7110 return (PACK_EXPANSION_P (nt
)
7111 && template_args_equal (PACK_EXPANSION_PATTERN (ot
),
7112 PACK_EXPANSION_PATTERN (nt
))
7113 && template_args_equal (PACK_EXPANSION_EXTRA_ARGS (ot
),
7114 PACK_EXPANSION_EXTRA_ARGS (nt
)));
7115 else if (ARGUMENT_PACK_P (ot
))
7120 if (!ARGUMENT_PACK_P (nt
))
7123 opack
= ARGUMENT_PACK_ARGS (ot
);
7124 npack
= ARGUMENT_PACK_ARGS (nt
);
7125 len
= TREE_VEC_LENGTH (opack
);
7126 if (TREE_VEC_LENGTH (npack
) != len
)
7128 for (i
= 0; i
< len
; ++i
)
7129 if (!template_args_equal (TREE_VEC_ELT (opack
, i
),
7130 TREE_VEC_ELT (npack
, i
)))
7134 else if (ot
&& TREE_CODE (ot
) == ARGUMENT_PACK_SELECT
)
7136 /* We get here probably because we are in the middle of substituting
7137 into the pattern of a pack expansion. In that case the
7138 ARGUMENT_PACK_SELECT temporarily replaces the pack argument we are
7139 interested in. So we want to use the initial pack argument for
7141 ot
= ARGUMENT_PACK_SELECT_FROM_PACK (ot
);
7142 if (nt
&& TREE_CODE (nt
) == ARGUMENT_PACK_SELECT
)
7143 nt
= ARGUMENT_PACK_SELECT_FROM_PACK (nt
);
7144 return template_args_equal (ot
, nt
);
7146 else if (TYPE_P (nt
))
7147 return TYPE_P (ot
) && same_type_p (ot
, nt
);
7148 else if (TREE_CODE (ot
) == TREE_VEC
|| TYPE_P (ot
))
7151 return cp_tree_equal (ot
, nt
);
7154 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets of
7155 template arguments. Returns 0 otherwise, and updates OLDARG_PTR and
7156 NEWARG_PTR with the offending arguments if they are non-NULL. */
7159 comp_template_args_with_info (tree oldargs
, tree newargs
,
7160 tree
*oldarg_ptr
, tree
*newarg_ptr
)
7164 if (oldargs
== newargs
)
7167 if (!oldargs
|| !newargs
)
7170 if (TREE_VEC_LENGTH (oldargs
) != TREE_VEC_LENGTH (newargs
))
7173 for (i
= 0; i
< TREE_VEC_LENGTH (oldargs
); ++i
)
7175 tree nt
= TREE_VEC_ELT (newargs
, i
);
7176 tree ot
= TREE_VEC_ELT (oldargs
, i
);
7178 if (! template_args_equal (ot
, nt
))
7180 if (oldarg_ptr
!= NULL
)
7182 if (newarg_ptr
!= NULL
)
7190 /* Returns 1 iff the OLDARGS and NEWARGS are in fact identical sets
7191 of template arguments. Returns 0 otherwise. */
7194 comp_template_args (tree oldargs
, tree newargs
)
7196 return comp_template_args_with_info (oldargs
, newargs
, NULL
, NULL
);
7200 add_pending_template (tree d
)
7202 tree ti
= (TYPE_P (d
)
7203 ? CLASSTYPE_TEMPLATE_INFO (d
)
7204 : DECL_TEMPLATE_INFO (d
));
7205 struct pending_template
*pt
;
7208 if (TI_PENDING_TEMPLATE_FLAG (ti
))
7211 /* We are called both from instantiate_decl, where we've already had a
7212 tinst_level pushed, and instantiate_template, where we haven't.
7214 level
= !current_tinst_level
|| current_tinst_level
->decl
!= d
;
7217 push_tinst_level (d
);
7219 pt
= ggc_alloc_pending_template ();
7221 pt
->tinst
= current_tinst_level
;
7222 if (last_pending_template
)
7223 last_pending_template
->next
= pt
;
7225 pending_templates
= pt
;
7227 last_pending_template
= pt
;
7229 TI_PENDING_TEMPLATE_FLAG (ti
) = 1;
7236 /* Return a TEMPLATE_ID_EXPR corresponding to the indicated FNS and
7237 ARGLIST. Valid choices for FNS are given in the cp-tree.def
7238 documentation for TEMPLATE_ID_EXPR. */
7241 lookup_template_function (tree fns
, tree arglist
)
7245 if (fns
== error_mark_node
|| arglist
== error_mark_node
)
7246 return error_mark_node
;
7248 gcc_assert (!arglist
|| TREE_CODE (arglist
) == TREE_VEC
);
7250 if (!is_overloaded_fn (fns
) && !identifier_p (fns
))
7252 error ("%q#D is not a function template", fns
);
7253 return error_mark_node
;
7256 if (BASELINK_P (fns
))
7258 BASELINK_FUNCTIONS (fns
) = build2 (TEMPLATE_ID_EXPR
,
7260 BASELINK_FUNCTIONS (fns
),
7265 type
= TREE_TYPE (fns
);
7266 if (TREE_CODE (fns
) == OVERLOAD
|| !type
)
7267 type
= unknown_type_node
;
7269 return build2 (TEMPLATE_ID_EXPR
, type
, fns
, arglist
);
7272 /* Within the scope of a template class S<T>, the name S gets bound
7273 (in build_self_reference) to a TYPE_DECL for the class, not a
7274 TEMPLATE_DECL. If DECL is a TYPE_DECL for current_class_type,
7275 or one of its enclosing classes, and that type is a template,
7276 return the associated TEMPLATE_DECL. Otherwise, the original
7279 Also handle the case when DECL is a TREE_LIST of ambiguous
7280 injected-class-names from different bases. */
7283 maybe_get_template_decl_from_type_decl (tree decl
)
7285 if (decl
== NULL_TREE
)
7288 /* DR 176: A lookup that finds an injected-class-name (10.2
7289 [class.member.lookup]) can result in an ambiguity in certain cases
7290 (for example, if it is found in more than one base class). If all of
7291 the injected-class-names that are found refer to specializations of
7292 the same class template, and if the name is followed by a
7293 template-argument-list, the reference refers to the class template
7294 itself and not a specialization thereof, and is not ambiguous. */
7295 if (TREE_CODE (decl
) == TREE_LIST
)
7297 tree t
, tmpl
= NULL_TREE
;
7298 for (t
= decl
; t
; t
= TREE_CHAIN (t
))
7300 tree elt
= maybe_get_template_decl_from_type_decl (TREE_VALUE (t
));
7303 else if (tmpl
!= elt
)
7306 if (tmpl
&& t
== NULL_TREE
)
7312 return (decl
!= NULL_TREE
7313 && DECL_SELF_REFERENCE_P (decl
)
7314 && CLASSTYPE_TEMPLATE_INFO (TREE_TYPE (decl
)))
7315 ? CLASSTYPE_TI_TEMPLATE (TREE_TYPE (decl
)) : decl
;
7318 /* Given an IDENTIFIER_NODE (or type TEMPLATE_DECL) and a chain of
7319 parameters, find the desired type.
7321 D1 is the PTYPENAME terminal, and ARGLIST is the list of arguments.
7323 IN_DECL, if non-NULL, is the template declaration we are trying to
7326 If ENTERING_SCOPE is nonzero, we are about to enter the scope of
7327 the class we are looking up.
7329 Issue error and warning messages under control of COMPLAIN.
7331 If the template class is really a local class in a template
7332 function, then the FUNCTION_CONTEXT is the function in which it is
7335 ??? Note that this function is currently called *twice* for each
7336 template-id: the first time from the parser, while creating the
7337 incomplete type (finish_template_type), and the second type during the
7338 real instantiation (instantiate_template_class). This is surely something
7339 that we want to avoid. It also causes some problems with argument
7340 coercion (see convert_nontype_argument for more information on this). */
7343 lookup_template_class_1 (tree d1
, tree arglist
, tree in_decl
, tree context
,
7344 int entering_scope
, tsubst_flags_t complain
)
7346 tree templ
= NULL_TREE
, parmlist
;
7353 if (identifier_p (d1
))
7355 tree value
= innermost_non_namespace_value (d1
);
7356 if (value
&& DECL_TEMPLATE_TEMPLATE_PARM_P (value
))
7361 push_decl_namespace (context
);
7362 templ
= lookup_name (d1
);
7363 templ
= maybe_get_template_decl_from_type_decl (templ
);
7365 pop_decl_namespace ();
7368 context
= DECL_CONTEXT (templ
);
7370 else if (TREE_CODE (d1
) == TYPE_DECL
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (d1
)))
7372 tree type
= TREE_TYPE (d1
);
7374 /* If we are declaring a constructor, say A<T>::A<T>, we will get
7375 an implicit typename for the second A. Deal with it. */
7376 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
7377 type
= TREE_TYPE (type
);
7379 if (CLASSTYPE_TEMPLATE_INFO (type
))
7381 templ
= CLASSTYPE_TI_TEMPLATE (type
);
7382 d1
= DECL_NAME (templ
);
7385 else if (TREE_CODE (d1
) == ENUMERAL_TYPE
7386 || (TYPE_P (d1
) && MAYBE_CLASS_TYPE_P (d1
)))
7388 templ
= TYPE_TI_TEMPLATE (d1
);
7389 d1
= DECL_NAME (templ
);
7391 else if (TREE_CODE (d1
) == TEMPLATE_DECL
7392 && DECL_TEMPLATE_RESULT (d1
)
7393 && TREE_CODE (DECL_TEMPLATE_RESULT (d1
)) == TYPE_DECL
)
7396 d1
= DECL_NAME (templ
);
7397 context
= DECL_CONTEXT (templ
);
7399 else if (DECL_TEMPLATE_TEMPLATE_PARM_P (d1
))
7402 d1
= DECL_NAME (templ
);
7405 /* Issue an error message if we didn't find a template. */
7408 if (complain
& tf_error
)
7409 error ("%qT is not a template", d1
);
7410 return error_mark_node
;
7413 if (TREE_CODE (templ
) != TEMPLATE_DECL
7414 /* Make sure it's a user visible template, if it was named by
7416 || ((complain
& tf_user
) && !DECL_TEMPLATE_PARM_P (templ
)
7417 && !PRIMARY_TEMPLATE_P (templ
)))
7419 if (complain
& tf_error
)
7421 error ("non-template type %qT used as a template", d1
);
7423 error ("for template declaration %q+D", in_decl
);
7425 return error_mark_node
;
7428 complain
&= ~tf_user
;
7430 /* An alias that just changes the name of a template is equivalent to the
7431 other template, so if any of the arguments are pack expansions, strip
7432 the alias to avoid problems with a pack expansion passed to a non-pack
7433 alias template parameter (DR 1430). */
7434 if (pack_expansion_args_count (INNERMOST_TEMPLATE_ARGS (arglist
)))
7435 templ
= get_underlying_template (templ
);
7437 if (DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
7439 /* Create a new TEMPLATE_DECL and TEMPLATE_TEMPLATE_PARM node to store
7440 template arguments */
7446 parmlist
= DECL_INNERMOST_TEMPLATE_PARMS (templ
);
7448 /* Consider an example where a template template parameter declared as
7450 template <class T, class U = std::allocator<T> > class TT
7452 The template parameter level of T and U are one level larger than
7453 of TT. To proper process the default argument of U, say when an
7454 instantiation `TT<int>' is seen, we need to build the full
7455 arguments containing {int} as the innermost level. Outer levels,
7456 available when not appearing as default template argument, can be
7457 obtained from the arguments of the enclosing template.
7459 Suppose that TT is later substituted with std::vector. The above
7460 instantiation is `TT<int, std::allocator<T> >' with TT at
7461 level 1, and T at level 2, while the template arguments at level 1
7462 becomes {std::vector} and the inner level 2 is {int}. */
7464 outer
= DECL_CONTEXT (templ
);
7466 outer
= TI_ARGS (get_template_info (DECL_TEMPLATE_RESULT (outer
)));
7467 else if (current_template_parms
)
7468 /* This is an argument of the current template, so we haven't set
7469 DECL_CONTEXT yet. */
7470 outer
= current_template_args ();
7473 arglist
= add_to_template_args (outer
, arglist
);
7475 arglist2
= coerce_template_parms (parmlist
, arglist
, templ
,
7477 /*require_all_args=*/true,
7478 /*use_default_args=*/true);
7479 if (arglist2
== error_mark_node
7480 || (!uses_template_parms (arglist2
)
7481 && check_instantiated_args (templ
, arglist2
, complain
)))
7482 return error_mark_node
;
7484 parm
= bind_template_template_parm (TREE_TYPE (templ
), arglist2
);
7489 tree template_type
= TREE_TYPE (templ
);
7492 tree found
= NULL_TREE
;
7495 int is_dependent_type
;
7496 int use_partial_inst_tmpl
= false;
7498 if (template_type
== error_mark_node
)
7499 /* An error occurred while building the template TEMPL, and a
7500 diagnostic has most certainly been emitted for that
7501 already. Let's propagate that error. */
7502 return error_mark_node
;
7504 gen_tmpl
= most_general_template (templ
);
7505 parmlist
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7506 parm_depth
= TMPL_PARMS_DEPTH (parmlist
);
7507 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7509 if (arg_depth
== 1 && parm_depth
> 1)
7511 /* We've been given an incomplete set of template arguments.
7514 template <class T> struct S1 {
7515 template <class U> struct S2 {};
7516 template <class U> struct S2<U*> {};
7519 we will be called with an ARGLIST of `U*', but the
7520 TEMPLATE will be `template <class T> template
7521 <class U> struct S1<T>::S2'. We must fill in the missing
7524 = add_outermost_template_args (TYPE_TI_ARGS (TREE_TYPE (templ
)),
7526 arg_depth
= TMPL_ARGS_DEPTH (arglist
);
7529 /* Now we should have enough arguments. */
7530 gcc_assert (parm_depth
== arg_depth
);
7532 /* From here on, we're only interested in the most general
7535 /* Calculate the BOUND_ARGS. These will be the args that are
7536 actually tsubst'd into the definition to create the
7540 /* We have multiple levels of arguments to coerce, at once. */
7542 int saved_depth
= TMPL_ARGS_DEPTH (arglist
);
7544 tree bound_args
= make_tree_vec (parm_depth
);
7546 for (i
= saved_depth
,
7547 t
= DECL_TEMPLATE_PARMS (gen_tmpl
);
7548 i
> 0 && t
!= NULL_TREE
;
7549 --i
, t
= TREE_CHAIN (t
))
7552 if (i
== saved_depth
)
7553 a
= coerce_template_parms (TREE_VALUE (t
),
7556 /*require_all_args=*/true,
7557 /*use_default_args=*/true);
7559 /* Outer levels should have already been coerced. */
7560 a
= TMPL_ARGS_LEVEL (arglist
, i
);
7562 /* Don't process further if one of the levels fails. */
7563 if (a
== error_mark_node
)
7565 /* Restore the ARGLIST to its full size. */
7566 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7567 return error_mark_node
;
7570 SET_TMPL_ARGS_LEVEL (bound_args
, i
, a
);
7572 /* We temporarily reduce the length of the ARGLIST so
7573 that coerce_template_parms will see only the arguments
7574 corresponding to the template parameters it is
7576 TREE_VEC_LENGTH (arglist
)--;
7579 /* Restore the ARGLIST to its full size. */
7580 TREE_VEC_LENGTH (arglist
) = saved_depth
;
7582 arglist
= bound_args
;
7586 = coerce_template_parms (INNERMOST_TEMPLATE_PARMS (parmlist
),
7587 INNERMOST_TEMPLATE_ARGS (arglist
),
7590 /*require_all_args=*/true,
7591 /*use_default_args=*/true);
7593 if (arglist
== error_mark_node
)
7594 /* We were unable to bind the arguments. */
7595 return error_mark_node
;
7597 /* In the scope of a template class, explicit references to the
7598 template class refer to the type of the template, not any
7599 instantiation of it. For example, in:
7601 template <class T> class C { void f(C<T>); }
7603 the `C<T>' is just the same as `C'. Outside of the
7604 class, however, such a reference is an instantiation. */
7606 || !PRIMARY_TEMPLATE_P (gen_tmpl
)
7607 || currently_open_class (template_type
))
7608 /* comp_template_args is expensive, check it last. */
7609 && comp_template_args (TYPE_TI_ARGS (template_type
),
7611 return template_type
;
7613 /* If we already have this specialization, return it. */
7614 elt
.tmpl
= gen_tmpl
;
7616 hash
= hash_specialization (&elt
);
7617 entry
= (spec_entry
*) htab_find_with_hash (type_specializations
,
7623 is_dependent_type
= uses_template_parms (arglist
);
7625 /* If the deduced arguments are invalid, then the binding
7627 if (!is_dependent_type
7628 && check_instantiated_args (gen_tmpl
,
7629 INNERMOST_TEMPLATE_ARGS (arglist
),
7631 return error_mark_node
;
7633 if (!is_dependent_type
7634 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
7635 && !LAMBDA_TYPE_P (TREE_TYPE (gen_tmpl
))
7636 && TREE_CODE (CP_DECL_CONTEXT (gen_tmpl
)) == NAMESPACE_DECL
)
7638 found
= xref_tag_from_type (TREE_TYPE (gen_tmpl
),
7639 DECL_NAME (gen_tmpl
),
7640 /*tag_scope=*/ts_global
);
7644 context
= tsubst (DECL_CONTEXT (gen_tmpl
), arglist
,
7646 if (context
== error_mark_node
)
7647 return error_mark_node
;
7650 context
= global_namespace
;
7652 /* Create the type. */
7653 if (DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7655 /* The user referred to a specialization of an alias
7656 template represented by GEN_TMPL.
7658 [temp.alias]/2 says:
7660 When a template-id refers to the specialization of an
7661 alias template, it is equivalent to the associated
7662 type obtained by substitution of its
7663 template-arguments for the template-parameters in the
7664 type-id of the alias template. */
7666 t
= tsubst (TREE_TYPE (gen_tmpl
), arglist
, complain
, in_decl
);
7667 /* Note that the call above (by indirectly calling
7668 register_specialization in tsubst_decl) registers the
7669 TYPE_DECL representing the specialization of the alias
7670 template. So next time someone substitutes ARGLIST for
7671 the template parms into the alias template (GEN_TMPL),
7672 she'll get that TYPE_DECL back. */
7674 if (t
== error_mark_node
)
7677 else if (TREE_CODE (template_type
) == ENUMERAL_TYPE
)
7679 if (!is_dependent_type
)
7681 set_current_access_from_decl (TYPE_NAME (template_type
));
7682 t
= start_enum (TYPE_IDENTIFIER (template_type
), NULL_TREE
,
7683 tsubst (ENUM_UNDERLYING_TYPE (template_type
),
7684 arglist
, complain
, in_decl
),
7685 SCOPED_ENUM_P (template_type
), NULL
);
7687 if (t
== error_mark_node
)
7692 /* We don't want to call start_enum for this type, since
7693 the values for the enumeration constants may involve
7694 template parameters. And, no one should be interested
7695 in the enumeration constants for such a type. */
7696 t
= cxx_make_type (ENUMERAL_TYPE
);
7697 SET_SCOPED_ENUM_P (t
, SCOPED_ENUM_P (template_type
));
7699 SET_OPAQUE_ENUM_P (t
, OPAQUE_ENUM_P (template_type
));
7700 ENUM_FIXED_UNDERLYING_TYPE_P (t
)
7701 = ENUM_FIXED_UNDERLYING_TYPE_P (template_type
);
7703 else if (CLASS_TYPE_P (template_type
))
7705 t
= make_class_type (TREE_CODE (template_type
));
7706 CLASSTYPE_DECLARED_CLASS (t
)
7707 = CLASSTYPE_DECLARED_CLASS (template_type
);
7708 SET_CLASSTYPE_IMPLICIT_INSTANTIATION (t
);
7709 TYPE_FOR_JAVA (t
) = TYPE_FOR_JAVA (template_type
);
7711 /* A local class. Make sure the decl gets registered properly. */
7712 if (context
== current_function_decl
)
7713 pushtag (DECL_NAME (gen_tmpl
), t
, /*tag_scope=*/ts_current
);
7715 if (comp_template_args (CLASSTYPE_TI_ARGS (template_type
), arglist
))
7716 /* This instantiation is another name for the primary
7717 template type. Set the TYPE_CANONICAL field
7719 TYPE_CANONICAL (t
) = template_type
;
7720 else if (any_template_arguments_need_structural_equality_p (arglist
))
7721 /* Some of the template arguments require structural
7722 equality testing, so this template class requires
7723 structural equality testing. */
7724 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7729 /* If we called start_enum or pushtag above, this information
7730 will already be set up. */
7733 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
7735 type_decl
= create_implicit_typedef (DECL_NAME (gen_tmpl
), t
);
7736 DECL_CONTEXT (type_decl
) = TYPE_CONTEXT (t
);
7737 DECL_SOURCE_LOCATION (type_decl
)
7738 = DECL_SOURCE_LOCATION (TYPE_STUB_DECL (template_type
));
7741 type_decl
= TYPE_NAME (t
);
7743 if (CLASS_TYPE_P (template_type
))
7745 TREE_PRIVATE (type_decl
)
7746 = TREE_PRIVATE (TYPE_MAIN_DECL (template_type
));
7747 TREE_PROTECTED (type_decl
)
7748 = TREE_PROTECTED (TYPE_MAIN_DECL (template_type
));
7749 if (CLASSTYPE_VISIBILITY_SPECIFIED (template_type
))
7751 DECL_VISIBILITY_SPECIFIED (type_decl
) = 1;
7752 DECL_VISIBILITY (type_decl
) = CLASSTYPE_VISIBILITY (template_type
);
7756 /* Let's consider the explicit specialization of a member
7757 of a class template specialization that is implicitly instantiated,
7762 template<class U> struct M {}; //#0
7767 struct S<int>::M<char> //#1
7771 [temp.expl.spec]/4 says this is valid.
7773 In this case, when we write:
7776 M is instantiated from the CLASSTYPE_TI_TEMPLATE of #1, not from
7779 When we encounter #1, we want to store the partial instantiation
7780 of M (template<class T> S<int>::M<T>) in its CLASSTYPE_TI_TEMPLATE.
7782 For all cases other than this "explicit specialization of member of a
7783 class template", we just want to store the most general template into
7784 the CLASSTYPE_TI_TEMPLATE of M.
7786 This case of "explicit specialization of member of a class template"
7788 1/ the enclosing class is an instantiation of, and therefore not
7789 the same as, the context of the most general template, and
7790 2/ we aren't looking at the partial instantiation itself, i.e.
7791 the innermost arguments are not the same as the innermost parms of
7792 the most general template.
7794 So it's only when 1/ and 2/ happens that we want to use the partial
7795 instantiation of the member template in lieu of its most general
7798 if (PRIMARY_TEMPLATE_P (gen_tmpl
)
7799 && TMPL_ARGS_HAVE_MULTIPLE_LEVELS (arglist
)
7800 /* the enclosing class must be an instantiation... */
7801 && CLASS_TYPE_P (context
)
7802 && !same_type_p (context
, DECL_CONTEXT (gen_tmpl
)))
7804 tree partial_inst_args
;
7805 TREE_VEC_LENGTH (arglist
)--;
7806 ++processing_template_decl
;
7808 tsubst (INNERMOST_TEMPLATE_ARGS
7809 (TYPE_TI_ARGS (TREE_TYPE (gen_tmpl
))),
7810 arglist
, complain
, NULL_TREE
);
7811 --processing_template_decl
;
7812 TREE_VEC_LENGTH (arglist
)++;
7813 use_partial_inst_tmpl
=
7814 /*...and we must not be looking at the partial instantiation
7816 !comp_template_args (INNERMOST_TEMPLATE_ARGS (arglist
),
7820 if (!use_partial_inst_tmpl
)
7821 /* This case is easy; there are no member templates involved. */
7825 /* This is a full instantiation of a member template. Find
7826 the partial instantiation of which this is an instance. */
7828 /* Temporarily reduce by one the number of levels in the ARGLIST
7829 so as to avoid comparing the last set of arguments. */
7830 TREE_VEC_LENGTH (arglist
)--;
7831 found
= tsubst (gen_tmpl
, arglist
, complain
, NULL_TREE
);
7832 TREE_VEC_LENGTH (arglist
)++;
7833 /* FOUND is either a proper class type, or an alias
7834 template specialization. In the later case, it's a
7835 TYPE_DECL, resulting from the substituting of arguments
7836 for parameters in the TYPE_DECL of the alias template
7837 done earlier. So be careful while getting the template
7839 found
= TREE_CODE (found
) == TYPE_DECL
7840 ? TYPE_TI_TEMPLATE (TREE_TYPE (found
))
7841 : CLASSTYPE_TI_TEMPLATE (found
);
7844 SET_TYPE_TEMPLATE_INFO (t
, build_template_info (found
, arglist
));
7847 slot
= htab_find_slot_with_hash (type_specializations
,
7848 &elt
, hash
, INSERT
);
7849 entry
= ggc_alloc_spec_entry ();
7853 /* Note this use of the partial instantiation so we can check it
7854 later in maybe_process_partial_specialization. */
7855 DECL_TEMPLATE_INSTANTIATIONS (found
)
7856 = tree_cons (arglist
, t
,
7857 DECL_TEMPLATE_INSTANTIATIONS (found
));
7859 if (TREE_CODE (template_type
) == ENUMERAL_TYPE
&& !is_dependent_type
7860 && !DECL_ALIAS_TEMPLATE_P (gen_tmpl
))
7861 /* Now that the type has been registered on the instantiations
7862 list, we set up the enumerators. Because the enumeration
7863 constants may involve the enumeration type itself, we make
7864 sure to register the type first, and then create the
7865 constants. That way, doing tsubst_expr for the enumeration
7866 constants won't result in recursive calls here; we'll find
7867 the instantiation and exit above. */
7868 tsubst_enum (template_type
, t
, arglist
);
7870 if (CLASS_TYPE_P (template_type
) && is_dependent_type
)
7871 /* If the type makes use of template parameters, the
7872 code that generates debugging information will crash. */
7873 DECL_IGNORED_P (TYPE_MAIN_DECL (t
)) = 1;
7875 /* Possibly limit visibility based on template args. */
7876 TREE_PUBLIC (type_decl
) = 1;
7877 determine_visibility (type_decl
);
7883 /* Wrapper for lookup_template_class_1. */
7886 lookup_template_class (tree d1
, tree arglist
, tree in_decl
, tree context
,
7887 int entering_scope
, tsubst_flags_t complain
)
7890 timevar_push (TV_TEMPLATE_INST
);
7891 ret
= lookup_template_class_1 (d1
, arglist
, in_decl
, context
,
7892 entering_scope
, complain
);
7893 timevar_pop (TV_TEMPLATE_INST
);
7901 /* True when we should also visit template parameters that occur in
7902 non-deduced contexts. */
7903 bool include_nondeduced_p
;
7904 struct pointer_set_t
*visited
;
7907 /* Called from for_each_template_parm via walk_tree. */
7910 for_each_template_parm_r (tree
*tp
, int *walk_subtrees
, void *d
)
7913 struct pair_fn_data
*pfd
= (struct pair_fn_data
*) d
;
7914 tree_fn_t fn
= pfd
->fn
;
7915 void *data
= pfd
->data
;
7918 && (pfd
->include_nondeduced_p
|| TREE_CODE (t
) != TYPENAME_TYPE
)
7919 && for_each_template_parm (TYPE_CONTEXT (t
), fn
, data
, pfd
->visited
,
7920 pfd
->include_nondeduced_p
))
7921 return error_mark_node
;
7923 switch (TREE_CODE (t
))
7926 if (TYPE_PTRMEMFUNC_P (t
))
7932 if (!TYPE_TEMPLATE_INFO (t
))
7934 else if (for_each_template_parm (TYPE_TI_ARGS (t
),
7935 fn
, data
, pfd
->visited
,
7936 pfd
->include_nondeduced_p
))
7937 return error_mark_node
;
7941 if (for_each_template_parm (TYPE_MIN_VALUE (t
),
7942 fn
, data
, pfd
->visited
,
7943 pfd
->include_nondeduced_p
)
7944 || for_each_template_parm (TYPE_MAX_VALUE (t
),
7945 fn
, data
, pfd
->visited
,
7946 pfd
->include_nondeduced_p
))
7947 return error_mark_node
;
7951 /* Since we're not going to walk subtrees, we have to do this
7953 if (for_each_template_parm (TYPE_METHOD_BASETYPE (t
), fn
, data
,
7954 pfd
->visited
, pfd
->include_nondeduced_p
))
7955 return error_mark_node
;
7959 /* Check the return type. */
7960 if (for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
7961 pfd
->include_nondeduced_p
))
7962 return error_mark_node
;
7964 /* Check the parameter types. Since default arguments are not
7965 instantiated until they are needed, the TYPE_ARG_TYPES may
7966 contain expressions that involve template parameters. But,
7967 no-one should be looking at them yet. And, once they're
7968 instantiated, they don't contain template parameters, so
7969 there's no point in looking at them then, either. */
7973 for (parm
= TYPE_ARG_TYPES (t
); parm
; parm
= TREE_CHAIN (parm
))
7974 if (for_each_template_parm (TREE_VALUE (parm
), fn
, data
,
7975 pfd
->visited
, pfd
->include_nondeduced_p
))
7976 return error_mark_node
;
7978 /* Since we've already handled the TYPE_ARG_TYPES, we don't
7979 want walk_tree walking into them itself. */
7985 case UNDERLYING_TYPE
:
7986 if (pfd
->include_nondeduced_p
7987 && for_each_template_parm (TYPE_FIELDS (t
), fn
, data
,
7989 pfd
->include_nondeduced_p
))
7990 return error_mark_node
;
7995 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
)
7996 && for_each_template_parm (DECL_TI_ARGS (t
), fn
, data
,
7997 pfd
->visited
, pfd
->include_nondeduced_p
))
7998 return error_mark_node
;
8003 if (TREE_CODE (t
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (t
)
8004 && for_each_template_parm (DECL_INITIAL (t
), fn
, data
,
8005 pfd
->visited
, pfd
->include_nondeduced_p
))
8006 return error_mark_node
;
8007 if (DECL_CONTEXT (t
)
8008 && pfd
->include_nondeduced_p
8009 && for_each_template_parm (DECL_CONTEXT (t
), fn
, data
,
8010 pfd
->visited
, pfd
->include_nondeduced_p
))
8011 return error_mark_node
;
8014 case BOUND_TEMPLATE_TEMPLATE_PARM
:
8015 /* Record template parameters such as `T' inside `TT<T>'. */
8016 if (for_each_template_parm (TYPE_TI_ARGS (t
), fn
, data
, pfd
->visited
,
8017 pfd
->include_nondeduced_p
))
8018 return error_mark_node
;
8021 case TEMPLATE_TEMPLATE_PARM
:
8022 case TEMPLATE_TYPE_PARM
:
8023 case TEMPLATE_PARM_INDEX
:
8024 if (fn
&& (*fn
)(t
, data
))
8025 return error_mark_node
;
8027 return error_mark_node
;
8031 /* A template template parameter is encountered. */
8032 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
)
8033 && for_each_template_parm (TREE_TYPE (t
), fn
, data
, pfd
->visited
,
8034 pfd
->include_nondeduced_p
))
8035 return error_mark_node
;
8037 /* Already substituted template template parameter */
8043 || for_each_template_parm (TYPENAME_TYPE_FULLNAME (t
), fn
,
8045 pfd
->include_nondeduced_p
))
8046 return error_mark_node
;
8050 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
))
8051 && pfd
->include_nondeduced_p
8052 && for_each_template_parm (TYPE_PTRMEMFUNC_FN_TYPE
8053 (TREE_TYPE (t
)), fn
, data
,
8054 pfd
->visited
, pfd
->include_nondeduced_p
))
8055 return error_mark_node
;
8060 /* If there's no type, then this thing must be some expression
8061 involving template parameters. */
8062 if (!fn
&& !TREE_TYPE (t
))
8063 return error_mark_node
;
8068 case IMPLICIT_CONV_EXPR
:
8069 case REINTERPRET_CAST_EXPR
:
8070 case CONST_CAST_EXPR
:
8071 case STATIC_CAST_EXPR
:
8072 case DYNAMIC_CAST_EXPR
:
8076 case PSEUDO_DTOR_EXPR
:
8078 return error_mark_node
;
8085 /* We didn't find any template parameters we liked. */
8089 /* For each TEMPLATE_TYPE_PARM, TEMPLATE_TEMPLATE_PARM,
8090 BOUND_TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX in T,
8091 call FN with the parameter and the DATA.
8092 If FN returns nonzero, the iteration is terminated, and
8093 for_each_template_parm returns 1. Otherwise, the iteration
8094 continues. If FN never returns a nonzero value, the value
8095 returned by for_each_template_parm is 0. If FN is NULL, it is
8096 considered to be the function which always returns 1.
8098 If INCLUDE_NONDEDUCED_P, then this routine will also visit template
8099 parameters that occur in non-deduced contexts. When false, only
8100 visits those template parameters that can be deduced. */
8103 for_each_template_parm (tree t
, tree_fn_t fn
, void* data
,
8104 struct pointer_set_t
*visited
,
8105 bool include_nondeduced_p
)
8107 struct pair_fn_data pfd
;
8113 pfd
.include_nondeduced_p
= include_nondeduced_p
;
8115 /* Walk the tree. (Conceptually, we would like to walk without
8116 duplicates, but for_each_template_parm_r recursively calls
8117 for_each_template_parm, so we would need to reorganize a fair
8118 bit to use walk_tree_without_duplicates, so we keep our own
8121 pfd
.visited
= visited
;
8123 pfd
.visited
= pointer_set_create ();
8124 result
= cp_walk_tree (&t
,
8125 for_each_template_parm_r
,
8127 pfd
.visited
) != NULL_TREE
;
8132 pointer_set_destroy (pfd
.visited
);
8139 /* Returns true if T depends on any template parameter. */
8142 uses_template_parms (tree t
)
8145 int saved_processing_template_decl
;
8147 saved_processing_template_decl
= processing_template_decl
;
8148 if (!saved_processing_template_decl
)
8149 processing_template_decl
= 1;
8151 dependent_p
= dependent_type_p (t
);
8152 else if (TREE_CODE (t
) == TREE_VEC
)
8153 dependent_p
= any_dependent_template_arguments_p (t
);
8154 else if (TREE_CODE (t
) == TREE_LIST
)
8155 dependent_p
= (uses_template_parms (TREE_VALUE (t
))
8156 || uses_template_parms (TREE_CHAIN (t
)));
8157 else if (TREE_CODE (t
) == TYPE_DECL
)
8158 dependent_p
= dependent_type_p (TREE_TYPE (t
));
8161 || TREE_CODE (t
) == TEMPLATE_PARM_INDEX
8162 || TREE_CODE (t
) == OVERLOAD
8165 || TREE_CODE (t
) == TRAIT_EXPR
8166 || TREE_CODE (t
) == CONSTRUCTOR
8167 || CONSTANT_CLASS_P (t
))
8168 dependent_p
= (type_dependent_expression_p (t
)
8169 || value_dependent_expression_p (t
));
8172 gcc_assert (t
== error_mark_node
);
8173 dependent_p
= false;
8176 processing_template_decl
= saved_processing_template_decl
;
8181 /* Returns true iff current_function_decl is an incompletely instantiated
8182 template. Useful instead of processing_template_decl because the latter
8183 is set to 0 during fold_non_dependent_expr. */
8186 in_template_function (void)
8188 tree fn
= current_function_decl
;
8190 ++processing_template_decl
;
8191 ret
= (fn
&& DECL_LANG_SPECIFIC (fn
)
8192 && DECL_TEMPLATE_INFO (fn
)
8193 && any_dependent_template_arguments_p (DECL_TI_ARGS (fn
)));
8194 --processing_template_decl
;
8198 /* Returns true if T depends on any template parameter with level LEVEL. */
8201 uses_template_parms_level (tree t
, int level
)
8203 return for_each_template_parm (t
, template_parm_this_level_p
, &level
, NULL
,
8204 /*include_nondeduced_p=*/true);
8207 /* Returns TRUE iff INST is an instantiation we don't need to do in an
8208 ill-formed translation unit, i.e. a variable or function that isn't
8209 usable in a constant expression. */
8212 neglectable_inst_p (tree d
)
8215 && !(TREE_CODE (d
) == FUNCTION_DECL
? DECL_DECLARED_CONSTEXPR_P (d
)
8216 : decl_maybe_constant_var_p (d
)));
8219 /* Returns TRUE iff we should refuse to instantiate DECL because it's
8220 neglectable and instantiated from within an erroneous instantiation. */
8223 limit_bad_template_recursion (tree decl
)
8225 struct tinst_level
*lev
= current_tinst_level
;
8226 int errs
= errorcount
+ sorrycount
;
8227 if (lev
== NULL
|| errs
== 0 || !neglectable_inst_p (decl
))
8230 for (; lev
; lev
= lev
->next
)
8231 if (neglectable_inst_p (lev
->decl
))
8234 return (lev
&& errs
> lev
->errors
);
8237 static int tinst_depth
;
8238 extern int max_tinst_depth
;
8241 static GTY(()) struct tinst_level
*last_error_tinst_level
;
8243 /* We're starting to instantiate D; record the template instantiation context
8244 for diagnostics and to restore it later. */
8247 push_tinst_level (tree d
)
8249 struct tinst_level
*new_level
;
8251 if (tinst_depth
>= max_tinst_depth
)
8253 last_error_tinst_level
= current_tinst_level
;
8254 if (TREE_CODE (d
) == TREE_LIST
)
8255 error ("template instantiation depth exceeds maximum of %d (use "
8256 "-ftemplate-depth= to increase the maximum) substituting %qS",
8257 max_tinst_depth
, d
);
8259 error ("template instantiation depth exceeds maximum of %d (use "
8260 "-ftemplate-depth= to increase the maximum) instantiating %qD",
8261 max_tinst_depth
, d
);
8263 print_instantiation_context ();
8268 /* If the current instantiation caused problems, don't let it instantiate
8269 anything else. Do allow deduction substitution and decls usable in
8270 constant expressions. */
8271 if (limit_bad_template_recursion (d
))
8274 new_level
= ggc_alloc_tinst_level ();
8275 new_level
->decl
= d
;
8276 new_level
->locus
= input_location
;
8277 new_level
->errors
= errorcount
+sorrycount
;
8278 new_level
->in_system_header_p
= in_system_header_at (input_location
);
8279 new_level
->next
= current_tinst_level
;
8280 current_tinst_level
= new_level
;
8283 if (GATHER_STATISTICS
&& (tinst_depth
> depth_reached
))
8284 depth_reached
= tinst_depth
;
8289 /* We're done instantiating this template; return to the instantiation
8293 pop_tinst_level (void)
8295 /* Restore the filename and line number stashed away when we started
8296 this instantiation. */
8297 input_location
= current_tinst_level
->locus
;
8298 current_tinst_level
= current_tinst_level
->next
;
8302 /* We're instantiating a deferred template; restore the template
8303 instantiation context in which the instantiation was requested, which
8304 is one step out from LEVEL. Return the corresponding DECL or TYPE. */
8307 reopen_tinst_level (struct tinst_level
*level
)
8309 struct tinst_level
*t
;
8312 for (t
= level
; t
; t
= t
->next
)
8315 current_tinst_level
= level
;
8317 if (current_tinst_level
)
8318 current_tinst_level
->errors
= errorcount
+sorrycount
;
8322 /* Returns the TINST_LEVEL which gives the original instantiation
8325 struct tinst_level
*
8326 outermost_tinst_level (void)
8328 struct tinst_level
*level
= current_tinst_level
;
8331 level
= level
->next
;
8335 /* DECL is a friend FUNCTION_DECL or TEMPLATE_DECL. ARGS is the
8336 vector of template arguments, as for tsubst.
8338 Returns an appropriate tsubst'd friend declaration. */
8341 tsubst_friend_function (tree decl
, tree args
)
8345 if (TREE_CODE (decl
) == FUNCTION_DECL
8346 && DECL_TEMPLATE_INSTANTIATION (decl
)
8347 && TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
8348 /* This was a friend declared with an explicit template
8349 argument list, e.g.:
8353 to indicate that f was a template instantiation, not a new
8354 function declaration. Now, we have to figure out what
8355 instantiation of what template. */
8357 tree template_id
, arglist
, fns
;
8360 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (current_class_type
));
8362 /* Friend functions are looked up in the containing namespace scope.
8363 We must enter that scope, to avoid finding member functions of the
8364 current class with same name. */
8365 push_nested_namespace (ns
);
8366 fns
= tsubst_expr (DECL_TI_TEMPLATE (decl
), args
,
8367 tf_warning_or_error
, NULL_TREE
,
8368 /*integral_constant_expression_p=*/false);
8369 pop_nested_namespace (ns
);
8370 arglist
= tsubst (DECL_TI_ARGS (decl
), args
,
8371 tf_warning_or_error
, NULL_TREE
);
8372 template_id
= lookup_template_function (fns
, arglist
);
8374 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8375 tmpl
= determine_specialization (template_id
, new_friend
,
8377 /*need_member_template=*/0,
8378 TREE_VEC_LENGTH (args
),
8380 return instantiate_template (tmpl
, new_args
, tf_error
);
8383 new_friend
= tsubst (decl
, args
, tf_warning_or_error
, NULL_TREE
);
8385 /* The NEW_FRIEND will look like an instantiation, to the
8386 compiler, but is not an instantiation from the point of view of
8387 the language. For example, we might have had:
8389 template <class T> struct S {
8390 template <class U> friend void f(T, U);
8393 Then, in S<int>, template <class U> void f(int, U) is not an
8394 instantiation of anything. */
8395 if (new_friend
== error_mark_node
)
8396 return error_mark_node
;
8398 DECL_USE_TEMPLATE (new_friend
) = 0;
8399 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8401 DECL_USE_TEMPLATE (DECL_TEMPLATE_RESULT (new_friend
)) = 0;
8402 DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (new_friend
))
8403 = DECL_SAVED_TREE (DECL_TEMPLATE_RESULT (decl
));
8406 /* The mangled name for the NEW_FRIEND is incorrect. The function
8407 is not a template instantiation and should not be mangled like
8408 one. Therefore, we forget the mangling here; we'll recompute it
8409 later if we need it. */
8410 if (TREE_CODE (new_friend
) != TEMPLATE_DECL
)
8412 SET_DECL_RTL (new_friend
, NULL
);
8413 SET_DECL_ASSEMBLER_NAME (new_friend
, NULL_TREE
);
8416 if (DECL_NAMESPACE_SCOPE_P (new_friend
))
8419 tree new_friend_template_info
;
8420 tree new_friend_result_template_info
;
8422 int new_friend_is_defn
;
8424 /* We must save some information from NEW_FRIEND before calling
8425 duplicate decls since that function will free NEW_FRIEND if
8427 new_friend_template_info
= DECL_TEMPLATE_INFO (new_friend
);
8428 new_friend_is_defn
=
8429 (DECL_INITIAL (DECL_TEMPLATE_RESULT
8430 (template_for_substitution (new_friend
)))
8432 if (TREE_CODE (new_friend
) == TEMPLATE_DECL
)
8434 /* This declaration is a `primary' template. */
8435 DECL_PRIMARY_TEMPLATE (new_friend
) = new_friend
;
8437 new_friend_result_template_info
8438 = DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (new_friend
));
8441 new_friend_result_template_info
= NULL_TREE
;
8443 /* Make the init_value nonzero so pushdecl knows this is a defn. */
8444 if (new_friend_is_defn
)
8445 DECL_INITIAL (new_friend
) = error_mark_node
;
8447 /* Inside pushdecl_namespace_level, we will push into the
8448 current namespace. However, the friend function should go
8449 into the namespace of the template. */
8450 ns
= decl_namespace_context (new_friend
);
8451 push_nested_namespace (ns
);
8452 old_decl
= pushdecl_namespace_level (new_friend
, /*is_friend=*/true);
8453 pop_nested_namespace (ns
);
8455 if (old_decl
== error_mark_node
)
8456 return error_mark_node
;
8458 if (old_decl
!= new_friend
)
8460 /* This new friend declaration matched an existing
8461 declaration. For example, given:
8463 template <class T> void f(T);
8464 template <class U> class C {
8465 template <class T> friend void f(T) {}
8468 the friend declaration actually provides the definition
8469 of `f', once C has been instantiated for some type. So,
8470 old_decl will be the out-of-class template declaration,
8471 while new_friend is the in-class definition.
8473 But, if `f' was called before this point, the
8474 instantiation of `f' will have DECL_TI_ARGS corresponding
8475 to `T' but not to `U', references to which might appear
8476 in the definition of `f'. Previously, the most general
8477 template for an instantiation of `f' was the out-of-class
8478 version; now it is the in-class version. Therefore, we
8479 run through all specialization of `f', adding to their
8480 DECL_TI_ARGS appropriately. In particular, they need a
8481 new set of outer arguments, corresponding to the
8482 arguments for this class instantiation.
8484 The same situation can arise with something like this:
8487 template <class T> class C {
8491 when `C<int>' is instantiated. Now, `f(int)' is defined
8494 if (!new_friend_is_defn
)
8495 /* On the other hand, if the in-class declaration does
8496 *not* provide a definition, then we don't want to alter
8497 existing definitions. We can just leave everything
8502 tree new_template
= TI_TEMPLATE (new_friend_template_info
);
8503 tree new_args
= TI_ARGS (new_friend_template_info
);
8505 /* Overwrite whatever template info was there before, if
8506 any, with the new template information pertaining to
8508 DECL_TEMPLATE_INFO (old_decl
) = new_friend_template_info
;
8510 if (TREE_CODE (old_decl
) != TEMPLATE_DECL
)
8512 /* We should have called reregister_specialization in
8514 gcc_assert (retrieve_specialization (new_template
,
8518 /* Instantiate it if the global has already been used. */
8519 if (DECL_ODR_USED (old_decl
))
8520 instantiate_decl (old_decl
, /*defer_ok=*/true,
8521 /*expl_inst_class_mem_p=*/false);
8527 /* Indicate that the old function template is a partial
8529 DECL_TEMPLATE_INFO (DECL_TEMPLATE_RESULT (old_decl
))
8530 = new_friend_result_template_info
;
8532 gcc_assert (new_template
8533 == most_general_template (new_template
));
8534 gcc_assert (new_template
!= old_decl
);
8536 /* Reassign any specializations already in the hash table
8537 to the new more general template, and add the
8538 additional template args. */
8539 for (t
= DECL_TEMPLATE_INSTANTIATIONS (old_decl
);
8543 tree spec
= TREE_VALUE (t
);
8546 elt
.tmpl
= old_decl
;
8547 elt
.args
= DECL_TI_ARGS (spec
);
8548 elt
.spec
= NULL_TREE
;
8550 htab_remove_elt (decl_specializations
, &elt
);
8553 = add_outermost_template_args (new_args
,
8554 DECL_TI_ARGS (spec
));
8556 register_specialization
8557 (spec
, new_template
, DECL_TI_ARGS (spec
), true, 0);
8560 DECL_TEMPLATE_INSTANTIATIONS (old_decl
) = NULL_TREE
;
8564 /* The information from NEW_FRIEND has been merged into OLD_DECL
8565 by duplicate_decls. */
8566 new_friend
= old_decl
;
8571 tree context
= DECL_CONTEXT (new_friend
);
8575 template <class T> class C {
8576 template <class U> friend void C1<U>::f (); // case 1
8577 friend void C2<T>::f (); // case 2
8579 we only need to make sure CONTEXT is a complete type for
8580 case 2. To distinguish between the two cases, we note that
8581 CONTEXT of case 1 remains dependent type after tsubst while
8582 this isn't true for case 2. */
8583 ++processing_template_decl
;
8584 dependent_p
= dependent_type_p (context
);
8585 --processing_template_decl
;
8588 && !complete_type_or_else (context
, NULL_TREE
))
8589 return error_mark_node
;
8591 if (COMPLETE_TYPE_P (context
))
8593 tree fn
= new_friend
;
8594 /* do_friend adds the TEMPLATE_DECL for any member friend
8595 template even if it isn't a member template, i.e.
8596 template <class T> friend A<T>::f();
8597 Look through it in that case. */
8598 if (TREE_CODE (fn
) == TEMPLATE_DECL
8599 && !PRIMARY_TEMPLATE_P (fn
))
8600 fn
= DECL_TEMPLATE_RESULT (fn
);
8601 /* Check to see that the declaration is really present, and,
8602 possibly obtain an improved declaration. */
8603 fn
= check_classfn (context
, fn
, NULL_TREE
);
8613 /* FRIEND_TMPL is a friend TEMPLATE_DECL. ARGS is the vector of
8614 template arguments, as for tsubst.
8616 Returns an appropriate tsubst'd friend type or error_mark_node on
8620 tsubst_friend_class (tree friend_tmpl
, tree args
)
8626 if (DECL_TEMPLATE_TEMPLATE_PARM_P (friend_tmpl
))
8628 tree t
= tsubst (TREE_TYPE (friend_tmpl
), args
, tf_none
, NULL_TREE
);
8629 return TREE_TYPE (t
);
8632 context
= CP_DECL_CONTEXT (friend_tmpl
);
8634 if (context
!= global_namespace
)
8636 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8637 push_nested_namespace (context
);
8639 push_nested_class (tsubst (context
, args
, tf_none
, NULL_TREE
));
8642 /* Look for a class template declaration. We look for hidden names
8643 because two friend declarations of the same template are the
8644 same. For example, in:
8647 template <typename> friend class F;
8649 template <typename> struct B {
8650 template <typename> friend class F;
8653 both F templates are the same. */
8654 tmpl
= lookup_name_real (DECL_NAME (friend_tmpl
), 0, 0,
8655 /*block_p=*/true, 0, LOOKUP_HIDDEN
);
8657 /* But, if we don't find one, it might be because we're in a
8658 situation like this:
8666 Here, in the scope of (say) S<int>, `S' is bound to a TYPE_DECL
8667 for `S<int>', not the TEMPLATE_DECL. */
8668 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
8670 tmpl
= lookup_name_prefer_type (DECL_NAME (friend_tmpl
), 1);
8671 tmpl
= maybe_get_template_decl_from_type_decl (tmpl
);
8674 if (tmpl
&& DECL_CLASS_TEMPLATE_P (tmpl
))
8676 /* The friend template has already been declared. Just
8677 check to see that the declarations match, and install any new
8678 default parameters. We must tsubst the default parameters,
8679 of course. We only need the innermost template parameters
8680 because that is all that redeclare_class_template will look
8682 if (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (friend_tmpl
))
8683 > TMPL_ARGS_DEPTH (args
))
8686 location_t saved_input_location
;
8687 parms
= tsubst_template_parms (DECL_TEMPLATE_PARMS (friend_tmpl
),
8688 args
, tf_warning_or_error
);
8690 saved_input_location
= input_location
;
8691 input_location
= DECL_SOURCE_LOCATION (friend_tmpl
);
8692 redeclare_class_template (TREE_TYPE (tmpl
), parms
);
8693 input_location
= saved_input_location
;
8697 friend_type
= TREE_TYPE (tmpl
);
8701 /* The friend template has not already been declared. In this
8702 case, the instantiation of the template class will cause the
8703 injection of this template into the global scope. */
8704 tmpl
= tsubst (friend_tmpl
, args
, tf_warning_or_error
, NULL_TREE
);
8705 if (tmpl
== error_mark_node
)
8706 return error_mark_node
;
8708 /* The new TMPL is not an instantiation of anything, so we
8709 forget its origins. We don't reset CLASSTYPE_TI_TEMPLATE for
8710 the new type because that is supposed to be the corresponding
8711 template decl, i.e., TMPL. */
8712 DECL_USE_TEMPLATE (tmpl
) = 0;
8713 DECL_TEMPLATE_INFO (tmpl
) = NULL_TREE
;
8714 CLASSTYPE_USE_TEMPLATE (TREE_TYPE (tmpl
)) = 0;
8715 CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
))
8716 = INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (TREE_TYPE (tmpl
)));
8718 /* Inject this template into the global scope. */
8719 friend_type
= TREE_TYPE (pushdecl_top_level_maybe_friend (tmpl
, true));
8722 if (context
!= global_namespace
)
8724 if (TREE_CODE (context
) == NAMESPACE_DECL
)
8725 pop_nested_namespace (context
);
8727 pop_nested_class ();
8733 /* Returns zero if TYPE cannot be completed later due to circularity.
8734 Otherwise returns one. */
8737 can_complete_type_without_circularity (tree type
)
8739 if (type
== NULL_TREE
|| type
== error_mark_node
)
8741 else if (COMPLETE_TYPE_P (type
))
8743 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
8744 return can_complete_type_without_circularity (TREE_TYPE (type
));
8745 else if (CLASS_TYPE_P (type
)
8746 && TYPE_BEING_DEFINED (TYPE_MAIN_VARIANT (type
)))
8752 static tree
tsubst_omp_clauses (tree
, bool, tree
, tsubst_flags_t
, tree
);
8754 /* Apply any attributes which had to be deferred until instantiation
8755 time. DECL_P, ATTRIBUTES and ATTR_FLAGS are as cplus_decl_attributes;
8756 ARGS, COMPLAIN, IN_DECL are as tsubst. */
8759 apply_late_template_attributes (tree
*decl_p
, tree attributes
, int attr_flags
,
8760 tree args
, tsubst_flags_t complain
, tree in_decl
)
8762 tree last_dep
= NULL_TREE
;
8766 for (t
= attributes
; t
; t
= TREE_CHAIN (t
))
8767 if (ATTR_IS_DEPENDENT (t
))
8770 attributes
= copy_list (attributes
);
8774 if (DECL_P (*decl_p
))
8776 if (TREE_TYPE (*decl_p
) == error_mark_node
)
8778 p
= &DECL_ATTRIBUTES (*decl_p
);
8781 p
= &TYPE_ATTRIBUTES (*decl_p
);
8785 tree late_attrs
= NULL_TREE
;
8786 tree
*q
= &late_attrs
;
8788 for (*p
= attributes
; *p
; )
8791 if (ATTR_IS_DEPENDENT (t
))
8793 *p
= TREE_CHAIN (t
);
8794 TREE_CHAIN (t
) = NULL_TREE
;
8795 if ((flag_openmp
|| flag_cilkplus
)
8796 && is_attribute_p ("omp declare simd",
8797 get_attribute_name (t
))
8800 tree clauses
= TREE_VALUE (TREE_VALUE (t
));
8801 clauses
= tsubst_omp_clauses (clauses
, true, args
,
8803 c_omp_declare_simd_clauses_to_decls (*decl_p
, clauses
);
8804 clauses
= finish_omp_clauses (clauses
);
8805 tree parms
= DECL_ARGUMENTS (*decl_p
);
8807 = c_omp_declare_simd_clauses_to_numbers (parms
, clauses
);
8809 TREE_VALUE (TREE_VALUE (t
)) = clauses
;
8811 TREE_VALUE (t
) = NULL_TREE
;
8813 /* If the first attribute argument is an identifier, don't
8814 pass it through tsubst. Attributes like mode, format,
8815 cleanup and several target specific attributes expect it
8817 else if (attribute_takes_identifier_p (get_attribute_name (t
))
8821 = tsubst_expr (TREE_CHAIN (TREE_VALUE (t
)), args
, complain
,
8823 /*integral_constant_expression_p=*/false);
8824 if (chain
!= TREE_CHAIN (TREE_VALUE (t
)))
8826 = tree_cons (NULL_TREE
, TREE_VALUE (TREE_VALUE (t
)),
8831 = tsubst_expr (TREE_VALUE (t
), args
, complain
, in_decl
,
8832 /*integral_constant_expression_p=*/false);
8834 q
= &TREE_CHAIN (t
);
8837 p
= &TREE_CHAIN (t
);
8840 cplus_decl_attributes (decl_p
, late_attrs
, attr_flags
);
8844 /* Perform (or defer) access check for typedefs that were referenced
8845 from within the template TMPL code.
8846 This is a subroutine of instantiate_decl and instantiate_class_template.
8847 TMPL is the template to consider and TARGS is the list of arguments of
8851 perform_typedefs_access_check (tree tmpl
, tree targs
)
8853 location_t saved_location
;
8855 qualified_typedef_usage_t
*iter
;
8858 || (!CLASS_TYPE_P (tmpl
)
8859 && TREE_CODE (tmpl
) != FUNCTION_DECL
))
8862 saved_location
= input_location
;
8863 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (tmpl
), i
, iter
)
8865 tree type_decl
= iter
->typedef_decl
;
8866 tree type_scope
= iter
->context
;
8868 if (!type_decl
|| !type_scope
|| !CLASS_TYPE_P (type_scope
))
8871 if (uses_template_parms (type_decl
))
8872 type_decl
= tsubst (type_decl
, targs
, tf_error
, NULL_TREE
);
8873 if (uses_template_parms (type_scope
))
8874 type_scope
= tsubst (type_scope
, targs
, tf_error
, NULL_TREE
);
8876 /* Make access check error messages point to the location
8877 of the use of the typedef. */
8878 input_location
= iter
->locus
;
8879 perform_or_defer_access_check (TYPE_BINFO (type_scope
),
8880 type_decl
, type_decl
,
8881 tf_warning_or_error
);
8883 input_location
= saved_location
;
8887 instantiate_class_template_1 (tree type
)
8889 tree templ
, args
, pattern
, t
, member
;
8893 unsigned int saved_maximum_field_alignment
;
8896 if (type
== error_mark_node
)
8897 return error_mark_node
;
8899 if (COMPLETE_OR_OPEN_TYPE_P (type
)
8900 || uses_template_parms (type
))
8903 /* Figure out which template is being instantiated. */
8904 templ
= most_general_template (CLASSTYPE_TI_TEMPLATE (type
));
8905 gcc_assert (TREE_CODE (templ
) == TEMPLATE_DECL
);
8907 /* Determine what specialization of the original template to
8909 t
= most_specialized_class (type
, tf_warning_or_error
);
8910 if (t
== error_mark_node
)
8912 TYPE_BEING_DEFINED (type
) = 1;
8913 return error_mark_node
;
8917 /* This TYPE is actually an instantiation of a partial
8918 specialization. We replace the innermost set of ARGS with
8919 the arguments appropriate for substitution. For example,
8922 template <class T> struct S {};
8923 template <class T> struct S<T*> {};
8925 and supposing that we are instantiating S<int*>, ARGS will
8926 presently be {int*} -- but we need {int}. */
8927 pattern
= TREE_TYPE (t
);
8928 args
= TREE_PURPOSE (t
);
8932 pattern
= TREE_TYPE (templ
);
8933 args
= CLASSTYPE_TI_ARGS (type
);
8936 /* If the template we're instantiating is incomplete, then clearly
8937 there's nothing we can do. */
8938 if (!COMPLETE_TYPE_P (pattern
))
8941 /* If we've recursively instantiated too many templates, stop. */
8942 if (! push_tinst_level (type
))
8945 /* Now we're really doing the instantiation. Mark the type as in
8946 the process of being defined. */
8947 TYPE_BEING_DEFINED (type
) = 1;
8949 /* We may be in the middle of deferred access check. Disable
8951 push_deferring_access_checks (dk_no_deferred
);
8953 fn_context
= decl_function_context (TYPE_MAIN_DECL (type
));
8955 push_to_top_level ();
8956 /* Use #pragma pack from the template context. */
8957 saved_maximum_field_alignment
= maximum_field_alignment
;
8958 maximum_field_alignment
= TYPE_PRECISION (pattern
);
8960 SET_CLASSTYPE_INTERFACE_UNKNOWN (type
);
8962 /* Set the input location to the most specialized template definition.
8963 This is needed if tsubsting causes an error. */
8964 typedecl
= TYPE_MAIN_DECL (pattern
);
8965 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (type
)) =
8966 DECL_SOURCE_LOCATION (typedecl
);
8968 TYPE_PACKED (type
) = TYPE_PACKED (pattern
);
8969 TYPE_ALIGN (type
) = TYPE_ALIGN (pattern
);
8970 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (pattern
);
8971 TYPE_FOR_JAVA (type
) = TYPE_FOR_JAVA (pattern
); /* For libjava's JArray<T> */
8972 if (ANON_AGGR_TYPE_P (pattern
))
8973 SET_ANON_AGGR_TYPE_P (type
);
8974 if (CLASSTYPE_VISIBILITY_SPECIFIED (pattern
))
8976 CLASSTYPE_VISIBILITY_SPECIFIED (type
) = 1;
8977 CLASSTYPE_VISIBILITY (type
) = CLASSTYPE_VISIBILITY (pattern
);
8978 /* Adjust visibility for template arguments. */
8979 determine_visibility (TYPE_MAIN_DECL (type
));
8981 if (CLASS_TYPE_P (type
))
8982 CLASSTYPE_FINAL (type
) = CLASSTYPE_FINAL (pattern
);
8984 pbinfo
= TYPE_BINFO (pattern
);
8986 /* We should never instantiate a nested class before its enclosing
8987 class; we need to look up the nested class by name before we can
8988 instantiate it, and that lookup should instantiate the enclosing
8990 gcc_assert (!DECL_CLASS_SCOPE_P (TYPE_MAIN_DECL (pattern
))
8991 || COMPLETE_OR_OPEN_TYPE_P (TYPE_CONTEXT (type
)));
8993 base_list
= NULL_TREE
;
8994 if (BINFO_N_BASE_BINFOS (pbinfo
))
9000 /* We must enter the scope containing the type, as that is where
9001 the accessibility of types named in dependent bases are
9003 pushed_scope
= push_scope (CP_TYPE_CONTEXT (type
));
9005 /* Substitute into each of the bases to determine the actual
9007 for (i
= 0; BINFO_BASE_ITERATE (pbinfo
, i
, pbase_binfo
); i
++)
9010 tree access
= BINFO_BASE_ACCESS (pbinfo
, i
);
9011 tree expanded_bases
= NULL_TREE
;
9014 if (PACK_EXPANSION_P (BINFO_TYPE (pbase_binfo
)))
9017 tsubst_pack_expansion (BINFO_TYPE (pbase_binfo
),
9018 args
, tf_error
, NULL_TREE
);
9019 if (expanded_bases
== error_mark_node
)
9022 len
= TREE_VEC_LENGTH (expanded_bases
);
9025 for (idx
= 0; idx
< len
; idx
++)
9028 /* Extract the already-expanded base class. */
9029 base
= TREE_VEC_ELT (expanded_bases
, idx
);
9031 /* Substitute to figure out the base class. */
9032 base
= tsubst (BINFO_TYPE (pbase_binfo
), args
, tf_error
,
9035 if (base
== error_mark_node
)
9038 base_list
= tree_cons (access
, base
, base_list
);
9039 if (BINFO_VIRTUAL_P (pbase_binfo
))
9040 TREE_TYPE (base_list
) = integer_type_node
;
9044 /* The list is now in reverse order; correct that. */
9045 base_list
= nreverse (base_list
);
9048 pop_scope (pushed_scope
);
9050 /* Now call xref_basetypes to set up all the base-class
9052 xref_basetypes (type
, base_list
);
9054 apply_late_template_attributes (&type
, TYPE_ATTRIBUTES (pattern
),
9055 (int) ATTR_FLAG_TYPE_IN_PLACE
,
9056 args
, tf_error
, NULL_TREE
);
9057 fixup_attribute_variants (type
);
9059 /* Now that our base classes are set up, enter the scope of the
9060 class, so that name lookups into base classes, etc. will work
9061 correctly. This is precisely analogous to what we do in
9062 begin_class_definition when defining an ordinary non-template
9063 class, except we also need to push the enclosing classes. */
9064 push_nested_class (type
);
9066 /* Now members are processed in the order of declaration. */
9067 for (member
= CLASSTYPE_DECL_LIST (pattern
);
9068 member
; member
= TREE_CHAIN (member
))
9070 tree t
= TREE_VALUE (member
);
9072 if (TREE_PURPOSE (member
))
9076 /* Build new CLASSTYPE_NESTED_UTDS. */
9079 bool class_template_p
;
9081 class_template_p
= (TREE_CODE (t
) != ENUMERAL_TYPE
9082 && TYPE_LANG_SPECIFIC (t
)
9083 && CLASSTYPE_IS_TEMPLATE (t
));
9084 /* If the member is a class template, then -- even after
9085 substitution -- there may be dependent types in the
9086 template argument list for the class. We increment
9087 PROCESSING_TEMPLATE_DECL so that dependent_type_p, as
9088 that function will assume that no types are dependent
9089 when outside of a template. */
9090 if (class_template_p
)
9091 ++processing_template_decl
;
9092 newtag
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9093 if (class_template_p
)
9094 --processing_template_decl
;
9095 if (newtag
== error_mark_node
)
9098 if (TREE_CODE (newtag
) != ENUMERAL_TYPE
)
9100 tree name
= TYPE_IDENTIFIER (t
);
9102 if (class_template_p
)
9103 /* Unfortunately, lookup_template_class sets
9104 CLASSTYPE_IMPLICIT_INSTANTIATION for a partial
9105 instantiation (i.e., for the type of a member
9106 template class nested within a template class.)
9107 This behavior is required for
9108 maybe_process_partial_specialization to work
9109 correctly, but is not accurate in this case;
9110 the TAG is not an instantiation of anything.
9111 (The corresponding TEMPLATE_DECL is an
9112 instantiation, but the TYPE is not.) */
9113 CLASSTYPE_USE_TEMPLATE (newtag
) = 0;
9115 /* Now, we call pushtag to put this NEWTAG into the scope of
9116 TYPE. We first set up the IDENTIFIER_TYPE_VALUE to avoid
9117 pushtag calling push_template_decl. We don't have to do
9118 this for enums because it will already have been done in
9121 SET_IDENTIFIER_TYPE_VALUE (name
, newtag
);
9122 pushtag (name
, newtag
, /*tag_scope=*/ts_current
);
9125 else if (DECL_DECLARES_FUNCTION_P (t
))
9127 /* Build new TYPE_METHODS. */
9130 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9131 ++processing_template_decl
;
9132 r
= tsubst (t
, args
, tf_error
, NULL_TREE
);
9133 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9134 --processing_template_decl
;
9135 set_current_access_from_decl (r
);
9136 finish_member_declaration (r
);
9137 /* Instantiate members marked with attribute used. */
9138 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9140 if (TREE_CODE (r
) == FUNCTION_DECL
9141 && DECL_OMP_DECLARE_REDUCTION_P (r
))
9142 cp_check_omp_declare_reduction (r
);
9144 else if (DECL_CLASS_TEMPLATE_P (t
)
9145 && LAMBDA_TYPE_P (TREE_TYPE (t
)))
9146 /* A closure type for a lambda in a default argument for a
9147 member template. Ignore it; it will be instantiated with
9148 the default argument. */;
9151 /* Build new TYPE_FIELDS. */
9152 if (TREE_CODE (t
) == STATIC_ASSERT
)
9156 ++c_inhibit_evaluation_warnings
;
9158 tsubst_expr (STATIC_ASSERT_CONDITION (t
), args
,
9159 tf_warning_or_error
, NULL_TREE
,
9160 /*integral_constant_expression_p=*/true);
9161 --c_inhibit_evaluation_warnings
;
9163 finish_static_assert (condition
,
9164 STATIC_ASSERT_MESSAGE (t
),
9165 STATIC_ASSERT_SOURCE_LOCATION (t
),
9168 else if (TREE_CODE (t
) != CONST_DECL
)
9171 tree vec
= NULL_TREE
;
9174 /* The file and line for this declaration, to
9175 assist in error message reporting. Since we
9176 called push_tinst_level above, we don't need to
9178 input_location
= DECL_SOURCE_LOCATION (t
);
9180 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9181 ++processing_template_decl
;
9182 r
= tsubst (t
, args
, tf_warning_or_error
, NULL_TREE
);
9183 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9184 --processing_template_decl
;
9186 if (TREE_CODE (r
) == TREE_VEC
)
9188 /* A capture pack became multiple fields. */
9190 len
= TREE_VEC_LENGTH (vec
);
9193 for (int i
= 0; i
< len
; ++i
)
9196 r
= TREE_VEC_ELT (vec
, i
);
9201 [t]he initialization (and any associated
9202 side-effects) of a static data member does
9203 not occur unless the static data member is
9204 itself used in a way that requires the
9205 definition of the static data member to
9208 Therefore, we do not substitute into the
9209 initialized for the static data member here. */
9210 finish_static_data_member_decl
9213 /*init_const_expr_p=*/false,
9214 /*asmspec_tree=*/NULL_TREE
,
9216 /* Instantiate members marked with attribute used. */
9217 if (r
!= error_mark_node
&& DECL_PRESERVE_P (r
))
9220 else if (TREE_CODE (r
) == FIELD_DECL
)
9222 /* Determine whether R has a valid type and can be
9223 completed later. If R is invalid, then its type
9224 is replaced by error_mark_node. */
9225 tree rtype
= TREE_TYPE (r
);
9226 if (can_complete_type_without_circularity (rtype
))
9227 complete_type (rtype
);
9229 if (!COMPLETE_TYPE_P (rtype
))
9231 cxx_incomplete_type_error (r
, rtype
);
9232 TREE_TYPE (r
) = error_mark_node
;
9236 /* If it is a TYPE_DECL for a class-scoped ENUMERAL_TYPE,
9237 such a thing will already have been added to the field
9238 list by tsubst_enum in finish_member_declaration in the
9239 CLASSTYPE_NESTED_UTDS case above. */
9240 if (!(TREE_CODE (r
) == TYPE_DECL
9241 && TREE_CODE (TREE_TYPE (r
)) == ENUMERAL_TYPE
9242 && DECL_ARTIFICIAL (r
)))
9244 set_current_access_from_decl (r
);
9245 finish_member_declaration (r
);
9253 if (TYPE_P (t
) || DECL_CLASS_TEMPLATE_P (t
)
9254 || DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
9256 /* Build new CLASSTYPE_FRIEND_CLASSES. */
9258 tree friend_type
= t
;
9259 bool adjust_processing_template_decl
= false;
9261 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9263 /* template <class T> friend class C; */
9264 friend_type
= tsubst_friend_class (friend_type
, args
);
9265 adjust_processing_template_decl
= true;
9267 else if (TREE_CODE (friend_type
) == UNBOUND_CLASS_TEMPLATE
)
9269 /* template <class T> friend class C::D; */
9270 friend_type
= tsubst (friend_type
, args
,
9271 tf_warning_or_error
, NULL_TREE
);
9272 if (TREE_CODE (friend_type
) == TEMPLATE_DECL
)
9273 friend_type
= TREE_TYPE (friend_type
);
9274 adjust_processing_template_decl
= true;
9276 else if (TREE_CODE (friend_type
) == TYPENAME_TYPE
9277 || TREE_CODE (friend_type
) == TEMPLATE_TYPE_PARM
)
9279 /* This could be either
9283 when dependent_type_p is false or
9285 template <class U> friend class T::C;
9288 friend_type
= tsubst (friend_type
, args
,
9289 tf_warning_or_error
, NULL_TREE
);
9290 /* Bump processing_template_decl for correct
9291 dependent_type_p calculation. */
9292 ++processing_template_decl
;
9293 if (dependent_type_p (friend_type
))
9294 adjust_processing_template_decl
= true;
9295 --processing_template_decl
;
9297 else if (!CLASSTYPE_USE_TEMPLATE (friend_type
)
9298 && hidden_name_p (TYPE_NAME (friend_type
)))
9302 where C hasn't been declared yet. Let's lookup name
9303 from namespace scope directly, bypassing any name that
9304 come from dependent base class. */
9305 tree ns
= decl_namespace_context (TYPE_MAIN_DECL (friend_type
));
9307 /* The call to xref_tag_from_type does injection for friend
9309 push_nested_namespace (ns
);
9311 xref_tag_from_type (friend_type
, NULL_TREE
,
9312 /*tag_scope=*/ts_current
);
9313 pop_nested_namespace (ns
);
9315 else if (uses_template_parms (friend_type
))
9316 /* friend class C<T>; */
9317 friend_type
= tsubst (friend_type
, args
,
9318 tf_warning_or_error
, NULL_TREE
);
9323 where C is already declared or
9325 friend class C<int>;
9327 We don't have to do anything in these cases. */
9329 if (adjust_processing_template_decl
)
9330 /* Trick make_friend_class into realizing that the friend
9331 we're adding is a template, not an ordinary class. It's
9332 important that we use make_friend_class since it will
9333 perform some error-checking and output cross-reference
9335 ++processing_template_decl
;
9337 if (friend_type
!= error_mark_node
)
9338 make_friend_class (type
, friend_type
, /*complain=*/false);
9340 if (adjust_processing_template_decl
)
9341 --processing_template_decl
;
9345 /* Build new DECL_FRIENDLIST. */
9348 /* The file and line for this declaration, to
9349 assist in error message reporting. Since we
9350 called push_tinst_level above, we don't need to
9352 input_location
= DECL_SOURCE_LOCATION (t
);
9354 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9356 ++processing_template_decl
;
9357 push_deferring_access_checks (dk_no_check
);
9360 r
= tsubst_friend_function (t
, args
);
9361 add_friend (type
, r
, /*complain=*/false);
9362 if (TREE_CODE (t
) == TEMPLATE_DECL
)
9364 pop_deferring_access_checks ();
9365 --processing_template_decl
;
9371 if (tree expr
= CLASSTYPE_LAMBDA_EXPR (type
))
9373 tree decl
= lambda_function (type
);
9376 if (!DECL_TEMPLATE_INFO (decl
)
9377 || DECL_TEMPLATE_RESULT (DECL_TI_TEMPLATE (decl
)) != decl
)
9378 instantiate_decl (decl
, false, false);
9380 /* We need to instantiate the capture list from the template
9381 after we've instantiated the closure members, but before we
9382 consider adding the conversion op. Also keep any captures
9383 that may have been added during instantiation of the op(). */
9384 tree tmpl_expr
= CLASSTYPE_LAMBDA_EXPR (pattern
);
9386 = tsubst_copy_and_build (LAMBDA_EXPR_CAPTURE_LIST (tmpl_expr
),
9387 args
, tf_warning_or_error
, NULL_TREE
,
9390 LAMBDA_EXPR_CAPTURE_LIST (expr
)
9391 = chainon (tmpl_cap
, nreverse (LAMBDA_EXPR_CAPTURE_LIST (expr
)));
9393 maybe_add_lambda_conv_op (type
);
9396 gcc_assert (errorcount
);
9399 /* Set the file and line number information to whatever is given for
9400 the class itself. This puts error messages involving generated
9401 implicit functions at a predictable point, and the same point
9402 that would be used for non-template classes. */
9403 input_location
= DECL_SOURCE_LOCATION (typedecl
);
9405 unreverse_member_declarations (type
);
9406 finish_struct_1 (type
);
9407 TYPE_BEING_DEFINED (type
) = 0;
9409 /* We don't instantiate default arguments for member functions. 14.7.1:
9411 The implicit instantiation of a class template specialization causes
9412 the implicit instantiation of the declarations, but not of the
9413 definitions or default arguments, of the class member functions,
9414 member classes, static data members and member templates.... */
9416 /* Some typedefs referenced from within the template code need to be access
9417 checked at template instantiation time, i.e now. These types were
9418 added to the template at parsing time. Let's get those and perform
9419 the access checks then. */
9420 perform_typedefs_access_check (pattern
, args
);
9421 perform_deferred_access_checks (tf_warning_or_error
);
9422 pop_nested_class ();
9423 maximum_field_alignment
= saved_maximum_field_alignment
;
9425 pop_from_top_level ();
9426 pop_deferring_access_checks ();
9429 /* The vtable for a template class can be emitted in any translation
9430 unit in which the class is instantiated. When there is no key
9431 method, however, finish_struct_1 will already have added TYPE to
9432 the keyed_classes list. */
9433 if (TYPE_CONTAINS_VPTR_P (type
) && CLASSTYPE_KEY_METHOD (type
))
9434 keyed_classes
= tree_cons (NULL_TREE
, type
, keyed_classes
);
9439 /* Wrapper for instantiate_class_template_1. */
9442 instantiate_class_template (tree type
)
9445 timevar_push (TV_TEMPLATE_INST
);
9446 ret
= instantiate_class_template_1 (type
);
9447 timevar_pop (TV_TEMPLATE_INST
);
9452 tsubst_template_arg (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9458 else if (TYPE_P (t
))
9459 r
= tsubst (t
, args
, complain
, in_decl
);
9462 if (!(complain
& tf_warning
))
9463 ++c_inhibit_evaluation_warnings
;
9464 r
= tsubst_expr (t
, args
, complain
, in_decl
,
9465 /*integral_constant_expression_p=*/true);
9466 if (!(complain
& tf_warning
))
9467 --c_inhibit_evaluation_warnings
;
9472 /* Given a function parameter pack TMPL_PARM and some function parameters
9473 instantiated from it at *SPEC_P, return a NONTYPE_ARGUMENT_PACK of them
9474 and set *SPEC_P to point at the next point in the list. */
9477 extract_fnparm_pack (tree tmpl_parm
, tree
*spec_p
)
9479 /* Collect all of the extra "packed" parameters into an
9483 tree argpack
= make_node (NONTYPE_ARGUMENT_PACK
);
9484 tree argtypepack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
9485 tree spec_parm
= *spec_p
;
9488 for (len
= 0; spec_parm
; ++len
, spec_parm
= TREE_CHAIN (spec_parm
))
9490 && !function_parameter_expanded_from_pack_p (spec_parm
, tmpl_parm
))
9493 /* Fill in PARMVEC and PARMTYPEVEC with all of the parameters. */
9494 parmvec
= make_tree_vec (len
);
9495 parmtypevec
= make_tree_vec (len
);
9496 spec_parm
= *spec_p
;
9497 for (i
= 0; i
< len
; i
++, spec_parm
= DECL_CHAIN (spec_parm
))
9499 TREE_VEC_ELT (parmvec
, i
) = spec_parm
;
9500 TREE_VEC_ELT (parmtypevec
, i
) = TREE_TYPE (spec_parm
);
9503 /* Build the argument packs. */
9504 SET_ARGUMENT_PACK_ARGS (argpack
, parmvec
);
9505 SET_ARGUMENT_PACK_ARGS (argtypepack
, parmtypevec
);
9506 TREE_TYPE (argpack
) = argtypepack
;
9507 *spec_p
= spec_parm
;
9512 /* Give a chain SPEC_PARM of PARM_DECLs, pack them into a
9513 NONTYPE_ARGUMENT_PACK. */
9516 make_fnparm_pack (tree spec_parm
)
9518 return extract_fnparm_pack (NULL_TREE
, &spec_parm
);
9521 /* Return true iff the Ith element of the argument pack ARG_PACK is a
9525 argument_pack_element_is_expansion_p (tree arg_pack
, int i
)
9527 tree vec
= ARGUMENT_PACK_ARGS (arg_pack
);
9528 if (i
>= TREE_VEC_LENGTH (vec
))
9530 return PACK_EXPANSION_P (TREE_VEC_ELT (vec
, i
));
9534 /* Creates and return an ARGUMENT_PACK_SELECT tree node. */
9537 make_argument_pack_select (tree arg_pack
, unsigned index
)
9539 tree aps
= make_node (ARGUMENT_PACK_SELECT
);
9541 ARGUMENT_PACK_SELECT_FROM_PACK (aps
) = arg_pack
;
9542 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9547 /* This is a subroutine of tsubst_pack_expansion.
9549 It returns TRUE if we need to use the PACK_EXPANSION_EXTRA_ARGS
9550 mechanism to store the (non complete list of) arguments of the
9551 substitution and return a non substituted pack expansion, in order
9552 to wait for when we have enough arguments to really perform the
9556 use_pack_expansion_extra_args_p (tree parm_packs
,
9560 /* If one pack has an expansion and another pack has a normal
9561 argument or if one pack has an empty argument and an another
9562 one hasn't then tsubst_pack_expansion cannot perform the
9563 substitution and need to fall back on the
9564 PACK_EXPANSION_EXTRA mechanism. */
9565 if (parm_packs
== NULL_TREE
)
9567 else if (has_empty_arg
)
9570 bool has_expansion_arg
= false;
9571 for (int i
= 0 ; i
< arg_pack_len
; ++i
)
9573 bool has_non_expansion_arg
= false;
9574 for (tree parm_pack
= parm_packs
;
9576 parm_pack
= TREE_CHAIN (parm_pack
))
9578 tree arg
= TREE_VALUE (parm_pack
);
9580 if (argument_pack_element_is_expansion_p (arg
, i
))
9581 has_expansion_arg
= true;
9583 has_non_expansion_arg
= true;
9586 if (has_expansion_arg
&& has_non_expansion_arg
)
9592 /* [temp.variadic]/6 says that:
9594 The instantiation of a pack expansion [...]
9595 produces a list E1,E2, ..., En, where N is the number of elements
9596 in the pack expansion parameters.
9598 This subroutine of tsubst_pack_expansion produces one of these Ei.
9600 PATTERN is the pattern of the pack expansion. PARM_PACKS is a
9601 TREE_LIST in which each TREE_PURPOSE is a parameter pack of
9602 PATTERN, and each TREE_VALUE is its corresponding argument pack.
9603 INDEX is the index 'i' of the element Ei to produce. ARGS,
9604 COMPLAIN, and IN_DECL are the same parameters as for the
9605 tsubst_pack_expansion function.
9607 The function returns the resulting Ei upon successful completion,
9610 Note that this function possibly modifies the ARGS parameter, so
9611 it's the responsibility of the caller to restore it. */
9614 gen_elem_of_pack_expansion_instantiation (tree pattern
,
9617 tree args
/* This parm gets
9619 tsubst_flags_t complain
,
9623 bool ith_elem_is_expansion
= false;
9625 /* For each parameter pack, change the substitution of the parameter
9626 pack to the ith argument in its argument pack, then expand the
9628 for (tree pack
= parm_packs
; pack
; pack
= TREE_CHAIN (pack
))
9630 tree parm
= TREE_PURPOSE (pack
);
9631 tree arg_pack
= TREE_VALUE (pack
);
9632 tree aps
; /* instance of ARGUMENT_PACK_SELECT. */
9634 ith_elem_is_expansion
|=
9635 argument_pack_element_is_expansion_p (arg_pack
, index
);
9637 /* Select the Ith argument from the pack. */
9638 if (TREE_CODE (parm
) == PARM_DECL
9639 || TREE_CODE (parm
) == FIELD_DECL
)
9643 aps
= make_argument_pack_select (arg_pack
, index
);
9645 register_local_specialization (aps
, parm
);
9648 aps
= retrieve_local_specialization (parm
);
9653 template_parm_level_and_index (parm
, &level
, &idx
);
9657 aps
= make_argument_pack_select (arg_pack
, index
);
9658 /* Update the corresponding argument. */
9659 TMPL_ARG (args
, level
, idx
) = aps
;
9662 /* Re-use the ARGUMENT_PACK_SELECT. */
9663 aps
= TMPL_ARG (args
, level
, idx
);
9665 ARGUMENT_PACK_SELECT_INDEX (aps
) = index
;
9668 /* Substitute into the PATTERN with the (possibly altered)
9670 if (pattern
== in_decl
)
9671 /* Expanding a fixed parameter pack from
9672 coerce_template_parameter_pack. */
9673 t
= tsubst_decl (pattern
, args
, complain
);
9674 else if (!TYPE_P (pattern
))
9675 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9676 /*integral_constant_expression_p=*/false);
9678 t
= tsubst (pattern
, args
, complain
, in_decl
);
9680 /* If the Ith argument pack element is a pack expansion, then
9681 the Ith element resulting from the substituting is going to
9682 be a pack expansion as well. */
9683 if (ith_elem_is_expansion
)
9684 t
= make_pack_expansion (t
);
9689 /* Substitute ARGS into T, which is an pack expansion
9690 (i.e. TYPE_PACK_EXPANSION or EXPR_PACK_EXPANSION). Returns a
9691 TREE_VEC with the substituted arguments, a PACK_EXPANSION_* node
9692 (if only a partial substitution could be performed) or
9693 ERROR_MARK_NODE if there was an error. */
9695 tsubst_pack_expansion (tree t
, tree args
, tsubst_flags_t complain
,
9699 tree pack
, packs
= NULL_TREE
;
9700 bool unsubstituted_packs
= false;
9703 struct pointer_map_t
*saved_local_specializations
= NULL
;
9704 bool need_local_specializations
= false;
9707 gcc_assert (PACK_EXPANSION_P (t
));
9708 pattern
= PACK_EXPANSION_PATTERN (t
);
9710 /* Add in any args remembered from an earlier partial instantiation. */
9711 args
= add_to_template_args (PACK_EXPANSION_EXTRA_ARGS (t
), args
);
9713 levels
= TMPL_ARGS_DEPTH (args
);
9715 /* Determine the argument packs that will instantiate the parameter
9716 packs used in the expansion expression. While we're at it,
9717 compute the number of arguments to be expanded and make sure it
9719 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (t
); pack
;
9720 pack
= TREE_CHAIN (pack
))
9722 tree parm_pack
= TREE_VALUE (pack
);
9723 tree arg_pack
= NULL_TREE
;
9724 tree orig_arg
= NULL_TREE
;
9727 if (TREE_CODE (parm_pack
) == BASES
)
9729 if (BASES_DIRECT (parm_pack
))
9730 return calculate_direct_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9731 args
, complain
, in_decl
, false));
9733 return calculate_bases (tsubst_expr (BASES_TYPE (parm_pack
),
9734 args
, complain
, in_decl
, false));
9736 if (TREE_CODE (parm_pack
) == PARM_DECL
)
9738 if (PACK_EXPANSION_LOCAL_P (t
))
9739 arg_pack
= retrieve_local_specialization (parm_pack
);
9742 /* We can't rely on local_specializations for a parameter
9743 name used later in a function declaration (such as in a
9744 late-specified return type). Even if it exists, it might
9745 have the wrong value for a recursive call. Just make a
9746 dummy decl, since it's only used for its type. */
9747 arg_pack
= tsubst_decl (parm_pack
, args
, complain
);
9748 if (arg_pack
&& DECL_PACK_P (arg_pack
))
9749 /* Partial instantiation of the parm_pack, we can't build
9750 up an argument pack yet. */
9751 arg_pack
= NULL_TREE
;
9753 arg_pack
= make_fnparm_pack (arg_pack
);
9754 need_local_specializations
= true;
9757 else if (TREE_CODE (parm_pack
) == FIELD_DECL
)
9758 arg_pack
= tsubst_copy (parm_pack
, args
, complain
, in_decl
);
9762 template_parm_level_and_index (parm_pack
, &level
, &idx
);
9764 if (level
<= levels
)
9765 arg_pack
= TMPL_ARG (args
, level
, idx
);
9768 orig_arg
= arg_pack
;
9769 if (arg_pack
&& TREE_CODE (arg_pack
) == ARGUMENT_PACK_SELECT
)
9770 arg_pack
= ARGUMENT_PACK_SELECT_FROM_PACK (arg_pack
);
9772 if (arg_pack
&& !ARGUMENT_PACK_P (arg_pack
))
9773 /* This can only happen if we forget to expand an argument
9774 pack somewhere else. Just return an error, silently. */
9776 result
= make_tree_vec (1);
9777 TREE_VEC_ELT (result
, 0) = error_mark_node
;
9784 TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg_pack
));
9786 /* Don't bother trying to do a partial substitution with
9787 incomplete packs; we'll try again after deduction. */
9788 if (ARGUMENT_PACK_INCOMPLETE_P (arg_pack
))
9793 else if (len
!= my_len
)
9795 if (!(complain
& tf_error
))
9796 /* Fail quietly. */;
9797 else if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
)
9798 error ("mismatched argument pack lengths while expanding "
9802 error ("mismatched argument pack lengths while expanding "
9805 return error_mark_node
;
9808 /* Keep track of the parameter packs and their corresponding
9810 packs
= tree_cons (parm_pack
, arg_pack
, packs
);
9811 TREE_TYPE (packs
) = orig_arg
;
9815 /* We can't substitute for this parameter pack. We use a flag as
9816 well as the missing_level counter because function parameter
9817 packs don't have a level. */
9818 unsubstituted_packs
= true;
9822 /* If the expansion is just T..., return the matching argument pack. */
9823 if (!unsubstituted_packs
9824 && TREE_PURPOSE (packs
) == pattern
)
9826 tree args
= ARGUMENT_PACK_ARGS (TREE_VALUE (packs
));
9827 if (TREE_CODE (t
) == TYPE_PACK_EXPANSION
9828 || pack_expansion_args_count (args
))
9830 /* Otherwise use the normal path so we get convert_from_reference. */
9833 /* We cannot expand this expansion expression, because we don't have
9834 all of the argument packs we need. */
9835 if (use_pack_expansion_extra_args_p (packs
, len
, unsubstituted_packs
))
9837 /* We got some full packs, but we can't substitute them in until we
9838 have values for all the packs. So remember these until then. */
9840 t
= make_pack_expansion (pattern
);
9841 PACK_EXPANSION_EXTRA_ARGS (t
) = args
;
9844 else if (unsubstituted_packs
)
9846 /* There were no real arguments, we're just replacing a parameter
9847 pack with another version of itself. Substitute into the
9848 pattern and return a PACK_EXPANSION_*. The caller will need to
9850 if (TREE_CODE (t
) == EXPR_PACK_EXPANSION
)
9851 t
= tsubst_expr (pattern
, args
, complain
, in_decl
,
9852 /*integral_constant_expression_p=*/false);
9854 t
= tsubst (pattern
, args
, complain
, in_decl
);
9855 t
= make_pack_expansion (t
);
9859 gcc_assert (len
>= 0);
9861 if (need_local_specializations
)
9863 /* We're in a late-specified return type, so create our own local
9864 specializations map; the current map is either NULL or (in the
9865 case of recursive unification) might have bindings that we don't
9866 want to use or alter. */
9867 saved_local_specializations
= local_specializations
;
9868 local_specializations
= pointer_map_create ();
9871 /* For each argument in each argument pack, substitute into the
9873 result
= make_tree_vec (len
);
9874 for (i
= 0; i
< len
; ++i
)
9876 t
= gen_elem_of_pack_expansion_instantiation (pattern
, packs
,
9880 TREE_VEC_ELT (result
, i
) = t
;
9881 if (t
== error_mark_node
)
9883 result
= error_mark_node
;
9888 /* Update ARGS to restore the substitution from parameter packs to
9889 their argument packs. */
9890 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
9892 tree parm
= TREE_PURPOSE (pack
);
9894 if (TREE_CODE (parm
) == PARM_DECL
9895 || TREE_CODE (parm
) == FIELD_DECL
)
9896 register_local_specialization (TREE_TYPE (pack
), parm
);
9901 if (TREE_VALUE (pack
) == NULL_TREE
)
9904 template_parm_level_and_index (parm
, &level
, &idx
);
9906 /* Update the corresponding argument. */
9907 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
9908 TREE_VEC_ELT (TREE_VEC_ELT (args
, level
-1 ), idx
) =
9911 TREE_VEC_ELT (args
, idx
) = TREE_TYPE (pack
);
9915 if (need_local_specializations
)
9917 pointer_map_destroy (local_specializations
);
9918 local_specializations
= saved_local_specializations
;
9924 /* Given PARM_DECL PARM, find the corresponding PARM_DECL in the template
9925 TMPL. We do this using DECL_PARM_INDEX, which should work even with
9926 parameter packs; all parms generated from a function parameter pack will
9927 have the same DECL_PARM_INDEX. */
9930 get_pattern_parm (tree parm
, tree tmpl
)
9932 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
9935 if (DECL_ARTIFICIAL (parm
))
9937 for (patparm
= DECL_ARGUMENTS (pattern
);
9938 patparm
; patparm
= DECL_CHAIN (patparm
))
9939 if (DECL_ARTIFICIAL (patparm
)
9940 && DECL_NAME (parm
) == DECL_NAME (patparm
))
9945 patparm
= FUNCTION_FIRST_USER_PARM (DECL_TEMPLATE_RESULT (tmpl
));
9946 patparm
= chain_index (DECL_PARM_INDEX (parm
)-1, patparm
);
9947 gcc_assert (DECL_PARM_INDEX (patparm
)
9948 == DECL_PARM_INDEX (parm
));
9954 /* Substitute ARGS into the vector or list of template arguments T. */
9957 tsubst_template_args (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
9960 int len
, need_new
= 0, i
, expanded_len_adjust
= 0, out
;
9963 if (t
== error_mark_node
)
9964 return error_mark_node
;
9966 len
= TREE_VEC_LENGTH (t
);
9967 elts
= XALLOCAVEC (tree
, len
);
9969 for (i
= 0; i
< len
; i
++)
9971 tree orig_arg
= TREE_VEC_ELT (t
, i
);
9974 if (TREE_CODE (orig_arg
) == TREE_VEC
)
9975 new_arg
= tsubst_template_args (orig_arg
, args
, complain
, in_decl
);
9976 else if (PACK_EXPANSION_P (orig_arg
))
9978 /* Substitute into an expansion expression. */
9979 new_arg
= tsubst_pack_expansion (orig_arg
, args
, complain
, in_decl
);
9981 if (TREE_CODE (new_arg
) == TREE_VEC
)
9982 /* Add to the expanded length adjustment the number of
9983 expanded arguments. We subtract one from this
9984 measurement, because the argument pack expression
9985 itself is already counted as 1 in
9986 LEN. EXPANDED_LEN_ADJUST can actually be negative, if
9987 the argument pack is empty. */
9988 expanded_len_adjust
+= TREE_VEC_LENGTH (new_arg
) - 1;
9990 else if (ARGUMENT_PACK_P (orig_arg
))
9992 /* Substitute into each of the arguments. */
9993 new_arg
= TYPE_P (orig_arg
)
9994 ? cxx_make_type (TREE_CODE (orig_arg
))
9995 : make_node (TREE_CODE (orig_arg
));
9997 SET_ARGUMENT_PACK_ARGS (
9999 tsubst_template_args (ARGUMENT_PACK_ARGS (orig_arg
),
10000 args
, complain
, in_decl
));
10002 if (ARGUMENT_PACK_ARGS (new_arg
) == error_mark_node
)
10003 new_arg
= error_mark_node
;
10005 if (TREE_CODE (new_arg
) == NONTYPE_ARGUMENT_PACK
) {
10006 TREE_TYPE (new_arg
) = tsubst (TREE_TYPE (orig_arg
), args
,
10007 complain
, in_decl
);
10008 TREE_CONSTANT (new_arg
) = TREE_CONSTANT (orig_arg
);
10010 if (TREE_TYPE (new_arg
) == error_mark_node
)
10011 new_arg
= error_mark_node
;
10015 new_arg
= tsubst_template_arg (orig_arg
, args
, complain
, in_decl
);
10017 if (new_arg
== error_mark_node
)
10018 return error_mark_node
;
10021 if (new_arg
!= orig_arg
)
10028 /* Make space for the expanded arguments coming from template
10030 t
= make_tree_vec (len
+ expanded_len_adjust
);
10031 /* ORIG_T can contain TREE_VECs. That happens if ORIG_T contains the
10032 arguments for a member template.
10033 In that case each TREE_VEC in ORIG_T represents a level of template
10034 arguments, and ORIG_T won't carry any non defaulted argument count.
10035 It will rather be the nested TREE_VECs that will carry one.
10036 In other words, ORIG_T carries a non defaulted argument count only
10037 if it doesn't contain any nested TREE_VEC. */
10038 if (NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
))
10040 int count
= GET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (orig_t
);
10041 count
+= expanded_len_adjust
;
10042 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (t
, count
);
10044 for (i
= 0, out
= 0; i
< len
; i
++)
10046 if ((PACK_EXPANSION_P (TREE_VEC_ELT (orig_t
, i
))
10047 || ARGUMENT_PACK_P (TREE_VEC_ELT (orig_t
, i
)))
10048 && TREE_CODE (elts
[i
]) == TREE_VEC
)
10052 /* Now expand the template argument pack "in place". */
10053 for (idx
= 0; idx
< TREE_VEC_LENGTH (elts
[i
]); idx
++, out
++)
10054 TREE_VEC_ELT (t
, out
) = TREE_VEC_ELT (elts
[i
], idx
);
10058 TREE_VEC_ELT (t
, out
) = elts
[i
];
10066 /* Return the result of substituting ARGS into the template parameters
10067 given by PARMS. If there are m levels of ARGS and m + n levels of
10068 PARMS, then the result will contain n levels of PARMS. For
10069 example, if PARMS is `template <class T> template <class U>
10070 template <T*, U, class V>' and ARGS is {{int}, {double}} then the
10071 result will be `template <int*, double, class V>'. */
10074 tsubst_template_parms (tree parms
, tree args
, tsubst_flags_t complain
)
10076 tree r
= NULL_TREE
;
10079 /* When substituting into a template, we must set
10080 PROCESSING_TEMPLATE_DECL as the template parameters may be
10081 dependent if they are based on one-another, and the dependency
10082 predicates are short-circuit outside of templates. */
10083 ++processing_template_decl
;
10085 for (new_parms
= &r
;
10086 parms
&& TMPL_PARMS_DEPTH (parms
) > TMPL_ARGS_DEPTH (args
);
10087 new_parms
= &(TREE_CHAIN (*new_parms
)),
10088 parms
= TREE_CHAIN (parms
))
10091 make_tree_vec (TREE_VEC_LENGTH (TREE_VALUE (parms
)));
10094 for (i
= 0; i
< TREE_VEC_LENGTH (new_vec
); ++i
)
10098 if (parms
== error_mark_node
)
10101 tuple
= TREE_VEC_ELT (TREE_VALUE (parms
), i
);
10103 if (tuple
== error_mark_node
)
10106 TREE_VEC_ELT (new_vec
, i
) =
10107 tsubst_template_parm (tuple
, args
, complain
);
10111 tree_cons (size_int (TMPL_PARMS_DEPTH (parms
)
10112 - TMPL_ARGS_DEPTH (args
)),
10113 new_vec
, NULL_TREE
);
10116 --processing_template_decl
;
10121 /* Return the result of substituting ARGS into one template parameter
10122 given by T. T Must be a TREE_LIST which TREE_VALUE is the template
10123 parameter and which TREE_PURPOSE is the default argument of the
10124 template parameter. */
10127 tsubst_template_parm (tree t
, tree args
, tsubst_flags_t complain
)
10129 tree default_value
, parm_decl
;
10131 if (args
== NULL_TREE
10133 || t
== error_mark_node
)
10136 gcc_assert (TREE_CODE (t
) == TREE_LIST
);
10138 default_value
= TREE_PURPOSE (t
);
10139 parm_decl
= TREE_VALUE (t
);
10141 parm_decl
= tsubst (parm_decl
, args
, complain
, NULL_TREE
);
10142 if (TREE_CODE (parm_decl
) == PARM_DECL
10143 && invalid_nontype_parm_type_p (TREE_TYPE (parm_decl
), complain
))
10144 parm_decl
= error_mark_node
;
10145 default_value
= tsubst_template_arg (default_value
, args
,
10146 complain
, NULL_TREE
);
10148 return build_tree_list (default_value
, parm_decl
);
10151 /* Substitute the ARGS into the indicated aggregate (or enumeration)
10152 type T. If T is not an aggregate or enumeration type, it is
10153 handled as if by tsubst. IN_DECL is as for tsubst. If
10154 ENTERING_SCOPE is nonzero, T is the context for a template which
10155 we are presently tsubst'ing. Return the substituted value. */
10158 tsubst_aggr_type (tree t
,
10160 tsubst_flags_t complain
,
10162 int entering_scope
)
10164 if (t
== NULL_TREE
)
10167 switch (TREE_CODE (t
))
10170 if (TYPE_PTRMEMFUNC_P (t
))
10171 return tsubst (TYPE_PTRMEMFUNC_FN_TYPE (t
), args
, complain
, in_decl
);
10173 /* Else fall through. */
10174 case ENUMERAL_TYPE
:
10176 if (TYPE_TEMPLATE_INFO (t
) && uses_template_parms (t
))
10181 int saved_unevaluated_operand
;
10182 int saved_inhibit_evaluation_warnings
;
10184 /* In "sizeof(X<I>)" we need to evaluate "I". */
10185 saved_unevaluated_operand
= cp_unevaluated_operand
;
10186 cp_unevaluated_operand
= 0;
10187 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
10188 c_inhibit_evaluation_warnings
= 0;
10190 /* First, determine the context for the type we are looking
10192 context
= TYPE_CONTEXT (t
);
10193 if (context
&& TYPE_P (context
))
10195 context
= tsubst_aggr_type (context
, args
, complain
,
10196 in_decl
, /*entering_scope=*/1);
10197 /* If context is a nested class inside a class template,
10198 it may still need to be instantiated (c++/33959). */
10199 context
= complete_type (context
);
10202 /* Then, figure out what arguments are appropriate for the
10203 type we are trying to find. For example, given:
10205 template <class T> struct S;
10206 template <class T, class U> void f(T, U) { S<U> su; }
10208 and supposing that we are instantiating f<int, double>,
10209 then our ARGS will be {int, double}, but, when looking up
10210 S we only want {double}. */
10211 argvec
= tsubst_template_args (TYPE_TI_ARGS (t
), args
,
10212 complain
, in_decl
);
10213 if (argvec
== error_mark_node
)
10214 r
= error_mark_node
;
10217 r
= lookup_template_class (t
, argvec
, in_decl
, context
,
10218 entering_scope
, complain
);
10219 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
10222 cp_unevaluated_operand
= saved_unevaluated_operand
;
10223 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
10228 /* This is not a template type, so there's nothing to do. */
10232 return tsubst (t
, args
, complain
, in_decl
);
10236 /* Substitute into the default argument ARG (a default argument for
10237 FN), which has the indicated TYPE. */
10240 tsubst_default_argument (tree fn
, tree type
, tree arg
, tsubst_flags_t complain
)
10242 tree saved_class_ptr
= NULL_TREE
;
10243 tree saved_class_ref
= NULL_TREE
;
10244 int errs
= errorcount
+ sorrycount
;
10246 /* This can happen in invalid code. */
10247 if (TREE_CODE (arg
) == DEFAULT_ARG
)
10250 /* This default argument came from a template. Instantiate the
10251 default argument here, not in tsubst. In the case of
10260 we must be careful to do name lookup in the scope of S<T>,
10261 rather than in the current class. */
10262 push_access_scope (fn
);
10263 /* The "this" pointer is not valid in a default argument. */
10266 saved_class_ptr
= current_class_ptr
;
10267 cp_function_chain
->x_current_class_ptr
= NULL_TREE
;
10268 saved_class_ref
= current_class_ref
;
10269 cp_function_chain
->x_current_class_ref
= NULL_TREE
;
10272 push_deferring_access_checks(dk_no_deferred
);
10273 /* The default argument expression may cause implicitly defined
10274 member functions to be synthesized, which will result in garbage
10275 collection. We must treat this situation as if we were within
10276 the body of function so as to avoid collecting live data on the
10279 arg
= tsubst_expr (arg
, DECL_TI_ARGS (fn
),
10280 complain
, NULL_TREE
,
10281 /*integral_constant_expression_p=*/false);
10283 pop_deferring_access_checks();
10285 /* Restore the "this" pointer. */
10288 cp_function_chain
->x_current_class_ptr
= saved_class_ptr
;
10289 cp_function_chain
->x_current_class_ref
= saved_class_ref
;
10292 if (errorcount
+sorrycount
> errs
10293 && (complain
& tf_warning_or_error
))
10294 inform (input_location
,
10295 " when instantiating default argument for call to %D", fn
);
10297 /* Make sure the default argument is reasonable. */
10298 arg
= check_default_argument (type
, arg
, complain
);
10300 pop_access_scope (fn
);
10305 /* Substitute into all the default arguments for FN. */
10308 tsubst_default_arguments (tree fn
, tsubst_flags_t complain
)
10313 tmpl_args
= DECL_TI_ARGS (fn
);
10315 /* If this function is not yet instantiated, we certainly don't need
10316 its default arguments. */
10317 if (uses_template_parms (tmpl_args
))
10319 /* Don't do this again for clones. */
10320 if (DECL_CLONED_FUNCTION_P (fn
))
10323 for (arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
10325 arg
= TREE_CHAIN (arg
))
10326 if (TREE_PURPOSE (arg
))
10327 TREE_PURPOSE (arg
) = tsubst_default_argument (fn
,
10329 TREE_PURPOSE (arg
),
10333 /* Substitute the ARGS into the T, which is a _DECL. Return the
10334 result of the substitution. Issue error and warning messages under
10335 control of COMPLAIN. */
10338 tsubst_decl (tree t
, tree args
, tsubst_flags_t complain
)
10340 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
10341 location_t saved_loc
;
10342 tree r
= NULL_TREE
;
10344 hashval_t hash
= 0;
10346 /* Set the filename and linenumber to improve error-reporting. */
10347 saved_loc
= input_location
;
10348 input_location
= DECL_SOURCE_LOCATION (t
);
10350 switch (TREE_CODE (t
))
10352 case TEMPLATE_DECL
:
10354 /* We can get here when processing a member function template,
10355 member class template, or template template parameter. */
10356 tree decl
= DECL_TEMPLATE_RESULT (t
);
10361 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
10363 /* Template template parameter is treated here. */
10364 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10365 if (new_type
== error_mark_node
)
10366 RETURN (error_mark_node
);
10367 /* If we get a real template back, return it. This can happen in
10368 the context of most_specialized_class. */
10369 if (TREE_CODE (new_type
) == TEMPLATE_DECL
)
10373 DECL_CHAIN (r
) = NULL_TREE
;
10374 TREE_TYPE (r
) = new_type
;
10375 DECL_TEMPLATE_RESULT (r
)
10376 = build_decl (DECL_SOURCE_LOCATION (decl
),
10377 TYPE_DECL
, DECL_NAME (decl
), new_type
);
10378 DECL_TEMPLATE_PARMS (r
)
10379 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10381 TYPE_NAME (new_type
) = r
;
10385 /* We might already have an instance of this template.
10386 The ARGS are for the surrounding class type, so the
10387 full args contain the tsubst'd args for the context,
10388 plus the innermost args from the template decl. */
10389 tmpl_args
= DECL_CLASS_TEMPLATE_P (t
)
10390 ? CLASSTYPE_TI_ARGS (TREE_TYPE (t
))
10391 : DECL_TI_ARGS (DECL_TEMPLATE_RESULT (t
));
10392 /* Because this is a template, the arguments will still be
10393 dependent, even after substitution. If
10394 PROCESSING_TEMPLATE_DECL is not set, the dependency
10395 predicates will short-circuit. */
10396 ++processing_template_decl
;
10397 full_args
= tsubst_template_args (tmpl_args
, args
,
10398 complain
, in_decl
);
10399 --processing_template_decl
;
10400 if (full_args
== error_mark_node
)
10401 RETURN (error_mark_node
);
10403 /* If this is a default template template argument,
10404 tsubst might not have changed anything. */
10405 if (full_args
== tmpl_args
)
10408 hash
= hash_tmpl_and_args (t
, full_args
);
10409 spec
= retrieve_specialization (t
, full_args
, hash
);
10410 if (spec
!= NULL_TREE
)
10416 /* Make a new template decl. It will be similar to the
10417 original, but will record the current template arguments.
10418 We also create a new function declaration, which is just
10419 like the old one, but points to this new template, rather
10420 than the old one. */
10422 gcc_assert (DECL_LANG_SPECIFIC (r
) != 0);
10423 DECL_CHAIN (r
) = NULL_TREE
;
10425 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10427 if (TREE_CODE (decl
) == TYPE_DECL
10428 && !TYPE_DECL_ALIAS_P (decl
))
10431 ++processing_template_decl
;
10432 new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10433 --processing_template_decl
;
10434 if (new_type
== error_mark_node
)
10435 RETURN (error_mark_node
);
10437 TREE_TYPE (r
) = new_type
;
10438 /* For a partial specialization, we need to keep pointing to
10439 the primary template. */
10440 if (!DECL_TEMPLATE_SPECIALIZATION (t
))
10441 CLASSTYPE_TI_TEMPLATE (new_type
) = r
;
10442 DECL_TEMPLATE_RESULT (r
) = TYPE_MAIN_DECL (new_type
);
10443 DECL_TI_ARGS (r
) = CLASSTYPE_TI_ARGS (new_type
);
10444 DECL_CONTEXT (r
) = TYPE_CONTEXT (new_type
);
10449 ++processing_template_decl
;
10450 new_decl
= tsubst (decl
, args
, complain
, in_decl
);
10451 --processing_template_decl
;
10452 if (new_decl
== error_mark_node
)
10453 RETURN (error_mark_node
);
10455 DECL_TEMPLATE_RESULT (r
) = new_decl
;
10456 DECL_TI_TEMPLATE (new_decl
) = r
;
10457 TREE_TYPE (r
) = TREE_TYPE (new_decl
);
10458 DECL_TI_ARGS (r
) = DECL_TI_ARGS (new_decl
);
10459 DECL_CONTEXT (r
) = DECL_CONTEXT (new_decl
);
10462 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10463 DECL_TEMPLATE_INSTANTIATIONS (r
) = NULL_TREE
;
10464 DECL_TEMPLATE_SPECIALIZATIONS (r
) = NULL_TREE
;
10466 /* The template parameters for this new template are all the
10467 template parameters for the old template, except the
10468 outermost level of parameters. */
10469 DECL_TEMPLATE_PARMS (r
)
10470 = tsubst_template_parms (DECL_TEMPLATE_PARMS (t
), args
,
10473 if (PRIMARY_TEMPLATE_P (t
))
10474 DECL_PRIMARY_TEMPLATE (r
) = r
;
10476 if (TREE_CODE (decl
) != TYPE_DECL
)
10477 /* Record this non-type partial instantiation. */
10478 register_specialization (r
, t
,
10479 DECL_TI_ARGS (DECL_TEMPLATE_RESULT (r
)),
10484 case FUNCTION_DECL
:
10487 tree argvec
= NULL_TREE
;
10495 /* Nobody should be tsubst'ing into non-template functions. */
10496 gcc_assert (DECL_TEMPLATE_INFO (t
) != NULL_TREE
);
10498 if (TREE_CODE (DECL_TI_TEMPLATE (t
)) == TEMPLATE_DECL
)
10503 /* If T is not dependent, just return it. We have to
10504 increment PROCESSING_TEMPLATE_DECL because
10505 value_dependent_expression_p assumes that nothing is
10506 dependent when PROCESSING_TEMPLATE_DECL is zero. */
10507 ++processing_template_decl
;
10508 dependent_p
= value_dependent_expression_p (t
);
10509 --processing_template_decl
;
10513 /* Calculate the most general template of which R is a
10514 specialization, and the complete set of arguments used to
10516 gen_tmpl
= most_general_template (DECL_TI_TEMPLATE (t
));
10517 argvec
= tsubst_template_args (DECL_TI_ARGS
10518 (DECL_TEMPLATE_RESULT
10519 (DECL_TI_TEMPLATE (t
))),
10520 args
, complain
, in_decl
);
10521 if (argvec
== error_mark_node
)
10522 RETURN (error_mark_node
);
10524 /* Check to see if we already have this specialization. */
10525 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
10526 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
10534 /* We can see more levels of arguments than parameters if
10535 there was a specialization of a member template, like
10538 template <class T> struct S { template <class U> void f(); }
10539 template <> template <class U> void S<int>::f(U);
10541 Here, we'll be substituting into the specialization,
10542 because that's where we can find the code we actually
10543 want to generate, but we'll have enough arguments for
10544 the most general template.
10546 We also deal with the peculiar case:
10548 template <class T> struct S {
10549 template <class U> friend void f();
10551 template <class U> void f() {}
10553 template void f<double>();
10555 Here, the ARGS for the instantiation of will be {int,
10556 double}. But, we only need as many ARGS as there are
10557 levels of template parameters in CODE_PATTERN. We are
10558 careful not to get fooled into reducing the ARGS in
10561 template <class T> struct S { template <class U> void f(U); }
10562 template <class T> template <> void S<T>::f(int) {}
10564 which we can spot because the pattern will be a
10565 specialization in this case. */
10566 args_depth
= TMPL_ARGS_DEPTH (args
);
10568 TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (DECL_TI_TEMPLATE (t
)));
10569 if (args_depth
> parms_depth
10570 && !DECL_TEMPLATE_SPECIALIZATION (t
))
10571 args
= get_innermost_template_args (args
, parms_depth
);
10575 /* This special case arises when we have something like this:
10577 template <class T> struct S {
10578 friend void f<int>(int, double);
10581 Here, the DECL_TI_TEMPLATE for the friend declaration
10582 will be an IDENTIFIER_NODE. We are being called from
10583 tsubst_friend_function, and we want only to create a
10584 new decl (R) with appropriate types so that we can call
10585 determine_specialization. */
10586 gen_tmpl
= NULL_TREE
;
10589 if (DECL_CLASS_SCOPE_P (t
))
10591 if (DECL_NAME (t
) == constructor_name (DECL_CONTEXT (t
)))
10595 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
,
10596 complain
, t
, /*entering_scope=*/1);
10601 ctx
= DECL_CONTEXT (t
);
10603 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10604 if (type
== error_mark_node
)
10605 RETURN (error_mark_node
);
10607 /* If we hit excessive deduction depth, the type is bogus even if
10608 it isn't error_mark_node, so don't build a decl. */
10609 if (excessive_deduction_depth
)
10610 RETURN (error_mark_node
);
10612 /* We do NOT check for matching decls pushed separately at this
10613 point, as they may not represent instantiations of this
10614 template, and in any case are considered separate under the
10617 DECL_USE_TEMPLATE (r
) = 0;
10618 TREE_TYPE (r
) = type
;
10619 /* Clear out the mangled name and RTL for the instantiation. */
10620 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
10621 SET_DECL_RTL (r
, NULL
);
10622 /* Leave DECL_INITIAL set on deleted instantiations. */
10623 if (!DECL_DELETED_FN (r
))
10624 DECL_INITIAL (r
) = NULL_TREE
;
10625 DECL_CONTEXT (r
) = ctx
;
10627 /* OpenMP UDRs have the only argument a reference to the declared
10628 type. We want to diagnose if the declared type is a reference,
10629 which is invalid, but as references to references are usually
10630 quietly merged, diagnose it here. */
10631 if (DECL_OMP_DECLARE_REDUCTION_P (t
))
10634 = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (t
))));
10635 argtype
= tsubst (argtype
, args
, complain
, in_decl
);
10636 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
10637 error_at (DECL_SOURCE_LOCATION (t
),
10638 "reference type %qT in "
10639 "%<#pragma omp declare reduction%>", argtype
);
10640 if (strchr (IDENTIFIER_POINTER (DECL_NAME (t
)), '~') == NULL
)
10641 DECL_NAME (r
) = omp_reduction_id (ERROR_MARK
, DECL_NAME (t
),
10645 if (member
&& DECL_CONV_FN_P (r
))
10646 /* Type-conversion operator. Reconstruct the name, in
10647 case it's the name of one of the template's parameters. */
10648 DECL_NAME (r
) = mangle_conv_op_name_for_type (TREE_TYPE (type
));
10650 DECL_ARGUMENTS (r
) = tsubst (DECL_ARGUMENTS (t
), args
,
10652 DECL_RESULT (r
) = NULL_TREE
;
10654 TREE_STATIC (r
) = 0;
10655 TREE_PUBLIC (r
) = TREE_PUBLIC (t
);
10656 DECL_EXTERNAL (r
) = 1;
10657 /* If this is an instantiation of a function with internal
10658 linkage, we already know what object file linkage will be
10659 assigned to the instantiation. */
10660 DECL_INTERFACE_KNOWN (r
) = !TREE_PUBLIC (r
);
10661 DECL_DEFER_OUTPUT (r
) = 0;
10662 DECL_CHAIN (r
) = NULL_TREE
;
10663 DECL_PENDING_INLINE_INFO (r
) = 0;
10664 DECL_PENDING_INLINE_P (r
) = 0;
10665 DECL_SAVED_TREE (r
) = NULL_TREE
;
10666 DECL_STRUCT_FUNCTION (r
) = NULL
;
10668 /* We'll re-clone as appropriate in instantiate_template. */
10669 DECL_CLONED_FUNCTION (r
) = NULL_TREE
;
10671 /* If we aren't complaining now, return on error before we register
10672 the specialization so that we'll complain eventually. */
10673 if ((complain
& tf_error
) == 0
10674 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10675 && !grok_op_properties (r
, /*complain=*/false))
10676 RETURN (error_mark_node
);
10678 /* Set up the DECL_TEMPLATE_INFO for R. There's no need to do
10679 this in the special friend case mentioned above where
10680 GEN_TMPL is NULL. */
10683 DECL_TEMPLATE_INFO (r
)
10684 = build_template_info (gen_tmpl
, argvec
);
10685 SET_DECL_IMPLICIT_INSTANTIATION (r
);
10688 = register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
10690 /* We instantiated this while substituting into
10691 the type earlier (template/friend54.C). */
10694 if (!DECL_FRIEND_P (r
))
10695 note_comdat_fn (r
);
10697 /* We're not supposed to instantiate default arguments
10698 until they are called, for a template. But, for a
10701 template <class T> void f ()
10702 { extern void g(int i = T()); }
10704 we should do the substitution when the template is
10705 instantiated. We handle the member function case in
10706 instantiate_class_template since the default arguments
10707 might refer to other members of the class. */
10709 && !PRIMARY_TEMPLATE_P (gen_tmpl
)
10710 && !uses_template_parms (argvec
))
10711 tsubst_default_arguments (r
, complain
);
10714 DECL_TEMPLATE_INFO (r
) = NULL_TREE
;
10716 /* Copy the list of befriending classes. */
10717 for (friends
= &DECL_BEFRIENDING_CLASSES (r
);
10719 friends
= &TREE_CHAIN (*friends
))
10721 *friends
= copy_node (*friends
);
10722 TREE_VALUE (*friends
) = tsubst (TREE_VALUE (*friends
),
10727 if (DECL_CONSTRUCTOR_P (r
) || DECL_DESTRUCTOR_P (r
))
10729 maybe_retrofit_in_chrg (r
);
10730 if (DECL_CONSTRUCTOR_P (r
))
10731 grok_ctor_properties (ctx
, r
);
10732 if (DECL_INHERITED_CTOR_BASE (r
))
10733 deduce_inheriting_ctor (r
);
10734 /* If this is an instantiation of a member template, clone it.
10735 If it isn't, that'll be handled by
10736 clone_constructors_and_destructors. */
10737 if (PRIMARY_TEMPLATE_P (gen_tmpl
))
10738 clone_function_decl (r
, /*update_method_vec_p=*/0);
10740 else if ((complain
& tf_error
) != 0
10741 && IDENTIFIER_OPNAME_P (DECL_NAME (r
))
10742 && !grok_op_properties (r
, /*complain=*/true))
10743 RETURN (error_mark_node
);
10745 if (DECL_FRIEND_P (t
) && DECL_FRIEND_CONTEXT (t
))
10746 SET_DECL_FRIEND_CONTEXT (r
,
10747 tsubst (DECL_FRIEND_CONTEXT (t
),
10748 args
, complain
, in_decl
));
10750 /* Possibly limit visibility based on template args. */
10751 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
10752 if (DECL_VISIBILITY_SPECIFIED (t
))
10754 DECL_VISIBILITY_SPECIFIED (r
) = 0;
10755 DECL_ATTRIBUTES (r
)
10756 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
10758 determine_visibility (r
);
10759 if (DECL_DEFAULTED_OUTSIDE_CLASS_P (r
)
10760 && !processing_template_decl
)
10761 defaulted_late_check (r
);
10763 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10764 args
, complain
, in_decl
);
10770 tree type
= NULL_TREE
;
10772 tree expanded_types
= NULL_TREE
;
10773 tree prev_r
= NULL_TREE
;
10774 tree first_r
= NULL_TREE
;
10776 if (DECL_PACK_P (t
))
10778 /* If there is a local specialization that isn't a
10779 parameter pack, it means that we're doing a "simple"
10780 substitution from inside tsubst_pack_expansion. Just
10781 return the local specialization (which will be a single
10783 tree spec
= retrieve_local_specialization (t
);
10785 && TREE_CODE (spec
) == PARM_DECL
10786 && TREE_CODE (TREE_TYPE (spec
)) != TYPE_PACK_EXPANSION
)
10789 /* Expand the TYPE_PACK_EXPANSION that provides the types for
10790 the parameters in this function parameter pack. */
10791 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10792 complain
, in_decl
);
10793 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10795 len
= TREE_VEC_LENGTH (expanded_types
);
10797 /* Zero-length parameter packs are boring. Just substitute
10800 RETURN (tsubst (TREE_CHAIN (t
), args
, complain
,
10805 /* All we did was update the type. Make a note of that. */
10806 type
= expanded_types
;
10807 expanded_types
= NULL_TREE
;
10811 /* Loop through all of the parameters we'll build. When T is
10812 a function parameter pack, LEN is the number of expanded
10813 types in EXPANDED_TYPES; otherwise, LEN is 1. */
10815 for (i
= 0; i
< len
; ++i
)
10819 if (DECL_TEMPLATE_PARM_P (t
))
10820 SET_DECL_TEMPLATE_PARM_P (r
);
10822 if (expanded_types
)
10823 /* We're on the Ith parameter of the function parameter
10826 /* Get the Ith type. */
10827 type
= TREE_VEC_ELT (expanded_types
, i
);
10829 /* Rename the parameter to include the index. */
10831 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10834 /* We're dealing with a normal parameter. */
10835 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10837 type
= type_decays_to (type
);
10838 TREE_TYPE (r
) = type
;
10839 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10841 if (DECL_INITIAL (r
))
10843 if (TREE_CODE (DECL_INITIAL (r
)) != TEMPLATE_PARM_INDEX
)
10844 DECL_INITIAL (r
) = TREE_TYPE (r
);
10846 DECL_INITIAL (r
) = tsubst (DECL_INITIAL (r
), args
,
10847 complain
, in_decl
);
10850 DECL_CONTEXT (r
) = NULL_TREE
;
10852 if (!DECL_TEMPLATE_PARM_P (r
))
10853 DECL_ARG_TYPE (r
) = type_passed_as (type
);
10855 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10856 args
, complain
, in_decl
);
10858 /* Keep track of the first new parameter we
10859 generate. That's what will be returned to the
10864 /* Build a proper chain of parameters when substituting
10865 into a function parameter pack. */
10867 DECL_CHAIN (prev_r
) = r
;
10870 /* If cp_unevaluated_operand is set, we're just looking for a
10871 single dummy parameter, so don't keep going. */
10872 if (DECL_CHAIN (t
) && !cp_unevaluated_operand
)
10873 DECL_CHAIN (r
) = tsubst (DECL_CHAIN (t
), args
,
10874 complain
, DECL_CHAIN (t
));
10876 /* FIRST_R contains the start of the chain we've built. */
10883 tree type
= NULL_TREE
;
10884 tree vec
= NULL_TREE
;
10885 tree expanded_types
= NULL_TREE
;
10888 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
10890 /* This field is a lambda capture pack. Return a TREE_VEC of
10891 the expanded fields to instantiate_class_template_1 and
10892 store them in the specializations hash table as a
10893 NONTYPE_ARGUMENT_PACK so that tsubst_copy can find them. */
10894 expanded_types
= tsubst_pack_expansion (TREE_TYPE (t
), args
,
10895 complain
, in_decl
);
10896 if (TREE_CODE (expanded_types
) == TREE_VEC
)
10898 len
= TREE_VEC_LENGTH (expanded_types
);
10899 vec
= make_tree_vec (len
);
10903 /* All we did was update the type. Make a note of that. */
10904 type
= expanded_types
;
10905 expanded_types
= NULL_TREE
;
10909 for (int i
= 0; i
< len
; ++i
)
10912 if (expanded_types
)
10914 type
= TREE_VEC_ELT (expanded_types
, i
);
10916 = make_ith_pack_parameter_name (DECL_NAME (r
), i
);
10919 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
10921 if (type
== error_mark_node
)
10922 RETURN (error_mark_node
);
10923 TREE_TYPE (r
) = type
;
10924 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
10926 if (DECL_C_BIT_FIELD (r
))
10927 /* For bit-fields, DECL_INITIAL gives the number of bits. For
10928 non-bit-fields DECL_INITIAL is a non-static data member
10929 initializer, which gets deferred instantiation. */
10931 = tsubst_expr (DECL_INITIAL (t
), args
,
10933 /*integral_constant_expression_p=*/true);
10934 else if (DECL_INITIAL (t
))
10936 /* Set up DECL_TEMPLATE_INFO so that we can get at the
10937 NSDMI in perform_member_init. Still set DECL_INITIAL
10938 so that we know there is one. */
10939 DECL_INITIAL (r
) = void_zero_node
;
10940 gcc_assert (DECL_LANG_SPECIFIC (r
) == NULL
);
10941 retrofit_lang_decl (r
);
10942 DECL_TEMPLATE_INFO (r
) = build_template_info (t
, args
);
10944 /* We don't have to set DECL_CONTEXT here; it is set by
10945 finish_member_declaration. */
10946 DECL_CHAIN (r
) = NULL_TREE
;
10948 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
), 0,
10949 args
, complain
, in_decl
);
10952 TREE_VEC_ELT (vec
, i
) = r
;
10958 tree pack
= make_node (NONTYPE_ARGUMENT_PACK
);
10959 tree tpack
= cxx_make_type (TYPE_ARGUMENT_PACK
);
10960 SET_ARGUMENT_PACK_ARGS (pack
, vec
);
10961 SET_ARGUMENT_PACK_ARGS (tpack
, expanded_types
);
10962 TREE_TYPE (pack
) = tpack
;
10963 register_specialization (pack
, t
, args
, false, 0);
10969 /* We reach here only for member using decls. We also need to check
10970 uses_template_parms because DECL_DEPENDENT_P is not set for a
10971 using-declaration that designates a member of the current
10972 instantiation (c++/53549). */
10973 if (DECL_DEPENDENT_P (t
)
10974 || uses_template_parms (USING_DECL_SCOPE (t
)))
10976 tree inst_scope
= tsubst_copy (USING_DECL_SCOPE (t
), args
,
10977 complain
, in_decl
);
10978 tree name
= tsubst_copy (DECL_NAME (t
), args
, complain
, in_decl
);
10979 r
= do_class_using_decl (inst_scope
, name
);
10981 r
= error_mark_node
;
10984 TREE_PROTECTED (r
) = TREE_PROTECTED (t
);
10985 TREE_PRIVATE (r
) = TREE_PRIVATE (t
);
10991 DECL_CHAIN (r
) = NULL_TREE
;
10998 tree argvec
= NULL_TREE
;
10999 tree gen_tmpl
= NULL_TREE
;
11001 tree tmpl
= NULL_TREE
;
11003 tree type
= NULL_TREE
;
11006 if (TREE_TYPE (t
) == error_mark_node
)
11007 RETURN (error_mark_node
);
11009 if (TREE_CODE (t
) == TYPE_DECL
11010 && t
== TYPE_MAIN_DECL (TREE_TYPE (t
)))
11012 /* If this is the canonical decl, we don't have to
11013 mess with instantiations, and often we can't (for
11014 typename, template type parms and such). Note that
11015 TYPE_NAME is not correct for the above test if
11016 we've copied the type for a typedef. */
11017 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11018 if (type
== error_mark_node
)
11019 RETURN (error_mark_node
);
11020 r
= TYPE_NAME (type
);
11024 /* Check to see if we already have the specialization we
11027 if (DECL_CLASS_SCOPE_P (t
) || DECL_NAMESPACE_SCOPE_P (t
))
11029 /* T is a static data member or namespace-scope entity.
11030 We have to substitute into namespace-scope variables
11031 (even though such entities are never templates) because
11034 template <class T> void f() { extern T t; }
11036 where the entity referenced is not known until
11037 instantiation time. */
11039 ctx
= DECL_CONTEXT (t
);
11040 if (DECL_CLASS_SCOPE_P (t
))
11042 ctx
= tsubst_aggr_type (ctx
, args
,
11044 in_decl
, /*entering_scope=*/1);
11045 /* If CTX is unchanged, then T is in fact the
11046 specialization we want. That situation occurs when
11047 referencing a static data member within in its own
11048 class. We can use pointer equality, rather than
11049 same_type_p, because DECL_CONTEXT is always
11051 if (ctx
== DECL_CONTEXT (t
)
11052 && (TREE_CODE (t
) != TYPE_DECL
11053 /* ... unless T is a member template; in which
11054 case our caller can be willing to create a
11055 specialization of that template represented
11057 || !(DECL_TI_TEMPLATE (t
)
11058 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (t
)))))
11064 tmpl
= DECL_TI_TEMPLATE (t
);
11065 gen_tmpl
= most_general_template (tmpl
);
11066 argvec
= tsubst (DECL_TI_ARGS (t
), args
, complain
, in_decl
);
11067 if (argvec
== error_mark_node
)
11068 RETURN (error_mark_node
);
11069 hash
= hash_tmpl_and_args (gen_tmpl
, argvec
);
11070 spec
= retrieve_specialization (gen_tmpl
, argvec
, hash
);
11075 /* A local variable. */
11077 /* Subsequent calls to pushdecl will fill this in. */
11079 spec
= retrieve_local_specialization (t
);
11081 /* If we already have the specialization we need, there is
11082 nothing more to do. */
11089 /* Create a new node for the specialization we need. */
11091 if (type
== NULL_TREE
)
11093 if (is_typedef_decl (t
))
11094 type
= DECL_ORIGINAL_TYPE (t
);
11096 type
= TREE_TYPE (t
);
11098 && VAR_HAD_UNKNOWN_BOUND (t
)
11099 && type
!= error_mark_node
)
11100 type
= strip_array_domain (type
);
11101 type
= tsubst (type
, args
, complain
, in_decl
);
11105 /* Even if the original location is out of scope, the
11106 newly substituted one is not. */
11107 DECL_DEAD_FOR_LOCAL (r
) = 0;
11108 DECL_INITIALIZED_P (r
) = 0;
11109 DECL_TEMPLATE_INSTANTIATED (r
) = 0;
11110 if (type
== error_mark_node
)
11111 RETURN (error_mark_node
);
11112 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11114 /* It may seem that this case cannot occur, since:
11119 declares a function, not a variable. However:
11122 template <typename T> void g() { T t; }
11123 template void g<f>();
11125 is an attempt to declare a variable with function
11127 error ("variable %qD has function type",
11128 /* R is not yet sufficiently initialized, so we
11129 just use its name. */
11131 RETURN (error_mark_node
);
11133 type
= complete_type (type
);
11134 /* Wait until cp_finish_decl to set this again, to handle
11135 circular dependency (template/instantiate6.C). */
11136 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (r
) = 0;
11137 type
= check_var_type (DECL_NAME (r
), type
);
11139 if (DECL_HAS_VALUE_EXPR_P (t
))
11141 tree ve
= DECL_VALUE_EXPR (t
);
11142 ve
= tsubst_expr (ve
, args
, complain
, in_decl
,
11143 /*constant_expression_p=*/false);
11144 if (REFERENCE_REF_P (ve
))
11146 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
11147 ve
= TREE_OPERAND (ve
, 0);
11149 SET_DECL_VALUE_EXPR (r
, ve
);
11152 else if (DECL_SELF_REFERENCE_P (t
))
11153 SET_DECL_SELF_REFERENCE_P (r
);
11154 TREE_TYPE (r
) = type
;
11155 cp_apply_type_quals_to_decl (cp_type_quals (type
), r
);
11156 DECL_CONTEXT (r
) = ctx
;
11157 /* Clear out the mangled name and RTL for the instantiation. */
11158 SET_DECL_ASSEMBLER_NAME (r
, NULL_TREE
);
11159 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11160 SET_DECL_RTL (r
, NULL
);
11161 /* The initializer must not be expanded until it is required;
11162 see [temp.inst]. */
11163 DECL_INITIAL (r
) = NULL_TREE
;
11164 if (CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_DECL_WRTL
))
11165 SET_DECL_RTL (r
, NULL
);
11166 DECL_SIZE (r
) = DECL_SIZE_UNIT (r
) = 0;
11169 /* Possibly limit visibility based on template args. */
11170 DECL_VISIBILITY (r
) = VISIBILITY_DEFAULT
;
11171 if (DECL_VISIBILITY_SPECIFIED (t
))
11173 DECL_VISIBILITY_SPECIFIED (r
) = 0;
11174 DECL_ATTRIBUTES (r
)
11175 = remove_attribute ("visibility", DECL_ATTRIBUTES (r
));
11177 determine_visibility (r
);
11182 /* A static data member declaration is always marked
11183 external when it is declared in-class, even if an
11184 initializer is present. We mimic the non-template
11185 processing here. */
11186 DECL_EXTERNAL (r
) = 1;
11188 register_specialization (r
, gen_tmpl
, argvec
, false, hash
);
11189 DECL_TEMPLATE_INFO (r
) = build_template_info (tmpl
, argvec
);
11190 SET_DECL_IMPLICIT_INSTANTIATION (r
);
11192 else if (!cp_unevaluated_operand
)
11193 register_local_specialization (r
, t
);
11195 DECL_CHAIN (r
) = NULL_TREE
;
11197 apply_late_template_attributes (&r
, DECL_ATTRIBUTES (r
),
11199 args
, complain
, in_decl
);
11201 /* Preserve a typedef that names a type. */
11202 if (is_typedef_decl (r
))
11204 DECL_ORIGINAL_TYPE (r
) = NULL_TREE
;
11205 set_underlying_type (r
);
11208 layout_decl (r
, 0);
11213 gcc_unreachable ();
11218 /* Restore the file and line information. */
11219 input_location
= saved_loc
;
11224 /* Substitute into the ARG_TYPES of a function type.
11225 If END is a TREE_CHAIN, leave it and any following types
11229 tsubst_arg_types (tree arg_types
,
11232 tsubst_flags_t complain
,
11235 tree remaining_arg_types
;
11236 tree type
= NULL_TREE
;
11238 tree expanded_args
= NULL_TREE
;
11241 if (!arg_types
|| arg_types
== void_list_node
|| arg_types
== end
)
11244 remaining_arg_types
= tsubst_arg_types (TREE_CHAIN (arg_types
),
11245 args
, end
, complain
, in_decl
);
11246 if (remaining_arg_types
== error_mark_node
)
11247 return error_mark_node
;
11249 if (PACK_EXPANSION_P (TREE_VALUE (arg_types
)))
11251 /* For a pack expansion, perform substitution on the
11252 entire expression. Later on, we'll handle the arguments
11254 expanded_args
= tsubst_pack_expansion (TREE_VALUE (arg_types
),
11255 args
, complain
, in_decl
);
11257 if (TREE_CODE (expanded_args
) == TREE_VEC
)
11258 /* So that we'll spin through the parameters, one by one. */
11259 i
= TREE_VEC_LENGTH (expanded_args
);
11262 /* We only partially substituted into the parameter
11263 pack. Our type is TYPE_PACK_EXPANSION. */
11264 type
= expanded_args
;
11265 expanded_args
= NULL_TREE
;
11273 type
= TREE_VEC_ELT (expanded_args
, i
);
11275 type
= tsubst (TREE_VALUE (arg_types
), args
, complain
, in_decl
);
11277 if (type
== error_mark_node
)
11278 return error_mark_node
;
11279 if (VOID_TYPE_P (type
))
11281 if (complain
& tf_error
)
11283 error ("invalid parameter type %qT", type
);
11285 error ("in declaration %q+D", in_decl
);
11287 return error_mark_node
;
11290 if (abstract_virtuals_error_sfinae (ACU_PARM
, type
, complain
))
11291 return error_mark_node
;
11293 /* Do array-to-pointer, function-to-pointer conversion, and ignore
11294 top-level qualifiers as required. */
11295 type
= cv_unqualified (type_decays_to (type
));
11297 /* We do not substitute into default arguments here. The standard
11298 mandates that they be instantiated only when needed, which is
11299 done in build_over_call. */
11300 default_arg
= TREE_PURPOSE (arg_types
);
11302 if (default_arg
&& TREE_CODE (default_arg
) == DEFAULT_ARG
)
11304 /* We've instantiated a template before its default arguments
11305 have been parsed. This can happen for a nested template
11306 class, and is not an error unless we require the default
11307 argument in a call of this function. */
11308 remaining_arg_types
=
11309 tree_cons (default_arg
, type
, remaining_arg_types
);
11310 vec_safe_push (DEFARG_INSTANTIATIONS(default_arg
), remaining_arg_types
);
11313 remaining_arg_types
=
11314 hash_tree_cons (default_arg
, type
, remaining_arg_types
);
11317 return remaining_arg_types
;
11320 /* Substitute into a FUNCTION_TYPE or METHOD_TYPE. This routine does
11321 *not* handle the exception-specification for FNTYPE, because the
11322 initial substitution of explicitly provided template parameters
11323 during argument deduction forbids substitution into the
11324 exception-specification:
11328 All references in the function type of the function template to the
11329 corresponding template parameters are replaced by the specified tem-
11330 plate argument values. If a substitution in a template parameter or
11331 in the function type of the function template results in an invalid
11332 type, type deduction fails. [Note: The equivalent substitution in
11333 exception specifications is done only when the function is instanti-
11334 ated, at which point a program is ill-formed if the substitution
11335 results in an invalid type.] */
11338 tsubst_function_type (tree t
,
11340 tsubst_flags_t complain
,
11347 /* The TYPE_CONTEXT is not used for function/method types. */
11348 gcc_assert (TYPE_CONTEXT (t
) == NULL_TREE
);
11350 /* Substitute the return type. */
11351 return_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
11352 if (return_type
== error_mark_node
)
11353 return error_mark_node
;
11354 /* DR 486 clarifies that creation of a function type with an
11355 invalid return type is a deduction failure. */
11356 if (TREE_CODE (return_type
) == ARRAY_TYPE
11357 || TREE_CODE (return_type
) == FUNCTION_TYPE
)
11359 if (complain
& tf_error
)
11361 if (TREE_CODE (return_type
) == ARRAY_TYPE
)
11362 error ("function returning an array");
11364 error ("function returning a function");
11366 return error_mark_node
;
11369 if (abstract_virtuals_error_sfinae (ACU_RETURN
, return_type
, complain
))
11370 return error_mark_node
;
11372 /* Substitute the argument types. */
11373 arg_types
= tsubst_arg_types (TYPE_ARG_TYPES (t
), args
, NULL_TREE
,
11374 complain
, in_decl
);
11375 if (arg_types
== error_mark_node
)
11376 return error_mark_node
;
11378 /* Construct a new type node and return it. */
11379 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11381 fntype
= build_function_type (return_type
, arg_types
);
11382 fntype
= apply_memfn_quals (fntype
,
11383 type_memfn_quals (t
),
11384 type_memfn_rqual (t
));
11388 tree r
= TREE_TYPE (TREE_VALUE (arg_types
));
11389 /* Don't pick up extra function qualifiers from the basetype. */
11390 r
= cp_build_qualified_type_real (r
, type_memfn_quals (t
), complain
);
11391 if (! MAYBE_CLASS_TYPE_P (r
))
11395 Type deduction may fail for any of the following
11398 -- Attempting to create "pointer to member of T" when T
11399 is not a class type. */
11400 if (complain
& tf_error
)
11401 error ("creating pointer to member function of non-class type %qT",
11403 return error_mark_node
;
11406 fntype
= build_method_type_directly (r
, return_type
,
11407 TREE_CHAIN (arg_types
));
11408 fntype
= build_ref_qualified_type (fntype
, type_memfn_rqual (t
));
11410 fntype
= cp_build_type_attribute_variant (fntype
, TYPE_ATTRIBUTES (t
));
11415 /* FNTYPE is a FUNCTION_TYPE or METHOD_TYPE. Substitute the template
11416 ARGS into that specification, and return the substituted
11417 specification. If there is no specification, return NULL_TREE. */
11420 tsubst_exception_specification (tree fntype
,
11422 tsubst_flags_t complain
,
11429 specs
= TYPE_RAISES_EXCEPTIONS (fntype
);
11430 new_specs
= NULL_TREE
;
11431 if (specs
&& TREE_PURPOSE (specs
))
11433 /* A noexcept-specifier. */
11434 tree expr
= TREE_PURPOSE (specs
);
11435 if (TREE_CODE (expr
) == INTEGER_CST
)
11439 /* Defer instantiation of noexcept-specifiers to avoid
11440 excessive instantiations (c++/49107). */
11441 new_specs
= make_node (DEFERRED_NOEXCEPT
);
11442 if (DEFERRED_NOEXCEPT_SPEC_P (specs
))
11444 /* We already partially instantiated this member template,
11445 so combine the new args with the old. */
11446 DEFERRED_NOEXCEPT_PATTERN (new_specs
)
11447 = DEFERRED_NOEXCEPT_PATTERN (expr
);
11448 DEFERRED_NOEXCEPT_ARGS (new_specs
)
11449 = add_to_template_args (DEFERRED_NOEXCEPT_ARGS (expr
), args
);
11453 DEFERRED_NOEXCEPT_PATTERN (new_specs
) = expr
;
11454 DEFERRED_NOEXCEPT_ARGS (new_specs
) = args
;
11458 new_specs
= tsubst_copy_and_build
11459 (expr
, args
, complain
, in_decl
, /*function_p=*/false,
11460 /*integral_constant_expression_p=*/true);
11461 new_specs
= build_noexcept_spec (new_specs
, complain
);
11465 if (! TREE_VALUE (specs
))
11472 tree expanded_specs
= NULL_TREE
;
11474 if (PACK_EXPANSION_P (TREE_VALUE (specs
)))
11476 /* Expand the pack expansion type. */
11477 expanded_specs
= tsubst_pack_expansion (TREE_VALUE (specs
),
11481 if (expanded_specs
== error_mark_node
)
11482 return error_mark_node
;
11483 else if (TREE_CODE (expanded_specs
) == TREE_VEC
)
11484 len
= TREE_VEC_LENGTH (expanded_specs
);
11487 /* We're substituting into a member template, so
11488 we got a TYPE_PACK_EXPANSION back. Add that
11489 expansion and move on. */
11490 gcc_assert (TREE_CODE (expanded_specs
)
11491 == TYPE_PACK_EXPANSION
);
11492 new_specs
= add_exception_specifier (new_specs
,
11495 specs
= TREE_CHAIN (specs
);
11500 for (i
= 0; i
< len
; ++i
)
11502 if (expanded_specs
)
11503 spec
= TREE_VEC_ELT (expanded_specs
, i
);
11505 spec
= tsubst (TREE_VALUE (specs
), args
, complain
, in_decl
);
11506 if (spec
== error_mark_node
)
11508 new_specs
= add_exception_specifier (new_specs
, spec
,
11512 specs
= TREE_CHAIN (specs
);
11518 /* Take the tree structure T and replace template parameters used
11519 therein with the argument vector ARGS. IN_DECL is an associated
11520 decl for diagnostics. If an error occurs, returns ERROR_MARK_NODE.
11521 Issue error and warning messages under control of COMPLAIN. Note
11522 that we must be relatively non-tolerant of extensions here, in
11523 order to preserve conformance; if we allow substitutions that
11524 should not be allowed, we may allow argument deductions that should
11525 not succeed, and therefore report ambiguous overload situations
11526 where there are none. In theory, we could allow the substitution,
11527 but indicate that it should have failed, and allow our caller to
11528 make sure that the right thing happens, but we don't try to do this
11531 This function is used for dealing with types, decls and the like;
11532 for expressions, use tsubst_expr or tsubst_copy. */
11535 tsubst (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
11537 enum tree_code code
;
11538 tree type
, r
= NULL_TREE
;
11540 if (t
== NULL_TREE
|| t
== error_mark_node
11541 || t
== integer_type_node
11542 || t
== void_type_node
11543 || t
== char_type_node
11544 || t
== unknown_type_node
11545 || TREE_CODE (t
) == NAMESPACE_DECL
11546 || TREE_CODE (t
) == TRANSLATION_UNIT_DECL
)
11550 return tsubst_decl (t
, args
, complain
);
11552 if (args
== NULL_TREE
)
11555 code
= TREE_CODE (t
);
11557 if (code
== IDENTIFIER_NODE
)
11558 type
= IDENTIFIER_TYPE_VALUE (t
);
11560 type
= TREE_TYPE (t
);
11562 gcc_assert (type
!= unknown_type_node
);
11564 /* Reuse typedefs. We need to do this to handle dependent attributes,
11565 such as attribute aligned. */
11567 && typedef_variant_p (t
))
11569 tree decl
= TYPE_NAME (t
);
11571 if (alias_template_specialization_p (t
))
11573 /* DECL represents an alias template and we want to
11575 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11576 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11577 r
= instantiate_alias_template (tmpl
, gen_args
, complain
);
11579 else if (DECL_CLASS_SCOPE_P (decl
)
11580 && CLASSTYPE_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11581 && uses_template_parms (DECL_CONTEXT (decl
)))
11583 tree tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
11584 tree gen_args
= tsubst (DECL_TI_ARGS (decl
), args
, complain
, in_decl
);
11585 r
= retrieve_specialization (tmpl
, gen_args
, 0);
11587 else if (DECL_FUNCTION_SCOPE_P (decl
)
11588 && DECL_TEMPLATE_INFO (DECL_CONTEXT (decl
))
11589 && uses_template_parms (DECL_TI_ARGS (DECL_CONTEXT (decl
))))
11590 r
= retrieve_local_specialization (decl
);
11592 /* The typedef is from a non-template context. */
11598 r
= cp_build_qualified_type_real
11599 (r
, cp_type_quals (t
) | cp_type_quals (r
),
11600 complain
| tf_ignore_bad_quals
);
11605 /* We don't have an instantiation yet, so drop the typedef. */
11606 int quals
= cp_type_quals (t
);
11607 t
= DECL_ORIGINAL_TYPE (decl
);
11608 t
= cp_build_qualified_type_real (t
, quals
,
11609 complain
| tf_ignore_bad_quals
);
11614 && code
!= TYPENAME_TYPE
11615 && code
!= TEMPLATE_TYPE_PARM
11616 && code
!= IDENTIFIER_NODE
11617 && code
!= FUNCTION_TYPE
11618 && code
!= METHOD_TYPE
)
11619 type
= tsubst (type
, args
, complain
, in_decl
);
11620 if (type
== error_mark_node
)
11621 return error_mark_node
;
11627 case ENUMERAL_TYPE
:
11628 return tsubst_aggr_type (t
, args
, complain
, in_decl
,
11629 /*entering_scope=*/0);
11632 case IDENTIFIER_NODE
:
11643 if (t
== integer_type_node
)
11646 if (TREE_CODE (TYPE_MIN_VALUE (t
)) == INTEGER_CST
11647 && TREE_CODE (TYPE_MAX_VALUE (t
)) == INTEGER_CST
)
11651 tree max
, omax
= TREE_OPERAND (TYPE_MAX_VALUE (t
), 0);
11653 max
= tsubst_expr (omax
, args
, complain
, in_decl
,
11654 /*integral_constant_expression_p=*/false);
11656 /* Fix up type of the magic NOP_EXPR with TREE_SIDE_EFFECTS if
11658 if (TREE_CODE (max
) == NOP_EXPR
11659 && TREE_SIDE_EFFECTS (omax
)
11660 && !TREE_TYPE (max
))
11661 TREE_TYPE (max
) = TREE_TYPE (TREE_OPERAND (max
, 0));
11663 /* If we're in a partial instantiation, preserve the magic NOP_EXPR
11664 with TREE_SIDE_EFFECTS that indicates this is not an integral
11665 constant expression. */
11666 if (processing_template_decl
11667 && TREE_SIDE_EFFECTS (omax
) && TREE_CODE (omax
) == NOP_EXPR
)
11669 gcc_assert (TREE_CODE (max
) == NOP_EXPR
);
11670 TREE_SIDE_EFFECTS (max
) = 1;
11673 return compute_array_index_type (NULL_TREE
, max
, complain
);
11676 case TEMPLATE_TYPE_PARM
:
11677 case TEMPLATE_TEMPLATE_PARM
:
11678 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11679 case TEMPLATE_PARM_INDEX
:
11684 tree arg
= NULL_TREE
;
11688 gcc_assert (TREE_VEC_LENGTH (args
) > 0);
11689 template_parm_level_and_index (t
, &level
, &idx
);
11691 levels
= TMPL_ARGS_DEPTH (args
);
11692 if (level
<= levels
)
11694 arg
= TMPL_ARG (args
, level
, idx
);
11696 if (arg
&& TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
11698 /* See through ARGUMENT_PACK_SELECT arguments. */
11699 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
11700 /* If the selected argument is an expansion E, that most
11701 likely means we were called from
11702 gen_elem_of_pack_expansion_instantiation during the
11703 substituting of pack an argument pack (which Ith
11704 element is a pack expansion, where I is
11705 ARGUMENT_PACK_SELECT_INDEX) into a pack expansion.
11706 In this case, the Ith element resulting from this
11707 substituting is going to be a pack expansion, which
11708 pattern is the pattern of E. Let's return the
11710 gen_elem_of_pack_expansion_instantiation will
11711 build the resulting pack expansion from it. */
11712 if (PACK_EXPANSION_P (arg
))
11713 arg
= PACK_EXPANSION_PATTERN (arg
);
11717 if (arg
== error_mark_node
)
11718 return error_mark_node
;
11719 else if (arg
!= NULL_TREE
)
11721 if (ARGUMENT_PACK_P (arg
))
11722 /* If ARG is an argument pack, we don't actually want to
11723 perform a substitution here, because substitutions
11724 for argument packs are only done
11725 element-by-element. We can get to this point when
11726 substituting the type of a non-type template
11727 parameter pack, when that type actually contains
11728 template parameter packs from an outer template, e.g.,
11730 template<typename... Types> struct A {
11731 template<Types... Values> struct B { };
11735 if (code
== TEMPLATE_TYPE_PARM
)
11738 gcc_assert (TYPE_P (arg
));
11740 quals
= cp_type_quals (arg
) | cp_type_quals (t
);
11742 return cp_build_qualified_type_real
11743 (arg
, quals
, complain
| tf_ignore_bad_quals
);
11745 else if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11747 /* We are processing a type constructed from a
11748 template template parameter. */
11749 tree argvec
= tsubst (TYPE_TI_ARGS (t
),
11750 args
, complain
, in_decl
);
11751 if (argvec
== error_mark_node
)
11752 return error_mark_node
;
11754 gcc_assert (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
11755 || TREE_CODE (arg
) == TEMPLATE_DECL
11756 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
);
11758 if (TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
11759 /* Consider this code:
11761 template <template <class> class Template>
11763 template <class Arg> using Bind = Template<Arg>;
11766 template <template <class> class Template, class Arg>
11767 using Instantiate = Template<Arg>; //#0
11769 template <template <class> class Template,
11772 Instantiate<Internal<Template>::template Bind,
11775 When #1 is parsed, the
11776 BOUND_TEMPLATE_TEMPLATE_PARM representing the
11777 parameter `Template' in #0 matches the
11778 UNBOUND_CLASS_TEMPLATE representing the argument
11779 `Internal<Template>::template Bind'; We then want
11780 to assemble the type `Bind<Argument>' that can't
11781 be fully created right now, because
11782 `Internal<Template>' not being complete, the Bind
11783 template cannot be looked up in that context. So
11784 we need to "store" `Bind<Argument>' for later
11785 when the context of Bind becomes complete. Let's
11786 store that in a TYPENAME_TYPE. */
11787 return make_typename_type (TYPE_CONTEXT (arg
),
11788 build_nt (TEMPLATE_ID_EXPR
,
11789 TYPE_IDENTIFIER (arg
),
11794 /* We can get a TEMPLATE_TEMPLATE_PARM here when we
11795 are resolving nested-types in the signature of a
11796 member function templates. Otherwise ARG is a
11797 TEMPLATE_DECL and is the real template to be
11799 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11800 arg
= TYPE_NAME (arg
);
11802 r
= lookup_template_class (arg
,
11804 DECL_CONTEXT (arg
),
11805 /*entering_scope=*/0,
11807 return cp_build_qualified_type_real
11808 (r
, cp_type_quals (t
) | cp_type_quals (r
), complain
);
11811 /* TEMPLATE_TEMPLATE_PARM or TEMPLATE_PARM_INDEX. */
11812 return convert_from_reference (unshare_expr (arg
));
11816 /* This can happen during the attempted tsubst'ing in
11817 unify. This means that we don't yet have any information
11818 about the template parameter in question. */
11821 /* Early in template argument deduction substitution, we don't
11822 want to reduce the level of 'auto', or it will be confused
11823 with a normal template parm in subsequent deduction. */
11824 if (is_auto (t
) && (complain
& tf_partial
))
11827 /* If we get here, we must have been looking at a parm for a
11828 more deeply nested template. Make a new version of this
11829 template parameter, but with a lower level. */
11832 case TEMPLATE_TYPE_PARM
:
11833 case TEMPLATE_TEMPLATE_PARM
:
11834 case BOUND_TEMPLATE_TEMPLATE_PARM
:
11835 if (cp_type_quals (t
))
11837 r
= tsubst (TYPE_MAIN_VARIANT (t
), args
, complain
, in_decl
);
11838 r
= cp_build_qualified_type_real
11839 (r
, cp_type_quals (t
),
11840 complain
| (code
== TEMPLATE_TYPE_PARM
11841 ? tf_ignore_bad_quals
: 0));
11846 TEMPLATE_TYPE_PARM_INDEX (r
)
11847 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (t
),
11848 r
, levels
, args
, complain
);
11849 TYPE_STUB_DECL (r
) = TYPE_NAME (r
) = TEMPLATE_TYPE_DECL (r
);
11850 TYPE_MAIN_VARIANT (r
) = r
;
11851 TYPE_POINTER_TO (r
) = NULL_TREE
;
11852 TYPE_REFERENCE_TO (r
) = NULL_TREE
;
11854 if (TREE_CODE (r
) == TEMPLATE_TEMPLATE_PARM
)
11855 /* We have reduced the level of the template
11856 template parameter, but not the levels of its
11857 template parameters, so canonical_type_parameter
11858 will not be able to find the canonical template
11859 template parameter for this level. Thus, we
11860 require structural equality checking to compare
11861 TEMPLATE_TEMPLATE_PARMs. */
11862 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11863 else if (TYPE_STRUCTURAL_EQUALITY_P (t
))
11864 SET_TYPE_STRUCTURAL_EQUALITY (r
);
11866 TYPE_CANONICAL (r
) = canonical_type_parameter (r
);
11868 if (code
== BOUND_TEMPLATE_TEMPLATE_PARM
)
11870 tree argvec
= tsubst (TYPE_TI_ARGS (t
), args
,
11871 complain
, in_decl
);
11872 if (argvec
== error_mark_node
)
11873 return error_mark_node
;
11875 TEMPLATE_TEMPLATE_PARM_TEMPLATE_INFO (r
)
11876 = build_template_info (TYPE_TI_TEMPLATE (t
), argvec
);
11881 case TEMPLATE_PARM_INDEX
:
11882 r
= reduce_template_parm_level (t
, type
, levels
, args
, complain
);
11886 gcc_unreachable ();
11894 tree purpose
, value
, chain
;
11896 if (t
== void_list_node
)
11899 purpose
= TREE_PURPOSE (t
);
11902 purpose
= tsubst (purpose
, args
, complain
, in_decl
);
11903 if (purpose
== error_mark_node
)
11904 return error_mark_node
;
11906 value
= TREE_VALUE (t
);
11909 value
= tsubst (value
, args
, complain
, in_decl
);
11910 if (value
== error_mark_node
)
11911 return error_mark_node
;
11913 chain
= TREE_CHAIN (t
);
11914 if (chain
&& chain
!= void_type_node
)
11916 chain
= tsubst (chain
, args
, complain
, in_decl
);
11917 if (chain
== error_mark_node
)
11918 return error_mark_node
;
11920 if (purpose
== TREE_PURPOSE (t
)
11921 && value
== TREE_VALUE (t
)
11922 && chain
== TREE_CHAIN (t
))
11924 return hash_tree_cons (purpose
, value
, chain
);
11928 /* We should never be tsubsting a binfo. */
11929 gcc_unreachable ();
11932 /* A vector of template arguments. */
11933 gcc_assert (!type
);
11934 return tsubst_template_args (t
, args
, complain
, in_decl
);
11937 case REFERENCE_TYPE
:
11939 if (type
== TREE_TYPE (t
) && TREE_CODE (type
) != METHOD_TYPE
)
11944 Type deduction may fail for any of the following
11947 -- Attempting to create a pointer to reference type.
11948 -- Attempting to create a reference to a reference type or
11949 a reference to void.
11951 Core issue 106 says that creating a reference to a reference
11952 during instantiation is no longer a cause for failure. We
11953 only enforce this check in strict C++98 mode. */
11954 if ((TREE_CODE (type
) == REFERENCE_TYPE
11955 && (((cxx_dialect
== cxx98
) && flag_iso
) || code
!= REFERENCE_TYPE
))
11956 || (code
== REFERENCE_TYPE
&& VOID_TYPE_P (type
)))
11958 static location_t last_loc
;
11960 /* We keep track of the last time we issued this error
11961 message to avoid spewing a ton of messages during a
11962 single bad template instantiation. */
11963 if (complain
& tf_error
11964 && last_loc
!= input_location
)
11966 if (VOID_TYPE_P (type
))
11967 error ("forming reference to void");
11968 else if (code
== POINTER_TYPE
)
11969 error ("forming pointer to reference type %qT", type
);
11971 error ("forming reference to reference type %qT", type
);
11972 last_loc
= input_location
;
11975 return error_mark_node
;
11977 else if (TREE_CODE (type
) == FUNCTION_TYPE
11978 && (type_memfn_quals (type
) != TYPE_UNQUALIFIED
11979 || type_memfn_rqual (type
) != REF_QUAL_NONE
))
11981 if (complain
& tf_error
)
11983 if (code
== POINTER_TYPE
)
11984 error ("forming pointer to qualified function type %qT",
11987 error ("forming reference to qualified function type %qT",
11990 return error_mark_node
;
11992 else if (code
== POINTER_TYPE
)
11994 r
= build_pointer_type (type
);
11995 if (TREE_CODE (type
) == METHOD_TYPE
)
11996 r
= build_ptrmemfunc_type (r
);
11998 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
11999 /* In C++0x, during template argument substitution, when there is an
12000 attempt to create a reference to a reference type, reference
12001 collapsing is applied as described in [14.3.1/4 temp.arg.type]:
12003 "If a template-argument for a template-parameter T names a type
12004 that is a reference to a type A, an attempt to create the type
12005 'lvalue reference to cv T' creates the type 'lvalue reference to
12006 A,' while an attempt to create the type type rvalue reference to
12007 cv T' creates the type T"
12009 r
= cp_build_reference_type
12011 TYPE_REF_IS_RVALUE (t
) && TYPE_REF_IS_RVALUE (type
));
12013 r
= cp_build_reference_type (type
, TYPE_REF_IS_RVALUE (t
));
12014 r
= cp_build_qualified_type_real (r
, cp_type_quals (t
), complain
);
12016 if (cxx_dialect
>= cxx1y
12017 && !(TREE_CODE (t
) == REFERENCE_TYPE
&& REFERENCE_VLA_OK (t
))
12018 && array_of_runtime_bound_p (type
)
12019 && (flag_iso
|| warn_vla
> 0))
12021 if (complain
& tf_warning_or_error
)
12023 (input_location
, OPT_Wvla
,
12024 code
== REFERENCE_TYPE
12025 ? G_("cannot declare reference to array of runtime bound")
12026 : G_("cannot declare pointer to array of runtime bound"));
12028 r
= error_mark_node
;
12031 if (r
!= error_mark_node
)
12032 /* Will this ever be needed for TYPE_..._TO values? */
12039 r
= tsubst (TYPE_OFFSET_BASETYPE (t
), args
, complain
, in_decl
);
12040 if (r
== error_mark_node
|| !MAYBE_CLASS_TYPE_P (r
))
12044 Type deduction may fail for any of the following
12047 -- Attempting to create "pointer to member of T" when T
12048 is not a class type. */
12049 if (complain
& tf_error
)
12050 error ("creating pointer to member of non-class type %qT", r
);
12051 return error_mark_node
;
12053 if (TREE_CODE (type
) == REFERENCE_TYPE
)
12055 if (complain
& tf_error
)
12056 error ("creating pointer to member reference type %qT", type
);
12057 return error_mark_node
;
12059 if (VOID_TYPE_P (type
))
12061 if (complain
& tf_error
)
12062 error ("creating pointer to member of type void");
12063 return error_mark_node
;
12065 gcc_assert (TREE_CODE (type
) != METHOD_TYPE
);
12066 if (TREE_CODE (type
) == FUNCTION_TYPE
)
12068 /* The type of the implicit object parameter gets its
12069 cv-qualifiers from the FUNCTION_TYPE. */
12072 = build_memfn_type (type
, r
, type_memfn_quals (type
),
12073 type_memfn_rqual (type
));
12074 memptr
= build_ptrmemfunc_type (build_pointer_type (method_type
));
12075 return cp_build_qualified_type_real (memptr
, cp_type_quals (t
),
12079 return cp_build_qualified_type_real (build_ptrmem_type (r
, type
),
12083 case FUNCTION_TYPE
:
12088 fntype
= tsubst_function_type (t
, args
, complain
, in_decl
);
12089 if (fntype
== error_mark_node
)
12090 return error_mark_node
;
12092 /* Substitute the exception specification. */
12093 specs
= tsubst_exception_specification (t
, args
, complain
,
12094 in_decl
, /*defer_ok*/true);
12095 if (specs
== error_mark_node
)
12096 return error_mark_node
;
12098 fntype
= build_exception_variant (fntype
, specs
);
12103 tree domain
= tsubst (TYPE_DOMAIN (t
), args
, complain
, in_decl
);
12104 if (domain
== error_mark_node
)
12105 return error_mark_node
;
12107 /* As an optimization, we avoid regenerating the array type if
12108 it will obviously be the same as T. */
12109 if (type
== TREE_TYPE (t
) && domain
== TYPE_DOMAIN (t
))
12112 /* These checks should match the ones in grokdeclarator.
12116 The deduction may fail for any of the following reasons:
12118 -- Attempting to create an array with an element type that
12119 is void, a function type, or a reference type, or [DR337]
12120 an abstract class type. */
12121 if (VOID_TYPE_P (type
)
12122 || TREE_CODE (type
) == FUNCTION_TYPE
12123 || TREE_CODE (type
) == REFERENCE_TYPE
)
12125 if (complain
& tf_error
)
12126 error ("creating array of %qT", type
);
12127 return error_mark_node
;
12130 if (abstract_virtuals_error_sfinae (ACU_ARRAY
, type
, complain
))
12131 return error_mark_node
;
12133 r
= build_cplus_array_type (type
, domain
);
12135 if (TYPE_USER_ALIGN (t
))
12137 TYPE_ALIGN (r
) = TYPE_ALIGN (t
);
12138 TYPE_USER_ALIGN (r
) = 1;
12144 case TYPENAME_TYPE
:
12146 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12147 in_decl
, /*entering_scope=*/1);
12148 tree f
= tsubst_copy (TYPENAME_TYPE_FULLNAME (t
), args
,
12149 complain
, in_decl
);
12151 if (ctx
== error_mark_node
|| f
== error_mark_node
)
12152 return error_mark_node
;
12154 if (!MAYBE_CLASS_TYPE_P (ctx
))
12156 if (complain
& tf_error
)
12157 error ("%qT is not a class, struct, or union type", ctx
);
12158 return error_mark_node
;
12160 else if (!uses_template_parms (ctx
) && !TYPE_BEING_DEFINED (ctx
))
12162 /* Normally, make_typename_type does not require that the CTX
12163 have complete type in order to allow things like:
12165 template <class T> struct S { typename S<T>::X Y; };
12167 But, such constructs have already been resolved by this
12168 point, so here CTX really should have complete type, unless
12169 it's a partial instantiation. */
12170 ctx
= complete_type (ctx
);
12171 if (!COMPLETE_TYPE_P (ctx
))
12173 if (complain
& tf_error
)
12174 cxx_incomplete_type_error (NULL_TREE
, ctx
);
12175 return error_mark_node
;
12179 f
= make_typename_type (ctx
, f
, typename_type
,
12180 complain
| tf_keep_type_decl
);
12181 if (f
== error_mark_node
)
12183 if (TREE_CODE (f
) == TYPE_DECL
)
12185 complain
|= tf_ignore_bad_quals
;
12189 if (TREE_CODE (f
) != TYPENAME_TYPE
)
12191 if (TYPENAME_IS_ENUM_P (t
) && TREE_CODE (f
) != ENUMERAL_TYPE
)
12193 if (complain
& tf_error
)
12194 error ("%qT resolves to %qT, which is not an enumeration type",
12197 return error_mark_node
;
12199 else if (TYPENAME_IS_CLASS_P (t
) && !CLASS_TYPE_P (f
))
12201 if (complain
& tf_error
)
12202 error ("%qT resolves to %qT, which is is not a class type",
12205 return error_mark_node
;
12209 return cp_build_qualified_type_real
12210 (f
, cp_type_quals (f
) | cp_type_quals (t
), complain
);
12213 case UNBOUND_CLASS_TEMPLATE
:
12215 tree ctx
= tsubst_aggr_type (TYPE_CONTEXT (t
), args
, complain
,
12216 in_decl
, /*entering_scope=*/1);
12217 tree name
= TYPE_IDENTIFIER (t
);
12218 tree parm_list
= DECL_TEMPLATE_PARMS (TYPE_NAME (t
));
12220 if (ctx
== error_mark_node
|| name
== error_mark_node
)
12221 return error_mark_node
;
12224 parm_list
= tsubst_template_parms (parm_list
, args
, complain
);
12225 return make_unbound_class_template (ctx
, name
, parm_list
, complain
);
12232 ++cp_unevaluated_operand
;
12233 ++c_inhibit_evaluation_warnings
;
12235 type
= tsubst_expr (TYPEOF_TYPE_EXPR (t
), args
,
12237 /*integral_constant_expression_p=*/false);
12239 --cp_unevaluated_operand
;
12240 --c_inhibit_evaluation_warnings
;
12242 type
= finish_typeof (type
);
12243 return cp_build_qualified_type_real (type
,
12245 | cp_type_quals (type
),
12249 case DECLTYPE_TYPE
:
12253 ++cp_unevaluated_operand
;
12254 ++c_inhibit_evaluation_warnings
;
12256 type
= tsubst_copy_and_build (DECLTYPE_TYPE_EXPR (t
), args
,
12257 complain
|tf_decltype
, in_decl
,
12258 /*function_p*/false,
12259 /*integral_constant_expression*/false);
12261 --cp_unevaluated_operand
;
12262 --c_inhibit_evaluation_warnings
;
12264 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t
))
12265 type
= lambda_capture_field_type (type
,
12266 DECLTYPE_FOR_INIT_CAPTURE (t
));
12267 else if (DECLTYPE_FOR_LAMBDA_PROXY (t
))
12268 type
= lambda_proxy_type (type
);
12271 bool id
= DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t
);
12272 if (id
&& TREE_CODE (DECLTYPE_TYPE_EXPR (t
)) == BIT_NOT_EXPR
12274 /* In a template ~id could be either a complement expression
12275 or an unqualified-id naming a destructor; if instantiating
12276 it produces an expression, it's not an id-expression or
12279 type
= finish_decltype_type (type
, id
, complain
);
12281 return cp_build_qualified_type_real (type
,
12283 | cp_type_quals (type
),
12287 case UNDERLYING_TYPE
:
12289 tree type
= tsubst (UNDERLYING_TYPE_TYPE (t
), args
,
12290 complain
, in_decl
);
12291 return finish_underlying_type (type
);
12294 case TYPE_ARGUMENT_PACK
:
12295 case NONTYPE_ARGUMENT_PACK
:
12297 tree r
= TYPE_P (t
) ? cxx_make_type (code
) : make_node (code
);
12299 tsubst_template_args (ARGUMENT_PACK_ARGS (t
),
12303 SET_ARGUMENT_PACK_ARGS (r
, packed_out
);
12305 /* For template nontype argument packs, also substitute into
12307 if (code
== NONTYPE_ARGUMENT_PACK
)
12308 TREE_TYPE (r
) = tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
12326 /* We should use one of the expression tsubsts for these codes. */
12327 gcc_unreachable ();
12330 sorry ("use of %qs in template", get_tree_code_name (code
));
12331 return error_mark_node
;
12335 /* Like tsubst_expr for a BASELINK. OBJECT_TYPE, if non-NULL, is the
12336 type of the expression on the left-hand side of the "." or "->"
12340 tsubst_baselink (tree baselink
, tree object_type
,
12341 tree args
, tsubst_flags_t complain
, tree in_decl
)
12344 tree qualifying_scope
;
12347 tree template_args
= 0;
12348 bool template_id_p
= false;
12349 bool qualified
= BASELINK_QUALIFIED_P (baselink
);
12351 /* A baselink indicates a function from a base class. Both the
12352 BASELINK_ACCESS_BINFO and the base class referenced may
12353 indicate bases of the template class, rather than the
12354 instantiated class. In addition, lookups that were not
12355 ambiguous before may be ambiguous now. Therefore, we perform
12356 the lookup again. */
12357 qualifying_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (baselink
));
12358 qualifying_scope
= tsubst (qualifying_scope
, args
,
12359 complain
, in_decl
);
12360 fns
= BASELINK_FUNCTIONS (baselink
);
12361 optype
= tsubst (BASELINK_OPTYPE (baselink
), args
, complain
, in_decl
);
12362 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
12364 template_id_p
= true;
12365 template_args
= TREE_OPERAND (fns
, 1);
12366 fns
= TREE_OPERAND (fns
, 0);
12368 template_args
= tsubst_template_args (template_args
, args
,
12369 complain
, in_decl
);
12371 name
= DECL_NAME (get_first_fn (fns
));
12372 if (IDENTIFIER_TYPENAME_P (name
))
12373 name
= mangle_conv_op_name_for_type (optype
);
12374 baselink
= lookup_fnfields (qualifying_scope
, name
, /*protect=*/1);
12376 return error_mark_node
;
12378 /* If lookup found a single function, mark it as used at this
12379 point. (If it lookup found multiple functions the one selected
12380 later by overload resolution will be marked as used at that
12382 if (BASELINK_P (baselink
))
12383 fns
= BASELINK_FUNCTIONS (baselink
);
12384 if (!template_id_p
&& !really_overloaded_fn (fns
))
12385 mark_used (OVL_CURRENT (fns
));
12387 /* Add back the template arguments, if present. */
12388 if (BASELINK_P (baselink
) && template_id_p
)
12389 BASELINK_FUNCTIONS (baselink
)
12390 = build_nt (TEMPLATE_ID_EXPR
,
12391 BASELINK_FUNCTIONS (baselink
),
12393 /* Update the conversion operator type. */
12394 BASELINK_OPTYPE (baselink
) = optype
;
12397 object_type
= current_class_type
;
12400 baselink
= adjust_result_of_qualified_name_lookup (baselink
,
12406 /* Like tsubst_expr for a SCOPE_REF, given by QUALIFIED_ID. DONE is
12407 true if the qualified-id will be a postfix-expression in-and-of
12408 itself; false if more of the postfix-expression follows the
12409 QUALIFIED_ID. ADDRESS_P is true if the qualified-id is the operand
12413 tsubst_qualified_id (tree qualified_id
, tree args
,
12414 tsubst_flags_t complain
, tree in_decl
,
12415 bool done
, bool address_p
)
12421 tree template_args
;
12422 location_t loc
= UNKNOWN_LOCATION
;
12424 gcc_assert (TREE_CODE (qualified_id
) == SCOPE_REF
);
12426 /* Figure out what name to look up. */
12427 name
= TREE_OPERAND (qualified_id
, 1);
12428 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
12430 is_template
= true;
12431 loc
= EXPR_LOCATION (name
);
12432 template_args
= TREE_OPERAND (name
, 1);
12434 template_args
= tsubst_template_args (template_args
, args
,
12435 complain
, in_decl
);
12436 name
= TREE_OPERAND (name
, 0);
12440 is_template
= false;
12441 template_args
= NULL_TREE
;
12444 /* Substitute into the qualifying scope. When there are no ARGS, we
12445 are just trying to simplify a non-dependent expression. In that
12446 case the qualifying scope may be dependent, and, in any case,
12447 substituting will not help. */
12448 scope
= TREE_OPERAND (qualified_id
, 0);
12451 scope
= tsubst (scope
, args
, complain
, in_decl
);
12452 expr
= tsubst_copy (name
, args
, complain
, in_decl
);
12457 if (dependent_scope_p (scope
))
12460 expr
= build_min_nt_loc (loc
, TEMPLATE_ID_EXPR
, expr
, template_args
);
12461 return build_qualified_name (NULL_TREE
, scope
, expr
,
12462 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
));
12465 if (!BASELINK_P (name
) && !DECL_P (expr
))
12467 if (TREE_CODE (expr
) == BIT_NOT_EXPR
)
12469 /* A BIT_NOT_EXPR is used to represent a destructor. */
12470 if (!check_dtor_name (scope
, TREE_OPERAND (expr
, 0)))
12472 error ("qualifying type %qT does not match destructor name ~%qT",
12473 scope
, TREE_OPERAND (expr
, 0));
12474 expr
= error_mark_node
;
12477 expr
= lookup_qualified_name (scope
, complete_dtor_identifier
,
12478 /*is_type_p=*/0, false);
12481 expr
= lookup_qualified_name (scope
, expr
, /*is_type_p=*/0, false);
12482 if (TREE_CODE (TREE_CODE (expr
) == TEMPLATE_DECL
12483 ? DECL_TEMPLATE_RESULT (expr
) : expr
) == TYPE_DECL
)
12485 if (complain
& tf_error
)
12487 error ("dependent-name %qE is parsed as a non-type, but "
12488 "instantiation yields a type", qualified_id
);
12489 inform (input_location
, "say %<typename %E%> if a type is meant", qualified_id
);
12491 return error_mark_node
;
12497 check_accessibility_of_qualified_id (expr
, /*object_type=*/NULL_TREE
,
12499 /* Remember that there was a reference to this entity. */
12503 if (expr
== error_mark_node
|| TREE_CODE (expr
) == TREE_LIST
)
12505 if (complain
& tf_error
)
12506 qualified_name_lookup_error (scope
,
12507 TREE_OPERAND (qualified_id
, 1),
12508 expr
, input_location
);
12509 return error_mark_node
;
12513 expr
= lookup_template_function (expr
, template_args
);
12515 if (expr
== error_mark_node
&& complain
& tf_error
)
12516 qualified_name_lookup_error (scope
, TREE_OPERAND (qualified_id
, 1),
12517 expr
, input_location
);
12518 else if (TYPE_P (scope
))
12520 expr
= (adjust_result_of_qualified_name_lookup
12521 (expr
, scope
, current_nonlambda_class_type ()));
12522 expr
= (finish_qualified_id_expr
12523 (scope
, expr
, done
, address_p
&& PTRMEM_OK_P (qualified_id
),
12524 QUALIFIED_NAME_IS_TEMPLATE (qualified_id
),
12525 /*template_arg_p=*/false, complain
));
12528 /* Expressions do not generally have reference type. */
12529 if (TREE_CODE (expr
) != SCOPE_REF
12530 /* However, if we're about to form a pointer-to-member, we just
12531 want the referenced member referenced. */
12532 && TREE_CODE (expr
) != OFFSET_REF
)
12533 expr
= convert_from_reference (expr
);
12538 /* Like tsubst, but deals with expressions. This function just replaces
12539 template parms; to finish processing the resultant expression, use
12540 tsubst_copy_and_build or tsubst_expr. */
12543 tsubst_copy (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
12545 enum tree_code code
;
12548 if (t
== NULL_TREE
|| t
== error_mark_node
|| args
== NULL_TREE
)
12551 code
= TREE_CODE (t
);
12556 r
= retrieve_local_specialization (t
);
12558 if (r
== NULL_TREE
)
12560 /* We get here for a use of 'this' in an NSDMI. */
12561 if (DECL_NAME (t
) == this_identifier
12562 && at_function_scope_p ()
12563 && DECL_CONSTRUCTOR_P (current_function_decl
))
12564 return current_class_ptr
;
12566 /* This can happen for a parameter name used later in a function
12567 declaration (such as in a late-specified return type). Just
12568 make a dummy decl, since it's only used for its type. */
12569 gcc_assert (cp_unevaluated_operand
!= 0);
12570 r
= tsubst_decl (t
, args
, complain
);
12571 /* Give it the template pattern as its context; its true context
12572 hasn't been instantiated yet and this is good enough for
12574 DECL_CONTEXT (r
) = DECL_CONTEXT (t
);
12577 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12578 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12587 if (DECL_TEMPLATE_PARM_P (t
))
12588 return tsubst_copy (DECL_INITIAL (t
), args
, complain
, in_decl
);
12589 /* There is no need to substitute into namespace-scope
12591 if (DECL_NAMESPACE_SCOPE_P (t
))
12593 /* If ARGS is NULL, then T is known to be non-dependent. */
12594 if (args
== NULL_TREE
)
12595 return integral_constant_value (t
);
12597 /* Unfortunately, we cannot just call lookup_name here.
12600 template <int I> int f() {
12602 struct S { void g() { E e = a; } };
12605 When we instantiate f<7>::S::g(), say, lookup_name is not
12606 clever enough to find f<7>::a. */
12608 = tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12609 /*entering_scope=*/0);
12611 for (v
= TYPE_VALUES (enum_type
);
12613 v
= TREE_CHAIN (v
))
12614 if (TREE_PURPOSE (v
) == DECL_NAME (t
))
12615 return TREE_VALUE (v
);
12617 /* We didn't find the name. That should never happen; if
12618 name-lookup found it during preliminary parsing, we
12619 should find it again here during instantiation. */
12620 gcc_unreachable ();
12625 if (PACK_EXPANSION_P (TREE_TYPE (t
)))
12627 /* Check for a local specialization set up by
12628 tsubst_pack_expansion. */
12629 if (tree r
= retrieve_local_specialization (t
))
12631 if (TREE_CODE (r
) == ARGUMENT_PACK_SELECT
)
12632 r
= ARGUMENT_PACK_SELECT_ARG (r
);
12636 /* When retrieving a capture pack from a generic lambda, remove the
12637 lambda call op's own template argument list from ARGS. Only the
12638 template arguments active for the closure type should be used to
12639 retrieve the pack specialization. */
12640 if (LAMBDA_FUNCTION_P (current_function_decl
)
12641 && (template_class_depth (DECL_CONTEXT (t
))
12642 != TMPL_ARGS_DEPTH (args
)))
12643 args
= strip_innermost_template_args (args
, 1);
12645 /* Otherwise return the full NONTYPE_ARGUMENT_PACK that
12646 tsubst_decl put in the hash table. */
12647 return retrieve_specialization (t
, args
, 0);
12650 if (DECL_CONTEXT (t
))
12654 ctx
= tsubst_aggr_type (DECL_CONTEXT (t
), args
, complain
, in_decl
,
12655 /*entering_scope=*/1);
12656 if (ctx
!= DECL_CONTEXT (t
))
12658 tree r
= lookup_field (ctx
, DECL_NAME (t
), 0, false);
12661 if (complain
& tf_error
)
12662 error ("using invalid field %qD", t
);
12663 return error_mark_node
;
12672 case FUNCTION_DECL
:
12673 if (DECL_LANG_SPECIFIC (t
) && DECL_TEMPLATE_INFO (t
))
12674 r
= tsubst (t
, args
, complain
, in_decl
);
12675 else if (local_variable_p (t
))
12677 r
= retrieve_local_specialization (t
);
12678 if (r
== NULL_TREE
)
12680 if (DECL_ANON_UNION_VAR_P (t
))
12682 /* Just use name lookup to find a member alias for an
12683 anonymous union, but then add it to the hash table. */
12684 r
= lookup_name (DECL_NAME (t
));
12685 gcc_assert (DECL_ANON_UNION_VAR_P (r
));
12686 register_local_specialization (r
, t
);
12690 /* This can happen for a variable used in a
12691 late-specified return type of a local lambda, or for a
12692 local static or constant. Building a new VAR_DECL
12693 should be OK in all those cases. */
12694 r
= tsubst_decl (t
, args
, complain
);
12695 if (decl_constant_var_p (r
))
12696 /* A use of a local constant must decay to its value. */
12697 return integral_constant_value (r
);
12698 gcc_assert (cp_unevaluated_operand
|| TREE_STATIC (r
)
12699 || errorcount
|| sorrycount
);
12709 case NAMESPACE_DECL
:
12713 /* An OVERLOAD will always be a non-dependent overload set; an
12714 overload set from function scope will just be represented with an
12715 IDENTIFIER_NODE, and from class scope with a BASELINK. */
12716 gcc_assert (!uses_template_parms (t
));
12720 return tsubst_baselink (t
, current_nonlambda_class_type (),
12721 args
, complain
, in_decl
);
12723 case TEMPLATE_DECL
:
12724 if (DECL_TEMPLATE_TEMPLATE_PARM_P (t
))
12725 return tsubst (TREE_TYPE (DECL_TEMPLATE_RESULT (t
)),
12726 args
, complain
, in_decl
);
12727 else if (DECL_FUNCTION_TEMPLATE_P (t
) && DECL_MEMBER_TEMPLATE_P (t
))
12728 return tsubst (t
, args
, complain
, in_decl
);
12729 else if (DECL_CLASS_SCOPE_P (t
)
12730 && uses_template_parms (DECL_CONTEXT (t
)))
12732 /* Template template argument like the following example need
12735 template <template <class> class TT> struct C {};
12736 template <class T> struct D {
12737 template <class U> struct E {};
12742 We are processing the template argument `E' in #1 for
12743 the template instantiation #2. Originally, `E' is a
12744 TEMPLATE_DECL with `D<T>' as its DECL_CONTEXT. Now we
12745 have to substitute this with one having context `D<int>'. */
12747 tree context
= tsubst (DECL_CONTEXT (t
), args
, complain
, in_decl
);
12748 return lookup_field (context
, DECL_NAME(t
), 0, false);
12751 /* Ordinary template template argument. */
12755 case REINTERPRET_CAST_EXPR
:
12756 case CONST_CAST_EXPR
:
12757 case STATIC_CAST_EXPR
:
12758 case DYNAMIC_CAST_EXPR
:
12759 case IMPLICIT_CONV_EXPR
:
12763 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12764 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12767 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
12770 tree expanded
, op
= TREE_OPERAND (t
, 0);
12773 if (SIZEOF_EXPR_TYPE_P (t
))
12774 op
= TREE_TYPE (op
);
12776 ++cp_unevaluated_operand
;
12777 ++c_inhibit_evaluation_warnings
;
12778 /* We only want to compute the number of arguments. */
12779 expanded
= tsubst_pack_expansion (op
, args
, complain
, in_decl
);
12780 --cp_unevaluated_operand
;
12781 --c_inhibit_evaluation_warnings
;
12783 if (TREE_CODE (expanded
) == TREE_VEC
)
12784 len
= TREE_VEC_LENGTH (expanded
);
12786 if (expanded
== error_mark_node
)
12787 return error_mark_node
;
12788 else if (PACK_EXPANSION_P (expanded
)
12789 || (TREE_CODE (expanded
) == TREE_VEC
12791 && PACK_EXPANSION_P (TREE_VEC_ELT (expanded
, len
-1))))
12793 if (TREE_CODE (expanded
) == TREE_VEC
)
12794 expanded
= TREE_VEC_ELT (expanded
, len
- 1);
12796 if (TYPE_P (expanded
))
12797 return cxx_sizeof_or_alignof_type (expanded
, SIZEOF_EXPR
,
12798 complain
& tf_error
);
12800 return cxx_sizeof_or_alignof_expr (expanded
, SIZEOF_EXPR
,
12801 complain
& tf_error
);
12804 return build_int_cst (size_type_node
, len
);
12806 if (SIZEOF_EXPR_TYPE_P (t
))
12808 r
= tsubst (TREE_TYPE (TREE_OPERAND (t
, 0)),
12809 args
, complain
, in_decl
);
12810 r
= build1 (NOP_EXPR
, r
, error_mark_node
);
12811 r
= build1 (SIZEOF_EXPR
,
12812 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
), r
);
12813 SIZEOF_EXPR_TYPE_P (r
) = 1;
12820 case TRUTH_NOT_EXPR
:
12823 case UNARY_PLUS_EXPR
: /* Unary + */
12825 case AT_ENCODE_EXPR
:
12829 case REALPART_EXPR
:
12830 case IMAGPART_EXPR
:
12833 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
12834 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
));
12836 case COMPONENT_REF
:
12841 object
= tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
);
12842 name
= TREE_OPERAND (t
, 1);
12843 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
12845 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12846 complain
, in_decl
);
12847 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12849 else if (TREE_CODE (name
) == SCOPE_REF
12850 && TREE_CODE (TREE_OPERAND (name
, 1)) == BIT_NOT_EXPR
)
12852 tree base
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12853 complain
, in_decl
);
12854 name
= TREE_OPERAND (name
, 1);
12855 name
= tsubst_copy (TREE_OPERAND (name
, 0), args
,
12856 complain
, in_decl
);
12857 name
= build1 (BIT_NOT_EXPR
, NULL_TREE
, name
);
12858 name
= build_qualified_name (/*type=*/NULL_TREE
,
12860 /*template_p=*/false);
12862 else if (BASELINK_P (name
))
12863 name
= tsubst_baselink (name
,
12864 non_reference (TREE_TYPE (object
)),
12868 name
= tsubst_copy (name
, args
, complain
, in_decl
);
12869 return build_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
12875 case TRUNC_DIV_EXPR
:
12876 case CEIL_DIV_EXPR
:
12877 case FLOOR_DIV_EXPR
:
12878 case ROUND_DIV_EXPR
:
12879 case EXACT_DIV_EXPR
:
12883 case TRUNC_MOD_EXPR
:
12884 case FLOOR_MOD_EXPR
:
12885 case TRUTH_ANDIF_EXPR
:
12886 case TRUTH_ORIF_EXPR
:
12887 case TRUTH_AND_EXPR
:
12888 case TRUTH_OR_EXPR
:
12901 case COMPOUND_EXPR
:
12904 case PREDECREMENT_EXPR
:
12905 case PREINCREMENT_EXPR
:
12906 case POSTDECREMENT_EXPR
:
12907 case POSTINCREMENT_EXPR
:
12909 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12910 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12913 return build_qualified_name (/*type=*/NULL_TREE
,
12914 tsubst_copy (TREE_OPERAND (t
, 0),
12915 args
, complain
, in_decl
),
12916 tsubst_copy (TREE_OPERAND (t
, 1),
12917 args
, complain
, in_decl
),
12918 QUALIFIED_NAME_IS_TEMPLATE (t
));
12923 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12924 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12925 NULL_TREE
, NULL_TREE
);
12929 int n
= VL_EXP_OPERAND_LENGTH (t
);
12930 tree result
= build_vl_exp (CALL_EXPR
, n
);
12932 for (i
= 0; i
< n
; i
++)
12933 TREE_OPERAND (t
, i
) = tsubst_copy (TREE_OPERAND (t
, i
), args
,
12934 complain
, in_decl
);
12940 case PSEUDO_DTOR_EXPR
:
12941 case VEC_PERM_EXPR
:
12944 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12945 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12946 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12947 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
12954 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12955 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
12956 tsubst_copy (TREE_OPERAND (t
, 2), args
, complain
, in_decl
));
12957 NEW_EXPR_USE_GLOBAL (r
) = NEW_EXPR_USE_GLOBAL (t
);
12964 (code
, tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
12965 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
12966 DELETE_EXPR_USE_GLOBAL (r
) = DELETE_EXPR_USE_GLOBAL (t
);
12967 DELETE_EXPR_USE_VEC (r
) = DELETE_EXPR_USE_VEC (t
);
12971 case TEMPLATE_ID_EXPR
:
12973 /* Substituted template arguments */
12974 tree fn
= TREE_OPERAND (t
, 0);
12975 tree targs
= TREE_OPERAND (t
, 1);
12977 fn
= tsubst_copy (fn
, args
, complain
, in_decl
);
12979 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
12981 return lookup_template_function (fn
, targs
);
12986 tree purpose
, value
, chain
;
12988 if (t
== void_list_node
)
12991 purpose
= TREE_PURPOSE (t
);
12993 purpose
= tsubst_copy (purpose
, args
, complain
, in_decl
);
12994 value
= TREE_VALUE (t
);
12996 value
= tsubst_copy (value
, args
, complain
, in_decl
);
12997 chain
= TREE_CHAIN (t
);
12998 if (chain
&& chain
!= void_type_node
)
12999 chain
= tsubst_copy (chain
, args
, complain
, in_decl
);
13000 if (purpose
== TREE_PURPOSE (t
)
13001 && value
== TREE_VALUE (t
)
13002 && chain
== TREE_CHAIN (t
))
13004 return tree_cons (purpose
, value
, chain
);
13009 case ENUMERAL_TYPE
:
13011 case TEMPLATE_TYPE_PARM
:
13012 case TEMPLATE_TEMPLATE_PARM
:
13013 case BOUND_TEMPLATE_TEMPLATE_PARM
:
13014 case TEMPLATE_PARM_INDEX
:
13016 case REFERENCE_TYPE
:
13018 case FUNCTION_TYPE
:
13021 case TYPENAME_TYPE
:
13022 case UNBOUND_CLASS_TEMPLATE
:
13024 case DECLTYPE_TYPE
:
13026 return tsubst (t
, args
, complain
, in_decl
);
13030 /* Fall through. */
13031 case IDENTIFIER_NODE
:
13032 if (IDENTIFIER_TYPENAME_P (t
))
13034 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13035 return mangle_conv_op_name_for_type (new_type
);
13041 /* This is handled by tsubst_copy_and_build. */
13042 gcc_unreachable ();
13045 return build_x_va_arg (EXPR_LOCATION (t
),
13046 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
,
13048 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
));
13050 case CLEANUP_POINT_EXPR
:
13051 /* We shouldn't have built any of these during initial template
13052 generation. Instead, they should be built during instantiation
13053 in response to the saved STMT_IS_FULL_EXPR_P setting. */
13054 gcc_unreachable ();
13058 (code
, tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
13059 tsubst_copy (TREE_OPERAND (t
, 0), args
, complain
, in_decl
),
13060 tsubst_copy (TREE_OPERAND (t
, 1), args
, complain
, in_decl
));
13061 PTRMEM_OK_P (r
) = PTRMEM_OK_P (t
);
13062 mark_used (TREE_OPERAND (r
, 1));
13065 case EXPR_PACK_EXPANSION
:
13066 error ("invalid use of pack expansion expression");
13067 return error_mark_node
;
13069 case NONTYPE_ARGUMENT_PACK
:
13070 error ("use %<...%> to expand argument pack");
13071 return error_mark_node
;
13078 /* Instantiate any typedefs in the type. */
13079 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
13080 r
= fold_convert (type
, t
);
13081 gcc_assert (TREE_CODE (r
) == code
);
13086 /* These can sometimes show up in a partial instantiation, but never
13087 involve template parms. */
13088 gcc_assert (!uses_template_parms (t
));
13092 /* We shouldn't get here, but keep going if !ENABLE_CHECKING. */
13093 gcc_checking_assert (false);
13098 /* Like tsubst_copy, but specifically for OpenMP clauses. */
13101 tsubst_omp_clauses (tree clauses
, bool declare_simd
,
13102 tree args
, tsubst_flags_t complain
, tree in_decl
)
13104 tree new_clauses
= NULL
, nc
, oc
;
13106 for (oc
= clauses
; oc
; oc
= OMP_CLAUSE_CHAIN (oc
))
13108 nc
= copy_node (oc
);
13109 OMP_CLAUSE_CHAIN (nc
) = new_clauses
;
13112 switch (OMP_CLAUSE_CODE (nc
))
13114 case OMP_CLAUSE_LASTPRIVATE
:
13115 if (OMP_CLAUSE_LASTPRIVATE_STMT (oc
))
13117 OMP_CLAUSE_LASTPRIVATE_STMT (nc
) = push_stmt_list ();
13118 tsubst_expr (OMP_CLAUSE_LASTPRIVATE_STMT (oc
), args
, complain
,
13119 in_decl
, /*integral_constant_expression_p=*/false);
13120 OMP_CLAUSE_LASTPRIVATE_STMT (nc
)
13121 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (nc
));
13124 case OMP_CLAUSE_PRIVATE
:
13125 case OMP_CLAUSE_SHARED
:
13126 case OMP_CLAUSE_FIRSTPRIVATE
:
13127 case OMP_CLAUSE_COPYIN
:
13128 case OMP_CLAUSE_COPYPRIVATE
:
13129 case OMP_CLAUSE_IF
:
13130 case OMP_CLAUSE_NUM_THREADS
:
13131 case OMP_CLAUSE_SCHEDULE
:
13132 case OMP_CLAUSE_COLLAPSE
:
13133 case OMP_CLAUSE_FINAL
:
13134 case OMP_CLAUSE_DEPEND
:
13135 case OMP_CLAUSE_FROM
:
13136 case OMP_CLAUSE_TO
:
13137 case OMP_CLAUSE_UNIFORM
:
13138 case OMP_CLAUSE_MAP
:
13139 case OMP_CLAUSE_DEVICE
:
13140 case OMP_CLAUSE_DIST_SCHEDULE
:
13141 case OMP_CLAUSE_NUM_TEAMS
:
13142 case OMP_CLAUSE_THREAD_LIMIT
:
13143 case OMP_CLAUSE_SAFELEN
:
13144 case OMP_CLAUSE_SIMDLEN
:
13145 OMP_CLAUSE_OPERAND (nc
, 0)
13146 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13147 in_decl
, /*integral_constant_expression_p=*/false);
13149 case OMP_CLAUSE_REDUCTION
:
13150 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
))
13152 tree placeholder
= OMP_CLAUSE_REDUCTION_PLACEHOLDER (oc
);
13153 if (TREE_CODE (placeholder
) == SCOPE_REF
)
13155 tree scope
= tsubst (TREE_OPERAND (placeholder
, 0), args
,
13156 complain
, in_decl
);
13157 OMP_CLAUSE_REDUCTION_PLACEHOLDER (nc
)
13158 = build_qualified_name (NULL_TREE
, scope
,
13159 TREE_OPERAND (placeholder
, 1),
13163 gcc_assert (identifier_p (placeholder
));
13165 OMP_CLAUSE_OPERAND (nc
, 0)
13166 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13167 in_decl
, /*integral_constant_expression_p=*/false);
13169 case OMP_CLAUSE_LINEAR
:
13170 case OMP_CLAUSE_ALIGNED
:
13171 OMP_CLAUSE_OPERAND (nc
, 0)
13172 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 0), args
, complain
,
13173 in_decl
, /*integral_constant_expression_p=*/false);
13174 OMP_CLAUSE_OPERAND (nc
, 1)
13175 = tsubst_expr (OMP_CLAUSE_OPERAND (oc
, 1), args
, complain
,
13176 in_decl
, /*integral_constant_expression_p=*/false);
13179 case OMP_CLAUSE_NOWAIT
:
13180 case OMP_CLAUSE_ORDERED
:
13181 case OMP_CLAUSE_DEFAULT
:
13182 case OMP_CLAUSE_UNTIED
:
13183 case OMP_CLAUSE_MERGEABLE
:
13184 case OMP_CLAUSE_INBRANCH
:
13185 case OMP_CLAUSE_NOTINBRANCH
:
13186 case OMP_CLAUSE_PROC_BIND
:
13187 case OMP_CLAUSE_FOR
:
13188 case OMP_CLAUSE_PARALLEL
:
13189 case OMP_CLAUSE_SECTIONS
:
13190 case OMP_CLAUSE_TASKGROUP
:
13193 gcc_unreachable ();
13197 new_clauses
= nreverse (new_clauses
);
13199 new_clauses
= finish_omp_clauses (new_clauses
);
13200 return new_clauses
;
13203 /* Like tsubst_copy_and_build, but unshare TREE_LIST nodes. */
13206 tsubst_copy_asm_operands (tree t
, tree args
, tsubst_flags_t complain
,
13209 #define RECUR(t) tsubst_copy_asm_operands (t, args, complain, in_decl)
13211 tree purpose
, value
, chain
;
13216 if (TREE_CODE (t
) != TREE_LIST
)
13217 return tsubst_copy_and_build (t
, args
, complain
, in_decl
,
13218 /*function_p=*/false,
13219 /*integral_constant_expression_p=*/false);
13221 if (t
== void_list_node
)
13224 purpose
= TREE_PURPOSE (t
);
13226 purpose
= RECUR (purpose
);
13227 value
= TREE_VALUE (t
);
13230 if (TREE_CODE (value
) != LABEL_DECL
)
13231 value
= RECUR (value
);
13234 value
= lookup_label (DECL_NAME (value
));
13235 gcc_assert (TREE_CODE (value
) == LABEL_DECL
);
13236 TREE_USED (value
) = 1;
13239 chain
= TREE_CHAIN (t
);
13240 if (chain
&& chain
!= void_type_node
)
13241 chain
= RECUR (chain
);
13242 return tree_cons (purpose
, value
, chain
);
13246 /* Substitute one OMP_FOR iterator. */
13249 tsubst_omp_for_iterator (tree t
, int i
, tree declv
, tree initv
,
13250 tree condv
, tree incrv
, tree
*clauses
,
13251 tree args
, tsubst_flags_t complain
, tree in_decl
,
13252 bool integral_constant_expression_p
)
13254 #define RECUR(NODE) \
13255 tsubst_expr ((NODE), args, complain, in_decl, \
13256 integral_constant_expression_p)
13257 tree decl
, init
, cond
, incr
;
13259 init
= TREE_VEC_ELT (OMP_FOR_INIT (t
), i
);
13260 gcc_assert (TREE_CODE (init
) == MODIFY_EXPR
);
13261 decl
= TREE_OPERAND (init
, 0);
13262 init
= TREE_OPERAND (init
, 1);
13263 tree decl_expr
= NULL_TREE
;
13264 if (init
&& TREE_CODE (init
) == DECL_EXPR
)
13266 /* We need to jump through some hoops to handle declarations in the
13267 for-init-statement, since we might need to handle auto deduction,
13268 but we need to keep control of initialization. */
13270 init
= DECL_INITIAL (DECL_EXPR_DECL (init
));
13271 decl
= tsubst_decl (decl
, args
, complain
);
13274 decl
= RECUR (decl
);
13275 init
= RECUR (init
);
13277 tree auto_node
= type_uses_auto (TREE_TYPE (decl
));
13278 if (auto_node
&& init
)
13280 = do_auto_deduction (TREE_TYPE (decl
), init
, auto_node
);
13282 gcc_assert (!type_dependent_expression_p (decl
));
13284 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
13288 /* Declare the variable, but don't let that initialize it. */
13289 tree init_sav
= DECL_INITIAL (DECL_EXPR_DECL (decl_expr
));
13290 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = NULL_TREE
;
13292 DECL_INITIAL (DECL_EXPR_DECL (decl_expr
)) = init_sav
;
13295 cond
= RECUR (TREE_VEC_ELT (OMP_FOR_COND (t
), i
));
13296 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13297 if (TREE_CODE (incr
) == MODIFY_EXPR
)
13298 incr
= build_x_modify_expr (EXPR_LOCATION (incr
),
13299 RECUR (TREE_OPERAND (incr
, 0)), NOP_EXPR
,
13300 RECUR (TREE_OPERAND (incr
, 1)),
13303 incr
= RECUR (incr
);
13304 TREE_VEC_ELT (declv
, i
) = decl
;
13305 TREE_VEC_ELT (initv
, i
) = init
;
13306 TREE_VEC_ELT (condv
, i
) = cond
;
13307 TREE_VEC_ELT (incrv
, i
) = incr
;
13313 /* Declare and initialize the variable. */
13320 for (c
= *clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
13322 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
13323 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
13324 && OMP_CLAUSE_DECL (c
) == decl
)
13326 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
13327 && OMP_CLAUSE_DECL (c
) == decl
)
13328 error ("iteration variable %qD should not be firstprivate", decl
);
13329 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
13330 && OMP_CLAUSE_DECL (c
) == decl
)
13331 error ("iteration variable %qD should not be reduction", decl
);
13335 c
= build_omp_clause (input_location
, OMP_CLAUSE_PRIVATE
);
13336 OMP_CLAUSE_DECL (c
) = decl
;
13337 c
= finish_omp_clauses (c
);
13340 OMP_CLAUSE_CHAIN (c
) = *clauses
;
13345 cond
= TREE_VEC_ELT (OMP_FOR_COND (t
), i
);
13346 if (COMPARISON_CLASS_P (cond
))
13347 cond
= build2 (TREE_CODE (cond
), boolean_type_node
,
13348 RECUR (TREE_OPERAND (cond
, 0)),
13349 RECUR (TREE_OPERAND (cond
, 1)));
13351 cond
= RECUR (cond
);
13352 incr
= TREE_VEC_ELT (OMP_FOR_INCR (t
), i
);
13353 switch (TREE_CODE (incr
))
13355 case PREINCREMENT_EXPR
:
13356 case PREDECREMENT_EXPR
:
13357 case POSTINCREMENT_EXPR
:
13358 case POSTDECREMENT_EXPR
:
13359 incr
= build2 (TREE_CODE (incr
), TREE_TYPE (decl
),
13360 RECUR (TREE_OPERAND (incr
, 0)), NULL_TREE
);
13363 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13364 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13366 tree rhs
= TREE_OPERAND (incr
, 1);
13367 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
13368 RECUR (TREE_OPERAND (incr
, 0)),
13369 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13370 RECUR (TREE_OPERAND (rhs
, 0)),
13371 RECUR (TREE_OPERAND (rhs
, 1))));
13374 incr
= RECUR (incr
);
13377 if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
13378 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
13380 tree lhs
= RECUR (TREE_OPERAND (incr
, 0));
13381 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
), lhs
,
13382 build2 (TREE_CODE (TREE_OPERAND (incr
, 1)),
13383 TREE_TYPE (decl
), lhs
,
13384 RECUR (TREE_OPERAND (incr
, 2))));
13386 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == NOP_EXPR
13387 && (TREE_CODE (TREE_OPERAND (incr
, 2)) == PLUS_EXPR
13388 || (TREE_CODE (TREE_OPERAND (incr
, 2)) == MINUS_EXPR
)))
13390 tree rhs
= TREE_OPERAND (incr
, 2);
13391 incr
= build2 (MODIFY_EXPR
, TREE_TYPE (decl
),
13392 RECUR (TREE_OPERAND (incr
, 0)),
13393 build2 (TREE_CODE (rhs
), TREE_TYPE (decl
),
13394 RECUR (TREE_OPERAND (rhs
, 0)),
13395 RECUR (TREE_OPERAND (rhs
, 1))));
13398 incr
= RECUR (incr
);
13401 incr
= RECUR (incr
);
13405 TREE_VEC_ELT (declv
, i
) = decl
;
13406 TREE_VEC_ELT (initv
, i
) = init
;
13407 TREE_VEC_ELT (condv
, i
) = cond
;
13408 TREE_VEC_ELT (incrv
, i
) = incr
;
13412 /* Like tsubst_copy for expressions, etc. but also does semantic
13416 tsubst_expr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
,
13417 bool integral_constant_expression_p
)
13419 #define RETURN(EXP) do { r = (EXP); goto out; } while(0)
13420 #define RECUR(NODE) \
13421 tsubst_expr ((NODE), args, complain, in_decl, \
13422 integral_constant_expression_p)
13428 if (t
== NULL_TREE
|| t
== error_mark_node
)
13431 loc
= input_location
;
13432 if (EXPR_HAS_LOCATION (t
))
13433 input_location
= EXPR_LOCATION (t
);
13434 if (STATEMENT_CODE_P (TREE_CODE (t
)))
13435 current_stmt_tree ()->stmts_are_full_exprs_p
= STMT_IS_FULL_EXPR_P (t
);
13437 switch (TREE_CODE (t
))
13439 case STATEMENT_LIST
:
13441 tree_stmt_iterator i
;
13442 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
13443 RECUR (tsi_stmt (i
));
13447 case CTOR_INITIALIZER
:
13448 finish_mem_initializers (tsubst_initializer_list
13449 (TREE_OPERAND (t
, 0), args
));
13453 finish_return_stmt (RECUR (TREE_OPERAND (t
, 0)));
13457 tmp
= RECUR (EXPR_STMT_EXPR (t
));
13458 if (EXPR_STMT_STMT_EXPR_RESULT (t
))
13459 finish_stmt_expr_expr (tmp
, cur_stmt_expr
);
13461 finish_expr_stmt (tmp
);
13465 do_using_directive (USING_STMT_NAMESPACE (t
));
13470 tree decl
, pattern_decl
;
13473 pattern_decl
= decl
= DECL_EXPR_DECL (t
);
13474 if (TREE_CODE (decl
) == LABEL_DECL
)
13475 finish_label_decl (DECL_NAME (decl
));
13476 else if (TREE_CODE (decl
) == USING_DECL
)
13478 tree scope
= USING_DECL_SCOPE (decl
);
13479 tree name
= DECL_NAME (decl
);
13482 scope
= tsubst (scope
, args
, complain
, in_decl
);
13483 decl
= lookup_qualified_name (scope
, name
,
13484 /*is_type_p=*/false,
13485 /*complain=*/false);
13486 if (decl
== error_mark_node
|| TREE_CODE (decl
) == TREE_LIST
)
13487 qualified_name_lookup_error (scope
, name
, decl
, input_location
);
13489 do_local_using_decl (decl
, scope
, name
);
13491 else if (DECL_PACK_P (decl
))
13493 /* Don't build up decls for a variadic capture proxy, we'll
13494 instantiate the elements directly as needed. */
13499 init
= DECL_INITIAL (decl
);
13500 decl
= tsubst (decl
, args
, complain
, in_decl
);
13501 if (decl
!= error_mark_node
)
13503 /* By marking the declaration as instantiated, we avoid
13504 trying to instantiate it. Since instantiate_decl can't
13505 handle local variables, and since we've already done
13506 all that needs to be done, that's the right thing to
13509 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13511 && ANON_AGGR_TYPE_P (TREE_TYPE (decl
)))
13512 /* Anonymous aggregates are a special case. */
13513 finish_anon_union (decl
);
13514 else if (is_capture_proxy (DECL_EXPR_DECL (t
)))
13516 DECL_CONTEXT (decl
) = current_function_decl
;
13517 if (DECL_NAME (decl
) == this_identifier
)
13519 tree lam
= DECL_CONTEXT (current_function_decl
);
13520 lam
= CLASSTYPE_LAMBDA_EXPR (lam
);
13521 LAMBDA_EXPR_THIS_CAPTURE (lam
) = decl
;
13523 insert_capture_proxy (decl
);
13525 else if (DECL_IMPLICIT_TYPEDEF_P (t
))
13526 /* We already did a pushtag. */;
13527 else if (TREE_CODE (decl
) == FUNCTION_DECL
13528 && DECL_OMP_DECLARE_REDUCTION_P (decl
)
13529 && DECL_FUNCTION_SCOPE_P (pattern_decl
))
13531 DECL_CONTEXT (decl
) = NULL_TREE
;
13533 DECL_CONTEXT (decl
) = current_function_decl
;
13534 cp_check_omp_declare_reduction (decl
);
13538 int const_init
= false;
13539 maybe_push_decl (decl
);
13541 && DECL_PRETTY_FUNCTION_P (decl
))
13543 /* For __PRETTY_FUNCTION__ we have to adjust the
13545 const char *const name
13546 = cxx_printable_name (current_function_decl
, 2);
13547 init
= cp_fname_init (name
, &TREE_TYPE (decl
));
13551 tree t
= RECUR (init
);
13555 /* If we had an initializer but it
13556 instantiated to nothing,
13557 value-initialize the object. This will
13558 only occur when the initializer was a
13559 pack expansion where the parameter packs
13560 used in that expansion were of length
13562 init
= build_value_init (TREE_TYPE (decl
),
13564 if (TREE_CODE (init
) == AGGR_INIT_EXPR
)
13565 init
= get_target_expr_sfinae (init
, complain
);
13572 const_init
= (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P
13574 cp_finish_decl (decl
, init
, const_init
, NULL_TREE
, 0);
13583 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13584 RECUR (FOR_INIT_STMT (t
));
13585 finish_for_init_stmt (stmt
);
13586 tmp
= RECUR (FOR_COND (t
));
13587 finish_for_cond (tmp
, stmt
, false);
13588 tmp
= RECUR (FOR_EXPR (t
));
13589 finish_for_expr (tmp
, stmt
);
13590 RECUR (FOR_BODY (t
));
13591 finish_for_stmt (stmt
);
13594 case RANGE_FOR_STMT
:
13597 stmt
= begin_for_stmt (NULL_TREE
, NULL_TREE
);
13598 decl
= RANGE_FOR_DECL (t
);
13599 decl
= tsubst (decl
, args
, complain
, in_decl
);
13600 maybe_push_decl (decl
);
13601 expr
= RECUR (RANGE_FOR_EXPR (t
));
13602 stmt
= cp_convert_range_for (stmt
, decl
, expr
, RANGE_FOR_IVDEP (t
));
13603 RECUR (RANGE_FOR_BODY (t
));
13604 finish_for_stmt (stmt
);
13609 stmt
= begin_while_stmt ();
13610 tmp
= RECUR (WHILE_COND (t
));
13611 finish_while_stmt_cond (tmp
, stmt
, false);
13612 RECUR (WHILE_BODY (t
));
13613 finish_while_stmt (stmt
);
13617 stmt
= begin_do_stmt ();
13618 RECUR (DO_BODY (t
));
13619 finish_do_body (stmt
);
13620 tmp
= RECUR (DO_COND (t
));
13621 finish_do_stmt (tmp
, stmt
, false);
13625 stmt
= begin_if_stmt ();
13626 tmp
= RECUR (IF_COND (t
));
13627 finish_if_stmt_cond (tmp
, stmt
);
13628 RECUR (THEN_CLAUSE (t
));
13629 finish_then_clause (stmt
);
13631 if (ELSE_CLAUSE (t
))
13633 begin_else_clause (stmt
);
13634 RECUR (ELSE_CLAUSE (t
));
13635 finish_else_clause (stmt
);
13638 finish_if_stmt (stmt
);
13642 if (BIND_EXPR_BODY_BLOCK (t
))
13643 stmt
= begin_function_body ();
13645 stmt
= begin_compound_stmt (BIND_EXPR_TRY_BLOCK (t
)
13646 ? BCS_TRY_BLOCK
: 0);
13648 RECUR (BIND_EXPR_BODY (t
));
13650 if (BIND_EXPR_BODY_BLOCK (t
))
13651 finish_function_body (stmt
);
13653 finish_compound_stmt (stmt
);
13657 finish_break_stmt ();
13660 case CONTINUE_STMT
:
13661 finish_continue_stmt ();
13665 stmt
= begin_switch_stmt ();
13666 tmp
= RECUR (SWITCH_STMT_COND (t
));
13667 finish_switch_cond (tmp
, stmt
);
13668 RECUR (SWITCH_STMT_BODY (t
));
13669 finish_switch_stmt (stmt
);
13672 case CASE_LABEL_EXPR
:
13673 finish_case_label (EXPR_LOCATION (t
),
13674 RECUR (CASE_LOW (t
)),
13675 RECUR (CASE_HIGH (t
)));
13680 tree decl
= LABEL_EXPR_LABEL (t
);
13683 label
= finish_label_stmt (DECL_NAME (decl
));
13684 if (DECL_ATTRIBUTES (decl
) != NULL_TREE
)
13685 cplus_decl_attributes (&label
, DECL_ATTRIBUTES (decl
), 0);
13690 tmp
= GOTO_DESTINATION (t
);
13691 if (TREE_CODE (tmp
) != LABEL_DECL
)
13692 /* Computed goto's must be tsubst'd into. On the other hand,
13693 non-computed gotos must not be; the identifier in question
13694 will have no binding. */
13697 tmp
= DECL_NAME (tmp
);
13698 finish_goto_stmt (tmp
);
13702 tmp
= finish_asm_stmt
13703 (ASM_VOLATILE_P (t
),
13704 RECUR (ASM_STRING (t
)),
13705 tsubst_copy_asm_operands (ASM_OUTPUTS (t
), args
, complain
, in_decl
),
13706 tsubst_copy_asm_operands (ASM_INPUTS (t
), args
, complain
, in_decl
),
13707 tsubst_copy_asm_operands (ASM_CLOBBERS (t
), args
, complain
, in_decl
),
13708 tsubst_copy_asm_operands (ASM_LABELS (t
), args
, complain
, in_decl
));
13710 tree asm_expr
= tmp
;
13711 if (TREE_CODE (asm_expr
) == CLEANUP_POINT_EXPR
)
13712 asm_expr
= TREE_OPERAND (asm_expr
, 0);
13713 ASM_INPUT_P (asm_expr
) = ASM_INPUT_P (t
);
13720 stmt
= begin_try_block ();
13721 RECUR (TRY_STMTS (t
));
13722 finish_cleanup_try_block (stmt
);
13723 finish_cleanup (RECUR (TRY_HANDLERS (t
)), stmt
);
13727 tree compound_stmt
= NULL_TREE
;
13729 if (FN_TRY_BLOCK_P (t
))
13730 stmt
= begin_function_try_block (&compound_stmt
);
13732 stmt
= begin_try_block ();
13734 RECUR (TRY_STMTS (t
));
13736 if (FN_TRY_BLOCK_P (t
))
13737 finish_function_try_block (stmt
);
13739 finish_try_block (stmt
);
13741 RECUR (TRY_HANDLERS (t
));
13742 if (FN_TRY_BLOCK_P (t
))
13743 finish_function_handler_sequence (stmt
, compound_stmt
);
13745 finish_handler_sequence (stmt
);
13751 tree decl
= HANDLER_PARMS (t
);
13755 decl
= tsubst (decl
, args
, complain
, in_decl
);
13756 /* Prevent instantiate_decl from trying to instantiate
13757 this variable. We've already done all that needs to be
13759 if (decl
!= error_mark_node
)
13760 DECL_TEMPLATE_INSTANTIATED (decl
) = 1;
13762 stmt
= begin_handler ();
13763 finish_handler_parms (decl
, stmt
);
13764 RECUR (HANDLER_BODY (t
));
13765 finish_handler (stmt
);
13770 tmp
= tsubst (TREE_TYPE (t
), args
, complain
, NULL_TREE
);
13771 if (CLASS_TYPE_P (tmp
))
13773 /* Local classes are not independent templates; they are
13774 instantiated along with their containing function. And this
13775 way we don't have to deal with pushing out of one local class
13776 to instantiate a member of another local class. */
13778 /* Closures are handled by the LAMBDA_EXPR. */
13779 gcc_assert (!LAMBDA_TYPE_P (TREE_TYPE (t
)));
13780 complete_type (tmp
);
13781 for (fn
= TYPE_METHODS (tmp
); fn
; fn
= DECL_CHAIN (fn
))
13782 if (!DECL_ARTIFICIAL (fn
))
13783 instantiate_decl (fn
, /*defer_ok*/0, /*expl_inst_class*/false);
13787 case STATIC_ASSERT
:
13791 ++c_inhibit_evaluation_warnings
;
13793 tsubst_expr (STATIC_ASSERT_CONDITION (t
),
13796 /*integral_constant_expression_p=*/true);
13797 --c_inhibit_evaluation_warnings
;
13799 finish_static_assert (condition
,
13800 STATIC_ASSERT_MESSAGE (t
),
13801 STATIC_ASSERT_SOURCE_LOCATION (t
),
13802 /*member_p=*/false);
13807 tmp
= tsubst_omp_clauses (OMP_PARALLEL_CLAUSES (t
), false,
13808 args
, complain
, in_decl
);
13809 stmt
= begin_omp_parallel ();
13810 RECUR (OMP_PARALLEL_BODY (t
));
13811 OMP_PARALLEL_COMBINED (finish_omp_parallel (tmp
, stmt
))
13812 = OMP_PARALLEL_COMBINED (t
);
13816 tmp
= tsubst_omp_clauses (OMP_TASK_CLAUSES (t
), false,
13817 args
, complain
, in_decl
);
13818 stmt
= begin_omp_task ();
13819 RECUR (OMP_TASK_BODY (t
));
13820 finish_omp_task (tmp
, stmt
);
13826 case OMP_DISTRIBUTE
:
13828 tree clauses
, body
, pre_body
;
13829 tree declv
= NULL_TREE
, initv
= NULL_TREE
, condv
= NULL_TREE
;
13830 tree incrv
= NULL_TREE
;
13833 clauses
= tsubst_omp_clauses (OMP_FOR_CLAUSES (t
), false,
13834 args
, complain
, in_decl
);
13835 if (OMP_FOR_INIT (t
) != NULL_TREE
)
13837 declv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13838 initv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13839 condv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13840 incrv
= make_tree_vec (TREE_VEC_LENGTH (OMP_FOR_INIT (t
)));
13843 stmt
= begin_omp_structured_block ();
13845 pre_body
= push_stmt_list ();
13846 RECUR (OMP_FOR_PRE_BODY (t
));
13847 pre_body
= pop_stmt_list (pre_body
);
13849 if (OMP_FOR_INIT (t
) != NULL_TREE
)
13850 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INIT (t
)); i
++)
13851 tsubst_omp_for_iterator (t
, i
, declv
, initv
, condv
, incrv
,
13852 &clauses
, args
, complain
, in_decl
,
13853 integral_constant_expression_p
);
13855 body
= push_stmt_list ();
13856 RECUR (OMP_FOR_BODY (t
));
13857 body
= pop_stmt_list (body
);
13859 if (OMP_FOR_INIT (t
) != NULL_TREE
)
13860 t
= finish_omp_for (EXPR_LOCATION (t
), TREE_CODE (t
), declv
, initv
,
13861 condv
, incrv
, body
, pre_body
, clauses
);
13864 t
= make_node (TREE_CODE (t
));
13865 TREE_TYPE (t
) = void_type_node
;
13866 OMP_FOR_BODY (t
) = body
;
13867 OMP_FOR_PRE_BODY (t
) = pre_body
;
13868 OMP_FOR_CLAUSES (t
) = clauses
;
13869 SET_EXPR_LOCATION (t
, EXPR_LOCATION (t
));
13873 add_stmt (finish_omp_structured_block (stmt
));
13880 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
13881 args
, complain
, in_decl
);
13882 stmt
= push_stmt_list ();
13883 RECUR (OMP_BODY (t
));
13884 stmt
= pop_stmt_list (stmt
);
13887 OMP_BODY (t
) = stmt
;
13888 OMP_CLAUSES (t
) = tmp
;
13892 case OMP_TARGET_DATA
:
13894 tmp
= tsubst_omp_clauses (OMP_CLAUSES (t
), false,
13895 args
, complain
, in_decl
);
13896 keep_next_level (true);
13897 stmt
= begin_omp_structured_block ();
13899 RECUR (OMP_BODY (t
));
13900 stmt
= finish_omp_structured_block (stmt
);
13903 OMP_BODY (t
) = stmt
;
13904 OMP_CLAUSES (t
) = tmp
;
13908 case OMP_TARGET_UPDATE
:
13909 tmp
= tsubst_omp_clauses (OMP_TARGET_UPDATE_CLAUSES (t
), false,
13910 args
, complain
, in_decl
);
13912 OMP_CLAUSES (t
) = tmp
;
13919 case OMP_TASKGROUP
:
13921 stmt
= push_stmt_list ();
13922 RECUR (OMP_BODY (t
));
13923 stmt
= pop_stmt_list (stmt
);
13926 OMP_BODY (t
) = stmt
;
13931 gcc_assert (OMP_ATOMIC_DEPENDENT_P (t
));
13932 if (TREE_CODE (TREE_OPERAND (t
, 1)) != MODIFY_EXPR
)
13934 tree op1
= TREE_OPERAND (t
, 1);
13935 tree rhs1
= NULL_TREE
;
13937 if (TREE_CODE (op1
) == COMPOUND_EXPR
)
13939 rhs1
= RECUR (TREE_OPERAND (op1
, 0));
13940 op1
= TREE_OPERAND (op1
, 1);
13942 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13943 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13944 finish_omp_atomic (OMP_ATOMIC
, TREE_CODE (op1
), lhs
, rhs
,
13945 NULL_TREE
, NULL_TREE
, rhs1
,
13946 OMP_ATOMIC_SEQ_CST (t
));
13950 tree op1
= TREE_OPERAND (t
, 1);
13951 tree v
= NULL_TREE
, lhs
, rhs
= NULL_TREE
, lhs1
= NULL_TREE
;
13952 tree rhs1
= NULL_TREE
;
13953 enum tree_code code
= TREE_CODE (TREE_OPERAND (op1
, 1));
13954 enum tree_code opcode
= NOP_EXPR
;
13955 if (code
== OMP_ATOMIC_READ
)
13957 v
= RECUR (TREE_OPERAND (op1
, 0));
13958 lhs
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13960 else if (code
== OMP_ATOMIC_CAPTURE_OLD
13961 || code
== OMP_ATOMIC_CAPTURE_NEW
)
13963 tree op11
= TREE_OPERAND (TREE_OPERAND (op1
, 1), 1);
13964 v
= RECUR (TREE_OPERAND (op1
, 0));
13965 lhs1
= RECUR (TREE_OPERAND (TREE_OPERAND (op1
, 1), 0));
13966 if (TREE_CODE (op11
) == COMPOUND_EXPR
)
13968 rhs1
= RECUR (TREE_OPERAND (op11
, 0));
13969 op11
= TREE_OPERAND (op11
, 1);
13971 lhs
= RECUR (TREE_OPERAND (op11
, 0));
13972 rhs
= RECUR (TREE_OPERAND (op11
, 1));
13973 opcode
= TREE_CODE (op11
);
13974 if (opcode
== MODIFY_EXPR
)
13980 lhs
= RECUR (TREE_OPERAND (op1
, 0));
13981 rhs
= RECUR (TREE_OPERAND (op1
, 1));
13983 finish_omp_atomic (code
, opcode
, lhs
, rhs
, v
, lhs1
, rhs1
,
13984 OMP_ATOMIC_SEQ_CST (t
));
13988 case TRANSACTION_EXPR
:
13991 flags
|= (TRANSACTION_EXPR_OUTER (t
) ? TM_STMT_ATTR_OUTER
: 0);
13992 flags
|= (TRANSACTION_EXPR_RELAXED (t
) ? TM_STMT_ATTR_RELAXED
: 0);
13994 if (TRANSACTION_EXPR_IS_STMT (t
))
13996 tree body
= TRANSACTION_EXPR_BODY (t
);
13997 tree noex
= NULL_TREE
;
13998 if (TREE_CODE (body
) == MUST_NOT_THROW_EXPR
)
14000 noex
= MUST_NOT_THROW_COND (body
);
14001 if (noex
== NULL_TREE
)
14002 noex
= boolean_true_node
;
14003 body
= TREE_OPERAND (body
, 0);
14005 stmt
= begin_transaction_stmt (input_location
, NULL
, flags
);
14007 finish_transaction_stmt (stmt
, NULL
, flags
, RECUR (noex
));
14011 stmt
= build_transaction_expr (EXPR_LOCATION (t
),
14012 RECUR (TRANSACTION_EXPR_BODY (t
)),
14019 case MUST_NOT_THROW_EXPR
:
14020 RETURN (build_must_not_throw_expr (RECUR (TREE_OPERAND (t
, 0)),
14021 RECUR (MUST_NOT_THROW_COND (t
))));
14023 case EXPR_PACK_EXPANSION
:
14024 error ("invalid use of pack expansion expression");
14025 RETURN (error_mark_node
);
14027 case NONTYPE_ARGUMENT_PACK
:
14028 error ("use %<...%> to expand argument pack");
14029 RETURN (error_mark_node
);
14031 case CILK_SPAWN_STMT
:
14032 cfun
->calls_cilk_spawn
= 1;
14033 RETURN (build_cilk_spawn (EXPR_LOCATION (t
), RECUR (CILK_SPAWN_FN (t
))));
14035 case CILK_SYNC_STMT
:
14036 RETURN (build_cilk_sync ());
14038 case COMPOUND_EXPR
:
14039 tmp
= RECUR (TREE_OPERAND (t
, 0));
14040 if (tmp
== NULL_TREE
)
14041 /* If the first operand was a statement, we're done with it. */
14042 RETURN (RECUR (TREE_OPERAND (t
, 1)));
14043 RETURN (build_x_compound_expr (EXPR_LOCATION (t
), tmp
,
14044 RECUR (TREE_OPERAND (t
, 1)),
14047 case ANNOTATE_EXPR
:
14048 tmp
= RECUR (TREE_OPERAND (t
, 0));
14049 RETURN (build2_loc (EXPR_LOCATION (t
), ANNOTATE_EXPR
,
14050 TREE_TYPE (tmp
), tmp
, RECUR (TREE_OPERAND (t
, 1))));
14053 gcc_assert (!STATEMENT_CODE_P (TREE_CODE (t
)));
14055 RETURN (tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14056 /*function_p=*/false,
14057 integral_constant_expression_p
));
14060 RETURN (NULL_TREE
);
14062 input_location
= loc
;
14068 /* Instantiate the special body of the artificial DECL_OMP_DECLARE_REDUCTION
14069 function. For description of the body see comment above
14070 cp_parser_omp_declare_reduction_exprs. */
14073 tsubst_omp_udr (tree t
, tree args
, tsubst_flags_t complain
, tree in_decl
)
14075 if (t
== NULL_TREE
|| t
== error_mark_node
)
14078 gcc_assert (TREE_CODE (t
) == STATEMENT_LIST
);
14080 tree_stmt_iterator tsi
;
14083 memset (stmts
, 0, sizeof stmts
);
14084 for (i
= 0, tsi
= tsi_start (t
);
14085 i
< 7 && !tsi_end_p (tsi
);
14086 i
++, tsi_next (&tsi
))
14087 stmts
[i
] = tsi_stmt (tsi
);
14088 gcc_assert (tsi_end_p (tsi
));
14092 gcc_assert (TREE_CODE (stmts
[0]) == DECL_EXPR
14093 && TREE_CODE (stmts
[1]) == DECL_EXPR
);
14094 tree omp_out
= tsubst (DECL_EXPR_DECL (stmts
[0]),
14095 args
, complain
, in_decl
);
14096 tree omp_in
= tsubst (DECL_EXPR_DECL (stmts
[1]),
14097 args
, complain
, in_decl
);
14098 DECL_CONTEXT (omp_out
) = current_function_decl
;
14099 DECL_CONTEXT (omp_in
) = current_function_decl
;
14100 keep_next_level (true);
14101 tree block
= begin_omp_structured_block ();
14102 tsubst_expr (stmts
[2], args
, complain
, in_decl
, false);
14103 block
= finish_omp_structured_block (block
);
14104 block
= maybe_cleanup_point_expr_void (block
);
14105 add_decl_expr (omp_out
);
14106 if (TREE_NO_WARNING (DECL_EXPR_DECL (stmts
[0])))
14107 TREE_NO_WARNING (omp_out
) = 1;
14108 add_decl_expr (omp_in
);
14109 finish_expr_stmt (block
);
14113 gcc_assert (TREE_CODE (stmts
[3]) == DECL_EXPR
14114 && TREE_CODE (stmts
[4]) == DECL_EXPR
);
14115 tree omp_priv
= tsubst (DECL_EXPR_DECL (stmts
[3]),
14116 args
, complain
, in_decl
);
14117 tree omp_orig
= tsubst (DECL_EXPR_DECL (stmts
[4]),
14118 args
, complain
, in_decl
);
14119 DECL_CONTEXT (omp_priv
) = current_function_decl
;
14120 DECL_CONTEXT (omp_orig
) = current_function_decl
;
14121 keep_next_level (true);
14122 tree block
= begin_omp_structured_block ();
14123 tsubst_expr (stmts
[5], args
, complain
, in_decl
, false);
14124 block
= finish_omp_structured_block (block
);
14125 block
= maybe_cleanup_point_expr_void (block
);
14126 cp_walk_tree (&block
, cp_remove_omp_priv_cleanup_stmt
, omp_priv
, NULL
);
14127 add_decl_expr (omp_priv
);
14128 add_decl_expr (omp_orig
);
14129 finish_expr_stmt (block
);
14131 add_decl_expr (omp_orig
);
14135 /* T is a postfix-expression that is not being used in a function
14136 call. Return the substituted version of T. */
14139 tsubst_non_call_postfix_expression (tree t
, tree args
,
14140 tsubst_flags_t complain
,
14143 if (TREE_CODE (t
) == SCOPE_REF
)
14144 t
= tsubst_qualified_id (t
, args
, complain
, in_decl
,
14145 /*done=*/false, /*address_p=*/false);
14147 t
= tsubst_copy_and_build (t
, args
, complain
, in_decl
,
14148 /*function_p=*/false,
14149 /*integral_constant_expression_p=*/false);
14154 /* Sentinel to disable certain warnings during template substitution. */
14156 struct warning_sentinel
{
14159 warning_sentinel(int& flag
, bool suppress
=true)
14160 : flag(flag
), val(flag
) { if (suppress
) flag
= 0; }
14161 ~warning_sentinel() { flag
= val
; }
14164 /* Like tsubst but deals with expressions and performs semantic
14165 analysis. FUNCTION_P is true if T is the "F" in "F (ARGS)". */
14168 tsubst_copy_and_build (tree t
,
14170 tsubst_flags_t complain
,
14173 bool integral_constant_expression_p
)
14175 #define RETURN(EXP) do { retval = (EXP); goto out; } while(0)
14176 #define RECUR(NODE) \
14177 tsubst_copy_and_build (NODE, args, complain, in_decl, \
14178 /*function_p=*/false, \
14179 integral_constant_expression_p)
14184 if (t
== NULL_TREE
|| t
== error_mark_node
)
14187 loc
= input_location
;
14188 if (EXPR_HAS_LOCATION (t
))
14189 input_location
= EXPR_LOCATION (t
);
14191 /* N3276 decltype magic only applies to calls at the top level or on the
14192 right side of a comma. */
14193 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
14194 complain
&= ~tf_decltype
;
14196 switch (TREE_CODE (t
))
14200 /* Fall through. */
14201 case IDENTIFIER_NODE
:
14205 bool non_integral_constant_expression_p
;
14206 const char *error_msg
;
14208 if (IDENTIFIER_TYPENAME_P (t
))
14210 tree new_type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14211 t
= mangle_conv_op_name_for_type (new_type
);
14214 /* Look up the name. */
14215 decl
= lookup_name (t
);
14217 /* By convention, expressions use ERROR_MARK_NODE to indicate
14218 failure, not NULL_TREE. */
14219 if (decl
== NULL_TREE
)
14220 decl
= error_mark_node
;
14222 decl
= finish_id_expression (t
, decl
, NULL_TREE
,
14224 integral_constant_expression_p
,
14225 /*allow_non_integral_constant_expression_p=*/(cxx_dialect
>= cxx11
),
14226 &non_integral_constant_expression_p
,
14227 /*template_p=*/false,
14229 /*address_p=*/false,
14230 /*template_arg_p=*/false,
14235 if (!function_p
&& identifier_p (decl
))
14237 if (complain
& tf_error
)
14238 unqualified_name_lookup_error (decl
);
14239 decl
= error_mark_node
;
14244 case TEMPLATE_ID_EXPR
:
14247 tree templ
= RECUR (TREE_OPERAND (t
, 0));
14248 tree targs
= TREE_OPERAND (t
, 1);
14251 targs
= tsubst_template_args (targs
, args
, complain
, in_decl
);
14253 if (TREE_CODE (templ
) == COMPONENT_REF
)
14255 object
= TREE_OPERAND (templ
, 0);
14256 templ
= TREE_OPERAND (templ
, 1);
14259 object
= NULL_TREE
;
14260 templ
= lookup_template_function (templ
, targs
);
14263 RETURN (build3 (COMPONENT_REF
, TREE_TYPE (templ
),
14264 object
, templ
, NULL_TREE
));
14266 RETURN (baselink_for_fns (templ
));
14271 tree r
= RECUR (TREE_OPERAND (t
, 0));
14273 if (REFERENCE_REF_P (t
))
14275 /* A type conversion to reference type will be enclosed in
14276 such an indirect ref, but the substitution of the cast
14277 will have also added such an indirect ref. */
14278 if (TREE_CODE (TREE_TYPE (r
)) == REFERENCE_TYPE
)
14279 r
= convert_from_reference (r
);
14282 r
= build_x_indirect_ref (input_location
, r
, RO_UNARY_STAR
,
14283 complain
|decltype_flag
);
14289 (tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
14290 RECUR (TREE_OPERAND (t
, 0))));
14292 case IMPLICIT_CONV_EXPR
:
14294 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14295 tree expr
= RECUR (TREE_OPERAND (t
, 0));
14296 int flags
= LOOKUP_IMPLICIT
;
14297 if (IMPLICIT_CONV_EXPR_DIRECT_INIT (t
))
14298 flags
= LOOKUP_NORMAL
;
14299 RETURN (perform_implicit_conversion_flags (type
, expr
, complain
,
14306 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
),
14307 RECUR (TREE_OPERAND (t
, 0))));
14310 case REINTERPRET_CAST_EXPR
:
14311 case CONST_CAST_EXPR
:
14312 case DYNAMIC_CAST_EXPR
:
14313 case STATIC_CAST_EXPR
:
14316 tree op
, r
= NULL_TREE
;
14318 type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
14319 if (integral_constant_expression_p
14320 && !cast_valid_in_integral_constant_expression_p (type
))
14322 if (complain
& tf_error
)
14323 error ("a cast to a type other than an integral or "
14324 "enumeration type cannot appear in a constant-expression");
14325 RETURN (error_mark_node
);
14328 op
= RECUR (TREE_OPERAND (t
, 0));
14330 warning_sentinel
s(warn_useless_cast
);
14331 switch (TREE_CODE (t
))
14334 r
= build_functional_cast (type
, op
, complain
);
14336 case REINTERPRET_CAST_EXPR
:
14337 r
= build_reinterpret_cast (type
, op
, complain
);
14339 case CONST_CAST_EXPR
:
14340 r
= build_const_cast (type
, op
, complain
);
14342 case DYNAMIC_CAST_EXPR
:
14343 r
= build_dynamic_cast (type
, op
, complain
);
14345 case STATIC_CAST_EXPR
:
14346 r
= build_static_cast (type
, op
, complain
);
14349 gcc_unreachable ();
14355 case POSTDECREMENT_EXPR
:
14356 case POSTINCREMENT_EXPR
:
14357 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14358 args
, complain
, in_decl
);
14359 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
), op1
,
14360 complain
|decltype_flag
));
14362 case PREDECREMENT_EXPR
:
14363 case PREINCREMENT_EXPR
:
14367 case TRUTH_NOT_EXPR
:
14368 case UNARY_PLUS_EXPR
: /* Unary + */
14369 case REALPART_EXPR
:
14370 case IMAGPART_EXPR
:
14371 RETURN (build_x_unary_op (input_location
, TREE_CODE (t
),
14372 RECUR (TREE_OPERAND (t
, 0)),
14373 complain
|decltype_flag
));
14375 case FIX_TRUNC_EXPR
:
14376 RETURN (cp_build_unary_op (FIX_TRUNC_EXPR
, RECUR (TREE_OPERAND (t
, 0)),
14380 op1
= TREE_OPERAND (t
, 0);
14381 if (TREE_CODE (op1
) == LABEL_DECL
)
14382 RETURN (finish_label_address_expr (DECL_NAME (op1
),
14383 EXPR_LOCATION (op1
)));
14384 if (TREE_CODE (op1
) == SCOPE_REF
)
14385 op1
= tsubst_qualified_id (op1
, args
, complain
, in_decl
,
14386 /*done=*/true, /*address_p=*/true);
14388 op1
= tsubst_non_call_postfix_expression (op1
, args
, complain
,
14390 RETURN (build_x_unary_op (input_location
, ADDR_EXPR
, op1
,
14391 complain
|decltype_flag
));
14396 case TRUNC_DIV_EXPR
:
14397 case CEIL_DIV_EXPR
:
14398 case FLOOR_DIV_EXPR
:
14399 case ROUND_DIV_EXPR
:
14400 case EXACT_DIV_EXPR
:
14404 case TRUNC_MOD_EXPR
:
14405 case FLOOR_MOD_EXPR
:
14406 case TRUTH_ANDIF_EXPR
:
14407 case TRUTH_ORIF_EXPR
:
14408 case TRUTH_AND_EXPR
:
14409 case TRUTH_OR_EXPR
:
14425 warning_sentinel
s1(warn_type_limits
);
14426 warning_sentinel
s2(warn_div_by_zero
);
14427 tree r
= build_x_binary_op
14428 (input_location
, TREE_CODE (t
),
14429 RECUR (TREE_OPERAND (t
, 0)),
14430 (TREE_NO_WARNING (TREE_OPERAND (t
, 0))
14432 : TREE_CODE (TREE_OPERAND (t
, 0))),
14433 RECUR (TREE_OPERAND (t
, 1)),
14434 (TREE_NO_WARNING (TREE_OPERAND (t
, 1))
14436 : TREE_CODE (TREE_OPERAND (t
, 1))),
14438 complain
|decltype_flag
);
14439 if (EXPR_P (r
) && TREE_NO_WARNING (t
))
14440 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14445 case POINTER_PLUS_EXPR
:
14446 return fold_build_pointer_plus (RECUR (TREE_OPERAND (t
, 0)),
14447 RECUR (TREE_OPERAND (t
, 1)));
14450 RETURN (tsubst_qualified_id (t
, args
, complain
, in_decl
, /*done=*/true,
14451 /*address_p=*/false));
14453 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14454 args
, complain
, in_decl
);
14455 RETURN (build_x_array_ref (EXPR_LOCATION (t
), op1
,
14456 RECUR (TREE_OPERAND (t
, 1)),
14457 complain
|decltype_flag
));
14459 case ARRAY_NOTATION_REF
:
14461 tree start_index
, length
, stride
;
14462 op1
= tsubst_non_call_postfix_expression (ARRAY_NOTATION_ARRAY (t
),
14463 args
, complain
, in_decl
);
14464 start_index
= RECUR (ARRAY_NOTATION_START (t
));
14465 length
= RECUR (ARRAY_NOTATION_LENGTH (t
));
14466 stride
= RECUR (ARRAY_NOTATION_STRIDE (t
));
14467 RETURN (build_array_notation_ref (EXPR_LOCATION (t
), op1
, start_index
,
14468 length
, stride
, TREE_TYPE (op1
)));
14471 if (PACK_EXPANSION_P (TREE_OPERAND (t
, 0)))
14472 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
14479 op1
= TREE_OPERAND (t
, 0);
14480 if (TREE_CODE (t
) == SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (t
))
14481 op1
= TREE_TYPE (op1
);
14484 /* When there are no ARGS, we are trying to evaluate a
14485 non-dependent expression from the parser. Trying to do
14486 the substitutions may not work. */
14488 op1
= TREE_TYPE (op1
);
14492 ++cp_unevaluated_operand
;
14493 ++c_inhibit_evaluation_warnings
;
14495 op1
= tsubst (op1
, args
, complain
, in_decl
);
14497 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14498 /*function_p=*/false,
14499 /*integral_constant_expression_p=*/
14501 --cp_unevaluated_operand
;
14502 --c_inhibit_evaluation_warnings
;
14505 r
= cxx_sizeof_or_alignof_type (op1
, TREE_CODE (t
),
14506 complain
& tf_error
);
14508 r
= cxx_sizeof_or_alignof_expr (op1
, TREE_CODE (t
),
14509 complain
& tf_error
);
14510 if (TREE_CODE (t
) == SIZEOF_EXPR
&& r
!= error_mark_node
)
14512 if (TREE_CODE (r
) != SIZEOF_EXPR
|| TYPE_P (op1
))
14514 if (!processing_template_decl
&& TYPE_P (op1
))
14516 r
= build_min (SIZEOF_EXPR
, size_type_node
,
14517 build1 (NOP_EXPR
, op1
, error_mark_node
));
14518 SIZEOF_EXPR_TYPE_P (r
) = 1;
14521 r
= build_min (SIZEOF_EXPR
, size_type_node
, op1
);
14522 TREE_SIDE_EFFECTS (r
) = 0;
14523 TREE_READONLY (r
) = 1;
14525 SET_EXPR_LOCATION (r
, EXPR_LOCATION (t
));
14530 case AT_ENCODE_EXPR
:
14532 op1
= TREE_OPERAND (t
, 0);
14533 ++cp_unevaluated_operand
;
14534 ++c_inhibit_evaluation_warnings
;
14535 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14536 /*function_p=*/false,
14537 /*integral_constant_expression_p=*/false);
14538 --cp_unevaluated_operand
;
14539 --c_inhibit_evaluation_warnings
;
14540 RETURN (objc_build_encode_expr (op1
));
14543 case NOEXCEPT_EXPR
:
14544 op1
= TREE_OPERAND (t
, 0);
14545 ++cp_unevaluated_operand
;
14546 ++c_inhibit_evaluation_warnings
;
14547 op1
= tsubst_copy_and_build (op1
, args
, complain
, in_decl
,
14548 /*function_p=*/false,
14549 /*integral_constant_expression_p=*/false);
14550 --cp_unevaluated_operand
;
14551 --c_inhibit_evaluation_warnings
;
14552 RETURN (finish_noexcept_expr (op1
, complain
));
14556 warning_sentinel
s(warn_div_by_zero
);
14557 tree r
= build_x_modify_expr
14558 (EXPR_LOCATION (t
),
14559 RECUR (TREE_OPERAND (t
, 0)),
14560 TREE_CODE (TREE_OPERAND (t
, 1)),
14561 RECUR (TREE_OPERAND (t
, 2)),
14562 complain
|decltype_flag
);
14563 /* TREE_NO_WARNING must be set if either the expression was
14564 parenthesized or it uses an operator such as >>= rather
14565 than plain assignment. In the former case, it was already
14566 set and must be copied. In the latter case,
14567 build_x_modify_expr sets it and it must not be reset
14569 if (TREE_NO_WARNING (t
))
14570 TREE_NO_WARNING (r
) = TREE_NO_WARNING (t
);
14576 op1
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
14577 args
, complain
, in_decl
);
14578 /* Remember that there was a reference to this entity. */
14581 RETURN (build_x_arrow (input_location
, op1
, complain
));
14585 tree placement
= RECUR (TREE_OPERAND (t
, 0));
14586 tree init
= RECUR (TREE_OPERAND (t
, 3));
14587 vec
<tree
, va_gc
> *placement_vec
;
14588 vec
<tree
, va_gc
> *init_vec
;
14591 if (placement
== NULL_TREE
)
14592 placement_vec
= NULL
;
14595 placement_vec
= make_tree_vector ();
14596 for (; placement
!= NULL_TREE
; placement
= TREE_CHAIN (placement
))
14597 vec_safe_push (placement_vec
, TREE_VALUE (placement
));
14600 /* If there was an initializer in the original tree, but it
14601 instantiated to an empty list, then we should pass a
14602 non-NULL empty vector to tell build_new that it was an
14603 empty initializer() rather than no initializer. This can
14604 only happen when the initializer is a pack expansion whose
14605 parameter packs are of length zero. */
14606 if (init
== NULL_TREE
&& TREE_OPERAND (t
, 3) == NULL_TREE
)
14610 init_vec
= make_tree_vector ();
14611 if (init
== void_zero_node
)
14612 gcc_assert (init_vec
!= NULL
);
14615 for (; init
!= NULL_TREE
; init
= TREE_CHAIN (init
))
14616 vec_safe_push (init_vec
, TREE_VALUE (init
));
14620 ret
= build_new (&placement_vec
,
14621 tsubst (TREE_OPERAND (t
, 1), args
, complain
, in_decl
),
14622 RECUR (TREE_OPERAND (t
, 2)),
14624 NEW_EXPR_USE_GLOBAL (t
),
14627 if (placement_vec
!= NULL
)
14628 release_tree_vector (placement_vec
);
14629 if (init_vec
!= NULL
)
14630 release_tree_vector (init_vec
);
14636 RETURN (delete_sanity
14637 (RECUR (TREE_OPERAND (t
, 0)),
14638 RECUR (TREE_OPERAND (t
, 1)),
14639 DELETE_EXPR_USE_VEC (t
),
14640 DELETE_EXPR_USE_GLOBAL (t
),
14643 case COMPOUND_EXPR
:
14645 tree op0
= tsubst_copy_and_build (TREE_OPERAND (t
, 0), args
,
14646 complain
& ~tf_decltype
, in_decl
,
14647 /*function_p=*/false,
14648 integral_constant_expression_p
);
14649 RETURN (build_x_compound_expr (EXPR_LOCATION (t
),
14651 RECUR (TREE_OPERAND (t
, 1)),
14652 complain
|decltype_flag
));
14658 vec
<tree
, va_gc
> *call_args
;
14659 unsigned int nargs
, i
;
14664 function
= CALL_EXPR_FN (t
);
14665 /* When we parsed the expression, we determined whether or
14666 not Koenig lookup should be performed. */
14667 koenig_p
= KOENIG_LOOKUP_P (t
);
14668 if (TREE_CODE (function
) == SCOPE_REF
)
14670 qualified_p
= true;
14671 function
= tsubst_qualified_id (function
, args
, complain
, in_decl
,
14673 /*address_p=*/false);
14675 else if (koenig_p
&& identifier_p (function
))
14677 /* Do nothing; calling tsubst_copy_and_build on an identifier
14678 would incorrectly perform unqualified lookup again.
14680 Note that we can also have an IDENTIFIER_NODE if the earlier
14681 unqualified lookup found a member function; in that case
14682 koenig_p will be false and we do want to do the lookup
14683 again to find the instantiated member function.
14685 FIXME but doing that causes c++/15272, so we need to stop
14686 using IDENTIFIER_NODE in that situation. */
14687 qualified_p
= false;
14691 if (TREE_CODE (function
) == COMPONENT_REF
)
14693 tree op
= TREE_OPERAND (function
, 1);
14695 qualified_p
= (TREE_CODE (op
) == SCOPE_REF
14696 || (BASELINK_P (op
)
14697 && BASELINK_QUALIFIED_P (op
)));
14700 qualified_p
= false;
14702 if (TREE_CODE (function
) == ADDR_EXPR
14703 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
14704 /* Avoid error about taking the address of a constructor. */
14705 function
= TREE_OPERAND (function
, 0);
14707 function
= tsubst_copy_and_build (function
, args
, complain
,
14710 integral_constant_expression_p
);
14712 if (BASELINK_P (function
))
14713 qualified_p
= true;
14716 nargs
= call_expr_nargs (t
);
14717 call_args
= make_tree_vector ();
14718 for (i
= 0; i
< nargs
; ++i
)
14720 tree arg
= CALL_EXPR_ARG (t
, i
);
14722 if (!PACK_EXPANSION_P (arg
))
14723 vec_safe_push (call_args
, RECUR (CALL_EXPR_ARG (t
, i
)));
14726 /* Expand the pack expansion and push each entry onto
14728 arg
= tsubst_pack_expansion (arg
, args
, complain
, in_decl
);
14729 if (TREE_CODE (arg
) == TREE_VEC
)
14731 unsigned int len
, j
;
14733 len
= TREE_VEC_LENGTH (arg
);
14734 for (j
= 0; j
< len
; ++j
)
14736 tree value
= TREE_VEC_ELT (arg
, j
);
14737 if (value
!= NULL_TREE
)
14738 value
= convert_from_reference (value
);
14739 vec_safe_push (call_args
, value
);
14744 /* A partial substitution. Add one entry. */
14745 vec_safe_push (call_args
, arg
);
14750 /* We do not perform argument-dependent lookup if normal
14751 lookup finds a non-function, in accordance with the
14752 expected resolution of DR 218. */
14754 && ((is_overloaded_fn (function
)
14755 /* If lookup found a member function, the Koenig lookup is
14756 not appropriate, even if an unqualified-name was used
14757 to denote the function. */
14758 && !DECL_FUNCTION_MEMBER_P (get_first_fn (function
)))
14759 || identifier_p (function
))
14760 /* Only do this when substitution turns a dependent call
14761 into a non-dependent call. */
14762 && type_dependent_expression_p_push (t
)
14763 && !any_type_dependent_arguments_p (call_args
))
14764 function
= perform_koenig_lookup (function
, call_args
, tf_none
);
14766 if (identifier_p (function
)
14767 && !any_type_dependent_arguments_p (call_args
))
14769 if (koenig_p
&& (complain
& tf_warning_or_error
))
14771 /* For backwards compatibility and good diagnostics, try
14772 the unqualified lookup again if we aren't in SFINAE
14774 tree unq
= (tsubst_copy_and_build
14775 (function
, args
, complain
, in_decl
, true,
14776 integral_constant_expression_p
));
14777 if (unq
== error_mark_node
)
14778 RETURN (error_mark_node
);
14780 if (unq
!= function
)
14783 if (INDIRECT_REF_P (fn
))
14784 fn
= TREE_OPERAND (fn
, 0);
14785 if (TREE_CODE (fn
) == COMPONENT_REF
)
14786 fn
= TREE_OPERAND (fn
, 1);
14787 if (is_overloaded_fn (fn
))
14788 fn
= get_first_fn (fn
);
14789 if (permerror (EXPR_LOC_OR_LOC (t
, input_location
),
14790 "%qD was not declared in this scope, "
14791 "and no declarations were found by "
14792 "argument-dependent lookup at the point "
14793 "of instantiation", function
))
14796 /* Can't say anything more. */;
14797 else if (DECL_CLASS_SCOPE_P (fn
))
14799 location_t loc
= EXPR_LOC_OR_LOC (t
,
14802 "declarations in dependent base %qT are "
14803 "not found by unqualified lookup",
14804 DECL_CLASS_CONTEXT (fn
));
14805 if (current_class_ptr
)
14807 "use %<this->%D%> instead", function
);
14810 "use %<%T::%D%> instead",
14811 current_class_name
, function
);
14814 inform (0, "%q+D declared here, later in the "
14815 "translation unit", fn
);
14820 if (identifier_p (function
))
14822 if (complain
& tf_error
)
14823 unqualified_name_lookup_error (function
);
14824 release_tree_vector (call_args
);
14825 RETURN (error_mark_node
);
14829 /* Remember that there was a reference to this entity. */
14830 if (DECL_P (function
))
14831 mark_used (function
);
14833 /* Put back tf_decltype for the actual call. */
14834 complain
|= decltype_flag
;
14836 if (TREE_CODE (function
) == OFFSET_REF
)
14837 ret
= build_offset_ref_call_from_tree (function
, &call_args
,
14839 else if (TREE_CODE (function
) == COMPONENT_REF
)
14841 tree instance
= TREE_OPERAND (function
, 0);
14842 tree fn
= TREE_OPERAND (function
, 1);
14844 if (processing_template_decl
14845 && (type_dependent_expression_p (instance
)
14846 || (!BASELINK_P (fn
)
14847 && TREE_CODE (fn
) != FIELD_DECL
)
14848 || type_dependent_expression_p (fn
)
14849 || any_type_dependent_arguments_p (call_args
)))
14850 ret
= build_nt_call_vec (function
, call_args
);
14851 else if (!BASELINK_P (fn
))
14852 ret
= finish_call_expr (function
, &call_args
,
14853 /*disallow_virtual=*/false,
14854 /*koenig_p=*/false,
14857 ret
= (build_new_method_call
14859 &call_args
, NULL_TREE
,
14860 qualified_p
? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
,
14865 ret
= finish_call_expr (function
, &call_args
,
14866 /*disallow_virtual=*/qualified_p
,
14870 release_tree_vector (call_args
);
14877 tree cond
= RECUR (TREE_OPERAND (t
, 0));
14878 tree folded_cond
= (maybe_constant_value
14879 (fold_non_dependent_expr_sfinae (cond
, tf_none
)));
14882 if (TREE_CODE (folded_cond
) == INTEGER_CST
)
14884 if (integer_zerop (folded_cond
))
14886 ++c_inhibit_evaluation_warnings
;
14887 exp1
= RECUR (TREE_OPERAND (t
, 1));
14888 --c_inhibit_evaluation_warnings
;
14889 exp2
= RECUR (TREE_OPERAND (t
, 2));
14893 exp1
= RECUR (TREE_OPERAND (t
, 1));
14894 ++c_inhibit_evaluation_warnings
;
14895 exp2
= RECUR (TREE_OPERAND (t
, 2));
14896 --c_inhibit_evaluation_warnings
;
14898 cond
= folded_cond
;
14902 exp1
= RECUR (TREE_OPERAND (t
, 1));
14903 exp2
= RECUR (TREE_OPERAND (t
, 2));
14906 RETURN (build_x_conditional_expr (EXPR_LOCATION (t
),
14907 cond
, exp1
, exp2
, complain
));
14910 case PSEUDO_DTOR_EXPR
:
14911 RETURN (finish_pseudo_destructor_expr
14912 (RECUR (TREE_OPERAND (t
, 0)),
14913 RECUR (TREE_OPERAND (t
, 1)),
14914 tsubst (TREE_OPERAND (t
, 2), args
, complain
, in_decl
),
14919 tree purpose
, value
, chain
;
14921 if (t
== void_list_node
)
14924 if ((TREE_PURPOSE (t
) && PACK_EXPANSION_P (TREE_PURPOSE (t
)))
14925 || (TREE_VALUE (t
) && PACK_EXPANSION_P (TREE_VALUE (t
))))
14927 /* We have pack expansions, so expand those and
14928 create a new list out of it. */
14929 tree purposevec
= NULL_TREE
;
14930 tree valuevec
= NULL_TREE
;
14934 /* Expand the argument expressions. */
14935 if (TREE_PURPOSE (t
))
14936 purposevec
= tsubst_pack_expansion (TREE_PURPOSE (t
), args
,
14937 complain
, in_decl
);
14938 if (TREE_VALUE (t
))
14939 valuevec
= tsubst_pack_expansion (TREE_VALUE (t
), args
,
14940 complain
, in_decl
);
14942 /* Build the rest of the list. */
14943 chain
= TREE_CHAIN (t
);
14944 if (chain
&& chain
!= void_type_node
)
14945 chain
= RECUR (chain
);
14947 /* Determine the number of arguments. */
14948 if (purposevec
&& TREE_CODE (purposevec
) == TREE_VEC
)
14950 len
= TREE_VEC_LENGTH (purposevec
);
14951 gcc_assert (!valuevec
|| len
== TREE_VEC_LENGTH (valuevec
));
14953 else if (TREE_CODE (valuevec
) == TREE_VEC
)
14954 len
= TREE_VEC_LENGTH (valuevec
);
14957 /* Since we only performed a partial substitution into
14958 the argument pack, we only RETURN (a single list
14960 if (purposevec
== TREE_PURPOSE (t
)
14961 && valuevec
== TREE_VALUE (t
)
14962 && chain
== TREE_CHAIN (t
))
14965 RETURN (tree_cons (purposevec
, valuevec
, chain
));
14968 /* Convert the argument vectors into a TREE_LIST */
14972 /* Grab the Ith values. */
14974 purpose
= purposevec
? TREE_VEC_ELT (purposevec
, i
)
14977 = valuevec
? convert_from_reference (TREE_VEC_ELT (valuevec
, i
))
14980 /* Build the list (backwards). */
14981 chain
= tree_cons (purpose
, value
, chain
);
14987 purpose
= TREE_PURPOSE (t
);
14989 purpose
= RECUR (purpose
);
14990 value
= TREE_VALUE (t
);
14992 value
= RECUR (value
);
14993 chain
= TREE_CHAIN (t
);
14994 if (chain
&& chain
!= void_type_node
)
14995 chain
= RECUR (chain
);
14996 if (purpose
== TREE_PURPOSE (t
)
14997 && value
== TREE_VALUE (t
)
14998 && chain
== TREE_CHAIN (t
))
15000 RETURN (tree_cons (purpose
, value
, chain
));
15003 case COMPONENT_REF
:
15010 object
= tsubst_non_call_postfix_expression (TREE_OPERAND (t
, 0),
15011 args
, complain
, in_decl
);
15012 /* Remember that there was a reference to this entity. */
15013 if (DECL_P (object
))
15014 mark_used (object
);
15015 object_type
= TREE_TYPE (object
);
15017 member
= TREE_OPERAND (t
, 1);
15018 if (BASELINK_P (member
))
15019 member
= tsubst_baselink (member
,
15020 non_reference (TREE_TYPE (object
)),
15021 args
, complain
, in_decl
);
15023 member
= tsubst_copy (member
, args
, complain
, in_decl
);
15024 if (member
== error_mark_node
)
15025 RETURN (error_mark_node
);
15027 if (type_dependent_expression_p (object
))
15028 /* We can't do much here. */;
15029 else if (!CLASS_TYPE_P (object_type
))
15031 if (scalarish_type_p (object_type
))
15033 tree s
= NULL_TREE
;
15034 tree dtor
= member
;
15036 if (TREE_CODE (dtor
) == SCOPE_REF
)
15038 s
= TREE_OPERAND (dtor
, 0);
15039 dtor
= TREE_OPERAND (dtor
, 1);
15041 if (TREE_CODE (dtor
) == BIT_NOT_EXPR
)
15043 dtor
= TREE_OPERAND (dtor
, 0);
15045 RETURN (finish_pseudo_destructor_expr
15046 (object
, s
, dtor
, input_location
));
15050 else if (TREE_CODE (member
) == SCOPE_REF
15051 && TREE_CODE (TREE_OPERAND (member
, 1)) == TEMPLATE_ID_EXPR
)
15053 /* Lookup the template functions now that we know what the
15055 tree scope
= TREE_OPERAND (member
, 0);
15056 tree tmpl
= TREE_OPERAND (TREE_OPERAND (member
, 1), 0);
15057 tree args
= TREE_OPERAND (TREE_OPERAND (member
, 1), 1);
15058 member
= lookup_qualified_name (scope
, tmpl
,
15059 /*is_type_p=*/false,
15060 /*complain=*/false);
15061 if (BASELINK_P (member
))
15063 BASELINK_FUNCTIONS (member
)
15064 = build_nt (TEMPLATE_ID_EXPR
, BASELINK_FUNCTIONS (member
),
15066 member
= (adjust_result_of_qualified_name_lookup
15067 (member
, BINFO_TYPE (BASELINK_BINFO (member
)),
15072 qualified_name_lookup_error (scope
, tmpl
, member
,
15074 RETURN (error_mark_node
);
15077 else if (TREE_CODE (member
) == SCOPE_REF
15078 && !CLASS_TYPE_P (TREE_OPERAND (member
, 0))
15079 && TREE_CODE (TREE_OPERAND (member
, 0)) != NAMESPACE_DECL
)
15081 if (complain
& tf_error
)
15083 if (TYPE_P (TREE_OPERAND (member
, 0)))
15084 error ("%qT is not a class or namespace",
15085 TREE_OPERAND (member
, 0));
15087 error ("%qD is not a class or namespace",
15088 TREE_OPERAND (member
, 0));
15090 RETURN (error_mark_node
);
15092 else if (TREE_CODE (member
) == FIELD_DECL
)
15094 r
= finish_non_static_data_member (member
, object
, NULL_TREE
);
15095 if (TREE_CODE (r
) == COMPONENT_REF
)
15096 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15100 r
= finish_class_member_access_expr (object
, member
,
15101 /*template_p=*/false,
15103 if (TREE_CODE (r
) == COMPONENT_REF
)
15104 REF_PARENTHESIZED_P (r
) = REF_PARENTHESIZED_P (t
);
15109 RETURN (build_throw
15110 (RECUR (TREE_OPERAND (t
, 0))));
15114 vec
<constructor_elt
, va_gc
> *n
;
15115 constructor_elt
*ce
;
15116 unsigned HOST_WIDE_INT idx
;
15117 tree type
= tsubst (TREE_TYPE (t
), args
, complain
, in_decl
);
15118 bool process_index_p
;
15120 bool need_copy_p
= false;
15123 if (type
== error_mark_node
)
15124 RETURN (error_mark_node
);
15126 /* digest_init will do the wrong thing if we let it. */
15127 if (type
&& TYPE_PTRMEMFUNC_P (type
))
15130 /* We do not want to process the index of aggregate
15131 initializers as they are identifier nodes which will be
15132 looked up by digest_init. */
15133 process_index_p
= !(type
&& MAYBE_CLASS_TYPE_P (type
));
15135 n
= vec_safe_copy (CONSTRUCTOR_ELTS (t
));
15136 newlen
= vec_safe_length (n
);
15137 FOR_EACH_VEC_SAFE_ELT (n
, idx
, ce
)
15139 if (ce
->index
&& process_index_p
15140 /* An identifier index is looked up in the type
15141 being initialized, not the current scope. */
15142 && TREE_CODE (ce
->index
) != IDENTIFIER_NODE
)
15143 ce
->index
= RECUR (ce
->index
);
15145 if (PACK_EXPANSION_P (ce
->value
))
15147 /* Substitute into the pack expansion. */
15148 ce
->value
= tsubst_pack_expansion (ce
->value
, args
, complain
,
15151 if (ce
->value
== error_mark_node
15152 || PACK_EXPANSION_P (ce
->value
))
15154 else if (TREE_VEC_LENGTH (ce
->value
) == 1)
15155 /* Just move the argument into place. */
15156 ce
->value
= TREE_VEC_ELT (ce
->value
, 0);
15159 /* Update the length of the final CONSTRUCTOR
15160 arguments vector, and note that we will need to
15162 newlen
= newlen
+ TREE_VEC_LENGTH (ce
->value
) - 1;
15163 need_copy_p
= true;
15167 ce
->value
= RECUR (ce
->value
);
15172 vec
<constructor_elt
, va_gc
> *old_n
= n
;
15174 vec_alloc (n
, newlen
);
15175 FOR_EACH_VEC_ELT (*old_n
, idx
, ce
)
15177 if (TREE_CODE (ce
->value
) == TREE_VEC
)
15179 int i
, len
= TREE_VEC_LENGTH (ce
->value
);
15180 for (i
= 0; i
< len
; ++i
)
15181 CONSTRUCTOR_APPEND_ELT (n
, 0,
15182 TREE_VEC_ELT (ce
->value
, i
));
15185 CONSTRUCTOR_APPEND_ELT (n
, 0, ce
->value
);
15189 r
= build_constructor (init_list_type_node
, n
);
15190 CONSTRUCTOR_IS_DIRECT_INIT (r
) = CONSTRUCTOR_IS_DIRECT_INIT (t
);
15192 if (TREE_HAS_CONSTRUCTOR (t
))
15193 RETURN (finish_compound_literal (type
, r
, complain
));
15195 TREE_TYPE (r
) = type
;
15201 tree operand_0
= TREE_OPERAND (t
, 0);
15202 if (TYPE_P (operand_0
))
15204 operand_0
= tsubst (operand_0
, args
, complain
, in_decl
);
15205 RETURN (get_typeid (operand_0
, complain
));
15209 operand_0
= RECUR (operand_0
);
15210 RETURN (build_typeid (operand_0
, complain
));
15217 else if (DECL_PACK_P (t
))
15219 /* We don't build decls for an instantiation of a
15220 variadic capture proxy, we instantiate the elements
15222 gcc_assert (DECL_HAS_VALUE_EXPR_P (t
));
15223 return RECUR (DECL_VALUE_EXPR (t
));
15229 tree r
= tsubst_copy (t
, args
, complain
, in_decl
);
15230 if (TREE_CODE (r
) == VAR_DECL
15231 && !processing_template_decl
15232 && !cp_unevaluated_operand
15233 && DECL_THREAD_LOCAL_P (r
))
15235 if (tree wrap
= get_tls_wrapper_fn (r
))
15236 /* Replace an evaluated use of the thread_local variable with
15237 a call to its wrapper. */
15238 r
= build_cxx_call (wrap
, 0, NULL
, tf_warning_or_error
);
15241 if (TREE_CODE (TREE_TYPE (t
)) != REFERENCE_TYPE
)
15242 /* If the original type was a reference, we'll be wrapped in
15243 the appropriate INDIRECT_REF. */
15244 r
= convert_from_reference (r
);
15249 RETURN (build_x_va_arg (EXPR_LOCATION (t
),
15250 RECUR (TREE_OPERAND (t
, 0)),
15251 tsubst (TREE_TYPE (t
), args
, complain
, in_decl
)));
15253 case OFFSETOF_EXPR
:
15254 RETURN (finish_offsetof (RECUR (TREE_OPERAND (t
, 0))));
15258 tree type1
= tsubst (TRAIT_EXPR_TYPE1 (t
), args
,
15259 complain
, in_decl
);
15261 tree type2
= TRAIT_EXPR_TYPE2 (t
);
15263 type2
= tsubst (type2
, args
, complain
, in_decl
);
15265 RETURN (finish_trait_expr (TRAIT_EXPR_KIND (t
), type1
, type2
));
15270 tree old_stmt_expr
= cur_stmt_expr
;
15271 tree stmt_expr
= begin_stmt_expr ();
15273 cur_stmt_expr
= stmt_expr
;
15274 tsubst_expr (STMT_EXPR_STMT (t
), args
, complain
, in_decl
,
15275 integral_constant_expression_p
);
15276 stmt_expr
= finish_stmt_expr (stmt_expr
, false);
15277 cur_stmt_expr
= old_stmt_expr
;
15279 /* If the resulting list of expression statement is empty,
15280 fold it further into void_zero_node. */
15281 if (empty_expr_stmt_p (stmt_expr
))
15282 stmt_expr
= void_zero_node
;
15284 RETURN (stmt_expr
);
15289 tree r
= build_lambda_expr ();
15291 tree type
= tsubst (LAMBDA_EXPR_CLOSURE (t
), args
, complain
, NULL_TREE
);
15292 LAMBDA_EXPR_CLOSURE (r
) = type
;
15293 CLASSTYPE_LAMBDA_EXPR (type
) = r
;
15295 LAMBDA_EXPR_LOCATION (r
)
15296 = LAMBDA_EXPR_LOCATION (t
);
15297 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (r
)
15298 = LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (t
);
15299 LAMBDA_EXPR_MUTABLE_P (r
) = LAMBDA_EXPR_MUTABLE_P (t
);
15300 LAMBDA_EXPR_DISCRIMINATOR (r
)
15301 = (LAMBDA_EXPR_DISCRIMINATOR (t
));
15302 /* For a function scope, we want to use tsubst so that we don't
15303 complain about referring to an auto function before its return
15304 type has been deduced. Otherwise, we want to use tsubst_copy so
15305 that we look up the existing field/parameter/variable rather
15306 than build a new one. */
15307 tree scope
= LAMBDA_EXPR_EXTRA_SCOPE (t
);
15308 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
15309 scope
= tsubst (scope
, args
, complain
, in_decl
);
15310 else if (scope
&& TREE_CODE (scope
) == PARM_DECL
)
15312 /* Look up the parameter we want directly, as tsubst_copy
15313 doesn't do what we need. */
15314 tree fn
= tsubst (DECL_CONTEXT (scope
), args
, complain
, in_decl
);
15315 tree parm
= FUNCTION_FIRST_USER_PARM (fn
);
15316 while (DECL_PARM_INDEX (parm
) != DECL_PARM_INDEX (scope
))
15317 parm
= DECL_CHAIN (parm
);
15319 /* FIXME Work around the parm not having DECL_CONTEXT set. */
15320 if (DECL_CONTEXT (scope
) == NULL_TREE
)
15321 DECL_CONTEXT (scope
) = fn
;
15324 scope
= RECUR (scope
);
15325 LAMBDA_EXPR_EXTRA_SCOPE (r
) = scope
;
15326 LAMBDA_EXPR_RETURN_TYPE (r
)
15327 = tsubst (LAMBDA_EXPR_RETURN_TYPE (t
), args
, complain
, in_decl
);
15329 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (t
) == NULL_TREE
15330 && LAMBDA_EXPR_PENDING_PROXIES (t
) == NULL
);
15332 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
15333 determine_visibility (TYPE_NAME (type
));
15334 /* Now that we know visibility, instantiate the type so we have a
15335 declaration of the op() for later calls to lambda_function. */
15336 complete_type (type
);
15338 LAMBDA_EXPR_THIS_CAPTURE (r
) = NULL_TREE
;
15340 RETURN (build_lambda_object (r
));
15344 /* We can get here for a constant initializer of non-dependent type.
15345 FIXME stop folding in cp_parser_initializer_clause. */
15347 tree r
= get_target_expr_sfinae (RECUR (TARGET_EXPR_INITIAL (t
)),
15352 case TRANSACTION_EXPR
:
15353 RETURN (tsubst_expr(t
, args
, complain
, in_decl
,
15354 integral_constant_expression_p
));
15357 RETURN (finish_parenthesized_expr (RECUR (TREE_OPERAND (t
, 0))));
15359 case VEC_PERM_EXPR
:
15360 RETURN (build_x_vec_perm_expr (input_location
,
15361 RECUR (TREE_OPERAND (t
, 0)),
15362 RECUR (TREE_OPERAND (t
, 1)),
15363 RECUR (TREE_OPERAND (t
, 2)),
15367 /* Handle Objective-C++ constructs, if appropriate. */
15370 = objcp_tsubst_copy_and_build (t
, args
, complain
,
15371 in_decl
, /*function_p=*/false);
15375 RETURN (tsubst_copy (t
, args
, complain
, in_decl
));
15381 input_location
= loc
;
15385 /* Verify that the instantiated ARGS are valid. For type arguments,
15386 make sure that the type's linkage is ok. For non-type arguments,
15387 make sure they are constants if they are integral or enumerations.
15388 Emit an error under control of COMPLAIN, and return TRUE on error. */
15391 check_instantiated_arg (tree tmpl
, tree t
, tsubst_flags_t complain
)
15393 if (dependent_template_arg_p (t
))
15395 if (ARGUMENT_PACK_P (t
))
15397 tree vec
= ARGUMENT_PACK_ARGS (t
);
15398 int len
= TREE_VEC_LENGTH (vec
);
15399 bool result
= false;
15402 for (i
= 0; i
< len
; ++i
)
15403 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (vec
, i
), complain
))
15407 else if (TYPE_P (t
))
15409 /* [basic.link]: A name with no linkage (notably, the name
15410 of a class or enumeration declared in a local scope)
15411 shall not be used to declare an entity with linkage.
15412 This implies that names with no linkage cannot be used as
15415 DR 757 relaxes this restriction for C++0x. */
15416 tree nt
= (cxx_dialect
> cxx98
? NULL_TREE
15417 : no_linkage_check (t
, /*relaxed_p=*/false));
15421 /* DR 488 makes use of a type with no linkage cause
15422 type deduction to fail. */
15423 if (complain
& tf_error
)
15425 if (TYPE_ANONYMOUS_P (nt
))
15426 error ("%qT is/uses anonymous type", t
);
15428 error ("template argument for %qD uses local type %qT",
15433 /* In order to avoid all sorts of complications, we do not
15434 allow variably-modified types as template arguments. */
15435 else if (variably_modified_type_p (t
, NULL_TREE
))
15437 if (complain
& tf_error
)
15438 error ("%qT is a variably modified type", t
);
15442 /* Class template and alias template arguments should be OK. */
15443 else if (DECL_TYPE_TEMPLATE_P (t
))
15445 /* A non-type argument of integral or enumerated type must be a
15447 else if (TREE_TYPE (t
)
15448 && INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t
))
15449 && !TREE_CONSTANT (t
))
15451 if (complain
& tf_error
)
15452 error ("integral expression %qE is not constant", t
);
15459 check_instantiated_args (tree tmpl
, tree args
, tsubst_flags_t complain
)
15461 int ix
, len
= DECL_NTPARMS (tmpl
);
15462 bool result
= false;
15464 for (ix
= 0; ix
!= len
; ix
++)
15466 if (check_instantiated_arg (tmpl
, TREE_VEC_ELT (args
, ix
), complain
))
15469 if (result
&& (complain
& tf_error
))
15470 error (" trying to instantiate %qD", tmpl
);
15474 /* We're out of SFINAE context now, so generate diagnostics for the access
15475 errors we saw earlier when instantiating D from TMPL and ARGS. */
15478 recheck_decl_substitution (tree d
, tree tmpl
, tree args
)
15480 tree pattern
= DECL_TEMPLATE_RESULT (tmpl
);
15481 tree type
= TREE_TYPE (pattern
);
15482 location_t loc
= input_location
;
15484 push_access_scope (d
);
15485 push_deferring_access_checks (dk_no_deferred
);
15486 input_location
= DECL_SOURCE_LOCATION (pattern
);
15487 tsubst (type
, args
, tf_warning_or_error
, d
);
15488 input_location
= loc
;
15489 pop_deferring_access_checks ();
15490 pop_access_scope (d
);
15493 /* Instantiate the indicated variable, function, or alias template TMPL with
15494 the template arguments in TARG_PTR. */
15497 instantiate_template_1 (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15499 tree targ_ptr
= orig_args
;
15503 bool access_ok
= true;
15505 if (tmpl
== error_mark_node
)
15506 return error_mark_node
;
15508 gcc_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
);
15510 /* If this function is a clone, handle it specially. */
15511 if (DECL_CLONED_FUNCTION_P (tmpl
))
15516 /* Use DECL_ABSTRACT_ORIGIN because only FUNCTION_DECLs have
15517 DECL_CLONED_FUNCTION. */
15518 spec
= instantiate_template (DECL_ABSTRACT_ORIGIN (tmpl
),
15519 targ_ptr
, complain
);
15520 if (spec
== error_mark_node
)
15521 return error_mark_node
;
15523 /* Look for the clone. */
15524 FOR_EACH_CLONE (clone
, spec
)
15525 if (DECL_NAME (clone
) == DECL_NAME (tmpl
))
15527 /* We should always have found the clone by now. */
15528 gcc_unreachable ();
15532 if (targ_ptr
== error_mark_node
)
15533 return error_mark_node
;
15535 /* Check to see if we already have this specialization. */
15536 gen_tmpl
= most_general_template (tmpl
);
15537 if (tmpl
!= gen_tmpl
)
15538 /* The TMPL is a partial instantiation. To get a full set of
15539 arguments we must add the arguments used to perform the
15540 partial instantiation. */
15541 targ_ptr
= add_outermost_template_args (DECL_TI_ARGS (tmpl
),
15544 /* It would be nice to avoid hashing here and then again in tsubst_decl,
15545 but it doesn't seem to be on the hot path. */
15546 spec
= retrieve_specialization (gen_tmpl
, targ_ptr
, 0);
15548 gcc_assert (tmpl
== gen_tmpl
15549 || ((fndecl
= retrieve_specialization (tmpl
, orig_args
, 0))
15551 || fndecl
== NULL_TREE
);
15553 if (spec
!= NULL_TREE
)
15555 if (FNDECL_HAS_ACCESS_ERRORS (spec
))
15557 if (complain
& tf_error
)
15558 recheck_decl_substitution (spec
, gen_tmpl
, targ_ptr
);
15559 return error_mark_node
;
15564 if (check_instantiated_args (gen_tmpl
, INNERMOST_TEMPLATE_ARGS (targ_ptr
),
15566 return error_mark_node
;
15568 /* We are building a FUNCTION_DECL, during which the access of its
15569 parameters and return types have to be checked. However this
15570 FUNCTION_DECL which is the desired context for access checking
15571 is not built yet. We solve this chicken-and-egg problem by
15572 deferring all checks until we have the FUNCTION_DECL. */
15573 push_deferring_access_checks (dk_deferred
);
15575 /* Instantiation of the function happens in the context of the function
15576 template, not the context of the overload resolution we're doing. */
15577 push_to_top_level ();
15578 /* If there are dependent arguments, e.g. because we're doing partial
15579 ordering, make sure processing_template_decl stays set. */
15580 if (uses_template_parms (targ_ptr
))
15581 ++processing_template_decl
;
15582 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15584 tree ctx
= tsubst (DECL_CONTEXT (gen_tmpl
), targ_ptr
,
15585 complain
, gen_tmpl
);
15586 push_nested_class (ctx
);
15588 /* Substitute template parameters to obtain the specialization. */
15589 fndecl
= tsubst (DECL_TEMPLATE_RESULT (gen_tmpl
),
15590 targ_ptr
, complain
, gen_tmpl
);
15591 if (DECL_CLASS_SCOPE_P (gen_tmpl
))
15592 pop_nested_class ();
15593 pop_from_top_level ();
15595 if (fndecl
== error_mark_node
)
15597 pop_deferring_access_checks ();
15598 return error_mark_node
;
15601 /* The DECL_TI_TEMPLATE should always be the immediate parent
15602 template, not the most general template. */
15603 DECL_TI_TEMPLATE (fndecl
) = tmpl
;
15605 /* Now we know the specialization, compute access previously
15607 push_access_scope (fndecl
);
15608 if (!perform_deferred_access_checks (complain
))
15610 pop_access_scope (fndecl
);
15611 pop_deferring_access_checks ();
15613 /* If we've just instantiated the main entry point for a function,
15614 instantiate all the alternate entry points as well. We do this
15615 by cloning the instantiation of the main entry point, not by
15616 instantiating the template clones. */
15617 if (DECL_CHAIN (gen_tmpl
) && DECL_CLONED_FUNCTION_P (DECL_CHAIN (gen_tmpl
)))
15618 clone_function_decl (fndecl
, /*update_method_vec_p=*/0);
15622 if (!(complain
& tf_error
))
15624 /* Remember to reinstantiate when we're out of SFINAE so the user
15625 can see the errors. */
15626 FNDECL_HAS_ACCESS_ERRORS (fndecl
) = true;
15628 return error_mark_node
;
15633 /* Wrapper for instantiate_template_1. */
15636 instantiate_template (tree tmpl
, tree orig_args
, tsubst_flags_t complain
)
15639 timevar_push (TV_TEMPLATE_INST
);
15640 ret
= instantiate_template_1 (tmpl
, orig_args
, complain
);
15641 timevar_pop (TV_TEMPLATE_INST
);
15645 /* Instantiate the alias template TMPL with ARGS. Also push a template
15646 instantiation level, which instantiate_template doesn't do because
15647 functions and variables have sufficient context established by the
15651 instantiate_alias_template (tree tmpl
, tree args
, tsubst_flags_t complain
)
15653 struct pending_template
*old_last_pend
= last_pending_template
;
15654 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15655 if (tmpl
== error_mark_node
|| args
== error_mark_node
)
15656 return error_mark_node
;
15657 tree tinst
= build_tree_list (tmpl
, args
);
15658 if (!push_tinst_level (tinst
))
15661 return error_mark_node
;
15665 coerce_innermost_template_parms (DECL_TEMPLATE_PARMS (tmpl
),
15666 args
, tmpl
, complain
,
15667 /*require_all_args=*/true,
15668 /*use_default_args=*/true);
15670 tree r
= instantiate_template (tmpl
, args
, complain
);
15671 pop_tinst_level ();
15672 /* We can't free this if a pending_template entry or last_error_tinst_level
15673 is pointing at it. */
15674 if (last_pending_template
== old_last_pend
15675 && last_error_tinst_level
== old_error_tinst
)
15681 /* PARM is a template parameter pack for FN. Returns true iff
15682 PARM is used in a deducible way in the argument list of FN. */
15685 pack_deducible_p (tree parm
, tree fn
)
15687 tree t
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
15688 for (; t
; t
= TREE_CHAIN (t
))
15690 tree type
= TREE_VALUE (t
);
15692 if (!PACK_EXPANSION_P (type
))
15694 for (packs
= PACK_EXPANSION_PARAMETER_PACKS (type
);
15695 packs
; packs
= TREE_CHAIN (packs
))
15696 if (template_args_equal (TREE_VALUE (packs
), parm
))
15698 /* The template parameter pack is used in a function parameter
15699 pack. If this is the end of the parameter list, the
15700 template parameter pack is deducible. */
15701 if (TREE_CHAIN (t
) == void_list_node
)
15704 /* Otherwise, not. Well, it could be deduced from
15705 a non-pack parameter, but doing so would end up with
15706 a deduction mismatch, so don't bother. */
15710 /* The template parameter pack isn't used in any function parameter
15711 packs, but it might be used deeper, e.g. tuple<Args...>. */
15715 /* The FN is a TEMPLATE_DECL for a function. ARGS is an array with
15716 NARGS elements of the arguments that are being used when calling
15717 it. TARGS is a vector into which the deduced template arguments
15720 Returns either a FUNCTION_DECL for the matching specialization of FN or
15721 NULL_TREE if no suitable specialization can be found. If EXPLAIN_P is
15722 true, diagnostics will be printed to explain why it failed.
15724 If FN is a conversion operator, or we are trying to produce a specific
15725 specialization, RETURN_TYPE is the return type desired.
15727 The EXPLICIT_TARGS are explicit template arguments provided via a
15730 The parameter STRICT is one of:
15733 We are deducing arguments for a function call, as in
15734 [temp.deduct.call].
15737 We are deducing arguments for a conversion function, as in
15738 [temp.deduct.conv].
15741 We are deducing arguments when doing an explicit instantiation
15742 as in [temp.explicit], when determining an explicit specialization
15743 as in [temp.expl.spec], or when taking the address of a function
15744 template, as in [temp.deduct.funcaddr]. */
15747 fn_type_unification (tree fn
,
15748 tree explicit_targs
,
15751 unsigned int nargs
,
15753 unification_kind_t strict
,
15760 tree decl
= NULL_TREE
;
15761 tsubst_flags_t complain
= (explain_p
? tf_warning_or_error
: tf_none
);
15763 static int deduction_depth
;
15764 struct pending_template
*old_last_pend
= last_pending_template
;
15765 struct tinst_level
*old_error_tinst
= last_error_tinst_level
;
15766 tree tparms
= DECL_INNERMOST_TEMPLATE_PARMS (fn
);
15768 tree r
= error_mark_node
;
15771 complain
|= tf_decltype
;
15773 /* In C++0x, it's possible to have a function template whose type depends
15774 on itself recursively. This is most obvious with decltype, but can also
15775 occur with enumeration scope (c++/48969). So we need to catch infinite
15776 recursion and reject the substitution at deduction time; this function
15777 will return error_mark_node for any repeated substitution.
15779 This also catches excessive recursion such as when f<N> depends on
15780 f<N-1> across all integers, and returns error_mark_node for all the
15781 substitutions back up to the initial one.
15783 This is, of course, not reentrant. */
15784 if (excessive_deduction_depth
)
15785 return error_mark_node
;
15786 tinst
= build_tree_list (fn
, NULL_TREE
);
15789 gcc_assert (TREE_CODE (fn
) == TEMPLATE_DECL
);
15791 fntype
= TREE_TYPE (fn
);
15792 if (explicit_targs
)
15796 The specified template arguments must match the template
15797 parameters in kind (i.e., type, nontype, template), and there
15798 must not be more arguments than there are parameters;
15799 otherwise type deduction fails.
15801 Nontype arguments must match the types of the corresponding
15802 nontype template parameters, or must be convertible to the
15803 types of the corresponding nontype parameters as specified in
15804 _temp.arg.nontype_, otherwise type deduction fails.
15806 All references in the function type of the function template
15807 to the corresponding template parameters are replaced by the
15808 specified template argument values. If a substitution in a
15809 template parameter or in the function type of the function
15810 template results in an invalid type, type deduction fails. */
15811 int i
, len
= TREE_VEC_LENGTH (tparms
);
15812 location_t loc
= input_location
;
15813 bool incomplete
= false;
15815 /* Adjust any explicit template arguments before entering the
15816 substitution context. */
15818 = (coerce_template_parms (tparms
, explicit_targs
, NULL_TREE
,
15820 /*require_all_args=*/false,
15821 /*use_default_args=*/false));
15822 if (explicit_targs
== error_mark_node
)
15825 /* Substitute the explicit args into the function type. This is
15826 necessary so that, for instance, explicitly declared function
15827 arguments can match null pointed constants. If we were given
15828 an incomplete set of explicit args, we must not do semantic
15829 processing during substitution as we could create partial
15831 for (i
= 0; i
< len
; i
++)
15833 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
15834 bool parameter_pack
= false;
15835 tree targ
= TREE_VEC_ELT (explicit_targs
, i
);
15837 /* Dig out the actual parm. */
15838 if (TREE_CODE (parm
) == TYPE_DECL
15839 || TREE_CODE (parm
) == TEMPLATE_DECL
)
15841 parm
= TREE_TYPE (parm
);
15842 parameter_pack
= TEMPLATE_TYPE_PARAMETER_PACK (parm
);
15844 else if (TREE_CODE (parm
) == PARM_DECL
)
15846 parm
= DECL_INITIAL (parm
);
15847 parameter_pack
= TEMPLATE_PARM_PARAMETER_PACK (parm
);
15850 if (!parameter_pack
&& targ
== NULL_TREE
)
15851 /* No explicit argument for this template parameter. */
15854 if (parameter_pack
&& pack_deducible_p (parm
, fn
))
15856 /* Mark the argument pack as "incomplete". We could
15857 still deduce more arguments during unification.
15858 We remove this mark in type_unification_real. */
15861 ARGUMENT_PACK_INCOMPLETE_P(targ
) = 1;
15862 ARGUMENT_PACK_EXPLICIT_ARGS (targ
)
15863 = ARGUMENT_PACK_ARGS (targ
);
15866 /* We have some incomplete argument packs. */
15871 TREE_VALUE (tinst
) = explicit_targs
;
15872 if (!push_tinst_level (tinst
))
15874 excessive_deduction_depth
= true;
15877 processing_template_decl
+= incomplete
;
15878 input_location
= DECL_SOURCE_LOCATION (fn
);
15879 /* Ignore any access checks; we'll see them again in
15880 instantiate_template and they might have the wrong
15881 access path at this point. */
15882 push_deferring_access_checks (dk_deferred
);
15883 fntype
= tsubst (TREE_TYPE (fn
), explicit_targs
,
15884 complain
| tf_partial
, NULL_TREE
);
15885 pop_deferring_access_checks ();
15886 input_location
= loc
;
15887 processing_template_decl
-= incomplete
;
15888 pop_tinst_level ();
15890 if (fntype
== error_mark_node
)
15893 /* Place the explicitly specified arguments in TARGS. */
15894 for (i
= NUM_TMPL_ARGS (explicit_targs
); i
--;)
15895 TREE_VEC_ELT (targs
, i
) = TREE_VEC_ELT (explicit_targs
, i
);
15898 /* Never do unification on the 'this' parameter. */
15899 parms
= skip_artificial_parms_for (fn
, TYPE_ARG_TYPES (fntype
));
15905 parms
= tree_cons (NULL_TREE
, TREE_TYPE (fntype
), parms
);
15906 new_args
= XALLOCAVEC (tree
, nargs
+ 1);
15907 new_args
[0] = return_type
;
15908 memcpy (new_args
+ 1, args
, nargs
* sizeof (tree
));
15913 /* We allow incomplete unification without an error message here
15914 because the standard doesn't seem to explicitly prohibit it. Our
15915 callers must be ready to deal with unification failures in any
15918 TREE_VALUE (tinst
) = targs
;
15919 /* If we aren't explaining yet, push tinst context so we can see where
15920 any errors (e.g. from class instantiations triggered by instantiation
15921 of default template arguments) come from. If we are explaining, this
15922 context is redundant. */
15923 if (!explain_p
&& !push_tinst_level (tinst
))
15925 excessive_deduction_depth
= true;
15929 /* type_unification_real will pass back any access checks from default
15930 template argument substitution. */
15931 vec
<deferred_access_check
, va_gc
> *checks
;
15934 ok
= !type_unification_real (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
15935 targs
, parms
, args
, nargs
, /*subr=*/0,
15936 strict
, flags
, &checks
, explain_p
);
15938 pop_tinst_level ();
15942 /* Now that we have bindings for all of the template arguments,
15943 ensure that the arguments deduced for the template template
15944 parameters have compatible template parameter lists. We cannot
15945 check this property before we have deduced all template
15946 arguments, because the template parameter types of a template
15947 template parameter might depend on prior template parameters
15948 deduced after the template template parameter. The following
15949 ill-formed example illustrates this issue:
15951 template<typename T, template<T> class C> void f(C<5>, T);
15953 template<int N> struct X {};
15956 f(X<5>(), 5l); // error: template argument deduction fails
15959 The template parameter list of 'C' depends on the template type
15960 parameter 'T', but 'C' is deduced to 'X' before 'T' is deduced to
15961 'long'. Thus, we can't check that 'C' cannot bind to 'X' at the
15962 time that we deduce 'C'. */
15963 if (!template_template_parm_bindings_ok_p
15964 (DECL_INNERMOST_TEMPLATE_PARMS (fn
), targs
))
15966 unify_inconsistent_template_template_parameters (explain_p
);
15970 /* All is well so far. Now, check:
15974 When all template arguments have been deduced, all uses of
15975 template parameters in nondeduced contexts are replaced with
15976 the corresponding deduced argument values. If the
15977 substitution results in an invalid type, as described above,
15978 type deduction fails. */
15979 TREE_VALUE (tinst
) = targs
;
15980 if (!push_tinst_level (tinst
))
15982 excessive_deduction_depth
= true;
15986 /* Also collect access checks from the instantiation. */
15987 reopen_deferring_access_checks (checks
);
15989 decl
= instantiate_template (fn
, targs
, complain
);
15991 checks
= get_deferred_access_checks ();
15992 pop_deferring_access_checks ();
15994 pop_tinst_level ();
15996 if (decl
== error_mark_node
)
15999 /* Now perform any access checks encountered during substitution. */
16000 push_access_scope (decl
);
16001 ok
= perform_access_checks (checks
, complain
);
16002 pop_access_scope (decl
);
16006 /* If we're looking for an exact match, check that what we got
16007 is indeed an exact match. It might not be if some template
16008 parameters are used in non-deduced contexts. But don't check
16009 for an exact match if we have dependent template arguments;
16010 in that case we're doing partial ordering, and we already know
16011 that we have two candidates that will provide the actual type. */
16012 if (strict
== DEDUCE_EXACT
&& !any_dependent_template_arguments_p (targs
))
16014 tree substed
= TREE_TYPE (decl
);
16018 = skip_artificial_parms_for (decl
, TYPE_ARG_TYPES (substed
));
16020 sarg
= tree_cons (NULL_TREE
, TREE_TYPE (substed
), sarg
);
16021 for (i
= 0; i
< nargs
&& sarg
; ++i
, sarg
= TREE_CHAIN (sarg
))
16022 if (!same_type_p (args
[i
], TREE_VALUE (sarg
)))
16024 unify_type_mismatch (explain_p
, args
[i
],
16025 TREE_VALUE (sarg
));
16034 if (excessive_deduction_depth
)
16036 if (deduction_depth
== 0)
16037 /* Reset once we're all the way out. */
16038 excessive_deduction_depth
= false;
16041 /* We can't free this if a pending_template entry or last_error_tinst_level
16042 is pointing at it. */
16043 if (last_pending_template
== old_last_pend
16044 && last_error_tinst_level
== old_error_tinst
)
16050 /* Adjust types before performing type deduction, as described in
16051 [temp.deduct.call] and [temp.deduct.conv]. The rules in these two
16052 sections are symmetric. PARM is the type of a function parameter
16053 or the return type of the conversion function. ARG is the type of
16054 the argument passed to the call, or the type of the value
16055 initialized with the result of the conversion function.
16056 ARG_EXPR is the original argument expression, which may be null. */
16059 maybe_adjust_types_for_deduction (unification_kind_t strict
,
16073 /* Swap PARM and ARG throughout the remainder of this
16074 function; the handling is precisely symmetric since PARM
16075 will initialize ARG rather than vice versa. */
16083 /* Core issue #873: Do the DR606 thing (see below) for these cases,
16084 too, but here handle it by stripping the reference from PARM
16085 rather than by adding it to ARG. */
16086 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16087 && TYPE_REF_IS_RVALUE (*parm
)
16088 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16089 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16090 && TREE_CODE (*arg
) == REFERENCE_TYPE
16091 && !TYPE_REF_IS_RVALUE (*arg
))
16092 *parm
= TREE_TYPE (*parm
);
16093 /* Nothing else to do in this case. */
16097 gcc_unreachable ();
16100 if (TREE_CODE (*parm
) != REFERENCE_TYPE
)
16102 /* [temp.deduct.call]
16104 If P is not a reference type:
16106 --If A is an array type, the pointer type produced by the
16107 array-to-pointer standard conversion (_conv.array_) is
16108 used in place of A for type deduction; otherwise,
16110 --If A is a function type, the pointer type produced by
16111 the function-to-pointer standard conversion
16112 (_conv.func_) is used in place of A for type deduction;
16115 --If A is a cv-qualified type, the top level
16116 cv-qualifiers of A's type are ignored for type
16118 if (TREE_CODE (*arg
) == ARRAY_TYPE
)
16119 *arg
= build_pointer_type (TREE_TYPE (*arg
));
16120 else if (TREE_CODE (*arg
) == FUNCTION_TYPE
)
16121 *arg
= build_pointer_type (*arg
);
16123 *arg
= TYPE_MAIN_VARIANT (*arg
);
16126 /* From C++0x [14.8.2.1/3 temp.deduct.call] (after DR606), "If P is
16127 of the form T&&, where T is a template parameter, and the argument
16128 is an lvalue, T is deduced as A& */
16129 if (TREE_CODE (*parm
) == REFERENCE_TYPE
16130 && TYPE_REF_IS_RVALUE (*parm
)
16131 && TREE_CODE (TREE_TYPE (*parm
)) == TEMPLATE_TYPE_PARM
16132 && cp_type_quals (TREE_TYPE (*parm
)) == TYPE_UNQUALIFIED
16133 && (arg_expr
? real_lvalue_p (arg_expr
)
16134 /* try_one_overload doesn't provide an arg_expr, but
16135 functions are always lvalues. */
16136 : TREE_CODE (*arg
) == FUNCTION_TYPE
))
16137 *arg
= build_reference_type (*arg
);
16139 /* [temp.deduct.call]
16141 If P is a cv-qualified type, the top level cv-qualifiers
16142 of P's type are ignored for type deduction. If P is a
16143 reference type, the type referred to by P is used for
16145 *parm
= TYPE_MAIN_VARIANT (*parm
);
16146 if (TREE_CODE (*parm
) == REFERENCE_TYPE
)
16148 *parm
= TREE_TYPE (*parm
);
16149 result
|= UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
16152 /* DR 322. For conversion deduction, remove a reference type on parm
16153 too (which has been swapped into ARG). */
16154 if (strict
== DEDUCE_CONV
&& TREE_CODE (*arg
) == REFERENCE_TYPE
)
16155 *arg
= TREE_TYPE (*arg
);
16160 /* Subroutine of unify_one_argument. PARM is a function parameter of a
16161 template which does contain any deducible template parameters; check if
16162 ARG is a suitable match for it. STRICT, FLAGS and EXPLAIN_P are as in
16163 unify_one_argument. */
16166 check_non_deducible_conversion (tree parm
, tree arg
, int strict
,
16167 int flags
, bool explain_p
)
16172 type
= TREE_TYPE (arg
);
16176 if (same_type_p (parm
, type
))
16177 return unify_success (explain_p
);
16179 if (strict
== DEDUCE_CONV
)
16181 if (can_convert_arg (type
, parm
, NULL_TREE
, flags
,
16182 explain_p
? tf_warning_or_error
: tf_none
))
16183 return unify_success (explain_p
);
16185 else if (strict
!= DEDUCE_EXACT
)
16187 if (can_convert_arg (parm
, type
,
16188 TYPE_P (arg
) ? NULL_TREE
: arg
,
16189 flags
, explain_p
? tf_warning_or_error
: tf_none
))
16190 return unify_success (explain_p
);
16193 if (strict
== DEDUCE_EXACT
)
16194 return unify_type_mismatch (explain_p
, parm
, arg
);
16196 return unify_arg_conversion (explain_p
, parm
, type
, arg
);
16199 static bool uses_deducible_template_parms (tree type
);
16201 /* Returns true iff the expression EXPR is one from which a template
16202 argument can be deduced. In other words, if it's an undecorated
16203 use of a template non-type parameter. */
16206 deducible_expression (tree expr
)
16208 return (TREE_CODE (expr
) == TEMPLATE_PARM_INDEX
);
16211 /* Returns true iff the array domain DOMAIN uses a template parameter in a
16212 deducible way; that is, if it has a max value of <PARM> - 1. */
16215 deducible_array_bound (tree domain
)
16217 if (domain
== NULL_TREE
)
16220 tree max
= TYPE_MAX_VALUE (domain
);
16221 if (TREE_CODE (max
) != MINUS_EXPR
)
16224 return deducible_expression (TREE_OPERAND (max
, 0));
16227 /* Returns true iff the template arguments ARGS use a template parameter
16228 in a deducible way. */
16231 deducible_template_args (tree args
)
16233 for (int i
= 0; i
< TREE_VEC_LENGTH (args
); ++i
)
16236 tree elt
= TREE_VEC_ELT (args
, i
);
16237 if (ARGUMENT_PACK_P (elt
))
16238 deducible
= deducible_template_args (ARGUMENT_PACK_ARGS (elt
));
16241 if (PACK_EXPANSION_P (elt
))
16242 elt
= PACK_EXPANSION_PATTERN (elt
);
16243 if (TREE_CODE (elt
) == TEMPLATE_TEMPLATE_PARM
)
16245 else if (TYPE_P (elt
))
16246 deducible
= uses_deducible_template_parms (elt
);
16248 deducible
= deducible_expression (elt
);
16256 /* Returns true iff TYPE contains any deducible references to template
16257 parameters, as per 14.8.2.5. */
16260 uses_deducible_template_parms (tree type
)
16262 if (PACK_EXPANSION_P (type
))
16263 type
= PACK_EXPANSION_PATTERN (type
);
16270 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
16271 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
16277 if (POINTER_TYPE_P (type
))
16278 return uses_deducible_template_parms (TREE_TYPE (type
));
16280 /* T[integer-constant ]
16282 if (TREE_CODE (type
) == ARRAY_TYPE
)
16283 return (uses_deducible_template_parms (TREE_TYPE (type
))
16284 || deducible_array_bound (TYPE_DOMAIN (type
)));
16296 if (TYPE_PTRMEM_P (type
))
16297 return (uses_deducible_template_parms (TYPE_PTRMEM_CLASS_TYPE (type
))
16298 || (uses_deducible_template_parms
16299 (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
16301 /* template-name <T> (where template-name refers to a class template)
16302 template-name <i> (where template-name refers to a class template) */
16303 if (CLASS_TYPE_P (type
)
16304 && CLASSTYPE_TEMPLATE_INFO (type
)
16305 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
)))
16306 return deducible_template_args (INNERMOST_TEMPLATE_ARGS
16307 (CLASSTYPE_TI_ARGS (type
)));
16312 if (TREE_CODE (type
) == FUNCTION_TYPE
16313 || TREE_CODE (type
) == METHOD_TYPE
)
16315 if (uses_deducible_template_parms (TREE_TYPE (type
)))
16317 tree parm
= TYPE_ARG_TYPES (type
);
16318 if (TREE_CODE (type
) == METHOD_TYPE
)
16319 parm
= TREE_CHAIN (parm
);
16320 for (; parm
; parm
= TREE_CHAIN (parm
))
16321 if (uses_deducible_template_parms (TREE_VALUE (parm
)))
16328 /* Subroutine of type_unification_real and unify_pack_expansion to
16329 handle unification of a single P/A pair. Parameters are as
16330 for those functions. */
16333 unify_one_argument (tree tparms
, tree targs
, tree parm
, tree arg
,
16334 int subr
, unification_kind_t strict
, int flags
,
16337 tree arg_expr
= NULL_TREE
;
16340 if (arg
== error_mark_node
|| parm
== error_mark_node
)
16341 return unify_invalid (explain_p
);
16342 if (arg
== unknown_type_node
)
16343 /* We can't deduce anything from this, but we might get all the
16344 template args from other function args. */
16345 return unify_success (explain_p
);
16347 /* Implicit conversions (Clause 4) will be performed on a function
16348 argument to convert it to the type of the corresponding function
16349 parameter if the parameter type contains no template-parameters that
16350 participate in template argument deduction. */
16351 if (TYPE_P (parm
) && !uses_template_parms (parm
))
16352 /* For function parameters that contain no template-parameters at all,
16353 we have historically checked for convertibility in order to shortcut
16354 consideration of this candidate. */
16355 return check_non_deducible_conversion (parm
, arg
, strict
, flags
,
16357 else if (strict
== DEDUCE_CALL
16358 && TYPE_P (parm
) && !uses_deducible_template_parms (parm
))
16359 /* For function parameters with only non-deducible template parameters,
16361 return unify_success (explain_p
);
16366 arg_strict
= (UNIFY_ALLOW_OUTER_LEVEL
16367 | UNIFY_ALLOW_MORE_CV_QUAL
16368 | UNIFY_ALLOW_DERIVED
);
16372 arg_strict
= UNIFY_ALLOW_LESS_CV_QUAL
;
16376 arg_strict
= UNIFY_ALLOW_NONE
;
16380 gcc_unreachable ();
16383 /* We only do these transformations if this is the top-level
16384 parameter_type_list in a call or declaration matching; in other
16385 situations (nested function declarators, template argument lists) we
16386 won't be comparing a type to an expression, and we don't do any type
16392 gcc_assert (TREE_TYPE (arg
) != NULL_TREE
);
16393 if (type_unknown_p (arg
))
16395 /* [temp.deduct.type] A template-argument can be
16396 deduced from a pointer to function or pointer
16397 to member function argument if the set of
16398 overloaded functions does not contain function
16399 templates and at most one of a set of
16400 overloaded functions provides a unique
16403 if (resolve_overloaded_unification
16404 (tparms
, targs
, parm
, arg
, strict
,
16405 arg_strict
, explain_p
))
16406 return unify_success (explain_p
);
16407 return unify_overload_resolution_failure (explain_p
, arg
);
16411 arg
= unlowered_expr_type (arg
);
16412 if (arg
== error_mark_node
)
16413 return unify_invalid (explain_p
);
16417 maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, arg_expr
);
16420 if ((TYPE_P (parm
) || TREE_CODE (parm
) == TEMPLATE_DECL
)
16421 != (TYPE_P (arg
) || TREE_CODE (arg
) == TEMPLATE_DECL
))
16422 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
16424 /* For deduction from an init-list we need the actual list. */
16425 if (arg_expr
&& BRACE_ENCLOSED_INITIALIZER_P (arg_expr
))
16427 return unify (tparms
, targs
, parm
, arg
, arg_strict
, explain_p
);
16430 /* Most parms like fn_type_unification.
16432 If SUBR is 1, we're being called recursively (to unify the
16433 arguments of a function or method parameter of a function
16436 CHECKS is a pointer to a vector of access checks encountered while
16437 substituting default template arguments. */
16440 type_unification_real (tree tparms
,
16444 unsigned int xnargs
,
16446 unification_kind_t strict
,
16448 vec
<deferred_access_check
, va_gc
> **checks
,
16453 int ntparms
= TREE_VEC_LENGTH (tparms
);
16454 int saw_undeduced
= 0;
16457 unsigned int nargs
;
16460 gcc_assert (TREE_CODE (tparms
) == TREE_VEC
);
16461 gcc_assert (xparms
== NULL_TREE
|| TREE_CODE (xparms
) == TREE_LIST
);
16462 gcc_assert (ntparms
> 0);
16464 /* Reset the number of non-defaulted template arguments contained
16466 NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
) = NULL_TREE
;
16474 while (parms
&& parms
!= void_list_node
16477 parm
= TREE_VALUE (parms
);
16479 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
16480 && (!TREE_CHAIN (parms
) || TREE_CHAIN (parms
) == void_list_node
))
16481 /* For a function parameter pack that occurs at the end of the
16482 parameter-declaration-list, the type A of each remaining
16483 argument of the call is compared with the type P of the
16484 declarator-id of the function parameter pack. */
16487 parms
= TREE_CHAIN (parms
);
16489 if (TREE_CODE (parm
) == TYPE_PACK_EXPANSION
)
16490 /* For a function parameter pack that does not occur at the
16491 end of the parameter-declaration-list, the type of the
16492 parameter pack is a non-deduced context. */
16498 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
16504 && parms
!= void_list_node
16505 && TREE_CODE (TREE_VALUE (parms
)) == TYPE_PACK_EXPANSION
)
16507 /* Unify the remaining arguments with the pack expansion type. */
16509 tree parmvec
= make_tree_vec (1);
16511 /* Allocate a TREE_VEC and copy in all of the arguments */
16512 argvec
= make_tree_vec (nargs
- ia
);
16513 for (i
= 0; ia
< nargs
; ++ia
, ++i
)
16514 TREE_VEC_ELT (argvec
, i
) = args
[ia
];
16516 /* Copy the parameter into parmvec. */
16517 TREE_VEC_ELT (parmvec
, 0) = TREE_VALUE (parms
);
16518 if (unify_pack_expansion (tparms
, targs
, parmvec
, argvec
, strict
,
16519 /*subr=*/subr
, explain_p
))
16522 /* Advance to the end of the list of parameters. */
16523 parms
= TREE_CHAIN (parms
);
16526 /* Fail if we've reached the end of the parm list, and more args
16527 are present, and the parm list isn't variadic. */
16528 if (ia
< nargs
&& parms
== void_list_node
)
16529 return unify_too_many_arguments (explain_p
, nargs
, ia
);
16530 /* Fail if parms are left and they don't have default values. */
16531 if (parms
&& parms
!= void_list_node
16532 && TREE_PURPOSE (parms
) == NULL_TREE
)
16534 unsigned int count
= nargs
;
16536 while (p
&& p
!= void_list_node
)
16539 p
= TREE_CHAIN (p
);
16541 return unify_too_few_arguments (explain_p
, ia
, count
);
16546 tsubst_flags_t complain
= (explain_p
16547 ? tf_warning_or_error
16550 for (i
= 0; i
< ntparms
; i
++)
16552 tree targ
= TREE_VEC_ELT (targs
, i
);
16553 tree tparm
= TREE_VEC_ELT (tparms
, i
);
16555 /* Clear the "incomplete" flags on all argument packs now so that
16556 substituting them into later default arguments works. */
16557 if (targ
&& ARGUMENT_PACK_P (targ
))
16559 ARGUMENT_PACK_INCOMPLETE_P (targ
) = 0;
16560 ARGUMENT_PACK_EXPLICIT_ARGS (targ
) = NULL_TREE
;
16563 if (targ
|| tparm
== error_mark_node
)
16565 tparm
= TREE_VALUE (tparm
);
16567 /* If this is an undeduced nontype parameter that depends on
16568 a type parameter, try another pass; its type may have been
16569 deduced from a later argument than the one from which
16570 this parameter can be deduced. */
16571 if (TREE_CODE (tparm
) == PARM_DECL
16572 && uses_template_parms (TREE_TYPE (tparm
))
16573 && !saw_undeduced
++)
16576 /* Core issue #226 (C++0x) [temp.deduct]:
16578 If a template argument has not been deduced, its
16579 default template argument, if any, is used.
16581 When we are in C++98 mode, TREE_PURPOSE will either
16582 be NULL_TREE or ERROR_MARK_NODE, so we do not need
16583 to explicitly check cxx_dialect here. */
16584 if (TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
)))
16586 tree parm
= TREE_VALUE (TREE_VEC_ELT (tparms
, i
));
16587 tree arg
= TREE_PURPOSE (TREE_VEC_ELT (tparms
, i
));
16588 reopen_deferring_access_checks (*checks
);
16589 location_t save_loc
= input_location
;
16591 input_location
= DECL_SOURCE_LOCATION (parm
);
16592 arg
= tsubst_template_arg (arg
, targs
, complain
, NULL_TREE
);
16593 arg
= convert_template_argument (parm
, arg
, targs
, complain
,
16595 input_location
= save_loc
;
16596 *checks
= get_deferred_access_checks ();
16597 pop_deferring_access_checks ();
16598 if (arg
== error_mark_node
)
16602 TREE_VEC_ELT (targs
, i
) = arg
;
16603 /* The position of the first default template argument,
16604 is also the number of non-defaulted arguments in TARGS.
16606 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16607 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, i
);
16612 /* If the type parameter is a parameter pack, then it will
16613 be deduced to an empty parameter pack. */
16614 if (template_parameter_pack_p (tparm
))
16618 if (TREE_CODE (tparm
) == TEMPLATE_PARM_INDEX
)
16620 arg
= make_node (NONTYPE_ARGUMENT_PACK
);
16621 TREE_TYPE (arg
) = TREE_TYPE (TEMPLATE_PARM_DECL (tparm
));
16622 TREE_CONSTANT (arg
) = 1;
16625 arg
= cxx_make_type (TYPE_ARGUMENT_PACK
);
16627 SET_ARGUMENT_PACK_ARGS (arg
, make_tree_vec (0));
16629 TREE_VEC_ELT (targs
, i
) = arg
;
16633 return unify_parameter_deduction_failure (explain_p
, tparm
);
16636 #ifdef ENABLE_CHECKING
16637 if (!NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
))
16638 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (targs
, TREE_VEC_LENGTH (targs
));
16641 return unify_success (explain_p
);
16644 /* Subroutine of type_unification_real. Args are like the variables
16645 at the call site. ARG is an overloaded function (or template-id);
16646 we try deducing template args from each of the overloads, and if
16647 only one succeeds, we go with that. Modifies TARGS and returns
16648 true on success. */
16651 resolve_overloaded_unification (tree tparms
,
16655 unification_kind_t strict
,
16659 tree tempargs
= copy_node (targs
);
16661 tree goodfn
= NULL_TREE
;
16664 if (TREE_CODE (arg
) == ADDR_EXPR
)
16666 arg
= TREE_OPERAND (arg
, 0);
16672 if (TREE_CODE (arg
) == COMPONENT_REF
)
16673 /* Handle `&x' where `x' is some static or non-static member
16675 arg
= TREE_OPERAND (arg
, 1);
16677 if (TREE_CODE (arg
) == OFFSET_REF
)
16678 arg
= TREE_OPERAND (arg
, 1);
16680 /* Strip baselink information. */
16681 if (BASELINK_P (arg
))
16682 arg
= BASELINK_FUNCTIONS (arg
);
16684 if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
16686 /* If we got some explicit template args, we need to plug them into
16687 the affected templates before we try to unify, in case the
16688 explicit args will completely resolve the templates in question. */
16691 tree expl_subargs
= TREE_OPERAND (arg
, 1);
16692 arg
= TREE_OPERAND (arg
, 0);
16694 for (; arg
; arg
= OVL_NEXT (arg
))
16696 tree fn
= OVL_CURRENT (arg
);
16697 tree subargs
, elem
;
16699 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16702 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16703 expl_subargs
, NULL_TREE
, tf_none
,
16704 /*require_all_args=*/true,
16705 /*use_default_args=*/true);
16706 if (subargs
!= error_mark_node
16707 && !any_dependent_template_arguments_p (subargs
))
16709 elem
= TREE_TYPE (instantiate_template (fn
, subargs
, tf_none
));
16710 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16711 elem
, strict
, sub_strict
, addr_p
, explain_p
)
16712 && (!goodfn
|| !same_type_p (goodfn
, elem
)))
16721 /* If no templates (or more than one) are fully resolved by the
16722 explicit arguments, this template-id is a non-deduced context; it
16723 could still be OK if we deduce all template arguments for the
16724 enclosing call through other arguments. */
16728 else if (TREE_CODE (arg
) != OVERLOAD
16729 && TREE_CODE (arg
) != FUNCTION_DECL
)
16730 /* If ARG is, for example, "(0, &f)" then its type will be unknown
16731 -- but the deduction does not succeed because the expression is
16732 not just the function on its own. */
16735 for (; arg
; arg
= OVL_NEXT (arg
))
16736 if (try_one_overload (tparms
, targs
, tempargs
, parm
,
16737 TREE_TYPE (OVL_CURRENT (arg
)),
16738 strict
, sub_strict
, addr_p
, explain_p
)
16739 && (!goodfn
|| !decls_match (goodfn
, OVL_CURRENT (arg
))))
16741 goodfn
= OVL_CURRENT (arg
);
16745 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16746 to function or pointer to member function argument if the set of
16747 overloaded functions does not contain function templates and at most
16748 one of a set of overloaded functions provides a unique match.
16750 So if we found multiple possibilities, we return success but don't
16751 deduce anything. */
16755 int i
= TREE_VEC_LENGTH (targs
);
16757 if (TREE_VEC_ELT (tempargs
, i
))
16759 tree old
= TREE_VEC_ELT (targs
, i
);
16760 tree new_
= TREE_VEC_ELT (tempargs
, i
);
16761 if (new_
&& old
&& ARGUMENT_PACK_P (old
)
16762 && ARGUMENT_PACK_EXPLICIT_ARGS (old
))
16763 /* Don't forget explicit template arguments in a pack. */
16764 ARGUMENT_PACK_EXPLICIT_ARGS (new_
)
16765 = ARGUMENT_PACK_EXPLICIT_ARGS (old
);
16766 TREE_VEC_ELT (targs
, i
) = new_
;
16775 /* Core DR 115: In contexts where deduction is done and fails, or in
16776 contexts where deduction is not done, if a template argument list is
16777 specified and it, along with any default template arguments, identifies
16778 a single function template specialization, then the template-id is an
16779 lvalue for the function template specialization. */
16782 resolve_nondeduced_context (tree orig_expr
)
16784 tree expr
, offset
, baselink
;
16787 if (!type_unknown_p (orig_expr
))
16792 offset
= NULL_TREE
;
16793 baselink
= NULL_TREE
;
16795 if (TREE_CODE (expr
) == ADDR_EXPR
)
16797 expr
= TREE_OPERAND (expr
, 0);
16800 if (TREE_CODE (expr
) == OFFSET_REF
)
16803 expr
= TREE_OPERAND (expr
, 1);
16805 if (BASELINK_P (expr
))
16808 expr
= BASELINK_FUNCTIONS (expr
);
16811 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
16814 tree goodfn
= NULL_TREE
;
16816 /* If we got some explicit template args, we need to plug them into
16817 the affected templates before we try to unify, in case the
16818 explicit args will completely resolve the templates in question. */
16820 tree expl_subargs
= TREE_OPERAND (expr
, 1);
16821 tree arg
= TREE_OPERAND (expr
, 0);
16822 tree badfn
= NULL_TREE
;
16823 tree badargs
= NULL_TREE
;
16825 for (; arg
; arg
= OVL_NEXT (arg
))
16827 tree fn
= OVL_CURRENT (arg
);
16828 tree subargs
, elem
;
16830 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
16833 subargs
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (fn
),
16834 expl_subargs
, NULL_TREE
, tf_none
,
16835 /*require_all_args=*/true,
16836 /*use_default_args=*/true);
16837 if (subargs
!= error_mark_node
16838 && !any_dependent_template_arguments_p (subargs
))
16840 elem
= instantiate_template (fn
, subargs
, tf_none
);
16841 if (elem
== error_mark_node
)
16846 else if (elem
&& (!goodfn
|| !decls_match (goodfn
, elem
)))
16855 mark_used (goodfn
);
16858 expr
= build_baselink (BASELINK_BINFO (baselink
),
16859 BASELINK_ACCESS_BINFO (baselink
),
16860 expr
, BASELINK_OPTYPE (baselink
));
16864 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (offset
, 0)));
16865 expr
= build_offset_ref (base
, expr
, addr
, tf_warning_or_error
);
16868 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
16871 else if (good
== 0 && badargs
)
16872 /* There were no good options and at least one bad one, so let the
16873 user know what the problem is. */
16874 instantiate_template (badfn
, badargs
, tf_warning_or_error
);
16879 /* Subroutine of resolve_overloaded_unification; does deduction for a single
16880 overload. Fills TARGS with any deduced arguments, or error_mark_node if
16881 different overloads deduce different arguments for a given parm.
16882 ADDR_P is true if the expression for which deduction is being
16883 performed was of the form "& fn" rather than simply "fn".
16885 Returns 1 on success. */
16888 try_one_overload (tree tparms
,
16893 unification_kind_t strict
,
16902 if (arg
== error_mark_node
)
16905 /* [temp.deduct.type] A template-argument can be deduced from a pointer
16906 to function or pointer to member function argument if the set of
16907 overloaded functions does not contain function templates and at most
16908 one of a set of overloaded functions provides a unique match.
16910 So if this is a template, just return success. */
16912 if (uses_template_parms (arg
))
16915 if (TREE_CODE (arg
) == METHOD_TYPE
)
16916 arg
= build_ptrmemfunc_type (build_pointer_type (arg
));
16918 arg
= build_pointer_type (arg
);
16920 sub_strict
|= maybe_adjust_types_for_deduction (strict
, &parm
, &arg
, NULL
);
16922 /* We don't copy orig_targs for this because if we have already deduced
16923 some template args from previous args, unify would complain when we
16924 try to deduce a template parameter for the same argument, even though
16925 there isn't really a conflict. */
16926 nargs
= TREE_VEC_LENGTH (targs
);
16927 tempargs
= make_tree_vec (nargs
);
16929 if (unify (tparms
, tempargs
, parm
, arg
, sub_strict
, explain_p
))
16932 /* First make sure we didn't deduce anything that conflicts with
16933 explicitly specified args. */
16934 for (i
= nargs
; i
--; )
16936 tree elt
= TREE_VEC_ELT (tempargs
, i
);
16937 tree oldelt
= TREE_VEC_ELT (orig_targs
, i
);
16941 else if (uses_template_parms (elt
))
16942 /* Since we're unifying against ourselves, we will fill in
16943 template args used in the function parm list with our own
16944 template parms. Discard them. */
16945 TREE_VEC_ELT (tempargs
, i
) = NULL_TREE
;
16946 else if (oldelt
&& !template_args_equal (oldelt
, elt
))
16950 for (i
= nargs
; i
--; )
16952 tree elt
= TREE_VEC_ELT (tempargs
, i
);
16955 TREE_VEC_ELT (targs
, i
) = elt
;
16961 /* PARM is a template class (perhaps with unbound template
16962 parameters). ARG is a fully instantiated type. If ARG can be
16963 bound to PARM, return ARG, otherwise return NULL_TREE. TPARMS and
16964 TARGS are as for unify. */
16967 try_class_unification (tree tparms
, tree targs
, tree parm
, tree arg
,
16970 tree copy_of_targs
;
16972 if (!CLASSTYPE_TEMPLATE_INFO (arg
)
16973 || (most_general_template (CLASSTYPE_TI_TEMPLATE (arg
))
16974 != most_general_template (CLASSTYPE_TI_TEMPLATE (parm
))))
16977 /* We need to make a new template argument vector for the call to
16978 unify. If we used TARGS, we'd clutter it up with the result of
16979 the attempted unification, even if this class didn't work out.
16980 We also don't want to commit ourselves to all the unifications
16981 we've already done, since unification is supposed to be done on
16982 an argument-by-argument basis. In other words, consider the
16983 following pathological case:
16985 template <int I, int J, int K>
16988 template <int I, int J>
16989 struct S<I, J, 2> : public S<I, I, I>, S<J, J, J> {};
16991 template <int I, int J, int K>
16992 void f(S<I, J, K>, S<I, I, I>);
17001 Now, by the time we consider the unification involving `s2', we
17002 already know that we must have `f<0, 0, 0>'. But, even though
17003 `S<0, 1, 2>' is derived from `S<0, 0, 0>', the code is invalid
17004 because there are two ways to unify base classes of S<0, 1, 2>
17005 with S<I, I, I>. If we kept the already deduced knowledge, we
17006 would reject the possibility I=1. */
17007 copy_of_targs
= make_tree_vec (TREE_VEC_LENGTH (targs
));
17009 /* If unification failed, we're done. */
17010 if (unify (tparms
, copy_of_targs
, CLASSTYPE_TI_ARGS (parm
),
17011 CLASSTYPE_TI_ARGS (arg
), UNIFY_ALLOW_NONE
, explain_p
))
17017 /* Given a template type PARM and a class type ARG, find the unique
17018 base type in ARG that is an instance of PARM. We do not examine
17019 ARG itself; only its base-classes. If there is not exactly one
17020 appropriate base class, return NULL_TREE. PARM may be the type of
17021 a partial specialization, as well as a plain template type. Used
17024 static enum template_base_result
17025 get_template_base (tree tparms
, tree targs
, tree parm
, tree arg
,
17026 bool explain_p
, tree
*result
)
17028 tree rval
= NULL_TREE
;
17031 gcc_assert (RECORD_OR_UNION_CODE_P (TREE_CODE (arg
)));
17033 binfo
= TYPE_BINFO (complete_type (arg
));
17036 /* The type could not be completed. */
17037 *result
= NULL_TREE
;
17038 return tbr_incomplete_type
;
17041 /* Walk in inheritance graph order. The search order is not
17042 important, and this avoids multiple walks of virtual bases. */
17043 for (binfo
= TREE_CHAIN (binfo
); binfo
; binfo
= TREE_CHAIN (binfo
))
17045 tree r
= try_class_unification (tparms
, targs
, parm
,
17046 BINFO_TYPE (binfo
), explain_p
);
17050 /* If there is more than one satisfactory baseclass, then:
17054 If they yield more than one possible deduced A, the type
17058 if (rval
&& !same_type_p (r
, rval
))
17060 *result
= NULL_TREE
;
17061 return tbr_ambiguous_baseclass
;
17069 return tbr_success
;
17072 /* Returns the level of DECL, which declares a template parameter. */
17075 template_decl_level (tree decl
)
17077 switch (TREE_CODE (decl
))
17080 case TEMPLATE_DECL
:
17081 return TEMPLATE_TYPE_LEVEL (TREE_TYPE (decl
));
17084 return TEMPLATE_PARM_LEVEL (DECL_INITIAL (decl
));
17087 gcc_unreachable ();
17092 /* Decide whether ARG can be unified with PARM, considering only the
17093 cv-qualifiers of each type, given STRICT as documented for unify.
17094 Returns nonzero iff the unification is OK on that basis. */
17097 check_cv_quals_for_unify (int strict
, tree arg
, tree parm
)
17099 int arg_quals
= cp_type_quals (arg
);
17100 int parm_quals
= cp_type_quals (parm
);
17102 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17103 && !(strict
& UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17105 /* Although a CVR qualifier is ignored when being applied to a
17106 substituted template parameter ([8.3.2]/1 for example), that
17107 does not allow us to unify "const T" with "int&" because both
17108 types are not of the form "cv-list T" [14.8.2.5 temp.deduct.type].
17109 It is ok when we're allowing additional CV qualifiers
17110 at the outer level [14.8.2.1]/3,1st bullet. */
17111 if ((TREE_CODE (arg
) == REFERENCE_TYPE
17112 || TREE_CODE (arg
) == FUNCTION_TYPE
17113 || TREE_CODE (arg
) == METHOD_TYPE
)
17114 && (parm_quals
& (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
)))
17117 if ((!POINTER_TYPE_P (arg
) && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
)
17118 && (parm_quals
& TYPE_QUAL_RESTRICT
))
17122 if (!(strict
& (UNIFY_ALLOW_MORE_CV_QUAL
| UNIFY_ALLOW_OUTER_MORE_CV_QUAL
))
17123 && (arg_quals
& parm_quals
) != parm_quals
)
17126 if (!(strict
& (UNIFY_ALLOW_LESS_CV_QUAL
| UNIFY_ALLOW_OUTER_LESS_CV_QUAL
))
17127 && (parm_quals
& arg_quals
) != arg_quals
)
17133 /* Determines the LEVEL and INDEX for the template parameter PARM. */
17135 template_parm_level_and_index (tree parm
, int* level
, int* index
)
17137 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17138 || TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17139 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17141 *index
= TEMPLATE_TYPE_IDX (parm
);
17142 *level
= TEMPLATE_TYPE_LEVEL (parm
);
17146 *index
= TEMPLATE_PARM_IDX (parm
);
17147 *level
= TEMPLATE_PARM_LEVEL (parm
);
17151 #define RECUR_AND_CHECK_FAILURE(TP, TA, P, A, S, EP) \
17153 if (unify (TP, TA, P, A, S, EP)) \
17157 /* Unifies the remaining arguments in PACKED_ARGS with the pack
17158 expansion at the end of PACKED_PARMS. Returns 0 if the type
17159 deduction succeeds, 1 otherwise. STRICT is the same as in
17160 unify. CALL_ARGS_P is true iff PACKED_ARGS is actually a function
17161 call argument list. We'll need to adjust the arguments to make them
17162 types. SUBR tells us if this is from a recursive call to
17163 type_unification_real, or for comparing two template argument
17167 unify_pack_expansion (tree tparms
, tree targs
, tree packed_parms
,
17168 tree packed_args
, unification_kind_t strict
,
17169 bool subr
, bool explain_p
)
17172 = TREE_VEC_ELT (packed_parms
, TREE_VEC_LENGTH (packed_parms
) - 1);
17173 tree pattern
= PACK_EXPANSION_PATTERN (parm
);
17174 tree pack
, packs
= NULL_TREE
;
17175 int i
, start
= TREE_VEC_LENGTH (packed_parms
) - 1;
17177 packed_args
= expand_template_argument_pack (packed_args
);
17179 int len
= TREE_VEC_LENGTH (packed_args
);
17181 /* Determine the parameter packs we will be deducing from the
17182 pattern, and record their current deductions. */
17183 for (pack
= PACK_EXPANSION_PARAMETER_PACKS (parm
);
17184 pack
; pack
= TREE_CHAIN (pack
))
17186 tree parm_pack
= TREE_VALUE (pack
);
17189 /* Determine the index and level of this parameter pack. */
17190 template_parm_level_and_index (parm_pack
, &level
, &idx
);
17192 /* Keep track of the parameter packs and their corresponding
17194 packs
= tree_cons (parm_pack
, TMPL_ARG (targs
, level
, idx
), packs
);
17195 TREE_TYPE (packs
) = make_tree_vec (len
- start
);
17198 /* Loop through all of the arguments that have not yet been
17199 unified and unify each with the pattern. */
17200 for (i
= start
; i
< len
; i
++)
17203 bool any_explicit
= false;
17204 tree arg
= TREE_VEC_ELT (packed_args
, i
);
17206 /* For each parameter pack, set its TMPL_ARG to either NULL_TREE
17207 or the element of its argument pack at the current index if
17208 this argument was explicitly specified. */
17209 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17213 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17216 if (TREE_VALUE (pack
)
17217 && (pargs
= ARGUMENT_PACK_EXPLICIT_ARGS (TREE_VALUE (pack
)))
17218 && (i
- start
< TREE_VEC_LENGTH (pargs
)))
17220 any_explicit
= true;
17221 arg
= TREE_VEC_ELT (pargs
, i
- start
);
17223 TMPL_ARG (targs
, level
, idx
) = arg
;
17226 /* If we had explicit template arguments, substitute them into the
17227 pattern before deduction. */
17230 /* Some arguments might still be unspecified or dependent. */
17232 ++processing_template_decl
;
17233 dependent
= any_dependent_template_arguments_p (targs
);
17235 --processing_template_decl
;
17236 parm
= tsubst (pattern
, targs
,
17237 explain_p
? tf_warning_or_error
: tf_none
,
17240 --processing_template_decl
;
17241 if (parm
== error_mark_node
)
17247 /* Unify the pattern with the current argument. */
17248 if (unify_one_argument (tparms
, targs
, parm
, arg
, subr
, strict
,
17249 LOOKUP_IMPLICIT
, explain_p
))
17252 /* For each parameter pack, collect the deduced value. */
17253 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17256 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17258 TREE_VEC_ELT (TREE_TYPE (pack
), i
- start
) =
17259 TMPL_ARG (targs
, level
, idx
);
17263 /* Verify that the results of unification with the parameter packs
17264 produce results consistent with what we've seen before, and make
17265 the deduced argument packs available. */
17266 for (pack
= packs
; pack
; pack
= TREE_CHAIN (pack
))
17268 tree old_pack
= TREE_VALUE (pack
);
17269 tree new_args
= TREE_TYPE (pack
);
17270 int i
, len
= TREE_VEC_LENGTH (new_args
);
17272 bool nondeduced_p
= false;
17274 /* By default keep the original deduced argument pack.
17275 If necessary, more specific code is going to update the
17276 resulting deduced argument later down in this function. */
17277 template_parm_level_and_index (TREE_PURPOSE (pack
), &level
, &idx
);
17278 TMPL_ARG (targs
, level
, idx
) = old_pack
;
17280 /* If NEW_ARGS contains any NULL_TREE entries, we didn't
17281 actually deduce anything. */
17282 for (i
= 0; i
< len
&& !nondeduced_p
; ++i
)
17283 if (TREE_VEC_ELT (new_args
, i
) == NULL_TREE
)
17284 nondeduced_p
= true;
17288 if (old_pack
&& ARGUMENT_PACK_INCOMPLETE_P (old_pack
))
17290 /* If we had fewer function args than explicit template args,
17291 just use the explicits. */
17292 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17293 int explicit_len
= TREE_VEC_LENGTH (explicit_args
);
17294 if (len
< explicit_len
)
17295 new_args
= explicit_args
;
17301 /* Build the deduced *_ARGUMENT_PACK. */
17302 if (TREE_CODE (TREE_PURPOSE (pack
)) == TEMPLATE_PARM_INDEX
)
17304 result
= make_node (NONTYPE_ARGUMENT_PACK
);
17305 TREE_TYPE (result
) =
17306 TREE_TYPE (TEMPLATE_PARM_DECL (TREE_PURPOSE (pack
)));
17307 TREE_CONSTANT (result
) = 1;
17310 result
= cxx_make_type (TYPE_ARGUMENT_PACK
);
17312 SET_ARGUMENT_PACK_ARGS (result
, new_args
);
17314 /* Note the deduced argument packs for this parameter
17316 TMPL_ARG (targs
, level
, idx
) = result
;
17318 else if (ARGUMENT_PACK_INCOMPLETE_P (old_pack
)
17319 && (ARGUMENT_PACK_ARGS (old_pack
)
17320 == ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
)))
17322 /* We only had the explicitly-provided arguments before, but
17323 now we have a complete set of arguments. */
17324 tree explicit_args
= ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
);
17326 SET_ARGUMENT_PACK_ARGS (old_pack
, new_args
);
17327 ARGUMENT_PACK_INCOMPLETE_P (old_pack
) = 1;
17328 ARGUMENT_PACK_EXPLICIT_ARGS (old_pack
) = explicit_args
;
17332 tree bad_old_arg
= NULL_TREE
, bad_new_arg
= NULL_TREE
;
17333 tree old_args
= ARGUMENT_PACK_ARGS (old_pack
);
17335 if (!comp_template_args_with_info (old_args
, new_args
,
17336 &bad_old_arg
, &bad_new_arg
))
17337 /* Inconsistent unification of this parameter pack. */
17338 return unify_parameter_pack_inconsistent (explain_p
,
17344 return unify_success (explain_p
);
17347 /* Handle unification of the domain of an array. PARM_DOM and ARG_DOM are
17348 INTEGER_TYPEs representing the TYPE_DOMAIN of ARRAY_TYPEs. The other
17349 parameters and return value are as for unify. */
17352 unify_array_domain (tree tparms
, tree targs
,
17353 tree parm_dom
, tree arg_dom
,
17361 /* Our representation of array types uses "N - 1" as the
17362 TYPE_MAX_VALUE for an array with "N" elements, if "N" is
17363 not an integer constant. We cannot unify arbitrarily
17364 complex expressions, so we eliminate the MINUS_EXPRs
17366 parm_max
= TYPE_MAX_VALUE (parm_dom
);
17367 parm_cst
= TREE_CODE (parm_max
) == INTEGER_CST
;
17370 gcc_assert (TREE_CODE (parm_max
) == MINUS_EXPR
);
17371 parm_max
= TREE_OPERAND (parm_max
, 0);
17373 arg_max
= TYPE_MAX_VALUE (arg_dom
);
17374 arg_cst
= TREE_CODE (arg_max
) == INTEGER_CST
;
17377 /* The ARG_MAX may not be a simple MINUS_EXPR, if we are
17378 trying to unify the type of a variable with the type
17379 of a template parameter. For example:
17381 template <unsigned int N>
17382 void f (char (&) [N]);
17389 Here, the type of the ARG will be "int [g(i)]", and
17390 may be a SAVE_EXPR, etc. */
17391 if (TREE_CODE (arg_max
) != MINUS_EXPR
)
17392 return unify_vla_arg (explain_p
, arg_dom
);
17393 arg_max
= TREE_OPERAND (arg_max
, 0);
17396 /* If only one of the bounds used a MINUS_EXPR, compensate
17397 by adding one to the other bound. */
17398 if (parm_cst
&& !arg_cst
)
17399 parm_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17403 else if (arg_cst
&& !parm_cst
)
17404 arg_max
= fold_build2_loc (input_location
, PLUS_EXPR
,
17409 return unify (tparms
, targs
, parm_max
, arg_max
,
17410 UNIFY_ALLOW_INTEGER
, explain_p
);
17413 /* Deduce the value of template parameters. TPARMS is the (innermost)
17414 set of template parameters to a template. TARGS is the bindings
17415 for those template parameters, as determined thus far; TARGS may
17416 include template arguments for outer levels of template parameters
17417 as well. PARM is a parameter to a template function, or a
17418 subcomponent of that parameter; ARG is the corresponding argument.
17419 This function attempts to match PARM with ARG in a manner
17420 consistent with the existing assignments in TARGS. If more values
17421 are deduced, then TARGS is updated.
17423 Returns 0 if the type deduction succeeds, 1 otherwise. The
17424 parameter STRICT is a bitwise or of the following flags:
17427 Require an exact match between PARM and ARG.
17428 UNIFY_ALLOW_MORE_CV_QUAL:
17429 Allow the deduced ARG to be more cv-qualified (by qualification
17430 conversion) than ARG.
17431 UNIFY_ALLOW_LESS_CV_QUAL:
17432 Allow the deduced ARG to be less cv-qualified than ARG.
17433 UNIFY_ALLOW_DERIVED:
17434 Allow the deduced ARG to be a template base class of ARG,
17435 or a pointer to a template base class of the type pointed to by
17437 UNIFY_ALLOW_INTEGER:
17438 Allow any integral type to be deduced. See the TEMPLATE_PARM_INDEX
17439 case for more information.
17440 UNIFY_ALLOW_OUTER_LEVEL:
17441 This is the outermost level of a deduction. Used to determine validity
17442 of qualification conversions. A valid qualification conversion must
17443 have const qualified pointers leading up to the inner type which
17444 requires additional CV quals, except at the outer level, where const
17445 is not required [conv.qual]. It would be normal to set this flag in
17446 addition to setting UNIFY_ALLOW_MORE_CV_QUAL.
17447 UNIFY_ALLOW_OUTER_MORE_CV_QUAL:
17448 This is the outermost level of a deduction, and PARM can be more CV
17449 qualified at this point.
17450 UNIFY_ALLOW_OUTER_LESS_CV_QUAL:
17451 This is the outermost level of a deduction, and PARM can be less CV
17452 qualified at this point. */
17455 unify (tree tparms
, tree targs
, tree parm
, tree arg
, int strict
,
17461 int strict_in
= strict
;
17463 /* I don't think this will do the right thing with respect to types.
17464 But the only case I've seen it in so far has been array bounds, where
17465 signedness is the only information lost, and I think that will be
17467 while (TREE_CODE (parm
) == NOP_EXPR
)
17468 parm
= TREE_OPERAND (parm
, 0);
17470 if (arg
== error_mark_node
)
17471 return unify_invalid (explain_p
);
17472 if (arg
== unknown_type_node
17473 || arg
== init_list_type_node
)
17474 /* We can't deduce anything from this, but we might get all the
17475 template args from other function args. */
17476 return unify_success (explain_p
);
17478 /* If PARM uses template parameters, then we can't bail out here,
17479 even if ARG == PARM, since we won't record unifications for the
17480 template parameters. We might need them if we're trying to
17481 figure out which of two things is more specialized. */
17482 if (arg
== parm
&& !uses_template_parms (parm
))
17483 return unify_success (explain_p
);
17485 /* Handle init lists early, so the rest of the function can assume
17486 we're dealing with a type. */
17487 if (BRACE_ENCLOSED_INITIALIZER_P (arg
))
17491 tree orig_parm
= parm
;
17493 /* Replace T with std::initializer_list<T> for deduction. */
17494 if (TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17495 && flag_deduce_init_list
)
17496 parm
= listify (parm
);
17498 if (!is_std_init_list (parm
)
17499 && TREE_CODE (parm
) != ARRAY_TYPE
)
17500 /* We can only deduce from an initializer list argument if the
17501 parameter is std::initializer_list or an array; otherwise this
17502 is a non-deduced context. */
17503 return unify_success (explain_p
);
17505 if (TREE_CODE (parm
) == ARRAY_TYPE
)
17506 elttype
= TREE_TYPE (parm
);
17508 elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (parm
), 0);
17510 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (arg
), i
, elt
)
17512 int elt_strict
= strict
;
17514 if (elt
== error_mark_node
)
17515 return unify_invalid (explain_p
);
17517 if (!BRACE_ENCLOSED_INITIALIZER_P (elt
))
17519 tree type
= TREE_TYPE (elt
);
17520 /* It should only be possible to get here for a call. */
17521 gcc_assert (elt_strict
& UNIFY_ALLOW_OUTER_LEVEL
);
17522 elt_strict
|= maybe_adjust_types_for_deduction
17523 (DEDUCE_CALL
, &elttype
, &type
, elt
);
17527 RECUR_AND_CHECK_FAILURE (tparms
, targs
, elttype
, elt
, elt_strict
,
17531 if (TREE_CODE (parm
) == ARRAY_TYPE
17532 && deducible_array_bound (TYPE_DOMAIN (parm
)))
17534 /* Also deduce from the length of the initializer list. */
17535 tree max
= size_int (CONSTRUCTOR_NELTS (arg
));
17536 tree idx
= compute_array_index_type (NULL_TREE
, max
, tf_none
);
17537 if (idx
== error_mark_node
)
17538 return unify_invalid (explain_p
);
17539 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17543 /* If the std::initializer_list<T> deduction worked, replace the
17544 deduced A with std::initializer_list<A>. */
17545 if (orig_parm
!= parm
)
17547 idx
= TEMPLATE_TYPE_IDX (orig_parm
);
17548 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17549 targ
= listify (targ
);
17550 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = targ
;
17552 return unify_success (explain_p
);
17555 /* Immediately reject some pairs that won't unify because of
17556 cv-qualification mismatches. */
17557 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17559 /* It is the elements of the array which hold the cv quals of an array
17560 type, and the elements might be template type parms. We'll check
17561 when we recurse. */
17562 && TREE_CODE (arg
) != ARRAY_TYPE
17563 /* We check the cv-qualifiers when unifying with template type
17564 parameters below. We want to allow ARG `const T' to unify with
17565 PARM `T' for example, when computing which of two templates
17566 is more specialized, for example. */
17567 && TREE_CODE (arg
) != TEMPLATE_TYPE_PARM
17568 && !check_cv_quals_for_unify (strict_in
, arg
, parm
))
17569 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17571 if (!(strict
& UNIFY_ALLOW_OUTER_LEVEL
)
17572 && TYPE_P (parm
) && !CP_TYPE_CONST_P (parm
))
17573 strict
&= ~UNIFY_ALLOW_MORE_CV_QUAL
;
17574 strict
&= ~UNIFY_ALLOW_OUTER_LEVEL
;
17575 strict
&= ~UNIFY_ALLOW_DERIVED
;
17576 strict
&= ~UNIFY_ALLOW_OUTER_MORE_CV_QUAL
;
17577 strict
&= ~UNIFY_ALLOW_OUTER_LESS_CV_QUAL
;
17579 switch (TREE_CODE (parm
))
17581 case TYPENAME_TYPE
:
17583 case UNBOUND_CLASS_TEMPLATE
:
17584 /* In a type which contains a nested-name-specifier, template
17585 argument values cannot be deduced for template parameters used
17586 within the nested-name-specifier. */
17587 return unify_success (explain_p
);
17589 case TEMPLATE_TYPE_PARM
:
17590 case TEMPLATE_TEMPLATE_PARM
:
17591 case BOUND_TEMPLATE_TEMPLATE_PARM
:
17592 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17593 if (error_operand_p (tparm
))
17594 return unify_invalid (explain_p
);
17596 if (TEMPLATE_TYPE_LEVEL (parm
)
17597 != template_decl_level (tparm
))
17598 /* The PARM is not one we're trying to unify. Just check
17599 to see if it matches ARG. */
17601 if (TREE_CODE (arg
) == TREE_CODE (parm
)
17602 && (is_auto (parm
) ? is_auto (arg
)
17603 : same_type_p (parm
, arg
)))
17604 return unify_success (explain_p
);
17606 return unify_type_mismatch (explain_p
, parm
, arg
);
17608 idx
= TEMPLATE_TYPE_IDX (parm
);
17609 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17610 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, idx
));
17611 if (error_operand_p (tparm
))
17612 return unify_invalid (explain_p
);
17614 /* Check for mixed types and values. */
17615 if ((TREE_CODE (parm
) == TEMPLATE_TYPE_PARM
17616 && TREE_CODE (tparm
) != TYPE_DECL
)
17617 || (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17618 && TREE_CODE (tparm
) != TEMPLATE_DECL
))
17619 gcc_unreachable ();
17621 if (TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17623 /* ARG must be constructed from a template class or a template
17624 template parameter. */
17625 if (TREE_CODE (arg
) != BOUND_TEMPLATE_TEMPLATE_PARM
17626 && !CLASSTYPE_SPECIALIZATION_OF_PRIMARY_TEMPLATE_P (arg
))
17627 return unify_template_deduction_failure (explain_p
, parm
, arg
);
17629 tree parmvec
= TYPE_TI_ARGS (parm
);
17630 /* An alias template name is never deduced. */
17631 if (TYPE_ALIAS_P (arg
))
17632 arg
= strip_typedefs (arg
);
17633 tree argvec
= INNERMOST_TEMPLATE_ARGS (TYPE_TI_ARGS (arg
));
17634 tree full_argvec
= add_to_template_args (targs
, argvec
);
17636 = DECL_INNERMOST_TEMPLATE_PARMS
17637 (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (parm
));
17639 int parm_variadic_p
= 0;
17641 /* The resolution to DR150 makes clear that default
17642 arguments for an N-argument may not be used to bind T
17643 to a template template parameter with fewer than N
17644 parameters. It is not safe to permit the binding of
17645 default arguments as an extension, as that may change
17646 the meaning of a conforming program. Consider:
17648 struct Dense { static const unsigned int dim = 1; };
17650 template <template <typename> class View,
17652 void operator+(float, View<Block> const&);
17654 template <typename Block,
17655 unsigned int Dim = Block::dim>
17656 struct Lvalue_proxy { operator float() const; };
17660 Lvalue_proxy<Dense> p;
17665 Here, if Lvalue_proxy is permitted to bind to View, then
17666 the global operator+ will be used; if they are not, the
17667 Lvalue_proxy will be converted to float. */
17668 if (coerce_template_parms (parm_parms
,
17670 TYPE_TI_TEMPLATE (parm
),
17672 ? tf_warning_or_error
17674 /*require_all_args=*/true,
17675 /*use_default_args=*/false)
17676 == error_mark_node
)
17679 /* Deduce arguments T, i from TT<T> or TT<i>.
17680 We check each element of PARMVEC and ARGVEC individually
17681 rather than the whole TREE_VEC since they can have
17682 different number of elements. */
17684 parmvec
= expand_template_argument_pack (parmvec
);
17685 argvec
= expand_template_argument_pack (argvec
);
17687 len
= TREE_VEC_LENGTH (parmvec
);
17689 /* Check if the parameters end in a pack, making them
17692 && PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, len
- 1)))
17693 parm_variadic_p
= 1;
17695 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17696 /* If the template argument list of P contains a pack
17697 expansion that is not the last template argument, the
17698 entire template argument list is a non-deduced
17700 if (PACK_EXPANSION_P (TREE_VEC_ELT (parmvec
, i
)))
17701 return unify_success (explain_p
);
17703 if (TREE_VEC_LENGTH (argvec
) < len
- parm_variadic_p
)
17704 return unify_too_few_arguments (explain_p
,
17705 TREE_VEC_LENGTH (argvec
), len
);
17707 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17709 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17710 TREE_VEC_ELT (parmvec
, i
),
17711 TREE_VEC_ELT (argvec
, i
),
17712 UNIFY_ALLOW_NONE
, explain_p
);
17715 if (parm_variadic_p
17716 && unify_pack_expansion (tparms
, targs
,
17719 /*subr=*/true, explain_p
))
17722 arg
= TYPE_TI_TEMPLATE (arg
);
17724 /* Fall through to deduce template name. */
17727 if (TREE_CODE (parm
) == TEMPLATE_TEMPLATE_PARM
17728 || TREE_CODE (parm
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
17730 /* Deduce template name TT from TT, TT<>, TT<T> and TT<i>. */
17732 /* Simple cases: Value already set, does match or doesn't. */
17733 if (targ
!= NULL_TREE
&& template_args_equal (targ
, arg
))
17734 return unify_success (explain_p
);
17736 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17740 /* If PARM is `const T' and ARG is only `int', we don't have
17741 a match unless we are allowing additional qualification.
17742 If ARG is `const int' and PARM is just `T' that's OK;
17743 that binds `const int' to `T'. */
17744 if (!check_cv_quals_for_unify (strict_in
| UNIFY_ALLOW_LESS_CV_QUAL
,
17746 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
17748 /* Consider the case where ARG is `const volatile int' and
17749 PARM is `const T'. Then, T should be `volatile int'. */
17750 arg
= cp_build_qualified_type_real
17751 (arg
, cp_type_quals (arg
) & ~cp_type_quals (parm
), tf_none
);
17752 if (arg
== error_mark_node
)
17753 return unify_invalid (explain_p
);
17755 /* Simple cases: Value already set, does match or doesn't. */
17756 if (targ
!= NULL_TREE
&& same_type_p (targ
, arg
))
17757 return unify_success (explain_p
);
17759 return unify_inconsistency (explain_p
, parm
, targ
, arg
);
17761 /* Make sure that ARG is not a variable-sized array. (Note
17762 that were talking about variable-sized arrays (like
17763 `int[n]'), rather than arrays of unknown size (like
17764 `int[]').) We'll get very confused by such a type since
17765 the bound of the array is not constant, and therefore
17766 not mangleable. Besides, such types are not allowed in
17767 ISO C++, so we can do as we please here. We do allow
17768 them for 'auto' deduction, since that isn't ABI-exposed. */
17769 if (!is_auto (parm
) && variably_modified_type_p (arg
, NULL_TREE
))
17770 return unify_vla_arg (explain_p
, arg
);
17772 /* Strip typedefs as in convert_template_argument. */
17773 arg
= canonicalize_type_argument (arg
, tf_none
);
17776 /* If ARG is a parameter pack or an expansion, we cannot unify
17777 against it unless PARM is also a parameter pack. */
17778 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
17779 && !template_parameter_pack_p (parm
))
17780 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
17782 /* If the argument deduction results is a METHOD_TYPE,
17783 then there is a problem.
17784 METHOD_TYPE doesn't map to any real C++ type the result of
17785 the deduction can not be of that type. */
17786 if (TREE_CODE (arg
) == METHOD_TYPE
)
17787 return unify_method_type_error (explain_p
, arg
);
17789 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
17790 return unify_success (explain_p
);
17792 case TEMPLATE_PARM_INDEX
:
17793 tparm
= TREE_VALUE (TREE_VEC_ELT (tparms
, 0));
17794 if (error_operand_p (tparm
))
17795 return unify_invalid (explain_p
);
17797 if (TEMPLATE_PARM_LEVEL (parm
)
17798 != template_decl_level (tparm
))
17800 /* The PARM is not one we're trying to unify. Just check
17801 to see if it matches ARG. */
17802 int result
= !(TREE_CODE (arg
) == TREE_CODE (parm
)
17803 && cp_tree_equal (parm
, arg
));
17805 unify_expression_unequal (explain_p
, parm
, arg
);
17809 idx
= TEMPLATE_PARM_IDX (parm
);
17810 targ
= TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
);
17814 int x
= !cp_tree_equal (targ
, arg
);
17816 unify_inconsistency (explain_p
, parm
, targ
, arg
);
17820 /* [temp.deduct.type] If, in the declaration of a function template
17821 with a non-type template-parameter, the non-type
17822 template-parameter is used in an expression in the function
17823 parameter-list and, if the corresponding template-argument is
17824 deduced, the template-argument type shall match the type of the
17825 template-parameter exactly, except that a template-argument
17826 deduced from an array bound may be of any integral type.
17827 The non-type parameter might use already deduced type parameters. */
17828 tparm
= tsubst (TREE_TYPE (parm
), targs
, 0, NULL_TREE
);
17829 if (!TREE_TYPE (arg
))
17830 /* Template-parameter dependent expression. Just accept it for now.
17831 It will later be processed in convert_template_argument. */
17833 else if (same_type_p (TREE_TYPE (arg
), tparm
))
17835 else if ((strict
& UNIFY_ALLOW_INTEGER
)
17836 && CP_INTEGRAL_TYPE_P (tparm
))
17837 /* Convert the ARG to the type of PARM; the deduced non-type
17838 template argument must exactly match the types of the
17839 corresponding parameter. */
17840 arg
= fold (build_nop (tparm
, arg
));
17841 else if (uses_template_parms (tparm
))
17842 /* We haven't deduced the type of this parameter yet. Try again
17844 return unify_success (explain_p
);
17846 return unify_type_mismatch (explain_p
, tparm
, TREE_TYPE (arg
));
17848 /* If ARG is a parameter pack or an expansion, we cannot unify
17849 against it unless PARM is also a parameter pack. */
17850 if ((template_parameter_pack_p (arg
) || PACK_EXPANSION_P (arg
))
17851 && !TEMPLATE_PARM_PARAMETER_PACK (parm
))
17852 return unify_parameter_pack_mismatch (explain_p
, parm
, arg
);
17854 arg
= strip_typedefs_expr (arg
);
17855 TREE_VEC_ELT (INNERMOST_TEMPLATE_ARGS (targs
), idx
) = arg
;
17856 return unify_success (explain_p
);
17860 /* A pointer-to-member constant can be unified only with
17861 another constant. */
17862 if (TREE_CODE (arg
) != PTRMEM_CST
)
17863 return unify_ptrmem_cst_mismatch (explain_p
, parm
, arg
);
17865 /* Just unify the class member. It would be useless (and possibly
17866 wrong, depending on the strict flags) to unify also
17867 PTRMEM_CST_CLASS, because we want to be sure that both parm and
17868 arg refer to the same variable, even if through different
17869 classes. For instance:
17871 struct A { int x; };
17874 Unification of &A::x and &B::x must succeed. */
17875 return unify (tparms
, targs
, PTRMEM_CST_MEMBER (parm
),
17876 PTRMEM_CST_MEMBER (arg
), strict
, explain_p
);
17881 if (!TYPE_PTR_P (arg
))
17882 return unify_type_mismatch (explain_p
, parm
, arg
);
17884 /* [temp.deduct.call]
17886 A can be another pointer or pointer to member type that can
17887 be converted to the deduced A via a qualification
17888 conversion (_conv.qual_).
17890 We pass down STRICT here rather than UNIFY_ALLOW_NONE.
17891 This will allow for additional cv-qualification of the
17892 pointed-to types if appropriate. */
17894 if (TREE_CODE (TREE_TYPE (arg
)) == RECORD_TYPE
)
17895 /* The derived-to-base conversion only persists through one
17896 level of pointers. */
17897 strict
|= (strict_in
& UNIFY_ALLOW_DERIVED
);
17899 return unify (tparms
, targs
, TREE_TYPE (parm
),
17900 TREE_TYPE (arg
), strict
, explain_p
);
17903 case REFERENCE_TYPE
:
17904 if (TREE_CODE (arg
) != REFERENCE_TYPE
)
17905 return unify_type_mismatch (explain_p
, parm
, arg
);
17906 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
17907 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
17910 if (TREE_CODE (arg
) != ARRAY_TYPE
)
17911 return unify_type_mismatch (explain_p
, parm
, arg
);
17912 if ((TYPE_DOMAIN (parm
) == NULL_TREE
)
17913 != (TYPE_DOMAIN (arg
) == NULL_TREE
))
17914 return unify_type_mismatch (explain_p
, parm
, arg
);
17915 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
17916 strict
& UNIFY_ALLOW_MORE_CV_QUAL
, explain_p
);
17917 if (TYPE_DOMAIN (parm
) != NULL_TREE
)
17918 return unify_array_domain (tparms
, targs
, TYPE_DOMAIN (parm
),
17919 TYPE_DOMAIN (arg
), explain_p
);
17920 return unify_success (explain_p
);
17927 case ENUMERAL_TYPE
:
17930 if (TREE_CODE (arg
) != TREE_CODE (parm
))
17931 return unify_type_mismatch (explain_p
, parm
, arg
);
17933 /* We have already checked cv-qualification at the top of the
17935 if (!same_type_ignoring_top_level_qualifiers_p (arg
, parm
))
17936 return unify_type_mismatch (explain_p
, parm
, arg
);
17938 /* As far as unification is concerned, this wins. Later checks
17939 will invalidate it if necessary. */
17940 return unify_success (explain_p
);
17942 /* Types INTEGER_CST and MINUS_EXPR can come from array bounds. */
17943 /* Type INTEGER_CST can come from ordinary constant template args. */
17945 while (TREE_CODE (arg
) == NOP_EXPR
)
17946 arg
= TREE_OPERAND (arg
, 0);
17948 if (TREE_CODE (arg
) != INTEGER_CST
)
17949 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17950 return (tree_int_cst_equal (parm
, arg
)
17951 ? unify_success (explain_p
)
17952 : unify_template_argument_mismatch (explain_p
, parm
, arg
));
17956 int i
, len
, argslen
;
17957 int parm_variadic_p
= 0;
17959 if (TREE_CODE (arg
) != TREE_VEC
)
17960 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
17962 len
= TREE_VEC_LENGTH (parm
);
17963 argslen
= TREE_VEC_LENGTH (arg
);
17965 /* Check for pack expansions in the parameters. */
17966 for (i
= 0; i
< len
; ++i
)
17968 if (PACK_EXPANSION_P (TREE_VEC_ELT (parm
, i
)))
17971 /* We can unify against something with a trailing
17973 parm_variadic_p
= 1;
17975 /* [temp.deduct.type]/9: If the template argument list of
17976 P contains a pack expansion that is not the last
17977 template argument, the entire template argument list
17978 is a non-deduced context. */
17979 return unify_success (explain_p
);
17983 /* If we don't have enough arguments to satisfy the parameters
17984 (not counting the pack expression at the end), or we have
17985 too many arguments for a parameter list that doesn't end in
17986 a pack expression, we can't unify. */
17987 if (parm_variadic_p
17988 ? argslen
< len
- parm_variadic_p
17990 return unify_arity (explain_p
, TREE_VEC_LENGTH (arg
), len
);
17992 /* Unify all of the parameters that precede the (optional)
17993 pack expression. */
17994 for (i
= 0; i
< len
- parm_variadic_p
; ++i
)
17996 RECUR_AND_CHECK_FAILURE (tparms
, targs
,
17997 TREE_VEC_ELT (parm
, i
),
17998 TREE_VEC_ELT (arg
, i
),
17999 UNIFY_ALLOW_NONE
, explain_p
);
18001 if (parm_variadic_p
)
18002 return unify_pack_expansion (tparms
, targs
, parm
, arg
,
18004 /*subr=*/true, explain_p
);
18005 return unify_success (explain_p
);
18010 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18011 return unify_type_mismatch (explain_p
, parm
, arg
);
18013 if (TYPE_PTRMEMFUNC_P (parm
))
18015 if (!TYPE_PTRMEMFUNC_P (arg
))
18016 return unify_type_mismatch (explain_p
, parm
, arg
);
18018 return unify (tparms
, targs
,
18019 TYPE_PTRMEMFUNC_FN_TYPE (parm
),
18020 TYPE_PTRMEMFUNC_FN_TYPE (arg
),
18021 strict
, explain_p
);
18024 if (CLASSTYPE_TEMPLATE_INFO (parm
))
18026 tree t
= NULL_TREE
;
18028 if (strict_in
& UNIFY_ALLOW_DERIVED
)
18030 /* First, we try to unify the PARM and ARG directly. */
18031 t
= try_class_unification (tparms
, targs
,
18032 parm
, arg
, explain_p
);
18036 /* Fallback to the special case allowed in
18037 [temp.deduct.call]:
18039 If P is a class, and P has the form
18040 template-id, then A can be a derived class of
18041 the deduced A. Likewise, if P is a pointer to
18042 a class of the form template-id, A can be a
18043 pointer to a derived class pointed to by the
18045 enum template_base_result r
;
18046 r
= get_template_base (tparms
, targs
, parm
, arg
,
18050 return unify_no_common_base (explain_p
, r
, parm
, arg
);
18053 else if (CLASSTYPE_TEMPLATE_INFO (arg
)
18054 && (CLASSTYPE_TI_TEMPLATE (parm
)
18055 == CLASSTYPE_TI_TEMPLATE (arg
)))
18056 /* Perhaps PARM is something like S<U> and ARG is S<int>.
18057 Then, we should unify `int' and `U'. */
18060 /* There's no chance of unification succeeding. */
18061 return unify_type_mismatch (explain_p
, parm
, arg
);
18063 return unify (tparms
, targs
, CLASSTYPE_TI_ARGS (parm
),
18064 CLASSTYPE_TI_ARGS (t
), UNIFY_ALLOW_NONE
, explain_p
);
18066 else if (!same_type_ignoring_top_level_qualifiers_p (parm
, arg
))
18067 return unify_type_mismatch (explain_p
, parm
, arg
);
18068 return unify_success (explain_p
);
18071 case FUNCTION_TYPE
:
18073 unsigned int nargs
;
18078 if (TREE_CODE (arg
) != TREE_CODE (parm
))
18079 return unify_type_mismatch (explain_p
, parm
, arg
);
18081 /* CV qualifications for methods can never be deduced, they must
18082 match exactly. We need to check them explicitly here,
18083 because type_unification_real treats them as any other
18084 cv-qualified parameter. */
18085 if (TREE_CODE (parm
) == METHOD_TYPE
18086 && (!check_cv_quals_for_unify
18088 class_of_this_parm (arg
),
18089 class_of_this_parm (parm
))))
18090 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18092 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TREE_TYPE (parm
),
18093 TREE_TYPE (arg
), UNIFY_ALLOW_NONE
, explain_p
);
18095 nargs
= list_length (TYPE_ARG_TYPES (arg
));
18096 args
= XALLOCAVEC (tree
, nargs
);
18097 for (a
= TYPE_ARG_TYPES (arg
), i
= 0;
18098 a
!= NULL_TREE
&& a
!= void_list_node
;
18099 a
= TREE_CHAIN (a
), ++i
)
18100 args
[i
] = TREE_VALUE (a
);
18103 return type_unification_real (tparms
, targs
, TYPE_ARG_TYPES (parm
),
18104 args
, nargs
, 1, DEDUCE_EXACT
,
18105 LOOKUP_NORMAL
, NULL
, explain_p
);
18109 /* Unify a pointer to member with a pointer to member function, which
18110 deduces the type of the member as a function type. */
18111 if (TYPE_PTRMEMFUNC_P (arg
))
18113 /* Check top-level cv qualifiers */
18114 if (!check_cv_quals_for_unify (UNIFY_ALLOW_NONE
, arg
, parm
))
18115 return unify_cv_qual_mismatch (explain_p
, parm
, arg
);
18117 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18118 TYPE_PTRMEMFUNC_OBJECT_TYPE (arg
),
18119 UNIFY_ALLOW_NONE
, explain_p
);
18121 /* Determine the type of the function we are unifying against. */
18122 tree fntype
= static_fn_type (arg
);
18124 return unify (tparms
, targs
, TREE_TYPE (parm
), fntype
, strict
, explain_p
);
18127 if (TREE_CODE (arg
) != OFFSET_TYPE
)
18128 return unify_type_mismatch (explain_p
, parm
, arg
);
18129 RECUR_AND_CHECK_FAILURE (tparms
, targs
, TYPE_OFFSET_BASETYPE (parm
),
18130 TYPE_OFFSET_BASETYPE (arg
),
18131 UNIFY_ALLOW_NONE
, explain_p
);
18132 return unify (tparms
, targs
, TREE_TYPE (parm
), TREE_TYPE (arg
),
18133 strict
, explain_p
);
18136 if (DECL_TEMPLATE_PARM_P (parm
))
18137 return unify (tparms
, targs
, DECL_INITIAL (parm
), arg
, strict
, explain_p
);
18138 if (arg
!= integral_constant_value (parm
))
18139 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18140 return unify_success (explain_p
);
18143 case TEMPLATE_DECL
:
18144 /* Matched cases are handled by the ARG == PARM test above. */
18145 return unify_template_argument_mismatch (explain_p
, parm
, arg
);
18148 /* A non-type template parameter that is a variable should be a
18149 an integral constant, in which case, it whould have been
18150 folded into its (constant) value. So we should not be getting
18151 a variable here. */
18152 gcc_unreachable ();
18154 case TYPE_ARGUMENT_PACK
:
18155 case NONTYPE_ARGUMENT_PACK
:
18156 return unify (tparms
, targs
, ARGUMENT_PACK_ARGS (parm
),
18157 ARGUMENT_PACK_ARGS (arg
), strict
, explain_p
);
18160 case DECLTYPE_TYPE
:
18161 case UNDERLYING_TYPE
:
18162 /* Cannot deduce anything from TYPEOF_TYPE, DECLTYPE_TYPE,
18163 or UNDERLYING_TYPE nodes. */
18164 return unify_success (explain_p
);
18167 /* Unification fails if we hit an error node. */
18168 return unify_invalid (explain_p
);
18171 if (REFERENCE_REF_P (parm
))
18172 return unify (tparms
, targs
, TREE_OPERAND (parm
, 0), arg
,
18173 strict
, explain_p
);
18177 /* An unresolved overload is a nondeduced context. */
18178 if (is_overloaded_fn (parm
) || type_unknown_p (parm
))
18179 return unify_success (explain_p
);
18180 gcc_assert (EXPR_P (parm
));
18182 /* We must be looking at an expression. This can happen with
18186 void foo(S<I>, S<I + 2>);
18188 This is a "nondeduced context":
18192 The nondeduced contexts are:
18194 --A type that is a template-id in which one or more of
18195 the template-arguments is an expression that references
18196 a template-parameter.
18198 In these cases, we assume deduction succeeded, but don't
18199 actually infer any unifications. */
18201 if (!uses_template_parms (parm
)
18202 && !template_args_equal (parm
, arg
))
18203 return unify_expression_unequal (explain_p
, parm
, arg
);
18205 return unify_success (explain_p
);
18208 #undef RECUR_AND_CHECK_FAILURE
18210 /* Note that DECL can be defined in this translation unit, if
18214 mark_definable (tree decl
)
18217 DECL_NOT_REALLY_EXTERN (decl
) = 1;
18218 FOR_EACH_CLONE (clone
, decl
)
18219 DECL_NOT_REALLY_EXTERN (clone
) = 1;
18222 /* Called if RESULT is explicitly instantiated, or is a member of an
18223 explicitly instantiated class. */
18226 mark_decl_instantiated (tree result
, int extern_p
)
18228 SET_DECL_EXPLICIT_INSTANTIATION (result
);
18230 /* If this entity has already been written out, it's too late to
18231 make any modifications. */
18232 if (TREE_ASM_WRITTEN (result
))
18235 /* For anonymous namespace we don't need to do anything. */
18236 if (decl_anon_ns_mem_p (result
))
18238 gcc_assert (!TREE_PUBLIC (result
));
18242 if (TREE_CODE (result
) != FUNCTION_DECL
)
18243 /* The TREE_PUBLIC flag for function declarations will have been
18244 set correctly by tsubst. */
18245 TREE_PUBLIC (result
) = 1;
18247 /* This might have been set by an earlier implicit instantiation. */
18248 DECL_COMDAT (result
) = 0;
18251 DECL_NOT_REALLY_EXTERN (result
) = 0;
18254 mark_definable (result
);
18255 mark_needed (result
);
18256 /* Always make artificials weak. */
18257 if (DECL_ARTIFICIAL (result
) && flag_weak
)
18258 comdat_linkage (result
);
18259 /* For WIN32 we also want to put explicit instantiations in
18260 linkonce sections. */
18261 else if (TREE_PUBLIC (result
))
18262 maybe_make_one_only (result
);
18265 /* If EXTERN_P, then this function will not be emitted -- unless
18266 followed by an explicit instantiation, at which point its linkage
18267 will be adjusted. If !EXTERN_P, then this function will be
18268 emitted here. In neither circumstance do we want
18269 import_export_decl to adjust the linkage. */
18270 DECL_INTERFACE_KNOWN (result
) = 1;
18273 /* Subroutine of more_specialized_fn: check whether TARGS is missing any
18274 important template arguments. If any are missing, we check whether
18275 they're important by using error_mark_node for substituting into any
18276 args that were used for partial ordering (the ones between ARGS and END)
18277 and seeing if it bubbles up. */
18280 check_undeduced_parms (tree targs
, tree args
, tree end
)
18282 bool found
= false;
18284 for (i
= TREE_VEC_LENGTH (targs
) - 1; i
>= 0; --i
)
18285 if (TREE_VEC_ELT (targs
, i
) == NULL_TREE
)
18288 TREE_VEC_ELT (targs
, i
) = error_mark_node
;
18292 tree substed
= tsubst_arg_types (args
, targs
, end
, tf_none
, NULL_TREE
);
18293 if (substed
== error_mark_node
)
18299 /* Given two function templates PAT1 and PAT2, return:
18301 1 if PAT1 is more specialized than PAT2 as described in [temp.func.order].
18302 -1 if PAT2 is more specialized than PAT1.
18303 0 if neither is more specialized.
18305 LEN indicates the number of parameters we should consider
18306 (defaulted parameters should not be considered).
18308 The 1998 std underspecified function template partial ordering, and
18309 DR214 addresses the issue. We take pairs of arguments, one from
18310 each of the templates, and deduce them against each other. One of
18311 the templates will be more specialized if all the *other*
18312 template's arguments deduce against its arguments and at least one
18313 of its arguments *does* *not* deduce against the other template's
18314 corresponding argument. Deduction is done as for class templates.
18315 The arguments used in deduction have reference and top level cv
18316 qualifiers removed. Iff both arguments were originally reference
18317 types *and* deduction succeeds in both directions, an lvalue reference
18318 wins against an rvalue reference and otherwise the template
18319 with the more cv-qualified argument wins for that pairing (if
18320 neither is more cv-qualified, they both are equal). Unlike regular
18321 deduction, after all the arguments have been deduced in this way,
18322 we do *not* verify the deduced template argument values can be
18323 substituted into non-deduced contexts.
18325 The logic can be a bit confusing here, because we look at deduce1 and
18326 targs1 to see if pat2 is at least as specialized, and vice versa; if we
18327 can find template arguments for pat1 to make arg1 look like arg2, that
18328 means that arg2 is at least as specialized as arg1. */
18331 more_specialized_fn (tree pat1
, tree pat2
, int len
)
18333 tree decl1
= DECL_TEMPLATE_RESULT (pat1
);
18334 tree decl2
= DECL_TEMPLATE_RESULT (pat2
);
18335 tree targs1
= make_tree_vec (DECL_NTPARMS (pat1
));
18336 tree targs2
= make_tree_vec (DECL_NTPARMS (pat2
));
18337 tree tparms1
= DECL_INNERMOST_TEMPLATE_PARMS (pat1
);
18338 tree tparms2
= DECL_INNERMOST_TEMPLATE_PARMS (pat2
);
18339 tree args1
= TYPE_ARG_TYPES (TREE_TYPE (decl1
));
18340 tree args2
= TYPE_ARG_TYPES (TREE_TYPE (decl2
));
18341 tree origs1
, origs2
;
18342 bool lose1
= false;
18343 bool lose2
= false;
18345 /* Remove the this parameter from non-static member functions. If
18346 one is a non-static member function and the other is not a static
18347 member function, remove the first parameter from that function
18348 also. This situation occurs for operator functions where we
18349 locate both a member function (with this pointer) and non-member
18350 operator (with explicit first operand). */
18351 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl1
))
18353 len
--; /* LEN is the number of significant arguments for DECL1 */
18354 args1
= TREE_CHAIN (args1
);
18355 if (!DECL_STATIC_FUNCTION_P (decl2
))
18356 args2
= TREE_CHAIN (args2
);
18358 else if (DECL_NONSTATIC_MEMBER_FUNCTION_P (decl2
))
18360 args2
= TREE_CHAIN (args2
);
18361 if (!DECL_STATIC_FUNCTION_P (decl1
))
18364 args1
= TREE_CHAIN (args1
);
18368 /* If only one is a conversion operator, they are unordered. */
18369 if (DECL_CONV_FN_P (decl1
) != DECL_CONV_FN_P (decl2
))
18372 /* Consider the return type for a conversion function */
18373 if (DECL_CONV_FN_P (decl1
))
18375 args1
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl1
)), args1
);
18376 args2
= tree_cons (NULL_TREE
, TREE_TYPE (TREE_TYPE (decl2
)), args2
);
18380 processing_template_decl
++;
18386 /* Stop when an ellipsis is seen. */
18387 && args1
!= NULL_TREE
&& args2
!= NULL_TREE
)
18389 tree arg1
= TREE_VALUE (args1
);
18390 tree arg2
= TREE_VALUE (args2
);
18391 int deduce1
, deduce2
;
18397 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18398 && TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18400 /* When both arguments are pack expansions, we need only
18401 unify the patterns themselves. */
18402 arg1
= PACK_EXPANSION_PATTERN (arg1
);
18403 arg2
= PACK_EXPANSION_PATTERN (arg2
);
18405 /* This is the last comparison we need to do. */
18409 if (TREE_CODE (arg1
) == REFERENCE_TYPE
)
18411 ref1
= TYPE_REF_IS_RVALUE (arg1
) + 1;
18412 arg1
= TREE_TYPE (arg1
);
18413 quals1
= cp_type_quals (arg1
);
18416 if (TREE_CODE (arg2
) == REFERENCE_TYPE
)
18418 ref2
= TYPE_REF_IS_RVALUE (arg2
) + 1;
18419 arg2
= TREE_TYPE (arg2
);
18420 quals2
= cp_type_quals (arg2
);
18423 arg1
= TYPE_MAIN_VARIANT (arg1
);
18424 arg2
= TYPE_MAIN_VARIANT (arg2
);
18426 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
)
18428 int i
, len2
= list_length (args2
);
18429 tree parmvec
= make_tree_vec (1);
18430 tree argvec
= make_tree_vec (len2
);
18433 /* Setup the parameter vector, which contains only ARG1. */
18434 TREE_VEC_ELT (parmvec
, 0) = arg1
;
18436 /* Setup the argument vector, which contains the remaining
18438 for (i
= 0; i
< len2
; i
++, ta
= TREE_CHAIN (ta
))
18439 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18441 deduce1
= (unify_pack_expansion (tparms1
, targs1
, parmvec
,
18442 argvec
, DEDUCE_EXACT
,
18443 /*subr=*/true, /*explain_p=*/false)
18446 /* We cannot deduce in the other direction, because ARG1 is
18447 a pack expansion but ARG2 is not. */
18450 else if (TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18452 int i
, len1
= list_length (args1
);
18453 tree parmvec
= make_tree_vec (1);
18454 tree argvec
= make_tree_vec (len1
);
18457 /* Setup the parameter vector, which contains only ARG1. */
18458 TREE_VEC_ELT (parmvec
, 0) = arg2
;
18460 /* Setup the argument vector, which contains the remaining
18462 for (i
= 0; i
< len1
; i
++, ta
= TREE_CHAIN (ta
))
18463 TREE_VEC_ELT (argvec
, i
) = TREE_VALUE (ta
);
18465 deduce2
= (unify_pack_expansion (tparms2
, targs2
, parmvec
,
18466 argvec
, DEDUCE_EXACT
,
18467 /*subr=*/true, /*explain_p=*/false)
18470 /* We cannot deduce in the other direction, because ARG2 is
18471 a pack expansion but ARG1 is not.*/
18477 /* The normal case, where neither argument is a pack
18479 deduce1
= (unify (tparms1
, targs1
, arg1
, arg2
,
18480 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18482 deduce2
= (unify (tparms2
, targs2
, arg2
, arg1
,
18483 UNIFY_ALLOW_NONE
, /*explain_p=*/false)
18487 /* If we couldn't deduce arguments for tparms1 to make arg1 match
18488 arg2, then arg2 is not as specialized as arg1. */
18494 /* "If, for a given type, deduction succeeds in both directions
18495 (i.e., the types are identical after the transformations above)
18496 and both P and A were reference types (before being replaced with
18497 the type referred to above):
18498 - if the type from the argument template was an lvalue reference and
18499 the type from the parameter template was not, the argument type is
18500 considered to be more specialized than the other; otherwise,
18501 - if the type from the argument template is more cv-qualified
18502 than the type from the parameter template (as described above),
18503 the argument type is considered to be more specialized than the other;
18505 - neither type is more specialized than the other." */
18507 if (deduce1
&& deduce2
)
18509 if (ref1
&& ref2
&& ref1
!= ref2
)
18516 else if (quals1
!= quals2
&& quals1
>= 0 && quals2
>= 0)
18518 if ((quals1
& quals2
) == quals2
)
18520 if ((quals1
& quals2
) == quals1
)
18525 if (lose1
&& lose2
)
18526 /* We've failed to deduce something in either direction.
18527 These must be unordered. */
18530 if (TREE_CODE (arg1
) == TYPE_PACK_EXPANSION
18531 || TREE_CODE (arg2
) == TYPE_PACK_EXPANSION
)
18532 /* We have already processed all of the arguments in our
18533 handing of the pack expansion type. */
18536 args1
= TREE_CHAIN (args1
);
18537 args2
= TREE_CHAIN (args2
);
18540 /* "In most cases, all template parameters must have values in order for
18541 deduction to succeed, but for partial ordering purposes a template
18542 parameter may remain without a value provided it is not used in the
18543 types being used for partial ordering."
18545 Thus, if we are missing any of the targs1 we need to substitute into
18546 origs1, then pat2 is not as specialized as pat1. This can happen when
18547 there is a nondeduced context. */
18548 if (!lose2
&& check_undeduced_parms (targs1
, origs1
, args1
))
18550 if (!lose1
&& check_undeduced_parms (targs2
, origs2
, args2
))
18553 processing_template_decl
--;
18555 /* All things being equal, if the next argument is a pack expansion
18556 for one function but not for the other, prefer the
18557 non-variadic function. FIXME this is bogus; see c++/41958. */
18559 && args1
&& TREE_VALUE (args1
)
18560 && args2
&& TREE_VALUE (args2
))
18562 lose1
= TREE_CODE (TREE_VALUE (args1
)) == TYPE_PACK_EXPANSION
;
18563 lose2
= TREE_CODE (TREE_VALUE (args2
)) == TYPE_PACK_EXPANSION
;
18566 if (lose1
== lose2
)
18574 /* Determine which of two partial specializations of TMPL is more
18577 PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding
18578 to the first partial specialization. The TREE_VALUE is the
18579 innermost set of template parameters for the partial
18580 specialization. PAT2 is similar, but for the second template.
18582 Return 1 if the first partial specialization is more specialized;
18583 -1 if the second is more specialized; 0 if neither is more
18586 See [temp.class.order] for information about determining which of
18587 two templates is more specialized. */
18590 more_specialized_class (tree tmpl
, tree pat1
, tree pat2
)
18595 bool any_deductions
= false;
18597 tmpl1
= TREE_TYPE (pat1
);
18598 tmpl2
= TREE_TYPE (pat2
);
18600 /* Just like what happens for functions, if we are ordering between
18601 different class template specializations, we may encounter dependent
18602 types in the arguments, and we need our dependency check functions
18603 to behave correctly. */
18604 ++processing_template_decl
;
18605 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat1
),
18606 CLASSTYPE_TI_ARGS (tmpl1
),
18607 CLASSTYPE_TI_ARGS (tmpl2
));
18611 any_deductions
= true;
18614 targs
= get_class_bindings (tmpl
, TREE_VALUE (pat2
),
18615 CLASSTYPE_TI_ARGS (tmpl2
),
18616 CLASSTYPE_TI_ARGS (tmpl1
));
18620 any_deductions
= true;
18622 --processing_template_decl
;
18624 /* In the case of a tie where at least one of the class templates
18625 has a parameter pack at the end, the template with the most
18626 non-packed parameters wins. */
18629 && (template_args_variadic_p (TREE_PURPOSE (pat1
))
18630 || template_args_variadic_p (TREE_PURPOSE (pat2
))))
18632 tree args1
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat1
));
18633 tree args2
= INNERMOST_TEMPLATE_ARGS (TREE_PURPOSE (pat2
));
18634 int len1
= TREE_VEC_LENGTH (args1
);
18635 int len2
= TREE_VEC_LENGTH (args2
);
18637 /* We don't count the pack expansion at the end. */
18638 if (template_args_variadic_p (TREE_PURPOSE (pat1
)))
18640 if (template_args_variadic_p (TREE_PURPOSE (pat2
)))
18645 else if (len1
< len2
)
18652 /* Return the template arguments that will produce the function signature
18653 DECL from the function template FN, with the explicit template
18654 arguments EXPLICIT_ARGS. If CHECK_RETTYPE is true, the return type must
18655 also match. Return NULL_TREE if no satisfactory arguments could be
18659 get_bindings (tree fn
, tree decl
, tree explicit_args
, bool check_rettype
)
18661 int ntparms
= DECL_NTPARMS (fn
);
18662 tree targs
= make_tree_vec (ntparms
);
18663 tree decl_type
= TREE_TYPE (decl
);
18664 tree decl_arg_types
;
18666 unsigned int nargs
, ix
;
18669 gcc_assert (decl
!= DECL_TEMPLATE_RESULT (fn
));
18671 /* Never do unification on the 'this' parameter. */
18672 decl_arg_types
= skip_artificial_parms_for (decl
,
18673 TYPE_ARG_TYPES (decl_type
));
18675 nargs
= list_length (decl_arg_types
);
18676 args
= XALLOCAVEC (tree
, nargs
);
18677 for (arg
= decl_arg_types
, ix
= 0;
18678 arg
!= NULL_TREE
&& arg
!= void_list_node
;
18679 arg
= TREE_CHAIN (arg
), ++ix
)
18680 args
[ix
] = TREE_VALUE (arg
);
18682 if (fn_type_unification (fn
, explicit_args
, targs
,
18684 (check_rettype
|| DECL_CONV_FN_P (fn
)
18685 ? TREE_TYPE (decl_type
) : NULL_TREE
),
18686 DEDUCE_EXACT
, LOOKUP_NORMAL
, /*explain_p=*/false,
18688 == error_mark_node
)
18694 /* Return the innermost template arguments that, when applied to a partial
18695 specialization of TMPL whose innermost template parameters are
18696 TPARMS, and whose specialization arguments are SPEC_ARGS, yield the
18699 For example, suppose we have:
18701 template <class T, class U> struct S {};
18702 template <class T> struct S<T*, int> {};
18704 Then, suppose we want to get `S<double*, int>'. The TPARMS will be
18705 {T}, the SPEC_ARGS will be {T*, int} and the ARGS will be {double*,
18706 int}. The resulting vector will be {double}, indicating that `T'
18707 is bound to `double'. */
18710 get_class_bindings (tree tmpl
, tree tparms
, tree spec_args
, tree args
)
18712 int i
, ntparms
= TREE_VEC_LENGTH (tparms
);
18714 tree innermost_deduced_args
;
18716 innermost_deduced_args
= make_tree_vec (ntparms
);
18717 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18719 deduced_args
= copy_node (args
);
18720 SET_TMPL_ARGS_LEVEL (deduced_args
,
18721 TMPL_ARGS_DEPTH (deduced_args
),
18722 innermost_deduced_args
);
18725 deduced_args
= innermost_deduced_args
;
18727 if (unify (tparms
, deduced_args
,
18728 INNERMOST_TEMPLATE_ARGS (spec_args
),
18729 INNERMOST_TEMPLATE_ARGS (args
),
18730 UNIFY_ALLOW_NONE
, /*explain_p=*/false))
18733 for (i
= 0; i
< ntparms
; ++i
)
18734 if (! TREE_VEC_ELT (innermost_deduced_args
, i
))
18737 /* Verify that nondeduced template arguments agree with the type
18738 obtained from argument deduction.
18742 struct A { typedef int X; };
18743 template <class T, class U> struct C {};
18744 template <class T> struct C<T, typename T::X> {};
18746 Then with the instantiation `C<A, int>', we can deduce that
18747 `T' is `A' but unify () does not check whether `typename T::X'
18749 spec_args
= tsubst (spec_args
, deduced_args
, tf_none
, NULL_TREE
);
18750 spec_args
= coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18752 tf_none
, false, false);
18753 if (spec_args
== error_mark_node
18754 /* We only need to check the innermost arguments; the other
18755 arguments will always agree. */
18756 || !comp_template_args (INNERMOST_TEMPLATE_ARGS (spec_args
),
18757 INNERMOST_TEMPLATE_ARGS (args
)))
18760 /* Now that we have bindings for all of the template arguments,
18761 ensure that the arguments deduced for the template template
18762 parameters have compatible template parameter lists. See the use
18763 of template_template_parm_bindings_ok_p in fn_type_unification
18764 for more information. */
18765 if (!template_template_parm_bindings_ok_p (tparms
, deduced_args
))
18768 return deduced_args
;
18771 /* TEMPLATES is a TREE_LIST. Each TREE_VALUE is a TEMPLATE_DECL.
18772 Return the TREE_LIST node with the most specialized template, if
18773 any. If there is no most specialized template, the error_mark_node
18776 Note that this function does not look at, or modify, the
18777 TREE_PURPOSE or TREE_TYPE of any of the nodes. Since the node
18778 returned is one of the elements of INSTANTIATIONS, callers may
18779 store information in the TREE_PURPOSE or TREE_TYPE of the nodes,
18780 and retrieve it from the value returned. */
18783 most_specialized_instantiation (tree templates
)
18787 ++processing_template_decl
;
18790 for (fn
= TREE_CHAIN (templates
); fn
; fn
= TREE_CHAIN (fn
))
18794 if (get_bindings (TREE_VALUE (champ
),
18795 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18796 NULL_TREE
, /*check_ret=*/true))
18799 if (get_bindings (TREE_VALUE (fn
),
18800 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18801 NULL_TREE
, /*check_ret=*/true))
18808 /* Equally specialized, move to next function. If there
18809 is no next function, nothing's most specialized. */
18810 fn
= TREE_CHAIN (fn
);
18818 /* Now verify that champ is better than everything earlier in the
18819 instantiation list. */
18820 for (fn
= templates
; fn
!= champ
; fn
= TREE_CHAIN (fn
))
18821 if (get_bindings (TREE_VALUE (champ
),
18822 DECL_TEMPLATE_RESULT (TREE_VALUE (fn
)),
18823 NULL_TREE
, /*check_ret=*/true)
18824 || !get_bindings (TREE_VALUE (fn
),
18825 DECL_TEMPLATE_RESULT (TREE_VALUE (champ
)),
18826 NULL_TREE
, /*check_ret=*/true))
18832 processing_template_decl
--;
18835 return error_mark_node
;
18840 /* If DECL is a specialization of some template, return the most
18841 general such template. Otherwise, returns NULL_TREE.
18843 For example, given:
18845 template <class T> struct S { template <class U> void f(U); };
18847 if TMPL is `template <class U> void S<int>::f(U)' this will return
18848 the full template. This function will not trace past partial
18849 specializations, however. For example, given in addition:
18851 template <class T> struct S<T*> { template <class U> void f(U); };
18853 if TMPL is `template <class U> void S<int*>::f(U)' this will return
18854 `template <class T> template <class U> S<T*>::f(U)'. */
18857 most_general_template (tree decl
)
18859 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
18861 if (tree tinfo
= get_template_info (decl
))
18862 decl
= TI_TEMPLATE (tinfo
);
18863 /* The TI_TEMPLATE can be an IDENTIFIER_NODE for a
18864 template friend, or a FIELD_DECL for a capture pack. */
18865 if (TREE_CODE (decl
) != TEMPLATE_DECL
)
18869 /* Look for more and more general templates. */
18870 while (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
18872 /* The DECL_TI_TEMPLATE can be an IDENTIFIER_NODE in some cases.
18873 (See cp-tree.h for details.) */
18874 if (TREE_CODE (DECL_TI_TEMPLATE (decl
)) != TEMPLATE_DECL
)
18877 if (CLASS_TYPE_P (TREE_TYPE (decl
))
18878 && CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (decl
)))
18881 /* Stop if we run into an explicitly specialized class template. */
18882 if (!DECL_NAMESPACE_SCOPE_P (decl
)
18883 && DECL_CONTEXT (decl
)
18884 && CLASSTYPE_TEMPLATE_SPECIALIZATION (DECL_CONTEXT (decl
)))
18887 decl
= DECL_TI_TEMPLATE (decl
);
18893 /* Return the most specialized of the class template partial
18894 specializations which can produce TYPE, a specialization of some class
18895 template. The value returned is actually a TREE_LIST; the TREE_TYPE is
18896 a _TYPE node corresponding to the partial specialization, while the
18897 TREE_PURPOSE is the set of template arguments that must be
18898 substituted into the TREE_TYPE in order to generate TYPE.
18900 If the choice of partial specialization is ambiguous, a diagnostic
18901 is issued, and the error_mark_node is returned. If there are no
18902 partial specializations matching TYPE, then NULL_TREE is
18903 returned, indicating that the primary template should be used. */
18906 most_specialized_class (tree type
, tsubst_flags_t complain
)
18908 tree list
= NULL_TREE
;
18913 tree outer_args
= NULL_TREE
;
18915 tree tmpl
= CLASSTYPE_TI_TEMPLATE (type
);
18916 tree main_tmpl
= most_general_template (tmpl
);
18917 tree args
= CLASSTYPE_TI_ARGS (type
);
18919 /* For determining which partial specialization to use, only the
18920 innermost args are interesting. */
18921 if (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (args
))
18923 outer_args
= strip_innermost_template_args (args
, 1);
18924 args
= INNERMOST_TEMPLATE_ARGS (args
);
18927 for (t
= DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl
); t
; t
= TREE_CHAIN (t
))
18929 tree partial_spec_args
;
18931 tree spec_tmpl
= TREE_VALUE (t
);
18932 tree orig_parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
18934 partial_spec_args
= CLASSTYPE_TI_ARGS (TREE_TYPE (t
));
18936 ++processing_template_decl
;
18940 /* Discard the outer levels of args, and then substitute in the
18941 template args from the enclosing class. */
18942 partial_spec_args
= INNERMOST_TEMPLATE_ARGS (partial_spec_args
);
18943 partial_spec_args
= tsubst_template_args
18944 (partial_spec_args
, outer_args
, tf_none
, NULL_TREE
);
18946 /* And the same for the partial specialization TEMPLATE_DECL. */
18947 spec_tmpl
= tsubst (spec_tmpl
, outer_args
, tf_none
, NULL_TREE
);
18950 partial_spec_args
=
18951 coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl
),
18954 /*require_all_args=*/true,
18955 /*use_default_args=*/true);
18957 --processing_template_decl
;
18959 if (partial_spec_args
== error_mark_node
)
18960 return error_mark_node
;
18961 if (spec_tmpl
== error_mark_node
)
18962 return error_mark_node
;
18964 tree parms
= DECL_INNERMOST_TEMPLATE_PARMS (spec_tmpl
);
18965 spec_args
= get_class_bindings (tmpl
, parms
,
18971 spec_args
= add_to_template_args (outer_args
, spec_args
);
18972 list
= tree_cons (spec_args
, orig_parms
, list
);
18973 TREE_TYPE (list
) = TREE_TYPE (t
);
18980 ambiguous_p
= false;
18983 t
= TREE_CHAIN (t
);
18984 for (; t
; t
= TREE_CHAIN (t
))
18986 fate
= more_specialized_class (tmpl
, champ
, t
);
18993 t
= TREE_CHAIN (t
);
18996 ambiguous_p
= true;
19005 for (t
= list
; t
&& t
!= champ
; t
= TREE_CHAIN (t
))
19007 fate
= more_specialized_class (tmpl
, champ
, t
);
19010 ambiguous_p
= true;
19018 char *spaces
= NULL
;
19019 if (!(complain
& tf_error
))
19020 return error_mark_node
;
19021 error ("ambiguous class template instantiation for %q#T", type
);
19022 str
= ngettext ("candidate is:", "candidates are:", list_length (list
));
19023 for (t
= list
; t
; t
= TREE_CHAIN (t
))
19025 error ("%s %+#T", spaces
? spaces
: str
, TREE_TYPE (t
));
19026 spaces
= spaces
? spaces
: get_spaces (str
);
19029 return error_mark_node
;
19035 /* Explicitly instantiate DECL. */
19038 do_decl_instantiation (tree decl
, tree storage
)
19040 tree result
= NULL_TREE
;
19043 if (!decl
|| decl
== error_mark_node
)
19044 /* An error occurred, for which grokdeclarator has already issued
19045 an appropriate message. */
19047 else if (! DECL_LANG_SPECIFIC (decl
))
19049 error ("explicit instantiation of non-template %q#D", decl
);
19052 else if (VAR_P (decl
))
19054 /* There is an asymmetry here in the way VAR_DECLs and
19055 FUNCTION_DECLs are handled by grokdeclarator. In the case of
19056 the latter, the DECL we get back will be marked as a
19057 template instantiation, and the appropriate
19058 DECL_TEMPLATE_INFO will be set up. This does not happen for
19059 VAR_DECLs so we do the lookup here. Probably, grokdeclarator
19060 should handle VAR_DECLs as it currently handles
19062 if (!DECL_CLASS_SCOPE_P (decl
))
19064 error ("%qD is not a static data member of a class template", decl
);
19067 result
= lookup_field (DECL_CONTEXT (decl
), DECL_NAME (decl
), 0, false);
19068 if (!result
|| !VAR_P (result
))
19070 error ("no matching template for %qD found", decl
);
19073 if (!same_type_p (TREE_TYPE (result
), TREE_TYPE (decl
)))
19075 error ("type %qT for explicit instantiation %qD does not match "
19076 "declared type %qT", TREE_TYPE (result
), decl
,
19081 else if (TREE_CODE (decl
) != FUNCTION_DECL
)
19083 error ("explicit instantiation of %q#D", decl
);
19089 /* Check for various error cases. Note that if the explicit
19090 instantiation is valid the RESULT will currently be marked as an
19091 *implicit* instantiation; DECL_EXPLICIT_INSTANTIATION is not set
19092 until we get here. */
19094 if (DECL_TEMPLATE_SPECIALIZATION (result
))
19096 /* DR 259 [temp.spec].
19098 Both an explicit instantiation and a declaration of an explicit
19099 specialization shall not appear in a program unless the explicit
19100 instantiation follows a declaration of the explicit specialization.
19102 For a given set of template parameters, if an explicit
19103 instantiation of a template appears after a declaration of an
19104 explicit specialization for that template, the explicit
19105 instantiation has no effect. */
19108 else if (DECL_EXPLICIT_INSTANTIATION (result
))
19112 No program shall explicitly instantiate any template more
19115 We check DECL_NOT_REALLY_EXTERN so as not to complain when
19116 the first instantiation was `extern' and the second is not,
19117 and EXTERN_P for the opposite case. */
19118 if (DECL_NOT_REALLY_EXTERN (result
) && !extern_p
)
19119 permerror (input_location
, "duplicate explicit instantiation of %q#D", result
);
19120 /* If an "extern" explicit instantiation follows an ordinary
19121 explicit instantiation, the template is instantiated. */
19125 else if (!DECL_IMPLICIT_INSTANTIATION (result
))
19127 error ("no matching template for %qD found", result
);
19130 else if (!DECL_TEMPLATE_INFO (result
))
19132 permerror (input_location
, "explicit instantiation of non-template %q#D", result
);
19136 if (storage
== NULL_TREE
)
19138 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19140 if (!in_system_header_at (input_location
) && (cxx_dialect
== cxx98
))
19141 pedwarn (input_location
, OPT_Wpedantic
,
19142 "ISO C++ 1998 forbids the use of %<extern%> on explicit "
19147 error ("storage class %qD applied to template instantiation", storage
);
19149 check_explicit_instantiation_namespace (result
);
19150 mark_decl_instantiated (result
, extern_p
);
19152 instantiate_decl (result
, /*defer_ok=*/1,
19153 /*expl_inst_class_mem_p=*/false);
19157 mark_class_instantiated (tree t
, int extern_p
)
19159 SET_CLASSTYPE_EXPLICIT_INSTANTIATION (t
);
19160 SET_CLASSTYPE_INTERFACE_KNOWN (t
);
19161 CLASSTYPE_INTERFACE_ONLY (t
) = extern_p
;
19162 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (t
)) = extern_p
;
19165 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
19166 rest_of_type_compilation (t
, 1);
19170 /* Called from do_type_instantiation through binding_table_foreach to
19171 do recursive instantiation for the type bound in ENTRY. */
19173 bt_instantiate_type_proc (binding_entry entry
, void *data
)
19175 tree storage
= *(tree
*) data
;
19177 if (MAYBE_CLASS_TYPE_P (entry
->type
)
19178 && !uses_template_parms (CLASSTYPE_TI_ARGS (entry
->type
)))
19179 do_type_instantiation (TYPE_MAIN_DECL (entry
->type
), storage
, 0);
19182 /* Called from do_type_instantiation to instantiate a member
19183 (a member function or a static member variable) of an
19184 explicitly instantiated class template. */
19186 instantiate_class_member (tree decl
, int extern_p
)
19188 mark_decl_instantiated (decl
, extern_p
);
19190 instantiate_decl (decl
, /*defer_ok=*/1,
19191 /*expl_inst_class_mem_p=*/true);
19194 /* Perform an explicit instantiation of template class T. STORAGE, if
19195 non-null, is the RID for extern, inline or static. COMPLAIN is
19196 nonzero if this is called from the parser, zero if called recursively,
19197 since the standard is unclear (as detailed below). */
19200 do_type_instantiation (tree t
, tree storage
, tsubst_flags_t complain
)
19205 int previous_instantiation_extern_p
= 0;
19207 if (TREE_CODE (t
) == TYPE_DECL
)
19210 if (! CLASS_TYPE_P (t
) || ! CLASSTYPE_TEMPLATE_INFO (t
))
19213 (TYPE_TEMPLATE_INFO (t
)) ? TYPE_TI_TEMPLATE (t
) : NULL
;
19215 error ("explicit instantiation of non-class template %qD", tmpl
);
19217 error ("explicit instantiation of non-template type %qT", t
);
19223 if (!COMPLETE_TYPE_P (t
))
19225 if (complain
& tf_error
)
19226 error ("explicit instantiation of %q#T before definition of template",
19231 if (storage
!= NULL_TREE
)
19233 if (!in_system_header_at (input_location
))
19235 if (storage
== ridpointers
[(int) RID_EXTERN
])
19237 if (cxx_dialect
== cxx98
)
19238 pedwarn (input_location
, OPT_Wpedantic
,
19239 "ISO C++ 1998 forbids the use of %<extern%> on "
19240 "explicit instantiations");
19243 pedwarn (input_location
, OPT_Wpedantic
,
19244 "ISO C++ forbids the use of %qE"
19245 " on explicit instantiations", storage
);
19248 if (storage
== ridpointers
[(int) RID_INLINE
])
19250 else if (storage
== ridpointers
[(int) RID_EXTERN
])
19252 else if (storage
== ridpointers
[(int) RID_STATIC
])
19256 error ("storage class %qD applied to template instantiation",
19262 if (CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
19264 /* DR 259 [temp.spec].
19266 Both an explicit instantiation and a declaration of an explicit
19267 specialization shall not appear in a program unless the explicit
19268 instantiation follows a declaration of the explicit specialization.
19270 For a given set of template parameters, if an explicit
19271 instantiation of a template appears after a declaration of an
19272 explicit specialization for that template, the explicit
19273 instantiation has no effect. */
19276 else if (CLASSTYPE_EXPLICIT_INSTANTIATION (t
))
19280 No program shall explicitly instantiate any template more
19283 If PREVIOUS_INSTANTIATION_EXTERN_P, then the first explicit
19284 instantiation was `extern'. If EXTERN_P then the second is.
19285 These cases are OK. */
19286 previous_instantiation_extern_p
= CLASSTYPE_INTERFACE_ONLY (t
);
19288 if (!previous_instantiation_extern_p
&& !extern_p
19289 && (complain
& tf_error
))
19290 permerror (input_location
, "duplicate explicit instantiation of %q#T", t
);
19292 /* If we've already instantiated the template, just return now. */
19293 if (!CLASSTYPE_INTERFACE_ONLY (t
))
19297 check_explicit_instantiation_namespace (TYPE_NAME (t
));
19298 mark_class_instantiated (t
, extern_p
);
19306 /* In contrast to implicit instantiation, where only the
19307 declarations, and not the definitions, of members are
19308 instantiated, we have here:
19312 The explicit instantiation of a class template specialization
19313 implies the instantiation of all of its members not
19314 previously explicitly specialized in the translation unit
19315 containing the explicit instantiation.
19317 Of course, we can't instantiate member template classes, since
19318 we don't have any arguments for them. Note that the standard
19319 is unclear on whether the instantiation of the members are
19320 *explicit* instantiations or not. However, the most natural
19321 interpretation is that it should be an explicit instantiation. */
19324 for (tmp
= TYPE_METHODS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19325 if (TREE_CODE (tmp
) == FUNCTION_DECL
19326 && DECL_TEMPLATE_INSTANTIATION (tmp
))
19327 instantiate_class_member (tmp
, extern_p
);
19329 for (tmp
= TYPE_FIELDS (t
); tmp
; tmp
= DECL_CHAIN (tmp
))
19330 if (VAR_P (tmp
) && DECL_TEMPLATE_INSTANTIATION (tmp
))
19331 instantiate_class_member (tmp
, extern_p
);
19333 if (CLASSTYPE_NESTED_UTDS (t
))
19334 binding_table_foreach (CLASSTYPE_NESTED_UTDS (t
),
19335 bt_instantiate_type_proc
, &storage
);
19339 /* Given a function DECL, which is a specialization of TMPL, modify
19340 DECL to be a re-instantiation of TMPL with the same template
19341 arguments. TMPL should be the template into which tsubst'ing
19342 should occur for DECL, not the most general template.
19344 One reason for doing this is a scenario like this:
19347 void f(const T&, int i);
19349 void g() { f(3, 7); }
19352 void f(const T& t, const int i) { }
19354 Note that when the template is first instantiated, with
19355 instantiate_template, the resulting DECL will have no name for the
19356 first parameter, and the wrong type for the second. So, when we go
19357 to instantiate the DECL, we regenerate it. */
19360 regenerate_decl_from_template (tree decl
, tree tmpl
)
19362 /* The arguments used to instantiate DECL, from the most general
19367 args
= DECL_TI_ARGS (decl
);
19368 code_pattern
= DECL_TEMPLATE_RESULT (tmpl
);
19370 /* Make sure that we can see identifiers, and compute access
19372 push_access_scope (decl
);
19374 if (TREE_CODE (decl
) == FUNCTION_DECL
)
19382 args_depth
= TMPL_ARGS_DEPTH (args
);
19383 parms_depth
= TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (tmpl
));
19384 if (args_depth
> parms_depth
)
19385 args
= get_innermost_template_args (args
, parms_depth
);
19387 specs
= tsubst_exception_specification (TREE_TYPE (code_pattern
),
19388 args
, tf_error
, NULL_TREE
,
19389 /*defer_ok*/false);
19390 if (specs
&& specs
!= error_mark_node
)
19391 TREE_TYPE (decl
) = build_exception_variant (TREE_TYPE (decl
),
19394 /* Merge parameter declarations. */
19395 decl_parm
= skip_artificial_parms_for (decl
,
19396 DECL_ARGUMENTS (decl
));
19398 = skip_artificial_parms_for (code_pattern
,
19399 DECL_ARGUMENTS (code_pattern
));
19400 while (decl_parm
&& !DECL_PACK_P (pattern_parm
))
19405 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19406 DECL_NAME (decl_parm
) = DECL_NAME (pattern_parm
);
19407 parm_type
= tsubst (TREE_TYPE (pattern_parm
), args
, tf_error
,
19409 parm_type
= type_decays_to (parm_type
);
19410 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19411 TREE_TYPE (decl_parm
) = parm_type
;
19412 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19413 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19415 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19416 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19418 decl_parm
= DECL_CHAIN (decl_parm
);
19419 pattern_parm
= DECL_CHAIN (pattern_parm
);
19421 /* Merge any parameters that match with the function parameter
19423 if (pattern_parm
&& DECL_PACK_P (pattern_parm
))
19426 tree expanded_types
;
19427 /* Expand the TYPE_PACK_EXPANSION that provides the types for
19428 the parameters in this function parameter pack. */
19429 expanded_types
= tsubst_pack_expansion (TREE_TYPE (pattern_parm
),
19430 args
, tf_error
, NULL_TREE
);
19431 len
= TREE_VEC_LENGTH (expanded_types
);
19432 for (i
= 0; i
< len
; i
++)
19437 if (DECL_NAME (decl_parm
) != DECL_NAME (pattern_parm
))
19438 /* Rename the parameter to include the index. */
19439 DECL_NAME (decl_parm
) =
19440 make_ith_pack_parameter_name (DECL_NAME (pattern_parm
), i
);
19441 parm_type
= TREE_VEC_ELT (expanded_types
, i
);
19442 parm_type
= type_decays_to (parm_type
);
19443 if (!same_type_p (TREE_TYPE (decl_parm
), parm_type
))
19444 TREE_TYPE (decl_parm
) = parm_type
;
19445 attributes
= DECL_ATTRIBUTES (pattern_parm
);
19446 if (DECL_ATTRIBUTES (decl_parm
) != attributes
)
19448 DECL_ATTRIBUTES (decl_parm
) = attributes
;
19449 cplus_decl_attributes (&decl_parm
, attributes
, /*flags=*/0);
19451 decl_parm
= DECL_CHAIN (decl_parm
);
19454 /* Merge additional specifiers from the CODE_PATTERN. */
19455 if (DECL_DECLARED_INLINE_P (code_pattern
)
19456 && !DECL_DECLARED_INLINE_P (decl
))
19457 DECL_DECLARED_INLINE_P (decl
) = 1;
19459 else if (VAR_P (decl
))
19461 DECL_INITIAL (decl
) =
19462 tsubst_expr (DECL_INITIAL (code_pattern
), args
,
19463 tf_error
, DECL_TI_TEMPLATE (decl
),
19464 /*integral_constant_expression_p=*/false);
19465 if (VAR_HAD_UNKNOWN_BOUND (decl
))
19466 TREE_TYPE (decl
) = tsubst (TREE_TYPE (code_pattern
), args
,
19467 tf_error
, DECL_TI_TEMPLATE (decl
));
19470 gcc_unreachable ();
19472 pop_access_scope (decl
);
19475 /* Return the TEMPLATE_DECL into which DECL_TI_ARGS(DECL) should be
19476 substituted to get DECL. */
19479 template_for_substitution (tree decl
)
19481 tree tmpl
= DECL_TI_TEMPLATE (decl
);
19483 /* Set TMPL to the template whose DECL_TEMPLATE_RESULT is the pattern
19484 for the instantiation. This is not always the most general
19485 template. Consider, for example:
19488 struct S { template <class U> void f();
19489 template <> void f<int>(); };
19491 and an instantiation of S<double>::f<int>. We want TD to be the
19492 specialization S<T>::f<int>, not the more general S<T>::f<U>. */
19493 while (/* An instantiation cannot have a definition, so we need a
19494 more general template. */
19495 DECL_TEMPLATE_INSTANTIATION (tmpl
)
19496 /* We must also deal with friend templates. Given:
19498 template <class T> struct S {
19499 template <class U> friend void f() {};
19502 S<int>::f<U> say, is not an instantiation of S<T>::f<U>,
19503 so far as the language is concerned, but that's still
19504 where we get the pattern for the instantiation from. On
19505 other hand, if the definition comes outside the class, say:
19507 template <class T> struct S {
19508 template <class U> friend void f();
19510 template <class U> friend void f() {}
19512 we don't need to look any further. That's what the check for
19513 DECL_INITIAL is for. */
19514 || (TREE_CODE (decl
) == FUNCTION_DECL
19515 && DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (tmpl
)
19516 && !DECL_INITIAL (DECL_TEMPLATE_RESULT (tmpl
))))
19518 /* The present template, TD, should not be a definition. If it
19519 were a definition, we should be using it! Note that we
19520 cannot restructure the loop to just keep going until we find
19521 a template with a definition, since that might go too far if
19522 a specialization was declared, but not defined. */
19523 gcc_assert (!VAR_P (decl
)
19524 || DECL_IN_AGGR_P (DECL_TEMPLATE_RESULT (tmpl
)));
19526 /* Fetch the more general template. */
19527 tmpl
= DECL_TI_TEMPLATE (tmpl
);
19533 /* Returns true if we need to instantiate this template instance even if we
19534 know we aren't going to emit it.. */
19537 always_instantiate_p (tree decl
)
19539 /* We always instantiate inline functions so that we can inline them. An
19540 explicit instantiation declaration prohibits implicit instantiation of
19541 non-inline functions. With high levels of optimization, we would
19542 normally inline non-inline functions -- but we're not allowed to do
19543 that for "extern template" functions. Therefore, we check
19544 DECL_DECLARED_INLINE_P, rather than possibly_inlined_p. */
19545 return ((TREE_CODE (decl
) == FUNCTION_DECL
19546 && (DECL_DECLARED_INLINE_P (decl
)
19547 || type_uses_auto (TREE_TYPE (TREE_TYPE (decl
)))))
19548 /* And we need to instantiate static data members so that
19549 their initializers are available in integral constant
19552 && decl_maybe_constant_var_p (decl
)));
19555 /* If FN has a noexcept-specifier that hasn't been instantiated yet,
19556 instantiate it now, modifying TREE_TYPE (fn). */
19559 maybe_instantiate_noexcept (tree fn
)
19561 tree fntype
, spec
, noex
, clone
;
19563 /* Don't instantiate a noexcept-specification from template context. */
19564 if (processing_template_decl
)
19567 if (DECL_CLONED_FUNCTION_P (fn
))
19568 fn
= DECL_CLONED_FUNCTION (fn
);
19569 fntype
= TREE_TYPE (fn
);
19570 spec
= TYPE_RAISES_EXCEPTIONS (fntype
);
19572 if (!DEFERRED_NOEXCEPT_SPEC_P (spec
))
19575 noex
= TREE_PURPOSE (spec
);
19577 if (TREE_CODE (noex
) == DEFERRED_NOEXCEPT
)
19579 if (push_tinst_level (fn
))
19581 push_access_scope (fn
);
19582 push_deferring_access_checks (dk_no_deferred
);
19583 input_location
= DECL_SOURCE_LOCATION (fn
);
19584 noex
= tsubst_copy_and_build (DEFERRED_NOEXCEPT_PATTERN (noex
),
19585 DEFERRED_NOEXCEPT_ARGS (noex
),
19586 tf_warning_or_error
, fn
,
19587 /*function_p=*/false,
19588 /*integral_constant_expression_p=*/true);
19589 pop_deferring_access_checks ();
19590 pop_access_scope (fn
);
19591 pop_tinst_level ();
19592 spec
= build_noexcept_spec (noex
, tf_warning_or_error
);
19593 if (spec
== error_mark_node
)
19594 spec
= noexcept_false_spec
;
19597 spec
= noexcept_false_spec
;
19601 /* This is an implicitly declared function, so NOEX is a list of
19602 other functions to evaluate and merge. */
19604 spec
= noexcept_true_spec
;
19605 for (elt
= noex
; elt
; elt
= OVL_NEXT (elt
))
19607 tree fn
= OVL_CURRENT (elt
);
19609 maybe_instantiate_noexcept (fn
);
19610 subspec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
));
19611 spec
= merge_exception_specifiers (spec
, subspec
, NULL_TREE
);
19615 TREE_TYPE (fn
) = build_exception_variant (fntype
, spec
);
19617 FOR_EACH_CLONE (clone
, fn
)
19619 if (TREE_TYPE (clone
) == fntype
)
19620 TREE_TYPE (clone
) = TREE_TYPE (fn
);
19622 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
), spec
);
19626 /* Produce the definition of D, a _DECL generated from a template. If
19627 DEFER_OK is nonzero, then we don't have to actually do the
19628 instantiation now; we just have to do it sometime. Normally it is
19629 an error if this is an explicit instantiation but D is undefined.
19630 EXPL_INST_CLASS_MEM_P is true iff D is a member of an
19631 explicitly instantiated class template. */
19634 instantiate_decl (tree d
, int defer_ok
,
19635 bool expl_inst_class_mem_p
)
19637 tree tmpl
= DECL_TI_TEMPLATE (d
);
19644 bool pattern_defined
;
19645 location_t saved_loc
= input_location
;
19646 int saved_unevaluated_operand
= cp_unevaluated_operand
;
19647 int saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
19652 /* This function should only be used to instantiate templates for
19653 functions and static member variables. */
19654 gcc_assert (VAR_OR_FUNCTION_DECL_P (d
));
19656 /* Variables are never deferred; if instantiation is required, they
19657 are instantiated right away. That allows for better code in the
19658 case that an expression refers to the value of the variable --
19659 if the variable has a constant value the referring expression can
19660 take advantage of that fact. */
19662 || DECL_DECLARED_CONSTEXPR_P (d
))
19665 /* Don't instantiate cloned functions. Instead, instantiate the
19666 functions they cloned. */
19667 if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_CLONED_FUNCTION_P (d
))
19668 d
= DECL_CLONED_FUNCTION (d
);
19670 if (DECL_TEMPLATE_INSTANTIATED (d
)
19671 || (TREE_CODE (d
) == FUNCTION_DECL
19672 && DECL_DEFAULTED_FN (d
) && DECL_INITIAL (d
))
19673 || DECL_TEMPLATE_SPECIALIZATION (d
))
19674 /* D has already been instantiated or explicitly specialized, so
19675 there's nothing for us to do here.
19677 It might seem reasonable to check whether or not D is an explicit
19678 instantiation, and, if so, stop here. But when an explicit
19679 instantiation is deferred until the end of the compilation,
19680 DECL_EXPLICIT_INSTANTIATION is set, even though we still need to do
19681 the instantiation. */
19684 /* Check to see whether we know that this template will be
19685 instantiated in some other file, as with "extern template"
19687 external_p
= (DECL_INTERFACE_KNOWN (d
) && DECL_REALLY_EXTERN (d
));
19689 /* In general, we do not instantiate such templates. */
19690 if (external_p
&& !always_instantiate_p (d
))
19693 gen_tmpl
= most_general_template (tmpl
);
19694 gen_args
= DECL_TI_ARGS (d
);
19696 if (tmpl
!= gen_tmpl
)
19697 /* We should already have the extra args. */
19698 gcc_assert (TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (gen_tmpl
))
19699 == TMPL_ARGS_DEPTH (gen_args
));
19700 /* And what's in the hash table should match D. */
19701 gcc_assert ((spec
= retrieve_specialization (gen_tmpl
, gen_args
, 0)) == d
19702 || spec
== NULL_TREE
);
19704 /* This needs to happen before any tsubsting. */
19705 if (! push_tinst_level (d
))
19708 timevar_push (TV_TEMPLATE_INST
);
19710 /* Set TD to the template whose DECL_TEMPLATE_RESULT is the pattern
19711 for the instantiation. */
19712 td
= template_for_substitution (d
);
19713 code_pattern
= DECL_TEMPLATE_RESULT (td
);
19715 /* We should never be trying to instantiate a member of a class
19716 template or partial specialization. */
19717 gcc_assert (d
!= code_pattern
);
19719 if ((DECL_NAMESPACE_SCOPE_P (d
) && !DECL_INITIALIZED_IN_CLASS_P (d
))
19720 || DECL_TEMPLATE_SPECIALIZATION (td
))
19721 /* In the case of a friend template whose definition is provided
19722 outside the class, we may have too many arguments. Drop the
19723 ones we don't need. The same is true for specializations. */
19724 args
= get_innermost_template_args
19725 (gen_args
, TMPL_PARMS_DEPTH (DECL_TEMPLATE_PARMS (td
)));
19729 if (TREE_CODE (d
) == FUNCTION_DECL
)
19730 pattern_defined
= (DECL_SAVED_TREE (code_pattern
) != NULL_TREE
19731 || DECL_DEFAULTED_OUTSIDE_CLASS_P (code_pattern
));
19733 pattern_defined
= ! DECL_IN_AGGR_P (code_pattern
);
19735 /* We may be in the middle of deferred access check. Disable it now. */
19736 push_deferring_access_checks (dk_no_deferred
);
19738 /* Unless an explicit instantiation directive has already determined
19739 the linkage of D, remember that a definition is available for
19741 if (pattern_defined
19742 && !DECL_INTERFACE_KNOWN (d
)
19743 && !DECL_NOT_REALLY_EXTERN (d
))
19744 mark_definable (d
);
19746 DECL_SOURCE_LOCATION (td
) = DECL_SOURCE_LOCATION (code_pattern
);
19747 DECL_SOURCE_LOCATION (d
) = DECL_SOURCE_LOCATION (code_pattern
);
19748 input_location
= DECL_SOURCE_LOCATION (d
);
19750 /* If D is a member of an explicitly instantiated class template,
19751 and no definition is available, treat it like an implicit
19753 if (!pattern_defined
&& expl_inst_class_mem_p
19754 && DECL_EXPLICIT_INSTANTIATION (d
))
19756 /* Leave linkage flags alone on instantiations with anonymous
19758 if (TREE_PUBLIC (d
))
19760 DECL_NOT_REALLY_EXTERN (d
) = 0;
19761 DECL_INTERFACE_KNOWN (d
) = 0;
19763 SET_DECL_IMPLICIT_INSTANTIATION (d
);
19766 if (TREE_CODE (d
) == FUNCTION_DECL
)
19767 maybe_instantiate_noexcept (d
);
19769 /* Defer all other templates, unless we have been explicitly
19770 forbidden from doing so. */
19771 if (/* If there is no definition, we cannot instantiate the
19774 /* If it's OK to postpone instantiation, do so. */
19776 /* If this is a static data member that will be defined
19777 elsewhere, we don't want to instantiate the entire data
19778 member, but we do want to instantiate the initializer so that
19779 we can substitute that elsewhere. */
19780 || (external_p
&& VAR_P (d
)))
19782 /* The definition of the static data member is now required so
19783 we must substitute the initializer. */
19785 && !DECL_INITIAL (d
)
19786 && DECL_INITIAL (code_pattern
))
19790 bool const_init
= false;
19792 ns
= decl_namespace_context (d
);
19793 push_nested_namespace (ns
);
19794 push_nested_class (DECL_CONTEXT (d
));
19795 init
= tsubst_expr (DECL_INITIAL (code_pattern
),
19797 tf_warning_or_error
, NULL_TREE
,
19798 /*integral_constant_expression_p=*/false);
19799 /* Make sure the initializer is still constant, in case of
19800 circular dependency (template/instantiate6.C). */
19802 = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
19803 cp_finish_decl (d
, init
, /*init_const_expr_p=*/const_init
,
19804 /*asmspec_tree=*/NULL_TREE
,
19805 LOOKUP_ONLYCONVERTING
);
19806 pop_nested_class ();
19807 pop_nested_namespace (ns
);
19810 /* We restore the source position here because it's used by
19811 add_pending_template. */
19812 input_location
= saved_loc
;
19814 if (at_eof
&& !pattern_defined
19815 && DECL_EXPLICIT_INSTANTIATION (d
)
19816 && DECL_NOT_REALLY_EXTERN (d
))
19819 The definition of a non-exported function template, a
19820 non-exported member function template, or a non-exported
19821 member function or static data member of a class template
19822 shall be present in every translation unit in which it is
19823 explicitly instantiated. */
19824 permerror (input_location
, "explicit instantiation of %qD "
19825 "but no definition available", d
);
19827 /* If we're in unevaluated context, we just wanted to get the
19828 constant value; this isn't an odr use, so don't queue
19829 a full instantiation. */
19830 if (cp_unevaluated_operand
!= 0)
19832 /* ??? Historically, we have instantiated inline functions, even
19833 when marked as "extern template". */
19834 if (!(external_p
&& VAR_P (d
)))
19835 add_pending_template (d
);
19838 /* Tell the repository that D is available in this translation unit
19839 -- and see if it is supposed to be instantiated here. */
19840 if (TREE_PUBLIC (d
) && !DECL_REALLY_EXTERN (d
) && !repo_emit_p (d
))
19842 /* In a PCH file, despite the fact that the repository hasn't
19843 requested instantiation in the PCH it is still possible that
19844 an instantiation will be required in a file that includes the
19847 add_pending_template (d
);
19848 /* Instantiate inline functions so that the inliner can do its
19849 job, even though we'll not be emitting a copy of this
19851 if (!(TREE_CODE (d
) == FUNCTION_DECL
&& possibly_inlined_p (d
)))
19855 fn_context
= decl_function_context (d
);
19856 nested
= (current_function_decl
!= NULL_TREE
);
19858 push_to_top_level ();
19862 push_function_context ();
19863 cp_unevaluated_operand
= 0;
19864 c_inhibit_evaluation_warnings
= 0;
19867 /* Mark D as instantiated so that recursive calls to
19868 instantiate_decl do not try to instantiate it again. */
19869 DECL_TEMPLATE_INSTANTIATED (d
) = 1;
19871 /* Regenerate the declaration in case the template has been modified
19872 by a subsequent redeclaration. */
19873 regenerate_decl_from_template (d
, td
);
19875 /* We already set the file and line above. Reset them now in case
19876 they changed as a result of calling regenerate_decl_from_template. */
19877 input_location
= DECL_SOURCE_LOCATION (d
);
19882 bool const_init
= false;
19884 /* Clear out DECL_RTL; whatever was there before may not be right
19885 since we've reset the type of the declaration. */
19886 SET_DECL_RTL (d
, NULL
);
19887 DECL_IN_AGGR_P (d
) = 0;
19889 /* The initializer is placed in DECL_INITIAL by
19890 regenerate_decl_from_template so we don't need to
19891 push/pop_access_scope again here. Pull it out so that
19892 cp_finish_decl can process it. */
19893 init
= DECL_INITIAL (d
);
19894 DECL_INITIAL (d
) = NULL_TREE
;
19895 DECL_INITIALIZED_P (d
) = 0;
19897 /* Clear DECL_EXTERNAL so that cp_finish_decl will process the
19898 initializer. That function will defer actual emission until
19899 we have a chance to determine linkage. */
19900 DECL_EXTERNAL (d
) = 0;
19902 /* Enter the scope of D so that access-checking works correctly. */
19903 push_nested_class (DECL_CONTEXT (d
));
19904 const_init
= DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (code_pattern
);
19905 cp_finish_decl (d
, init
, const_init
, NULL_TREE
, 0);
19906 pop_nested_class ();
19908 else if (TREE_CODE (d
) == FUNCTION_DECL
&& DECL_DEFAULTED_FN (code_pattern
))
19909 synthesize_method (d
);
19910 else if (TREE_CODE (d
) == FUNCTION_DECL
)
19912 struct pointer_map_t
*saved_local_specializations
;
19916 tree block
= NULL_TREE
;
19918 /* Save away the current list, in case we are instantiating one
19919 template from within the body of another. */
19920 saved_local_specializations
= local_specializations
;
19922 /* Set up the list of local specializations. */
19923 local_specializations
= pointer_map_create ();
19925 /* Set up context. */
19926 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
19927 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
19928 block
= push_stmt_list ();
19930 start_preparsed_function (d
, NULL_TREE
, SF_PRE_PARSED
);
19932 /* Some typedefs referenced from within the template code need to be
19933 access checked at template instantiation time, i.e now. These
19934 types were added to the template at parsing time. Let's get those
19935 and perform the access checks then. */
19936 perform_typedefs_access_check (DECL_TEMPLATE_RESULT (gen_tmpl
),
19939 /* Create substitution entries for the parameters. */
19940 subst_decl
= DECL_TEMPLATE_RESULT (template_for_substitution (d
));
19941 tmpl_parm
= DECL_ARGUMENTS (subst_decl
);
19942 spec_parm
= DECL_ARGUMENTS (d
);
19943 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (d
))
19945 register_local_specialization (spec_parm
, tmpl_parm
);
19946 spec_parm
= skip_artificial_parms_for (d
, spec_parm
);
19947 tmpl_parm
= skip_artificial_parms_for (subst_decl
, tmpl_parm
);
19949 for (; tmpl_parm
; tmpl_parm
= DECL_CHAIN (tmpl_parm
))
19951 if (!DECL_PACK_P (tmpl_parm
))
19953 register_local_specialization (spec_parm
, tmpl_parm
);
19954 spec_parm
= DECL_CHAIN (spec_parm
);
19958 /* Register the (value) argument pack as a specialization of
19959 TMPL_PARM, then move on. */
19960 tree argpack
= extract_fnparm_pack (tmpl_parm
, &spec_parm
);
19961 register_local_specialization (argpack
, tmpl_parm
);
19964 gcc_assert (!spec_parm
);
19966 /* Substitute into the body of the function. */
19967 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
19968 tsubst_omp_udr (DECL_SAVED_TREE (code_pattern
), args
,
19969 tf_warning_or_error
, tmpl
);
19972 tsubst_expr (DECL_SAVED_TREE (code_pattern
), args
,
19973 tf_warning_or_error
, tmpl
,
19974 /*integral_constant_expression_p=*/false);
19976 /* Set the current input_location to the end of the function
19977 so that finish_function knows where we are. */
19979 = DECL_STRUCT_FUNCTION (code_pattern
)->function_end_locus
;
19981 /* Remember if we saw an infinite loop in the template. */
19982 current_function_infinite_loop
19983 = DECL_STRUCT_FUNCTION (code_pattern
)->language
->infinite_loop
;
19986 /* We don't need the local specializations any more. */
19987 pointer_map_destroy (local_specializations
);
19988 local_specializations
= saved_local_specializations
;
19990 /* Finish the function. */
19991 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
)
19992 && TREE_CODE (DECL_CONTEXT (code_pattern
)) == FUNCTION_DECL
)
19993 DECL_SAVED_TREE (d
) = pop_stmt_list (block
);
19996 d
= finish_function (0);
19997 expand_or_defer_fn (d
);
20000 if (DECL_OMP_DECLARE_REDUCTION_P (code_pattern
))
20001 cp_check_omp_declare_reduction (d
);
20004 /* We're not deferring instantiation any more. */
20005 TI_PENDING_TEMPLATE_FLAG (DECL_TEMPLATE_INFO (d
)) = 0;
20008 pop_from_top_level ();
20010 pop_function_context ();
20013 input_location
= saved_loc
;
20014 cp_unevaluated_operand
= saved_unevaluated_operand
;
20015 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20016 pop_deferring_access_checks ();
20017 pop_tinst_level ();
20019 timevar_pop (TV_TEMPLATE_INST
);
20024 /* Run through the list of templates that we wish we could
20025 instantiate, and instantiate any we can. RETRIES is the
20026 number of times we retry pending template instantiation. */
20029 instantiate_pending_templates (int retries
)
20032 location_t saved_loc
= input_location
;
20034 /* Instantiating templates may trigger vtable generation. This in turn
20035 may require further template instantiations. We place a limit here
20036 to avoid infinite loop. */
20037 if (pending_templates
&& retries
>= max_tinst_depth
)
20039 tree decl
= pending_templates
->tinst
->decl
;
20041 error ("template instantiation depth exceeds maximum of %d"
20042 " instantiating %q+D, possibly from virtual table generation"
20043 " (use -ftemplate-depth= to increase the maximum)",
20044 max_tinst_depth
, decl
);
20045 if (TREE_CODE (decl
) == FUNCTION_DECL
)
20046 /* Pretend that we defined it. */
20047 DECL_INITIAL (decl
) = error_mark_node
;
20053 struct pending_template
**t
= &pending_templates
;
20054 struct pending_template
*last
= NULL
;
20058 tree instantiation
= reopen_tinst_level ((*t
)->tinst
);
20059 bool complete
= false;
20061 if (TYPE_P (instantiation
))
20065 if (!COMPLETE_TYPE_P (instantiation
))
20067 instantiate_class_template (instantiation
);
20068 if (CLASSTYPE_TEMPLATE_INSTANTIATION (instantiation
))
20069 for (fn
= TYPE_METHODS (instantiation
);
20071 fn
= TREE_CHAIN (fn
))
20072 if (! DECL_ARTIFICIAL (fn
))
20073 instantiate_decl (fn
,
20075 /*expl_inst_class_mem_p=*/false);
20076 if (COMPLETE_TYPE_P (instantiation
))
20080 complete
= COMPLETE_TYPE_P (instantiation
);
20084 if (!DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20085 && !DECL_TEMPLATE_INSTANTIATED (instantiation
))
20088 = instantiate_decl (instantiation
,
20090 /*expl_inst_class_mem_p=*/false);
20091 if (DECL_TEMPLATE_INSTANTIATED (instantiation
))
20095 complete
= (DECL_TEMPLATE_SPECIALIZATION (instantiation
)
20096 || DECL_TEMPLATE_INSTANTIATED (instantiation
));
20100 /* If INSTANTIATION has been instantiated, then we don't
20101 need to consider it again in the future. */
20109 current_tinst_level
= NULL
;
20111 last_pending_template
= last
;
20113 while (reconsider
);
20115 input_location
= saved_loc
;
20118 /* Substitute ARGVEC into T, which is a list of initializers for
20119 either base class or a non-static data member. The TREE_PURPOSEs
20120 are DECLs, and the TREE_VALUEs are the initializer values. Used by
20121 instantiate_decl. */
20124 tsubst_initializer_list (tree t
, tree argvec
)
20126 tree inits
= NULL_TREE
;
20128 for (; t
; t
= TREE_CHAIN (t
))
20132 tree expanded_bases
= NULL_TREE
;
20133 tree expanded_arguments
= NULL_TREE
;
20136 if (TREE_CODE (TREE_PURPOSE (t
)) == TYPE_PACK_EXPANSION
)
20141 /* Expand the base class expansion type into separate base
20143 expanded_bases
= tsubst_pack_expansion (TREE_PURPOSE (t
), argvec
,
20144 tf_warning_or_error
,
20146 if (expanded_bases
== error_mark_node
)
20149 /* We'll be building separate TREE_LISTs of arguments for
20151 len
= TREE_VEC_LENGTH (expanded_bases
);
20152 expanded_arguments
= make_tree_vec (len
);
20153 for (i
= 0; i
< len
; i
++)
20154 TREE_VEC_ELT (expanded_arguments
, i
) = NULL_TREE
;
20156 /* Build a dummy EXPR_PACK_EXPANSION that will be used to
20157 expand each argument in the TREE_VALUE of t. */
20158 expr
= make_node (EXPR_PACK_EXPANSION
);
20159 PACK_EXPANSION_LOCAL_P (expr
) = true;
20160 PACK_EXPANSION_PARAMETER_PACKS (expr
) =
20161 PACK_EXPANSION_PARAMETER_PACKS (TREE_PURPOSE (t
));
20163 if (TREE_VALUE (t
) == void_type_node
)
20164 /* VOID_TYPE_NODE is used to indicate
20165 value-initialization. */
20167 for (i
= 0; i
< len
; i
++)
20168 TREE_VEC_ELT (expanded_arguments
, i
) = void_type_node
;
20172 /* Substitute parameter packs into each argument in the
20174 in_base_initializer
= 1;
20175 for (arg
= TREE_VALUE (t
); arg
; arg
= TREE_CHAIN (arg
))
20177 tree expanded_exprs
;
20179 /* Expand the argument. */
20180 SET_PACK_EXPANSION_PATTERN (expr
, TREE_VALUE (arg
));
20182 = tsubst_pack_expansion (expr
, argvec
,
20183 tf_warning_or_error
,
20185 if (expanded_exprs
== error_mark_node
)
20188 /* Prepend each of the expanded expressions to the
20189 corresponding TREE_LIST in EXPANDED_ARGUMENTS. */
20190 for (i
= 0; i
< len
; i
++)
20192 TREE_VEC_ELT (expanded_arguments
, i
) =
20193 tree_cons (NULL_TREE
,
20194 TREE_VEC_ELT (expanded_exprs
, i
),
20195 TREE_VEC_ELT (expanded_arguments
, i
));
20198 in_base_initializer
= 0;
20200 /* Reverse all of the TREE_LISTs in EXPANDED_ARGUMENTS,
20201 since we built them backwards. */
20202 for (i
= 0; i
< len
; i
++)
20204 TREE_VEC_ELT (expanded_arguments
, i
) =
20205 nreverse (TREE_VEC_ELT (expanded_arguments
, i
));
20210 for (i
= 0; i
< len
; ++i
)
20212 if (expanded_bases
)
20214 decl
= TREE_VEC_ELT (expanded_bases
, i
);
20215 decl
= expand_member_init (decl
);
20216 init
= TREE_VEC_ELT (expanded_arguments
, i
);
20221 decl
= tsubst_copy (TREE_PURPOSE (t
), argvec
,
20222 tf_warning_or_error
, NULL_TREE
);
20224 decl
= expand_member_init (decl
);
20225 if (decl
&& !DECL_P (decl
))
20226 in_base_initializer
= 1;
20228 init
= TREE_VALUE (t
);
20230 if (init
!= void_type_node
)
20231 init
= tsubst_expr (init
, argvec
,
20232 tf_warning_or_error
, NULL_TREE
,
20233 /*integral_constant_expression_p=*/false);
20234 if (init
== NULL_TREE
&& tmp
!= NULL_TREE
)
20235 /* If we had an initializer but it instantiated to nothing,
20236 value-initialize the object. This will only occur when
20237 the initializer was a pack expansion where the parameter
20238 packs used in that expansion were of length zero. */
20239 init
= void_type_node
;
20240 in_base_initializer
= 0;
20245 init
= build_tree_list (decl
, init
);
20246 TREE_CHAIN (init
) = inits
;
20254 /* Set CURRENT_ACCESS_SPECIFIER based on the protection of DECL. */
20257 set_current_access_from_decl (tree decl
)
20259 if (TREE_PRIVATE (decl
))
20260 current_access_specifier
= access_private_node
;
20261 else if (TREE_PROTECTED (decl
))
20262 current_access_specifier
= access_protected_node
;
20264 current_access_specifier
= access_public_node
;
20267 /* Instantiate an enumerated type. TAG is the template type, NEWTAG
20268 is the instantiation (which should have been created with
20269 start_enum) and ARGS are the template arguments to use. */
20272 tsubst_enum (tree tag
, tree newtag
, tree args
)
20276 if (SCOPED_ENUM_P (newtag
))
20277 begin_scope (sk_scoped_enum
, newtag
);
20279 for (e
= TYPE_VALUES (tag
); e
; e
= TREE_CHAIN (e
))
20284 decl
= TREE_VALUE (e
);
20285 /* Note that in a template enum, the TREE_VALUE is the
20286 CONST_DECL, not the corresponding INTEGER_CST. */
20287 value
= tsubst_expr (DECL_INITIAL (decl
),
20288 args
, tf_warning_or_error
, NULL_TREE
,
20289 /*integral_constant_expression_p=*/true);
20291 /* Give this enumeration constant the correct access. */
20292 set_current_access_from_decl (decl
);
20294 /* Actually build the enumerator itself. */
20296 (DECL_NAME (decl
), value
, newtag
, DECL_SOURCE_LOCATION (decl
));
20299 if (SCOPED_ENUM_P (newtag
))
20302 finish_enum_value_list (newtag
);
20303 finish_enum (newtag
);
20305 DECL_SOURCE_LOCATION (TYPE_NAME (newtag
))
20306 = DECL_SOURCE_LOCATION (TYPE_NAME (tag
));
20309 /* DECL is a FUNCTION_DECL that is a template specialization. Return
20310 its type -- but without substituting the innermost set of template
20311 arguments. So, innermost set of template parameters will appear in
20315 get_mostly_instantiated_function_type (tree decl
)
20323 tmpl
= most_general_template (DECL_TI_TEMPLATE (decl
));
20324 targs
= DECL_TI_ARGS (decl
);
20325 tparms
= DECL_TEMPLATE_PARMS (tmpl
);
20326 parm_depth
= TMPL_PARMS_DEPTH (tparms
);
20328 /* There should be as many levels of arguments as there are levels
20330 gcc_assert (parm_depth
== TMPL_ARGS_DEPTH (targs
));
20332 fn_type
= TREE_TYPE (tmpl
);
20334 if (parm_depth
== 1)
20335 /* No substitution is necessary. */
20342 /* Replace the innermost level of the TARGS with NULL_TREEs to
20343 let tsubst know not to substitute for those parameters. */
20344 partial_args
= make_tree_vec (TREE_VEC_LENGTH (targs
));
20345 for (i
= 1; i
< TMPL_ARGS_DEPTH (targs
); ++i
)
20346 SET_TMPL_ARGS_LEVEL (partial_args
, i
,
20347 TMPL_ARGS_LEVEL (targs
, i
));
20348 SET_TMPL_ARGS_LEVEL (partial_args
,
20349 TMPL_ARGS_DEPTH (targs
),
20350 make_tree_vec (DECL_NTPARMS (tmpl
)));
20352 /* Make sure that we can see identifiers, and compute access
20354 push_access_scope (decl
);
20356 ++processing_template_decl
;
20357 /* Now, do the (partial) substitution to figure out the
20358 appropriate function type. */
20359 fn_type
= tsubst (fn_type
, partial_args
, tf_error
, NULL_TREE
);
20360 --processing_template_decl
;
20362 /* Substitute into the template parameters to obtain the real
20363 innermost set of parameters. This step is important if the
20364 innermost set of template parameters contains value
20365 parameters whose types depend on outer template parameters. */
20366 TREE_VEC_LENGTH (partial_args
)--;
20367 tparms
= tsubst_template_parms (tparms
, partial_args
, tf_error
);
20369 pop_access_scope (decl
);
20375 /* Return truthvalue if we're processing a template different from
20376 the last one involved in diagnostics. */
20378 problematic_instantiation_changed (void)
20380 return current_tinst_level
!= last_error_tinst_level
;
20383 /* Remember current template involved in diagnostics. */
20385 record_last_problematic_instantiation (void)
20387 last_error_tinst_level
= current_tinst_level
;
20390 struct tinst_level
*
20391 current_instantiation (void)
20393 return current_tinst_level
;
20396 /* [temp.param] Check that template non-type parm TYPE is of an allowable
20397 type. Return zero for ok, nonzero for disallowed. Issue error and
20398 warning messages under control of COMPLAIN. */
20401 invalid_nontype_parm_type_p (tree type
, tsubst_flags_t complain
)
20403 if (INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
20405 else if (POINTER_TYPE_P (type
))
20407 else if (TYPE_PTRMEM_P (type
))
20409 else if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
20411 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
20413 else if (TREE_CODE (type
) == DECLTYPE_TYPE
)
20415 else if (TREE_CODE (type
) == NULLPTR_TYPE
)
20418 if (complain
& tf_error
)
20420 if (type
== error_mark_node
)
20421 inform (input_location
, "invalid template non-type parameter");
20423 error ("%q#T is not a valid type for a template non-type parameter",
20429 /* Returns TRUE if TYPE is dependent, in the sense of [temp.dep.type].
20430 Assumes that TYPE really is a type, and not the ERROR_MARK_NODE.*/
20433 dependent_type_p_r (tree type
)
20439 A type is dependent if it is:
20441 -- a template parameter. Template template parameters are types
20442 for us (since TYPE_P holds true for them) so we handle
20444 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
20445 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
)
20447 /* -- a qualified-id with a nested-name-specifier which contains a
20448 class-name that names a dependent type or whose unqualified-id
20449 names a dependent type. */
20450 if (TREE_CODE (type
) == TYPENAME_TYPE
)
20452 /* -- a cv-qualified type where the cv-unqualified type is
20454 type
= TYPE_MAIN_VARIANT (type
);
20455 /* -- a compound type constructed from any dependent type. */
20456 if (TYPE_PTRMEM_P (type
))
20457 return (dependent_type_p (TYPE_PTRMEM_CLASS_TYPE (type
))
20458 || dependent_type_p (TYPE_PTRMEM_POINTED_TO_TYPE
20460 else if (TYPE_PTR_P (type
)
20461 || TREE_CODE (type
) == REFERENCE_TYPE
)
20462 return dependent_type_p (TREE_TYPE (type
));
20463 else if (TREE_CODE (type
) == FUNCTION_TYPE
20464 || TREE_CODE (type
) == METHOD_TYPE
)
20468 if (dependent_type_p (TREE_TYPE (type
)))
20470 for (arg_type
= TYPE_ARG_TYPES (type
);
20472 arg_type
= TREE_CHAIN (arg_type
))
20473 if (dependent_type_p (TREE_VALUE (arg_type
)))
20477 /* -- an array type constructed from any dependent type or whose
20478 size is specified by a constant expression that is
20481 We checked for type- and value-dependence of the bounds in
20482 compute_array_index_type, so TYPE_DEPENDENT_P is already set. */
20483 if (TREE_CODE (type
) == ARRAY_TYPE
)
20485 if (TYPE_DOMAIN (type
)
20486 && dependent_type_p (TYPE_DOMAIN (type
)))
20488 return dependent_type_p (TREE_TYPE (type
));
20491 /* -- a template-id in which either the template name is a template
20493 if (TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
20495 /* ... or any of the template arguments is a dependent type or
20496 an expression that is type-dependent or value-dependent. */
20497 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INFO (type
)
20498 && (any_dependent_template_arguments_p
20499 (INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
)))))
20502 /* All TYPEOF_TYPEs, DECLTYPE_TYPEs, and UNDERLYING_TYPEs are
20503 dependent; if the argument of the `typeof' expression is not
20504 type-dependent, then it should already been have resolved. */
20505 if (TREE_CODE (type
) == TYPEOF_TYPE
20506 || TREE_CODE (type
) == DECLTYPE_TYPE
20507 || TREE_CODE (type
) == UNDERLYING_TYPE
)
20510 /* A template argument pack is dependent if any of its packed
20512 if (TREE_CODE (type
) == TYPE_ARGUMENT_PACK
)
20514 tree args
= ARGUMENT_PACK_ARGS (type
);
20515 int i
, len
= TREE_VEC_LENGTH (args
);
20516 for (i
= 0; i
< len
; ++i
)
20517 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
20521 /* All TYPE_PACK_EXPANSIONs are dependent, because parameter packs must
20522 be template parameters. */
20523 if (TREE_CODE (type
) == TYPE_PACK_EXPANSION
)
20526 /* The standard does not specifically mention types that are local
20527 to template functions or local classes, but they should be
20528 considered dependent too. For example:
20530 template <int I> void f() {
20535 The size of `E' cannot be known until the value of `I' has been
20536 determined. Therefore, `E' must be considered dependent. */
20537 scope
= TYPE_CONTEXT (type
);
20538 if (scope
&& TYPE_P (scope
))
20539 return dependent_type_p (scope
);
20540 /* Don't use type_dependent_expression_p here, as it can lead
20541 to infinite recursion trying to determine whether a lambda
20542 nested in a lambda is dependent (c++/47687). */
20543 else if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
20544 && DECL_LANG_SPECIFIC (scope
)
20545 && DECL_TEMPLATE_INFO (scope
)
20546 && (any_dependent_template_arguments_p
20547 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (scope
)))))
20550 /* Other types are non-dependent. */
20554 /* Returns TRUE if TYPE is dependent, in the sense of
20555 [temp.dep.type]. Note that a NULL type is considered dependent. */
20558 dependent_type_p (tree type
)
20560 /* If there are no template parameters in scope, then there can't be
20561 any dependent types. */
20562 if (!processing_template_decl
)
20564 /* If we are not processing a template, then nobody should be
20565 providing us with a dependent type. */
20567 gcc_assert (TREE_CODE (type
) != TEMPLATE_TYPE_PARM
|| is_auto (type
));
20571 /* If the type is NULL, we have not computed a type for the entity
20572 in question; in that case, the type is dependent. */
20576 /* Erroneous types can be considered non-dependent. */
20577 if (type
== error_mark_node
)
20580 /* If we have not already computed the appropriate value for TYPE,
20582 if (!TYPE_DEPENDENT_P_VALID (type
))
20584 TYPE_DEPENDENT_P (type
) = dependent_type_p_r (type
);
20585 TYPE_DEPENDENT_P_VALID (type
) = 1;
20588 return TYPE_DEPENDENT_P (type
);
20591 /* Returns TRUE if SCOPE is a dependent scope, in which we can't do any
20592 lookup. In other words, a dependent type that is not the current
20596 dependent_scope_p (tree scope
)
20598 return (scope
&& TYPE_P (scope
) && dependent_type_p (scope
)
20599 && !currently_open_class (scope
));
20602 /* T is a SCOPE_REF; return whether we need to consider it
20603 instantiation-dependent so that we can check access at instantiation
20604 time even though we know which member it resolves to. */
20607 instantiation_dependent_scope_ref_p (tree t
)
20609 if (DECL_P (TREE_OPERAND (t
, 1))
20610 && CLASS_TYPE_P (TREE_OPERAND (t
, 0))
20611 && accessible_in_template_p (TREE_OPERAND (t
, 0),
20612 TREE_OPERAND (t
, 1)))
20618 /* Returns TRUE if the EXPRESSION is value-dependent, in the sense of
20619 [temp.dep.constexpr]. EXPRESSION is already known to be a constant
20622 /* Note that this predicate is not appropriate for general expressions;
20623 only constant expressions (that satisfy potential_constant_expression)
20624 can be tested for value dependence. */
20627 value_dependent_expression_p (tree expression
)
20629 if (!processing_template_decl
)
20632 /* A name declared with a dependent type. */
20633 if (DECL_P (expression
) && type_dependent_expression_p (expression
))
20636 switch (TREE_CODE (expression
))
20638 case IDENTIFIER_NODE
:
20639 /* A name that has not been looked up -- must be dependent. */
20642 case TEMPLATE_PARM_INDEX
:
20643 /* A non-type template parm. */
20647 /* A non-type template parm. */
20648 if (DECL_TEMPLATE_PARM_P (expression
))
20650 return value_dependent_expression_p (DECL_INITIAL (expression
));
20653 /* A constant with literal type and is initialized
20654 with an expression that is value-dependent.
20656 Note that a non-dependent parenthesized initializer will have
20657 already been replaced with its constant value, so if we see
20658 a TREE_LIST it must be dependent. */
20659 if (DECL_INITIAL (expression
)
20660 && decl_constant_var_p (expression
)
20661 && (TREE_CODE (DECL_INITIAL (expression
)) == TREE_LIST
20662 || value_dependent_expression_p (DECL_INITIAL (expression
))))
20666 case DYNAMIC_CAST_EXPR
:
20667 case STATIC_CAST_EXPR
:
20668 case CONST_CAST_EXPR
:
20669 case REINTERPRET_CAST_EXPR
:
20671 /* These expressions are value-dependent if the type to which
20672 the cast occurs is dependent or the expression being casted
20673 is value-dependent. */
20675 tree type
= TREE_TYPE (expression
);
20677 if (dependent_type_p (type
))
20680 /* A functional cast has a list of operands. */
20681 expression
= TREE_OPERAND (expression
, 0);
20684 /* If there are no operands, it must be an expression such
20685 as "int()". This should not happen for aggregate types
20686 because it would form non-constant expressions. */
20687 gcc_assert (cxx_dialect
>= cxx11
20688 || INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
20693 if (TREE_CODE (expression
) == TREE_LIST
)
20694 return any_value_dependent_elements_p (expression
);
20696 return value_dependent_expression_p (expression
);
20700 if (SIZEOF_EXPR_TYPE_P (expression
))
20701 return dependent_type_p (TREE_TYPE (TREE_OPERAND (expression
, 0)));
20705 /* A `sizeof' expression is value-dependent if the operand is
20706 type-dependent or is a pack expansion. */
20707 expression
= TREE_OPERAND (expression
, 0);
20708 if (PACK_EXPANSION_P (expression
))
20710 else if (TYPE_P (expression
))
20711 return dependent_type_p (expression
);
20712 return instantiation_dependent_expression_p (expression
);
20714 case AT_ENCODE_EXPR
:
20715 /* An 'encode' expression is value-dependent if the operand is
20717 expression
= TREE_OPERAND (expression
, 0);
20718 return dependent_type_p (expression
);
20720 case NOEXCEPT_EXPR
:
20721 expression
= TREE_OPERAND (expression
, 0);
20722 return instantiation_dependent_expression_p (expression
);
20725 /* All instantiation-dependent expressions should also be considered
20726 value-dependent. */
20727 return instantiation_dependent_scope_ref_p (expression
);
20729 case COMPONENT_REF
:
20730 return (value_dependent_expression_p (TREE_OPERAND (expression
, 0))
20731 || value_dependent_expression_p (TREE_OPERAND (expression
, 1)));
20733 case NONTYPE_ARGUMENT_PACK
:
20734 /* A NONTYPE_ARGUMENT_PACK is value-dependent if any packed argument
20735 is value-dependent. */
20737 tree values
= ARGUMENT_PACK_ARGS (expression
);
20738 int i
, len
= TREE_VEC_LENGTH (values
);
20740 for (i
= 0; i
< len
; ++i
)
20741 if (value_dependent_expression_p (TREE_VEC_ELT (values
, i
)))
20749 tree type2
= TRAIT_EXPR_TYPE2 (expression
);
20750 return (dependent_type_p (TRAIT_EXPR_TYPE1 (expression
))
20751 || (type2
? dependent_type_p (type2
) : false));
20755 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20756 || (value_dependent_expression_p (TREE_OPERAND (expression
, 2))));
20759 return ((value_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20760 || (value_dependent_expression_p (TREE_OPERAND (expression
, 1))));
20764 tree op
= TREE_OPERAND (expression
, 0);
20765 return (value_dependent_expression_p (op
)
20766 || has_value_dependent_address (op
));
20771 tree fn
= get_callee_fndecl (expression
);
20773 if (!fn
&& value_dependent_expression_p (CALL_EXPR_FN (expression
)))
20775 nargs
= call_expr_nargs (expression
);
20776 for (i
= 0; i
< nargs
; ++i
)
20778 tree op
= CALL_EXPR_ARG (expression
, i
);
20779 /* In a call to a constexpr member function, look through the
20780 implicit ADDR_EXPR on the object argument so that it doesn't
20781 cause the call to be considered value-dependent. We also
20782 look through it in potential_constant_expression. */
20783 if (i
== 0 && fn
&& DECL_DECLARED_CONSTEXPR_P (fn
)
20784 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
20785 && TREE_CODE (op
) == ADDR_EXPR
)
20786 op
= TREE_OPERAND (op
, 0);
20787 if (value_dependent_expression_p (op
))
20793 case TEMPLATE_ID_EXPR
:
20794 /* If a TEMPLATE_ID_EXPR involves a dependent name, it will be
20796 return type_dependent_expression_p (expression
);
20802 if (dependent_type_p (TREE_TYPE (expression
)))
20804 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), ix
, val
)
20805 if (value_dependent_expression_p (val
))
20811 /* Treat a GNU statement expression as dependent to avoid crashing
20812 under fold_non_dependent_expr; it can't be constant. */
20816 /* A constant expression is value-dependent if any subexpression is
20817 value-dependent. */
20818 switch (TREE_CODE_CLASS (TREE_CODE (expression
)))
20820 case tcc_reference
:
20822 case tcc_comparison
:
20824 case tcc_expression
:
20827 int i
, len
= cp_tree_operand_length (expression
);
20829 for (i
= 0; i
< len
; i
++)
20831 tree t
= TREE_OPERAND (expression
, i
);
20833 /* In some cases, some of the operands may be missing.l
20834 (For example, in the case of PREDECREMENT_EXPR, the
20835 amount to increment by may be missing.) That doesn't
20836 make the expression dependent. */
20837 if (t
&& value_dependent_expression_p (t
))
20848 /* The expression is not value-dependent. */
20852 /* Returns TRUE if the EXPRESSION is type-dependent, in the sense of
20853 [temp.dep.expr]. Note that an expression with no type is
20854 considered dependent. Other parts of the compiler arrange for an
20855 expression with type-dependent subexpressions to have no type, so
20856 this function doesn't have to be fully recursive. */
20859 type_dependent_expression_p (tree expression
)
20861 if (!processing_template_decl
)
20864 if (expression
== NULL_TREE
|| expression
== error_mark_node
)
20867 /* An unresolved name is always dependent. */
20868 if (identifier_p (expression
) || TREE_CODE (expression
) == USING_DECL
)
20871 /* Some expression forms are never type-dependent. */
20872 if (TREE_CODE (expression
) == PSEUDO_DTOR_EXPR
20873 || TREE_CODE (expression
) == SIZEOF_EXPR
20874 || TREE_CODE (expression
) == ALIGNOF_EXPR
20875 || TREE_CODE (expression
) == AT_ENCODE_EXPR
20876 || TREE_CODE (expression
) == NOEXCEPT_EXPR
20877 || TREE_CODE (expression
) == TRAIT_EXPR
20878 || TREE_CODE (expression
) == TYPEID_EXPR
20879 || TREE_CODE (expression
) == DELETE_EXPR
20880 || TREE_CODE (expression
) == VEC_DELETE_EXPR
20881 || TREE_CODE (expression
) == THROW_EXPR
)
20884 /* The types of these expressions depends only on the type to which
20885 the cast occurs. */
20886 if (TREE_CODE (expression
) == DYNAMIC_CAST_EXPR
20887 || TREE_CODE (expression
) == STATIC_CAST_EXPR
20888 || TREE_CODE (expression
) == CONST_CAST_EXPR
20889 || TREE_CODE (expression
) == REINTERPRET_CAST_EXPR
20890 || TREE_CODE (expression
) == IMPLICIT_CONV_EXPR
20891 || TREE_CODE (expression
) == CAST_EXPR
)
20892 return dependent_type_p (TREE_TYPE (expression
));
20894 /* The types of these expressions depends only on the type created
20895 by the expression. */
20896 if (TREE_CODE (expression
) == NEW_EXPR
20897 || TREE_CODE (expression
) == VEC_NEW_EXPR
)
20899 /* For NEW_EXPR tree nodes created inside a template, either
20900 the object type itself or a TREE_LIST may appear as the
20902 tree type
= TREE_OPERAND (expression
, 1);
20903 if (TREE_CODE (type
) == TREE_LIST
)
20904 /* This is an array type. We need to check array dimensions
20906 return dependent_type_p (TREE_VALUE (TREE_PURPOSE (type
)))
20907 || value_dependent_expression_p
20908 (TREE_OPERAND (TREE_VALUE (type
), 1));
20910 return dependent_type_p (type
);
20913 if (TREE_CODE (expression
) == SCOPE_REF
)
20915 tree scope
= TREE_OPERAND (expression
, 0);
20916 tree name
= TREE_OPERAND (expression
, 1);
20918 /* 14.6.2.2 [temp.dep.expr]: An id-expression is type-dependent if it
20919 contains an identifier associated by name lookup with one or more
20920 declarations declared with a dependent type, or...a
20921 nested-name-specifier or qualified-id that names a member of an
20922 unknown specialization. */
20923 return (type_dependent_expression_p (name
)
20924 || dependent_scope_p (scope
));
20927 if (TREE_CODE (expression
) == FUNCTION_DECL
20928 && DECL_LANG_SPECIFIC (expression
)
20929 && DECL_TEMPLATE_INFO (expression
)
20930 && (any_dependent_template_arguments_p
20931 (INNERMOST_TEMPLATE_ARGS (DECL_TI_ARGS (expression
)))))
20934 if (TREE_CODE (expression
) == TEMPLATE_DECL
20935 && !DECL_TEMPLATE_TEMPLATE_PARM_P (expression
))
20938 if (TREE_CODE (expression
) == STMT_EXPR
)
20939 expression
= stmt_expr_value_expr (expression
);
20941 if (BRACE_ENCLOSED_INITIALIZER_P (expression
))
20946 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expression
), i
, elt
)
20948 if (type_dependent_expression_p (elt
))
20954 /* A static data member of the current instantiation with incomplete
20955 array type is type-dependent, as the definition and specializations
20956 can have different bounds. */
20957 if (VAR_P (expression
)
20958 && DECL_CLASS_SCOPE_P (expression
)
20959 && dependent_type_p (DECL_CONTEXT (expression
))
20960 && VAR_HAD_UNKNOWN_BOUND (expression
))
20963 /* An array of unknown bound depending on a variadic parameter, eg:
20965 template<typename... Args>
20966 void foo (Args... args)
20968 int arr[] = { args... };
20971 template<int... vals>
20974 int arr[] = { vals... };
20977 If the array has no length and has an initializer, it must be that
20978 we couldn't determine its length in cp_complete_array_type because
20979 it is dependent. */
20980 if (VAR_P (expression
)
20981 && TREE_CODE (TREE_TYPE (expression
)) == ARRAY_TYPE
20982 && !TYPE_DOMAIN (TREE_TYPE (expression
))
20983 && DECL_INITIAL (expression
))
20986 if (TREE_TYPE (expression
) == unknown_type_node
)
20988 if (TREE_CODE (expression
) == ADDR_EXPR
)
20989 return type_dependent_expression_p (TREE_OPERAND (expression
, 0));
20990 if (TREE_CODE (expression
) == COMPONENT_REF
20991 || TREE_CODE (expression
) == OFFSET_REF
)
20993 if (type_dependent_expression_p (TREE_OPERAND (expression
, 0)))
20995 expression
= TREE_OPERAND (expression
, 1);
20996 if (identifier_p (expression
))
20999 /* SCOPE_REF with non-null TREE_TYPE is always non-dependent. */
21000 if (TREE_CODE (expression
) == SCOPE_REF
)
21003 /* Always dependent, on the number of arguments if nothing else. */
21004 if (TREE_CODE (expression
) == EXPR_PACK_EXPANSION
)
21007 if (BASELINK_P (expression
))
21009 if (BASELINK_OPTYPE (expression
)
21010 && dependent_type_p (BASELINK_OPTYPE (expression
)))
21012 expression
= BASELINK_FUNCTIONS (expression
);
21015 if (TREE_CODE (expression
) == TEMPLATE_ID_EXPR
)
21017 if (any_dependent_template_arguments_p
21018 (TREE_OPERAND (expression
, 1)))
21020 expression
= TREE_OPERAND (expression
, 0);
21022 gcc_assert (TREE_CODE (expression
) == OVERLOAD
21023 || TREE_CODE (expression
) == FUNCTION_DECL
);
21027 if (type_dependent_expression_p (OVL_CURRENT (expression
)))
21029 expression
= OVL_NEXT (expression
);
21034 gcc_assert (TREE_CODE (expression
) != TYPE_DECL
);
21036 return (dependent_type_p (TREE_TYPE (expression
)));
21039 /* walk_tree callback function for instantiation_dependent_expression_p,
21040 below. Returns non-zero if a dependent subexpression is found. */
21043 instantiation_dependent_r (tree
*tp
, int *walk_subtrees
,
21048 /* We don't have to worry about decltype currently because decltype
21049 of an instantiation-dependent expr is a dependent type. This
21050 might change depending on the resolution of DR 1172. */
21051 *walk_subtrees
= false;
21054 enum tree_code code
= TREE_CODE (*tp
);
21057 /* Don't treat an argument list as dependent just because it has no
21065 /* A constant with a dependent initializer is dependent. */
21066 if (value_dependent_expression_p (*tp
))
21070 case TEMPLATE_PARM_INDEX
:
21073 /* Handle expressions with type operands. */
21077 case AT_ENCODE_EXPR
:
21079 tree op
= TREE_OPERAND (*tp
, 0);
21080 if (code
== SIZEOF_EXPR
&& SIZEOF_EXPR_TYPE_P (*tp
))
21081 op
= TREE_TYPE (op
);
21084 if (dependent_type_p (op
))
21088 *walk_subtrees
= false;
21096 if (dependent_type_p (TRAIT_EXPR_TYPE1 (*tp
))
21097 || (TRAIT_EXPR_TYPE2 (*tp
)
21098 && dependent_type_p (TRAIT_EXPR_TYPE2 (*tp
))))
21100 *walk_subtrees
= false;
21103 case COMPONENT_REF
:
21104 if (identifier_p (TREE_OPERAND (*tp
, 1)))
21105 /* In a template, finish_class_member_access_expr creates a
21106 COMPONENT_REF with an IDENTIFIER_NODE for op1 even if it isn't
21107 type-dependent, so that we can check access control at
21108 instantiation time (PR 42277). See also Core issue 1273. */
21113 if (instantiation_dependent_scope_ref_p (*tp
))
21118 /* Treat statement-expressions as dependent. */
21126 if (type_dependent_expression_p (*tp
))
21132 /* Returns TRUE if the EXPRESSION is instantiation-dependent, in the
21133 sense defined by the ABI:
21135 "An expression is instantiation-dependent if it is type-dependent
21136 or value-dependent, or it has a subexpression that is type-dependent
21137 or value-dependent." */
21140 instantiation_dependent_expression_p (tree expression
)
21144 if (!processing_template_decl
)
21147 if (expression
== error_mark_node
)
21150 result
= cp_walk_tree_without_duplicates (&expression
,
21151 instantiation_dependent_r
, NULL
);
21152 return result
!= NULL_TREE
;
21155 /* Like type_dependent_expression_p, but it also works while not processing
21156 a template definition, i.e. during substitution or mangling. */
21159 type_dependent_expression_p_push (tree expr
)
21162 ++processing_template_decl
;
21163 b
= type_dependent_expression_p (expr
);
21164 --processing_template_decl
;
21168 /* Returns TRUE if ARGS contains a type-dependent expression. */
21171 any_type_dependent_arguments_p (const vec
<tree
, va_gc
> *args
)
21176 FOR_EACH_VEC_SAFE_ELT (args
, i
, arg
)
21178 if (type_dependent_expression_p (arg
))
21184 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21185 expressions) contains any type-dependent expressions. */
21188 any_type_dependent_elements_p (const_tree list
)
21190 for (; list
; list
= TREE_CHAIN (list
))
21191 if (type_dependent_expression_p (TREE_VALUE (list
)))
21197 /* Returns TRUE if LIST (a TREE_LIST whose TREE_VALUEs are
21198 expressions) contains any value-dependent expressions. */
21201 any_value_dependent_elements_p (const_tree list
)
21203 for (; list
; list
= TREE_CHAIN (list
))
21204 if (value_dependent_expression_p (TREE_VALUE (list
)))
21210 /* Returns TRUE if the ARG (a template argument) is dependent. */
21213 dependent_template_arg_p (tree arg
)
21215 if (!processing_template_decl
)
21218 /* Assume a template argument that was wrongly written by the user
21219 is dependent. This is consistent with what
21220 any_dependent_template_arguments_p [that calls this function]
21222 if (!arg
|| arg
== error_mark_node
)
21225 if (TREE_CODE (arg
) == ARGUMENT_PACK_SELECT
)
21226 arg
= ARGUMENT_PACK_SELECT_ARG (arg
);
21228 if (TREE_CODE (arg
) == TEMPLATE_DECL
21229 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
21230 return dependent_template_p (arg
);
21231 else if (ARGUMENT_PACK_P (arg
))
21233 tree args
= ARGUMENT_PACK_ARGS (arg
);
21234 int i
, len
= TREE_VEC_LENGTH (args
);
21235 for (i
= 0; i
< len
; ++i
)
21237 if (dependent_template_arg_p (TREE_VEC_ELT (args
, i
)))
21243 else if (TYPE_P (arg
))
21244 return dependent_type_p (arg
);
21246 return (type_dependent_expression_p (arg
)
21247 || value_dependent_expression_p (arg
));
21250 /* Returns true if ARGS (a collection of template arguments) contains
21251 any types that require structural equality testing. */
21254 any_template_arguments_need_structural_equality_p (tree args
)
21261 if (args
== error_mark_node
)
21264 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21266 tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21267 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21269 tree arg
= TREE_VEC_ELT (level
, j
);
21270 tree packed_args
= NULL_TREE
;
21273 if (ARGUMENT_PACK_P (arg
))
21275 /* Look inside the argument pack. */
21276 packed_args
= ARGUMENT_PACK_ARGS (arg
);
21277 len
= TREE_VEC_LENGTH (packed_args
);
21280 for (k
= 0; k
< len
; ++k
)
21283 arg
= TREE_VEC_ELT (packed_args
, k
);
21285 if (error_operand_p (arg
))
21287 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
21289 else if (TYPE_P (arg
) && TYPE_STRUCTURAL_EQUALITY_P (arg
))
21291 else if (!TYPE_P (arg
) && TREE_TYPE (arg
)
21292 && TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (arg
)))
21301 /* Returns true if ARGS (a collection of template arguments) contains
21302 any dependent arguments. */
21305 any_dependent_template_arguments_p (const_tree args
)
21312 if (args
== error_mark_node
)
21315 for (i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
21317 const_tree level
= TMPL_ARGS_LEVEL (args
, i
+ 1);
21318 for (j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
21319 if (dependent_template_arg_p (TREE_VEC_ELT (level
, j
)))
21326 /* Returns TRUE if the template TMPL is dependent. */
21329 dependent_template_p (tree tmpl
)
21331 if (TREE_CODE (tmpl
) == OVERLOAD
)
21335 if (dependent_template_p (OVL_CURRENT (tmpl
)))
21337 tmpl
= OVL_NEXT (tmpl
);
21342 /* Template template parameters are dependent. */
21343 if (DECL_TEMPLATE_TEMPLATE_PARM_P (tmpl
)
21344 || TREE_CODE (tmpl
) == TEMPLATE_TEMPLATE_PARM
)
21346 /* So are names that have not been looked up. */
21347 if (TREE_CODE (tmpl
) == SCOPE_REF
|| identifier_p (tmpl
))
21349 /* So are member templates of dependent classes. */
21350 if (TYPE_P (CP_DECL_CONTEXT (tmpl
)))
21351 return dependent_type_p (DECL_CONTEXT (tmpl
));
21355 /* Returns TRUE if the specialization TMPL<ARGS> is dependent. */
21358 dependent_template_id_p (tree tmpl
, tree args
)
21360 return (dependent_template_p (tmpl
)
21361 || any_dependent_template_arguments_p (args
));
21364 /* Returns TRUE if OMP_FOR with DECLV, INITV, CONDV and INCRV vectors
21368 dependent_omp_for_p (tree declv
, tree initv
, tree condv
, tree incrv
)
21372 if (!processing_template_decl
)
21375 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
21377 tree decl
= TREE_VEC_ELT (declv
, i
);
21378 tree init
= TREE_VEC_ELT (initv
, i
);
21379 tree cond
= TREE_VEC_ELT (condv
, i
);
21380 tree incr
= TREE_VEC_ELT (incrv
, i
);
21382 if (type_dependent_expression_p (decl
))
21385 if (init
&& type_dependent_expression_p (init
))
21388 if (type_dependent_expression_p (cond
))
21391 if (COMPARISON_CLASS_P (cond
)
21392 && (type_dependent_expression_p (TREE_OPERAND (cond
, 0))
21393 || type_dependent_expression_p (TREE_OPERAND (cond
, 1))))
21396 if (TREE_CODE (incr
) == MODOP_EXPR
)
21398 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0))
21399 || type_dependent_expression_p (TREE_OPERAND (incr
, 2)))
21402 else if (type_dependent_expression_p (incr
))
21404 else if (TREE_CODE (incr
) == MODIFY_EXPR
)
21406 if (type_dependent_expression_p (TREE_OPERAND (incr
, 0)))
21408 else if (BINARY_CLASS_P (TREE_OPERAND (incr
, 1)))
21410 tree t
= TREE_OPERAND (incr
, 1);
21411 if (type_dependent_expression_p (TREE_OPERAND (t
, 0))
21412 || type_dependent_expression_p (TREE_OPERAND (t
, 1)))
21421 /* TYPE is a TYPENAME_TYPE. Returns the ordinary TYPE to which the
21422 TYPENAME_TYPE corresponds. Returns the original TYPENAME_TYPE if
21423 no such TYPE can be found. Note that this function peers inside
21424 uninstantiated templates and therefore should be used only in
21425 extremely limited situations. ONLY_CURRENT_P restricts this
21426 peering to the currently open classes hierarchy (which is required
21427 when comparing types). */
21430 resolve_typename_type (tree type
, bool only_current_p
)
21439 gcc_assert (TREE_CODE (type
) == TYPENAME_TYPE
);
21441 scope
= TYPE_CONTEXT (type
);
21442 /* Usually the non-qualified identifier of a TYPENAME_TYPE is
21443 TYPE_IDENTIFIER (type). But when 'type' is a typedef variant of
21444 a TYPENAME_TYPE node, then TYPE_NAME (type) is set to the TYPE_DECL representing
21445 the typedef. In that case TYPE_IDENTIFIER (type) is not the non-qualified
21446 identifier of the TYPENAME_TYPE anymore.
21447 So by getting the TYPE_IDENTIFIER of the _main declaration_ of the
21448 TYPENAME_TYPE instead, we avoid messing up with a possible
21449 typedef variant case. */
21450 name
= TYPE_IDENTIFIER (TYPE_MAIN_VARIANT (type
));
21452 /* If the SCOPE is itself a TYPENAME_TYPE, then we need to resolve
21453 it first before we can figure out what NAME refers to. */
21454 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21456 if (TYPENAME_IS_RESOLVING_P (scope
))
21457 /* Given a class template A with a dependent base with nested type C,
21458 typedef typename A::C::C C will land us here, as trying to resolve
21459 the initial A::C leads to the local C typedef, which leads back to
21460 A::C::C. So we break the recursion now. */
21463 scope
= resolve_typename_type (scope
, only_current_p
);
21465 /* If we don't know what SCOPE refers to, then we cannot resolve the
21467 if (TREE_CODE (scope
) == TYPENAME_TYPE
)
21469 /* If the SCOPE is a template type parameter, we have no way of
21470 resolving the name. */
21471 if (TREE_CODE (scope
) == TEMPLATE_TYPE_PARM
)
21473 /* If the SCOPE is not the current instantiation, there's no reason
21474 to look inside it. */
21475 if (only_current_p
&& !currently_open_class (scope
))
21477 /* If this is a typedef, we don't want to look inside (c++/11987). */
21478 if (typedef_variant_p (type
))
21480 /* If SCOPE isn't the template itself, it will not have a valid
21481 TYPE_FIELDS list. */
21482 if (same_type_p (scope
, CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
)))
21483 /* scope is either the template itself or a compatible instantiation
21484 like X<T>, so look up the name in the original template. */
21485 scope
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (scope
);
21487 /* scope is a partial instantiation, so we can't do the lookup or we
21488 will lose the template arguments. */
21490 /* Enter the SCOPE so that name lookup will be resolved as if we
21491 were in the class definition. In particular, SCOPE will no
21492 longer be considered a dependent type. */
21493 pushed_scope
= push_scope (scope
);
21494 /* Look up the declaration. */
21495 decl
= lookup_member (scope
, name
, /*protect=*/0, /*want_type=*/true,
21496 tf_warning_or_error
);
21498 result
= NULL_TREE
;
21500 /* For a TYPENAME_TYPE like "typename X::template Y<T>", we want to
21501 find a TEMPLATE_DECL. Otherwise, we want to find a TYPE_DECL. */
21504 else if (identifier_p (TYPENAME_TYPE_FULLNAME (type
))
21505 && TREE_CODE (decl
) == TYPE_DECL
)
21507 result
= TREE_TYPE (decl
);
21508 if (result
== error_mark_node
)
21509 result
= NULL_TREE
;
21511 else if (TREE_CODE (TYPENAME_TYPE_FULLNAME (type
)) == TEMPLATE_ID_EXPR
21512 && DECL_CLASS_TEMPLATE_P (decl
))
21516 /* Obtain the template and the arguments. */
21517 tmpl
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 0);
21518 args
= TREE_OPERAND (TYPENAME_TYPE_FULLNAME (type
), 1);
21519 /* Instantiate the template. */
21520 result
= lookup_template_class (tmpl
, args
, NULL_TREE
, NULL_TREE
,
21521 /*entering_scope=*/0,
21522 tf_error
| tf_user
);
21523 if (result
== error_mark_node
)
21524 result
= NULL_TREE
;
21527 /* Leave the SCOPE. */
21529 pop_scope (pushed_scope
);
21531 /* If we failed to resolve it, return the original typename. */
21535 /* If lookup found a typename type, resolve that too. */
21536 if (TREE_CODE (result
) == TYPENAME_TYPE
&& !TYPENAME_IS_RESOLVING_P (result
))
21538 /* Ill-formed programs can cause infinite recursion here, so we
21539 must catch that. */
21540 TYPENAME_IS_RESOLVING_P (type
) = 1;
21541 result
= resolve_typename_type (result
, only_current_p
);
21542 TYPENAME_IS_RESOLVING_P (type
) = 0;
21545 /* Qualify the resulting type. */
21546 quals
= cp_type_quals (type
);
21548 result
= cp_build_qualified_type (result
, cp_type_quals (result
) | quals
);
21553 /* EXPR is an expression which is not type-dependent. Return a proxy
21554 for EXPR that can be used to compute the types of larger
21555 expressions containing EXPR. */
21558 build_non_dependent_expr (tree expr
)
21562 #ifdef ENABLE_CHECKING
21563 /* Try to get a constant value for all non-dependent expressions in
21564 order to expose bugs in *_dependent_expression_p and constexpr. */
21565 if (cxx_dialect
>= cxx11
)
21566 maybe_constant_value (fold_non_dependent_expr_sfinae (expr
, tf_none
));
21569 /* Preserve OVERLOADs; the functions must be available to resolve
21572 if (TREE_CODE (inner_expr
) == STMT_EXPR
)
21573 inner_expr
= stmt_expr_value_expr (inner_expr
);
21574 if (TREE_CODE (inner_expr
) == ADDR_EXPR
)
21575 inner_expr
= TREE_OPERAND (inner_expr
, 0);
21576 if (TREE_CODE (inner_expr
) == COMPONENT_REF
)
21577 inner_expr
= TREE_OPERAND (inner_expr
, 1);
21578 if (is_overloaded_fn (inner_expr
)
21579 || TREE_CODE (inner_expr
) == OFFSET_REF
)
21581 /* There is no need to return a proxy for a variable. */
21584 /* Preserve string constants; conversions from string constants to
21585 "char *" are allowed, even though normally a "const char *"
21586 cannot be used to initialize a "char *". */
21587 if (TREE_CODE (expr
) == STRING_CST
)
21589 /* Preserve arithmetic constants, as an optimization -- there is no
21590 reason to create a new node. */
21591 if (TREE_CODE (expr
) == INTEGER_CST
|| TREE_CODE (expr
) == REAL_CST
)
21593 /* Preserve THROW_EXPRs -- all throw-expressions have type "void".
21594 There is at least one place where we want to know that a
21595 particular expression is a throw-expression: when checking a ?:
21596 expression, there are special rules if the second or third
21597 argument is a throw-expression. */
21598 if (TREE_CODE (expr
) == THROW_EXPR
)
21601 /* Don't wrap an initializer list, we need to be able to look inside. */
21602 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
21605 /* Don't wrap a dummy object, we need to be able to test for it. */
21606 if (is_dummy_object (expr
))
21609 if (TREE_CODE (expr
) == COND_EXPR
)
21610 return build3 (COND_EXPR
,
21612 TREE_OPERAND (expr
, 0),
21613 (TREE_OPERAND (expr
, 1)
21614 ? build_non_dependent_expr (TREE_OPERAND (expr
, 1))
21615 : build_non_dependent_expr (TREE_OPERAND (expr
, 0))),
21616 build_non_dependent_expr (TREE_OPERAND (expr
, 2)));
21617 if (TREE_CODE (expr
) == COMPOUND_EXPR
21618 && !COMPOUND_EXPR_OVERLOADED (expr
))
21619 return build2 (COMPOUND_EXPR
,
21621 TREE_OPERAND (expr
, 0),
21622 build_non_dependent_expr (TREE_OPERAND (expr
, 1)));
21624 /* If the type is unknown, it can't really be non-dependent */
21625 gcc_assert (TREE_TYPE (expr
) != unknown_type_node
);
21627 /* Otherwise, build a NON_DEPENDENT_EXPR. */
21628 return build1 (NON_DEPENDENT_EXPR
, TREE_TYPE (expr
), expr
);
21631 /* ARGS is a vector of expressions as arguments to a function call.
21632 Replace the arguments with equivalent non-dependent expressions.
21633 This modifies ARGS in place. */
21636 make_args_non_dependent (vec
<tree
, va_gc
> *args
)
21641 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
21643 tree newarg
= build_non_dependent_expr (arg
);
21645 (*args
)[ix
] = newarg
;
21649 /* Returns a type which represents 'auto' or 'decltype(auto)'. We use a
21650 TEMPLATE_TYPE_PARM with a level one deeper than the actual template
21654 make_auto_1 (tree name
)
21656 tree au
= cxx_make_type (TEMPLATE_TYPE_PARM
);
21657 TYPE_NAME (au
) = build_decl (input_location
,
21658 TYPE_DECL
, name
, au
);
21659 TYPE_STUB_DECL (au
) = TYPE_NAME (au
);
21660 TEMPLATE_TYPE_PARM_INDEX (au
) = build_template_parm_index
21661 (0, processing_template_decl
+ 1, processing_template_decl
+ 1,
21662 TYPE_NAME (au
), NULL_TREE
);
21663 TYPE_CANONICAL (au
) = canonical_type_parameter (au
);
21664 DECL_ARTIFICIAL (TYPE_NAME (au
)) = 1;
21665 SET_DECL_TEMPLATE_PARM_P (TYPE_NAME (au
));
21671 make_decltype_auto (void)
21673 return make_auto_1 (get_identifier ("decltype(auto)"));
21679 return make_auto_1 (get_identifier ("auto"));
21682 /* Given type ARG, return std::initializer_list<ARG>. */
21687 tree std_init_list
= namespace_binding
21688 (get_identifier ("initializer_list"), std_node
);
21690 if (!std_init_list
|| !DECL_CLASS_TEMPLATE_P (std_init_list
))
21692 error ("deducing from brace-enclosed initializer list requires "
21693 "#include <initializer_list>");
21694 return error_mark_node
;
21696 argvec
= make_tree_vec (1);
21697 TREE_VEC_ELT (argvec
, 0) = arg
;
21698 return lookup_template_class (std_init_list
, argvec
, NULL_TREE
,
21699 NULL_TREE
, 0, tf_warning_or_error
);
21702 /* Replace auto in TYPE with std::initializer_list<auto>. */
21705 listify_autos (tree type
, tree auto_node
)
21707 tree init_auto
= listify (auto_node
);
21708 tree argvec
= make_tree_vec (1);
21709 TREE_VEC_ELT (argvec
, 0) = init_auto
;
21710 if (processing_template_decl
)
21711 argvec
= add_to_template_args (current_template_args (), argvec
);
21712 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21715 /* Replace occurrences of 'auto' in TYPE with the appropriate type deduced
21716 from INIT. AUTO_NODE is the TEMPLATE_TYPE_PARM used for 'auto' in TYPE. */
21719 do_auto_deduction (tree type
, tree init
, tree auto_node
)
21723 if (init
== error_mark_node
)
21724 return error_mark_node
;
21726 if (type_dependent_expression_p (init
))
21727 /* Defining a subset of type-dependent expressions that we can deduce
21728 from ahead of time isn't worth the trouble. */
21731 /* [dcl.spec.auto]: Obtain P from T by replacing the occurrences of auto
21732 with either a new invented type template parameter U or, if the
21733 initializer is a braced-init-list (8.5.4), with
21734 std::initializer_list<U>. */
21735 if (BRACE_ENCLOSED_INITIALIZER_P (init
))
21736 type
= listify_autos (type
, auto_node
);
21738 init
= resolve_nondeduced_context (init
);
21740 targs
= make_tree_vec (1);
21741 if (AUTO_IS_DECLTYPE (auto_node
))
21743 bool id
= (DECL_P (init
) || (TREE_CODE (init
) == COMPONENT_REF
21744 && !REF_PARENTHESIZED_P (init
)));
21745 TREE_VEC_ELT (targs
, 0)
21746 = finish_decltype_type (init
, id
, tf_warning_or_error
);
21747 if (type
!= auto_node
)
21749 error ("%qT as type rather than plain %<decltype(auto)%>", type
);
21750 return error_mark_node
;
21755 tree parms
= build_tree_list (NULL_TREE
, type
);
21756 tree tparms
= make_tree_vec (1);
21759 TREE_VEC_ELT (tparms
, 0)
21760 = build_tree_list (NULL_TREE
, TYPE_NAME (auto_node
));
21761 val
= type_unification_real (tparms
, targs
, parms
, &init
, 1, 0,
21762 DEDUCE_CALL
, LOOKUP_NORMAL
,
21763 NULL
, /*explain_p=*/false);
21766 if (processing_template_decl
)
21767 /* Try again at instantiation time. */
21769 if (type
&& type
!= error_mark_node
)
21770 /* If type is error_mark_node a diagnostic must have been
21771 emitted by now. Also, having a mention to '<type error>'
21772 in the diagnostic is not really useful to the user. */
21774 if (cfun
&& auto_node
== current_function_auto_return_pattern
21775 && LAMBDA_FUNCTION_P (current_function_decl
))
21776 error ("unable to deduce lambda return type from %qE", init
);
21778 error ("unable to deduce %qT from %qE", type
, init
);
21780 return error_mark_node
;
21784 /* If the list of declarators contains more than one declarator, the type
21785 of each declared variable is determined as described above. If the
21786 type deduced for the template parameter U is not the same in each
21787 deduction, the program is ill-formed. */
21788 if (TREE_TYPE (auto_node
)
21789 && !same_type_p (TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0)))
21791 if (cfun
&& auto_node
== current_function_auto_return_pattern
21792 && LAMBDA_FUNCTION_P (current_function_decl
))
21793 error ("inconsistent types %qT and %qT deduced for "
21794 "lambda return type", TREE_TYPE (auto_node
),
21795 TREE_VEC_ELT (targs
, 0));
21797 error ("inconsistent deduction for %qT: %qT and then %qT",
21798 auto_node
, TREE_TYPE (auto_node
), TREE_VEC_ELT (targs
, 0));
21799 return error_mark_node
;
21801 TREE_TYPE (auto_node
) = TREE_VEC_ELT (targs
, 0);
21803 if (processing_template_decl
)
21804 targs
= add_to_template_args (current_template_args (), targs
);
21805 return tsubst (type
, targs
, tf_warning_or_error
, NULL_TREE
);
21808 /* Substitutes LATE_RETURN_TYPE for 'auto' in TYPE and returns the
21812 splice_late_return_type (tree type
, tree late_return_type
)
21816 if (late_return_type
== NULL_TREE
)
21818 argvec
= make_tree_vec (1);
21819 TREE_VEC_ELT (argvec
, 0) = late_return_type
;
21820 if (processing_template_parmlist
)
21821 /* For a late-specified return type in a template type-parameter, we
21822 need to add a dummy argument level for its parmlist. */
21823 argvec
= add_to_template_args
21824 (make_tree_vec (processing_template_parmlist
), argvec
);
21825 if (current_template_parms
)
21826 argvec
= add_to_template_args (current_template_args (), argvec
);
21827 return tsubst (type
, argvec
, tf_warning_or_error
, NULL_TREE
);
21830 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto' or
21831 'decltype(auto)'. */
21834 is_auto (const_tree type
)
21836 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
21837 && (TYPE_IDENTIFIER (type
) == get_identifier ("auto")
21838 || TYPE_IDENTIFIER (type
) == get_identifier ("decltype(auto)")))
21844 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing `auto' iff TYPE contains
21845 a use of `auto'. Returns NULL_TREE otherwise. */
21848 type_uses_auto (tree type
)
21850 return find_type_usage (type
, is_auto
);
21853 /* Returns true iff TYPE is a TEMPLATE_TYPE_PARM representing 'auto',
21854 'decltype(auto)' or a concept. */
21857 is_auto_or_concept (const_tree type
)
21859 return is_auto (type
); // or concept
21862 /* Returns the TEMPLATE_TYPE_PARM in TYPE representing a generic type (`auto' or
21863 a concept identifier) iff TYPE contains a use of a generic type. Returns
21864 NULL_TREE otherwise. */
21867 type_uses_auto_or_concept (tree type
)
21869 return find_type_usage (type
, is_auto_or_concept
);
21873 /* For a given template T, return the vector of typedefs referenced
21874 in T for which access check is needed at T instantiation time.
21875 T is either a FUNCTION_DECL or a RECORD_TYPE.
21876 Those typedefs were added to T by the function
21877 append_type_to_template_for_access_check. */
21879 vec
<qualified_typedef_usage_t
, va_gc
> *
21880 get_types_needing_access_check (tree t
)
21883 vec
<qualified_typedef_usage_t
, va_gc
> *result
= NULL
;
21885 if (!t
|| t
== error_mark_node
)
21888 if (!(ti
= get_template_info (t
)))
21891 if (CLASS_TYPE_P (t
)
21892 || TREE_CODE (t
) == FUNCTION_DECL
)
21894 if (!TI_TEMPLATE (ti
))
21897 result
= TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
);
21903 /* Append the typedef TYPE_DECL used in template T to a list of typedefs
21904 tied to T. That list of typedefs will be access checked at
21905 T instantiation time.
21906 T is either a FUNCTION_DECL or a RECORD_TYPE.
21907 TYPE_DECL is a TYPE_DECL node representing a typedef.
21908 SCOPE is the scope through which TYPE_DECL is accessed.
21909 LOCATION is the location of the usage point of TYPE_DECL.
21911 This function is a subroutine of
21912 append_type_to_template_for_access_check. */
21915 append_type_to_template_for_access_check_1 (tree t
,
21918 location_t location
)
21920 qualified_typedef_usage_t typedef_usage
;
21923 if (!t
|| t
== error_mark_node
)
21926 gcc_assert ((TREE_CODE (t
) == FUNCTION_DECL
21927 || CLASS_TYPE_P (t
))
21929 && TREE_CODE (type_decl
) == TYPE_DECL
21932 if (!(ti
= get_template_info (t
)))
21935 gcc_assert (TI_TEMPLATE (ti
));
21937 typedef_usage
.typedef_decl
= type_decl
;
21938 typedef_usage
.context
= scope
;
21939 typedef_usage
.locus
= location
;
21941 vec_safe_push (TI_TYPEDEFS_NEEDING_ACCESS_CHECKING (ti
), typedef_usage
);
21944 /* Append TYPE_DECL to the template TEMPL.
21945 TEMPL is either a class type, a FUNCTION_DECL or a a TEMPLATE_DECL.
21946 At TEMPL instanciation time, TYPE_DECL will be checked to see
21947 if it can be accessed through SCOPE.
21948 LOCATION is the location of the usage point of TYPE_DECL.
21950 e.g. consider the following code snippet:
21957 template<class U> struct S
21959 C::myint mi; // <-- usage point of the typedef C::myint
21964 At S<char> instantiation time, we need to check the access of C::myint
21965 In other words, we need to check the access of the myint typedef through
21966 the C scope. For that purpose, this function will add the myint typedef
21967 and the scope C through which its being accessed to a list of typedefs
21968 tied to the template S. That list will be walked at template instantiation
21969 time and access check performed on each typedefs it contains.
21970 Note that this particular code snippet should yield an error because
21971 myint is private to C. */
21974 append_type_to_template_for_access_check (tree templ
,
21977 location_t location
)
21979 qualified_typedef_usage_t
*iter
;
21982 gcc_assert (type_decl
&& (TREE_CODE (type_decl
) == TYPE_DECL
));
21984 /* Make sure we don't append the type to the template twice. */
21985 FOR_EACH_VEC_SAFE_ELT (get_types_needing_access_check (templ
), i
, iter
)
21986 if (iter
->typedef_decl
== type_decl
&& scope
== iter
->context
)
21989 append_type_to_template_for_access_check_1 (templ
, type_decl
,
21993 /* Convert the generic type parameters in PARM that match the types given in the
21994 range [START_IDX, END_IDX) from the current_template_parms into generic type
21998 convert_generic_types_to_packs (tree parm
, int start_idx
, int end_idx
)
22000 tree current
= current_template_parms
;
22001 int depth
= TMPL_PARMS_DEPTH (current
);
22002 current
= INNERMOST_TEMPLATE_PARMS (current
);
22003 tree replacement
= make_tree_vec (TREE_VEC_LENGTH (current
));
22005 for (int i
= 0; i
< start_idx
; ++i
)
22006 TREE_VEC_ELT (replacement
, i
)
22007 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22009 for (int i
= start_idx
; i
< end_idx
; ++i
)
22011 /* Create a distinct parameter pack type from the current parm and add it
22012 to the replacement args to tsubst below into the generic function
22015 tree o
= TREE_TYPE (TREE_VALUE
22016 (TREE_VEC_ELT (current
, i
)));
22017 tree t
= copy_type (o
);
22018 TEMPLATE_TYPE_PARM_INDEX (t
)
22019 = reduce_template_parm_level (TEMPLATE_TYPE_PARM_INDEX (o
),
22021 TREE_TYPE (TEMPLATE_TYPE_DECL (t
)) = t
;
22022 TYPE_STUB_DECL (t
) = TYPE_NAME (t
) = TEMPLATE_TYPE_DECL (t
);
22023 TYPE_MAIN_VARIANT (t
) = t
;
22024 TEMPLATE_TYPE_PARAMETER_PACK (t
) = true;
22025 TYPE_CANONICAL (t
) = canonical_type_parameter (t
);
22026 TREE_VEC_ELT (replacement
, i
) = t
;
22027 TREE_VALUE (TREE_VEC_ELT (current
, i
)) = TREE_CHAIN (t
);
22030 for (int i
= end_idx
, e
= TREE_VEC_LENGTH (current
); i
< e
; ++i
)
22031 TREE_VEC_ELT (replacement
, i
)
22032 = TREE_TYPE (TREE_VALUE (TREE_VEC_ELT (current
, i
)));
22034 /* If there are more levels then build up the replacement with the outer
22037 replacement
= add_to_template_args (template_parms_to_args
22038 (TREE_CHAIN (current_template_parms
)),
22041 return tsubst (parm
, replacement
, tf_none
, NULL_TREE
);
22045 /* Set up the hash tables for template instantiations. */
22048 init_template_processing (void)
22050 decl_specializations
= htab_create_ggc (37,
22051 hash_specialization
,
22052 eq_specializations
,
22054 type_specializations
= htab_create_ggc (37,
22055 hash_specialization
,
22056 eq_specializations
,
22060 /* Print stats about the template hash tables for -fstats. */
22063 print_template_statistics (void)
22065 fprintf (stderr
, "decl_specializations: size %ld, %ld elements, "
22066 "%f collisions\n", (long) htab_size (decl_specializations
),
22067 (long) htab_elements (decl_specializations
),
22068 htab_collisions (decl_specializations
));
22069 fprintf (stderr
, "type_specializations: size %ld, %ld elements, "
22070 "%f collisions\n", (long) htab_size (type_specializations
),
22071 (long) htab_elements (type_specializations
),
22072 htab_collisions (type_specializations
));
22075 #include "gt-cp-pt.h"